ppxscal/embedding_network huggingface dataset:
OntoAPI: An Ontology-based Data Integration Approach by an a Priori Articulation of Ontologies
Authors: Ladjel Bellatreche, Guy Pierra
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper, we concentrate on the problem of integrating heterogeneous, autonomous and evolving sources using conceptual ontologies. We propose an ontology-based approach by an a priori articulation of ontologies. It assumes that each source has its own ontology that references shared domain ontology. To guarantee the autonomy of sources, the shared ontology can be extended/refined locally. We also study the problem of managing the evolution of sources and show its effect on the integrated system. In ontology based integration systems, the evolution is more challenging, because it concerns not only schemas and populations of sources, but also ontologies (local and shared).
Career Contradictions
Authors: Paul F. Dubois
Venue: Computing in Science and Engineering (2007)

Contributing editor Paul F. Dubois takes a closer look at the sometimes conflicting advice the average computer scientist can expect to encounter during the course of his or her career.
Preserving privacy in gps traces via uncertainty-aware path cloaking
Authors: Baik Hoh, Marco Gruteser, Hui Xiong, Ansaf Alrabady
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Motivated by a probe-vehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintaining high data accuracy. We find through analysis of a set of GPS traces from 233 vehicles that known privacy algorithms cannot meet accuracy requirements or fail to provide privacy guarantees for drivers in low-density areas. To overcome these challenges, we develop a novel time-to-confusion criterion to characterize privacy in a location dataset and propose an uncertainty-aware path cloaking algorithm that hides location samples in a dataset to provide a time-to-confusion guarantee for all vehicles. We show that this approach effectively guarantees worst case tracking bounds, while achieving significant data accuracy improvements.
FuSem: exploring different semantics of data fusion
Authors: Jens Bleiholder, Karsten Draba, Felix Naumann
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Data fusion is the final step of a typical data integration process, after schematic conflicts have been overcome and after duplicates have been correctly identified. We present the relational data fusion system FuSem, which uses schema mappings and information about duplicates to decide what to fuse, i.e., which tuples to merge into one. The aspect emphasized by the demo is how to fuse the duplicates with FuSem. First, it offers several conflict resolution functions to handle data conflicts among duplicates. Furthermore, different fusion semantics proposed in the literature, such as MatchJoin or ConQuer, can be compared and visually explored. Optimized execution allows interactive access to the data and thus to explore the different data fusion procedures.
Modula--Prolog: A Software Development
Authors: C. Muller
Venue: IEEE Software (1986)

Modula--Prolog draws on the strengths of the general-purpose Modula-2 and the highly interactive Prolog to create a deductive component that can process symbolic and procedural knowledge. 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
An Innovative Analyser for Email Classification Based on Grey List Analysis
Authors: Md Rafiqul Islam, Wanlei Zhou
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In this paper we propose a new technique of email classification based on grey list (GL) analysis of user emails. This technique is based on the analysis of output emails of an integrated model which uses multiple classifiers of statistical learning algorithms [8]. The GL is a list of classifier/(s) output which is/are not considered as true positive (TP) and true negative (TN) but in the middle of them. Many works have been done to filter spam from legitimate emails using classification algorithm and substantial performance has been achieved with some amount of false positive (FP) tradeoffs. In the case of spam detection the FP problem is unacceptable, sometimes. The proposed technique will provide a list of output emails, called "grey list (GL)", to the analyser for making decisions about the status of these emails. It has been shown that the performance of our proposed technique for email classification is much better compare to existing systems, in order to reducing FP problems and accuracy.
A Novel Reference Node Selection Algorithm Based on Trilateration for Indoor Sensor Networks
Authors: Guangjie Han, Deokjai Choi, Wontaek Lim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The key problem of location service in indoor sensor networks is to quickly and precisely acquire the position information of mobile nodes. Traditional positioning algorithms, such as Two-Phase Positioning (TPP) algorithm, are too complicated to be used in a mobile node and they cannot satisfy the time constraints. We analyze the localization error and draw the conclusion that the localization error is the least when three reference nodes form an equilateral triangle. We also proof three basic positioning theorem of reference node. Therefore, we propose a novel Reference Node Selection algorithm based on Trilateration (RNST), which can effective meet real- time localization requirement of the mobile nodes in indoor environment, and guarantee less localization error.
Authenticated multiple key exchange protocols based on elliptic curves and bilinear pairings
Authors: Narn-Yih Lee, Chien-Nan Wu, Chien-Chih Wang
Venue: Computers and Electrical Engineering (2008)

