ppxscal/embedding_network huggingface dataset:
Utilizing simulation to evaluate business decisions in sense-and-respond systems
Authors: Paul Huang, Young M. Lee, Lianjun An, Markus Ettl, Steve Buckley, Karthik Sourirajan
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation can be an effective way to evaluate alternative decisions in Sense-and-Respond systems prior to taking actions to resolve existing or anticipated business situations. In Sense-and-Respond systems, business situations arise within predefined contexts that specify what aspects of the business need to be monitored and what information is needed to make decisions. We have designed a decision support system that dynamically configures simulation models based on business context and interactively presents simulation results to business analysts. In this paper, our decision support system is applied to the IBM Demand Conditioning process, in which mismatches between supply and demand are identified and corrective actions are initiated.
Large deviations for mean field models of probabilistic cellular automata
Authors: P. Balister, B. Bollobás, R. Kozma
Venue: Random Structures Algorithms (2006)

Probabilistic cellular automata form a very large and general class of stochastic processes. These automata exhibit a wide range of complex behavior and are of interest in a number of fields of study, including mathematical physics, percolation theory, computer science, and neurobiology. Very little has been proved about these models, even in simple cases, so it is common to compare the models to mean field models. It is normally assumed that mean field models are essentially trivial. However, we show here that even the mean field models can exhibit surprising behavior. We prove some rigorous results on mean field models, including the existence of a surrogate for the &ldquo;energy&rdquo; in certain non-reversible models. We also briefly discuss some differences that occur between the mean field and lattice models. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006
Unattended Facial Expressions Asymmetrically Bias the Concurrent Processing of Nonemotional Information
Authors: Jeffrey S. Maxwell, Alexander J. Shackman, Richard J. Davidson
Venue: Journal of Cognitive Neuroscience (2005)

Planned and reflexive behaviors often occur in the presence of emotional stimuli and within the context of an individual's acute emotional state. Therefore, determining the manner in which emotion and attention interact is an important step toward understanding how we function in the real world. Participants in the current investigation viewed centrally displayed, task-irrelevant, face distractors (angry, neutral, happy) while performing a lateralized go/no-go continuous performance task. Lateralized go targets and no-go lures that did not spatially overlap with the faces were employed to differentially probe processing in the left (LH) and right (RH) cerebral hemispheres. There was a significant interaction between expression and hemisphere, with an overall pattern such that angry distractors were associated with relatively more RH inhibitory errors than neutral or happy distractors and happy distractors with relatively more LH inhibitory errors than angry or neutral distractors. Simple effects analyses confirmed that angry faces differentially interfered with RH relative to LH inhibition and with inhibition in the RH relative to happy faces. A significant three-way interaction further revealed that state anxiety moderated relations between emotional expression and hemisphere. Under conditions of low cognitive load, more intense anxiety was associated with relatively greater RH than LH impairment in the presence of both happy and threatening distractors. By contrast, under high load, only angry distractors produced greater RH than LH interference as a function of anxiety.
Solution sets for DCOPs and graphical games
Authors: Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

A distributed constraint optimization problem (DCOP) is a formalism that captures the rewards and costs of local interactions within a team of agents, each of whom is choosing an individual action. When rapidly selecting a single joint action for a team, we typically solve DCOPs (often using locally optimal algorithms) to generate a single solution. However, in scenarios where a set of joint actions (i.e. a set of assignments to a DCOP) is to be generated, metrics are needed to help appropriately select this set and efficiently allocate resources for the joint actions in the set. To address this need, we introduce k-optimality, a metric that captures the desirable properties of diversity and relative quality of a set of locally-optimal solutions using a parameter that can be tuned based on the level of these properties required. To achieve effective resource allocation for this set, we introduce several upper bounds on the cardinalities of k-optimal joint action sets. These bounds are computable in constant time if we ignore the graph structure, but tighter, graph-based bounds are feasible with higher computation cost. Bounds help choose the appropriate level of k-optimality for settings with fixed resources and help determine appropriate resource allocation for settings where a fixed level of k-optimality is desired. In addition, our bounds for a 1-optimal joint action set for a DCOP also apply to the number of pure-strategy Nash equilibria in a graphical game of noncooperative agents.
BPEL4WS Unit Testing: Test Case Generation Using a Concurrent Path Analysis Approach
Authors: Jun Yan, Zhongjie Li, Yuan Yuan, Wei Sun, Jian Zhang
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

