ppxscal/embedding_network huggingface dataset:
Feasibility of Using Composite Ground Source Heat Pump in Hot Summer and Cold Winter Region
Authors: Wang Jinggang, Liu Jie, Kang Ligai
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Using assistant cooling composite ground source heat pump system can reduce the initial investment and enhance the efficient of energy-savings. This paper introduces the climate and the overview of building energy consumption of hot summer and cold winter region; also analyses the feasibility of ground source heat pump system using assistant cooling equipment in this region. Taking a building in Shanghai for example, compares the initial investment and operating cost between assistant cooling composite ground source heat pump system and no assistant cooling ground source heat pump system. The results show that the assistant cooling-source heat pump system has great advantages in the reduction of initial investment and operating cost in this region.
Joint TOA and DOA Estimation of IR-UWB System Based on Matrix Pencil
Authors: Rui Ding, Zhihong Qian, Xue Wang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

This paper presents a method to estimate time and direction of arrival (TOA and DOA) of Impulse Radio Ultra Wideband (IR-UWB) system based on Matrix Pencil (MP) in a multipath communication channel. It is used to recover time and angle from the channel frequency response. This algorithm only requires a single channel estimate and can estimate TOA and DOA easier and faster. The results show that TOA and DOA can ben estimated precisely by the proposed method. It is efficient and simple way to estimate TOA and DOA for IR-UWB system.
Classifying Web Pages by Using Knowledge Bases for Entity Retrieval
Authors: Yusuke Kiritani, Qiang Ma, Masatoshi Yoshikawa
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

In this paper, we propose a novel method to classify Web pages by using knowledge bases for entity search, which is a kind of typical Web search for information related to a person, location or organization. First, we map a Web page to entities according to the similarities between the page and the entities. Various methods for computing such similarity are applied. For example, we can compute the similarity between a given page and a Wikipedia article describing a certain entity. The frequency of an entity appearing in the page is another factor used in computing the similarity. Second, we construct a directed acyclic graph, named PEC graph, based on the relations among Web pages, entities, and categories, by referring to YAGO, a knowledge base built on Wikipedia and WordNet. Finally, by analyzing the PEC graph, we classify Web pages into categories. The results of some preliminary experiments validate the methods proposed in this paper.
Cortical mechanisms of normal and abnormal processing in the visual system, Part 1: Spatial vision, amblyopia, hyperacuity, modal assumptions: A review
Authors: F. Fankhauser, S. Kwasniewska
Venue: Technology and Health Care (2009)

Vernier thresholds rise much more rapidly in the periphery than do grating thresholds. A similar dissociation between acuity and hyperacuity has been shown to be present in strabismic but not in anisometropic amblyopia, thus leading to the suggestion that the strabismic fovea is similar to the normal periphery. Here it is shown that a quantitative model for spatial pattern discrimination, which accounts for foveal hyperacuity data, can be extended to encompass both the periphery and amblyopia if appropriate alterations are made. For the periphery it is necessary to increase the size of model receptive fields and to introduce both spatial undersampling and position irregularity (i.e. irregularity in the location of cortical filters). The strabismic fovea also requires spatial undersampling and position irregularity but no change in receptive field size. Defects in the good eye of strabismus can be explained by spatial irregularity. Finally, the anisometropic fovea requires a reduction in mechanism sensitivity but neither spatial untersampling nor position irregularity.
Virtual Communities Adapted to the EHEA in an Enterprise Distance e-Learning Based Environment
Authors: Rafael Pastor, Timothy Read, Salvador Ros, Roberto Hernandez, Rocael Hernández
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This paper describes the e-learning architecture of the National Spanish Distance Learning University of Spain (UNED). The UNED has more than 200,000 users of e-learning systems (most of them, students) so it needed an enterprise architecture in order to ensure the performance of the virtual campus. The core of virtual campus is aLF (active learning framework) supported by dotLRN/OpenACS open source framework that provides the e-learning core services. aLF is was modified to support the EHEA learning model, based in activity curricula, providing full integration with the evaluation model of aLF and three new tools to focus on the student tasks planning.
Converging Minds: Assessing Team Performance Using Psychophysiological Measures
Authors: Aniket A. Vartak, Siddharth S. Somvanshi, Cali M. Fidopiastis, Denise Nicholson
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Effective teams are an integral component to the success and the advancement of any organization. This issue emphasizes the need to develop valid measures for team performance especially in operational environments. The use of psychophysiological data has been proposed as a candidate for developing these team-level measures. In this paper, we review past research in the field and discuss two contrasting approaches to model human cognition used in the context of teams. We then propose a test-bed for evaluating these models for human-in-the loop adaptive systems using psychophysiological measures.
Study on Intelligence Computing Traffic Based on One Destination Evacuation
Authors: Miao Wang, Yu Pan, Fang Pan
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

