ppxscal/embedding_network huggingface dataset:
Model-Driven Business Performance Management
Authors: Liangzhao Zeng, Hui Lei, Michael Dikun, Henry Chang, Kumar Bhaskaran
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

In this paper, we present a model-driven approach to Business Performance Management (BPM). BPM is a new frontier in IT-enabled enterprise that supports the monitoring and control of business operations. BPM solutions must be able to efficiently process business events, compute business metrics, detect business situations, and provide the real-time visibility of key performance indicators. In addition, system support is required for the rapid development of BPM solutions and the adaptation of the solutions to the dynamic business environment. We have adopted a metamodel, dubbed the observation meta-model, for capturing the business requirements for BPM, which frees solution developers from low-level programming concerns. We have also used a hybrid compilation-interpretation approach to map an observation model to the runtime executable. First, we extract and refactor the data aspect of the observation model to facilitate runtime access. Second, we compile the operational aspect of the model, such as logic for metric computation and situation detection, into Java code. Third, we develop a runtime engine that interprets the refactored model and dynamically loads the generated code, according to the meta-model. Our framework further enables the evolution and hot deployment of the observation model and provides the platform for several on-going customer engagement efforts.
Modeling Intent for Home Video Repurposing
Authors: Radhakrishna S. V. Achanta, Wei-Qi Yan, Mohan S. Kankanhalli
Venue: IEEE MultiMedia (2006)

Amateur home videos rarely convey intent effectively, primarily because of the limitations of conventional consumer-quality video cameras and the difficulties of video postprocessing. The authors describe a general approach for video-intent delivery based on offline cinematography and automated continuity editing concepts and demonstrate its use with four basic emotions: cheer, serenity, gloom, and excitement.
A New Approach to Decision-Making: "Small-Column and Large-Row" Arrangement Method's Effectiveness Analysis
Authors: Zhijie Chen, Qile Chen, Weizhen Chen
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

To handle a complex decision problem, especially in management field, Saaty's AHP is widely used. But in practice, the premise of AHP is difficult to satisfy, so people have to use various complex methods to modify it before use it. Such a process enhances the difficulty and long time to deal the decision problem. "Small-Column and Large-Row" arrangement method which abbreviates SCLR is a new approach to decision-making. Compared to AHP, it is more convenient to be used, and under the same conditions, it may give more convinced result. This paper proposes to get a deeper insight into the effectiveness of SCLR, and tries to give the range of its effectiveness.
GIS-based Command and Control Infrastructure for Critical Infrastructure Protection
Authors: Stephen D. Wolthusen
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

Critical infrastructure components are often dispersed over large areas; at the same time even an infrastructure individual component relies on a significant number of parameters that must be controlled and monitored in addition to interdependencies with other infrastructure components.Modeling and simulation of infrastructure elements and particularly of interdependencies and risks to those elements can be performed on the basis of a geographical information system providing a common semantic basis for presentation and analysis as well as a mechanism for sharing only selected and where necessary downgraded information with other infrastructure operators.
On Controlling Digital TV Set-Top-Box by Mobile Devices via IP Network
Authors: Chi-Chia Lin, Ming-Syan Chen
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Digital TV already rises. Unlike the traditional TV system, the digital TV architecture allows users to execute application programs in their set-top-boxes. One of the benefits is that users can communicate interactively with others by executing certain applications via some channels, e.g., The Internet. However, the only control device in recent years is the remote controller, which is limited to the transmission range. In this paper, we devise a system that allows mobile appliances, e.g., mobile phones and laptops, to control our set-top-boxes. Due to the issue of compatibilities, we adopt MHP (Multimedia Home Platform) as the middleware. The proposed system model is also compatible with the EPG (Electronic Program Guide) architecture. Two services are provided: (1) Viewing DTV contents online; (2) Remotely commanding the set-top-box to record a DTV service. Assuming that in the future when every house will be equipped with a "Personal Multimedia Server", this server will even process complex tasks such as transcoding and broadcasting.We believe that our system model is very feasible for future DTV systems and is applicable to advanced DTV applications.
Review of "Handbook of Statistical Distributions, by Jagdish K. Patel, C. H. Kapadia and D. B. Owen", Marcel Dekkar, Inc., 1976
Venue: ACM SIGSIM Simulation Digest (1979)

