ppxscal/embedding_network huggingface dataset:
Leakage Power Reduction in Dual-Vdd and Dual-Vth Designs through Probabilistic Analysis of Vth Variation
Authors: Aswath Oruganti, Nagarajan Ranganathan
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

The noise sensitivity of low power circuits is rapidly increasing with the increasing levels of process variability and uncertainty. In this work, we study the problem of leakage power minimization in dual-Vdd and dual-Vth designs in the presence of significant Vth variation. The impact of the uncertainty in Vth on leakage power and timing are studied through probabilistic analytical models. We develop probabilistic models for timing slack and leakage power considering threshold variations with the objective of achieving an optimal selection of Vth. An analysis of the models indicate that, in the presence of variability, the value of the second Vth must be about 30mv higher than the Vth value obtained without considering variability. We show that our proposed method for the selection of Vth yields the lowest leakage power ratio of the dual-Vdd and dual-Vth versus the single-Vdd and single-Vth designs. In addition, the proposed models can be used to determine the ideal values for the second Vdd and Vth values in the context of variability for a variety of process conditions.
Wiki communities in the context of work processes
Authors: Frank Fuchs-Kittowski, André Köhler
Venue: Proceedings of the 2005 international symposium on Wikis (2005)

In this article we examine the integration of communities of practice supported by a wiki into work processes. Linear structures are often inappropriate for the execution of knowledge-intensive tasks and work processes. The latter are characterized by non-linear sequences and dynamic social interaction. Communities of practice, however, often lack the "guiding light" needed to structure their work. We discuss the primary requirements for the integration of formally described knowledge-intensive processes into the dynamic social processes of knowledge generation in communities of practice and use the wiki approach for their support. We present our approach for an appropriate interface to integrate wiki communities into process structures and an information retrieval algorithm based on it to connect the process-oriented structures with community-oriented wiki structures. We show the prototypical realization of the concept by a brief example.
An Educational Environment for Digital Testing: Hardware, Tools, and Web-Based Runtime Platform
Authors: A. Jutman, J. Raik, R. Ubar, V. Vislogubov
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

We describe a new e-learning environment and a runtime platform for educational tools on digital system testing and design for testability. This environment is being developed in Tallinn University of Technology and consists of several functional layers. The first one is the hardware component used for illustration of various physical phenomena appearing in defected circuits. In many cases such phenomena are hard to illustrate by software simulation or by any other means, which makes the usage of such a hardware component unavoidable. The second component is a set of university tools covering a large scope of topics in basics of testing, diagnosis, and BIST. The tools represent an efficient alternative to hardto- learn and expensive commercial CAD systems. The wrapper to these two components is a cross-platform web interface that represents a server-based solution for using all the available tools and the hardware over Internet. The whole platform is an extendable server-based low-cost solution, which is easy to set-up and use. The learning environment is complemented by laboratory work scenarios and teaching materials that also available in the web.
Data representation and algorithms for biomedical informatics applications
Authors: Lucila Ohno-Machado
Venue:  (2005)

Biomedical informatics is an emerging field at the intersection of computer science, biology, and medicine. The types of problems encountered in biomedical informatics are not new to computer science. These include representation of data, natural language processing, cluster analysis, and algorithm optimization. However, recently they have become far more important to the life sciences. This is a direct result of major technological advances in the biological sciences and medical research. New DNA sequencing tools can decode the entire genome of an organism, generating gigabytes of data that must be analyzed. Web portals provide physicians a means to communicate with each other, but the algorithms that push content to users must be fast and flexible enough to support the many roles a doctor might have. Digital libraries give scientists instant online access to thousands of journals, but advanced search techniques are required or else users can be swamped with information. This thesis explores five challenging computer science problems that all have applications in biomedical informatics: (1) performing efficient joins on set-valued data fields, (2) automatically assigning summary keywords to text-based documents, (3) using natural language processing to generate human-like dialog, (4) quickly finding the Hamming distance between sequences, and (5) improving stochastic hill-climbing algorithms for phylogenetic tree reconstruction by representing the data as an ordering of taxa.
Supporting Pervasive Learning Environments: Adaptability and Context Awareness in Mobile Learning
Authors: Antti Syvanen, Russell Beale, Mike Sharples, Mikko Ahonen, Peter Lonsdale
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In the mobile learning context, it is helpful to consider context awareness and adaptivity as two sides of the same coin. The purpose of the adaptivity and context awareness is to better support a variety of learners, given that they may have very different skills and motivations to learn in varying contexts. The recent research on adaptivity and context awareness has turned towards supporting pervasive environments and this is coupled with the increasing trend in seeing learning environments from an informal learning perspective. In this paper are presented experiences of developing an adaptive and context aware mobile learning system, with examples of other systems underlining the development towards supporting pervasive learning environments. We then consider approaches for the future development of systems supporting pervasive learning environments.
Humancentric Applications of RFID Implants: The Usability Contexts of Control, Convenience and Care
Authors: Amelia Masters, Katina Michael
Venue: Proceedings of the Second IEEE International Workshop on Mobile Commerce and Services (2005)

