ppxscal/embedding_network huggingface dataset:
Development of a Force and Torque Hybrid Display "GyroCubeStick"
Authors: Norio Nakamura, Yukio Fukui
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Multimodal interfaces with the five senses attract a great deal of attention as for the next generation multimedia interface. Especially, the interfaces with additional tactile sensation and force feedback enable us to perform pointing and manipulation operations and navigation operations easily rather than the conventional interfaces without them. The display device using pin array and manipulation arms is the most popular to display tactile sensation and force feedback. The arms and wires restrict userýs movement and reachable area around the device base connected to the arms. These devices are relative larger and are not convenient for mobile uses. Therefore, in this paper, a torque and force feedback device of nongrounding and no reaction base on the human body has been developed, which displays the torque of virtual objects and normal and tangentialforce on the surfaces as the resistanceforce and tactile sensation.
New meta-heuristic for combinatorial optimization problems: intersection based scaling
Authors: Peng Zou, Zhi Zhou, Ying-Yu Wan, Guo-Liang Chen, Jun Gu
Venue: Journal of Computer Science and Technology (2004)

Combinatorial optimization problems are found in many application fields such as computer science, engineering and economy. In this paper, a new efficient meta-heuristic, Intersection-Based Scaling (IBS fbr abbreviation), is proposed and it can be applied to the combinatorial optimization problems. The main idea of IBS is to scale the size of the instance based on the intersection of some local optima, and to simplify the search space by extracting the intersection from the instance, which makes the search more efficient. The combination of IBS with some local search heuristics of different combinatorial optimization problems such as Traveling Salesman Problem (TSP) and Graph Partitioning Problem (GPP) is studied, and comparisons are made with some of the best heuristic algorithms and meta-heuristic algorithms. It is found that it has significantly improved the performance of existing local search heuristics and significantly outperforms the known best algorithms.
On the multilevel structure of global optimization problems
Authors: M. Locatelli
Venue: Computational Optimization and Applications (2005)

In this paper we will discuss the multilevel structure of global optimization problems. Such problems can often be seen at different levels, the number of which varies from problem to problem. At each level different objects are observed, but all levels display a similar structure. The number of levels which can be recognized for a given optimization problem represents a more complete measure of the difficulty of the problem with respect to the standard measure given by the total number of local minima. Moreover, the subdivision in levels will also suggest the introduction of appropriate tools, which will be different for each level but, in accordance with the fact that all levels display a similar structure, will all be based on a common concept namely that of local move. Some computational experiments will reveal the effectiveness of such tools.
A vehicle-track-bridge interaction element considering vehicle's pitching effect
Authors: Ping Lou
Venue: Finite Elements in Analysis and Design (2005)

A finite element method is applied to analyze the dynamic responses of railway track and bridge under a moving railway vehicle. The vehicle, track and bridge are regarded as an integrated system. The moving vehicle is modeled as a two-axle mass-spring-damper system having four degrees of freedom. The rails and the bridge deck are modeled as an elastic Bernoulli-Euler upper beam with finite length and a simply supported Bernoulli--Euler lower beam, respectively, while the elasticity and damping properties of the rail bed are represented by continuous springs and dampers. A vehicle-track-bridge interaction element considering vehicle's pitching effect is proposed for studying the interactions among moving vehicles, and its supporting railway track structure and bridge structure. The element consists of a vehicle modeled as a two-axle mass-spring-damper system having four degrees of freedom, two upper beam elements to model the rails, two lower beam elements to model the bridge deck, and continuous springs and dampers to model the rail bed between two upper beam elements and two lower beam elements. The equations of motion for the vehicle-track-bridge interaction element are directly derived by means of Hamilton principle. After by assembling the stiffness matrices, the damping matrices, the mass matrices and the vectors of nodal loads of all elements, the global equations of motion for the integrated system are obtained. These equations are solved by step-by-step integration method, to obtain simultaneously the dynamic responses of vehicle, track and bridge. Several illustration examples are presented.
Topology Inference for a Vision-Based Sensor Network
Authors: Dimitri Marinakis, Gregory Dudek
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper we describe a technique to infer the topology and connectivity information of a network of cameras based on observed motion in the environment. While the technique can use labels from reliable cameras systems, the algorithm is powerful enough to function using ambiguous tracking data. The method requires no prior knowledge of the relative locations of the cameras and operates under very weak environmental assumptions. Our approach stochastically samples plausible agent trajectories based on a delay model that allows for transitions to and from sources and sinks in the environment. The technique demonstrates considerable robustness both to sensor error and non-trivial patterns of agent motion. The output of the method is a Markov model describing the behavior of agents in the system and the underlying traffic patterns. The concept is demonstrated with simulation data and verified with experiments conducted on a six camera sensor network.
Routing of analog busses with parasitic symmetry
Authors: Lars Schreiner, Markus Olbrich, Erich Barke, Volker Meyer zu Bexten
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

