ppxscal/embedding_network huggingface dataset:
Techniques to Aggregate the Characteristics of Internal Quality of an IS Specification Language
Authors: Albertas Čaplinskas, Jelena Gasperovič
Venue: Informatica (2005)

The paper analyses the problem of aggregation of internal quality characteristics of an information system specification language. It surveys main categories of aggregation operators, their mathematical and behavioural properties and proposes how to aggregate quality characteristics taking into account measurements of all lowest-level characteristics in a proper way. The paper shows that four different kinds of dependencies can occur among characteristics of internal quality and discusses in detail what aggregation techniques are reasonable for each case. It also describes a heuristic for minimisation of possible deviations of measurement results obtained after using a number of different metrics or because of the inaccuracy of used measurement techniques.
Computer Forensics and Culture
Authors: Yi-Chi Lin, Jill Slay, I. -Long Lin
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Based on theory gained from the science and culture research domain, this paper considers the relationship between computer forensic science and culture. In order to develop a theoretical relationship between computer forensics and culture, this paper examines computer forensics as science and discusses the universal nature of science. It points to an ongoing cross-cultural work being carried out among computer forensic experts in Australia and Taiwan.
Clustered SplitsNetworks
Authors: Lichen Bao, Sergey Bereg
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We address the problem of constructing phylogenetic networks using two criteria: the number of cycles and the fit value of the network. Traditionally the fit value is the main objective for evaluating phylogenetic networks. However, a small number of cycles in a network is desired and pointed out in several publications.We propose a new phylogenetic network called CS-network and a method for constructing it. The method is based on the well-known splitstree method. A CS-network contains a face which is k-cycle, k ¿ 3 (not as splitstree). We discuss difficulties of using non-parallelogram faces in splitstree networks. Our method involves clustering and optimization of weights of the network edges.The algorithm for constructing the underlying graph (except the optimization step) has a polynomial time. Experimental results show a good performance of our algorithm.
Time Synchronization in Heterogeneous Sensor Networks
Authors: Isaac Amundson, Branislav Kusy, Peter Volgyesi, Xenofon Koutsoukos, Akos Ledeczi
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Time synchronization is a critical component in many wireless sensor network applications. Although several synchronization protocols have recently been developed, they tend to break down when implemented on networks of heterogeneous devices consisting of different hardware components and operating systems, and communicate over different network media. In this paper, we present a methodology for time synchronization in heterogeneous sensor networks (HSNs). This includes synchronization between mote and PC networks, a communication pathway that is often used in sensor networks, but has received little attention with respect to time synchronization. In addition, we evaluate clock skew compensation methods including linear regression, exponential averaging, and phase-locked loops. Our HSN synchronization methodology has been implemented as a network service and tested on an experimental testbed. We show that a 6-hop heterogeneous sensor network can be synchronized with an accuracy on the order of microseconds.
A Fast Real Time Link Adaptation Scheme for Wireless Communication Systems
Authors: Hyukjun Oh, Jiman Hong, Yongseok Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, a fast real time link adaptation scheme for wireless communication systems is proposed. The proposed scheme is employing multi-stage adaptation controls based on channel state information (CSI). The optimal link adaptation scheme is known to have high complexity to implement, and it shoud be run iteratively to deal with time varying wireless channels in a short time. The proposed method determines the speed of channel variation using CSI's, then it applies the most appropriate link adaptation methodology or algorithm to the current time varying rate of channels. For examples, a simple up/down transmit power adjustment is used for the very fast time varying channel condition. On the other hand, the optimal link adaptation scheme is directly applied in the very slow varying channel state. The proposed multi-stage link adaptation scheme can be easily implemented in real time wirelss communication systems because of its capability of selecting an appropriate real time link adaptation scheme adaptively to each channel variation rate. The design example on the selected platform shows that the proposed scheme is very efficient in real time applications of the link adaptation in wireless communications, while its performance is maintained close to the optimal.
A Network-Enabled Platform for Reducing Hospital Emergency Department Waiting Times Using an RFID Proximity Location System
Authors: D. Sanders, S. Mukhi, M. Laskowski, M. Khan, B. W. Podaima, R. D. McLeod
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

