ppxscal/embedding_network huggingface dataset:
Informed Recommender Agent: Utilizing Consumer Product Reviews through Text Mining
Authors: Silvana Aciar, Debbie Zhang, Simeon Simoff, John Debenham
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Consumer reviews, opinions and shared experiences in the use of a product form a powerful source of information about consumer preferences that can be used for making recommendations. A novel framework, which utilizes this valuable information sources first time to create recommendations in recommender agents was recently developed by the authors [1]. In this recommender agent, the most critical issue is how to convert the review comments into ontology instances that can be understood and utilized by computers. This problem was not addressed in our previous work. This paper presents an automatic mapping process using text mining techniques. The ontology contains a controlled vocabulary and their relationships. The attributes of the ontology are learnt from the semantic features in the review comments using supervised learning techniques. The proposed approach is demonstrated using a case study of digital camera reviews.
Guest Editors' Introduction: Exploring Geovisualization
Authors: Theresa-Marie Rhyne, Alan MacEachren, Jason Dykes
Venue: IEEE Computer Graphics and Applications (2006)

The guest editors introduce this special issue on exploring geovisualization. The articles focus on methods, processes, and collaborations involved with visualizing geographic information and geospatial data.
Asymmetry of Neuronal Activity During Extracellular Microelectrode Recording from Left and Right Human Temporal Lobe Neocortex During Rhyming and Line-Matching
Authors: Theodore H. Schwartz, Michael M. Haglund, Ettore Lettich, George A. Ojemann
Venue: Journal of Cognitive Neuroscience (2000)

Recordings of neuronal activity in humans have identified few correlates of the known hemispheric asymmetries of functional lateralization. Here, we examine single-unit activity recorded from both hemispheres during two delayed match-to-sample tasks that show strong hemispheric lateralization based on lesion effects; a line-matching (LM) task related to the right hemisphere, and a rhyming (RHY) task related to the left. Nineteen neuronal populations were recorded with extracellular microelectrodes from the left temporal neocortex of 11 awake patients, and 18 from the right in 9 patients during anterior temporal lobectomy for complex partial seizures under local anesthesia. All subjects were left hemisphere dominant for language. Twelve (32&percnt;) populations exhibited statistically significant changes in activity at p < .05. Although changes in firing frequency were recorded from both hemispheres during both tasks, the RHY task elicited changes in activity several hundred milliseconds earlier on the left side than on the right. The LM task, on the other hand, induced changes earlier on the right side than on the left. Both hemispheres contained units active during verbal responses regardless of which behavior elicited the response. Our results indicate that cerebral dominance is reflected in earlier neuronal activity in the anterior temporal lobe during tasks lateralized to that hemisphere.
Implementing SNOBOL 4 for the 8086 micro-computer family
Authors: Mark B. Emmer
Venue: ACM SIGSMALL Newsletter (1984)

A commercial product called SNOBOL4+ for the 8086/8088 computer family is described. It implements the entire SNOBOL4 language, and shows reasonable execution speed. Sample programs in the standard SNOBOL4 language reference text which were run on an IBM 360 model 65 execute approximately 10 times slower on an 8088 equipped IBM PC (3.5 times slower on a PC AT).The internal construction of the SNOBOL4 interpreter has been well described elsewhere (Griswold, Ralph E., The Macro Implementation of SNOBOL4. San Francisco: W. H. Freeman and Co., 1972, 310 pages). This note explains some of the design decisions made for this specific implementation. It is hoped that lessons learned the proverbial "hard way" may benefit others when implementing large systems for the 8086/8088. The "lessons" reflect the author's personal bias and experience. Some are conjectural, others resulted from doing things over the "right" way. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Image reconstruction and correction methods in neutron and X-ray tomography
Authors: Zoltán Kiss, Lajos Rodek, Attila Kuba
Venue: Acta Cybernetica (2006)

