Continuous-time Markov chains with alarms (ACTMCs) allow for alarm events that can be non-exponentially distributed. Within parametric ACTMCs, the parameters of alarm-event distributions are not given explicitly and can be subject of parameter synthesis. An algorithm solving the ε-optimal parameter synthesis problem for parametric ACTMCs with long-run average optimization objectives is presente...

Drawing on a large household survey in rural Central Java, Indonesia, we address the functional distinction between formal education and nutrition knowledge. Applying parametric and nonparametric techniques to household data from rural Indonesia the study finds that: 1) Mothers’ nutrition knowledge has a strong, positive impact on child nutrition in the short-term (weight-forheight), controllin...

We reformulate algorithm selection as a time allocation problem: all candidate algorithms are run in parallel, and their relative priorities are continually updated based on its current time to solution, estimated according to a parametric model that is trained and used while solving a sequence of problems.

The Special Number Field Sieve factoring algorithm has a large number of parametric choices, each of which can affect its run time. We give guidelines for these choices along with a discussion of useful coding optimizations. We also give a theoretical argument which shows that the choice of sieving region that has been used so far in successful factorizations is not optimal. §

We examine the association of income variability both within and across generations based on a heterogeneous growth model of permanent and transitory income in Sweden. Non-parametric regressions reveal that income variability is strongly associated with long-run levels of income, especially for lowand highincome earners, and that it is also strongly associated across generations. JEL Classifica...

A general parametric analysis problem which allows the use of parameter variables in both the realtime automata and the specifications is proposed and solved. The analysis algorithm is much simpler and can run more efficiently in average cases than can previous works.

We define a new class of hybrid automata for which reachability is decidable—a proper superclass of the initialized rectangular hybrid automata—by taking parallel compositions of simple components. Attempting to generalize, we encounter timed automata with algebraic constants. We show that reachability is undecidable for these algebraic timed automata by simulating two-counter Minsky machines. ...

We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses the Dirichlet process mixture (DPM) model, but it is supposedly more flexible in the detection of clusters in the data. With an almost sure approximation of the posterior distribution of the mixing process we can run a ...

Minimum time control of a two link manipulator is used to investigate the sensitivity of genetic programming solutions to parametric design changes. Two methods of reducing sensitivity are considered. An aggregate fitness method in which results from multiple fitness cases are combined into a single fitness measure, and a bimodal selection method in which male and female parents are selected on...

A computer program package for parametric ad nonparametric linear system identification of both static and dynamic biological data, written for an LSI-11 minicomputer with 28 K of memory, is described. The program has 11 possible commands including an instructional help command. A user can perform nonparametric spectral analysis and estimation of autocorrelation and partial autocorrelation func...