ppxscal/embedding_network huggingface dataset:
Model-Driven Video-Based Rendering for Vehicles
Authors: Ismail Oner Sebe, Suya You, Ulrich Neumann
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present a video-based rendering (VBR) method that creates arbitrary views of the scene from images captured by a single un-calibrated camera. The system is model-based and focused on a single object class, specifically vehicles in this paper. The procedure has three main steps. First, the object is rapidly modeled from a single image using a simple interactive tool. The modeling tool creates high quality 3D models by facilitating constrained modifications to a generic model of the object class. Secondly, the dynamic object is tracked in the video sequence and the pose of the object is recorded. The tracking and pose estimation leverage the 3D model to ensure high accuracy. Lastly, the surrounding scene is modeled as a textured piece-wise planar approximation. A free-viewpoint rendering of the video (4D video) is then produced as needed for special effects or virtual reality applications. The versatility and effectiveness of our approach to modeling and rendering is demonstrated on the object class of vehicles.
Introduction to IEC 61508
Authors: Ron Bell
Venue: Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55 (2006)

Over the past 25 years there have been a number of initiatives worldwide to develop guidelines and standards to enable the safe exploitation of programmable electronic systems used for safety applications. In the context of industrial applications (to distinguish from aerospace and military applications) a major initiative has been focussed on IEC 61508 and this standard is emerging as a key international standard in many industrial sectors.This paper considers some of the key features of IEC 61508 and indicates some of the issues that are being considered in the current revision.
A requirements engineering framework for cross-organizational ERP systems
Authors: Maya Daneva, Roel J. Wieringa
Venue: Requirements Engineering (2006)

The development of cross-organizational enterprise resource planning (ERP) solutions is becoming increasingly critical to the business strategy of many networked companies. The major function of cross-organizational ERP solutions is to coordinate work in two or more organizations. However, how to align ERP application components and business requirements for coordination and cooperation is hardly known. This paper reports on the outcomes of applying a coordination theory perspective to an analysis of the ERP misalignment problem. We present a conceptual framework for analyzing coordination and cooperation requirements in inter-organizational ERP projects. The framework makes explicit the undocumented built-in assumptions for coordination and cooperation that may have significant implications for the ERP adopters and incorporates a library of existing coordination mechanisms supported by modern ERP systems. We use it to develop a proposal for how to achieve a better alignment between ERP implementations and supported business coordination processes in inter-organizational settings. We report on some early assessments of the implications of our framework for practicing requirements engineers. Both our framework and library rest on a literature survey and the first author&#x2019;s experience with ERP implementation. In future empirical research, we will further validate and refine our framework.
Indexing graph-structured XML data for efficient structural join operation
Authors: Qun Chen, Andrew Lim, Kian Win Ong, Ji Qing Tang
Venue: Data Knowledge Engineering (2006)

