ppxscal/embedding_network huggingface dataset:
On-Line and Real Time Logistics Management System for Enhancing Customer Services
Authors: Hyun-Chang Lee, Hyun-Cheul Shin
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper describes a Real-time Tracking System of On-line Logistics [RTSOL] using an information technology [IT] as well as a supply chain and e-commerce. Currently, the Internet Service Provider [ISP] provides the clients with localization of items within station level information [node]. However, the customers do not only require localization of their items as accurate as possible, but also the status of their logistic items such as how long it takes a time to reach them irrespective of the node places. In this paper, we propose a real time tracking of the logistics using the novel three-tier architecture using information gathered from the Logistics activities and verify that the system performs their function such as an online status monitoring as well as a real-time localization of their items.
Design Rationale in System Design
Authors: J. Verries, A. E. K. Sahraoui, M. Paludetto
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This paper describes a generic method to assist architectural design of heterogeneous systems. Improvement lie on better design rationalization and lesson learn acquisition. We use the Model Driven approach to define architectural models of the system. The approach is based on the translation of requirements in quantitative and measurable technical indicators that could be integrated to the design models. It relies on the EIA632 processes, IEEE1471 definitions and suggests the use of UML/SysML notations.
Simple Incremental One-Class Support Vector Classification
Authors: Kai Labusch, Fabian Timm, Thomas Martinetz
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice for practitioners. We prove that in the hard-margin case the algorithm converges with $\mathcal{O} (1/\sqrt{t})$ to the maximum margin solution of the support vector approach for one-class classification introduced by Schölkopf et al. Furthermore, we propose a 2-norm soft margin generalisation of the algorithm and apply the algorithm to artificial datasets and to the real world problem of face detection in images. We obtain the same performance as sophisticated SVM software such as libSVM.
A Solution to the Rural Postman Problem Based on Artificial Ant Colonies
Authors: María Luisa Pérez-Delgado
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

The objective of this work is to apply artificial ant colonies to solve the Rural Postman Problem on undirected graphs. In order to do so, we will transform this problem into a Traveling Salesman Problem, applying to this new problem algorithms based on artificial ant colonies, which have been applied at great length to the same, obtaining good results.
Compositions of extended top-down tree transducers
Authors: Andreas Maletti
Venue: Information and Computation (2008)

Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular look-ahead can be implemented by a linear multi bottom-up tree transducer. The class of transformations computed by the latter device is shown to be closed under composition, and to be included in the composition of the class of transformations computed by top-down tree transducers with itself. More precisely, it constitutes the composition closure of the class of transformations computed by finite-copying top-down tree transducers.
RoadCompass: following rural roads with vision + ladar using vanishing point tracking
Authors: Christopher Rasmussen
Venue: Autonomous Robots (2008)

We present a vision- and ladar-based approach to autonomous driving on rural and desert roads that has been tested extensively in a closed-loop system. The vision component uses Gabor wavelet filters for texture analysis to find ruts and tracks from which the road vanishing point can be inferred via Hough-style voting, yielding a direction estimate for steering control. The ladar component projects detected obstacles along the road direction onto the plane of the front of the vehicle and tracks the 1-D obstacle "gap" presumed due to the road to yield a lateral offset estimate. Several image- and state-based tests to detect failure conditions such as off-road poses (i.e., there is no road to follow) and poor lighting due to sun glare or distracting shadows are also explained. The system's efficacy is demonstrated with analysis of diverse logged data including from the 2005 DARPA Grand Challenge, as well as tests with full control of a vehicle over 15 km of difficult roads at up to 37 km/h with no waypoints.
Barrier and seed layer coverage in 3D structures with different aspect ratios using sputtering and ALD processes
Authors: O. Lühn, C. Van Hoof, W. Ruythooren, J. -P. Celis
Venue: Microelectronic Engineering (2008)

