ppxscal/embedding_network huggingface dataset:
Automatic Identification of Highway Horizontal Curves Based on BP Neural Network
Authors: Xiang-hai Meng, Jian Lu, Tian-en Chen, Qing Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Automatic alignment design is always one pursuing goal of highway geometric designers with the rapid development of modern technologies such as intellection, digitalization and automatization. Because of the fact that artificial neural network is widely used in the field of pattern recognition, an approach to fit some control points and then to determine the appropriate type of horizontal curves based on BP neural network is presented. Firstly, the curvature charts which are more intuitive and simpler compared with equations are selected to describe the horizontal curves. Then the fitting and standard curvature curves are defined. Secondly, the eigenvectors and identification vectors are structured by calculating characteristic coefficients of curvature charts. Thirdly, a three-layer BP identification model which takes the eigenvectors and identification vectors of curvature charts as input and output, respectively, is presented. Finally, two cases are given. The corresponding alignment of horizontal curve can be determined by the model which is trained by the eigenvectors and identification vectors of standard curvature chart. The result shows that the BP identification model is able to determine the type of curve.
An algorithm to mine general association rules from tabular data
Authors: Siyamand Ayubi, Maybin K. Muyeba, Ahmad Baraani, John Keane
Venue: Information Sciences: an International Journal (2009)

