ppxscal/embedding_network huggingface dataset:
Software Product Line Variability Management
Authors: Klaus Pohl, Frank van der Linden, Andreas Metzger
Venue: Proceedings of the 10th International on Software Product Line Conference (2006)

Software product line engineering (SPLE) is the approach for creating a diversity of similar products at low cost, in short time, and with high quality. Explicitly documenting product line variability is essential for variability management as it significantly supports the following activities:Defining the commonality and the variability of the product line during domain engineering; Realizing reusable artifacts (the domain artifacts) with variability; Defining the binding of variability during application engineering; Deriving individual applications by exploiting the variability in the domain artifacts.This tutorial is based on our text book on software product line engineering [1]. The tutorial is structured along an SPLE framework, which has been defined based on our experiences and the results of the European software product line research projects ESAPS, CAFÉ, and FAMILIES [2].
Simulation-based layout planning of a production plant
Authors: Mert Altinkilinc
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper presents a study that uses simulation to improve shop floor performance by means of two layout types and certain operational parameters. In this study, an overview of the plant layout problem is covered for the particular company. The original motivation for redesigning the entire shop floor was the need to realize improvements in material flow and output level. First, the performance of the existing system was evaluated by using ARENA. Second, manufacturing cells were formed and group technology layout was developed by means of Rank Order Clustering (ROC) method and Computerized Relative Allocation of Facilities Technique (CRAFT). Finally, the performance of the new system was evaluated and compared with that of the current system.
Discovering Web Services Based on Functional Semantics
Authors: Lei Ye, Bin Zhang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

With the rapid development of web services technologies, discovering web services is becoming the most urgent problem to be resolved. The existing web service discovery methods are not mature, and cannot cope with the requests from different fields very well. In this paper we suggest an effective and feasible approach of web service discovery based on functional semantics. We define web services functional semantic description that provides a unified manner to semantically describe the function of web service for service providers and customers. In order to avoid semantic heterogeneity, we build domain-oriented functional ontology and propose semantic annotation mechanism. Then we describe the matching algorithm. Finally we evaluate the performance of our algorithm by an experimental setup. The results of the experiment prove that our approach is feasible and effective.
Widths and shape-preserving widths of Sobolev-type classes of s-monotone functions
Authors: J. Gilewicz, V. N. Konovalov, D. Leviatan
Venue: Journal of Approximation Theory (2006)

Let Ibe a finite interval, r, n ∈ N, s ∈ N0 and 1 ≤ p ≤ ∞ Given a set M, of functions defined on I denote Dy Δ+ s M the subset of all functions y ∈ M such that the s-difference Δτs y (ċ) is nonnegative on I, ∀ τ > 0. Further, denote by Wpr the Sobolev class of functions x on I with the seminorm ||x(r)||Lp ≤ 1. We obtain the exact orders of the Kolmogorov and the linear widths, and of the shape-preserving widths of the classes Δ+s Wpr in Lq for s > r + 1 and (r, p, q) ≠ (1, 1, ∞). We show that while the widths of the classes depend in an essential way on the parameter s, which characterizes the shape of functions, the shape-preserving widths of these classes remain asymptotically = n-2.
New EM derived from Kullback-Leibler divergence
Authors: Longin Jan Latecki, Marc Sobel, Rolf Lakaemper
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we use nonparametric density estimation to improve parametric density estimation in the EM framework. While the classical EM algorithm estimates model parameters empirically using the data points themselves, we estimate them using nonparametric density estimates.There exist many possible applications that require optimal adjustment of model components. We present experimental results in two domains. One is polygonal approximation of laser range data, which is an active research topic in robot navigation. The other is grouping of edge pixels to contour boundaries, which still belongs to unsolved problems in computer vision.
Protection of MP3 Music Files Using Digital Rights Management and Symmetric Ciphering
Authors: Carlos Serrao, Antonio Serra, Miguel Dias, Jaime Delgado
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

This paper presents part the work conducted on the IST FP6 MediaNet Integrated Project to implement a Media Center solution integrated in a Home Netwok environment. This Media Center solution -- which was called MediaBox -- allowed the user to access from his/her home to DRM-protected music from online digital music stores. The paper describes the specific work that was conducted in the protection of the MP3 music files and on the specific mechanisms of the DRM platform. These DRM mechanisms allow both the protection of the music file as well as the conditional music rendering at the end-user side, on a client-side platform -- the MediaBox.
Adaptive Optimization of IEEE 802.11 DCF Based on Bayesian Estimation of the Number of Competing Terminals
Authors: Alberto Lopez Toledo, Tom Vercauteren, Xiaodong Wang
Venue: IEEE Transactions on Mobile Computing (2006)

