ppxscal/embedding_network huggingface dataset:
Laser Pointer Tracking in Projector-Augmented Architectural Environments
Authors: Daniel Kurz, Ferry Hantsch, Max Grobe, Alexander Schiewe, Oliver Bimber
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

We present a system that employs a custom-built pan-tilt-zoom camera for laser pointer tracking in arbitrary real environments. Once placed in a room, it carries out a fully automatic self-registration, registrations of projectors, and sampling of surface parameters, such as geometry and reflectivity. After these steps, it can be used for tracking a laser spot on the surface as well as an LED marker in 3D space, using inter-playing fish-eye context and controllable detail cameras. The captured surface information can be used for masking out areas that are problematic for laser pointer tracking, and for guiding geometric and radiometric image correction techniques that enable a projector-based augmentation on arbitrary surfaces. We describe a distributed software framework that couples laser pointer tracking for interaction, projector-based AR as well as video see-through AR for visualizations, with the domain specific functionality of existing desktop tools for architectural planning, simulation and building surveying.
A Novel FPGA Mathematical Technology Based AI-Fuzzy VCN Algorithm of Automation
Authors: Ting-Fang Zhang, Qiu-Sun Ye
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Field Programmable Gate Array (FPGA) was a new material Programmable Logic Units in end of the 20th century, FPGA was with some properties such that, large memory of capacities, short delays of time, improvement able & flexibilities etc. On the basis theory of Neural Fuzzy System of Networks (NFSN), this paper gives a FPGA method of DNMA (Dynamic Numbers Measuring Algorithm) with VCN (Variable Carrying Numbers). The algorithm takes a reusing technique of VCR (Variable Carrying Rules) path, a process of middle-data to be shaped & placed in RAM. In the deep research & analysis of testing, this algorithm is practicable.
A semi-analytical numerical method for solving evolution and elliptic partial differential equations
Authors: A. S. Fokas, N. Flyer, S. A. Smitheman, E. A. Spence
Venue: Journal of Computational and Applied Mathematics (2009)

A new method for analyzing initial-boundary value problems for linear and integrable nonlinear partial differential equations (PDEs) has been introduced by one of the authors. For linear PDEs this method yields analytical solutions for certain problems that apparently cannot be solved by classical methods such as Green's function representations, classical transforms and the method of images. Even for problems that can be solved by classical methods, the new method has advantages such as avoiding the solution of ordinary differential equations that result from the classical transforms, as well as constructing integral solutions in the complex plane which converge exponentially fast and which are uniformly convergent at the boundaries. Here we review the numerical implementation of the new method to evolution and elliptic PDEs.
Polarization-based vision through haze
Authors: Yoav Y. Schechner, Srinivasa G. Narasimhan, Shree K. Nayar
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

