178 resultados para Objective functions


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The M¨obius transform of Boolean functions is often involved in cryptographic design and analysis. As studied previously, a Boolean function f is said to be coincident if it is identical with its M¨obius transform fμ, i.e., f = fμ...

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a method for designing set-point regulation controllers for a class of underactuated mechanical systems in Port-Hamiltonian System (PHS) form. A new set of potential shape variables in closed loop is proposed, which can replace the set of open loop shape variables-the configuration variables that appear in the kinetic energy. With this choice, the closed-loop potential energy contains free functions of the new variables. By expressing the regulation objective in terms of these new potential shape variables, the desired equilibrium can be assigned and there is freedom to reshape the potential energy to achieve performance whilst maintaining the PHS form in closed loop. This complements contemporary results in the literature, which preserve the open-loop shape variables. As a case study, we consider a robotic manipulator mounted on a flexible base and compensate for the motion of the base while positioning the end effector with respect to the ground reference. We compare the proposed control strategy with special cases that correspond to other energy shaping strategies previously proposed in the literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The legal arrangements for the management of water resources are currently a complex matrix of rules of various kinds. These rules perform a diverse range of functions. Some are part of what may be described as the macro-legal system for the governance of water resources. This includes paralegal rules in the form of statements of value, objective, outcome or principles . Others are part of the micro-legal system for the governance of water resources. This includes traditional legal rules in the form of statements of standards in relation to individual conduct, behaviour or decision making. These legal arrangements may be international, regional, national or local. Accordingly some apply to nation states within the international community. Others apply to the regulatory agencies making decisions about water resources within nation states. Ultimately most of these legal arrangements apply to those who use and develop water resources for particular purposes and in particular locations. In accordance with this framework, rules explain how water resources should be used in particular circumstances and how decisions should be made to ensure the effective planning and regulation of water resources.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ground-penetrating radar (GPR) is widely used for assessment of soil moisture variability in field soils. Because GPR does not measure soil water content directly, it is common practice to use calibration functions that describe its relationship with the soil dielectric properties and textural parameters. However, the large variety of models complicates the selection of the appropriate function. In this article an overview is presented of the different functions available, including volumetric models, empirical functions, effective medium theories, and frequency-specific functions. Using detailed information presented in summary tables, the choice for which calibration function to use can be guided by the soil variables available to the user, the frequency of the GPR equipment, and the desired level of detail of the output. This article can thus serve as a guide for GPR practitioners to obtain soil moisture values and to estimate soil dielectric properties.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Objective There are no objective ambulatory studies on the temporal relationship between reflux and cough in children. Commercial pHmetry loggers have slow capture rates (0.25 Hz) that limit objective quantification of reflux and cough. The authors aimed to evaluate if there is a temporal association between cough and acid pH in ambulatory children with chronic cough. setting and patients The authors studied children (aged <14 years) with chronic cough, suspected of acid reflux and considered for pHmetry using a specifically built ambulatory pHmetry–cough logger that enabled the simultaneous ambulatory recording of cough and pH with a fast (10 Hz) capture rate. Main outcome measures Coughs within (before and after) 10, 30, 60 and 120 s of a reflux episode (pH<4 for >0.5 s). Results Analysis of 5628 coughs in 20 children. Most coughs (83.9%) were independent of a reflux event. Cough–reflux (median 19, IQR 3–45) and reflux–cough (24.5, 13–51) sequences were equally likely to occur within 120 s. Within the 10 and 30 s time frame, reflux–cough (10 s=median 2.5, IQR 0–7.25; 30 s=6.5, 1.25–22.25) sequences were significantly less frequent than reflux–no cough (10 s=27, IQR 15–65; 30 s=24.5, 14.5–55.5) sequences, (p=0.0001 and p=0.001, respectively). No differences were found for 60 and 120 s time frame. Cough–reflux sequence (median 1.0, IQR 0–8) within 10 s was significantly less (p=0.0001) than no cough–reflux sequences (median 29.5, 15–67), within 30 s (p=0.006) and 60 s (p=0.048) but not within 120 s (p=0.47). Conclusions In children with chronic cough and suspected of having gastro-oesophageal reflux disease, the temporal relationship between acid reflux and cough is unlikely causal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