BPEL is a language that could express complex con- current behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. This method first uses an Extended Control Flow Graph (XCFG) to represent a BPEL program, and generates all the sequential test paths from XCFG. These sequential test paths are then combined to form concurrent test paths. Finally a constraint solver BoNuS is used to solve the constraints of these test paths and generate feasible test cases. Some techniques are proposed to reduce the number of combined concurrent test paths. Some test criteria de- rived from traditional sequential program testing are also presented to reduce the number of test cases. This method is modularized so that many test techniques such as various test criteria and complex constraint solvers can be applied. This method is tested sound and efficient in experiments. It is also applicable to the testing of other business process languages with possible extension and adaption.
Incremental approximate matrix factorization for speeding up support vector machines
Authors: Gang Wu, Edward Chang, Yen Kuang Chen, Christoper Hughes
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Traditional decomposition-based solutions to Support Vector Machines (SVMs) suffer from the widely-known scalability problem. For example, given a one-million training set, it takes about six days for SVMLight to run on a Pentium-4 sever with 8G-byte memory. In this paper, we propose an incremental algorithm, which performs approximate matrix-factorization operations, to speed up SVMs. Two approximate factorization schemes, Kronecker and incomplete Cholesky, are utilized in the primal-dual interior-point method (IPM) to directly solve the quadratic optimization problem in SVMs. We found out that a coarse approximate algorithm enjoys good speedup performance but may suffer from poor training accuracy. Conversely, a fine-grained approximate algorithm enjoys good training quality but may suffer from long training time. We subsequently propose an incremental training algorithm, which uses the approximate IPM solution of a coarse factorization to initialize the IPM of a fine-grained factorization. Extensive empirical studies show that our proposed incremental algorithm with approximate factorizations substantially speeds up SVM training while maintaining high training accuracy. In addition, we show that our proposed algorithm is highly parallelizable on an Intel dual-coreprocessor.
A queueing network approximation of semiconductor automated material handling systems: how much information do we really need?
Authors: Theresa M. Roeder, Nirmal Govind, Lee W. Schruben
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Queueing networks are sometimes used to model material handling in flexible manufacturing systems. We explore the use of a closed queueing network model to approximate an intrabay automated material handling system (AMHS) in semiconductor manufacturing. Rather than solving the model analytically, we propose simulating it. Current industry models are very complex and require long development and run times. The simulated approximation can be used as an easy and fast alternative. To compare the approximation with the detailed models in use, we employ an information taxonomy to classify AMHS models based on the amount and types of information needed to model the system, and to obtain desired output. This classification aids modelers in determining the level of detail to incorporate in a model based on the objectives of the simulation study.
Context-aware multicast routing scheme for disruption tolerant networks
Authors: Peng Yang, Mooi Choo Chuah
Venue: Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks (2006)

Disruption Tolerant Networks (DTNs) are emerging solutions to networks that experience frequent network partitions and large end-to-end delays. Several schemes have been proposed for multicast routing in DTNs assuming the availability of different amount of knowledge about network topology etc. In this paper, we propose a node-density based adaptive multicast routing scheme which can handle different network scenarios than the existing multicast delivery schemes for DTNs that we are aware of. Our scheme can address the challenges of opportunistic link connectivity in DTNs. Simulation results show that our CAMR scheme performs better than the DTBR and OS-multicast schemes. The CAMR scheme can achieve a better message delivery ratio, with higher transmission efficiency and similar delay performance especially when the nodes are very sparsely connected
Optimal filtering in fractional Fourier domains
Authors: M. A. Kutay, H. M. Ozaktas, L. Onural, O. Arikan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The ordinary Fourier transform is suited best for analysis and processing of time-invariant signals and systems. When we are dealing with time-varying signals and systems, filtering in fractional Fourier domains might allow us to estimate signals with smaller minimum mean square error (MSE). We derive the optimal fractional Fourier domain filter that minimizes the MSE for given non-stationary signal and noise statistics, and time-varying distortion kernel. We present an example for which the MSE is reduced by a factor of 50 as a result of filtering in the fractional Fourier domain, as compared to filtering in the conventional Fourier or time domains. We also discuss how the fractional Fourier transformation can be computed in O(N log N) time, so that the improvement in performance is achieved with little or no increase in computational complexity.
Query Division and Reformulation in Ontology-Based Heterogeneous Information Integration
Authors: Li Jian, Jin Beihong
Venue: Proceedings of the 15th International Conference on Computing (2006)

