Inspired by property testing, we relax the classical satisfiability UvDashF between a finite structure U of a class K and a formula F, to a notion of epsiv-satisfiability UvDash epsiv F, and the classical equivalence ...
详细信息
Inspired by property testing, we relax the classical satisfiability UvDashF between a finite structure U of a class K and a formula F, to a notion of epsiv-satisfiability UvDash epsiv F, and the classical equivalence F 1 equivF 2 between two formulas F 1 and F 2 , to epsiv-equivalence F 1 equiv epsiv F 2 for epsiv>0. We consider the class of strings and trees with the edit distance with moves, and show that these approximate notions can be efficiently decided. We use a statistical embedding of words (resp. trees) into lscr 1 , which generalizes the original Parikh mapping, obtained by sampling O(f(epsiv)) finite samples of the words (resp. trees). We give a tester for equality and membership in any regular language, in time independent of the size of the structure. Using our geometrical embedding, we can also test the equivalence between two regular properties on words, defined by monadic second order formulas. Our equivalence tester has polynomial time complexity in the size of the automaton (or regular expression), for a fixed epsiv, whereas the exact version of the equivalence problem is PSPACE-complete. Last, we extend the geometric embedding, and hence the tester algorithms, to infinite regular languages and to context-free languages. For context-free languages, the equivalence tester has an exponential time complexity, whereas the exact version is undecidable
We report a non-volatile, write-once-read-many times (WORM) memory device based on a simple organic-inorganic heterojunction. The organic-based hybrid used is 9, 9-dihexylfluorene and Eu-complexed benzoate (PF6Eu (DBM...
详细信息
We report a non-volatile, write-once-read-many times (WORM) memory device based on a simple organic-inorganic heterojunction. The organic film used is 9, 9-dihexylfluorene and Eu-complexed benzoate (PF6Eu (DBM)), whic...
详细信息
We report a non-volatile, write-once-read-many times (WORM) memory device based on a simple organic-inorganic heterojunction. The organic film used is 9, 9-dihexylfluorene and Eu-complexed benzoate (PF6Eu (DBM)), which contains both electron-donor (9, 9-dihexylfluorene) and electron-acceptor (europium complex) groups. The inorganic n-type silicon substrate is used as the bottom electrode, while the Al is used as the top electrode. Under current-voltage testing, the device is able to switch from one initial non-conducting state (OFF) to a conducting state (ON) once a threshold voltage is reached under the first positive sweep. The “OFF” state is not recoverable with subsequent negative sweep after the device is turned “ON”. The ON/OFF current ratio is around 4×104. Diode rectifying characteristics is also observed for the turned-on device with a current ratio of 7×104, which is essential to address one memory cell in large passive matrix circuits. Reliability test is carried out and the device is able to sustain its “ON” state for at least 12 hours without any external bias.
The goal to control the dynamics of high-rise buildings either to ameliorate the damage or prevent their destruction when subject to an earthquake excitation has been subject of extensive research. All known control d...
详细信息
Thermal management modelling and simulations of a polymerase chain reaction (PCR) device to be integrated on a lab on chip (LOC) have been carried out and presented. A typical MEMS PCR in symmetrical configuration is ...
We present a simplification algorithm for manifold polygonal meshes of plane-dominant models. Models of this type are likely to appear in man-made environments. While traditional simplification algorithms focus on gen...
详细信息
We present a simplification algorithm for manifold polygonal meshes of plane-dominant models. Models of this type are likely to appear in man-made environments. While traditional simplification algorithms focus on generality and smooth meshes, the approach presented here considers a specific class of man-made models. By detecting and classifying edge loops on the mesh and providing a guided series of binary mesh partitions, our approach generates a series of simplified models, each of which better respects the semantics of these kinds of models than conventional approaches do. A guiding principle is to eliminate simplifications that do not make sense in constructed environments. This, coupled with the concept of "punctuated simplification", leads to an approach that is both efficient and delivers high visual quality. Comparative results are given.
In this paper we present an approach to the analysis of the contribution of a small subregion in a dataset to the global flow. To this purpose, we subtract the potential flow that is induced by the boundary of the sub...
We present a new geometry compression method for animations, which is based on the clustered principal component analysis (CPCA). Instead of analyzing the set of vertices for each frame, our method analyzes the set of...
详细信息
This paper presents a method for constructing consistent non-manifold meshes of multi-labeled volu-metric datasets. This approach is different to traditional surface reconstruction algorithms which often only support ...
详细信息
ISBN:
(纸本)8090310079
This paper presents a method for constructing consistent non-manifold meshes of multi-labeled volu-metric datasets. This approach is different to traditional surface reconstruction algorithms which often only support extracting 2-manifold surfaces based on a binary voxel classification. However, in some -especially medical - applications, multi-labeled datasets, where up to eight differently labeled voxels can be adjacent, are subject to visualization resulting in non-manifold meshes. In addition to an efficient surface reconstruction method, a constrained geometric filter is developed which can be applied to these non-manifold meshes without producing ridges at mesh junctions. Copyright UNION Agency - science Press.
Modelling and reconstruction of tubular objects is a known problem in computergraphics. For computer aided surgical planning the constructed geometrical models need to be consistent and compact at the same time, whic...
详细信息
ISBN:
(纸本)8090310079
Modelling and reconstruction of tubular objects is a known problem in computergraphics. For computer aided surgical planning the constructed geometrical models need to be consistent and compact at the same time, which known approaches cannot guarantee. In this paper we present a new method for generating compact, topologically consistent, 2-manifold surfaces of branching tubular objects using a two-stage approach. The proposed method is based on connection of polygonal cross-sections along the medial axis and subsequent re nement. Higher order furcations can be handled correctly. Copyright UNION Agency science Press.
暂无评论