On considering of the uncertainty road condition and the flexibility of the destination choice, one-destination evacuation (ODE) concept is proposed. Based on the concept of ODE, a virtual destination point is set onto the real evacuation network model, with virtual links leading from each real-world destination point to. This way, the optimal destination and route assignment can be determined by solving a one-destination (1D) traffic assignment problem on a modified network representation, not a multi-destination (nD) one.
Learning probabilities for noisy first-order rules
Authors: Daphne Roller, Avi Pfeffer
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

First-order logic is the traditional basis for knowledge representation languages. However, its applicability to many real-world tasks is limited by its inability to represent uncertainty. Bayesian belief networks, on the other hand, are inadequate for complex KR tasks due to the limited expressivity of the underlying (prepositional) language. The need to incorporate uncertainty into an expressive language has led to a resurgence of work on first-order probabilistic Logic. This paper addresses one of the main objections to the incorporation of probabilities into the language: "Where do the numbers come from?" We present an approach that takes a knowledge base in an expressive rule-based first-order language, and leams the probabilistic parameters associated with those rules from data cases. Our approach, which is based on algorithms for learning in traditional Bayesian networks, can handle data cases where many of the relevant aspects of the situation are unobserved. It is also capable of utilizing a rich variety of data cases, including instances with varying causal structure, and even involving a varying number of individuals. These features allow the approach to be used for a wide range of tasks, such as learning genetic propagation models or learning first-order STRIPS planning operators with uncertain effects.
Improved Impossible Differential Cryptanalysis of Reduced-Round Camellia
Authors: Wenling Wu, Lei Zhang, Wentao Zhang
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

The block cipher Camellia has now been adopted as an international standard by ISO/IEC, and it has also been selected to be Japanese CRYPTREC e-government recommended cipher and in the NESSIE block cipher portfolio. Most recently, Wu et al constructed some 8-round impossible differentials of Camellia, and presented an attack on 12-round Camellia-192/256 in [5]. Later in [6], Lu et al improved the above attack by using the same 8-round impossible differential and some new observations on the diffusion transformation of Camellia. Considering that all these previously known impossible differential attacks on Camellia have not taken the key scheduling algorithm into account, in this paper we exploit the relations between the round subkeys of Camellia, together with some novel techniques in the key recovery process to improve the impossible differential attack on Camellia up to 12-round Camellia-128 and 16-round Camellia-256. The data complexities of the two attacks are 265 and 289 respectively, and the time complexities of the two attacks are less than 2111.5 and 2222.1 respectively. The presented results are better than any previously published cryptanalytic results on Camellia without the FL/FL ¿ 1 functions and whitening layers.
Web communication and interaction modeling using model-driven development
Authors: Thiago Jabur Bittar, Renata P.M. Fortes, Luanna Lopes Lobato, Willian M. Watanabe
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

During the development of web-based applications, communication and interaction issues have become even more important, due to the variety of user types that can work together. In this paper we describe the adoption of Model-Driven Development (MDD) approach to support a feasible way to help developers to take into account the issues, regarding to the Web users variety. In general, a good design of the interactions and communication issues implies in high cost and time consuming tasks, and requires that developers be flexible and rapidly change the conception of the interfaces. The meta-models approach presented in this paper aims to map interaction and communication requirements in a practical and useful way during the web application development.
Research on Traffic Flow Base on Neural Network
Authors: Xiaoying Li, Yongzhi Li, JianXin Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The traffic flow according to toll vehicle type classification spends greatly and the data is inaccurate. But the traffic flow according to traffic investgation classification may obtain easily from intelligent toll station. Using neural networks ways transform charge flow into traffic investigation flow, Building-up transformation model, programming in MATLAB, Obtaining error ratio of each kind of vehicle type and total error ratio. It can utilize fully the advantage of the toll-gate. Every toll-gate has the charge record to all kinds of vehicles type in the process charging. The research can cut down the cost of the traffic survey,and make full use of the traffic survey data.
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm
Authors: Werner Backes, Susanne Wetzel
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

