ppxscal/embedding_network huggingface dataset:
Quality of protection for mobile multimedia applications
Authors: A. Sinha, K. Nahrstedt, Wanghong Yuan
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In traditional computer systems, security is typically provided in a one-or-nothing manner; the system is either secure or insecure. Such an approach is insufficient for pervasive environments that contain heterogenous devices with varying computing resources. The small, portable handheld devices are often left unsecured due to their limited computing power. The approach is also inadequate for multimedia applications that require security as a controllable service attribute to maintain performance quality of service to levels that are acceptable to the users. Hence, we need a tunable and differentiable security framework. In this paper, we present a quality of protection (QoP) framework that resolves the inadequacies of the one-or-nothing approach by providing differential security levels for different device, user and application security requirements and preferences. We show that our QoP framework is necessary for multimedia applications to achieve the best possible security and performance levels in pervasive environments.
A Stochastic Maximum Principle for Systems with Jumps
Authors: Qimin Zhang, Xining Li
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

We obtain a stochastic maximum principle for systems with jumps that provides both necessary and sufficient conditions of optimality. This is the first version of the stochastic maximum principle that covers the consumptioninvestment problem in which there are jumps in the price system.
Unification and Evaluation of Graph Drawing Algorithms for Different Application Domains
Authors: Bastian Florentz, Tilo Muecke
Venue: Proceedings of the conference on Information Visualization (2006)

Today formalisms with graphical representations are used to model structure, behaviour, and other views on software and systems. The UML is just one example for modelling languages with graphical representation of its models. Although most models are executable without explicit graphical information of the model's elements, the appearance of a model is of particular importance for its readability. To improve the so called embedding of a graph representing a model or to create a initial embedding, an algorithmic support for arranging the elements is useful. We provide a software environment in which layout algorithms can be developed and evaluated. By defining proper interfaces for graph elements, we provide easy access to our library of layout algorithms for external use.
Comparative study of centralized and decentralized localization methods
Authors: F. Baldit, J.-P. Le Cadre
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Decentralized detection (DD) is an interesting alternative to classical centralized detection (CD) when communicational/computational constraints play an important role in the design of the decision system. The authors investigate the feasibility of decentralized techniques for realistic situations, and their relative performance with CD when the Neyman-Pearson criterion is chosen, where relatively good performance of DD is shown. Of special interest seems to be the inherent robustness of DD architectures.
A practical extension to the VORD model
Authors: Jeffrey Rekoske, Hamid Ghasemiyeh, Ahmed Salem
Venue: ACM SIGSOFT Software Engineering Notes (2006)

This paper describes an extension to the VORD model and attempts to resolve its lack of direct support for viewpoint interaction. Supporting the viewpoint interaction provides a useful tool for analyzing requirements changes and automating systems. It can also be used to indicate when multiple requirements are specified as a single requirement. The extension is demonstrated with the bank auto-teller system that was part of the original VORD proposal.
Finite element analysis and design of control system with feedback output using piezoelectric sensor/actuator for panel flutter suppression
Authors: Seong Hwan Moon
Venue: Finite Elements in Analysis and Design (2006)

A general finite element formulation of an optimal control scheme such as a linear quadratic regulator (LQR) with output feedback is presented for the nonlinear flutter suppression of a composite panel with piezoelectric actuators and sensors. Most of the studies on panel flutter suppression have been based on LQR full state feedback control law where all the state components are assumed to be available and thus the previous LQR controllers cannot be suitable for actual applications. This work intends to develop output feedback control law that provides a more meaningful design approach in practice for panel flutter suppression. The governing equations are derived through the use of the principle of virtual displacements and a finite element discretization is performed with the C1 conforming four-node rectangular element. Additional electrical degrees of freedom are introduced to model piezoelectric actuators and sensors. The discretized dynamic equations of motion are transformed into a nonlinear coupled-modal equation by using the proper modal coordinates and then the equation is transformed into a state space model in order to design controller. For maximum control effect, the shape and location of the actuators and sensors are determined by using genetic algorithms. The flutter suppression results are presented in the time domain using the Newmark-β method.
Efficient Scheduling of Vital E-Commerce Requests
Authors: Muhammad Younas, Irfan Awan, Kuo-Ming Chao
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper presents a network-centric approach that gives preferential treatment to different classes of E-commerce requests such as browse, search, and payment requests. The premise is that some requests are more valuable than others. For instance, the processing of browse and search requests may get less priority than payment requests  which we call vital E-commerce requests. In order to accomplish differentiated treatment of such requests we propose an active network priority scheduling mechanism. This approach analyses the arrival process of distinct Ecommerce requests and employs a priority scheduling mechanism that gives preferential treatment to vital (or high priority) requests. It also calculates the queuing delay involved in the E-commerce requests at each network node. The aim is to reduce the queuing delay of vital requests at the network nodes thereby improving the response time of such requests. The proposed approach is tested through various experiments which show significant improvements in the response time of vital requests.
With Collaborative Task Management towards Lightweight Distributed Engineering Processes
Authors: Sabine Kolvenbach, Wolfgang Grather, Konrad Klockner
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

