ppxscal/embedding_network huggingface dataset:
The Evaluation Model of Quality of High Performance Concrete Construction Based on the Unascertained Measure
Authors: Chang-long Wang, Jin-yun He, Hong-jun Gao
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

The evaluation of quality of HPC construction is a systematic project involving multi-factor, according to concrete preparation, transportation, pouring, conservation as evaluation index system of construction quality, establish unascertained measure comprehensive evaluation model. Applications used by the model shows that the evaluation results can objectively reflect quality of HPC construction, which provides a new method and way for evaluation of quality of concrete construction and has theoretical and practical value. Due to the ordered division of evaluation space, the unascertained measure model improves distinguish level. It has reliable evaluation result and is a practical model.
Detecting groups of anomalously similar objects in large data sets
Authors: Zhicheng Zhang, David J. Hand
Venue: Intelligent Data Analysis (2006)

Pattern discovery is a facet of data mining concerned with the detection of "small local" structures in large data sets. In high dimensions this is typically difficult because of the computational work involved in searching over the data space. In this paper we outline a tool called PEAKER which can detect patterns efficiently in high dimensions. We approach the subject through the two aspects of pattern discovery, detection and verification. We demonstrate various ways of using PEAKER as well as its various inherent properties, emphasizing the exploratory nature of the tool.
The Mobile Office: The Essential Small Business Guide to Office Technology
Authors: Arthur Goldstuck, Steven Ambrose
Venue:  (2009)

The office of tomorrow is already with us. You can see it in coffee shops, airport lounges and hotel lobbies across the world. It's called the mobile office and in some instances consists of only a laptop and a wireless broadband card. Even now mobile office options are evolving rapidly and the bewildering range of add-ons is growing every day. Ironically, the choices meant to make your life simpler and more productive are in fact becoming more and more complex. Arthur Goldstuck has once again come to the rescue. This vital roadmap guides you through the jungle of competing products and connectivity options, and helps you to decipher the hard-sell you are bombarded with daily. Should you upgrade now? Should you wait for the next version? Are you being led down an electronic dead-end? This book answers such questions with insights into older technologies that are still viable, practical advice on current office options and predictions on what will arrive in the near future. Whether you are self-employed, an entrepreneur looking to start up a small business or a corporate looking to become more efficient, this book could hold the key to your streamlined success.
Application of Raman Spectroscopy to Detecting Organic Contaminant in Water
Authors: Gang Li, Minghong Chen, Tianyun Wei
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Organic contaminants are harmful to body health, and are usually contained in waste water, so it is necessary to determine and monitor them. The demand for real-time analysis and online examination of organic contaminants in water has presented a challenge to analytical and physical chemist. Raman Spectroscopy is a molecular vibrational spectroscopic technique, and Raman effect is caused by interactions of molecule and photon and shows the information in molecules. Because the Raman spectra of different molecules are much more distinct, they provides characteristic of the molecule. Especially, Raman spectra of the solutes are unaffected by the water, therefore the weak scattering of water makes the technique well suited to analyzing aqueous contaminants. The paper firstly introduced Raman spectroscopy, and then analyzed and assigned the Raman spectra of five kinds of organic contaminants and their mixture. The results showed that Raman spectroscopy is a powerful technique for analyzing aqueous solutions of organic contaminants.
Handling non-sentential utterances in a continuous understanding framework
Authors: Carlos Gómez Gallo
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The goal of my research is to understand speech input in a continuous manner by treating the input stream as fragmental utterances. This allows us to use various approaches to predict what comes downstream. Possible interpretations are trimmed by such predictions which in turn also allow us to complete information not readily available in the fragmental utterance. Semantic frames can encode all possible arguments for domain actions. As utterances are processed continuously, appropriate frames can be activated so that fragment interpretations can fill, correct or extend frames under consideration. In turn, feedback can be provided to the parser as the frames are manipulated possibly based on the completeness of the semantic frame construction.
A Study of the Blind Equalization in the Underwater Communication
Authors: Jing Wang, Haining Huang, Chunhua Zhang, Jing Guan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

An equalizer is always adopted in an underwater acoustic communication system to reduce the intersymbol interference (ISI) due to the multipath effect. This paper introduces the basic structure and principle of a blind equalizer at first. Then the constant modulus algorithm (CMA) is derived and applied to an underwater communication system affected by multipath channel severely. The simulation results show that the CMA eliminates the ISI significantly. CMA is valuable practically because the training sequence is unnecessary for it.
Networks Evolving Step by Step: Statistical Analysis of Dyadic Event Data
Authors: Ulrik Brandes, Jürgen Lerner, Tom A. B. Snijders
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