Recent developments in the area of RFID have seen the technology expand from its role in industrial and animal tagging applications, to being implantable in humans. With a gap in literature identified between current technological development and future humancentric possibility, little has been previously known about the nature of contemporary humancentric applications. This paper utilizes usability context analyses, to provide a cohesive study on the current development state of humancentric applications, detached from the emotion and prediction which plagues this particular technology.
Formal concepts and applications
Authors: Guo-Qiang Zhang
Venue:  (2005)

Formal Concept Analysis (FCA) is a powerful tool for symbolic data analysis using a mathematical structure called lattice. FCA has novel applications in areas such as data mining and information retrieval. In this thesis, we study the theory and applications of FCA. This thesis consists of three parts. The first part introduces a new notion of formal concept, called approximable concept, and connect this notion to semantic domain theory. FCA has been traditionally focused on finite contexts and finite concept lattices, therefore neglecting the full power of the theory. After a thorough investigation, we developed a new definition of concept, inspired by the ideas of partial information and successive approximation in domain theory, to provide computationally meaningful alternative. Domain theory is a branch of order theory invented by Scott for the denotational semantics of programming languages. The theoretical contribution of this part amounts to a systematic connection, in the form of a categorical equivalence, between formal concept analysis and domain theory. The second part presents a tool for automatic concept lattice layout and visualization. Concept lattices are normally represented by a list of string pairs instead of a lattice diagram. Currently, there are no standard rules for the visualization of concept lattices. We develop a tool which creates balanced and well-built lattice diagrams for finite contexts, automatically. The diagram layout of concept lattices help us understand the whole structure of concept lattices. The third part shows a method for web-menu layout design and describes a user evaluation study comparing the resulting menu layout of an existing real world web site with the one derived from our method. Most of today's web sites' menu layouts are created by the intuition of the web designers. We propose a new FCA-based semi-automatic web-menu design methodology, called FcAWN (Formal Concept Analysis for Web Navigation), to construct more consistent and reasonable layouts of web sites. In FcAWN, hyper-link hierarchies are considered as part of a lattice structure instead of a tree structure. We apply our method to Case University's EECS departmental web site to obtain a new design and implementation. A user evaluation study was conducted to compare the differences between the original site and the new one generated by FcAWN. By restricting to the data on users giving up answering questions of our carefully designed questionnaire, the FcAWN site has already shown a statistically significant advantage over the existing one in terms of usability.
Securing anonymity in P2P network
Authors: Byung Ryong Kim, Ki Chang Kim, Yoo Sung Kim
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Basically flooding-based P2P systems provide anonymity and thus it is not possible to find the initial sender of packet and the designated receiver of that packet. However it does not provide anonymity where the IP addresses of nodes uploading and downloading contents are revealed. So in order to maintain anonymity we propose and test our techniques that the receiver node of response packets on retrieval query is agent node and the agent node provides contents service between server and client. Through the proposed techniques it was found that the identity of node is secured without using encryption techniques which have been deployed in the former anonymity protection techniques and control data communications through all the nodes located between server and client. The application of this concept of which result was evaluated may be extended to many other current P2P systems under operation.
Face Recognition with Renewable and Privacy Preserving Binary Templates
Authors: T. A. M. Kevenaar, G. J. Schrijen, M. van der Veen, A. H. M. Akkermans, F. Zuo
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

This paper considers generating binary feature vectors from biometric face data such that their privacy can be protected using recently introduced helper data systems. We explain how the binary feature vectors can be derived and investigate their statistical properties. Experimental results for a subset of the FERET and Caltech databases show that their is only a slight degradation in classification results when using the binary rather than the real-valued feature vectors. Finally, the scheme to extract the binary vectors is combined with a helper data scheme leading to re-newable and privacy preserving facial templates with acceptable classification results provided that the within-class variation is not too large.
A Relationship between Linear Discriminant Analysis and the Generalized Minimum Squared~Error~Solution
Authors: Cheong Hee Park, Haesun Park
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

