ppxscal/embedding_network huggingface dataset:
Visual Marker Detection and Decoding in AR Systems: A Comparative Study
Authors: Xiang Zhang, Stephan Fronz, Nassir Navab
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Visual markers are widely used in existing augmented reality (AR) applications [7,12,11,19 ]. In most of such applications, the performance of an AR system depends highly on the tracking system for visual marker detection, tracking,and pose estimation. Currently, there are more than one marker based tracking/calibration systems available. It is thus desirable for the user to know which marker tracking system is likely to perform the best for a specific AR application. To this purpose, we compare several marker systems all using planar square coded visual markers. We present the evaluation results, both qualitatively and quantitatively, for the following properties: the usability, efficiency, accuracy, and reliability. For a particular AR application, there are different marker detection and tracking requirements. Therefore, the purpose of this work is not to rank the existing marker systems; instead, we try to analyze the strength and weakness of various aspects of the marker tracking systems and provide the AR application developers with this information.
User Interface Software Tools
Authors: Brad A. Myers
Venue:  (1994)

Almost as long as there have been user interfaces, there have been special software systems and tools to help design and implement the user interface software. Many of these tools have demonstrated significant productivity gains for programmers, and have become important commercial products. Others have proven less successful at supporting the kinds of user interfaces people want to build. This article discusses the different kinds of user interface software tools, and investigates why some approaches have worked and others have not. Many examples of commercial and research systems are included. Finally, current research directions and open issues in the field are discussed.
SPARKLE Work Package 1: Specification of Phrasal Parsing. Final Report
Authors: J. Carroll, T. Briscoe, N. Calzolari, S. Federici, S. Montemagni, V. Pirrelli, G. Grefenstette, A. Sanfilippo, G. Carroll, M. Rooth
Venue:  (1997)

This deliverable provides details of the corpus annotation scheme, associates evaluation scheme and the development of annotated test corpora for the various parsers. TEL:: +39 50 560481
Phrasal Parser software - Deliverable 3.1
Authors: T. Briscoe, J. Carroll, G. Carroll, S. Federici, G. Grefenstette, S. Montemagni, V. Pirrelli, I. Prodanof, M. Rooth, M. Vannocchi
Venue:  (1997)

This deliverable describes the first year''s effort towards developing robust and accurate phrasal parsers at Cambridge, Pisa, RXRC and Stuttgart. TEL:: +39 50 560481
On The De Bruijn Torus Problem
Authors: Glenn Hurlbert, Garth Isaak
Venue:  (1992)

A (kn;n)k-de Bruijn Cycle is a cyclic k-ary sequence with the property that every k-ary n-tuple appears exactly once contiguously on the cycle. A (kr, ks; m, n)k-de Bruijn Torus is a k-ary krXks toroidal array with the property that every k-ary m x n matrix appears exactly once contiguously on the torus. As is the case with de Bruijn cycles, the 2-dimensional version has many interesting applications, from coding and communications to pseudo-random arrays, spectral imaging, and robot self-location. J.C. Cock proved the existence of such tori for all m, n, and k, and Chung, Diaconis, and Graham asked if it were possible that r = s and m -= n for n even. Fan, Fan, Ma and Siu showed this was possible for k - 2. Combining new techniques with old, we prove the result for k < 2 and show that actually much more is possible. The cases in 3 or more dimensions remain.
Manipulating Screen Space with {\em StretchTools}: Visualizing Large Structures on Small Screens
Authors: Manojit Sarkar, Steven P. Reiss
Venue:  (1992)

StretchTools is a set of tools for manipulating the screen space. The user interface uses the metaphor of stretching a rubber sheet. The basic tool in StretchTools is the handle, which is an one-dimensional rigid object of a fixed orientation, either horizontal or vertical. As a handle is placed on the screen, engaged, and pulled, the screen expands on one side of the handle and contracts on the other side. Graphical objects on the screen transform accordingly. The other type of basic tool is the clamp. Clamps are used to impose constraints on the movement of handles by joining handles with one another. In this paper, we show how StretchTools can be used to visualize large structures on small screens by selectively enlarging single or multiple regions of the screen at a time. Transformations achieved by StretchTools have a number of properties that alleviate the problem of user-disorientation due to the introduced distortion.
Michael Jackson's problem frames: towards methodological principles of selecting and applying formal software development techniques and tools
Authors: D. Bjoner, S. Koussoube, R. Noussi, G. Satchok
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

