نتایج جستجو برای: normal graph
تعداد نتایج: 749861 فیلتر نتایج به سال:
In this paper, a resolution method for propositional temporal logic is presented. Temporal formulae, incorporating both past-time and future-time temporal operators, are converted to Separated Normal Form (SNF), then both non-temporal and temporal resolution rules are applied. The resolution method is based on classical resolution, but incorporates a temporal resolution rule that can be impleme...
The existence of quasi-periodic eigensolutions of a linear second order ordinary differential equation with quasi-periodic coefficient f{a>it, io%t) is investigated numerically and graphically. For sufficiently incommensurate frequencies coi, a>2 a doubly indexed infinite sequence of eigenvalues and eigenmodes is obtained. The equation considered is a model for the magneto-hydrodvnamic "continu...
A number of physical mechanisms give rise to confined linear wave systems whose spatial structure is governed by a hyperbolic equation. These lack the discrete set of regular eigenmodes that are found in classical wave systems governed by an elliptic equation. In most 2D hyperbolic cases the discrete eigenmodes are replaced by a continuous spectrum of wave fields that possess a self-similar spa...
In this paper we are concerned with classical polar spaces, i. e. with the set of points and lines of some vector space W on which a non–degenerate (σ, )-hermitian form or pseudo-quadratic form vanishes. To state the Main Theorem we introduce some notation. Let L be a division ring and W be a (left–)vector space over L endowed with a (σ, )–hermitian form or a pseudo–quadratic form q (with assoc...
In this paper, an exact bitwise MAP (Maximum A Posteriori) estimation algorithm for group testing problems is presented. We assume a simplest non-adaptive group testing scenario including N -objects with binary status and M disjunctive tests. If a group contains a positive object, the test result for the group is assumed to be one; otherwise, the test result becomes zero. Our inference problem ...
We present an approach for compiling a device into a propositional sentence (in negation normal form) and then show how to answer interesting diagnostic queries based on such a device compilation. We present two key results about our compilation approach, which makes it of interest to the diagnostic community. First, the complexity of answering diagnostic queries | which includes nd-ing minimum...
We present a proof method for reducing biconnected digraphs to a normal form and demonstrate its convergence for a general biconnected digraph.
This purpose of this paper is to study the signal-to-interference (SIR) model used in power control problems to incorporate random network matrices with log-normally distributed coefficients. Related models on stochastic programming are presented and applied to the random SIR model.
Device-to-device (D2D) communication is an effective technology enhancing spectral efficiency and network throughput of contemporary cellular networks. Typically, the users exploiting D2D reuse the same radio resources as common cellular users (CUEs) that communicate through a base station. This mode is known as shared mode. Another option is to dedicate specific amount of resources exclusively...
Photometry Data Coding for Three-Dimensional Mesh Models Using Connectivity and Geometry Information
In this paper, we propose new predictive coding schemes for photometry data of three-dimensional (3-D) mesh models as per-vertex binding. We exploit geometry and connectivity information to enhance coding efficiency of the color and normal vector data. For color coding, we predict the color of the current vertex by a weighted sum of colors of adjacent vertices considering angles between the cur...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید