ppxscal/embedding_network huggingface dataset:
Model-Based Object Recognition - A Survey of Recent Research
Authors: Arthur R. Pope
Venue:  (1994)

We survey the main ideas behind recent research in model-based object recognition. The survey covers representations for models and images and the methods used to match them. Perceptual organization, the use of invariants, indexing schemes, and match verification are also reviewed. We conclude that there is still much room for improvement in the scope, robustness, and efficiency of object recognition methods. We identify what we believe are the ways improvements will be achieved.
Buffer Management and Scheduling for Enhanced Differentiated Services
Authors: Jorg Liebeherr, Nicolas Christin
Venue:  (2000)

A novel framework, called JoBS (Joint Buffer Management and Scheduling), is presented for reasoning about relative and absolute per-class service differentiation in a packet network without information on traffic arrivals. JoBS has two unique capabilities: (1) JoBS makes scheduling and buffer management decisions in a single step, and (2) JoBS supports both relative and absolute QoS requirements of classes. JoBS is presented in terms of the solution to an optimization problem. Numerical simulation examples, including results for a heuristic approximation of JoBS, are presented to illustrate the effectiveness of the approach and to compare JoBS to existing methods for loss and delay differentiation.
Hodiex: A Sixth Order Accurate Method for Solving Elliptical PDEs
Authors: George G. Pitts, Calvin J. Ribbens
Venue:  (1993)

This paper describes a method for discretizing general linear two dimensional elliptical PDEs with variable coefficients, Lu=g, which achieves high orders of accuracy on an extended range of problems. The method can be viewed as an extension of the ELLPACK6 discretization module HODIE ("High Order Difference Approximation with Identity Expansion"), which achieves high orders of accuracy on a more limited class of problems. We thus call this method HODIEX. An advantage of HODIEX methods, including the one described here, is that they are based on a compact 9-point stencil which yields linear systems with a smaller bandwidth than if a larger stencil were used to achieve higher accuracy.
Requirements for a Software Maintenance Methodology
Authors: Richard E. Nance, James D. Arthur, John A. Ciaramella,  Jr.
Venue:  (1991)

This project ventures into the domain of software maintenance methodologies, an area given relatively little attention in software engineering. Project efforts are divided into three tasks: (1) definition of maintenance methodology requirements; (2) development of a model of the AEGIS maintenance process; and (3) specification of the requirements for an AEGIS maintenance methodology. The focus of this report is on the third task. The research utilizes the Objectives/Principles/Attributes (OPA) framework developed for software quality assessment for time-critical, embedded systems. The overriding maintenance objective is to "realize desired changes in an efficient and effective manner." Four principles are identified that support achievement of this objective. Eleven requirements are derived for an AEGIS maintenance methodology. The AEGIS maintenance process model is used to determine the potential points where any of the requirements can be met. Recommendations are made with respect to restructuring the process, noting the most appropriate place for meeting requirements, and acquisition or development of software utilities to support maintenance. Recommended as an approach for meeting long-term needs is the AEGIS System Evolution Environment, supporting both systems and software maintenance activities. [Appendices Not Included]
A new method for dynamic modelling of a suspension bridge for aerodynamic instability
Authors: C. P. Pagwiwoko, M. A. M. Said, C. K. Keong
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The classical flutter of a suspension bridge appears in the motions of coupled bending-torsion modes of the structure. This unstable flow induced vibration happens when the horizontal wind velocity perpendicular to the span, exceeds the critical condition where the flow introduces zero aerodynamic damping. In this paper, the author consider the aero-elastic phenomenon as a dynamic system which consists of subsystems and components interacting each others pursuing the energy flow mechanism. The dynamic model of the bridge is constructed using Power Bond Graph Method based on the structural dynamic behaviours. The aerodynamic forces imposing to the bridge is regarded as a filter where the generated loads are induced by the structural response. Since the bond graph model can be converted to the equivalent block diagram, therefore the dynamic simulation can be conducted directly in time domain.
Curriculum and Course Syllabi for a High-School Program in Computer Science
Authors: J. Gal-Ezer, D. Harel
Venue:  (1999)

The authors served on a committee that has designed a high-school curriculum in computer science and supervising the preparation of a comprehensive study program based on it. The new program is intended for the Israeli high-school system, and is expected to replace the old one by the end of 1999. The program emphasizes the foundations of algorithmics, and teaches programming as a way to get the computer to carry out an algorithm. The purpose of this paper is to describe the curriculum and syllabi in some detail.
A Nonparametric Approach for Detecting Lines and Curves
Authors: Sok G Lim, Mike Alder
Venue:  (1996)

