ppxscal/embedding_network huggingface dataset:
An Electrophysiological Study of the Effects of Orthographic Neighborhood Size on Printed Word Perception
Authors: Phillip J. Holcomb, Jonathan Grainger, Tim O'rourke
Venue: Journal of Cognitive Neuroscience (2002)

In two experiments participants read words and pseudowords that belonged to either large or small lexical neighborhoods while event-related brain potentials (ERPs) were recorded from their scalps. In Experiment 1, participants made speeded lexical decisions to all items, while in Experiment 2 they engaged in a go/no-go semantic categorization task in which the critical items did not require an overt behavioral response. In both experiments, words and pseudowords produced a consistent pattern of ERP effects: items with many lexical neighbors (large neighborhoods) generated larger N400s than similar items with relatively fewer lexical neighbors (small neighborhoods). Reaction time (RT, Experiment 1), on the other hand, showed a different pattern consistent with previous behavioral studies. While words tended to produce a facilitation in RT for larger neighborhoods, pseudowords produced an inhibition effect. The findings are discussed in terms of recent theories of word recognition and the functional significance of the N400.
Task-Role-Based Access Control in Application on MIS
Authors: Li Zhang, Lili Luo, Liyong Zhang, Tiesuo Geng, Zongge Yue
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Access control is an important measure to ensure the security of the management information system in enterprise environment. Taking the characteristics of Task-Role-Based Access Control (TRBAC) and the requirement of practical application into consideration, the paper introduces TRBAC which is suitable for enterprise environment into the design of MIS. Task is classified to support both passive and active access control and permission assignment is also analyzed according to task and task instance, and then the complexity of permission management is reduced. At the same time, responsibility separation is introduced to increase the security and performance of the system. Finally, an application instance of TRBAC in MIS is given to show the superiority of TRBAC in MIS.
Coeno: enhancing face-to-face collaboration
Authors: M. Haller, M. Billinghurst, J. Leithinger, D. Leitner, T. Seifried
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

Augmented Surface Environments are becoming more and more popular and will change the mode of communication. Previous work has shown that projector based AR technology can be used to enhance face-to-face collaboration. We have implemented various interaction metaphors that have been integrated in an augmented tabletop setup. We describe our system in detail and present user feedback from people who have used the application. We also provide general design guidelines that could be useful for others who are developing similar face-to-face collaborative AR applications.
Mesh modification using deformation gradients
Authors: Jovan Popovic
Venue:  (2006)

Computer-generated character animation, where human or anthropomorphic characters are animated to tell a story, holds tremendous potential to enrich education, human communication, perception, and entertainment. However, current animation procedures rely on a time consuming and difficult process that requires both artistic talent and technical expertise. Despite the tremendous amount of artistry, skill, and time dedicated to the animation process, there are few techniques to help with reuse. Although individual aspects of animation are well explored, there is little work that extends beyond the boundaries of any one area. As a consequence, the same procedure must be followed for each new character without the opportunity to generalize or reuse technical components. This dissertation describes techniques that ease the animation process by offering opportunities for reuse and a more intuitive animation formulation. A differential specification of arbitrary deformation provides a general representation for adapting deformation to different shapes, computing semantic correspondence between two shapes, and extrapolating natural deformation from a finite set of example shapes. Deformation transfer adds a general-purpose reuse mechanism to the animation pipeline by transferring any deformation of a source triangle mesh onto a different target mesh. The transfer system uses a correspondence algorithm to build a discrete many-to-many mapping between source and target triangles that permits transfer between meshes of different topology. Results demonstrate retargeting both kinematic poses and non-rigid deformations, as well as transfer between characters of different topological and anatomical structure. Mesh-based inverse kinematics extends the idea of traditional skeleton-based inverse kinematics to meshes by allowing the user to pose a mesh via direct manipulation. The user indicates the class of meaningful deformations by supplying examples that can be created automatically with deformation transfer, sculpted, scanned, or produced by any other means. This technique is distinguished from traditional animation methods since the expensive character setup stage is avoided. It is distinguished from existing mesh editing algorithms since the user retains the freedom to specify the class of meaningful deformations. Results demonstrate an intuitive interface for posing meshes that requires only a small amount of user effort. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Exploiting Proxy-Based Transcoding to Increase the User Quality of Experience in Networked Applications
Authors: Maarten Wijnants, Patrick Monsieurs, Peter Quax, Wim Lamotte
Venue: Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)

