ppxscal/embedding_network huggingface dataset:
Visual Cryptography on Graphs
Authors: Steve Lu, Daniel Manchala, Rafail Ostrovsky
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V,E) where every node and every edge are assigned an arbitrary image. Images on the vertices are "public" and images on the edges are "secret". The problem that we are considering is how to make a construction in which every vertex image is encoded and printed on a transparency, such that if two adjacent vertices' transparencies are overlapped, the secret image of their edge is revealed. We define the most stringent security guarantees for this problem (perfect secrecy) and show a general construction for all graphs where the cost (in terms of pixel expansion and contrast of the images) is dependent on the chromatic number of the cube of the underlying graph. For the case of bounded degree graphs, this gives us constant-factor pixel expansion and contrast.
A Precise Robotic Ablation and Division Mechanism for Liver Resection
Authors: Florence Leong, Liangjing Yang, Stephen Chang, Aun Neow Poo, Ichiro Sakuma, Chee-Kong Chui
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

Radiofrequency Ablation (RFA) assisted liver resection results in lesser blood loss during liver resections. It involves a time consuming and error prone process of alternating coagulation and cutting until the line of transaction is completed to finally divide the liver. We proposed a new robotic mechanism to automate the ablation and division process. The robotic device comprises a 2-link manipulator, an x-y translator, a flexi-arm as well as a liver ablation and division device. The process of precise linear motion ablation and cutting has been integrated with the guidance of a robotic mechanism to uniformly coagulate and slit areas of the parenchymal. A prototype of the robotic device has been evaluated on its ability to uniformly target a large region.
Exceptions, Generics etc.
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This chapter describes various improvements in a number of general areas in Ada 2005.There are some minor almost cosmetic improvements in the exceptions area which add to convenience rather than functionality. There are some important changes in the numerics area: one concerns mixing signed and unsigned integers and another concerns fixed point multiplication and division.There are also a number of additional pragmas and Restrictions identifiers mostly of a safety-related nature.Finally there are a number of improvements in the generics area such as better control of partial parameters of formal packages. 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
Nonholonomic antenna
Authors: Constantin Udriste, Ionel Tevy, Dorel Zugravescu, Florin Munteanu
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

This paper applies the geometric dynamics tools to describe optimal shape of structures used to couple a transmitter or receiver to a medium in which waves can propagate. Section 1 recalls the laws of regular reflection and the theory of spherical transmitter. Section 2 analizes the optic geometric dynamics using a reflected vector field and an adapted Fermat principle. Section 3 studies the transmitter of revolution and the corresponding holonomic optimal receiver. Section 4 analizes a nonholonomic Ox-symmetric transmitter (special collection of wires) and a holonomic optimal receiver. Section 5 evidentiates a Tzitzeica transmitter with a nonholonomic optimal receiver (special collection of wires). Section 6 shows that the canonical nonholonomic transmitter admits a holonomic optimal receiver. Section 7 underline possible numerical simulations for practical realization of transmitters or receivers. Section 8 points out that there exist: (i) holonomic or nonholonomic (special collection of wires) mirrors accepting only holonomic optimal receivers; (ii) holonomic or nonholonomic (collection of wires) mirrors accepting only nonholonomic (special collection of wires) optimal receivers.
Authenticating kNN Query Results in Data Publishing
Authors: Weiwei Cheng, Kian-Lee Tan
Venue: Proceedings of the 4th VLDB workshop on Secure Data Management (2007)

