ppxscal/embedding_network huggingface dataset:
Privacy-Preserving Basic Operations on Outsourced Search Trees
Authors: DANG Tran Khanh
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Security issues in outsourcing database services have recently attracted special attention in the research community. However, to the best of our knowledge, none of the previous work has radically addressed the problem of preserving privacy for basic operations on outsourced search trees. Basic operations of search trees include search and updates. Search trees have played a fundamental and vital role in both traditional and modern database application domains due to their efficiency in managing the storage and retrieval of data. The outsourced search trees and data are all encrypted and stored at some untrusted server. In this paper, we will discuss security issues in outsourced databases that come together with search trees, and present techniques to ensure privacy in the execution of these trees' basic operations on the untrusted server. By privacy, we mean the outsourced tree structure and data as well as user's queries are all hidden from unauthorized people. 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
Personality Traits and Privacy Perceptions: An Empirical Study in the Context of Location-Based Services
Authors: Iris Junglas, Christiane Spitzmuller
Venue: Proceedings of the International Conference on Mobile Business (2006)

Location-based services (LBS) are services that take into account the geographic location of a user. While LBS promise efficiency and effectiveness gains, their use also raises fundamental privacy issues. In this study we propose the development of a theoretical model for examining the role of personality traits in perceptions of privacy in reference to LBS. More specifically, we will develop a model that incorporates the Big Five personality traits (agreeableness, extraversion, emotional stability, openness to experience, conscientiousness), the most widely accepted framework for personality research in psychology, as well as perceptions of privacy, usefulness, risk, and trust as mediators in our model to explain behavioral intentions towards adopting LBS. We empirically test our model using a survey-based approach sampling 470 undergraduate business students.
Abstraction preservation and subtyping in distributed languages
Authors: Pierre-Malo Deniélou, James J. Leifer
Venue: ACM SIGPLAN Notices (2006)

In most programming languages, type abstraction is guaranteed by syntactic scoping in a single program, but is not preserved by marshalling during distributed communication. A solution is to generate hash types at compile time that consist of a fingerprint of the source code implementing the data type. These hash types can be tupled with a marshalled value and compared efficiently at unmarshall time to guarantee abstraction safety. In this paper, we extend a core calculus of ML-like modules, functions, distributed communication, and hash types, to integrate structural subtyping, user-declared subtyping between abstract types, and bounded existential types. Our semantics makes two contributions: (1) the explicit tracking of the interaction between abstraction boundaries and subtyping; (2) support for user-declared module upgrades with propagation of the resulting subhashing relation throughout the network during communication. We prove type preservation, progress, determinacy, and erasure for our system.
Virtually Collaborating Across Cultures: A Case Study of an Online Theatrical Performance in a 3DCVE Spanning Three Continents
Authors: Theodor G. Wyeld, Ekaterina Prasolova-Forland, Teng-Wen Chang
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Much Information Communication Technology (ICT) design work involves international collaboration. This requires cross-cultural understandings with one's co-collaborators. There are few opportunities for this to occur in a pedagogical setting. This paper outlines a pedagogically-oriented case study of the use of a 3D collaborative virtual environment (3D CVE). The 3D co-located laboratory (3DCollab) described in this paper served as a crosscultural exchange platform. It fostered deeper understandings of alternate meanings to everyday social and work practices and design computing assumptions. The project involved students across three cooperating institutions, on three different continents in different time zones. It builds on previous exercises conducted by the authors.
MeTaMaF: Metadata Tagging and Mapping Framework for Managing Multimedia Content
Authors: M. Anwar Hossain, Md. Anisur Rahman, Iluju Kiringa, Abdulmotaleb El Saddik
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Metadata comes into forefront as a savior of multimedia search and management. However, the existence of the diverse set of metadata standards and the different vocabularies used by these standards has made that task especially challenging in recent days. In this paper, we propose a framework for managing multimedia content by effectively dealing with the heterogeneous multimedia metadata in a transparent fashion. The cornerstone of our approach is to leverage the existing metadata standards and provide schema and data level mapping among them. The proposed framework also allows adding new tags/vocabularies with the given metadata vocabularies, defining equivalency relationship among those vocabularies, and separately managing the metadata vocabularies outside of the actual media files. We have developed a prototype of the framework and evaluated its performance in terms of some basic query execution times.
Distances between frequency features for 3D visual pattern partitioning
Authors: Raquel Dosil, Xosé R. Fdez-Vidal, Xosé M. Pardo
Venue: Pattern Recognition Letters (2006)

