ppxscal/embedding_network huggingface dataset:
Variance-based sampling for cycle time: throughput confidence intervals
Authors: Rachel T. Johnson, Sonia E. Leach, John W. Fowler, Gerald T. Mackulak
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In the analysis of a manufacturing system, the analyst is often interested in the change in mean cycle time as a function of different throughput (start rate) levels. Since the variance of the mean cycle time generally increases as the start rate increases, an equal allocation of simulation effort at each simulated throughput level will result in confidence intervals of different widths. This paper discusses an approach for generating nearly equal sized mean cycle time confidence intervals at selected throughput levels when the computing budget is fixed (limited). The simulation effort allocation procedure described in this paper determines the proportion of the fixed budget to allocate at each throughput level based on the asymptotic variance.
How Crosscutting Concerns Evolve in JHotDraw
Authors: Gerardo Canfora, Luigi Cerulo
Venue: Proceedings of the 13th IEEE International Workshop on Software Technology and Engineering Practice (2005)

Programmers tend to isolate concerns in source code as a way to achieve a clearer visualization of scattered and tangled code. Thus, a crosscutting concern can be well represented as the set of tangled and scattered lines of code across the system. With such model, we found that crosscutting concerns are first inserted in the system and then maintained through a set of changes performed exclusively for those concerns. Versioned software systems provide a huge amount of historical data regarding source code changes. We use a fine grained analysis method of CVS repositories to observe the evolution of three crosscutting concerns, Observer, Persistence, and Undo, in JHotDraw. Analyzing the history of crosscutting concerns gives us the opportunity to better understand their nature, which helps in developing and evaluating new aspect mining techniques.
Design Considerations of a Prototype VTOL Robotic Vehicle through Market Survey Data Collection
Authors: P. S. Spanoudakis, N. C. Tsourveloudis, K. P. Valavanis
Venue: Journal of Intelligent and Robotic Systems (2006)

A detailed technical design and performance comparison of current unmanned Vertical Take-Off and Landing (VTOL) vehicles is presented as a function of vehicle maximum speed, payload, range, endurance, and propulsion configurations. Mission applications and VTOL market characteristics are used to define design specifications for a new prototype unmanned VTOL vehicle suitable for a wide range of (mostly) civilian applications. The proposed VTOL vehicle's design phase is presented, including: performance capabilities calculation, fuselage strength evaluation and weight optimization via crash/drop tests. Drop tests performed have followed standard regulations used for airworthiness certification of such vehicles. The proposed VTOL vehicle is currently under prototype development.
Applying Fuzzy Logic Control to an Electric Bicycle
Authors: Chi-Ying Liang, Wai-Hon Lin, Bruce Chang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Bicycles are used virtually everywhere, and for many applications; transportation, recreation and exercise. Their dynamic behavior is statically unstable like the inverted pendulum. In this paper, we developed an intelligent electric bicycle base on fuzzy logic and single chip approach. We chose the PSoC ..Programmable System-on-Chips.. as the microprocessor. The key point is to adjust the PWM (Pulse Width Modulation) signal to control the speed of the bicycle, automatically. With this method we hope one can ride the bicycle easily..................................
Analysis of Driving Session Videos by Reverse Temporal Order Processing
Authors: Frederic Maire, Andry Rakotonirainy
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Technology based driver training is still in its infancy. There is a strong need for improved and integrated computer-based screening tools in order to facilitate objective and reliable driver training assessments. This paper describes a system that analyses videos of driving sessions collected by on-board web-cameras. The system detects and tracks lane markings in order to estimate the relative position of the vehicle with respect to its lane. The system is computationally efficient as it exploits fully the off-line nature of the data. The analysis of the video recording is performed in reverse temporal order. The benefits of this approach compared to the forward analysis traditionally used are an improved robustness and a lower computational cost.
Performance analysis of double buffer technique (DBT) model for mobility support in wireless IP networks
Authors: A. A. Akintola, G. A. Aderounmu, M. O. Adigun
Venue: Journal of Network and Computer Applications (2006)

