ppxscal/embedding_network huggingface dataset:
An Adaptive and Fault-Tolerant Routing Algorithm for Meshes
Authors: A. Shamaei, H. Sarbazi-Azad
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

We propose a partially adaptive fault-tolerant and deadlock-free routing algorithm in n-dimensional meshes based on the fault-tolerant planar-adaptive routing and Duato's protocol. In particular, we show that only four virtual channels per physical channel are sufficient for tolerating multiple faulty regions even in the case of n-dimensional meshes. Our scheme is able to handle faulty blocks whose associated fault rings have overlaps. In addition, it can be used to route messages when fault regions touch the boundaries of the mesh. A flag bit is introduced for guiding misrouted messages. Messages are routed adaptively in healthy regions of the network. Once a message faces a faulty region, it is routed around it using a non-minimal path. A flit-level simulator is employed to evaluate the performance of the proposed algorithm and to compare its performance to those already introduced.
Learning Linked Lists: Experiments with the iList System
Authors: Davide Fossati, Barbara Eugenio, Christopher Brown, Stellan Ohlsson
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper presents the first experiments with an Intelligent Tutoring System in the domain of linked lists, a fundamental topic in Computer Science. The system has been deployed in an introductory college-level Computer Science class, and engendered significant learning gains. A constraint-based approach has been adopted in the design and implementation of the system. We describe the system architecture, its current functionalities, and the future directions of its development.
Simulation of sensor-based tracking in Second Life
Authors: Boris Brandherm, Sebastian Ullrich, Helmut Prendinger
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

This paper describes "Second Life" as a novel type of testbed and simulation environment for sensor-based applications. Second Life is a popular virtual online world that provides a free networked multi-user three-dimensional (3D) environment. The overall goal of our work is to support the development, testing, and deployment of sensor-based applications. In particular, pervasive systems like smart environments make heavy use of wireless sensor networks. However, the development of such systems requires much effort and the success of a system relies heavily on good planning and testing. Many different factors have to be taken into consideration and the environment has to be modeled carefully to foresee potential problems or to be able to perform changes before actual implementation. Until now, only custom-made solutions exist whereby technical limitations restrict adequate testing. By contrast, our approach introduces a flexible architecture for an extensible testbed for sensor-based applications. It employs Second Life to model an easily customizable three-dimensional environment with various interaction possibilities.
Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach
Authors: Myra B. Cohen, Matthew B. Dwyer, Jiangfan Shi
Venue: IEEE Transactions on Software Engineering (2008)

Researchers have explored the application of combinatorial interaction testing (CIT) methods to construct samples to drive systematic testing of software system configurations. Applying CIT to highly-configurable software systems is complicated by the fact that, in many such systems, there are constraints between specific configuration parameters that render certain combinations invalid. Many CIT algorithms lack a mechanism to avoid these. In recent work, automated constraint solving methods have been combined with search-based CIT construction methods to address the constraint problem with promising results. However, these techniques can incur a non-trivial overhead. In this paper, we build upon our previous work to develop a family of greedy CIT sample generation algorithms that exploit calculations made by modern boolean satisfiability (SAT) solvers to prune the search space of the CIT problem. We perform a comparative evaluation of the cost-effectiveness of these algorithms on four real-world highly-configurable software systems and on a population of synthetic examples that share the characteristics of those systems. In combination our techniques reduce the cost of CIT in the presence of constraints to 30\% of the cost of widely-used unconstrained CIT methods without sacrificing the quality of the solutions.
Using Intuitionistic Fuzzy Sets in Text Categorization
Authors: Eulalia Szmidt, Janusz Kacprzyk
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

We address some crucial problem associated with text categorization, a local feature selection. It seems that intuitionistic fuzzy sets can be an effective and efficient tool making it possible to assess each term (from a feature set for each category) from a point of view of both its indicative and non-indicative ability. It is important especially for high dimensional problems to improve text filtering via a confident rejection of non-relevant documents. Moreover, we indicate that intuitionistic fuzzy sets are a good tool for the classification of imbalanced and overlapping classes, a commonly encountered case in text categorization.
Integrating Nominal and Structural Subtyping
Authors: Donna Malayeri, Jonathan Aldrich
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associated with run time tags, enables run-time type tests and external method dispatch. On the other hand, structural subtyping is flexible and compositional, allowing unanticipated reuse. To date, nearly all object-oriented languages fully support one subtyping paradigm or the other.In this paper, we describe a core calculus for a language that integrates the key aspects of nominal and structural subtyping in a unified framework. We have also merged the flexibility of structural subtyping with statically typechecked external methods, a novel combination. We prove type safety for this language and illustrate its practical utility through examples that are not easily expressed in other languages. Our work provides a clean foundation for the design of future languages that enjoy the benefits of both nominal and structural subtyping.
Looking Ahead to Select Tutorial Actions: A Decision-Theoretic Approach
Authors: R. Charles Murray, Kurt Vanlehn, Jack Mostow
Venue: International Journal of Artificial Intelligence in Education (2004)

