ppxscal/embedding_network huggingface dataset:
Liposome logic
Authors: James Smaldon, Natalio Krasnogor, Cameron Alexander, Marian Gheorghe
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

VLSI research, in its continuous push toward further miniaturisation, is seeking to break through the limitations of current circuit manufacture techniques by moving towards biomimetic methodologies that rely on self-assembly, selforganisation and evodevo-like processes. On the other hand, Systems and Synthetic biology's quest to achieve ever more detailed (multi)cell models are relying more and more on concepts derived from computer science and engineering such as the use of logic gates, clocks and pulse generator analogs to describe a cell's decision making behavior. This paper is situated at the crossroad of these two enterprises. That is, a novel method of non-conventional computation based on the encapsulation of simple gene regulatory-like networks within liposomes is described. Three transcription Boolean logic gates were encapsulated and simulated within liposomes self-assembled from DMPC (dimyristoylphosphatidylcholine) amphiphiles using an implementation of Dissipative Particle Dynamics (DPD) created with the NVIDIA CUDA framework, and modified to include a simple collision chemistry in a stochastic environment. The response times of the AND, OR and NOT gates were shown to be positively effected by the encapsulation within the liposome inner volume.
Self-localization and obstacle avoidance for a mobile robot
Authors: Hongbo Wang, Ke Yu, Bingyi Mao
Venue: Neural Computing and Applications (2009)

This article presents a fast self-localization method based on ZigBee wireless sensor network and laser sensor, an obstacle avoidance algorithm based on ultrasonic sensors for a mobile robot. The positioning system and positioning theory of ZigBee which can obtain a rough global localization of the mobile robot are introduced. To realize accurate local positioning, a laser sensor is used to extract the features from environment, then the environmental features and global reference map can be matched. From the matched environmental features, the position and orientation of the mobile robot can be obtained. To enable the mobile robot to avoid obstacle in real-time, a heuristic fuzzy neural network is developed by using heuristic fuzzy rules and the Kohonen clustering network. The experiment results show the effectiveness of the proposed method.
Combining keyword search and forms for ad hoc querying of databases
Authors: Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan, Jeffrey Naughton
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyword search have been proposed; while both have benefits, both also have limitations. In this paper, we investigate combining the two with the hopes of creating an approach that provides the best of both. Specifically, we propose to take as input a target database and then generate and index a set of query forms offline. At query time, a user with a question to be answered issues standard keyword search queries; but instead of returning tuples, the system returns forms relevant to the question. The user may then build a structured query with one of these forms and submit it back to the system for evaluation. In this paper, we address challenges that arise in form generation, keyword search over forms, and ranking and displaying these forms. We explore techniques to tackle these challenges, and present experimental results suggesting that the approach of combining keyword search and form-based interfaces is promising.
The Definitive Guide to NetBeans Platform
Authors: Heiko Bck
Venue:  (2009)

The Definitive Guide to NetBeans Platform is a thorough and definitive introduction to the NetBeans Platform, covering all its major APIs in detail, with relevant code examples used throughout. The original German book on which this title is based was well received. The NetBeans Platform Community has put together this English translation, which author Heiko Bck updated to cover the latest NetBeans Platform 6.5 APIs. With an introduction by known NetBeans Platform experts Jaroslav Tulach, Tim Boudreau, and Geertjan Wielenga, this is the most up-to-date book on this topic at the moment. All NetBeans Platform developers will be interested in purchasing it, because several topics in the book have not been documented anywhere else. What you'll learn Discover the NetBeans Platform's problem domain: scalable, well-architected Swing applications via modularity Get started with the NetBeans Platform Get the very latest NetBeans Platform 6.5 APIs Master the Module system Use actions, lookups, file access, visualization, and more Build a user interface and the elements that make one up including graphical components, standard components, internationalization, and more Create an application using persistence, web services, update facilities, and more Extend NetBeans with tips and tricks Cap your NetBeans experience with the sample MP3 Manager Project Who is this book for? Swing developers who need large, well-constructed applications, and Java developers interested in modularity and the architecture of distributed applications
Context-Aware Adaptation: A Case Study On Mathematical Notations
Authors: Christine Muller, Michael Kohlhase
Venue: Information Systems Management (2009)

