ppxscal/embedding_network huggingface dataset:
A Projection-Based Multi-view Time-multiplexed Autostereoscopic 3D Display System
Venue: Proceedings of the conference on Information Visualization (2006)

This paper presents our implementation of a multiview autostereoscopic 3D display system by using timemultiplexing approach, Digital Micro-mirror Devices (DMD), and the optical Wedge®. The whole system consists of three major parts: high frame rate DMD projector, an active shutter, and an optical Wedge®. This research investigates and develops the approaches to interface and control DMDs at very high bit rates and ultra-high frame rates to drive a novel flicker-free 3D flat panel device, with a wide viewing area and without need of special viewing glasses or head-tracking system. It needs to design a digital interface circuit capable of receiving video image data in a conventional format and translating it into a form appropriate for display on a DMD light modulator. This approach differs from existing ones in that it facilitates the modulation of the DMD to achieve much high frame rates, though with a trade-off in greyscale resolution. The outcomes of this research will have the great potential for commercialising the autostereoscopic display systems.
A Service-Oriented Virtual Machine for Grid Applications
Authors: Hong Liu, Wei Li, Xiaoning Wang, Yili Gong, Tian Luo
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Grid computing is a new paradigm for distributed computing, and service has become building block of grid applications. However, current approaches can not free developers from low-level laborious work when building grid applications. We propose a serviceoriented virtual machine called Abacus Virtual Machine to simplify the task of grid application development. As a language level virtual machine, it provides a service-oriented instruction set to abstract the operations on the services of a grid application. It also virtualizes services and creates a virtual global system image for grid applications, thus services can be transparently distributed and shared. In this way, Abacus Virtual Machine hides the cumbersome underlying details from programmers and reduces the complexity greatly in grid application development.
Specification Model for Avoiding Miss-Detection of Feature Interactions
Authors: Sachiko Kawada, Masayuki Shimokura, Tadashi Ohta
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

On investigating feature interactions described in the international benchmark for detecting feature interactions, published in 2000, it has been found that they contain many feature interactions that do not actually occur, and that these are the result of ambiguity of service specification descriptions. Such interactions are called "seeming interactions" in this paper. If large numbers of seeming interactions are included in the results of detecting interactions, too much extra time is required for solving interactions. One of the ambiguities of service specification descriptions is a lack of description of timing for triggering each service (called the trigger point: TP). To avoid such seeming interactions, this paper proposes a trigger point model where TPs are defined independently from individual services.
Experiences with MapReduce, an abstraction for large-scale computation
Authors: Jeffrey Dean
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a Map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a Reduce function that merges all intermediate values associated with the same intermediate key. Many real world tasks are expressible in this model. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines.The MapReduce run-time system takes care of the details of partitioning the input data, scheduling the program's execution across a set of machines, handling machine failures, and managing the required intermachine communication. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system.Our implementation of MapReduce runs on a large cluster of commodity machines and is highly scalable: a typical MapReduce computation processes many terabytes of data on thousands of machines. Programmers find the system easy to use: thousands of MapReduce programs have been implemented and several thousand thousand MapReduce jobs are executed on Google's clusters every day.In this talk I'll describe the basic programming model, discuss our experience using it in a variety of domains, and talk about the implications of programming models like MapReduce as one paradigm to simplify development of parallel software for multi-core microprocessors.
Convergence analysis for collective vocabulary development
Authors: Jun Wang, Les Gasser, Jim Houk
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We study how decentralized agents can develop shared vocabularies without global coordination. Answering this question can help us understand the emergence of many communication systems, from bacterial communication to human languages, as well as helping to design algorithms for supporting self-organizing information systems such as social tagging or ad-word systems for the web. We introduce a formal communication model in which senders and receivers can adapt their communicative behaviors through a type of win-stay lose-shift adaptation strategy. We find by simulations and analysis that for a given number of meanings, there exists a threshold for the number of words below which the agents can't converge to a shared vocabulary. Our finding implies that for a communication system to emerge, agents must have the capability of inventing a minimum number of words or sentences. This result also rationalizes the necessity for syntax, as a tool for generating unlimited sentences.
A Hybrid Multipath Routing in Mobile ad hoc Networks
Authors: Chuan-Ching Sue, Ren-Jie Chiou
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Due to the dynamic nature of the network topology and resource constraints, designing an efficient routing in MANETs is challenging. To tolerate communication faults, this study explores the network redundancy through multipath routing. The designated on-demand hybrid multipath routing (OHMR) features two novel characteristics; it establishes multiple nodedisjoint and braided routing paths between a sourcedestination pair and it maintains an end-to-end transmission for a longer period than other multipath routing schemes. Through simulation results, we show OHMR can reduce the frequency of route discoveries and achieve a higher packet delivery ratio.
A New Pricing Approach for Service Network Using Explicit Congestion Notification
Authors: Jun Tao, Dian-Xun Shuai
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Advances in technology have greatly increased the demand for a single integrated service network that can provide multiple service classes for different user requirements. Currently, the predominant form of Internet retail pricing is flat-rate pricing which incurs the inevitable emergence of congestion. So in this paper, we present a new pricing approach for service network using explicit congestion notification. In order to alleviate the congestion and enhance the use of network efficiently, this proposed pricing mechanism charges every user according to their actual usage of network, and keeps the balance of supply and demand between users and network by the fluctuation of price. In the end of this paper, some experiment results suggest this proposed approach is correct, feasible and valid.
Obstructions to branch-decomposition of matroids
Authors: J. Geelen, B. Gerards, N. Robertson, G. Whittle
Venue: Journal of Combinatorial Theory Series B (2006)