Existing mobility support models in cellular communications misinterpret mobility loss in cellular networks as congestion loss, thus it degrades the performance by invoking unnecessary congestion control action. In this paper, we investigated the performance of Double Buffer Technique (DBT) model for mobility support in wireless IP networks. The DBT model uses the END message and the TQRS timer to maintain the packet sequence and decrease the load on the new foreign agent when the timer expires, respectively. Also, the protocol showed improved performance degradation caused by the handover of the mobile terminal. In order to demonstrate the superiority of our scheme over the existing ones, we used the following performance metrics: packet out-of-sequence, cell loss ratio, bandwidth overhead, and suitability for real-time services. The numerical results obtained revealed that the buffer size, the waiting time, and the packet loss probabilities in the model were suitable to the wireless IP environment.
3D Alignment of Face in a Single Image
Authors: Lie Gu, Takeo Kanade
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We present an approach for aligning a 3D deformable model to a single face image. The model consists of a set of sparse 3D points and the view-based patches associated with every point. Assuming a weak perspective projection model, our algorithm iteratively deforms the model and ad- justs the 3D pose to fit the image. As opposed to previous approaches, our algorithm starts the fitting without resort- ing to manual labeling of key facial points. And it makes no assumptions about global illumination or surface prop- erties, so it can be applied to a wide range of imaging con- ditions. Experiments demonstrate that our approach can effectively handle unseen faces with a variety of pose and illumination variations.
Dynamic, real-time forecasting of online auctions via functional models
Authors: Wolfgang Jank, Galit Shmueli, Shanshan Wang
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We propose a dynamic model for forecasting price in online auctions. One of the key features of our model is that it operates during the live-auction, which makes it different from previous approaches that only consider static models. Our model is also different with respect to how information about price is incorporated. While one part of the model is based on the more traditional notion of an auction's price-level, another part incorporates its dynamics in the form of a price's velocity and acceleration. In that sense, it incorporates key features of a dynamic environment such as an online auction. The use of novel functional data methodology allows us to measure, and subsequently include, dynamic price characteristics. We illustrate our model on a diverse set of eBay auctions across many different book categories. We find significantly higher prediction accuracy compared to standard approaches.
Effective program debugging based on execution slices and inter-block data dependency
Authors: W. Eric Wong, Yu Qi
Venue: Journal of Systems and Software (2006)

Localizing a fault in program debugging is a complex and time-consuming process. In this paper we present a novel approach using execution slices and inter-block data dependency to effectively identify the locations of program faults. An execution slice with respect to a given test case is the set of code executed by this test, and two blocks are data dependent if one block contains a definition that is used by another block or vice versa. Not only can our approach reduce the search domain for program debugging, but also prioritize suspicious locations in the reduced domain based on their likelihood of containing faults. More specifically, we use multiple execution slices to prioritize the likelihood of a piece of code containing a specific fault. In addition, the likelihood also depends on whether this piece of code is data dependent on other suspicious code. A debugging tool, DESiD, was developed to support our method. A case study that shows the effectiveness of our method in locating faults on an application developed for the European Space Agency is also reported.
ISSPASS Reviewers
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

The following topics are dealt with: performance analysis of systems and software; benchmarking and workload characterization; simulation; architecture and performance evaluation; memory and caches; Java; and power estimation and reduction. 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
Implementation of real-time watermarking scheme for high-quality video
Authors: In-Koo Kang, Dong-Hyuck Im, Heung-Kyu Lee, Young-Ho Suh
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

Digital watermarking for video helps protect the copyright of the video content. In most watermark applications, an embedding procedure should be built at low costs and the embedded watermarks should have robustness against various unintentional or malicious attacks. This paper addresses implementation issues for real-time watermark embedding scheme of High Definition(HD) resolution video on a personal computer. This paper provides some performance optimization guidelines and a simplified Human Visual System (HVS) method for fast and robust watermark embedding. Demonstration shows a real-time watermark embedding process including HD MPEG-2 video decoding, watermark embedding and displaying on an Intel architecture personal computer. Experimental results show optimized embedding performances and robustness against several malicious attacks commonly happened to videos. From the results, our implementation solution improved the embedding performance suitable for real-time watermark embedding for HD video.
Building reliable metaclassifiers for text learning
Authors: Jaime Carbonell, John Lafferty
Venue:  (2006)

