ppxscal/embedding_network huggingface dataset:
A Cellular Automaton Collision-Free Path Planner Suitable for Cooperative Robots
Authors: Konstantinos Ioannidis, Georgios Ch. Sirakoulis, Ioannis Andreadis
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

The settlement of the collision-free path planning problem is considered as a complicated objective and is of vital importance in systems comprising one or multiple robots. In multi-robots systems, the path planning problem is based on cooperation. In such systems, the robots dynamically exchange roles in order to complete complex tasks, such as moving in different formations. In this paper, a Cellular Automaton algorithm for solving the path planning problem in a multi-agent system is presented. Moreover, robots must cooperate to keep their initial formation if an unexpected event in the environment takes place. The proposed method was implemented in a real time system of three autonomous mobile robots. Simulation results and the results obtained from this system demonstrate the effectiveness of the method and its robustness.
Computational analysis and design of lattice structures with integral compliant mechanisms
Authors: E. M. Dede, G. M. Hulbert
Venue: Finite Elements in Analysis and Design (2008)

This paper introduces a unique technique for the design of single and multi-layered, periodic lattice structures. Specifically, small-scale compliant mechanisms are integrated into large-scale structures for specific dynamic functionality. Accordingly, the mid-frequency computational analysis of such structures at multiple scales is reviewed, and the results from several recent design studies are presented to illustrate the methodology. Highlighted applications include the design of alternative material structures, multi-layered partitions having enhanced vibro-acoustic characteristics, lightweight truss structures with multi-functional properties, and three-dimensional lattices.
The design of a complete segmented display unit for Arabic alphanumeric characters
Authors: Mohammad Osiur Rahman, Mubashsharul Islam Shafique, Edgar Scavino, Hassan Basri
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

There are four forms for most of the Arabic characters- initial, medial, final and isolated. This paper presents the design of a complete display unit for Arabic alphanumeric characters. The word 'complete' signifies that the proposed display unit can represent all forms of entire Arabic alphabets as well as Arabic numerals. The first segmented display unit for Arabic characters in the world covered only the isolated form and did not follow any base line to display a sequence of characters. This work extends the capability to represent all the forms of Arabic characters and follows a base line to represent a sequence of characters. Here a grid structure of 25 non-overlapping segments has been discovered. There can be 109 alphanumeric characters (at least 99 characters such as isolated form- 30, final form-29, medial form- 21, initial form- 20; and 10 numerals) to be displayed and 7-bit input is used to represent each character. After analyzing appropriate segments to be activated for every character, respective logic functions of all segments have been derived to display the entire set of Arabic alphanumeric characters.
Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN): A New Paradigm for Pervasive Information Gathering
Authors: Yu Wang, Hongyi Wu
Venue: IEEE Transactions on Mobile Computing (2007)

This paper focuses on the Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) for pervasive information gathering. We develop simple and efficient data delivery schemes tailored for DFT-MSN, which has several unique characteristics such as sensor mobility, loose connectivity, fault tolerability, delay tolerability, and buffer limit. We first study two basic approaches, namely, direct transmission and flooding. We analyze their performance by using queuing theory and statistics. Based on the analytic results that show the tradeoff between data delivery delay/ratio and transmission overhead, we introduce an optimized flooding scheme that minimizes transmission overhead in flooding. Then, we propose two simple and effective DFTMSN data delivery schemes, namely Replication-Based Efficient Data Delivery Scheme (RED) and Message Fault Tolerance-Based Adaptive Data Delivery Scheme (FAD). The RED scheme utilizes the erasure coding technology in order to achieve the desired data delivery ratio with minimum overhead. It consists of two key components for data transmission and message management. The former makes decision on when and where to transmit data messages according to the delivery probability, which is the likelihood that a sensor can deliver data messages to the sink. The latter decides the optimal erasure coding parameters (including the number of data blocks and the needed redundancy) based on its current delivery probability. The FAD scheme employs the message fault tolerance, which indicates the importance of the messages. The decisions on message transmission and dropping are made based on fault tolerance for minimizing transmission overhead. The system parameters are carefully tuned on the basis of thorough analyses to optimize network performance. Extensive simulations are carried out for performance evaluation. Our results show that both schemes achieve high message delivery ratio with acceptable delay. The RED scheme results in lower complexity in message and queue management, while the FAD scheme has a lower message transmission overhead.
Wide Field of View CCD Camera Based on Multi-sensors Image Mosaics
Authors: Guilan Feng, Weijian Tian, Changqing Huang, Tao Liu, Shuqin Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

