980 resultados para Simple-brin G-riche


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

For structured-light scanners, the projective geometry between a projector-camera pair is identical to that of a camera-camera pair. Consequently, in conjunction with calibration, a variety of geometric relations are available for three-dimensional Euclidean reconstruction. In this paper, we use projector-camera epipolar properties and the projective invariance of the cross-ratio to solve for 3D geometry. A key contribution of our approach is the use of homographies induced by reference planes, along with a calibrated camera, resulting in a simple parametric representation for projector and system calibration. Compared to existing solutions that require an elaborate calibration process, our method is simple while ensuring geometric consistency. Our formulation using the invariance of the cross-ratio is also extensible to multiple estimates of 3D geometry that can be analysed in a statistical sense. The performance of our system is demonstrated on some cultural artifacts and geometric surfaces.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We discuss symmetries and scenarios leading to quasi-degenerate neutrinos in type I seesaw models. The existence of degeneracy in the present approach is not linked to any specific structure for the Dirac neutrino Yukawa coupling matrix y(D) and holds in general. Basic input is the application of the minimal flavour violation principle to the leptonic sector. Generalizing this principle, we assume that the structure of the right-handed neutrino mass matrix is determined by y(D) and the charged lepton Yukawa coupling matrix y(l) in an effective theory invariant under specific groups G(F) contained in the full symmetry group of the kinetic energy terms. G(F) invariance also leads to specific structure for the departure from degeneracy. The neutrino mass matrix (with degenerate mass m(0)) resulting after seesaw mechanism has a simple form Mv approximate to m(0)(I - py(l)y(l)(T)) in one particular scenario based on supersymmetry. This form is shown tolead to correct description of neutrino masses and mixing angles. The thermal leptogenesis after inclusion of flavour effects can account for the observed baryon asymmetry of the universe within the present scenario. Rates for lepton flavour violating processes can occur at observable levels in the supersymmetric version of the scenario. (c) 2010 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A simple firing delay circuit for 3-φ fully controlled bridge using a phase locked loop is described. The circuit uses very few components and is an improved scheme over the existing methods. The use of this circuit in three-phase thyristor converters and 'circulating current free' mode dual converters is described.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

ingle tract guanine residues can associate to form stable parallel quadruplex structures in the presence of certain cations. Nanosecond scale molecular dynamics simulations have been performed on fully solvated fibre model of parallel d(G(7)) quadruplex structures with Na+ or K+ ions coordinated in the cavity formed by the O6 atoms of the guanine bases. The AMBER 4.1 force field and Particle Mesh Ewald technique for electrostatic interactions have been used in all simulations. There quadruplex structures are stable during the simulation, with the middle four base tetrads showing root mean square deviation values between 0.5 to 0.8 Angstrom from the initial structure as well the high resolution crystal structure. Even in the absence of any coordinated ion in the initial structure, the G-quadruplex structure remains intact throughout the simulation. During the 1.1 ns MD simulation, one Nai counter ion from the solvent as well as several water molecules enter the central cavity to occupy the empty coordination sites within the parallel quadruplex and help stabilize the structure. Hydrogen bonding pattern depends on the nature of the coordinated ion, with the G-tetrad undergoing local structural variation to accommodate cations of different sizes. in the absence of any coordinated ion. due to strong mutual repulsion, O6 atoms within G-tetrad are forced farther apart from each other, which leads to a considerably different hydrogen bonding scheme within the G-tetrads and very favourable interaction energy between the guanine bases constituting a G-tetrad. However, a coordinated ion between G-tetrads provides extra stacking energy for the G-tetrads and makes the quadruplex structure more rigid. Na+ ions, within the quadruplex cavity, are more mobile than coordinated K+ ions. A number of hydrogen bonded water molecules are observed within the grooves of all quadruplex structures.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Two series of glasses were prepared, xNa2O, yZnO, 100 - x - yB2O3 and 30 - xNa2O, xZnO, 70B2O3 (mol%). The temperature dependence of the direct current resistivity was measured from room temperature to about 700 K and in both series of glasses we observed a simple Arrhenius type of temperature dependence. However, the resistivity of the binary alkali glass increased steeply by as much as two orders of magnitude with the addition of even a small quantity of ZnO and remained virtually unaffected by further addition of ZnO. The resistivity decreases gradually with increasing pressure in Na2O-B2O3 but increases with increasing pressure with the addition of ZnO.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The extremities of chromosomes end in a G-rich single-stranded overhang that has been implicated in the onset of the replicate senescence. The repeated sequence forming a G-overhang is able to adopt a four-stranded DNA structure called G-quadruplex, which is a poor substrate for the enzyme telomerase. Small molecule based ligands that selectively stabilize the telomeric G-quadruplex DNA, induce telomere shortening eventually leading to cell death. Herein, we have investigated the G-quadruplex DNA interaction with two isomeric bisbenzimidazole-based compounds that differ in terms of shape (V-shaped angular vs linear).While the linear isomer induced some stabilization of the intramolecular G-quadruplex structure generated in the presence of Na+ the other, having V-shaped central planar core, caused a dramatic structural alteration of the latter, above a threshold concentration. This transition was evident from the pronounced changes observed in the circular dichroism spectra and from the get mobility shift assa involving the G-quadruples DNA. Notably, this angular isomer could also induce the G-quadruplex formation in the absence of any added cation. The ligand-quadruples complexes were investigated by computational molecular modeling, providing further information on structure-activity relationships. Finally, TRAP (telomerase repeat amplification protocol) experiments demonstrated that the angular isomer is selective toward the inhibition of telomerase activity.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A simple and direct approach to both enantiomeric series of A-ring derivatives of 1 alpha,25-dihydroxyvitamin D-3 and the corresponding 1 alpha,3 alpha-derivatives, starting from the abundantly available R-carvone, is described. (C) 2000 Elsevier Science Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A slip line field is proposed for symmetrical single‐cavity closed‐die forging by rough dies. A compatible velocity field is shown to exist. Experiments were conducted using lead workpiece and rough dies. Experimentally observed flow and load were used to validate the proposed slip line field. The slip line field was used to simulate the process in the computer with the objective of studying the influence of flash geometry on cavity filling.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A simple, sufficiently accurate and efficient method for approximate solutions of the Falkner-Skan equation is proposed here for a wide range of the pressure gradient parameter. The proposed approximate solutions are obtained utilising a known solution of another differential equation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The recent spurt of research activities in Entity-Relationship Approach to databases calls for a close scrutiny of the semantics of the underlying Entity-Relationship models, data manipulation languages, data definition languages, etc. For reasons well known, it is very desirable and sometimes imperative to give formal description of the semantics. In this paper, we consider a specific ER model, the generalized Entity-Relationship model (without attributes on relationships) and give denotational semantics for the model as well as a simple ER algebra based on the model. Our formalism is based on the Vienna Development Method—the meta language (VDM). We also discuss the salient features of the given semantics in detail and suggest directions for further work.