ppxscal/embedding_network huggingface dataset:
T3 - Tool for Monitoring Agile Development
Authors: Valerie Trapa, Santhpur Rao
Venue: Proceedings of the conference on AGILE 2006 (2006)

The T3 tool is a lightweight framework based on JUnit that provides visibility into project progress to support rapid development. Using story-centric views, Agile teams can quickly assess status, determine dependencies and identify pain-points. We were inspired to create T3 to report realistic project status and improve communication among geographically distributed team members without incurring a lot of extra baggage. This report describes T3, highlights the benefits, and demonstrates its application in a project.
A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints
Authors: Nejla Ghaboosi, Abolfazl T. Haghighat
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

The advent of various real-time multimedia applications in high-speed networks prompt the necessity of quality of service (QoS) based multicast routing and the constrained Steiner tree as the mathematical structure behind it which is a wellknown NP-complete problem. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. In this paper, an algorithm is proposed to solve the bandwidth-delayconstrained least-cost multicast routing problem based on Tabu Search (TS). Computational results for various random generated networks show that the proposed algorithm outperforms other existing TS-based algorithms and heuristics.
The optimizing-simulator: merging simulation and optimization using approximate dynamic programming
Authors: Warren B. Powell
Venue: Proceedings of the 37th conference on Winter simulation (2005)

There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar high-dimensional problems in operations research. Simulation strives to model operations, often using rule-based logic. Optimization strives to find the best possible solution, minimizing costs or maximizing profits. In this tutorial, we show how these two modeling technologies can be brought together, combining the flexibility of simulation with the intelligence of optimization.
Implementing a natural user interface for camera phones using visual tags
Authors: Sanni Siltanen, Jouko Hyväkkä
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

A conventional keypad user interface of mobile phones is unsuitable for some modern situations. Here we present a visual tagging system and show how such a system can be used for fast and efficient user interface, utilizing a camera phone as a pointing device. We also present our two optional mobile phone implementations, one aiming for very fast processing and the other for high detection resolution. These efficient implementations are achieved by taking into account the strict constraints of the mobile environment. We present a flexible system where varying physical and storage sizes of the visual tag can be used in different applications through one interface application and we present some performance statistics of our implementations. We also identify some of the constraints on the mobile device programming environment concentrating on Symbian Series 60 mobile phones.
Trust network analysis with subjective logic
Authors: Audun Jøsang, Ross Hayward, Simon Pope
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formalising trust relationships, e.g. as reputation scores or as subjective trust measures, trust between parties within the community can be derived by analysing the trust paths linking the parties together. This article describes a method for trust network analysis using subjective logic (TNA-SL). It provides a simple notation for expressing transitive trust relationships, and defines a method for simplifying complex trust networks so that they can be expressed in a concise form and be computationally analysed. Trust measures are expressed as beliefs, and subjective logic is used to compute trust between arbitrary parties in the network. We show that TNA-SL is efficient, and illustrate possible applications with examples.
Software Maintenance: Similarity and Inclusion of Rules in Knowledge Extraction
Authors: Marek Reformat, Aashima Kapoor, Nicolino J. Pizzi
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Software maintenance is an important phase in the software live cycle. It focuses on keeping the software fully functional and up to date. Maintenance engineers used different approaches and methods to gain understanding of software systems so maintenance tasks can be performed effectively. A lot of efforts have been put into finding a way to measure maintainability of software. It is a common opinion that software maintainability should be described using a set of measurable software attributes. This paper looks at the issue of rule-based description of attributes of software with different levels of maintainability. Varieties of rules are extracted from a data set that represents human evaluation of maintainability of software objects. Rule similarity and rule inclusion measures are used to identify the most diverse sets of rules representing human evaluation criteria. Additionally, the rules representing all evaluators are analyzed using a rule similarity concept in order to learn more about common evaluation criteria.
What Processing Is Impaired in Apperceptive Agnosia? Evidence from Normal Subjects
Authors: Shaun P. Vecera, Kendra S. Gilds
Venue: Journal of Cognitive Neuroscience (1998)

