ppxscal/embedding_network huggingface dataset:
The CLEAR 2007 Evaluation
Authors: Rainer Stiefelhagen, Keni Bernardin, Rachel Bowers, R. Travis Rose, Martial Michel, John Garofolo
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

This paper is a summary of the 2007 CLEAR Evaluation on the Classification of Events, Activities, and Relationships which took place in early 2007 and culminated with a two-day workshop held in May 2007. CLEAR is an international effort to evaluate systems for the perception of people, their activities, and interactions. In its second year, CLEAR has developed a following from the computer vision and speech communities, spawning a more multimodal perspective of research evaluation. This paper describes the evaluation tasks, including metrics and databases used, and discusses the results achieved. The CLEAR 2007 tasks comprise person, face, and vehicle tracking, head pose estimation, as well as acoustic scene analysis. These include subtasks performed in the visual, acoustic and audio-visual domains for meeting room and surveillance data.
An SMT Approach to Bounded Reachability Analysis of Model Programs
Authors: Margus Veanes, Nikolaj Bjørner, Alexander Raschke
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

Model programs represent transition systems that are used to specify expected behavior of systems at a high level of abstraction. The main application area is application-level network protocols or protocol-like aspects of software systems. Model programs typically use abstract data types such as sets and maps, and comprehensions to express complex state updates. Such models are mainly used in model-based testing as inputs for test case generation and as oracles during conformance testing. Correctness assumptions about the model itself are usually expressed through state invariants. An important problem is to validate the model prior to its use in the above-mentioned contexts. We introduce a technique of using Satisfiability Modulo Theories or SMT to perform bounded reachability analysis of a fragment of model programs. We use the Z3 solver for our implementation and benchmarks, and we use AsmL as the modeling language. The translation from a model program into a verification condition of Z3 is incremental and involves selective quantifier instantiation of quantifiers that result from the comprehension expressions.
A New Problem-Solving Method for Multi-agent Systems and Computer Networks: Solitary Wave Propagation
Authors: Dianxun Shuai
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

A new problem-solving method for multi-agent systems and computer networks is proposed, which transforms the problem-solving process into the parallel solitary wave propagation process in non-linear space.This paper discusses the basic principle of the solitary wave method and proves its properties theoretically. Due to the paper length limitation, the algorithm based on solitary waves and simulations are given in other related papers. The theoretical analysis and practical experiments show the advantages of the proposed method in terms of the high-degree parallelism, the suitability for complex environment, and the powerful processing ability.
How Good Is the Backpropogation Neural Network Using a Self-Organised Network Inspired by Immune Algorithm (SONIA) When Used for Multi-step Financial Time Series Prediction?
Authors: Abir Jaafar Hussain, Dhiya Al-Jumeily
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, a novel application of the backpropagation network using a self-organised layer inspired by immune algorithm is used for the prediction of financial time series. The simulations assess the data from two time series: Firstly the daily exchange rate between the US dollar and the Euro for the period from the 3rd January 2000 until the 4th November 2005, giving approximately 1525 data points. Secondly the IBM common stock closing price for the period from the 17th May 1961 until the 2nd November 1962, establishing 360 trading days as data points. The backpropagation network with the self-organising immune system algorithm produced an increase in profits of approximately 2% against the standard back propagation network, in the simulation, for the prediction of the IBM common stock price. However there was a slightly lower profit for the US dollar/Euro exchange rate prediction.
A Layered Decision Model for cost-effective system security
Authors: Huaqiang Wei, Jim Alves-Foss, Terrence Soule, Hugh Pforsich, Du Zhang, Deborah Frincke
Venue: International Journal of Information and Computer Security (2008)

System security involves decisions in at least three areas: identification of well-defined security policies, selection of cost-effective defence strategies, and implementation of real-time defence tactics. Although choices made in each of these areas affect the others, existing decision models typically handle these three decision areas in isolation. There is no comprehensive tool that can integrate them to provide a single efficient model for safeguarding a network. In addition, there is no clear way to determine which particular combinations of defence decisions result in cost-effective solutions. To address these problems, this paper introduces a Layered Decision Model (LDM) for use in deciding how to address defence decisions based on their cost-effectiveness. To validate the LDM and illustrate how it is used, we used simulation to test model rationality and applied the LDM to the design of system security for an e-commercial business case.
Reasoning about Hand-Drawn Sketches: An Approach Based on Intelligent Software Agents
Authors: Giovanni Casella, Vincenzo Deufemia, Viviana Mascardi, Maurizio Martelli, Genoveffa Tortora
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

