algorithms for the recognition of objects by optoelectronic systems using a combination of nonmetric multidimensional scaling and fuzzy classification are discussed. An example is given, illustrating the implementatio...
详细信息
algorithms for the recognition of objects by optoelectronic systems using a combination of nonmetric multidimensional scaling and fuzzy classification are discussed. An example is given, illustrating the implementation of the object recognition algorithm under the conditions of fuzzy, heterogeneous input data. (C) 2000 The Optical Society of America. [S1070-9762(00)00507-8].
The optimal and quasi-optimal algorithms of processing of space-time signals in a multibeam radar system intended for detection and measurement of parameters of low-observable air targets of unmanned aerial vehicles (...
详细信息
The optimal and quasi-optimal algorithms of processing of space-time signals in a multibeam radar system intended for detection and measurement of parameters of low-observable air targets of unmanned aerial vehicles (UAVs) are considered. algorithms for detection of targets against the background of stationary and moving surfaces are obtained. The possibility to detect and measure the parameters of targets situated at any point of specified coverage area during a short time (several fractions of a second) is shown.
We are given: a directed graph G = (V, E);for each vertex nu is an element of V, a collection P(nu) of sets of predecessors of nu;and a target vertex t. Define a subset C of vertices to be complete if for each nu is a...
详细信息
We are given: a directed graph G = (V, E);for each vertex nu is an element of V, a collection P(nu) of sets of predecessors of nu;and a target vertex t. Define a subset C of vertices to be complete if for each nu is an element of C there is some set Q is an element of P(nu) such that Q subset of or equal to C. we say that C is complete for t if in addition t is an element of C. The problem is to find a parsimonious (minimal with respect to set-inclusion) set that is complete for t. This paper presents efficient algorithms for solving the problem, for general graphs and for acyclic ones. In the special case where G is acyclic, and has bounded in-degree, the algorithm presented has time complexity O(\V\).
We derive a class of efficient and stable algorithms of Brownian dynamics using a formula, derived by Suzuki, to express time-ordered operators. These algorithms are simpler than those derived by Helfand from Runge-Ku...
详细信息
We derive a class of efficient and stable algorithms of Brownian dynamics using a formula, derived by Suzuki, to express time-ordered operators. These algorithms are simpler than those derived by Helfand from Runge-Kutta algorithms and, like Helfand algorithms, can be combined with SHAKE to describe the Brownian dynamics of constrained systems.
A general equation covering the calculation of position in synchronous, hyperbolic and bistatic fixing systems is derived. It is shown that the least-squares estimate of position for this quadratic problem is the solu...
详细信息
A general equation covering the calculation of position in synchronous, hyperbolic and bistatic fixing systems is derived. It is shown that the least-squares estimate of position for this quadratic problem is the solution of a system of linear equations depending on a parameter which satisfies a polynomial. For small errors, setting the parameter to zero gives a good approximation to the optimum solution. It is shown that this solution is equivalent to a previously published sub-optimum linear solution. The performance of a three-receiver system in two dimensions is used to demonstrate the results.
A string S[1, n] is a power (or tandem repeat) of order k and period n/k if it can be decomposed into k consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorith...
详细信息
A string S[1, n] is a power (or tandem repeat) of order k and period n/k if it can be decomposed into k consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an anti-power of order k to be a string composed of k pairwise-distinct blocks of the same length (n/k, called anti-period). Anti-powers are a natural converse to powers, and are objects of combinatorial interest in their own right. In this paper we initiate the algorithmic study of anti-powers. Given a string S, we describe an optimal algorithm for locating all substrings of S that are anti-powers of a specified order. The optimality of the algorithm follows form a combinatorial lemma that provides a lower bound on the number of distinct antipowers of a given order: we prove that a string of length n can contain Theta(n(2)/k) distinct anti-powers of order k. (C) 2018 Elsevier B.V. All rights reserved.
The authors consider optimization transformations of the algorithm for constructing minimal generating sets of solutions of systems of linear homogeneous equations (SLHE) over the set of natural numbers. The paper des...
详细信息
The authors consider optimization transformations of the algorithm for constructing minimal generating sets of solutions of systems of linear homogeneous equations (SLHE) over the set of natural numbers. The paper describes the features of such SLHEs, substantiates optimization transformations, and presents examples of the algorithm before and after optimization transformations. It illustrates the applying the algorithm with examples of the analysis of Petri net properties and the construction of a basic solution set in the fields of complex, real, and rational numbers and over finite fields.
In this paper we present two algorithms: the first tests the projectivity of a smooth complete toric variety and the second determines the extremal classes of the Mori cone of a smooth projective toric variety. The cr...
详细信息
In this paper we present two algorithms: the first tests the projectivity of a smooth complete toric variety and the second determines the extremal classes of the Mori cone of a smooth projective toric variety. The crucial fact is that we are able to give a complete description of N-1(X), determining a basis B of N-1(X) and the coordinates with respect to B of any element of N-1(X). The computational condition testing the projectivity is obtained by Kleiman's criterion of ampleness, while the condition determining the extremality of a class comes directly from the definition of a nonextremal class. The algorithms are used to study the Mori cone of Fano toric n-folds with dimension n <= 4 and Picard number rho >= 3, computing all extremal rays of the Mori cone. Moreover, we describe a toric almost Fano variety of dimension 3 and Picard number 35 together with its Mori cone.
To compare characteristics of patients with possible statin intolerance identified using different claims-based algorithms versus patients with high adherence to statins. We analyzed 134,863 Medicare beneficiaries ini...
详细信息
To compare characteristics of patients with possible statin intolerance identified using different claims-based algorithms versus patients with high adherence to statins. We analyzed 134,863 Medicare beneficiaries initiating statins between 2007 and 2011. Statin intolerance and discontinuation, and high adherence to statins, defined by proportion of days covered aeyen80 %, were assessed during the 365 days following statin initiation. Definition 1 of statin intolerance included statin down-titration or discontinuation with ezetimibe initiation, having a claim for a rhabdomyolysis or antihyperlipidemic event followed by statin down-titration or discontinuation, or switching between aeyen3 types of statins. Definition 2 included beneficiaries who met Definition 1 and those who down-titrated statin intensity. We also analyzed beneficiaries who met Definition 2 of statin intolerance or discontinued statins. The prevalence of statin intolerance was 1.0 % (n = 1320) and 5.2 % (n = 6985) using Definitions 1 and 2, respectively. Overall, 45,266 (33.6 %) beneficiaries had statin intolerance by Definition 2 or discontinued statins and 55,990 (41.5 %) beneficiaries had high adherence to statins. Compared with beneficiaries with high adherence to statins, those with statin intolerance and who had statin intolerance or discontinued statins were more likely to be female versus male, and black, Hispanic or Asian versus white. The multivariable adjusted odds ratio for statin intolerance by Definitions 1 and 2 comparing patients initiating high versus low/moderate intensity statins were 2.82 (95%CI: 2.42-3.29), and 8.58 (8.07-9.12), respectively, and for statin intolerance or statin discontinuation was 2.35 (2.25-2.45). Definitions of statin intolerance presented herein can be applied to analyses using administrative claims data.
We consider a simplified abstraction of the problem of recognizing planar arrangements of objects using camera pictures taken from unknown positions. A set of polygons in plane is called a planar polygonal configurati...
详细信息
We consider a simplified abstraction of the problem of recognizing planar arrangements of objects using camera pictures taken from unknown positions. A set of polygons in plane is called a planar polygonal configuration. Given perspective images P and Q corresponding to planar polygonal configurations, the matching problem is to determine if P and Q correspond to the same configuration. We present an optimal theta(n log n) time algorithm to solve this problem, where n, is the total number of vertices of polygons in each image. Our algorithm is obtained by combining the ideas of cross ratios, which are well known to be invariant under perspective projections, and the first fundamental theorem of perspective projections. This algorithm has been implemented and tested.
暂无评论