888 resultados para TOPOLOGICAL GAMES
Resumo:
It is increasingly asserted that the disagreements of abstract principle between adversaries in the euthanasia debate fail to account for the complex, particular and ambiguous experiences of people at the end of their lives. A greater research effort into experiences, meaning, connection, vulnerability and motivation is advocated, during which the euthanasia 'question' should remain open. I argue that this is a normative strategy, which is felicitous to the status quo and further medicalises the end of life, but which masquerades as a value-neutral assertion about needing more knowledge.
Resumo:
beta-turns are important topological motifs for biological recognition of proteins and peptides. Organic molecules that sample the side chain positions of beta-turns have shown broad binding capacity to multiple different receptors, for example benzodiazepines. beta-turns have traditionally been classified into various types based on the backbone dihedral angles (phi 2, psi 2, phi 3 and psi 3). Indeed, 57-68% of beta-turns are currently classified into 8 different backbone families (Type I, Type II, Type I', Type II', Type VIII, Type VIa1, Type VIa2 and Type VIb and Type IV which represents unclassified beta-turns). Although this classification of beta-turns has been useful, the resulting beta-turn types are not ideal for the design of beta-turn mimetics as they do not reflect topological features of the recognition elements, the side chains. To overcome this, we have extracted beta-turns from a data set of non-homologous and high-resolution protein crystal structures. The side chain positions, as defined by C-alpha-C-beta vectors, of these turns have been clustered using the kth nearest neighbor clustering and filtered nearest centroid sorting algorithms. Nine clusters were obtained that cluster 90% of the data, and the average intra-cluster RMSD of the four C-alpha-C-beta vectors is 0.36. The nine clusters therefore represent the topology of the side chain scaffold architecture of the vast majority of beta-turns. The mean structures of the nine clusters are useful for the development of beta-turn mimetics and as biological descriptors for focusing combinatorial chemistry towards biologically relevant topological space.
Resumo:
Conotoxins, disulfide-rich peptides from the venom of cone snails, have created much excitement over recent years due to their potency and specificity for ion channels and their therapeutic potential. One recently identified conotoxin, MrIA, a 13-residue member of the chi-conotoxin family, inhibits the human norepinephrine transporter (NET) and has potential applications in the treatment of pain. In the current study, we show that the, beta-hairpin structure of native MrIA is retained in a synthetic cyclic version, as is biological activity at the NET. Furthermore, the cyclic version has increased resistance to trypsin digestion relative to the native peptide, an intriguing result because the cleavage site for the trypsin is not close to the cyclization site. The use of peptides as drugs is generally hampered by susceptibility to proteolysis, and so, the increase in enzymatic stability against trypsin observed in the current study may be useful in improving the therapeutic potential of MrIA. Furthermore, the structure reported here for cyclic MrIA represents a new topology among a growing number of circular disulfide-rich peptides.
Resumo:
Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this article, we present several novel techniques to effectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important level-two topological relations: contains, contained, overlap, and disjoint. We first present a novel framework to construct a multiscale Euler histogram in 2D space with the guarantee of the exact summarization results for aligned windows in constant time. To minimize the storage space in such a multiscale Euler histogram, an approximate algorithm with the approximate ratio 19/12 is presented, while the problem is shown NP-hard generally. To conform to a limited storage space where a multiscale histogram may be allowed to have only k Euler histograms, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy in approximately summarizing aligned windows. Then, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. We also investigate the problem of nonaligned windows and the problem of effectively partitioning the data space to support nonaligned window queries. Finally, we extend our techniques to 3D space. Our extensive experiments against both synthetic and real world datasets demonstrate that the approximate multiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost efficiency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for many popular real datasets.
Resumo:
This paper describes a series of design games, specifically aimed at exploring shifts in human agency in order to inform the design of context-aware applications. The games focused on understanding information handling issues in dental practice with participants from a university dental school playing an active role in the activities. Participatory design activities help participants to reveal potential implicit technical resources that can be presented explicitly in technologies in order to assist humans in managing their interactions with and amidst technical systems gracefully.