In this work we describe how we extended the functionality of our previously introduced application and network aware proxy system with transcoding capabilities. Based on their compound awareness, our proxies devise a strategy for every connected client that intelligently distributes the client's available bandwidth over the different application data streams. The proxies subsequently put each computed bandwidth allocation strategy into effect by managing and transcoding data streams inside the network before they reach the client. We also present results from the integration of our work into an existing Networked Virtual Environment. These results clearly indicate that our intelligent proxy, enhanced with its novel transcoding functionality, can increase the user Quality of Experience considerably in networked applications.
Feature Selection Using a Hybrid Associative Classifier with Masking Techniques
Authors: M. Aldape-Perez, C. Yanez-Marquez, L. O. Lopez Leyva
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Performance in most pattern classifiers is improved when redundant or irrelevant features are removed, however, this is mainly achieved by successive classifiers construction. In this paper hybrid classification and masking techniques are presented as a new feature selection approach. The algorithm uses a hybrid classifier to provide a mask that identifies the optimal subset of features without having to compute a new classifier at each step. This method allows us to identify irrelevant or redundant features for classification purposes. Our results suggest that this method is shown to be a feasible way to identify optimal subset of features.
A constraint optimization framework for fractured robot teams
Authors: Mary Koes, Katia Sycara, Illah Nourbakhsh
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for modeling breakdowns in communication. We present a hybrid approach that employs distributed coordination mechanisms to provide robustness to these communication breakdowns and exploits opportunistic centralization. By modeling the problem as a mixed integer linear programming problem, we are able to apply constraint optimization techniques to efficiently find optimal or near optimal solutions to the difficult class of time critical tight coordination team planning problems. We then demonstrate that explicitly reasoning about communication failures through the incorporation of selective disruption minimization can improve team performance.
Harmonic distortion analysis software combining EMTP and Monte Carlo method
Authors: Luis Daniel Bellomo, Guy Olivier
Venue: Mathematics and Computers in Simulation (2006)

Usually, harmonic load flow studies are based on deterministic solutions. Very often, the measured distortion levels are less severe than those predicted by the models but often show the presence of noncharacteristic harmonics that do not exit in simulation results. This is due to the fact that the harmonic generation is a stochastic process. It is particularly true in the case of loads made of a multitude of small nonlinear loads such as computer power supplies. The minute differences between the individual loads must be taken into account. An auxiliary module was added to the well-known ATP/EMTP software to randomly vary several simulation parameters. Using Monte Carlo iterative process much more realistic distortion levels are obtained.
Projective Synchronization in Chaotic Dynamical Networks
Authors: Jie Liu, Jun an Lu, Qiang Tang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, by considering an example of coupled Lorenz chaotic systems, we demonstrate how stable Projective Synchronization (Pj-Syn) phenomenon depends on the linearly and mutually coupling strength among response nodes in typical dynamical networks. Some sufficient criteria for judging the occurrence of stable Pj-Syn are given based on Lyapunov function method. Numerical experiments further verified the rightness of the theoretical analysis results. The basic idea can be applied in further investigation on Pj-Syn phenomenon in general dynamical networks with more complex topology.
Replacement of Image Patches with Rugged Soft Boundary Using Texture Synthesis
Authors: Kedar Shrestha, Li Qian, Wang Shuozhong
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

An image inpainting technique is proposed to improve quality of photographs taken under poor weather conditions. Pale and gloomy sky is first replaced with more pleasant looking blue sky and white clouds. Transition regions near complicated boundaries are modified using a texture synthesis method that makes the sky and ground objects grow towards each other along normal directions obtained from the general trend of the boundary. This produces retouched pictures with a natural appearance.
MPEG-4 rate control algorithm using Laplace parameter estimation
Authors: Cheng-Yu Pai, W. E. Lynch
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A new MPEG-4 rate control algorithm is proposed to calculate the quantization parameter for given target bit rate. The rate-distortion method models the AC DCT coefficients as Laplacian random variables. Derived from the MPEG-4 variable-length code/run-length code (VLC/ RLC) table, the new model accurately predicts the rates and the distortions of an intra frame for all range of quantization parameters. When compared with the Q2 rate-control algorithm, the proposed algorithm offers better or similar PSNR under lower bit budgets. It also features faster initialization and adaptation to sequence property changes, and meets the target bit rate more accurately than the Q2 algorithm.
Working Set Selection Using Second Order Information for Training Support Vector Machines
Authors: Rong-En Fan, Pai-Hsuen Chen, Chih-Jen Lin
Venue: The Journal of Machine Learning Research (2005)