The process of detecting lines and curves in an image is an important component of many Pattern Recognition and Computer Vision applications. There are well understood approaches to finding curves from a parametrised space of curves. In many practical cases, however, there exist arbitrary shape curves, and different types of curves in the same image. In addition, local perturbation noise can be added to the images. We propose a nonparametric method to overcome the above mentioned problems. The method is based on local modeling of the data. It does not require the specification of a parametric space of curves. It can be used to detect arbitrary curves and thus has a wider applicability than parametric approaches.
Information-rich commerce at a crossroads: business and technology adoption requirements
Authors: Robert G. Fichman, Mary J. Cronin
Venue: Communications of the ACM (2003)

The day is approaching when most of our common transactions may be information-rich, but first an extensive supporting infrastructure must be developed in three areas: devices, networking, and trust.
Process Introspection: A Heterogeneous Checkpoint/Restart Mechanism Based on Automatic Code Modification
Authors: Adam J. Ferrari, Stephen J. Chapin, Andrew S. Grimshaw
Venue:  (1997)

Process Introspection is a fundamentally new solution to the process checkpoint/restart problem suitable for use in high-performance heterogeneous distributed systems. A process checkpoint/restart mechanism for such an environment has the primary requirement that it must be platform-independent: process checkpoints produced on a computer system of one architecture or operating system platform must be restartable on a computer system of a different architecture or operating system platform. The central feature of the Process Introspection approach is automatic augmentation of program code to incorporate checkpoint and restart functionality. This program modification is performed at a platform-independent intermediate level of code representation, and preserves the original program semantics. This approach has attractive properties including portability, ease of use, customizability to application-specific requirements, and flexibility with respect to basic performance trade-offs. Our solution is novel in its true platform- and run-time system independence - no system support or non-portable code is required by our core mechanisms. Recent experimental results obtained using a prototype implementation of the Process Introspection system indicate the overheads introduced by the mechanisms are acceptable for computationally demanding applications.
Implementing 2d Tori Algorithms on de Bruijn Graphs
Authors: Michael Nolle, Gerald Schreiber
Venue:  (1994)

In image processing the torus and the de Bruijn graphs are two popular structures. In this paper we discuss embeddings of 2d tori in de Bruijn networks. After extending the scope to de Bruijn graphs of any base, we prove that a 2d torus is a spanning subgraph of the two dimensional de Bruijn graph. In conjunction with an embedding of one de Bruijn graph into another of different base this provides us with an embedding of 2d tori in fixed base B de Bruijn graphs with dilation log_B(sqrt N)). To our knowledge, this improves the best known embedding by a factor of frac12. We introduce a modification of the graph embedding measure em congestion, the so-called em clocked congestion. We demonstrate how to modify our embedding to reduce the clocked congestion to one. Finally, experimental results on a 64 processor system are given.
Objects that cannot be taken apart with two hands
Authors: Jack Snoeyink, J. Stolfe
Venue:  (1993)

It has been conjectured that every configuration C of convex objects in 3-space with disjoint interiors can be taken apart by translation with two hands: that is, some proper subset of C can be translated to infinity without disturbing its complement. We show that the conjecture holds for five or fewer objects and give a counterexample with six objects. We extend the counterexample to a configuration that cannot be taken apart with two hands using arbitrary isometries (rigid motions). Note: some figures have been omitted from the online version to save space.
Reducing DRAM Power Using Compiler Assisted Refreshing
Authors: Timothy Sherwood, Brad Calder
Venue:  (2000)

The embedded market has always been a major source of income to the semiconductor market. As both general purpose and embedded processors are moving towards mobile markets different design criterion are becoming more important. The traditionally performance driven field of processor design now has power issues to deal with. Typically there is a performance requirement, and low power, low cost solutions must be found. In this paper we investigate a software and hardware solution for reducing DRAM power. We propose to mark DRAM rows that have data that will not be read again, and then have the memory controller avoid refreshing those rows. To mark the rows with dead data, we propose adding a new instruction freeNrows to the instruction set architecture, to communicate to the memory controller that N rows starting at the address provided should not be refreshed. If a store ever occurs to a non-refreshed row, then the memory controller will change the status of that row to refresh. For the heap memory, a custom allocation routine will be used to mark DRAM rows as non-refresh, when an object is freed from memory. For global memory, compiler analysis can be used to find global data objects (including large arrays) that have part or all of their object as dead leaving a region of code, and then a freeNrows instruction would be inserted to mark all those DRAM rows as non-refreshed. Our results show that on average 60% of the refreshes issued could be ignored without compromising correctness.
THE UCSC JAVA NANOKERNEL VERSION 0.2 API
Authors: Bruce R. Montague
Venue:  (1996)