It is difficult to acquire the whole scene at the same time, when the size of a requiring scene is beyond the scope of a CCD camera. In this case, the requiring scene can be captured by several CCD cameras at one time, and the overlapped images can be acquired. Using the images, the whole scene is reproduced. This paper presents an approach of using multi-sensor and image mosaics technique to implement a wide field of view CCD camera. Based on theoretic argumentation, the robust image mosaics method, and the hardware platform designing are given in detail. The results of experiment have proved the effectiveness and feasibility of this approach.
Semantics-oriented low power architecture
Authors: Hsien-Hsien S. Lee
Venue:  (2008)

Innovations in the microarchitecture and prominent advances in the semiconductor process technology enable sophisticated and powerful microprocessors. However, they also lead to increased power consumption. The main contribution of the thesis is the demonstration of Semantics-Oriented Low Power Architecture techniques that use the semantics of memory references and variables used in an application program to reduce the power consumption in the memory sub-system of a microprocessor. The Semantic-Aware Multilateral Partitioning (SAM) technique reduces the cache and TLB power consumption by decoupling the data TLB lookups and the data cache accesses, based on the semantic regions defined by the programming languages and the software convention, into discrete reference sub-streams, namely, stack, global static, and heap. To reduce the power consumed by the snoops in Chip Multiprocessor, we propose a hardware technique called Selective Snoop Probe (SSP) and a compiler-based hardware supported technique called Essential Snoop Probe (ESP) that use the properties of the program variables. By selectively sending the snoop probes, the SSP and ESP techniques relax the conservative nature of the cache coherency protocol and its implementation to reduce power and improve performance.
Recurrent fuzzy-neural approach for nonlinear control using dynamic structure learning scheme
Authors: Chun-Fei Hsu, Kuo-Hsiang Cheng
Venue: Neurocomputing (2008)

In this paper, a dynamic recurrent fuzzy neural network (DRFNN) with a structure learning scheme is proposed. The structure learning scheme consists of two learning phases: the node-constructing phase and the node-pruning phase, which enables the DRFNN to determine the nodes dynamically to achieve optimal network structure. Then, a self-structuring recurrent fuzzy neural network control (SRFNNC) system via the DRFNN approach is developed. The SRFNNC system is composed of a neural controller and a compensation controller. The neural controller using a DRFNN to mimic an ideal controller is the main controller, and the compensation controller is designed to compensate the difference between the neural controller and the ideal controller. In the SRFNNC system, all the parameters are evolved based on the Lyapunov function to ensure the system stability. Finally, to investigate the effectiveness of the proposed SRFNNC system, it is applied to control a second-order chaotic nonlinear system. A comparison between a fixed-structuring recurrent fuzzy neural network control and the proposed SRFNNC is made. Through the simulation results, the advantages of the proposed SRFNNC method can be observed.
Intelligence Through Interaction: Towards a Unified Theory for Learning
Authors: Ah-Hwee Tan, Gail A. Carpenter, Stephen Grossberg
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Machine learning, a cornerstone of intelligent systems, has typically been studied in the context of specific tasks, including clustering (unsupervised learning), classification (supervised learning), and control (reinforcement learning). This paper presents a learning architecture within which a universal adaptation mechanism unifies a rich set of traditionally distinct learning paradigms, including learning by matching, learning by association, learning by instruction, and learning by reinforcement. In accordance with the notion of embodied intelligence, such a learning theory provides a computational account of how an autonomous agent may acquire the knowledge of its environment in a real-time, incremental, and continuous manner. Through a case study on a minefield navigation domain, we illustrate the efficacy of the proposed model, the learning paradigms encompassed, and the various types of knowledge learned.
The Block Generative Topographic Mapping
Authors: Rodolphe Priam, Mohamed Nadif, Gérard Govaert
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

This paper presents a generative model and its estimation allowing to visualize binary data. Our approach is based on the Bernoulli block mixture model and the probabilistic self-organizing maps. This leads to an efficient variant of Generative Topographic Mapping. The obtained method is parsimonious and relevant on real data.
CDPM: Finding and Evaluating Community Structure in Social Networks
Authors: Li Wan, Jianxin Liao, Xiaomin Zhu
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

In this paper we proposed a CDPM (Clique Directed Percolation Method) algorithm, which clusters tightly cohesive cliques as cluster atoms and merge the cluster atoms into communities under the direction of a proposed object function, namely Structure Silhouette Coefficient (SSC). SSC could measure the quality of community divisions which allows communities share actors. Experiments demonstrate our algorithm can divide social networks into communities at a higher quality than compared algorithms.
Financial Privacy Policies and the Need for Standardization
Authors: Annie I. Anton, Julia B. Earp, Qingfeng He, William Stufflebeam, Davide Bolchini, Carlos Jensen
Venue: IEEE Security and Privacy (2004)

