ppxscal/embedding_network huggingface dataset:
A Toponym Resolution Service Following the OGC WPS Standard
Authors: Susana Ladra, Miguel R. Luaces, Oscar Pedreira, Diego Seco
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

In the research field of Geographic Information Systems (GIS), a cooperative effort has been undertaken by several international organizations to define standards and specifications for interoperable systems. The Web Processing Service (WPS) is one of the most recent specifications of the Open Geospatial Consortium (OGC). It is designed to standardize the way that GIS calculations are made available to the Internet.We present in this paper a WPS to perform Toponym Resolution. This service defines two geospatial operations. The first operation, getAll, returns all possible geographic descriptions with the requested name ordered by a relevance ranking. The second operation, getMostProbable, filters the result and returns only the most probable geographic description. Furthermore, both operations can be parameterized according to the level of detail needed in the result.
Man-in-the-Middle Attack to the HTTPS Protocol
Authors: Franco Callegati, Walter Cerroni, Marco Ramilli
Venue: IEEE Security and Privacy (2009)

As defenders, it is extremely dangerous to be ignorant of how attackers can disrupt our systems. Without a good understanding of the relative ease of certain attacks, it's easy to adopt poor policies and procedures. A good example of this is the tendency for some organizations to use invalid or "self-signed" certifications for SSL, an approach that both trains the user to ignore certificate warnings displayed by the browser and leaves connections vulnerable to man in the middle attacks. In this article, we illustrate how easy such attacks are to execute; we hope this will serve as an incentive to adopt defenses that not only seem secure, but actually are!
A Design-Oriented Information-Flow Refinement of the ASUR Interaction Model
Authors: Emmanuel Dubois, Philip Gray
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

The last few years have seen an explosion of interaction possibilities opened up by ubiquitous computing, mobile devices, and tangible interaction. Our methods of modelling interaction, however, have not kept up. As is to be expected with such a rich situation, there are many ways in which interaction might be modelled, focussing, for example, on user tasks, physical location(s) and mobility, data flows or software elements. In this paper, we present a model and modelling technique intended to capture key aspects of user's interaction of interest to interactive system designers, at the stage of requirements capture and early design. In particular, we characterise the interaction as a physically mediated information exchange, emphasizing the physical entities involved and their relationships with the user and with one another. We apply the model to two examples in order to illustrate its expressive power.
HIREL: An Incremental Clustering Algorithm for Relational Datasets
Authors: Tao Li, Sarabjot S. Anand
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Traditional clustering approaches usually analyze static datasets in which objects are kept unchanged after being processed, but many practical datasets are dynamically modified which means some previously learned patterns have to be updated accordingly. Re-clustering the whole dataset from scratch is not a good choice due to the frequent data modifications and the limited out-of-service time, so the development of incremental clustering approaches is highly desirable. Besides that, propositional clustering algorithms are not suitable for relational datasets because of their quadratic computational complexity. In this paper, we propose an incremental clustering algorithm that requires only one pass of the relational dataset. The utilization of the Representative Objects and the balanced Search Tree greatly accelerate the learning procedure. Experimental results prove the effectiveness of our algorithm.
Query representation by structured concept threads with application to interactive video retrieval
Authors: Dong Wang, Zhikun Wang, Jianmin Li, Bo Zhang, Xirong Li
Venue: Journal of Visual Communication and Image Representation (2009)

In this paper, we provide a new formulation for video queries as structured combination of concept threads, contributing to the general query-by-concept paradigm. Occupying a low-dimensional region in the concept space, concept thread defines a ranked list of video documents ordered by their combined concept predictions. This localized representation incorporates the previous concept based formulation as a special case and extends the restricted AND concept combination logic to a two-level concept inference network. We apply this new formulation to interactive video retrieval and utilize abundant feedback information to mine the latent semantic concept threads for answering complex query semantics. Simulative experiments which are conducted on two years' TRECVID data sets with two sets of concept lexicons demonstrate the advantage of the proposed formulation. The proposed query formulation offers some 60% improvements over the simple browsing search baseline in nearly real time. It has clear advantages over c-tf-idf and achieves better results over the state-of-the-art online ordinal reranking approach. Meanwhile, it not only alleviates user's workload significantly but also is robust to user mislabeling errors.
Ontology-based framework in e-Learning settings
Authors: Iulian Pah, Daniel Hunyadi, Emil M. Popa
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

