ppxscal/embedding_network huggingface dataset:
Parallel distributed genetic fuzzy rule selection
Authors: Yusuke Nojima, Hisao Ishibuchi, Isao Kuwajima
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

Genetic fuzzy rule selection has been successfully used to design accurate and compact fuzzy rule-based classifiers. It is, however, very difficult to handle large data sets due to the increase in computational costs. This paper proposes a simple but effective idea to improve the scalability of genetic fuzzy rule selection to large data sets. Our idea is based on its parallel distributed implementation. Both a training data set and a population are divided into subgroups (i.e., into training data subsets and sub-populations, respectively) for the use of multiple processors. We compare seven variants of the parallel distributed implementation with the original non-parallel algorithm through computational experiments on some benchmark data sets.
On the application of pairing based cryptography to wireless sensor networks
Authors: Piotr Szczechowiak, Anton Kargl, Michael Scott, Martin Collier
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Recent research results have shown that Elliptic Curve Cryptography (ECC) is feasible on resource constrained sensor nodes. In this work we demonstrate that the related but more complex primitives of Pairing Based Cryptography(PBC) are also well suited for sensor devices. We present the first in-depth study on the application and implementation of PBC to Wireless Sensor Networks (WSNs). Our implementations are all the fastest yet reported, and have been implemented across a range of WSN processors. On a system level we investigate the application of a simple non-interactive key exchange scheme that is particularly suitable for many WSN scenarios. We also present a novel variant of the key exchange protocol which can be useful in even more demanding applications, and which partially solves the problem of node compromise attacks.
A capacitance solver for incremental variation-aware extraction
Authors: Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Daniel
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from the corresponding drawn shapes. While first-order sensitivity information can measure the change in pattern parasitics when the shape variations are small, there is still a need for a high-order algorithm that can extract parasitic variations incrementally in the presence of a large number of simultaneous shape variations. This paper proposes such an algorithm based on the well-known method of floating random walk (FRW). Specifically, we formalize the notion of random path sharing between several conductors undergoing shape perturbations and use it as a basis of a fast capacitance sensitivity extraction algorithm and a fast incremental variational capacitance extraction algorithm. The efficiency of these algorithms is further improved with a novel FRW method for dealing with layered media. Our numerical examples show a 10X speed up with respect to the boundary-element method adjoint or finite-difference sensitivity extraction, and more than 560X speed up with respect to a non-incremental FRW method for a high-order variational extraction.
Validation of a bayesian belief network representation for posterior probability calculations on national crime victimization survey
Authors: Michael Riesen, Gursel Serpen
Venue: Artificial Intelligence and Law (2008)

This paper presents an effort to induce a Bayesian belief network (BBN) from crime data, namely the national crime victimization survey (NCVS). This BBN defines a joint probability distribution over a set of variables that were employed to record a set of crime incidents, with particular focus on characteristics of the victim. The goals are to generate a BBN to capture how characteristics of crime incidents are related to one another, and to make this information available to domain specialists. The novelty associated with the study reported in this paper lies in the use of a Bayesian network to represent a complex data set to non-experts in a way that facilitates automated analysis. Validation of the BBN's ability to approximate the joint probability distribution over the set of variables entailed in the NCVS data set is accomplished through a variety of sources including mathematical techniques and human experts for appropriate triangulation. Validation results indicate that the BBN induced from the NCVS data set is a good joint probability model for the set of attributes in the domain, and accordingly can serve as an effective query tool.
Using Knowledge Management Technologies in Searching Medicinal Learning Objects
Authors: Juha Puustjärvi, Leena Puustjärvi
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

The representation and organization of learning objects should provide the user with easy access to the information in which he or she is interested. Traditionally information retrieval systems support keyword-based searching where the search engine returns a set of documents (or links to the documents). In the context of medicinal information systems it is turned out that in many cases the returned documents do not satisfy user's information need. To alleviate this problem we are developing a retrieval system, which extends the functionality of keyword-based searching by browsing functionalities. The browsing, however, is not based on hyperlinks but rather on the relationships that occur in medicinal ontologies, which model medicinal learning objects as well as their relationships to other medicinal concepts. In this paper we motivate the need of such information retrieval systems, and illustrate the use of Semantic Web-technologies in developing the medicinal ontologies on which the browsing is based on.
A Tabu Search Algorithm for Cluster Building in Wireless Sensor Networks
Authors: Abdelmorhit El Rhazi, Samuel Pierre
Venue: IEEE Transactions on Mobile Computing (2009)