People could obtain information from heterogeneous data resources by semantic querying based on ontologies. In ontology-based heterogeneous information integration, dividing and reformulating a global query for ontology concepts' instances into multiple sub-queries over those local information sources is a fundamental challenge. This paper presents a kind of uniform expression for concept instances' queries and a method to divide the global query into local ones. All local query results could be integrated as answers of the global query according to the integration expression got by query division.
Teaching real-world analysis skills with a goal-based scenario
Authors: David A. Foster
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

This paper introduces a software architecture useful for teaching a particular class of real-world analysis tasks. It is based on a kind of teaching framework called a goal-based scenario, a "learning by doing" environment in which the student acts in a realistic role and obtains helpful coaching while performing assigned tasks. I describe a fully operational prototype system, Financial Report Analyst (FRA), which was built using this architecture. In FRA, the student learns skills in financial statement analysis by playing the role of a lending officer at a bank. The approach offers several advantages over the traditional business case method. Usability tests of FRA were conducted with students in the Kellogg Graduate School of Management at Northwestern University. It is proposed that the software architecture is applicable to teaching a variety of realistic analysis tasks, both inside and out of the domain of business administration.
A goal question metric based approach for efficient measurement framework definition
Authors: Patrik Berander, Per Jönsson
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

In software engineering, measurements can be used to monitor, understand and improve software processes as well as products and resource utilization. Commonly, measurement frameworks are ambitious undertakings that require large data collection and analysis efforts. Unfortunately, such frameworks usually become too extensive, resulting in graveyards with a lot of data never being analyzed and used. One well-known way for defining measurements that tries to focus on the most important ones is the Goal Question Metric (GQM) approach. GQM focuses on eliciting goals and questions as drivers for finding metrics necessary to collect. This means that there is always a purpose with the defined measurements. GQM solves part of the problem mentioned, but it is still possible that the measurements defined become too many. In this paper, an extended GQM approach is presented that facilitates identification of and focuses on the most important measurements for an organization. The approach makes it possible to be more efficient when it comes to the application of measurement frameworks. Besides the presentation of the approach, two case studies are presented where the suitability of the approach is investigated in an industrial context. In the case studies, the suggested approach has been applied on two different processes within software development: change management and requirements engineering. From these case studies, a number of experiences are highlighted and discussed as issues to consider when applying the approach.
Wigner bispectrum, phase product smoothing and time-varying bispectra
Authors: G. Frazer, B. Boashash
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Time-varying higher order spectra (TVHOS) based analysis is an emerging technique for analyzing signals which are non-stationary, non-Gaussian and nonlinear. Most TVHOS are derived from the Wigner-Ville distribution (WVD), and in particular, retain the lag centering property of the WVD. When extended to third and higher orders, calculation of TVHOS can be complicated by the need for signal interpolation, imposed by the requirement for lag centering. The authors derive a phase product relationship which allows the lag centred Wigner bispectrum to be computed in a simpler way using a non-lag centered time-varying bispectrum. For smoothed Wigner bispectra, the phase product term can be included in the smoothing function and so requires no additional computation. This result is demonstrated for the second-order case, where the WVD is computed using a non-lag centered Rihaczek time-frequency distribution.
Theory of parametric resonance: modern results
Authors: A. P. Seyranian
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Linear dynamical systems with many degrees of freedom with periodic coefficients also depending on constant parameters are considered. Stability of the trivial solution is studied with the use of the Floquet theory. First and second order derivatives of the Floquet matrix with respect to parameters are derived in terms of matriciants of the main and adjoint problems and derivatives of the systems matrix. This allows finding the derivatives of simple multipliers, responsible for the stability of the system, with respect to parameters and predicting their behavior with a change of parameters. It is shown how to use this information in gradient procedures for stabilization or destabilization of the system. As a numerical example, the system described by Carsson-Cambi equation is considered. Then, strong and weak interactions of multipliers on the complex plane are studied, and geometric interpretation of these interactions is given. As application of the developed theory the resonance domains for Hill's equation with damping are studied. It is shown that they represent halves of cones in the three-parameter space. Then, parametric resonance of a pendulum with damping and vibrating suspension point following arbitrary periodic law is considered, and the parametric resonance domains are found. Another important application of damped Hill's equation is connected with the study of stability of periodic motions in non-linear dynamical systems. it is shown how to find stable and unstable regimes for harmonically excited Duffing's equation. Then, linear vibrational systems with periodic coefficients depending on three independent parameters: frequency and amplitude of periodic excitation, and damping parameter are considered with the assumption that the last two quantities are small. Instability of the trivial solution of the system (parametric resonance) is studied. For arbitrary matrix of periodic excitation and positive definite damping matrix general expressions for domains of the main (simple) and combination resonances are derived. Two important specific cases of excitation matrix are studied: a symmetric matrix and a stationary matrix multiplied by a scalar periodic function. It is shown that in both cases the resonance domains is halves of cones ion the three-dimensional space with the boundary surface coefficients depending only on the eigenfrequencies, eigenmodes and system matrices. The obtained relations allow to analyze influence of growing eigenfrequencies and resonance number on resonance domains. Two mechanical problems are considered and solved: Bolotin's problem of dynamic stability of a beam loaded by periodic bending moments, and parametric resonance of a non-uniform column loaded by periodic longitudinal force. The lecture is a review of the recent results on parametric resonance obtained by the author with Frederick Solem, Pauli Pedersen (Denmark), and Alexei A. Mailybaev (Russia).
Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids
Authors: Naoki Fukuta, Takayuki Ito
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

