ppxscal/embedding_network huggingface dataset:
Digital Watermarking and Steganography, 2nd edition
Authors: Ingemar Cox, Matthew Miller, Jeffrey Bloom, Jessica Fridrich, Ton Kalker
Venue: The Morgan Kaufmann Series In Multimedia Information And Systems (2007)

Digital audio, video, images, and documents are flying through cyberspace to their respective owners. Unfortunately, along the way, individuals may choose to intervene and take this content for themselves. Digital watermarking and steganography technology greatly reduces the instances of this by limiting or eliminating the ability of third parties to decipher the content that he has taken. The many techiniques of digital watermarking (embedding a code) and steganography (hiding information) continue to evolve as applications that necessitate them do the same. The authors of this second edition provide an update on the framework for applying these techniques that they provided researchers and professionals in the first well-received edition. Steganography and steganalysis (the art of detecting hidden information) have been added to a robust treatment of digital watermarking, as many in each field research and deal with the other. New material includes watermarking with side information, QIM, and dirty-paper codes. The revision and inclusion of new material by these influential authors has created a must-own book for anyone in this profession. *This new edition now contains essential information on steganalysis and steganography*New concepts and new applications including QIM introduced*Digital watermark embedding is given a complete update with new processes and applications
How much do you tell?: information disclosure behaviour indifferent types of online communities
Authors: Johann Schrammel, Christina Köffel, Manfred Tscheligi
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

Online communities of different types have become an important part of the internet life of many people within the last couple of years. Both research and business have shown interest in studying the possibilities and risks of these relatively new phenomena. Very controversial aspects of these communities are their implications and effects on privacy issues, as research has shown that users generally provide information rather freely on such communities. However, no systematic comparison of differences in information disclosure behavior considering different types of communities is available. Furthermore only few is known about the information disclosure behavior related to demographic variables, usage contexts and usage patterns. To better understand these aspects of online communities we conducted an online survey that questioned users of various popular online communities about their information disclosure behavior and usage patterns of these sites. More than 850 users responded to our questionnaire. In this paper we present the main results of the analysis and provide linear regression models that allow understanding the involved factors in detail.
Quantifying Gait Similarity: User Authentication and Real-World Challenge
Authors: Marc Bächlin, Johannes Schumm, Daniel Roggen, Gerhard Töster
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Template-based approaches using acceleration signals have been proposed for gait-based biometric authentication. In daily life a number of real-world factors affect the users' gait and we investigate their effects on authentication performance. We analyze the effect of walking speed, different shoes, extra load, and the natural variation over days on the gait. Therefore we introduce a statistical Measure of Similarity (MOS) suited for template-based pattern recognition. The MOS and actual authentication show that these factors may affect the gait of an individual at a level comparable to the variations between individuals. A change in walking speed of 1km/h for example has the same MOS of 20% as the in-between individuals' MOS. This limits the applicability of gait-based authentication approaches. We identify how these real-world factors may be compensated and we discuss the opportunities for gait-based context-awareness in wearable computing systems.
Link Performance of an ESPAR-Antenna Array in Rich Scattering and Clustered Channels
Authors: R. Bains, R. R. Müller, A. Kalis
Venue: Wireless Personal Communications: An International Journal (2009)

This paper aims at evaluating the link performance of an electronically steerable passive array radiator (ESPAR) in both rich scattering and clustered channels. Previous work has shown that the performance of an ESPAR-antenna can be comparable to a 2 × 2 multiple-input-multiple-output (MIMO) system in a rich scattering environment. The design of the antenna patterns used for transmission was based on intuition, and therefore cannot be guaranteed to be optimal. In this paper, we design the antenna patterns by minimizing the average inner-product between signals that are transmitted with different antenna patterns. We also evaluate the performance of the ESPAR-antenna at higher spectral-efficiencies than previous literature has done. The performance in terms of spectral-efficiency is evaluated for both rich scattering environments and clustered channels, whereas the performance in terms of symbol error rate is evaluated for rich scattering channels only.
Prototype-based Domain Description
Authors: Fabrizio Angiulli
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this work a novel one-class classifier, namely the Prototype-based Domain Description rule (PDD), is presented. The PDD classifier is equivalent to the NNDD rule under the infinity Minkowski metric for a suitable choice of the prototype set. The concept of PDD consistent subset is introduced and it is shown that computing a minimum size PDD consistent subset is in general not approximable within any constant factor. A logarithmic approximation factor algorithm, called the CPDD algorithm, for computing a minimum size PDD consistent subset is then introduced. The CPDD algorithm has some parameters which allow to tune the trade off between accuracy and size of the model. Experimental results show that the CPDD rule sensibly improves over the CNNDD classifier in terms of size of the subset, while guaranteeing a comparable classification quality.
Embedding continuous lifelong verification in service life cycles
Authors: Domenico Bianculli, Carlo Ghezzi, Cesare Pautasso
Venue: Proceedings of the 2009 ICSE Workshop on Principles of Engineering Service Oriented Systems (2009)

