879 resultados para BIO-BAR CODES
Resumo:
This research is aimed to find a solution for a distributed storage system adapted for CoDeS. By studying how DSSs work and how they are implemented, we can conclude how we can implement a DSS compatible with CoDeS requirements.
Resumo:
The definition of sarcopenia includes both a loss of muscle strength and a decline in functional quality in addition to the loss of muscle protein mass. Multispectral bioimpendance allows bedside assessment of muscle mass. Using this new tool, we performed a pilot study to look for a possible correlation between muscle mass and various tests of muscle strength (grip strength, key-pitch, tip-pinch) and with functional tests (walk speed on 10 meters and Tinetti test). Our study demonstrates a good correlation between muscle mass determined by spectroscopic bioimpendance and muscle strength assessment, but no correlation with functional tests.
Resumo:
Nanomotors are nanoscale devices capable of converting energy into movement and forces. Among them, self-propelled nanomotors offer considerable promise for developing new and novel bioanalytical and biosensing strategies based on the direct isolation of target biomolecules or changes in their movement in the presence of target analytes. The mainachievements of this project consists on the development of receptor-functionalized nanomotors that offer direct and rapid target detection, isolation and transport from raw biological samples without preparatory and washing steps. For example, microtube engines functionalized with aptamer, antibody, lectin and enzymes receptors were used for the direct isolation of analytes of biomedical interest, including proteins and whole cells, among others. A target protein was also isolated from a complex sample by using an antigen-functionalized microengine navigating into the reservoirs of a lab-on-a-chip device. The new nanomotorbased target biomarkers detection strategy not only offers highly sensitive, rapid, simple and low cost alternative for the isolation and transport of target molecules, but also represents a new dimension of analytical information based on motion. The recognition events can be easily visualized by optical microscope (without any sophisticated analytical instrument) to reveal the target presence and concentration. The use of artificial nanomachines has shown not only to be useful for (bio)recognition and (bio)transport but also for detection of environmental contamination and remediation. In this context, micromotors modified with superhydrophobic layer demonstrated that effectively interacted, captured, transported and removed oil droplets from oil contaminated samples. Finally, a unique micromotor-based strategy for water-quality testing, that mimics live-fish water-quality testing, based on changes in the propulsion behavior of artificial biocatalytic microswimmers in the presence of aquatic pollutants was also developed. The attractive features of the new micromachine-based target isolation and signal transduction protocols developed in this project offer numerous potential applications in biomedical diagnostics, environmental monitoring, and forensic analysis.
Resumo:
We present building blocks for algorithms for the efficient reduction of square factor, i.e. direct repetitions in strings. So the basic problem is this: given a string, compute all strings that can be obtained by reducing factors of the form zz to z. Two types of algorithms are treated: an offline algorithm is one that can compute a data structure on the given string in advance before the actual search for the square begins; in contrast, online algorithms receive all input only at the time when a request is made. For offline algorithms we treat the following problem: Let u and w be two strings such that w is obtained from u by reducing a square factor zz to only z. If we further are given the suffix table of u, how can we derive the suffix table for w without computing it from scratch? As the suffix table plays a key role in online algorithms for the detection of squares in a string, this derivation can make the iterated reduction of squares more efficient. On the other hand, we also show how a suffix array, used for the offline detection of squares, can be adapted to the new string resulting from the deletion of a square. Because the deletion is a very local change, this adaption is more eficient than the computation of the new suffix array from scratch.
Resumo:
Collection : Les maîtres de la vénerie ; 4
Resumo:
Self-potentials (SP) are sensitive to water fluxes and concentration gradients in both saturated and unsaturated geological media, but quantitative interpretations of SP field data may often be hindered by the superposition of different source contributions and time-varying electrode potentials. Self-potential mapping and close to two months of SP monitoring on a gravel bar were performed to investigate the origins of SP signals at a restored river section of the Thur River in northeastern Switzerland. The SP mapping and subsequent inversion of the data indicate that the SP sources are mainly located in the upper few meters in regions of soil cover rather than bare gravel. Wavelet analyses of the time-series indicate a strong, but non-linear influence of water table and water content variations, as well as rainfall intensity on the recorded SP signals. Modeling of the SP response with respect to an increase in the water table elevation and precipitation indicate that the distribution of soil properties in the vadose zone has a very strong influence. We conclude that the observed SP responses on the gravel bar are more complicated than previously proposed semi-empiric relationships between SP signals and hydraulic head or the thickness of the vadose zone. We suggest that future SP monitoring in restored river corridors should either focus on quantifying vadose zone processes by installing vertical profiles of closely spaced SP electrodes or by installing the electrodes within the river to avoid signals arising from vadose zone processes and time-varying electrochemical conditions in the vicinity of the electrodes.
Resumo:
America’s roadways are in serious need of repair. According to the American Society of Civil Engineers (ASCE), one-third of the nation’s roads are in poor or mediocre condition. ASCE has estimated that under these circumstances American drivers will sacrifice $5.8 billion and as many as 13,800 fatalities a year from 1999 to 2001 ( 1). A large factor in the deterioration of these roads is a result of how well the steel reinforcement transfers loads across the concrete slabs. Fabricating this reinforcement using a shape conducive to transferring these loads will help to aid in minimizing roadway damage. Load transfer within a series of concrete slabs takes place across the joints. For a typical concrete paved road, these joints are approximately 1/8-inch gaps between two adjacent slabs. Dowel bars are located at these joints and used to transfer load from one slab to its adjacent slabs. As long as the dowel bar is completely surrounded by concrete no problems will occur. However, when the hole starts to oblong a void space is created and difficulties can arise. This void space is formed due to a stress concentration where the dowel contacts the concrete. Over time, the repeated process of traffic traveling over the joint crushes the concrete surrounding the dowel bar and causes a void in the concrete. This void inhibits the dowel’s ability to effectively transfer load across the joint. Furthermore, this void gives water and other particles a place to collect that will eventually corrode and potentially bind or lock the joint so that no thermal expansion is allowed. Once there is no longer load transferred across the joint, the load is transferred to the foundation and differential settlement of the adjacent slabs will occur.
Resumo:
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.
Resumo:
We focus on full-rate, fast-decodable space–time block codes (STBCs) for 2 x 2 and 4 x 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2 x 2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4 x 2 STBC, and show that it outperforms all previously known codes with certain constellations.
Resumo:
The 2×2 MIMO profiles included in Mobile WiMAX specifications are Alamouti’s space-time code (STC) fortransmit diversity and spatial multiplexing (SM). The former hasfull diversity and the latter has full rate, but neither of them hasboth of these desired features. An alternative 2×2 STC, which is both full rate and full diversity, is the Golden code. It is the best known 2×2 STC, but it has a high decoding complexity. Recently, the attention was turned to the decoder complexity, this issue wasincluded in the STC design criteria, and different STCs wereproposed. In this paper, we first present a full-rate full-diversity2×2 STC design leading to substantially lower complexity ofthe optimum detector compared to the Golden code with only a slight performance loss. We provide the general optimized form of this STC and show that this scheme achieves the diversitymultiplexing frontier for square QAM signal constellations. Then, we present a variant of the proposed STC, which provides a further decrease in the detection complexity with a rate reduction of 25% and show that this provides an interesting trade-off between the Alamouti scheme and SM.