The performance of the Distributed Coordination Function (DCF) of the IEEE 802.11 protocol has been shown to heavily depend on the number of terminals accessing the distributed medium. The DCF uses a carrier sense multiple access scheme with collision avoidance (CSMA/CA), where the backoff parameters are fixed and determined by the standard. While those parameters were chosen to provide a good protocol performance, they fail to provide an optimum utilization of the channel in many scenarios. In particular, under heavy load scenarios, the utilization of the medium can drop tenfold. Most of the optimization mechanisms proposed in the literature are based on adapting the DCF backoff parameters to the estimate of the number of competing terminals in the network. However, existing estimation algorithms are either inaccurate or too complex. In this paper, we propose an enhanced version of the IEEE 802.11 DCF that employs an adaptive estimator of the number of competing terminals based on sequential Monte Carlo methods. The algorithm uses a Bayesian approach, optimizing the backoff parameters of the DCF based on the predictive distribution of the number of competing terminals. We show that our algorithm is simple yet highly accurate even at small time scales. We implement our proposed new DCF in the ns-2 simulator and show that it outperforms existing methods. We also show that its accuracy can be used to improve the results of the protocol even when the terminals are not in saturation mode. Moreover, we show that there exists a Nash equilibrium strategy that prevents rogue terminals from changing their parameters for their own benefit, making the algorithm safely applicable in a complete distributed fashion.
OSGARToolKit: tangible + transitional 3D collaborative mixed reality framework
Authors: Raphaël Grasset, Julian Looser, Mark Billinghurst
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In recent years there have been a number of software frameworks proposed for developing augmented reality (AR) applications. However these frameworks typically do not address three types of interfaces; tangible, transitional and collaborative user interfaces. In this paper we describe a new software framework weve developed that focuses on these three characteristics.Firstly, we introduce a simple way to build complex tangible applications using a rapid-prototyping approach. Secondly, we offer an environment to build and support transitional interface. Finally, our framework offers a simple way to support collaborative requirements combined with the use of the GPU for improving user awareness.
Correlates of Capture of Attention and Inhibition of Return across Stages of Visual Processing
Authors: Jillian H. Fecteau, Douglas P. Munoz
Venue: Journal of Cognitive Neuroscience (2005)

How do visual signals evolve from early to late stages in sensory processing? We explored this question by examining two neural correlates of spatial attention. The capture of attention and inhibition of return refer to the initial advantage and subsequent disadvantage to respond to a visual target that follows an irrelevant visual cue at the same location. In the intermediate layers of the superior colliculus (a region that receives input from late stages in visual processing), both behavioral effects link to changes in the neural representation of the target: strong target-related activity correlates with the capture of attention and weak target-related activity correlates with inhibition of return. Contrasting these correlates with those obtained in the superficial layers (a functionally distinct region that receives input from early stages in visual processing), we show that the target-related activity of neurons in the intermediate layers was the best predictor of orienting behavior, although dramatic changes in the target-related response were observed in both subregions. We describe the important consequences of these findings for understanding the neural basis of the capture of attention and inhibition of return and interpreting changes in neural activity more generally.
The TurboDOStm operating system
Authors: Keith H. Bierman
Venue: ACM SIGSMALL Newsletter (1984)