Service-oriented systems are an instantiation of open world software, which is characterized by high dynamism and decentralization. These properties strongly impact on how service-oriented systems are engineered, built, and operated, as well as verified. To address the challenges of applying verification to open service-oriented systems, in this position paper we propose to apply verification across the entire life cycle of a service and introduce a verification-oriented service life cycle.
Studies in bounded query hierarchies
Authors: Richard Chang
Venue:  (2008)

Do more queries to SAT allow us to compute more functions? It is known that when f(n) = O(log n), where n is the input length, the set of functions computable by polynomial-time Turing machines (PTMs) asking f( n)+1 SAT oracle queries is strictly larger than that computable using just f(n) SAT queries, unless the Polynomial Hierarchy (PH) collapses. However, when f(n) grows super-logarithmically, we do not know whether f( n) + 1 SAT queries are more powerful than f( n) SAT queries. Under the NP-machine hypothesis, we show that when f(n) = &omega;(log n), there exists a function g(n) > f( n) such that PFSAT[f (n)] &subne; PFSAT[g( n)].Informally, the NP-machine hypothesis is a uniform hardness assumption on NP search problems. The NP-machine hypothesis posits the existence of an &epsi; > 0 and a nondeterministic PTM which accepts the language 0* but for which no deterministic Turing machine running in 2ne time can output an accepting path infinitely often. We make use of the NP-machine hypothesis to answer another interesting question in the area of bounded query hierarchies, "What is the best PH collapse we can achieve if PTMs with access to only one SAT query can recognize the same set of languages as those with access to two SAT queries?" We show that under the NP-machine hypothesis if PSAT[1] = PSAT&mid;&mid;[2], then PH collapses down to NP. Without the NP-machine hypothesis the best previously known collapse is down to SP2, a complexity class which lies in 2P&bigcap; 2P. Are two SAT queries more powerful than a single SAT query when the base machine is a ZPP computation? It is known that even if PSAT&mid;&mid;[2] &sube; ZPPSAT1 1/poly, where 1/poly is the success probability of the ZPP computation, then PH collapses to its third level. In this thesis we show that if ZPPSAT&dvbm0;2 1-1/exp&sube;ZPPSAT1 1/2+1/poly, then PH collapses to ZPPSAT1 1/2+1/poly. We also prove that the success probability of a ZPPSAT[1] computation can be amplified by showing that ZPPSAT1 1/poly&sube;ZPPSAT1 1/4 and ZPPSAT1 1/2+1/poly&sube;ZPPSAT1 1-1/exp. Further, we show certain limitations on the amplifiability of the success probability for ZPPSAT&mid;&mid;[k ] computations, for constant k > 1.We also study the difference between serial and parallel SAToracle access mechanisms with respect to functions having limited output bits. We know that for languages PSAT[k ] = PSAT&mid;&mid;[2k -1] whereas for functions PFSAT[k ] = PFSAT&mid;&mid;[2k -1] implies P = NP. What about the functions which are limited to j bits of output? Do they behave similar to languages or similar to functions with unlimited output bits? In this thesis we show that PH collapses to its third level if PFSAT&dvbm0;l j&sube;PFSAT kj, for any k, j > 0 and l 2 k-j+1 + j - 1. Using a census argument, we can show that PFSAT&dvbm0;2k-j-1 j &sube;PFSATk j. However, when l &isin; [2k-j, 2k-j+1 - j + 1], the status of the problem remains open.
A data-locality aware mapping and scheduling framework for data-intensive computing
Authors: P. Sadayappan
Venue:  (2008)