We attempt formal characterisations of M.A. Jackson's (1995) concept of problem frames-and illustrate the translation (JSP), control, information systems, connection and workpiece frames. The paper is based on the following definition of method: A set of principles for selecting and applying techniques and tools in order to efficiently develop an efficient (here software) artifact. Most "formal methods" fail this definition-and we wish to show how formal design calculi can fit into the above definition. The paper is also based on the tri-partite separation of concern wherein software development is seen as having three intertwined "stages/activities" : Domain analysis and theory construction, in which formal models of the application domain-without any reference to computing-"precedes" requirements capture which again "precedes" software design.
MPI Backend for an Automatic Parallelizing Compiler
Authors: Daesuk Kwon, Sangyong Han, Heunghwan Kim
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Many naive parallel processing schemes were not successful as many researchers thought, because of the heavy cost of communication and synchronization resulting from parallelization. In this paper, we will identify the reasons for the poor performance and the compiler requirements for performance improvement. We realized that the decisions for parallelizing should be derived by the overhead information. We added this idea to the automatic parallelizing compiler, SUIF. We substitute the original backend of SUIF with our backend using MPI, and gave it the capability of validating of parallelization decisions based on overhead parameters. This backend converts shared-memory based parallel program into distributed-memory based parallel program with MPI function calls without excessive parallelization that causes performance degradation.
Cache based fault recovery for distributed systems
Authors: A. Mendelson, N. Suri
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

No cache based techniques for roll-forward fault recovery exist at present. A split-cache approach is proposed that provides efficient support for checkpointing and roll-forward fault recovery in distributed systems. This approach obviates the use of discrete stable storage or explicit synchronization among the processors. Stability of the checkpoint intervals is used as a driver for real time operations.
Functional Large Deviation Principles for Waiting and Departure Processes
Authors: A. A. Puhalskii, W. Whitt
Venue:  (1998)

We establish functional large deviation principles (FLDPs) for waiting and departure processes in single-server queues with unlimited waiting space and the first-in first-out service discipline. We apply the extended contraction principle to show that these processes obey FLDPs in the function space D with one of the non-uniform Skorohod topologies whenever the arrival and service processes obey FLDPs and the rate function is finite for appropriate discontinuous functions. We apply our previous FLDPs for inverse processes to obtain an FLDP for the waiting times in a queue with a superposition arrival process. We obtain FLDPs for queues within acyclic networks by showing that FLDPs are inherited by processes arising from the network operations of departure, superposition and random splitting. For this purpose, we also obtaain FLDPs for split point processes. For the special cases of deterministic arrival processes and deterministic service proccesses, we obtain convenient explicit expressions for the rate function of the departure process, but not more generally. In general the rate function for the departure process evidently must be calculated numerically. We also obtain an FLDP for the departure process of completed work, which has important application to the concept of effective bandwidths for admission control and capacity planning in packet communication networks.
Coupling-based Integration Testing
Authors: Zhenyi Jin, A. Jefferson Offutt
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Integration testing is an important part of the testing process, but few integration testing techniques have been systematically studied or defined. This paper presents an integration testing technique based on couplings between software components. The coupling-based testing technique is described, and coverage criteria for three types of 12 coupling levels are defined. This technique can be used to support integration testing of software components, and satisfies part of the FAA's requirements for structural coverage analysis of software.
System Design Approach To Power Aware Mobile Computers
Authors: J. Warren, T. Martin, A. Smailagic, D. P. Siewiorek
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper describes a system level design approachto power awareness in the wearable computers project atCarnegie Mellon University. The paper identifies themajor components of power consumption in a mobilecomputer, evaluates their respective contributions topower consumption, and analyzes various techniques forimproving their energy efficiency. The paper describesour research framework and experimental evaluationsof techniques for improving energy efficiency of asystem, ranging from the communication level down tothe physical level of the battery. The work describedincludes techniques for dynamically varying the CPUclock frequency.
On complexiy
Authors: Vincent Schächter
Venue: Quantum mechanics, mathematics, cognition and action: proposals for a formalized epistemology (2002)

Under the generic label "complexity", this chapter includes 3 related contributions of different natures. The first one (C1) is a synthetic exposition by Vincent Schächter of James P. Crutchfield's attempt [1] at a general computational representation of the notion of complexity; the second one (C2) is an account of a CeSEF-session devoted to a general discussion of this attempt; the third contribution (C3) consists of a brief note by Vincent Schächter, on the construction of complexity measures, within the framework of the method of relativized conceptualization exposed in the second part of this volume. Considered globally, the sequence indicated above should convey an illustration of the way in which, accordingly to the aim announced in the general introduction, we try to extract from modern scientific representations, methodological essences to be progressively incorporated in the researched formalized epistemology. In the following, Crutchfield is denoted by Cr.
A Hybrid GLR Algorithm for Parsing with Epsilon Grammars
Authors: Marwan Shaban
Venue:  (1994)