We propose and evaluate a decision-theoretic approach for selecting tutorial actions by looking ahead to anticipate their effects on the student and other aspects of the tutorial state. The approach uses a dynamic decision network to consider the tutor's uncertain beliefs and objectives in adapting to and managing the changing tutorial state. Prototype action selection engines for diverse domains ?calculus and elementary reading ?illustrate the approach. These applications employ a rich model of the tutorial state, including attributes such as the studentï¾s knowledge, focus of attention, affective state, and next action(s), along with task progress and the discourse state. For this study, neither of our action selection engines had been integrated into a complete ITS, so we used simulated students to evaluate their capabilities to select rational tutorial actions that emulate the behaviors of human tutors. We also evaluated their capability to select tutorial actions quickly enough for real-world tutoring applications.
OWSCIS: Ontology and Web Service Based Cooperation of Information Sources
Authors: Raji Ghawi, Thibault Poulain, Guillermo Gomez, Nadine Cullot
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The growing amount of distributed data over the internet leads to increasing needs for interoperability. Being able to take into account the meaning of information is a real challenge for suitable data sharing. The semantic web and the ontologies are relevant technologies to provide semantic cooperation of heterogeneous sources. We propose a complete architecture OWSCIS (Ontology and Web Service based Cooperation of Information Sources) which allows to query a cooperation of information sources. The semantic of the local data is expressed using local ontologies which are mapped to a reference ontology. This reference ontology can be queried by an end user to transparently access the cooperation. The different components of the architecture are described: the data providers, the knowledge base, the inter-ontology mapping process, the visualization service and the querying service. A special focus is done on the latter service.
Functional testing: a pattern to follow and the smells to avoid
Authors: Amr Elssamadisy, Jean Whitmore
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

Functional tests are automated, business process tests co-owned by customers and developers. They are particularly useful for rescuing projects from high bug counts, delayed releases, and dissatisfied customers. Functional tests help projects by elucidating requirements, making project progress visible, and preventing bugs. We present functional testing in pattern format because it is especially expressive in conveying expert advice and enables the reader to make an informed decision regarding the applicability of the solution. The pattern presented aggregates multiple experiences with functional testing over several agile development projects. However, we have seen functional testing become more costly than its benefits, so we describe the symptoms--"smells"--of potentially costly problems. These are not problems with functional testing per se, but with the misinterpretation and mis-implementation of this practice. We draw on our experience to suggest ways of addressing these smells. Done right, functional testing successfully increases software's quality and business value.
A Strategy for Selecting Super-Peer in P2P and Grid Based Hybrid System
Authors: Sheng-Hui Zhao, Gui-Lin Chen, Guo-Xin Wu, Ning Qian
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

With the explosive increase of digital resources, the efficiency of searching resources has become a key problem. Both P2P and Grid are distributed network system, which provide good platforms for storing resources. In the hybrid system merging Grid and P2P, using super-peers can get better effect of searching resources. Combining the characteristics of P2P with Grid, a super-peer selection strategy is proposed. In the experiments, success rate of query resources and query delay are evaluated respectively, as well as the comparison between our selection strategy and random selection method. The results show that super-peer by our selection strategy can improve efficiency of querying resources, decrease query delay and accelerate the querying rate.
Dual Strategy Active Learning
Authors: Pinar Donmez, Jaime G. Carbonell, Paul N. Bennett
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Active Learning methods rely on static strategies for sampling unlabeled point(s). These strategies range from uncertainty sampling and density estimation to multi-factor methods with learn-once-use-always model parameters. This paper proposes a dynamic approach, called DUAL, where the strategy selection parameters are adaptively updated based on estimated future residual error reduction after each actively sampled point. The objective of dual is to outperform static strategies over a large operating range: from very few to very many labeled points. Empirical results over six datasets demonstrate that DUAL outperforms several state-of-the-art methods on most datasets.
A Profit-Based Business Model for Evaluating Rule Interestingness
Authors: Yaohua Chen, Yan Zhao, Yiyu Yao
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