This paper presents an ontology-based framework aimed at explicit representation of context-specific metadata derived from the actual usage of learning objects and learning designs. The core part of the proposed framework is a learning object context ontology, that leverages a range of other kinds of learning ontologies (e.g., user modeling ontology, domain ontology, and learning design ontology) to capture the information about the real usage of a learning object inside a learning design. We also present some learner-centered and teacher-centered scenarios enabled by the proposed framework in order to illustrate the benefits the framework offers to these key participants of any learning process.
Research on the Multi-sensors Information Fusion Technique Based on the Neural Networks and its Application
Authors: Minghu Zhang, Hui Song, Shijun Lv, Youfeng Li, Xiaojuan Yu, Jingyang Bao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Multi-sensors Information Fusion (MSIF) technology, is being widely applied to various fields, particularly, the modern military field. In order to enhance the capability of ship chemical defense support in the future informationalization sea warfare, a review of the study and application about MSIF technology in Naval Ships Chemical Detection (NSCD) field is researched, the model of NSCD system based on MSIF is built. Its measure system based on multi-sensors fusion could catch the wide information of the chemical agents, carry the feature extraction and selection of the chemical agents through wavelet analysis, then make the best of the Neural Networks to manage the data from multi-sensors system, thus the Neural Networks Distinguishing Chemical Agents (NNDCA) model is built. The realization idea of the NNDCA system is put forward, and the hardware accomplishment and the software structure of the NNDCA system are discussed. The experimental and emulational results show that: it is entirely feasible that using the NNDCA model put up the qualitative and quantitative analysis of the chemical agents; the NNDCA model is capable of, in a great measure, playing down the impact factor of the disturber, concentration and condition, and so on, to measure the chemical agents, as a result, remarkably, the veracity and creditability of measure effect is heightened.
Bio-inspired visual attention in agile sensing for target detection
Authors: Jing Liu, Yang Xiao, Qi Hao, Kaveh Ghaboosi
Venue: International Journal of Sensor Networks (2009)

In the context of surveillance, visual attention is referred to as an ability to rapidly locate the most salient or relevant target in biological or artificial vision systems. To support the basic research leading to determination of the principles on which humans and animals accomplish agile sensing, a survey of bio-inspired visual attention in target detection is presented in this paper. We first discuss some relevant fundamental concepts and techniques. Then several up-to-date algorithms and implementations are introduced in either bottom-up or top-down mechanisms. This paper also gives a tutorial for the existing researches and provides future challenges.
Flexible and efficient querying and ranking on hyperlinked data sources
Authors: Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa Raschid, Maria-Esther Vidal, Luis Ibáñez, Héctor Rodríguez-Drumond
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this data into browsable knowledge. We propose the Graph Information Discovery (GID) framework to support sophisticated user queries on a rich web of annotated and hyperlinked data entries, where query answers need to be ranked in terms of some customized ranking criteria, e.g., PageRank or ObjectRank. GID has a data model that includes a schema graph and a data graph, and an intuitive query interface. The GID framework allows users to easily formulate queries consisting of sequences of hard filters (selection predicates) and soft filters (ranking criteria); it can also be combined with other specialized graph query languages to enhance their ranking capabilities. GID queries have a well-defined semantics and are implemented by a set of physical operators, each of which produces a ranked result graph. We discuss rewriting opportunities to provide an efficient evaluation of GID queries. Soft filters are a key feature of GID and they are implemented using authority flow ranking techniques; these are query dependent rankings and are expensive to compute at runtime. We present approximate optimization techniques for GID soft filter queries based on the properties of random walks, and using novel path-length-bound and graph-sampling approximation techniques. We experimentally validate our optimization techniques on large biological and bibliographic datasets. Our techniques can produce high quality (Top K) answers with a savings of up to an order of magnitude, in comparison to the evaluation time for the exact solution.
Fast communication: On maximum likelihood estimation in factor analysis-An algebraic derivation
Authors: Petre Stoica, Magnus Jansson
Venue: Signal Processing (2009)

