992 resultados para Maximum distance separable (MDS) convolutional codes
Resumo:
[spa] Se presenta un nuevo modelo para la toma de decisiones basado en el uso de medidas de distancia y de operadores de agregación inducidos. Se introduce la distancia media ponderada ordenada inducida (IOWAD). Es un nuevo operador de agregación que extiende el operador OWA a través del uso de distancias y un proceso de reordenación de los argumentos basado en variables de ordenación inducidas. La principal ventaja el operador IOWAD es la posibilidad de utilizar una familia parametrizada de operadores de agregación entre la distancia individual máxima y la mínima. Se estudian algunas de sus principales propiedades y algunos casos particulares. Se desarrolla un ejemplo numérico en un problema de toma de decisiones sobre selección de inversiones. Se observa que la principal ventaja de este modelo en la toma de decisiones es la posibilidad de mostrar una visión más completa del proceso, de forma que el decisor está capacitado para seleccionar la alternativa que está más cerca de sus intereses.
Resumo:
Introduction: Ankle arthrodesis (AD) and total ankle replacement (TAR) are typical treatments for ankle osteoarthritis (AO). Despite clinical interest, there is a lack of their outcome evaluation using objective criteria. Gait analysis and plantar pressure assessment are appropriate to detect pathologies in orthopaedics but they are mostly used in lab with few gait cycles. In this study, we propose an ambulatory device based on inertial and plantar pressure sensors to compare the gait during long-distance trials between healthy subjects (H) and patients with AO or treated by AD and TAR. Methods: Our study included four groups: 11 patients with AO, 9 treated by TAR, 7 treated by AD and 6 control subjects. An ambulatory system (Physilog®, CH) was used for gait analysis; plantar pressure measurements were done using a portable insole (Pedar®-X, DE). The subjects were asked to walk 50 meters in two trials. Mean value and coefficient of variation of spatio-temporal gait parameters were calculated for each trial. Pressure distribution was analyzed in ten subregions of foot. All parameters were compared among the four groups using multi-level model-based statistical analysis. Results: Significant difference (p <0.05) with control was noticed for AO patients in maximum force in medial hindfoot and forefoot and in central forefoot. These differences were no longer significant in TAR and AD groups. Cadence and speed of all pathologic groups showed significant difference with control. Both treatments showed a significant improvement in double support and stance. TAR decreased variability in speed, stride length and knee ROM. Conclusions: In spite of a small sample size, this study showed that ankle function after AO treatments can be evaluated objectively based on plantar pressure and spatio-temporal gait parameters measured during unconstrained walking outside the lab. The combination of these two ambulatory techniques provides a promising way to evaluate foot function in clinics.
Resumo:
This thesis studies gray-level distance transforms, particularly the Distance Transform on Curved Space (DTOCS). The transform is produced by calculating distances on a gray-level surface. The DTOCS is improved by definingmore accurate local distances, and developing a faster transformation algorithm. The Optimal DTOCS enhances the locally Euclidean Weighted DTOCS (WDTOCS) with local distance coefficients, which minimize the maximum error from the Euclideandistance in the image plane, and produce more accurate global distance values.Convergence properties of the traditional mask operation, or sequential localtransformation, and the ordered propagation approach are analyzed, and compared to the new efficient priority pixel queue algorithm. The Route DTOCS algorithmdeveloped in this work can be used to find and visualize shortest routes between two points, or two point sets, along a varying height surface. In a digital image, there can be several paths sharing the same minimal length, and the Route DTOCS visualizes them all. A single optimal path can be extracted from the route set using a simple backtracking algorithm. A new extension of the priority pixel queue algorithm produces the nearest neighbor transform, or Voronoi or Dirichlet tessellation, simultaneously with the distance map. The transformation divides the image into regions so that each pixel belongs to the region surrounding the reference point, which is nearest according to the distance definition used. Applications and application ideas for the DTOCS and its extensions are presented, including obstacle avoidance, image compression and surface roughness evaluation.
Resumo:
In wireless communications the transmitted signals may be affected by noise. The receiver must decode the received message, which can be mathematically modelled as a search for the closest lattice point to a given vector. This problem is known to be NP-hard in general, but for communications applications there exist algorithms that, for a certain range of system parameters, offer polynomial expected complexity. The purpose of the thesis is to study the sphere decoding algorithm introduced in the article On Maximum-Likelihood Detection and the Search for the Closest Lattice Point, which was published by M.O. Damen, H. El Gamal and G. Caire in 2003. We concentrate especially on its computational complexity when used in space–time coding. Computer simulations are used to study how different system parameters affect the computational complexity of the algorithm. The aim is to find ways to improve the algorithm from the complexity point of view. The main contribution of the thesis is the construction of two new modifications to the sphere decoding algorithm, which are shown to perform faster than the original algorithm within a range of system parameters.
Resumo:
Distributed storage systems are studied. The interest in such system has become relatively wide due to the increasing amount of information needed to be stored in data centers or different kinds of cloud systems. There are many kinds of solutions for storing the information into distributed devices regarding the needs of the system designer. This thesis studies the questions of designing such storage systems and also fundamental limits of such systems. Namely, the subjects of interest of this thesis include heterogeneous distributed storage systems, distributed storage systems with the exact repair property, and locally repairable codes. For distributed storage systems with either functional or exact repair, capacity results are proved. In the case of locally repairable codes, the minimum distance is studied. Constructions for exact-repairing codes between minimum bandwidth regeneration (MBR) and minimum storage regeneration (MSR) points are given. These codes exceed the time-sharing line of the extremal points in many cases. Other properties of exact-regenerating codes are also studied. For the heterogeneous setup, the main result is that the capacity of such systems is always smaller than or equal to the capacity of a homogeneous system with symmetric repair with average node size and average repair bandwidth. A randomized construction for a locally repairable code with good minimum distance is given. It is shown that a random linear code of certain natural type has a good minimum distance with high probability. Other properties of locally repairable codes are also studied.
Resumo:
The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.
Resumo:
Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.
Resumo:
We present a general framework for discriminative estimation based on the maximum entropy principle and its extensions. All calculations involve distributions over structures and/or parameters rather than specific settings and reduce to relative entropy projections. This holds even when the data is not separable within the chosen parametric class, in the context of anomaly detection rather than classification, or when the labels in the training set are uncertain or incomplete. Support vector machines are naturally subsumed under this class and we provide several extensions. We are also able to estimate exactly and efficiently discriminative distributions over tree structures of class-conditional models within this framework. Preliminary experimental results are indicative of the potential in these techniques.
Resumo:
In previous work (Olshausen & Field 1996), an algorithm was described for learning linear sparse codes which, when trained on natural images, produces a set of basis functions that are spatially localized, oriented, and bandpass (i.e., wavelet-like). This note shows how the algorithm may be interpreted within a maximum-likelihood framework. Several useful insights emerge from this connection: it makes explicit the relation to statistical independence (i.e., factorial coding), it shows a formal relationship to the algorithm of Bell and Sejnowski (1995), and it suggests how to adapt parameters that were previously fixed.
Resumo:
Samples of glacial till deposited since the Little Ice Age (LIA) maximum by two glaciers, North Bogbre at Svartisen and Corneliussen-breen at Okstindan, northern Norway, were obtained from transects running from the current glacier snout to the LIA (c. AD 1750) limit. The samples were analysed to determine their sediment magnetic properties, which display considerable variability. Significant trends in some magnetic parameters are evident with distance from the glacier margin and hence length of subaerial exposure. Magnetic susceptibility (X) decreases away from the contemporary snout, perhaps due to the weathering of ferrimagnetic minerals into antiferromagnetic forms, although this trend is generally not statistically significant. Trends in the ratios of soft IRM/hard IRM which are statistically significant support this hypothesis, suggesting that antiferromagnetic minerals are increasing relative to ferrimagnetic minerals towards the LIA maximum. Backfield ratios (IRM -100 mT/SIRM) also display a significant and strong trend towards magnetically harder behaviour with proximity to the LIA maximum. Thus, by employing a chronosequence approach, it may be possible to use sediment magnetics data as a tool for reconstructing glacier retreat in areas where more traditional techniques, such as lichenometry, are not applicable.
Resumo:
It has been generally accepted that the method of moments (MoM) variogram, which has been widely applied in soil science, requires about 100 sites at an appropriate interval apart to describe the variation adequately. This sample size is often larger than can be afforded for soil surveys of agricultural fields or contaminated sites. Furthermore, it might be a much larger sample size than is needed where the scale of variation is large. A possible alternative in such situations is the residual maximum likelihood (REML) variogram because fewer data appear to be required. The REML method is parametric and is considered reliable where there is trend in the data because it is based on generalized increments that filter trend out and only the covariance parameters are estimated. Previous research has suggested that fewer data are needed to compute a reliable variogram using a maximum likelihood approach such as REML, however, the results can vary according to the nature of the spatial variation. There remain issues to examine: how many fewer data can be used, how should the sampling sites be distributed over the site of interest, and how do different degrees of spatial variation affect the data requirements? The soil of four field sites of different size, physiography, parent material and soil type was sampled intensively, and MoM and REML variograms were calculated for clay content. The data were then sub-sampled to give different sample sizes and distributions of sites and the variograms were computed again. The model parameters for the sets of variograms for each site were used for cross-validation. Predictions based on REML variograms were generally more accurate than those from MoM variograms with fewer than 100 sampling sites. A sample size of around 50 sites at an appropriate distance apart, possibly determined from variograms of ancillary data, appears adequate to compute REML variograms for kriging soil properties for precision agriculture and contaminated sites. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
Interplanetary coronal mass ejections (ICMEs) are often observed to travel much faster than the ambient solar wind. If the relative speed between the two exceeds the fast magnetosonic velocity, then a shock wave will form. The Mach number and the shock standoff distance ahead of the ICME leading edge is measured to infer the vertical size of an ICME in a direction that is perpendicular to the solar wind flow. We analyze the shock standoff distance for 45 events varying between 0.5 AU and 5.5 AU in order to infer their physical dimensions. We find that the average ratio of the inferred vertical size to measured radial width, referred to as the aspect ratio, of an ICME is 2.8 ± 0.5. We also compare these results to the geometrical predictions from Paper I that forecast an aspect ratio between 3 and 6. The geometrical solution varies with heliocentric distance and appears to provide a theoretical maximum for the aspect ratio of ICMEs. The minimum aspect ratio appears to remain constant at 1 (i.e., a circular cross section) for all distances. These results suggest that possible distortions to the leading edge of ICMEs are frequent. But, these results may also indicate that the constants calculated in the empirical relationship correlating the different shock front need to be modified; or perhaps both distortions and a change in the empirical formulae are required.
Resumo:
We study a two-way relay network (TWRN), where distributed space-time codes are constructed across multiple relay terminals in an amplify-and-forward mode. Each relay transmits a scaled linear combination of its received symbols and their conjugates,with the scaling factor chosen based on automatic gain control. We consider equal power allocation (EPA) across the relays, as well as the optimal power allocation (OPA) strategy given access to instantaneous channel state information (CSI). For EPA, we derive an upper bound on the pairwise-error-probability (PEP), from which we prove that full diversity is achieved in TWRNs. This result is in contrast to one-way relay networks, in which case a maximum diversity order of only unity can be obtained. When instantaneous CSI is available at the relays, we show that the OPA which minimizes the conditional PEP of the worse link can be cast as a generalized linear fractional program, which can be solved efficiently using the Dinkelback-type procedure.We also prove that, if the sum-power of the relay terminals is constrained, then the OPA will activate at most two relays.
Resumo:
Competition studies with soybeans, Glycine max (L.) Merr. "Bragg." and sicklepod, Cassia obtusifolia L., were conducted at the Agricultural Research and Education Center of the University of Florida in Quincy, Florida. Two field experiments were established, one on May 22, 1975. and the other four weeks later, on June 19, 1975, to determine the competitive effects of various sicklepod densities and the influences of soybean row distances on weed dry matter, soybear plant characteristics, yield components and seed yield, and on soil nutrient content. Control, low, medium, and high sicklepod densities in the first experiment were O, 25,000, 53,000, and 77,000 p1ants/ha, respectively; while the second experiment presented control, low, medium, and high sicklepod densities of O, 36,000, 68,000, and 122,000 plants/ha, respectively. Three soybean row distance treatments were tested using a constant pattern of 90-, 60-, and 45-cm widths throughout the growing season. Three other treatments, evaluated in a variable patern, were initially seeded in 30-cm row widths. Five weeks after planting, an appropriate number of soybean rows were harvested from the 30"cm pattern to establish row distances of 90, 60, and 30-60 cm for the remainder of the season. ln the greenhouse a test was conducted to evaluate the effects af those variables on seed germination and seedling vigor for the next soybean generation. As a result of full-season sicklepod competition, soybean plants were less branched, set fewer leaves, and presented thinner stems as compared to the control. However, height of soybean plants was not affected by the presence of sicklepod. ln one of the two experiments, number of nodes decreased for soybeans under weed campetition. The yield components--number of pods; number of seeds, and seed yield per soybean plant--were all similarly reduced due to weed competition. Seeds per pod were decreased to a lesser extent. Soybean seed yields per unit area were significantly diminished by increasing levels af sicklepod ínfestation. While the control produced 3120 kg/ha, the sicklepod densities of 25,000, 53,000, and 77,000 plants/ha reduced seed yíelds 47, 65, and 73%, respectively. As soybean row distances decreased, number of branches, number of leaves, and stem diameter of soybeans decreased. However, the height of soybean plants increased with narrwing of row width. The components of seed yield--number of pods, number of seeds, and seed yield per soybean plant--diminished as row spacing was reduced. Maximum difference between row distances for these attributes was attained for soybean plants under weed-free conditions. Generally, as row width decreased, soybean seed yield per unit area increased. Specifically, soybear.s in 90-cm rows, either in constant or variable row pattern, yielded less than soybeans in 60- and 30-60-cm rows in the variable pattern. Soil contents of phosphorus, potassium, calcium, and magnesium were not affected by the various levels of sicklepod and soybean populalions. Neither the sicklepod densities nor the soybean row distances influenced seed germination and seedling vigor in the next soybean generation. Sicklepod was a strong competitor with soybeans at all density ranges investigated. Because sicklepod grows taller than soybeans during the reproductive stages of the crop, limited success can be reached by varying row spacing alone. However, this practice is considered an integral measure to complement other methods of sicklepod control. Compared to constant rows, the soybean cropping system using variable row spacings presents the choice of planting soybeans at close row spacings to provide early competition with weeds and the possibility of obtaining a forage crop after the first month of growth, without any decreases on the final seed yields.
Resumo:
Study objectives: This study was developed to investigate the influence of thoracic and upperlimb muscle function on 6-min walk distance (6MWD) in patients with COPD.Design: A prospective, cross-sectional study.Setting: the pulmonary rehabilitation center of a university hospital.Patients: Thirty-eight patients with mild to very severe COPD were evaluated.Measurements and results: Pulmonary function and baseline dyspnea index (BDI) were assessed, handgrip strength, maximal inspiratory pressure (Pimax), and 6MWD were measured, and the one-repetition maximum (1RM) was determined for each of four exercises (bench press, lat pull down, leg extension, and leg press) performed on gymnasium equipment. Quality of life was assessed using the St. George Respiratory Questionnaire (SGRQ). We found statistically significant positive correlations between 6MWD and body weight (r = 0.32; p < 0.05), BDI (r = 0.50; p < 0.01), FEV, (r = 0.33; p < 0.05), PImax (r = 0.53; p < 0.01), and all values of 1RM. A statistically significant negative correlation was observed between 6MWD and dyspnea at the end of the 6-min walk test (r = -0.29; p < 0.05), as well as between 6MWD and the SGRQ activity domain (r = -0.45; p < 0.01) and impact domain (r = -0.34; p < 0.05) and total score (r = -0.40; p < 0.01). Multiple regression analysis selected body weight, BDI, Pimax, and lat pull down IRM as predictive factors for 6MWD (R-2 = 0.589).Conclusions: the results of this study showed the importance of the skeletal musculature of the thorax and upper limbs in submaximal exercise tolerance and could open new perspectives for training programs designed to improve functional activity in COPD patients.