Menezes et al. developed an MQV key exchange protocol that does not use a one-way hash function in 1995. Harn-Lin and Hwang-Shiau-Lai later respectively proposed efficient authenticated key exchange protocols. Lee and Wu recently proposed an enhanced authentication key exchange protocol to solve the drawbacks of the Hwang-Shiau-Lai protocol. Based on the Lee-Wu protocol, this work presents two new authenticated multiple key exchange protocols based on ECC and bilinear pairing. The proposed ECC-based protocol is more efficient than the Harn-Lin, Hwang-Shiau-Lai, and Lee-Wu protocols. Moreover, the proposed pairing-based protocol is better than other protocols in terms of the number of available shared session keys because all agreed session keys can be adopted by the communicating parties in the protocol.
On the decidability of shared memory consistency verification
Authors: A. Sezgin
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

We view shared memories as structures, which define relations over the set of programs and their executions. An implementation is modeled by a transducer, where the relation it realizes is its language. This approach allows us to cast shared memory verification as language inclusion. We show that a specification can be approximated by an infinite hierarchy of finite-state transducers, called the memory model machines. Also, checking whether an execution is generated by a sequentially consistent memory is approached through a constraint satisfaction formulation. It is proved that if a memory implementation generates a non interleaved sequential and unambiguous execution, it necessarily generates one such execution of bounded size. Our paper summarizes the key results from the first author's dissertation, and may help a practitioner understand with clarity what "sequential consistency checking is undecidable" means.
QStream: deterministic querying of data streams
Authors: Sven Schmidt, Henrike Berthold, Wolfgang Lehner
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Current developments in processing data streams are based on the best-effort principle and therefore not adequate for many application areas. When sensor data is gathered by interface hardware and is used for triggering data-dependent actions, the data has to be queried and processed not only in an efficient but also in a deterministic way. Our streaming system prototype embodies novel data processing techniques. It is based on an operator component model and runs on top of a real-time capable environment. This enables us to provide real Quality-of-Service for data stream queries.
Dealing with logical omniscience
Authors: Joseph Y. Halpern, Riccardo Pucella
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and impossible possible worlds. Although in some settings these approaches are equi-expressive and can capture all epistemic states, in other settings of interest they are not. In particular, adding probabilities to the language allows for finer distinctions between different approaches.
Efficient Partially Blind Signature from LFSR
Authors: Zheng Gong, Yu Long, Kefei Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper, we provide a new partially blind signature scheme which is based on n-th order characteristic sequences generated by LFSR, and then prove its security in the random oracle model (ROM). Compares with the finite field based schemes, our scheme shows advantages on the computation and storage since the reduced representation of finite field elements by LFSR. It will make those applications more efficient in hardware-limited environments, such as cellular networks, tactical networks and sensor nets.
A Novel Peer-to-Peer Overlay for Live Media Broadcasting
Authors: Hung-Chang Hsiao, Hao Liao
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Most peer-to-peer live multimedia streaming systems either rely on an overlay infrastructure to deliver media data or request participating peers to search and fetch their demanded data without relying on a dedicated overlay structure. While the former approach, namely the infrastructurecentric approach, may require sophisticated construction and maintenance for an overlay network with good quality, the latter, called the infrastructure-less approach, may take significant overheads in searching and caching the demanded contents. In this paper, we propose a hybrid design that takes both advantages of the infrastructure-centric and infrastructure-less approaches. The performance of our design is efficient and mathematically provable. The simulation results also confirm the efficiency of our design.
Picture navigation using an ambient display and implicit interactions
Authors: Han-Sol Ryu, Yeo-Jin Yoon, Myeong-Eun Lim, Chan-Yong Park, Soo-Jun Park, Soo-Mi Choi
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