With few exceptions, statistical analysis of social networks is currently focused on cross-sectional or panel data. On the other hand, automated collection of network-data often produces event data, i.e., data encoding the exact time of interaction between social actors. In this paper we propose models and methods to analyze such networks of dyadic events and to determine the factors that influence the frequency and quality of interaction. We apply our methods to empirical datasets about political conflicts and test several hypotheses concerning reciprocity and structural balance theory.
Comparing Methods for Multilabel Classification of Proteins Using Machine Learning Techniques
Authors: Ricardo Cerri, Renato R. Silva, André C. Carvalho
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

Multilabel classification is an important problem in bioinformatics and Machine Learning. In a conventional classification problem, examples belong to just one among many classes. When an example can simultaneously belong to more than one class, the classification problem is named multilabel classification problem. Protein function classification is a typical example of multilabel classification, since a protein may have more than one function. This paper describes the main characteristics of some multilabel classification methods and applies five methods to protein classification problems. For an experimental comparison of these methods, traditional machine learning techniques are used. The paper also compares different evaluation metrics used in multilabel problems.
Latent tree models and approximate inference in Bayesian networks
Authors: Yi Wang, Nevin L. Zhang, Tao Chen
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and when online, make inference with the LTM instead of the original BN. Because LTMs are tree-structured, inference takes linear time. In the meantime, they can represent complex relationship among leaf nodes and hence the approximation accuracy is often good. Empirical evidence shows that our method can achieve good approximation accuracy at low online computational cost.
Two NFC interaction techniques for quickly exchanging pictures between a mobile phone and a computer
Authors: Khoovirajsingh Seewoonauth, Enrico Rukzio, Robert Hardy, Paul Holleis
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Uploading and downloading pictures between a mobile phone and a computer is still a very cumbersome process. Because of this, many users actually do not copy, move or backup their pictures onto another computer until the storage capacity of the mobile phone is reached. This paper presents the prototypes (and respective implementation details) of the touch & connect and touch & select interaction techniques. Both techniques allow the quick and easy exchange of pictures by touching the computer with the mobile device. The first interaction technique: touch & connect, allows the user to touch a computer with their mobile phone in order to establish a Bluetooth connection and initiate a file transfer between the two devices. The second interaction technique: touch & select, extends this concept and allows the selection of a specific picture or location on the computer screen by touching it with the mobile phone. The interaction techniques were implemented using Near Field Communication (NFC) tags attached to the computer and an NFC phone capable of reading those tags.
Constraint-Driven Identification of Application Specific Instructions in the DURASE System
Authors: Kevin Martin, Christophe Wolinski, Krzysztof Kuchcinski, Antoine Floch, François Charot
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

This paper presents a new constraint-driven method for fast identification of computational patterns that is a part of DURASE system (Generic Environment for Design and Utilization of Reconfigurable Application-Specific Processors Extensions). The patterns identified by our system form a base for application specific instruction selection and processor extension generation. Our method identifies all computational patterns directly from an application graph satisfying all architectural and technological constraints imposed by target processors and FPGA devices. The considered constraints include a number of inputs and outputs, a number of operators, and a delay of the pattern critical path. Therefore the identified patterns can be well tailored to target processors. Our approach uses heavily constraint programming methods, which makes it possible to mix graph isomorphism constraints with other constraints in one formal environment. We have extensively evaluated our algorithm on MediaBench and MiBench benchmarks with tough architectural and technological constraints. The obtained patterns have good coverage of application graphs while limiting number of operators and fulfill architectural and technological constraints.
Instantaneous Soundness Checking of Industrial Business Process Models
Authors: Dirk Fahland, Cédric Favre, Barbara Jobstmann, Jana Koehler, Niels Lohmann, Hagen Völzer, Karsten Wolf
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

We report on a case study on control-flow analysis of business process models. We checked 735 industrial business process models from financial services, telecommunications and other domains. We investigated these models for soundness (absence of deadlock and lack of synchronization) using three different approaches: the business process verification tool Woflan, the Petri net model checker LoLA, and a recently developed technique based on SESE decomposition. We evaluate the various techniques used by these approaches in terms of their ability of accelerating the check. Our results show that industrial business process models can be checked in a few milliseconds, which enables tight integration of modeling with control-flow analysis. We also briefly compare the diagnostic information delivered by the different approaches.
Increasing the Scope and Resolution of Interprocedural Static Single Assignment
Authors: Silvian Calman, Jianwen Zhu
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

