ppxscal/embedding_network huggingface dataset:
CMieux: adaptive strategies for competitive supply chain trading
Authors: Michael Benisch, Alberto Sardinha, James Andrews, Norman Sadeh
Venue: ACM SIGecom Exchanges (2006)

Existing supply chain management practices consist primarily of static interactions between established partners. Global competition, shorter product life cycles and the emergence of Internet-mediated business solutions create an incentive for exploring more dynamic supply chain practices. The Supply Chain Trading Agent Competition (TAC SCM) was designed to explore approaches to dynamic supply chain trading. TAC SCM pits against one another trading agents developed by teams from around the world. This paper presents Carnegie Mellon University's 2005 TAC SCM entry, the CMieux supply chain trading agent. CMieux implements a novel approach to coordinating supply chain bidding, procurement and planning, with an emphasis on the ability to rapidly adapt to changing market conditions. We present empirical results based on 200 games involving agents entered by 25 different teams during what can be seen as the most competitive phase of the 2005 tournament. Not only did CMieux perform among the top five agents, it significantly outperformed these agents in procurement while matching their bidding performance.
On-line professionals
Authors: S. Matthews
Venue: Ethics and Information Technology (2006)

Psychotherapy and counselling services are now available on-line, and expanding rapidly. Yet there appears almost no ethical analysis of this on-line mode of delivery of such professional services. In this paper I present such an analysis by considering the limitations on-line contact imposes on the nature of the professional---client relationship. The analysis proceeds via the contrast between the face-to-face case and the on-line case. At the core of the problem must be the recognition that on-line interaction imposes a physical barrier largely permitting only those disclosures of self we choose to make available, and greatly restricting the range of involuntary features and behaviours. I show why this is problematic, first, for the development of a close professional---client relationship, with particular emphasis on such failures as diagnosis and monitoring of the patient. Second I describe the importance of the development of professional character, and of how the on-line environment fails to provide a context for such character traits to emerge and develop.
A coherent approach to non-integer order derivatives
Authors: Manuel Duarte Ortigueira
Venue: Signal Processing (2006)

The relation showing that the Grünwald-Letnikov and generalised Cauchy derivatives are equal is presented. This establishes a bridge between two different formulations and simultaneously between the classic integer order derivatives and the fractional ones. Starting from the generalised Cauchy derivative formula, new relations are obtained, namely a regularised version that makes the concept of pseudo-function appear naturally without the need for a rejection of any infinite part. From the regularised derivative, new formulations are deduced and specialised first for the real functions and afterwards for functions with Laplace transforms obtaining the definitions proposed by Liouville. With these tools suitable definitions of fractional linear systems are obtained.
Further Dissociating the Processes Involved in Recognition Memory: An fMRI Study
Authors: Richard N. A. Henson, Michael Hornberger, Michael D. Rugg
Venue: Journal of Cognitive Neuroscience (2005)

Based on an event-related potential study by Rugg et al. [Dissociation of the neural correlates of implicit and explicit memory. Nature, 392, 595&ndash;598, 1998], we attempted to isolate the hemodynamic correlates of recollection, familiarity, and implicit memory within a single verbal recognition memory task using event-related fMRI. Words were randomly cued for either deep or shallow processing, and then intermixed with new words for yes/no recognition. The number of studied words was such that, whereas most were recognized ("hits"), an appreciable number of shallow-studied words were not ("misses"). Comparison of deep hits versus shallow hits at test revealed activations in regions including the left inferior parietal gyrus. Comparison of shallow hits versus shallow misses revealed activations in regions including the bilateral intraparietal sulci, the left posterior middle frontal gyrus, and the left frontopolar cortex. Comparison of hits versus correct rejections revealed a relative deactivation in an anterior left medial-temporal region (most likely the perirhinal cortex). Comparison of shallow misses versus correct rejections did not reveal response decreases in any regions expected on the basis of previous imaging studies of priming. Given these and previous data, we associate the left inferior parietal activation with recollection, the left anterior medial-temporal deactivation with familiarity, and the intraparietal and prefrontal responses with target detection. The absence of differences between shallow misses and correct rejections means that the hemodynamic correlates of implicit memory remain unclear.
Compiling for stream processing
Authors: Abhishek Das, William J. Dally, Peter Mattson
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