Abstract We give a hybrid algorithm for parsing $\epsilon$-grammars based on Tomita''s non-$\epsilon$-grammar parsing algorithm (\cite{tomi86}) and Nozohoor-Farshi''s $\epsilon$-grammar recognition algorithm (\cite{fars91}). The hybrid parser handles the same set of grammars handled by Nozohoor-Farshi''s recognizer. The algorithm''s details and an example of its use are given. We also discuss the deployment of the hybrid algorithm within a GB parser, and the reason an $\epsilon$-grammar parser is needed in our GB parser. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Analytical Solution for the Problem fo 1-Dimensional Diffusion into a Static Chamber
Authors: T. F. Russell, R. W. Healy, R. G. Striegl, G. L. Hutchinson, G. P. Livingston
Venue:  (1996)

An analytical solution is developed for the problem of one-dimensional diffusion from a porous slab to a closed chamber. Motivation for the work was the study of gas diffusion from soils to a static chamber (a device commonly used to estimate soil-atmosphere gas exchange rates). The solution should also be useful in studies of radon accumulation rates, temperature conduction, and groundwater seepage rates into lakes. Initial concentration is arbitrary, as is length of the slab and the chamber. Gas movement within the chamber headspace is governed by diffusion. Concentrations can be calculated for any time and any location within the slab or chamber.
Compiler Techniques for Energy Saving in Instruction Caches of Speculative Parallel Microarchitectures
Authors: Seon Wook Kim, Rudolf Eigenmann
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

We present a new software scheme, called compiler-assisted I-cache prediction (CIP) for energy reduction in instruction caches. With the help of compiler-supplied information, the processor is able to turn off substantial portions of the I-cache. The necessary cache sets are only turned on during the execution of individual code sections. The CIP scheme is based on the processor's ability to predict code sections that are about to execute and on the compiler's ability to precisely inform the hardware about the size of these code sections. Our techniques grew out of work with optimizing compilers for speculative parallel microarchitectures. The use of this target machine class is further motivated by the fact that speculative processors have the potential to overcome limitations in the compiler parallelization of many applications, especially non-numerical programs. Speculative microarchitectures are also among the most promising emerging architectures that can take advantage of the ever-increasing levels of chip integration. We will show that our new techniques can lead up to 90% I-cache energy savings in general-purpose applications without significant execution overhead. We believe that this is a substantial step towards the goal of making such chips integral parts of mobile computing devices, such as laptops, palm tops, and cellular phones.
User's View of the Internet, 228 edition
Authors: Harry Bruce
Venue:  (2002)

:The User's View of the Internet provides the first comprehensive analysis of public access to the Internet. It considers the evolution of the Internet through the lens of use and usings. It will appeal to Internet stakeholders who need to know more about the impact of the network on their audience, market, clients, users, or constituencies. These stakeholders include business, government, Internet service providers, digital service/product developers, librarians, media and publishing professionals, educators, academics, and students.
Massively Parallel Simulated Annealing Embedded with Downhill A SPMD Algorithm for Cluster Computing
Authors: Zhihui Du, Sanli Li, Shuyou Li, Mengyue Wu, Jing Zhu
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Simulated Annealing(SA) is a frequently used stochastic algorithm to deal with combinatorial optimization problems and it converges with probability infinitely close to 1. SA is an NP algorithm and the long executive time prevents it from being accepted for many real-time applications. This paper presents a SPMD(Single Program Multiple Data) algorithm which combines SA with local searching algorithm -- downhill. The hybrid method not only keeps the convergence of SA but also improves the convergence speed of SA. Approximate solutions can be found quickly for complex optimization problems and more precise solutions can also be found by employing the same algorithm to fine-tune the approximate solutions. SA is an essential serial algorithm, but the SPMD algorithm breaks up the serial bottleneck of SA and its performance scales up linearly with the increase of processors, at the same time, the SPMD algorithm does not require careful choice of control parameters. Application cases show that the algorithm is robust and it can find high quality solution with high speed.
Risk in Two-Stage Optimal Resource Allocation
Authors: A. V. Naumov, S. V. Ulanov
Venue: Automation and Remote Control (2003)

Two integral two-stage multi-period optimal resource allocations with expectation and quantile criteria are compared. Effective algorithms for solving the problem in our formulation are designed for the case of independent components of the random demand vector.
On the Effect of Preemptive Policies on the Stability of a Priority Queue
Authors: Raymond Marie, Kishor Trivedi
Venue:  (1986)

