ppxscal/embedding_network huggingface dataset:
Evaluating Information Variation in Informed Agent Negotiation
Authors: Paul Bogg
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Much of the B2B real world commercial activities today require the resolution of multiple issues before a trade is agreed and contract signed. Negotiation is typically the way in which these multi-issue transactions are resolved. For B2B e-commerce, the automation of this negotiation for trade has the potential to revolutionise the way that business is conducted. Intelligent agents have been the focus for developments into automating e-commerce trade negotiation, however, much research is still required before automated negotiation is possible. E-commerce negotiation occurs on the Internet, a dynamic, information rich domain. Information in negotiation is crucial, and a negotiating agent should account for changes in information in its strategy. An intelligent agent framework for negotiation has been developed based on a maximal entropy approach which centers decision making on the certainty of information. We evaluate how the variations in information and certainty affect an agent negotiating in an exemplar negotiation scenario.
Retrospective approximation algorithms for the multidimensional stochastic root-finding problem
Authors: Raghu Pasupathy, Bruce W. Schmeiser
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper presents a family of algorithms to solve the multidimensional (q &ge; 1) SRFP, generalizing Chen and Schmeiser's one-dimensional retrospective approximation (RA) family of algorithms. The fundamental idea used in the algorithms is to generate and solve, with increasing accuracy, a sequence of approximations to the SRFP. We focus on a specific member of the family, called the Bounding RA algorithm, which finds a sequence of polytopes that progressively decrease in size while approaching the solution. The algorithm converges almost surely and exhibits good practical performance with no user tuning of parameters, but no convergence proofs or numerical results are included here.
An Asynchronous PLA with Improved Security Characteristics
Authors: Petros Oikonomakos, Simon Moore
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Programmable logic arrays (PLAs) present an alternative to logic-gate based design. We propose the transistor level structure of a PLA for single-rail asynchronous applications. The geometrically regular layout together with the deployment of dynamic logic help us fine-tune the PLA to enhance its resistance to side-channel attacks, while parity prediction and checking is employed to protect against malicious fault injection. Finally, we demonstrate how our PLAs can be used as building blocks of large-scale systems with good security characteristics, when combined with special return-to-zero asynchronous latches.
Using Language to Drive the Perceptual Grouping of Local Image Features
Authors: Michael Jamieson, Sven Dickinson, Suzanne Stevenson, Sven Wachsmuth
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We address the problem of learning both the semantics (names) and the visual features (SIFT collections) of objects appearing in a training set of unstructured, captioned images of cluttered scenes. Prior work in applying machine translation models to learn the associations between image features and caption nouns has assumed a one-toone correspondence between features and nouns. However, each training image may contain thousands of SIFT features belonging to multiple objects. Our challenge is two-fold: 1) grouping the SIFT features into meaningful collections, and 2) learning the object names associated with those collections. Since better collections tend to have stronger associations with object names, we offer an integrated solution that uses the caption words to drive the feature grouping process. The result is a more general model acquisition framework that does not assume words correspond to individual features and does not require training images with isolated objects or unambiguous labels. The model that is learned performs well at labeling cluttered scenes in a set of test images.
Lattice structure for two-band perfect reconstruction filter banks using Pade approximation
Authors: M. R. K. Khansari, E. Dubois
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We show how the Pade table can be utilized to develop a new lattice structure for general two-channel bi-orthogonal perfect reconstruction (PR) filter banks. This is achieved through characterization of all two-channel bi-orthogonal PR filter banks. The parameter space found using this method is unique for each filter bank. Similarly to any other lattice structure, the PR property is achieved structurally and quantization of the parameters of the lattice does not effect this property. Furthermore, we demonstrate that for a given filter, the set of all complementary filters can be uniquely specified by two parameters, namely the end-to-end delay of the system and a scalar quantity.
The Challenges of Developing a Collaborative Data and Compute Grid for Neurosciences
Authors: John Geddes, Clare Mackay, Sharon Lloyd, Andrew Simpson, David Power, Douglas Russell, Mila Katzarova, Martin Rossor, Nick Fox, Jonathon Fletcher, Derek Hill, Kate McLeish, Joseph V. Hajnal, Stephen Lawrie, Dominic Job, Andrew McIntosh, Joanna Wardlaw, Peter Sandercock, Jeb Palmer, Dave Perry, Rob Procter, Jenny Ure, Philip Bath, Graham Watson
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The three-year UK NeuroGrid project aims to develop a Grid-based collaborative research environment to support the data and compute needs for a UK Neurosciences community. This paper describes the challenges in developing this architecture and details initial results from the development of its first prototype to support psychosis, dementia and stroke research and the social challenges of such a collaborative research project. The paper discusses approaches being taken to explore the collaborative science process to inform the requirements for follow on prototypes and methods utilized to develop an effective project team.
A Knowledge-based Approach for Safety Analysis Using System Interactions
Authors: Tariq Mahmood, Edmund Kazmierczak
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Safety analysis methods for safety-critical systems face new challenges as systems evolve more frequently and the interactions within systems rise in numbers and complexity. Two such challenges are: (1) the need to formally examine the impact of system interactions on safety and (2) the need to extract and readily integrate knowledge from past accidents into new systems. We propose an approach which exploits knowledge from past accidents to conduct quantitative safety analysis using interactions between system components. A case study is presented that shows how our approach provides a support mechanism to safety and design experts. Further, it shows how we identify critical interactions and their contributions to accidents. This is especially important when components have not failed but instead undesirable interactions have contributed to an accident.
Adaptive Wavelet Neural Network Controller for AQM Router in TCP Network
Authors: Jae Man Kim, Jin Bae Park, Yoon Ho Choi
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

