ppxscal/embedding_network huggingface dataset:
A Robust Watermark Scheme for Copyright Protection
Authors: Chu-Hsing Lin, Jung-Chun Liu, Chih-Hsiong Shih, Yan-Wei Lee
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In this paper, we propose a robust watermark technology that can be used to protect copyright. We enhance robustness of the watermark such that it can be used to protect the intellectual property even after serious attacks on the watermarked image. In the proposed watermarking, it embeds watermarks by Singular Value Decomposition and Distributed Discrete Wavelet Transformation techniques. Regarding our method, Singular Value Decomposition provides the robustness to protect the image from most attacks except cropping. Distributed Discrete Wavelet Transformation disperses watermarks within an image to resist cropping attacks. The robustness of our proposed watermark scheme has been verified experimentally against main watermark attack families such as geometric and signal processing attacks.
Playful programming: introductory computer science using the Luwak Ludic Toolkit
Authors: Brian C. Ladd
Venue: Journal of Computing Sciences in Colleges (2008)

This workshop introduces the Luwak Ludic Toolkit (Luwak), a game-building extension of the ACM Java Task Force's acm.jar package.Luwak, taking the term ludic seriously, supports CS1 students in writing their own computer games on day one. It also addresses the "learning to program the toolkit" problem by being extremely lightweight; students learn enough to look under the hood in a single semester. This workshop provides an introduction to Luwak through a variety of assignments drawn from across a typical CS1 semester. These assignments, as well as the complete Luwak toolkit, will be available during the workshop on CD-R (or before at luwak.simplecomputergames.com). The primary goal of the workshop is to give participants enough information and material that they can start teaching with Luwak as soon as they wish.
Network decomposition and locality in distributed computation
Authors: B. Awerbuch
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The authors introduce a concept of network decomposition, a partitioning of an arbitrary graph into small-diameter connected components, such that the graph created by contracting each component into a single node has low chromatic number. They present an efficient distributed algorithm for constructing such a decomposition and demonstrate its use for design of efficient distributed algorithms. The method yields new deterministic distributed algorithms for finding a maximal independent set in an arbitrary graph and for ( Delta +1)-coloring of graphs with maximum degree Delta . These algorithms run in O(n/sup epsilon /) time for epsilon =O((log log n/log n)/sup 1/2/), whereas the best previously known deterministic algorithms required Omega (n) time. The techniques can also be used to remove randomness from the previously known most distributed breadth-first search algorithm.
Risk and relevance
Authors: Murray R. Cantor
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

Conventional wisdom is that incomplete development efforts have no value. This accountant-driven approach precludes reasoning about the ongoing return on investment for ongoing development efforts. This talk lays out a framework for quantifying the ongoing investment risk and value for ongoing development efforts. Further this talk discusses the implication of applying the framework to the governance and management of development projects and organizations.
Dose map and placement co-optimization for timing yield enhancement and leakage power reduction
Authors: Kwangok Jeong, Andrew B. Kahng, Chul-Hong Park, Hailong Yao
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In sub-100nm CMOS processes, delay and leakage power reduction continue to be among the most critical design concerns. We propose to exploit the recent availability of fine-grain exposure dose control in the stepper to achieve both design-time (placement) and manufacturing-time (yield-aware dose mapping) optimizations of timing yield and leakage power. Our placement and dose map co-optimization can simultaneously improve both timing yield and leakage power of a given design. We formulate the placement-aware dose map optimization as a quadratic program, and solve it using an efficient quadratic programming solver. In this paper, we mainly focus on the placement-aware dose map optimization problem; in the Appendix, we describe the complementary but less impactful dose map-aware placement optimization, and an efficient cell swapping heuristic. Experimental results are promising: with typical 90nm stepper (ASML Dose Mapper) parameters, we achieve more than 8% improvement in minimum cycle time of the circuit without any leakage power degradation.
A Bioinformatics Based Approach to Behavioural Biometrics
Authors: Kenneth Revett
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Behavioural biometrics is a scientific study with the primary purpose of identifying the authenticity of a user based on the way they interact with an authentication mechanism. There are several forms of behavioural biometrics such as voice analysis, signature verification, and keystroke dynamics. In this study, evidence is presented indicating that keystroke dynamics is a viable method not only for user verification, but also for identification as well. The work presented in this paper borrows ideas from the bioinformatics literature such as position specific scoring matrices (motifs) and multiple sequence alignments to provide a novel approach to user verification and identification within the context of a keystroke dynamics based user authentication system. The results in this study yield virtually 100% user authentication and identification within a single framework. Keywords: Biometrics, keystroke dynamics, position specific scoring matrix
Real-time traffic routing over a multilayered satellite architecture
Authors: Arjan Durresi
Venue: International Journal of Wireless and Mobile Computing (2008)