We propose new approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids. In this paper, we focus on a more practical approximated algorithm in the context of revenue maximization. We propose a hill-climbing greedy algorithm, a SA-like random search algorithm, and their enhancement for searching multiple key parameter values. The experimental results demonstrate that our algorithms perform approximately 0.997 optimality compared with the optimal solutions and better than previously presented approximated algorithms. We also demonstrate that our algorithms are a kind of anytime algorithmthat bring better results in shorter computational time that can be applied to large and dynamic electronic markets.
Oblivious Transfer Using Elliptic Curves
Authors: Abhishek Parakh
Venue: Proceedings of the 15th International Conference on Computing (2006)

We introduce the idea of Oblivious Transfer to Elliptic Curve Cryptography (ECC), which has the advantage of providing same security with a 160-bit key compared to 1024-bit key needed by RSA. Oblivious Transfer forms the basis of numerous protocols which can all now be analogously developed in ECC using the algorithm we present in this paper. Also, we look into one of its important applications known as chosen one-out-of-two Oblivious Transfer and present a protocol for it using the algorithm we discuss.
Stabilization of nonlinear systems by derivative control
Authors: I. E. Zuber
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The nonlinear multivariable totally controllable system is considered. The admissible control is the feedback control by derivative. The aim is to define the feedback vector, which provides total exponential stability for closed loop system. The solution is performed by canonical nonlinear similarity transformation, providing Frobenious form for the object matrix of the transformed system. The sufficient condition of existence of such a feedback vector and its explicit form are defined.
Guest Editors' Introduction: Interacting with Digital Tabletops
Authors: Stacey D. Scott, Sheelagh Carpendale
Venue: IEEE Computer Graphics and Applications (2006)

A digital tabletop is sufficiently different from the standard desktop computer in that it invites researchers to challenge traditional perspectives on human-computer interaction, such as rethinking the use of a computer as a solitary act, the activities people do with computers, the types of social interactions that can be part of digital interactions, and how the interplay between digital and social needs can be supported. This special issue on digital tabletops provides a sample of the research being conducted in this domain.
Design of tele-educational system for interpreting dental tumor images
Authors: Min Wu
Venue: Journal of Medical Systems (2006)

Despite the fact that oral cancer is usually diagnosed with the naked eye, dental radiology can play a significant role in the process of diagnosis, treatment planning, assessment of response to treatment, and prognosis. This paper will discuss a prototype tele-educational system to support dental radiology training programs, which will help dental students get the skills necessary for interpreting dental tumor images. The system consists of a central database, an online case annotation tool and a case demonstration tool. The annotation tool allows dental faculty to integrate image findings with related clinical information, and to prepare high-quality teaching cases. The tele-educational system can improve and reinforce dental students' and dentists' skills in analyzing dental tumor images. The design of tele-educational system could serve as a model for self-evaluation of interpreting skills in dental tumor images as part of Continuous Medical Education (CME) in the future.