ppxscal/embedding_network huggingface dataset:
Efficient Data Structures for the Orthogonal Range Successor Problem
Authors: Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

This paper considers a type of orthogonal range query, called orthogonal range successor query, which is defined as follows: Let P be a set of n points that lie on an n ×n grid. Then, for any given rectangle R, our target is to report, among all points of P ¿ R, the point which has the smallest y-coordinate. We propose two indexing data structures for P so that online orthogonal range successor queries are supported efficiently. The first one is a succinct index where only O(n) words are allowed for the index space. We show that each query can be answered in O(logn / loglogn) time, thus improving the best-known O(logn) time by Mäkinen and Navarro. The improvement stems from the design of an index with O(1) query time when the points are restricted to lie on a narrow grid, which in turn extends the recent wavelet tree technique to support the desired query. Our second result is a general framework for indexing points in the d-dimensional grids. We show an O(n 1 + ¿ )-space index that supports each d-dimensional query in optimal O(1) time. Our second index is very simple and when d = 2, it is as efficient as the existing index by Crochemore et al.
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Authors: Giorgos Georgiadis, Marina Papatriantafilou
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and inherent fault-tolerance and self-organizing properties. Moreover, there is a relatively large volume of experimental evidence that these methods are efficiency-wise a good alternative to structured methods, which require more sophisticated algorithms for maintenance and fault tolerance. However, currently there is a very limited selection of appropriate tools to use in systematically evaluating performance and other properties of such non-trivial methods.Based on a well-known association between random walks and resistor networks, and building on a recently pointed-out connection with peer-to-peer networks, we tie-in a set of diverse techniques and metrics of both realms in a unifying framework. Furthermore, we present a basic set of tools to facilitate the analysis of overlay properties and the reasoning about algorithms for peer-to-peer networks. One of the key features of this framework is that it enables us to measure and contrast the local and global impact of algorithmic decisions in peer-to-peer networks. We provide example experimental studies that furthermore demonstrate its capabilities in the overlay network context.
How Mobile Interaction Motivates Students in a Class?
Authors: Akinobu Ando, Kazunari Morimoto
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

The purpose of this study is to show a way that students can become more active in the classroom. We tried to use a mobile phone as a teaching and learning tool. A mobile phone is a familiar device to Japanese students. Most of them have one and use it everyday. They write many e-mails, browse web pages, take pictures and make calls. This study showed statistically how the use of mobile phones as a teaching and learning tool affected motivation of students. As the result, we found that students' communication-charge plan did not affect the evaluation of this method. The most effective factors were "The effect on checking attendance" and "Remembering what students learned at the end of lecture". Thus, it is helps a teacher with two things - this method allows better use of lecture time by shortening attendance checking and allowing students to write comments during the lecture on their mobile phones. This saves time, as the teacher doesn't have to use lecture time for feedback. So not only traditional paper and pencil should be regarded as a school tool, but also a mobile phone.
PCA and KPCA for Predicting Membrane Protein Types
Authors: Li-Peng Wang, Zhan-Ting Yuan, Xu-Hui Chen, Zhi-Fang Zhou
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Knowing type of an uncharacterized membrane protein often provides a useful clue in both basic research and drug discovery. With the explosion of protein sequences generated in the post genomic era, determination of membrane proteins types by experimental methods is expensive and time consuming. It therefore becomes important to develop an automated method to find the possible type of membrane protein. In view of this, the DC (Dipeptide Composition) is introduced to represent the protein sample. However, a high dimensional disaster may be caused by using this representation method. Thus, a linear dimensionality reduction algorithm PCA (Principle component analysis) and a nonlinear dimensionality reduction algorithm KPCA (Kernel Principle component analysis) are introduced to extract the indispensable features from the high-dimensional DC space,respectively. Based on the reduced low-dimensional features,K-NN (K-nearest neighbor) classifier is introduced to identify the types of membrane proteins. Finally, experiment results show that using the proposed method to cope with prediction of membrane proteins types are very effective.
Stress Distributions on the Slider with Different Accommodation Coefficients
Authors: Jincai Chen, Gongye Zhou, Wei Sun, Libang Zhang
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Recently the influence of accommodation coefficient, which determines the behaviors of the reflected molecules at the boundary walls, was studied a lot for exploring the flying characteristics of head-disk interface. However, all of the researches are based on the slider with unique accommodation coefficient. In this paper, the different correction models of Reynolds equation, the free molecular gas film lubrication (MGL) equation and direct simulation Monte Carlo (DSMC) method are compared. Stress distributions on the slider with different accommodation coefficients were calculated by using the free molecular MGL equation and DSMC method respectively. The results show that the shear stress is different with the slider with different accommodation coefficients, and hence the shear stress can be controlled by giving the slider proper accommodation coefficients, without influencing the pressure. This provides a theory basis for the design of slider of HDD with high stability.
Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Venue: ACL Workshops (2006)