In data publishing model, data owners engage third-party data publishers to manage their data and process queries on their behalf. As the publishers may be untrusted or susceptible to attacks, it could produce incorrect query results. In this paper, we extend the signature-based mechanism for users to verify that their answers for k nearest neighbors queries on a multidimensional dataset are complete (i.e. no qualifying data points are omitted), authentic (i.e. no answer points are tampered) and minimal (i.e. no non-answer points are returned in the plain). Essentially, our scheme returns k answer points in the plain, and a set of ($\tilde{p}, q$)-pairs, where $\tilde{p}$ is the digest of a non-answer point p in the dataset used to facilitate the signature chaining mechanism to verify the authenticity of the answer points, and q is a reference point (not in the dataset) used to verify that p is indeed further away from the query point than the kth nearest point. We study two instantiations of the approach - one based on the native data space using space partitioning method (a.k.a. R-tree) and the other based on the metric space using iDistance. We conducted an experimental study, and report our findings here.
Image Based Visual Servoing: Estimated Image Jacobian by Using Fundamental Matrix VS Analytic Jacobian
Authors: L. Pari, J. M. Sebastián, A. Traslosheros, L. Angel
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper describes a comparative study of performance between the estimated image Jacobian that come from taking into account the geometry epipolar of a system of two cameras, and the well known analytic image Jacobian that is utilized for most applications in visual servoing. Image Based Visual Servoing architecture is used for controlling a 3 d.o.f. articular system using two cameras in eye to hand configuration. Tests in static and dynamic cases were carried out, and showed that the performance of estimated Jacobian by using the properties of the epipolar geometry is such as good and robust against noise as the analytic Jacobian. This fact is considered as an advantage because the estimated Jacobian does not need laborious previous work prior the control task in contrast to the analytic Jacobian does.
Product Lifecycle Management Systems and Business Process Improvement - A Report on Case Study Research
Authors: Raul Brandao, Martin Wynn
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

This paper explores the role of Product Life-cycle Management (PLM) systems in industry by evaluating their impact on business process improvement. In addition, future trends of these systems are also analyzed. A literature review and three case studies are used to answer specific research hypothesis, reflecting the suitability of qualitative research methods in this field. The case studies employed detailed questionnaires to support the literature review. Research findings indicate a strong correlation between PLM systems implementation and business process improvement. This is identified as a clear benefit for their deployment in engineering/manufacturing companies.
Towards an Autonomic Peer-to-Peer Middleware for Wireless Sensor Networks
Authors: Reinhard Mörgenthaler, Markus Zeller, Josef Jiru
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

In this paper we present an approach for the design of a wireless sensor network (WSN) architecture and the corresponding middleware. The middleware, with the main functions service discovery and task management, interacts with the WSN and allows an efficient collaboration of the services on top. Design criteria for a WSN architecture and the middleware are scalability, fault-tolerance and self-organization. To meet these requirements it is necessary to minimize the need for communication of a single sensor node and to distribute the functionality of a node with respect to its properties autonomously. Therefore, our system approach envisions a four layer model for the sensor network and its middleware: Two layers of sensor nodes, one layer of gateway peers and one layer of process peers. The middleware's communication model is based on a peer-to-peer approach to reduce communication complexity. Important aspects of the system are already implemented and evaluated with respect to energy consumption and message complexity.
Exploiting Term, Predicate, and Feature Taxonomies in Propositionalization and Propositional Rule Learning
Authors: Monika Žáková, Filip Železný
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Knowledge representations using semantic web technologies often provide information which translates to explicit term and predicate taxonomies in relational learning. We show how to speed up the propositionalization by orders of magnitude, by exploiting such taxonomies through a novel refinement operator used in the construction of conjunctive relational features. Moreover, we accelerate the subsequent propositional search using feature generality taxonomy, determined from the initial term and predicate taxonomies and ¿-subsumption between features. This enables the propositional rule learner to prevent the exploration of conjunctions containing a feature together with any of its subsumees and to specialize a rule by replacing a feature by its subsumee. We investigate our approach with a deterministic top-down propositional rule learner, and propositional rule learner based on stochastic local search.
Design and control of a heavy material handling manipulator for agricultural robots
Authors: Satoru Sakai, Michihisa Iida, Koichi Osuka, Mikio Umeda
Venue: Autonomous Robots (2008)

In this paper, we propose a manipulation system for agricultural robots that handle heavy materials. The structural systems of a mobile platform and a manipulator are selected and designed after proposing new knowledge about agricultural robots. Also, the control systems for these structural systems are designed in the presence of parametric perturbation and uncertainty while avoiding conservative results. The validity of both the structural and control systems is confirmed by conducting watermelon harvesting experiments in an open field. Furthermore, an explicit design procedure is confirmed for both the structural and control systems and three key design tools are clarified.
Integrating Mathematical Analysis of Sensors and Motion in a Mobile Robotics Course
Authors: Don Rhine, Fred Martin
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