Most methods for mining association rules from tabular data mine simple rules which only use the equality operator ''='' in their items. For quantitative attributes, approaches tend to discretize domain values by partitioning them into intervals. Limiting the operator only to ''='' results in many interesting frequent patterns that may not be identified. It is obvious that where there is an order between objects, operators such as greater than or less than a given value are as important as the equality operator. This motivates us to extend association rules, from the simple equality operator, to a more general set of operators. We address the problem of mining general association rules in tabular data where rules can have all operators {=,
OCA: Oracle Database 11g Administrator Certified Associate Study Guide
Authors: Biju Thomas
Venue:  (2009)

Candidates for the Oracle Certified Associate in Oracle Database 11g need to pass Exams 1Z0-051 and 1Z0-052 to achieve their certificationthis guide prepares you for taking both those exams. This two-in-one study guide covers the Oracle Certified Associate certification for Oracle database 11g and reviews exam topics such as restricting and sorting data, using conversion functions and conditional expressions, displaying data from multiple tables, and exploring the Oracle database architecture. Plus, youll learn how to create and maintain an Oracle database, perform database backups and recovery, move and manipulate data, prepare the database environment, and more. 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
OLSR and Net-X as a framework for channel assignment experiments: extended abstract
Authors: Marcel C. Castro, Peter Dely, Andreas J. Kassler, Francesco Paolo D'Elia, Stefano Avallone
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

We present a software framework for channel assingment and routing experiments in multi-channel/multi-radio wireless mesh networks. Based on a plug-in architecture we develop a traffic demand-aware channel assignment algorithm. The evaluation in KAUMesh -- an experimental multi-radio mesh network -- shows around 30% throughput improvement with respect to a traffic un-aware channel assignment scheme.
Fault Detection and Isolation of a Cryogenic Rocket Engine Combustion Chamber Using a Parity Space Approach
Authors: Paul van Gelder, André Bos
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

his paper presents a parity space (PS) approach for fault detection and isolation (FDI) of a cryogenic rocket engine combustion chamber. Nominal and non-nominal simulation data for three engine set points have been provided. The PS approach uses three measurements to generate residuals and a spherical transformation to map these residuals to faults.The radial co-ordinate is used for fault detection whereas theazimuthal and polar co-ordinates are used for fault isolation.Evaluation criteria are missed alarms, false alarms, and faultdetection time. Although the approach needs a different residualgeneration method to become more robust, it works very wellwhen compared with the other FDI approaches.• Computation of normative combustion chamber behaviorusing Artificial Neural Nets (ANNs).• Implementation of the approach on a real-time platformand testing it against data from combustion chamber testruns.Future work needs to investigate the robustness of the tech-niques, and how the FDI-approach can be integrated in theoverall system.
Hybrid Binary-Ternary Joint Form and Its Application in Elliptic Curve Cryptography
Authors: Jithra Adikari, Vassil Dimitrov, Laurent Imbert
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

Multi-exponentiation is a common and time consuming operation in public-key cryptography. Its elliptic curve counterpart, called multi-scalar multiplication is extensively used for digital signature verification. Several algorithms have been proposed to speed-up those critical computations. They are based on simultaneously recoding a set of integers in order to minimize the number of general multiplications or point additions. When signed-digit recoding techniques can be used, as in the world of elliptic curves, Joint Sparse Form (JSF) and interleaving w-NAF are the most efficient algorithms. In this paper, a novel recoding algorithm for a pair of integers is proposed, based on a decomposition that mixes powers of 2 and powers of 3. The so-called Hybrid Binary-Ternary Joint Form require fewer digits and is sparser than the JSF and the interleaving w-NAF. Its advantages are illustrated for elliptic curve double-scalar multiplication; the operation counts show a gain of up to 19%.
Goods-Finding and Orientation in the Elderly on 3D Virtual Store Interface: The Impact of Classification and Landmarks
Authors: Cheng-Li Liu, Shiaw-Tsyr Uang, Chen-Hao Chang
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

The internet 3D virtual store has received wide attention from researchers and practitioners due to the fact that it is one of the most killing applications customers can feel in a real shopping environment and possibly increase satisfaction. Though numerous studies have been performed on various issues of the internet store, some research issues relating to the spatial cognition of the elderly when immersed in a 3D virtual store still await further empirical investigation. The objective of this study was to examine how elderly users acquire spatial cognition in an on-screen virtual store. Specifically, the impact of presence and absence of goods-classification on the acquisition of route and survey knowledge was examined. Since landmarks are associated with both route and survey knowledge, we expected to observe the impact of different types of landmarks with both presence and absence of goods-classification. The experimental results indicated that the presence of goods-classification was more important in constructing route knowledge than in absence, and the time of duration of goods-finding would be shorter. However, we also found that the measuring scores of survey knowledge in presence of goods-classification were not significantly larger than in absence. In addition, the measuring scores of route knowledge were the largest and the time of duration of goods-finding was shorter while the presence of goods-classification combined with landmark in the type of alphanumeric + 2D picture + 3D object. Simultaneously, it could be found in absence of goods-classification. Therefore, while the goods-classification is absent, the landmarks could be seemed as redundant codes for goods-finding in 3D virtual store.
Edge-Intersection Graphs of k-Bend Paths in Grids
Authors: Therese Biedl, Michal Stern
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications in conflict resolution of paths in grid networks.In this paper, we continue the study of edge-intersection graphs of paths in a grid, which was initiated by Golumbic, Lipshteyn and Stern. We show that for any k, if the number of bends in each path is restricted to be at most k, then not all graphs can be represented. Then we study some graph classes that can be represented with k-bend paths, for small k. We show that every planar graph has a representation with 5-bend paths, every outerplanar graph has a representation with 3-bend paths, and every bipartite planar graph has a representation with 2-bend paths.
Target tracking with binary proximity sensors
Authors: Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri
Venue: ACM Transactions on Sensor Networks (TOSN) (2009)

We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits while providing minimal descriptions of the estimated target trajectory. Using geometric and probabilistic analysis of an idealized model, we prove that the achievable spatial resolution in localizing a target's trajectory is of the order of 1/&rho;R, where R is the sensing radius and &rho; is the sensor density per unit area. We provide a geometric algorithm for computing an economical (in descriptive complexity) piecewise linear path that approximates the trajectory within this fundamental limit of accuracy. We employ analogies between binary sensing and sampling theory to contend that only a &ldquo;lowpass&rdquo; approximation of the trajectory is attainable, and explore the implications of this observation for estimating the target's velocity. We also consider nonideal sensing, employing particle filters to average over noisy sensor observations, and geometric geometric postprocessing of the particle filter output to provide an economical piecewise linear description of the trajectory. In addition to simulation results validating our approaches for both idealized and nonideal sensing, we report on lab-scale experiments using motes with acoustic sensors.
FReDD: Supporting Mining Strategies through a Flexible-Receptor Docking Database
Authors: Ana T. Winck, Karina S. Machado, Osmar Norberto-De-Souza, Duncan D. Ruiz
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

Among different alternatives to consider the receptor flexibility in molecular docking experiments we opt to execute a series of docking using receptor snapshots generated by molecular dynamics simulations. Our target is the InhA enzyme from Mycobacterium tuberculosis bound to NADH, TCL, PIF and ETH ligands. After testing some mining strategies on these data, we conclude that, to obtain better outcomes, the development of an organized repository is especially useful. Thus, we built a comprehensive and robust database called FReDD to store the InhA-ligand docking results. Using this database we concentrate efforts on data mining to explore the docking results in order to accelerate the identification of promising ligands against the InhA target.
A Local Rarest-Random-Heuristic Data Scheduling for P2P VoD System
Authors: Shaowei Su, Zhentan Feng, Jinlin Wang, Yifeng Lu, Jiali You
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Data scheduling is the key issue in peer-to-peer streaming system, especially in peer-to-peer VoD system. This paper mainly focuses on data chunks’ priority definition of data scheduling in peer-to-peer VoD system. After carefully studying the meanings of regular rarest first scheduling and random scheduling, a Local-Rarest-Random-Heurist (LR2H) scheduling is proposed in order to fully use the resources of strong peers in the system. LR2H fully considers the meanings of rarest first priority and random priority. It brings abundant copies of data chunks in the system by using part of rarest priority and it also avoids the concentrate request in some data chunks which have same rarest priority by adding a random jitter, and then maximize total priority of every scheduling by using heuristic algorithm. Simulation proves that LR2H has achieved a scheduling effect about 30% better than normal rarest first or random scheduling.
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Authors: Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

When performing a Tate pairing (or a derivative thereof) on an ordinary pairing-friendly elliptic curve, the computation can be looked at as having two stages, the Miller loop and the so-called final exponentiation. As a result of good progress being made to reduce the Miller loop component of the algorithm (particularly with the discovery of "truncated loop" pairings like the R-ate pairing [18]), the final exponentiation has become a more significant component of the overall calculation. Here we exploit the structure of pairing-friendly elliptic curves to reduce to a minimum the computation required for the final exponentiation.
CAD and Communicability: A System That Improves the Human-Computer Interaction
Authors: Francisco V. Cipolla Ficarra, Rocío A. Rodríguez
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

We present an analysis of communicability methodology in CAD interactive systems, called DOQ ( DObby Quality). This methodology has been under development between 2001 and 2008, obtaining excellent results in both educational and productive contexts. In studies where there is a bi-directional interrelation between usability and communicability of technical interfaces for the design of tissues in cotton, linen, etc., they ease the learning process of the designers who use a textile interactive system for the first time. We also present an educational prototype that can adapt easily to the real production of fabric: DobbyCAD.
Research and Development on Lean Collaborative Software System for Sales Activity Management
Authors: Bai Yuewei, Wei Shuangyu, Lou Binchao
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper presents a method for a lean platform modeling technology for sales activities collaborative management according to the requirement of small-to-medium size (STMS) companies in China on distributed sales activities collaborative management and sales data consolidated management. In the application, STMS companies normally sell their products via some direct sales channels built by them, e.g., sales offices, or sub-companies which spread around different cities. In the paper, the method of the expected lean collaborative management system modeling is discussed; the principle of collaborative data synchronizing is illustrated, and the data structure design used for the management activities and related information storing is given including the strategy for event synchronizing. In a real example, the application of the proposed method is explained and it is proved that it has some remarkable advantages of low system implementation cost, customized functionalities, and short software development time after the given example system has passed integration tested.
Authorship Invarianceness for Writer Identification
Authors: Azah Kamilah Muda, Siti Mariyam Shamsuddin, Ajith Abraham
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

The uniqueness of shape and style of handwriting can be used for author’s authentication. Acquiring individual features to obtain Authorship Invarianceness Concept have led to an important research in Writer Identification domain. This paper discusses the investigation of this concept by extracting individual features using Geometric Moment Function. Experiment results have shown that Handwriting Invarianceness are discerning with better identification accuracy. This has verified that Moment Function is worth to be explored in identifying the handwritten authorship for Writer Identification.
Graph Rewriting in Computational Origami
Authors: Tetsuo Ida
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

We give graph-theoretic formalization of origami, the art of paper folding.Starting from the abstract origami system, we model origami construction as arewrite sequence of abstract origami's. To reason about the entire origamiconstruction for the computational purposes, we define a labeled hypergraph fororigami and give the abstraction of origami fold as a set of algebraic graphrewrite rules. We give detailed description of the fold operation in terms ofgraph rewriting. The graph-theoretic formalism enables us to reason in twoseparate domains of discourse, i.e. pure combinatoric domain and geometricaldomain R x R.
Earned Value Management Software Projects
Authors: Robert A. Hanna
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

JPL has been attempting to apply EVM techniques for the last 15 years with mixed success, especially when applied to software tasks. One of the main causes is that software presents particular challenges that were not considered during the genesis of EVM. A small number of tasks have been able to use EVM effectively and derive great benefits. This paper discusses challenges specific to software management and how they can be successfully addressed. Specifically, it details lessons learned from the $28 million dollar Next Generation Navigation Software Project that replaced NASA’s deep space navigation software for operations. The project was able to successfully use EVM techniques during a four year period, producing 12 releases on their promised delivery dates and projects actual costs that were within 0.3% of the planned budget (under), in contrast to performance before the techniques were put into practice.
Artifact awareness through screen sharing for distributed groups
Authors: Kimberly Tee, Saul Greenberg, Carl Gutwin
Venue: International Journal of Human-Computer Studies (2009)

Co-located collaborators can see the artifacts that others are working on, which in turn enables casual interactions. To help distributed collaborators maintain mutual awareness of people's electronic work artifacts, we designed and implemented an awareness tool that leverages screen-sharing methods. People see portions of others' screens in miniature, can selectively raise larger views of a screen to get more detail, and can engage in remote pointing. People balance awareness with privacy by using several privacy-protection strategies built into the system. A preliminary evaluation with two groups using this system shows that people use it to maintain awareness of what others are doing, project a certain image of themselves, monitor progress, coordinate joint tasks, determine others' availability, and engage in serendipitous conversation and collaboration. While privacy was not a large concern for these groups, a theoretical analysis suggests that privacy risks may differ for other user communities.
Can Friends Be Trusted? Exploring Privacy in Online Social Networks
Authors: Frank Nagle, Lisa Singh
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

In this paper, we present a case study describing the privacy and trust that exist within a small population of online social network users. We begin by formally characterizing different graphs in social network sites like Facebook. We then determine how often people are willing to divulge personal details to an unknown online user, an adversary. While most users in our sample did not share sensitive information when asked by an adversary, we found that more users were willing to divulge personal details to an adversary if there is a mutual friend connected to the adversary and the user. We then summarize the results and observations associated with this Facebook case study.
Natural Language Interface for Smart Homes
Authors: María Fernández, Juan Bautista Montalvá, Maria Fernanda Cabrera-Umpierrez, María Teresa Arredondo
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

The development of new ICT technologies, like Ambient Intelligence (AmI), and smart homes technologies has been proven to be a key factor to allow people with disabilities gain independency at their homes, vehicle or working environments. The biggest problem that users with disabilities face at the moment of using these technologies is the difficult use of their interfaces. In this paper we present the methodology and implementation used for the development of an interface with smart homes, based on natural language, which provides an easier way, especially for people with physical disabilities and the elderly, to perform the usual tasks at home without the need of a previous learning and complex processes.
Familiarity as a factor in designing finger gestures for elderly users
Authors: Christian Stößel
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Older adults often struggle with everyday technology which is not designed to accommodate their special needs and adapted to their specific cognitive, sensory and motor abilities. Recently, a new generation of mobile devices has been equipped with multitouch and acceleration sensors that allow for novel ways of interacting with these devices. Interaction occurs through gestures, such as finger movements on the device surface or movement patterns of the device itself, which trigger the device functions. It remains unclear, however, whether this gesture-based interaction indeed facilitates technology interaction, especially with regard to elderly users, or whether it further decreases accessibility and usability of such devices for this user group. In the present study we compare younger and older users on a set of 42 simple gestures with varying complexity and available gesture space regarding accuracy and velocity scales. Results indicate that older users are slower, but not necessarily less accurate, and that further factors such as familiarity can influence gesture performance differentially for older and younger users.