Working set selection is an important step in decomposition methods for training support vector machines (SVMs). This paper develops a new technique for working set selection in SMO-type decomposition methods. It uses second order information to achieve fast convergence. Theoretical properties such as linear convergence are established. Experiments demonstrate that the proposed method is faster than existing selection methods using first order information.
ProBoPortable: A Cellular Phone Software to Promote Emergent Division of Labor
Authors: Toshio Mochizuki, Kazaru Yaegashi, Yusuke Nagamori, Hiroshi Kato, Toshihisa Nishimori
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

This paper deals with a design of a cellular phone software, called "ProBoPortable, which displays an awareness of task status and division of labor in Project-based Learning (PBL). According to the situated learning theory, learners learn not only the cultural practice but also the "legitimate learning strategy," which refers to the way in which learners can learn effectively in the community using their meta cognition. Based on this concept, learners are expected to monitor the actual status of their achievement by themselves, and reorganize their division of labors ad-lib in order to improve their learning in PBL. The authors developed a cellular phone software which cooperates with a Web-based groupware in order to enhance learners' reorganization of their learning activity from the viewpoint of the division of labor in their PBL. ProBoPortable is expected to enhance the awareness of the status of learners' collaboration in PBL.
A Self-Tuning Algorithm for Managing Reconfigurable Cache
Authors: Manman Peng, Yuming Wang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Reconfigurable cache with a set of adjustable configurations can be configured dynamically to adapt itself to the change in program characteristics and has tremendous benefits for performance and energy. However, how to dynamically manage reconfigurable cache is still a cumbersome task left for designers. We introduce a self-tuning algorithm (ETCA), which can dynamically manage reconfigurable cache on a per-phase basis. In contrast with previous works, ETCA seeks not only to lower cache's energy consumption effectively, but also reduce the performance loss due to unnecessary reconfigurations. By simulating numerous MiBench benchmark, the results show that ETCA, when applied to reconfigurable cache, saves on average 38% of total memory access energy compared with a conventional cache and the associated performance loss is close to 1.8%.
AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery
Authors: Hong Cheng, Philip S. Yu, Jiawei Han
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Recent studies have proposed methods to discover approximate frequent itemsets in the presence of random noise. By relaxing the rigid requirement of exact frequent pattern mining, some interesting patterns, which would previously be fragmented by exact pattern mining methods due to the random noise or measurement error, are successfully recovered. Unfortunately, a large number of "uninteresting" candidates are explored as well during the mining process, as a result of the relaxed pattern mining methodology. This severely slows down the mining process. Even worse, it is hard for an end user to distinguish the recovered interesting patterns from these uninteresting ones. In this paper, we propose an efficient algorithm AC-Close to recover the approximate closed itemsets from "core patterns". By focusing on the so-called core patterns, integrated with a top-down mining and several effective pruning strategies, the algorithm narrows down the search space to those potentially interesting ones. Experimental results show that AC-Close substantially outperforms the previously proposed method in terms of efficiency, while delivers a similar set of interesting recovered patterns.
Optimal On-Line Scheduling of Multiple Control Tasks: A Case Study
Authors: Anton Cervin, Peter Alriksson
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy that is optimal in the sense that it minimizes a quadratic performance criterion for the overall system. The optimal scheduling decision at each point in time is a function of the states of the controlled plants. To be able to solve the scheduling problem for realistic examples, we use the technique of relaxed dynamic programming to compute suboptimal solutions with error bounds. The approach is compared to earlier approaches in a case study involving simultaneous control of one ball-and-beam process and two DC-servo processes. We also show how the scheduling policy can be modified to allow for background tasks to execute when the need for control is small.
Selected tacit knowledge observations within two organisations
Authors: Peter Busch, Debbie Richards, C. N. G. 'Kit' Dampney, John Galloway
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

Given that tacit knowledge is necessary to firstly understand the codified knowledge, and secondly that the tacit element often comprises the majority of our knowledge assets, it is time to turn attention toward this phenomenon. Our approach makes use of expert versus novice comparisons as a means of interpreting the likelihood of an individual possessing tacit knowledge. In addition to descriptive statistics as a means of interpreting results, we choose to incorporate formal concept analysis to provide an alternative visualisation of questionnaire responses. Our incorporation of social network analysis maps the flows or likely non-flows between individuals within the IS domain. We present here the initial results from two small organizations, which we refer to as organization Y and Z.
A Cognitive Model for Visual Attention and Its Application
Authors: Tibor Bosse, Peter-Paul van Maanen, Jan Treur
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

