ppxscal/embedding_network huggingface dataset:
Transform based and search aware text compression schemes and compressed domain text retrieval
Authors: Nan Zhang
Venue:  (2005)

In this dissertation, we make the following contributions: (1) Star family compression algorithms: We have proposed an approach to develop a reversible transformation that can be applied to a source text that improves existing algorithm's ability to compress. We use a static dictionary to convert the English words into predefined symbol sequences. These transformed sequences create additional context information that is superior to the original text. Thus we achieve some compression at the preprocessing stage. We have a series of transforms which improve the performance. Star transform requires a static dictionary for a certain size. To avoid the considerable complexity of conversion, we employ the ternary tree data structure that efficiently converts the words in the text to the words in the star dictionary in linear time. (2) Exact and approximate pattern matching in Burrows-Wheeler transformed (BWT) files: We proposed a method to extract the useful context information in linear time from the BWT transformed text. The auxiliary arrays obtained from BWT inverse transform brings logarithm search time. Meanwhile, approximate pattern matching can be performed based on the results of exact pattern matching to extract the possible candidate for the approximate pattern matching. Then fast verifying algorithm can be applied to those candidates which could be just small parts of the original text. We present algorithms for both k-mismatch and k-approximate pattern matching in BWT compressed text. A typical compression system based on BWT has Move-to-Front and Huffman coding stages after the transformation. We propose a novel approach to replace the Move-to-Front stage in order to extend compressed domain search capability all the way to the entropy coding stage. A modification to the Move-to-Front makes it possible to randomly access any part of the compressed text without referring to the part before the access point. (3) Modified LZW algorithm that allows random access and partial decoding for the compressed text retrieval: Although many compression algorithms provide good compression ratio and/or time complexity, LZW is the first one studied for the compressed pattern matching because of its simplicity and efficiency. Modifications on LZW algorithm provide the extra advantage for fast random access and partial decoding ability that is especially useful for text retrieval systems. Based on this algorithm, we can provide a dynamic hierarchical semantic structure for the text, so that the text search can be performed on the expected level of granularity. (Abstract shortened by UMI.)
Experiments with an Improved Iris Segmentation Algorithm
Authors: Xiaomei Liu, Kevin W. Bowyer, Patrick J. Flynn
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Iris is claimed to be one of the best biometrics. We have collected a large data set of iris images, intentionally sampling a range of quality broader than that used by current commercial iris recognition systems. We have re-implemented the Daugman-like iris recognition algorithm developed by Masek. We have also developed and implemented an improved iris segmentation and eyelid detection stage of the algorithm, and experimentally verified the improvement in recognition performance using the collected dataset. Compared to Masek's original segmentation approach, our improved segmentation algorithm leads to an increase of over 6% in the rank-one recognition rate.
Incompressible Finite Elements via Hybridization. Part I: The Stokes System in Two Space Dimensions
Authors: Bernardo Cockburn, Jayadeep Gopalakrishnan
Venue: SIAM Journal on Numerical Analysis (2005)

In this paper, we introduce a new and efficient way to compute exactly divergence-free velocity approximations for the Stokes equations in two space dimensions. We begin by considering a mixed method that provides an exactly divergence-free approximation of the velocity and a continuous approximation of the vorticity. We then rewrite this method solely in terms of the tangential fluid velocity and the pressure on mesh edges by means of a new hybridization technique. This novel formulation bypasses the difficult task of constructing an exactly divergence-free basis for velocity approximations. Moreover, the discrete system resulting from our method has fewer degrees of freedom than the original mixed method since the pressure and the tangential velocity variables are defined just on the mesh edges. Once these variables are computed, the velocity approximation satisfying the incompressibility condition exactly, as well as the continuous numerical approximation of the vorticity, can at once be obtained locally. Moreover, a discontinuous numerical approximation of the pressure within elements can also be obtained locally. We show how to compute the matrix system for our tangential velocity-pressure formulation on general meshes and present in full detail such computations for the lowest-order case of our method.
A Light-Weight Proactive Software Change Impact Analysis Using Use Case Maps
Authors: Jacqueline Hewitt, Juergen Rilling
Venue: Proceedings of the IEEE International Workshop on Software Evolvability (2005)