Appropriately combining information sources to form a more effective output than any of the individual sources is a broad topic that has been researched in many forms. It can be considered to contain sensor fusion, distributed data-mining, regression combination, classifier combination, and even the basic classification problem. After all, the hypothesis a classifier emits is just a specification of how the information in the basic features should be combined. This dissertation addresses one subfield of this domain: leveraging locality when combining classifiers for text classification. Classifier combination is useful, in part, as an engineering aid that enables machine learning scientists to understand the difference in base classifiers in terms of their local reliability, dependence, and variance---much as higher-level languages are an abstraction that improves upon assembly language without extending its computational power. Additionally, using such abstraction, we introduce a combination model that uses inductive transfer to extend the amount of labeled data that can be brought to bear when building a text classifier combination model. We begin by discussing the role calibrated probabilities play when combining classifiers. After reviewing calibration, we present arguments and empirical evidence that the distribution of posterior probabilities from a classifier will give rise to asymmetry. Since the standard methods for recalibrating classifiers have an underlying assumption of symmetry, we present asymmetrical distributions that can be fit efficiently and produce recalibrated probabilities of higher quality than the symmetrical methods. The resulting improved probabilities can either be used directly for a single base classifier or used as part of a classifier combination model. Reflecting on the lessons learned from the study of calibration, we go on to define local calibration, dependence, and variance and discuss the roles they play in classifier combination. Using these insights as motivation, we introduce a series of reliability-indicator variables which serve as an intuitive abstraction of the input domain to capture the local context related to a classifier's reliability. We then introduce the main methodology of our work, STRIVE, which uses metaclassifiers and reliability indicators to produce improved classification performance. (Abstract shortened by UMI.)
Suboptimal Contractive Predictive Control for a Class of Hybrid Systems
Authors: Jalal Habibi, Behzad Moshiri, Ali Khaki Sedigh
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)

Current state-of-the-art approaches for control of hybrid systems face with two main important challenging problems which are guaranteeing the stability and the computational complexity. In this article a new approach has been proposed to guarantee the closed loop stability of a class of hybrid systems while reducing the complexity of control problem by introducing some level of suboptimality. It has been shown that using contraction constraint on the objective function results in asymptotically stable closed loop system. It has also been described that since only feasibility is sufficient for stability in the proposed approach, suboptimal control could be used to reduce the computational complexity.
Simulation-based optimization for repairable systems using particle swarm algorithm
Authors: Talal M. Alkhamis, Mohamed A. Ahmed
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We describe an approach based on particle swarm optimization (PSO) for determining the optimal allocation of spares as well as repair resources while satisfying a desired availability constraint. The proposed method expands the original PSO algorithm to handle stochastic constraints and discrete decision variables. Computational results show that the proposed approach is efficient for determining the optimal choice of spares and repair channels for multiechelon repairable-item inventory systems.
Implementing mapping composition
Authors: Philip A. Bernstein, Todd J. Green, Sergey Melnik, Alan Nash
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas σ1 and σ2 and a mapping over schemas σ2 and σ3, the composition problem is to compute an equivalent mapping over σ1 and σ3. We describe a new composition algorithm that targets practical applications. It incorporates view unfolding. It eliminates as many σ2 symbols as possible, even if not all can be eliminated. It covers constraints expressed using arbitrary monotone relational operators and, to a lesser extent, non-monotone operators. And it introduces the new technique of left composition. We describe our implementation, explain how to extend it to support user-defined operators, and present experimental results which validate its effectiveness.
Usability study of the virtual test bed and distributed simulation
Authors: Jeffrey W. Dawson, Ping Chen, Yanshen Zhu
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Improving the usability of a Distributed Simulation System (DSS) test bed is the focus of this paper. An introduction to the field of usability is given, followed by a discussion of the characteristics of DSSs. Then the usability of DSSs is considered. The Virtual Test Bed (VTB), a sample DSS we have improved the usability of, is described. The methodology used to improve the VTB's usability is given. With the goal of improving usability for end users, proto-typing of a graphical user interface is discussed; both software and paper prototypes are considered. Lessons learned provide insights into problems we encountered. Research on important aspects of DSSs that affect usability is reflected in a table that summarizes key issues. Our anticipated future research in this area is also discussed.
FIX: feature-based indexing technique for XML documents
Authors: Ning Zhang, M. Tamer Özsu, Ihab F. Ilyas, Ashraf Aboulnaga
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Indexing large XML databases is crucial for efficient evaluation of XML twig queries. In this paper, we propose a feature-based indexing technique, called FIX, based on spectral graph theory. The basic idea is that for each twig pattern in a collection of XML documents, we calculate a vector of features based on its structural properties. These features are used as keys for the patterns and stored in a B+tree. Given an XPath query, its feature vector is first calculated and looked up in the index. Then a further refinement phase is performed to fetch the final results. We experimentally study the indexing technique over both synthetic and real data sets. Our experiments show that FIX provides great pruning power and could gain an order of magnitude performance improvement for many XPath queries over existing evaluation techniques.
Means-End Relations and a Measure of Efficacy
Authors: Jesse Hughes, Albert Esterline, Bahram Kimiaghalam
Venue: Journal of Logic, Language and Information (2006)