Neutron and X-ray tomography are imaging techniques for getting information about the interior of objects in a non-destructive way. They reconstruct cross-sections from projection images of the object being investigated. Due to the properties of the image acquisition system, the projection images are distorted by several artifacts, and these reduce the quality of the reconstruction. In order to eliminate these harmful effects the projection images should be corrected before reconstruction. Taking projections is usually an expensive and time consuming procedure. One of our main goals has been to try to minimize the number of projections - for example, by exploiting more a priori information. A possible way of reducing the number of projections is by the application of discrete tomographic methods. In this case a special class of objects can be reconstructed, consisting of only a few homogenous materials that can be characterized by known discrete absorption values. To this end we have implemented two reconstruction methods. One is able to reconstruct objects consisting of cylinders and spheres made of homogeneous materials only. The other method is a general one in the sense that it can be used for reconstructing any shape. Simulations on phantoms and physical measurements were carried out and the results are presented here.
Analytical bounds on least squares and total least squares methods for the linear prediction problem
Authors: R. D. Fierro, K. Yao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The least squares (LS) and total least squares (TLS) methods are commonly used to solve the linear prediction equations in frequency estimation problems. The authors examine how the noise, increasing the number of equations, or augmenting the system may reduce the sensitivity of the noise subspace, and thus provide improved estimation of the polynomial coefficients. Specifically, they provide an analytical lower and new upper bound for the difference between the LS and TLS solutions, which explains their similarities/differences in a high/low SNR environment. Numerical simulation results show that the bounds are sharp. The analysis is intimately linked to the concept of the subspace angle in perturbation theory for the orthogonal projection methods.
A neural network model of Parkinson's disease bradykinesia
Authors: Vassilis Cutsuridis, Stavros Perantonis
Venue: Neural Networks (2006)

Parkinson's disease (PD) is caused by dopamine (DA) depletion consequent to cell degeneration in the substantia nigra pars compacta (SNc) and the ventral tegmental area (VTA). Although computational analyses of PD have focused on DA depletion in DA-recipient parts of the basal ganglia, there is also extensive DAergic innervation of the frontal and parietal cortex as well as the spinal cord. To understand PD bradykinesia, a comprehensive network model is needed to study how patterns of DA depletion at key cellular sites in the basal ganglia, cortex and spinal cord contribute to disordered neuronal and spinal cord activity and other PD symptoms. We extend a basal ganglia-cortico-spinal circuit for control of voluntary arm movements by incorporating DAergic innervation of cells in the cortical and spinal components of the circuit. The resultant model simulates successfully several of the main reported effects of DA depletion on neuronal, electromyographic (EMG), and movement parameters of PD bradykinesia.
An Efficient Adaptive Grouping for Single Code Assignment in WCDMA Mobile Networks
Authors: Ren-Hung Hwang, Ben-Jye Chang, Min-Xiou Chen, Kun-Chan Tsai
Venue: Wireless Personal Communications: An International Journal (2006)

For achieving high utilization and efficient code management of the OVSF code tree in 3G WCDMA networks, several researches have extensively studied. Based on combining both the code assignment and the reassignment mechanisms, it increases obviously high utilization and reduces completely the code blocking. Nevertheless, the required rate of traffic should be powers of two of the basic rate, i.e. 1R, 2R, 4R, ¿, etc., which is impractical and results in wasting the system bandwidth while the required rate is not powers of two of the basic rate. Several multi-code assignment mechanisms have proposed to reduce the waste rate. Nevertheless, these methods bring two inevitable drawbacks including, high complexity of handling multiple codes, and increasing the cost of using more rake combiners at both the base stations and mobile nodes. Therefore, we propose an adaptive grouping code assignment herein to provide a single channelization code for any possible rate of traffic, even though the required rate is not powers of two of the basic rate. Based on the dynamic programming algorithm, the adaptive grouping approach forms several calls into a group. Then it allocates a subtree to the group and adaptively shares the subtree codes for these calls in the concept of time-sharing of slots during a group cycle time. Therefore, the waste rate and code blocking are thus reduced obviously while using a single rake combiner. Since the delay problem may be occurred in such a time-sharing approach, we propose two schemes of cycle interleaving methods to reduce delay. Numerical results indicate that the proposed adaptive grouping approach reduces significantly the waste rate and thus increases the system utilization. Moreover, the proposed cycle interleaving scheme reduces data delay significantly.
Content-Based Clustered P2P Search Model Depending on Set Distance
Authors: Jing Wang, Shoubao Yang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The main issues that affect query efficiency and search cost in content-based unstructured P2P search system are the complexity of computing the similarity of the documents brought by high dimensions and the great deal of redundant messages coming with flooding. This paper defines the documents similarity by the way of set distance. This method restrains the complexity of computing the document similarity in linear time. Also, this paper clusters the peers based on content by their set distance to reduce the query time and redundant messages. Simulations show that the content-based search model constructed by set distance not only has higher recall, but also reduce the search cost and query time to the rate of 40% and 30% of Gnutella.
An Evolutionary-simplex-algorithm-based QoS Multicast Routing Algorithm in NGI
Authors: Xingwei Wang, Guangyong An, Min Huang
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