Visual agnosia is a neuropsychological syndrome characterized by a failure of object identification. Apperceptive agnosia, an object identification deficit caused by damage to early perceptual processes, has been explained by appealing to both damaged early sensory processes and to damaged preattentive grouping processes. Which of these two explanations best accounts for the behavior of these patients? We present results from two experiments designed to distinguish rival theoretical accounts of apperceptive agnosia. In our studies, we attempted to simulate apperceptive agnosia in neurologically intact subjects. Sensory-deficit accounts of the syndrome predict that degrading visual processing would make normal subjects perform like patients; grouping-deficit accounts predict that removing perceptual organization cues from visual displays would make normal subjects perform like patients. We were able to simulate the behavior of an apperceptive agnosic patient by removing perceptual organization cues, consistent with a grouping-deficit account of this syndrome. The implications for understanding both apperceptive agnosia and normal visual functioning are discussed.
Model Driven Design of Distribution Patterns forWeb Service Compositions
Authors: Ronan Barrett, Claus Pahl
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Increasingly, distributed systems are being constructed by composing a number of discrete components. This practice, termed composition, is particularly prevalent within the Web service domain. Here, enterprise systems are built from many existing discrete applications, often legacy applications exposed using Web service interfaces. There are a number of architectural configurations or distribution patterns, which express how a composed system is to be deployed. However, the amount of code required to realise these distribution patterns is considerable. In this paper, we propose a novel Model Driven Architecture using UML 2.0, which takes existing Web service interfaces as its input and generates an executable Web service composition, based on a distribution pattern chosen by the software architect.
Policy-Driven Adaptation of Protocol Stacks
Authors: Liliana Rosa, Antonia Lopes, Luis Rodrigues
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Today's mobile applications need to execute in a wide range of heterogeneous devices, that operate in different conditions. In this context, dynamic adaptation of the underlying communication support is fundamental to achieve adequate performance. We address the problem of supporting dynamic adaptation of communication protocol stacks through a policy-oriented approach, which promotes the separation of adaptation from protocol logic. In this paper, we provide an approach overview, and focus on the policy language and modeling primitives that allow to capture the adaptation requirements identified from the experience with Appia framework.
Interoperating autosched AP using the high level architecture
Authors: Boon Ping Gan, Peter Lendermann, Malcolm Yoke Hean Low, Stephen J. Turner, Xiaoguang Wang, Simon J. E. Taylor
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The High Level Architecture (HLA) is an IEEE standard for interoperating simulation federates. In this paper, we describe a set of requirements that simulation packages need to satisfy in order to be made interoperable using the HLA standard. AutoSched AP, a commercial off-the-shelf simulation package (CSP) which is widely used in the semiconductor industry, was used as a case study for this interoperation exercise. We demonstrated that a straightforward customization of the CSP through a middleware that provides standard functions for interoperation may not provide a satisfactory solution. A specially optimized time synchronization mechanism needs to be installed to ensure good execution efficiency. Experimental results using a Borderless Fab model that comprises of two factory models show that an optimized time synchronization mechanism results in an execution time that is ten times better than a straightforward application of the HLA Runtime Infrastructure's time synchronization mechanism.
Applying Formal Approach to Core Asset Instantiation in Product Line Engineering
Authors: Suk Kyung Shin, Jin Sun Her, Soo Dong Kim
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

As an effective reuse approach, product line engineering (PLE) is used to develop a number of applications by instantiating a reusable core asset. Current research works mostly center on domain engineering, it is yet to define how to instantiate core assets systematically and to validate the instantiation process. We believe that formal specifications have a great potential in defining detailed and precise instantiation process. In this paper, we first define the key elements of core assets, and show how to formally specify core assets Object-Z. Then, we present rules for defining the instantiation process and relevant constraints. Using the proposed formal framework, the task of instantiating core assets can be carried out precisely and correctly, yielding high quality software development.
Sound Localization-Based Navigational User Interfaces
Authors: Arezou Keshavarz, Parham Aarabi
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this paper, we propose and compare three navigational user interfaces that are based on acoustic information. The user can navigate through a web page or change slides in a presentation by changing its spatial location. To this end, we employ an array of 24 microphones to record speech signals and localize the speaker. The proposed interfaces are: 1) The Parallax System, which behaves as if the user is looking out of a window, 2) The Corner System, which resizes each image based on the proximity of the speaker to the corners of the environment, and 3) The Tiled System, which divides the environment into a number of tiles and loads the image corresponding to the tile on which the user is standing on. A set of experiments were performed on 15 participants, which showed that the interaction time required for the Tiled System and the Corner System is far less than that required for the Parallax System. The participants were also asked to rank the ease of use of each of the interfaces; it was observed that the users are more comfortable with an interface that requires minimal interaction time.
Optimized NURBS Ship Hull Fitting using Simulated Annealing
Authors: Ang Swee Wen, Siti Mariyam Hj. Shamsuddin, Yahya Samian
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