In the last two decades, the World Wide Web has become the universal information source. Search engines can efficiently serve daily information needs due to the enormous redundancy of relevant resources on the web. For educational and scientific information needs, the web functions much less efficiently: Scientific publishing is built on a culture of unique reference publications, and moreover, documents abound with specialized structures such as technical nomenclature, notational conventions, references, tables, or graphs. Many of these structures are peculiar to specialized communities determined by nationality, research group membership, or adherence to a special school of thought. To keep the much-lamented “digital divide” from becoming a “cultural divide,” we have to make online material more accessible and adaptable to individual users. In this paper, we attack this goal for the field of mathematics where knowledge is abstract, highly structured, and extraordinarily interlinked. Modern, content-based representation formats like OpenMath or content MathML allow us to capture, model, relate, and represent mathematical knowledge object, and thus, make them context-aware and machine-adaptable to the respective user contexts. Building on previous work, which can make mathematical notations adaptable, we employ user modeling techniques to make them adaptive to relieve the reader of configuration tasks. We present a comprehensive framework for adaptive notation management and evaluate it on the proof-of-concept prototype panta rhei.
D-Praxis: A Peer-to-Peer Collaborative Model Editing Framework
Authors: Alix Mougenot, Xavier Blanc, Marie-Pierre Gervais
Venue: Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems (2009)

Large-scale industrial systems involve nowadays hundreds of developers working on hundreds of models representing parts of the whole system specification. Unfortunately, few tool support is provided for managing this huge set of models. In such a context of collaborative work, the approach commonly adopted by the industry is to use a central repository and to make use of merge mechanisms and locks.In this article we present a collaborative model editing framework, peer-to-peer oriented, that considers that every developer has his own partial replication of the system specification and that makes use of messages exchange for propagating changes made by developers. Our approach has the advantage not to be based on a single repository, which is more and more the case in large-scale industrial projects.
DOULION: counting triangles in massive graphs with a coin
Authors: Charalampos E. Tsourakakis, U. Kang, Gary L. Miller, Christos Faloutsos
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analysis. Metrics frequently computed such as the clustering coefficient and the transitivity ratio involve the execution of a triangle counting algorithm. Furthermore, several interesting graph mining applications rely on computing the number of triangles in the graph of interest. In this paper, we focus on the problem of counting triangles in a graph. We propose a practical method, out of which all triangle counting algorithms can potentially benefit. Using a straightforward triangle counting algorithm as a black box, we performed 166 experiments on real-world networks and on synthetic datasets as well, where we show that our method works with high accuracy, typically more than 99% and gives significant speedups, resulting in even ≈ 130 times faster performance.
Portscan Detection with Sampled NetFlow
Authors: Ignasi Paredes-Oliva, Pere Barlet-Ros, Josep Solé-Pareta
Venue: Proceedings of the First International Workshop on Traffic Monitoring and Analysis (2009)

Sampling techniques are often used for traffic monitoring in high-speed links in order to avoid saturation of network resources. Although there is a wide existing research dealing with anomaly detection, few studies analyzed the impact of sampling on the performance of portscan detection algorithms. In this paper, we performed several experiments on two already existing portscan detection mechanisms to test whether they are robust enough to different sampling techniques. Unlike previous works, we found that flow sampling is not always better than packet sampling to continue detecting portscans reliably.
Modeling the Bilingual Lexicon of an Individual Subject
Authors: Risto Miikkulainen, Swathi Kiran
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

Lexicon is a central component in any language processing system, whether human or artificial. Recent empirical evidence suggests that a multilingual lexicon consists of a single component representing word meanings, and separate component for the symbols in each language. These components can be modeled as self-organizing maps, with associative connections between them implementing comprehension and production. Computational experiments in this paper show that such a model can trained to match the proficiency and age of acquisition of particular bilingual individuals. In the future, it may be possible to use such models to predict the effect of rehabilitation of bilingual aphasia, resulting in more effective treatments.
Using Maple Worksheets to Enable Student Explorations of Cryptography
Authors: Mike May S. J.
Venue: Cryptologia (2009)