The main challenge in wireless sensor network deployment pertains to optimizing energy consumption when collecting data from sensor nodes. This paper proposes a new centralized clustering method for a data collection mechanism in wireless sensor networks, which is based on network energy maps and Quality-of-Service (QoS) requirements. The clustering problem is modeled as a hypergraph partitioning and its resolution is based on a tabu search heuristic. Our approach defines moves using largest size cliques in a feasibility cluster graph. Compared to other methods (CPLEX-based method, distributed method, simulated annealing-based method), the results show that our tabu search-based approach returns high-quality solutions in terms of cluster cost and execution time. As a result, this approach is suitable for handling network extensibility in a satisfactory manner.
Learning C++ Programming Concepts, 2007 edition
Authors: CADCIM
Venue:  (2007)

Learning C++ Programming Concepts (with line-by-line explanation of all programs)is an example-based textbook that has been written to cater to the needs of programmers who want to understand the concepts of C++ programming. The highlight of the textbook is that each concept introduced in it has been exemplified by a program to clarify and facilitate better understanding. Also, the line-by-line explanation of each program ensures that the users with no previous programming experience are able to master the programming techniques and concepts and use them with flexibility while writing other programs. Structured in a pedagogical sequence, the chapters cover various programming concepts such as constructors and destructors, inheritance, polymorphism, exception handling, and file I/O system to name only a few. All concepts have been explained with the help of programs to ensure that the users can use them with ease while writing their own programs.Salient Features of the Textbook This textbook introduces the key ideas of object-oriented programming in an intuitive way. The concepts are illustrated through best programming examples, covering all aspects of OOP. Additional information is provided to the users in the form of notes. There is an extensive use of examples, schematic representation, flow-charts, tables, screen capture images, and programming exercises. The first page of every chapter summarizes the topics that are covered in it. Each chapter ends with a Self-Evaluation test so that the users can assess their knowledge. The answers of the Self-Evaluation test are given at the end of the chapter. Also, the Review Questions and Exercises are given at the end of each chapter that can be used by the Instructors as test questions and exercises. Free Teaching and Learning Resources Online technical support by contacting techsupport@cadcim.com. All programs used in exercises and examples. Customiza
AR-Jig: A Handheld Tangible User Interface for Modification of 3D Digital Form via 2D Physical Curve
Authors: Mahoro Anabuki, Hiroshi Ishii
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

We introduce AR-Jig, a new handheld tangible user interface for 3D digital modeling in augmented reality (AR) space. AR-Jig has a pin array that displays a 2D physical curve coincident with a contour of a digitally displayed 3D form. It supports physical interaction with a portion of a 3D digital representation, allowing 3D forms to be directly touched and modified. Traditional tangible user interfaces physically embody all the data; in contrast, this project leaves the majority of the data in the digital domain but gives physicality to any portion of the larger digital dataset via a handheld tool. This tangible intersection enables the flexible manipulation of digital artifacts, both physically and virtually. Through an informal test by end-users and interviews with professionals, we confirmed the potential of the AR-Jig concept while identifying the improvements necessary to make AR-Jig a practical tool for 3D digital design.
Nonparametric likelihood based estimation for a multivariate Lipschitz density
Authors: Daniel Carando, Ricardo Fraiman, Pablo Groisman
Venue: Journal of Multivariate Analysis (2009)

We consider a problem of nonparametric density estimation under shape restrictions. We deal with the case where the density belongs to a class of Lipschitz functions. Devroye [L. Devroye, A Course in Density Estimation, in: Progress in Probability and Statistics, vol. 14, Birkhauser Boston Inc., Boston, MA, 1987] considered these classes of estimates as tailor-made estimates, in contrast in some way to universally consistent estimates. In our framework we get the existence and uniqueness of the maximum likelihood estimate as well as strong consistency. This NPMLE can be easily characterized but it is not easy to compute. Some simpler approximations are also considered.
Cooperative multi-robot path planning using differential evolution
Authors: Jayasree Chakraborty, Amit Konar, L. C. Jain, Uday K. Chakraborty
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2009)