Established technologies for the deposition of barrier layers and seed layers for 3D interconnect technology were investigated for their limits of obtaining a continuous and conductive layer in 3D structures. Sputtering, and sputtering coupled with a self-ionized plasma as well as atomic layer deposition, in combination with direct-on-barrier electroplating were used. The diameter of the investigated vias and trenches was scaled from 100 to 5@mm with depths down to 360@mm, covering a large range of aspect ratio up to 29. The deposition technologies were investigated and evaluated by analyzing cross-sections of coated vias with optical microscopy, scanning electron microscopy, and focused ion beam. An aspect ratio technology map is presented that shows the limits of the investigated coating technologies to achieve a continuous conductive surface layer on the wall and bottom of vias and trenches of various aspect ratios. Vias and trenches were successfully coated with a continuous barrier and a copper seed offering electrical continuity for aspect ratios up to 29.
Integrating Domain Knowledge in Equation Discovery
Authors: Ljupčo Todorovski, Sašo Džeroski
Venue: Computational Discovery of Scientific Knowledge: Introduction, Techniques, and Applications in Environmental and Life Sciences (2007)

In this chapter, we focus on the equation discovery task, i.e., the task of inducing models based on algebraic and ordinary differential equations from measured and observed data. We propose a methodology for integrating domain knowledge in the process of equation discovery. The proposed methodology transforms the available domain knowledge to a grammar specifying the space of candidate equation-based models. We show here how various aspects of knowledge about modeling dynamic systems in a particular domain of interest can be transformed to grammars. Thereafter, the equation discovery method Lagramge can search through the space of models specified by the grammar and find ones that fit measured data well. We illustrate the utility of the proposed methodology on three modeling tasks from the domain of Environmental sciences. All three tasks involve establishing models of real-world systems from noisy measurement data.
Fast Multipole and Multifunction PEEC Methods
Authors: Giulio Antonini, Albert E. Ruehli
Venue: IEEE Transactions on Mobile Computing (2003)

A key use of the Partial Element Equivalent Circuit (PEEC) method is the solution of combined electromagnetic and circuit problems as they occur in many situations such as today's integrated circuit (VLSI) systems and as components in mobile devices. The method, which has been applied to a multitude of electrical interconnect and package problems, is very flexible since it is easy to add new features to the approach. However, faster solutions are of interest since the problems to be solved are continuously increasing in size. A class of fast methods are evolving based on the faster evaluation of the matrix elements and the use of iterative or other matrix solvers of the resultant system for the frequency domain. Fast circuit matrix solvers are easier to obtain in the time domain than the frequency domain since the delay or retardation can be utilized to sparsify the circuit matrix. In this paper, we concentrate on techniques for the fast evaluation of the PEEC circuit elements for both the frequency and time domain where possible since they both are important for the solution of specific problems.
High Performance Implementation of an FPGA-Based Sequential DT-CNN
Authors: J. Javier Martínez-Alvarez, F. Javier Garrigós-Guerrero, F. Javier Toledo-Moreo, J. Manuel Ferrández-Vicente
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

In this paper an FPGA-based implementation of a sequential discrete time cellular neural network (DT-CNN) with 3×3 templates is described. The architecture is based on a single pipelined cell which is employed to emulate a CNN with larger number of neurons. This solution diminishes the use of hardware resources on the FPGA and allows the cell to process real time input data in a sequential mode. Highly efficient FPGA implementation has been achieved by manual design based on low level instantiation and placement of hardware primitives. The Intellectual Property Core offers an appropriate tradeoff between area and speed. Our architecture has been developed to assist designers implementing discrete CNN models with performance equivalent to hundreds or millions of neurons on low cost FPGA-based systems.
Middleware Architecture for Federated Control Systems
Authors: Girish Baliga, P. R. Kumar
Venue: IEEE Distributed Systems Online (2003)

A federated control system (FCS) is composed of autonomous entities, such as cars, thatcooperate to provide a global behavior, such as traffic control. A middleware is a convenient mechanismto separate software infrastructure, as a layer, from other FCS components. Element abstraction is a model for designing, implementing, and operating software components on this infrastructure layer.
Development of Software for Multiple Criteria Evaluation
Authors: Edmundas Kazimieras Zavadskas Leonas Ustinovichius, Friedel Peldschus
Venue: Informatica (2003)

