873 resultados para constrained clustering
Resumo:
This paper deals with the design of a high data rate code-division multiple-access (CDMA) system under a speci¯ed jamming mar- gin speci¯cation as well as hardware and band-width limitations. Several choices had to be made in coming up with the design such as specify-ing the number of subcarriers, choice of spread-ing codes and the nature of the modulation.The rationale behind each of the choices made is given. Descriptions of transmitter and receiver are also included. Relevant simulations of cross-correlation are also provided.
Resumo:
BaTiO3/BaZrO3 superlattices with varying periodicities were grown on SrRuO3 buffered MgO (001) substrates by pulsed laser ablation. Ferroelectric measurements were done and correlated to the strain in the heterostructures. The results of ferroelectric measurements indicate an apparent suppression of polarization in the low period superlattices and the onset of weakly ferroelectric behavior in higher period superlattices. Measured switchable polarization values indicate that contribution is primarily from the BaTiO3 in the structure. These results have been correlated to the interfacial strain and the critical thickness of BaTiO3 when grown over tensile substrates such as MgO.
Resumo:
A nonlinear suboptimal guidance law is presented in this paper for successful interception of ground targets by air-launched missiles and guided munitions. The main feature of this guidance law is that it accurately satisfies terminal impact angle constraints in both azimuth as well as elevation simultaneously. In addition, it is capable of hitting the target with high accuracy as well as minimizing the lateral acceleration demand. The guidance law is synthesized using recently developed model predictive static programming (MPSP). Performance of the proposed MPSP guidance is demonstrated using three-dimensional (3-D) nonlinear engagement dynamics by considering stationary, moving, and maneuvering targets. Effectiveness of the proposed guidance has also been verified by considering first. order autopilot lag as well as assuming inaccurate information about target maneuvers. Multiple munitions engagement results are presented as well. Moreover, comparison studies with respect to an augmented proportional navigation guidance (which does not impose impact angle constraints) as well as an explicit linear optimal guidance (which imposes the same impact angle constraints in 3-D) lead to the conclusion that the proposed MPSP guidance is superior to both. A large number of randomized simulation studies show that it also has a larger capture region.
Resumo:
Dendritic rnicroenvironments defined by dynamic internal cavities of a dendrimer were probed through geometric isomerization of stilbene and azobenzene. A third-generation poly(alkyl aryl ether) dendrimer with hydrophilic exterior and hydrophobic interior was used as a reaction cavity in aqueous medium. The dynamic inner cavity sizes were varied by utilizing alkyl linkers that connect the branch junctures from ethyl to n-pentyl moiety (C(2)G(3)-C(5)G(3)). Dendrimers constituted with n-pentyl linker were found to afford higher solubilities of stilbene and azobenzene. Direct irradiation of trans-stilbene showed that C(5)G(3) and C(4)G(3) dendrimers afforded considerable phenanthrene formation, in addition to cis-stilbene, whereas C(3)G(3) and C(2)G(3) gave only cis-stilbene. An electron-transfer sensitized trans-cis isomerization, using cresyl violet perchlorate as the sensitizer, also led to similar results. Thermal isomerization of cis-azobenzene to trans-azobenzene within dendritic microenvironments revealed that the activation energy of the cis- to trans-isomer was increasing in the series C(5)G(3) < C(4)G(3) < C(3)G(3)
Resumo:
The throughput-optimal discrete-rate adaptation policy, when nodes are subject to constraints on the average power and bit error rate, is governed by a power control parameter, for which a closed-form characterization has remained an open problem. The parameter is essential in determining the rate adaptation thresholds and the transmit rate and power at any time, and ensuring adherence to the power constraint. We derive novel insightful bounds and approximations that characterize the power control parameter and the throughput in closed-form. The results are comprehensive as they apply to the general class of Nakagami-m (m >= 1) fading channels, which includes Rayleigh fading, uncoded and coded modulation, and single and multi-node systems with selection. The results are appealing as they are provably tight in the asymptotic large average power regime, and are designed and verified to be accurate even for smaller average powers.
Resumo:
The effect of incorporation of a centrally positioned Ac(6)c-Xxx segment where Xxx = (L)Val/(D)Val into a host oligopeptide composed of L-amino acid residues has been investigated. Studies of four designed octapeptides Boc-Leu-Phe-Val-Ac(6)c-Xxx-Leu-Phe-Val-OMe (Xxx = (D)Val 1, (L)Val 2) Boc-Leu-Val-Val-Ac(6)c-Xxx-Leu-Val-Val-OMe (Xxx = (D)Val 3, (L)Val 4) are reported. Diagnostic nuclear Overhouse effects characteristic of hairpin conformations are observed for Xxx = (D)Val peptides (1 and 3) while continuous helical conformation characterized by sequential NiH <-> Ni+1H NOEs are favored for Xxx = (L)Val peptides (2 and 4) in methanol solutions. Temperature co-efficient of NH chemical shifts are in agreement with distinctly different conformational preferences upon changing the configuration of the residue at position 5. Crystal structures of peptides 2 and 4 (Xxx = (L)Val) establish helical conformations in the solid state, in agreement with the structures deduced from NMR data. The results support the design principle that centrally positioned type I beta-turns may be used to nucleate helices in short peptides, while type I' beta-turns can facilitate folding into beta-hairpins.
Resumo:
Background & objectives: There is a need to develop an affordable and reliable tool for hearing screening of neonates in resource constrained, medically underserved areas of developing nations. This study valuates a strategy of health worker based screening of neonates using a low cost mechanical calibrated noisemaker followed up with parental monitoring of age appropriate auditory milestones for detecting severe-profound hearing impairment in infants by 6 months of age. Methods: A trained health worker under the supervision of a qualified audiologist screened 425 neonates of whom 20 had confirmed severe-profound hearing impairment. Mechanical calibrated noisemakers of 50, 60, 70 and 80 dB (A) were used to elicit the behavioural responses. The parents of screened neonates were instructed to monitor the normal language and auditory milestones till 6 months of age. This strategy was validated against the reference standard consisting of a battery of tests - namely, auditory brain stem response (ABR), otoacoustic emissions (OAE) and behavioural assessment at 2 years of age. Bayesian prevalence weighted measures of screening were calculated. Results: The sensitivity and specificity was high with least false positive referrals for. 70 and 80 dB (A) noisemakers. All the noisemakers had 100 per cent negative predictive value. 70 and 80 dB (A) noisemakers had high positive likelihood ratios of 19 and 34, respectively. The probability differences for pre- and post- test positive was 43 and 58 for 70 and 80 dB (A) noisemakers, respectively. Interpretation & conclusions: In a controlled setting, health workers with primary education can be trained to use a mechanical calibrated noisemaker made of locally available material to reliably screen for severe-profound hearing loss in neonates. The monitoring of auditory responses could be done by informed parents. Multi-centre field trials of this strategy need to be carried out to examine the feasibility of community health care workers using it in resource constrained settings of developing nations to implement an effective national neonatal hearing screening programme.
Resumo:
We develop an online actor-critic reinforcement learning algorithm with function approximation for a problem of control under inequality constraints. We consider the long-run average cost Markov decision process (MDP) framework in which both the objective and the constraint functions are suitable policy-dependent long-run averages of certain sample path functions. The Lagrange multiplier method is used to handle the inequality constraints. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal solution. We also provide the results of numerical experiments on a problem of routing in a multi-stage queueing network with constraints on long-run average queue lengths. We observe that our algorithm exhibits good performance on this setting and converges to a feasible point.
Resumo:
This paper presents hierarchical clustering algorithms for land cover mapping problem using multi-spectral satellite images. In unsupervised techniques, the automatic generation of number of clusters and its centers for a huge database is not exploited to their full potential. Hence, a hierarchical clustering algorithm that uses splitting and merging techniques is proposed. Initially, the splitting method is used to search for the best possible number of clusters and its centers using Mean Shift Clustering (MSC), Niche Particle Swarm Optimization (NPSO) and Glowworm Swarm Optimization (GSO). Using these clusters and its centers, the merging method is used to group the data points based on a parametric method (k-means algorithm). A performance comparison of the proposed hierarchical clustering algorithms (MSC, NPSO and GSO) is presented using two typical multi-spectral satellite images - Landsat 7 thematic mapper and QuickBird. From the results obtained, we conclude that the proposed GSO based hierarchical clustering algorithm is more accurate and robust.
Resumo:
Lack of supervision in clustering algorithms often leads to clusters that are not useful or interesting to human reviewers. We investigate if supervision can be automatically transferred for clustering a target task, by providing a relevant supervised partitioning of a dataset from a different source task. The target clustering is made more meaningful for the human user by trading-off intrinsic clustering goodness on the target task for alignment with relevant supervised partitions in the source task, wherever possible. We propose a cross-guided clustering algorithm that builds on traditional k-means by aligning the target clusters with source partitions. The alignment process makes use of a cross-task similarity measure that discovers hidden relationships across tasks. When the source and target tasks correspond to different domains with potentially different vocabularies, we propose a projection approach using pivot vocabularies for the cross-domain similarity measure. Using multiple real-world and synthetic datasets, we show that our approach improves clustering accuracy significantly over traditional k-means and state-of-the-art semi-supervised clustering baselines, over a wide range of data characteristics and parameter settings.
Resumo:
A novel approach that can more effectively use the structural information provided by the traditional imaging modalities in multimodal diffuse optical tomographic imaging is introduced. This approach is based on a prior image-constrained-l(1) minimization scheme and has been motivated by the recent progress in the sparse image reconstruction techniques. It is shown that the proposed framework is more effective in terms of localizing the tumor region and recovering the optical property values both in numerical and gelatin phantom cases compared to the traditional methods that use structural information. (C) 2012 Optical Society of America
Resumo:
Backbone alkylation has been shown to result in a dramatic reduction in the conformational space that is sterically accessible to a-amino acid residues in peptides. By extension, the presence of geminal dialkyl substituents at backbone atoms also restricts available conformational space for beta and ? residues. Five peptides containing the achiral beta 2,2-disubstituted beta-amino acid residue, 1-(aminomethyl)cyclohexanecarboxylic acid (beta 2,2Ac6c), have been structurally characterized in crystals by X-ray diffraction. The tripeptide Boc-Aib-beta 2,2Ac6c-Aib-OMe (1) adopts a novel fold stabilized by two intramolecular H-bonds (C11 and C9) of opposite directionality. The tetrapeptide Boc-Aib-beta 2,2Ac6c]2-OMe (2) and pentapeptide Boc-Aib-beta 2,2Ac6c]2-Aib-OMe (3) form short stretches of a hybrid a beta C11 helix stabilized by two and three intramolecular H-bonds, respectively. The structure of the dipeptide Boc-Aib-beta 2,2Ac6c-OMe (5) does not reveal any intramolecular H-bond. The aggregation pattern in the crystal provides an example of an extended conformation of the beta 2,2Ac6c residue, forming a polar sheet like H-bond. The protected derivative Ac-beta 2,2Ac6c-NHMe (4) adopts a locally folded gauche conformation about the C beta?Ca bonds (?=-55.7 degrees). Of the seven examples of beta 2,2Ac6c residues reported here, six adopt gauche conformations, a feature which promotes local folding when incorporated into peptides. A comparison between the conformational properties of beta 2,2Ac6c and beta 3,3Ac6c residues, in peptides, is presented. Backbone torsional parameters of H-bonded a beta/beta a turns are derived from the structures presented in this study and earlier reports.
Resumo:
In this paper, we develop a game theoretic approach for clustering features in a learning problem. Feature clustering can serve as an important preprocessing step in many problems such as feature selection, dimensionality reduction, etc. In this approach, we view features as rational players of a coalitional game where they form coalitions (or clusters) among themselves in order to maximize their individual payoffs. We show how Nash Stable Partition (NSP), a well known concept in the coalitional game theory, provides a natural way of clustering features. Through this approach, one can obtain some desirable properties of the clusters by choosing appropriate payoff functions. For a small number of features, the NSP based clustering can be found by solving an integer linear program (ILP). However, for large number of features, the ILP based approach does not scale well and hence we propose a hierarchical approach. Interestingly, a key result that we prove on the equivalence between a k-size NSP of a coalitional game and minimum k-cut of an appropriately constructed graph comes in handy for large scale problems. In this paper, we use feature selection problem (in a classification setting) as a running example to illustrate our approach. We conduct experiments to illustrate the efficacy of our approach.