In this paper a cognitive model for visual attention is introduced. The cognitive model is part of the design of a software agent that supports a naval warfare officer in its task to compile a tactical picture of the situation in the field. An executable formal specification of the cognitive model is given and a case study is described in which the model is used to simulate a human subject's attention. The foundation of the model is based on formal specification of representation relations for attentional states, specifying their intended meaning. The model has been automatically verified against these relations.
Eye Location under Various Illumination Conditions
Authors: Geng Du, Fei Su, Anni Cai
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Eye location is an important step in face recognition. Locate eyes under various illumination conditions is also an important step especially for most of illumination normalization algorithms. In this paper, an algorithm uses a group of EigenFeature templates and Gabor feature templates to locate eye under various illumination conditions is proposed. Experiment results show that the performance of this algorithm is good and robust under widely changed illumination conditions.
Extraction of signals buried in noise: part I: fundamentals
Authors: Nourédine Yahya Bey
Venue: Signal Processing (2006)

In the first part of this series, we derive conditions under which the periodogram power spectral estimate can be used without any sort of averaging or smoothing in the time or frequency domain for extraction of buried signals independently of the nature of noise (white or colored, Gaussian or not) and locations of its spectral extent superimposed to them. Two denoising methods called, respectively "modified frequency extent denoising (MFED)" and "constant frequency extent denoising (CFED)" are proposed. It is shown that signal-to-noise ratio of buried signals and standard-deviation of noisy spectral estimates are, respectively, enhanced and reduced by the same proportion. In the second part of this series, extraction performances and comparative results with other denoising techniques (modified periodogram method, wavelet denoising and bispectrum estimation) are demonstrated via simulated and experimental Doppler velocimetry processes.
Java Object Behavior Modeling and Visualization
Authors: Ji Wu, Xiao-xia Jia, Yong-po Liu, Guo-huan Li
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Java developers need to know what a specific object did during a program run. Object behavior visualization can fulfill this requirement. This paper presents a novel object behavior model, a Lifetime Behavior Model (LBM) and visualization methods to provide deductive and inductive visualizations of Java object behavior. For the deductive visualization, this paper visualizes the object behavior by three different LBMTrees from thread, object interaction and method invocation view respectively. For the inductive visualization, this paper presents an Activity Spectrum Model (ASM) and a set of performance measurements based on the LBM. The visualization prototype is developed to access object behavior events by JVMPI, construct the models and visualize the models. Experiment shows that the results proposed here can provide comprehensive and clear understanding of Java object behaviors.
XQuery full-text extensions explained
Authors: S. Amer-Yahia, C. Botev, J. Dörre, J. Shanmugasundaram
Venue: IBM Systems Journal (2006)

There has been recent interest in developing XML query languages, such as XPath and XQuery, to tap the vast amount of information represented and stored in Extensible Markup Language (XML). These query languages, however, have focused mainly on querying the structure of XML documents and provide only rudimentary support for querying text content. To fill this void, XQuery Full-Text has been developed as a full-text extension to XQuery (and also XPath, which is a subset of XQuery). Consequently, XQuery Full-Text can be used to seamlessly query over both the structure and the text content of XML documents. This paper explains the design principles behind XQuery Full-Text, describes its evolution, and illustrates its core features with examples. It is intended as a reference that is shorter and more accessible than the current World Wide Web Consortium working draft.
A robust sequential detection algorithm for cardiac arrhythmia classification
Authors: P. M. Clarkson, Szi-Wen Chen, Qi Fan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We describe a modified sequential probability ratio test (SPRT) for the discrimination of ventricular fibrillation (VF) from ventricular tachycardia (VT) in measured surface electrocardiograms. The algorithm uses a novel regularity measure dubbed blanking variability (BV) applied to threshold crossings from the measured ECG. Blanking variability corresponds to the normalized rate of change of cardiac rate as the blanking interval is varied. The algorithm has been trained and tested using separate subsets drawn from the MIT-BIH malignant arrhythmia database. BV values are modeled using a truncated Gaussian distribution, and parameter values are derived by averaging over the training component of the database. In testing, the algorithm achieved an overall classification accuracy of 95%.