ppxscal/embedding_network huggingface dataset:
GrasSmart: An Intelligent Robotic System for Continuous Area Coverage
Authors: Miri Weiss-Cohen, Igal Sirotin, Erez Rave
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This work implements and simulates the problem known as, coverage of a continuous planar area by a mobile robot. The robot is given a bitmap of a known geometric area as an input, and derives an optimal path of coverage by implementing and improving the On-line Full Scan Spanning Tree Covering (STC) algorithm[1]. The path is calculated for the continuous area coverage by defining a DFS (Depth First Search) spanning tree. We improved the STCalgorithm by optimizing U-Turns of the path, and optimizing the shifting of the path directions, moreover, we suggest using different sensor information, which reduces errors. The results of our work are presented by a 3D simulation program which mimics the grass robots' path and statistical calculations for testing optimality.
Enumerations and Torsion Free Abelian Groups
Authors: Alexander G. Melnikov
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We study possible spectrums of torsion free Abelian groups. We code families of finite sets into group and set up the correspondence between their algorithmic complexities. 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
Some Mathematics behind Graph Property Testing
Authors: László Lovász
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

Graph property testing is the third reincarnation of the same general question, after statistics and learning theory. In its simplest form, we have a huge graph (we don't even know its size), and we draw a sample of the node set of bounded size. What properties of the graph can be deduced from this sample?The graph property testing model was first introduced by Goldreich, Goldwasser and Ron (but related questions were considered before). In the context of dense graphs, a very general result is due to Alon and Shapira, who proved that every hereditary graph property is testable.Using the theory of graph limits, Lovász and Szegedy defined an analytic version of the (dense) graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the function values as edge probabilities. This analytic version allows for simpler formulation of the problems, and leads to various characterizations of testable properties. These results can be applied to the original graph-theoretic property testing. In particular, they lead to a new combinatorial characterization of testable graph properties.We survey these results, along with analogous results for graphs with bounded degree.
Cubage-Weight Balance Algorithm for the Scattered Goods Loading with Two Aims
Authors: Liu Xiao-Qun, Ma Shi-Hua, Li Qi
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

To utilize the volume and carrying capacity to solve the low efficiency of truck loading, a loading planning was made by using optimization methods based on combinatorics. The mathematic model of goods loading was set up and a polynomial approximation algorithm was proposed according to the characteristics of the goods transportation. With the volume and load of the truck taken into consideration, this algorithm can converge at a satisfactory solution and has a good effect in application.
Quantum Entanglement Analysis Based on Abstract Interpretation
Authors: Simon Perdrix
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

Entanglement is a non local property of quantum states which has no classical counterpart and plays a decisive role in quantum information theory. Several protocols, like the teleportation, are based on quantum entangled states. Moreover, any quantum algorithm which does not create entanglement can be efficiently simulated on a classical computer. The exact role of the entanglement is nevertheless not well understood. Since an exact analysis of entanglement evolution induces an exponential slowdown, we consider approximative analysis based on the framework of abstract interpretation. In this paper, a concrete quantum semantics based on superoperators is associated with a simple quantum programming language. The representation of entanglement, i.e. the design of the abstract domain is a key issue. A representation of entanglement as a partition of the memory is chosen. An abstract semantics is introduced, and the soundness of the approximation is proven.
Managing module dependencies to facilitate continuous testing
Authors: Brad Long
Venue: Information Processing Letters (2008)

Developing large commercial software systems is complex. Techniques have been proposed to deal with such large-scale systems development. One approach that has had some success is the combination of continuous integration and unit testing. Large systems are often divided into modules based on an area of functionality with potentially different teams developing each module. Invariably these modules rely on and interact with each other. Problems arise when teams wishing to test their module depend on code from other teams that is in development or under modification during maintenance. This paper describes an approach to managing module dependencies that allows teams to test their code in isolation or in conjunction with other modules. This facilitates the ability to continually run tests without being negatively impacted by the state of other modules. An additional side-effect is that the approach exceeds the requirements of the GNU Lesser General Public License by allowing a software vendor to easily provide a limited amount of source code, rather than potentially releasing source code for large portions of their product suite, or allowing reverse engineering of potentially large portions of their proprietary product.
Logics and Automata for Totally Ordered Trees
Authors: Marco Kuhlmann, Joachim Niehren
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

A totally ordered tree is a tree equipped with an additional total order on its nodes. It provides a formal model for data that comes with both a hierarchical and a sequential structure; one example for such data are natural language sentences, where a sequential structure is given by word order, and a hierarchical structure is given by grammatical relations between words. In this paper, we study monadic second-order logic (MSO) for totally ordered terms. We show that the MSO satisfiability problem of unrestricted structures is undecidable, but give a decision procedure for practically relevant sub-classes, based on tree automata.
Improving Tumor Clustering Based on Gene Selection
Authors: Xiangzhen Kong, Chunhou Zheng, Yuqiang Wu, Yutian Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Tumor clustering is becoming a powerful method in cancer class discovery. In this community, non-negative matrix factorization (NMF) has shown its advantages, such as the accuracy and robustness of the representation, over other conventional clustering techniques. Though NMF has shown its efficiency in tumor clustering, there is a considerable room for improvement in clustering accuracy and robustness. In this paper, gene selection and explicitly enforcing sparseness are introduced into clustering process. The independent component analysis (ICA) is employed to select a subset of genes. The unsupervised methods NMF and its extensions, sparse NMF (SNMF) and NMF with sparseness constraint (NMFSC), are then used for tumor clustering on the subset of genes selected by ICA. The experimental results demonstrate the efficiency of the proposed scheme.
Development of Face Recognition System Using Multi-views Database
Authors: Xiaojuan Liu, Jianwu Dang, Fan Yang, Michel Paindavoine
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

This paper presents a new multi-views face database and some development results on face recognition tasks based on it. Our objective is to find an efficient and simple algorithm for performing face recognition in real time. The image acquisition system is composed of five standard cameras, which together can simultaneously take five pictures of a human face from different perspectives. We address the problem of face recognition using Independent Component Analysis (ICA). We explore the issues of subspace selection, algorithm comparison, and multi-views face recognition performance. In order to make full use of the multi-views property, we also propose a strategy of majority voting among the five views, which can improve the recognition rate. Experimental results show that ICA is a promising method among the many possible face recognition methods, and that the ICA algorithm with majority-voting is currently the best choice for our purposes.
Kernel MDL to Determine the Number of Clusters
Authors: Ivan O Kyrgyzov, Olexiy O Kyrgyzov, Henri Maître, Marine Campedel
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particularly adapted to the use of kernel K-means clustering algorithm. Its formulation is based on the definition of MDL derived for Gaussian Mixture Model (GMM). We demonstrate the efficiency of our approach on both synthetic data and real data such as SPOT5 satellite images.
On the solution of the checkerboard problem in mixed-FEM topology optimization
Authors: Matteo Bruggi
Venue: Computers and Structures (2008)

The paper deals with an alternative formulation for the classical topology optimization problem of getting structures with minimum compliance with constraint on volume, relying on the adoption of a mixed finite-element discretization scheme instead of a common displacement-based one. Using mixed methods not only displacements are main variables but also stresses enter the formulation. Two dual variational principles of Hellinger-Reissner are presented in their continuous and discrete form and included in the topology optimization problem that is solved through the method of moving asymptotes (MMA). Numerical simulations are performed for both the formulations and in particular for the truly-mixed setting coupled to a mixed-FEM discretization that uses the composite element of Johnson and Mercier referring to the discretization of the stress field. This formulation is shown to achieve pure 0-1 designs with the relevant feature of being checkerboard-free without the adoption of any filtering technique. Ongoing extensions are outlined including the optimization of incompressible materials and the imposition of stress constraints that both find in the truly-mixed setting their natural environment.
Interactive Television - A Brief Media History
Authors: Jens F. Jensen
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

The paper is an attempt at tracing the history of interactive television. The lead that is followed is the various experimental attempts with and the commercial launches of interactive television that have been conducted, as well as the results that have been achieved. This will be done by identifying the various historical phases with different characteristic technological waves, business models, services and contents concepts.
Faster Implementation of ηT Pairing over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition
Authors: Yuto Kawahara, Kazumaro Aoki, Tsuyoshi Takagi
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

The &eta;T pairing in characteristic three is implemented by arithmetic in GF(3)={0,1,2}. Harrison et al. reported an efficient implementation of the GF(3)-addition by using seven logical instructions (consisting of AND, OR, and XOR) with the two-bit encoding { (0,0) &rarr;0, (0,1) &rarr;1, (1,0) &rarr; 2 }. It has not yet been proven whether seven is the minimum number of logical instructions for the GF(3)-addition. In this paper, we show many implementations of the GF(3)-addition using only six logical instructions with different encodings such as { (1,1) &rarr;0, (0,1) &rarr;1, (1,0) &rarr;2 } or { (0,0) &rarr;0, (0,1) &rarr;1, (1,1) &rarr;2 }. We then prove that there is no implementation of the GF(3)-addition using five logical instructions with any encoding of GF(3) by two bits. Moreover, we apply the new GF(3)-additions to an efficient software implementation of the &eta; T pairing. The running time of the &eta; T pairing over GF(3509), that is considered to be realized as 128-bit security, using the new GF(3)-addition with the encoding { (0,0) &rarr;0, (0,1) &rarr;1, (1,1) &rarr;2 } is 16.3 milliseconds on an AMD Opteron 2.2-GHz processor. This is approximately 7% faster than the implementation using the previous GF(3)-addition with seven logical instructions.
Agile Software Development: Theoretical and Practical Outlook
Authors: Pekka Abrahamsson, Jari Still
Venue: Proceedings of the 8th international conference on Product-Focused Software Process Improvement (2007)

Agile Software development has become to be one of the most prominent approaches in the field of software engineering. The amount of empirical evidence is quickly building up and it is known that already one out of seven software companies use agile processes. Many of the major corporations have announced to pursue for agile solutions with the aim of improving dramatically the lead-times, costs and quality aspects. Little is still known about the theoretical underpinnings of agile approaches. This tutorial serves for two purposes. First it demonstrates how agile solutions are theoretically founded and then in very pragmatic terms shows a longitudinal four-year case study how F-Secure, an antivirus company, from Finland transformed from iterative development to agile development framework. The case study also demonstrates which solutions worked and which ones proved to offer serious obstacles in the way. Finally, the business impact of the agile development is outlined based on empirical data. The tutorial will consist of interactive lectures, exercises and group work. The tutorial is targeted to software engineers and managers as well as academics.
Multi-layer Intrusion Detection and Defence Mechanisms Based on Immunity
Authors: Zhanfei Ma, Xuefeng Zheng
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Recently network intrusion detection is one of the hottest research topics. Existing network-based Intrusion Detection System (IDS) has drawbacks in many aspects, among of which the two outstanding problems are the high ratio of false alarms and the lack of self-adaptation. The powerful information processing capabilities of the biological immune system, such as feature extraction, pattern recognition, learning, memory, and its distributive multi-layer defence mechanisms provide rich metaphors for designing a computer immune defence system. In this approach, the authors propose a novel multi-layer defence mechanisms based on immunity, which is capable of detecting and identifying both known and unknown intrusions, elaborating a specialized response measure. Besides that, the proposed defence mechanisms have the same learning and adaptive capability of the biological immune system, and so it is able to monitor networked computer's activities at different levels, and to improve its response under subsequent exposures to the same attack. This on-going research effort is not to mimic simply the immunology characteristics but to explore and learn valuable lessons useful for self-adaptive immune intrusion prevention systems.
Neuro-fuzzy Adaptive Control of Nonlinear Singularly Perturbed Systems and Its Application to a Spacecraft
Authors: Li Li, Fuchun Sun
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this paper, we first present a series of dynamic TS fuzzy subsystems to approximate a nonlinear singularly perturbed system. Then the reference model with same fuzzy sets is established. To make the states of the closed-loop system follow those of the reference model, a controller including of neuro-fuzzy adaptive and linear feedback term is designed. The linear feedback parameters can be solved by LMI approach. Adaptive term is used to compensate the uncertainty and alleviate the external disturbance. Lyapunov constitute techniques can prove the stability of the closed loop systems. The simulations results illustrate the effectiveness of this approach.
The Evidence Theory Based Post-Processing of Colour Images
Authors: Marija Bacauskiene, Antanas Verikas
Venue: Informatica (2004)

The problem of post-processing of a classified image is addressed from the point of view of the Dempster-Shafer theory of evidence. Each neighbour of a pixel being analyzed is considered as an item of evidence supporting particular hypotheses regarding the class label of that pixel. The strength of support is defined as a function of the degree of uncertainty in class label of the neighbour, and the distance between the neighbour and the pixel being considered. A post-processing window defines the neighbours. Basic belief masses are obtained for each of the neighbours and aggregated according to the rule of orthogonal sum. The final label of the pixel is chosen according to the maximum of the belief function.
Ultra-wideband (UWB) microstrip bandpass filter with an improved wide stopband
Authors: Ru-Yuan Yang, Fu-Der Lai, Min-Hang Weng, Hung-Wei Wu, Chuan-wen Wang
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

In this paper, the ultra-wideband (UWB) bandpass filter (BPF) with a wide stopband is presented. The prototype of proposed UWB BPF is by bending the five short-circuited stubs and coupling the I/O feed lines. In order to have a wide stopband, an bandstop structure embedded in input/output (I/O) lines without degrading the passband performances is used. The measured results verified that by using embedded bandstop structure, the proposed BPF has a wide stopband with over 30 dB rejection from 11 to 20 GHz. The experiment results of the fabricated circuit agree well with the electromagnetic (EM) simulations.
Nearest Neighbour Classification with Monotonicity Constraints
Authors: Wouter Duivesteijn, Ad Feelders
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

In many application areas of machine learning, prior knowledge concerning the monotonicity of relations between the response variable and predictor variables is readily available. Monotonicity may also be an important model requirement with a view toward explaining and justifying decisions, such as acceptance/rejection decisions. We propose a modified nearest neighbour algorithm for the construction of monotone classifiers from data. We start by making the training data monotone with as few label changes as possible. The relabeled data set can be viewed as a monotone classifier that has the lowest possible error-rate on the training data. The relabeled data is subsequently used as the training sample by a modified nearest neighbour algorithm. This modified nearest neighbour rule produces predictions that are guaranteed to satisfy the monotonicity constraints. Hence, it is much more likely to be accepted by the intended users. Our experiments show that monotone kNN often outperforms standard kNN in problems where the monotonicity constraints are applicable.
Topology optimization of heat conduction problem involving design-dependent heat load effect
Authors: T. Gao, W. H. Zhang, J. H. Zhu, Y. J. Xu, D. H. Bassir
Venue: Finite Elements in Analysis and Design (2008)

Topology optimization of steady heat conduction problem under both design-independent and design-dependent heat loads is studied by means of a modified bidirectional evolutionary structural optimization (BESO) method. Two types of problems are distinguished by their physical meanings and particularly design-dependent load effect is highlighted in the following two points. At the stage of sensitivity analysis, both the heat conductivity matrix and the design-dependent heat generation load associated with the void element are penalized in the same manner. The rationality is illustrated based on numerical tests. Furthermore, as the sensitivity of the objective function changes its sign during the iteration, a modified BESO procedure is presented to deal with the non-monotonicity of the objective function defined by the heat potential capacity. Detailed steps of the BESO procedure are presented for the element removal and growth while the inequality volume constraint is imposed. To conclude the work, numerical results and the element sensitivity obtained are discussed to show the effect of design-dependent load.
Rapid control prototyping applications using TI C2000 DSP
Authors: Petru Dobra, Radu Duma, Daniel Moga, Radu Adrian Munteanu, Mihai Munteanu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper presents two rapid control prototyping applications: velocity control of a DC motor and adaptive system identification and control of an automotive alternator. The control algorithms for the applications run on a TMS320F2812 DSP. Once the desired functionality has been captured and simulated, using MATLAB/Simulink/Embedded Target for Texas Instruments (TI) C2000 DSP environment can be generated code for the DSP. All task assignments to processor are automatically made by the software.
Computational complexity: a conceptual perspective
Authors: Oded Goldreich
Venue: ACM SIGACT News (2008)

This book is rooted in the thesis that complexity theory is extremely rich in conceptual content, and that this contents should be explicitly communicated in expositions and courses on the subject. The desire to provide a corresponding textbook is indeed the motivation for writing the current book and its main governing principle. The book offers a conceptual perspective on complexity theory, and the presentation is designed to highlight this perspective. It is intended mainly for students that wish to learn complexity theory and for educators that intend to teach a course on complexity theory. The book is also intended to promote interest in complexity theory and make it acccessible to general readers with adequate background (which is mainly being comfortable with abstract discussions, definitions and proofs). We expect most readers to have a basic knowledge of algorithms, or at least be fairly comfortable with the notion of an algorithm. The book focuses on several sub-areas of complexity theory (including, e.g., pseudorandomness and probabilistic proof systems). In each case, the exposition starts from the intuitive questions addresses by the sub-area, as embodied in the concepts that it studies. The exposition discusses the fundamental importance of these questions, the choices made in the actual formulation of these questions and notions, the approaches that underly the answers, and the ideas that are embedded in these answers. Our view is that these (\non-technical") aspects are the core of the field, and the presentation attempts to re ect this view.