Propositional dynamic logic (PDL) provides a natural setting for semantics of means-end relations involving non-determinism, but such models do not include probabilistic features common to much practical reasoning involving means and ends. We alter the semantics for PDL by adding probabilities to the transition systems and interpreting dynamic formulas ¿¿¿ ¿ as fuzzy predicates about the reliability of ¿ as a means to ¿. This gives our semantics a measure of efficacy for means-end relations.
3D Fingerprinting and Encryption Principle for Collaboration
Authors: Misung Cho, Seokryul Kim, Maenghee Sung, Giwon On
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

In this paper, we propose a practical partial encryption method and a joint fingerprinting and decryption scheme of 3D data to support collaboration in the manufacturing industry, in particular the automobile and shipbuilding sector. The proposed fingerprinting and encryption method called as JFD of 3D data is a Joint Fingerprinting and Decryption scheme of 3D data based on partial encryption. The JFD of 3D data is a more computationally efficient and convenient way of fingerprinting without the need for expensive tampering equipment. We analyze the security related problems and discuss performance of our proposed scheme. We also show the feasibility and practicality of the JFD scheme of 3D data by a fast prototyping implementation.
Mobile usage of video and TV
Authors: Barbara Schmidt-Belz, Matt Jones
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This workshop aims to review and discuss research on mobile usage of multimedia, in particular of video and TV on mobile devices. The workshop focuses on human behaviour, human needs, and interaction design concerning the creation, management, and consumption of moving images using mobile devices.
A Portal for Logistics Service Provider to Integrate Supply Chain
Authors: Zhiyong Zhang, Tao Cheng, Bo Yan
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

This paper investigates the integration strategies for logistics service provider (LSP) and supply chain (SC). Firstly, we analyze the existing issues of supply chain integration and the research on third party logistics (3PL) as well as fourth party logistics (4PL). Secondly, we propose the integration strategies from logistics activities integration and information integration respectively. From the information technology (IT) point of view, we present the measures for LSP to integrate supplier, manufacturer and wholesaler in SC. On the basis of this, we investigate the information exchange mode, logistics activities integration and coordination, as well as the implementation methods of supply chain integration based on information and logistics activities.
Goal-Oriented Development of BDI Agents: The PRACTIONIST Approach
Authors: Vito Morreale, Susanna Bonura, Giuseppe Francaviglia, Fabio Centineo, Massimo Cossentino, Salvatore Gaglio
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The representation of goals and the ability to reason about them play an important role in goal-oriented requirements analysis and modelling techniques, especially in agent-oriented software engineering, as goals are more stable than other abstractions (e.g. user stories). In PRACTIONIST, a framework for developing agent systems according to the Belief-Desire-Intention (BDI) model, goals play a central role. Thus, in this paper we describe the structure of the goal model in the PRACTIONIST framework and how agents use their goal model to reason about goals, desires, and intentions during their deliberation process and means-ends reasoning as well as while performing their activities.
How to build valid and credible simulation models
Authors: Averill M. Law
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this tutorial we present techniques for building valid and credible simulation models. Ideas to be discussed include the importance of a definitive problem formulation, discussions with subject-matter experts, interacting with the decision-maker on a regular basis, development of a written conceptual model, structured walk-through of the conceptual model, use of sensitivity analysis to determine important model factors, and comparison of model and system output data for an existing system (if any). Each idea will be illustrated by one or more real-world examples. We will also discuss the difficulty in using formal statistical techniques (e.g., confidence intervals) to validate simulation models.