While intraprocedural Static Single Assignment (SSA) is ubiquitous in modern compilers, the use of interprocedural SSA, although seemingly a natural extension, is limited. We find that part of the impediment is due to the narrow scope of variables handled by previously reported approaches, leading to limited benefits in optimization.In this study, we increase the scope of Interprocedural SSA (ISSA) to record elements and singleton heap variables. We show that ISSA scales reasonably well (to all MediaBench and most of the SPEC2K), while resolving on average 1.72 times more loads to their definition. We propose and evaluate an interprocedural copy propagation and an interprocedural liveness analysis and demonstrate their effectiveness on reducing input and output instructions by 44.5% and 23.3%, respectively. ISSA is then leveraged for constant propagation and dead code removal, where 11.8% additional expressions are folded.
Methodologies for the User Evaluation of the Motion of Virtual Humans
Authors: Sander E. Jansen, Herwin Welbergen
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Virtual humans are employed in many interactive applications, including (serious) games. Their motion should be natural and allow interaction with its surroundings and other (virtual) humans in real time. Physical controllers offer physical realism and (physical) interaction with the environment. Because they typically act on a selected set of joints, it is hard to evaluate their naturalness in isolation. We propose to augment the motion steered by such a controller with motion capture, using a mixed paradigm animation that creates coherent full body motion. A user evaluation of this resulting motion assesses the naturalness of the controller. Methods from Signal Detection Theory provide us with evaluation metrics that can be compared among different test setups, observers and motions. We demonstrate our approach by evaluating the naturalness of a balance controller. We compare different test paradigms, assessing their efficiency and sensitivity.
Using Knowledge Base for Event-Driven Scheduling of Web Monitoring Systems
Authors: Yang Sok Kim, Sung Won Kang, Byeong Ho Kang, Paul Compton
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

Web monitoring systems report any changes to their target web pages by revisiting them frequently. As they operate under significant resource constraints, it is essential to minimize revisits while ensuring minimal delay and maximum coverage. Various statistical scheduling methods have been proposed to resolve this problem; however, they are static and cannot easily cope with events in the real world. This paper proposes a new scheduling method that manages unpredictable events. An MCRDR (Multiple Classification Ripple-Down Rules) document classification knowledge base was reused to detect events and to initiate a prompt web monitoring process independent of a static monitoring schedule. Our experiment demonstrates that the approach improves monitoring efficiency significantly.
Towards proving type safety of C#
Authors: Nicu G. Fruja
Venue: Computer Languages, Systems and Structures (2010)

We consider a substantial subset ofC^#, named C^#"S. We develop a mathematical specification for C^#"S by formalizing its abstract syntax, execution environment, well-typedness conditions, and operational evaluation semantics. Based on this specification, we prove that C^#"S is type-safe by showing that the execution of C^#"S programs preserves the types, up to a subtype relationship.
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
Authors: Pierrick Gaudry
Venue: Journal of Symbolic Computation (2009)

We propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties of small dimension. The main difference with the previous approaches is that we do not make use of any embedding into the Jacobian of a well-suited curve. We apply this algorithm to the Weil restriction of elliptic curves and hyperelliptic curves over small degree extension fields. In particular, our attack can solve an elliptic curve discrete logarithm problem defined over F"q"^"3 in heuristic asymptotic running time O@?(q^4^/^3); and an elliptic problem over F"q"^"4 or a genus 2 problem over F"q"^"2 in heuristic asymptotic running time O@?(q^3^/^2).
Improvement of the Design Quality of 3D-Input Devices Using Motion Analyses and Biomechanical Comparisons
Authors: Tobias Nowack, Stefan Lutherdt, Manuel Möller, Peter Kurtz, Hartmut Witte
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

Due to the lack of investigations and standards describing the design of real 3D input devices a real 3D input device was develop. To compare seve ral devices a test task was created and performed with combination of a motion capturing system. During the experiment 19 attendees with different levels of experience performed the test with this setup. Several intra-individual motion patterns and using strategies belonging to different input devices could be observed.
Adaptive Rateless LDPC Code Used for Distributed Video Coding
Authors: Cai Shu-ting, Wang Qin-ruo, Xie Yun, Yin Ming
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

