ppxscal/embedding_network huggingface dataset:
Inductive as a Support of Deductive Data Visualisation in Wireless Sensor Networks
Authors: Mohammad Hammoudeh, Robert Newman, Christopher Dennett, Sarah Mount
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Wireless sensor networks (WSNs) have an intrinsic interdependency with the environments in which they operate. The part of the world with which an application is concerned is defined as that application’s domain. This paper advocates that an application domain of a WSN can serve as a supplement to analysis, interpretation, and visualisation methods and tools. Utilising a combination of an application domain model and live multimodal sensory data was proven to be an attractive paradigm for improving visualisation accuracy. We propose a Multi-Dimensional Application Domain-driven (M-DAD) visualisation framework that is suitable for visualising an arbitrary number of sense modalities, n-dimensional visualisation, using parameters of the application domain to improve the visualisation performance. The experimental results demonstrate that M-DAD visualisation framework performs as well or better than visualisation services without its extended capabilities.
The Application of Ant Colony Optimization Technique (ACOT) for Employees Selection and Training
Authors: Zhengbing Hu, Rabah Moh'd, Al Shboul
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In this paper, ACOT was provided to advise for employees in selecting the Training Courses (TCs). The courses planning process needs to abide the company's policies regarding training hours and costs. In order to avoid the courses of an employee are confined to only one or two areas, we stipulate that the selected TCs cover three or more areas. This paper uses Ant Colony Optimization (ACO) algorithm to generate packages of TCs for individual employees with the maximization of utility (costs * hours) as the objective function values. Moreover, we also use an enumerate algorithm to verify the effectiveness and efficiency of our ACO algorithm. The two measurements are related to the solution quality and run time required by our algorithm.
Algorithm to Identify Maturation Stages of Coffee Fruits
Authors: Juan R. Sanz-Uribe, Paula J. Ramos-Giraldo, Carlos E. Oliveros-Tascon
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

This chapter presents a strategy to identify coffee fruits in five different maturation stages. The strategy is based on the separation among color loci of coffee fruits in different maturation stages, in the RG plane. To take advantage of this separation, a calibration algorithm was developed to delimit the regions. The algorithm was complemented with experts’ criteria to make decisions in the intersections. The calibration procedure produces an identification matrix that is then used to recognize the maturation stage of fruits passing in front of an optoelectronic device. The system showed acceptable efficacies with a simple sensor and an inexpensive lighting system.
The Method of Livable Environmental Evaluation Based on Remote Sensing Technology
Authors: Luo Lingjun, Hu Yan, He Zong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Livable environment is one of the hot topics within the realm of the international research in urban science, and it recently becomes the focus of global governments and city residents. The evaluative content of a livable city came out more earlier in developed country, and got rapid development. Presently, the developed countries have set up one and another representatives of livable city, while China is still in the process of urbanization and industrialization.
On the Use of Ray-tracing for Viewpoint Interpolation in Panoramic Imagery
Authors: Feng Shi, Robert Laganiere, Eric Dubois, Frédéric Labrosse
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

To acquire seamless visualization of environments fromdifferent viewing positions and orientations, it is desirableto generate virtual images for an arbitrary position givena set of reference views. In this paper, a simple interpolationmethod based on ray-tracing is proposed for viewpointsynthesis from panoramas taken with multi-sensor cameras.Instead of attempting to recover a dense 3D reconstructionof the scene, the method estimates the pose between eachpanorama and then backward projects the point along theray that exhibits the best colour consistency. We show thatby limiting the search space using sparse depth information,both the speed and the accuracy of the interpolationare improved.
Computing Prescriptions: Quickhull: Computing Convex Hulls Quickly
Authors: Ernst Mucke
Venue: IEEE Design Test (2009)