A commercially available multi-microcomputer system is described. Facilities and features are described from a user's standpoint. Several research problems are proposed. 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
Discernibility Matrix Based Algorithm for Reduction of Attributes
Authors: Ruizhi Wang, Duoqian Miao, Guirong Hu
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In rough set theory, it has been proved that finding the minimal reduct of information systems or decision tables is a NP-complete problem. Therefore, it is hard to obtain the set of the most concise rules by existing algorithms for reduction of knowledge. In this paper, the method of finding sub-optimal reduct based on discernibility matrix is proposed. In general, our method is better than existing methods with respect to the minimal reduct. However, we find that existing minimal reduct searching algorithms are incomplete for reduction of attributes in information systems or decision tables. Through analysis, we present a conjecture about the completeness of the minimal reduct algorithm.
Autonomic Agent-based Storage Management for Grid Data Resource
Authors: Zhaobin Liu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Grid technology enables to solve large-scale problems in science, engineering, and commerce. In Grid environments, the resource is usually geographically heterogeneous and geographically distributed. The management of resources and application scheduling in such a large-scale distributed environment is a formidable task. In this paper, we describe a new autonomic agent-based storage management (called ASM) for Grid data resources. We designed service matching scheduling algorithm that can automatically mapping the application to the appropriate Grid data resource, associated with the function of virtual name space agent, storage abstraction agent, autonomic storage management agent, and consistency/authorization agent. It leverages existing technologies and provides additional services for Grid resource aggregation and management.
Communist, utilitarian, and capitalist cache policies on CMPs: caches as a shared resource
Authors: Lisa R. Hsu, Steven K. Reinhardt, Ravishankar Iyer, Srihari Makineni
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous threads of execution. The complexity of this problem is exacerbated as the number of simultaneous threads grows from two or four to the tens or hundreds. However, there is no consensus in the architectural community on what "best" means in this context. Some papers in the literature seek to equalize each thread's performance loss due to sharing, while others emphasize maximizing overall system performance. Furthermore, the specific effect of these goals varies depending on the metric used to define "performance".In this paper we label equal performance targets as Communist cache policies and overall performance targets as Utilitarian cache policies. We compare both of these models to the most common current model of a free-for-all cache (a Capitalist policy). We consider various performance metrics, including miss rates, bandwidth usage, and IPC, including both absolute and relative values of each metric. Using analytical models and behavioral cache simulation, we find that the optimal partitioning of a shared cache can vary greatly as different but reasonable definitions of optimality are applied. We also find that, although Communist and Utilitarian targets are generally compatible, each policy has workloads for which it provides poor overall performance or poor fairness, respectively. Finally, we find that simple policies like LRU replacement and static uniform partitioning are not sufficient to provide near-optimal performance under any reasonable definition, indicating that some thread-aware cache resource allocation mechanism is required.
Toward Optimal Kernel-based Tracking
Authors: Maneesh Dewan
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The design and development of methods for tracking targets in visual images has developed rapidly in the past decade. However, in practice the design of tracking algorithms is still largely ad-hoc, based on trial and error. As a result, the performance of such algorithms can vary widely based on the properties of the target of interest and the choice of design. The use of spatial sampling kernels on multiple feature spaces has recently emerged as a promising approach to visual target tracking. In particular, it is possible to show that most popular tracking algorithms can be expressed within this framework. As a result, sampling kernels can be viewed as a flexible design space for tracking algorithms. However, in the current approaches, the kernels are placed in an adhoc fashion at the center of the target with a scale equal to the size of the target. This can lead to sub-optimal tracking results. In this paper, we present results pointing toward the design of optimal and approximately optimal target-specific tracking algorithms. The target tracking problem is formulated in terms of an optimization over a family of kernelbased sampling functions. This optimization is solved to produce an optimal target-specific kernel configuration. Experimental results show greatly improved performance over classical template tracking and naive kernel-based tracking.
SRML case study: simple self-describing process modeling and simulation
Authors: Steven W. Reichenthal
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper provides an introduction to the Simulation Reference Markup Language (SRML) (SRML 2002) through a case study in which a simple self-describing process modeling and simulation representation is developed. In this context, "self-describing" refers to a simulation representation that includes not only a model's data, but also includes the behavioral semantics of the simulation objects, thereby enabling the execution of those models within a general-purpose simulation engine.
Detection of Sounds in the Auditory Stream: Event-Related fMRI Evidence for Differential Activation to Speech and Nonspeech
Authors: Athena Vouloumanos, Kent A. Kiehl, Janet F. Werker, Peter F. Liddle
Venue: Journal of Cognitive Neuroscience (2001)

