Search results for "call"

Postural Control Profiles of Typically Developing Children From 6 to 12 Years old: An Approach Using Self-Organizing Maps

2020

The purposes of the present study were a) to establish postural control profiles for individuals 6–12 years of age, b) to analyze the participants’ characteristics (age, sex, weight, height, and physical activity) in those profiles, and c) to analyze the influence of visual information in the profiles found. Two hundred and eight typically developing children aged 6–12 years performed two trials in bipedal standing position with eyes open and closed. Feature extraction involved time, frequency, and sway-density plot variables using signals from the center of pressure. A Self-Organizing Map was used to classify and visualize the values of the participants in all the postural control variable…

Enhanced Accumulation of Betulinic Acid in Transgenic Hairy Roots of Senna obtusifolia Growing in the Sprinkle Bioreactor and Evaluation of Their Bio…

2021

Betulinic acid, which is found in transgenic roots of Senna obtusifolia (L.) H.S.Irwin & Barneby, is a pentacyclic triterpene with distinctive pharmacological activities. In this study, we report the differences in the content of betulinic acid and selected anthraquinones in transgenic S. obtusifolia hairy roots with overexpression of the PgSS1 gene (SOPSS2 line) and in transformed hairy roots without this genetic construct (SOA41 line). Both hairy root lines grew in 10 L sprinkle bioreactor. Additionally, the extracts obtained from this plant material were used for biological tests. Our results demonstrated that the SOPSS2 hairy root cultures from the bioreactor showed an increase in the c…

Construction and Psychometric Properties of Sentence Repetition Test (SRT) for Latvian Primary School Children

2014

Mobile agents and grid computing

2004

Publisher Summary This chapter describes mobile agents as an effective solution for grid service provision. A short overview is first introduced on the grid paradigm and the most known research activities in the field. Then, mobile agents are discussed and a comparison with the remote procedure call (RPC) method is made as far as the most effective solution to minimize network overload and fault occurrences is concerned. The common feature of all grid architectures is a coordinated and controlled resource sharing between the members of a dynamic multi-institutional virtual community. Community members agree on a set of sharing rules and permissions, by which resources to be shared and membe…

Is Admission-Controlled Traffic Self-Similar?

2002

It is widely recognized that the maximum number of heavy-tailed flows that can be admitted to a network link, while meeting QoS targets, can be much lower than in the case of markovian flows. In fact, the superposition of heavy-tailed flows shows long range dependence (self-similarity), which has a detrimental impact on network performance. In this paper, we show that long range dependence is significantly reduced when traffic is controlled by a Measurement-Based Admission Control (MBAC) algorithm. Our results appear to suggest that MBAC is a value added tool to improve performance in the presence of self-similar traffic, rather than a mere approximation for traditional (parameter-based) ad…

The OptQuest Callable Library

2005

In this chapter we discuss the development and application of a library of functions that is the optimization engine for the OptQuest system. OptQuest is commercial software designed for optimizing complex systems, such as those formulated as simulation models. OptQuest has been integrated with several simulation packages with the goal of adding optimization capabilities. The optimization technology within OptQuest is based on the metaheuristic framework known as scatter search. In addition to describing the functionality of the OptQuest Callable Library (OCL) with an illustrative example, we apply it to a set of unconstrained nonlinear optimization problems.

The set of conjugacy class sizes of a finite group does not determine its solvability

2014

Abstract We find a pair of groups, one solvable and the other non-solvable, with the same set of conjugacy class sizes.

A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Sampling

2009

We consider the problem of allocating limited sampling resources in a "real-time" manner with the purpose of estimating multiple binomial proportions. More specifically, the user is presented with `n ' sets of data points, S 1 , S 2 , ..., S n , where the set S i has N i points drawn from two classes {*** 1 , *** 2 }. A random sample in set S i belongs to *** 1 with probability u i and to *** 2 with probability 1 *** u i , with {u i }. i = 1, 2, ...n , being the quantities to be learnt. The problem is both interesting and non-trivial because while both n and each N i are large, the number of samples that can be drawn is bounded by a constant, c . We solve the problem by first modelling it a…

Left-to-right tree pattern matching

1991

We propose a new technique to construct left-to-right matching automata for trees. Our method is based on the novel concept of prefix unifcation which is used to compute a certain closure of the pattern set. From the closure a kind of deterministic matching automaton can be derived immediately. We also point out how to perform the construction incrementally which makes our approach suitable for applications in which pattern sets change dynamically, such as in the Knuth-Bendix completion algorithm.

Construction and Implementation of LR(1) Parsers

1990

This chapter is devoted to the practical issues involved in the construction and use of deterministic LR(1) parsers. We shall show how the practical versions of LR (1) parsers, most notably the LALR (1) parsers, can be constructed efficiently, and we shall present methods for encoding LR(1) parsers as efficient RAM programs. Two versions of RAM program implementation are considered: in the first implementation the parsing program is table-driven, that is, the rules of the parser are encoded in a two-dimensional array which is simulated by a program body; in the other implementation the tabular information is further transformed into a set of program statements.