ppxscal/embedding_network huggingface dataset:
Management of data sources and services in pervasive environments
Authors: Yann Gripay, Frédérique Laforest, Jean-Marc Petit, Liya Zeng
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Our daily environment contains more and more computerized devices, and tends to become a pervasive environment. Pervasive applications allow the end user to use a large number of heterogeneous devices, potentially invisible to him/her. To manage such kinds of applications, a distributed and modular architecture is required to handle the devices heterogeneity and their dynamicity, concerning their availability as well as the nature of data and services they can provide. In this article, we propose an architecture integrated in our SoCQ project [16] that builds an abstraction of the environment and thus simplifies the development of pervasive applications based on this abstraction. We also detail the current implementation of our architecture that includes the use of the UPnP technology.
Practical Issues in Detecting Broken Social Commitments
Authors: Jason Heard, Rob Kremer
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

An open system should admit agents from many sources and these agents may have conflicting goals. Therefore, some actions that an agent would like to perform could be detrimental to other agents. Such actions can be either acceptable or unacceptable within a given system. Social norms define what actions are acceptable and unacceptable within a given society. There should be a way to limit the actions of agents to enforce these social norms. One way to begin to accomplish this goal is to have the system observe the actions of agents to model their behaviour. Behaviours that do not conform to specified norms could then be detected, and some action could be taken to prevent agents from performing further actions that violate social norms.In this paper we discuss the use of social commitments to allow a system to define social norms and detect violations of those norms. Social commitments model an agent's commitments within a society. Some are implied while others are explicitly stated. Our system uses social commitments to define social norms. This paper focusses on the practical requirements that must be met for a system to implement social commitments as a way of defining social norms and detecting violations of those norms. In addition, we give an overview of how our multi-agent system design supports this goal.
Orientation Recognition of Iris Pattern
Authors: Takeshi Kawasaki, Hironobu Takano, Kiyomi Nakamura
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

An iris recognition system that employs a rotation spreading neural network (R-SAN net) has been proposed. R-SAN net is suitable for the orientation recognition of concentric circular patterns such as the iris pattern. The orientation recognition characteristics of R-SAN net for the iris pattern have been investigated. However, it has not yet been understood how the orientation recognition performance of R-SAN net is better than that of other methods employed for orientation recognition.In this study, we evaluated the effectiveness of the orientation recognition performance of R-SAN net by comparing its orientation recognition characteristics with those of the moment (MO) method. The standard deviation of the orientation recognition error in the MO method is larger than that in R-SAN net. For an arbitrary input orientation, R-SAN net showed a fairly good orientation recognition performance as compared to the MO method.
Accessible Graphics in Web Applications: Dynamic Generation, Analysis and Verification
Authors: Kerstin Altmanninger, Wolfram Wöß
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Accessibility for graphics in web applications is still not only a shortcoming for visually impaired people but may also be a request of people with other special needs. In the Access2Graphics project SVG (Scalable Vector Graphics) is used to dynamically generate graphics that are adapted to the user's individual requirements in order to make them accessible for each user. Beside the users also the graphics designer (provider) need support to be able to offer accessible graphics. The focus of this paper therefore mainly is on introducing the analysis as well as the verification component of Access2Graphics. Both, reuse of existing graphics and verification with respect to defined guidelines should make the generation process of graphics more efficient regarding the development time and quality.
The Grain Family of Stream Ciphers
Authors: Martin Hell, Thomas Johansson, Alexander Maximov, Willi Meier
Venue: New Stream Cipher Designs: The eSTREAM Finalists (2008)

A new family of stream ciphers, Grain, is proposed. Two variants, a 80-bit and a 128-bit variant are specified, denoted Grain and Grain-128 respectively. The designs target hardware environments where gate count, power consumption and memory are very limited. Both variants are based on two shift registers and a nonlinear output function. The ciphers also have the additional feature that the speed can be easily increased at the expense of extra hardware.
Graph theory-based approach for automatic recognition of CAD data
Authors: H. C. Huang, S. M. Lo, G. S. Zhi
Venue: Engineering Applications of Artificial Intelligence (2008)