Structural join has been established as a primitive technique for matching the binary containment pattern, specifically the parent-child and ancestor-descendant relationship, on the tree XML data. While current indexing approaches and evaluation algorithms proposed for the structural join operation assume the tree-structured data model, the presence of reference links in XML documents may render the underlying model a graph instead. In the more general category of semi-structured data, of which XML is an example, the data model is also usually supposed to be of graph structure. In this paper, we present an indexing approach and corresponding evaluation algorithms for efficiently performing the structural join operation on graph-structured data. Our approach encodes the structural containment relationship of a graph on multiple nested tree-structured layers, probably with the exception of the last one. With each tree-structured layer indexed with the inverted technique, the structural join operation on a graph can therefore be accomplished through recursively performing structural joins on nested layer trees. Our extensive experiments on both benchmark and synthetic XML data indicate that our proposed approach has good potential to perform significantly better than existing ones in term of both the I/O and CPU cost.
Discovering significant OPSM subspace clusters in massive gene expression data
Authors: Byron J. Gao, Obi L. Griffith, Martin Ester, Steven J. M. Jones
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of conditions. In an OPSM, the expression levels of all genes induce the same linear ordering of the conditions. OPSM mining is reducible to a special case of the sequential pattern mining problem, in which a pattern and its supporting sequences uniquely specify an OPSM cluster. Those small twig clusters, specified by long patterns with naturally low support, incur explosive computational costs and would be completely pruned off by most existing methods for massive datasets containing thousands of conditions and hundreds of thousands of genes, which are common in today's gene expression analysis. However, it is in particular interest of biologists to reveal such small groups of genes that are tightly coregulated under many conditions, and some pathways or processes might require only two genes to act in concert. In this paper, we introduce the KiWi mining framework for massive datasets, that exploits two parameters k and w to provide a biased testing on a bounded number of candidates, substantially reducing the search space and problem scale, targeting on highly promising seeds that lead to significant clusters and twig clusters. Extensive biological and computational evaluations on real datasets demonstrate that KiWi can effectively mine biologically meaningful OPSM subspace clusters with good efficiency and scalability.
Robust Online Change-point Detection in Video Sequences
Authors: Anonymous CVPR submission Anonymous
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present the Cumulative Sum (CUSUM) stopping rule, applied to Computer Vision problems, to automatically detect changes in either parametric or nonparametric distributions, online or off-line. Our approach is based on using the previously received data of the sequence to detect a change in data that are to be received. We assume that no significant change has occurred up to an unknown time instance. Then a change in the distribution of the observations occurs and the objective is to estimate this instance. We test the hypotheses of no change occurs vs. a change occurs at the current frame, which is done by the CUSUM stopping rule. We apply our framework to the case of continuous 3D hand tracking, where the high dofs, the fast finger articulations, the large rotations and the frequent occlusions often cause error accumulation. Also we illustrate the performance of our approach in video segmentation, and specifically in segmentation of fingerspelling in American Sign Language (ASL) videos.
A MPLS and VPN Based eGovernment System
Authors: Yongming Wei, Zhiyi Fang, Zhiming Dai, Xiao Han, Fengyuan Xu
Venue: Proceedings of the 15th International Conference on Computing (2006)

This paper analyses the technology of Virtual Private Network (VPN) and Multi Protocol Label Switch (MPLS), introduce the principles and characteristic of MPLS, especially network hierarchy framework theories of MPLS VPN, and implementation in an eGovernment System.
Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program
Authors: Ronald H. Nickel, Igor Mikolic-Torreira, Jon W. Tolle
Venue: Computational Optimization and Applications (2006)

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy's resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially "black box" functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.
A Floorplan-Aware Dynamic Inductive Noise Controller for Reliable Processor Design
Authors: Fayez Mohamood, Michael B. Healy, Sung Kyu Lim, Hsien-Hsin S. Lee
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Power delivery is a growing reliability concern in micropro- cessors as the industry moves toward feature-rich, power- hungrier designs. To battle the ever-aggravating power con- sumption, modern microprocessor designers or researchers propose and apply aggressive power-saving techniques in the form of clock-gating and/or power-gating in order to oper- ate the processor within a given power envelope. These tech- niques, however, often lead to high-frequency current varia- tions, which can stress the power delivery system and jeop- ardize reliability due to inductive noise (L\frac{{di}} {{dt}} ) in the power supply network. To counteract these issues, modern mi- croprocessors are designed to operate under the worst-case current assumption by deploying adequate decoupling capac- itance. With the trend of lower supply voltage and increased leakage power and current consumption, designing a proces- sor for the worst case is becoming less appealing. In this paper, we propose a new dynamic inductive-noise controlling mechanism at the microarchitectural level that will limit the on-die current demand within predefined bounds, regardless of the native power and current characteristics of running applications. By dynamically monitoring the access patterns of microarchitectural modules, our mechanism can effectively limit simultaneous switching activity of close-by modules, thereby leveling voltage ringing at local power-pins. Compared to prior art, our di/dt controller is the first that takes the processor's floorplan as well as its power-pin dis- tribution into account to provide a finer-grained control with minimal performance degradation. Based on the evaluation results using 2D floorplans, we show that our techniques can significantly improve inductive noise induced by current de- mand variation and reduce the average current variability by up to 7 times with an average performance overhead of 4.0%.
LITMUS^RT: A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers
Authors: John M. Calandrino, Hennadiy Leontyev, Aaron Block, UmaMaheswari C. Devi, James H. Anderson
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

