ppxscal/embedding_network huggingface dataset:
Verifying Stochastic Well-formed Nets with CSL Model-Checking Tools
Authors: D. Cerotti, D. D'Aprile, S. Donatelli, J. Sproston
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

Model-checking algorithms for Continuous Stochastic Logic (CSL) properties have been introduced to facilitate the verification of stochastic systems against a variety of formally-defined performance indices. In this paper, we consider the application of CSL modelchecking methods and tools to Stochastic Well-formed Nets (SWN), a colored extension of Stochastic Petri Nets (SPN). Our approach is to connect an existing tool for the description and performance analysis of SWN, called GREATSPN, to two model-checking tools for CSL properties, namely PRISM and MRMC. We illustrate our approach using a simple example of resource usage. As a by-product of the implementation of the model translation from GREATSPN to PRISM, a method for unfolding SWN models into SPN models has been implemented, as a standalone, re-usable component.
Optimal (2, n) visual cryptographic schemes
Authors: Mausumi Bose, Rahul Mukerjee
Venue: Designs, Codes and Cryptography (2006)

In (2,n) visual cryptographic schemes, a secret image(text or picture) is encrypted into n shares, which are distributed among n participants. The image cannot be decoded from any single share but any two participants can together decode it visually, without using any complex decoding mechanism. In this paper, we introduce three meaningful optimality criteria for evaluating different schemes and show that some classes of combinatorial designs, such as BIB designs, PBIB designs and regular graph designs, can yield a large number of black and white (2,n) schemes that are optimal with respect to all these criteria. For a practically useful range of n, we also obtain optimal schemes with the smallest possible pixel expansion.
AcadeMix Juice- A Hybrid Web 2.0/Semantic Web Platform for Exchange of Academic Knowledge
Authors: Yuri Tijerino, Hirohisa Masaki, Nobuku Igaki
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In this paper, we introduce an academic support system with a participative architecture, which attempts to overcome the cultural hierarchical barriers that prevent communication, collaboration and exchange of academic materials in Japanese institutions of higher learning among undergraduates, graduates and faculty. This system, which we dubbed AcadeMix Juice, promotes participative interactions among its users through a set of functional characteristics that include: 1) social publication, 2) self-organizing interest groups, 3) resource-centered communication, 4) inter-field collaborative summarizations, 5) personal academic space, and 6) semantic annotation for personal academic assistants. AcadeMix Juice also promotes interdisciplinary interaction and collaboration among its users through inter-field collaborative summarization. All materials in AcadeMix Juice are annotated and made available to members, visitors or Semantic Web agents through an academic ontology, which is based on a extended Learning Object Meta-data (LOM) ontology. This ontology supports extensional semantic evolution through integration with folksonomies and personal bookmarks.
Transcranial Magnetic Stimulation of the Human Frontal Eye Field: Effects on Visual Perception and Attention
Authors: Marie-Hélène Grosbras, Tomáš Paus
Venue: Journal of Cognitive Neuroscience (2002)

When looking at one object, human subjects can shift their attention to another object in their visual field without moving the eyes. Such shifts of attention activate the same brain regions as those involved in the execution of eye movements. Here we investigate the role of one of the main cortical oculomotor area, namely, the frontal eye field (FEF), in shifts of attention. We used transcranial magnetic stimulation (TMS), a technique known to disrupt transiently eye-movements preparation. We hypothesized that if the FEF is a necessary element in the network involved in shifting attention without moving the eyes, then TMS should also disrupt visuospatial attention.For each volunteer, we positioned the TMS coil over the probabilistic anatomical location of the FEF, and we verified that single pulses delayed eye movements. We then applied TMS during a visuospatial attention task. In this task, a central arrow directed shifts of attention and the subject responded by a keypress to a subsequent visual peripheral target without moving the eyes from the central fixation point. In a few trials, the cue was invalid or uninformative, yielding slower responses than when the cue was valid. We delivered single pulses either 53 msec before or 70 msec after target onset.Contrary to our prediction, the main effect of the stimulation was a decrease in reaction time when it was applied 53 msec before target onset. TMS over the left hemisphere facilitated responses to targets in the right hemifield only and for all cueing conditions, whereas TMS over the right hemisphere had a bilateral effect for valid and neutral but not invalid cueing. Thus, TMS interfered with shift of attention only in the case of right hemisphere stimulation: it increased the cost of invalid cueing.Our results suggest that TMS over the FEF facilitates visual detection, and thereby reduces reaction time. This finding provides new insights into the role of the human FEF in processing visual information. The functional asymmetry observed for both facilitation of visual detection and interference with shifts of attention provides further evidence for the dominance of the right hemisphere for those processes. Our results also underline that the disruptive or facilitative effect of TMS over a given region depends upon the behavioral context.
Levitation-guidance stabilization of superconducting maglev through LSM currents
Authors: Tetsuzo Sakamoto, Masaki Nakayama
Venue: Mathematics and Computers in Simulation (2006)

