Search results for " Computer"
showing 10 items of 6910 documents
On the lattice of prefix codes
2002
AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.
On the decomposition of prefix codes
2017
Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.
Design of efficient codes for the AWGN channel based on decomposable binary lattices
1998
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded‐distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.
Low light level in vitro monitoring of cellular and antigen-antibody reactions using a photon detection camera system — New perspectives for clinical…
1990
This article briefly describes the use of a photon counting system (ARGUS-100) in the detection of low levels of light. The ARGUS-100 was used in determining ATP in cell sections from tumor tissues and in measuring a luminescence-enhanced immunoluminometric assay, using ferritin as the analyte, based on the luminol-peroxide-4-iodophenol reaction with peroxidase as the enzyme. The aim is not so much the presentation of data, but rather to show the potentials of the photon counting camera in increasing our knowledge of the cellular and subcellular levels, as well as lowering the detection limits in already sensitive systems, such as immunoassays.
The influence of different generations of computer algorithms on diabetes control
1990
With all control schedules, the management of diabetes is possible using Skyler's algorithm. In general, those control algorithms which do not allow the individual adaptation to changing conditions lead to overinsulinisation. So-called meal-related algorithms do usually minimise the fluctuations in blood sugar. The introduction of self-adapting algorithms, detecting peripheral insulin resistance, may further improve metabolic diabetes control.
Extensive Assessment of Blood Glucose Monitoring During Postprandial Period and Its Impact on Closed-Loop Performance.
2017
[EN] Background: Closed-loop (CL) systems aims to outperform usual treatments in blood glucose control and continuous glucose monitors (CGM) are a key component in such systems. Meals represents one of the main disturbances in blood glucose control, and postprandial period (PP) is a challenging situation for both CL system and CGM accuracy. Methods: We performed an extensive analysis of sensor¿s performance by numerical accuracy and precision during PP, as well as its influence in blood glucose control under CL therapy. Results: During PP the mean absolute relative difference (MARD) for both sensors presented lower accuracy in the hypoglycemic range (19.4 ± 12.8%) than in other ranges (12.2…
Towards understanding the complexity of cardiovascular oscillations: Insights from information theory.
2018
Abstract Cardiovascular complexity is a feature of healthy physiological regulation, which stems from the simultaneous activity of several cardiovascular reflexes and other non-reflex physiological mechanisms. It is manifested in the rich dynamics characterizing the spontaneous heart rate and blood pressure variability (HRV and BPV). The present study faces the challenge of disclosing the origin of short-term HRV and BPV from the statistical perspective offered by information theory. To dissect the physiological mechanisms giving rise to cardiovascular complexity in different conditions, measures of predictive information, information storage, information transfer and information modificati…
Developmental differences in the uterus of Fasciola hepatica between livestock liver fluke populations from Bolivian highlands and European lowlands
2001
A morphometric study of the uterus area (UA) of Fasciola hepatica adults was carried out with the aid of a computer linked to a stereomicroscopic 3CCD colour video camera using image analysis software. The UA of adult liver flukes found in naturally infected sheep, cattle and pig from the endemic human fascioliasis zone of the northern Bolivian Altiplano highlands was compared with that of flukes found infecting sheep and cattle from Valencia, Spain and cattle from Corsica, France (collectively, European lowlands). Liver fluke UA was examined using an allometric model. A comparison of the allometry of the liver fluke UA in different host species from Bolivia revealed no significant differen…
Exacus: Efficient and Exact Algorithms for Curves and Surfaces
2005
We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.
Fast prototyping of a SoC-based smart-camera: a real-time fall detection case study
2014
International audience; Smart camera, i.e. cameras that are able to acquire and process images in real-time, is a typical example of the new embedded computer vision systems. A key example of application is automatic fall detection, which can be useful for helping elderly people in daily life. In this paper, we propose a methodology for development and fast-prototyping of a fall detection system based on such a smart camera, which allows to reduce the development time compared to standard approaches. Founded on a supervised classification approach, we propose a HW/SW implementation to detect falls in a home environment using a single camera and an optimized descriptor adapted to real-time t…