ppxscal/embedding_network huggingface dataset:
Homoclinical chaos suppression
Authors: A. Loskutov, A. Janoev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

Basing on the Melnikov method that gives a sufficient criterion of chaoticity in the separatrix neighborhood, analysis of the chaos suppression phenomenon is carried out. As a result, an explicit form of external perturbations leading to the stabilization of chaotic dynamics is analytically found. This fact gives us a method for the chaos suppression by an additive excitation of the system with the homoclinical structure.
A Content and Device Management Method for Multiple Contents Browsing with Multiple Devices
Authors: Yuhei Akahoshi, Katsumi Tanaka, Yutaka Kidawara
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

This paper proposes a content and device management method for multiple contents browsing with multiple devices. We introduce Content Management Description and Device Management Description; the former is used to determine what content to distribute to the device and how to present it, while the latter is used to determine the current status of devices available for browsing content. By analyzing them, contents are distributed and effectively presented on their respective devices. This method is expected to achieve effective browsing of contents with multiple devices in users' preferred styles.
Partition Based Dynamic 2D HW Multitasking Management
Authors: Sara Roman, Hortensia Mecha, Daniel Mozos, Julio Septien
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The design of computing systems is facing an interesting challenge with the opportunity to include runtime reconfigurable (RTR) devices in them. Operating Systems (OS) need to be extended with functionalities that allow to efficiently manage such devices. Here we present a simple and fast algorithm for the management of FPGA area in a general-purpose computing system with hardware multitasking. It divides the device area into four partitions with different sizes. Each partition has an associated queue where the hardware manager places each arriving task depending on its size, shape and deadline requirements. Rectangular tasks may be rotated when necessary, and partition merging done if needed for tasks not fitting any partition. The queue selection cirterium and the size of the partitions may be changed during run-time in order to adapt algorithm behaviour to different circumstances. This is a constant complexity algorithm and we will show experimental results that prove it may compete in performance with other algorithms.
Formalizing Agility, Part 2: How an Agile Organization Embraced the CMMI
Authors: Steven W. Baker
Venue: Proceedings of the conference on AGILE 2006 (2006)

Most large IT organizations need the best of both worlds -working software that supports ever-changing business needs, and a process for delivering software that is predictable, trainable, and auditable. Organizations with agile software teams often receive timely, costeffective solutions of sufficient quality. Organizations with formal processes often benefit from industryrecognized certifications and robust process improvement mechanisms. Rarely does a single, large IT organization achieve both. DTE Energy has such a combination: its lightweight yet CMMI-compatible methodology is now used within its 600+ person IT organization to deliver and support working software. Its small teams embrace core agile principles as they provide "just enough" solutions that satisfy maturing business needs. Yet they passed two SCAMPI appraisals toward formal CMMI Level III This report extends the Agile 2005 experience report on DTE Energy's agile IT organization's journey toward CMMI staged maturity accreditation. This report briefly recaps their seven years of agile experience, presents governance mechanisms and change management techniques, and highlights their four-release, one-year plan for CMMI Level III accreditation. Finally, this report offers suggestions on embracing a formal process framework that are applicable to any organization.
Architectures and compilers for multimedia
Authors: W. Wolf
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Summary form only given. The article covers architectures and compilers for multimedia systems. Multimedia applications impose real-time constraints on continuous media; they also include a surprisingly wide variety of algorithms. Many multimedia systems also operate under power/energy constraints. As such, multimedia computing systems are an important area of interest for ISPASS. This tutorial targets individuals with experience in hardware and software but who have limited expertise in multimedia. We start with an introduction to multimedia algorithms such as video and audio compression since the characteristics of these algorithms help to shape measurement strategies and architectural decisions. We then cover modern multimedia architectures and compilation techniques relevant to those architectures. We conclude with a case study drawn from our own research - the design of a multiprocessor system-on-chip for real-time gesture recognition.
A PDE-based method for ringing artifact removal on grayscale and color JPEG2000 images
Authors: P. Bourdon, B. Augereau, C. Olivier, C. Chatellier
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

As successor to JPEG, JPEG2000 aims to realize a very low bitrate. Although JPEG2000's rate distortion has been improved by approximately 30% against JPEG, as on most images compressed using overlapping transforms-based algorithms, one can notice visible spurious oscillations, or ringing artifacts, around the edges of a JPEG2000-compressed image. In this paper, we propose a partial differential equations, or PDE-based image enhancement technique, in order to remove these ringing artifacts, while keeping the image's edges. Results are provided on grayscale and color images, showing a visible enhancement, confirmed by the PSNR increase.
New lower bound for the capacitated arc routing problem
Authors: Sanne Wøhlk
Venue: Computers and Operations Research (2006)

