ppxscal/embedding_network huggingface dataset:
Strong Vector Equilibrium Problems
Authors: Gong Xunhua
Venue: Journal of Global Optimization (2006)

In this paper, the existence of the solution for strong vector equilibrium problems is studied by using the separation theorem for convex sets. The arc-wise connectedness and the closedness of the strong solution set for vector equilibrium problems are discussed; and a necessary and sufficient condition for the strong solution is obtained.
Managing Information and Time Flow in an Agent-Based E-Commerce System
Authors: Maciej Gawinecki, Maria Ganzha, Pawel Kobzdej, Marcin Paprzycki, Costin Badica, Mihnea Scafes, Gabriel-George Popa
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

Recently, we have proposed a comprehensive agent-based e-commerce system. While UML formalized, it lacked details how basic functions -- e.g. user request to purchase a given product -- are to be implemented. Furthermore, the "airline ticket reservation model" used in the system involves time management issues that have not been addressed. The aim of the paper is to discuss the way in which the information flow and data transformations involved in it are to be implemented; assuming that information about products is to be ontologically represented. Furthermore, a simple way in which time information can be successfully managed to support the proposed product reservation approach will be discussed.
Service Mosaic: A Model-Driven Framework for Web Services Life-Cycle Management
Authors: Boualem Benatallah, Fabio Casati, Farouk Toumani, Julien Ponge, Hamid Reza Motahari Nezhad
Venue: IEEE Internet Computing (2006)

Although Web services provide abstractions for simplifying integration at lower levels of the interaction stacks, they don't yet help simplify integration at higher abstraction levels such as business-level interaction protocols. Using a model-driven framework for Web services life-cycle management, the authors help facilitate the scalable development and maintenance of service-oriented applications by analyzing and managing Web service business protocols. Instead of using simple black and white measures,they identify different classes of protocol compatibility and replaceability. They implemented this framework in a prototype platform called Service Mosaic.
An O(nh) Algorithm for Dual-Server Coordinated En-Route Caching in Tree Networks
Authors: Shihong Xu, Hong Shen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Dual-server coordinated en-route caching is important because of its basic features as multi-server en-route caching. In this paper, multi-server coordinated en-route caching is formulated as an optimization problem of minimizing total access cost, including transmission cost for all access demands and caching cost of all caches. We first discuss an algorithm for single-server en-route caching in tree networks and then show that this is a special case of another algorithm for dual-server en-route caching in tree networks whose time complexity is O(nh).
The Educational Modeling of a Collaborative Game using MOT+LD
Authors: Gilbert Paquette, Michel Leonard
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Our contribution to the workshop on educational modeling languages is a graphic model of a collaborative game. It is built using the MOT+LD graphic editor developed at our research center.
Understanding Intentions in Social Interaction: The Role of the Anterior Paracingulate Cortex
Authors: Henrik Walter, Mauro Adenzato, Angela Ciaramidaro, Ivan Enrici, Lorenzo Pia, Bruno G. Bara
Venue: Journal of Cognitive Neuroscience (2004)

Neuroimaging studies have identified the anterior paracingulate cortex (PCC) as the key prefrontal region subserving theory of mind. We adopt an evolutionary perspective hypothesizing that, in response to the pressures of social complexity, a mechanism for manipulating information concerning social interaction has emerged in the anterior PCC. To date, neuroimaging studies have not properly distinguished between intentions of persons involved in social interactions and intentions of an isolated person. In two separate fMRI experiments, we demonstrated that the anterior PCC is not necessarily involved in the understanding of other people's intentions per se, but primarily in the understanding of the intentions of people involved in social interaction. Moreover, this brain region showed activation when a represented intention implies social interaction and therefore had not yet actually occurred. This result suggests that the anterior PCC is also involved in our ability to predict future intentional social interaction, based on an isolated agent's behavior. We conclude that distinct areas of the neural system underlying theory of mind are specialized in processing distinct classes of social stimuli.
A Conceptual System Approach for the Relationship between Collaborative Knowledge Management (CKM) and Human Capital Management (HCM).
Authors: David G. IV Vequist, Mark S. Teachout
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

The linkage and integration of Collaborative Knowledge Management (CKM) and Human Capital Management (HCM) systems is becoming increasingly important. Both systems are currently very popular and based on the writing of various authors can lead to increased organizational effectiveness and innovation. The authors of this paper suggest a conceptual systems model to integrate CKM and HCM so an organization could potential share in the strengths of both systems.
Strongly consistent access algorithms for wireless data networks
Authors: Yuguang Fang, Yi-Bing Lin
Venue: Wireless Networks (2005)

