ppxscal/embedding_network huggingface dataset:
Real Option Approach to Quoting Queueing System
Authors: K. Ohstuka, K. Nishinari
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The new method of estimating net present values of a queue is proposed. We complementary employ real option theory and the asymmetric exclusion process (ASEP) as the valuating procedure. By pricing the dynamics of the ASEP, we succeed in identifying an ambiguous word, human congestion, quantitatively. An analogy between a clogged queue and a cash flow of an active firm is formulated.
Brief paper: Localized adaptive bounds for approximation-based backstepping
Authors: Yuanyuan Zhao, Jay A. Farrell
Venue: Automatica (Journal of IFAC) (2008)

Recent research has established the utility of adaptive bounds on model uncertainty in adaptive approximation-based control. Such bounds have utility both for robust control law design and for self-organizing approximators that could adjust the number of basis elements N by adding additional approximation resources in the regions where the approximation error bound is large. Existing adaptive bounding methods utilize algorithms with global forgetting. In this article, we investigate methods to develop bounds on approximation accuracy that involve local forgetting. The importance of local versus global forgetting is motivated in the text and illustrated with an example.
Why Context, Content and Contract are Key for Dynamic Service Selection
Authors: Zakir Laliwala, Amee Desai, Sanjay Chaudhary, Abdul Allam
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

In order to meet rapidly changing business needs, organizations need business processes that can be flexible and agile to adapt to these changes. This would require dynamic composition of services. Composition of services requires dynamic discovery of services and dynamic selection of service end-point. Service discovery and selection depend on metadata, policy and event associated with these business services. There is a need for dynamic service selection based on runtime environment such as content (semantics), context (event) and contract (policy). In this paper, we propose event-driven dynamic selection of services based on event, policy and semantic. Dynamic service selection will help in dynamic composition of business process and to deliver relevant services to consumer as per the business context and request.
Towards a Cross-Linguistic Production Data Archive: Structure and Exploration
Authors: Michael Götze, Stavros Skopeteas, Torsten Roloff, Ruben Stoel
Venue: Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers (2007)

The present paper presents the structure of a cross-linguistic database of production data. The database contains annotated texts collected from a sample of fifteen different languages by means of identical data gathering methods, which are designed to enable studies on typology and universals of information structure. The special property of this database is that it combines the features of a natural language corpus and the features of a typological database. The challenge for the exploration interface is to provide user-friendly support for exploiting this particular type of resource, thus facilitating empirical generalizations about the collected data in the individual languages and comparison among them.
Real-Time Controlled Multi-objective Scheduling Through ANNs and Fuzzy Inference Systems: The Case of DRC Manufacturing
Authors: Ozlem Uzun Araz
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, we developed an integrated multi-objective real-time controlled scheduling methodology for Dual Resource Constrained systems. The proposed methodology integrates simulation, neural network and fuzzy inference system approaches to obtain a schedule considering both state of the system and objectives. By means of a case study, we have demonstrated that the proposed methodology can be an effective tool for dynamic scheduling of DRC systems.
DIAR: Advances in Degradation Modeling and Processing
Authors: Mohamed Cheriet, Reza Farrahi Moghaddam
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

State-of-the-art OCR/ICR algorithms and software are the result of large-scale experiments on the accuracy of OCR systems and proper selection of the size and distribution of training sets. The key factor in improving OCR technology is the degradation models. While it is a leading-edge tool for processing conventional printed materials, the degradation model now faces additional challenges as a result of the appearance in recent years of new imaging media, new definitions of text information, and the need to process low quality document images. In addition to discussing these challenges in this paper, we present well-developed degradation models and suggest some directions for further study. Particular attention is paid to restoration and enhancement of degraded single-sided or multi-sided document images which suffer from bleed-through or shadow-through.
Combining Tree Partitioning, Precedence, and Incomparability Constraints
Authors: Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
Venue: Constraints (2008)