Changing customer needs and technology are driving factors influencing software evolution. Consequently,, there is a need to assess the impact of these changes on existing software systems. For many users, technology is no longer the main problem, and it is likely to become a progressively smaller problem as standard solutions are provided by technology vendors. Instead, research will focus on the interface of the software with business practices. There exists a need to raise the level of abstraction further by analyzing and predicting the impact of changes at the specification level. In this research, we present a lightweight approach to identify the impact of requirement changes at the specification level. We use specification information included in Use Case Maps to analyze the potential impact of requirement changes on a system.
Pvault: a client server system providing mobile access to personal data
Authors: Ravi Chandra Jammalamadaka, Sharad Mehrotra, Nalini Venkatasubramanian
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

In this paper we describe the design for the Pvault software, which is a personal data manager that stores and retrieves data from a remote untrusted data server securely. The major advantage of Pvault is that it allows users to access their personal data from any trusted remote computer. We will describe the issues and solutions for maintaining data confidentiality and integrity when the data is stored at the remote sever, since the server itself is untrusted. Pvault also prevents Phishing and Pharming attacks and we will describe the solutions for the same.
Optimized XY-Cut for Determining a Page Reading Order
Authors: Jean-Luc Meunier
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we propose a fast method for determining the human reading order of the layout elements of a document page. The proposal includes a computationally tractable optimization approach to the problem. We also report on the performance of the method and discuss it in light of related work.
3D Face Recognition Using Two Views Face Modeling and Labeling
Authors: Yi Sun, Lijun Yin
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

The ability to distinguish different people by using 3D facial information is an active research problem being undertaken by the face recognition community. In this paper, we propose to use a generic model to label the 3D facial features. This approach relies on our realistic face modeling technique, by which the individual face model is created using a generic model and two views of a face. In the individualized model, we label the face features by their maximum and minimum curvatures. Among the labeled features, the "good features" are selected by using a Genetic Algorithm based approach. The feature space is then formed by using these new 3D shape descriptors, and each individual face is classified according to its feature space correlation. We applied 72 individual models for the test. The experimental results show that the shape information obtained from the 3D individualized model can be used to classify and identify individual facial surfaces. The rank-four correct recognition rate is about 92%. The 3D individualized model provides consistent and sufficient details to represent individual faces while using a much more simpli?ed representation than the range data models. This work provides the possibility to reduce the complexity of 3D data processing, and is feasible for real applications such as in a non-cooperative imaging circumstance or in the situation when range data using 3D scanners are not possible to acquire.
23rd International Technical Communication Conference, "Meeting the Challenge of Economic Reality"
Authors: Diana Patterson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

In aid of cross fertilization I'll attempt to bring you the best genes from this May Conference, particularly since our own Trish Durr was a participant. Most sessions dealt with the practical information: editing, graphics and management, based on the notion that in days of tight budgets, you have to be good to keep your job. Many of the ideas here are gleaned from several papers. 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
Internet-Based IC Technology Design and Simulation
Authors: V. Nelayev, V. Stempitsky, K. Kudin
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Abstract: The hardware-software platform for design, simulation and learning via Internet network was realized with use the modern facilities Internet technologies (the server Apache, programming languages PERL/PHP).
Technical state of art of "Radio Frequency Identification -- RFID" and implications regarding standardization, regulations, human exposure, privacy
Authors: Dominique Paret
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Starting from near and far electromagnetic field theory, the conference introduces the main principles used in Radio Frequency Identification - RFID i.e. inductive coupling or propagation using backscattering principle (batteryless / battery assisted) from LF 125 kHz up to SHF 5, 8 GHz.We will continue by introducing the main problems for reception of the small signals coming back from tag load modulations and demodulation mechanics and possible simulations. We will introduce also some new technological points such as Very High Baud Rate possibilities and relations between wafer processing / mounting and global tag cost.We will conclude describing important inter relations between technical ideas, technologies, standardizations, regulations, human exposure, privacy, etc..
Discovery of Maximally Frequent Tag Tree Patterns with Height-Constrained Variables from Semistructured Web Documents
Authors: Yusuke Suzuki, Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Yasuaki Nakamura
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