This paper explores the use of Maple worksheets in a course on modern cryptography for undergraduate sophomores and juniors. The worksheets allow students to explore deep topics without requiring many prerequisites. A sample worksheet, where students examine the effectiveness of the Fermat test is considered in some detail, and a sample list of other explorations done by the students is given. The paper concludes with the author's evaluation of the use of computer algebra in teaching cryptography.
Applying randomized projection to aid prediction algorithms in detecting high-dimensional rogue applications
Authors: Travis Atkison
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by applying the feature extraction technique of randomized projection. Document similarity techniques, such as cosine similarity, have been used with great success in several document retrieval applications. By following a standard information retrieval methodology, software, in machine readable format, can be regarded as documents in the corpus. These "documents" may or may not have a known rogue functionality. The query is software, again in machine readable format, which contains a certain type of rogue software. This methodology provides an ability to search the corpus with a query and retrieve/identify potentially rogue software as well as other instances of the same type of vulnerability. This retrieval is based on the similarity of the query to a given document in the corpus. To overcome what is known as the 'the curse of dimensionality' that can occur with the use of this type of information retrieval technique, randomized projections are used to create a low-order embedding of the high-dimensional data. For our experiment, we obtain Microsoft Windows applications, infect a subset of them with several common Trojans and apply our dimensionality and prediction methodology. Preliminary results show promise when applying randomized projections to cosine similarity in both speed of prediction and efficiency of required space when compared with using only cosine similarity.
Adaptive Exponential Synchronization of Stochastic Delay Neural Networks with Reaction-Diffusion
Authors: Birong Zhao, Feiqi Deng
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In the paper, adaptive exponential synchronization scheme for a class of reaction-diffusion neural networks with continuously distributed delays and stochastic influence are considered. An adaptive synchronization controller is derived to achieve the exponential synchronization of the drive-response structure of neural networks. Lyapunov stability theory, stochastic Fubini theorem and semimartingale theorem are used in our approach. It is shown that the approaches developed here extend and improve the ideas presented in recent literatures.
Performance Evaluation of Gradient Routing Strategies for Wireless Sensor Networks
Authors: Fadila Khadar, Tahiry Razafindralambo
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

We consider Wireless Sensor Networks (WSN) applications in which sensors have to send data to a unique sink in a multi-hop fashion. Gradient routing protocol is a scalable way to route data in these applications. Many gradient routing protocols exist, they mainly differ in their performances (delay, delivery ratio, etc.). In this paper, we propose an extensive performance evaluation study of some gradient routing protocols in order to give guidelines for WSN developers.
A filled function method for optimal discrete-valued control problems
Authors: C. Z. Wu, K. L. Teo, V. Rehbock
Venue: Journal of Global Optimization (2009)

In this paper, we present a new approach to solve a class of optimal discrete-valued control problems. This type of problem is first transformed into an equivalent two-level optimization problem involving a combination of a discrete optimization problem and a standard optimal control problem. The standard optimal control problem can be solved by existing optimal control software packages such as MISER 3.2. For the discrete optimization problem, a discrete filled function method is developed to solve it. A numerical example is solved to illustrate the efficiency of our method.
High-performance visualization of large-scale time-varying volume data
Authors: Hongfeng Yu
Venue:  (2008)

Massively parallel supercomputers enable scientists to simulate complex phenomena in unprecedented detail. When scientists attempt to analyze and understand data generated by large-scale simulations, the sheer size of the data is a major challenge. Many advances have been made for large-scale data visualization that address this challenge. However, they do not always meet the performance requirements of interactive, high-resolution/high-precision visualization. Visualizing these terascale data sets, soon to be petascale, needs the storage space and processing power of the same supercomputers used for the simulations. In this dissertation, we design, implement, and evaluate parallel visualization pipelines using high-performance parallel supercomputers. We carefully study the interplay between data representation, storage organization, hardware architecture, access pattern of a variety visualization operations, user interaction, and application requirement. A set of effective methods is presented, eliminating the key bottlenecks that arise in interprocessor communication, data partition and distribution, data transferring, and data preprocessing. The feasibility and scalability of our approaches have been demonstrated with a performance study using thousands of processors on different supercomputer systems. Our approaches have been applied to effectively and efficiently visualize several scientific simulations, from earthquake modeling to supernova evolution, at the highest resolution to date. This high-performance parallel visualization capability significantly enhances scientists' power to explore and understand large, complex, time-varying volume data.
Means of question-answer interaction for collaborative development activity
Authors: Petr Sosnin
Venue: Advances in Human-Computer Interaction (2009)