This paper presents a modeling and simulation of a superconducting maglev vehicle with a levitation and guidance assist method we have proposed. The assist system stabilizes and assists the vehicle operation so that the vehicle does not need to depend on the mechanical wheels as much as possible at low speeds. By controlling the LSM armature currents, the auxiliary levitation and guidance forces are provided. The results show that the assist system produces appropriate levitation and guidance forces, establishing the reference levitation height and a sufficient guidance at low speeds even against the disturbance force of lateral wind.
Digital Camera Resolution: An Improved Heisenberg-Gabor Testing Method
Authors: Corey Manders, Steve Mann
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The paper demonstrates a method of simultaneously testing the spatial and tonal resolution of a camera. Unlike the modulation transfer function which has been used in the past, the measure proposed rates the resolution as a single number rather than a response over varied resolution, simplifying the measure and making it possible to compare the performance of different camera cameras easily. Previous work was subject to perturbations caused by aliasing at high frequencies. The measure proposed is immune to such perturbations, and is therefore appropriate for measuring a wide range of image sensing systems.
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
Authors: Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudha Bhatnagar
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyclic manner (or block cyclic manner if the data is bursty) to balance the load among processors. The algorithm is implemented on a message passing share-nothing model. Experiments show that for very large data sets the algorithm scales nearly linearly with the increasing number of processors. Experiments also show that clusters obtained by PBIRCH are comparable to those obtained using BIRCH.
Computationally efficient and revenue optimized auctioneer's strategy for expanding auctions
Authors: Onn Shehory, Eran Dror
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

An expanding auction---a special type of an ascending-price open-cry auction---allows the auctioneer to dynamically add (identical) items to the single item offered initially. Expanding auctions are becoming an increasingly popular business-to-consumer auction mechanism. The auctioneer's revenue from an expanding auction depends, in large part, on its schedule for increasing the number of units offered. As we show, the na&iuml;ve strategies commonly used for increasing the number of items offered in contemporary e-commerce implementations of expanding auctions are sub-optimal. In this study we provide a strategy that, given some assumptions about buyers' behaviors, maximizes the expected revenues of the auctioneer in an expanding auction. We model the auction process as a state graph in which nodes are auction states and edges are transitions. With this model, finding the optimal strategy is equivalent to solving a search problem on the state graph. We prove that the search problem to be solved, although seemingly exponentially complex, is actually linearly bounded. Based on this result, we introduce an informed decision strategy that optimizes the auctioneer's revenue.
Organizing technology enhanced learning
Authors: Markus Schmees
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Organizational units like courses have different agendas in technology enhanced learning. They must abide by organizational regulations, obtain sustainable learning results, and limit incurring expenses. Various software systems support educational activities, but cannot observe these rules generally. This article presents a way to integrate concepts of electronic commerce for this purpose. Basic idea is to implement organizational rules with help of involved learning applications. For this purpose, concepts of technology enhanced learning are mapped on established concepts of electronic commerce. A database schema is designed that allows specifying rules and a framework is developed to ensure compliance with them. Finally, a methodology is presented to integrate this framework in various learning applications. Thus, compliance with organizational rules is ensured both within one application and cross-system. Above all, organizational units can test auspicious scenarios by specifying own rules. Already known and established applications can be extended easily and act as a testbed for further studies.
Toward Quasiregular Sensor Networks: Topology Control Algorithms for Improved Energy Efficiency
Authors: Xiaowen Liu, Martin Haenggi
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Uniformly random or Poisson distributions are widely accepted models for the location of the nodes in wireless sensor networks if nodes are deployed in large quantities and there is little control over where they are dropped. On the other hand, by placing nodes in regular topologies, we expect benefits both in coverage and efficiency of communication. We describe and analyze a basic localized algorithm and three modifications for topology control that provide a tradeoff between performance and deployment cost. The objective is to regularize the topology for improved energy efficiency. The basic algorithm produces quasiregular networks, which only use nodes as sentries and relays that are approximately evenly spaced, thereby emulating a regular grid topology. It is shown that quasiregular networks have a significant energy and lifetime advantage compared with purely random networks. We consider two specific types of quasiregular networks: the ones that are based on a Gaussian deviation about an ideal grid point (type A), and the ones that consist of a subset of nodes taken from a Poisson point process (type B). We show that the two types are equivalent for a certain density of the Poisson point process and, in particular, that in both cases the deviation from the ideal regular grid follows a Rayleigh distribution, whereas the distance between nearest neighbors is Ricean.
Hairstyle Construction from Raw Surface Data
Authors: Gerrit Sobottka, Michael Kusak, Andreas Weber
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