There is increasing demand for ubiquitous displays that react to a user's actions. We propose a method of navigating pictures on an ambient display using implicit interactions. The ambient display can identify the user and measure how far away they are using an RFID reader and ultrasonic sensors. When the user is a long way from the display, it acts as a digital picture and does not attract attention. When the user comes within an appropriate range for interaction, the display shows pictures that are related to the user and provides quasi-3D navigation using the TIP (tour into the picture) method. In addition, menus can be manipulated directly on a touch-screen or remotely using an air mouse. In an emergency, LEDs around the display flash to alert the user.
Hardware implementation of a disparity estimation scheme for real-time compression in 3D imaging applications
Authors: D. Chaikalis, N. Sgouros, D. Maroulis, P. Papageorgas
Venue: Journal of Visual Communication and Image Representation (2008)

This paper presents a novel hardware implementation of a disparity estimation scheme targeted to real-time Integral Photography (IP) image and video sequence compression. The software developed for IP image compression achieves high quality ratios over classic methodologies by exploiting the inherent redundancy that is present in IP images. However, there are certain time constraints to the software approach that must be confronted in order to address real-time applications. Our main effort is to achieve real-time performance by implementing in hardware the most time-consuming parts of the compression algorithm. The proposed novel digital architecture features minimized memory read operations and extensive simultaneous processing, while taking into concern the memory and data bandwidth limitations of a single FPGA implementation. Our results demonstrate that the implemented hardware system can successfully process high resolution IP video sequences in real-time, addressing a vast range of applications, from mobile systems to demanding desktop displays.
Mobile Learning
Authors: Inmaculada Arnedillo-Sánchez
Venue: IEEE Distributed Systems Online (2007)

The emergent field of mobile learning has generated much interest and discussion among researchers and yielded substantial research results. Although mobile technologies can potentially support and enable teaching and learning, the mere availability of information and tools is no guarantee that learning will occur. So, a major consideration in mobile learning is to design and develop with learners and learning principles in mind. The June issue of IEEE Distributed Systems Online features a revised version of the best paper from the IADIS (International Association for the Development of the Information Society) Mobile Learning 2006 International Conference.
Playability heuristics for mobile multi-player games
Authors: Hannu Korhonen, Elina M. I. Koivisto
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Multi-player games are engaging because of social interaction and competing with real players. Currently, many digital games are multi-player or have multi-player features. When evaluating the playability of multi-player games, we need to consider player-to-player interaction. In this paper, we introduce and describe playability heuristics for mobile multi-player games that complement the playability heuristic model that we have presented earlier. Multi-player heuristics have been developed by identifying playability problems in game evaluations and comparing these findings to game design guidelines and other studies found in the literature. The results indicate that the presented multi-player heuristics correspond to issues that are addressed to be important in multi-player games.
Multilayer Perceptron Classifier Combination for Identification of Materials on Noisy Soil Science Multispectral Images
Authors: Fabricio A. Breve, Moacir P. Ponti-Junior, Nelson D. A. Mascarenhas
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Classifier combination experiments using the Multilayer Perceptron (MLP) were carried out using noisy soil science multispectral images, which were obtained using a Tomograph scanner. Using few units in the MLP hidden layer, images were classified using a single classifier. Later we used classifier combining techniques as Bagging, Decision Templates (DT) and Dempster-Shafer (DS), in order to improve the performance of the single classifiers and also stabilize the performance of the Multilayer Perceptron. The classification results were evaluated using Cross- Validation. The results showed stabilization of Multilayer Perceptron and improved results were achieved with fewer units in the MLP hidden layer.
The VLSI Design Automation Assistant: From Algorithms to Silicon
Authors: T. J. Kowalski, D. J. Geiger, W. H. Wolf, W. Fichtner
Venue: IEEE Design Test (1985)

Our ability to fabricate complex VLSI chips is outrunning our ability to design them. To reduce the design time for complexchips we are creating an expert design assistant?programs that automate as many of the design tasks as possible while allowingthe human designer to control the synthesis process. A series of programs translates an algorithm into a chip layout. Someprograms are expert systems while others use traditional algorithms. Our early results lead us to believe that a knowledge-basedexpert system is an appropriate tool for bridging the gap between logical and physical design.
Optimal Scheduling and Placement of Internet Banner Advertisements
Authors: Subodha Kumar, Milind Dawande, Vijay Mookerjee
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