The detection of speech in an auditory stream is a requisite first step in processing spoken language. In this study, we used event-related fMRI to investigate the neural substrates mediating detection of speech compared with that of nonspeech auditory stimuli. Unlike previous studies addressing this issue, we contrasted speech with nonspeech analogues that were matched along key temporal and spectral dimensions. In an oddball detection task, listeners heard nonsense speech sounds, matched sine wave analogues (complex nonspeech), or single tones (simple nonspeech). Speech stimuli elicited significantly greater activation than both complex and simple nonspeech stimuli in classic receptive language areas, namely the middle temporal gyri bilaterally and in a locus lateralized to the left posterior superior temporal gyrus. In addition, speech activated a small cluster of the right inferior frontal gyrus. The activation of these areas in a simple detection task, which requires neither identification nor linguistic analysis, suggests they play a fundamental role in speech processing.
Self-Learning in Obstacle Avoidance of a Mobile Robot via Dynamic Self-Generated Fuzzy Q-Learning
Authors: Yi Zhou, Meng Joo Er
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper, self-learning approaches are applied to an obstacle avoidance task of a mobile robot. Compared with conventional Reinforcement Learning (RL) and Fuzzy RL (FRL), a novel approach termed Dynamic Self-Generated Fuzzy Q-Learning (DSGFQL) and its extended version, Enhanced Dynamic Self-Generated Fuzzy Q-Learning (EDSGFQL), are proposed. Both methods are capable of generating a Fuzzy Inference System (FIS) without any priori knowledge. In the DSGFQL approach, the structure and preconditioning parts of an FIS are generated according to the input space partition and the reinforcement of the system. An extended Self Organizing Map (SOM) algorithm is combined with the DSGFQL approach and the EDSGFQL algorithm can update the centers of Membership Functions (MFs). In both the DSGFQL and EDSGFQL approaches, the consequent parts of the FIS are updated by Fuzzy Q-Learning, which is a widely used RL method. As a consequence, the proposed DSGFQL and EDSGFQL methodologies can automatically create, delete and adjust fuzzy rules without any priori knowledge or supervision. Simulation studies on an obstacle avoidance task by a mobile robot show that the proposed DSGFQL and EDSGFQL approaches are superior to those current RL methods.
Exploratory study of lexical patterns in multimodal cues
Authors: Natalie Ruiz, Fang Chen, Eric Choi
Venue: Proceedings of the 2005 NICTA-HCSNet Multimodal User Interaction Workshop - Volume 57 (2006)

Multimodal cues present in human-human dialogue help us to interpret other people's utterances. We undertake an exploratory study into the relationships of multimodal cues and communicative acts, i.e. between what people say and what people do when interacting with one another. If any such patterns are found and can be recognised, they could be exploited to support the understanding of multimodal interaction behaviours and interface design. Initial analysis of lexical categories and hand/arm gestures suggests some categories are more strongly associated with certain gesture types, in particular nouns and pronouns are emphasised in 87% of multimodal production acts involving deictic gestures.
Covert and Side Channels Due to Processor Architecture
Authors: Zhenghong Wang, Ruby B. Lee
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Information leakage through covert channels and side channels is becoming a serious problem, especially when these are enhanced by modern processor architecture features. We show how processor architecture features such as simultaneous multithreading, control speculation and shared caches can inadvertently accelerate such covert channels or enable new covert channels and side channels. We first illustrate the reality and severity of this problem by describing concrete attacks. We identify two new covert channels. We show orders of magnitude increases in covert channel capacities. We then present two solutions, Selective Partitioning and the novel Random Permutation Cache (RPCache). The RPCache can thwart most cache-based software side channel attacks, with minimal hardware costs and negligible performance impact.
Zero-automatic networks
Authors: Thu-Ha Dao-Thi, Jean Mairesse
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

We continue the study of zero-automatic queues first introduced in [3]. These queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The simple M/M/1 queue and Gelenbe's G-queue with positive and negative customers are the two simplest 0-automatic queues. All 0-automatic queues are quasi-reversible [3]. In this paper, we introduce and study networks of 0-automatic queues. We consider two types of networks, with either a Jackson-like or a Kelly-like routing mechanism. In both cases, and under the stability condition, we prove that the stationary distribution of the buffer content has a "product-form" and can be explicitly determined.
A Support System for Teaching Computer Programming Based on the Analysis of Compilation Errors
Authors: Yasuhiko Morimoto, Kunimi Kurasawa, Setsuo Yokoyama, Maomi Ueno, Youzou Miyadera
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

A system was developed to support teaching computer programming to a group of students who have common questions and make common mistakes on practice computer programs. The system extrapolates the causes and syntaxes of students' compilation errors by analyzing the trends of past compilation errors and presents the extrapolated result to the teacher in real time. By using the system, a teacher can understand in real time students' programming mistakes when they are writing computer programs, and can appropriately teach computer programming to a group of students who have common problems.