873 resultados para constrained clustering
Resumo:
This paper presents an analysis of an optimal linear filter in the presence of constraints on the moan squared values of the estimates from the viewpoint of singular optimal control. The singular arc has been shown to satisfy the generalized Legcndrc-Clebseh condition and Jacobson's condition. Both the cases of white measurement noise and coloured measurement noise are considered. The constrained estimate is shown to be a linear transformation of the unconstrained Kalman estimate.
Resumo:
A new clustering technique, based on the concept of immediato neighbourhood, with a novel capability to self-learn the number of clusters expected in the unsupervized environment, has been developed. The method compares favourably with other clustering schemes based on distance measures, both in terms of conceptual innovations and computational economy. Test implementation of the scheme using C-l flight line training sample data in a simulated unsupervized mode has brought out the efficacy of the technique. The technique can easily be implemented as a front end to established pattern classification systems with supervized learning capabilities to derive unified learning systems capable of operating in both supervized and unsupervized environments. This makes the technique an attractive proposition in the context of remotely sensed earth resources data analysis wherein it is essential to have such a unified learning system capability.
Resumo:
As one of the most widely used wireless network technologies, IEEE 802.11 wireless local area networks (WLANs) have found a dramatically increasing number of applications in soft real-time networked control systems (NCSs). To fulfill the real-time requirements in such NCSs, most of the bandwidth of the wireless networks need to be allocated to high-priority data for periodic measurements and control with deadline requirements. However, existing QoS-enabled 802.11 medium access control (MAC) protocols do not consider the deadline requirements explicitly, leading to unpredictable deadline performance of NCS networks. Consequentially, the soft real-time requirements of the periodic traffic may not be satisfied, particularly under congested network conditions. This paper makes two main contributions to address this problem in wireless NCSs. Firstly, a deadline-constrained MAC protocol with QoS differentiation is presented for IEEE 802.11 soft real-time NCSs. It handles periodic traffic by developing two specific mechanisms: a contention-sensitive backoff mechanism, and an intra-traffic-class QoS differentiation mechanism. Secondly, a theoretical model is established to describe the deadline-constrained MAC protocol and evaluate its performance of throughput, delay and packet-loss ratio in wireless NCSs. Numerical studies are conducted to validate the accuracy of the theoretical model and to demonstrate the effectiveness of the new MAC protocol.
Resumo:
Gabapentin (1-aminomethylcyclohexaneacetic acid, Gpn) is an achiral, conformationally constrained gamma amino acid residue. A survey of available crystal structures of Gpn peptides reveals that the torsion angles about the C-gamma-C-beta (theta(1)) and C-beta-C-alpha(theta(2)) bonds are overwhelmingly limited to gauche, gauche (g(+)g(+)/g(-)g(-)) conformations. The Gpn residue forms C-7 and C-9 hydrogen bonds in which the donor and acceptor atoms come from the flanking peptide units. In combination with alpha amino acid residues alpha gamma and gamma alpha segments can adopt C-12 hydrogen bonded structures. The conformational choices available to the Gpn residue have been probed using energy calculations, adopting a grid search strategy. Ramachandran phi-psi maps have been constructed for fixed values of theta(1) and theta(2), corresponding to the gauche and trans conformations. The sterically allowed and energetically favorable regions of conformational space have been defined and experimental observations compared. C-7 and C-9 hydrogen bonded conformational families have been identified using a grid search approach in which theta(1) and theta(2) values are varied over a range of +/- 10 degrees about ideal values at 1 degrees intervals. The theoretical analysis together with experimental observations for 59 Gpn residues from 35 crystal structures permits definition of the limited range of conformational possibilities at this gamma amino acid residue. .
Resumo:
Nature has used the all-alpha-polypeptide backbone of proteins to create a remarkable diversity of folded structures. Sequential patterns of 20 distinct amino adds, which differ only in their side chains, determine the shape and form of proteins. Our understanding of these specific secondary structures is over half a century old and is based primarily on the fundamental elements: the Pauling alpha-helix and beta-sheet. Researchers can also generate structural diversity through the synthesis of polypeptide chains containing homologated (omega) amino acid residues, which contain a variable number of backbone atoms. However, incorporating amino adds with more atoms within the backbone introduces additional torsional freedom into the structure, which can complicate the structural analysis. Fortunately, gabapentin (Gpn), a readily available bulk drug, is an achiral beta,beta-disubstituted gamma amino add residue that contains a cyclohexyl ring at the C-beta carbon atom, which dramatically limits the range of torsion angles that can be obtained about the flanking C-C bonds. Limiting conformational flexibility also has the desirable effect of increasing peptide crystallinity, which permits unambiguous structural characterization by X-ray diffraction methods. This Account describes studies carried out in our laboratory that establish Gpn as a valuable residue in the design of specifically folded hybrid peptide structures. The insertion of additional atoms into polypeptide backbones facilitates the formation of intramolecular hydrogen bonds whose directionality is opposite to that observed in canonical alpha-peptide helices. If hybrid structures mimic proteins and biologically active peptides, the proteolytic stability conferred by unusual backbones can be a major advantage in the area of medicinal chemistry. We have demonstrated a variety of internally hydrogen-bonded structures in the solid state for Gpn-containing peptides, including the characterization of the C-7 and C-9 hydrogen bonds, which can lead to ribbons in homo-oligomeric sequences. In hybrid alpha gamma sequences, district C-12 hydrogen-bonded turn structures support formation of peptide helices and hairpins in longer sequences. Some peptides that include the Gpn residue have hydrogen-bond directionality that matches alpha-peptide helices, while others have the opposite directionality. We expect that expansion of the polypeptide backbone will lead to new classes of foldamer structures, which are thus far unknown to the world of alpha-polypeptides. The diversity of internally hydrogen-bonded structures observed in hybrid sequences containing Gpn shows promise for the rational design of novel peptide structures incorporating hybrid backbones.
Resumo:
This paper presents a statistical aircraft trajectory clustering approach aimed at discriminating between typical manned and expected unmanned traffic patterns. First, a resampled version of each trajectory is modelled using a mixture of Von Mises distributions (circular statistics). Second, the remodelled trajectories are globally aligned using tools from bioinformatics. Third, the alignment scores are used to cluster the trajectories using an iterative k-medoids approach and an appropriate distance function. The approach is then evaluated using synthetically generated unmanned aircraft flights combined with real air traffic position reports taken over a sector of Northern Queensland, Australia. Results suggest that the technique is useful in distinguishing between expected unmanned and manned aircraft traffic behaviour, as well as identifying some common conventional air traffic patterns.
Resumo:
Partitional clustering algorithms, which partition the dataset into a pre-defined number of clusters, can be broadly classified into two types: algorithms which explicitly take the number of clusters as input and algorithms that take the expected size of a cluster as input. In this paper, we propose a variant of the k-means algorithm and prove that it is more efficient than standard k-means algorithms. An important contribution of this paper is the establishment of a relation between the number of clusters and the size of the clusters in a dataset through the analysis of our algorithm. We also demonstrate that the integration of this algorithm as a pre-processing step in classification algorithms reduces their running-time complexity.
Resumo:
The crystal structures of three conformationally locked esters, namely the centrosymmetric tetrabenzoate of all-axial per-hydronaphthalene- 2,3,4a, 6,7,8a-hexaol, viz. trans-4a, 8a-dihydroxyperhydronaphthalene-2,3,6,7-tetrayl tetrabenzoate, C38H34O10, and the diacetate and dibenzoate of all-axial perhydronaphthalene-2,3,4a, 8a-tetraol, viz. (2R*,3R*,4aS*,8aS*)-4a, 8a-dihydroxyperhydronaphthalene-2,3-diyl diacetate, C-14-H22O6, and (2R*, 3R*, 4aS*, 8aS*)-4a, 8a-dihydroxyperhydronaphthalene- 2,3-diyl dibenzoate, C24H26O6, have been analyzed in order to examine the preference of their supramolecular assemblies towards competing inter-and intramolecular O-H center dot center dot center dot O hydrogen bonds. It was anticipated that the supramolecular assembly of the esters under study would adopt two principal hydrogen-bonding modes, namely one that employs intermolecular O-H center dot center dot center dot O hydrogen bonds (mode 1) and another that sacrifices those for intramolecular O-H center dot center dot center dot O hydrogen bonds and settles for a crystal packing dictated by weak intermolecular interactions alone (mode 2). Thus, while the molecular assembly of the two crystalline diacyl derivatives conformed to a combination of hydrogen-bonding modes 1 and 2, the crystal packing in the tetrabenzoate preferred to follow mode 2 exclusively.
Resumo:
he crystal structure of 12 peptides containing the conformationally constrained 1-(aminomethyl)cyclohexaneacetic acid, gabapentin (Gpn), are reported. In all the 39 Gpn residues conformationally characterized so far, the torsion angles about the C-alpha-C-beta and C-beta-C-gamma bonds are restricted to the gauche conformation (+/- 60 degrees). The Gpn residue is constrained to adopt folded conformations resulting in the formation of intramolecularly hydrogen-bonded structures even in short peptides. The peptides Boc-Ac(6)c-Gpn-OMe 1 and Boc-Gpn-Aib-Gpn-Aib-OMe 2 provide examples of C-7 conformation; peptides Boc-Gpn-Aib-OH 3, Boc-Ac(6)c-Gpn-OH 4, Boc-Val-Pro-Gpn-OH 5, Piv-Pro-Gpn-Val-OMe 6, and Boc-Gpn-Gpn-Leu-OMe 7 provide examples of C-9 conformation; peptide Boc-Ala-Aib-Gpn-Aib-Ala-OMe 8 provides an example of C-12 conformation and peptides Boc-beta Leu-Gpn-Val-OMe 9 and Boc-beta Phe-Gpn-Phe-OMe 10 provide examples of C-13 conformation. Gpn peptides provide examples of backbone expanded mimetics for canonical alpha-peptide turns like the gamma (C-7) and the beta (C-10) turns. The hybrid beta gamma sequences provide an example of a mimetic of the C-13 alpha-turn formed by three contiguous alpha-amino acid residues. Two examples of folded tripeptide structures, Boc-Gpn-beta Phe-Leu-OMe 11 and Boc-Aib-Gpn-beta Phg-NHMe 12, lacking internal hydrogen bonds are also presented. An analysis of available Gpn residue conformations provides the basis for future design of folded hybrid peptides.
Resumo:
The k-means algorithm is an extremely popular technique for clustering data. One of the major limitations of the k-means is that the time to cluster a given dataset D is linear in the number of clusters, k. In this paper, we employ height balanced trees to address this issue. Specifically, we make two major contributions, (a) we propose an algorithm, RACK (acronym for RApid Clustering using k-means), which takes time favorably comparable with the fastest known existing techniques, and (b) we prove an expected bound on the quality of clustering achieved using RACK. Our experimental results on large datasets strongly suggest that RACK is competitive with the k-means algorithm in terms of quality of clustering, while taking significantly less time.
Resumo:
The keyword based search technique suffers from the problem of synonymic and polysemic queries. Current approaches address only theproblem of synonymic queries in which different queries might have the same information requirement. But the problem of polysemic queries,i.e., same query having different intentions, still remains unaddressed. In this paper, we propose the notion of intent clusters, the members of which will have the same intention. We develop a clustering algorithm that uses the user session information in query logs in addition to query URL entries to identify cluster of queries having the same intention. The proposed approach has been studied through case examples from the actual log data from AOL, and the clustering algorithm is shown to be successful in discerning the user intentions.