ppxscal/embedding_network huggingface dataset:
Brief paper: Finite-horizon dynamic optimization of nonlinear systems in real time
Authors: Vicente Costanza, Pablo S. Rivadeneira
Venue: Automatica (Journal of IFAC) (2008)

A novel scheme for constructing and tracking the solution trajectories to regular, finite-horizon, deterministic optimal control problems with nonlinear dynamics is devised. The optimal control is obtained from the states and costates of Hamiltonian ODEs, integrated online. In the one-dimensional case the initial costate is found by successively solving two first-order, quasi-linear, partial differential equations, whose independent variables are the time-horizon duration T and the final penalty coefficient S. These PDEs should in general be integrated off-line, the solution rendering not only the missing initial condition sought in the particular (T,S)-situation, but additional information on the boundary values of the whole two-parameter family of control problems, which can be used for designing the definitive objective functional. Optimal trajectories for the model are then generated in real time and used as references to be followed by the physical system. Numerical improvements are suggested for accurate integration of naturally unstable Hamiltonian dynamics, and strategies are proposed for tracking their results, in finite time or asymptotically, when perturbations in the state of the system appear. The whole procedure is tested in models arising in aero-navigation optimization.
Interactive Learning Environment for Drawing Skill Based on Perspective
Authors: Yoshitake Shojiguchi, Masato Soga, Noriyuki Matsuda, Hirokazu Taki
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

We developed an interactive learning environment for drawing skill based on perspective. The environment supports function for learners to diagnose error of drawn lines based on perspective by themselves. The environment does not fix motif for drawing, although motif is limited to 3D figure that consists of flat surfaces.
Three Senses of "Argument"
Authors: Adam Z. Wyner, Trevor J. Bench-Capon, Katie Atkinson
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

In AI approaches to argumentation, different senses of argument are often conflated. We propose a three-level distinction between arguments, cases, and debates. This allows us to modularise issues into separate levels and identify systematic relations between levels. Arguments, comprised of rules, facts, and a claim, are the basic units; they instantiate argument schemes; they have no sub-arguments. Cases are sets of arguments supporting a claim. Debates are sets of arguments in an attack relation; they include cases for and against a particular claim. Critical questions, which are characteristic of the particular argument schemes, are used to determine the attack relation between arguments. In a debate, rankings on arguments or argument relations are given as components based on features of argument schemes. Our analysis clarifies the role and contribution of distinct approaches in the construction of rational debate. It identifies the source of properties used for evaluating the status of arguments in Argumentation Frameworks.
Topic 1 Support Tools and Environments
Authors: Liviu Iftode, Christine Morin, Marios Dikaiakos, Erich Focht
Venue: Proceedings of the 13th European international conference on Parallel Processing (2007)

Despite an impressive body of research,parallel and distributed computing remains a complex task prone to subtle software bugs, which can affect both the correctness and the performance of the computation. The increasing demand to distribute computing over large-scale distributed platforms, such as grids and large clusters, overlaps with an increasing pressure to make computing more dependable. To address these challenges, the parallel and distributed computing community continuously requires better tools and environments to design, program, debug, test, tune, and monitor programs. This topic aims to bring together tool designers, developers, and users to share their concerns, ideas, solutions, and products, covering a wide range of platforms.
An Algorithm for Transforming Regular Chain into Normal Chain
Authors: Banghe Li, Dingkang Wang
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

We present an improved algorithm to compute the normal chain from a given regular chain such that their saturation ideals are the same. Our algorithm is based on solving a system of linear equations and the original method computes the resultants of multivariate polynomials. From the experiments, for the random polynomials, our algorithm is much more efficient than the original one.
Graph Laplacian based transfer learning in reinforcement learning
Authors: Yi-Ting Tsao, Ke-Ting Xiao, Von-Wun Soo
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

The aim of transfer learning is to accelerate learning in related domains. In reinforcement learning, many different features such as a value function and a policy can be transferred from a source domain to a related target domain. Many researches focused on transfer using hand-coded translation functions that are designed by the experts a priori. However, it is not only very costly but also problem dependent. We propose to apply the Graph Laplacian that is based on the spectral graph theory to decompose the value functions of both a source domain and a target domain into a sum of the basis functions respectively. The transfer learning can be carried out by transferring weights on the basis functions of a source domain to a target domain. We investigate two types of domain transfer, scaling and topological. The results demonstrated that the transferred policy is a better prior policy to reduce the learning time.
Noise allocation for industrial plant acoustic design
Authors: Giuseppe Squadrone
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