To overcome the poor adaptive ability of the fixed-LDPC code applied to video compression, a kind of distributed video compression scheme based on rate less LDPC is proposed. A novel rate estimation scheme is also used in both decoder and encoder to reduce the complexity of decoder. While the added complexity of encoder and effected system ratio distortion performance is negligible. And the rateless LDPC supplies to design multiple code modes. Experiments results show that proposed scheme access the 1-2dB gain of ratio distortion compared with LDPCA.
The Persuasive Effects from Web 2.0 Marketing: A Case Study Investigating the Persuasive Effect from an Online Design Competition
Authors: Asle Fagerstrøm, Gheorghita Ghinea
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)

This case study investigates the effect from a Web 2.0 campaign, an online design competition, accomplished by a company that produces and marketed feminine care products (sanitary towels). The target segment for the campaign was girls in four Nordic countries, in the age between 14 and 25. The main characteristic for the target segment is that they are not much interested in the product category. Our interpretation is that the online design competition had a persuasive effect towards the target segment. By using the internet in an interactive and social way, companies can achieve brand awareness and create a positive attitude towards a brand in low-involvement segments. Suggestions for further research are given.
Do You Know Where Your Data's Been? --- Tamper-Evident Database Provenance
Authors: Jing Zhang, Adriane Chapman, Kristen Lefevre
Venue: Proceedings of the 6th VLDB Workshop on Secure Data Management (2009)

Database provenance chronicles the history of updates and modifications to data, and has received much attention due to its central role in scientific data management. However, the use of provenance information still requires a leap of faith. Without additional protections, provenance records are vulnerable to accidental corruption, and even malicious forgery, a problem that is most pronounced in the loosely-coupled multi-user environments often found in scientific research.This paper investigates the problem of providing integrity and tamper-detection for database provenance. We propose a checksum-based approach, which is well-suited to the unique characteristics of database provenance, including non-linear provenance objects and provenance associated with multiple fine granularities of data. We demonstrate that the proposed solution satisfies a set of desirable security properties, and that the additional time and space overhead incurred by the checksum approach is manageable, making the solution feasible in practice.
Acquiring correct knowledge for natural language generation
Authors: Ehud Reiter, Somayajulu G. Sripada, Roma Robertson
Venue: Journal of Artificial Intelligence Research (2003)

Natural language generation (NLG) systems are computer software systems that produce texts in English and other human languages, often from non-linguistic input data. NLG systems, like most ai systems, need substantial amounts of knowledge. However, our experience in two NLG projects suggests that it is difficult to acquire correct knowledge for NLG systems; indeed, every knowledge acquisition (KA) technique we tried had significant problems. In general terms, these problems were due to the complexity, novelty, and poorly understood nature of the tasks our systems attempted, and were worsened by the fact that people write so differently. This meant in particular that corpus-based KA approaches suffered because it was impossible to assemble a sizable corpus of high-quality consistent manually written texts in our domains; and structured expert-oriented KA techniques suffered because experts disagreed and because we could not get enough information about special and unusual cases to build robust systems. We believe that such problems are likely to affect many other NLG systems as well. In the long term, we hope that new KA techniques may emerge to help NLG system builders. In the shorter term, we believe that understanding how individual KA techniques can fail, and using a mixture of different KA techniques with different strengths and weaknesses, can help developers acquire NLG knowledge that is mostly correct.
Boolean Operations on Polygonal Meshes Using OBB Trees
Authors: Jing Yongbin, Wang Liguan, Bi Lin, Chen Jianhong
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Algorithms for Boolean operations using BSP trees and other algorithms have problems with efficiency and robustness. In order to improve the speed and correctness of operations, a new algorithm for Boolean operations on polygonal meshes was presented. In this algorithm, a fast collision detection algorithm based on oriented bounding box (OBB) was employed, which speed up the intersection test between every two triangles of two different polygonal meshes. After getting the intersection segments, the polygons can be obtained from intersected triangles and intersection segments, then establish the intersection region. Finally, the ultimate result was obtained by acceptance or rejection for the other meshes based on intersection region and the neighborhood of these meshes. In this algorithm, orientability, topology and other geometric characteristics are made full use of. The result shows that the algorithm is efficient and robust. Furthermore, it can apply to both closed meshes and open meshes.