In order to realize Web information retrieval using characteristic tree structured patterns in semistructured Web documents, methods for discovering frequent patterns or common characteristics in semistructured documents become more and more important. We have studied methods for discovering maximally frequent tree structured patterns in semistructured Web documents. A tag tree pattern is an edge labeled tree with ordered children and structured variables. An edge label of a tag tree pattern is a tag or a keyword in Web documents, or a wildcard for any string. Each variable, which matches any subtree, represents a field of a Web document. A tag tree pattern is much more powerful than a usual tree structured pattern. In order to represent tree structured patterns with rich structural features, we introduce a new kind of variables, called height-constrained variables. An
PKIP: Feature Selection in Text Categorization for Item Banks
Authors: Atorn Nuntiyagul, Kanlaya Naruedomkul, Nick Cercone, Damras Wongsawang
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We propose an alternative approach to text categorization for item banks. An item bank is a collection of textual data in which each item consists of short sentences and has only a few relevant words for categorization; some items could be categorized into many categories. The traditional categorization techniques cannot provide sufficiently accurate results because of a "lack of words" problem. From this observation, items in the same category always have the same group of terms (or keywords) and the similar locations of these terms in phrases suggest that the items have a high probability to be in the same category. Our new methodology PKIP, patterned keywords in phrase, is proposed to improve categorization accuracy and recover from the "lack of words" problem. The k-highest weight order words are selected as the keywords from each category and their patterns are mapped for feature selection. The value of k affects the classification result. The item bank categorization process is based on a supervised machine learning technique. The sample of the item bank that is used in this research is the collection of Thai primary mathematics problems item bank and we use SVM in the Weka machine learning software package as our classifier. The result of the classification shows that our approach produces acceptable classification results and the highest classification result is given when k = 12.
The development of user-oriented interactive systems
Authors: James Foley
Venue: ACM SIGSOC Bulletin (1979)

To build effective user-oriented computer systems, we need to develop theories of how people use computer systems and process information. We also must construct user models of various sorts. We need to apply those things that we know, disseminate what we know, and do a lot of teaching. Since we haven't been doing these things very effectively thus far, our computer systems are not particularly user-oriented or people-oriented.
Threshold Password-Authenticated Key Exchange
Authors: Philip MacKenzie, Thomas Shrimpton, Markus Jakobsson
Venue: Journal of Cryptology (2006)

In most password-authenticated key exchange systems there is a single server storing password verification data. To provide some resilience against server compromise, this data typically takes the form of a one-way function of the password (and possibly a salt, or other public values) rather than the password itself. However, if the server is compromised, this password verification data can be used to perform an off-line dictionary attack on the user's password. In this paper we propose an efficient password-authenticated key exchange system involving a set of servers with known public keys, in which a certain threshold of servers must participate in the authentication of a user, and in which the compromise of any fewer than that threshold of servers does not allow an attacker to perform an off-line dictionary attack. We prove our system is secure in the random oracle model under the Decision Diffie-Hellman assumption against an attacker that may eavesdrop on, insert, delete, or modify messages between the user and servers, and that compromises fewer than that threshold of servers.
Ambient functionality in MIMOSA from technology to services
Authors: Pascal Ancey
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

The MIcrosystems platform for MObile Services and Applications (MIMOSA) is an European Integrated Project in the Information Society Technology (IST) priority. The goal of MIMOSA is to make Ambient Intelligence (AmI) a reality by developing a mobile-phone centric open technology platform. In MIMOSA vision, personal mobile devices act as the principal gateway to AmI. The technology platform consists of the present telecommunication technology platform augmented with the following new key building blocks: wireless sensors exploiting the RFID technology, highly integrated readers/writers for RFID tags and sensors, MEMS-based RF components and modules, low-power short-range radios, advanced integration technology and novel MEMS sensors for context sensitivity and intuitive user interfaces. In MIMOSA vision, the user feels and really is in control of AmI. AmI applications help people in their everyday life: the applications are useful, usable, reliable, and ethical issues have been taken into account in the design.
The RASE (Rapid, Accurate Simulation Environment) for chip multiprocessors
Authors: John D. Davis, Cong Fu, James Laudon
Venue: ACM SIGARCH Computer Architecture News (2005)