In this paper, we present a constraint-based routing strategy for real-time traffic over a multilayered hierarchical satellite architecture. Both quality (Bit-Error Rate BER) on free-space optical and radio Inter-Satellite Links (ISLs) and bandwidth availability on satellite links are taken into account when setting up routes for high-priority for real-time traffic such as Voice over IP (VoIP). We propose to have a separate queue for real-time traffic to protect it from being swamped by bursty best-effort traffic. Packets from several real-time flows are aggregated onto the same Label Switched Path (LSP) based on destination and priority, and are shielded from each other by a proportional dropping policy, where packets from flows exceeding their Committed Information Rate (CIR) have high dropping probability during congestion. The performance of our prioritised load balancing routing algorithm on a multilayered satellite network is simulated and analysed.
UserMap: an adaptive enhancing of user-driven XML-to-relational mapping strategies
Authors: Irena Mlýnková, Jaroslav Pokorný
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

As the XML has become a standard for data representation, it is inevitable to propose and implement techniques for efficient managing of XML data. A natural alternative is to exploit features of (object-)relational database systems, i.e. to rely on their long theoretical and practical history. The main concern of such techniques is the choice of an appropriate XML-to-relational mapping strategy. In this paper we focus on enhancing of user-driven techniques which leave the mapping decisions in hands of users who specify their requirements using schema annotations. We describe our prototype implementation called UserMap which is able to exploit the annotations more deeply searching the user-specified "hints" in the rest of the schema and applies an adaptive method on the remaining schema fragments. Using a sample set of supported fixed mapping methods we discuss problems related to query evaluation for storage strategies generated by the system, in particular correction of the candidate set of annotations and related query translation. And finally, we describe the architecture of the whole system.
Subquadratic simulations of circuits by branching programs
Authors: J.-Y. Cai, R. J. Lipton
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Boolean circuits and their simulations by bounded-width branching programs are considered. It is shown that every NC/sup 1/ circuit of size s can be simulated by a constant-width branching program of length s/sup 1.811. . ./. Some related group-theoretic results are presented.
Toward a multi-tier index for information retrieval system
Authors: Emad S. Elabd, Ahmed Z. Emam, Nabil A. Ismail, Fawzy A. Turky
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Text Information Retrieval (TIR) is considered the heart of many applications such as Document Management System (DMS). TIR that used for DMS requires different techniques of data structure than that used in the search engine. Search engine, requires special hardware (super computers with high memory) to perform information retrieval algorithms. In this paper, a new approach is developed to make it easy for DMS to perform the retrieval process with high performance. Conventional approaches are based on single inverted file but our approach is based on object and multi-tier inverted index files structure.
A kernel-based method for pattern extraction in random process signals
Authors: Majid M. Beigi, Andreas Zell
Venue: Neurocomputing (2008)

In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub-similarities at random positions representing the texture of an object. Those repetitive parts may occur in speech, musical pieces and sonar signals. We suggest a warped time-resolved spectrum kernel for extracting the subsequence similarity in time series in general, and as an example in biosonar signals. Having a set of those kernels for similarity extraction in different size of subsequences, we propose a new method to find an optimal linear combination of those kernels. We formulate the optimal kernel selection via maximizing the kernel Fisher discriminant (KFD) criterion and use Mesh Adaptive Direct Search (MADS) method to solve the optimization problem. Our method is used for biosonar landmark classification with promising results.
Using String Matching for Deep Packet Inspection
Authors: Po-Ching Lin, Ying-Dar Lin, Yuan-Cheng Lai, Tsern-Huei Lee
Venue: Computer (2008)

String matching has sparked renewed research interest due to its usefulness for deep packet inspection in applications such as intrusion detection, virus scanning, and Internet content filtering. Matching expressive pattern specifications with a scalable and efficient design, accelerating the entire packet flow, and string matching with high-level semantics are promising topics for further study.
Securing nonintrusive web encryption through information flow
Authors: Lantian Zheng, Andrew C. Myers
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

This paper proposes a nonintrusive encryption mechanism for protecting data confidentiality on the Web. The core idea is to encrypt confidential data before sending it to untrusted sites and use keystores on the Web to manage encryption keys without intervention from users. A formal language-based information flow model is used to prove the soundness of the mechanism.
The Virtue of Paranoia
Authors: George Neville-Neil
Venue: Queue (2008)