Sketching is a powerful means to represent objects and reason on them. In this paper we describe an integrated environment, conceived as a multi agent system, that brings together sketch recognition functionalities and decision support facilities. In this environment, intelligent agents are exploited both for managing the process of recognition of the sketched objects, and for supporting users in solving decisional problems. We explain our approach and its potential by means of a running example taken from the domain of building's safety.
When Does Partial Commutative Closure Preserve Regularity?
Authors: Antonio Cano Gómez, Giovanna Guaiana, Jean-Éric Pin
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

The closure of a regular language under commutation or partial commutation has been extensively studied [1,11,12,13], notably in connection with regular model checking [2,3,7] or in the study of Mazurkiewicz traces, one of the models of parallelism [14,15,16,22]. We refer the reader to the survey [10,9] or to the recent articles of Ochmański [17,18,19] for further references.
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
Authors: László Egri, Benoît Larose, Pascal Tesson
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We show that the directed st-connectivity problem cannot be expressed in symmetric Datalog, a fragment of Datalog introduced in [5]. It was shown there that symmetric Datalog programs can be evaluated in logarithmic space and that this fragment of Datalog captures logspace when augmented with negation, and an auxiliary successor relation S together with two constant symbols for the smallest and largest elements with respect to S. In contrast, undirected st-connectivity is expressible in symmetric Datalog and is in fact one of the simplest examples of the expressive power of this logic. It follows that undirected non-st-connectivity can be expressed in restricted symmetric monotone Krom $\operatorname{SNP}$, whereas directed non-st-connectivity is only definable in the more expressive restricted monotone Krom $\operatorname{SNP}$. By results of [8], the inexpressibility result for directed st-connectivity extends to a wide class of homomorphism problems that fail to meet a certain algebraic condition.
Comparison of Feature Reduction Methods in the Text Recognition Task
Authors: Jerzy Sas, Andrzej Zolnierek
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In this paper two level model of handwritten word recognition is considered. On the first level the consecutive letters are recognized by the same classifier using preprocessed data from the optical device, while on the second level we try to recognize the whole word. From the other point of view we can treat the first level as a feature reduction level. Then, in this paper two different methods of feature reduction for handwritten word recognition algorithm are described. On the lower level different well-known in the literature methods are taken into account (for example multi layer perceptron, k-NN algorithm). The results of classification from the first level serve as a feature for the second level and two different cases are considered. The first one consist in taking into account the crisp result of classification from the first level while in the second approach we take into account the support vector of decision on this level. On the second level, in order to improve the word recognition accuracy, for both methods, the Probabilistic Character Level Language Model was applied. In this model, the assumption of first-order Markov dependence in the sequence of characters was made. Moreover, we comment the possibility of using Markov model in forward and backward directions. For both methods of feature reduction the appropriate word recognition algorithms are presented. In order to find the best solution, the Viterbi algorithm is used. A number of experiments were carried out to test the properties of the proposed methods of feature reduction. The experiment results are presented and concluded in the end of the paper.
High-Speed Matching of Vulnerability Signatures
Authors: Nabil Schear, David R. Albrecht, Nikita Borisov
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Vulnerability signatures offer better precision and flexibility than exploit signatures when detecting network attacks. We show that it is possible to detect vulnerability signatures in high-performance network intrusion detection systems, by developing a matching architecture that is specialized to the task of vulnerability signatures. Our architecture is based upon: i) the use of high-speed pattern matchers, together with control logic, instead of recursive parsing, ii) the limited nature and careful management of implicit state, and iii) the ability to avoid parsing large fragments of the message not relevant to a vulnerability.We have built a prototype implementation of our architecture and vulnerability specification language, called VESPA, capable of detecting vulnerabilities in both text and binary protocols. We show that, compared to full protocol parsing, we can achieve 3x or better speedup, and thus detect vulnerabilities in most protocols at a speed of 1 Gbps or more. Our architecture is also well-adapted to being integrated with network processors or other special-purpose hardware. We show that for text protocols, pattern matching dominates our workload and great performance improvements can result from hardware acceleration.
Topic 9: Parallel and Distributed Programming
Authors: José Nelson Amaral, Joaquim Gabarró
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