We present a novel approach to the problem of hairstyle construction from raw surface data such as the ones obtained from surface scans. Our approach is based on a shape matching algorithm that fits individual hair fibers into a given volume according to a set of boundary conditions and additional hair density information. Our method employs a mechanical rod model based on the special theory of Cosserat rods. Such models can efficiently be used to simulate the deformation of individual fibers in subsequent manipulation steps.
A framework for software product engineering
Authors: Kesav Nori, N. Swaminathan
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Software engineering today is heavily focused on the ideas of process maturity and continuous improvement. Processes are designed to deliver products. Process engineering should ideally rest on theoretical foundations of sound product engineering; however the field is currently lacking such foundations. Drawing inspiration from compiler design, we present a systematic framework for software product engineering that develops the product through successive levels of realization. The framework separates the concerns in software development by relating each level to a knowledge domain and localizing exactly on those qualities that become manifest in that knowledge domain. The basis of the framework is a mathematical model for reasoning about the correctness of realization schemes as well as the transformations between levels, so that each level preserves previously created qualities while adding new desired qualities. We also discuss some of the practical aspects of implementing this approach.
Medium caliber cannon lethality study for future and current infantry fighting vehicles
Authors: Russell Schott, Patrick Downes, Rocky Gay, Nate Whitten, James Paine, Michael Goddard, Michael Rybacki, William Klimack
Venue: Proceedings of the 36th conference on Winter simulation (2004)

According to the Army Chief of Staff, the Army's infantry fighting vehicle, the Bradley Fighting Vehicle, will be in service until 2032. The Bradley Fighting Vehicle needs an improved medium caliber cannon to defeat the growing threats from improved light armored vehicles and hand held rocket propelled grenades. The Army can continue to keep the Bradley Fighting Vehicle in service by increasing the lethality of its weapon systems. We examine six medium caliber cannons and their impact on the battlefield. We also examine the use of new medium caliber air burst munitions. Combat modeling and simulation using the Joint Conflict and Tactical Simulation (JCATS) is used to predict the contributions of these new technologies to the infantry soldier. Multiple mission scenarios in different environments to include Baghdad urban combat are examined. The medium caliber cannon selected will be the final lethality enhancement for the Bradley.
Combining partial evaluation and staged interpretation in the implementation of domain-specific languages
Authors: Christoph A. Herrmann, Tobias Langhammer
Venue: Science of Computer Programming (2006)