Dear KV, I just joined a company that massages large amounts of data into an internal format for its own applications to work on. Although the data is backed up regularly, I have noticed that access to this data, which has accumulated to be several petabytes in size, is not particularly well secured. There is no encryption, and although the data is not easily reachable from the Internet, everyone at the company has direct access to the volumes, both physically and electronically, all the time. Our data center is not particularly well protected either, with just two locked office doors between the outside world and the machines inside.
Problems related to a de Bruijn-Erdös theorem
Authors: Xiaomin Chen, Vašek Chvátal
Venue: Discrete Applied Mathematics (2008)

De Bruijn and Erdos proved that every noncollinear set of n points in the plane determines at least n distinct lines. We suggest a possible generalization of this theorem in the framework of metric spaces and provide partial results on related extremal combinatorial problems.
A3RP: Anonymous and Authenticated Ad Hoc Routing Protocol
Authors: Jung Ha Paik, Bum Han Kim, Dong Hoon Lee
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

According to augmentation about interests for privacy in mobile network over the past few years, researches that provide the anonymity have been conducted in a number of applications. Ad hoc routing protocols with the provisions for anonymity both protect the privacy of nodes and also restrict the collection of network information by malicious nodes. Until recently, quite a number of anonymous routing protocols have been proposed. Many of them, however, do not make allowance for authentication. Thus, vulnerabilities such as modifications to packet data and denial of service attacks can be more easily exploited. In this paper, we propose the anonymous routing protocol also furnishing authentication in the mobile ad hoc network. This protocol supports these anonymity properties which should be provided in ad hoc network. In addition, authentication is also provided by group signature for both nodes and packets during route discovery phase.
Thanks to IEEE MultiMedia's Reviewers
Venue: IEEE MultiMedia (2008)

We thank the magazine's reviewers for their dedicated work in 2007.
The daylight blocking optical stereo see-through HMD
Authors: Pedro Santos, Thomas Gierlinger, Oliver Machui, André Stork
Venue: Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges (2008)

In this paper we present an innovative daylight blocking optical stereo see-through HMD. Its outstanding capability is to pixelwise block incident daylight before super-imposing virtual content on the real scene. By doing so the device allows to seamlessly mix real and virtual content without the well-known effects of other optical see-through displays where real content will always shine through virtual content. To our knowledge related work on daylight blocking displays is very limited and we present the first commercial HMD available.
BUILDING A WIDE COVERAGE DYNAMIC GRAMMAR
Authors: Alessandro Mazzei, Vincenzo Lombardo
Venue: Applied Artificial Intelligence (2007)

Incrementality is relevant for language modeling, speech recognition, and language generation, but requires a shift of the mainstream perspective to be addressed in most current models of syntactic processing, which underlies all NLP tasks. In this paper we devise a dynamic version of Tree Adjoining Grammar (DVTAG) that encodes a strong notion of incrementality directly into the operations of the formal system. After discussing the basic features of DVTAG, we address the issue of building of a wide coverage grammar and present novel data for English and Italian.
Parameter Mapping: A genetic programming approach to function optimization
Authors: Joaos Carlo Figueira Pujol, Riccardo Poli
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

This paper describes a new approach to optimization that uses a novel representation for the parameters to be optimized. By using genetic programming, the method evolves a population of functions. The purpose of such functions is to transform initial random values of the parameters into better ones. The representation is, in principle, independent of the size of the problem being addressed. Promising results are reported, comparing the new method with differential evolution, particle swarm optimization, and genetic algorithms, on a test suite of benchmark problems.
GENETIC ALGORITHMS FOR DECISIONAL DNA: SOLVING SETS OF EXPERIENCE KNOWLEDGE STRUCTURE
Authors: Cesar Sanin, Edward Szczerbicki
Venue: Cybernetics and Systems (2007)

Set of Experience Knowledge Structure (SOE) has been shown as a tool able to collect and manage explicit knowledge of formal decision events. This structure, after being homogenized and mixed, offers a set of possible solutions that, probably, could be improved. The purpose of this article is to show a search process for improved optimal solutions by implementing Evolutionary Algorithms-EA (Genetic Algorithms-GA). Afterward, according to the user's priorities, a unique optimal solution is chosen. Subsequently, such holistic improved SOE is stored as an experienced decision, feeding a knowledge repository of Decisional DNA that would be a useful technology within many different intelligent systems and platforms, including the Knowledge Supply Chain System (KSCS).
Refining reliability estimation of mobile software systems
Authors: Roshanak Roshandel, Sam Malek
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