This paper presents a new methodology for routing net bundles like busses and paired nets maintaining parasitic symmetry. It is mainly devoted to analog signal interconnect and can also be used for critical digital busses or clock signals. The PARasitic SYmmetric router (PARSY) is the first router that limits differential capacitances to a user defined value. Wirelength differences inside a net bundle are also equalized automatically. This routing methodology uses a novel module generator approach for wire implementation.
New Venture Evolution and Managerial Capabilities
Authors: Warren Boeker, Robert Wiltbank
Venue: Organization Science (2005)

This study examines factors influencing changes in the top management of start-up firms. Whereas a significant amount of research has examined top management transitions in established firms, we know much less about the factors influencing the evolution of top management capabilities in a new firm. Our research examines these issues in a sample of new ventures founded from 1983 through 1995, examining each firm for seven years after its founding to evaluate the conditions that influence a firm's changes in top management. Results indicate that top management team changes occur in cases of very low or very high firm growth, but are mitigated by a functionally diverse top management team. Power and control of inside and outside constituencies also affect changes in top management, with venture capital ownership and board representation increasing change in top management, and managerial ownership decreasing changes.
Robot colony
Authors: Ramona Georgescu, Hailu Teklehaimanot
Venue: Journal of Computing Sciences in Colleges (2004)

The goal of the project was to build a robot colony where we could perform experiments involving competition, cooperation, and communication between the colony members. In addition, the colony space will provide an environment for testing punctuated anytime learning and emergent behavior. This abstract reports on the development of a power supply for the colony and on the program written for the prototype robot to sense power needs.
SELECTED AI-RELATED DISSERTATIONS
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 103 (Jan., 1988) (1988)

The following are citations selected by title and abstract as being related to Al, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.The online file includes abstracts, which are not published in this listing, but the citations below do include the DAI reference for finding the abstract in the published DAI. Other elements of the citation are author; university, degree, and, if available, number of pages; title; UM order number and year-month of DAI; and DAI subject category chosen by the author of the dissertation. References are sorted first by the initial DAI subject category and second by the author. In addition the database includes masters abstracts, denoted by MAI (Masters Abstracts International) instead of DAI as the reference to the abstract in the published MAI.Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1964, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-268-6090. Price lists and other ordering and shipping information are in the introduction to the published DAI.
Objective Assessment to Restoration of Global Motion-Blurred Images Using Traveling Wave Equations
Authors: Li-Dong Cai
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The relative motion between a camera and the scene will lead images to blur. By appealing to traveling wave equations, not only the restoration of motion-blurred images can be achieved, but also a criterion of objective quality assessment can be obtained for these restored versions even without any a priori knowledge of the original image. And most significantly, this criterion actually applies to any categories of image restoration methods as long as the image blur is caused by linear uniform motion, and with good sensitivity and consistency. 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
On automating Web services discovery
Authors: Boualem Benatallah, Mohand-Said Hacid, Alain Leger, Christophe Rey, Farouk Toumani
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

One of the challenging problems that Web service technology faces is the ability to effectively discover services based on their capabilities. We present an approach to tackling this problem in the context of description logics (DLs). We formalize service discovery as a new instance of the problem of rewriting concepts using terminologies. We call this new instance the best covering problem. We provide a formalization of the best covering problem in the framework of DL-based ontologies and propose a hypergraph-based algorithm to effectively compute best covers of a given request. We propose a novel matchmaking algorithm that takes as input a service request (or query) Q and an ontology $\mathcal{T}$ of services and finds a set of services called a &#x201c;best cover&#x201d; of Q whose descriptions contain as much common information with Q as possible and as little extra information with respect to Q as possible. We have implemented the proposed discovery technique and used the developed prototype in the context of the Multilingual Knowledge Based European Electronic Marketplace (MKBEEM) project.
A voronoi diagram-visibility graph-potential field compound algorithm for robot path planning
Authors: Ellips Masehian, M. R. Amin-Naseri
Venue: Journal of Robotic Systems (2004)