In wireless data networks such as the WAP systems, the cached data may be time-sensitive and strong consistency must be maintained (i.e., the data presented to the user at the WAP handset must be the same as that in the origin server). In this paper, we study the cached data access algorithms in such systems. Two caching algorithms are investigated. In Algorithm I, Pull-Each-Read, whenever a data access occurs, the client always asks the server whether the cached entry in the client is valid or not. In Algorithm II, Callback, the server always invalidates the cached entry in the client whenever an update occurs. Analytic models are proposed to evaluate the performance of these algorithms. Our studies show that Algorithm II outperforms Algorithm I if the data access rate is high and the access pattern is irregular. We also design an adaptive mechanism to effectively switch between the two algorithms to take advantages of both algorithms. We also apply the single-level cached data access algorithms for the multi-level cache hierarchy. Our study indicates that with appropriate arrangement, strongly consistent cached data access for wireless Internet (such as WAP) can be efficiently supported.
Exact controllability in neutral delay equations
Authors: D. V. Yakubovich, S. V. V. Lunel
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

A necessary condition for the exact controllability in neutral delay equations of general form is given in terms of uniform lower estimates for the minors of an extended transfer function. Some upper and lower estimates of the time of exact controllability in terms of the maximal delay and the dimensions of the state and control vectors are also obtained.
Piecewise Image Registration in the Presence of Multiple Large Motions
Authors: Pravin Bhat, Ke Colin Zheng, Noah Snavely, Aseem Agarwala, Maneesh Agrawala, Michael F. Cohen, Brian Curless
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a technique for computing a dense pixel correspondence between two images of a scene containing multiple large, rigid motions. We model each motion with either a homography (for planar objects) or a fundamental matrix. The various motions in the scene are first extracted by clustering an initial sparse set of correspondences between feature points; we then perform a multi-label graph cut optimization which assigns each pixel to an independent motion and computes its disparity with respect to that motion. We demonstrate our technique on several example scenes and compare our results with previous approaches.
Haloperidol Impairs Learning and Error-related Negativity in Humans
Authors: Patrick J. Zirnheld
Venue: Journal of Cognitive Neuroscience (2004)

Humans are able to monitor their actions for behavioral conflicts and performance errors. Growing evidence suggests that the error-related negativity (ERN) of the event-related cortical brain potential (ERP) may index the functioning of this response monitoring system and that the ERN may depend on dopaminergic mechanisms. We examined the role of dopamine in ERN and behavioral indices of learning by administering either 3 mg of the dopamine antagonist (DA) haloperidol (n = 17); 25 mg of diphenhydramine (n = 16), which has a similar CNS profile but without DA properties; or placebo (n = 18) in a randomized, double-blind manner to healthy volunteers. Three hours after drug administration, participants performed a go/no-go Continuous Performance Task, the Eriksen Flanker Task, and a learning-dependent Time Estimation Task. Haloperidol significantly attenuated ERN amplitudes recorded during the flanker task, impaired learning of time intervals, and tended to cause more errors of commission, compared to placebo, which did not significantly differ from diphenhydramine. Drugs had no significant effects on the stimulus-locked P1 and N2 ERPs or on behavioral response latencies, but tended to affect post-error reaction time (RT) latencies in opposite ways (haloperidol decreased and diphenhydramine increased RTs). These findings support the hypothesis that the DA system is involved in learning and the generation of the ERN.
A Method of the Rule Acquisition Based on Rough Set
Authors: Guangshun Yao, Xiujiang Lv, Ning Wang, Yan Zhao
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)

Rough sets is a mathematical approach to deal with vague, uncertain and imperfect data and it has many advantages over neural network. The basic concept and operation rule of rough set is presented in this paper. As an example to show the advantages, definitive rules about rectifying column are gotten from original data through Rough Set Theory.
Codes From Generalized Hadamard Matrices
Authors: Xueqin Jiang, MoonHo Lee, Ram Prasad Paudel, TaeChol Shin
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