We present RASE, a full system high performance simulation methodology for simulating complex server applications and server class chip multiprocessors enabled with fine-grain multithreading (CMTs). RASE combines application knowledge, operating system information, and data access patterns with an instruction stream from a highly-tuned, scalable steady-state benchmark [5] [22] to generate multiple representative instruction streams that can be mapped to a variety of CMT configurations. We use execution-driven simulation to generate instruction streams for M processors and store them as instruction trace files (several billion instructions per processor) that can be post-processed and augmented for larger than M processor system simulation. We use SPEC JBB2000, TPC-C, and an XML server benchmark to compare the performance estimates of RASE to a reference prototype CMT system. By varying M, we find that our trace-driven simulation methodology predicts within 5% of the instructions per cycle (IPC) of the reference hardware for the applications. Without post-processing the traces, in the best cases, the performance prediction accuracy degrades to 20-40% of the real IPC for instruction traces that require a high replication factor.
Proving a WS-federation passive requestor profile with a browser model
Authors: Thomas Groβ, Birgit Pfitzmann, Ahmad-Reza Sadeghi
Venue: Proceedings of the 2005 workshop on Secure web services (2005)

Web-based services are an important business area. For usability and cost-effectiveness these services require users to rely only on standard browsers. A representative class of such applications, currently in the focus of many industrial players, is Federated Identity Managent (FIM). In this context we are facing challenging probls: on the one hand, the security of the existing FIM protocols (including Microsoft Passport, OASIS SAML, and Liberty) is not yet based on rigorous proofs and has been challenged by several analyses. On the other hand, the existing formal security models and proof methods cannot be applied to browser-based protocols in a straightforward manner since they only consider protocol-aware principals: they assume that the involved principals behave according to the specification of the security protocol unless they are corrupted. Web browsers, in contrast, have predefined features and are unaware of the protocol they are involved in.Based on a generic framework for security proofs of browser-based protocols, we model an important FIM protocol, the WS-Federation Passive Requestor Interop profile. We rigorously prove that the protocol provides authenticity and secure channel establishment in a realistic trust scenario. This constitutes the first rigorous security proof for a browser-based identity federation protocol.
Optimized VLIW Architecture for Non-zero IF QAM-Modem Implementations
Authors: Alok Kumar Pani, Ratnam V. Raja Kumar
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Today's general purpose DSPs keep data memory and instruction memory separate to exploit the advantages of the HARVARD architecture in addition to gaining from the instruction level parallelism available in programs through the VLIW approach. In this paper we propose an architecture, which is optimized for Modem (with carrier and symbol synchronization) implementations by making small modifications to a typical VLIW processor architecture. It is being claimed to be optimized since the most hardware intensive multipliers remain busy for almost 100% of the time and data fetches are done parallelly from a fixed locality facilitated by a unit named Data Pump. In this implementation, an instruction, namely, MMAC, which clubs two multiplications and one addition has been proposed. In addition to this, zero overhead branch instruction also has been included for the processor to be speed optimized in implementing the modem. Performance comparison has been carried out to find almost 8.5X speed enhancement over TMS320C62X and approximately 7X speed enhancement over TMS320C54X machine for modem implementations with carrier and symbol recovery. The superb speeding up is achieved at a cost of a small increase in the hardware (approximately 18750 gates).
Resource management for delivery of dynamic information
Authors: David Evans
Venue:  (2005)

Information delivery via the web has become very popular. Along with a growing user population, systems increasingly are supporting content that changes frequently, personalised information, and differentiation and choice. This thesis is concerned with the design and evaluation of resource management strategies for such systems. An architecture that provides scalability through caching proxies is considered. When a cached page is updated at the server, the cached copy may become stale if the server is not able to transmit the update to the proxies immediately. From the perspective of the server, resources are required to transmit updates for cached pages and to process requests for pages that are not cached. Analytic results on how the available resources should be managed in order to minimise staleness-related cost are presented. An efficient algorithm that the server can use to determine the set of pages that should be cached and a policy for transmitting updates for these pages are also presented. We then apply these results to page fragments, a technique that can provide increased efficiency for delivery of personalised pages.
Oxide traps characterization of 45 nm MOS transistors by gate current R.T.S. noise measurements
Authors: F. Martinez, C. Leyris, G. Neau, M. Valenza, A. Hoffmann, J. C. Vildeuil, E. Vincent, F. Boeuf, T. Skotnicki, M. Bidaud, D. Barge, B. Tavel
Venue: Microelectronic Engineering (2005)

A characterization of traps in ultrathin-oxide MOSFETs by low frequency noise measurements is presented. Drain and gate current noise measurements are investigated. 1/f drain noise magnitude allows extraction of slow oxide interface trap density. Random Telegraph Signal (R.T.S.) gate noise allows to extract properties of defects of the dielectric, such as trap energy level, cross section and its localization from the Si/SiO2 interface.