ppxscal/embedding_network huggingface dataset:
An Adaptable Anycast Routing Algorithm Based on Density and Proximity
Authors: Xin Xu, Yun-li Gu, Jie Du, Huan-yan Qian
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Most existing anycast routing algorithms are basedon shortest path algorithm. In this paper, an adaptable anycast routing algorithm based on density and proximity is proposed. While determining anycast member, both the proximity factor and nearby anycast members number of the target (density factor) should be considered. Density is calculated on the base of field theory. In comparison with proximity-based algorithm,density-based algorithm is strong in routing robustness, butweak in routing efficiency, so the best performance lies in a tradeoff between proximity and density. In this algorithm, parameter k adjusts the weight of proximity factor and density factor hence influences anycast member selection, therefore thealgorithm is characteristic of adaptable. Simulationexperiments performed in networks of different dynamicdegrees show that by adjusting parameter k, routingrobustness and routing efficiency can be well balanced.
An individual-based evolving predator-prey ecosystem simulation using a fuzzy cognitive map as the behavior model
Authors: Robin Gras, Didier Devaurs, Adrianna Wozniak, Adam Aspinall
Venue: Artificial Life (2009)

We present an individual-based predator-prey model with, for the first time, each agent behavior being modeled by a fuzzy cognitive map (FCM), allowing the evolution of the agent behavior through the epochs of the simulation. The FCM enables the agent to evaluate its environment (e.g., distance to predator or prey, distance to potential breeding partner, distance to food, energy level) and its internal states (e.g., fear, hunger, curiosity), and to choose several possible actions such as evasion, eating, or breeding. The FCM of each individual is unique and is the result of the evolutionary process. The notion of species is also implemented in such a way that species emerge from the evolving population of agents. To our knowledge, our system is the only one that allows the modeling of links between behavior patterns and speciation. The simulation produces a lot of data, including number of individuals, level of energy by individual, choice of action, age of the individuals, and average FCM associated with each species. This study investigates patterns of macroevolutionary processes, such as the emergence of species in a simulated ecosystem, and proposes a general framework for the study of specific ecological problems such as invasive species and species diversity patterns. We present promising results showing coherent behaviors of the whole simulation with the emergence of strong correlation patterns also observed in existing ecosystems.
Virtual Simulation Machining on Spiral Bevel Gear with New Type Spiral Bevel Gear Milling Machine
Authors: Yanwei Xu, Lianhong Zhang, Wei Wei, Leping Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Spiral bevel gear milling machine is one typical representative of complex manufacturing equipments, it is important for the mechanical manufacturing industry to improve the spiral bevel gear milling machine’s manufacturing capacity. One virtual simulation machining model of new type spiral bevel gear milling machine is set up with the simulation machining software, VERICUT, based on machining mechanism of spiral bevel gear and analyses on the structure and kinematic relation of new type spiral bevel gear milling machine, PHOENIX®II CNC spiral bevel gear milling machine. One method to calculate the new type spiral bevel gear milling machine’s motion parameters is also proposed. The virtual simulation machining on one pair of given spiral bevel gears has been carried out with the spiral bevel gear milling machine’s motion parameters calculated by MATLAB, the result of virtual simulation machining indicates that the virtual simulation machining model is reasonable.
Control strategies for parsing with freer word-order languages
Authors: Gerald Penn, Stefan Banjevic, Michael Demko
Venue: Proceedings of the Third Workshop on Constraints and Language Processing (2006)

We provide two different methods for bounding search when parsing with freer word-order languages. Both of these can be thought of as exploiting alternative sources of constraints not commonly used in CFGs, in order to make up for the lack of more rigid word-order and the standard algorithms that use the assumption of rigid word-order implicitly. This work is preliminary in that it has not yet been evaluated on a large-scale grammar/corpus for a freer word-order language.
The Analysis of Multi-dimension Spatial Data Subdivision and Storage
Authors: Li Kang-rong, Miao Fang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