CAD architectural plans basically contain original geometrical information of graphical primitives. However, in many applications, such as building's 3D reconstruction, auto-detecting errors of design, original CAD data are very hard to be directly utilized. It is always a time-consuming and exhaustive task to extract useful information like the coordinates of a line from CAD files. To make this task performed in more efficient way, a way to develop an automatic method to extract spatial information from architectural plans produced in the form of computer-drawn CAD drawings is proposed in this article. The aim of the proposed method is to provide automatic transformation of architectural drawings into the spatial and topological information of the enclosure in a building. To auto-understand the 'meaning' of the graphic elements in the drawings such as walls, doors and rooms, the approach employs algorithms in graph theory, which can identify every functional component in the enclosure and establish their connectivity relationships. The method has been implemented by using object-oriented C++ language and is found to be able to produce satisfying results.
Designing and Developing Process-Oriented Network Courseware: IMS Learning Design Approach
Authors: Yue-Liang Zhou, Jian Zhao
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

How to design and develop high quality and reusable network courseware has got more and more attention. The existing standard has obtained preliminary achievement. However, IMS Learning Design (LD) can become a new kind of approach. It can transfer the emphasis of network courseware from object-oriented to process-oriented. Based on the introduction of IMS Learning Design, this paper proposed the idea of using LD to design process-oriented network courseware, then a concrete model which use IMS LD tool to develop courseware was provided.
Research of New Learning Method of Feedforward Neural Network
Authors: Jinghong Wang, Bi Li, Chenguang Liu, Jiaomin Liu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This thesis will mainly discuss the sparsed feed-forward neural network, namely, how to determine and delete the redundant neurons and connections in the network. To begin with, the author gives the mathematical definition of feed-forward neural network, and then introduces the partial and topological order to the sparsed algorithm and the learning algorithm of the feed-forward neural network. As a result, the author puts forward the judgement basis of the redundant neurons and connections. According to the self-configuring and self-adjusting tactics, the paper present self-configuring and self-adjusting algorithms which is suitable for feed-forward neural network. The result of the experiment indicates that the above-mentioned sparsed algorithm can not only delete the redundant neurons and connections in the network effectively, but also improve the performance of the network.
A Novel Biometric Personal Verification System Based on the Combination of Palmprints and Faces
Authors: Slobodan Ribarić, Ivan Fratrić, Kristina Kiš
Venue: Informatica (2008)

This paper presents a bimodal biometric verification system based on the fusion of palmprint and face features at the matching-score level. The system combines a new approach to palmprint principal lines recognition based on hypotheses generation and evaluation and the well-known eigenfaces approach for face recognition. The experiments with different matching-score normalization techniques have been performed in order to improve the performance of the fusion at the matching-score level. A &ldquo;chimerical&rdquo; database consisting of 1488 palmprint and face image pairs of 241 persons was used in the system design (440 image pairs of 110 persons) and testing (1048 image pairs of 131 persons). The experimental results show that system performance is significantly improved over unimodal subsystems.
A Fast Algorithm for Intra Downsizing in H.264/AVC Transcoding
Authors: Zhang Jian, Shen Ting-zhi, Jiang Wei, Zhang Ying
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

With widely using of multimedia applications, there are quite different demands in display resolutions and access bandwidths. There are also more demands in transcoding. At the same time, with being presented of the new video coding standard h.264, there are more high demands in transcoding. We present a fast algorithm based direction in I frame downsizing in h.264. This algorithm can significantly speed up the transcoding in I frame in h.264 with slight PSNR degradation.
Legal and organizational challenges and solutions for achieving a pan-European electronic ID solution
Authors: Thomas Myhr
Venue: Information Security Tech. Report (2008)

In this article I discuss the creation of a pan-European eID and the legal and organizational challenges connected to that in cross-border transactions within the EU/EEA. I mainly focus on issuance procedures and (the lack of) a European ''standard'' on a unique identifier of physical persons that can be used in the eID. My main solution here is to use, as far as possible, existing national and international requirements on the content of passport and how they are issued. In addition I present two issues that I think the European Commission should focus on that would have a significant positive effect on the work on achieving cross-border interoperability. These issues are (i) setting up requirements for Validation Authorities and self-declaratory schemes and (ii) setting up a quality classification system, where different national security levels can be mapped up against neutral requirements adopted by the European Commission.
Cooperative Object Localization Using Line-Based Percept Communication
Authors: Daniel Göhring
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