This paper presents a wavelet neural network (WNN) controller based on adaptive learning rates (ALRs) method, for active queue management(AQM) in end-to-end TCP network. The AQM is important to regulate the queue length and short round trip time in TCP network. The WNN controller using ALRs adaptively controls the dropping probability of the TCP network. Also the proposed controller is intelligently trained by GD algorithm. The parameters of WNN are tuned by ALRs method. We apply Lyapunov theorem to verify the stability of WNN controller using ALRs. The simulation results show that the performance of WNN controller using ALRs is superior to that of WNN controller using fixed learning rates.
Association schemes from the action of PGL(2, q) fixing a nonsingular conic in PG(2, q)
Authors: Henk D. Hollmann, Qing Xiang
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

The group PGL(2,q) has an embedding into PGL(3,q) such that it acts as the group fixing a nonsingular conic in PG(2,q). This action affords a coherent configuration $${\cal R}$$ (q) on the set $${\cal L}$$ (q) of non-tangent lines of the conic. We show that the relations can be described by using the cross-ratio. Our results imply that the restrictions $${\cal R}$$ +(q) and $${\cal R}$$ ¿(q) of $${\cal R}$$ (q) to the set $${\cal L}$$ +(q) of secant (hyperbolic) lines and to the set $${\cal L}$$ ¿(q) of exterior (elliptic) lines, respectively, are both association schemes; moreover, we show that the elliptic scheme $${\cal R}$$ ¿(q) is pseudocyclic.We further show that the coherent configurations $${\cal R}$$ (q 2) with q even allow certain fusions. These provide a 4-class fusion of the hyperbolic scheme $${\cal R}$$ +(q 2), and 3-class fusions and 2-class fusions (strongly regular graphs) of both schemes $${\cal R}$$ +(q 2) and $${\cal R}$$ ¿(q 2). The fusion results for the hyperbolic case are known, but our approach here as well as our results in the elliptic case are new.
A Comparison of 3D Biometric Modalities
Authors: Damon L. Woodard, Timothy C. Faltemier, Ping Yan, Patrick J. Flynn, Kevin W. Bowyer
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Recently, researchers have focused on the use of threedimensional data as a source of distinguishing features for personal identification. In this paper, the recognition performance of three three-dimensional biometric modalities (face, ear, and finger surface) is compared. In addition, we combine the modalities in an attempt to improve overall recognition performance. The Iterative Closest Point (ICP) algorithm and root mean square (RMS) registration error are used to measure match quality in each case. The experimental results using a dataset of multi-modal biometric samples collected from a group of 85 individuals are presented.
Performance evaluation of protocols for group-oriented mobile services
Authors: Upkar Varshney
Venue: Mobile Networks and Applications (2005)

The emerging mobile services, including m-commerce, have received considerable interest among researchers, developers, service providers, and users. Some of these mobile services require the support for group communications among mobile users for conducting transactions. Therefore, there is a need for protocols that are designed to support transactions for group-oriented mobile services especially under brief dis-connectivity and/or intermittent connectivity. In this paper, we identify the transaction requirements of group-oriented mobile services, present three protocol schemes and several new metrics for transactions, and evaluate the performance of protocol schemes under varying conditions. Our results show that higher levels of transaction completion probabilities and lower levels of transaction delays can be achieved to support the performance requirements of diverse group-oriented mobile services.
Polaris: virus-safe computing for Windows XP
Authors: Marc Stiegler, Alan H. Karp, Ka-Ping Yee, Tyler Close, Mark S. Miller
Venue: Communications of the ACM (2006)