With the development and integration of the technology in observing earth from space, lots of information access of three-dimension geographical space and capability of updating has been developed rapidly. The application of earth science has changed from three-dimension to multi-dimension. Therefore, the processing and storage of multi-dimension spatial data become more and more important. The paper puts forward the conception of spatial data subdivision according to the shape character of earth and a subdivision model has also been offered. In this model, each subdivision unit has been named patch. The granularity of the patch can be designated according to actual data requirement. The smaller of granularity of the subdivision you select, the higher of precision of the patch it will be, and the more precise of the earth information the patch expresses. On the basis of patch subdivision, a new storage strategy of patch data has been put forward. Firstly, the address is the basic unit of patch data storage. The patch is in touch with storage address according to time and space. Secondly, the patch storage emphasizes on dynamic storage. The subdivision patch data will be storedon-line, break-line and off-line. Finally, the storage of patch data is also processed in multilevel and multilayer. The paper provides a new searching method and theory in earth subdivision data processing, but there are many problems are up for perfected and developed in the future.
Entity extraction is a boring solved problem: or is it?
Authors: Marc Vilain, Jennifer Su, Suzi Lubar
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

This paper presents empirical results that contradict the prevailing opinion that entity extraction is a boring solved problem. In particular, we consider data sets that resemble familiar MUC/ACE data, and report surprisingly poor performance for both commercial and research systems. We then give an error analysis that suggests research challenges for entity extraction that are neither boring nor solved.
Medium-Long Term Forecast of the Annual Maximum Peak Discharge at the Xiangjiang River Basin on Fuzzy Method
Authors: Hu Guohua, Yin Xing, Song Hehua
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Precipitation intensity is strong and often lasts for a long time in the Xiangjiang river basin. However, the distribution of time and space is uneven. Moreover, the main stream and tributaries of the Xiangjiang river constitute asymmetric water system on two sides, Which leads the spatial variation of river hydrology and flow gathered fast and downstream flooding. All along, the Xiangjiang river basin has been frequently threatened by floods. The Xiangjiang River is the largest of the Dongting Lake water system and the middle and lower reaches of the Xiangjiang river is China's major grain production bases. So it is a great significance to do mid-to-long-term hydrological forecasting on the Xiangjiang river basin. Because mid-to-long-term hydrological forecasting have a longer period foreseen, people can take early measures to co-ordinate arrangements when solving flood control and fight a drought, water storage and disposal and the contradiction between the various departments. It is very important to hydropower plant production planning, flood prevention and drought control, water resources management and comprehensive utilization. The thesis, based on the mid-to-long-term hydrological phenomena is a typical fuzzy system of the basic thinking, combines cause-and-effect and statistical analysis with fuzzy analysis and chooses predictors such as rainfall and atmospheric circulation in earlier stage which effect the annual maximum peak discharge. Then sets up the fuzzy model of pattern recognition that used to the Xiangtan station of the Xiangjiang river. The high accuracy prediction result shows that models are reasonable and worth popularization and application.
Link layer behavior of body area networks at 2.4 GHz
Authors: Anirudh Natarajan, Buddhika de Silva, Kok-Kiong Yap, Mehul Motani
Venue: Proceedings of the 15th annual international conference on Mobile computing and networking (2009)

Body Area Networks (BANs) can perform the task of continuous, remote monitoring of a patient's physiological signals in diverse environments. Apart from providing healthcare professionals with extensive logs of a patient's physiological history, BANs can be used to identify and react to emergency situations. We identify three important factors that afflict wireless communication in BANs: impermeability of the human body to radio waves at frequencies commonly used in BANs, efficient operation in mobile and time-varying environments, and mission-critical requirements for quick response to emergencies. An understanding of the link layer behavior of wireless sensor nodes placed on the body is crucial to address these and other challenges such as reducing energy consumption and increasing network lifetime. In this paper, we investigate link layer behavior by placing nodes on the body and directly measuring metrics of interest to engineers such as packet delivery ratio (PDR) and RSSI. Emulating a possible real-life BAN operating at the 2.4 GHz band with 12 sensor nodes, we collect over 80 hours of data from 14 volunteers in $3$ different environments that BANs are expected to operate in. We analyze the data to reveal several link layer characteristics to provide insight and guidelines for the designing of BANs. We also evaluate the performance of common routing metrics on our data. Our analysis helps us make the following conclusions. Link PDR is highly affected by the environment and not significantly by the volunteer for the experiment. Routing between nodes on the same side of the body is preferred to routing between nodes on the opposite sides. For links with the same source, failure of packet transmission to a certain node, in some cases, implies the increased probability of reception for other nodes. Most errors occur in bursts of length 1, but a small fraction occur in longer periods ($40$ packets or more).
Conceptions of learning versus conceptions of web-based learning: The differences revealed by college students
Authors: Chin-Chung Tsai
Venue: Computers Education (2009)

