نتایج جستجو برای: pure representation
تعداد نتایج: 328188 فیلتر نتایج به سال:
Introduction: Understanding the representation components of the historical buildings in cyberspace and their impact on the mental image of the tourists is a significant fact in tourism recognition and management. A part of this subject is the impact of place representation on the destination image of the tourist. In this research, the destination is traditional accommodations that attract tour...
We study the quantum fermions+gravity system, that is, the gravitational counterpart of QED. We start from the standard Einstein-Weyl theory, reformulated in terms of Ashtekar variables; and we construct its non-perturbative quantum theory by extending the loop representation of general relativity. To this aim, we construct the fermion equivalent to the loop variables, and we define the quantum...
In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil’s Extended Argumentation Frameworks. We its correctness, showprove several theoretical properties it satisfies, outline explain why certain strategies are equilibria a non-expert human user.
The classical bag-of-word models fail to capture contextual associations between words. We propose to investigate the “high-order pure dependence” among a number of words forming a semantic entity, i.e., the high-order dependence that cannot be reduced to the random coincidence of lower-order dependence. We believe that identifying these high-order pure dependence patterns will lead to a better...
هدف این پایان نامه تعیین تعداد مولدهای مینیمال ایده آلها در یک حلقه (جابجایی، یکدار، موضعی و نوتری) است، هر چند تعیین دقیق تعداد مولدها در حالتهایی خاص امکان پذیر است اما در حالتهای کلی روش های موجود بدست آوردن کرانهای مختلف برای تعداد مولدها است. مرجع اصلی این پایانامه [1] می باشد، به علاوه از نتایج جدیدی که در مرجع [2] نیز آمده استفاده کرده ایم. [1]. j. sally. numbers of generator...
In this article we describe an algorithm for constructing a compact representation of 3D laser range data. Our approach extracts a dictionary of local scans from the scene. The words of this dictionary are used to replace recurrent local 3D structures, which leads to a substantial compression of the entire point cloud. We optimize our model in terms of complexity and accuracy by minimizing the ...
At the root of applications for substructure and similarity searching, reaction retrieval, synthesis planning, drug discovery, and physicochemical property prediction is the need for a machine-readable representation of a structure. Systematic nomenclature is unsuitable, and notations and fragment codes have been superseded, except in certain specific applications. Connection tables are widely ...
Communicated by Abraham A. Ungar Abstract. In this paper, we investigate the reflections in Minkowski three-space by three different approaches. Firstly, we define Lorentzian reflections with Lorentzian inner product. Then, we examine Lorentzian reflections in view of Lorentzian Householder matrices. Finally, we use pure split quaternions to derive Lorentzian reflections. For each case, we find...
We derive a formula for the large N behaviour of the expectation values of an arbitrary product of Wilson loops in the adjoint representation. We show the consequences of our formula for the study of the large N strong coupling behaviour of SU(N)/ZN pure gauge theories, and theories with matter fields in the adjoint representation. This allows us to calculate large N corrections to the gluino c...
Temporal Data Warehouses (TDWs) allow to manage timevarying multidimensional data by joining the research of Temporal Databases and Data Warehouses. TDWs raise different issues such as temporal aggregations, multidimensional schema versioning, etc. However, very little attention from the research community has been drawn to conceptual modeling for TDWs and its subsequent logical representation....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید