ppxscal/embedding_network huggingface dataset:
A Complex Systems Based Tool for Collective Robot Behavior Emergence and Analysis
Authors: Abraham Prieto, Francisco Bellas, Pilar Caamaño, Richard J. Duro
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper presents a Complex Systems Theory based methodology and tool for the automatic design of multiagent or multirobot collective behaviors for the optimized execution of a given task. The main goal of this methodology is the representation of a generic task to be optimally performed in a Complex Systems simulator called WASPBED and the subsequent analysis of the emergent states thus obtained. This way, by tweaking environmental parameters in the system, the behaviors of the different collective behaviors obtained can be studied. The example used to test the methodology deals with collective behaviors for optimized routing in unknown environments.
New Tracing and Performance Analysis Techniques for Embedded Applications
Authors: Shih-Hao Hung, Shu-Jheng Huang, Chia-Heng Tu
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Performance evaluation is key to many computer applications. Many techniques and profiling tools are available for measuring performance, but most of them depend on the hardware and the software on which they run. For a new platform, or a platform which is not popular, programmers usually suffer from few analysis tools, which has been a serious problem for application development on many embedded systems. Thus, a performance analysis tool with the software mechanism is quite important for developing embedded applications. This paper describes a software mechanism for analyzing program performance on a wide range of platforms via code instrumentation at the source level. We implement this mechanism in a pure software profiling toolkit, called Module tracer, which works with a public-domain tool, CIL, to carry out code instrumentation for C programs. The toolkit aids programmers in understanding the behavior of applications by generating and analyzing traces and identify potential performance problems.
Incremental Nonlinear Proximal Support Vector Machine
Authors: Qiuge Liu, Qing He, Zhongzhi Shi
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Proximal SVM (PSVM), which is a variation of standard SVM, leads to an extremely faster and simpler algorithm for generating a linear or nonlinear classifier than classical SVM. An efficient incremental method for linear PSVM classifier has been introduced, but it can't apply to nonlinear PSVM and incremental technique is the base of online learning and large data set training. In this paper we focus on the online learning problem. We develop an incremental learning method for a new nonlinear PSVM classifier, utilizing which we can realize online learning of nonlinear PSVM classifier efficiently. Mathematical analysis and experimental results indicate that these methods can reduce computation time greatly while still hold similar accuracy.
Understanding parkinsonian handwriting through a computational model of basal ganglia
Authors: Garipelli Gangadhar, Denny Joseph, V. Srinivasa Chakravarthy
Venue: Neural Computation (2008)

Handwriting in Parkinson's disease (PD) is typically characterized by micrographia, jagged line contour, and unusual fluctuations in pen tip velocity. Although PD handwriting features have been used for diagnostics, they are not based on a signaling model of basal ganglia (BG). In this letter, we present a computational model of handwriting generation that highlights the role of BG. When PD conditions like reduced dopamine and altered dynamics of the subthalamic nucleus and globus pallidus externa subsystems are simulated, the handwriting produced by the model manifested characteristic PD handwriting distortions like micrographia and velocity fluctuations. Our approach to PD modeling is in tune with the perspective that PD is a dynamic disease.
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
Authors: Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

This paper shows undecidability of type-checking and type-inference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragment, and an implicational fragment. These are proved by reducing type-checking and type-inference problems of the domain-free polymorphic typed lambda-calculus to those of the lambda-calculi with existential types by continuation passing style translations.
Understanding the Determinants of Mobile Viral Effects-Towards a Grounded Theory of Mobile Viral Marketing
Authors: Dietmar G. Wiedemann, Wolfgang Palka, Key Pousttchi
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

Although there is some evidence on the usefulness of mobile viral marketing from marketers' perspective, little is known about the motivations, attitudes, and behaviors of consumers engaged in this marketing instrument. In this paper, we present the findings of a grounded theory study and focus on determining why a mobile viral effect occurs. The proposed framework helps researchers and marketers to better understand the critical components of mobile viral marketing and provides ideas for further research in this emerging field.
Efficient Top-k Data Sources Ranking for Query on Deep Web
Authors: Derong Shen, Meifang Li, Ge Yu, Yue Kou, Tiezheng Nie
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Efficient Query processing on deep web has been gaining great importance due to large amount of deep web data sources. Nevertheless, how to discover the most relevant data sources on deep web is still a challenging issue. Inspired by observations on deep web, the paper presents a novel top-k ranking strategy to rank relevant data sources according to user's requirement. First, it applies an attribute based dominant pattern growth (ADP-growth) algorithm to mine the most dominant attributes, and then employs a top-k style ranking algorithm on those attributes to exploit the most relevant data sources with candidate pruning and early termination, which considers the probability of result merging. Further, it improves the algorithm by incorporating relevant attributes based searching strategy to find the data sources, which has been proved of higher efficiency. We have conducted extensive experiments on a real world dataset and demonstrated the efficiency and effectiveness of our approach.
Cross-layer interference alleviation in wireless networks: measurements, models and protocols
Authors: Srikanth Krishnamurthy
Venue:  (2007)

Providing robust, high-speed connectivity has become a requirement for wireless network deployments nowadays. Different wireless technologies, such as IEEE 802.11 and Ultra Wide Band (UWB), have been adopted to fulfill this requirement. For such networks to operate efficiently, the MAC and PHY layer implementations need to be designed in conjunction, since PHY layer phenomena affect the performance at the MAC layer. In particular, since devices of the same wireless technology share a common bandwidth, they typically interfere with each other, especially in highly dense deployments. Additionally, various other channel effects such as multipath shadowing, signal attenuation and delay spread also contribute to interference power and contribute to the degradation of network performance. In today's deployments, however, the PHY-MAC interplay may not be efficient, since the MAC design does not always take lower-layer dependencies into account. In this dissertation, we first evaluate the causes of interference due to the interdependencies between MAC and PHY. Furthermore, we design, implement and evaluate new MAC protocols and performance improvement frameworks, which take into account the inherent behavior of the MAC/PHY coupling. More specifically, we quantify the impact of interference on the network operations, for two different wireless technologies, namely the 802.11 and the UWB. We capture and analyze the network design aspects that determine the levels of interference. These aspects include topological and environmental characteristics, channel implementation parameters, as well as MAC/scheduling parameter-tuning for the different wireless technologies. Based on our observations, we propose interference mitigation methodologies for both 802.11 and UWB networks. We design new, multiband MAC protocols for UWB that take into consideration the inherent properties of the pulse-based channel implementation. Our MAC protocols manage to alleviate interference and utilize the available spectrum efficiently. We implement analytical frameworks and a simulator in order to model the network behavior and evaluate our multiband MAC protocols for UWB. Furthermore, we also design and implement a measurement-driven framework, which provides guidelines for applying frequency selection, user association and power control, in order to mitigate interference in practice, for 802.11 deployments. In order to validate our framework, we develop two different manageable, large scale 802.11 wireless testbeds. We show that our framework for 802.11 WLANs provides the highest performance benefit, as compared to other approaches. All our proposed schemes manage to alleviate the effects of interference to the extent possible, so as for nodes to exchange traffic efficiently.
Where Have You Ended Up Today? Dynamic TV and the Inter-tainment Paradigm
Authors: Rossana Simeoni, Marina Geymonat, Elena Guercio, Monica Perrero, Amon Rapp, Francesco Tesauri, Roberto Montanari
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

Traditional TV was based on a time-dependent and passive paradigm of use: the availability of audiovisual contents was pre-defined by a rigid scheduling, and user's role was to choose among limited alternatives. A potential for active TV experience is now available: users should be allowed to access contents that fit their attitudes at any time, while being encouraged to discover new domains of interest. This paper outlines the basic elements of the new Inter-tainment paradigm, which builds on an active role of the user and on attitude-centred fruition. Successful applications of the new paradigm require flexible and reconfigurable structures of navigation: the development stages of an Inter-tainment system are reported here.
From Church and Prior to PSL
Authors: Moshe Y. Vardi
Venue: 25 Years of Model Checking: History, Achievements, Perspectives (2008)

One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard property-specification language called PSL. This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for second-order arithmetics, into effective algorithms for model-checking tools. This paper attempts to trace the tangled threads of this development.
Algorithms for shortest paths and visibility polygons in r2
Authors: Sanjiv Kapoor
Venue:  (2007)

The Euclidean Shortest Path problem in R 2 can be stated as - given a collection of obstacles, find a Euclidean shortest obstacle-avoiding path between two given points. This fundamental problem is listed as part of The Open Problems Project (TOPP) of Computational Geometry. This research provides an algorithm with O( n + m lg2 n) time and O( n) space. Throughout the thesis, n represents the number of vertices in the given polygonal region with obstacles, m is the number of obstacles, and, O(T) is the time to triangulate the polygonal region which is of O( n + m lg1+&epsis; m) (for a small positive constant &epsis;). The bound achieved is close to the lower bound of &Omega;(n + m lg m). The Rectilinear Shortest Path problem requires finding a shortest path with rectilinear (L1) metric such that the shortest path does not intersect with any of the m non-intersecting obstacles in the given polygonal region. The solution provided in this thesis gives an algorithm with time complexity O( T + m(lg n)3/2), which is close to the lower bound of &Omega;(n + m lg m). The Weighted Euclidean Shortest Path problem in R2 can be described as - find an Euclidean shortest path from a source s to a sink t in the polygonal region where the obstacles are associated with weights. Unlike the last two problems, the shortest path is allowed to traverse across the weighted obstacles in the polygonal region. We present an algorithm with O (n6 lg &parl0;Ke'&parr0; + n5 + n4 lg &parl0;Wwe'&parr0; ) time complexity. Here &epsis;' = ecn&parl0;n2+LW&parr0; , K is a constant, cn is the number of vertices, w is the minimum weight, W is the maximum weight, and L is the maximum length of any edge. Our algorithm time complexity is better than any polynomial time algorithm, and, it is better than any known pseudo-polynomial time algorithm whenever N2e > n5. Further, we present an output-sensitive algorithm for finding the Visibility Polygon of a query point located inside a given polygonal region with polygonal holes. We provide two bounds on the complexity of this problem. One approach constructs a data structure with space complexity O(n2) with pre-processing time O(n2) and yields a query time of O((1 + min(m, |V( q)|)) lg2 n + m + |V( q)|). Here, V(q) represents the set of vertices of the visibility polygon of a query point q, |E| denotes the number of edges in the visibility graph. The other approach provides a data structure with space complexity O(min(|E|, mn) + n) and pre-processing time O( T + |E| + n lg n) with the query time of O(|V(q)| lg n + m). The preprocessing time and space of our algorithm using either of these approaches improves upon the existing algorithms. The query time is competitive with the previous methods when there are either a small constant number of holes or |V(q)| &ge; m. In both of these approaches, with the additional O(( min(|E|, mn))2) space both the space and query complexities found to be superior and competitive respectively to previous methods whenever n > m 2.
Evolutionary Decision Support System for Stock Market Trading
Authors: Piotr Lipinski
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

This paper proposes a decision support system for stock market trading, which is based on an evolution strategy algorithm applied to construct an efficient stock market trading expert built as a weighted average of a number of specific stock market trading rules analysing financial time series of recent price quotations. Although applying separately, such trading rules, which come from practictioner knowledge of financial analysts and market investors, give average results, combining them into one trading expert leads to a significant improvement and efficient investment strategies. Experiments on real data from the Paris Stock Exchange confirm the financial relevance of investment strategies based on such trading experts.
Timed Mobile Ambients for Network Protocols
Authors: Bogdan Aman, Gabriel Ciobanu
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

Ambient calculus is a calculus for mobile computing able to express local communications inside hierarchical domains. So far the timing properties have not been considered in the framework of mobile ambients. We add timers to capabilities and ambients, and provide an operational semantics of the new calculus. Certain results are related to the passage of time, and some new behavioural equivalences over timed mobile ambients are defined. Timeout for network communication (TTL) can be naturally modelled by the time constraints over capabilities and ambients. The new formalism can be used to describe network protocols; Simple Network Management Protocol (SNMP) may implement its own strategy for timeout and retransmission in TCP/IP.
Formal Methods for Trustworthy Skies: Building Confidence in the Security of Aircraft Assets Distribution
Authors: Scott Lintelman, Richard Robinson, Mingyan Li, Krishna Sampigethaya
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

A recent application in commercial aviation is the electronic distribution of loadable software parts and data. Its safe and beneficial use, however, warrants that information security vulnerabilities are analyzed and mitigated at an adequate assurance level. In our prior work, we have identified security threats and assurance requirements for a generic aircraft asset distribution system or AADS. In this paper, we focus on supporting analytical processes to address security vulnerabilities as well as describing our experiences in applying formal methods to AADS.
Discriminant Analysis with Label Constrained Graph Partition
Authors: Peng Guan, Yaoliang Yu, Liming Zhang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, a space partition method called "Label Constrained Graph Partition" (LCGP) is presented to solve the Sample-Interweaving-Phenomenon in the original space. We first divide the entire training set into subclasses by means of LCGP, so that the scopes of subclasses will not overlap in the original space. Then "Most Discriminant Subclass Distribution" (MDSD) criterion is proposed to decide the best partition result. At last, typical LDA algorithm is applied to obtain the feature space and the RBF neural network classifier is utilized to make the final decision. The computer simulations and comparisons are given to demonstrate the performance of our method.
Keeping a digital library clean: new solutions to old problems
Authors: Alberto H.F. Laender, Marcos André Gonçalves, Ricardo G. Cota, Anderson A. Ferreira, Rodrygo L.T. Santos, Allan J.C. Silva
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

Digital Libraries are complex information systems that involve rich sets of digital objects and their respective metadata, along with multiple organizational structures and services (e.g., searching, browsing, and personalization), and are normally built having a target community of users with specific interests. Central to the success of this type of system is the quality of their services and content. In the context of DLs of scientific literature, among the many problems faced to sustain their information quality, two specific ones, related to information consistency, have taken a lot of attention from the research community: name disambiguation and lack of information to access the full-text of cataloged documents. In this paper, we examine these two problems and describe the solutions we have proposed to solve them.
An optimised publish/subscribe middleware for peer-to-peer systems
Authors: Antonio Javier Garcia-Sanchez, Felipe Garcia-Sanchez, Pablo Pavon-Marino, Joan Garcia-Haro
Venue: International Journal of Communication Networks and Distributed Systems (2008)

The publish/subscribe paradigm provides a very effective and reliable scheme to implement Peer-To-Peer (P2P) networks. In these systems, the reduction of the number of messages associated to the searching procedure is a crucial issue. In this paper, we study the current publish/subscribe systems and propose an Optimised Middleware (OMCPS), suitable for the implementation of large-scale content delivery systems. The main idea behind our proposal is to reduce the conventional message distribution and searching process by using a well-known decentralised algorithm (the Chord). In addition, the internal OMCPS organisation among the Servers that conforms the P2P system is transparent to the consumer and supplier applications.
Computational Probability for Systems Biology
Authors: Werner Sandmann, Verena Wolf
Venue: Proceedings of the 1st international workshop on Formal Methods in Systems Biology (2008)

Stochastic models of biological networks properly take the randomness of molecular dynamics in living cells into account. Numerical solution approaches inspired by computational methods from applied probability can efficiently yield accurate results and have significant advantages compared to stochastic simulation. Examples for the success of non-simulative numerical analysis techniques in systems biology confirm the enormous potential.
Error resilient wavelet video transmission with priority area protection using Wyner-Ziv coding
Authors: Zhuo Xue, K. K. Loo, J. Cosmas, P. Y. Yip
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

In this paper, an efficient error resilience scheme aiming to give priority protection to certain area such as region of interest (ROI) in frame based on Wyner-Ziv(WZ) coding for wavelet based video transmission is proposed. By utilizing additional WZ coding, all the corresponding wavelet coefficients related to ROI will be specially protected during transmission on error prone channel and eventually ROI area can be better reconstructed. Comparing to FEC algorithm fully applied to all wavelet coefficients to realize protection, the proposed scheme has distinct advantages in saving bandwidth and robust transmission.
Early fault detection with model-based testing
Authors: Jonas Boberg
Venue: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG (2008)

Current and future trends for software include increasingly complex requirements on interaction between systems. As a result, the difficulty of system testing increases. Model-based testing is a test technique where test cases are generated from a model of the system. In this study we explore model-based testing on the system level, starting from early development. We apply model-based testing to a subsystem of a message gateway product in order to improve early fault detection. The results are compared to another subsystem that is tested with hand-crafted test cases. Based on our experiences, we present a set of challenges and recommendations for system-level, model-based testing. Our results indicate that model-based testing, starting from early development, significantly increases the number of faults detected during system testing.
Supporting continuous mobility through multi-rate wireless packetization
Authors: Arunesh Mishra, Shravan Rayanchu, Dheeraj Agrawal, Suman Banerjee
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

Continuous mobility scenarios are those in which applications continue to use the radio interface while on the move. With the emergence of Voice-over-WiFi phones, WiFi-enabled music players, and many other such gadgets, continuous mobility is becoming a prevalent mode of operation for WiFi standards. We contend that the existing packetization structures employed in WiFi devices, is not the most suitable for these emerging class of continuous mobility applications. Therefore, in this paper, we suggest a new software-level, standards-compliant extension to the WiFi packetization techniques that provides greater agility and improved performance. In particular, we propose the notion of a multi-rate wireless packet, in which different segments of the same Protocol Data Unit (PDU) are modulated at different physical transmission rates. This is a departure from conventional modulation mechanisms in which the entire PDU is modulated using a single rate. In this paper, we (i) discuss some uses of such a packetization structure for continuous mobility applications, (ii) describe a practical approach to implementing multi-rate wireless packetization in the 802.11 context as a software-only modification that directly leverages current PHY and MAC layer implementations, and (iii) demonstrate the benefits of such an approach with some simple evaluation. We conclude by discussing some of the next steps needed to realize the full potential of this notion.