We describe a series of learning modules created as part of a semester-long course, "Interactive Robotics," which was offered to 32 high school juniors and seniors in the fall of 2007. The course integrates hands-on experiences using practical mobile robots with meaningful theoretical learning. Our analysis of the learning modules focuses on the mathematical knowledge that students employed as they solved robotics problems. Through the context of these problems, students worked with concepts of base numbering systems, data analysis and curve-fitting, and analytic geometry. We demonstrate how these mathematical ideas naturally emerge from the laboratory assignments that we developed, and illustrate the nature of student thinking that is facilitated by this approach.
TALP at GeoQuery 2007: Linguistic and Geographical Analysis for Query Parsing
Authors: Daniel Ferrés, Horacio Rodríguez
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper describes our experiments and analysis of the results of our participation in the Geographical Query Parsing pilot-task for English at GeoCLEF 2007. The system uses deep linguistic analysis and Geographical Knowledge to perform the task.
FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement
Authors: Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

Although the principal analogy between counterexample generation and white box testing has been repeatedly addressed, the usage patterns and performance requirements for software testing are quite different from formal verification. Our tool FShell provides a versatile testing environment for C programs which supports both interactive explorative use and a rich scripting language. More than a frontend for software model checkers, FShell is designed as a database engine which dispatches queries about the program to program analysis tools. We report on the integration of CBMC into FShell and describe architectural modifications which support efficient test case generation.
Discriminatively Learning Selective Averaged One-Dependence Estimators Based on Cross-Entropy Method
Authors: Qing Wang, Chuan-Hua Zhou, Bao-Hua Zhao
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Averaged One-Dependence Estimators [1], simply AODE, is a recently proposed algorithm which weakens the attribute independence assumption of naïve Bayes by averaging all the probability estimates of a collection of one-dependence estimators and demonstrates significantly high classification accuracy. In this paper, we study the selective AODE problem and proposed a Cross-Entropy based method to search the optimal subset over the whole one-dependence estimators. We experimentally test our algorithm in term of classification accuracy, using the 36 UCI data sets recommended by Weka, and compare it to C4.5[5], naïve Bayes, CL-TAN[6], HNB[7], AODE and LAODE[3]. The experiment results show that our method significantly outperforms all the other algorithms used to compare, and remarkably reduces the number of one-dependence estimators used compared to AODE.
A Multiagent Control System for Shop Floor Assembly
Authors: Gonçalo Cândido, José Barata
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Current globalization associated to new customers' needs are decreasing products' life-cycle and pushing researchers to find new ways to provide shop floor assembly systems with agility to adapt to this new volatile reality. This document describes a multiagent implementation to control a shop floor system, with increased plug and play capabilities and providing fast system (re)configuration. In this approach, each shop floor component was agentified enhancing its adaptability and interaction competences to respond to environmental requests. Each agent representing a shop floor component can be aggregated to form a coalition that coordinates higher level processes (complex skills) based on the ones available in its members. An ontology is used to ensure an accurate information exchange, as well as to define the domain and relations between entities. This approach also shows how to adapt legacy systems to support innovative approaches.
Splitting the Unity, Bisecting a Graph: Applications to Stochastic Boolean Systems
Authors: Luis González
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper deals with the reliability and risk analysis of those complex systems depending on n stochastic Boolean variables. Each one of the 2 n elementary states associated to such a system is given by its corresponding binary n-tuple of 0s and 1s. A symmetric fractal graph on 2 n nodes (the so-called intrinsic order graph I n ) is used for displaying all the binary n-tuples in decreasing order of their occurrence probabilities. The successive bisections of this graph into smaller subgraphs one-to-one correspond to the successive splits of 1 as sum of the occurrence probabilities of those subgraphs. This iterative bisection process satisfies a nice property: if we replace each one of the subgraphs C (obtained after k successive bisections of the original intrinsic order graph I n ) by an unique node weighted by the sum of the probabilities of all vertices lying on C and we sort the new nodes in decreasing order of their weights, then the new condensed graph is exactly the intrinsic order graph I k . Finally, based on these results, a new algorithm for estimating the unavailability of stochastic Boolean systems is presented.
Fuzzy Subgroups with Meet Operation in the Connection of Möbius Transformations
Authors: Paavo Kukkurainen
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