The Hadamard Matrices are widely used in communication systems, data compression, error control coding, cryptography, linear filtering and spectral analysis. Such a popularity of Hadamard matrices is explained by their simplicity and efficiency in a variety of concrete practical realizations. In this paper we consider a family {H_m}, m =1,2,.., of generalized Hadamard matrices of order p^m , where p is a prime number, and construct the corresponding family {C^*m} of generalized p-ary Hadamard codes which meet the Plotkin bound.
A Lyapunov Function Approach of Maximum Torque Control for Synchronous Reluctance Motor Speed Drive
Authors: Huann-Keng Chiang, Chien-An Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A synchronozrs reluctance motor (SynRM) driven by a Lyapzinov second method is presented in this paper. We derive a control law that control the speed and current of SynRM The speed and current errors are used to form a Lyapunov function. The controller approach compensates the ztncertainties which occur in the control system. However, the uncertainty is dzficcult 20 obtain in practical applications. Therefore, the adaptive law is derived to adapt the value of the uncertainty in real-time. With the proposed controller, the system has a fast response and a good disturbance rejection capability. Simulation results show that the proposed controller is valid for the synchronozcs reluctance motor.
Study of a saccade-incident information display using a saccade detection device
Authors: Hideyuki Ando, Junji Watanabe, Tomohiro Amemiya, Taro Maeda
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In recently proposed saccade-based information displays, the observer cannot see an afterimage without moving the eyes appropriately and therefore often cannot see the afterimage correctly. We propose a new display system based on a concise saccade detection technique and the perceptual features of eye movement. In addition, with a system consisting of a wearable sensor (saccade detector) and a ubiquitous display (saccade-based display), we propose an application where many viewers can be accommodated simultaneously (Several viewers can view an image simultaneously (timesharing) with one saccade-based display.) and independently (Several viewers can view different images with one saccade-based display.). In experiments, we compared character-recognition rates to confirm that the detection of the saccade improves the visibility of the saccade-based display. The results indicate that the recognition rate is clearly improved.
Recovery of Circular Motion Geometry in Spite of Varying Intrinsic Parameters
Authors: Y. Li, Y. S. Hung
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Previous algorithms for recovering 3D geometry from uncalibrated circular motion image sequences of unknown rotation angles are mostly for constant intrinsic parameters. In this paper, a new and simple method for recovering circular motion geometry in spite of varying intrinsic parameters is proposed. It is shown that the movement of the camera forms two concentric circles on the motion plane. By identifying the concentric conic loci in 3D projective frame, the geometry of circular motion can be recovered. Compared with existing rotation angle recovery methods, the new method is (i) more flexible in that it allows the intrinsic parameters to vary from image to image; (ii) simpler by avoiding the calculation of the intersection points of two conics which is notoriously complicated. Experimental results for real images are provided to show the performance of the proposed method.
Performance Analysis of the \varphi Failure Detector with its Tunable Parameters
Authors: Naohiro Hayashibara, Makoto Takizawa
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In this paper, we explain an implementation of an accrual failure detector, that we call the \varphi failure detector. The particularity of the \varphi failure detector is that it dynamically adjusts to current network conditions the scale on which the suspicion level is expressed. We have done the experiment in a LAN in a whole day and evaluated the behavior of our \varphi failure detector. Then we discuss on the parameters of the failure detector based on our experimental result.
CORBA and MPI code coupling
Authors: S. P. Kopysov, I. V. Krasnopyorov, V. N. Rychkov
Venue: Programming and Computing Software (2006)

Coupling of application programs designed for multiprocessor computing systems requires simultaneous use of several paradigms implemented as communication middleware. In this paper, we propose a method of integration of MPI, which is widely used in scientific parallel computations, and CORBA, which is designed for the development of object-oriented applications. This makes it possible to assemble integrated software systems for interdisciplinary computations on heterogeneous multiprocessor systems with the reuse of available application software. An example of inclusion of an MPI linear algebra package into a CORBA-based distributed object-oriented model for solving systems of equations is presented.
EM-based iterative receiver for coded MIMO systems in unknown spatially correlated noise: Research Articles
Authors: Wei Mo, Zhengdao Wang, Aleksandar Dogandžić
Venue: Wireless Communications Mobile Computing (2007)

We present iterative channel estimation and decoding schemes for multi-input multi-output (MIMO) Rayleigh block fading channels in spatially correlated noise. An expectation-maximization (EM) algorithm is utilized to find the maximum likelihood (ML) estimates of the channel and spatial noise covariance matrices, and to compute soft information of coded symbols which is sent to an error-control decoder. The extrinsic information produced by the decoder is then used to refine channel estimation. Several iterations are performed between the above channel estimation and decoding steps. We derive modified Cramer&ndash;Rao Bound (MCRB) for the unknown channel and noise parameters, and show that the proposed EM-based channel estimation scheme achieves the MCRB at medium and high SNRs. For a bit error rate of 10-6 and long frame length, there is negligible performance difference between the proposed scheme and the ideal coherent detector that utilizes the true channel and noise covariance matrices. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Reducibility of gene patterns in ciliates using the breakpoint graph
Authors: Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg
Venue: Theoretical Computer Science (2006)