We present a new lower bound, the Multiple Cuts Node Duplication Lower Bound, for the undirected Capacitated Arc Routing Problem. We prove that this new bound dominates the existing bounds for the problem. Computational results are also provided.
Fuzzy + PID Controller for Robot Manipulator
Authors: S. G. Anavatti, S. A. Salman, J. Y. Choi
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)

Design and stability analysis for a hybrid fuzzy logic controller is presented in the present work for a robot manipulator. The PD-type fuzzy controller is combined with a conventional PID controller to enhance the performance and robustness of the controller. A simple stability analysis is presented for the hybrid controller. Numerical simulation results are presented to validate the controller design.
Work smarter, not harder: guidelines for designing simulation experiments
Authors: Susan M. Sanchez
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We present the basic concepts of experimental design, the types of goals it can address, and why it is such an important and useful tool for simulation. A well-designed experiment allows the analyst to examine many more factors than would otherwise be possible, while providing insights that could not be gleaned from trial-and-error approaches or by sampling factors one at a time. We focus on experiments that can cut down the sampling requirements of some classic designs by orders of magnitude, yet make it possible and practical to develop an understanding of a complex simulation model and gain insights into its behavior. Designs that we have found particularly useful for simulation experiments are illustrated using simple simulation models, and we provide links to other resources for those wishing to learn more. Ideally, this tutorial will leave you excited about experimental designs---and prepared to use them---in your upcoming simulation studies.
Guided Reasoning of Complex E-Business Process with Business Bug Patterns
Authors: Ke Xu, Ying Liu, Cheng Wu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

With the growing complexity of e-business applications and the urgent need for ensuring its reliability, much effort has been made to advocate the application of model checking in probing hidden flaws in these applications. This work devotes itself to the performance enhancement in reasoning e-business processes with model checking. Our major contribution lies in: (1) A set of business bug patterns are extracted from workflow patterns to exploit existing business knowledge in probing undesired violations in ebusiness processes; (2) The semantics of business bug patterns are formally captured with the IEEE standard of PSL; (3) Guided verification algorithms are development based on the above findings to accelerate the reasoning of complex e-business applications. Their efficiencies are testified with three concrete business cases in banking and manufacturing domains with our business process verification toolkit of OPAL.
Multi-agent Interaction Based Collaborative P2P System for Fighting Spam
Authors: Guoqing Mo, Wei Zhao, Haixia Cao, Jianshe Dong
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The Spam problem is getting worse though so many anti-spam filters have been applied. In this paper, we propose a novel method to utilize the interaction between multi agents in a peer-to-peer system for spam filtering. There are mainly two kinds of agents in our system: local agent for filtering spam and learning spam's feature; social agent for searching the same or approximate mails. When a mail arrives, the local agent takes charge at first; the mail is classified into three categories: non-spam, spam, suspicious spam. Only the suspicious spam is sent to the P2P network by social agent for a collaborative judgment. The result of judgment is returned to local agent, then local agent learning this judgment, so when next time the same or approximate spam arrives, the local agent can block it. The whole procedure can be accomplished without user's supervision, or if the user makes decision beyond the system his interest profile can be learnt by system therefore the user's precious time is saved. Analysis of the experiment result show that the system can filter spam efficiently and cost less bandwidth.
Design and testing of an ultra-high-speed cable robot
Authors: R. Dekker, A. Khajepour, S. Behzadipour
Venue: International Journal of Robotics and Automation (2006)

The goal of this paper is to introduce the design and testing of a new ultra-high-speed robot. This robot is able to reach speeds of over 120 cycles per minute for pick-and-place applications. A parallel manipulator design was chosen because of its low inertia and high stiffness. The inertia of the robot was further reduced by replacing some of the rigid links with cables. The use of cables requires a method for keeping the cables in tension, which was provided by a central compression member between the moving and fixed plate. The compression member keeps all the cables in tension but does not interfere with the robot's workspace. The new cable-based parallel manipulator design, called DeltaBot, is kinematically constrained to have three pure translational degrees of freedom. A prototype of DeltaBot was built and tested. The DeltaBot prototype is capable of reaching 150 cycles per minute with a position repeatability of less than 0.1 mm.
FIR Digital Filters Design Based on Quantum-behaved Particle Swarm Optimization
Authors: Wei Fang, Jun Sun, Wenbo Xu, Jing Liu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