We are delighted to introduce the proceedings of the 11th Conference on Empirical Methods in Natural Language Processing, organized under the auspices of SIGDAT, the ACL Special Interest Group for linguistic data and corpus-based approaches to NLP. This was a wonderfully fruitful year for EMNLP; we received 234 submissions, drawn from every area of language processing. Of these we were able to accept 73 papers (an acceptance rate of 31%), making for an unusually broad and exciting program. 43 of the papers were presented as talks, and 30 as posters.
Intelligent Photo Management System Enhancing Browsing Experience
Authors: Yuki Orii, Takayuki Nozawa, Toshiyuki Kondo
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

We developed a web-based intelligent photo management system which enables automatic clustering of unstructured personal digital photo collections. We conducted a user study to assess the usability of the developed photo management system (automatic photo classifier, APC) compared with ones with limited functions. The user task adopted here was finding some of target photographs indicated by an experimenter from the subject's personal or somebody else's photo collections. The results show that APC is better in the case of the personal photographs while it does not have a significant advantage for somebody else's photo collections. It was suggested that the look-and-feel of a photo management system should be considered according to whether the photographs had been taken by the user him/herself or not.
Hierarchical Time-Bound Key Management for Mobile Agents
Authors: Yu-Fang Chung, Tzer-Shyong Chen, Chia-Chao Ho, Yi-Hsuan Yeh, Hsiu-Chia Ko
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

The core competencies that a mobile agent possesses are free-roaming between different environment, and autonomous environment detection and adaptation while executing the tasks that are assigned by the users. Because of these competencies, the concept of mobile agent is widely used in many different fields, such as Internet business, wireless communication, and information security technologies and etc. In 1983, Akl and Taylor [1] suggested the concept of superkey to resolve the key management issues faced by the mobile agent. Later in 1998, Volker and Mehrdad [2] proposed a hierarchical mobile agent model for access control. The proposed paper would be based upon the studies of superkey and a hierarchical mobile agent model with addition of elliptic curve cryptosystem (ECC). ECC enhances the mobile agent model, because of shorter key length and higher efficiency on encryption and decryption. All the related works would be presented in Section 2. After the background of our proposal is well described, we would aim to resolve the key management issue created by Volker and Mehrdad's model. Time-bound key management is considered to be a good solution, because it can make the key management in the existing mobile agent model more convenient by distributing the keys that can only be used in a limited period of time.
A logical theory of coordination and joint ability
Authors: Hojjat Ghaderi, Hector Levesque, Yves Lespérance
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

A team of agents is jointly able to achieve a goal if despite any incomplete knowledge they may have about the world or each other, they still know enough to be able to get to a goal state. Unlike in the single-agent case, the mere existence of a working plan is not enough as there may be several incompatible working plans and the agents may not be able to choose a share that coordinates with those of the others. Some formalizations of joint ability ignore this issue of coordination within a coalition. Others, including those based on game theory, deal with coordination, but require a complete specification of what the agents believe. Such a complete specification is often not available. Here we present a new formalization of joint ability based on logical entailment in the situation calculus that avoids both of these pitfalls.
Dynamic Spectrum Allocation in Cognitive Radio: Auction and Equilibrium
Authors: Tan Xuezhi, Liu Yutao, Xu Guisen
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Cognitive radio is an emerging technique to improve the utilization of radio frequency spectrum in wireless communication networks. In this paper, we consider the problem of spectrum sharing among a few primary users and multiple secondary users through auction games. With the second-price auction and VCG auction, we adopt a utility function to obtain the optimal total payoffs the secondary users. User collusion and cooperation behaviors have been discussed by an interference graph. The simulation results show that user collusion usually deteriorate the efficiency of dynamic spectrum allocation and may cause instability of the communication system, while the cooperation among the secondary users can not only enhance the spectrum efficiency but also compensate the primary users through some cooperative mechanisms.
A Video Zero-Watermark Algorithm against RST Attacks
Authors: Guo-juan Xu, Rang-ding Wang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This paper has brought forth a zero-watermark algorithm for video which is based on the Krawtchouk Moment Invariants of original images to counterattack RST attack. Due to the stability of the seven lower Krawtchouk Moment Invariants exhibited in geometrical transformation, the seven moment invariants of the video frames should be calculated first and then construct the watermark sequence with zero-watermarking technology. Throughout this algorithm, no watermarking information is embedded in the images and thus a good imperceptibility can be achieved. During the process of detection, no original video sequence is needed. The experimental results demonstrate that the algorithm is robust against RST attack, cropping attack and other conventional attacks.
Language specific issue and feature exploration in Chinese event extraction
Authors: Zheng Chen, Heng Ji
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