Past research has shown the variations of students' conceptions of learning, but little has been especially undertaken to address students' conceptions of web-based learning and to make comparisons between students' conceptions of learning in general and their conceptions of web-based learning in particular. By interviewing 83 Taiwanese college students with some web-based learning experiences, this study attempted to investigate the students' conceptions of learning, conceptions of web-based learning, and the differences between these conceptions. Using the phenomenographic method of analyzing student interview transcripts, several categories of conceptions of learning and of web-based learning were revealed. The analyses of interview results suggested that the conceptions of web-based learning were often more sophisticated than those of learning. For example, much more students conceptualized learning in web-based context as pursuing real understanding and seeing in a new way than those for learning in general. This implies that the implementation of web-based instruction may be a potential avenue for promoting students' conceptions of learning. By gathering questionnaire responses from the students, this study further found that the sophistication of the conceptions toward web-based learning was associated with better searching strategies as well as higher self-efficacy for web-based learning.
Study on the Aging Properties of Polymeric Composites by Using Accelerated Test Method
Authors: Jeong-Pyo Nam, Qingfen Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

When composite structures exposed to severe environmental conditions, the properties of the composites may become very low and may be no longer satisfied to the design requirements as aging time increases. It is therefore very important to investigate the effects of environmental factors on the degradation of the composite properties. In this study, mechanical and thermal analysis properties of glass fabric / phenolic composites are investigated by using a 2.5 KW accelerated environmental aging tester. Degradations for tensile, bending and shear properties are evaluated through a Universal Testing Machine (UTM). Storage shear modulus, loss shear modulus and tan δ are measured as a function of exposure time through a Dynamic Mechanical Analyzer (DMA). Experimental results show that the tensile, bending, and shear strength, the storage shear modulus and glass transition temperature of specimen exposed in severe environmental conditions decreased with increasing exposure time at different aging degree.
Logic-Based Modeling in Systems Biology
Authors: Alexander Bockmayr
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Systems biology is a new interdisciplinary research field that has received considerable attention in recent years. While traditional molecular biology studies the various components of a biological system (e.g. genes, RNAs, proteins) in isolation, systems biology aims to understand how these components interact in order to perform complex biological functions.A variety of mathematical and computational methods is currently being used to model and analyze biological systems, ranging from continuous, stochastic, and discrete to various hybrid approaches.In this talk, we focus on logic-based methods for systems biology, which arise at two distinct levels. On the one hand, Boolean or multi-valued logics provide a natural way to represent the structure of a regulatory biological network, which is given by positive and negative interactions (i.e., activation and inhibition) between its different components. On the other hand, temporal logics (e.g. CTL or LTL) may be used to reason about the dynamics of a biological system, represented by a state transition graph or Kripke model.
Development of 3D Avatars for Professional Education
Authors: Miglena Dontschewa, Andreas Künz, Sabahat Kovanci
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

This article covers avatars as anthropomorphic tutors in learning processes within teaching and learning settings. Starting points and objectives are presented, as well as the requirements for the creation, the environment and the tools. The article focuses on the latter, the media-synergetic problems the different tools pose, and possible solutions to those problems.
Outlier Detection with Explanation Facility
Authors: Manuel Mejía-Lavalle, Atlántida Sánchez Vivar
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

We propose a simple and efficient method to detect exceptional data, which includes a novel end user explanation facility. After various designs, the best was based on an unsupervised learning schema, which uses an adaptation of the artificial neural network paradigm ART for the cluster task. In our method, the cluster that contains the smaller number of instances is considered as outlier data. The method provides an explanation to the end user about why this cluster is exceptional with regard to the data universe. The proposed method has been tested and compared successfully not only with well-known academic data, but also with a real and very large financial database that contains attributes with numerical and categorical values.
Efficient Index for Retrieving Top-k Most Frequent Documents
Authors: Wing-Kai Hon, Rahul Shah, Shih-Bin Wu
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