Numerous methods have been developed to solve the motion planning problem, among which the Voronoi diagram, visibility graph, and potential fields are well-known techniques. In this paper, a new path planning algorithm is presented where these three methods are integrated for the first time in a single architecture. After constructing the generalized Voronoi diagram of C-space, we introduce a novel procedure for its abstraction, producing a pruned generalized Voronoi diagram. A broad freeway net is then developed through a new &agr;-MID (maximal inscribed discs) concept. A potential function is assigned to the net to form an obstacle-free network of valleys. Afterwards we take advantage of a bidirectional search, where the visibility graph and potential field modules execute alternately from both start and goal configurations. A steepest descent mildest ascent search technique is used for local planning and avoiding local minima. The algorithm provides a parametric tradeoff between safest and shortest paths and generally yields shorter paths than the Voronoi and potential field methods, and faster than the visibility graph. It also performs well in complicated environments. &copy; 2004 Wiley Periodicals, Inc.
Enhanced Parallel Processing in Wide Registers
Authors: Joan L. Mitchell, Arianne T. Hinds
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Wide computer registers offer opportunities to exploit parallel processing. Instead of using hardware assists to partition a register into independent noninteracting fields, the multiple data elements can borrow and carry from elements to the left, and yet be accurately separated. Algorithms can be designed so that they execute within the allocated precision. Their floating point or irrational constants (e.g., cosines) are converted into integer numerators with floating point denominators. The denominators are then merged into scaling terms. To control the dynamic range and thus require less bits of precision per element, shift rights can be used. The effect of the average truncation errors is analyzed and a technique shown to minimize this average error.
Community source development: an emerging model with new opportunities
Authors: Dawn Ressel Nidy, Fong Kwok
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper focuses on an emerging model for software development in higher education: community source. Community source seeks to blend aspects of both open source and traditional development processes. Volunteers join at the institutional level and share resources and ideas to develop applications for common needs. The code remains open, but the collaboration exists in a meritocracy; those who contribute the most have the most influence on the outcome. While many in the HCI community have long abandoned the prospect of affecting change in open source development, average computer users, rather than developers, are becoming the main audience. As open source matures and community source emerges, some new opportunities are presenting themselves. They require a dialogue within our profession to yield new processes and vocabularies that work within the open source framework.
Numerical Methods for Engineers, 5 edition
Authors: Steven C. Chapra, Raymond Canale
Venue:  (2005)

The fifth edition of Numerical Methods for Engineers continues its tradition of excellence. Instructors love this text because it is a comprehensive text that is easy to teach from. Students love it because it is written for them--with great pedagogy and clear explanations and examples throughout. The text features a broad array of applications, including all engineering disciplines. The revision retains the successful pedagogy of the prior editions. Chapra and Canale's unique approach opens each part of the text with sections called Motivation, Mathematical Background, and Orientation, preparing the student for what is to come in a motivating and engaging manner. Each part closes with an Epilogue containing sections called Trade-Offs, Important Relationships and Formulas, and Advanced Methods and Additional References. Much more than a summary, the Epilogue deepens understanding of what has been learned and provides a peek into more advanced methods. Users will find use of software packages, specifically MATLAB and Excel with VBA. This includes material on developing MATLAB m-files and VBA macros. Approximately 80% of the problems are new or revised for this edition. The expanded breadth of engineering disciplines covered is especially evident in the problems, which now cover such areas as biotechnology and biomedical engineering. Table of contentsPart 1 Modeling, Computers, and Error Analysis1 Mathematical Modeling and Engineering Problem Solving2 Programming and Software3 Approximations and Round-Off Errors4 Truncation Errors and the Taylor SeriesPart 2 Roots of Equations5 Bracketing Methods 6 Open Methods7 Roots of Polynomials8 Case Studies: Roots of EquationsPart 3 Linear Algebraic Equations9 Gauss Elimination10 LU Decomposition and Matrix Inversion11 Special Matrices and Gauss-Seidel12 Case Studies: Linear Algebraic EquationsPart 4 Optimization13 One-Dimensional Unconstrained Optimization14 Multidimensional Unconstrained Optimization15 Constrained Optimization16 Case Studies: OptimizationPart 5 Curve Fitting17 Least-Squares Regression18 Interpolation19 Fourier Approximation20 Case Studies: Curve FittingPart 6 Numerical Differentiation and Integration21 Newton-Cotes Integration Formulas22 Integration of Equations23 Numerical Differentiation24 Case Studies: Numerical Integration and DifferentiationPart 7 Ordinary Differential Equations25 Runge-Kutta Methods26 Stiffness and Multistep Methods27 Boundary-Value and Eigenvalue Problems28 Case Studies: Ordinary Differential EquationsPart 8 Partial Differential Equations29 Finite Difference: Elliptic Equations30 Finite Difference: Parabolic Equations31 Finite-Element Method32 Case Studies: Partial Differential EquationsAppendix A The Fourier SeriesAppendix B Getting Started with MatlabBibliographyIndex
Canonical forms for labelled trees and their applications in frequent subtree mining
Authors: Yun Chi, Yirong Yang, Richard R. Muntz
Venue: Knowledge and Information Systems (2005)

Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. In this paper, we first present two canonical forms for labelled rooted unordered trees&#x2013;the breadth-first canonical form (BFCF) and the depth-first canonical form (DFCF). Then the canonical forms are applied to the frequent subtree mining problem. Based on the BFCF, we develop a vertical mining algorithm, RootedTreeMiner, to discover all frequently occurring subtrees in a database of labelled rooted unordered trees. The RootedTreeMiner algorithm uses an enumeration tree to enumerate all (frequent) labelled rooted unordered subtrees. Next, we extend the definition of the DFCF to labelled free trees and present an Apriori-like algorithm, FreeTreeMiner, to discover all frequently occurring subtrees in a database of labelled free trees. Finally, we study the performance and the scalability of our algorithms through extensive experiments based on both synthetic data and datasets from real applications.
Using Phase Behavior in Scientific Application to Guide Linux Operating System Customization
Authors: Chandra Krintz, Rich Wolski
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