We propose a combination of partial evaluation and staged interpretation with MetaOCaml for rapid prototyping of domain-specific languages. Interpretation is an easy way to implement such languages. MetaOCaml can eliminate the overhead of interpretation at run-time, if the interpreter is written in a staged form, i.e., takes the source program separate from the input data in a first stage. Partial evaluation of the source program with values known at compile time can further improve the target code performance. Additional aggressive optimizations are possible due to the absence of general recursion. Algebraic simplifications can even achieve binding-time improvements during the online partial evaluation. Our approach both saves the application programmer completely from binding-time considerations and exploits staged interpretation with MetaOCaml for target code generation.The example domain presented in this paper is image processing, in which the domain-specific language permits the specification of convolution matrices, summations, case distinctions and non-local pixel accesses. All expressions known at compile time are simplified and all remaining expressions are turned into MetaOCaml code parts, which are combined to form the compiled application program.The example specifications deal with filtering by convolution and iterations in a series of images for wave effects and temperature distribution.The experimental results show significant speed-ups if online partial evaluation with algebraic simplifications is used for the elimination of interpretation overhead and optimization of code expressions.
Enhancing Wireless Patient Monitoring by Integrating Stored and Live Patient Information
Authors: Upkar Varshney
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Patient monitoring using wireless technologies has been considered for improving the quality of healthcare to an increased number of patients, including those suffering from physical and cognitive disabilities. For such patients, comprehensive and reliable wireless patient monitoring system should be designed that can operate autonomously. In this paper, we propose that comprehensive patient monitoring should involve the use of stored healthcare information and transmission of live vital signs. In simple terms, the use of stored knowledge (such as nominal vital signs and patient's individual thresholds) could compensate for the limited resources of underlying wireless networks, especially under times of significant traffic. This will allow the delivery of patient related information to one of more healthcare professionals in reasonable time as the traffic per monitoring event is reduced. To enhance the quality of patient monitoring, we present reliable wireless architecture and propose that context-awareness should be utilized in the healthcare delivery decision.
Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks
Authors: Shigang Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

A wireless sensor network is constrained by computation capability, memory space, communication bandwidth, and above all, energy supply. When a critical event triggers a surge of data generated by the sensors, congestion may occur as data packets converge toward a sink. Congestion causes energy waste, throughput reduction, and information loss. However, the important problem of congestion avoidance in sensor networks is largely open. This paper proposes a congestion-avoidance scheme based on light-weight buffer management. We describe simple yet effective approaches that prevent data packets from overflowing the buffer space of the intermediate sensors. These approaches automatically adapt the sensors' forwarding rates to nearly optimal without causing congestion. We discuss how to implement buffer-based congestion avoidance with different MAC protocols. In particular, for CSMA with implicit ACK, our 1/k{\hbox{-}}{\rm{buffer}} solution prevents hidden terminals from causing congestion. We demonstrate how to maintain near-optimal throughput with a small buffer at each sensor and how to achieve congestion-free load balancing when there are multiple routing paths toward multiple sinks.
A kind of E-government website evaluation method based on Neural Network
Authors: Chun Hua Ju, Ying Liang, Dong Sheng Liu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper presents a new method to evaluate the performance of the E-government website with Neural Network technology. The evaluation model, based on BP neural network and Principal Component Analysis, raises the performance of the network. And it guarantees the objectivity and scientific of the evaluation result. This method analyzed a lot of data with Principal Component Analysis Method and the main evaluation factors were picked up. Dimensions were declined effectively on condition that evaluation information was reserved. BP neural Network was used to fix on the weights of indices. It weakens the random and appraiser's subjectivity when fixing the index weight in evaluation. With the application and verification in E-government sites of Ningbo 2006, the model based on BP Neural Network has an extensive foreground and application value.
TCS Academic Interface Program (AIP) A symbol of industry - academia cooperation
Authors: R. Narayanan
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

Tata Consultancy Services Ltd. (TCS) has been supporting the academic community across the globe, right from its inception three decades back. Over the last three years, a comprehensive Academic Interface Programme (AIP) has been institutionalized with defined processes, performance metrics and deployment structure. This has facilitated a robust, highquality, long- term relationship between TCS and Academia, leading to a win-win situation for both. This position paper shares the details of such a fruitful experience.
Finding maximum square-free 2-matchings in bipartite graphs
Authors: David Hartvigsen
Venue: Journal of Combinatorial Theory Series B (2006)

A 2-matching in a simple graph is a subset of edges such that every node of the graph is incident with at most two edges of the subset. A maximum 2-matching is a 2-matching of maximum size. The problem of finding a maximum 2-matching is a relaxation of the problem of finding a Hamilton tour in a graph. In this paper we study, in bipartite graphs, a problem of intermediate difficulty: The problem of finding a maximum 2-matching that contains no 4-cycles. Our main result is a polynomial time algorithm for this problem. We also present a min-max theorem.
Multi-aspect ERP Data Analysis for Understanding Human Calculation Related Information Processing Mechanism
Authors: Shinichi Motomura, Akinori Hara, Ning Zhong, Jing-Long Wu
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In the paper, we propose a multi-aspect data mining process for investigating a more whole human information process mechanism systematically. As an example to demonstrate the proposed mining process, we explain how to design the experiment of an ERP mental arithmetic task with visual and auditory stimuli, and describe how to do multi-aspect analysis in the obtained ERP data, respectively. Furthermore, we give some preliminary results to show the usefulness of our methodology and to discuss the future research directions. The proposed methodology attempts to change the perspective of cognitive scientists from a single type of experimental data analysis towards a holistic view at a long-term, global field of vision.