With measurement of physical activity becoming more common in clinical practice, it is imperative that healthcare professionals become more knowledgeable about the different methods available to objectively measure physical activity behaviour. Objective measures do not rely on information provided by the patient, but instead measure and record the biomechanical or physiological consequences of performing physical activity, often in real time. As such, objective measures are not subject to the reporting bias or recall problems associated with self-report methods. The purpose of this article was to provide an overview of the different methods used to objectively measure physical activity in clinical practice. The review was delimited to heart rate monitoring, accelerometers and pedometers since their small size, low participant burden and relatively low cost make these objective measures appropriate for use in clinical practice settings. For each measure, strengths and weakness were discussed; and whenever possible, literature-based examples of implementation were provided.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Purpose The purpose of this study was to establish the minimal number of days of monitoring required for accelerometers to assess usual physical activity in children. Methods A total of 381 students (189 M, 192 F) wore a CSA 7164 uniaxial accelerometer for seven consecutive days. To examine age-related trends students were grouped as follows: Group I: grades 1-3 (N = 92); Group II: grades 4-6 (N = 98); Group III: grades 7-9 (N = 97); Group IV: grades 10-12 (N = 94). Average daily time spent in moderate-to-vigorous physical activity (MVPA) was calculated from minute-by-minute activity counts using the regression equation developed by Freedson et al. (1997). Results Compared with adolescents in grades 7 to 12, children in grades 1 to 6 exhibited less day-to-day variability in MVPA behavior. Spearman-Brown analysts indicated that between 4 and 5 d of monitoring would be necessary to a achieve a reliability of 0.80 in children, and between 8 and 9 d of monitoring would be necessary to achieve a reliability of 0.80 in adolescents. Within all grade levels, the 7-d monitoring protocol produced acceptable estimates of daily participation in MVPA (R = 0.76 (0.71-0.81) to 0.87 (0.84-0.90)). Compared with weekdays, children exhibited significantly higher levels of MVPA on weekends, whereas adolescents exhibited significantly lower levels of MVPA on weekends. Principal components analysis revealed two distinct time components for MVPA during the day for children (early morning, rest of the day), and three distinct time components for MVPA during the day for adolescents (morning, afternoon, early evening). Conclusions These results indicate that a 7-d monitoring protocol provides reliable estimates of usual physical activity behavior in children and adolescents and accounts for potentially important differences in weekend versus weekday activity behavior as well as differences in activity patterns within a given day.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background The purposes of this study were 1) to establish accelerometer count cutoffs to categorize activity intensity of 3 to 5-y old-children and 2) to evaluate the accelerometer as a measure of children’s physical activity in preschool settings. Methods While wearing an ActiGraph accelerometer, 16 preschool children performed five, 3-min structured activities. Receiver Operating Characteristic (ROC) curve analyses identified count cutoffs for four physical activity intensities. In 9 preschools, 281 children wore an ActiGraph during observations performed by three trained observers (interobserver reli-ability = 0.91 to 0.98). Results Separate count cutoffs for 3, 4, and 5-y olds were established. Sensitivity and specificity for the count cutoffs ranged from 86.7% to 100.0% and 66.7% to 100.0%, respectively. ActiGraph counts/15 s were different among all activities (P < 0.05) except the two sitting activities. Correlations between observed and ActiGraph intensity categorizations at the preschools ranged from 0.46 to 0.70 (P < 0.001). Conclusions The ActiGraph count cutoffs established and validated in this study can be used to objectively categorize the time that preschool-age children spend in different physical activity intensity levels.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Second-generation activity monitors have revolutionized the way in which we measure youth physical activity. Use of the monitors avoids the problems associated with self-report methods and allows for the estimation of physical activity patterns over time. This article examines important methodological issues related to the use of activity monitors in children and adolescents.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The SOS screen, as originally described by Perkins et al. (1999), was setup with the aim of identifying Arabidopsis functions that might potentially be involved in the DNA metabolism. Such functions, when expressed in bacteria, are prone to disturb replication and thus trigger the SOS response. Consistently, expression of AtRAD51 and AtDMC1 induced the SOS response in bacteria, even affecting E. coli viability. 100 SOS-inducing cDNAs were isolated from a cDNA library constructed from an Arabidopsis cell suspension that was found to highly express meiotic genes. A large proportion of these SOS+ candidates are clearly related to the DNA metabolism, others could be involved in the RNA metabolism, while the remaining cDNAs encode either totally unknown proteins or proteins that were considered as irrelevant. Seven SOS+ candidate genes are induced following gamma irradiation. The in planta function of several of the SOS-inducing clones was investigated using T-DNA insertional mutants or RNA interference. Only one SOS+ candidate, among those examined, exhibited a defined phenotype: silenced plants for DUT1 were sensitive to 5-fluoro-uracil (5FU), as is the case of the leaky dut-1 mutant in E. coli that are affected in dUTPase activity. dUTPase is essential to prevent uracil incorporation in the course of DNA replication.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damgård domain extender. However, they did not provide any provably secure constructions for higher order UOWHFs. We show that the subset sum hash function is a kth order Universal One-Way Hash Function (hashing n bits to m < n bits) under the Subset Sum assumption for k = O(log m). Therefore we strengthen a previous result of Impagliazzo and Naor, who showed that the subset sum hash function is a UOWHF under the Subset Sum assumption. We believe our result is of theoretical interest; as far as we are aware, it is the first example of a natural and computationally efficient UOWHF which is also a provably secure higher order UOWHF under the same well-known cryptographic assumption, whereas this assumption does not seem sufficient to prove its collision-resistance. A consequence of our result is that one can apply the Merkle-Damgård extender to the subset sum compression function with ‘extension factor’ k+1, while losing (at most) about k bits of UOWHF security relative to the UOWHF security of the compression function. The method also leads to a saving of up to m log(k+1) bits in key length relative to the Shoup XOR-Mask domain extender applied to the subset sum compression function.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We prove that homogeneous bent functions f:GF(2)^2n --> GF(2) of degree n do not exist for n>3. Consequently homogeneous bent functions must have degree 3.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups. We provide a partial verification of the enumeration of eight variable degree three homogeneous bent functions obtained by Meng et al. We determine the affine equivalence classes of these functions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽tfunctions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.