ppxscal/embedding_network huggingface dataset:
Semantic specification and evaluation of bids in web-based markets
Authors: Steffen Lamparter, Anupriya Ankolekar, Daniel Oberle, Rudi Studer, Christof Weinhardt
Venue: Electronic Commerce Research and Applications (2008)

In recent years, electronic markets have gained much attention as institutions to allocate goods and services efficiently between buyers and sellers. By leveraging the Web as a global communication medium, electronic markets provide a platform that allows participants throughout the world to spontaneously exchange products in a flexible manner. However, ensuring interoperability and mutual understanding in such a highly dynamic and heterogenous environment can easily become very tricky, particularly if the services and goods involved are complex and described by multiple attributes. In this paper, we present a comprehensive ontology framework that allows the specification of bids for Web-based markets. By expressing utility function policies with a logic-based and standardized formalism, the framework enables a compact bid representation particularly for highly configurable goods and services while ensuring a high degree of interoperability. To facilitate matchmaking of offers and requests in the market, a method for evaluating bids based on logical reasoning is presented. In addition, as proof of concept, we show how the framework can be applied in a Web service selection scenario.
Adaptive Link Annotation in Distributed Hypermedia Systems: The Evaluation of a Service-Based Approach
Authors: Michael Yudelson, Peter Brusilovsky
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

A service-based approach to link annotation expands the applicability of adaptive navigation support functionality beyond the limits of traditional adaptive hypermedia systems. With this approach, the decision-making functionality is separated from the application systems and encapsulated in a personalization service. This paper attempts to evaluate the feasibility of using this approach in the real world. After a brief overview of current efforts to develop service-based approaches to adaptive hypermedia, we describe our specific implementation of this approach as personalization architecture and report the results of an extensive performance evaluation of this architecture.
Cell Phones Personal Authentication Systems Using Multimodal Biometrics
Authors: Joanna Rokita, Adam Krzyżak, C. Y. Suen
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper presents a multimodal biometric system based on face and hand images captured by a cell phone. The multimodal fusion is done at the feature extraction level. The nine facial models are built according to the number of features / points extracted from the face. Active shape models method is applied in order to find the concatenated string of facial points in the eyes, nose, and mouth areas. The face feature vector is constructed by applying Gabor filter to the image and extracting the key points found by an active shape model. The hand feature vector contains nine geometric measurements, including heights and widths of four fingers, and the width of the palm. Support vector machine is used as a classifier for a multimodal approach. One SVM machine is built for each person in the database to distinguish that person from the others. The database contains 113 individuals. As the experiments show, the best accuracy of up to 99.82% has been achieved for the model combining 8 eye, 12 mouth and 9 hand features.
Robust feature-based registration using a Gaussian-weighted distance map and brain feature points for brain PET/CT images
Authors: Ho Lee, Jeongjin Lee, Namkug Kim, Sang Joon Kim, Yeong Gil Shin
Venue: Computers in Biology and Medicine (2008)

Feature-based registration is an effective technique for clinical use, because it can greatly reduce computational costs. However, this technique, which estimates the transformation by using feature points extracted from two images may cause misalignments, particularly in brain PET and CT images that have low correspondence rates between features due to differences in image characteristics. To cope with this limitation, we propose a robust feature-based registration technique using a Gaussian-weighted distance map (GWDM) that finds the best alignment of feature points even when features of two images are mismatched. A GWDM is generated by propagating the value of the Gaussian-weighted mask from feature points of CT images and leads the feature points of PET images to be aligned on an optimal location even though there is a localization error between feature points extracted from PET and CT images. Feature points are extracted from two images by our automatic brain segmentation method. In our experiments, simulated and clinical data sets were used to compare our method with conventional methods such as normalized mutual information (NMI)-based registration and chamfer matching in accuracy, robustness, and computational time. Experimental results showed that our method aligned the images robustly even in cases where conventional methods failed to find optimal locations. In addition, the accuracy of our method was comparable to that of the NMI-based registration method.
An Improved Chaos-Based Image Encryption Scheme
Authors: Chong Fu, Zhen-Chuan Zhang, Ying Chen, Xing-Wei Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Chaos theory provides a new approach to image encryption technology. The key stream generator is the key design issue of an image encryption system, it directly determines the security and efficiency of the system. This paper proposes an improved chaos-based key stream generator to enlarge the key space, extend the period and improve the linear complexity of the key stream under precision restricted condition so as to enhance the security of a chaos-based image encryption system. The generator is constructed by three Logistic maps and a nonlinear transform. The balance and correlation properties of the generated sequence are analyzed. The sequence is proved to be a binary Bernoulli stochastic sequence and the distribution of the differences between the amounts of 0 and 1 is analyzed. The side lobes of auto and cross correlation are proved to obey normal distribution N(0, 1/N). The experimental results indicate that the scheme has advantages of long period and strong anti various attack ability over conventional chaos-based encryption system.
Natural Language Processing Across Time: An Empirical Investigation on Italian
Authors: Marco Pennacchiotti, Fabio Massimo Zanzotto
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