In this short paper, we propose an approach for incorporating runtime analysis of components communications and interactions into architecture-level reliability models. The goal is to offer a more refined reliability analysis for mobile and distributed software systems.
Modified explicit decoupled group method in the solution of 2-D elliptic PDES
Authors: Norhashidah Hj. M. Ali, Ng Kok Fu
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

In this paper, the formulation of a new explicit group method in solving the two-dimensional Poisson equation is presented. The method is derived from a skewed (rotated) five-point finite difference discretisation which results in a reduced system with lower computational complexity compared to schemes derived from the standard five-point difference approximation. The details of the algorithm will be discussed. Numerical experimentations will be conducted and comparison with the common existing schemes is reported.
Dense depth map reconstruction by phase difference-based algorithm under influence of perspective distortion
Authors: Sherif El-Etriby, Ayoub K. Al-Hamadi, Bernd Michaelis
Venue: Machine Graphics Vision International Journal (2006)

This paper describes a novel phase difference-based algorithm applied to the corresponding points in two views, which takes into account the surface perspective distortion (foreshortening). The challenges arise from the fact that stereo images are acquired from slightly different views. Therefore, the surface of a projected image is more compressed and occupies a smaller area in one view. Since the projective distortion region can not be estimated in terms of a fixed-size matching algorithm, we suggest using a local spatial frequency representation model to address this problem. Instead of matching intensities directly, a Gabor scale-space expansion (scalogram) is used. The scalogram expresses the filter output as a function of the spatial position and the principal wavelength to which the filter is tuned. The phase difference at the corresponding points in the two images is used to find the disparity value. The suggested algorithm provides an analytical closed-form expression for the perspective foreshortening effect. The foreshortening factor is verified to overcome the perspective distortion region. The efficiency and performance of the suggested algorithm for dense depth map reconstruction is demonstrated on the basis of analysis of rectified real images. Hence, our proposed method has a superior performance in comparison with other conventional methods.
Feature length-scale modeling of LPCVD and PECVD MEMS fabrication processes
Authors: Lawrence C. Musson, Pauline Ho, Steven J. Plimpton, Rodney C. Schmidt
Venue: Microsystem Technologies (2005)

The surface micromachining processes used to manufacture MEMS devices and integrated circuits transpire at such small length scales and are sufficiently complex that a theoretical analysis of them is particularly inviting. Under development at Sandia National Laboratories (SNL) is Chemically Induced Surface Evolution with Level Sets (ChISELS), a level-set based feature-scale modeler of such processes. The theoretical models used, a description of the software and some example results are presented here. The focus to date has been of low-pressure and plasma enhanced chemical vapor deposition (low-pressure chemical vapor deposition, LPCVD and PECVD) processes. Both are employed in SNLs SUMMiT V technology. Examples of step coverage of SiO2 into a trench by each of the LPCVD and PECVD process are presented.
Z-MAC: a hybrid MAC for wireless sensor networks
Authors: Injong Rhee, Ajit Warrier, Mahesh Aia, Jeongki Min, Mihail L. Sichitiu
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper presents the design, implementation and performance evaluation of a hybrid MAC protocol, called Z-MAC, for wireless sensor networks that combines the strengths of TDMA and CSMA while offsetting their weaknesses. Like CSMA, ZMAC achieves high channel utilization and low latency under low contention and like TDMA, achieves high channel utilization under high contention and reduces collision among two-hop neighbors at a low cost. A distinctive feature of Z-MAC is that its performance is robust to synchronization errors, slot assignment failures, and time-varying channel conditions; in the worst case, its performance always falls back to that of CSMA. Z-MAC is implemented in TinyOS.
DNA Inspired Digital Signal Pattern Matching Algorithm
Authors: Oh Hyuk Kwon, Kyu Yrul Wang, Ji Yoon Kim, Jeahyun Park, Duck Jin Chung, Chong Ho Lee
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In this paper, a new algorithm for supervised pattern classification is proposed. One application area of DNA computing is the pattern matching problem which arise signal processing applications. The noise tolerance pattern matching can be achieved using hybridization property of DNA computing. The proposed algorithm overcomes some of the limitations that DNA computing as in this field. In the algorithm, a set of sample data is replicated and compared with test data permitting some of different features. These processes emulate the replication and hybridization of DNA computing. The results of classification for cardiovascular disease show better accuracy. Because of the simpler procedure, the proposed algorithm can be implemented on hardware employing parallel architecture, which mimics the as massive parallelism of DNA computing.