In this paper we propose a technique for the decomposition of a 3D image into a set of low level patterns associated to phase congruency, which we call visual patterns. Those patterns have frequency components in a wide range of bands that are aligned in phase. The method involves clustering of the band-pass filtered versions of the image according to a measure of congruence in phase or, what is equivalent, alignment in the filter's responses energy maxima. This is achieved by defining a distance between the responses of pairs of filters and applying a hierarchical clustering analysis to the resulting distance matrix. To measure the degree of maxima alignment we propose a set of alternative distances and study their suitability. From this study we conclude that a measure of linear dependence between the local energy of filters' responses is more appropriate than a more general measure of dependence.
Voice2SQL: A Hybrid Intelligent System for the Recovery of Information from Databases by Means of Spoken Natural Language
Authors: Omar U. Florez-Choque
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this article, it is proposed a model of recovery of information from a database through queries in Natural Language using the voice as input vector. This model incorporates a Hybrid Intelligent System based on Genetic Algorithms and a Self-Organizing Map of Kohonen (SOM) to recognize the present phonemes in a word through time, which allows us to remake up a word with speaker independence. Besides, it is proposed the use of a compiler with grammar of type 2 according to the Chomsky Hierarchy to support the syntactic and semantic structure in Spanish language. Our experiments suggest that the voice and Natural Language improve notably the Human-Computer interaction regarding with traditional methods, also that it is possible to achieve a more exact recognition of words by using neural networks SOM regarding to previous approaches as Hidden Markov Models (HMM).
Design and Performance Evaluation of a Proxy-based Java Rewriting Security System
Authors: Yougang Song, Ying Xu, Brett D. Fleisch
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Binary rewriting techniques have been developed to allow users to enforce security policies directly on mobile code. However, the performance overheads incurred for improved security, particularly in large organizations with many end-hosts, accentuate the inherent challenges of code rewriting and limit the rate of improvement in these systems. We integrate a binary code rewriter with a web caching proxy and build the security system called PBJARS, a Proxy-based JAva Rewriting System. PBJARS compliments existing JVM security mechanisms by placing another line of security defense in the code path code associated with code downloads. It gives system administrators centralized security control at the level of administrative domains at proxy servers. We evaluated PB-JARS using real Java binary traffic models derived from analyzing real web trace records. Our experimental results show that the overhead added by binary rewriting can be significantly amortized by web caching and PB-JARS adds negligible performance impact on proxy servers.
Digital image watermarking for joint ownership verification without a trusted dealer
Authors: Huiping Guo, N. D. Georganas
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we propose a novel watermarking algorithm that makes use of a secret sharing scheme to address the problem of joint ownership verification for a digital image without a trusted dealer, which has not be addressed so far. Given that multiple owners create an image jointly, they collaboratively compute their own distinct keys without anyone else involved. For the watermarking detection, only when certain number of owners present their keys, can the ownership of the image be verified. Any owner alone can not verify the image ownership. In addition, experimental results show that the proposed algorithm has the desired properties such as invisibility, reliable detection and robustness against a wide range of imaging processing operations.
Elastic Local Reconstruction for Human Face Recognition
Authors: Xudong Xie, Kin-Man Lam
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In this paper, a new face recognition algorithm based on a single frontal-view image for each face subject is proposed, which considers the effect of the face manifold structure. A human face is considered a combination of a sequence of local image blocks. Then an elastic local reconstruction (ELR) method is proposed to measure the similarities between the image block pairs in order to measure the difference between the two face images. Our algorithm not only benefits from the face manifold structure, in terms of being robust to various image variations, but also is computationally simple because there is no need to build the face manifold. We evaluate the performance of our proposed face recognition algorithm with the use of different databases and consistent and promising experimental results were obtained.
Sequence Analysis in Constant Time on BSR
Authors: Limin Xiang, Kai Cheng, Kazuo Ushijima
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Sequence analysis is an important research method in bioinformatics. Constant time solutions on BSR can be found in the literature to many applications. In this paper, some problems of sequence analysis are involved, and the constant time solutions on BSR to them are proposed, which is the first constant time solutions to the problems on any model of computation.
Court Dismisses "Copyright Champion's" Source Code Copyright Suit
Authors: Richard Stern
Venue: IEEE Micro (2006)