We present a real-time, Linux-based testbed called LITMUS^RT, which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present the results from such an evaluation, in which partitioned earliest-deadline-first (EDF) scheduling, preemptive and nonpreemptive global EDF scheduling, and two variants of the global PD^2 Pfair algorithm were considered. The tested algorithms were compared based on both raw performance and schedulability (with real overheads considered) assuming either hard- or soft-real-time constraints. To our knowledge, this paper is the first attempt by anyone to compare partitioned and global real-time scheduling approaches using empirical data.
Adaptive self-tuning memory in DB2
Authors: Adam J. Storm, Christian Garcia-Arellano, Sam S. Lightstone, Yixin Diao, M. Surendra
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

DB2 for Linux, UNIX, and Windows Version 9.1 introduces the Self-Tuning Memory Manager (STMM), which provides adaptive self tuning of both database memory heaps and cumulative database memory allocation. This technology provides state-of-the-art memory tuning combining control theory, runtime simulation modeling, cost-benefit analysis, and operating system resource analysis. In particular, the nove use of cost-benefit analysis and control theory techniques makes STMM a breakthrough technology in database memory management. The cost-benefit analysis allows STMM to tune memory between radically different memory consumers such as compiled statement cache, sort, and buffer pools. These methods allow for the fast convergence of memory settings while also providing stability in the presence of system noise. The tuning mode has been found in numerous experiments to tune memory allocation as well as expert human administrators, including OLTP, DSS, and mixed environments. We believe this is the first known use of cost-benefit analysis and control theory in database memory tuning across heterogeneous memory consumers.
Towards a simulation and visualization portal to support multi-actor decision making in mainports
Authors: Roy T. H. Chin, Stijn-Pieter A. van Houten, Alexander Verbraeck
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Decision makers in ports and airports are working in an extremely complex environment. Decisions involve multiple actors, who all have a different view on the system under investigation, and on the effectiveness and desirability of possible outcomes of the decision making process. Simulation and visualization are two core technologies to support these complex decision making processes. One of the major challenges is to provide the variety of involved actors with visualizations that fit their view on the system. Two case studies show that the visualizations should be able to provide two views on decision making: a view on the system under investigation and a view on the multi-actor decision making process itself. This paper presents the requirements for a service-oriented and web-based simulation and visualization portal, which integrates both views. In cooperation with the Port of Rotterdam we are currently developing and testing a prototype implementation of the portal.
Regression Databases: Probabilistic Querying Using Sparse Learning Sets
Authors: Alexander Brodsky, Carlotta Domeniconi, David Etter
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

We introduce Regression Databases (REDB) to formalize and automate probabilistic querying using sparse learning sets. The REDB data model involves observation data, learning set data, views definitions, and a regression model instance. The observation data is a collection of relational tuples over a set of attributes; the learning data set involves a subset of observation tuples, augmented with learned attributes, which are modeled as random variables; the views are expressed as linear combinations of observation and learned attributes; and the regression model involves functions that map observation tuples to probability distributions of the random variables, which are learned dynamically from the learning data set. The REDB query language extends relational algebra project-select queries with conditions on probabilities of first-order logical expressions, which in turn involve linear combinations of learned attributes and views, and arithmetic comparison operators. Such capability relies on the underlying regression model for the learned attributes. We show that REDB queries are computable by developing conceptual evaluation algorithms and by proving their correctness and termination.
The army's MARATHON model
Authors: Mark W. Brantley, Steven A. Stoddard
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In order to support Army force structure analysis efforts, the Center for Army Analysis has developed a discrete event simulation called MARATHON. This model allows us to simulate the flow of active and reserve component units through their respective lifecycles. Each lifecycle begins with a non-available period (when AC units are reset and RC units are not available for Title 10 operations), followed by periods when units train MARATHON allows us to examine a variety of force structure options by illustrating gaps or redundancies in capabilities, as well as associated deployment tempos. Since the Army has adopted MARATHON to analyze its force structure decisions, we have also developed extensions to this simulation that have the capabilities to analyze how the force structure decisions impact the ability of the Army to provide Soldiers and equipment to its units.
The reasons for under use of ICT in education: in the context of Kenya,Tanzania and Zambia
Authors: Diana Kessy, Mitwa Kaemba, Mercy Gachoka
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