Due to industrial plant customer's awareness and legislator's attention about aspects connected with environmental noise, engineering companies developing new settlements are often required to accurately design sound reduction measures from the time when the project development begins, or even before, during its proposal. The outdated method to deal with industrial plant noise control during the equipment procurement or, worst, during construction, by means of retrofitting, is going to be left as it leads to poor acoustic performance and high costs. Besides, especially for plant engineering purposes from the authorization point of view, the environmental noise limitations to be respected is also set in terms of maximum allowed sound power level. This vision represents the state of art approach to industrial plants design; it requires the plant constructor to supply low noise equipment and noise reduction systems at source in order to comply with the goal. Presently noise predictions using sound pressure levels are more prevalent in industry than those provided by means of the more flexible to use sound power levels, due to lack of manufacturers data and because plant customers and equipment suppliers usually deal with pressure levels, easier to measure.
Fourth-order compact finite difference method for fourth-order nonlinear elliptic boundary value problems
Authors: Yuan-Ming Wang, Ben-Yu Guo
Venue: Journal of Computational and Applied Mathematics (2008)

A compact finite difference method with non-isotropic mesh is proposed for a two-dimensional fourth-order nonlinear elliptic boundary value problem. The existence and uniqueness of its solutions are investigated by the method of upper and lower solutions, without any requirement of the monotonicity of the nonlinear term. Three monotone and convergent iterations are provided for resolving the resulting discrete systems efficiently. The convergence and the fourth-order accuracy of the proposed method are proved. Numerical results demonstrate the high efficiency and advantages of this new approach.
Relative Pose Estimation of Surgical Tools in Assisted Minimally Invasive Surgery
Authors: Agustin Navarro, Edgar Villarraga, Joan Aranda
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Minimally Invasive Surgery (MIS) is one of these applications where usually only 2D information is available to perform a 3D task. It requires a high degree of sensory-motor skills to overcome the disengagement between action and perception caused by the physical separation of the surgeon with the operative site. The integration of body movements with visual information serves to assist the surgeon providing a sense of position. Our purpose in this paper is to present a solution to the exterior orientation problem based on computer vision, as a tool in assisted interventions, locating the instruments with respect to the surgeon. Having knowledge of the 3D transformations applied to the instrument and its projections in the image plane, we show it is possible to estimate its orientation with only two different rotations and also its relative position if scale information is supplied. Experimental results show some advantages of this new algorithm such as simplicity and real-time performance.
Contract-Based Design for Computation and Verification of a Closed-Loop Hybrid System
Authors: L. Benvenuti, A. Ferrari, E. Mazzi, A. L. Vincentelli
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

Contract-based design is an approach where the design process is seen as a successive assembly of components where a component is represented in terms of assumptions about its environment and guarantees about its behavior. In the composition, if assumptions of each component are contained in guarantees offered by the others, then the composition is well formed. In this paper, we focus on contract-based design and the use of Heterogeneous Rich Component models for embedded controllers where the plant, sensors and actuators are described by hybrid systems. We assume that the components are assembled in a feedback configuration. The problem is to show that this composition satisfies requirements using the assumptions-guarantees of the plant, sensors, actuators and controller. To do so, we give rules on how to compose assumptions and promises for components in cascade and feedback configurations. We then apply these rules to expose the actual calculation involved on a test case, a water-level control problem. We also show how to check that the requirements on the closed-loop configuration are satisfied, i.e, that they are contained in the promises of this configuration using a formal verification tool (Ariadne) for hybrid systems.
Inventing Requirements: Experiences with an Airport Operations System
Authors: Neil Maiden, Cornelius Ncube, James Lockerbie
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

This paper reports a workshop that integrated creativity techniques with extended use case diagrams and storyboard representations of use cases to discover stakeholder requirements for VANTAGE, a new system designed to reduce environmental impact at airports. The workshop revised the boundaries of the system and generated 200 new requirements-based ideas and storyboards for VANTAGE. The paper describes the workshop structure, gives examples of outputs from it, and uses these outputs to answer 3 research questions about the usefulness of ideas generated and creativity techniques employed.
Effective message synchronization methods for multiplayer online games with maps
Authors: Doowon Paik, Chung-Ha Yun, Jooyeon Hwang
Venue: Computers in Human Behavior (2008)