Greg Aharonian, an IEEE intellectual property activist, describes himself as a "champion [of] the American public's interests" in the patent and copyright systems. In carrying out this self-assigned role, he sued US Attorney General Alberto Gonzales in US district court in San Francisco for a declaratory judgment. Aharonian wanted the court to declare that copyright law cannot legally be applied to protect computer source code. The court disagreed and dismissed his case (Aharonian v. Gonzales, N.D. Cal., No. C04-5190, Order of Jan. 3, 2006).
A Secure Digital Watermarking Scheme for MPEG-2 Video Copyright Protection
Authors: Yuk Ying Chung, Fang Fei Xu
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Video watermarking is an important method of protecting the intellectual property copyright of the video media. It allows embedding of copyright information into the video pictures. In this paper a new hybrid approach of digital video watermarking scheme with an Error Correcting Code (ECC) is proposed. This watermarking scheme maximizes the watermark payload while minimizing the perceptual degradation of video quality caused by the embedded watermark by means of an appropriate choice of embedding position. Two hybrid error correcting codes, BCH(31,8) and Turbo (3,1) with repetition code were implemented and compared. We found that the hybrid approach of BCH(31,8) with repetition code achieved higher error correcting capability than Turbo (3,1) with repetition code under the simulated noise tests.
Storytelling Ontology Model Using RST
Authors: Arturo Nakasone, Mitsuru Ishizuka
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Storytelling applications are increasingly being used and researched due to the fact that they are capable of conveying information and experience to users in a more natural and familiar way for them. The range of developed applications increases as we realize new ways to present content as stories or "sequences of narrative significant events". Nevertheless, implemented storytelling models are usually constrained to a particular application because of the nature of the narrated events and the way those events are linked. In order to develop a more generic model to create storytelling applications, we need to focus the solution on the manner the content is organized and conveyed to the user. We present our proposal for a generic storytelling ontology model based on the organization of events using the relations proposed by the Rhetorical Structure Theory (RST) and how narrative principles are applied to these RST relations to generate coherent stories.
8 GHz 1V, CMOS quadrature downconverter for wireless applications
Authors: Farsheed Mahmoudi, C. Andre Salama
Venue: Analog Integrated Circuits and Signal Processing (2006)

The design and implementation of an 8 GHz CMOS quadrature downconverter, achieving simultaneously low voltage supply operation and good linearity is presented in this paper. This is achieved by relaxing the inherent tradeoff between power conversion gain and linearity governing all active mixers and implementing a mixer using a new version of the bias-offset technique. The quadrature generator uses active inductors embodied in the LO buffer, and provides easy tuning by relaxing the coupling between amplitude and phase tuning of the outputs. It also provides reduced power consumption by eliminating the buffers located between the quadrature generator and the mixers. A prototype implemented in a 0.18 ¿m CMOS technology occupies an area of 0.44 × 0.3 mm2, operates from a 1V power supply and features an IIP3 of +3.5 dBm, an IIP2 of better than +48 dBm, an input compression point of ¿5.5 dBm, a power conversion gain of +6.5 dB for the mixers and a quadrature phase and amplitude matching of better than 1.5° and 1 dB respectively over a bandwidth of 100 MHz after tuning. The overall power consumption of the quadrature downconverter is 25.8 mW.
PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases
Authors: Zhenglu Yang, Masaru Kitsuregawa, Yitong Wang
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteristic of the problem - the large size of the dataset. Although there has been a great deal of effort on sequential pattern mining in recent years, its performance is still far from satisfactory. In this paper, we have proposed a new algorithm called PAssed Item Deduced sequential pattern mining (abbreviated as PAID), which can efficiently get all the frequent sequential patterns from a large database. The main difference between our strategy and the existing works is that other algorithms accumulate the candidate support in each iteration from scratch, in contrast, PAID makes good use of the temporary results (support value) of k-length frequent patterns on discovering (k+1)-length patterns, which can reduce the search space greatly in mining sequential patterns. Our experimental results and performance studies show that PAID outperforms the previous works by meaningful margins on large datasets.
Adaptive filtering of MPEG system streams in IP networks
Authors: Michael Hemy, Peter Steenkiste, Thomas Gross
Venue: Multimedia Tools and Applications (2006)