This paper describes a compiler for stream programs that efficiently schedules computational kernels and stream memory operations, and allocates on-chip storage. Our compiler uses information about the program structure and estimates of kernel and memory operation execution times to overlap kernel execution with memory transfers, maximizing performance, and to optimize use of scarce on-chip memory, significantly reducing external memory bandwidth. Our compiler applies optimizations such as strip-mining, loop unrolling, and software pipelining, at the level of kernels and stream memory operations. We evaluate the performance of our compiler on a suite of media and scientific benchmarks. Our results show that compiler management of on-chip storage reduces external memory bandwidth by 35% to 93% and reduces execution time by 23% to 72% compared to cachelike LRU management of the same storage. We show that strip-mining stream applications enables producer-consumer locality to be captured in on-chip storage reducing external bandwidth by 50% to 80%. We also evaluate the sensitivity of performance to the scheduling methods used and to critical resources. Overall, our compiler is able to overlap memory operations and manage local storage so that 78% to 96% of program execution time is spent in running computational kernels.
Occlusion in mirror-based co-located augmented reality systems
Authors: Jurriaan D. Mulder
Venue: Presence: Teleoperators and Virtual Environments (2006)

This paper describes the incorporation of realistic occlusion effects into mirror-based, stereoscopic co-location augmented reality display systems. By adding a light-blocking device in the form of an LCD panel undemeath the semitransparent mirror, the view of the physical world can be selectively blocked out such that virtual objects can fully occlude physical objects. Furthermore, by discarding pixels of the virtual objects rendered on the reflected display, physical objects seen through the semitransparent mirror and the transmissive LCD panel appear to occlude these virtual objects. The governing principles of the approach are described, and two algorithmic approaches (model based and vision based) for scene reconstruction and the generation of the occlusion masks are presented. Finally, a prototype implementation of the system is presented.
Performance of Various Cost Functions in the Search for Strong S-Boxes
Authors: Anirban Chakraborty, Arnab Chatterjee, S. K. Basu
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

We present the results of our search to find the performance of the various spectrum based cost functions and the effect of varying its parameter in the design of strong S-Boxes. It is conjectured that good S-Boxes can be obtained, if the search is made with the parameters R /ge 3.5 and X /le 2n/2 and a more consistent performance can be expected if we use non-linearity spread as the annealing function.
2-D phase retrieval by partitioning into coupled 1-D problems using discrete Radon transforms
Authors: Hyunduk Ahn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The discrete phase retrieval problem is to reconstruct a discrete-time signal whose support is known and compact from the magnitude of its discrete Fourier transform. We solve the 2-D discrete phase retrieval problem by partitioning it into a mostly-decoupled set of 1-D phase retrieval problems. The discrete and modulated Radon transforms are used to formulate two coupled 1-D problems, the solution to which then specifies solutions to the other decoupled 1-D problems. The latter may in turn be solved in parallel; however, using the solution to one problem as the input to a neighboring problem reduces the computation significantly for serial computers. Unlike other exact 2-D phase retrieval methods which rely on tracking zero curves of algebraic functions or equivalent operations, no continuous-function-based methods are used here. This makes the procedure more robust numerically.
On the efficiency and performance evaluation of the bandwidth clustering scheme for adaptive and reliable resource allocation
Authors: Constandinos X. Mavromoustakis, Helen D. Karatza
Venue: Journal of Systems and Software (2006)