This paper considers the main positions of one-sided and two-sided problems. For one-sided problems only the method of solution &ldquo;the distance to the ideal point&rdquo; is discussed in the actual version. For two-sided problems a distinction is made between games with rational behaviour and games against nature. The main strategic principles are as follows: simple min-max principle, extended min-max principle, Wald's rule, Savage criterion, Hurwicz's rule, Laplace's rule, Bayes's rule, Hodges-Lehmann rule. Questions of transforming the decision-making matrix are considered. The article gives the description of a software as well as an example of an investment variant estimation.
Design of an Electronic Alcohol Nose Based on MSP430
Authors: Wenhua Gao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The paper introduced the electric alcohol nose system which consists of alcohol sensor, MSP430 MCU and peripheral units. The electric alcohol nose system can recognize and check the concentration of alcohol in the gas breathed by a drunk driver or a driver who drink alcohol. The system is described from two aspects of hardware and software. The hardware system is a typical application system consisted of MSP430 MCU, which used many inner resources of MCU and interfacing technology and with low power consumption. The system can be communicated with PC by serial communicate interface. MCU software was programmed in C language.
Exploring Features and Classifiers for Dialogue Act Segmentation
Authors: Harm Akker, Christian Schulz
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

This paper takes a classical machine learning approach to the task of Dialogue Act segmentation. A thorough empirical evaluation of features, both used in other studies as well as new ones, is performed. An explorative study to the effectiveness of different classification methods is done by looking at 29 different classifiers implemented in WEKA. The output of the developed classifier is examined closely and points of possible improvement are given.
Adaptive and Evolvable Hardware and Systems: The State of the Art and the Prospectus for Future Development
Authors: Mircea Gh. Negoita, Lukas Sekanina, Adrian Stoica
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

This paper is an overview on the Evolvable Hardware (EHW) --- th exciting and rapidly expanding industrial application area of the Evolutionary Computing (EC), of the Genetic Algorithms especially. The content of the work has the following structure: the first part includes generalities on industrial applications of EC and the importance of EHW in this frame; the second part presents the outstanding technological support making possible the implementation of system adaptation in hardware. Different kind of programmable circuits arrays are introduced. The third part tackles the most known EC based methods for EHW implementation; the fourth part deals with some concrete elements of the EHW design, including the current limits in evolutionary design of digital circuits. The last part is focused on some concluding remarks with regard to future perspectives of the area. A list of references used in this work was inserted at the end.
A General Framework to Deal with the Scaling Problem in Phrase-Based Statistical Machine Translation
Authors: Daniel Ortiz, Ismael García Varea, Francisco Casacuberta
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

In this paper, we address the topic of how to estimate phrase-based models from very large corpora and apply them in statistical machine translation. The great number of sentence pairs contained in recent corpora like the well-known Europarl corpus have enormously increased the memory requirements to train phrase-based models and to apply them within a decoding process. We propose a general framework that deals with this problem without introducing significant time overhead by means of the combination of different scaling techniques. This new framework is based on the use of counts instead of probabilities, and on the concept of cache memory.
Computer Graphics Brazil: Scalable GPU rendering of CSG models
Authors: Fabiano Romeiro, Luiz Velho, Luiz Henrique de Figueiredo
Venue: Computers and Graphics (2008)

Existing methods that are able to interactively render complex CSG objects with the aid of GPUs are both image based and severely bandwidth limited. In this paper we present a new approach to this problem whose main advantage is its capability to efficiently scale the dependency on CPU instruction throughput, memory bandwidth and GPU instruction throughput. Here, we render CSG objects composed of convex primitives by combining spatial subdivision of the CSG object and GPU ray-tracing methods: the object is subdivided until it is locally ''simple enough'' to be rendered effectively on the GPU. Our results indicate that our method is able to share the load between the CPU and the GPU more evenly than previous methods, in a way that depends less on memory bandwidth and more on GPU instruction throughput for up to moderately sized CSG models. Even though the same results indicate that the present method is eventually becoming more bus bandwidth and CPU limited with the current state of the art GPUs, especially for extremely complex models, our method presents a solid recipe for escaping this problem in the future by a rescale of the dependency on CPU/memory bandwidth vs. GPU instruction throughput. With this, greater increases in performance are to be expected by adapting our method for newer generation of graphics hardware, as instruction throughput has historically increased at a greater pace than both bus bandwidth and internal GPU bandwidth.
A New Memory Allocation Model for Parallel Search Space Data Structures with OpenMP
Authors: Christophe Jaillet, Michaël Krajecki
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