In this paper, a relationship between linear discriminant analysis (LDA) and the generalized minimum squared error (MSE) solution is presented. The generalized MSE solution is shown to be equivalent to applying a certain classification rule in the space defined by LDA. The relationship between the MSE solution and Fisher discriminant analysis is extended to multiclass problems and also to undersampled problems for which the classical LDA is not applicable due to singularity of the scatter matrices. In addition, an efficient algorithm for LDA is proposed exploiting its relationship with the MSE procedure. Extensive experiments verify the theoretical results.
Bit-interleaved space-time trellis coding and reduced complexity soft detection in mimo systems
Authors: Jaekyun Moon
Venue:  (2005)

It is known that a multiple-input multiple-output (MIMO) architecture provides both diversity and multiplexing gains, which makes it attractive to wireless applications aiming at increasing the link reliability or data rate. A diversity-oriented application, the concatenation of space-time trellis coding (STTC) with an outer code through a bit interleaver (BISTTC) is investigated. BISTTC is shown to outperform the concatenation of space-time block coding (STBC) with bit-interleaved coded modulation (BICM), BICM-STBC, in diversity-rich environments with practical constraints. BISTTC is particularly more attractive than BICM-STBC in the cases with more than two transmit antennas, where BICM-STBC suffers from rate loss. The pair-wise error probability (PEP) and error bound of BISTTC for general block fading channels are also analyzed. Some techniques, including limitation before integration, virtual trellis, and a novel enumeration method, have been employed to deal with the challenges in block fading channels. The bound is shown to be reasonably tight. In rate-oriented applications, spatial multiplexing (SM) together with outer BICM (BICM-SM) is preferred. However, the optimal maximum likelihood (ML) detection requires high implementation complexity. A suboptimal reduced-complexity soft detection (RCSD) algorithm is proposed to conduct constrained-delay (in spatial domain) detection while relying on soft decision feedback (SDF). RCSD achieves excellent performance/complexity tradeoff compared to existing algorithms. If channel state information (CSI) is available at both transmitter and receiver, transmitter precoding can be performed to assist detection. A linear precoding method, based on the complex Householder transform of the channel matrix into a multiple-diagonal, partial-response-like matrix, is proposed for the application of RCSD. Precoded-RCSD (PRCSD) alleviates error propagation of RCSD, and achieves full diversity as ML detection in some scenarios.
Dynamics of usage-priced communication networks: the case of a single bottleneck resource
Authors: Youngmi Jin, George Kesidis
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

In this paper, we study end-user dynamics of communication networks employing usage-based pricing. We propose a generic network access mechanism in which users modify their access control parameter based on the quality of service they receive in order to maximize their net benefit. For the examples of users sharing access to a bandwidth resource via a single trunk with Erlang loss dynamics and for a differentiated services (diffserv) network, we study the equilibrium/fixed points and give analytical results on convergence assuming the network prices are fixed.
Real time tracking of high speed movements in the context of a table tennis application
Authors: Stephan Rusdorf, Guido Brunnett
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

In this paper we summarize the experiences we made with the implementation of a table tennis application. After describing the hardware necessities of our system we give insight into different aspects of the simulation. These include collision detection, physical simulation and some aspects of the design of the virtual opponent.Since table tennis is one of the fastest sports the synchronization of the player's movements and the visual output on the projection wall is the most challenging problem to solve. Therefore we analysed the latencies of all subcomponents of our system and designed a prediction method that allows high speed interaction with our application.
Using GPUs for Machine Learning Algorithms
Authors: Dave Steinkrau, Patrice Y. Simard, Ian Buck
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Using dedicated hardware to do machine learning typically ends up in disaster because of cost, obsolescence, and poor software. The popularization of Graphic Processing Units (GPUs), which are now available on every PC, provides an attractive alternative. We propose a generic 2-layer fully connected neural network GPU implementation which yields over 3X speedup for both training and testing with respect to a 3GHz P4 CPU.
Keeping up with the Watsons: a patient look at GPSS 1100
Authors: Susan L. Solomon
Venue: ACM SIGSIM Simulation Digest (1974)

