918 resultados para entity
Resumo:
The progressive myoclonic epilepsies (PMEs) are a clinically and etiologically heterogeneous group of symptomatic epilepsies characterized by myoclonus, tonic-clonic seizures, psychomotor regression and ataxia. Different disorders have been classified as PMEs. Of these, the group of neuronal ceroid lipofuscinoses (NCLs) comprise an entity that has onset in childhood, being the most common cause of neurodegeneration in children. The primary aim of this thesis was to dissect the molecular genetic background of patients with childhood onset PME by studying candidate genes and attempting to identify novel PME-associated genes. Another specific aim was to study the primary protein properties of the most recently identified member of the NCL-causing proteins, MFSD8. To dissect the genetic background of a cohort of Turkish patients with childhood onset PME, a screen of the NCL-associated genes PPT1, TPP1, CLN3, CLN5, CLN6, MFSD8, CLN8 and CTSD was performed. Altogether 49 novel mutations were identified, which together with 56 mutations found by collaborators raised the total number of known NCL mutations to 364. Fourteen of the novel mutations affect the recently identified MFSD8 gene, which had originally been identified in a subset of mainly Turkish patients as the underlying cause of CLN7 disease. To investigate the distribution of MFSD8 defects, a total of 211 patients of different ethnic origins were evaluated for mutations in the gene. Altogether 45 patients from nine different countries were provided with a CLN7 molecular diagnosis, denoting the wide geographical occurrence of MFSD8 defects. The mutations are private with only one having been established by a founder-effect in the Roma population from the former Czechoslovakia. All mutations identified except one are associated with the typical clinical picture of variant late-infantile NCL. To address the trafficking properties of MFSD8, lysosomal targeting of the protein was confirmed in both neuronal and non-neuronal cells. The major determinant for this lysosomal sorting was identified to be an N-terminal dileucine based signal (9-EQEPLL-14), recognized by heterotetrameric AP-1 adaptor proteins, suggesting that MFSD8 takes the direct trafficking pathway en route to the lysosomes. Expression studies revealed the neurons as the primary cell-type and the hippocampus and cerebellar granular cell layer as the predominant regions in which MFSD8 is expressed. To identify novel genes associated with childhood onset PME, a single nucleotide polymorphism (SNP) genomewide scan was performed in three small families and 18 sporadic patients followed by homozygosity mapping to determine the candidate loci. One of the families and a sporadic patient were positive for mutations in PLA2G6, a gene that had previously been shown to cause infantile neuroaxonal dystrophy. Application of next-generation sequencing of candidate regions in the remaining two families led to identification of a homozygous missense mutation in USP19 for the first and TXNDC6 for the second family. Analysis of the 18 sporadic cases mapped the best candidate interval in a 1.5 Mb region on chromosome 7q21. Screening of the positional candidate KCTD7 revealed six mutations in seven unrelated families. All patients with mutations in KCTD7 were reported to have early onset PME, rapid disease progression leading to dementia and no pathologic hallmarks. The identification of KCTD7 mutations in nine patients and the clinical delineation of their phenotype establish KCTD7 as a gene for early onset PME. The findings presented in this thesis denote MFSD8 and KCTD7 as genes commonly associated with childhood onset symptomatic epilepsy. The disease-associated role of TXNDC6 awaits verification through identification of additional mutations in patients with similar phenotypes. Completion of the genetic spectrum underlying childhood onset PMEs and understanding of the gene products functions will comprise important steps towards understanding the underlying pathogenetic mechanisms, and will possibly shed light on the general processes of neurodegeneration and nervous system regulation, facilitating the diagnosis, classification and possibly treatment of the affected cases.
Resumo:
The anomalous X-ray scattering (AXS) method using Cu and Mo K absorption edges has been employed for obtaining the local structural information of superionic conducting glass having the composition (CuI)(0.3)(Cu2O)(0.35)(MoO3)(0.35). The possible atomic arrangements in near-neighbor region of this glass were estimated by coupling the results with the least-squares analysis so as to reproduce two differential intensity profiles for Cu and Mo as well as the ordinary scattering profile. The coordination number of oxygen around Mo is found to be 6.1 at the distance of 0.187 nm. This implies that the MoO6 octahedral unit is a more probable structural entity in the glass rather than MoO4 tetrahedra which has been proposed based on infrared spectroscopy. The pre-peak shoulder observed at about 10 nm(-1) may be attributed to density fluctuation originating from the MoO6 octahedral units connected with the corner sharing linkage, in which the correlation length is about 0.8 nm. The value of the coordination number of I- around Cu+ is estimated as 4.3 at 0.261 nm, suggesting an arrangement similar to that in molten CuI.
Resumo:
The anomalous X-ray scattering (AXS) method using Mo K absorption edges has been employed for obtaining the local structural information of superionic conducting glass having the composition (AgI)(0.6)(Ag2MoO4)(0.4). The possible atomic arrangements in the near-neighbor region of this glass were estimated by coupling the results with the least-squares variational analysis so as to reproduce the differential intensity profile for Mo as well as the ordinary scattering profile. The coordination number of oxygen around Mo is found to be about 4 at the distance of 0.180 mn. This implies that the most probable structural entity in the glass is the MoO4 tetrahedral unit which has been proposed based on infrared spectroscopy. The value of the coordination number of I- around Ag+ is estimated as 4.4 at 0.287 nm, suggesting an arrangement similar to that of crystalline or molten AgI.
Resumo:
We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.
Resumo:
The local structural information in the near-neighbor region of superionic conducting glass (AgBr)0.4(Ag2O)0.3(GeO2)0.3 has been estimated from the anomalous X-ray scattering (AXS) measurements using Ge and Br K absorption edges. The possible atomic arrangements in the near-neighbor region of this glass were obtained by coupling the results with the least-squares variational method so as to reproduce two differential intensity profiles for Ge and Br as well as the ordinary scattering profile. The coordination number of oxygen around Ge is found to be 3.6 at a distance of 0.176 nm, suggesting the GeO4 tetrahedral unit as the probable structural entity in this glass. Moreover, the coordination number of Ag around Br is estimated as 6.3 at a distance of 0.284 nm, suggesting an arrangement similar to that in crystalline AgBr.
Resumo:
Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.
Resumo:
A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention has been given to the design of efficient and fair scheduling schemes that are centrally controlled by a base station (BS) whose decisions depend on the channel conditions reported by each mobile. The BS is the only entity taking decisions in this framework. The decisions are based on the reports of mobiles on their radio channel conditions. In this paper, we study the scheduling problem from a game-theoretic perspective in which some of the mobiles may be noncooperative or strategic, and may not necessarily report their true channel conditions. We model this situation as a signaling game and study its equilibria. We demonstrate that the only Perfect Bayesian Equilibria (PBE) of the signaling game are of the babbling type: the noncooperative mobiles send signals independent of their channel states, the BS simply ignores them, and allocates channels based only on the prior information on the channel statistics. We then propose various approaches to enforce truthful signaling of the radio channel conditions: a pricing approach, an approach based on some knowledge of the mobiles' policies, and an approach that replaces this knowledge by a stochastic approximations approach that combines estimation and control. We further identify other equilibria that involve non-truthful signaling.
Resumo:
Context-aware computing is useful in providing individualized services focusing mainly on acquiring surrounding context of user. By comparison, only very little research has been completed in integrating context from different environments, despite of its usefulness in diverse applications such as healthcare, M-commerce and tourist guide applications. In particular, one of the most important criteria in providing personalized service in a highly dynamic environment and constantly changing user environment, is to develop a context model which aggregates context from different domains to infer context of an entity at the more abstract level. Hence, the purpose of this paper is to propose a context model based on cognitive aspects to relate contextual information that better captures the observation of certain worlds of interest for a more sophisticated context-aware service. We developed a C-IOB (Context-Information, Observation, Belief) conceptual model to analyze the context data from physical, system, application, and social domains to infer context at the more abstract level. The beliefs developed about an entity (person, place, things) are primitive in most theories of decision making so that applications can use these beliefs in addition to history of transaction for providing intelligent service. We enhance our proposed context model by further classifying context information into three categories: a well-defined, a qualitative and credible context information to make the system more realistic towards real world implementation. The proposed model is deployed to assist a M-commerce application. The simulation results show that the service selection and service delivery of the system are high compared to traditional system.
Resumo:
Mobile ad hoc networks (MANETs) is one of the successful wireless network paradigms which offers unrestricted mobility without depending on any underlying infrastructure. MANETs have become an exciting and im- portant technology in recent years because of the rapid proliferation of variety of wireless devices, and increased use of ad hoc networks in various applications. Like any other networks, MANETs are also prone to variety of attacks majorly in routing side, most of the proposed secured routing solutions based on cryptography and authentication methods have greater overhead, which results in latency problems and resource crunch problems, especially in energy side. The successful working of these mechanisms also depends on secured key management involving a trusted third authority, which is generally difficult to implement in MANET environ-ment due to volatile topology. Designing a secured routing algorithm for MANETs which incorporates the notion of trust without maintaining any trusted third entity is an interesting research problem in recent years. This paper propose a new trust model based on cognitive reasoning,which associates the notion of trust with all the member nodes of MANETs using a novel Behaviors-Observations- Beliefs(BOB) model. These trust values are used for detec- tion and prevention of malicious and dishonest nodes while routing the data. The proposed trust model works with the DTM-DSR protocol, which involves computation of direct trust between any two nodes using cognitive knowledge. We have taken care of trust fading over time, rewards, and penalties while computing the trustworthiness of a node and also route. A simulator is developed for testing the proposed algorithm, the results of experiments shows incorporation of cognitive reasoning for computation of trust in routing effectively detects intrusions in MANET environment, and generates more reliable routes for secured routing of data.
Resumo:
This recommendation proposes a definition for the term ``halogen bond'', which designates a specific subset of the inter- and intramolecular interactions involving a halogen atom in a molecular entity.
Resumo:
Recession flows in a basin are controlled by the temporal evolution of its active drainage network (ADN). The geomorphological recession flow model (GRFM) assumes that both the rate of flow generation per unit ADN length (q) and the speed at which ADN heads move downstream (c) remain constant during a recession event. Thereby, it connects the power law exponent of -dQ/dt versus Q (discharge at the outlet at time t) curve, , with the structure of the drainage network, a fixed entity. In this study, we first reformulate the GRFM for Horton-Strahler networks and show that the geomorphic ((g)) is equal to D/(D-1), where D is the fractal dimension of the drainage network. We then propose a more general recession flow model by expressing both q and c as functions of Horton-Strahler stream order. We show that it is possible to have = (g) for a recession event even when q and c do not remain constant. The modified GRFM suggests that is controlled by the spatial distribution of subsurface storage within the basin. By analyzing streamflow data from 39 U.S. Geological Survey basins, we show that is having a power law relationship with recession curve peak, which indicates that the spatial distribution of subsurface storage varies across recession events. Key Points The GRFM is reformulated for Horton-Strahler networks. The GRFM is modified by allowing its parameters to vary along streams. Sub-surface storage distribution controls recession flow characteristics.
Resumo:
Conformational diversity or shapeshifting in cyclic peptide natural products can, in principle, confer a single molecular entity with the property of binding to multiple receptors. Conformational equilibria have been probed in the contryphans, which are peptides derived from Conus venom possessing a 23-membered cyclic disulfide moiety. The natural sequences derived from Conus inscriptus, GCV(D)LYPWC* (In936) and Conus loroisii, GCP(D)WDPWC* (Lo959) differ in the number of proline residues within the macrocyclic ring. Structural characterisation of distinct conformational states arising from cis-trans equilibria about Xxx-Pro bonds is reported. Isomerisation about the C2-P3 bond is observed in the case of Lo959 and about the Y5-P6 bond in In936. Evidence is presented for as many as four distinct species in the case of the synthetic analogue V3P In936. The Tyr-Pro-Trp segment in In936 is characterised by distinct sidechain orientations as a consequence of aromatic/proline interactions as evidenced by specific sidechain-sidechain nuclear Overhauser effects and ring current shifted proton chemical shifts. Molecular dynamics simulations suggest that Tyr5 and Trp7 sidechain conformations are correlated and depend on the geometry of the Xxx-Pro bond. Thermodynamic parameters are derived for the cis trans equilibrium for In936. Studies on synthetic analogues provide insights into the role of sequence effects in modulating isomerisation about Xxx-Pro bonds.
Resumo:
The structural landscape of acid-pyridine cocrystals is explored by adopting a combinatorial matrix method with 4-substituted benzoic acids and 4-substituted pyridines. The choice of the system restricts the primary synthon to the robust acid-pyridine entity. This methodology accordingly provides hints toward the formation of secondary synthons. The pK(a) rule is validated in the landscape by taking all components of the matrix together and exploring it as a whole. Along with the global features, the exploration of landscapes reveals some local features. Apart from the identification of secondary synthons, it also sheds light on the propensity of hydration in cocrystals, synthon competition, and certain topological similarities. The method described here combines two approaches, namely, database analysis and high throughput crystallography, to extract more information with minimal extra experimental effort.
Resumo:
We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.
Resumo:
We consider the problem of ``fair'' scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking decisions in this framework based on truthful information from the mobiles on their radio channel. We study the well-known family of parametric alpha-fair scheduling problems from a game-theoretic perspective in which some of the mobiles may be noncooperative. We first show that if the BS is unaware of the noncooperative behavior from the mobiles, the noncooperative mobiles become successful in snatching the resources from the other cooperative mobiles, resulting in unfair allocations. If the BS is aware of the noncooperative mobiles, a new game arises with BS as an additional player. It can then do better by neglecting the signals from the noncooperative mobiles. The BS, however, becomes successful in eliciting the truthful signals from the mobiles only when it uses additional information (signal statistics). This new policy along with the truthful signals from mobiles forms a Nash equilibrium (NE) that we call a Truth Revealing Equilibrium. Finally, we propose new iterative algorithms to implement fair scheduling policies that robustify the otherwise nonrobust (in presence of noncooperation) alpha-fair scheduling algorithms.