This paper provides an alternative approach to the co-operative multi-robot path planning problem using parallel differential evolution algorithms. Both centralized and distributed realizations for multi-robot path planning have been studied, and the performances of the methods have been compared with respect to a few pre-defined yardsticks. The distributed approach to this problem out-performs its centralized version for multi-robot planning. Relative performance of the distributed version of the differential evolution algorithm has been studied with varying numbers of robots and obstacles. The distributed version of the algorithm is also compared with a PSO-based realization, and the results are competitive.
A randomized dynamic program analysis technique for detecting real deadlocks
Authors: Pallavi Joshi, Chang-Seo Park, Koushik Sen, Mayur Naik
Venue: ACM SIGPLAN Notices (2009)

We present a novel dynamic analysis technique that finds real deadlocks in multi-threaded programs. Our technique runs in two stages. In the first stage, we use an imprecise dynamic analysis technique to find potential deadlocks in a multi-threaded program by observing an execution of the program. In the second stage, we control a random thread scheduler to create the potential deadlocks with high probability. Unlike other dynamic analysis techniques, our approach has the advantage that it does not give any false warnings. We have implemented the technique in a prototype tool for Java, and have experimented on a number of large multi-threaded Java programs. We report a number of previously known and unknown real deadlocks that were found in these benchmarks.
An Approach to Modelling Software Evolution Processes, 1st edition
Authors: Tong Li
Venue:  (2009)

An Approach to Modelling Software Evolution Processes describes formal software processes that effectively support software evolution. The importance and popularity of software evolution increase as more and more successful software systems become legacy systems. For one thing, software evolution has become an important characteristic in the software life cycle; for another, software processes play an important role in increasing efficiency and quality of software evolution. Therefore, the software evolution process, the inter-discipline of software process and software evolution, becomes a key area in software engineering. The book is intended for software engineers and researchers in computer science. Prof. Tong Li earned his Ph.D. in Software Engineering at De Montfort University, U.K.; he has published five monographs and over one hundred papers.
Of pages and paddles: Children's expectations and mistaken interactions with physical-digital tools
Authors: Eva Hornecker, Andreas Dünser
Venue: Interacting with Computers (2009)

An assumption behind new interface approaches that employ physical means of interaction is that these can leverage users' prior knowledge from the real world, making them intuitive or 'natural' to use. This paper presents a user study of Tangible Augmented Reality, which shows that physical input tools can invite a wide variety of interaction behaviours and raise unmatched expectations about how to interact. Children played with interactive sequences in an augmented book using physical paddles to control the main characters. Our analysis focuses on how knowledge and skills that children have from the physical world succeed or fail to apply in the interaction with this application. We found that children expected the digital augmentations to behave and react analogous to physical 3D objects, encouraged by the ability to act in 3D space and the (digital) visual feedback. The affordances of the paddles as physical interaction devices invited actions that the system could not detect or interpret. In effect, children often struggled to understand what it was in their actions that made the system react.
Cost-effective base station deployment approach based on artificial immune systems
Authors: Djalma de Melo Carvalho Filho, Marcelo Sampaio de Alencar
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

This work presents a cost-effective base station deployment model based on artificial immune systems. It uses a multi-objective algorithm based on artificial immune systems (MO-AIS) as an optimiser. MO-AIS algorithms are a new class of evolutionary algorithms. The Binary-coded Multi-objective Optimisation Algorithm (BRMOA) is inspired by the clonal selection theory and the immune network theory. In this innovative approach, the network is optimised for high service coverage and low cost. The cost function takes into account user-defined geographical costs and environmental legislation. The optimisation strategy is applied to two realistic scenarios and results are compared.
A study of relationships between situation awareness and presence that affect performance on a handheld game console
Authors: Dooho Jung, Seongsik Jo, Rohae Myung
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Modern handheld devices are equipped with a high-speed CPU and a 3D graphic accelerator that enrich experience to a similar level as for Desktop Virtual Reality (VR). This research explored relationships between situation awareness and presence that affect performance on a handheld game console. The task was to shoot down enemy aircraft in a flight simulator game. Situation awareness (SA) was measured by SAGAT (Situation Awareness Global Assessment Technique), while presence was measured by PQ (Presence Questionnaire) Version 3.0. Performance was measured by the number of enemy aircraft shot down per minute during aerial combat in the flight simulation game. Situation awareness was positively significantly correlated with performance. The correlation between presence and performance was also significantly positive. Presence and SA were positively related. Research on situation awareness, presence, and performance can be conducted even on a handheld game console. The study also proved that the domain of research on situation awareness and presence can be extended to small displays, such as handheld game consoles.
Optimization Strategy for SSVEP-Based BCI in Spelling Program Application
Authors: Indar Sugiarto, Brendan Allison, Axel Gräser
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