The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requirements on tree count, node degrees, or precedences and incomparabilities within node subsets. We present a generalisation of the tree constraint that incorporates such side constraints. The key point of our approach is to take partially into account the strong interactions between the tree partitioning problem and all the side constraints, in order to avoid thrashing during search. We describe filtering rules for this extended tree constraint and evaluate its effectiveness on three applications: the Hamiltonian path problem, the ordered disjoint paths problem, and the phylogenetic supertree problem.
Oblivious Transfer Based on the McEliece Assumptions
Authors: Rafael Dowsley, Jeroen Graaf, Jörn Müller-Quade, Anderson C. Nascimento
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

We implement one-out-of-two bit oblivious transfer (OT) based on the assumptions used in the McEliece cryptosystem: the hardness of decoding random binary linear codes, and the difficulty of distinguishing a permuted generating matrix of Goppa codes from a random matrix. To our knowledge this is the first OT reduction to these problems only.
Translating SQL Applications to the Semantic Web
Authors: Syed Hamid Tirmizi, Juan Sequeda, Daniel Miranker
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

The content of most Web pages is dynamically derived from an underlying relational database. Thus, the success of the Semantic Web hinges on enabling access to relational databases and their content by semantic methods. We define a system for automatic transformation of SQL DDL schemas into OWL DL ontologies. This system goes further than earlier efforts in that the entire system is expressed in first-order logic. We leverage the formal approach to show the system is complete with respect to a space of the possible relations that can be formed among relational tables as a consequence of primary and foreign key combinations. The full set of transformation rules is stratified, thus the system can be executed directly by a Datalog interpreter.
On the false-positive rate of Bloom filters
Authors: Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel Smid, Yihui Tang
Venue: Information Processing Letters (2008)

Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the probability of such erroneous answers, called the false-positive rate, and Bloom's analysis has appeared in many publications throughout the years. We show that Bloom's analysis is incorrect and give a correct analysis.
A Survey of Results for Deletion Channels and Related Synchronization Channels
Authors: Michael Mitzenmacher
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

The binary symmetric channel, where each bit is independently received in error with probability p, and the binary erasure channel, where each bit is erased with probability p, enjoy a long and rich history. Shannon developed the fundamental results on the capacity of such channels in the 1940's [19], and in recent years, through the development and analysis of low-density parity-check codes and related families of codes, we understand how to achieve near-capacity performance for such channels extremely efficiently [2,13,17].
Investigation on E-Learning Adoption Intention Among Chinese Undergraduates Via Innovation Adoption Theory
Authors: Zetian Fu, Xiaoshuan Zhang, Weisong Mu, Lingxian Zhang, Yajie Gao
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

E-learning, as an innovative and alternative way of distance learning, provides a strong challenge to the traditional learning with its unique advantage. The paper, for the diffusion of e-learning adoption in China, investigates people's perceptions and attitudes toward adopting e-learning, and explores the factors affecting the e-learning adoption behavior from innovation adoption perspective. Based on the model of Rogers' innovation adoption theory, the factors in each of "perceived innovative attributes" that affect the individual adoption behavior will be analyzed to test the relationship between these attributes and e-learning adoption. The result shows that the four perceived innovative attributes, namely "perceived relative advantage", "perceived compatibility", "perceived trialability" and "percieved observability", have certain influences on peoples' adoption of e-learning.
TOMOON: A Novel Approach for Topology-Aware Overlay Multicasting
Authors: Xiao Chen, Huagang Shao, Weinong Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Most existing overlay multicast approaches avoid considering any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, we propose TOMOON as a novel overlay multicast approach, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to PIM-SM, a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router's support, TOMOON organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well. Since we don't depend on routers to multicast data packets, the overlay tree can also cover the unicast networks and thus has a good support for the heterogeneous network environment.
A Hybrid Genetic Algorithm for Flexible Task Collaborative Scheduling
Authors: Liyi Zhu, Jinghua Wu, Haijun Zhang, Shijian He
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Flexible job scheduling is considered a NP-hard problem (FJS). A hybrid algorithm based on Genetic Algorithm (GA) and Simulated Annealing (SA) is proposed, which is used to schedule the tasks. A two dimensional matrix encoding is adopted, row operator and column operator are advanced accordingly, column crossover operator and column mutation are chosen by considering the Constraints. Elitist selection strategy is employed for accelerating the colony convergence. Capabilities and other factors which would influence the design results are considered when creating individual. Time scheduling and optimization are implemented in decoding phase. Finally, a simulation experiment is carried out by using the proposed algorithm, and comparison with the other algorithm is implemented, it is showed that the convergent velocity is fast and the search ability is better.
Cheap Boolean Role Constructors for Description Logics
Authors: Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today's most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs $\mathcal{SHOIQ}$ and $\mathcal{SROIQ}$, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The prominent OWL-fragment $\mathcal{SHIQ}$ can be safely extended by safe role expressions, and the tractable fragments $\mathcal{EL}^{++}$ and DLP retain tractability if extended by conjunction on roles, where in the case of DLP the restriction on role simplicity can even be discarded.
Some Forgery Attacks on a Remote User Authentication Scheme Using Smart Cards
Authors: Chin-Chen Chang, Kuo-Feng Hwang
Venue: Informatica (2003)