It limits the damage a virus can do by using the operating system's own security mechanisms to enforce the Principle of Least Authority on individual applications.
The Shifted Box Scheme for Scalar Transport Problems
Authors: Bertil Gustafsson, Yaser Khalighi
Venue: Journal of Scientific Computing (2006)

When solving certain scalar transport problems, it is important to use fast methods that do not produce any parasitic oscillating solutions, but still have good energy conservation properties. The well known box scheme has these properties, but the use is restricted by severe conditions on the sign of the coefficients. In order to avoid this restriction, we introduce a modified method, that we call the shifted box scheme. It is very efficient for initial-boundary value problems, since it does not require more work per time step than an explicit scheme, while still being unconditionally stable.
SC2D: an alternative to trace anonymization
Authors: Jeffrey C. Mogul, Martin Arlitt
Venue: Proceedings of the 2006 SIGCOMM workshop on Mining network data (2006)

Progress in networking research depends crucially on applying novel analysis tools to real-world traces of network activity. This often conflicts with privacy and security requirements; many raw network traces include information that should never be revealed to others.The traditional resolution of this dilemma uses trace anonymization to remove secret information from traces, theoretically leaving enough information for research purposes while protecting privacy and security. However, trace anonymization can have both technical and non-technical drawbacks.We propose an alternative to trace-to-trace transformation that operates at a different level of abstraction. Since the ultimate goal is to transform raw traces into research results, we say: cut out the middle step. We propose a model for shipping flexible analysis code to the data, rather than vice versa. Our model aims to support independent, expert, prior review of analysis code. We propose a system design using layered abstraction to provide both ease of use, and ease of verification of privacy and security properties. The system would provide pre-approved modules for common analysis functions. We hope our approach could significantly increase the willingness of trace owners to share their data with researchers. We have loosely prototyped this approach in previously published research.
Functional Brain Imaging of Young, Nondemented, and Demented Older Adults
Authors: Randy L. Buckner, Abraham Z. Snyder, Amy L. Sanders, Marcus E. Raichle, John C. Morris
Venue: Journal of Cognitive Neuroscience (2000)

Brain imaging based on functional MRI (fMRI) provides a powerful tool for characterizing age-related changes in functional anatomy. However, between-population comparisons confront potential differences in measurement properties. The present experiment explores the feasibility of conducting fMRI studies in nondemented and demented older adults by measuring hemodynamic response properties in an event-related design. A paradigm involving repeated presentation of sensory-motor response trials was administered to 41 participants (14 young adults, 14 nondemented older adults, and 13 demented older adults). For half of the trials a single sensory-motor event was presented in isolation and in the other half in pairs. Hemodynamic response characteristics to the isolated events allowed basic response properties (e.g., amplitude and variance) between subject groups to be contrasted. The paired events further allowed the summation properties of the hemodynamic response to be characterized. Robust and qualitatively similar activation maps were produced for all subject groups. Quantitative results showed that for certain regions, such as in the visual cortex, there were marked reductions in the amplitude of the hemodynamic response in older adults. In other regions, such as in the motor cortex, relatively intact response characteristics were observed. These results suggest caution should be exhibited in interpreting simple main effects in response amplitude between subject groups. However, across all regions examined, the summation of the hemodynamic response over trials was highly similar between groups. This latter finding suggests that, even if absolute measurement differences do exist between subject groups, relative activation change should be preserved. Designs that rely on group interactions between task conditions, parametric manipulations, or group interactions between regions should provide valuable data for making inferences about functional-anatomic changes between different populations.
WeSCo_CBR: How to Compose Web Services via Case Based Reasoning
Authors: Soufiene Lajmi, Chirine Ghedira, Khaled v, Djamal Benslimane
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Web services and their compositions are now established as a standard means for interconnecting applications in or between organizations. In this paper, we propose an original approach called WeSCo_CBR (Web Service Composition founded on Case Based Reasoning) that aims at enhancing the process of dynamic web service composition by using case based reasoning technique and Web Service's semantic description.
Reduced complexity spatio-temporal scalable motion compensated wavelet video encoding
Authors: D. S. Turaga, M. van der Schaar
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Motion compensated wavelet (MC-Wavelet) video coding provides high coding efficiency and robustness along with spatio-temporal-SNR-complexity scalability. Such schemes use a multi-resolution motion compensated temporal filtering (MCTF) decomposition along with the spatial wavelet transform to remove video redundancy. These multi-resolution transforms partition the spatio-temporal sequence-volume into regions corresponding to desired spatial and temporal resolutions. In this paper, we present a novel method for reducing the motion estimation complexity in MC wavelet coders by selecting adaptively different spatio-temporal decomposition structures and temporal motion vector prediction schemes. We present results to highlight the reduction in encoder complexity.
Research on Boiler Drum Dynamic Model with Bond Graph
Authors: Xiyun Yang, Yuegang lv, Daping Xu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Drum level parameter in power natural circulation boiler is required to supervise and maintain for safety and efficiency and creating its accurate model to analyze system dynamic behaviors is critical for improving control performance. A power bond graph model of boiler vaporization system is firstly proposed in the paper. Due to complicated energy and mass transferring in boiler circuit vaporization system, a multi-ports C field of bond graph model is established to present control volume model with accumulating hydraulic and thermal energy. Bond graph sub-models with multi-ports C element are built and connected to obtain an integral model of boiler vaporization. The math descriptions for bond graph model of subsystem are also given. The simulation curves show that this bond graph model can effectively describe process characteristic and testify the "shrink and swell" phenomenon in boiler drum under the variable operation condition. This provides a new approach for modeling thermal process.
Oversampled modulated filter banks and tight Gabor frames in l/sup 2/(Z)
Authors: Z. Cvetkovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The subject of this study is paraunitary modulated filter banks. A factorization of the polyphase matrices of these filter banks, which is described, gives complete characterization of tight Gabor frames in l/sup 2/(Z), with arbitrary rational oversampling ratios. Tight Gabor frames, being less constrained than orthogonal bases, allow for filter bank designs with good localization in both time and frequency.
Document Exchange Methodology for Collaborative Work in e-Government
Authors: Flavio Corradini, Alberto Polzonetti, Romeo Pruno, Lucio Forastieri
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In this paper we'll explain a really implementation of collaborative framework solution for document exchange management in the domain of e-Government. Our study of document process management for Public Administration allows an efficient approach towards exchange methodology for collaborative work in e- Government. Our case studies is founded by Marche region and represent an innovative solution for to model, to design and to share electronics document between Public Administrations and citizens. This architecture allows interoperability between different platforms by using a standard interface via Web.
Reducing the Size of If-Then Rules Generated from Data Tables with Graded Attributes
Authors: Radim Belohlavek, Vilem Vychodil
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)