In this paper, we present the design of a system that automatically generates application-specific Linux images for scientific applications that execute using batched cluster resources. Key to our approach is the use of recurring patterns in program performance, i.e., phase-behavior, that can be exploited potentially to guide automatic Linux customization and to enable significantly higher levels in program performance. We overview project and present a set of preliminary results that show the potential of our approach.
The SYNDIKATE text knowledge base generator
Authors: Udo Hahn, Martin Romacker
Venue: Proceedings of the first international conference on Human language technology research (2001)

SYNDIKATE comprises a family of text understanding systems for automatically acquiring knowledge from real-world texts, viz. information technology test reports and medical finding reports. Their content is transformed to formal representation structures which constitute corresponding text knowledge bases. SYNDIKATE's architecture integrates requirements from the analysis of single sentences, as well as those of referentially linked sentences forming cohesive texts. Besides centering-based discourse analysis mechanisms for pronominal, nominal and bridging anaphora, SYNDIKATE is supplied with a learning module for automatically bootstrapping its domain knowledge as text analysis proceeds.
Dynamic PDE-based surface design using geometric and physical constraints
Authors: Haixia Du, Hong Qin
Venue: Graphical Models (2005)

PDE surfaces, which are defined as solutions of partial differential equations (PDEs), offer many modeling advantages in surface blending, free-form surface modeling, and specifying surface's aesthetic or functional requirements. Despite the earlier advances of PDE surfaces, previous PDE-based techniques exhibit certain difficulties such as lack of interactive sculpting capabilities and restrained topological structure of modeled objects. This paper presents an integrated approach that can incorporate PDE surfaces into the powerful physics-based modeling framework, to realize the full potential of PDE methodology. We have developed a prototype system that allows interactive design of flexible topological surfaces as PDE surfaces and displacements using generalized boundary conditions as well as a variety of geometric and physical constraints, hence supporting various interactive techniques beyond the conventional boundary control. The system offers a set of sculpting toolkits that allow users to interactively modify arbitrary points, curve spans, and/or regions of interest across the entire PDE surfaces and displacements in an intuitive and physically meaningful way. To achieve real-time performance, we employ several simple, yet efficient numerical techniques, including the finite-difference discretization, the multigrid-like subdivision, and the mass-spring approximation of elastic PDE surfaces and displacements. In addition, we present the standard bivariant B-spline finite element approximations of dynamic PDEs, which can subsequently be sculpted and deformed directly in real-time subject to the intrinsic PDE constraints. Our experiments demonstrate many attractive advantages of the physics-based PDE formulation such as intuitive control, real-time feedback, and usability to both professional and common users.