ppxscal/embedding_network huggingface dataset:
When to Adapt? Identification of Problem Domains for Adaptive Systems
Authors: Kristopher Welsh, Pete Sawyer
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

Dynamically adaptive systems (DASs) change behaviour at run-time to operate in volatile environments. As we learn how best to design and build systems with greater autonomy, we must also consider when to do so. Thus far, DASs have tended to showcase the benefits of adaptation infrastructures with little understanding of what characterizes the problem domains that require run-time adaptation. This position paper posits that context-dependent variation in the acceptable trade-offs between non-functional requirements is a key indicator of problems that require dynamically adaptive solutions.
An Efficient XML Index Structure with Bottom-Up Query Processing
Authors: Dong Min Seo, Jae Soo Yoo, Ki Hyung Cho
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

With the growing importance of XML in data exchange, much research has been done in proving flexible query mechanisms to extract data from structured XML documents. The semi-structured nature of XML data and the requirements on query flexibility pose unique challenges to database indexing methods. Recently, ViST that uses suffix tree and B+Tree was proposed to reduce the search time of the documents. However, it can cause a lot of unnecessary computation and I/O when processing structural join queries because the numbering scheme of ViST is not optimized. In this paper, we propose a novel index structure to solve the problems of ViST. Our index structure provides the bottom-up query processing method to efficiently process structural queries. Our experiments show that the proposed index structure is efficient in processing both single-path and branching queries with various wild-cards (`*' and `//').
Plant Model Generation for Countermeasures Planning
Authors: Takashi Hamaguchi, Kazuhiro Takeda, Yukiyasu Shimada, Yoshihiro Hashimoto
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

It is desirable to support operator activities in abnormal situations in chemical plants. Alarm systems have consequently become an important tool used by operators to maintain safe operation. An effective alarm must be connected to adequate countermeasures. Although, fault diagnosis systems have very fertile grounds for theoretical and industrial development, there are few countermeasures planning systems. For adequate countermeasures planning, plant situations must be reflected dynamically on the system. In this paper, we modified countermeasure planning system based on CE-matrices to change of plant situations. This approach is useful for designing effective alarm management system.
Lock Conversion in Non-Two-Phase Locking Protocols
Authors: C. Mohan
Venue: IEEE Transactions on Software Engineering (1985)

A locking protocol is a set of rules governing the manner in which the database entities may be accessed. Such a protocol usually employs several kinds of locks. Most of the previous work in this area has assumed that once a transaction acquires a particular kind of lock on a data item it is not allowed to convert this lock to another kind. In this paper we perform a systematic study of the consequences of allowing lock conversions in non-two-phase locking protocols, and show how this leads to increased concurrency and affects deadlock-freedom. The non-two-phase protocols that we study are the very general guard protocols defined for databases in which a directed acyclic graph structure can be superimposed on the data items. We present very natural generalizations of these protocols, including correctness proofs, and develop deadlock removal methods.
Designing Socially Aware Conversational Agents
Authors: Koen Turnhout, Jacques Terken, Berry Eggen
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

In this paper we address the problem of how to make conversational agents socially aware. State-of-the-art conversational agents cannot deal with multi-user situations where the user-system dialog is interleaved with discussions between users. We describe the development of an algorithm for determining addressee-hood of user utterances. The algorithm makes errors in determining addressee-hood for individual utterances, classifying utterances intended for the system as utterances intended for the other user and the other way around, creating unexpected situations in the agent's behaviour. This raises the question of how to design the conversational agent so that the users understand why the agent behaves in particular ways. We describe a study aimed at obtaining guidelines for the design of a socially aware conversational agent. We conclude that principles for modelling the behaviour of the agent are to be derived from theories about human communication rather than from theories about human-computer interaction.
An Efficient Similarity Searching Algorithm Based on Clustering for Time Series
Authors: Yucai Feng, Tao Jiang, Yingbiao Zhou, Junkui Li
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

Indexing large time series databases is crucial for efficient searching of time series queries. In the paper, we propose a novel indexing scheme RQI (Range Query based on Index) which includes three filtering methods: first-k filtering, indexing lower bounding and upper bounding as well as triangle inequality pruning. The basic idea is calculating wavelet coefficient whose first k coefficients are used to form a MBR (minimal bounding rectangle) based on haar wavelet transform for each time series and then using point filtering method; At the same time, lower bounding and upper bounding feature of each time series is calculated, in advance, and stored into index structure. At last, triangle inequality pruning method is used by calculating the distance between time series beforehand. Then we introduce a novel lower bounding distance function SLBS (Symmetrical Lower Bounding based on Segment) and a novel clustering algorithm CSA (Clustering based on Segment Approximation) in order to further improve the search efficiency of point filtering method by keeping a good clustering trait of index structure. Extensive experiments over both synthetic and real datasets show that our technologies provide perfect pruning power and could obtain an order of magnitude performance improvement for time series queries over traditional naive evaluation techniques.
Evaluation of spatial abilities within a 2D auditory platform game
Authors: Mike A. Oren, Chris Harding, Terri Bonebright
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

In this paper, we compare the mental maps created by sighted participants with the maps created by participants with visual impairments during the study of an auditory platform game. The game uses audio cues to convey a 2D side-scrolling view of the spatial layout of the game world. We studied three groups with 9 participants each: a control group of sighted participants playing an audio-visual version of the game, sighted participants playing the audio-only version of the game, and participants with visual impairments playing the audio-only version of the game. Immediately after playing two of the game's levels, we transferred the participants' verbal descriptions of the level's layout onto paper maps and gave each map a "mapping score" that expressed how closely a map matched the actual layout of the game level. The results suggest that in this setting, all participants were able to create maps with roughly the same accuracy no matter which version of the game they played (audio-visual or audio-only) and independent of the participant's level of visual ability (sighted persons or persons with visual impairments).
Observer-Based Control of Linear Complementarity Systems
Authors: W. P. Heemels, M. K. Camlibel, B. Brogliato, J. M. Schumacher
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this paper, we will present observer and output-based controller design methods for linear complementarity systems (LCS) employing a passivity approach. Given various inherent properties of LCS, such as the presence of state jumps, mode dynamics described by DAEs, and regions ("invariants") for certain modes being lower dimensional, several proposed observers and controllers for other classes of hybrid dynamical systems do not apply. We will provide sufficient conditions for the observer design for a LCS, which is effective also in the presence of state jumps. Using the certainty equivalence approach we obtain output-based controllers for which we will derive a separation principle.
A Simple and Fast Surveillance System for Human Tracking and Behavior Analysis
Authors: Chen-Chiung Hsieh, Shu-Shuo Hsu
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In this paper, we designed a simple and fast visual surveillance system to track human position and to determine if any abnormal behavior like wall climbing and falling happened. By taking both time and background difference into considerations, illumination effects could be greatly reduced while calculating motion masks. Refinements including holes filling, shadow removal, and noise reduction are done to obtain much more reliable motion masks. However, motion masks corresponding to occluded moving people, greater than a given width, are segmented recursively into smaller ones by bi-modal thresholding. Meanwhile, background could also be updated by the refined motion masks. Integrated location-based and weighted block-based matching is done for object tracking. A similarity is defined from these weighted matched block for object classification. Finally, a couple of criterions are defined to analyze whether objects stop, disappear, climb, or fall. Experimental results are given to demonstrate the robustness of our system.
Preconditioned Krylov Subspace Methods Solving Dense Nonsymmetric Linear Systems Arising from BEM
Authors: Zejun Chen, Hong Xiao
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Discretization of boundary integral equations leads, in general, to fully populated nonsymmetric linear systems of equations. We research the comparative performances of iterative techniques based on Krylov subspace solvers as GMRES(m), QMR and Bi-CGStab solving linear systems arising from BEM elasticity problems. Several general preconditioners are also considered and assessed. The results of numerical experiments suggest that preconditioned Krylov subspace methods are effective approaches for the solution of dense nonsymmetric linear systems arising from BEM.
INCOME2010 - a toolset for developing process-oriented information systems based on petri nets
Authors: Stefan Klink, Yu Li, Andreas Oberweis
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Petri nets are widely accepted as a process modeling technique with formal semantics and mathematical foundation. They are well suitable for modeling (business) processes in executable form and for analyzing process models through simulative validation and formal verification. Nevertheless, there are currently only a small number of Petri net based tools available for developing process-oriented information systems, which have gained importance in recent years because of the awareness that business processes are one of the key success factors for organizations. In this paper we survey the project INCOME2010 aiming at developing an open source software toolset that facilitates the development of process-oriented information systems. It provides functionalities for modeling, analyzing, executing, and monitoring (business) processes using variants of high-level Petri nets and concepts of Service-Oriented Architecture.
Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times
Authors: Bart Feyaerts, Sabine Wittevrongel
Venue: Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering (2008)

In this paper, we analyze a discrete-time single-server queue with two classes of packet arrivals and a reservation-based scheduling discipline. The objective of this discipline is to give a certain priority to (delay-sensitive) packets of class 1 and at the same time to avoid packet starvation for the (delay-tolerant) packets of class 2. This is achieved by the introduction of a reserved place in the queue that can be taken by a future arrival of class 1. Both classes contain packets with generally distributed transmission times.By means of a probability generating functions approach, both the class-1 and the class-2 packet delay are studied. By some numerical examples, the delay performance of the Reservation discipline is compared to that of the classical Absolute Priority (AP) and First-In First-Out (FIFO) scheduling disciplines.
The irrelevance of the machine
Authors: Samuel Fee
Venue: ACM SIGCAS Computers and Society (2008)

We've all heard the expression "can't see the forest for the trees." But when considering the role of technology in education, it seems that many of us suffer from this obscured view. Of course, it's easy to understand why: new tools are sometimes fascinating, and new technologies often enjoy a certain coolness quotient. But ultimately, it is the way in which these technologies are incorporated into the classroom -- and their underlying pedagogy -- that is the foremost determiner of whether the educational treatment will facilitate learning. The hardware and software are largely irrelevant. The truly important issue here is what the student needs to learn, and how the tools support that learning.
Selected Cognitive Categorization Systems
Authors: Ryszard Tadeusiewicz, Lidia Ogiela
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper demonstrates that AI methods can be applied to the development of intelligent IT systems. They also facilitate an in-depth analysis of the meaning presented in cognitive categorization information systems - in particular UBIAS systems (Understanding Based Image Analysis Systems). This paper also presents the IT mechanisms of object meaning description on selected examples of long bone fractures image analysis. The procedures for such semantic reasoning are based on the model of cognitive resonance and cognitive analysis. These have been applied to the task of interpreting the meaning of selected diagnostic images from the long bone fractures system as an intelligent analysis module in IT systems. The application presented in this paper is of a research character and it serves the preparation of efficient lesion detection methods applied to a dataset originating from of the long bone fractures structures.
Criteria for Exponential Stability of Cohen-Grossberg Neural Networks with Multiple Time-Varying Delays
Authors: Anhua Wan, Weihua Mao
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

The exponential stability is analyzed for Cohen-Grossberg neural networks with multiple time-varying delays. The boundedness, differentiability or monotonicity condition is not assumed on the activation functions. Lyapunov functional method is employed to investigate the stability of the neural networks, and general sufficient conditions for the global exponential stability are derived. A numerical example is presented to demonstrate the effectiveness of the obtained criteria.
New Applications of Differential Bounds of the SDS Structure
Authors: Jiali Choy, Khoongming Khoo
Venue: Proceedings of the 11th international conference on Information Security (2008)

In this paper, we present some new applications of the bounds for the differential probability of a SDS (Substitution-Diffusion-Substitution) structure by Park et al. at FSE 2003. Park et al. have applied their result on the AES cipher which uses the SDS structure based on MDS matrices. We shall apply their result to practical ciphers that use SDS structures based on {0,1}-matrices of size n×n. These structures are useful because they can be efficiently implemented in hardware. We prove a bound on {0,1}-matrices to show that they cannot be MDS and are almost-MDS only when n = 2,3, or 4. Thus we have to apply Park's result whenever {0,1}-matrices where n ¿ 5 are used because previous results only hold for MDS and almost-MDS diffusion matrices. Based on our bound, we also show that the {0,1}-matrices used in E2, Camellia, and MCrypton are optimal or almost-optimal among {0,1}-matrices. Using Park's result, we prove differential bounds for the E2 and MCrypton ciphers, from which we can deduce their security against boomerang attack and some of its variants. At ICCSA 2006, Khoo and Heng constructed block cipher-based universal hash functions, from which they derived Message Authentication Codes (MACs) which are faster than CBC-MAC. Park's result provides us with the means to obtain a more accurate bound for their universal hash function. With this bound, we can restrict the number of MAC's performed before a change of MAC key is needed.
An Interval-Based Index Structure for Structure Elucidation in Chemical Databases
Authors: Sven Helmer
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

We propose to adapt an interval-based index structure, Relational Interval trees, to support the process of determining the structure of an unknown chemical compound. Important information for retrieving relevant substructures that make up a compound can only be described in an imprecise way, resulting in interval-based values specifying chemical shifts. The access method was implemented on top of a commercial database system and evaluated experimentally. The results of these experiments show that Relational Interval trees are an efficient way of indexing data needed for structure elucidation.
On lifetime maximization and fault tolerance measurement in wireless ad hoc and sensor networks
Authors: Mark A. Shayman
Venue:  (2007)

In this dissertation we study two important issues in wireless ad hoc and sensor networks: lifetime maximization and fault tolerance. The first part investigates how to maximally extend the lifetime of randomly deployed wireless sensor networks under limited resource constraint, and the second part focuses on how to measure the fault tolerance and attack resilience of wireless ad hoc networks. We take the approach of adaptive traffic distribution and power control to maximize the lifetime of randomly deployed wireless sensor networks. After abstracting the network into multiple layers, we model the lifetime maximization problem as a linear program. We study both scenarios where receiving/processing power consumption is ignored and receiving/processing is included. In both cases, we have a similar observation: for each packet to be sent, the sender should either transmit it using the transmission range with the highest energy efficiency per bit per meter, or transmit it directly to the sink. We then prove it is true in general. Finally, we propose a fully distributed algorithm to adaptively split traffic and adjust transmission power. Extensive simulation studies demonstrate that the network lifetime can be dramatically extended by applying the proposed approach in various scenarios. Besides studying the lifetime extension problem for fully deployed wireless sensor networks, we also investigate how to extend the network lifetime via joint relay node deployment and adaptive traffic distribution. We formulate this problem as a mixed-integer nonlinear-program problem, which is NP-hard in general. We then propose a greedy heuristic to attack it. Both numerical and simulation results show that significant network lifetime extension can be achieved. In the second part of this dissertation, we investigate how to measure the fault tolerance and attack resilience for randomly deployed wireless ad hoc networks. We first propose two new metrics to measure the average case of network service quality: average pairwise connectivity and pairwise connected ratio. We then propose the fault tolerance and attack resilience metric: &alpha;-p-resilience, where a network is &alpha;-p-resilient if at least alpha portion of nodes pairs remain connected as long as no more than p fraction of nodes is removed from the network.
Segmentation of satellite images in optoelectronic system
Authors: Andrey S. Ostrovsky, Carolina Rickenstorff Parrao
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

The problem of segmenting the satellite images into homogeneous texture regions that correspond to the different classes of terrestrial surface is considered. It is shown that this problem may be successfully solved by using the method of spectral synthetic discriminant functions recently proposed by the authors for classification of random image fields and realized by means of a rather simple optoelectronic technique. The experimental results of segmenting the true satellite images are given.
Characterizing effective auction mechanisms: insights from the 2007 TAC market design competition
Authors: Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter McBurney
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

This paper analyzes the entrants to the 2007 TAC Market Design competition. It presents a classification of the entries to the competition, and uses this classification to compare these entries. The paper also attempts to relate market dynamics to the auction rules adopted by these entries and their adaptive strategies via a set of post-tournament experiments. Based on this analysis, the paper speculates about the design of effective auction mechanisms, both in the setting of this competition and in the more general case.
A Vicarious Words Method for Word Sense Discrimination
Authors: Zhimao Lu, Dongmei Fan, Rubo Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper presents a new approach based on Vicarious Words (VWs) to resolve Word Sense Discrimination (WSD) in Chinese language. VWs are particular artificial ambiguous words, which can be used to realize unsupervised WSD. A Bayesian classifier is implemented to test the efficacy of the VW solution on Senseval-3 Chinese test suite. The performance is better than state-of-the-art results with an average F-measure of 0.80. The experiment verifies the value of VW for unsupervised method in WSD.