In this paper, we study how existing natural language processing tools for Italian perform on ancient texts. The first goal is to understand to what extent such tools can be used "as they are" for the automatic analysis of old literary works. Indeed, while NLP tools for Italian achieve today good performance, it is not clear if they could be successfully used for the humanities, to support the critical study of historical works. Our analysis will show how tools' performance systematically vary across different time periods, and within literary movements. As a second goal, we want to verify whether or not simple customization methods can improve the tools performance over the old works.
Optimum RNS sign detection algorithm using MRC-II with special moduli set
Authors: M. Akkal, P. Siy
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

In this paper, we present a generic sign detection algorithm based on mixed radix conversion algorithm, MRC-II [M. Akkal, P. Siy, A new mixed radix conversion algorithm MRC-II, Journal of System Architecture (2006)] and also we present an optimum algorithm for sign detection based on a special moduli set where m"n is even. The described algorithm requires only one comparison for sign detection. A new moduli set will also be presented which simplifies MRC-II conversion algorithm by eliminating the need for table lookup normally used in MRC hardware implementation. The algorithm does not require ROM table like other algorithms. For a moduli set of four moduli that satisfies the special moduli set conditions, 0 tables are needed to do the conversion, while Szabo and Tanaka MRC algorithm [N.S. Szabo, R.I. Tanaka, Residue Arithmetic and Its Application to Computer Technology, McGraw-Hill, New York, 1967] requires 6 tables with a total table size of 4608bits; and Huang MRC algorithm [C.H. Huang, A fully ParallelMixed-radix conversion algorithm for residue number applications, IEEE Transactions on Computers c-32 (4) (1983)] requires 10 tables with a total table size of 3840bits.
Verification of Linear Duration Invariants by Model Checking CTL Properties
Authors: Miaomiao Zhang, Dang Hung, Zhiming Liu
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

Linear duration invariants (LDI) are important safety properties of real-time systems. They can be easily formulated in terms of a class of chop-free formulas in the Duration Calculus (DC). Compared to other temporal logics, the specification in DC is simpler, neater and more importantly easier to understand. However, directly model checking them is more difficult than model checking properties formulated in the computation tree logic (CTL). In this paper, we present a technique for the verification of the satisfaction of a LDI ${\cal D}$ by a timed automaton ${\cal A}$ by model checking a CTL property. For this, we construct an untimed automaton G from ${\cal A}$, and prove that ${\cal A}$ satisfies ${\cal D}$ iff ${\cal D}$ is is satisfied by the set of all paths of G. To Verify that all paths of G satisfy ${\cal D}$, we construct a CTL formula ¿ and simply check if G satisfies ¿. By this, we convert the problem of verification of the LDI to the problem of model checking CTL formula. As a result, the CTL model checking techniques and tools, such as UPPAAL, can be used for verification of LDI specified in the DC.
Overview of the European Commission research lines in the creative and cultural sectors in support of media content
Authors: Roberto Cencioni
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Over the last ten years the European Commission has provided sustained support for the creative and cultural sectors through a number of programmes designed to promote creativity, stimulate innovation and develop new technology in support of media content. The purpose of this talk is to present a broad overview of the main research lines pursued in the last few years, highlighting the most significant developments and outlining future directions and priorities in the coming years.
High Resolution Analysis of Settlement Structure on Base of Topographic Raster Maps --- Method and Implementation
Authors: Gotthard Meinel
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The paper describes a method for full automatic calculation of settlement structure on base of simple topographic raster maps. In a first step extracted all buildings, they are mixed with streets, scripts and signatures in the maps. After vectorization we calculated building variables such as area, length, width, shape complexity and distance to next building. On base of this description we classified all buildings and realized a statistical analysis on building block level. We estimated 16 indicators (e. g. building and inhabitant density), visualized indicators in a GIS in optimized pre-defined legends and calculated a statistical report for the study area in different spatial resolution. The full automatic procedures called SettlementAnalyzer (SEMENTA®) have been implemented in ArcGIS under additional using of the image processing software HALCON.
Susceptibility Matrix: A New Aid to Software Auditing
Authors: Kanta Jiwnani, Marvin Zelkowitz
Venue: IEEE Security and Privacy (2004)