Presented is a method for reducing the size of if-then rules generated from data tables with graded attributes. Data tables with graded attributes represent data structures describing graded properties of objects. We show a method for generating of particular reduced and minimal set of if-then rules which describe all dependencies which are valid in a given data table with graded attributes. We present theoretical insight, algorithms, and illustrative examples.
Freud equations for Legendre polynomials on a circular arc and solution of the Grünbaum-Delsarte-Janssen-Vries problem
Authors: Alphonse P. Magnus
Venue: Journal of Approximation Theory (2006)

One establishes inequalities for the coefficients of orthogonal polynomials Φn(z) = zn + ξnzn-1 +...+ Φn(0), n = 0,1,..., which are orthogonal with respect to a constant weight on the arc of the unit circle S = {eiθ, απ < θ < 2π- απ}, with 0 < α < 1. Recurrence relations (Freud equations), and differential relations are used. Among other results, it is shown that Φn(0) > 0, n = 1, 2,...
A scalable intra-domain resource management architecture for DiffServ networks
Authors: Haci A. Mantar, Ibrahim T. Okumus, Junseok Hwang, Steve J. Chapin
Venue: Journal of High Speed Networks (2006)

With the rapid growth of the Internet into a global communication and commercial infrastructure, the need for Quality of Services (QoS) in the Internet becomes more and more important. With a Bandwidth Broker (BB) support in each administrative domain Differentiated Services (DiffServ) is seen as a key technology for achieving QoS guarantees in a scalable, efficient, and deployable manner in the Internet.This paper presents the design and implementation of a new Bandwidth Broker (BB) model to achieve QoS across a DiffServ domain. Our BB uses centralized network state maintenance and pipe-based intra-domain resource management schemes. The proposed model significantly reduces admission control time and minimizes scalability problems present in prior research while optimizing network resource utilization. The experimental results verify the achievements of our model.
Social Network and Content Analysis of Interactions in a Video-Mediated Virtual Community
Authors: Nancy Poon, Ben K. Daniel
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The purpose of this ongoing research is to develop theoretical models of interactions examining social issues and how they can affect knowledge and information flow in virtual communities. In this paper we employ social network analysis techniques and content analysis to understand interaction patterns in one video-mediated virtual community.