ppxscal/embedding_network huggingface dataset:
Optimising Query Answering in the Presence of Access Limitations (Position Paper)
Authors: Andrea Cali, Diego Calvanese
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Relational data may have access limitations, i.e., relations may require certain attributes to be selected when they are accessed; this happens, for instance, while querying web data sources (wrapped in relational form) or legacy databases. It is known that the evaluation of a conjunctive query under access limitations requires a recursive algorithm that is encoded into a Datalog program. In this paper we consider the problem of optimising query answering in this setting, where the query language is that of conjunctive queries. We review some optimisation techniques for this problem, that aim to reduce the number of accesses to the data in the query plan. Then we argue that checking query containment is necessary in this case for achieving effective query optimisation. Checking containment in the presence of access limitations would amount to check containment of recursive Datalog programs, which is undecidable in general. We show however that, due to the specific form of the Datalog programs resulting from encoding access limitations, the containment problem is indeed decidable. We present a decision procedure, first presented in a paper by the authors and based on chase techniques, and we analyse its computational complexity.
Fast solvers for queueing systems with negative customers
Authors: You-Wei Wen, Wai-Ki Ching, Michael K. Ng
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

In this paper, we are interested in solving queueing systems having Poisson batch arrivals, exponential servers and negative customers. Preconditioned Conjugate Gradient (PCG) method is applied to solving the steady-state probability distribution of the queueing system. Preconditioners are constructed by exploiting near-Toeplitz structure of the generator matrix and the Gohberg-Semumcul formula. We proved that the preconditioned system has singular values clustered around one. Therefore Conjugate Gradient (CG) methods when applied to solving the preconditioned system, we expect fast convergence rate. Numerical examples are given to demonstrate our claim.
TEAKS: simulation of human performance at work to support team configuration
Authors: J. Martínez-Miranda, A. Aldea, R. Bañares-Alcántara, M. Alvarado
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The management of a complex engineering project is a difficult task that initially involves the division of the project into tasks; the selection of the right people; and the correct allocation of those tasks for the selected people. Team configuration process is typically performed by a manager based on his/her past experience and the available (though frequently scarce, uncertain and dynamic) information about the cognitive, personal and social characteristics of the potential team members. To support this decision-making process we propose TEAKS, a knowledge-based tool that given an initial team configuration and a set of tasks, simulates the most possible team performance. Its formal bases are Fuzzy Set Theory and Fuzzy Logic and it is implemented using Multi-Agent Systems technology in Java, JADE, JESS and FuzzyJESS. This tool was validated with an industrial project involving 23 team members and 23 tasks (ranging from task assignment to SAP administration, SQL programming and equipment connectivity).
Multilingual Semantics in the Request-Service Matchmaking
Authors: Alexandra Galatescu
Venue: Proceedings of the European Conference on Web Services (2006)

