ppxscal/embedding_network huggingface dataset:
An Efficient Anonymous Registration Scheme for Mobile IPv4
Authors: Xuefei Cao, Weidong Kou, Huaping Li, Jie Xu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

With the develop of wireless networks, user anonymity are of growing concern. A key problem in the anonymous Mobile IP registration is how to minimize the registration delay while improve the security. This paper solves this problem by the non-interactive authentication from pairings in the identity-based cryptography. The main idea behind our scheme is to minimize both the on-line pairing operation time and the inter-domain communication round trip time based on the dynamic one-way authentication key. Analysis shows that the registration delay is reduced to 39.2001mswhile the improved security attributes including mutual tri-partite authentication, local key generation, stolen-verifier attacker and user privacy are provided in our scheme.
A NURBS-based technique for subject-specific construction of knee bone geometry
Authors: Anthony G. Au, Darren Palathinkal, Adrian B. Liggins, V. James Raso, Jason Carey, Robert G. Lambert, A. Amirfazli
Venue: Computer Methods and Programs in Biomedicine (2008)

Subject-specific finite element (FE) models of bones that form the knee joint require rapid and accurate geometry construction. The present study introduces a semi-automatic non-uniform rational B-spline (NURBS) technique to construct knee bone geometries from computed tomography (CT) images using a combination of edge extraction and CAD surface generation. In particular, this technique accurately constructs endosteal surfaces and can accommodate thin cortical bone by estimating the cortical thickness from well-defined surrounding bone. A procedure is also introduced to overcome the bifurcation at the femoral condyles during surface generation by combining transverse and sagittal plane CT data. Available voxel- and NURBS-based subject-specific construction techniques accurately capture periosteal surfaces but are limited in their ability to capture endosteal geometry. In this study, the proposed NURBS-based technique and a typical voxel mesh technique captured periosteal surfaces within an order of magnitude of image resolution. The endosteum of diaphyseal bone was also captured with similar accuracy by both techniques. However, the voxel mesh model failed to accurately capture the metaphyseal and epiphyseal endosteum due to the poor CT contrast of thin cortical bone, resulting in gross overestimation of cortical thickness. The proposed technique considered both the local and global nature of CT images to arrive at a description of cortical bone thickness accurate to within 2 pixel lengths.
Path Propagation for Inference in Bayesian Networks
Authors: Dan Wu, Liu He
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

Although (probabilistic) inference in Bayesian networks has been well studied, the recent trend on extending Bayesian networks to model large and complex domains imposes new challenges on inference. In this paper, we suggest a method called path propagation that addresses these new challenges. The experimental results indicate that the proposed method achieves better performance than conventional method, especially for large Bayesian networks.
Monoculture
Authors: Daniel E. Geer Jr., Dave Aucsmith, James A. Whittaker
Venue: IEEE Security and Privacy (2003)

A recent position paper on software monocultures has generated heated discussions about whether monocultures exist and what the portend for us. Dan Geer and Dave Aucsmith address some of the issues in a Point/Counterpoint exchange while James Whittaker offers another perspective on the monoculture debate.
Packing Rectangles into 2OPT Bins Using Rotations
Authors: Rolf Harren, Rob Stee
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles can be rotated by 90 degrees and have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided $\mathcal{P} \not= \mathcal{NP}$.
Immersidata Analysis: Four Case Studies
Authors: Cyrus Shahabi, Tim Marsh, Kiyoung Yang, Hyunjin Yoon, Albert A. Rizzo, Margaret McLaughlin, Minyoung Mun
Venue: Computer (2007)

Four real-world case studies demonstrate the effectiveness of using immersidata--the normally untapped data from interchanges between users and immersive 3D environments such as computer games and virtual reality--to help understand user behavior and experiences.
Neural Network Device for Reliability and Functional Analysis of Discrete Transport System
Authors: Tomasz Walkowiak, Jacek Mazurkiewicz
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper describes an approach of combining Monte Carlo simulation and neural nets. The approach is applied to model transport systems, with the accurate but computationally expensive Monte Carlo simulation used to train a neural net. Once trained the neural net can efficiently provide functional analysis and reliability predictions. No restriction on the system structure and on any kind of distribution is the main advantage of the proposed approach. The paper presents exemplar decision problem solved by proposed approach.
Smart Sensing and Sensor Data Collection on the Move for Modelling Intelligent Environments
Authors: Prem Prakash Jayaraman, Arkady Zaslavsky, Jerker Delsing
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