Congestion and large differences in available link bandwidth create challenges for the design of applications that want to deliver high quality video over the Internet. We present an efficient adaptive filter for MPEG System streams that can be placed in the network (e.g., as an active service). This filter adjusts the bandwidth demands of an MPEG System stream to the available bandwidth without transcoding while maintaining synchronization between the streams embedded in the MPEG System. The filter is network-friendly: it is fair with respect to other (TCP) competing streams and it avoids generating bursty traffic. This paper presents the system architecture and an evaluation of our implementation in three different operating environments: a networking testbed in a laboratory environment, a home-user scenario (DSL line with 640 Kbit/s), and a wide area network covering the Atlantic (server in Europe, client in the US). Moreover we examine the network-friendliness of the adaptation protocol and the relationship between the quality of the received continuous media and the protocol's aggressiveness. Our architecture is based on efficient MPEG System filtering to achieve high-quality video over best-effort networks.
Airport terminal-approach safety and capacity analysis using an agent-based model
Authors: Yue Xie, John Shortle, George Donohue
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The consistent growth of air traffic demand is causing the operational volumes at hub airports to approach their maximum capacities. With this growth, delays are increasing, and safety is becoming a more crucial problem. The terminal approaching and landing phases are especially important since the airspace is more crowded and operational procedures are more complicated compared with the en route phase. We have developed an agent-based stochastic simulation model which is useful to analyze the relationship among airport arrival capacity, delay, and safety. We first present a simplified queue model to demonstrate key ideas. Then, we give a detailed agent-based model that is calibrated to Hartsfield Atlanta International Airport. We use the model to evaluate several operational scenarios and examine the trade-offs between system capacity and safety.
A Model for User Profiling in an ASP Environment
Authors: M. Albanese, A. Chianese, A. Penta, A. Picariello, L. Passariello
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Nowadays an ever increasing number of companies rely on Application Service Providers for hosting some or almost all software applications. In this domain, an effective way for customizing user interfaces would be highly desirable. We propose a profiling system interacting with the applications in order to capture users' behavior. The system is based on Bayesian Networks and we show a strategy for combining data collected in each session and previous knowledge. Experiments on a prototype show that the proposed approach is promising.
Determining Maximum Stack Usage in Preemptive Shared Stack Systems
Authors: Kaj Hanninen, Jukka Maki-Turja, Markus Bohlin, Jan Carlson, Mikael Nolin
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

This paper presents a novel method to determine the maximum stack memory used in preemptive, shared stack, real-time systems. We provide a general and exact problem formulation applicable for any preemptive system model based on dynamic (run-time) properties. We also show how to safely approximate the exact stack usage by using static (compile time) information about the system model and the underlying run-time system on a relevant and commercially available system model: A hybrid, statically and dynamically, scheduled system. Comprehensive evaluations show that our technique significantly reduces the amount of stack memory needed compared to existing analysis techniques. For typical task sets a decrease in the order of 70% is typical.
Dynamic Protocol Selection in Open and Heterogeneous Systems
Authors: Jose Ghislain Quenum, Samir Aknine, Onn Shehory, Shinichi Honiden
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper addresses the problem of dynamic protocol selection in open and heterogeneous multi-agent systems (MAS) for collaborative task performance. Protocols are interaction patterns which help agents coordinate their activities. Usually, agent designers select the protocols to be used for collaborative task performance. In open and heterogeneous MAS, such selection may lead to protocol mismatch at run time. Protocol selection mismatch may in turn result in a collaborative task not being performed, although it could have been performed had the protocols been selected properly. Our solution to this problem is to enable agents to dynamically select protocols. We first study the characteristics of protocols and the descriptions of collaborative tasks. Using these characteristics and descriptions, we devise mechanisms that enable agents to dynamically select protocols when they have to perform a task in collaboration. In this work we relax some restrictive assumptions made in prior work on protocol selection, and which may hinder collaborative task performance. In particular, we do not assume that agents trust one another. Additionally, because there is no protocol specification standard, we allow several protocol specification formalisms to coexist. Our method allows agents to select their protocols locally and individually, yet coordinate their selection with other agents' selections based on message exchange flows. Since the selection is performed locally, some errors may occur in the process. Our mechanisms provide means for detecting such errors and overcoming them. As we show, the complexity of our solution is empirically sufficiently low for practical use, and the level of success in coordinated protocol selection is very high.
An Experiential Learning Model: Re-Creating the CBS GOLF PGA Computer Animated Open, Inside the Classroom
Authors: Paul Lipsky
Venue: Proceedings of the conference on Information Visualization (2006)

This exploratory case study looks at an Experiential Learning Model based on Project Based Learning. Graduate students were given the assignment to recreate a 3D computer animated open originally created for CBS Sports PGA tournament. A total of six learning objectives were initiated, evaluated, and interpreted: creativity, skill sets, productivity, team work, deadlines, and client skills.