Different types of rules are mined from transaction databases often with the goal of improving sales and services. In this paper, we link the interestingness of rules with the context of business marketing. We consider the profits generated from some specific marketing strategies that are developed based on particular discovered rules. This leads to a profit-based business model for evaluating rule interestingness. With this additional utility, we investigate some relationships between different marketing strategies and fundamental properties of rules for profit increasing.
Coping with Outside-the-Box Attacks
Authors: Edward W. Felten
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

There is a long history of security attacks that succeed by violating the system designer's assumptions about how things work. Even if a designer does everything right--within the "obvious" model--such attacks can still succeed. How can we, as designers and verifiers of systems, cope with these "outside-the-box" attacks?The classic examples of assumption-violating attacks are the timing attacks on cryptosystems first introduced by Kocher [1]. Cryptosystems are designed so that an attacker who has black-box access to an implementation (and does not know the secret key) cannot deduce the key. Extensive mathematical analysis of the input-output behavior of cryptographic functions led to the belief (though unfortunately not proof) that an attacker who can observe the input-output behavior of cryptosystems cannot feasibly find the secret key. Kocher showed that even if this is true, the running time of common cryptographic algorithms does depend on the secret key. Though the dependence of running time on the key is complex, Kocher showed how to use randomized experiments to extract enough signal to deduce the key, at least in principle. Brumley and Boneh later showed that such attacks are practical, even across a network[2].
Online slant identification algorithm for curved strokes
Authors: Mohd Razif Shamsuddin, Azlinah Mohamed
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Everyone would require to have a signature for authorization and other important tasks that needs identification. Thus, signature has become one of a method to represent its writer uniquely. Signature has many hidden features that are difficult to extract. Some of the identified features that a signature should have are slanting, baseline, proportion and size. In this proposed study, slanting is chosen to be identified in a signature. Signatures are captured using a tablet and saved in a digitized format of x and y values. A slant algorithm is created and coded into a functional system. An experiment consisting of 50 signatures are tested and the finding shows the angle and degree of the slant in every signature. The creation of this algorithm would be able to give some degree of contribution in the area of signature recognition.
Wireless multimedia sensor network with an efficient distributed video coding for multimedia broadcasting
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)

Wireless Multimedia Sensor Network (WMSN) is a conceptual network composed of autonomous hardware for capturing and transmission of quality audio-visual content. Due to the energy constraint of the sensor nodes, the distributed video coding (DVC) with the advantage in low encoder complexity is employed to construct WMSN network. In this paper, a practical DVC scheme, pixel-domain Wyner-Ziv(PDWZ) video coding, with slice structure and adaptive rate selection is proposed to solve the problems when applying DVC into WMSN. By utilizing the slice structure, the proposed PDWZ is adaptable to any interleaver size used in Slepian-wolf turbo codec for heterogeneous applications. The slice structure also facilitates an optimal adaptive rate selection transmission as compared to the conventional PDWZ. The simulation results clearly showed the enhancement in R-D performance and perceptual quality. Furthermore, the proposed adaptive rate selection scheme is based on evaluation of side information in which the feedback process during decoding is optimized. It can be observed that system delay caused by frequent feedback is greatly reduced. This gives a promising support for WMSN with low latency and facilitates the QoS management.
Supporting Enhanced Collaboration in Distributed Multidisciplinary Care Team Meetings
Authors: Jane Li, Tim Mansfield, Susan Hansen
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This paper describes an initiative for exploring the design space of an enhanced collaboration platform for a multidisciplinary breast cancer team meeting distributed between two hospitals. We present our socio-technical approach to the system design process which is intended to encourage engagement between the research technologists and the clinicians without adversely affecting the work of the clinicians. We report on some initial results of the observational study performed by the Braccetto research team and current social-technical issues affecting communication between the multidisciplinary team members during the meetings. We highlight some technical and research challenges which include the role that medical images play as "boundary objects" for several disciplines in the meeting, the awareness requirement and the evaluation of collaboration effectiveness.
Structure and relative stability of Si$_{n}$, Si$_{n}^{-}$, and doped Si$_{n}$M clusters (M =Sc$^{-}$, Ti, V$^{+}$) in the range n=14-18
Authors: M. B. Torres, E. M. Fernández, L. C. Balbás
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