In this paper, we introduce a new parallel variant of the LLL lattice basis reduction algorithm. Our new, multi-threaded algorithm is the first to provide an efficient, parallel implementation of the Schorr-Euchner algorithm for today's multi-processor, multi-core computer architectures. Experiments with sparse and dense lattice bases show a speed-up factor of about 1.8 for the 2-thread and about factor 3.2 for the 4-thread version of our new parallel lattice basis reduction algorithm in comparison to the traditional non-parallel algorithm.
On-Line Monitoring of Winding Deformation of Power Transformer Based on ARM and FPGA
Authors: Shan Zhang, Zhenjiang Cai, Dening Zhang, Hongjuan Kao, Jinwei Guo
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

For winding deformation of power transformer, the on-line monitoring system of winding deformation of power transformer is designed based on ARM and FPGA in this paper. The system describes the specific hardware and some software programs in detail and simultaneously describes the specific application of FPGA in data collection system of the transformer. The system with good real-time, high reliability, high-speed and good flexibility will have a good prospect.
Experience report: modularization - the new paradigm for the information engineer
Authors: Katherine Haramundanis
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

To improve the accuracy and consistency of customer and support documentation, corporations over the past two decades or more have made a concerted effort to make possible and improve the modularization of corporate source materials. With adequate and up-to-date training, a functional content-management system, and well-supported writing tools, significant cost-reductions can be achieved. The writer, in this new environment, must deal with a completely new mental model and work process to create their deliverable materials, and with a paradigm shift that directly affects their day-to-day work. The writer accustomed to full control and ownership of a document can look forward to a fully team-oriented approach that provides for the ultimate reader the full realization of the best of all possible worlds. Design of any communication is much more a collaborative process than an exercise in creating text to insert in an outline. This author has experienced this change in process at first hand in decades of writing experience in the computer industry.
On a Construction of Short Digests for Authenticating Ad Hoc Networks
Authors: Khoongming Khoo, Ford Long Wong, Chu-Wee Lim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

In pervasive ad-hoc networks, there is a need for devices to be able to communicate securely, despite the lack of apriori shared security associations and the absence of an infrastructure such as a PKI. Previous work has shown that through the use of short verification strings exchanged over manual authentication channels, devices can establish secret session keys. We examine a construction of such a cryptographic digest function for deriving the verification string, and propose an improved construction, with weaker assumptions. We further provide a concrete instantiation which is efficient, based on finite fields.
Multimodal subjectivity analysis of multiparty conversation
Authors: Stephan Raaijmakers, Khiet Truong, Theresa Wilson
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We investigate the combination of several sources of information for the purpose of subjectivity recognition and polarity classification in meetings. We focus on features from two modalities, transcribed words and acoustics, and we compare the performance of three different textual representations: words, characters, and phonemes. Our experiments show that character-level features outperform wordlevel features for these tasks, and that a careful fusion of all features yields the best performance.1
A new method for roots of monic quaternionic quadratic polynomial
Authors: Zhigang Jia, Xuehan Cheng, Meixiang Zhao
Venue: Computers Mathematics with Applications (2009)

The purpose of this paper is to show how the problem of finding roots (or zeros) of the monic quaternionic quadratic polynomials (MQQP) can be solved by its equivalent real quadratic form. The real quadratic form matrices, firstly defined in this paper, are used to form a simple equivalent real quadratic form of MQQP. Some necessary and sufficient conditions for the existence of roots of MQQP are also presented. The main idea of the practical method proposed in this work can be summarized in two steps: translating MQQP into its equivalent real quadratic form, and giving directly the quaternionic roots of MQQP by solving its equivalent real quadratic form.
Monocular Vision Measuring System for Flight Spin Based on Geometric Feature
Authors: Wang Li-heng, Li Yue-zhong, Li Chang-xi
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Because the projection transformation from 3-D to 2-D is irreversible, it can’t get the 3-D information of the unknown object from 2-D image. However, the measured object in the spin flight test is known in advance, their geometric features can be acquired before measurement. Based on the geometric features of the measured object, measuring its space information using monocular vision is the research content of this paper. It presents the measurement model of monocular vision based on pinhole camera model. A method of feature points extracting and matching based on threshold segmentation is adopted. Finally a set of experimental data of spin test is given. The experimental result showed that the position and attitude of the model plane can be retrieved from known geometric feature and 2-D image. The occlusion of feature-point and distance between feature-points has great influence on the measurement precision.
From grammar-independent construction enumeration to lexical types in computational grammars
Authors: Lars Hellan
Venue: Proceedings of the Workshop on Grammar Engineering Across Frameworks (2008)