A (δ, γ)-net in a matroid M is a pair (N, P) where N is a minor of M,P is a set of series classes in N, |P| ≥ δ, and the pairwise connectivity, in M, between any two members of P is at least γ. We prove that, for any finite field F, nets provide a qualitative characterization for branch-width in the class of F-representable matroids. That is, for an F-representable matroid M, we prove that: (1) if M contains a (δ, γ)-net where δ and γ are both very large, then M has large branch-width, and, conversely, (2) if the branch-width of M is very large, then M or M* contains a (δ, γ)-net where δ and γ are both large.
A Method for Associating Patterns of Motion in Events from Video: A Case Study
Authors: Nikolaos Bourbakis, George Bebis
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Representing, associating, interpreting and learning behavioral patterns and rules from observation is always a challenging research problem for cognitive systems and human computer interaction. This problem becomes more difficult in complex environments with many unexpected behavioral patterns from objects, or cells, or individuals or small group of people acting under certain plans at the same time in different locations. This paper targets the development of a novel synergistic methodology for automatically monitoring, representing,, associating and interpreting behavioral patterns and activities, and learning rules from complex environments using videos.
Service Matchmaking and Discovery with Rough Sets
Authors: Bin Yu, Wenming Guo, Maozhen Li, Yong-Hua Song, Peter Hobson, Man Qi
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The past few years have seen the Grid is evolving as a service-oriented computing infrastructure. It is foreseen that various resources in a Grid environment will be exposed as services for use by a wider user community. Service discovery becomes an issue of vital importance for utilising Grid facilities. This paper presents Rosse, a Rough Sets based Search Engine for service discovery that can deal with uncertainty of service properties when matching service advertisements with service requests. The evaluation results show that Rosse is more effective in service discovery compared with other mechanisms such as UDDI keyword matching and OWL-S matchmaking.
Mining the meaningful term conjunctions from materialised faceted taxonomies: algorithms and complexity
Authors: Yannis Tzitzikas, Anastasia Analyti
Venue: Knowledge and Information Systems (2006)

A materialised faceted taxonomy is an information source where the objects of interest are indexed according to a faceted taxonomy. This paper shows how from a materialised faceted taxonomy, we can mine an expression of the Compound Term Composition Algebra that specifies exactly those compound terms (conjunctions of terms) that have non-empty interpretation. The mined expressions can be used for encoding in a very compact form (and subsequently reusing), the domain knowledge that is stored in existing materialised faceted taxonomies. A distinctive characteristic of this mining task is that the focus is given on minimising the storage space requirements of the mined set of compound terms. This paper formulates the problem of expression mining, gives several algorithms for expression mining, analyses their computational complexity, provides techniques for optimisation, and discusses several novel applications that now become possible.
Learning from Designing a Project Website among Sixth Graders
Authors: Lih-Juan ChanLin
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The design of project websites provides students with opportunities to appreciate the meaningfulness of their learning process and outcomes. Students are encouraged to be self-directed, and use the Internet as a research and problem-solving tools that allow information to be gathered, shared and consulted to facilitate synthesis of knowledge. In this study, students' reactions toward their design of their project website were assessed They reported a higher level in making good use of web-based information, valued highly the use of computer skills for preparing research project and accomplishing the research project. They also responded positively about learning different knowledge. However, slightly lower level was found for working with group members.
A multiple time scale minimum variance beamformer
Authors: G. H. Niezgoda, J. L. Krolik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Expressions for mean output power and mean squared error are derived for the multiple time scale minimum variance beamformer in terms of adaptive degrees of freedom (DOF) and adaptation time scale when the same input data block is used to update weights and output. Analysis reveals the necessity of placing constraints on adaptation time scales to ensure the beamformer output is not ill-defined. It is shown that a signal cancellation effect arises when the same input data block is used to compute beamformer weights and form the output. The applicability of a multiple time scale beamformer when measurements consist of signals which are stationary over different time periods was demonstrated by simulation.
Games with a Purpose
Authors: Luis von Ahn
Venue: Computer (2006)

Through online games, people can collectively solve large-scale computational problems.
Structured additive regression for overdispersed and zero-inflated count data: Research Articles
Authors: Ludwig Fahrmeir, Leyre Osuna Echavarría
Venue: Applied Stochastic Models in Business and Industry (2006)

In count data regression there can be several problems that prevent the use of the standard Poisson log-linear model: overdispersion, caused by unobserved heterogeneity or correlation, excess of zeros, non-linear effects of continuous covariates or of time scales, and spatial effects. We develop Bayesian count data models that can deal with these issues simultaneously and within a unified inferential approach. Models for overdispersed or zero-inflated data are combined with semiparametrically structured additive predictors, resulting in a rich class of count data regression models. Inference is fully Bayesian and is carried out by computationally efficient MCMC techniques. Simulation studies investigate performance, in particular how well different model components can be identified. Applications to patent data and to data from a car insurance illustrate the potential and, to some extent, limitations of our approach. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Using agent-based modeling and human-in-the-loop simulation to analyze army acquisition programs
Authors: Patrick M. Downes, Michael J. Kwinn,  Jr., Donald E. Brown
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The purpose of this research is to demonstrate the usefulness of integrating human-in-the-loop simulations and agent based modeling. The integration of a human-in-the-loop simulation with an agent based model can model information technology systems. This integration allows analysts to exploit the strengths and advantages of each of these two model types. The integration and power of these models together diminishes each of the models own inherent disadvantages and limitations. This unique partnership between two distinct model types can tell analysts how well information technology systems provide users with information, data, and intelligence. This valuable insight about information systems' performance can be an indispensable aide to those interested in comparing, rating, and acquiring alternative information systems.
A real-time knowledge-based decission support system for health care quality improvement using discrete event simulation techniques
Authors: Alexander Komashie, Ali Mousavi, Mustafa Ozbayrak
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The quality of health care is increasingly receiving more and more emphases in almost all developed countries. Traditional health care Quality Assurance (QA) models have always been implemented in retrospect depending heavily on surveys. The objective of this research is to develop a novel and more reliable approach to the monitoring and improvement of health care quality. This approach is based on a real-time simulation system that monitors a Health Care Quality Index (HCQI). This system will map the HCQI which is a function of process factors (e.g. waiting time), against the patients' expectations and hence give health care managers the 'local' information needed to continuously adjust performance without waiting for an annual survey. Being a real-time system, managers will have the ability to run fast-forward simulation to help predict future demands and make decisions accordingly. This will be a key to Continuous Quality Improvement (CQI) in health care.
A Logging-Based Approach for Building More Robust Multi-agent Systems
Authors: Amy Unruh, James Bailey, Kotagiri Ramamohanarao
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