The convex hull is one of computational geometry's fundamental structures, offering a simple way to approximate a point set's shape. Quickhull is a simple algorithm for computing convex hulls that takes a divide-and-conquer approach and proves efficient in practice.
Dynamic Factor Graphs for Time Series Modeling
Authors: Piotr Mirowski, Yann Lecun
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities between hidden and observed variables, and factors modeling dynamical constraints on hidden variables. The DFG assigns a scalar energy to each configuration of hidden and observed variables. A gradient-based inference procedure finds the minimum-energy state sequence for a given observation sequence. Because the factors are designed to ensure a constant partition function, they can be trained by minimizing the expected energy over training sequences with respect to the factors' parameters. These alternated inference and parameter updates can be seen as a deterministic EM-like procedure. Using smoothing regularizers, DFGs are shown to reconstruct chaotic attractors and to separate a mixture of independent oscillatory sources perfectly. DFGs outperform the best known algorithm on the CATS competition benchmark for time series prediction. DFGs also successfully reconstruct missing motion capture data.
Randomizable Proofs and Delegatable Anonymous Credentials
Authors: Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other users, and prove possession of a credential L levels away from a given authority. The size of the proof (and time to compute it) is O(Lk), where k is the security parameter. The only other construction of delegatable anonymous credentials (Chase and Lysyanskaya, Crypto 2006) relies on general non-interactive proofs for NP-complete languages of size k ¿(2 L ). We revise the entire approach to constructing anonymous credentials and identify randomizable zero-knowledge proof of knowledge systems as the key building block. We formally define the notion of randomizable non-interactive zero-knowledge proofs, and give the first instance of controlled rerandomization of non-interactive zero-knowledge proofs by a third-party. Our construction uses Groth-Sahai proofs (Eurocrypt 2008).
Modular Action Language ${\cal ALM}$
Authors: Daniela Inclezan
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