Smart card has been adopted to various applications. In 2000, Hwang and Li proposed a remote user authentication scheme, which is also using smart card. Nine months later, Chan and Cheng pointed out that there is a weakness in the remote authentication scheme proposed by Hwang and Li. In this paper, we show that Chan and Cheng's attack does not work well because they did not consider the format of user's identity. In addition, we propose several ways to solve the problem of Chan and Cheng's attack.
Approximating Multi-criteria Max-TSP
Authors: Markus Bläser, Bodo Manthey, Oliver Putz
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We present randomized approximation algorithms for multi-criteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of $\frac 1k - \varepsilon$ for arbitrarily small ¿> 0. For Max-ATSP with k objective functions, we obtain a ratio of $\frac{1}{k+1} - \varepsilon$.
Fitness Function Comparison for GA-Based Feature Construction
Authors: Leila S. Shafti, Eduardo Pérez
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

When primitive data representation yields attribute interactions, learning requires feature construction. MFE2/GA, a GA-based feature construction has been shown to learn more accurately than others when there exist several complex attribute interactions. A new fitness function, based on the principle of Minimum Description Length (MDL), is proposed and implemented as part of the MFE3/GA system. Since the individuals of the GA population are collections of new features constructed to change the representation of data, an MDL-based fitness considers not only the part of data left unexplained by the constructed features (errors), but also the complexity of the constructed features as a new representation (theory). An empirical study shows the advantage of the new fitness over other fitness not based on MDL, and both are compared to the performance baselines provided by relevant systems.
Network Fault Model for Dependability Assessment of Networked Embedded Systems
Authors: Franco Fummi, Davide Quaglia, Francesco Stefanni
Venue: Proceedings of the 2008 IEEE International Symposium on Defect and Fault Tolerance of VLSI Systems (2008)

This paper presents a network-based fault model for dependability assessment of distributed applications built over networked embedded systems. This fault model represents global failures in terms of wrong behavior of packet-based asynchronous data transmissions. Packets are subject to different faults, i.e., drop, cut, bit errors, and duplication; these events can model either HW/SW failures of the networked embedded systems or problems in the channel among them. The paper describes 1) the proposed fault model in relation with existing ones, 2) its possible application scenarios, and 3) a SystemC tool for the simulation of both fault-free and faulty wireless sensor networks. Experimental results show the validity of the approach in the verification of communication protocols and its support to determine the optimal number of nodes in a wireless sensor network based on the IEEE 802.15.4 standard. Part of the software is available at http://sourceforge.net/projects/scnsl/.
Memotice Board: A Notice Board with Spatio-temporal Memory
Authors: Jesús Ibáñez, Oscar Serrano, David García, Carlos Delgado-Mata
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper describes the design and development of a novel digital notice board which allows non experienced users to easily interact with digital information. In particular, the system allows the user to receive and handle media elements (pictures, text messages, videos). Instead of employing the file system to interact with information, the user interface promotes a kind of interaction which relies on spatial and temporal memory, which we believe to be more adequate.
Autonomous Learning of Stable Quadruped Locomotion
Authors: Manish Saggar, Thomas D'Silva, Nate Kohl, Peter Stone
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