With advent of pervasive computing and considerable acceptance of sensor networks, smart sensing techniques and data collection have been topics of interest. This paper presents a smart sensing and data collection technique from sensor networks using context aware high powered mobile objects within the environment. The paper proposes CAM-R a context aware robot that can move within smart environments sensing new sensor sources and collecting sensory originated data efficiently. Based on these sensed data sources, we propose an extension to context spaces model that builds a virtual model of the intelligent environment. This intelligent environment model built using extended context spaces can be used by number of context aware applications to efficiently query and retrieve data from the sensor network using CAM-R based data collection approach. We also present a prototype implementation of CAM-R built using off-the-shelf hardware and a context based cost function used to compute data collection decisions. We validate our system by implementing the virtual modelling of the intelligent environment based on simulated input obtained from CAM-R and sensors. We also evaluate CAM-Rby simulating and comparing the energy spent by the sensor nodes during data collection process using our proposed approach and traditional fixed sink based approach.
Lead-me interface for a pulling sensation from hand-held devices
Authors: Tomohiro Amemiya, Hideyuki Ando, Taro Maeda
Venue: ACM Transactions on Applied Perception (TAP) (2008)

When a small mass in a hand-held device oscillates along a single axis with asymmetric acceleration (strongly peaked in one direction and diffuse in the other), the holder typically experiences a kinesthetic illusion characterized by the sensation of being continuously pushed or pulled by the device. This effect was investigated because of its potential application to a hand-held, nongrounded, haptic device that can convey a sense of a continuous translational force in one direction, which is a key missing piece in haptic research. A 1 degree-of-freedom (DOF) haptic device based on a crank-slider mechanism was constructed. The device converts the constant rotation of an electric motor into the constrained movement of a small mass with asymmetric acceleration. The frequency that maximizes the perceived movement offered by the haptic device was investigated. Tests using three subjects showed that for the prototype, the best frequencies were 5 and 10 cycles per second.
Modeling mobile agent behavior
Authors: Seong-Hwan Kim, T. G. Robertazzi
Venue: Computers Mathematics with Applications (2006)

Mobile agents have been proposed for collecting and processing network management information in the Internet and other networks. This paper presents fundamental analytical stochastic models of mobile agent behavior for mobile agent design. The significance of these models is in their utility and flexibility. Models discussed include ones of agent dwell time, agent life span for various cloning scenarios, agent report statistics, and quality of service.reserved.
Querying Clinical Workflows by Temporal Similarity
Authors: Carlo Combi, Matteo Gozzi, Jose M. Juarez, Roque Marin, Barbara Oliboni
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

The degree of fulfillment of clinical guidelines is considered a key factor when evaluating the quality of a clinical service. Guidelines can be seen as processes describing the sequence of activities to be done. Consequently, workflow formalisms seem to be a valid approach to model the flow of actions in the guideline and their temporal aspects. The application of a guideline to a specific patient (guideline instance) can be modeled by means of a workflow case. The best (worst) application of a guideline, represented as a reference workflow case, can be used to evaluate the quality of the service, by comparing the optimal case with specific patient instances. On the other hand, the correct application of a guideline to a patient involves the fulfillment of the guideline temporal constraints. Thus, the evaluation of the temporal similarity degree between different workflow cases is a key aspect in evaluating health care quality. In this work, we represent a portion of the stroke guideline using a temporal workflow schema and we propose a method to evaluate the temporal similarity between workflow cases. Our proposal, based on temporal constraint networks, consists of a linear combination of functions to differentiate intra-task and inter-task temporal distances.
Tampered Image Detection Using Image Matching
Authors: Zhenghao Li, A. Y. C. Nee, S. K. Ong, Weiguo Gong
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