A clear trend in the development of industry products is that due to shorter development time and keen competition more and more distributed networks of enterprises and suppliers cope with the engineering processes. These changes request new IT solutions for collaborative task management in distributed teams wherein team members are essentially involved in the process management and responsible for its progress. This paper presents based on an application scenario and the resulting requirements the SAGE platform, a system that provides functions to support lightweight distributed engineering processes by collaborative task management.
DSIM: scaling time warp to 1,033 processors
Authors: Gilbert Chen, Boleslaw K. Szymanski
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper presents the design, implementation and performance of a Time Warp simulator, called DSIM, which targets clusters comprised of thousands of processors. DSIM employs a novel technique for GVT computation, called the Time Quantum GVT algorithm that requires no message acknowledgement, relies on constant-length messages and is efficient on clusters with large numbers of processors. Its implementation uses a technique called Local Fossil Collection to alleviate the overhead of memory reclamation and to support efficient event management. DSIM is also equipped with a simple programming interface to ease programming and debugging of simulations. Experimental results obtained on the PHOLD benchmark demonstrated that DSIM can process as many as 228 million events per second on 1033 processors.
Implementation of Operator Support System Using Dynamic Simulator for Abnormal Plant Condition
Authors: Kenji Kataoka, Kazuhiko Suzuki, Hossam A. Gabbar
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper, a prototype of Operator Support System is developed to support operators in abnormal plant condition. The system has following two functions; one is to assist operators for decision-making in case of recovery operation equivalent to expert operators. Another is to prevent operation errors by monitoring operator's action. In recent years, Japanese industry faces serious problem that skilled operators are reaching their retirement age. It is a great concern that the operation skills such as decision-making would begin to decline after the retirement of skilled operators. In addition, their accumulated experience and knowledge, which cannot be sufficiently explained in manuals alone, will be lost from plant workplaces. The Operator Support System proposed in this paper eliminates such concerns.
Multiply-constrained distributed constraint optimization
Authors: E. Bowring, M. Tambe, M. Yokoo
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, in many domains, agents must satisfy additional constraints on resources consumed locally (due to interactions within their local neighborhoods). Such resource constraints may be required to be private or shared for efficiency's sake. This paper provides a novel multiply-constrained DCOP algorithm for addressing these domains which is based on mutually-intervening search, i.e. using local resource constraints to intervene in the search for the optimal solution and vice versa. It is realized through three key ideas: (i) transforming n-ary constraints to maintain privacy; (ii) dynamically setting upper bounds on joint resource consumption with neighbors; and (iii) identifying if the local DCOP graph structure allows agents to compute exact resource bounds for additional efficiency. These ideas are implemented by modifying Adopt, one of the most efficient DCOP algorithms. Both detailed experimental results as well as proofs of correctness are presented.
Explicit substitutions and higher-order syntax
Authors: Neil Ghani, Tarmo Uustalu, Makoto Hamana
Venue: Higher-Order and Symbolic Computation (2006)

Recently there has been a great deal of interest in higher-order syntax which seeks to extend standard initial algebra semantics to cover languages with variable binding. The canonical example studied in the literature is that of the untyped ¿-calculus which is handled as an instance of the general theory of binding algebras, cf. Fiore et al. [13].Another important syntactic construction is that of explicit substitutions which are used to model local definitions and to implement reduction in the ¿-calculus. The syntax of a language with explicit substitutions does not form a binding algebra as an explicit substitution may bind an arbitrary number of variables. Thus explicit substitutions are a natural test case for the further development of the theory and applications of syntax with variable binding.This paper shows that a language containing explicit substitutions and a first-order signature ¿ is naturally modelled as the initial algebra of the Id + F ¿¿_ +_ ¿ _ endofunctor. We derive a similar formula for adding explicit substitutions to the untyped ¿-calculus and then show these initial algebras provide useful datatypes for manipulating abstract syntax by implementing two reduction machines. We also comment on the apparent lack of modularity in syntax with variable binding as compared to first-order languages.
ConferenceXP and Advanced Collaborative Scenarios
Authors: Todd Needham
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