In this paper we describe a network-enabled platform for an application oriented to reducing hospital emergency room or emergency department waiting times. The platform itself is extensible, incorporating systems engineering practices and available resources, and is suitable for data collection and analysis opportunities such as those found in a networked aggregation of emergency departments or clinical settings. The content provided is described in general terms and reflects a healthcare related emergency room scenario. We demonstrate the efficacy and rationale of the platform within a service oriented architecture based framework for an RFID real time location system. Value added information mining is also indicated by extracting queuing parameters, thereby providing some degree of qualitative monitoring of service and waiting times that would otherwise be unavailable.
Dynamic Configuration and Management of e-Supply Chains Based on Internet Public Registries Visited by Clusters of Software Agents
Authors: Konrad Fuks, Arkadiusz Kawa, Waldemar Wieczerzycki
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

There are three main contributions of the work presented in this paper. First, a particular approach to develop and manage multi-agent environments is presented. It is based on so called agent clusters which group agents that mutually cooperate to perform a particular mission, e.g. to build and manage supply chains, to negotiate details of order. Second contribution is the presentation of public registry model. Authors have widened RosettaNet approach to public registries. Third, the integration of agent cluster model and public registry model is presented. New approach shows how agent technology can automate information exchange process within public registry.
Image analysis and retrieval by spatial models and information integration
Authors: Dhiraj Joshi
Venue:  (2007)

The last decade has witnessed an explosion in the production of digital data from all over the world. In comparison, the rate of meaningful information extraction has been rather slow. One of the key reasons is that digital data usually comes in multiple modalities or media forms (i.e. text, images, video), thus making it difficult for generic information extraction methods to be used across multiple media. Moreover, extraction of precise semantics from multimedia largely remains an open problem. A large amount of multi-dimensional and multi-spectral data is being acquired and used in specialized domains such as medical science, surveillance and astronomy. The presence of multiple dimensions and multi-spectral information poses yet another challenge for certain special kinds of image analysis applications. In spite of the challenges there is a growing demand for computer intervention in all these aspects. In this thesis, I present my research in multi-dimensional image modeling and multimedia information integration. I begin by characterizing image retrieval in the real world from a user and system perspective. Next, I will present a conceptually clean hidden Markov model based framework to model multi-dimensional image data. Extension of the Markovian property to a third dimension dramatically increases the computational challenge for estimation of model parameters. I have developed a locally optimal but scalable parameter estimation algorithm for two and three dimensional hidden Markov models (2-D and 3-D HMMs). I will next introduce the problem of story picturing and present an unsupervised approach for illustration of stories using an image database. In a special scenario, the process of image ranking bears an interesting analogy to obtaining the stationary distribution of a random walk performed in the image similarity space. This will be followed by discussion of a generic framework for next generation multi-modal image management engine with presentation of a prototype. I will conclude by describing the architecture and working of story picturing engine within the realm of the presented framework.
Formal Methods of Microcode Verification and Synthesis
Authors: R. A. Mueller
Venue: IEEE Software (1986)

The influence of software design principles has helped transform a catch-as-catch-can bag of tricks into the emerging scientific discipline of firmware engineering.
A Class of Nonbinary Codes and Sequence Families
Authors: Xiangyong Zeng, Nian Li, Lei Hu
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

In this paper, for an even integer n ¿ 4 and any positive integer k with gcd(n/2,k) = gcd(n/2 ¿ k,2k) = d being odd, a class of p-ary codes $\mathcal{C}^k$ is defined and the weight distribution is completely determined, where p is an odd prime. A class of nonbinary sequence families is constructed from these codes, and the correlation distribution is also determined.
Modeling Decisions for the Time-Dependent Optimal Lane Configuration Policy with Queueing Theory and Mathematical Programming
Authors: Seongmoon Kim
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