The Application Program Interfaces (APIs) developed for the UCSC Java Nanokernel (JN) are described. These APIs enable the execution of version 1.0.1 of the Java Virtual Machine (JVM). The implementation of these API''s was independent of the Java Greenthreads API implementation. These APIs provide an interface to a small embedded operating system developed at UCSC which runs on a `single-chip'' PC and provides a web server and web camera. The function, arguments, and return values of each API are described.
REAL-TIME ENVIRONMENTAL INFORMATION NETWORK AND ANALYSIS SYSTEM: PHASE IV.FINAL
Authors: P. E. Mantey, D. D.E. Long, J. J. Garcia-Luna, G. G. Langdon, A. T. Pang, D. M. Fernandez, H. G. Kolsky, C. M. Wittenbrink, B. R. Gritton, W. A. Nuss
Venue:  (1995)

The Real-Time Environmental Information Network and Analysis System (REINAS) is a continuing engineering research and development program with the goal of designing, developing and testing an operational prototype system for data acquisition, data management, and visualization. This system is to support the real-time utilization of advanced instrumentation in environmental science. Current applications are in meteorology and oceanography; others envisioned include geophysics, hydrology, air pollution, etc. The REINAS project has been funded by a Department of Defense University Research Initiative through the Office of Naval Research. Participating institutions include the Naval Postgraduate School (NPS), the Monterey Bay Aquarium Research Institute (MBARI) and the Baskin Center for Computer Engineering and Information Sciences of the University of California, Santa Cruz (UCSC). The REINAS system has been designed for regional real-time environmental monitoring and analysis. It is a modern system, integrated into the Internet, for conducting interactive real-time coastal air/ocean science. The database design of REINAS is independent of specific database technology and is designed to support operational scientific needs throughput the entire scientific data life-cycle. During the previous phases a survey of available technologies was made, selections of the those to be used in the prototype system were made, and detailed architecture of REINAS and experimentation with subsystems for data collection, data management, processing, and visualization were started. This report documents the status of REINAS in Phase IV -- the Experimentation and System Verification Phase.
Using N-grams to Process Hindi Queries with Transliteration Variations
Authors: Anand Natrajan, Allison L. Powell, James C. French
Venue:  (1997)

Retrieval systems based on N-grams have been used as alternatives to word-based systems. N-grams offer a language-independent technique that allows retrieval based on portions of words. A query that contains misspellings or differences in transliteration can defeat word-based systems. N-gram systems are more resistant to these problems. We present a retrieval system based on N-grams that uses a collection of Hindi songs. Within this retrieval system, we study the effect of varying N on retrievability. Additionally, we present an alternative spell-checking tool based on N- grams. We conclude with a discussion of the number of N-grams produced by different values of N for different languages and a discussion of the choice of N.
Finding Straight Lines and Curves in Engineering Line Drawings
Authors: J. P Bixler, Layne T. Watson, J. P Sanford
Venue:  (1987)

This paper addresses the problem of distinguishing straight lines from curves in noisy gray tone images, and mathematically representing those lines and curves. A method for locating comers is discussed as well as criteria, based on spline representations, for classifying line segments as straight or curved. Results are given for several typical noisy engineering line drawings.
USING IF-THEN-ELSE DAGS TO DO TECHNOLOGY MAPPING FOR FIELD-PROGRAMMABLE GATE ARRAYS
Authors: Kevin Karplus
Venue:  (1990)

This paper presents two new algorithms for doing mapping from multi-level logic to field-programmable gate arrays. One algorithm, Xmap, is for mapping to table-lookup gates (for example, the Xilinx chip); the other, Amap, is for mapping to selector-based architectures (for example, the Actel chip). Mapping to the Actel architecture can also be achieved by mapping to 3-input tables, and replacing them with equivalent Actel cells (XAmap). The algorithms are based on an if-then-else DAG representation of the functions. The technology mappers differ from previous mappers in that the circuit is not decomposed into fan-out-free trees. The gate counts and CPU time are compared with three previous mappers for these architectures: misII, Chortle, and mis-pga. The Xmap algorithm for table-lookup architectures gets 7\% fewer cells than Chortle, 11\% fewer than misII, and 14\% fewer than mis-pga, and is 4.5 times faster than Chortle, 17 times faster than misII, and at least 150 times faster than mis-pga. The Amap algorithm for Actel cells use 6\% fewer cells than misII and about 8\% more cells than the best achieved by mis-pga, and is at least 25 times as fast as misII and at least 586 times as fast as mis-pga.
USING MARKOV MODELS AND HIDDEN MARKOV MODELS TO FIND REPETITIVE EXTRAGENIC PALINDROMIC SEQUENCES IN ESCHERICHIA COLI
Authors: Kevin Karplus
Venue:  (1994)

This paper presents a technique for using simple Markov models and hidden Markov models (HMMs) to search for interesting sequences in a database of DNA sequences. The models are used to create a cost map for each sequence in the database. These cost maps can be searched rapidly for subsequences that have significantly lower costs than a null model. Milosavljevic''s algorithmic significance test is used to determine when a subsequence is significantly found. The sequences reported are trimmed to maximize the signal-to-noise ratio (cost savings / sqrt(length)). Methods are given for automatically constructing simple Markov models and hidden Markov models from small training sets. The techniques are illustrated by searching a database of E. coli genomic DNA, EcoSeq6, for clusters of Repetitive Extragenic Palindromic sequences (REPs). Of the known REPs, 91% are found with simple Markov models starting with a single REP cluster as a seed, and 95% are found by a hidden Markov model built from the results of the simple Markov model search. There are no false positives from the simple Markov models, and the few extra sequences found by the HMMs may be genuinely related sequences.
Estimating the Size of the Olfactory Repertoire,
Authors: L. Carmel, D. Harel, D. Lancet
Venue:  (2001)

The concept of shape space, which has been successfully implemented in immunology, is used here to construct a model for the discrimination power of the olfactory system. Using reasonable assumptions on the behavior of the biological system, we are able to estimate the number of distinct olfactory receptor types. Our estimated value of around 1000 receptor types is in high agreement with experimental data.
Proceedings of the First AOSD Workshop on Aspects, Components, and Patterns for Intrastructure Software
Authors: Coady Yvonne
Venue:  (2002)

Aspect-oriented programming, component models, and design patterns are modern and actively evolving techniques to improving the modularization of complex software. In particular, these techniques hold great promise for the development of "systems infrastructure" software, e.g., application servers, middleware, virtual machines, compilers, operating systems, and other software that provides general services for higher-level applications. The developers of infrastructure software are currently faced with increasing demands from application programmers needing higher-level support for application development. Meeting these demands requires careful use of software modularization techniques, since infrastructural concerns are notoriously hard to modularize. Aspects, components, and patterns provide very different means to deal with infrastructure software, but despite their differences, they have much in common. For instance, component models try to free the developer from the need to deal directly with services like security or transactions. These are primary examples of crosscutting concerns, and modularizing such concerns are the main target of aspect-oriented languages. Similarly, design patterns like Visitor and Interceptor facilitate the clean modularization of otherwise tangled concerns. This workshop aims to provide a highly interactive forum for researchers and developers to discuss the application of and relationships between aspects, components, and patterns within modern infrastructure software. The goal is to put aspects, components, and patterns into a common reference frame and to build connect ions between the software engineering and systems communities.
Optimal and Random Partitions of Random Graphs
Authors: Lenwood S. Heath, Joseph W. Lavinus
Venue:  (1993)

The behavior of random graphs with respect to graph partitioning is considered. Conditions are identified under which random graphs cannot be partitioned well, i.e., a random partition is likely to be almost as good as an optimal partition.
Determination of constitutive material parameters for sheet metal forming
Authors: M. Kompis, T. G. Faurholdt
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Constitutive material parameters obtained from different experimental methods can differ. In order to get higher accuracy of identified material parameters for the deep drawing process an inverse method was employed. Inverse methods enable to use deep drawing experiment for inverse determination of material parameters from load-displacement curve and geometrical quantities. Principle of presented method is minimisation of error between experimentally achieved data and the calculated data in the least square sense. The core of the used inverse module is optimisation based on Levenberg-Marquardt algorithm where the material constants are taken as design variables. Both the identification isotropic and anisotropic material parameters have been analysed. Convergence of inverse method connected with deep drawing experiment was examined and good results were achieved.
Finding Structure via Compression
Authors: Jason Hutchens, Mike Alder
Venue:  (1997)

A statistical language model may be used to segment a data sequence by thresholding its instantaneous entropy. In this paper we describe how this process works, and we apply it to the problem of discovering separator symbols in a text. Our results show that language models which bootstrap themselves with structure found in this way undergo a reduction in perplexity. We conclude that these techniques may be useful in the design of generic grammatical inference systems.
Topological Testing
Authors: Miroslaw Malek, Antoine Mourad, Mihir Pandya
Venue:  (1989)

A concept of topological testing is introduced and its applications are presented. Topological testing uses graph theoretic optimization methods such as the Traveling Salesman Problem, the Chinese Postman Problem, path covering and partitioning to minimize the test time. The topological testing techniques can be applied to each level of system hierarchy, namely, circuit, logic, register transfer, instruction and processor-memory-switch levels. Specifically, the topological testing approach is demonstrated by developing tests for the multistage interconnection network and the hypercube network. Time optimization for the testing of these networks gives very promising results by taking advantage of inherent parallelism and removing test redundancy. Three orders of magnitude improvement is achieved by applying topological testing techniques to the testing of an existing multistage interconnection network.