In this paper, a QoS multicast routing algorithm in IP/DWDM optical Internet is proposed. Given a user request, a bandwidth, delay, delay jitter and error rate bounded and cost optimized QoS multicast routing tree is constructed based on the evolutionary-simplexalgorithm, taking network load balancing into account. Simulation results have shown that it is not only feasible and effective but also advantageous over its counterpart based on the traditional genetic algorithm.
Adding Self-Healing Capabilities into Legacy Object Oriented Application
Authors: M. Muztaba Fuad, Debzani Deb, Michael J. Oudshoorn
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Adding self healing functionalities into legacy applications without user involvement is immensely useful for users and programmers of such systems. This paper presents a technique of injecting user code with self-healing primitives by statically analyzing the legacy object oriented code and instrumenting it to become a self-manageable and self-healing component. Our experiments show that it is worthwhile to instrument legacy code to provide such autonomic behavior.
Illuminating the Path of Video Visualization in the Shadow of Video Processing
Authors: Min Chen, John Robinson, Deborah Silver
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Video visualization is a newly emerged technology drawing the concepts and methodologies from volume and flow visualization, image and video processing, and vision science. It extracts meaningful information from a video data set and conveys the extracted information to users in appropriate visual representations. It is not intended to provide fully automatic solutions to the traditional problems in video processing, but aims at offering an approach that involves human in the loop of intelligent reasoning while removing the burden of viewing videos. In this paper, we examine the technical scope of this new technology and relate it to the technical advances in video processing. In particular, we highlight the areas where video visualization can offer more generic solutions with minimal effort for adjusting scene-specific parameters and hard-coding application-speci fic logic, as well as areas where video visualization can benefit from a large collection of theories and algorithms which have already been developed for video processing. We also briefly discuss the potential applicability of advances in video processing to the broader spectrum of time-varying data visualization.
Deploying a personalized time management agent
Authors: Pauline Berry, Bart Peintner, Ken Conley, Melinda Gervasio, Tomás Uribe, Neil Yorke-Smith
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We report on our ongoing practical experience in designing, implementing, and deploying PTIME, a personalized agent for time management and meeting scheduling in an open, multi-agent environment. In developing PTIME as part of a larger assistive agent called CALO, we have faced numerous challenges, including usability, multi-agent coordination, scalable constraint reasoning, robust execution, and unobtrusive learning. Our research advances basic solutions to the fundamental problems; however, integrating PTIME into a deployed system has raised other important issues for the successful adoption of new technology. As a personal assistant, PTIME must integrate easily into a user's real environment, support her normal workflow, respect her authority and privacy, provide natural user interfaces, and handle the issues that arise with deploying such a system in an open environment.
Performance Model Interchange Format: Semantic Validation
Authors: Daniel Garcia, Catalina M. Llado, Connie U. Smith, Ramon Puigjaner
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

A Performance Model Interchange Format (PMIF) provides a mechanism whereby system model information may be transferred among queueing network model (QNM) based modeling tools. The PMIF allows diverse tools to exchange information and requires only that those tools provide importing/exporting mechanisms from/to the PMIF. The XML specification of the PMIF allows implementers to use widely available tools to parse the XML file, check the syntax, and simplify the translation to/from the XML format. Those tools, however, do not know the semantics of a QNM so they cannot check the XML to ensure that it contains a valid QNM. This paper presents the study of the validations needed to carry out such a semantic analysis, and the development of a semantic validation tool that can be used by any developer who wants to implement PMIF import/export mechanisms.
Error Pattern Analysis of Augmented Array Codes Using a Visual Debugging Tool
Authors: Lami Kaya, Mohammad Al-Qudah
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)