The field of knowledge representation experienced substantial progress in representing dynamic domains during the last decades. Action languages were created to describe transition diagrams in a mathematically accurate and concise manner. Solutions for the frame, ramification and qualification problems were discovered. We now have a good understanding of how to describe effects of actions and action executability conditions. However, the issue of describing objects of dynamic domains, including actions and fluents, remains almost unaddressed. The traditional approach, in which such objects are represented as constants or terms, doesn't allow for an elaboration tolerant and scalable represention of action properties. In previous action languages it is impossible to describe objects of the domain in terms of other, already defined, objects. This and similar features can be achieved by adding modularity to action languages. This would enable programmers to create libraries of knowledge about dynamic domains. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On Integration of Information Technology and Curriculum in University Education
Authors: Wang Xiaohui, Lin Lin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This article attempts to comb concepts of integration of information technology and curriculum, and in comparison of information technology and curriculum with CAI, confirming the connotation of integration of information technology and curriculum, pointing out the roles of integration of information technology and curriculum in university education.
Research on the Measurement of Thrust Vector for a Liquid-Propellant Rocket Motor Based on Piezoelectric Quartz
Authors: Jun Zhang, Baoyuan Sun, Zongjin Ren, Yue Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In spaceflight, the orbit/attitude control rocket which mainly works in pulse ignition has important effect on spacecraft control. It is necessary to study the performance of thrust vector generated by rocket in order to improve the control precision and extend working life of spacecraft. A piezoelectric measurement system for thrust vector measurement is investigated both theoretically and experimentally. The postulate of thrust vector measurement is proposed and its expression is obtained according to 6-point-orientation principle. Piezoelectric quartz is selected as the sensitive component and key parameters are evaluated by setting up demand capability restriction. Static and dynamic characteristic of the measurement platform is analyzed by means of experiment. Special experiments have been done to validate the system’s capability on the designed stand.
Functions Definable by Arithmetic Circuits
Authors: Ian Pratt-Hartmann, Ivo Düntsch
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this paper, we consider the definability of functions from tuples of sets of non-negative integers to sets of non-negative integers by means of arithmetic circuits. We prove two negative results: the first shows, roughly, that a function is not circuit-definable if it has an infinite range and sub-linear growth; the second shows, roughly, that a function is not circuit-definable if it has a finite range and fails to converge on certain `sparse' chains under inclusion. We observe that various functions of interest fall under these descriptions.
Design of Aviation Logistics Network for GZARFCAFTA Based on the Gravity Model
Authors: Chen Wang, Zhixue Liu, Qiankai Qing, Kunpeng Li, Hua Li
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

The objective of this research is to construct aviation logistics network of Guangxi Zhuang Autonomous Region facing to China-ASEAN Free Trade Area (GZARFCAFTA). The gravity model is incorporated in the air nodes evaluation through which the gravitations of both domestic and ASEAN’s major air nodes to Guangxi’s major air nodes are calculated, then the gravitations are sorted and nodes of different importance in different aviation logistics network are selected, and eventually the hierarchicalaviation logistics network of GZARFCAFTA is constructed by applying the theory of non-strict hub-and-spoken airline network. This research presents a method of designing aviation logistics network combining quantificationally evaluating air nodes and airlines designing, which has important guiding significance for the construction of actual network.
Risks of the CardSpace Protocol
Authors: Sebastian Gajek, Jörg Schwenk, Michael Steiner, Chen Xuan
Venue: Proceedings of the 12th International Conference on Information Security (2009)

Microsoft has designed a user-centric identity metasystem encompassing a suite of various protocols for identity management. CardSpace is based on open standards, so that various applications can make use of the identity metasystem, including, for example, Microsoft Internet Explorer or Firefox (with some add-on). We therefore expect Microsoft's identity metasystem to become widely deployed on the Internet and a popular target to attack. We examine the security of CardSpace against today's Internet threats and identify risks and attacks. The browser-based CardSpace protocol does not prevent against replay of security tokens. Users can be impersonated and are potential victims of identity theft. We demonstrate the practicability of the flaw by presenting a proof of concept attack. Finally, we suggest several areas of improvement.
Unit of Learning Model for LMS/LCMS Integrating Psycho-pedagogical Elements
Authors: Kai-Li Wang, Philippe Trigano
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

In order to make Learning Management System (LMS) and Learning Content Management System (LCMS) more adaptable, this paper provides a way of integrating psychological and pedagogical elements in the online course structure generation process, based on platform of netUniversité. The elements are integrated in an interactive user questionnaire, which is based on the results of quantitative research. As a part of user model and the preface of learning design, this questionnaire was presented in an ontology, to solve the problem of combinatorial explosion.
Ultra-low-power biopotential interfaces and their applications in wearable and implantable systems
Authors: Refet Firat Yazicioglu, Tom Torfs, Patrick Merken, Julien Penders, Vladimir Leonov, Robert Puers, Bert Gyselinckx, Chris Van Hoof
Venue: Microelectronics Journal (2009)

Traditionally the monitoring of the biopotential signals are only limited to clinical applications. On the other hand, there is a growing demand for these biopotential signals to be used in non-clinical applications in order to improve the quality of life and enable the interaction between humans and machines. However, such non-clinical applications of biopotential signal monitoring requires various improvements not only in terms of size and comfort of the biopotential acquisition systems, but also in terms of their power dissipation. An important building block of the biopotential acquisition systems is the front-end circuitry that defines the quality of the extracted signals and unfortunately consumes unacceptable power, when the currently available circuitry is considered. Therefore, this paper focuses on the advances in low-power and high-performance readout circuit design for the acquisition of biopotential signals. In addition, several application examples will be demonstrated, which proves that the realization of high-performance and low-power readout circuits can actually enable the implementation of miniaturized and comfortable biopotential acquisition systems extending the usage of such systems towards non-clinical applications.
The Effect of Data Quality Tag Values and Usable Data Quality Tags on Decision-Making
Authors: Rosanne Price, Graeme Shanks
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

Prior research has shown that supplying decision-makers with data quality (DQ) tags, metadata about the quality of data used in decision-making, can impact decision outcomes in certain circumstances. However, there is conflicting evidence as to how or when decision outcomes are affected. In order to improve experimental soundness, the current research addresses possible sources of ambiguity in previous DQ tagging experiments with respect to DQ tag design. In particular, usability, semantics, and the rationale for assigning DQ values are explicitly considered in the DQ tag design of experiments. DQ tag values are designed to test the question of whether DQ tag impact is influenced by the relative importance of the "poor quality" attribute(s) to the specific decision task, thus potentially explaining discrepancies noted in observed results of prior research. The results showed no significant impact on decision choice, confidence, or efficiency; even with moderately rather than critically important attributes identified as being of poor quality. There was, however, some evidence of decreased consensus with DQ tags. These findings thus contraindicate the inclusion of data quality metadata in decision-making applications as a general business practice.
Intelligent Control of Heating, Ventilating and Air Conditioning Systems
Authors: Patrick Low Kie, Lau Bee Theng
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper proposed a simulation-optimization energy saving strategy for heating, ventilating and air conditioning (HVAC) systems' condenser water loop through intelligent control of single speed cooling towers' components. An analysis of system components has showed the interactions of control variables inside the cooling towers and between the cooling tower and chillers. Based on the analysis, a model based optimization approach was developed with evolutionary computation. A simulation application demonstrated the effectiveness of the proposed strategy. This strategy can also be easily modified and applied to single speed tools in the refrigerant loops.
Secure Content Sniffing for Web Browsers, or How to Stop Papers from Reviewing Themselves
Authors: Adam Barth, Juan Caballero, Dawn Song
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

Cross-site scripting defenses often focus on HTML documents, neglecting attacks involving the browser's content-sniffing algorithm, which can treat non-HTML content as HTML.Web applications, such as the one that manages this conference, must defend themselves against these attacks or risk authors uploading malicious papers that automatically submit stellar self-reviews.In this paper, we formulate content-sniffing XSS attacks and defenses.We study content-sniffing XSS attacks systematically by constructing high-fidelity models of the content-sniffing algorithms used by four major browsers.We compare these models with Web site content filtering policies to construct attacks.To defend against these attacks, we propose and implement a principled content-sniffing algorithm that provides security while maintaining compatibility.Our principles have been adopted, in part, by Internet Explorer 8 and, in full, by Google Chrome and the HTML 5 working group.
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
Authors: Mirosław Truszczyński
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of programs has a finite representation, and for each of the classes definable in the schema we characterize the complexity of the existence of an answer set problem. Next, we derive similar characterizations of the complexity of skeptical and credulous reasoning with disjunctive logic programs. Such results are of potential interest. On the one hand, they reveal some reasons responsible for the hardness of computing answer sets. On the other hand, they identify classes of problem instances, for which the problem is "easy" (in P) or "easier than in general" (in NP).
Fuzzy goal programming algorithm for solving decentralized bi-level multi-objective programming problems
Authors: Ibrahim A. Baky
Venue: Fuzzy Sets and Systems (2009)

This paper presents fuzzy goal programming (FGP) algorithm for solving decentralized bi-level multi-objective programming (DBL-MOP) problems with a single decision maker at the upper level and multiple decision makers at the lower level. A FGP algorithm for DBL-multi-objective linear programming (DBL-MOLP) problems is proposed. This algorithm is extended to solve bi-level multi-objective linear fractional programming (DBL-MOLFP) problems. In the proposed algorithm, the membership functions for the defined fuzzy goals of all objective functions at the two levels as well as the membership functions for vector of fuzzy goals of the decision variables controlled by ULDM are developed in the model formulation of the problem. Then FGP approach is used to achieve highest degree of each of the membership goals by minimizing their deviational variables and thereby obtaining the most satisfactory solution for all decision makers. Illustrative numerical examples are given to demonstrate the proposed algorithm.
Spatial camera orientation control by rotation-minimizing directed frames
Authors: Rida T. Farouki
Venue: Computer Animation and Virtual Worlds (2009)

The use of rotation-minimizing directed frames (RMDFs) for defining smoothly varying camera orientations along given spatial paths, in real or virtual environments, is proposed. A directed frame on a space curve ${\bf r}(\xi)$ is a varying orthonormal basis $({\bf o},{\bf p},{\bf q})$ for &Ropf;3 such that ${\bf o}(\xi)={\bf r}(\xi)/|{\bf r}(\xi)|$ coincides with the unit polar vector from the origin to each curve point, and such a frame is rotation-minimizing if its angular velocity vector ${\bf \omega}$ maintains a vanishing component along o. To facilitate computation of rotation-minimizing directed frames, it is shown that the basic theory is equivalent to the established theory for rotation-minimizing adapted frames&mdash;for which one frame vector coincides with the tangent ${\bf t}(\xi)={\bf r}'(\xi)/|{\bf r}'(\xi)|$ at each curve point&mdash;if one replaces the given space curve by its anti-hodograph (i.e., indefinite integral). A family of polynomial curves on which RMDFs can be computed exactly by a rational function integration, the Pythagorean (P) curves, is also introduced, together with algorithms for their construction. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Automatic prediction of parser accuracy
Authors: Sujith Ravi, Kevin Knight, Radu Soricut
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Statistical parsers have become increasingly accurate, to the point where they are useful in many natural language applications. However, estimating parsing accuracy on a wide variety of domains and genres is still a challenge in the absence of gold-standard parse trees. In this paper, we propose a technique that automatically takes into account certain characteristics of the domains of interest, and accurately predicts parser performance on data from these new domains. As a result, we have a cheap (no annotation involved) and effective recipe for measuring the performance of a statistical parser on any given domain.