In this paper we present a novel approach to estimate the position of objects tracked by a team of robots. Moving objects are commonly modeled in an egocentric frame of reference, because this is sufficient for most robot tasks as following an object, and it is independent of the robots localization within its environment. But for multiple robots, to communicate and to cooperate the robots have to agree on an allocentric frame of reference. Instead of transforming egocentric models into allocentric ones by using self localization information, we will show how relations between different objects within the same camera image can be used as a basis for estimating an object's position. The spacial relation of objects with respect to stationary objects yields several advantages: a) Errors in feature detections are correlated. The error of relative positions of objects within a single camera frame is comparably small. b) The information is independent of robot localization and odometry. c) Object relations can help to detect inconsistent sensor data. We present experimental evidence that shows how two non-localized robots are capable to infer the position of an object by communication on a RoboCup Four-Legged soccer field.
Web Services Domain Analysis Based on Quality Standards
Authors: F. Losavio, A. Matteo, R. Rahamut
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

Web Services (WS) are an alternative to the lack of interoperability of applications, to facilitate integration via Service Oriented Architecture (SOA). The main goal of this paper is to establish a correspondence between three WS-related standards, WSA (Web Services Architecture) representing industrial and marketing requirements, ISO/IEC 9126-1 quality model to specify standard quality requirements, and ISO/IEC 13236 to specify the measurement model for WS-based applications. A domain analysis process is defined to provide guidelines to integrate the information of the three standards, facilitating the automatic generation of standardized quality of service contracts between clients and providers.
Safety-Ensuring Systematic Design for Service Robots
Authors: Seong-Tae Kim, Pyung Hun Chang
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

A safety-ensuring systematic design procedure is proposed that allows service robots to be designed to perform predefined tasks in which safety is guaranteed. To cope with the safety problem, the safety target is defined, the hazards associated with predefined tasks are identified, and the risks are analyzed. In addition, the proposed method considers risk reduction measures in all steps of robot design and verifies whether the safety target is achieved. Through the use of the proposed design procedure, it is shown as an example that a care-providing robot for physically disabled people can be designed.
Body Language Based Individual Identification in Video Using Gait and Actions
Authors: Y. Pratheepan, P. H. Torr, J V Condell, G. Prasad
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

In intelligent surveillance systems, recognition of humans and their activities is generally the most important task. Two forms of human recognition can be useful: the determination that an object is from the class of humans (which is called human detection), and determination that an object is a particular individual from this class (this is called individual recognition). This paper focuses on the latter problem. For individual recognition, this report considers two different categories. First, individual recognition using "style of walk" i.e. gait and second "style of doing similar actions" in video sequences. The "style of walk" and "style of actions" are proposed as a cue to discriminate between two individuals. The "style of walk" and "style of actions" for each individual is called their "body language" information.
Query and data security in the data outsourcing model
Authors: George Kollios
Venue:  (2008)

An increasing number of applications adopts the model of outsourcing data to a third party for query and storage. Under this model, database owners delegate their database management needs to third party data servers. These servers possess both the necessary resources, in terms of computation, communication and storage, and the required expertise to provide efficient and effective data management and query functionalities to data and information consumers. However, as servers might be untrusted or can be compromised, query and data security issues must be addressed in order for this model to become more practical. An important challenge in this realm is to enable the client to authenticate the query results returned from a server. To authenticate is to verify that the query results are correctly computed from the same data as the data owner has published and all results have been honestly returned. Existing solutions for this problem concentrate mostly on static, relational data scenarios and are based on idealistic properties for certain cryptographic primitives, looking at the problem mostly from a theoretical perspective. This thesis proposes practical and efficient solutions that address the above challenge for both relational and streaming data. Specifically, this dissertation provides dynamic authenticated index structures for authenticating range and aggregation queries in both one and multiple dimensional spaces. The authentication of sliding window queries over data streams is then discussed to support data streaming applications. We also study the problem of query execution assurance over data streams where the data owner and the client are the same entity. A probabilistic verification algorithm is presented that has minimal storage and update costs and achieves a failure probability of at most &delta;, for any small &delta; > 0. The algorithm is generalized to handle the scenarios of load shedding and multiple queries. An extensive experimental evaluation for all the proposed methods over both synthetic and real data sets is presented. The findings of this evaluation demonstrate both the correctness and effectiveness of the proposed methods.
Service Concentration Node in Internet Multimedia Subsystem (IMS)
Authors: Didem Gozupek, Aziz Sever
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)

