922 resultados para greedy-rotation-greedy (GRG)
Resumo:
Recently reported experimental results on the rotation sensitivity of Lau fringes to the spatial coherence of the source have been theoretically analyzed and explained on the basis of coherence theory. A theoretical plot of the rotation angle required for the Lau fringes to vanish is obtained as a function of the coherence length of the illumination used in the Lau experiment. The theoretical results compare well with the experimental observations. The analysis as well as the experiment could form the basis for a simple and easy measurement of the coherence length of the illumination in a plane.
Resumo:
Clustered VLIW architectures solve the scalability problem associated with flat VLIW architectures by partitioning the register file and connecting only a subset of the functional units to a register file. However, inter-cluster communication in clustered architectures leads to increased leakage in functional components and a high number of register accesses. In this paper, we propose compiler scheduling algorithms targeting two previously ignored power-hungry components in clustered VLIW architectures, viz., instruction decoder and register file. We consider a split decoder design and propose a new energy-aware instruction scheduling algorithm that provides 14.5% and 17.3% benefit in the decoder power consumption on an average over a purely hardware based scheme in the context of 2-clustered and 4-clustered VLIW machines. In the case of register files, we propose two new scheduling algorithms that exploit limited register snooping capability to reduce extra register file accesses. The proposed algorithms reduce register file power consumption on an average by 6.85% and 11.90% (10.39% and 17.78%), respectively, along with performance improvement of 4.81% and 5.34% (9.39% and 11.16%) over a traditional greedy algorithm for 2-clustered (4-clustered) VLIW machine. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
A method involving eigenfunction expansion and collocation is employed to solve the axisymmetric problem of a slowly and steadily rotating circular disc in a fluid of finite extent whose surface is covered with a surfactant film. The present method (originally described by Wang (Acta Mech. 94, 97, 1992)) is observed to produce results of practical importance associated with the problem more quickly and more easily than the one used earlier by Shail and Gooden (Int. J. Multiphase Flow 7, 245, 1992). (C) 1994 Academic Press, Inc.
Resumo:
We have modeled the rotation curves of 21 galaxies observed by Amram et al. (1992), by combining the effects of rigid rotation, gravity, and turbulence. The main motivation behind such modeling is to study the formation of coherent structures in turbulent media and explore its role in the large-scale structures of the universe. The values of the parameters such as mass, turbulent velocity, and angular velocity derived from the rotation curve fits are in good agreement with those derived from the prevalent models.
Resumo:
Frequency-domain scheduling and rate adaptation have helped next generation orthogonal frequency division multiple access (OFDMA) based wireless cellular systems such as Long Term Evolution (LTE) achieve significantly higher spectral efficiencies. To overcome the severe uplink feedback bandwidth constraints, LTE uses several techniques to reduce the feedback required by a frequency-domain scheduler about the channel state information of all subcarriers of all users. In this paper, we analyze the throughput achieved by the User Selected Subband feedback scheme of LTE. In it, a user feeds back only the indices of the best M subbands and a single 4-bit estimate of the average rate achievable over all selected M subbands. In addition, we compare the performance with the subband-level feedback scheme of LTE, and highlight the role of the scheduler by comparing the performances of the unfair greedy scheduler and the proportional fair (PF) scheduler. Our analysis sheds several insights into the working of the feedback reduction techniques used in LTE.
Resumo:
Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.
Resumo:
The modification of the axisymmetric viscous flow due to relative rotation of the disk or fluid by a translation of the boundary is studied. The fluid is taken to be compressible, and the relative rotation and translation velocity of the disk or fluid are time-dependent. The nonlinear partial differential equations governing the motion are solved numerically using an implicit finite difference scheme and Newton's linearisation technique. Numerical solutions are obtained at various non-dimensional times and disk temperatures. The non-symmetric part of the flow (secondary flow) describing the translation effect generates a velocity field at each plane parallel to the disk. The cartesian components of velocity due to secondary flow exhibit oscillations when the motion is due to rotation of the fluid on a translating disk. Increase in translation velocity produces an increment in the radial skin friction but reduces the tangential skin friction.
Resumo:
We have developed a technique for precise measurement of small magnetic fields using nonlinear magneto-optic rotation (NMOR). The technique relies on the resonant laser beam being chopped. During the on time, the atoms are optically pumped into an aligned ground state (Delta m=2 coherence). During the off time, they freely precess around the magnetic field at the Larmor frequency. If the on-off modulation frequency matches (twice) the Larmor precession frequency, the rotation is resonantly enhanced in every cycle, thereby making the process like a repeated Ramsey measurement of the Larmor frequency. We study chopped-NMOR in a paraffin-coated Cs vapor cell. The out-of-phase demodulated rotation shows a Lorentzian peak of linewidth 85 mu G, corresponding to a sensitivity of 0.15nG/root Hz. We discuss the potential of this technique for the measurement of an atomic electric-dipole moment. Copyright (C) EPLA, 2011
Resumo:
The frequently observed lopsidedness of the distribution of stars and gas in disc galaxies is still considered as a major problem in galaxy dynamics. It is even discussed as an imprint of the formation history of discs and the evolution of baryons in dark matter haloes. Here, we analyse a selected sample of 70 galaxies from the Westerbork Hi Survey of Spiral and Irregular Galaxies. The Hi data allow us to follow the morphology and the kinematics out to very large radii. In the present paper, we present the rotation curves and study the kinematic asymmetry. We extract the rotation curves of the receding and approaching sides separately and show that the kinematic behaviour of disc galaxies can be classified into five different types: symmetric velocity fields where the rotation curves of the receding and approaching sides are almost identical; global distortions where the rotation velocities of the receding and approaching sides have an offset that is constant with radius; local distortions leading to large deviations in the inner and negligible deviations in the outer parts (and vice versa); and distortions that divide the galaxies into two kinematic systems that are visible in terms of the different behaviour of the rotation curves of the receding and approaching sides, which leads to a crossing and a change in side. The kinematic lopsidedness is measured from the maximum rotation velocities, averaged over the plateau of the rotation curves. This gives a good estimate of the global lopsidedness in the outer parts of the sample galaxies. We find that the mean value of the perturbation parameter denoting the lopsided potential as obtained from the kinematic data is 0.056. Altogether, 36% of the sample galaxies are globally lopsided, which can be interpreted as the disc responding to a halo that was distorted by a tidal encounter. In Paper II, we study the morphological lopsidedness of the same sample of galaxies.
Resumo:
The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.
Resumo:
We study muon-spin rotation (mu SR) spectra in the mixed phase of highly anisotropic layered superconductors, specifically Bi2+xSr2-xCaCu2O8+delta (BSCCO), by modeling the fluid and solid phases of pancake Vortices using liquid-state and density functional methods. The role of thermal fluctuations in causing motional narrowing of mu SR line shapes is quantified in terms of a first-principles theory of the flux-lattice melting transition. The effects of random point pinning are investigated using a replica treatment of liquid-state correlations and a replicated density functional theory. Our results indicate that motional narrowing in the pure system, although substantial, cannot account for the remarkably small linewidths obtained experimentally at relatively high fields and low temperatures. We find that satisfactory agreement with the mu SR data for BSCCO in this regime can be obtained through the ansatz that this ''phase'' is characterized by frozen short-range positional correlations reflecting the structure of the liquid just above the melting transition. This proposal is consistent with recent suggestions of a ''pinned liquid'' or ''glassy'' state of pancake Vortices in the presence of pinning disorder. Our results for the high-temperature liquid phase indicate that measurable linewidths may be obtained in this phase as a consequence of density inhomogeneities induced by the pinning disorder. The results presented here comprise a unified, first-principles theoretical treatment of mu SR spectra in highly anisotropic layered superconductors in terms of a controlled set of approximations. [S0163-1829(99)08033-9].
Resumo:
Reduction of carbon emissions is of paramount importance in the context of global warming. Countries and global companies are now engaged in understanding systematic ways of achieving well defined emission targets. In fact, carbon credits have become significant and strategic instruments of finance for countries and global companies. In this paper, we formulate and suggest a solution to the carbon allocation problem, which involves determining a cost minimizing allocation of carbon credits among different emitting agents. We address this challenge in the context of a global company which is faced with the challenge of determining an allocation of carbon credit caps among its divisions in a cost effective way. The problem is formulated as a reverse auction problem where the company plays the role of a buyer or carbon planning authority and the different divisions within the company are the emitting agents that specify cost curves for carbon credit reductions. Two natural variants of the problem: (a) with unlimited budget and (b) with limited budget are considered. Suitable assumptions are made on the cost curves and in each of the two cases we show that the resulting problem formulation is a knapsack problem that can be solved optimally using a greedy heuristic. The solution of the allocation problem provides critical decision support to global companies engaged seriously in green programs.
Resumo:
A fundamental task in bioinformatics involves a transfer of knowledge from one protein molecule onto another by way of recognizing similarities. Such similarities are obtained at different levels, that of sequence, whole fold, or important substructures. Comparison of binding sites is important to understand functional similarities among the proteins and also to understand drug cross-reactivities. Current methods in literature have their own merits and demerits, warranting exploration of newer concepts and algorithms, especially for large-scale comparisons and for obtaining accurate residue-wise mappings. Here, we report the development of a new algorithm, PocketAlign, for obtaining structural superpositions of binding sites. The software is available as a web-service at http://proline.physicslisc.emetin/pocketalign/. The algorithm encodes shape descriptors in the form of geometric perspectives, supplemented by chemical group classification. The shape descriptor considers several perspectives with each residue as the focus and captures relative distribution of residues around it in a given site. Residue-wise pairings are computed by comparing the set of perspectives of the first site with that of the second, followed by a greedy approach that incrementally combines residue pairings into a mapping. The mappings in different frames are then evaluated by different metrics encoding the extent of alignment of individual geometric perspectives. Different initial seed alignments are computed, each subsequently extended by detecting consequential atomic alignments in a three-dimensional grid, and the best 500 stored in a database. Alignments are then ranked, and the top scoring alignments reported, which are then streamed into Pymol for visualization and analyses. The method is validated for accuracy and sensitivity and benchmarked against existing methods. An advantage of PocketAlign, as compared to some of the existing tools available for binding site comparison in literature, is that it explores different schemes for identifying an alignment thus has a better potential to capture similarities in ligand recognition abilities. PocketAlign, by finding a detailed alignment of a pair of sites, provides insights as to why two sites are similar and which set of residues and atoms contribute to the similarity.
Resumo:
This paper presents a novel method of representing rotation and its application to representing the ranges of motion of coupled joints in the human body, using planar maps. The present work focuses on the viability of this representation for situations that relied on maps on a unit sphere. Maps on a unit sphere have been used in diverse applications such as Gauss map, visibility maps, axis-angle and Euler-angle representations of rotation etc. Computations on a spherical surface are difficult and computationally expensive; all the above applications suffer from problems associated with singularities at the poles. There are methods to represent the ranges of motion of such joints using two-dimensional spherical polygons. The present work proposes to use multiple planar domain “cube” instead of a single spherical domain, to achieve the above objective. The parameterization on the planar domains is easy to obtain and convert to spherical coordinates. Further, there is no localized and extreme distortion of the parameter space and it gives robustness to the computations. The representation has been compared with the spherical representation in terms of computational ease and issues related to singularities. Methods have been proposed to represent joint range of motion and coupled degrees of freedom for various joints in digital human models (such as shoulder, wrist and fingers). A novel method has been proposed to represent twist in addition to the existing swing-swivel representation.