A fast gait is an essential component of any successful team in the RoboCup 4-legged league. However, quickly moving quadruped robots, including those with learned gaits, often move in such a way so as to cause unsteady camera motions which degrade the robot's visual capabilities. This paper presents an implementation of the policy gradient machine learning algorithm that searches for a parameterized walk while optimizing for both speed and stability. To the best of our knowledge, previous learned walks have all focused exclusively on speed. Our method is fully implemented and tested on the Sony Aibo ERS-7 robot platform. The resulting gait is reasonably fast and considerably more stable compared to our previous fast gaits. We demonstrate that this stability can significantly improve the robot's visual object recognition.
Symbolic and Algebraic Methods for Linear Partial Differential Operators
Authors: Franz Winkler, Ekaterina Shemyakova
Venue: Proceedings of the 10th international workshop on Computer Algebra in Scientific Computing (2007)

The solution of Partial Differential Equations (PDEs) is one of the most important problems of mathematics, and has an enormous area of applications. One of the methods for extending the range of analytically solvable PDEs consists in transformations of PDEs and the corresponding transformations of their solutions. Thus, based on the fact that a second-order equation can be solved if one of its factorizations is known, the famous method of Laplace Transformations suggests a certain sequence of transformations of a given equation. Then, if at a certain step in this transformation process an equation becomes factorizable, an analytical solution of this transformed equation -- and then of the initial one -- can be found.The aim of this talk is a description of some old and new developments and generalizations of analytical approaches to the solution of PDEs and the corresponding algebraic theory of differential operators. Recently we have introduced the notion of obstacle for the factorization of a differential operator, i.e. conditions preventing a given operator from being factorizable. These obstacles give rise to a ring of obstacles and furthermore to a classification of operators w.r.t. to their factorization properties. From obstacles we can also get (Laplace) invariants of operators w.r.t. to certain (gauge) transformations. We have shown how such systems of invariants can be extended to full systems of invariants for certain low order operators. Another related problem is the description of the structure of families of factorizations. For operators of order 3 it has been shown that a family of factorizations depends on at most 3 or 2 parameters, each of these parameters being a function on one variable.
Annotation and matching of first-class agent interaction protocols
Authors: Tim Miller, Peter McBurney
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Many practitioners view agent interaction protocols as rigid specifications that are defined a priori, and hard-code their agents with a set of protocols known at design time --- an unnecessary restriction for intelligent and adaptive agents. To achieve the full potential of multi-agent systems, we believe that it is important that multi-agent interaction protocols are treated as first-class computational entities in systems. That is, they exist at runtime in systems as entities that can be referenced, inspected, composed, invoked and shared, rather than as abstractions that emerge from the behaviour of the participants. Using first-class protocols, a goal-directed agent can assess a library of protocols at runtime to determine which protocols best achieve a particular goal. In this paper, we present three methods for annotating protocols with their outcomes, and matching protocols using these annotations so that an agent can quickly and correctly find the protocols in its library that achieve a given goal. We discuss the advantages and disadvantages of each of these methods.
A Comparative Study on Using Zernike Velocity Moments and Hidden Markov Models for Hand Gesture Recognition
Authors: Moaath Al-Rajab, David Hogg, Kia Ng
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

Hand-gesture recognition presents a challenging problem for computer vision due to the articulated structure of the human hand and the complexity of the environments in which it is typically applied. Solving such a problem requires a robust tracking mechanism which in turn depends on an effective feature descriptor and classifier. Moment invariants, as discriminative feature descriptors, have been used for shape representation for many years. Zernike moments have been particularly attractive for their scale, translation and rotation invariance. More recently, Zernike moments have been extended to a spatio-temporal descriptor, known as the Zernike velocity moment, through combining with the displacement vector of the centre of mass of the target object between video frames. This descriptor has hitherto been demonstrated successfully in human gait analysis. In this paper, we introduce and evaluate the application of Zernike velocity moments in hand-gesture recognition, and compare with a bank of hidden Markov models with Zernike moments as observations. We demonstrate good performance for both approaches, with a substantial increase in performance for the latter method.