Search results for "General Computer Science"

Robotic assistance for industrial sanding with a smooth approach to the surface and boundary constraints

2021

[EN] Surface treatment operations, such as sanding, deburring, finishing, grinding, polishing, etc. are progressively becoming more automated using robotic systems. However, previous research in this field used a completely automatic operation of the robot system or considered a low degree of human-robot interaction. Therefore, to overcome this issue, this work develops a truly synergistic cooperation between the human operator and the robot system to get the best from both. In particular, in the application developed in this work the human operator provides flexibility, guiding the tool of the robot system to treat arbitrary regions of the workpiece surface; while the robot system provides…

Strictness vs. flexibility: Simulation-based recognition of strategies and its success in soccer

2021

Abstract Introduction: Recognition and optimization of strategies in sport games is difficult in particular in case of team games, where a number of players are acting “independently” of each other. One way to improve the situation is to cluster the teams into a small number of tactical groups and to analyze the interaction of those groups. The aim of the study is the evaluation of the applicability of SOCCER© simulation in professional soccer by analyzing and simulation of the tactical group interaction. Methods: The players’ positions of tactical groups in soccer can be mapped to formation-patterns and then reflect strategic behaviour and interaction. Based on this information, Monte Carl…

Principles of scatter search

2006

Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first proposed in the 1970s, based on formulations dating back to the 1960s for combining decision rules and problem constraints. In contrast to other evolutionary methods like genetic algorithms, scatter search is founded on the premise that systematic designs and methods for creating new solutions afford significant benefits beyond those derived from recourse to randomization. It uses strategies for search diversification and intensification that have proved effective in a variety of optimization problems. This paper provides…

Semiparametric stochastic frontier models: A generalized additive model approach

2017

Abstract The choice of the functional form of the frontier into a stochastic frontier model is typically neglected in applications and canonical functions are usually considered. This paper introduces a semiparametric approach for stochastic frontier estimation that extends previous works based on pseudo-likelihood estimators allowing flexibility in model selection and capability of imposing monotonicity and concavity constraints. For these purposes the present work introduces a generalized additive framework that moreover permits to model the influence of contextual/environmental factors to the hypothesized production process by the relative extension given by generalized additive models f…

Virtual reality for driving simulation

1996

In this paper, the authors describe the data structure necessary to provide real time simulation and visualization of complex environments and situations. Through the SIRCA project, the development of driving oriented simulators, using Virtual Reality (VR) and evaluating it in comparison with convention technologies, has taken place. Focus is on some of the algorithms and data structure required to provide real time simulation of the complex urban environment and its visualization under the conditions of VR devices.

A syntax controlled generator of formal language processors

1963

The Intersection of $3$-Maximal Submonids

2020

Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$-maximal monoids.

Design of a Programmable and Modular Neuromuscular Electrical Stimulator Integrated Into a Wireless Body Sensor Network

2021

Neuromuscular electrical stimulation finds application in several fields, from basic neurophysiology, to motor rehabilitation and cardiovascular conditioning. Despite the progressively increasing interest in this technique, its State-of-the-Art technology is mainly based on monolithic, mostly wired devices, leading to two main issues. First, these devices are often bulky, limiting their usability in applied contexts. Second, the possibility of interfacing these stimulation devices with external systems for the acquisition of electrophysiological and biomechanical variables to control the stimulation output is often limited. The aim of this work is to describe the design and development of a…

MLOG: a strongly typed confluent functional language with logical variables

1994

Poirriez, V., MLOG: a strongly typed confluent functional language with logical variables, Theoretical Computer Science 122 (1994) 201-223. A new programming language called MLOG is introduced. MLOG is a conservative extension of ML with logical variables. To validate our concepts, a compiler named CAML Light FLU0 was implemented. Numerous examples are presented to illustrate the possibilities of MLOG. The pattern matching of ML is kept for X-calculus bindings and an unification primitive is introduced for the logical variables bindings. A suspension mechanism allows cohabitation of pattern-matching and logical variables, Although the evaluation strategy for the application is fixed, the or…

Scalable Clustering by Iterative Partitioning and Point Attractor Representation

2016

Clustering very large datasets while preserving cluster quality remains a challenging data-mining task to date. In this paper, we propose an effective scalable clustering algorithm for large datasets that builds upon the concept of synchronization. Inherited from the powerful concept of synchronization, the proposed algorithm, CIPA (Clustering by Iterative Partitioning and Point Attractor Representations), is capable of handling very large datasets by iteratively partitioning them into thousands of subsets and clustering each subset separately. Using dynamic clustering by synchronization, each subset is then represented by a set of point attractors and outliers. Finally, CIPA identifies the…