FIR digital filters design involves multi-parameter optimization, on which the existing optimization algorithm doesn't work efficiently. This paper focuses on employing the proposed Quantum-behaved Particle Swarm Optimization (QPSO) to design FIR digital filters. QPSO is a global stochastic searching technique that can find out the global optima of the problem more rapidly than original PSO. After describing the origin and development of QPSO, we present how to use it in FIR digital filters design. It has been demonstrated by experiment results that QPSO outperforms the PSO and Genetic Algorithm (GA) for the problem.
Combining effects: sum and tensor
Authors: Martin Hyland, Gordon Plotkin, John Power
Venue: Theoretical Computer Science (2006)

We seek a unified account of modularity for computational effects. We begin by reformulating Moggi's monadic paradigm for modelling computational effects using the notion of enriched Lawvere theory, together with its relationship with strong monads; this emphasises the importance of the operations that produce the effects. Effects qua theories are then combined by appropriate bifunctors on the category of theories. We give a theory for the sum of computational effects, which in particular yields Moggi's exceptions monad transformer and an interactive input/output monad transformer. We further give a theory of the commutative combination of effects, their tensor, which yields Moggi's side-effects monad transformer. Finally, we give a theory of operation transformers, for redefining operations when adding new effects; we derive explicit forms for the operation transformers associated to the above monad transformers.
Structure from Motion with Known Camera Positions
Authors: Rodrigo Carceroni, Ankita Kumar, Kostas Daniilidis
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The wide availability of GPS sensors is changing the landscape in the applications of structure from motion techniques for localization. In this paper, we study the problem of estimating camera orientations from multiple views, given the positions of the viewpoints in a world coordinate system and a set of point correspondences across the views. Given three or more views, the above problem has a finite number of solutions for three or more point correspondences. Given six or more views, the problem has a finite number of solutions for just two or more points. In the three-view case, we show the necessary and sufficient conditions for the three essential matrices to be consistent with a set of known baselines. We also introduce a method to recover the absolute orientations of three views in world coordinates from their essential matrices. To refine these estimates we perform a least-squares minimization on the group cross product SO(3) × SO(3) × SO(3). We report experiments on synthetic data and on data from the ICCV2005 Computer Vision Contest.
On the relationship between MDPs and the BDI architecture
Authors: Gerardo I. Simari, Simon Parsons
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper we describe the initial results of an investigation into the relationship between Markov Decision Processes (MDPS) and Belief-Desire-Intention (BDI) architectures. While these approaches look rather different, and have at times been seen as alternatives, we show that they can be related to one another quite easily. In particular, we show how to map intentions in the BDI architecture to policies in an MDP and vice-versa. In both cases, we derive both theoretical and related algorithmic mappings. While the mappings that we obtain are of theoretical rather than practical value, we describe how they can be extended to provide mappings that are useful in practice.
Automatic video segmentation using genetic algorithms
Authors: Eun Yi Kim, Se Hyun Park
Venue: Pattern Recognition Letters (2006)

The current paper proposes a genetic algorithm (GA)-based segmentation method that can automatically extract and track moving objects. The proposed method mainly consists of spatial and temporal segmentation; the spatial segmentation divides each frame into regions with accurate boundaries, and the temporal segmentation divides each frame into background and foreground areas. The spatial segmentation is performed using individuals that evolve distributed genetic algorithms (DGAs). However, unlike standard DGAs, the individuals are initiated from the segmentation result of the previous frame, then only unstable individuals corresponding to actual moving object parts are evolved by mating operators. For the temporal segmentation, adaptive thresholding is performed based on the intensity difference between two consecutive frames. The spatial and temporal segmentation results are then combined for object extraction, and tracking is performed using the natural correspondence established by the proposed spatial segmentation method. The main advantages of the proposed method are twofold: first, proposed video segmentation method does not require any a priori information; second, the proposed GA-based segmentation method enhances the search efficiency and incorporates a tracking algorithm within its own architecture. These advantages were confirmed by experiments where the proposed method was successfully applied to well-known and natural video sequences.
Automatic Application Partitioning on FPGA/CPU Systems Based on Detailed Low-Level Information
Authors: Giovanni Busonera, Salvatore Carta, Andrea Marongiu, Luigi Raffo
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Reconfigurable FPGA/CPU systems are widely described in literature as a viable processing solution for embedded and high end processing. One of the key issues of this kind of approach is the code partitioning between CPU and FPGA. The development of automatic partitioning tools allows to obtain optimized architecture without a specific knowledge of digital design. In this paper we present a framework which, starting from an ANSI C application code: (i) automatically identifies code fragments suitable for hardware implementation as specialized functional units (ii)for all these segments a synthesizable code is generated and sent to a synthesis tool, (iii) from the synthesis results, the segments to be implemented on FPGA are selected (iv) bitstream to configure the FPGA and modified C code to be executed on the CPU are generated. We applied this tool to standard benchmarks obtaining, with respect to state of the art, an improvement of up to 250% in the accuracy of performances estimation related to the selected segments of code. This leads to a more optimized code partitioning.
A pervasive comparison shopping business model for integrating offline and online marketplace
Authors: Kyoung Jun Lee, Young Hwan Seo
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