The Parallel and Distributed Programming Topic, Topic 9, is concerned with the development of parallel or distributed applications. Developing such applications is a hard task and it requires advanced algorithms, realistic modeling, efficient design tools, high performance languages and libraries, and experimental evaluation. This topic provides a forum for presentation of new results and practical experience in this domain. It emphasizes research that facilitates the design and development of correct, high-performance, portable, and scalable parallel program. Related to these central needs, this Topic also includes contributions that assess methods for reusability, performance prediction, large-scale deployment, self-adaptivity, and fault-tolerance.
The VLSI Control Structure of a CMOS Microcomputer
Authors: Hideo Maejima, Koyo Katsura, Hideo Nakamura, Toshimasa Kihara
Venue: IEEE Micro (1983)

By implementing novel microprogram control structures in CMOS, the designers of the 8-bit HD-6301 achieved high performance and low power consumption.
A Comparison of the Object-Oriented Features of Ada 2005 and JavaTM
Authors: Benjamin M. Brosgol
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

Ada 2005 and Java offer comparable Object-Oriented Programming ("OOP") support, but exhibit significant differences in both their general philosophies and their specific features. Each language allows the programmer to define class inheritance hierarchies (including a limited form of multiple inheritance through "interfaces") and to employ encapsulation, polymorphism, and dynamic binding. Whereas OOP forms the foundation of Java's semantic model, OOP in Ada is largely orthogonal to the rest of the language. In Java it is difficult to avoid using OOP; in Ada OOP is brought in only when explicitly indicated in the program. Java is a "pure" OO language in the style of Smalltalk, with implicit pointers and implementation-provided garbage collection. Ada is a methodology-neutral OO language in the manner of C++, with explicit pointers and program-specified storage reclamation. Java uses OOP to capture the functionality of exception handling, multi-threading, enumeration types, and other facilities that are not necessarily related to object orientation. Ada supplies specific features for such functionality, independent of its OO model. Java is oriented towards manipulating dynamic data structures. Ada offers more opportunities for optimization and run-time efficiency, and greater flexibility in the choice of programming styles.
Interconnecting eyeballs to content: a shapley value perspective on isp peering and settlement
Authors: Richard T.B. Ma, Dah-ming Chiu, John C. S. Lui, Vishal Misra, Dan Rubenstein
Venue: Proceedings of the 3rd international workshop on Economics of networked systems (2008)

Internet service providers (ISPs) must interconnect to provide global Internet connectivity to users. The payment structure of these interconnections are often negotiated and maintained via bilateral agreements. Current differences of opinion in the appropriate revenue model in the Internet has on occasion caused ISPs to de-peer from one another, hindering network connectivity and availability. Our previous work demonstrates that the Shapley value has several desirable properties, and that if applied as the revenue model, selfish ISPs would yield globally optimal routing and interconnecting decisions. In this paper, we focus our investigation of Shapley value in networks with two basic classes of ISP: content and eyeball. In particular, we analyze the revenue distribution between ISPs with elastic and inelastic customer demands, and calculate the bilateral payments between ISPs that implement the Shapley revenue. Our results illustrate how ISP revenues are influenced by different demand models. In particular, the marginal revenue lost by de-peering for an eyeball ISP with inelastic demand is inversely proportional to the square of its degree of connectivity to content ISPs. In practice, these results provide a guideline for ISPs, even in peering relationships, to negotiate bilateral payments and for regulatory institutions to design pricing regulations.
Sensitive Braille Displays with ATC Technology (Active Tactile Control) as a Tool for Learning Braille
Authors: Siegfried Kipke
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The Idea of a Sensitive Braille DisplayAccess to computers for blind users can be provided with speech and/or Braille output. A Braille display providing Braille output can interact with the computer. In order to be able to use a Braille display as an effective control unit for the computer is was the goal to create a sensitive Braille display which can detect the tactile reading position of the blind user. The research of how to detect the tactile reading position on a Braille display has lead to the invention of ATC (Active Tactile Control). New tools based on ATC for can be created for interactive learning, monitoring the learning process as well as assistance functions.
Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1
Authors: Jonas Mockus
Venue: Informatica (2006)

The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the second. They help each other in many ways. We investigate the joint influence of both. Results of complexity theory show the limitations of exact analysis. That explains popularity of heuristic algorithms. It is well known that efficiency of heuristics depends on the parameters. Thus we need some automatic procedures for tuning the heuristics. That helps comparing results of different heuristics. This enhance their efficiency, too. An initial presentation of the basic ideas is in (Mockus, 2000). Preliminary results of distance graduate studies are in (Mockus, 2006a). Examples of optimization of sequential statistical decisions are in (Mockus, 2006b). In this paper the theory and applications of Bayesian Heuristic Approach are discussed. In the next paper examples of Bayesian Approach to automated tuning of heuristics will be regarded. The examples of traditional methods of optimization including applications of linear and dynamic programming will be investigated in the last paper. These papers represents three parts of the same work. However each part can be read independently. All the algorithms are implemented as platform independent Java applets or servlets. Readers can easily verify and apply the results for studies and for real life optimization models. The information is on the main web-site http://pilis.if.ktu.lt/&sim;jmockus and four mirrors.
GCS with Real-Valued Input
Authors: Lukasz Cielecki, Olgierd Unold
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