In the document retrieval problem [9], we are given a collection of documents (strings) of total length D in advance, and our target is to create an index for these documents such that for any subsequent input pattern P, we can identify which documents in the collection contain P. In this paper, we study a natural extension to the above document retrieval problem. We call this top-k frequent document retrieval, where instead of listing all documents containing P, our focus is to identify the top k documents having most occurrences of P. This problem forms a basis for search engine tasks of retrieving documents ranked with TFIDF metric.A related problem was studied by [9] where the emphasis was on retrieving all the documents whose number of occurrences of the pattern P exceeds some frequency threshold f. However, from the information retrieval point of view, it is hard for a user to specify such a threshold value f and have a sense of how many documents will be outputted. We develop some additional building blocks which help the user overcome this limitation. These are used to derive an efficient index for top-k frequent document retrieval problem, answering queries in O(P + logD loglogD + k) time and taking O(DlogD) space. Our approach is based on novel use of the suffix tree called induced generalized suffix tree (IGST).
A Mechanism of Predicting Network Simulation Performance Based on BP Nets
Authors: Jiahua Yu, Xiangzhan Yu, Gang Wu, LiPing Liu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Performance analysis is a key issue in parallel network simulation. This paper proposes a new mechanism of parallel network simulation performance prediction. Analyzing the key factors of impacting parallel simulation performance, six parameters which may determine the time-cost of network simulation is presented. Then we adopt the Back Propagation (BP) network to approximate to the non-linear relation between time-cost and these parameters. So we can carry out a very good prediction to the new network simulation missions with BP nets. This mechanism also does not require configuring all the workstation with same kind of hardware/software environment.
Disambiguation of preposition sense using linguistically motivated features
Authors: Stephen Tratz, Dirk Hovy
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium (2009)

In this paper, we present a supervised classification approach for disambiguation of preposition senses. We use the SemEval 2007 Preposition Sense Disambiguation datasets to evaluate our system and compare its results to those of the systems participating in the workshop. We derived linguistically motivated features from both sides of the preposition. Instead of restricting these to a fixed window size, we utilized the phrase structure. Testing with five different classifiers, we can report an increased accuracy that outperforms the best system in the SemEval task.
OntoDesk: Ontology-Based Persistent System-Wide Undo on the Desktop
Authors: David Nemeskey, Buntarou Shizuki, Jiro Tanaka
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Recovery is an important aspect of user experience. However, current desktop environments lack a system-wide undo facility. OntoDesk is an ontology-based experimental desktop system that offers this feature. Ontology is used to model the semantic relationships between parts of the system. OntoDesk assembles a global action history of application use. With this information, it provides undo/redo for any part of the system, including applications without native recovery. The framework allows developers to add advanced features to their applications, and it allows users to explore the system with confidence, knowing that their actions will be reversible.
Soft state in the XSiena publish/subscribe system
Authors: Zbigniew Jerzak, Christof Fetzer, Robert Wójcicki
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

This paper presents our experiences with building of the soft state XSiena publish/subscribe system. We provide a brief overview of our approach towards the soft state in publish/subscribe systems along with the detailed discussion of the liveness and safety issues as well as the choice of the API and handling of the unsubscription and unadvertisement messages.
Optimal resilient sorting and searching in the presence of memory faults
Authors: Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
Venue: Theoretical Computer Science (2009)

We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number of memory faults. In particular, we design an O(nlogn) time sorting algorithm that can optimally tolerate up to O(nlogn) memory faults. In the special case of integer sorting, we present an algorithm with linear expected running time that can tolerate O(n) faults. We also present a randomized searching algorithm that can optimally tolerate up to O(logn) memory faults in O(logn) expected time, and an almost optimal deterministic searching algorithm that can tolerate O((logn)^1^-^@e) faults, for any small positive constant @e, in O(logn) worst-case time. All these results improve over previous bounds.
An Immune-Genetic Algorithm-Based Scheduling Optimization in a Networked Control System
Authors: Xiang-feng Zhang, Zhi-jie Wang, Zhao-xia Liang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Network performance relies on the design of control algorithm and network information scheduling in a networked control system (NCS). The effect of the network scheduling is to allocate rationally network resources and improve network utilization. A scheduling approach is presented to implement the scheduling of a set of periodic tasks in this paper. And an immune-genetic algorithm (IGA) is proposed to realize the network scheduling optimization. We take the transmission error of control systems as an object function. The simulation results show that the approach can optimize the scheduling of NCS and improve the network resource utilization.
Annotating attributions and private states
Authors: Theresa Wilson, Janyce Wiebe
Venue: Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky (2005)

This paper describes extensions to a corpus annotation scheme for the manual annotation of attributions, as well as opinions, emotions, sentiments, speculations, evaluations and other private states in language. It discusses the scheme with respect to the "Pie in the Sky" Check List of Desirable Semantic Information for Annotation. We believe that the scheme is a good foundation for adding private state annotations to other layers of semantic meaning.