We provide mathematical models to operate a toll plaza with the time-dependent lane configuration policy. To formulate toll operations in the problem we use the queueing theory and mathematical programming. The queueing theory is utilized to obtain the stability condition which requires the mean arrival rate less than the mean service rate in each lane and compute the mean waiting time in the queue. The mathematical programming is used to determine the time-dependent lane configuration to minimize the total waiting and operation costs. In order to apply the introduced mathematical models in real world problem, we provide a case study based on the actual traffic data collected and show how the time-dependent lane configuration policy can be achieved in each time period. By numerical evaluation we demonstrate the electronic toll collection (ETC) is an intelligent transportation system which achieves high throughput and maintains almost no wait time. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Note: Bounds on degrees of p-adic separating polynomials
Authors: Daniel J. Katz, Joshua Zahl
Venue: Journal of Combinatorial Theory Series A (2008)

We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled behavior. Such polynomials are of particular interest because they furnish bounds on the size of set systems satisfying Frankl-Wilson-type conditions modulo prime powers, with lower degree polynomials providing better bounds. We elucidate the asymptotic structure of solutions to the optimization problem, and we also provide an improved method for finding solutions in certain circumstances.
Symbolic Step Encodings for Object Based Communicating State Machines
Authors: Jori Dubrovin, Tommi Junttila, Keijo Heljanko
Venue: Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems (2008)

In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the essential data manipulation features of UML state machines when enriched with a Java-like object oriented action language. The main contribution of the work is the generalization of the $\exists$-step semantics approach, which Rintanen has used for improving the efficiency of SAT based AI planning, to a much more complex class of systems. Furthermore, the approach is extended to employ a dynamic notion of independence. To evaluate the encodings, UML state machine models are automatically translated into NuSMV models and then symbolically model checked with NuSMV. Especially in bounded model checking (BMC), the $\exists$-step semantics often significantly outperforms the traditional interleaving semantics without any substantial blowup in the BMC encoding as a SAT formula.
Virtual Reality Supporting Environmental Planning Processes: A Case Study of the City Library in Gothenburg
Authors: Kaj Sunesson, Carl Martin Allwood, Ilona Heldal, Dan Paulin, Mattias Roupé, Mikael Johansson, Börje Westerdahl
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

The introduction of Virtual Reality (VR) models in the environmental planning process can change the traditional roles of the parties involved. This paper examines the influence of VR-models on the role of professionals in an architectural competition concerning proposals for rebuilding the city library in Gothenburg. The study shows that VR was experienced as useful by the jury, while troublesome by the architects. In the future architects are likely to have to produce the VR-models for their proposals by themselves. Therefore smaller firms may experience it as difficult to enter the market or to have full control over their VR contributions. Further results show how VR can be more efficiently used in the evaluation process by improving communication between different stakeholders.
Implications of a Data Structure Consistency Checking System
Authors: Viktor Kuncak, Patrick Lam, Karen Zee, Martin Rinard
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

We present a framework for verifying that programs correctly preserve important data structure consistency properties. Results from our implemented system indicate that our system can effectively enable the scalable verification of very precise data structure consistency properties within complete programs. Our system treats both internal properties, which deal with a single data structure implementation, and external properties, which deal with properties that involve multiple data structures. A key aspect of our system is that it enables multiple analysis and verification packages to productively interoperate to analyze a single program. In particular, it supports the targeted use of very precise, unscalable analyses in the context of a larger analysis and verification system. The integration of different analyses in our system is based on a common set-based specification language: precise analyses verify that data structures conform to set specifications, whereas scalable analyses verify relationships between data structures and preconditions of data structure operations.There are several reasons why our system may be of interest in a broader program analysis and verification effort. First, it can ensure that the program satisfies important data structure consistency properties, which is an important goal in and of itself. Second, it can provide information that insulates other analysis and verification tools from having to deal directly with pointers and data structure implementations, thereby enabling these tools to focus on the key properties that they are designed to analyze. Finally, we expect other developers to be able to leverage its basic structuring concepts to enable the scalable verification of other program safety and correctness properties.
Instrument prints in note separation of polyphonic music
Authors: Kristóf Aczél, István Vajk
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Decomposing a polyphonic musical recording to separate instrument tracks or notes has always been a challenge. Such a signal is the superposition of many separate tracks, and it is theoretically impossible to extract the component tracks without the information that was lost at the superposition. One of the ways of note separation is splitting the energy of the recording based on reference models of instruments. This paper introduces a possible structure for these models, concentrating on how they are built into the separation process.
Image Data Hiding Method Based on Multi-Pixel Differencing and LSB Substitution Methods
Authors: Ki-Hyun Jung, Kyeoung-Ju Ha, Kee-Young Yoo
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