The new learning classifier system is described to classify real-valued data. The approach applies the continous-valued context-free grammar based system GCS. In order to handle effectively, the terminal rules have been replaced by the so-called environment probing rules. The rGCS model has been tested on the checkerboard problem.
AssessGrid Strategies for Provider Ranking Mechanisms in Risk---Aware Grid Systems
Authors: Dominic Battré, Karim Djemame, Iain Gourlay, Matthias Hovestadt, Odej Kao, James Padgett, Kerstin Voss, Daniel Warneke
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

Grid systems are on the verge of attracting the commercial user who requires contractually fixed levels of service quality. Service Level Agreements (SLAs) are powerful instruments for describing all obligations and expectations within such a Grid-based business relationship. Service selection has so far been based on performance and compatibility criteria while neglecting the factor of reliability and risk.The EC-funded project "AssessGrid" aims at introducing risk assessment and management as a novel decision paradigm into Grid computing. With AssessGrid, providers are able to express the risk associated with an SLA, and broker services are able to judge the trustworthiness of such provider risk statements. This paper focuses on the provider ranking process where a broker or end-user has to decide which provider to choose from, and consequently which SLA to commit to.
An Interaction Model for the Quantification of Haptic Impressions
Authors: Thorsten A. Kern, Albert Schaeffer, Roland Werthschützky
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

At the present, it is impossible to identify a defined set of quantified parameters which describe the haptic sensation felt when interacting with physical objects. Literature describes haptic properties like shape, texture or the passivity of an interaction, however quantitative values being used in independent experiments do hardly exist. This fact gives the central reason why in haptic science --- in contrast to scientific research for the visual sense or the sense of hearing --- no measurement technology has yet been established to compare the haptic properties of different objects and devices among each other. The purpose of this paper is to make a suggestion for a model offering both: a quantification of haptic interaction and an approach to measure haptic sensation.The document starts with a discussion about the properties of haptic sensations from a technical viewpoint. A model of haptic interaction is given as established as a working hypothesis at the authors' institution. The components of the model are explained and the mathematical background is formulated. A method to quantify haptic impression derived from the usage of the model is presented. An example of the application of the model is shown and a forecast on the chances of this approach is given. The paper closes with a look at the ongoing work on the model and the method.
On Taylor's formula for the resolvent of a complex matrix
Authors: Matthew X. He, Paolo E. Ricci
Venue: Computers Mathematics with Applications (2008)

The resolvent R"@l(A) of a complex rxr matrix A is an analytic function in any domain with empty intersection with the spectrum @S"A of A. The well known Taylor expansion of R"@l(A) in a neighborhood of any given @l"0@?@S"A is modified taking into account that only the first powers of R"@l"""0(A) are linearly independent. The main tool in this framework is given by the multivariable polynomials F"k","n(v"1,v"2,...,v"r)(n=-1,0,1,...;k=1,2,...,m@?r) depending on the invariants v"1,v"2,...,v"r of R"@l(A) (m denotes the degree of the minimal polynomial). These functions are used in order to represent the coefficients of the subsequent powers of R"@l"""0(A) as a linear combination of the first m of them.
Measuring the edge-to-edge available bandwidth in a DiffServ domain
Authors: N. Blefari-Melazzi, M. Femminella
Venue: International Journal of Network Management (2008)

The new Internet will be deployed with a number of tools for network management and quality of service control. To this end, we focus on a single administrative domain based on the Differentiated Services architectural model, and we recognize the need for two main functions for each supported traffic class: an admission control procedure, and a monitoring of the edge-to-edge bandwidth availability. In this work, we specifically focus on the second issue. To preserve scalability and thus to be compliant with Differentiated Services architecture, we propose stateless and distributed procedures based on traffic measurements. Our technique tests network resources by means of 'special' probing packets, which have the task of implicitly conveying the network status to its edges. We show by means of simulations the effectiveness of our solutions, in spite of a very low overhead.