The maximum likelihood estimate in factor analysis is typically obtained as the solution of the stationary point equation of the likelihood function. This type of derivation suffers from two problems: it is rather cumbersome and, in fact, it is incomplete as it does not include a proof that the so-obtained estimate is indeed a global maximum point of the likelihood function. In this note we present a simple algebraic derivation of the maximum likelihood estimate in factor models with spherical noise that applies to the general complex-valued data case.
Metadata generation and consolidation within an ontology-based document management system
Authors: Annett Mitschick, Klaus Meissner
Venue: International Journal of Metadata, Semantics and Ontologies (2008)

A central issue for the benefit and success of an ontology-based personal document management system is its capability to automatically model appropriate and valid document descriptions. The generation process primarily depends on the application context and should be customised accordingly. Furthermore, automatically generated information needs appropriate cleaning and consolidation to maintain a certain level of data quality. Therefore, this paper presents a semantic document management system which applies a stepwise knowledge modelling process. Our approach separately addresses the problems of general translation of diverse information sources, syntax check, normalisation and duplication and conflict handling, based on consecutive and configurable stages.
Event-based topology for dynamic planar areal objects
Authors: Jixiang Jiang, Michael Worboys
Venue: International Journal of Geographical Information Science (2009)

Representation and reasoning about dynamic spatial phenomena requires at its foundation a formalism of spatial change. This paper extends our understanding of topological change, by providing a classification and analysis of events associated with changes in topological structures of spatial areal objects as they evolve through time. Tree structures are employed to represent topological relationships between regions and holes of areal objects. Basic and complex changes are specified using structure-preserving mappings between trees. Furthermore, the paper constructs a normal form, and proves that it is the 'simplest' form that can represent all the changes under consideration.
Grid Enabled Remote Instrumentation, 3rd edition
Authors: Franco Davoli, Norbert Meyer, Roberto Pugliese, Sandro Zappatore
Venue: Signals And Communication Technology (2008)

Grid architectures, which are viewed as tools for the integration of distributed resources, play a significant role as both managers of computational resources but also as aggregators of measurement instrumentation and pervasive large-scale data acquisition platforms. The functionality of a grid architecture allows managing, maintaining, and exploiting hetereogeneous instrumentation and acquisition devices in a unifed way by providing standardized interfaces and common work environments to their users. This result is achieved through the properties of isolation from the physical network and from the peculiarites of the isntrumentation granted by standard middleware together with secure and flexibile mechanisms which seek, access, and aggregate distributed resources. This book focuses on a number of aspects related to the effective exploitation of remote instrumentation on the grid. These include middleware architecture, high speed networking in support of grid applications, wireless grid for acquisition devices and sensor networks, quality of service provisioning for real time control, and measurement instrumentation.
Partial-Band Jamming Suppression with a Noncoherent CPM Detector
Authors: Geng Wang, Qiang Li, Shaoqian Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we proposed a partial-band jamming suppression algorithm especially for a slow frequency hopping system. In this system, continuous phase modulation (CPM) is adopted, and the algorithm is based on the iterative noncoherent CPM detection and the jamming state information (JSI) estimation. The complexity of the system is reduced by iterative tree search scheme rather than the exhaustive tree search and multiple symbol differential detector (MSDD) schemes. The simulation results demonstrate that the algorithm performs well for the partial-band jamming suppression. Moreover, the difference of the performances due to varieties of demodulation parameters is discussed.
Seamless patches for GPU-based terrain rendering
Authors: Yotam Livny, Zvi Kogan, Jihad El-Sana
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

In this paper we present a novel approach for interactive rendering of large terrain datasets. Our approach is based on subdividing a terrain into rectangular patches at different resolutions. Each patch is represented by four triangular tiles that are selected form different resolutions, and four strips which are used to stitch the four tiles in a seamless manner. Such a scheme maintains resolution changes within patches through the stitching strips, and not across patches. At runtime, these patches are used to construct a level-of-detail representation of the input terrain based on view-parameters. A selected level of detail only includes the layout of the patches and their boundary edges resolutions. The layout includes the location and dimension of each patch. Within the graphics hardware, the GPU generates the meshes of the patches by using scaled instances of cached tiles and assigns elevation for each vertex from cached textures. Since adjacent rectangular patches agree on the resolution of the common edges, the resulted mesh does not include cracks or degenerate triangles. Our algorithm manages to achieve quality images at high frame rates while providing seamless transition between different levels of detail.
An inexpensive hand-eye system for undergraduate robotics instruction
Authors: Glenn V. Nickens, Ethan J. Tira-Thompson, Thorna Humphries, David S. Touretzky
Venue: ACM SIGCSE Bulletin (2009)

