Search results for "General Computer Science"
showing 10 items of 895 documents
Nonlinear analysis of continuous ECG during sleep I. Reconstruction.
2000
In recent years evidence has accumulated that ECG signals are of a nonlinear nature. It has been recognized that strictly periodic cardiac rhythms are not accompanied by healthy conditions but, on the contrary, by pathological states. Therefore, the application of methods from nonlinear system theory for the analysis of ECG signals has gained increasing interest. Crucial for the application of nonlinear methods is the reconstruction (embedding) of the time series in a phase space with appropriate dimension. In this study continuous ECG signals of 12 healthy subjects recorded during different sleep stages were analysed. Proper embedding dimension was determined by application of two techniqu…
Causal transfer function analysis to describe closed loop interactions between cardiovascular and cardiorespiratory variability signals
2004
Although the concept of transfer function is intrinsically related to an input-output relationship, the traditional and widely used estimation method merges both feedback and feedforward interactions between the two analyzed signals. This limitation may endanger the reliability of transfer function analysis in biological systems characterized by closed loop interactions. In this study, a method for estimating the transfer function between closed loop interacting signals was proposed and validated in the field of cardiovascular and cardiorespiratory variability. The two analyzed signals x and y were described by a bivariate autoregressive model, and the causal transfer function from x to y w…
Deterministic chaos and the first positive Lyapunov exponent: a nonlinear analysis of the human electroencephalogram during sleep
1993
Under selected conditions, nonlinear dynamical systems, which can be described by deterministic models, are able to generate so-called deterministic chaos. In this case the dynamics show a sensitive dependence on initial conditions, which means that different states of a system, being arbitrarily close initially, will become macroscopically separated for sufficiently long times. In this sense, the unpredictability of the EEG might be a basic phenomenon of its chaotic character. Recent investigations of the dimensionality of EEG attractors in phase space have led to the assumption that the EEG can be regarded as a deterministic process which should not be mistaken for simple noise. The calcu…
Color and lightness constancy in different perceptual tasks
1998
Color and lightness constancy with respect to changing illumination was studied with three different perceptual tasks: ranking of colored papers according (1) to their lightness and (2) to their chromatic similarity in photopic, mesopic, and scotopic states of adaptation, and (3) recognition of remembered colored papers after changes of illumination in photopic vision. Constancy was found in the second task, only. Excitations of light receptors and luminance channels were computed to simulate the empirical rank orders. Results of the first task can be predicted with the hypothesis that luminance channels are activated, if lightness is asked for. Sequences arranged with respect to chromatic …
Investigating centre of mass stabilisation as the goal of posture and movement coordination during human whole body reaching
2000
In the light of experimental results showing significant forward centre of mass (CoM) displacements within the base of support, this study investigated if whole body reaching movements can be executed whilst keeping the CoM fixed in the horizontal axis. Using kinematic simulation techniques, angular configurations were recreated from experimental data imposing two constraints: a constant horizontal position of the CoM and an identical trajectory of the hand to grasp an object. The comparison between recorded and simulated trials showed that stabilisation of the CoM was associated with greater backward hip displacements, which became more marked with increasing object distance. This was in c…
Sequential formula translation
1983
The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state- s ymbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes such as recursive address calculation.
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
2017
In this work, we tackle multidimensional two-way number partitioning (MDTWNP) problem by combining GRASP with Exterior Path Relinking. In the last few years, the combination of GRASP with path relinking (PR) has emerged as a highly effective tool for finding high-quality solutions for several difficult problems in reasonable computational time. However, in most of the cases, this hybridisation is limited to the variant known as interior PR. Here, we couple GRASP with the "exterior form" of path relinking and perform extensive experimentation to evaluate this variant. In addition, we enhance our GRASP with PR method with a novel local search method specially designed for the MDTWNP problem. …
A comparison of two different formulations for Arc Routing Problems on Mixed graphs
2006
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.
New Heuristic Algorithms for the Windy Rural Postman Problem
2005
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.
A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem
2016
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…