Modified multi-wavelength optical orthogonal code for spectral efficiency improvement in two-dimensional optical CDMA system

Classical multi-wavelength optical orthogonal code (MWOOC) constructions impose several conditions on the code parameters. These limit the optical code division multiple access (OCDMA) system potentialities in terms of performance and practical implementation. A modified MWOOC construction is used to overcome these limitations. Indeed, this method permits the design of 2D codes with a low temporal code length value and a low number of wavelengths. Considering a multi-user receiver named parallel interference cancellation, the number of users and the data rate per user the system can provide for a low bit error rate value are evaluated. For a given performance, it is shown that the spectral efficiency using the modified MWOOC is significantly improved. Thus, the simplicity of the modified code design and the spectral efficiency increase constitute an advantage for practical implementation of OCDMA network.     

A framework for dynamic implicit curve approximation by an irregular discrete approach

The approximation of implicit planar curves by line segments is a very classical problem. Many algorithms use interval analysis to approximate this curve, and to handle the topology of the final reconstruction. In this article, we use discrete geometry tools to build an original geometrical and topological representation of the implicit curve. The polygonal approximation contains few segments, and the Reeb graph permits to sum up efficiently the shape and the topology of the curve. Furthermore, we propose two algorithms to process local cells refinement and local cells grouping schemes. We illustrate these schemes with a global system that efficiently handles manual or automatic fast updates on the global reconstruction, by considering topological or geometrical constraints. We also compare the speed and the quality of our approach with two classical methods.     

Automatic computation of pebble roundness using digital imagery and discrete geometry

The shape of sedimentary particles is an important property, from which geographical hypotheses related to abrasion, distance of transport, river behavior, etc. can be formulated. In this paper, we use digital image analysis, especially discrete geometry, to automatically compute some shape parameters such as roundness, i.e. a measure of how much the corners and edges of a particle have been worn away.In contrast to previous work in which traditional digital images analysis techniques, such as Fourier transform, are used, we opted for a discrete geometry approach that allowed us to implement Wadell's original index, which is known to be more accurate, but more time consuming to implement in the field.Our implementation of Wadell's original index is highly correlated (92%) with the roundness classes of Krumbein's chart, used as a ground-truth. In addition, we show that other geometrical parameters, which are easier to compute, can be used to provide good approximations of roundness.We also used our shape parameters to study a set of pebbles digital images taken from the Progo basin river network (Indonesia). The results we obtained are in agreement with previous work and open new possibilities for geomorphologists thanks to automatic computation.     

The other side of ranking schemes: generating weights for specified outcomes

This paper treats the problem of how to determine weights in a ranking, which will cause a selected entity to attain the highest possible position. We establish that there are two types of entities in a ranking scheme: those which can be ranked as number one and those which cannot. These two types of entities can be identified using the “ranking hull” of the data; a polyhedral set that envelops the data. Only entities with data points on the boundary of this hull can attain the number one position. There are no weights that will make an entity whose data point is in the interior of the hull to ever attain the number one position. We deal with these two types of entities separately. In the first case, we propose an approach for finding a set of weights that, under special conditions, will result in a selected entity achieving the top of the ranking without ties and without ignoring any of the attributes. For the second category of entities, we devise a procedure to guarantee that these entities will attain their highest possible position in the ranking. The first case will require using interior point methods to solve a linear program (LP). The second case involves a binary mixed integer formulation. These two mathematical programs were tested on data from a well‐known university ranking.     

FAST: acceleration from theory to practice

Fast acceleration of symbolic transition systems (Fast) is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture choices. Finally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated. This paper is mainly based on results presented at CAV 2003, TACAS 2004 and ATVA 2005.     

Measuring Affective Clarity Indirectly: Individual Differences in Response Latencies of State.

This research investigated a new method to measure momentary affective clarity indirectly, which is based on latencies of responses to state affect items. Three studies revealed that this indirect measure of momentary clarity demonstrated high reliability and stability as well as convergent and predictive validity. The indirect measure was associated with dispositional clarity when the concept of clarity was activated before measuring response latencies (Studies 1 and 2) and was related to self-reports of momentary clarity (Study 3). Furthermore, Study 3 demonstrated that indirectly measured clarity decreased after an affectively complex film. Indirectly, but not directly, measured momentary clarity predicted a more positive affective state at the end of the study. This effect was mediated by affect regulation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Constipation Mitigation by Rhubarb Extract in Middle-Aged Adults Is Linked to Gut Microbiome Modulation: A Double-Blind Randomized Placebo-Controlled Trial

Gut microbiota alterations are intimately linked to chronic constipation upon aging. We investigated the role of targeted changes in the gut microbiota composition in the relief of constipation symptoms after rhubarb extract (RE) supplementation in middle-aged volunteers. Subjects (95% women, average 58 years old) were randomized to three groups treated with RE at two different doses determined by its content of rhein (supplementation of 12.5 mg and 25 mg per day) vs. placebo (maltodextrin) for 30 days. We demonstrated that daily oral supplementation of RE for 30 days was safe even at the higher dose. Stool frequency and consistency, and perceived change in transit problem, transit speed and difficulty in evacuating, investigated by validated questionnaires, were improved in both groups of RE-treated volunteers compared to placebo. Higher abundance of Lachnospiraceae (mainly Roseburia and Agathobacter) only occurred after RE treatment when present at low levels at baseline, whereas an opposite shift in short-chain fatty acid (SCFA) levels was observed in both RE-treated groups (increase) and placebo (decrease). Fecal Lachnospiraceae and SCFA were positively correlated with stool consistency. This study demonstrates that RE supplementation promotes butyrate-producing bacteria and SCFA, an effect that could contribute to relieving chronic constipation in middle-aged persons.