In an agent system, the ability to handle problems and recover from them is important in sustaining stability and providing robustness. We claim that execution logging is essential to support agent system robustness, and that agents should have architectural-level support for logging and recovery methods. We describe an infrastructure-level, default methodology for agent problem-handling, based on logging, and supported by declaratively encoding domain-specific knowledge related to changes in goal status and semantic compensations. Via logging, the approach allows repair of already-completed as well as current goals. We define a language, APLR, to support and constrain incremental specification of problem-handling information, with the agents' problem-handling behaviour increasing in sophistication as more knowledge is added to the system. The approach is implemented by mapping the methodology and domain knowledge to 3APL-like plan rules extended to support logging.
A study on success factors of logistics IT companies
Authors: Nam Kyu Park, Gye Eui Song, Hyung Rim Choi, Chang Sup Lee, Chan Woo Kim, Joong Jo Shin
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)

Under this economic circumstance, the logistics firms located in port take better advantages than those in other areas. This study observed those firms with consciousness to which matters were affected a growth of the logistics IT firms. This study considered in terms of three factors which are an economic factor, a political factor and an internal-ability factor for the matters of logistics IT firms' success through the factor analysis. According to the factor analysis, subjective factors showed positive: (1) expanding market through the ideas and abilities, (2) internal relations and government support (3) capability of market identification and focusing on regional industrialization. As a result of the internal ability analysis, there were three positive matters such as (1) a factor of organization or human resource management, (2) relationship with consumer and resource and management ability for strategy, and (3) developing unique product, networking, suitable goods of regional industrialization. The external factor, through the factor analysis was turned out (1) an emerged political factor such as a support up venture, cluster composition, investing R&D and specialist training, (2) economic factor such as tax reduction, financial support, marketing collaboration, and renting office in a low price by regional government.
Inter-Access point communications for distributed resource management in 802.11 networks
Authors: Eduard Garcia, Lluís Faixó, Rafael Vidal, Josep Paradells
Venue: Proceedings of the 4th international workshop on Wireless mobile applications and services on WLAN hotspots (2006)

Due to the increasing number of IEEE 802.11 networks, the presence of interference is becoming an important problem to solve. In a single multicell network, the harmful effect of interference is minimized thanks to network planning; but if there are different wireless networks coexisting, which besides, belong to different owners, the presence of a distributed resource management mechanism becomes the best choice. A distributed management system involves communication among all participant devices. In the present paper two mechanisms are proposed: channel allocation algorithm and load balancing through cell breathing. The questions raised by these new communication needs are analyzed and also, different solutions are proposed based on a common idea: use of Access Points (APs) with two radio interfaces adopting ad-hoc networking mechanisms for inter-AP signaling purposes.
Simulation validation with historic outcomes
Authors: Lance E. Champagne, Raymond R. Hill
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Combat, unlike many real-world processes, tends to be singular in nature. That is, there are not multiple occurrences from which to hypothesize a probability distribution model of the real-world system. Mission-level models may offer more flexibility on some measures due to their extended time frame. Additionally, the parameters involved in the mission-level model may be unchanged for significant stretches of the total simulation time. In these cases, time periods may be devised so that the periods hold sufficiently similar traits such that the incremental results may be assumed to come from a common distribution. This paper details a new statistical methodology for use in validating an agent-based mission-level model. The test is developed within the context of the Bay of Biscay agent-based simulation and uses the monthly data from the extended campaign as a basis of comparison to the simulation output.
Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
Authors: Abraham P. George, Warren B. Powell
Venue: Machine Learning (2006)

We address the problem of determining optimal stepsizes for estimating parameters in the context of approximate dynamic programming. The sufficient conditions for convergence of the stepsize rules have been known for 50 years, but practical computational work tends to use formulas with parameters that have to be tuned for specific applications. The problem is that in most applications in dynamic programming, observations for estimating a value function typically come from a data series that can be initially highly transient. The degree of transience affects the choice of stepsize parameters that produce the fastest convergence. In addition, the degree of initial transience can vary widely among the value function parameters for the same dynamic program. This paper reviews the literature on deterministic and stochastic stepsize rules, and derives formulas for optimal stepsizes for minimizing estimation error. This formula assumes certain parameters are known, and an approximation is proposed for the case where the parameters are unknown. Experimental work shows that the approximation provides faster convergence than other popular formulas.