164 resultados para Automatic selection
Resumo:
Cooperative relaying combined with selection exploits spatial diversity to significantly improve the performance of interference-constrained secondary users in an underlay cognitive radio (CR) network. However, unlike conventional relaying, the state of the links between the relay and the primary receiver affects the choice of the relay. Further, while the optimal amplify-and-forward (AF) relay selection rule for underlay CR is well understood for the peak interference-constraint, this is not so for the less conservative average interference constraint. For the latter, we present three novel AF relay selection (RS) rules, namely, symbol error probability (SEP)-optimal, inverse-of-affine (IOA), and linear rules. We analyze the SEPs of the IOA and linear rules and also develop a novel, accurate approximation technique for analyzing the performance of AF relays. Extensive numerical results show that all the three rules outperform several RS rules proposed in the literature and generalize the conventional AF RS rule.
Resumo:
The crystallization of 28 binary and ternary cocrystals of quercetin with dibasic coformers is analyzed in terms of a combinatorial selection from a solution of preferred molecular conformations and supramolecular synthons. The crystal structures are characterized by distinctive O-H center dot center dot center dot N and O-H center dot center dot center dot O based synthons and are classified as nonporous, porous and helical. Variability in molecular conformation and synthon structure led to an increase in the energetic and structural space around the crystallization event. This space is the crystal structure landscape of the compound and is explored by fine-tuning the experimental conditions of crystallization. In the landscape context, we develop a strategy for the isolation of ternary cocrystals with the use of auxiliary template molecules to reduce the molecular and supramolecular `confusion' that is inherent in a molecule like quercetin. The absence of concomitant polymorphism in this study highlights the selectivity in conformation and synthon choice from the virtual combinatorial library in solution.
Resumo:
Flexray is a high speed communication protocol designed for distributive control in automotive control applications. Control performance not only depends on the control algorithm but also on the scheduling constraints in communication. A balance between the control performance and communication constraints must required for the choice of the sampling rates of the control loops in a node. In this paper, an optimum sampling period of control loops to minimize the cost function, satisfying the scheduling constraints is obtained. An algorithm to obtain the delay in service of each task in a node of the control loop in the hyper period has been also developed. (C) 2015 The Authors. Published by Elsevier B.V.
Resumo:
For a multilayered specimen, the back-scattered signal in frequency-domain optical-coherence tomography (FDOCT) is expressible as a sum of cosines, each corresponding to a change of refractive index in the specimen. Each of the cosines represent a peak in the reconstructed tomogram. We consider a truncated cosine series representation of the signal, with the constraint that the coefficients in the basis expansion be sparse. An l(2) (sum of squared errors) data error is considered with an l(1) (summation of absolute values) constraint on the coefficients. The optimization problem is solved using Weiszfeld's iteratively reweighted least squares (IRLS) algorithm. On real FDOCT data, improved results are obtained over the standard reconstruction technique with lower levels of background measurement noise and artifacts due to a strong l(1) penalty. The previous sparse tomogram reconstruction techniques in the literature proposed collecting sparse samples, necessitating a change in the data capturing process conventionally used in FDOCT. The IRLS-based method proposed in this paper does not suffer from this drawback.
Resumo:
This paper considers the problem of receive antenna selection (AS) in a multiple-antenna communication system having a single radio-frequency (RF) chain. The AS decisions are based on noisy channel estimates obtained using known pilot symbols embedded in the data packets. The goal here is to minimize the average packet error rate (PER) by exploiting the known temporal correlation of the channel. As the underlying channels are only partially observed using the pilot symbols, the problem of AS for PER minimization is cast into a partially observable Markov decision process (POMDP) framework. Under mild assumptions, the optimality of a myopic policy is established for the two-state channel case. Moreover, two heuristic AS schemes are proposed based on a weighted combination of the estimated channel states on the different antennas. These schemes utilize the continuous valued received pilot symbols to make the AS decisions, and are shown to offer performance comparable to the POMDP approach, which requires one to quantize the channel and observations to a finite set of states. The performance improvement offered by the POMDP solution and the proposed heuristic solutions relative to existing AS training-based approaches is illustrated using Monte Carlo simulations.
Resumo:
A new automatic algorithm for the assessment of mixed mode crack growth rate characteristics is presented based on the concept of an equivalent crack. The residual ligament size approach is introduced to implementation this algorithm for identifying the crack tip position on a curved path with respect to the drop potential signal. The automatic algorithm accounting for the curvilinear crack trajectory and employing an electrical potential difference was calibrated with respect to the optical measurements for the growing crack under cyclic mixed mode loading conditions. The effectiveness of the proposed algorithm is confirmed by fatigue tests performed on ST3 steel compact tension-shear specimens in the full range of mode mixities from pure mode Ito pure mode II. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
Selection of relevant features is an open problem in Brain-computer interfacing (BCI) research. Sometimes, features extracted from brain signals are high dimensional which in turn affects the accuracy of the classifier. Selection of the most relevant features improves the performance of the classifier and reduces the computational cost of the system. In this study, we have used a combination of Bacterial Foraging Optimization and Learning Automata to determine the best subset of features from a given motor imagery electroencephalography (EEG) based BCI dataset. Here, we have employed Discrete Wavelet Transform to obtain a high dimensional feature set and classified it by Distance Likelihood Ratio Test. Our proposed feature selector produced an accuracy of 80.291% in 216 seconds.
Resumo:
The structures of nine independent crystals of bitter gourd seed lectin (BGSL), a non-toxic homologue of type II RIPs, and its sugar complexes have been determined. The four-chain, two-fold symmetric, protein is made up of two identical two-chain modules, each consisting of a catalytic chain and a lectin chain, connected by a disulphide bridge. The lectin chain is made up of two domains. Each domain carries a carbohydrate binding site in type II RIPs of known structure. BGSL has a sugar binding site only on one domain, thus impairing its interaction at the cell surface. The adenine binding site in the catalytic chain is defective. Thus, defects in sugar binding as well as adenine binding appear to contribute to the non-toxicity of the lectin. The plasticity of the molecule is mainly caused by the presence of two possible well defined conformations of a surface loop in the lectin chain. One of them is chosen in the sugar complexes, in a case of conformational selection, as the chosen conformation facilitates an additional interaction with the sugar, involving an arginyl residue in the loop. The N-glycosylation of the lectin involves a plant-specific glycan while that in toxic type II RIPs of known structure involves a glycan which is animal as well as plant specific.
Resumo:
Ropalidia marginata is a primitively eusocial wasp widely distributed in peninsular India. Although solitary females found a small proportion of nests, the vast majority of new nests are founded by small groups of females. In suchmultiple foundress nests, a single dominant female functions as the queen and lays eggs, while the rest function as sterile workers and care for the queen's brood. Previous attempts to understand the evolution of social behaviour and altruism in this species have employed inclusive fitness theory (kin selection) as a guiding framework. Although inclusive fitness theory is quite successful in explaining the high propensity of the wasps to found nests in groups, several features of their social organization suggest that forces other than kin selection may also have played a significant role in the evolution of this species. These features include lowering of genetic relatedness owing to polyandry and serial polygyny, nest foundation by unrelated individuals, acceptance of young non-nest-mates, a combination of well-developed nest-mate recognition and lack of intra-colony kin recognition, a combination of meek and docile queens and a decentralized self-organized work force, long reproductive queues with cryptic heir designates and conflict-free queen succession, all resulting in extreme intra-colony cooperation and inter-colony conflict.
Resumo:
A new method of selection of time-to-go (t(go)) for Generalized Vector Explicit Guidance (GENEX) law have been proposed in this paper. t(go) is known to be an important parameter in the control and cost function of GENEX guidance law. In this paper the formulation has been done to find an optimal value of t(go) that minimizes the performance cost. Mechanization of GENEX with this optimal t(go) reduces the lateral acceleration demand and consequently increases the range of the interceptor. This new formulation of computing t(go) comes in closed form and thus it can be implemented onboard. This new formulation is applied in the terminal phase of an surface-to-air interceptor for an angle constrained engagement. Results generated by simulation justify the use of optimal t(go).
Resumo:
This paper presents the design and implementation of PolyMage, a domain-specific language and compiler for image processing pipelines. An image processing pipeline can be viewed as a graph of interconnected stages which process images successively. Each stage typically performs one of point-wise, stencil, reduction or data-dependent operations on image pixels. Individual stages in a pipeline typically exhibit abundant data parallelism that can be exploited with relative ease. However, the stages also require high memory bandwidth preventing effective utilization of parallelism available on modern architectures. For applications that demand high performance, the traditional options are to use optimized libraries like OpenCV or to optimize manually. While using libraries precludes optimization across library routines, manual optimization accounting for both parallelism and locality is very tedious. The focus of our system, PolyMage, is on automatically generating high-performance implementations of image processing pipelines expressed in a high-level declarative language. Our optimization approach primarily relies on the transformation and code generation capabilities of the polyhedral compiler framework. To the best of our knowledge, this is the first model-driven compiler for image processing pipelines that performs complex fusion, tiling, and storage optimization automatically. Experimental results on a modern multicore system show that the performance achieved by our automatic approach is up to 1.81x better than that achieved through manual tuning in Halide, a state-of-the-art language and compiler for image processing pipelines. For a camera raw image processing pipeline, our performance is comparable to that of a hand-tuned implementation.
Resumo:
Tb0.3Dy0.7Fe1.95 alloy was directionally solidified by using a modified Bridgman technique at a wide range of growth rates of 5 to 100 cm/h. The directionally grown samples exhibited plane front solidification morphology up to a growth rate of 90 cm/h. Typical island banding feature was observed closer to the chilled end, which eventually gave rise to irregular peritectic coupled growth (PCG). The PCG gained prominence with an increase in the growth rate. The texture study revealed formation of strong aOE (c) 311 > texture in a lower growth rate regime, aOE (c) 110 > and ``rotated aOE (c) 110 > aEuroe in an intermediate growth regime, and aOE (c) 112 > in a higher growth rate regime. In-depth analysis of the atomic configuration of a solid-liquid interface revealed that the growth texture is influenced by the kinetics of atomic attachment to the solid-liquid interface, which is intimately related to a planar packing fraction and an atomic stacking sequence of the interfacial plane. The mechanism proposed in this article is novel and will be useful in addressing the orientation selection mechanism of topologically closed packed intermetallic systems. The samples grown at a higher growth rate exhibit larger magnetostriction (lambda) and d lambda/dH owing to the absence of pro-peritectic (Tb,Dy)Fe-3 and formation of aOE (c) 112 > texture, which lies closer to the easy magnetization direction (EMD).
Resumo:
Since streaming data keeps coming continuously as an ordered sequence, massive amounts of data is created. A big challenge in handling data streams is the limitation of time and space. Prototype selection on streaming data requires the prototypes to be updated in an incremental manner as new data comes in. We propose an incremental algorithm for prototype selection. This algorithm can also be used to handle very large datasets. Results have been presented on a number of large datasets and our method is compared to an existing algorithm for streaming data. Our algorithm saves time and the prototypes selected gives good classification accuracy.
Resumo:
Cooperative relaying combined with selection exploits spatial diversity to significantly improve the performance of interference-constrained secondary users in an underlay cognitive radio network. We present a novel and optimal relay selection (RS) rule that minimizes the symbol error probability (SEP) of an average interference-constrained underlay secondary system that uses amplify-and-forward relays. A key point that the rule highlights for the first time is that, for the average interference constraint, the signal-to-interference-plus-noise-ratio (SINR) of the direct source-to-destination (SI)) link affects the choice of the optimal relay. Furthermore, as the SINR increases, the odds that no relay transmits increase. We also propose a simpler, more practical, and near-optimal variant of the optimal rule that requires just one bit of feedback about the state of the SD link to the relays. Compared to the SD-unaware ad hoc RS rules proposed in the literature, the proposed rules markedly reduce the SEP by up to two orders of magnitude.