A variety of disciplines have recently advocated the use of self-adaptive and auto-configuration methods, including biodynamics, cybernetics and computer modeling. Of these methods, one which exhibits numerous powerful features that are desirable in communication systems is adaptive swarm based intelligence. Swarm-based self-configuration does not require the need of external help, supervision or control. The stochastic nature of random events adversely affects the complexity of optimization tasks. This work proposes a bandwidth clustering scheme suited for this network resource allocation problem. Bandwidth clustering is used in a swarm-based active network environment where active packets continuously communicate with active nodes by using the Split Agent Routing Technique (SART). This mechanism enables the adaptation of the system to new conditions (bandwidth reservation/capacity allocation), as well as the passing of additional information to neighboring nodes in which the information is held in transmitted packets. Paths are clustered with respect to different levels of bandwidth in order to enable capacity allocation and bandwidth reservation on demand, for any requested traffic. The performance, reliability and adaptivity degree of the proposed scheme is thoroughly examined for different traffic measures, as well as the corresponding QoS offered (in terms of the end-to-end delay, available bandwidth and probability of packet loss). This scheme offers a decentralized and non-path-oriented way to efficiently increase the overall network utilization, enabling an equal share of network resources at the same time.
QMatch - A Hybrid Match Algorithm for XML Schemas
Authors: Kajal T. Claypool, Vaishali Hegde, Naiyana Tansalarak
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing popularity of the XML model and the proliferation of XML documents on-line, automated matching of XML documents and databases has become a critical problem. In this paper, we present a hybrid schema match algorithm - QMatch - that provides a unique framework for combining existing structural and linguistic algorithms while exploiting additional information inherent in XML documents such as the order of XML elements to provide improved levels of matching between two given XML Schemas. QMatch is based on an extension of our previous work on QoM, a Quality of Match metric that measures the "goodness" of a match of two UML-based schemas. We now extend the QoM taxonomy to encapsulate the richness of information captured in XML Schemas and provide a qualitative and quantitative analysis of the information capacity of XML Schemas. QoM provides not only a means of tuning existing schema match algorithms to output at desired levels of matching but also provides an effective basis for a new schema match algorithm. In this paper we show via a set of experiments the benefits of QMatch over using individual structural and linguistic algorithms for schema matching, and provide an empirical measure of the accuracy of QMatch in terms of the true positives discovered by the algorithm.
Intelligence Analysis Modeling
Authors: Ahmet Koltuksuz, Selma Tekir
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Intelligence is the process of supporting the policymakers in making their decisions by providing them with the specific information they need. Intelligence analysis is the effort of extracting the nature of intelligence issue with the policy goal in mind. It is performed by intelligence analysts who form judgments that add value to the collected material. With the increased open source collection capabilities, there has emerged a need for a model of intelligence analysis that covers the basic elements of valuable information: relevancy, accuracy, and timeliness. There exist models such as vector space model of information retrieval which only addresses the relevancy aspect of information and cannot cope with nonlinear document spaces. In this paper, we discuss the requirements of an integrated model of intelligence analysis along with its peculiar characteristics.
An Efficient Attestation for Trustworthiness of Computing Platform
Authors: Xiao-Yong Li, Chang-Xiang Shen, Xiao-Dong Zuo
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Remote attestation is a focus research in Trusted Computing. There are some attestation approaches suggested such as configuration based or property based attestation, but these suggestions have a few fatal deficiencies to overcome, e.g., leakage of platform configuration privacy or hard to define trustworthiness related properties, etc.. To solve these problems, this paper presents a system behavior based attestation model which try to determine the trust state of attesting platform from its system trustworthiness related behaviors. The new attestation model has advantages of privacy protection and high feasibility. In addition, system behavior based attestation can also be used to effectively constrain impacts caused by malicious code such as Trojan and virus which are common in today's organization business systems.
Human-agent service matching using natural language queries: system test and training
Authors: W. Pasman, J. Lindenberg
Venue: Personal and Ubiquitous Computing (2006)

Smart environments, ambient intelligence and intelligent agents leave the user lost between large amounts of services. Ad-hoc networks, mobile agents and mobile devices make the set of available services dynamic over time and space, increasing the user&#x2019;s problems to find the service he needs. Earlier, we presented a ServiceMatcher that can find the agent best fitting to the user&#x2019;s natural language request. This paper presents performance results of the ServiceMatcher. The test queries come from human users in a realistic scenario (see our other paper in this issue). With a short training of the agent vocabularies, over 80% correct service matches are found.
Grammaticality Judgment in Aphasia: Deficits Are Not Specific to Syntactic Structures, Aphasic Syndromes, or Lesion Sites
Authors: Stephen M. Wilson, Ayşe Pınar Saygın
Venue: Journal of Cognitive Neuroscience (2004)