Gene assembly in ciliates is one of the most involved DNA processings going on in any organism. This process transforms one nucleus (the micronucleus) into another functionally different nucleus (the macronucleus). We continue the development of the theoretical models of gene assembly, and in particular we demonstrate the use of the concept of the breakpoint graph, known from another branch of DNA transformation research. More specifically: (1) we characterize the intermediate gene patterns that can occur during the transformation of a given micronuclear gene pattern to its macronuclear form; (2) we determine the number of applications of the loop recombination operation (the most basic of the three molecular operations that accomplish gene assembly) needed in this transformation; (3) we generalize previous results (and give elegant alternatives for some proofs) concerning characterizations of the micronuclear gene patterns that can be assembled using a specific subset of the three molecular operations.
CommBench-a telecommunications benchmark for network processors
Authors: T. Wolf
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The paper presents a benchmark, CommBench, for use in evaluating and designing telecommunications network processors. The benchmark applications focus on small, computationally intense program kernels typical of the network processor environment. The benchmark is composed of eight programs, four of them oriented towards packet header processing and four oriented towards data stream processing. The benchmark is defined and characteristics such as instruction frequencies, computational complexity, and cache performance are presented. These measured characteristics are compared to the standard SPEC benchmark. Three examples are presented indicating how CommBench can aid in the design of a single chip network multiprocessor.
Toward Semantic Composition of Web Services with MOVE
Authors: Jurgen Dorn, Albert Rainer, Peter Hrastnik
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

This paper describes a software solution for the WSChallenge 2006. We introduce the MOVE framework that has been applied to this challenge. Also, the architecture, algorithms, and software components are discussed. The software reads service descriptions from various sources, matches a request against a service, and composes a complex service from atomic services. The framework is open and different kind of solvers and reasoning tools can be plugged in. We show an example which uses the Answer Set Programming software DLV [1][3] as solver for the composition task.
Collaborative RPD Agents Assisting Decision Making in Active Decision Spaces
Authors: Guruprasad Airy, Po-Chun Chen, Xiaocong Fan, John Yen, David Hall, Michael Brogan, Tim Huynh
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

One of the challenging issues in a distributed time sensitive information rich environment is how to assist the decision makers to make decisions quickly and effectively. This paper describes a decision model that has been developed for such situations and how using the RCAST agent architecture can assist the humans in dealing with the information challenges. The example demonstrates how the system can be used in a military scenario.
Incremental Filtering Algorithms for Precedence and Dependency Constraints
Authors: Roman Bartak, Ondrej Cepek
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Precedence constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the activities -- for example, an activity requires presence of another activity in the plan. For such problems a typical objective is a maximization of the number of activities satisfying the precedence and dependency constraints. In the paper we propose new incremental filtering rules integrating propagation through both precedence and dependency constraints. We also propose a new filtering rule using the information about the requested number of activities in the plan. We demonstrate efficiency of the proposed rules on the logbased reconciliation problems and min-cutset problems.
Enforcing Truthful-Rating Equilibria in Electronic Marketplaces
Authors: Thanasis G. Papaioannou, George D. Stamoulis
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Reputation-based mechanisms and policies are vulnerable to the submission of untruthful ratings. In this paper, we define and analyze a game-theoretic model that captures the dynamics and the rational incentives in a competitive e-marketplace in which providers and clients exchange roles. We also study how we can enforce equilibria where ratings are submitted truthfully. We employ a mechanism prescribing that each service provision is rated by both the provider and the client, while this rating is included in the calculation of reputation only in case of agreement. First, we analyze the case where fixed monetary penalties are induced to both raters in case of disagreement. We prove that, under certain assumptions on the initial conditions, the system is led to a stable equilibrium where all participants report truthfully their ratings. We also investigate the introduction of non-fixed penalties to provide the right incentives for truthful reporting. We derive lower bounds on such penalties that depend on the participant's reputation values. Thus, by employing a punishment that is tailored properly for each participant, this approach can limit the unavoidable social welfare losses due to the penalties for disagreement.