This volume summarizes, in compact form, information about numerous statistical distributions. Topics covered include: moments, cumulants and generating functions, statistical inequalities, order statatistics and other attributes. Well developed mathematically, this book provides the reader with an analysis of families of distributions, the characteristics of the different distributions, point estimations and confidence intervals as well as basic limit theorems. 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
Test Pattern Generation for Power Supply Droop Faults
Authors: Debasis Mitra, Subhasis Bhattacharjee, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Sujit T. Zachariah, Sandip Kundu
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In deep sub-micron VLSI chips, when several transistors in physical proximity switch simultaneously, a substantial power supply drop, known as droop, may occur because of concurrent load on a via of the power grid. As a result of lower supply voltage, transistors may slow down. Such timing faults are termed as droop faults. Modeling of droop faults and understanding their effects on the functionality and timing behavior of the circuit are yet to be fully understood. In this paper, a new model for droop faults is proposed. A simple ATPG-based procedure for stuck-at faults has been adapted to test droop faults. For validation of the methodology in combinational circuits, a set of appropriate clusters of gates is selected to cover potential droop-prone regions in a circuit. Experimental results on ISCAS-85 benchmark circuits reveal that a very high droop fault coverage can be obtained by a short sequence of test vectors.
Sound source location cue coding system for compact representation of multi-channel audio
Authors: Inseon Jang, Jeongil Seo, Seungkwon Beack, Kyeongok Kang, Han-gil Moon
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Binaural cue coding (BCC) has been introduced for compact representation of multi-channel audio. It exploits binaural cue parameters for capturing the spatial image of multi-channel audio. Recently, it has been standardized within MPEG as the name of "MPEG Surround." In this paper, we propose a sound source location cue coding (SSLCC) system for compressing multi-channel audio to be suitable at the narrow bandwidth transmission environment. To improve the compression ability of the conventional BCC, the SSLCC system utilizes the virtual source location information (VSLI) as a spatial cue parameter instead of the inter-channel level difference (ICLD) of the BCC system. Also the SSLCC system adopts enhanced pre/post processing algorithms to improve perceptual sound quality. Objective and subjective assessment results show that the proposed SSLCC system reveals better performance than the conventional BCC system.
Method for Representing 3-D Virtual Origami
Authors: Takashi Terashima, Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper proposes a method for representing overlapping-faces of 3-D virtual origami in order to support beholder's recognition of its conformation. Generally, an origami model is constructed by planar polygons corresponding to faces of origami. Therefore, when an origami model is displayed, multiple faces (polygons) on the same plane are probably recognized as one face. Our proposed method moves such overlapping-faces apart slightly by rotating polygons along a rotation axis determined from shapes and relationships of faces. As a consequence, beholders can recognize the conformation of origami correctly. This method can be applied to the user interface of a system we develop to recognize folding operations from origami drill books.
Stable Egress Route Selection for Interdomain Traffic Engineering: Model and Analysis
Authors: Hao Wang, Haiyong Xie, Yang Richard Yang, Avi Silberschatz Silberschatz, Li Erran Li, Yanbin Liu
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

We present a general model of interdomain route selection to study interdomain traffic engineering. In this model, the routing of multiple destinations can be coordinated. Thus the model can capture general traffic engineering behaviors such as load balancing and link capacity constraints. We first identify potential routing instability and inefficiency of interdomain traffic engineering. We then derive a sufficient condition to guarantee convergence. We also show that the constraints on local policies imposed by business considerations in the Internet can guarantee stability without global coordination. Using realistic Internet topology, we evaluate the extent to which routing instability of interdomain traffic engineering can happen when the constraints are violated.
Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor
Authors: Hui Xue Zhao, Serge Midonnet, Laurent George
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

This paper considers the problem of hard real-time fixed priority scheduling of sporadic graph tasks on a uniprocessor. We study feasibility conditions based on the computation of the worst case response times of the graph tasks. A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints. We investigate the late deadline constraint. We extend already published papers established in the preemptive case to the non-preemptive case and to the hybrid case of an application composed of preemptive and non preemptive subtasks.
Design and Implementation of Multiple Fault-Tolerant MPI over Myrinet (M^3)
Authors: Hyungsoo Jung, Dongin Shin, Hyuck Han, Jai W. Kim, Heon Y. Yeom, Jongsuk Lee
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Advances in network technology and computing power have inspired the emergence of high-performance cluster computing systems. While cluster management and hardware highavailability tools are readily available, practical and easily deployable fault-tolerant systems have not been successfully adopted commercially. We present a fault-tolerant system, Multiple fault-tolerant MPI over Myrinet (M3), that differs in notable respects from other proposed fault-tolerant systems in the literature. M3 is built on top of Myrinet since it is regarded as one of the best solutions for highperformance networks and is widely used in cluster computing systems because it can provide a high-speed switching network that is an inevitable ingredient in interconnecting clusters of workstations or PCs. M^3 is a user-transparent checkpointing system for multiple fault-tolerant MPI implementation that is primarily based on the coordinated checkpointing protocol. M3 supports three critical functionalities that are necessary for faulttolerance: a light-weight failure detection mechanism, dynamic process management that includes process migration, and a consistent checkpoint and recovery mechanism. The features of M are that it requires no modifications of application code and that it preserves much of the high performance characteristics of Myrinet. This paper describes the architecture of M3, its detailed design principles and comprehensive implementation issues. We also propose practical solutions for those involved in constructing highly available cluster systems for parallel programming systems. Experimental results substantiate our assertion that M3 can be a good candidate for practically deployable fault-tolerant systems in very-large and high-performance Myrinet clusters and that its protocol can be applied to a wide variety of parallel communication libraries without difficulty.
Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares
Authors: Jiawang Nie, James W. Demmel
Venue: Journal of Global Optimization (2005)