Testing for security is lengthy, complex, and costly, so focusing test efforts in areas that have the greatest number of security vulnerabilities is essential. This article describes a taxonomy-based approach that gives an insight into the distribution of vulnerabilities in a system.
VIPSec defined
Authors: Dimitris Zisiadis, Spyros Kopsidas, Leandros Tassiulas
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Secure end-to-end information exchange is a constant challenge in electronic communications. Novel security architectures and approaches are proposed constantly, to be followed by announcements of sophisticated attack methods that compromise them, while other more sophisticated attack methods never see the daylight. The traditional approach for securing the communication between two peers is through the use of secret key encryption combined with a public key approach for exchanging the common secret key to be used by the end-peers. The public key part of the communication is based on a trusted authority for providing the public keys, a service provided through a public key infrastructure (PKI). Public key infrastructures are vulnerable to man in the middle attacks, among other approaches that compromise their integrity. A fake certification authority (CA) or a malicious/compromised network between the user and the CA are typical weaknesses. There has been a lot of work for providing robust PKI; the proposed solutions are fairly demanding on network resources, hence public key solutions are not the security approach of choice in several applications that require light weight solutions. In this article we present voice interactive personalized Security (VIPSec) protocol, which is a protocol for media path key exchange to securely establish a session symmetric key for ensuring end-to-end secure communication, where it is possible to have biometric based authentication, exploiting the nature of the application; voice communication is the typical example that we use as our paradigm for describing the method.
Real-World Reasoning with OWL
Authors: Timo Weithöner, Thorsten Liebig, Marko Luther, Sebastian Böhm, Friedrich Henke, Olaf Noppens
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

This work is motivated by experiences in the course of developing an ontology-based application within a real-world setting. We found out that current benchmarks are not well suited to provide helpful hints for users who seek for an appropriate reasoning system able to deal with expressive terminological descriptions, large volumes of assertional data, and frequent updates in a sound and complete way. This paper tries to provide some insights into currently available reasoning approaches and aims at identifying requirements to make future benchmarks more useful for application developers.
Spanners in Sparse Graphs
Authors: Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

A t-spanner of a graph G is a spanning subgraph S in which the distance between every pair of vertices is at most t times their distance in G. If S is required to be a tree then S is called a tree t -spanner of G. In 1998, Fekete and Kremer showed that on unweighted planar graphs the tree t -spanner problem (the problem to decide whether G admits a tree t-spanner) is polynomial time solvable for t &le; 3 and is NP-complete as long as t is part of the input. They also left as an open problem whether the tree t-spanner problem is polynomial time solvable for every fixed t &ge; 4. In this work we resolve this open problem and extend the solution in several directions. We show that for every fixed t, it is possible in polynomial time not only to decide if a planar graph G has a tree t-spanner, but also to decide if G has a t-spanner of bounded treewidth. Moreover, for every fixed values of t and k, the problem, for a given planar graph G to decide if G has a t-spanner of treewidth at most k, is not only polynomial time solvable, but is fixed parameter tractable (with k and t being the parameters). In particular, the running time of our algorithm is linear with respect to the size of G. We extend this result from planar to a much more general class of sparse graphs containing graphs of bounded genus. An apex graph is a graph obtained from a planar graph G by adding a vertex and making it adjacent to some vertices of G. We show that the problem of finding a t-spanner of treewidth k is fixed parameter tractable on graphs that do not contain some fixed apex graph as a minor, i.e. on apex-minor-free graphs. Graphs of bounded treewidth are sparse graphs and our technique can be used to settle the complexity of the parameterized version of the sparse t -spanner problem, where for given t and m one asks if a given n-vertex graph has a t-spanner with at most n - 1 + m edges. Our results imply that the sparse t-spanner problem is fixed parameter tractable on apex-minor-free graphs with t and m being the parameters. Finally we show that the tractability border of the t-spanner problem cannot be extended beyond the class of apex-minor-free graphs. In particular, we prove that for every t &ge; 4, the problem of finding a tree t-spanner is NP-complete on K6 -minor-free graphs. Thus our results are tight, in a sense that the restriction of input graph being apex-minor-free cannot be replaced by H-minor-free for some non-apex fixed graph H.
Are good code reviewers also good at design review?
Authors: Hidetake Uwano, Akito Monden, Ken-ichi Matsumoto
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Software review is a necessity activity to build high reliability software in software development. In this paper, we experimentally analyze the difference in performance between two types of (checklist based) software reviews: design review and code review. If good code reviewers were also good at design review, then we should assign good code reviewers to the design review too. If not, that means these two reviews require different types of expertise. In our experiment, with ten review participants, we examined two hypotheses each related to the defect detection ratio and the required time to find a defect. As a result, we found that there was no correlation between two reviews, i.e. good code reviewers were not necessarily the good design reviewers. This suggests the need of a completely different training program for each review.
Study of an Improved AKA Protocol Based on the SIM Card
Authors: Ha-Yong Jeon, Yun-Seok Lee, Min-Soo Jung
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