In always-online environment that allows consumers to be online anytime, anyplace, the next step will be the integration of online and offline markets and there is a possibility that the role of offline retailers shifts to that of a displayer. When this occurs, appropriate technological devices and business models should be explored so that both displayers and retailers can benefit. To this end, this paper proposes an Auto-Identification technology (e.g. RFID)-based pervasive comparison shopping business model. The auto-identification technology will allow consumers to be seamlessly connected to the network, and the advent of a new shopping network will enable an incentive mechanism between displayers and retailers. Ultimately, a new shopping network will enable consumers to be engaged in seamless commerce.
Behavior Recognition in Human Object Interactions with a Task Model
Authors: Weilie Yi, Dana H. Ballard
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Behavior recognition can be greatly levitated by a model of the task with which the behavior is associated. We present a Markovian task model that captures the temporal relations between subtasks, and provides prior information that helps behavior recognition from simple and noisy sensory data. A Dynamic Bayesian Network is used to integrate multi-model evidence and infer underlying task states. Experiments demonstrate that this system can recognize human behavior in everyday tasks such as making sandwiches.
The adaptive MSINR algorithm to improve error rate for channel equalization
Authors: Rainfield Y. Yen, Hong-Yu Liu, Che-Wei Li, Wei-Chung Cheng
Venue: Signal Processing (2006)

Based on the expression of the error probability for the infinite length equalizer and the error bound for the finite length equalizer for M-ary PAM channels using the unbiased decision rule, we are inspired to develop an adaptive algorithm called the maximum signal-to-interference-plus-noise ratio algorithm (MSINR) to improve error rate performance. The MSINR algorithm is found to outperform the LMS both in convergence behaviors and error rate performance. When comparing with a true minimum error rate algorithm called approximate minimum bit error rate (AMBER), it is found that AMBER yields a lower error probability as expected, but as the equalizer length is sufficiently long, the error probabilities obtained from MSINR very closely approximate the minimum error probabilities given by AMBER. Moreover, the MSINR convergence performance, both in speed and smoothness, is far superior to the AMBER.
Real-time Image-Based Guidance Method for Lung-Cancer Assessment
Authors: Lav Rai, Scott A. Merritt, William E. Higgins
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

The assessment of lung cancer involves off-line threedimensional (3D) computed-tomography (CT) image assessment followed by live bronchoscopy. While standard bronchoscopy provides live video of information inside the lung airways, it does not give any information outside the airways. This results in a low procedure success rate. The success rate can be improved if the physician receives 3D CT-based image guidance. We describe a fast robust method that provides 3D CT-based image guidance during live bronchoscopy. The method enables a continuous registration between the 3D CT image space and the real bronchoscopic video. At a top level, it involves an interleaving of continuous video tracking and CT-video fine registration. During video tracking, the bronchoscope's 3D motion is estimated using a point-based 3D-2D pose estimation method. Registration is performed via a warpingbased Gauss-Newton method that uses a normalized crosscorrelation- based cost for measuring similarity between the bronchoscopic video and CT image data. The method operates at a real-time rate of 10 frames per second, which is over an order of magnitude faster than past approaches. This real-time performance enables live guidance during a procedure. The method is incorporated into a computerbased system for image-guided bronchoscopy and has been applied to human lung-cancer patients. Results are presented for a phantom and lung-cancer patients. Keywords: 3D medical imaging, video tracking, image registration, virtual endoscopy, image-guided surgery