We study the stability condition of an M/G/1 priority queue with two classes of jobs. Class 1 jobs have preemptive priority over class 2 jobs. We consider three different types of preemptions and the effects of possible work loss (due to preemption) on the stability condition for the queueing system.
A Progress Report on Automatic Information Retrieval
Authors: Gerard Salton
Venue:  (1979)

This study is a state-of-the-art report of work in automatic information retrieval. Various enhancements of operational on-line retrieval systems are described such as the utilization of special front-end devices providing compatibility among different search services, the introduction of fast back-end search devices, and the use of local clustering and query reformulation operations designed to improve retrieval output. Certain new algorithms for fast text matching and for optimum term weighting are also mentioned, as are advances in the construction of theoretical retrieval models.
The Application of Correctness Preserving Transformations to Software Maintenance
Authors: J. Paul Gibson, Thomas F. Dowling, Brian A. Malloy
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

The size and complexity of hardware and software systems continues to grow, making the introduction of subtle errors a more likely possibility. A major goal of software engineering is to enable developers to construct systems that operate reliably despite increased size and complexity. One approach to achieving this goal is through formal methods: mathematically based languages, techniques and tools for specifying and verifying complex software systems. In this paper, we apply a theoretical tool that is supported by many formal methods, the correctness preserving transformation (CPT), to a real software engineering problem: the need for optimization during the maintenance of code. We present four program transformations and a model that forms a framework for proof of correctness. We prove the transformations correct and then apply them to a cryptography application implemented in C++. Our experience shows that CPTs can facilitate generation of more efficient code while guaranteeing the preservation of original behavior.
Asynchronous Organizations for Solving the Point-to-Point Connection Problem
Authors: Fernando de Carvalho Gomes, Cláudio Nogueira de Meneses, Allan G. Lima, Carlos S. Oliveira
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is a organization of agents that communicate with each other by means of shared memories. Each agent is a heuristic strategy that can make its own choices about its inputs, scheduling and resource allocation. Computational results comparing our approach against an exact algorithm proposed by Meneses are presented.
Towards optimal policing in ATM networks
Authors: L. G. Mason, A. Pelletier, J. Lapointe
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

This paper proposes a framework for optimal policing in ATM networks. A general approach to modeling controllers which implement the policing function is described using finite-state automata. The theory of finite-state accepting automata and regular expressions enables the symbolic computation of the worst-case source and therefore provides a basis for the formulation and derivation of optimal bandwidth enforcement schemes. Exhaustive searches are performed for small cases to find optimal finite-state automata. These optimal results are extended to obtain near-optimal solutions for higher-state automata. The optimal and near-optimal finite-state automata are compared to existing schemes, such as leaky buckets, and improvement in terms of cell loss rate of the declared source is achieved.
Some Nested Dissection Order is Nearly Optimal
Authors: John R. Gilbert
Venue:  (1986)

The minimum fill problem is to reorder the rows and columns of a given sparse symmetric matrix so that its triangular factor is as sparse as possible. Equivalently, it is to find the smallest set of edges whose addition makes a given undirected graph chordal. The problem is known to be NP-complete, and no polynomial-time approximation algorithms are known that provide any nontrivial guarantee for arbitrary graphs (matrices), although some heuristics perform well in practice. Nested dissection is one such heuristic. In this note we prove that every graph with a fixed bound on vertex degree has a nested dissection order that achieves fill within a factor of $O(\logn)$ of minimum. This does not lead to a polynomial-time approximation algorithm, however, because the proof does not give an efficient method for finding the separators required by nested dissection.
Chaotic motion in a micro-electro-mechanical system with non-linearity from capacitors
Authors: Albert C. J. Luo, F. Y. Wang
Venue: Communications in Nonlinear Science and Numerical Simulation (2002)

This investigation is to provide a possible prediction for design, manufacturing, testing and industrial applications of a simplified micro-electro-mechanical system (MEMS). The chaotic motion in a certain frequency band of such a MEMS device is investigated, and the corresponding equilibrium, natural frequency and responses are determined. Under alternating current (AC) voltage, the resonant condition for such a system is obtained. It is observed that the lower-order resonant motions can be easily converted to the mechanical force and sensed to the electrical signal. The chaotic motions in the vicinity of a specified resonant separatrix are investigated analytically and numerically. For given voltages, the AC frequency bands are obtained for chaotic motion in the specific resonant layers and resonant motions, and such chaotic motions can be very easily sensed by the output transducer in MEMS.