We study ellipsoid bounds for the solutions $$(x,\mu) \in \mathbb{R}^{n} \times \mathbb{R}^{r}$$ of polynomial systems of equalities and inequalities. The variable ¿ can be considered as parameters perturbing the solution x. For example, bounding the zeros of a system of polynomials whose coefficients depend on parameters is a special case of this problem. Our goal is to find minimum ellipsoid bounds just for x. Using theorems from real algebraic geometry, the ellipsoid bound can be found by solving a particular polynomial optimization problem with sums of squares (SOS) techniques. Some numerical examples are also given.
Low-stress Wearable Computer System for Capturing Human Experience
Authors: Megumu Tsuchikawa, Shoichiro Iwasawa, Sadanori Ito, Kiyoshi Kogure, Norihiro Hagita, Kenji Mase, Yasuyuki Sumi
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper proposes an experience-capturing system that features low-stress wearable computers and secure data collection. Several design requirements are discussed based on user comments concerning the preceding version of the prototype. We designed a small, lightweight wearable computer unit for capturing human-human and human-object interaction with microphones, video cameras, infrared LED tags, and trackers. We describe the design details and specifications of the prototype.
A resource allocation architecture with support for interactive sessions in utility Grids
Authors: V. Talwar, B. Agarwalla, S. Basu, R. Kumar, K. Nahrstedt
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Utility Grids implement a virtualization architecture and allow for sharing of infrastructure for improved return on investment (ROI). We consider extending the existing Grid infrastructure to support interactive sessions in an enterprise setting. This would allow users to remotely execute interactive applications in the Grid and view their output using remote display technologies. We propose a resource allocation architecture to support such interactive sessions in utility Grids. End-users submit requests for a remote desktop session. A utility Grid site resource allocation system assigns a compute node for this request considering performance needs of such remote desktop sessions. We also propose a hierarchical admission control system. The system consists of a site admission control system for admission control of remote desktop sessions, and a session admission control system at the compute node for admission check of per-application interactive sessions. We also present discussion on mixed workloads consisting of requests for batch jobs and interactive remote desktop sessions.
Dynamic Correlation Approach to Early Stopping in Artificial Neural Network Training. Macroeconomic Forecasting Example
Authors: Krzysztof Michalak, Rafal Raciborski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Neural networks are widely used in time-series forecasting. One of the issues that arise in neural networks applications is that when a neural network is trained for too long the quality of the predictions tends to deteriorate. To overcome this problem various methods of early stopping are employed. This paper proposes a new approach to early stopping issue in neural network training. In the approach presented the validation series is chosen based on its mean dynamic correlation with forecasted series. The approach is verified by application to macroeconomic data where suitable sets of series are commonly available.
The thurston boundary of teichmuller space and complex of curves
Authors: Yair Minsky
Venue:  (2005)