OpenMP is a shared memory programming API (see [2] or http://www.openmp.org ), brought on UMA and CC-NUMA architectures, which supports multithreaded applications.The present study deals with the management and arrangement of memory, which may cause useless memory blocks reloading from the shared memory to the processors caches. This occurs for some memory access sensible applications, when programming with OpenMP: cache faults may congest the system and induce a communication over-cost between the processors. A new memory allocation model is presented, enabling us to solve the memory contention phenomenon in the specific case of shared memory programming with OpenMP.
Region and Graph-Based Motion Segmentation
Authors: Fernando C. Monteiro, Aurélio Campilho
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper describes an approach for integrating motion estimation and region clustering techniques with the purpose of obtaining precise multiple motion segmentation. Motivated by the good results obtained in static segmentation we propose a hybrid approach where motion segmentation is achieved within a region-based clustering approach taken the initial result of a spatial pre-segmentation and extended to include motion information. Motion vectors are first estimated with a multiscale variational method applied directly over the input images and then refined by incorporating segmentation results into a region-based warping scheme. The complete algorithm facilitates obtaining spatially continuous segmentation maps which are closely related to actual object boundaries. A comparative study is made with some of the best known motion segmentation algorithms.
3D Modeling for Deformable Objects
Authors: Yi Song, Li Bai
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper presents an efficient BSpline surface reconstruction technique for modelling deformable objects. The differences of our methods from previous BSpline fitting approaches are: 1) the reconstructed BSpline patch does not need to be square shaped. This significantly reduces the required number of BSpline patches for reconstruction; 2) the dataset to be reconstructed does not have to be grid data. This is important, especially for 3D scan data, which is unstructured dense point cloud, normally with holes. A compact 3D shape description can be obtained using our approach. This shape representation allows 3D metamorphosis, direct manipulation of free-form deformation, and level of detail control (real time multi-resolution rendering). The demonstrated results are reconstructed directly from the dense point clouds collected from our 3D scanner (based on stereo photogrammetry technique) and example datasets provided by Cyberware.
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
Authors: Michael Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

We propose new filtering algorithms for the Sequence constraint and some extensions of the Sequence constraint based on network flows. We enforce domain consistency on the Sequence constraint in O(n 2) time down a branch of the search tree. This improves upon the best existing domain consistency algorithm by a factor of O(logn). The flows used in these algorithms are derived from a linear program. Some of them differ from the flows used to propagate global constraints like Gcc since the domains of the variables are encoded as costs on the edges rather than capacities. Such flows are efficient for maintaining bounds consistency over large domains and may be useful for other global constraints.
Analysis of BMAP/G/1 Vacation Model of Non-M/G/1-Type
Authors: Zsolt Saffer, Miklós Telek
Venue: Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering (2008)

In this paper we present the analysis of BMAP/G/1 vacation models of non-M/G/1-type in a general framework. We provide new service discipline independent formulas for the vector generating function (GF) of the stationary number of customers and for its mean, both in terms of quantities at the start of vacation.We present new results for vacation models with gated and G-limited disciplines. For both models discipline specific systems of equations are setup. Their numerical solution are used to compute the required quantities at the start of vacation.
Using the CAT for 3D Sketching in Front of Large Displays
Authors: Hongxin Zhang, Julien Hadim, Xavier Granier
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

Sketching, as an intuitive tool for creation and edition of 3D prototypes, is a topic of increasing interest to the community. These approaches are based on the natural ability of humans to quickly draw in 2D some characteristic curves of 3D objects. Unfortunately, some 3D modeling operations - like positioning different components - and the modeling in front of large displays have still not reached the same level of intuitively in sketching systems. The main difficulty is to leverage the intuitive 2D gesture abilities of humans and lift them to XGCT sensical 3D operations. In this project, we present a new approach, based on a virtual 3D paper sheet metaphor and the use of a 6 degrees of freedom (DOF) device. With the associated interaction processes and visual feedbacks, it allows the user to quickly create and edit some sketched 3D models.