Science is increasingly becoming more and more data-driven. With technological advancements such as advanced sensing technologies that can rapidly capture data at high resolutions and Grid technologies that enable increasingly realistic simulation of complex numerical models, scientific applications have become very data-intensive and involve storing and accessing large amounts of data. The LHC experiment at CERN is an example of a high energy physics initiative where the amount of data stored is in petabytes. The end goal in collecting petabytes of simulation data is to gain a better understanding of the problem under study. This essentially involves collaborative analysis of data by scientists across the world which conforms to a distributed data-intensive computing paradigm where a set of compute, storage and network resources are used in a collective fashion to advance science. Effective scheduling and resource management for such data-intensive applications on distributed resources is critical in order to meet their performance requirements. Efficient scheduling in the aforementioned scenario encompasses two key interrelated problems. The first one is the data staging problem which involves the staging of data from the simulation/experimental sites to the computational sites where the data analysis needs to be performed. The second one is the job mapping problem which involves the mapping of data analysis jobs to compute resources in such a manner so as to maximize the locality of data usage. Traditional batch job schedulers are designed for compute-intensive jobs running at supercomputer centers. They take into account CPU related metrics (e.g., user estimated job run times) and system state (e.g., queue wait times) to make scheduling decisions, but they do not take into account data related metrics. Therefore, there is a need for designing scheduling mechanisms for data-analysis jobs that take into account not only the computation time of the jobs, but also the overheads of retrieving files requested by those jobs. In this dissertation, we address the problem of data staging and job mapping for data-intensive jobs in both homogeneous and heterogeneous environments. We achieve this by taking into account the effects of data staging, end-point contention and data locality. For the mapping problem, we propose algorithms for mapping data-intensive jobs in both an offline and online setting. We also study the interplay between job mapping and data replication and propose algorithms which perform job mapping and data replication in a coordinated manner. For the data staging problem, we propose efficient data staging mechanisms for data centers consisting of coupled collections of storage and compute clusters. Furthermore, we extend our data staging work to a heterogeneous distributed system like the Grid. To accomplish that, we employ multi-hop path splitting and multi-pathing optimizations to improve wide-area file transfer throughput.
Conflicting discourses, conflicting values
Authors: Caroline C. Williams
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Research designed to elicit middle-school mathematics teachers' perceptions of connections between in-school and out-of-school mathematical reasoning revealed an unexpected clash. The teacher participants gave evidence of valuing both student efficiency and student understanding, but the simultaneous salience of those values was positioned by the teachers as problematic. Rather than viewing efficiency and understanding as complementary aspects of mathematics learning and doing, teachers spoke of the two values as conflicting and in opposition to one another.
A Method for Creating Teaching Materials of Practical Object-Oriented Methods Education
Authors: Izuru Kume, Naoya Nitta, Yasuhiro Takemura
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

We propose a teaching method that yields similar results to actual development projects instead of coordinating actual projects which require much labor and expense. Moreover, we propose a method of efficiently editing teaching materials from a real scale open source software product. According to this method, students can have experiences to make decisions with foresight in a realistic development process, and teachers can create teaching materials efficiently and make repeated use of them. Our method is suited to students who have acquired an understanding of object modeling and object-oriented programming but who have no experience of software development on a realistic scale.
The Story behind the Intel Atom Processor Success
Authors: Brad Beavers
Venue: IEEE Design Test (2009)

Editor's note:Many state-of-the-art designs, besides their technical challenges, require robust project execution to meet their target. This article presents the Intel Atom processor as an example to analyze&#x2014;from its management perspective&#x2014;the effectiveness of project execution, including organizational structure and geographical distribution, timely decision making, milestone definition, tracking progress, and fast recovery from surprises.&#x2014;Yervant Zorian, Virage Logic
Determining Automatically the Size of Learned Ontologies
Authors: Elias Zavitsanos, Sergios Petridis, Georgios Paliouras, George A. Vouros
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Determining the size of an ontology that is automatically learned from texts is an open issue. In this paper, we study the similarity between ontology concepts at different levels of a taxonomy, quantifying in a natural manner the quality of the ontology attained. Our approach is integrated in a method for language-neutral learning of ontologies from texts, which relies on conditional independence tests over thematic topics that are discovered using LDA.
Advances in 3D Geoinformation Systems, 1st edition
Authors: Peter van Oosterom, Peter van Oosterom, Sisi Zlatanova, Friso Penninga, Elfriede Fendel
Venue: Lecture Notes In Geoinformation And Cartography (2007)