A solution for the message synchronization problem of the client-server based game system is to wait for a certain period of time (waiting period) until the server processes the messages from clients. However, identifying a suitable waiting period proves challenging. In this paper, we develop two methods to determine the waiting period using the probability of interaction among participants and ranking of the delay among participants. Our methods take advantage of the property of games with geographical mapping, where each participant usually interacts with other participants only in the immediate surroundings. Simulation is performed for the evaluation of the methods and the shows that the proposed methods produce better results with lower average unfair ratio while keeping the same responsiveness compared to the method with prefixed waiting period.
Automatic construction of coordinated performance skeletons
Authors: Jaspal Subhlok
Venue:  (2007)

The performance skeleton of a parallel application is a short running program, whose performance in any scenario reflects the performance of the application it represents. Specifically, the execution time of the performance skeleton is a small fixed fraction of the execution time of the corresponding application in any execution environment. This work presents a framework for automatic construction of performance skeletons. The approach is based on capturing the execution behavior of a parallel application from traces and automatically generating a synthetic skeleton program that reflects that execution behavior. This research introduces coordinated performance skeletons that consist of a single SPMD program that executes on each node of the system. Coordinated skeleton construction proceeds as follows. First, we convert the physical traces into a single representative logical trace by identifying the underlying communication topology employed by the application and converting the point-to-point communication between processes into logical communication that represents similar communication across all processes executing the application. Then, we compress the single logical trace into a compact coordinated execution signature by capturing the repeating patterns and discovering the underlying loop structure inside the logical trace. The compression employs a novel greedy version of Crochemore's algorithm, which is well known for identifying repeats in a string. Finally, we use this compact coordinated execution signature as the basis for building a synthetic executable parallel skeleton program. Experiments have been carried out to construct coordinated performance skeletons for class C NAS benchmarks. The results show that we can accurately and efficiently identify the communication topology and logicalize the execution traces. The longest physical trace of 23.5 million lines was logicalized in 134 seconds. Greedy compression of the logical traces, averaging 71695 events, took 16.5 seconds for a compression ratio of 1815, on average. The prediction accuracy of synthetic coordinated performance skeletons was tested: (1) on a cluster with different CPU and network sharing, and (2) across clusters with different hardware architectures. The results demonstrate that a coordinated performance skeleton can predict the application execution time fairly accurately. The measured average prediction error was 4% within a cluster and 10% across different clusters.
Issues and effort in integrating data from heterogeneous software repositories and corporate databases
Authors: Rudolf Ramler, Klaus Wolfmaier
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Software repositories and corporate databases capture different fragments of a project's history. Software cockpits integrate the data from these repositories and databases to provide a holistic view of the project and the capability to drill-down and analyze details. By incorporating existing data, the cockpit can be used effectively from the first day it is introduced. In this paper we describe our findings from integrating several repositories and databases for a large, distributed project. We highlight common issues in data integration, report on the resulting effort for the development of software cockpits, and share our lessons learned from this data integration project.
Service Specification and Matchmaking Using Description Logic
Authors: M. Birna Riemsdijk, Rolf Hennicker, Martin Wirsing, Andreas Schroeder
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

We propose a formal specification framework for functional aspects of services. We define services as operations which are specified by means of pre- and postconditions, for the specification of which we use extensions of description logic. The (extensions of) description logic and the specification framework itself are defined as institutions. This gives the framework a uniformity of definition and a solid algebraic and logical foundation. The framework can be used for the specification of service requests and service providers. Given a signature morphism from request to provider, we define when a service request is matched by a service provider, which can be used in service discovery. We provide a model-theoretic definition of matching and show that matching can be characterized by a semantic entailment relation which is formulated over a particular standard description logic. Thus proofs of matching can be reduced to standard reasoning in description logic for which one can use description logic reasoners.
A Matchmaking Architecture to Support Innovation by Fostering Supply and Demand of Venture Capital
Authors: Mario Benassi, Tommaso Noia, Alessandro Marino
Venue: Proceedings of the 9th international conference on E-Commerce and Web Technologies (2008)

This paper proposes a web-based matchmaking engine aimed to overcome weaknesses of online directories --- which typically includes only a list of supply features --- by generating valuable information for users. Although applicable in several domains, the matchmaking engine has been developed for the venture capital industry where entrepreneurs seeking financing search for investors who, in turn, scout entrepreneurs on the basis of specific investment criteria. The match-making engine ultimate goal is to allow users to save time and money in their reciprocal search activity by generating analytic information on project compatibility measures.
Deterministic monotone algorithms for scheduling on related machines
Authors: Pasquale Ambrosio, Vincenzo Auletta
Venue: Theoretical Computer Science (2008)