The shape of a NURBS curve or surface is defined by the location of its control points, the control points' weights, and the knot vectors. Most of the curve and surface design tried to modify the control points. However, it is still impossible to obtained accurate control points for a reconstructed NURBS curve or surface. The fitness of these surfaces is generally considered a subjective notion depending on the judgment of the designers (eg. visually pleasing, devoid of unnecessary bumps or wiggles, satisfying certain continuity requirements). One of the restriction in ship hull design is that the existing details of a ship design on paper or a ship that already been constructed physically couldn't be reconstructed accurately and concisely in a ship hull design software. This research strives to solve this problem by creating fair ship hull surface using NURBS. An optimized NURBS ship hull fitting approach using simulated annealing is developed. Evaluation and analysis (accuracy, fairness and speed of processing) on the proposed approach is done.
Probabilistic power management for wireless ad hoc networks
Authors: Zongpeng Li, Baochun Li
Venue: Mobile Networks and Applications (2005)

Extending system lifetime by effectively managing power on participating nodes is critical in wireless ad hoc networks. Recent work has shown that, by appropriately powering off nodes, energy may be significantly saved up to a factor of two, especially when node density is high. Such approaches rely on the selection of a virtual backbone (i.e., a connected dominating set) of the topology to forward ongoing traffic, coupled with algorithms to manually and periodically recompute such a backbone for load balancing purposes. The common drawback of such schemes is the need to involve periodic message exchanges and to make additional restrictive assumptions. This paper presents Odds1, an integrated set of energy-efficient and fully distributed algorithms for power management in wireless ad hoc networks. Odds build on the observation that explicit and periodic re-computation of the backbone topology is costly with respect to its additional bandwidth overhead, especially when nodes are densely populated or highly mobile. Building on a fully probabilistic approach, Odds seek to make a minimum overhead, perfectly balanced, and fully localized decision on each node with respect to when and how long it needs to enter standby mode to conserve energy. Such a decision does not rely on periodic message broadcasts in the local neighborhood, so that Odds are scalable as node density increases. Detailed mathematical analysis, discussions and simulation results have shown that Odds are indeed able to achieve our objectives while operating in a wide range of density and traffic loads.
Rockwell Software: arena advanced
Authors: Vivek Bapat
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Designed for experienced simulation practitioners, this session surveys several new concepts and advanced features in Arena. Demonstrations include advanced applications in manufacturing, supply chain, logistics, defense, healthcare, call center and business process scenarios.
A Disc-based Approach to Data Summarization and Privacy Preservation
Authors: Rong Ge, Martin Ester, Wen Jin, Zengjian Hu
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Data summarization has been recognized as a fundamental operation in database systems and data mining with important applications such as data compression and privacy preservation. While the existing methods such as CFvalues and DataBubbles may perform reasonably well, they cannot provide any guarantees on the quality of their results. In this paper, we introduce a summarization approach for numerical data based on discs formalizing the notion of quality. Our objective is to find a minimal set of discs, i.e. spheres satisfying a radius and a significance constraint, covering the given dataset. Since the proposed problem is NP-complete, we design two different approximation algorithms. These algorithms have a quality guarantee, but they do not scale well to large databases. However, the machinery from approximation algorithms allows a precise characterization of a further, heuristic algorithm. This heuristic, efficient algorithm exploits multi-dimensional index structures and can be well-integrated with database systems. The experiments show that our heuristic algorithm generates summaries that outperform the state-of-the-art Data Bubbles in terms of internal measures as well as in terms of external measures when using the data summaries as input for clustering methods.
An agent based evolutionary approach to path detection for off-road vehicle guidance
Authors: Alberto Broggi, Stefano Cattani
Venue: Pattern Recognition Letters (2006)