We present an approach for easily removing the effects of haze from passively acquired images. Our approach is based on the fact that usually the natural illuminating light scattered by atmospheric particles (airlight) is partially polarized. Optical filtering alone cannot remove the haze effects, except in restricted situations. Our method, however, stems from physics-based analysis that works under a wide range of atmospheric and viewing conditions, even if the polarization is low. The approach does not rely on specific scattering models such as Rayleigh scattering and does not rely on the knowledge of illumination directions. It can be used with as few as two images taken through a polarizer at different orientations. As a byproduct, the method yields a range map of the scene, which enables scene rendering as if imaged from different viewpoints. It also yields information about the atmospheric particles. We present experimental results of complete dehazing of outdoor scenes, in far-from-ideal conditions for polarization filtering. We obtain a great improvement of scene contrast and correction of color. © 2003 Optical Society of America
Enforcing Business Collaboration Consistency in Business Transaction Net
Authors: Haiyang Sun, Jian Yang
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Managing business collaboration is about coordinating the flow of information among organizations and linking their business processes into a cohesive whole. A consistent outcome is expected within and among involving organization. However, inadequate coordination onthe autonomous, heterogeneous, and long-lasting cross-organizational business processes can lead to inconsistent execution in loosely-coupled environment, e.g., Service Oriented Computing (SOC). Therefore, a model that describes business collaboration to enforce consistency for each partner as well as consistency for thecollaboration as a whole becomes essential. Previously we proposed a Business Transaction Net(BTx-Net) as a theoretical model to describe business collaboration during design time and manage consistency at run-time execution. In this paper, we will further explore the BTx-Net's enforceability for managing consistency by performingTransactional Management Actions(TMAs) which are needed to be taken during the occurrence of runtime faults and exceptions.
Using simulation with design for six sigma in a server manufacturing environment
Authors: Sreekanth Ramakrishnan, Pei-Fang Tsai, Christiana M. Drayer, Krishnaswami Srihari
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This research presents an integrated simulation modeling-Design For Six Sigma (DFSS) framework to study the design and process issues in a server manufacturing environment. The server assembly process is characterized by long cycle times, high fall-out rates and extremely complex assembly operations. To ensure on-time customer delivery, these enterprises adopt a make-to-plan and build-to-order philosophy. However, this model is extremely complex, resulting in wastes and inefficiencies in the associated processes. Lean and six sigma approaches have been successful in improving performance by eliminating waste in the design and operational processes. In this study, an integrated simulation modeling - DFSS framework is proposed to (i) address effects of variation, (ii) assess interactions effects between various sub-systems, and (iii) study proposed process (or design) changes, while performing "what-if" analysis. This framework was then used to identify opportunities for improving the operational and design issues in a server manufacturing environment.
Mapping UML Diagrams for Generating WS-CDL Code
Authors: Giner Alor-Hernandez, Isaac Machorro-Cano, Juan Miguel Gomez, Jesus Cruz-Ahuactzi, Ruben Posada-Gomez, Myriam Mencke, Ulises Juarez-Martinez
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Web services choreography allows enterprises to create new business processes that mirror today's dynamic and ever-changing business needs. Creating a business process requires not only a clear definition of the collaboration patterns of all its components, but also a way of depicting standard Business-to-Business (B2B) and Enterprise Application Integration (EAI) interactions. In this context, WS-CDL and BPEL are XML-based Web services compositional languages. In this work, a mapping mechanism from BPEL broker services described in UML activity diagrams to WS-CDL code is proposed. It is believed that by using the mechanism proposed, small organizations can automate many of their business processes without making large investments in software development and deployment. Finally, an e-commerce scenario is presented where our proposal was implemented and validated.
Novel job based and machine based lower bound on makespan in jobshop scheduling problem
Authors: Ali Kargarnejad, Mehdi Maneshi, Shahrdad Ezzatdoust
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

In this paper, two new lower boundaries named Extended Machine-Based Lower Bound and Extended Job-Based Lower Bound on Jobshop scheduling problem with objective makespan function are being issued. In order to calculate the extended low boundaries, situations are being considered in which, that processing of operations by machine, is not possible. With making use of the given low boundaries, better estimation relative to optimized response can be obtained. No matter how much the low boundary is close to the real optimized boundary, the evaluation of obtained results from different algorithms will be carried out with more precision. Low Extended boundaries were computed on 80 available test problems. After computing extended low boundaries, they are compared with available boundaries; results show that on 55 percent of the available results cases had development relative to previous results.
Thinking Networks - the Large and Small of it: Autonomic and Reasoning Processes for Information Networks
Authors: Kieran Greer
Venue:  (2008)

This book will describe different aspects of knowledge-based networks and is both important and timely for future Internet-based or mobile information networks. This book combines the topics of Artificial Intelligence, service-based systems and distributed knowledge management. It hopes to give a broad overview and introduction to various aspects of these networks, with respect to existing mechanisms for representing and using such systems. After reading this book the reader should have a good idea of the sort of systems and algorithms that can be used to organise and use knowledge in today's world and where we might be going to in the future. The second half of the book will discuss some research ideas in the area of self-organisation and reasoning. The research will propose different levels of reasoning that can be performed over an information network, or a neural-like network and will ultimately offer an architecture that will allow the network to 'think'.
Bi-inductive structural semantics
Authors: Patrick Cousot, Radhia Cousot
Venue: Information and Computation (2009)

We propose a simple order-theoretic generalization, possibly non-monotone, of set-theoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows structural operational semantics to describe simultaneously the finite terminating and infinite diverging behaviors of programs. This is illustrated on grammars and the structural bifinitary small big-step trace relational operational semantics of the call-by-value @l-calculus (for which co-induction is shown to be inadequate).
Connected Rectilinear Graphs on Point Sets
Authors: Maarten Löffler, Elena Mumford
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