Convergence of the cellular world to an all-IP domain has stimulated the development of Internet Multimedia Subsystem (IMS) service architecture, which is touted by service providers and vendors as the next generation solution for breaking the barriers not only between cellular and IP worlds, but also between wireline and wireless networks. Although many GSM operators and legacy network service providers are adapting rapidly to the IMS world, the pace of this adaptation process is still quite low in certain parts of the world. In this paper, we propose a novel IMS concept referred to as Service Concentration Node (SCN), which enables the operators to provide their customers with IMS services that are offered in other domains with which the operator has a signed agreement, and thereby facilitates the utilization of a vast amount of IMS services in various operator networks. The formulated technical framework as well as its accompanying business model is quite promising in enriching the IMS services experience in next generation networks.
Selection of the Best Wavelet Packet Nodes Based on Mutual Information for Speaker Identification
Authors: Rafael Fernández, Ana Montalvo, José R. Calvo, Gabriel Hernández
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

The analysis of the speech signal using wavelet packet trees (WPT) is a very flexible tool, capable of effectively manipulate the frequency subbands thanks to the orthonormal bases it provides. Here, dimension reduction becomes very important since the number of subbands grows exponentially with the level of decomposition, and their discriminative relevancy is different, which leads to different resolution for each one. A method based on mutual information is proposed in order to keep as much discriminative information as possible and the less amount of redundant information.
SPARQLeR: Extended Sparql for Semantic Association Discovery
Authors: Krys J. Kochut, Maciej Janik
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Complex relationships, frequently referred to as semantic associa-tions, are the essence of the Semantic Web. Query and retrieval of semantic associations has been an important task in many analytical and scientific activities, such as detecting money laundering and querying for metabolic pathways in biochemistry. We believe that support for semantic path queries should be an integral component of RDF query languages. In this paper, we present SPARQLeR, a novel extension of the SPARQL query language which adds the support for semantic path queries. The proposed extension fits seamlessly within the overall syntax and semantics of SPARQL and allows easy and natural formulation of queries involving a wide variety of regular path patterns in RDF graphs. SPARQLeR's path patterns can capture many low-level details of the queried associations. We also present an implementation of SPARQLeR and its initial performance results. Our implementation is built over BRAHMS, our own RDF storage system.
Effective Ranking Fusion Methods for Personalized Metasearch Engines
Authors: Leonidas Akritidis, Dimitrios Katsaros, Panayiotis Bozanis
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Metasearch engines are a significant part of the information retrieval process. Most of Web users use them directly or indirectly to access information from more than one data sources. The cornerstone of their technology is their rank aggregation method, which is the algorithm they use to classify the collected results. In this paper we present three new rank aggregation methods. At first, we propose a method that takes into consideration the regional data for the user and the pages and assigns scores according to a variety of user defined parameters. In the second expansion, not all component engines are treated equally. The user is free to define the importance of each engine by setting appropriate weights. The third algorithm is designed to classify pages having URLs that contain subdomains. The three presented methods are combined into a single, personalized scoring formula, the Global KE. All algorithms have been implemented in QuadSearch, an experimental metasearch engine available at http://quadsearch.csd.auth.gr.
Cost-Minimizing Algorithm for Replica Allocation and Topology Assignment Problem in WAN
Authors: Marcin Markowski, Andrzej Kasprzak
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The paper deals with the problem of simultaneously assignment of network topology and server's replica placement in the wide area network in order to minimize the criterion composed of the leasing capacity cost and the building cost of the network. An exact algorithm, based on the branch and bound method, is proposed to solve the problem. Algorithm takes into account the problem of ensuring the reliability of the network. Some interesting features, observed during the computational experiments are reported.