GPSS 1100 is the most recent implementation of the GPSS programming language on the large-scale UNIVAC systems, specifically including the UNIVAC 1108. The language has been in existence for several years now, and has evolved through the usual versions and growing pains. It offers a number of imaginative innovations when compared with its predecessor, GPSS/360, not to mention GPSS II, which was the only previous option of the UNIVAC user. However, despite the spadework done in GPSS/360 for at least five years prior to the birth of GPSS 1100, some excellent features of that language were not included in GPSS 1100 or continue to have bugs preventing their use.
Secure Multimedia Streaming with Trusted Digital Rights Management
Authors: Jizhong Zhao, Yong Qi, Zhaofeng Ma
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Content protection is now becoming more and more important for Digital Rights Management (DRM), which involves rights embedding, identification, rights validation digital multimedia resource is popular in the real world, how to protect multimedia content from be violated without rights control is an important thing especially to resist copy-spread kind violation. In this paper, an novel approach for multimedia rights management is proposed based on partial encryption method, which can control multimedia resource played in a rights-constraint environment, which can protect multimedia resource from being copying and spreading, and in the authorization usage environment, the protected multimedia is properly played as normal, however once the resource is beyond the authorization environment, the protected resource will not be played correctly. Experiments showed our proposed partial encryption approach was efficient with real-time quality of service, which was suitable for online multimedia streaming in content delivery network.
Vdd programmability to reduce FPGA interconnect power
Authors: Fei Li, Yan Lin, Lei He
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Power is an increasingly important design constraint for FPGAs in nanometer technologies. Because interconnect power is dominant in FPGAs, we design Vdd-programmable interconnect fabric to reduce FPGA interconnect power. There are three Vdd states for interconnect switches: high Vdd, low Vdd and power-gating. We develop a simple design flow to apply high Vdd to critical paths and low Vdd to non-critical paths and to power gate unused interconnect switches. We carry out a highly quantitative study by placing and routing benchmark circuits in 100 nm technology to illustrate the power saving. Compared to single-Vdd FPGAs with optimized but nonprogrammable Vdd level for the same target clock frequency, our new FPGA fabric on average reduces interconnect power by 56.51% and total FPGA power by 50.55%. Due to the highly low utilization rate of routing switches, majority of the power reduction is achieved by power gating unused routing buffers. In contrast, recent work that considers Vdd programmability only for logic fabric reduces total FPGA power merely by 14.29%. To the best of our knowledge, it is the first in-depth study on Vdd programmability for FPGA interconnect power reduction.
WordNet Ontology Based Model for Web Retrieval
Authors: Vaclav Snasel, Pavel Moravec, Jaroslav Pokorny
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

It is well known that ontologies will become a key piece, as they allow making the semantics of Semantic Web content explicit. In spite of the big advantages that the Semantic Web promises, there are still several problems to solve. Those concerning ontologies include their availability, development, and evolution. In the area of information retrieval, the dimension of document vectors plays an important role. Firstly, with higher index dimensions the indexing structures suffer from the "curse of dimensionality" and their efficiency rapidly decreases. Secondly, we may not use exact words when looking for a document, thus we miss some relevant documents. LSI is a numerical method, which discovers latent semantics in documents by creating concepts from existing terms. In this paper we present a basic method of mapping LSI concepts on given ontology (Word- Net), used both for retrieval recall improvement and dimension reduction.We offer experimental results for this method on a subset of TREC collection, consisting of Los Angeles Times articles.
Maximal Association Rules: A Tool for Mining Associations in Text
Authors: Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko
Venue: Journal of Intelligent Information Systems (2005)

We describe a new tool for mining association rules, which is of special value in text mining. The new tool, called maximal associations, is geared toward discovering associations that are frequently lost when using regular association rules. Intuitively, a maximal association rule $${X}\stackrel{\rm max}{\Longrightarrow}{Y}$$ says that whenever X is the only item of its type in a transaction, than Y also appears, with some confidence. Maximal associations allow the discovery of associations pertaining to items that most often do not appear alone, but rather together with closely related items, and hence associations relevant only to these items tend to obtain low confidence. We provide a formal description of maximal association rules and efficient algorithms for discovering all such associations. We present the results of applying maximal association rules to two text corpora.
Highlights from the 2005 New Security Paradigms Workshop
Authors: Simon Simon Foley, Abe Singer, Michael E. Locasto, Stelios Sidiroglou, Angelos D. Keromytis, John McDermott, Julie Thorpe, Paul van Oorschot, Anil Somayaji, Richard Ford, Mark Bush, Alex Boulatov
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

This panel highlights a selection of the most interesting and provocative papers from the 2005 New Security Paradigms Workshop. This workshop was held September 2005 - the URL for more information is http://www.nspw.org. The panel consists of authors of the selected papers, and the session is moderated by the workshop's general chairs. We present selected papers focusing on exciting major themes that emerged from the workshop. These are the papers that will provoke the most interesting discussion at ACSAC.