Given n points in d-dimensional space, we would like to connect the points with straight line segments to form a connected graph whose edges use d pairwise perpendicular directions. We prove that there exists at most one such set of directions. For d = 2 we present an algorithm for computing these directions (if they exist) in O (n 2) time.
Stable marriage with ties and bounded length preference lists
Authors: Robert W. Irving, David F. Manlove, Gregg O'Malley
Venue: Journal of Discrete Algorithms (2009)

We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital posts. In such a setting, weak stability is the most common solution concept, and it is known that weakly stable matchings can have different sizes. This motivates the problem of finding a maximum cardinality weakly stable matching, which is known to be NP-hard in general. We show that this problem is solvable in polynomial time if each man's list is of length at most 2 (even for women's lists that are of unbounded length). However if each man's list is of length at most 3, we show that the problem becomes NP-hard (even if each women's list is of length at most 3) and not approximable within some @d>1 (even if each woman's list is of length at most 4).
Database machines and some issues on DBMS standards
Authors: Stanley Y. W. Su, Hsu Chang, George Copeland, Paul Fisher, Eugene Lowenthal, Stewart Schuster
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

There are several co-related activities in the database area and computer architecture that make the discussion of database machines and their implications on DBMS standards timely and meaningful. First, in the database area there is a drive toward more powerful database management systems which support high-level data models and languages. The motive for this drive is the requirement to greatly improve user/programmer productivity and to protect applications from changes in the user environment. However, supporting these interfaces with software means often introduces inefficiency in database management systems because of the many levels of complex software which are required to map the high-level data representation and languages to the low level storage representation and machine codes. Second, the need for systems which handle very large databases is increasing rapidly. Very large databases complicate the problems of retrieval, update, data recovery, transaction processing, integrity, and security. Software solutions to these problems work well for both small databases supporting many applications and large databases supporting only a few applications. However, the labor-intensive cost, time delays and reliability problems associated with software development and maintenance will soon become prohibitive as large and highly shared databases emerge. The search for hardware solutions to these problems is a necessary and viable alternative for balancing functionality and price/performance. Third, the progress made in hardware technology in the past decade is phenomenal. The cost of memories, processors, terminals and communication devices has dropped and will continue to drop at a drastic rate. It is time for a reevaluation of the traditional role of hardware and software in solving problems of today and tomorrow in database management.
Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences, 1st edition
Authors: Gonzalo Navarro, Mathieu Raffinot
Venue:  (2007)

Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications.
Toward a human-like biped robot with compliant legs
Authors: Fumiya Iida, Yohei Minekawa, Jürgen Rummel, André Seyfarth
Venue: Robotics and Autonomous Systems (2009)

Conventional models of bipedal walking generally assume rigid body structures, while elastic material properties seem to play an essential role in nature. On the basis of a novel theoretical model of bipedal walking, this paper investigates a model of biped robot which makes use of minimum control and elastic passive joints inspired from the structures of biological systems. The model is evaluated in simulation and a physical robotic platform by analyzing the kinematics and ground reaction force. The experimental results show that, with a proper leg design of passive dynamics and elasticity, an attractor state of human-like walking gait patterns can be achieved through extremely simple control without sensory feedback. The detailed analysis also explains how the dynamic human-like gait can contribute to adaptive biped walking.
Improved Error Metric of Terrain Rendering for Flying High Over the Terrain
Authors: Guojun Chen, Baolei Cui, Qinggang Chen
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Error metric is the key problem for generating level of detail of terrain surface, which affects the deviation between the number of triangles and triangular mesh. After analyzing various present methods of calculating error metric, we present an improved algorithm based on roughness. This paper takes the roughness which expresses relief amplitude to be an factor, by which we calculate the error metric, form the sphere of error according to the position of viewpoint, choose appropriate LOD model for each frame. The improved error metrics is applied to the high-altitude terrain when flying high over the terrain. The experiment results show that our algorithm reduces the number of required triangles in terrain rendering, and ensures correct rendering of the entire outline of high steep terrain.
A new certificateless aggregate signature scheme
Authors: Lei Zhang, Futai Zhang
Venue: Computer Communications (2009)

Aggregate signatures are useful in special areas where the signatures on many different messages generated by many different users need to be compressed. In this paper, we study aggregate signatures in certificateless public key settings. We first present the notion and security model of certificateless aggregate signature schemes. Then we give an efficient certificateless aggregate signature scheme. Our scheme is existentially unforgeable under adaptive chosen-message attacks assuming the computational Diffie-Hellman problem is hard.
Specializing Cache Structures for High Performance and Energy Conservation in Embedded Systems
Authors: Michael J. Geiger, Sally A. Mckee, Gary S. Tyson
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

Increasingly tight energy design goals require processor architects to rethink the organizational structure of microarchitectural resources. We examine a new multilateral cache organization, replacing a conventional data cache with a set of smaller region caches that significantly reduces energy consumption with little performance impact. This is achieved by tailoring the cache resources to the specific reference characteristics of each application. In applications with small heap footprints, we save about 85% of the total cache energy. In the remaining applications, we employ a small cache for frequently accessed heap data and a larger cache for low locality data, achieving an energy savings of 80%.
Visual snippets: summarizing web pages for search and revisitation
Authors: Jaime Teevan, Edward Cutrell, Danyel Fisher, Steven M. Drucker, Gonzalo Ramos, Paul André, Chang Hu
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

People regularly interact with different representations of Web pages. A person looking for new information may initially find a Web page represented as a short snippet rendered by a search engine. When he wants to return to the same page the next day, the page may instead be represented by a link in his browser history. Previous research has explored how to best represent Web pages in support of specific task types, but, as we find in this paper, consistency in representation across tasks is also important. We explore how different representations are used in a variety of contexts and present a compact representation that supports both the identification of new, relevant Web pages and the re-finding of previously viewed pages.
Transistor-level layout of high-density regular circuits
Authors: Yi-Wei Lin, Malgorzata Marek-Sadowska, Wojciech Maly
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

In this paper, we describe an automatic place and route strategy for a high-density, super-regular, double-gate transistor-array-based layout. Interconnects on all metal layers are uni-directional and can be manufactured by an OPC-free process [4]. Our objective is to achieve a circuit layout area equal to the transistor footprint. Such layout constraints limit routing flexibility and render traditional approaches impractical. Our tools automatically generate circuits with several tens of transistors. Experimental results demonstrate both the efficiency of the proposed algorithms and the high quality of the layouts produced.
Finite Element Analysis of Phi 2.8 m×5.75+2.25 m Coal mill
Authors: Zuo-bing Cen, Fang Zeng, Tao Fan, Ji-quan Huang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

In this paper, finite element analysis has been applied on the &Phi;2.8 m&times;5.75+2.25 m of southern Africa that has been contracted by CBMI Construction Co Ltd. Different contact finite element model as manholes in different position of the twelve clock points are built by using ANSYS Parametric Design Language (APDL). Stress and deformation under the actual condition were presented by calculating, and it provides academic instruction for design and adjustment of coal mill, in the end of this paper, the analytic result prove its correctness to guide the actual production.
A temporal language for SystemC
Authors: Deian Tabakov, Moshe Y. Vardi, Gila Kamhi, Eli Singerman
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

We describe a general approach for defining new temporal specification languages, and adopting existing languages, for SystemC. We define the concept of "underlying trace" describing the execution of a SystemC model, and then define a set of important primitive assertions about the states in the trace. Our framework not only provides additional expressive power for making atomic assertions, but also provides very fine control over the temporal resolution of the language. Using the primitives defined here as clock expression allows sampling at different levels, from transaction-level to the level of individual statements. The advantage of our approach is that it defines important SystemC properties that have been overlooked previously, and also provides a uniform mechanism for specifying the sampling rate of temporal languages.
Identity Management in Face Recognition Systems
Authors: Massimo Tistarelli, Enrico Grosso
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

Face recognition is one of the most challenging biometric modalities for personal identification. This is due to a number of factors, including the complexity and variability of the signal captured by a face device. Several issues incur in the management of a face template as user's identity. Data dimensionality reduction, compactness of the representation, uniqueness of the template and ageing effects, are just but a few of the issues to be addressed. In this paper we present the current state of the art in face recognition technology and how this related to the proper management of a user's identity. Some real cases are presented and some conclusions are drawn.