The increasing popularity of the world wide web has made it an attractive medium for advertisers. As more advertisers place internet advertisements (hereafter also called "ads), it has become important for web site owners to maximize revenue through the optimal selection and placement of these ads. Unlike most previous research, we consider a hybrid pricing model where the price advertisers pay is a function of (i) the number of exposures of the ad and (ii) the number of clicks on the ad. The problem is to find an ad schedule to maximize web site revenue under a hybrid pricing model. We formulate two versions of the problem: static and dynamic, and propose a variety of efficient solution techniques that provide near-optimal solutions. In the dynamic version, the schedule of ads is changed based on individual user click behavior. We show - using a theoretical proof under special circumstances and an experimental demonstration under general conditions - that a schedule that adapts to user click behavior consistently outperforms one that does not. We also demonstrate that to benefit from observing user click behavior, the associated probability parameter need not be estimated accurately.
Detachable learning environments for T-learning
Authors: Franco Bagnoli, Andrea Sterbini
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper we present the idea of detachable learning environments, i.e. web pages, containing a few lessons or whole courses, not requiring a synchronous Internet connection to be browsed, edited or to interact with them. We discuss their use in education both as a support system for traditional front lessons, as an interactive cooperative environment that is distributed through strongly asymmetric and sporadic connections and finally as a tool for assembling teaching streams to be delivered through the digital TV (T-learning).
Old Southeast Asian Script Recognition Using Evolutionary Algorithm
Authors: Arit Thammano, Supin Trikeawcharoen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper proposes an approach to off-line handwritten Isan Dhamma character recognition by using the concept of evolutionary algorithm. The objective of this paper is to recognize Isan Dhamma characters straight from the character images without any feature extraction process. The performance of the proposed approach is compared to the results of the test done by 23 educated Buddhist monks. The experimental results demonstrate a very promising performance of the proposed approach.
Relations in the Central Limit Theorem Version of the Response Time Law
Authors: Takayuki Osogami
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

We study the accuracy of the estimators of mean response time and throughput in closed interactive systems such as Web systems. The response time law allows us to calculate the throughput from the mean response time and vice versa. However, we find that the accuracy of the two estimators can be quite different. We refine the response time law using the central limit theorem and study the asymptotic accuracy of the estimators when the measurement time approaches infinity. Based on the asymptotic accuracy of the estimators, we derive rules of thumb for the accuracy of the measured mean response time and measured throughput. Extensive simulation study suggests that the rules of thumb are often valid under realistic measurement time.
Linkability estimation between subjects and message contents using formal concepts
Authors: Stefan Berthold, Sebastian Clauss
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, we define messages described by their contents as formal contexts. Then, we define subjects described by their knowledge as further formal contexts. Finally, we show that concept lattices, which are achieved by applying Formal Concept Analysis to the concatenation of these formal contexts, can be used in order to draw conclusions about correlations, and therefore linkability, between contents of messages and knowledge of subjects. The goal is to define formal specifications which can be utilized in privacy enhancing identity management systems in order to support users in the choice of data items which are to be disclosed to a communication partner.
Improving the Performance of MPI Applications over Computational Grid
Authors: Bo Song, Guangwen Yang, Qiming Fang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The Message Passing Interface (MPI) is a standard in parallel computing, and can also be used as a highperformance programming model for Grid application development. How to execute MPI applications efficiently over a computational Grid has become a big challenge to developers, due to the distributed nature of Grid resources and complex hierarchies of Grid links. In this paper, we present three useful techniques for improving the performance of MPI applications over a computational Grid. We introduce the multithreaded model to the implementation of MPI point-topoint operations, to overlap communication with computation and speed up point-to-point operations. To enable the porting of MPI applications to a Grid composed of multiple private-IP clusters, a crosssubnet communication mechanism based on NAT has been designed. To improve the performance of MPI collective operations over a computational Grid, we implements a kind of topology-aware collective communication algorithms based on a local communicator creation mechanism. These three techniques are adopted in an ongoing Grid-enabled MPI implementation called FiTMPI.