The Information Age is increasing the gap between the rich and poor, developed and developing countries and creating a society of information haves and havenots. Learning institutions in countries with greater powers of acquisition have easier access to new technologies and take greater advantage of them. Given this situation, it is imperative that developing countries redouble their efforts to prepare themselves to successfully meet the challenge and maximize the opportunities that the use of ICT in education offers. This can be done by developing countries tackling one after another the factors that are hindering the efficient use of ICT in education. By so doing countries will follow a divide and conquer approach which usually sees to the solving of complex national issues such as this one. This paper is an effort to share opinions on the reasons for the under use of ICT in education from Kenya, Tanzania and Zambia.
The Print of the Hand
Authors: David Alan Grier
Venue: Computer (2006)

Computer technology has shown how firmly our ideas about women are carved into the foundations of our society.
Efficient subspace fitting algorithms for diversely polarized arrays
Authors: A. Swindlehurst, M. Viberg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors present a statistically efficient algorithm for direction of arrival (DOA) estimation using diversely polarized arrays. The proposed technique requires a multidimensional search over the DOA parameters only, after which the polarization parameters can be calculated explicitly. A comparison with a multiple signal classification (MUSIC) based approach revealed that the method may give significantly improved performance, particularly in scenarios involving highly correlated signals.
Usability Assessment for Hyperlink Methods
Authors: Tapanee Tirapat, Tiranee Achalakul
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

This research investigates the hyperlink information presentation methods often found in websites today. Generally, the information presentation has two formats: a new webpage appears in a new window, and a new webpage replace information in an old window. In order to assess the usability of such formats, the efficiency, effectiveness, and satisfaction of each method is measured. Thirty participants were recruited in our experiment. The participants were divided equally into two groups and each group was assigned to a test condition. The experimental hypothesis was "using a new window yields a higher usability than replacing information in an old window". We investigated two issues: the memory load (when information is being replaced continuously) and the navigation difficulty (when numerous windows are presented simultaneously). The usability assessment results show no significant difference between the two information presentation methods. However, from the experimental data, a recommendation can be drafted for the web navigation design.
A simulation based model for default risk in HEL subordinate securities
Authors: Kishore K. Yalamanchili, David H. Bai
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The Home Equity Loan (HEL) ABS sector has grown to be a significant part of the ABS market. The securities offer attractive yields, particularly the subordinate bonds. The cash flows of subordinate bonds have a complicated pattern and are dependent on the status of certain performance tests. Investors in the securities typically perform default analysis of HEL securities using a scenario based approach. We propose a model for evaluating the default risk in subordinate HEL securities backed by sub-prime first lien loans. Our model is based on simulation of serious delinquencies and losses. We show that the current scenario based approach does not adequately capture the risk inherent in these bonds.
Channel sharing scheme for packet-switched cellular networks
Authors: Suresh Kalyanasundaram, Junyi Li, Edwin K. P. Chong, Ness B. Shroff
Venue: Wireless Networks (2005)

In this paper, we study an approach for sharing channels to improve network utilization in packet-switched cellular networks. Our scheme exploits unused resources in neighboring cells without the need for global coordination. We formulate a minimax approach to Optimizing the allocation of channels in this sharing scheme. We develop a measurement-based distributed algorithm to achieve this objective and study its convergence. We illustrate, via simulation results, that the distributed channel sharing scheme performs significantly better than the fixed channel scheme over a wide variety of traffic conditions.