A novel data hiding method based on the least significant bit (LSB) substitution and the multi-pixel differencing (MPD) method is presented on the proposed method to improve the capacity of hidden secret data and to provide an imperceptible visual quality. First, a sum of different values for a four-pixel sub-block is calculated. The low value of the sum can be located on a smooth block and the high value is located on an edged block. The secret data are hidden into the cover image by the LSB method in the smooth block, while the MPD method is concealed in the edged block. The experimental results show that the proposed method has a higher capacity and maintains good visual quality.
An Efficient Reputation-Based Routing Mechanism for Wireless Sensor Networks: Testing the Impact of Mobility and Hostile Nodes
Authors: Nathan Lewis, Noria Foukia
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

In previous works, we proposed a routing approach where nodes in a Wireless Sensor Network (WSN) rely on trusted neighbors and neighbors’ reputation to dynamically select the best route to the destination. In this paper, we extend these previous works by adding mobile nodes to the WSN and investigating how the movements of nodes in a mobile WSN affect the success rate of routing data from a source to a destination. We also implement hostile nodes to test how our route selection and reputation mechanisms cope in their presence.
Negotiation by induction
Authors: Chiaki Sakama
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

This paper presents a logical framework for automated negotiation. An agent accepts a proposal if it is proved by its knowledge base. If this is not the case, an agent seeks conditions to accept a proposal or may give up some of its current belief to reach an agreement. These attitudes of agents are characterized using induction and default reasoning.
The derivation of a kinematic model from the dynamic model of the motion of a riderless bicycle
Authors: Y. Yavin
Venue: Computers Mathematics with Applications (2006)

This work deals with the modelling and control of a riderless bicycle (see Figure 1). It is assumed here that the bicycle is controlled by a pedalling torque, a directional torque, and by a rotor mounted on the crossbar that generates a tilting torque. In particular, a kinematic model of the bicycle's motion is derived by using its dynamic model. Then, using this kinematic model, a constraint point-to-point control problem is dealt with.
Multi-agent System Approach to React to Sudden Environmental Changes
Authors: Sarunas Raudys, Antanas Mitasiunas
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Many processes experience abrupt changes in their dynamics. This causes problems for some prediction algorithms which assume that the dynamics of the sequence to be predicted are constant, or at least only change slowly over time. In this paper the problem of predicting sequences with sudden changes in dynamics is considered. For a model of multivariate Gaussian data we derive expected generalization error of standard linear Fisher classifier in situation where after unexpected task change, the classification algorithm learns on a mixture of old and new data. We show both analytically and by an experiment that optimal length of learning sequence depends on complexity of the task, input dimensionality, on the power and periodicity of the changes. The proposed solution is to consider a collection of agents, in this case non-linear single layer perceptrons (agents), trained by a memetic like learning algorithm. The most successful agents are voting for predictions. A grouped structure of the agent population assists in obtaining favorable diversity in the agent population. Efficiency of socially organized evolving multi-agent system is demonstrated on an artificial problem.
Learning Random Monotone DNF
Authors: Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length ≈ logt(n) under the uniform distribution on the Boolean cube {0,1} n . For any function t(n) ≤ poly(n) the algorithm runs in time poly(n,1/¿) and with high probability outputs an ¿-accurate monotone DNF hypothesis. This is the first algorithm that can learn monotone DNF of arbitrary polynomial size in a reasonable average-case model of learning from random examples only.