In this paper, we present a Chinese event extraction system. We point out a language specific issue in Chinese trigger labeling, and then commit to discussing the contributions of lexical, syntactic and semantic features applied in trigger labeling and argument labeling. As a result, we achieved competitive performance, specifically, F-measure of 59.9 in trigger labeling and F-measure of 43.8 in argument labeling.
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
Authors: Pietro Gianantonio, Furio Honsell, Marina Lenisa
Venue: Recent Trends in Algebraic Development Techniques: 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers (2009)

We investigate Leifer-Milner RPO approach for CCS and ¿-calculus. The basic category in which we carry out the construction is the category of term contexts. Several issues and problems emerge from this experiment; for them we propose some new solutions.
An ontology-based approach to enhance querying capabilities of general practice medicine for better management of hypertension
Authors: Thusitha Mabotuwana, Jim Warren
Venue: Artificial Intelligence in Medicine (2009)

Background: Hypertension is one of the most prevalent chronic conditions and is directly correlated to deadly risks; yet, despite the availability of effective treatment, there is still clear room for improving patient outcomes. Use of relational databases is widespread for storing patient data, but formulating queries to identify patients whose clinical management can be improved is challenging due to the temporal nature of chronic illness and the mismatch in levels of abstraction between key management concepts and coded clinical data. Objective: The objective of this work is to develop a sharable and extensible analysis tool that can be used to identify hypertensive patients who satisfy any of a set of evidence-based criteria for quality improvement potential. Methods: We developed an ontology driven framework to enhance and facilitate some important temporal querying requirements in general practice medicine, focusing on prescribing for hypertension. The Web Ontology Language has been used to develop the ontology and the specific queries have been written in Semantic Query-enhanced Web Rule Language. We have used production electronic medical record (EMR) data from a General Medical Practice in New Zealand to populate the ontology. Results: A unified patient management ontology consisting of a disease management ontology, a patient data ontology, and a plan violation taxonomy has been created and populated with EMR data. We have queried this ontology to determine patient cohorts that satisfy any of eight quality audit criteria, thereby identifying patients whose clinical management can be improved. A prescription timeline visualisation tool has also been developed to aid a clinician in understanding a patient's antihypertensive prescribing patterns, as well as visually validating the query results. Conclusions: The presented framework shows potential to provide answers to clinically relevant queries with complex temporal relationships. The framework can be used to successfully identify hypertensive patients who need to be followed-up/recalled.
Semiotic Design of a Hypermedia for Cultural Heritage
Authors: Vito Roberto, Elio Toppano
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The paper proposes a semiotic model inspired to the narrative, structural framework by A.J.Greimas, and applied to the design and analysis of a hypermedia. The framework is structured into four levels of signification and allows for a constructive process of semantic aggregation. We follow such a process in order to explore the conceptual organization of the model. We construct a hypermedia regarding a collection of ancient mosaics from a roman villa. Our results indicate that the proposed approach opens novel perspectives, and looks promising towards the definition of semiotic methodologies of hypermedia design.
Stereo Tracking of Faces for Driver Observation
Authors: Markus Steffens, Stephan Kieneke, Dominik Aufderheide, Werner Krybus, Christine Kohring, Danny Morton
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