This paper describes an ant colony optimization approach adopted to decide on road-borders to automatically guide a vehicle developed for the DARPA Grand Challenge 2004, available from: . Due to the complexity of off-road trails and different natural boundaries of the trails, lane markers detection schemes cannot work. Hence border detection is based on ant colony optimization technique. Two borders at two sides of the road (as seen by a camera fixed on the vehicle) are tracked by two agent colonies: agents' moves are inspired by the behaviors of biological ants when trying to find the shortest path from nest to food. Reinforcement learning is done by pheromone updating based on some heuristic function and by changing the heuristic balancing parameters with the experience over the last tracked results. Shadow removal has also been introduced to increase robustness. Results on different off-road environments, as provided in the DARPA Grand Challenge 2004, have been shown in the form of correct detections, false positives and false negatives and their dependence on number of ant-agents and balancing edge-exploitation and pheromone-exploitation.
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Venue: International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems (2006)

Welcome to the 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM). This year the technical program includes 51 high quality papers on wireless and mobile systems, poster and demo sessions plus two keynote addresses from well-known experts in the field. We would like to thank Prof. Alois Ferscha (Johannes Kepler Universität Linz, Austria) and Prof. George C. Polyzos (Athens University of Economics and Business, Greece) for accepting our invitation to be the keynote speakers.MSWiM 2006 also includes four tutorials on quality of service in IP for wireless systems, wireless and multimedia, future open mobile services, and WiFi versus WiMax. Besides, several workshops (MobiWAC, PE-WASUN, Q2SWinet, WMuNeP, PM2HW2N) will be hold focusing on mobility management and wireless access, security, multimedia, and heterogeneous wireless networks.
Drbd in a heartbeat
Authors: Pedro Pla
Venue: Linux Journal (2006)

Build a good redundant system to prevent downtime.
The Relevance of Spatial Play to First and Second Language Acquisition
Authors: Robert C. Meurant
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Spatial play is vitally important to various disciplines in developing spatial intelligence, and awareness of the formal languages used to address space. Spatial language ability is a critical aspect of spatial intelligence and play; but little research attention has been paid towards its L1 or L2 acquisition in such contexts. After reviewing relevant papers, this review identifies a significant shortfall in the research literature regarding spatial play in language acquisition, and suggests various avenues for further research. The nature of spatial play should be clarified, and its role in facilitating language acquisition addressed. Multi-sensory spatial play helps students learn experientially and linguistically, and acquisition of new language should be related to existent spatial language ability. Discovery during spatial play may helpfully destabilize spatial interlanguage, inhibit fossilization and allow development. Collaborative spatial play stimulates spatial language play and thus language acquisition. Architectural design philosophy may contribute to spatial language acquisition theory.
Solving SAT by Accepting Networks of Splicing Processors with Filtered Connections
Authors: Juan Castellanos, Luis Fernando de Mingo Lopez, Victor Mitrana
Venue: Proceedings of the 15th International Conference on Computing (2006)

In this paper we simplify accepting networks of splicing processors considered in [7] by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that input and output filters coincide. Thus, the possibility of controlling the computation in such networks is drastically diminished. In spite of this and of the fact that splicing is not a powerful operation we present here a linear time solution to a much celebrated NP-complete problem, namely SAT, based on these networks viewed as problem solvers. It is worth mentioning that the other resources (number of nodes, symbols, splicing rules, and axioms) of the networks solving instances of SAT are linearly bounded.
Topic Tracer: a Visualization Tool for Quick Reference of Stories Embedded in Document Set
Authors: Mina AKAISHI, Koichi HORI, Ken SATOH
Venue: Proceedings of the conference on Information Visualization (2006)

This paper proposes a visualization tool, called Topic Tracer, to show topic transitions of not only a story existing in a document but also stories traversing over several documents. To visualize topic transition, first we have developed an analytical method to divide a document into parts. Then, we introduce a Word Colony to show topic terms in a whole or a part of document. It is a directed graph which shows the dependency relationships among terms occurrences in the target document. The Word Colony helps users to grasp the overview of a document. The concatenation of Word Colony gives plots of an existing story or crossing stories over several documents. This paper explains the concept and implementation of Topic Tracer using the minutes of the CUBESAT project, "Student-built Educational Pico-Satellite Design", in University of Tokyo.
Insensitive queueing models for communication networks
Authors: T. Bonald
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

A rich class of communication networks can be represented as queueing networks with state-dependent arrival rates and service rates. We provide necessary and sufficient conditions for such queueing networks to be insensitive in the sense that the steady-state distribution depends on the service time distribution at each queue through the mean only. This insensitivity property is key to the development of simple engineering rules that do not require the knowledge of fine traffic statistics.