The key problem of successful developing of the software intensive system (SIS) is adequate conceptual interactions of stakeholders at the early stages of designing. Nowadays the success of development is extremely low. It can be increased with using artificial intelligence (AI) means including models of reasoning supported by the human-computer interaction in collaborative development activity. In this paper, a number of question-answer means for modeling reasoning are suggested. Such kind of means is defined and implemented in order to get effects of integrating the collective reasoning for their positive influence on the intellectual activity of designers. Question-answer means are arranged as a specialized processor opening the possibility to question-answer programming of the tasks on the conceptual stage of designing. Suggested and investigated means can be used for solving any complicated task.
Text Disambiguation by Educable AI System
Authors: Alexander Voskresenskij
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

The structure of possible text understanding system is discussed. To store concepts and knowledge system uses multilayer ontology based on pragmatic memory model. The way of knowledge searching for system education is described. Main aim of project is development of system for translating text into sign language phrases.
Mathematical model for determination of the abrasive wheel profile for helicall drills manufacturing
Authors: Calin Mutiu, Paul Dan Brindasu, Livia Dana Beju
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

This paper presents an analytical methodology for determining the profile of the abrasive wheels, which are necessary to manufacture special carbide drills. These drills have the helical flutes for chips removal with a special shape in order to allow an easy elimination of the chips. The designer gives the shape of the helical flute as sum of points, with a certain density, which describes the complex shape in a cross section on the axis of the cylindrical part. The principle of the method is to project the points from the profile of the channel on a helical trajectory and to establish finally the points from the cutting area of the abrasive disc. The method is analytic and allows computer programming. The profiles can be verified by simulation.
A memetic framework for describing and simulating spatial prisoner's dilemma with coalition formation
Authors: Juan C. Burguillo-Rial
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner's dilemma with coalition formation. The agent interaction is described by a non-iterated game, where each agent only locally interacts with its neighbours. Every agent may behave as a defector or a cooperator when playing isolated, but they can join or lead coalitions (group of agents) where a leader decides the coalition strategy. Isolated agents' strategies or groups' strategies are public and therefore can be memetically imitated by neighbours. The agent strategy is selected between two possibilities: probabilistic Tit-for-Tat (pTFT) or learning automata (LA). Coalition dynamics are organized around two axes. On the one hand, agents get a percentage of compromise when cooperating with other agents. On the other hand, leaders impose taxes to the other agents belonging to its coalition. These two rules and their related parameters guide the coalition formation and the game evolution. The main contribution of the paper is the framework for memetic analysis of coalition formation in spatial prisoner's dilemma. This work also includes simulation results on a lattice showing that the pTFT memetic approach becomes more effective than an isolated learning policy.
Secure Pairing of "Interface-Constrained" Devices Resistant against Rushing User Behavior
Authors: Nitesh Saxena, Md. Borhan Uddin
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

"Secure Device Pairing" is the process of bootstrapping secure communication between two devices over a short- or medium-range wireless channel (such as Bluetooth, WiFi). The devices in such a scenario can neither be assumed to have a prior context with each other nor do they share a common trusted authority. Fortunately, the devices can generally be connected using auxiliary physical channel(s) (such as audio, visual, tactile) that can be authenticated by the device user(s), thus forming the basis for pairing. However, lack of good quality output interfaces (e.g, a speaker, display) and/or receivers (e.g., microphone, camera) on certain devices makes pairing a very challenging problem in practice.We consider the problem of "rushing user" behavior in device pairing. A rushing user is defined as a user who in a rush to connect her devices, would skip through the pairing process, if possible. Most prior pairing methods, in which the user decides the final outcome of pairing, are vulnerable to rushing user behavior --- the user can simply "accept" the pairing, without having to correctly take part in the decision process. In this paper, we concentrate on most common pairing scenarios (such as pairing of a WiFi laptop and an access point), whereby one device (access point) is constrained in terms output interfaces, while the other (laptop) has a decent quality output interface but no receiver. We present the design and usability analysis of two novel pairing methods, which are resistant to a rushing user and require only minimal device interfaces on the constrained device. One of the most appealing applications of our proposal is in defending against common threat of "Evil Twin" attacks in public places (e.g, cyber-cafes, airport lounges).