We examined the abilities of aphasic patients to make grammaticality judgments on English sentences instantiating a variety of syntactic structures. Previous studies employing this metalinguistic task have suggested that aphasic patients typically perform better on grammaticality judgment tasks than they do on sentence comprehension tasks, a finding that has informed the current view that grammatical knowledge is relatively preserved in agrammatic aphasia. However, not all syntactic structures are judged equally accurately, and several researchers have attempted to provide explanatory principles to predict which structures will pose problems to agrammatic patients. One such proposal is Grodzinsky and Finkel's (1998) claim that agrammatic aphasics are selectively impaired in their ability to process structures involving traces of maximal projections. In this study, we tested this claim by presenting patients with sentences with or without such traces, but also varying the level of difficulty of both kinds of structures, assessed with reference to the performance of age-matched and young controls. We found no evidence that agrammatic aphasics, or any other subgroup, are selectively impaired on structures involving traces: Some judgments involving traces were made quite accurately, whereas other judgments not involving traces were made very poorly. Subgroup analyses revealed that patient groups and age-matched controls had remarkably similar profiles of performance across sentence types, regardless of whether the patients were grouped based on Western Aphasia Battery classification, an independent screening test for agrammatic comprehension, or lesion site. This implies that the pattern of performance across sentence types does not result from any particular component of the grammar, or any particular brain region, being selectively compromised. Lesion analysis revealed that posterior temporal areas were more reliably implicated in poor grammaticality judgment performance than anterior areas, but poor performance was also observed with some anterior lesions, suggesting that areas important for syntactic processing are distributed throughout the left peri-sylvian region.
Pathological Electroencephalographic Signals Classification by Using Multi-Resolution Analysis and Neural Network
Authors: Fabio J. Parreira, Keiji Yamanaka, J. B. Destro-Filho, Angela A. de Sa
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

In this study is proposed a method based in multiresolution analysis in frequencies strip provided by discreet wavelet transform (DWT), characterizing epileptic discharges of absence crisis and also noises, both analyzed into distinct frequencies strip. The methodology uses the DWT, integrated to the auto-regressive (AR) model and backpropagation network (MLP) to compose the classificator. First, the multi-resolution analysis technique (DWT) and the AR are applied to extract the time-frequency distribution characteristics from the signal in different levels. The neural network MLT with the specialist system, classify the characteristics extracts to identify the kind of disturbance occurred in EEG. In this proposal, occurs a significant reduction of the number features extracts from the signal, without losing its original proprieties. The global performance of the proposal method shows consistent results.
Off-Line Signature Recognition and Verification by Kernel Principal Component Self-Regression
Authors: Bai-ling Zhang
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Automatic signature verification is an active area of research with numerous applications such as bank check verification, ATM access, etc. In this research, a Kernel Principal Component Self-regression (KPCSR) model is proposed for off-line signature verification and recognition problems. Developed from the Kernel Principal Component Regression (KPCR), the self-regression model selects a subset of the principal components from the kernel space for the input variables to accurately characterize each user's signature, thus offering good verification and recognition performance. The model directly works on bitmap images in the preliminary experiments, showing satisfactory performance. A modular scheme with subject-specific KPCSR structure proves very efficient, from which each user is assigned an independent KPCSR model for coding the corresponding visual information. Experimental results obtained on public benchmarking signature database demonstrates the superiority of the proposed method.
A Graph Theoretic Framework for Trust - From Local to Global
Authors: Paul Sant, Carsten Maple
Venue: Proceedings of the conference on Information Visualization (2006)

Traditional approaches to trust, be it in agent-based societies, or within a more theoretical framework often consider trust to be a local phenomenon. Here we propose that trust should be viewed from a global perspective. Our motivation is the area of pervasive computing although we believe that our formal framework applies in many domains. Here we present our framework and formalise it in the form of Graph Theory. We present some open problems and discuss the wider application of our work.
The application of simulation methodology in a hospital's six sigma project
Authors: Martin J. Miller, David M. Ferrin
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simulation was recently utilized as the key component of a Six Sigma project at a major hospital in the southeastern United States. The project team used various statistical analysis tools to assess current process performance and measure improvements with process changes. However, simulation provided the best insight into which process changes had the best opportunity to succeed and which would yield little value. This paper briefly discusses the methodology of this project and how simulation provided a better quality solution.
Decision tree module within decision support simulation system
Authors: Mohamed Moussa, Janaka Y. Ruwanpura, George Jergeas
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. This paper introduces a successful application of a Special Purpose Simulation (SPS) program in developing a Decision Tree module that is part of a unified Decision Support System (DSS) template. The DSS template consists of three modules: Decision Tree (DT), shortest and longest path Dynamic Programming (DP) Network, and Cost / Time (CT) Estimate network. The DT module integrates with other modules and allows users to model decision trees with variables that are based on probabilistic random numbers. This paper introduces the DSS-DT module and shows its advantages.