Let S be a closed orientable surface with genus g &ge; 2. Let T (S) be the Teichm&uuml;ller space and C (S) the complex of curves. We write PML (S) to denote the Thurston boundary of T (S), and 6&infin;C (S) to denote the Gromov boundary of C (S). Let UML (S) be the quotient space of PML (S) by forgetting measure with the quotient map u. Let L be a fixed Bers constant. For &sigma; &isin; T (S), let &Phi;(&sigma;) be a pants decomposition whose total length is bounded by L, where all pants curves are geodesics in &sigma;. Suppose that &sigma;i &isin; T (S) converges to [ l ] &isin; PML (S). Consider the decomposition ul =l1&cup;l2 &cup;&cdots;&cup;lm as a finite disjoint union of minimal laminations. Suppose that &alpha;i is a pants curve in &Phi;(&sigma; i). In this thesis we show: (1) If &Phi;(&sigma; i) converges to a geodesic lamination &nu; in Hausdorff metric topology, then u([ l ]) &sub; &nu;. (2) Suppose that l1 is a simple closed curve. Consider an annular covering Y of S in which a neighborhood of l1 lifts homeo-morphically. Suppose that &alpha; i meets l1 for all i. Then the absolute value of algebraic intersection number |a1 &middot; ai| approaches to &infin;, where a1 is a lift of &alpha; 1 which connects the two boundaries of Y and so is ai. (3) Suppose that l2 is not a simple closed curve. Let F be the essential subsurface of S which is filled by l2 Let bi be a component of &alpha;i &cap; F. We can define a simple closed curve b&d5;i from bi in a canonical way. Then the geodesic representative of b&d5;i converges to l2 in UML (F). (4) In particular, if l is a filling lamination then &alpha;i converges to u([ l ]) in C (S) &cup; 6&infin;C (S), where u([ l ]) is considered as an element of 6&infin;C (S).
Camera Motion Characterization through Image Feature Analysis
Authors: Thitiporn Lertrusdachakul, Terumasa Aoki, Hiroshi Yasuda
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents an approach to characterize camera motion in video sequences based on image feature analysis. The approach predicts camera motion using spatio-temporal information obtained from tracking the feature points throughout an image sequence. The spatio-temporal information provides the advantage of rich visual characteristic along a larger temporal scale over the traditional approaches, which tend to formulate computational methodologies on a few adjacent frames. In this paper, we propose an algorithm to estimate camera motion by analyzing the motion trajectories of feature points over temporal change. The experimental results support that the proposed algorithm is effective in determining camera motion.
NASA's Exploration Agenda and Capability Engineering
Authors: Daniel E. Cooke, Matt Barry, Michael Lowry, Cordell Green
Venue: Computer (2006)

NASA is using model-based languages and risk analysis methodologies to raise software development to the level of hardware development. Ultimately, it hopes to achieve a fusion of systems and software engineering by replacing conventional software development techniques with capability engineering, which focuses on a system's full set of functionalities.
On-Chip Communication Hardware Resources for Globally Asynchronous and Locally Synchronous Systems
Authors: Supradeep Narayana
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Globally asynchronous and locally synchronous systems have been considered a promising solution for the SOC to solve the problems of multiple clock distribution and multiple clock skew. The problem of regulated flow of data between the processing cores could be better addressed with local and global control mechanisms. In this paper an attempt to develop such interface architectures for point to point communication between processing cores is presented.The paper also provides a hierarchial control model for the local and global controllers.
Performance Evaluation of Pipeline Paging under Paging Delay Constraint for Wireless Systems
Authors: Yang Xiao, Hui Chen Mohsen Guizani
Venue: IEEE Transactions on Mobile Computing (2006)

In this paper, we present a simple pipeline paging (PP) scheme, in which multiple paging requests (PRs) can be served in a pipeline manner in different paging areas. We analytically model the blanket paging (BP) scheme, the sequential paging (SP) scheme, and the PP scheme so that discovery rate, total delay, paging delay, and cost are derived analytically as functions of traffic load. Extensive simulations are carried out to verify our analytical results. Our study shows that the PP scheme outperforms both the BP and SP schemes in terms of discover rate while maintaining the same cost as the SP scheme. The PP scheme outperforms the SP scheme in terms of total delay and has a lower total delay than the BP scheme when traffic load is high. We also show that, when the paging delay constraint D is large enough, the PP scheme achieves almost 200 percent of discovery rate and 50 percent of cost of the BP scheme, whereas discovery rate of the SP scheme is far less than that of the BP scheme. Furthermore, we solve the following two-optimization problems for the PP scheme: 1) the minimization of discovery rate with a bound on total delay and 2) the minimization of cost with a bound on total delay. In case the cost factor is not considered but total delay is important, we propose an adaptive scheme: When the traffic is lower than a threshold, the BP scheme is adopted; otherwise, the PP scheme is used. In this case, the threshold value is explicitly derived.
Design of Multi-bit SET Adder and Its Fault Simulation
Authors: Deepanjan Datta, Samiran Ganguly
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

The paper describes an efficient approach towards the simulation of a multibit adder through single electron technology based on the concept of binary decision diagram (BDD). Single electron transistor (SET) technology is one of the future technology based on ultra-low power dissipation and reduced coulomb oscillation. Here, we describe an algorithm for the construction of a multibit adder followed by generation of stuck-at faults at different nodes of different levels of the adder. The algorithm also simulates the detection of a faulty level. In this paper, we demonstrate the construction procedure of an 8 bit full-adder and verify the design by means of simulation. This approach provides a novel approach towards simulating full adder circuit and also its fault analysis.