We consider the problem of designing monotone deterministic algorithms for scheduling tasks on related machines in order to minimize the makespan. Several recent papers showed that monotonicity is a fundamental property to design truthful mechanisms for this scheduling problem. We give both theoretical and experimental results. First of all we consider the case of two machines when speeds of the machines are restricted to be powers of a given constant c>0. We prove that algorithm Largest Processing Time (LPT) is monotone for any c>=2 while it is not monotone for c@?1.78; algorithm List Scheduling (LS), instead, is monotone only for c>2. In the case of m>2 machines we restrict our attention to the class of ''greedy-like'' monotone algorithms defined in [Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Deterministic truthful approximation mechanisms for scheduling related machines, in: Proceedings of 21st Annual Symposium on Theoretical Aspects of Computer Science. STACS '04, in: Lecture Notes in Computer Science, vol. 2996, Springer, 2004, pp. 608-619]. It has been shown that greedy-like monotone algorithms can be used to design a family of 2+@e-approximate truthful mechanisms. In particular, in [Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Deterministic truthful approximation mechanisms for scheduling related machines, in: Proceedings of 21st Annual Symposium on Theoretical Aspects of Computer Science. STACS '04, in: Lecture Notes in Computer Science, vol. 2996, Springer, 2004, pp. 608-619], the greedy-like algorithm Uniform is proposed and it is proved that it is monotone when machine speeds are powers of a given integer constant c>0. In this paper we propose a new algorithm, called Uniform_RR, that is still monotone when speeds are powers of a given integer constant c>0 and we prove that its approximation factor is not worse than that of Uniform. We also experimentally compare the performance of Uniform, Uniform_RR, LPT, and several other monotone and greedy-like heuristics.
An Evolutionary General Purpose WebGIS to Disclose EGFR Mutations in Lung Cancer
Authors: Domenico Aliotta, Pietro Buffa, Gennaro Iaccarino
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

The epidermal growth factor receptor (EGFR) is a membrane spanning receptor tyrosine kinase that regulates cell proliferation, survival, and migration. Over expression and mutations in the kinase domain of EGFR are implicated in the development and progression of a variety of cancers. We present an evolutionary general purpose Geographic Information System, in which geographic information is replaced by biological data representing the main mutation regions within the kinase domain of EGFR. Our system can be used for generating hypotheses about relations between EGFR mutations and cancer; defining statistical, molecular, and pharmacological relationships; disclosing biological identification techniques, etc. Moreover this is an important example of how GIS capabilities can be used not only for geographic items, but for any kind of data, as a general purpose system.
Visual Data Mining: An Introduction and Overview
Authors: Simeon J. Simoff, Michael H. Böhlen, Arturas Mazeika
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

In our everyday life we interact with various information media, which present us with facts and opinions, supported with some evidence, based, usually, on condensed information extracted from data. It is common to communicate such condensed information in a visual form --- a static or animated, preferably interactive, visualisation. For example, when we watch familiar weather programs on the TV, landscapes with cloud, rain and sun icons and numbers next to them quickly allow us to build a picture about the predicted weather pattern in a region. Playing sequences of such visualisations will easily communicate the dynamics of the weather pattern, based on the large amount of data collected by many thousands of climate sensors and monitors scattered across the globe and on weather satellites. These pictures are fine when one watches the weather on Friday to plan what to do on Sunday --- after all if the patterns are wrong there are always alternative ways of enjoying a holiday. Professional decision making would be a rather different scenario. It will require weather forecasts at a high level of granularity and precision, and in real-time. Such requirements translate into requirements for high volume data collection, processing, mining, modelling and communicating the models quickly to the decision makers. Further, the requirements translate into high-performance computing with integrated efficient interactive visualisation. From practical point of view, if a weather pattern can not be depicted fast enough, then it has no value. Recognising the power of the human visual perception system and pattern recognition skills adds another twist to the requirements --- data manipulations need to be completed at least an order of magnitude faster than real-time in order to combine them with a variety of highly interactive visualisations, allowing easy remapping of data attributes to the features of the visual metaphor, used to present the data. In this few steps in the weather domain, we have specified some requirements towards a visual data mining system.