The paper motivates the multilingualism and gives the main results of an analysis of the multilingualism problems in a system aiming at the ontology-based integration of transnational web services. The focus in this paper is on the possible premises (preconditions) in such a system and on a solution for the multilingual request-service matchmaking (service discovery based on the requestor's preferences), for two alternative cases, depending on the language the service providers use for the definition of their services.
Exploring C4ISR employment methods
Authors: Terri G. Chang
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We will investigate several employment schemes for Command, Control, Intelligence Surveillance and Reconnaissance (C4ISR) collection assets in a simulated Force combat model. These collection assets include Unmanned Aerial Vehicles (UAV) and any ground platforms, normally part of a conventional coalition force lay down. Samples of ground assets include: armored personnel carriers (APC), helicopters, tanks, trucks, binoculars and eyes. Collection asset performance characteristics, along with obtained sensor scans, enable probabilistic identification of participating adversaries or their weapon systems. Comparative analysis focuses on the time to initial enemy observation, threshold of commander's critical information requirements met, and prevention of collection asset loss rate. The analyst controls all thresholds via the user interface. Additionally, a paradigm for information management, i.e. intelligence fusion, is presented. We explore procedures for reducing data volume within this paradigm. We will also discuss implications for the coordination of simulation, analysis, and acquisition activities.
Improved algorithms for the projection of points on NURBS curves and surfaces
Authors: Ilijas Selimovic
Venue: Computer Aided Geometric Design (2006)

Improved algorithms for the metric projection of points on NURBS curves and surfaces are given. The employment of new exclusion criteria within the subdivision strategy increases the robustness and leads to a considerable reduction of computation time.
Real time target evaluation search
Authors: Cagatay Undeger, Faruk Polat
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper we propose a real-time search algorithm called Real-Time Target Evaluation Search (RTTES) for the problem of searching a route in grid worlds from a starting point to a static or dynamic target point in real-time. The algorithm makes use of a new effective heuristic method which utilizes environmental information to successfully find solution paths to the target in dynamic and partially observable environments. The method requires analysis of obstacles to determine closed directions and estimate the goal relevance of open directions in order to identify the most beneficial move. The environment is assumed to be a planar grid and the agent has limited perception. In this paper, we compared RTTES with Real-Time A* (RTA*) and Real-Time Edge Follow (RTEF), and observed a significant improvement.
Lock allocation
Authors: Michael Emmi, Jeffrey S. Fischer, Ranjit Jhala, Rupak Majumdar
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assignment from global variables to locks and a lock instrumentation that determines where each lock should be acquired and released such that the resulting instrumented program is guaranteed to preserve atomicity and deadlock freedom (provided all shared state is accessed only within atomic sections). Our algorithm works in the presence of pointers and procedures, and sets up the lock allocation problem as a 0-1 ILP which minimizes the conflict cost between atomic sections while simultaneously minimizing the number of locks. We have implemented our algorithm for both C with pthreads and Java, and have applied it to infer locks in 15K lines of AOLserver code. Our automatic allocation produces the same results as hand annotations for most of this code, while solving the optimization instances within a second for most programs.
Computer vision based unistroke keyboard system and mouse for the handicapped
Authors: M. E. Erdem, I. A. Erdem, V. Atalay, A. E. Cetin
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, a unistroke keyboard based on computer vision is described for the handicapped. The keyboard can be made of paper or fabric containing an image of a keyboard, which has an upside down U-shape. It can even be displayed on a computer screen. Each character is represented by a non-overlapping rectangular region on the keyboard image and the user enters a character by illuminating a character region with a laser pointer. The keyboard image is monitored by a camera and illuminated key locations are recognized. During the text entry process the user neither have to turn the laser light off nor raise the laser light from the keyboard. A disabled person who has difficulty using his/her hands may attach the laser pointer to an eyeglass and easily enter text by moving his/her head to point the laser beam on a character location. In addition, a mouse-like device can be developed based on the same principle. The user can move the cursor by moving the laser light on the computer screen which is monitored by a camera.
Water Jets as Pixels: Water Fountains as Both Sensors and Displays
Authors: Steve Mann, Michael Georgas, Ryan Janzen
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

We propose a hydraulic user interface consisting of an array of spray jets and the appropriate fluid sensing and fluid flow control systems for each jet, so that the device functions as a fluid-based tactile user interface. Our array of fluid streams work like the keys on a keyboard, but where each fluid stream can also provide tactile feedback by dynamically modulating the pressure of the fluid spray, so that the keyboard is actually bi-directional (i.e. is both an input and an output device). A 104-jet version can be used as a fun and tactile "QWERTY..." style keyboard. More importantly, however, the device can also be used for applications, such as musical instruments, where its more expressive multi-dimensional input capabilities can be put to full use. One such instrument, the hydraulophone (hydrauliphone, hydraulaphone), is a hollow tubular object with a row of holes in it. It is played much like one would play a tin flute or recorder, by covering up the holes to restrict fluid flow. This gives rise to a fun new way of playing music by successively blocking water jets in a fountain, or while frolicking in a pool, or splash pad. Additionally, the hydraulophone can be used as a teaching tool to help children learn music by playing in the water. We demonstrate this teaching capability by way of an implementation of the arcade game "Touch Me" using a hydraulic user interface. We describe some of our present and upcoming installations of these devices in public parks, pools, and aquatic play areas.
Reducing Verification Complexity of a Multicore Coherence Protocol Using Assume/Guarantee
Authors: Xiaofang Chen, Yu Yang, Ganesh Gopalakrishnan, Ching-Tsun Chou
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

We illustrate how to employ metacircular assume/ guarantee reasoning to reduce the verification complexity of finite instances of protocols for safety, using nothing more than an explicit state model checker. The formal underpinnings of our method are based on establishing a simulation relation between the given protocol M, and several overapproximations thereof, \tilde M_1,..., \tilde M_k. Each \tilde M_i simulates M, and represents one "view" of it. The \tilde M_{i}s depend on each other both to define the abstractions as well as to justify them.We show that in case of our hierarchical coherence protocol, its designer could easily construct each of the \tilde M_i in a counterexample guided manner. This approach is practical, considerably reduces the verification complexity, and has been successfully applied to a complex hierarchical multicore cache coherence protocol which could not be verified through traditional model checking.
Beyond Geovisualization
Authors: Menno Jan Kraak
Venue: IEEE Computer Graphics and Applications (2006)

Everyday, each of us makes many decisions based on geographic information. Often we do this without realizing it, such as when we are walking through a building or following instructions from a voice driven car navigation system.However, when these decisions have a larger impact on our daily lives, we need visual support to comprehend the effects of our decisions. The International Cartographic Association's Commission on Visualization and Virtual Reality examines these types of issues and takes a fresh approach to mapping. Maps offer interaction with the data behind the visual representation and act as instruments that encourage exploration. As such, they stimulate (visual) thinking about geospatial patterns, relationships, and trends. This article discusses these new activities in geovisualization research.
Simulation-based optimization for material dispatching in a retailer network
Authors: Ganesh Subramaniam, Abhijit Gosavi
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper presents preliminary work done on simulation-based optimization of a stochastic material-dispatching system in a retailer network. The problem we consider is one of determining the optimal number of trucks and quantities to be dispatched in such a system. Theoretical solution models for versions of this problem can be found in the literature. Unlike most theoretical models, we can accommodate many real-life considerations, such as arbitrary distributions of the governing random variables, and all important cost elements, such as inventory-holding costs, stock-out costs, and transportation costs. We have used two techniques, namely, neuro-response surfaces and simulated annealing, for optimizing our system. We have also used a problem-specific heuristic, known as the mean demand heuristic, to provide us with a good starting point for simulated annealing and a benchmark for our other methods. Some computational results are also provided.
Book Review ofWeb Services in the Enterprise: Concepts, Standards, Solutions, and Management
Authors: Yazhe Tang, Hanan Lutfiyya
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Web Services in the Enterprise: Concepts, Standards, Solutions, and Management. Akhil Sahai and Sven Graupner. New York: Springer, 2005. 312 pp For those who have an academic background of distributed systems and management, upon acquainting oneself with Web services two questions are usually raised: (1) What is the difference between Web services and middleware like CORBA? (2) What makes Web services and their management so unique, e.g., what makes it different from commonWeb applications such as Web server applications? The answers to these questions can be found in the book written by Akhil Sahai and Sven Graupner. This book not only covers concepts and architectures related to Web services and their management, but also provides details on the relationship between Web services and middleware as well as the relationship among web services management, network management, application management, enterprise management and business management. The book is divided into three major parts. The first part (Chapters 1 to 4) introducesWeb services concepts and standards, such as service description, service registry and discovery as well as service composition. Also in this part, traditional application management, which is regarded as a basis for Web service management, is discussed in terms of main life cycle of applications, namely application creation, application deployment and application operation. As current IT infrastructures in enterprises are becoming more and more service oriented, enterprise management has a close relationship with Web service management. Thus Chapter 4 is focused on issues that include agent-based management infrastructure, three-tiered management infrastructure, FCAPS (Fault Configuration Account Performance Security) functionality model, integrated IT service management (ITSM) and model-based management.
Lot Sizing, Pricing and Lead Time Decisions with Time and Price Sensitive Demand
Authors: Jian-jun Shao, Da-gang Ke
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Speed has emerged, in addition to price, as the dominant factor in determining competitive advantage. Therefore, innovation-oriented firms have been competing along dimensions other than price, lead time being one such dimension. In this paper, we take a more complicated system: multiple operation system as research object to study how to make lot sizing, pricing and lead time decisions with time and price sensitive demand. This is different from many previous studies which take simple systems such as M/M/1, G/G/s as their object. In this paper, we develop an analytic model integrating both activity-based costing and mixed-integer programming to analyze the impact of demand and lot size on work-in-process and lead time, then studies the operating decisions of optimal lot size, lead time and price under given conditions and the effects of market capacity and raw material cost on these optimal decisions. The results provide useful managerial insights for making the best competing operating decisions for make-to-order (MTO) firms not only in service sectors but also manufacturing sectors.
A Rule-Based Mailing System for an Organization
Authors: Hanki Kim, Sang-Gyu Shin, Motomichi Toyama
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

An organization usually operates its own mailing system to provide each person with an e-mail address under its domain name. There may exist a number of mailing lists in use, each of which refers to a group of its subscribers. The problem entailed in this conventional mailing scheme is that it requires constant administration from its initiation to its maintenance. This paper proposes a rule-based mailing system where e-mail is delivered based on rules, instead of its recipients' e-mail addresses. With this rule-based mailing approach, the administrator need not any more manage individual e-mail addresses and mailing lists respectively since it guarantees a single point of administration by involving the organization's database. Furthermore, it virtually offers numerous mailing lists without actually having them. Our rule-based mailing scheme is straightforward to establish, fully compatible with any existing mailing systems, yet achieves an efficient way to construct an organization's internal mailing system.
Automated response surface methodology for stochastic optimization models with unknown variance
Authors: Robin P. Nicolai, Rommert Dekker, Nanda Piersma, Gerrit J. van Oortmarssen
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Response Surface Methodology (RSM) is an optimization tool that was introduced in the early 50's by Box and Wilson (1951). In this paper we are interested in finding the best settings for an automated RSM procedure when there is very little information about the objective function. We will present a framework of the RSM procedures that is founded in recognizing local optima in the presence of noise. We emphasize both stopping rules and restart procedures. The results show that considerable improvement is possible over the proposed settings in the existing literature.
Issues in development of simultaneous forward-inverse metamodels
Authors: Russell R. Barton
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Metamodels provide estimates of simulation outputs as a function of design parameters. Often in the design of a system or product, one has performance targets in mind, and would like to identify system design parameters that would yield the target performance vector. Typically this is handled iteratively through an optimization search procedure. As an alternative, one could map system performance requirements to design parameters via an inverse metamodel. Inverse metamodels can be fitted 'for free,' given an experiment design to fit several forward models for multiple performance measures. This paper discusses this strategy, and some of the issues that must be resolved to make the approach practical.
Reconstruction with Interval Constraints Propagation
Authors: Michela Farenzena, Agostino Dovier
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account the propagation of data errors and roundoff. Image points are represented as small rectangles: As a result, the output of the n-views triangulation is not a single point in space, but a polyhedron that contains all the possible solutions. Interval Analysis is used to bound this polyhedron with a box. Geometrical constraints such as orthogonality, parallelism, and coplanarity are subsequently enforced in order to reduce the size of those boxes, using Constraint Logic Programming. Experiments with real calibrated images illustrate the approach.
A discrete event simulation model for assembling the international space station
Authors: Grant R. Cates, Mansooreh Mollaghasemi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In late 2002 and early 2003, a discrete event simulation (DES) model was used to help NASA assess the viability of achieving a politically important goal. The goal was to complete the assembly of the International Space Station through the milestone known as United States Core Complete by February 19th, 2004. The analysis provided by the DES model was subsequently shown to be consistent with NASA's official assessments regarding the completion date for U.S. Core Complete. The success of this DES model has led to further improvements in modeling NASA's project to assemble the International Space Station.
There are uncountably many topological types of locally finite trees
Authors: Lilian Matthiesen
Venue: Journal of Combinatorial Theory Series B (2006)

Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of van der Holst, we prove that there are uncountably many equivalence classes.