Hand-eye systems combine computer vision with kinematics and dynamics calculations to achieve dexterous manipulation. These versatile platforms for teaching robotics principles have not been widely used in undergraduate laboratories due to cost. We describe a new hand-eye system constructed from Robotis Dynamixel servos, a USB interface module, and a webcam, that can be built for under $500 and run by a PC using the Tekkotsu open source software framework. A suggested curriculum is outlined.
RDL pre-assignment routing for flip-chip designs
Authors: Jin-Tai Yan, Zhi-Wei Chen
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Based on the concept of net renumbering and recovery to simplify the complexity of the global and detailed routing, an efficient RDL pre-assignment routing algorithm is proposed to maximize the number of routed nets with the minimization of total wirelength under the crossing and capacitance constraints for a flip-chip design. Compared with the combination of the single-layer BGA global router[6] and our detailed routing, our RDL pre-assignment router reduces the global wirelength by 12.8% after global routing and improve the routability by 14.7% after detailed routing on the average for some tested circuits in reasonable CPU time.
A Non-parametric Semi-supervised Discretization Method
Authors: A. Bondu, M. Boulle, V. Lemaire, S. Loiseau, B. Duval
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Semi-supervised classification methods aim to exploit labelled and unlabelled examples to train a predictive model. Most of these approaches make assumptions on the distribution of classes. This article first proposes a new semi-supervised discretization method which adopts very low informative prior on data. This method discretizes the numerical domain of a continuous input variable, while keeping the information relative to the prediction of classes. Then, an in-depth comparison of this semi-supervised method with the original supervised MODL approach is presented. We demonstrate that the semi-supervised approach is asymptotically equivalent to the supervised approach, improved with a post-optimizationof the intervals bounds location.
A Scalable Memory Model for Low-Level Code
Authors: Zvonimir Rakamarić, Alan J. Hu
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

Because of its critical importance underlying all other software, low-level system software is among the most important targets for formal verification. Low-level systems software must sometimes make type-unsafe memory accesses, but because of the vast size of available heap memory in today's computer systems, faithfully representing each memory allocation and access does not scale when analyzing large programs. Instead, verification tools rely on abstract memory models to represent the program heap. This paper reports on two related investigations to develop an accurate (i.e., providing a useful level of soundness and precision) and scalable memory model: First, we compare a recently introduced memory model, specifically designed to more accurately model low-level memory accesses in systems code, to an older, widely adopted memory model. Unfortunately, we find that the newer memory model scales poorly compared to the earlier, less accurate model. Next, we investigate how to improve the soundness of the less accurate model. A direct approach is to add assertions to the code that each memory access does not break the assumptions of the memory model, but this causes verification complexity to blow-up. Instead, we develop a novel, extremely lightweight static analysis that quickly and conservatively guarantees that most memory accesses safely respect the assumptions of the memory model, thereby eliminating almost all of these extra type-checking assertions. Furthermore, this analysis allows us to create automatically memory models that flexibly use the more scalable memory model for most of memory, but resorting to a more accurate model for memory accesses that might need it.
An affective guide robot in a shopping mall
Authors: Takayuki Kanda, Masahiro Shiomi, Zenta Miyashita, Hiroshi Ishiguro, Norihiro Hagita
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

To explore possible robot tasks in daily life, we developed a guide robot for a shopping mall and conducted a field trial with it. The robot was designed to interact naturally with customers and to affectively provide shopping information. It was also designed to repeatedly interact with people to build a rapport; since a shopping mall is a place people repeatedly visit, it provides the chance to explicitly design a robot for multiple interactions. For this capability, we used RFID tags for person identification. The robot was semi-autonomous, partially controlled by a human operator, to cope with the difficulty of speech recognition in a real environment and to handle unexpected situations. A field trial was conducted at a shopping mall for 25 days to observe how the robot performed this task and how people interacted with it. The robot interacted with approximately 100 groups of customers each day. We invited customers to sign up for RFID tags and those who participated answered questionnaires. The results revealed that 63 out of 235 people in fact went shopping based on the information provided by the robot. The experimental results suggest promising potential for robots working in shopping malls.