ConferenceXP is an initiative of Microsoft Research exploring how to make wireless classrooms, advanced realtime collaboration, and distance learning a compelling, rich experience by assuming the availability of emerging and enabling technologies, such as high-bandwidth networks, multicast, wireless devices and Tablet PCs. The ConferenceXP research platform enables researchers to create distributed applications that take advantage of ConferenceXP technology as well as Tablet PCs and wireless networks while enabling them to develop the collaborative tools and applications they need without having to build them from the ground up. By partnering with research organizations and universities, the ConferenceXP project combines the academic community's expertise in the learning sciences with Microsoft's expertise in technology.
DEP: detailed execution profile
Authors: Qin Zhao, Joon Edward Sim, Weng-Fai Wong, Larry Rudolph
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

In many areas of computer architecture design and program development, the knowledge of dynamic program behavior can be very handy. Several challenges beset the accurate and complete collection of dynamic control flow and memory reference information. These include scalability issues, runtime-overhead, and code coverage. For example, while Tallam and Gupta's work on extending WPP (Whole Program Paths) showed good compressibility, their profile requires 500MBytes of intermediate memory space and an average of 23 times slowdown to be collected.To address these challenges, this paper presents DEP (Detailed Execution Profile). DEP captures the complete dynamic control flow, data dependency and memory reference of a whole program's execution. The profile size is significantly reduced due to the insight that most information can be recovered from a tightly coupled record of control flow and register value changes. DEP is collected in an infrastructure called Adept (A dynamic execution profiling tool), which uses the DynamoRIO binary instrumentation framework to insert profile-collecting instructions within the running application. DEP profiles user-level code execution in its entirety, including interprocedural paths and the execution of multiple threads.The framework for collecting DEP has been tested on real, large and commercial applications. Our experiments show that DEP of Linux SPECInt 2000 benchmarks and Windows SysMark benchmarks can be collected with an average of 5 times slowdown while maintaining competitive compressibility. DEP's profile sizes are about 60% that of traditional profiles.
Jet subdivision schemes on the k-regular complex
Authors: Yonggang Xue Thomas P.-Y. Yu, Tom Duchamp
Venue: Computer Aided Geometric Design (2006)

We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for free-form surface modeling. In an order r jet subdivision scheme, rth order Taylor expansions, or r-jets, of functions are the essential objects being generated in a coarse-to-fine fashion. Standard subdivision surface methods correspond to the case r=0. Just as the standard free-form subdivision surface schemes, jet subdivision schemes are based on combining (i) a symmetric subdivision scheme in the shift-invariant setting with (ii) an extraordinary vertex rule. We formulate the notions of stationarity, symmetry, and smoothness for jet subdivision schemes. We then extend some well-known results in the theory of subdivision surfaces to the setting of jet subdivision schemes.By incorporating high order data into the subdivision rules, jet subdivision schemes offer more degrees of freedom for the design of extraordinary vertex rules than do standard subdivision schemes. Using a simple 2-point stencil, we construct an order 1 jet subdivision scheme, which is interpolatory, C1 everywhere, and free from polar artifacts at extraordinary vertices of any valence. It is similar to the popular butterfly scheme, but unlike the butterfly scheme, it produces surfaces that can be explicitly parameterized by spline functions. In addition, our jet subdivision scheme allows for explicit control of gradient information on the resulting surface.We address the problem of constructing curvature continuous subdivision schemes at extraordinary vertices by giving an example of a 'flexible C2 scheme' for extraordinary vertex of valence k = 3. The stencils for this subdivision scheme coincide with those of the popular Loop scheme. We discuss the mathematical structure of this example of a C2 scheme.
Optimizing code-copying JIT compilers for virtual stack machines: Research Articles
Authors: David Gregg, M. Anton Ertl
Venue: Concurrency and Computation: Practice Experience (2006)