This unique book focuses on comparing several types of 3D models. Due to the rapid developments in sensor techniques a vast amount of 3D data is available. Effective algorithms for (semi) automatic object reconstruction are required. Integration of existing 2D objects with height data is a non-trivial process and needs further research. The resulting 3D models can be maintained in several types of 3D models: TEN (Tetrahedral Network), Constructive Solid Geometry (CSG) models, Regular Polytopes, TIN Boundary representation and 3D volume quad edge structure, layered/topology models, voxel based models, 3D models used in urban planning/polyhedrons, and n-dimensional models including time. 3D analysis and 3D simulation techniques explore and extend the possibilities in spatial applications.
Probabilistic Analysis of Wireless Systems Using Theorem Proving
Authors: Osman Hasan, Sofiène Tahar
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Probabilistic techniques play a major role in the design and analysis of wireless systems as they contain a significant amount of random or unpredictable components. Traditionally, computer simulation techniques are used to perform probabilistic analysis of wireless systems but they provide inaccurate results and usually require enormous amount of CPU time in order to attain reasonable estimates. To overcome these limitations, we propose to use a higher-order-logic theorem prover (HOL) for the analysis of wireless systems. The paper presents a concise description of the formal foundations required to conduct the analysis of a wireless system in a theorem prover, such as the higher-order-logic modeling of random variables and the verification of their corresponding probabilistic and statistical properties in a theorem prover. In order to illustrate the utilization and effectiveness of the proposed idea for handling real-world wireless system analysis problems, we present an analysis of the automated repeat request (ARQ) mechanism at the logic link control (LLC) layer of the General Packet Radio Service (GPRS), which is a packet oriented mobile data service available to the users of Global System for Mobile Communications (GSM).
Free, source-code-available, or proprietary: an ethically charged, context-sensitive choice
Authors: Marty J. Wolf, Keith W. Miller, Frances S. Grodzinsky
Venue: ACM SIGCAS Computers and Society (2009)

We demonstrate that different categories of software raise different ethical concerns with respect to whether software ought to be Free Software or Proprietary Software. We outline the ethical tension between Free Software and Proprietary Software that stems from the two kinds of licenses. For some categories of software we develop support for normative statements regarding the software development landscape. We claim that as society's use of software changes, the ethical analysis for that category of software must necessarily be repeated. Finally, we make a utilitarian argument that the software development environment should encourage both Free Software and Proprietary Software to flourish.
High speed gate level synchronous full adder designs
Authors: Padmanabhan Balasubramanian, Nikos E. Mastorakis
Venue: WSEAS Transactions on Circuits and Systems (2009)

Addition forms the basis of digital computer systems. Three novel gate level full adder designs, based on the elements of a standard cell library are presented in this work: one design involving XNOR and multiplexer gates (XNM), another design utilizing XNOR, AND, Inverter, multiplexer and complex gates (XNAIMC) and the third design incorporating XOR, AND and complex gates (XAC). Comparisons have been performed with many other existing gate level full adder realizations. Based on extensive simulations with a 32-bit carry-ripple adder implementation; targeting three process, voltage and temperature (PVT) corners of the high speed (low Vt) 65nm STMicroelectronics CMOS process, it was found that the XAC based full adder is found to be delay efficient compared to all its gate level counterparts, even in comparison with the full adder cell available in the library. The XNM based full adder is found to be area efficient, while the XNAIMC based full adder offers a slight compromise with respect to speed and area over the other two proposed adders.
PIRE: a global living laboratory for cyberinfrastructure application enablement
Authors: S. M. Sadjadi, S. Chen, S. Graham, S. Luis, Y. Deng, B. Furht, P. Martinez, N. Bowen, J. Caraballo
Venue: The Fifth Richard Tapia Celebration of Diversity in Computing Conference: Intellect, Initiatives, Insight, and Innovations (2009)

This Partnership for International Research and Education (PIRE) is a 5-year long project funded by the National Science Foundation that aims to provide 196 international research and training experiences to its participants by leveraging the established programs, resources, and community of the Latin American Grid (LA Grid, an international academic and industry partnership designed to promote research, education and workforce development at major institutions in the USA, Mexico, Argentina, Spain, and other locations around the world). In return, PIRE will take LA Grid to the next level of research and education excellence. Top students, particularly underrepresented minorities, are engaged and each participant will receive multiple perspectives in each of three different aspects of collaboration as they work with (1) local and international researchers, in (2) academic and industrial research labs, and on (3) basic and applied research projects. PIRE participants will engage not only in computer science research topics focused on transparent cyberinfrastructure enablement, but will also be exposed to challenging scientific areas of national importance such as meteorology, bioinformatics, and healthcare. During the first year of this project, 18 students out of a pool of 68 applicants were selected; they participated in complementary PIRE research projects, visited 7 international institutions (spanning 5 countries and 4 continents), and published 9 papers.
Preventing the Unnecessary Propagation of BGP Withdraws
Authors: Virginie Schrieck, Pierre Francois, Cristel Pelsser, Olivier Bonaventure
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

Due to the way BGP paths are distributed over iBGP sessions inside an Autonomous System (AS), a BGP withdraw that follows a failure may be propagated outside the AS although other routers of the AS know a valid alternate path. This causes transient losses of connectivity and contributes to the propagation of a large number of unnecessary BGP messages. In this paper, we show, based on RouteViews data, that a significant number of BGP withdraws are propagated even though alternate paths exists in another border router of the same AS. We propose an incrementally deployable solution based on BGP communities that allows the BGP routers of an AS to suspend the propagation of BGP withdraws when an alternate path is available at the borders of their AS.