Sebastian Altmeyer, Liliana Cucu-grosjean, Robert I. Davis et al. · 2015
Real-time systems such as those deployed in space, aerospace, automotive and railway applications require guar-antees that the probability of the system failing to meet its timing constraints is below an acceptable threshold (e.g. a failure rate of less than 10−9 per hour). Advances in hardware technology and the large gap between processor and memory speeds, bridged by the use of cache, make it difficult to provide such guarantees without significant over-provisioning of hardware resources. The use of deterministic cache replacement policies means that pathological worst-case behaviours need to be accounted for, even when in practice they may have a vanishingly small probability of actually occurring. The use of cache with random replacement policies [3] can negate the effects of pathological worst-case behaviours while still achieving efficient average-case performance, hence providing a way of increasing guaranteed performance in hard real-time systems. The timing behaviour of programs running on a processor with a random cache replacement policy can be determined using Static Probabilistic Timing Analysis (SPTA). SPTA computes an upper bound on the probabilistic Worst-Case Execution Time (pWCET) in terms of an exceedence function, which gives the probability, as a function of all possible values for an execution time budget x, that the execution time of the program will not exceed that budget on any single run. SPTA [5] requires a probability function that can be used to compute an estimate of the probability of a cache hit for each memory access. This probability function is valid if it provides a lower bound on the probability of a cache hit. As shown last year at RTSOPS 2013 [4], the only valid cache-hit probability known by then is given as follows: P̂D(k) =
Cited by 0
Lingula Reevii, Montipora Dilatata, In Kane’ohe Bay et al. · 2013
as a species that is not being considered actively for listing under the Endangered Species Act (ESA) but for which significant concerns or uncertainties regarding its biological status and/or threats exist (69 FR 19975). The purpose of the NMFS SOC Program is to conduct proactive conservation activities to preclude the listing of future species, rather than addressing the recovery needs of a species listed. Two of the Pacific Islands Region Species of Concern are the inarticulated brachiopod, Lingula reevii, and the Hawaiian reef coral, Montipora dilatata. There are twelve extant species of Lingula and most are limited to tropical and subtropical waters of the Indo-West Pacific (Hyman 1959). L. reevii is a filter feeding inarticulated brachiopod that can be identified by three small holes in the sediment, formed when the animal extends its lophophore with three siphon holes for feeding and respiration (see report cover photo). L. reevii was recently identified as a “species of concern ” (Federal Register, 2004). This species is considered to be at risk due to habitat degradation and alteration, over-exploitation, pollution, sedimentation, vulnerable life history, and/or limited distribution (NOAA, 2007).
Cited by 0
Valerie Slaughter Brown · 2017
Cited by 0
Al J J, R Prolessor, Comfnittee Merriber et al. · 1970
Cited by 0
Mahadevappa Mahesh, James M. Hevezi · 2014
Cited by 0
Tarun Chitra · 2011
We briefly summarize the mathematical and physical motivation for the Anti-de-Sitter Space/Conformal Field Theory (AdS/CFT) Correspondence and its relationship to the construct of an infinite family of 5-dimensional Sasaki-Einstein Manifolds. A statement of the (thesis) problem at hand is then described. 1
Cited by 0
Graduate Committees, Clement Cordell Parker, B. S. In · 1970
Cited by 0
Chinenye Egbuna Ikwuemesi · OSF Preprints (OSF Preprints) · 2026
Cited by 0
Debajyoti Mukhopadhyay, Archana Chougule, Sheetal Vij · 2023
Cited by 1
Nader Engheta · 2015
In this work, it is shown that Foster’s reactance theorem is satisfied for a one-port termination filled with lossless metamaterials with negative real permittivity and permeability. However, when the reactive input impedance of such a termination is compared with that of its counterpart filled with conventional lossless materials, it is found that the two reactances may have opposite signs. So if a one-port termination filled with lossless dielectric with positive permittivity and permeability possesses inductive input reactance, when the same termination is filled instead with a lossless material with negative real permittivity and permeability, its input reactance may be capacitive.
Cited by 0
Sapuan Noraina Mazuin · 2021
Cited by 0
Tito Vignoli · 2011
Cited by 0
Marc Blanchet · 2010
Using Unicode codepoints in protocol strings requires preparation of
the string. Internationalized Domain Names(idn) initial work defined
and used Stringprep and Nameprep. Other protocols have defined
Stringprep profiles. A new approach different from Stringprep/
Nameprep is used for a revision of IDN. The Stringprep profiles need
to be updated or a replacement of Stringprep need to be designed. This
document summarizes the findings of the current usage of Stringprep
and identifies directions for a new Stringprep replacement protocol.
Cited by 0
Amal Kumar Banerjee · 2019
Cited by 0
Brenda D. Smith, Ph. D · 2014
problem of"foster care drift " by instituting changes in child welfare policy and practice. The Act led to nearly two decades in which child welfare policy prioritized family preservation and biological family reunification. But several years ago, concern about increasing foster care caseloads and increasing lengths of stay prompted new federal child welfare legislation. The Adoption and Safe Families Act of 1997 (ASFA) shifted the policy emphasis to swift case resolution, even if swift case resolution leads to biological family separation and termination of parental rights. Proponents of ASFA argue that children should not be prevented from living in permanent homes because their parents repeatedly fail to comply with reunification requirements (Gelles, 1996). This concern is particularly acute when cases involve parental drug use. It is commonly believed that the difficulty and length oftime involved in overcoming drug addiction has forestalled reunification for many families. Yet, we have little research evidence about the relationship between parental drug use and reunification. Certainly, parental drug use seems to be an important contributor to the most recent increase in child welfare caseloads (Curtis & McCullough, 1993). Most estimates of the proportion of children who are in foster care for drug-related reasons range from 25 to 80 percent (Children's Bureau, 1997; SAMHSA, 1999) Dramatic increases in the number of substance-exposed infants in the late 1980s and early 1990s led to the placement of more infants in substitute care and a shift in the age distribution of admissions to foster care (Goerge, Wulczyn & Hardin, 1996). And, in addition to bringing more and younger children to the attention of child protective services, parental drug use has been associated with longer stays in foster care (Fanshel, 1975; Walker, Zangrillo & Smith, 1991), noncompliance with child welfare treatment plans (Famularo, Kinscherff, Bunshaft, Spivak & Fenton, 1989;
Cited by 0
Mary Emmert Seielstad · 2015
Cited by 0
Thijs Snelleman, Peter Lundestad Lawrence, Holger Hoos et al. · ArXiv.org · 2025
Background. Reproducibility is essential to the scientific method, but reproduction is often a laborious task. Recent works have attempted to automate this process and relieve researchers of this workload. However, due to varying definitions of reproducibility, a clear problem statement is missing. Objectives. Create a generalisable problem statement, applicable to any empirical study. We hypothesise that we can represent any empirical study using a structure based on the scientific method and that this representation can be automatically extracted from any publication, and captures the essence of the study. Methods. We apply our definition of reproducibility as a problem statement for the automatisation of reproducibility by automatically extracting the hypotheses, experiments and interpretations of 20 studies and assess the quality based on assessments by the original authors of each study. Results. We create a dataset representing the reproducibility problem, consisting of the representation of 20 studies. The majority of author feedback is positive, for all parts of the representation. In a few cases, our method failed to capture all elements of the study. We also find room for improvement at capturing specific details, such as results of experiments. Conclusions. We conclude that our formulation of the problem is able to capture the concept of reproducibility in empirical AI studies across a wide range of subfields. Authors of original publications generally agree that the produced structure is representative of their work; we believe improvements can be achieved by applying our findings to create a more structured and fine-grained output in future work.
Cited by 0Open access
Conrad Bowling · Journal of Collective Bargaining in the Academy · 2014
Phase 1---Your assignment is to, in separate caucuses, write an issue statement that identifies the issue at hand, and then to discuss the interests behind the issue.(Write the issue statement on the flipchart-note interests on a separate piece of paper.)Phase 2---Review issue statements in joint session.Merge them into one statement for the entire group.Then, brainstorm interests, write these on the flipchart, and then mark the interests that are mutual (between Union and Administration) Phase 3---Based on the interests expressed, brainstorm options for the Special Event (joint session).List them on the flipchart, and number them.Phase 4---Using a Three Stage Analysis F-B-A (Feasible, Beneficial, Acceptable), and consensus decision-making, determine which option(s) is the best solution to the issue.Phase 5---Once the group decides on a solution, put it in writing!
Cited by 0Open access
Thijs Snelleman, Peter Lundestad Lawrence, Holger Hoos et al. · arXiv (Cornell University) · 2025
Background. Reproducibility is essential to the scientific method, but reproduction is often a laborious task. Recent works have attempted to automate this process and relieve researchers of this workload. However, due to varying definitions of reproducibility, a clear problem statement is missing. Objectives. Create a generalisable problem statement, applicable to any empirical study. We hypothesise that we can represent any empirical study using a structure based on the scientific method and that this representation can be automatically extracted from any publication, and captures the essence of the study. Methods. We apply our definition of reproducibility as a problem statement for the automatisation of reproducibility by automatically extracting the hypotheses, experiments and interpretations of 20 studies and assess the quality based on assessments by the original authors of each study. Results. We create a dataset representing the reproducibility problem, consisting of the representation of 20 studies. The majority of author feedback is positive, for all parts of the representation. In a few cases, our method failed to capture all elements of the study. We also find room for improvement at capturing specific details, such as results of experiments. Conclusions. We conclude that our formulation of the problem is able to capture the concept of reproducibility in empirical AI studies across a wide range of subfields. Authors of original publications generally agree that the produced structure is representative of their work; we believe improvements can be achieved by applying our findings to create a more structured and fine-grained output in future work.
Cited by 0Open access
V. E. Nazaikinskii, A. Yu. Savin, B. Yu. Sternin et al. · 2012
The motivating point of our research was differential operators on the noncommutative torus1 studied by Connes [1, 2], who in particular obtained an index formula for such operators. These operators include shifts (more precisely, in this case, irrational rotations); hence our interest in general differential equations with shifts naturally arose. Let M be a smooth closed manifold. We consider operators on M of the form
Cited by 0