In addition to existing voice call service, the GSM platform has evolved to include various multimedia services and 3G services enabling international roaming. On that ground, safe data transmission and receiving technology and protection of privacy have become the key elements for the GSM service.[1] However, many researchers have pointed out the problems inherent to the security algorithm and protocol for safe data communication using GSM [2,3]. In this paper, we would like to analyze the security problems associated with the 2nd and 2.5th GSM network environment and consequently propose a security protocol providing safe services in the third generation network environment as well as the second generation network environment. The newly proposed security protocol may provide significantly strengthened security by allowing authentication of SIM users between SIM and ME and authentication among SIM/ME/AuC as well as reduced complexity in key agreement.
Design consideration of the nonlinear specifications in the automotive body
Authors: Dongchan Lee, Yoonhwan Woo, Sangho Lee, Changsoo Han
Venue: Finite Elements in Analysis and Design (2008)

A great deal of effort has been invested to improve the performance and efficiency of mechanical systems which are composed of various components. In order to analyze the system with various performance requirements, the sequential configuration techniques based on the subsystems' behavior are widely used. In the area of structural design, the evaluations under ultimate loads and vibration environments have been an important task. In order to determine the structurally optimal configuration for bearing the ultimate load and low vibrations, the design factors originating from both geometry and material must be incorporated in the analyses. This approach can be used for complicated structural analysis in which subsystems are initially incompatible and for an integrated design process with the feasible local flexibilities between system and subsystems.
A Distributed Certification System for Structured P2P Networks
Authors: François Lesueur, Ludovic Mé, Valérie Viet Triem Tong
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

In this paper, we present a novel distributed certification system in which signing a certificate needs the collaboration of a fixed ratio of the nodes, hence a varying number of nodes. This number is dynamically adjusted to enforce the ratio in a fully distributed way, which is mandatory for decentralized varying-size P2P networks. A certificate allows then to link the key pair of a node to some rights granted to it.
Building Hierarchical Grid Storage Using the Gfarm Global File System and the JuxMem Grid Data-Sharing Service
Authors: Gabriel Antoniu, Loïc Cudennec, Majd Ghareeb, Osamu Tatebe
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

As more and more large-scale applications need to generate and process very large volumes of data, the need for adequate storage facilities is growing. It becomes crucial to efficiently and reliably store and retrieve large sets of data that may be shared at the global scale. Based on previous systems for global data sharing (global file systems, grid data-sharing services), this paper proposes a hierarchical approach for grid storage, which combines the access efficiency of RAM storage with the scalability and persistence of the global file system approach. Our proposal has been validated through a prototype that couples the Gfarm file system with the JuxMem data-sharing service. Experiments on the Grid'5000 testbed confirm the advantages of our approach.
Automatic induction of generalization hierarchies for reinforcement learning
Authors: Nicholas K. Jong
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program (2008)

In popular fiction, artificially intelligent agents experience the same world as humans. A spacecraft computer in 2001: A Space Odyssey can attempt to stop the astronauts who want to deactivate it. A droid in Star Wars can infiltrate a space station and help rescue a princess. A robot in Short Circuit can discover the value of life and reject its military programming. These machines have the capacity to behave effectively in novel situations that their creators could not have explicitly anticipated.