Error analysis is very important in determining the error control capabilities of any code. Traditionally these are measured by analyzing BER performance. We have designed and implemented a visual debugging tool (VDT) for tracing trellis decoding process of a class of augmented array codes. We have implemented a user-friendly interface in utilizing the VDT for introducing errors at the specifically selected positions of the array. Also certain error patterns can be added to all possible array positions in sequence. The observation of the effect of these purposely inserted errors is facilitated by VDT interface. The VDT can be effectively employed to measure error detection and/or correction power of the Viterbi decoder. The tool allows users to trace decoding process step-by-step, so it can be utilized for teaching and research activities of code design and their practical applications.
AI's 10 to Watch
Authors: David L. Waltz
Venue: IEEE Intelligent Systems (2006)

The recipients of the IEEE Intelligent Systems 10 to Watch award--Eyal Amir, ReginaBarzilay, Jennifer Golbeck, Tom Griffiths, Steve Gustafson, Carsten Lutz, Pragnesh Jay Modi, MartaSabou, and Richard A. Watson--discuss their current research and their visions of AI for the future. This article is part of a special issue on the Future of AI.
Visual Selective Behavior Can Be Triggered by a Feed-Forward Process
Authors: Rufin Vanrullen, Christof Koch
Venue: Journal of Cognitive Neuroscience (2003)

The ventral visual pathway implements object recognition and categorization in a hierarchy of processing areas with neuronal selectivities of increasing complexity. The presence of massive feedback connections within this hierarchy raises the possibility that normal visual processing relies on the use of computational loops. It is not known, however, whether object recognition can be performed at all without such loops (i.e., in a purely feed-forward mode). By analyzing the time course of reaction times in a masked natural scene categorization paradigm, we show that the human visual system can generate selective motor responses based on a single feed-forward pass. We confirm these results using a more constrained letter discrimination task, in which the rapid succession of a target and mask is actually perceived as a distractor. We show that a masked stimulus presented for only 26 msec - and often not consciously perceived - can fully determine the earliest selective motor responses: The neural representations of the stimulus and mask are thus kept separated during a short period corresponding to the feed-forward "sweep." Therefore, feedback loops do not appear to be "mandatory" for visual processing. Rather, we found that such loops allow the masked stimulus to reverberate in the visual system and affect behavior for nearly 150 msec after the feed-forward sweep.
Generalization of the reassignment method to all bilinear time-frequency and time-scale representations
Authors: F. Auger, P. Flandrin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Reassigning each value of a time-frequency representation to a different location in the plane can produce a better localization of the signal components. This idea, pioneered by Kodera et al. (1976, 1978), was only applied to the sole spectrogram. We present a new formulation of this method which allows a generalization of its use for any bilinear time-frequency or time-scale representation. The resulting reassigned distributions are easily computable versatile tools which highlight the signal features and preserve many theoretical properties.
Efficient and Accurate Software Pattern Detection
Authors: Niklas Pettersson, Welf Lowe
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Pattern detection is part of many solutions to software engineering problems. Unfortunately, it is a hard problem in itself in both theory and practice. Both exact and approximative approaches have been used earlier to increase efficiency. We propose a novel method to improve the performance of pattern detection, which is in many cases both exact and efficient. It is based on the idea of filtering information from the program representation (graphs), which is unnecessary for detecting a particular pattern. This makes the remaining program representation graph planar, in many cases, thus allowing for linear pattern detection. We evaluate our approach experimentally: we detect six design patterns in six software systems. Filtering leads to planar program representation graphs in 14 out of 36 cases. For most of the remaining graphs, filtering makes the graphs almost planar and gives a significant reduction of the graph size, which speeds up existing heuristics.
A new multi-view regression approach with an application to customer wallet estimation
Authors: Srujana Merugu, Saharon Rosset, Claudia Perlich
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wallet) by modeling it as a "central link" in a directed graphical model, connecting multiple sets of observed variables. The resulting conditional independence allows us to reduce the maximum discriminative likelihood estimation problem to a convex optimization problem for exponential linear models. We show that under certain modeling assumptions, in particular, when there exist two conditionally independent views and the noise is Gaussian, this problem can be reduced to a single least squares regression. Thus, for this specific, but widely applicable setting, the "unsupervised" multi-view problem can be solved via a simple supervised learning approach. This reduction also allows us to test the statistical independence assumptions underlying the graphical model and perform variable selection. We demonstrate the effectiveness of our approach on our motivating problem of customer wallet estimation and on simulation data.