With the development of image processing software, such as Photoshop, scientific analysis for detecting tampered images becomes a critical research issue. A hybrid image matching algorithm for image analysis is proposed and evaluated. Features are extracted using blob detectors and interest point detectors. This combination ensures sufficient correspondences in small image patches while maintaining high accuracy. Nearest neighbors are searched using hybrid spill tree in order to reduce the computational load. Applying the algorithm to tampered image detection, a novel solution is proposed utilizing the scale space information and gradient orientation information from the corresponding features. Furthermore, an order regularity of scale space between the corresponding patches and a description for object rotation are also proposed. In addition, we conducted experiments on tampered images, proving the method to be powerful.
The Rickel Gaze Model: A Window on the Mind of a Virtual Human
Authors: Jina Lee, Stacy Marsella, David Traum, Jonathan Gratch, Brent Lance
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Gaze plays a large number of cognitive, communicative and affective roles in face-to-face human interaction. To build a believable virtual human, it is imperative to construct a gaze model that generates realistic gaze behaviors. However, it is not enough to merely imitate a person's eye movements. The gaze behaviors should reflect the internal states of the virtual human and users should be able to derive them by observing the behaviors. In this paper, we present a gaze model driven by the cognitive operations; the model processes the virtual human's reasoning, dialog management, and goals to generate behaviors that reflect the agent's inner thoughts. It has been implemented in our virtual human system and operates in real-time. The gaze model introduced in this paper was originally designed and developed by Jeff Rickel but has since been extended by the authors.
A Certificateless Signature Scheme for Mobile Wireless Cyber-Physical Systems
Authors: Zhong Xu, Xue Liu, Guoqing Zhang, Wenbo He, Guanzhong Dai, Weihuan Shu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Due to the unique characteristics of Cyber-Physical Systems (CPS) such as interaction with the physical world, many new research challenges arise. Many CPS applications will be implemented on computing devices using mobile ad hoc networks (MANETs). Before these systems can be used in multifarious environments, the security properties of these networks must be fully understood. Recently, several secure signature schemes for MANETs have been proposed based on public key cryptography and identity-based cryptography. In order to solve some problems in these schemes, such as the costly and complex key management problem in traditional public key cryptography and the “key escrow” problem in identity-based cryptography, the notion of certificateless public key cryptography was introduced. In this paper, we propose an efficient certificateless signature scheme for mobile wireless cyberphysical systems (McCLS) based on the bilinear Diffie-Hellman assumption. Empirical studies are conducted using QualNet to evaluate the effectiveness and efficiency of McCLS scheme under two most common attacks, i.e. black hole attack and rushing attack. Results show that McCLS scheme is more efficient than existing solutions and is able to resist these two kinds of attacks.
A Real Time Simulation of Flood Hazard
Authors: Jasrul Nizam Ghazali, Amirrudin Kamsin
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Kuala Lumpur city is located at the confluence of two rivers and are flood prone area. With rapid development and uncontrolled town planning, the city had experience several major flash flood incidents and have caused tremendous damage to country. This research describes a study made to model and simulate the flash flood incident that struck Kuala Lumpur on 10 June 2007 using 3D Computer Graphic and fluid simulation techniques. The aim is to examine the stability and effectiveness of this approach as a solution tool for environmental hazard studies. Particle-Based method used to model the fluid objects using MAYA software. Light Detection and Ranging (LIDAR) data and remote sensing imagery were used to model the study area. The main contribution of this study is the introduction of this approach to enhance realistic visualization for environmental studies thus enable better planning and countermeasures created to prevent the disaster.
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
Authors: Glencora Borradaile, Philip Klein
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Consider the following problem: given a graph with edge-weights and a subset Q of vertices, find a minimum-weight subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient analog of the Steiner tree problem, and arises in telecommunications applications. A more general formulation, also employed in telecommunications optimization, assigns a number (or requirement) rv &epsilon; {0,1,2} to each vertex v in the graph; for each pair u,v of vertices, the solution network is required to contain min{ru, rv} edge-disjoint u-to-v paths. We address the problem in planar graphs, considering a popular relaxation in which the solution is allowed to use multiple copies of the input-graph edges (paying separately for each copy). The problem is SNP-hard in general graphs and NP-hard in planar graphs. We give the first polynomial-time approximation scheme in planar graphs. The running time is O(n logn). Under the additional restriction that the requirements are in {0,2} for vertices on the boundary of a single face of a planar graph, we give a linear-time algorithm to find the optimal solution.
Coming of Age in Second Life: An Anthropologist Explores the Virtually Human
Authors: Tom Boellstorff
Venue:  (2008)