This report contributes a coherent framework for the robust tracking of facial structures. The framework comprises aspects of structure and motion problems, as there are feature extraction, spatial and temporal matching, re-calibration, tracking, and reconstruction. The scene is acquired through a calibrated stereo sensor. A cue processor extracts invariant features in both views, which are spatially matched by geometric relations. The temporal matching takes place via prediction from the tracking module and a similarity transformation of the features' 2D locations between both views. The head is reconstructed and tracked in 3D. The re-projection of the predicted structure limits the search space of both the cue processor as well as the re-construction procedure. Due to the focused application, the instability of calibration of the stereo sensor is limited to the relative extrinsic parameters that are re-calibrated during the re-construction process. The framework is practically applied and proven. First experimental results will be discussed and further steps of development within the project are presented.
Investigation of Damage Identification of 16Mn Steel Based on Artificial Neural Networks and Data Fusion Techniques in Tensile Test
Authors: Hongwei Wang, Hongyun Luo, Zhiyuan Han, Qunpeng Zhong
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

This paper proposes a damage identification method based on back propagation neural network (BPNN) and dempster-shafer (D-S) evidence theory to analyze the acoustic emission (AE) data of 16Mn steel in tensile test. Firstly, the AE feature parameters of each sensor in 16Mn steel tensile test are extracted. Secondly, BPNNs matching sensor number are trained and tested by the selected features of the AE data, and the initial damage decision is made by each BPNN. Lastly, the outputs of each BPNN are combined by D-S evidence theory to obtain the finally damage identification of 16Mn steel in tensile test. The experimental results show that the damage identification method based on BPNN and D-S evidence theory can improve damage identification accuracy in comparison with BPNN alone and decrease the effect of the environment noise.
High performance motion estimation architecture using efficient adder-compressors
Authors: André Silva, Eduardo Costa, Sergio Almeida, Marcelo Porto, Sergio Bampi
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

This paper presents a high performance architecture for motion estimation (ME) using efficient adder compressors. The architecture is based on the Quarter Sub-sampled Diamond Search algorithm (QSDS) with Dynamic Iteration Control (DIC) algorithm. The main characteristic of the proposed architecture is the large amount of processing units (PUs) that are used to calculate the SAD (Sum of Absolute Differences) metric. The internal structures of the PUs are composed by a large number of addition operations to calculate the SADs. In this paper, efficient 4-2 and 8-2 adder compressors are used in the PUs architecture to achieve a higher performance. These adder compressors enable the simultaneous addition of 4 and 8 operands respectively. The PUs, using adder compressors, were applied to the ME architecture. The implemented architectures were described in VHDL and syntethized with Leonardo Spectrum tool to the TSMC 0.18&mu;m CMOS standard cell technology. Synthesis results indicate that the new QSDS-DIC architectures reach the best performance result and enable gains of 12% in terms of processing rate. The architectures can reach real time for HDTV (1920x1080 pixels) in the worst case processing 65 frames per second, and they can process 269 HDTV frames per second in the average case.
Iterative imputation algorithms for process modeling with incomplete data
Authors: Samuel H. Huang, Ranganath Kothamasu, Niharika Rapur
Venue: Intelligent Data Analysis (2007)

Modeling with real-world data is often plagued with the problem of missing values, limiting the applicability and validity of the developed model. Several algorithms exist in the literature to facilitate the analysis of incomplete data by imputing missing values. However, their imputation accuracy and practical applicability have not been systematically compared and studied. This makes the choice of appropriate imputation method difficult. The focus of this paper is to conduct an exploratory analysis of the popular missing data imputation algorithms. A new imputation algorithm based on clustering is also developed and demonstrated to be useful in a variety of ways to improve the efficiency of imputing missing values. These algorithms are benchmarked using datasets with significantly varying statistical properties. Based on the empirical results and theoretical analysis, a set of guidelines are proposed to assist in the selection of an appropriate imputation algorithm for a specific application. Finally these guidelines are used in a process modeling case study that involves the analysis of the design of an atomizer. It was observed that the imputed values are qualitatively valid thus providing evidence for the appropriateness of the proposed guidelines.
Layer Supported Models of Logic Programs
Authors: Luís Moniz Pereira, Alexandre Miguel Pinto
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Building upon the 2-valued Layered Models semantics for normal programs, we introduce a refinement -- the Layer Supported Models semantics -- which, besides keeping all of LMs' properties, furthermore respects the Well- Founded Model.