Let G be any subgroup of the group of Möbius transformations and a set of stabilizers and their intersections. Taking a fuzzy subgroup of G given by means of stabilizers of G as the mapping , we examine the behaviour of the meet operation ¿ in .
Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks
Authors: Guoliang Xing, Jianping Wang, Ke Shen, Qingfeng Huang, Xiaohua Jia, Hing Cheung So
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Wireless sensor networks (WSNs) deployed for mission-critical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes with limited sensing capacity. Although advance network planning and dense node deployment may initially achieve the required performance, they often fail to adapt to the unpredictability of physical reality. This paper explores efficient use of mobile sensors to address the limitations of static WSNs in target detection. We propose a data fusion model that enables static and mobile sensors to effectively collaborate in target detection. An optimal sensor movement scheduling algorithm is developed to minimize the total moving distance of sensors while achieving a set of spatiotemporal performance requirements including high detection probability, low system false alarm rate and bounded detection delay. The effectiveness of our approach is validated by extensive simulations based on real data traces collected by 23 sensor nodes.
Developing Domain-Specific Gesture Recognizers for Smart Diagram Environments
Authors: Adrian Bickerstaffe, Aidan Lane, Bernd Meyer, Kim Marriott
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Computer understanding of visual languages in pen-based environments requires a combination of lexical analysis in which the basic tokens are recognized from hand-drawn gestures and syntax analysis in which the structure is recognized. Typically, lexical analysis relies on statistical methods while syntax analysis utilizes grammars. The two stages are not independent: contextual information provided by syntax analysis is required for lexical disambiguation. Previous research into visual language recognition has focussed on syntax analysis while relatively little research has been devoted to lexical analysis and its integration with syntax analysis. This paper describes GestureLab, a tool designed for building domain-specific gesture recognizers, and its integration with Cider, a grammar engine that uses GestureLab recognizers and parses visual languages. Recognizers created with GestureLab perform probabilistic lexical recognition with disambiguation occurring during parsing based on contextual syntactic information. Creating domain-specific gesture recognizers is not a simple task. It requires significant amounts of experimentation and training with large gesture corpora to determine a suitable set of features and classifier algorithm. GestureLab supports such experimentation and facilitates collaboration by allowing corpora to be shared via remote databases.
Technical communique: Delay-range-dependent control synthesis for time-delay systems with actuator saturation
Authors: Lixian Zhang, El-Kébir Boukas, Ahmad Haidar
Venue: Automatica (Journal of IFAC) (2008)

The control synthesis problem for a class of linear time-delay systems with actuator saturation is investigated in this paper. The time delay is considered to be time-varying and has lower and upper bounds. A delay-range-dependent approach is adopted and the corresponding existence conditions of the stabilizing state-feedback controller are derived in terms of LMIs. An estimate for the domain of attraction of the origin can be obtained for the underlying systems with different time-delay ranges. Two numerical examples are presented to show the effectiveness and less conservatism of the developed theoretical results.
Summarizing Distributed Data Streams for Storage in Data Warehouses
Authors: Raja Chiky, Georges Hébrail
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

Data warehouses are increasingly supplied with data produced by a large number of distributed sensors in many applications: medicine, military, road traffic, weather forecast, utilities like electric power suppliers etc. Such data is widely distributed and produced continuously as data streams. The rate at which data is collected at each sensor node affects the communication resources, the bandwidth and/or the computational load at the central server. In this paper, we propose a generic tool for summarizing distributed data streams where the amount of data being collected from each sensor adapts to data characteristics. Experiments done on electric power consumption real data are reported and show the efficiency of the proposed approach.
Critically sampled and oversampled complex filter banks via interleaved DFT modulation
Authors: Xiao-Long Wang, Peng-Lang Shui
Venue: Signal Processing (2008)

This paper presents a new class of complex modulated filter banks, namely, interleaved discrete Fourier transform (DFT) modulated filter banks, where analysis filter bank comprises interleaved exponentially modulated versions of two lowpass analysis prototype filters and synthesis filter bank is generated from two lowpass synthesis prototype filters in the same manner. As compared with DFT modulated filter banks, interleaved DFT modulated filter banks are more flexible in structure and provide more degrees of freedom for design. It is shown that 2M-channel critically sampled interleaved DFT modulated filter banks can be perfect reconstruction (PR) and FIR. However, critical sampling limits stopband attenuation of the filter banks. Further, we investigate the structure of oversampled interleaved DFT modulated filter banks and a bi-iterative quadratic programming algorithm is developed for designing oversampled nearly perfect reconstruction (NPR) interleaved DFT modulated filter banks. Owing to more degrees of freedom for design, oversampled interleaved DFT modulated filter banks achieve better total performance than oversampled DFT modulated filter banks do.