We report on first-principles quantum mechanical optimizations of the minimum energy equilibrium structure of neutral, Si$_{n}$, and anionic, Si$_{n}^{-}$, pure silicon clusters, as well as the isoelectronic Si$_{n}$M doped clusters (M =Sc$^{-}$, Ti, V$^{+}$) for n=14-18. We have published previously some of these results, but additional analysis is contributed here for the first time, particularly for the pure anionic silicon clusters and doped Si$_{n}$Ti compounds. The lowest energy isomer of the anionic Si$_{n}^{-}$ cluster shows different geometry than the neutral cluster, except for n=15, 17. The geometries of a few low-lying energy isomers of doped Si$_{n}$M does not relate to those of pure silicon clusters in the range of sizes considered in this work. For both pure and doped Si clusters, we analyze the trend of several electronic properties with the cluster size, like the binding energy, the addition energy of the impurity M to pure Si clusters, the second difference of total energy, the Homo-Lumo gap, the average Si-Si and Si-M distance, and the electron affinity. For Si$_{16}$M doped clusters we found the largest binding energy, the highest second difference of energy, and the highest Homo-Lumo gap. These facts are manifestations of the special stability of Si$_{16}$M clusters found in recent experimental mass spectra, which was rationalized in previous works as a combination of geometrical (near spherical cage-like structure) and electronic effects (l-selection rule of the spherical potential model). Here we present additional arguments, by comparing the partial orbital density of states of the near-spherical Frank-Kasper isomer of Si$_{16}$Ti, with that of a non-spherical isomer of Si$_{16}$Sc$^{-}$ anion. We have also computed the adiabatic electron affinity of pure and doped Si clusters. For doped clusters, the computed electron affinities are in very good agreement with available estimations from experimental photoelectrons spectra, but for pure neutral clusters the calculations underestimate by more than 18% the experimental values.
ITACO: Effects to Interactions by Relationships between Humans and Artifacts
Authors: Kohei Ogawa, Tetsuo Ono
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Our purpose in this paper is realizing a natural interaction between humans and artifacts by an ITACO system. The ITACO system is able to construct a relationship between humans and artifacts by a migratable agent. The agent in the ITACO system can migrate to various artifacts within an environment to construct a relationship with humans. We conducted the two experiments to confirm effects for human by a relationship that was constructed between humans and artifacts. The experimental results showed that a relationship gave some influences to human's behaviors and cognitive abilities. The results also showed that the ITACO system and the migratable agent were an effective method to realize a natural interaction between them.
Efficient and Secure Communication between Set-Top Box and Smart Card in IPTV Broadcasting
Authors: Ji-Seon Lee, Hyun Sook Rhee, Dong Hoon Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

To provide secure delivery of satellite data in IPTV systems, service providers charge subscribing fee by scrambling the program in conditional access system using control words. At the receiver end, smart card is used to decrypt the control words and transfer them back to set-top box to descramble the scrambled program. Therefore, secure communication between set-top box and smart card is closely related with the benefit of service providers and the legal rights of users. In this paper, we propose secure mutual authentication and key agreement protocol between set-top box and smart card in IPTV broadcasting. The proposed scheme is more efficient than any other previously proposed schemes by eliminating exponentiation operations which are time-consuming. Moreover, our scheme can prevent two common serious problems - smart card cloning and McCormac Hack problems - in IPTV broadcasting.
An Empirical Analysis of the Impact of Prioritised Sweeping on the DynaQ's Performance
Authors: Marek Grześ, Daniel Kudenko
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Reinforcement learning tackles the problem of how to act optimally given observations of the current world state. Agents that learn from reinforcements execute actions in an environment and receive feedback (reward) that can be used to guide the learning process. The distinguishing feature of reinforcement learning is that the model of the environment (i.e., effects of actions or the reward function) are not known in advance. Model-based approaches represent a class of reinforcement learning algorithms which learn the model of dynamics. This model can be used by the learning agent to simulate interactions with the environment. DynaQ and its extended version with prioritised sweeping are the most popular examples of model-based approaches. This paper shows that, contrary to common belief, DynaQ with prioritised sweeping may perform worse than pure DynaQ in domains where the agent can be easily misled by a sub-optimal solution.