Millions of people around the world today spend portions of their lives in online virtual worlds. Second Life is one of the largest of these virtual worlds. The residents of Second Life create communities, buy property and build homes, go to concerts, meet in bars, attend weddings and religious services, buy and sell virtual goods and services, find friendship, fall in love--the possibilities are endless, and all encountered through a computer screen. Coming of Age in Second Life is the first book of anthropology to examine this thriving alternate universe. Tom Boellstorff conducted more than two years of fieldwork in Second Life, living among and observing its residents in exactly the same way anthropologists traditionally have done to learn about cultures and social groups in the so-called real world. He conducted his research as the avatar "Tom Bukowski," and applied the rigorous methods of anthropology to study many facets of this new frontier of human life, including issues of gender, race, sex, money, conflict and antisocial behavior, the construction of place and time, and the interplay of self and group. Coming of Age in Second Life shows how virtual worlds can change ideas about identity and society. Bringing anthropology into territory never before studied, this book demonstrates that in some ways humans have always been virtual, and that virtual worlds in all their rich complexity build upon a human capacity for culture that is as old as humanity itself.
A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes
Authors: Novak Novaković
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Hybrid $\cal EL$-TBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept definitions, which are interpreted with greatest fixpoint (gfp) semantics. We introduce a proof-theoretic approach that yields a polynomial-time decision procedure for subsumption, and present a proof-theoretic computation of least common subsumers in $\cal EL$ w.r.t. hybrid TBoxes. 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
Formal techniques used in encrypting systems
Authors: Mircea Iosif Neamtu
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

The purpose of this article is to defy an information-hiding system based on grammars type LR(k), in terms of its component elements: the set of clear text, the set of encrypted text, the key-set, and the encrypting/decrypting functions. Also, a theoretical result concerning system safety will be presented.
A New Multi-class SVM Algorithm Based on One-Class SVM
Authors: Xiao-Yuan Yang, Jia Liu, Min-Qing Zhang, Ke Niu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Multi-class classification is an important and on-going research subject in machine learning and data mining. In this paper, we propose a new support vector algorithm, called OC-K-SVM, for multi-class classification based on one-class SVM. For k-class problem, this method constructs k classifiers, where each one is trained on data from one class. OC-K-SVM has parameters that enable us to control the number of support vectors and margin errors effectively, which is helpful in improving the accuracy of each classifier. We give some theoretical results concerning the significance of the parameters and show the robustness of classifiers. In addition, we have examined the proposed algorithm on several benchmark data sets, and our preliminary experiments confirm our theoretical conclusions.
A Novel Feature Vector Using Complex HRRP for Radar Target Recognition
Authors: Lan Du, Hongwei Liu, Zheng Bao, Feng Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Radar high-resolution range profile (HRRP) has received intensive attention from the radar automatic recognition (RATR) community. Since the initial phase of a complex HRRP is strongly sensitive to target position variation, which is referred to as the initial phase sensitivity, only the amplitude information in the complex HRRP, what is called the real HRRP, is used for RATR. This paper proposes a novel feature extraction method for the complex HRRP. The extracted complex feature vector contains the difference phase information between range cells but no initial phase information in the complex HRRP. The recognition algorithms, frame-template-database establishment methods and preprocessing methods used in the real HRRP-based RATR can also be applied to the proposed complex feature vector-based RATR. The recognition experiments based on measured data show that the proposed complex feature vector can obtain better recognition performance than the real HRRP if only the cell interval parameters are proper.
Ugo Montanari and Graph Transformation
Authors: Andrea Corradini
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Graphs are widely exploited in several fields of computer science (as well as in other disciplines) to represent in a direct and adequate way the structure of the states of a system, making it easily understandable also to a non-technical audience. In many situations, the behaviour of such systems can be specified faithfully with a rule-based approach. A graph rule describes how a state can evolve into another state by replacing a sub-state matching the left-hand side of the rule with its right-hand side.
Nonlinear adaptive control of a two-vehicle autonomous convoy using a look-ahead approach
Authors: Plamen Petrov, Ognian Boumbarov
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

This paper proposes an adaptive tracking controller for a two-vehicle convoy. We consider autonomous vehicle following without any information obtained from road infrastructure or communicated from the lead vehicle. We assume that the lead vehicle linear and angular velocities, as well the curvature radius of the path traveled by the lead vehicle, are unknown constant parameters. The only information the robot vehicle can use for feedback control is the relative position and orientation with respect to the lead vehicle obtained from onboard sensing. The control velocities of the following vehicle are computed using the leader velocity estimates obtained from the dynamic (adaptive) part of the proposed controller. For constant velocity maneuvers of the leader, at steady state, the two-vehicle convoy will travel concentric arcs of same radii with prescribed inter-vehicle spacing. Simulation results are presented to illustrate the effectiveness of the proposed controller.