Just-in-time (JIT) compilers are widely used to implement stack-based virtual machines, such as the Java and .NET virtual machines. One disadvantage of most JIT compilers is that they are unportable; much of the back-end is specific to the target machine. An alternative to machine-specific code generation methods is to define a routine in a high-level language for each virtual machine instruction. These can be compiled to native code using a normal C compiler. The native code for these routines can then be strung together, allowing very simple, unoptimized code to be produced just in time. In this paper we present such a system based on an existing implementation of the Forth language. We present a novel system of optimizations for the system based on exploiting common sequences of virtual machine instructions. We use a small domain specific language and tool to generate stack-optimized code for sequences of virtual machine instructions, and for choosing the most useful sequences for a code-copying compiler. By measuring the length of the resulting executable code, we allow machine-specific sequences to be chosen without any machine-dependent code in our system. Experimental results show that best (average) speedups of 47.2&percnt; (15.75&percnt;) are possible on a Pentium 4 machine, and even higher an a PowerPC based machine. Furthermore, our optimizations allow the size of the generated code to be reduced by an average of 17.9&percnt; on the Pentium 4, and 20.5&percnt; on the PowerPC over a wide range of programs. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Design of Collusion-Free Codes Based on MAI-Free Principle
Authors: Byung-Ho Cha, C.-C. Jay Kuo
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The design of collusion-free codes for data hiding systems is investigated, and two new collusion-free codes are proposed in this work. They are called the Orthogonal Spreading (OS) codes and the Orthogonal Spreading codes with Inverse discrete Fourier Transform (OSIFT). The design of OSIFT codes is motivated by the recently developed multi-access-interference-free (MAI-free) codes in an orthogonal frequency division multiplexing (OFDM) wireless communication system. Code embedding and detection algorithms are described. It is shown by simulation that both OS and OSIFT codes are robust against collusion attacks in an exemplary audio watermarking system.
Evolving an immersive medical communication skills trainer
Authors: Kyle Johnsen, Robert Dickerson, Andrew Raij, Cyrus Harrison, Benjamin Lok, Amy Stevens, D. Scott Lind
Venue: Presence: Teleoperators and Virtual Environments (2006)

This paper presents our experiences in evolving the Virtual Objective Structured Clinical Exam (VOSCE) system. This system allows medical students to experience the interaction between a patient and a medical doctor using natural methods of interaction with a high level of immersion. These features enable the system to provide training on medical communication skills. We discuss the experiences of a group of medical and physician assistant students that pilot tested the system. Further, we examine the impact of evolving the system based on their feedback. The VOSCE system's performance in subsequent studies has indicated that end-user feedback improvements have significantly impacted overall performance and efficacy.
A multidimensional version of Turán's lemma
Authors: Natacha Fontes-Merz
Venue: Journal of Approximation Theory (2006)

In this article we provide a multidimensional version of Nazarov's extension of Turán's lemma--a result in which the uniform norm of a complex-valued polynomial, p, on the unit circle T is compared with the uniform norm of p on any measurable subset of T. If we let Tn:= T ×...× T represent the distinguished boundary of the polydisk Dn = D ×...× D for n ∈ N and D the open unit disk then, as in the one dimensional case, the constant which relates the uniform norm of p on Tn to the uniform norm of p on any measurable subset E of Tn depends on the order of p and the measure of the set E.
Bayesian State Space Modeling Approach for Measuring the Effectiveness of Marketing Activities and Baseline Sales from POS Data
Authors: Tomohiro Ando
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Analysis of Point of Sales (POS) data is an important research area of marketing science and knowledge discovery, which may enable marketing managers to attain the effective marketing activities. To measure the effectiveness of marketing activities and baseline sales, we develop the multivariate time series modeling method in the framework of a general state space model. A multivariate Poisson model and a multivariate correlated auto-regressive model are used for a system model and an observation model. The Bayesian approach via Markov Chain Monte Carlo (MCMC) algorithm is employed for estimating model parameters. To evaluate the goodness of the estimated models, the Bayesian predictive information criterion is utilized. The proposed model is evaluated with its application to actual POS data.
New Image Retrieval System Based on Robust Color and Texture Pattern Feature Extractions
Authors: Zhuo Liu, Shigeo Wada
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In this dissertation, a new image retrieval system based on robust color and texture pattern feature extractions is investigated. The substance of research is composed of three main parts. First, robust feature extraction method from an original image based on advanced image processing techniques is proposed. The robustness designates geometric distortions (rotation, scaling and translation), illumination degradation and additive noise. Next, a construction method of efficient feature space suitable for image retrieval and classification is proposed. The feature space is obtained by a linear transform of the original robust feature space. The linear transform is generated by nonlinear least square optimization for the membership matrix. Further, by unifying the color and texture features, the user friendly fuzzy distance that fits the sense of distance is obtained. In the computer simulations, the individual process is examined. The effectiveness of the methods is verified in comparison with the conventional approaches.