This paper describes an optimization strategy for steady state visual evoked potential (SSVEP)-based brain-computer interface (BCI), especially in a spelling program application. In this application, there are at least three components for implementing a complete BCI application: stimulator, signal processing, and application (spelling program). Ideally, those three components should run on different processing units in order to obtain optimum performance. But integrating those three components in one computer system also gives advantages: make it easier for the subject to concentrate and simplifies the system configuration. There are two main parts that need to be optimized: the flickering animation and the spelling system. When optimizing the flickering animation, we will focus on the display driver technology and programming aspects. The optimization of spelling system will be focused on the layout and representation of the letter matrix. We tested our program on several computers for the following parameters: frequency range, frequency resolution, and frequency stability. It can be concluded that using a computer monitor as the stimulator, the maximum synthesizable stimulator frequency is always half of its minimum refresh-rate, no matter which software technology is applied (DirectX or OpenGL). The maximum synthesizable frequency of up to 30 Hz with frequency resolution 0.11Hz is achieved. We have tested our system on 106 subjects during CeBIT 2008 in Hannover, Germany. Mean accuracy for the spelling system is 92.5%. Therefore, the optimization strategy described here led to a stable and reliable system that performed effectively across most subjects without requiring extensive expert help or expensive hardware.
A sequential indexing scheme for flash-based embedded systems
Authors: Shaoyi Yin, Philippe Pucheral, Xiaofeng Meng
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

NAND Flash has become the most popular stable storage medium for embedded systems. As on-board storage capacity increases, the need for efficient indexing techniques arises. Such techniques are very challenging to design due to a combination of NAND Flash constraints (for example the block-erase-before-page-rewrite constraint and limited number of erase cycles) and embedded system constraints (for example tiny RAM and resource consumption predictability). Previous work adapted traditional indexing methods to cope with Flash constraints by deferring index updates using a log and batching them to decrease the number of rewrite operations in Flash memory. However, these methods were not designed with embedded system constraints in mind and do not address them. In this paper, we propose a new alternative for indexing Flash-resident data that specifically addresses the embedded context. This approach, called PBFilter, organizes the index structure in a purely sequential way. Key lookups are sped up thanks to two principles called Summarization and Partitioning. We instantiate these principles with data structures and algorithms based on Bloom Filters and show the effectiveness of this approach through a comprehensive performance study.
Traffic-Grooming in WDM Network under Physical Constraints
Authors: Ling Zeng, Shizhong Xu, Sheng Wang, Xiong Wang, Lemin Li, Kaiyu Zhou
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Virtual topology design is an efficient approach to tackle the traffic-grooming problem which multiplexes low-granularity demands into high-granularity pipes in optical networks. But it is hard to deal with the demands with various physical constraints. In this paper, we propose a packing grooming with partial-combination algorithm (PPA) to address this issue. The PPA first routes low-granularity demands one by one to satisfy their own constraints, and then packs these low-granularity demands into multiple-hop potential high-granularity pipes in physical network to save the low-granularity switch capacity in the intermediate nodes. With the high-granularity potential pipes in hand, we use a partial-combination approach to identify the set of potential pipes with the maximum revenue which do not collide with each other and instantiate them. Numerical results show that PPA has better performance than existing algorithms, and it could be used to solve this problem in large networks with more than one hundred nodes.
Computational Stylometry: Who's in a Play?
Authors: Carl Vogel, Gerard Lynch
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

Automatic text classification techniques are applied to the problem of quantifying strength of characterization within plays, using a case study of the works of four sample playwrights that are freely available in machine-readable form. Strong characters are those whose speeches constitute homogeneous categories in comparison with other characters--their speeches are more attributable to themselves than to their play or their author.
On the precise integration methods based on Padé approximations
Authors: M. F. Wang, F. T. K. Au
Venue: Computers and Structures (2009)

The precise time step integration method proposed for linear time-invariant homogeneous dynamic systems can give precise numerical results approaching exact solutions at the integration points, but it is conditionally stable. By combining Pade approximation and the generalized Pade approximation of the matrix exponential function in precise integration, and by using three different types of quadrature formulae, a new generalized family of precise time step integration methods is developed to achieve unconditional stability and arbitrary order of accuracy. Numerical studies indicate that they are unconditionally stable algorithms with controllable numerical dissipation. They also demonstrate the validity and efficiency of these algorithms.