By analyzing 40 online privacy policy documents from nine financial institutions, the authors examine the clarity and readability of these important privacy notices. Using goal-driven requirements engineering techniques and readability analysis, the findings show that compliance with the ex-isting legislation and standards is, at best, questionable.
Collaboration Options for Small and Medium Size Enterprises
Authors: Sylvia Encheva, Sharil Tumin
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Collaboration options for small and medium size enterprises interested in entering new markets while providing fast, efficient, reliable and customized transport solutions are in the main focus of this work. For automated selection of the most desirable collaboration options we propose employment of a decision support system, where all collaboration options for a particular firm are evaluated by three experts with respect to two criteria.
A Large-Scale, General-Purpose Electronic Digital Calculator: The SSEC
Authors: John C. McPherson, Frank E. Hamilton, Robert R. Seeber,  Jr.
Venue: IEEE Annals of the History of Computing (1982)

This paper, written and intended for publication in 1948, describes IBM's Selective Sequence Electronic Calculator (SSEC), which was placed in regular operation that year. The machine combined electronic computation with a memory system that included electronic, relay, and paper-tape sections. It executed programs stored exactly as data in any of the sections of memory, and could select, compute, or modify the program in a variety of ways. The speed and flexibility of the SSEC permitted it to solve many of the largest scientific problems of the day, including the generation of astronomical tables still used in space flight.
Incentives and algorithms for reputation systems
Authors: Ashish Goel
Venue:  (2008)

Reputation systems have come to play an important role in the social and economic success of the Internet. However, they are unpredictable; in particular, these systems are susceptible to "presentation bias" and malicious spam, which distort the semantics of the reputation under consideration. Therefore, reputation systems in use today can give no guarantees about the reputations assigned. The thesis of this dissertation is that the underlying economics of reputation systems can be used to meaningfully ground the notion of reputation; further, with the help of appropriate mechanisms, reputation systems can be made robust to presentation bias and malicious spam. We make a case for identifying the reputation or quality of an entity with the potential revenue (or utility) the entity generates (or may generate) for the system. The generic incentive structure, presented in this dissertation, provides incentives to users for providing useful feedback. Any inaccuracy in the system, presents an arbitrage opportunity for the users. Since this arbitrage opportunity is independent of the source of the inaccuracy, benign or malicious, we argue that the system is robust to malicious spam as well. In the setting of ranking systems, we use an idealized model (the Inspect-Utilize model) to analyze various properties of our system. Further, (under mild assumptions) our ranking algorithm, in conjunction with the incentive structure, ensures that at any given instance, the system gives the highest reward to the feedback which causes the greatest reduction in the Kullback-Leibler divergence between the feedback scores and the qualities of the entities. In other words, it is most profitable for users to leave feedback which provides the most additional information relative to the current state of the system. We generalize these mechanisms to recommender systems, to work alongside collaborative filtering techniques. The key feature here is the asymmetric treatment of feedback, which allows the users to correct errors even in the presence of inaccuracies in the model, generated using collaborative filtering techniques. We also consider reputation systems used by retail/auction websites like eBay and Amazon.com. Ballot stuffing is the phenomenon of sellers undertaking fake transactions for the sake of fraudulent positive feedbacks. We observe the importance of transaction costs in making these systems robust to ballot stuffing.
Using a formal analysis technique to identify an unbinding attack on a buyer-seller watermarking protocol
Authors: David M. Williams, Helen Treharne, Anthony T.S. Ho, Chris Culnane
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

In this paper we provide a novel approach to the analysis of buyer-seller watermarking protocols by tailoring an existing formal technique that has not previously been used in this context. We accurately represent a buyer-seller watermarking protocol as proposed by Ibrahim et al. [6] by constructing a model using the process algebra CSP. By describing our model in this manner and utilising the tool support associated with CSP we are able to conduct a thorough analysis of all the possible behaviour in the protocol. Through formal analysis we have discovered an unbinding attack on the protocol. In this paper we also highlight other weaknesses that exist in the protocol and propose verifiable solutions to correct these weaknesses.
Security certificate revocation list distribution for vanet
Authors: Kenneth P. Laberteaux, Jason J. Haas, Yih-Chun Hu
Venue: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking (2008)