The paper presents a code for enumerating verb-construction templates, from which lexical type inventories of computational grammars can be derived, and test suites can be systematically developed. The templates also serve for descriptive and typological research. The code is string-based, with divisions into slots providing modularity and flexibility of specification.
Semi-parametric and Non-parametric Term Weighting for Information Retrieval
Authors: Donald Metzler, Hugo Zaragoza
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

Most of the previous research on term weighting for information retrieval has focused on developing specialized parametric term weighting functions. Examples include TF.IDF vector-space formulations, BM25, and language modeling weighting. Each of these term weighting functions takes on a specific parametric form. While these weighting functions have proven to be highly effective, they impose strict constraints on the functional form of the term weights. Such constraints may possibly degrade retrieval effectiveness. In this paper we propose two new classes of term weighting schemes that we call semi-parametric and non-parametric weighting. These weighting schemes make fewer assumptions about the underlying term weights and allow the data to speak for itself. We argue that these robust weighting schemes have the potential to be significantly more effective compared to existing parametric schemes, especially with the growing amount of training data becoming available.
Securing Timeout Instructions in Web Applications
Authors: Alejandro Russo, Andrei Sabelfeld
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

Timeout mechanisms are a useful feature for web applications.However, these mechanisms need to be used with care because, if usedas-is, they are vulnerable to timing attacks. This paper focuses oninternal timing attacks, a particularly dangerous class oftiming attacks, where the attacker needs no access to a clock. In the context of client-side webapplication security, we present JavaScript-based exploits against the timeout mechanism of the DOM (document object model), supported bythe modern browsers. Our experimental findings reveal rather liberalchoices for the timeout semantics by different browsers and motivate the need for a general securitysolution. We propose a foundation for such a solution in the form of a runtimemonitor. We illustrate for a simple language that, while being more permissive than a typicalstatic analysis, the monitor enforces termination-insensitive noninterference.
General suffix automaton construction algorithm and space bounds
Authors: Mehryar Mohri, Pedro Moreno, Eugene Weinstein
Venue: Theoretical Computer Science (2009)

Suffix automata and factor automata are efficient data structures for representing the full index of a set of strings. They are minimal deterministic automata representing the set of all suffixes or substrings of a set of strings. This paper presents a novel analysis of the size of the suffix automaton or factor automaton of a set of strings. It shows that the suffix automaton or factor automaton of a set of strings U has at most 2Q-2 states, where Q is the number of nodes of a prefix-tree representing the strings in U. This bound significantly improves over 2@?U@?-1, the bound given by Blumer et al. [A. Blumer, J. Blumer, D. Haussler, R.M. McConnell, A. Ehrenfeucht, Complete inverted files for efficient text retrieval and analysis, Journal of the ACM 34 (1987) 578-589], where @?U@? is the sum of the lengths of all strings in U. More generally, we give novel and general bounds for the size of the suffix or factor automaton of an automaton as a function of the size of the original automaton and the maximal length of a suffix shared by the strings it accepts. We also describe in detail a linear-time algorithm for constructing the suffix automaton S or factor automaton F of U in time O(|S|). Our algorithm applies in fact to any input suffix-unique automaton and strictly generalizes the standard on-line construction of a suffix automaton for a single input string. Our algorithm can also be used straightforwardly to generate the suffix oracle or factor oracle of a set of strings, which has been shown to have various useful properties in string-matching. Our analysis suggests that the use of factor automata of automata can be practical for large-scale applications, a fact that is further supported by the results of our experiments applying factor automata to a music identification task with more than 15,000 songs.
Using Temporal Language Models for Document Dating
Authors: Nattiya Kanhabua, Kjetil Nørvåg
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

In order to increase precision in searching for web pages or web documents, taking the temporal dimension into account is gaining increased interest. A particular problem for web documents found on the Internet is that in general, no trustworthy timestamp is available. This is due to its decentralized nature and the lack of standards for time and date. In previous work we have presented techniques for solving this problem. In this paper, we present a tool for determining the timestamp of a non-timestamped document (using file, URL or text as input) using temporal language models. We also outline how this tool will be demonstrated.