In a VANET, a certificate authority issues keys and certificates to vehicles. Each vehicle distributes these certificates to other VANET participants and subsequently signs messages against these certificates. If the certificate authority needs to revoke a certificate (e.g. due to a breach of trust), it universally distributes a certificate revocation list. We propose a method for car-to-car epidemic distribution of certificate revocation lists which is quick and efficient. Large-scale simulations based on realistic mobility traces show that this epidemic model significantly outperforms methods that only employ road side unit distribution points.
Governing Mobile Service Innovation in Converging Value Networks
Authors: Mark de Reuver, Harry Bouwman
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

Abstract In a converging mobile 3G+ services domain, governing the activities of operators, content providers and application developers in a value network is an important business model design issue. While existing studies provide insight into governance mechanisms as authority, contracts and trust, little is known which mechanisms are most suited for the various phases of mobile service innovation. In this paper, we examine what governance mechanisms are used during the development, implementation and roll-out, and commercialization of a service, by analyzing a survey among 96 practitioners and experts in the mobile Internet services domain. We find that authority-based governance is most commonly used in the early stages of developing service concepts and technologies, while trust-based governance is used during implementation, roll-out and commercialization. Contract-based governance is most common during implementation and roll-out. These results provide important clues to mobile business actors on how to design organizational arrangements in converging value networks.
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Authors: Corrado Biasi, Federico Aschieri
Venue: Fundamenta Informaticae (2008)

We propose a term assignment (let calculus) for Intuitionistic Logic for Pragmatics ILP$_{AC}$, a polarized sequent calculus which includes ordinary positive intuitionistic logic LJ$^{&sup;&cap;}$, its dual LJ$^{&setmn;&gamma;}$ and dual negations ()$^{&bottom;}$ which allow a formula to "communicate" with its dual fragment. We prove the strong normalization property for the term assignment which follows by soundly translating the let calculus into simply typed &gamma; calculus with pairings and projections. A new and simple proof of strong normalization for the latter is also provided.
Evolutionary Methods to Create Interpretable Modular System
Authors: Marcin Korytkowski, Marcin Gabryel, Leszek Rutkowski, Stanislaw Drozda
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In this paper we present an evolutionary method to create an interpretable modular system. It consists of many neuro-fuzzy structures which are merged using a very popular algorithm called AdaBoost. As the alternative to the backpropagation method to train all models a special evolutionary algorithm has been used based on the evolutionary strategy (μ, ¿).
Numerical-Symbolic Matlab Program for the Analysis of Three-Dimensional Chaotic Systems
Authors: Akemi Gálvez
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper, a new numerical-symbolic Matlab program for the analysis of three-dimensional chaotic systems is introduced. The program provides the users with a GUI (Graphical User Interface) that allows us to analyze any continuous three-dimensional system with a minimal input (the symbolic ordinary differential equations of the system along with some relevant parameters). Such an analysis can be performed either numerically (for instance, the computation of the Lyapunov exponents, the graphical representation of the attractor or the evolution of the system variables) or symbolically (for instance, the Jacobian matrix of the system or its equilibrium points). Some examples of the application of the program to analyze several chaotic systems are also given.
Ensemble of software defect predictors: a case study
Authors: Ayse Tosun, Burak Turhan, Ayse Bener
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

In this paper, we present a defect prediction model based on ensemble of classifiers, which has not been fully explored so far in this type of research. We have conducted several experiments on public datasets. Our results reveal that ensemble of classifiers considerably improve the defect detection capability compared to Naive Bayes algorithm. We also conduct a cost-benefit analysis for our ensemble, where it turns out that it is enough to inspect 32% of the code on the average, for detecting 76% of the defects.
Offline Signature Verification Using Local Interest Points and Descriptors
Authors: Javier Ruiz-Del-Solar, Christ Devia, Patricio Loncomilla, Felipe Concha
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this article, a new approach to offline signature verification, based on a general-purpose wide baseline matching methodology, is proposed. Instead of detecting and matching geometric, signature-dependent features, as it is usually done, in the proposed approach local interest points are detected in the signature images, then local descriptors are computed in the neighborhood of these points, and afterwards these descriptors are compared using local and global matching procedures. The final verification is carried out using a Bayes classifier. It is important to remark that the local interest points do not correspond to any signature-dependent fiducial point, but to local maxima in a scale-space representation of the signature images. The proposed system is validated using the GPDS signature database, where it achieves a FRR of 16.4% and a FAR of 14.2%.
An End-to-End Packet Delay Optimization for QoS in a MANET
Authors: Sang-Chul Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

This paper focuses on calculating an end-to-end packet delay optimization for Quality of Service (QoS) in a mobile ad hoc network (MANET). Each intermediate node in an active path can achieve the optimized data rate which is obtained by using Lagrangian function and the end-to-end packet delay constraint. It is shown that the amount of data rate compared to the one which is not optimized can be saved in the proposed algorithm.