ppxscal/embedding_network huggingface dataset:
Inversion-Free Arithmetic on Genus 3 Hyperelliptic Curves and Its Implementations
Authors: Xinxin Fan, Thomas Wollinger, Yumin Wang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Recently, a lot of effort has been done to investigate all kinds of explicit formulae for speeding up group operation of hyperelliptic curve cryptosystem (HECC). In this paper, explicit formulae without using inversion for genus 3 HECC are given for the first time. When genus 3 HECC is defined over a prime field, our explicit formulate will cost respectively 122M + 9S, 105M + 8S and 110M + 11S to perform a group addition, mixed addition and doubling.If we use special genus 3 hyperelliptic curves with h(x)=1 over a binary field, our explicit formulate will need only 119M+9S, 102M+8S and 42M+15S for a group addition, mixed addition and doubling, respectively.In the second part of our contribution, we implement inversion-free arithmetic on genus 3 hyperelliptic curves defined over one prime field and three binary fields on a Pentium-M processor and compare the speed of explicit formulae in affine and projective coordinate system. The proposed explicit formulae show excellent performance on Pentium-M processors. We were able to get an increase in performance of over 40% compared to the affine coordinate case. Hence, our newly derived formulae are another step towards the use of HECC in practical applications.
How search engines shape the web
Authors: Byron Dom, Krishna Bharat, Andrei Broder, Marc Najork, Jan Pedersen, Yoshinobu Tonomura
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The state of the web today has been and continues to be greatly influenced by the existence of web-search engines. This panel will discuss the ways in which search engines have affected the web in the past and ways in which they may affect it in the future. Both positive and negative effects will be discussed as will potential measures to combat the latter. Besides the obvious ways in which search engines help people find content, other effects to be discussed include: the whole phenomenon of web-page spam, based on both text and link (e.g. link farms), the business of "Search Engine Optimization" (optimizing pages to rank highly in web-search results), the bided-terms business and the associated problem of click fraud, to name a few.
The value of a usability-supporting architectural pattern in software architecture design: a controlled experiment
Authors: Elspeth Golden, Bonnie E. John, Len Bass
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Design patterns have been claimed to facilitate modification and improve understanding in software design. A controlled experiment was performed to assess the usefulness of portions of a Usability-Supporting Architectural Pattern (USAP) in modifying the design of software architectures to support a specific usability concern. Software engineering and information technology graduate students received different subsets of a USAP supporting cancellation functionality. They then studied a software architecture design and made modifications to add the ability to cancel commands. Results showed that participants who received a usability scenario, a list of general responsibilities, and a sample solution thought of significantly more key issues than participants who saw only the scenario. Implications for software development are that usability concerns can be included at architecture design time, and that USAPs can significantly help software architects to consider responsibilities inherent from usability concerns.
A Generic Model-Based Test Case Generator
Authors: Miroslav Popovic, Ivan Velikic
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Statistical usage testing, also referred to as the statistical testing or behavioral testing, is today recognized as a de facto industry standard for quality assessment of large-scale embedded systems. Statistical testing is based on operational profile, essentially Markov process of a system under test. The measure of the quality is reliability of a system, i.e. mean-time-to-failure. The key part of statistical testing is automatic production of test cases in accordance to a given operational profile of the tested system. This problem has been widely addressed in literature, however there is still the need for additional research efforts in this area. In this paper we present the original model-based working environment for production of statistical test cases. The front-end of the environment is the generic modeling environment with our operational profile modeling paradigm registered to it. The back-end of the environment consists of operational profile model interpreter and a generic test case generator. The generic test case generator is the key component of the environment. It consists of previously developed test case generator engine and a newly developed generic emulator. The generic emulator is capable of emulating any system under test. The complete back-end of the environment has been written in Java programming environment.
Information extraction with term frequencies
Authors: T. R. Lynam, C. L. A. Clarke, G. V. Cormack
Venue: Proceedings of the first international conference on Human language technology research (2001)

Every day, millions of people use the internet to answer questions. Unfortunately, at present, there is no simple and successful means to consistently accomplish this goal. One common approach is to enter a few terms from a question into a Web search system and scan the resulting pages for the answer, a laborious process. To address this need, a question answering (QA) system was created to find and extract answers from a corpus. This system contains three parts: a parser for generating question queries and categories, a passage retrieval element, and an information extraction (IE) component. The extraction method was designed to elicit answers from passages collected by the information retrieval engine. The subject of this paper is the information extraction component. It is based on the premise that information related to the answer will be found many times in a large corpus like the Web.
Calendar
Authors: Jim Maurer
Venue: Queue (2005)

Calendar JUNE Red Hat Summit June 1-3, 2005 New Orleans, Louisiana http://www.redhat.com/promo/summit/
A Mutual Anonymous Peer-to-Peer Protocol Design
Authors: Jinsong Han, Yunhao Liu, Li Xiao, Renyi Xiao, Lionel M. Ni
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Peer-to-Peer (P2P) computing has become a popular application model because of its easy resource sharing pattern and powerful query search scheme. However, decentralized P2P architecture is scarcely seen to deploy the anonymity on its peers. In this paper, we propose a mutual anonymity protocol, called Secret-sharing-based Mutual Anonymity Protocol (SSMP),for decentralized P2P systems. SSMP employs Shamirs' secret sharing scheme to allow peers to issue queries and responders to deliver requested files anonymously. Compared with pre-vious designs, SSMP achieves mutual anonymity in P2P systems with a high degree of anonymity and a low cryptography processing overhead. We evaluate SSMP by comprehensive simulations.
Temporal document retrieval model for business news archives
Authors: Pawel Jan Kalczynski, Amy Chou
Venue: Information Processing and Management: an International Journal (2005)

Temporal expressions occurring in business news, such as "last week" or "at the end of this month," carry important information about the time context of the news document and were proved to be useful for document retrieval. We found that about 10% of these expressions are difficult to project onto the calendar due to the uncertainty about their bounds. This paper introduces a novel approach to representing temporal expressions. A user study is conducted to measure the degree of uncertainty for selected temporal expressions and a method for representing uncertainty based on fuzzy numbers is proposed. The classical Vector Space Model is extended to the Temporal Document Retrieval Model (TDRM) that incorporates the proposed fuzzy representations of temporal expressions.
Recommender system for auction sites
Authors: Brian Culver
Venue: Journal of Computing Sciences in Colleges (2004)

Recommender systems have become an important tool for marketing products to customers by learning and monitoring their behavior. Many of the current recommender systems available use structured information to make the "suggestions" which over time have been proven to accurately suggest products which customers would want to view. Amazon.com has implemented an excellent recommender system that uses structured data. A recommender system based on uncontrolled or unstructured data would allow auction websites to benefit from this technology. Websites such as ebay.com and ubid.com could integrate a recommender system into their websites and provide a higher level of service to their customers.
Biologically motivated machine intelligence
Authors: Harold M. Hastings, Stefan Waner
Venue: Issue 95 (January 1986) (1986)

Biological systems routinely solve problems involving pattern recognition and feature extraction. Such problems do not appear to admit similarly routine algorithmic solutions; the power of biological systems in this regard apparently arises from nonalgorithmic dynamics. It is our intention to explore, and to develop principles of, functional characteristics of natural (biological) intelligence with a view to their realization through an appropriate automation model.
A Coordinated Spatio-Temporal Access Control Model for Mobile Computing in Coalition Environments
Authors: Song Fu, Cheng-Zhong Xu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

A primary concern in mobile computing is security. Mobile clients often relocate between different networks and connect to different data servers at different times. This poses new challenges to the resource access control in mobile computing. The resource sharing in a coalition environment creates certain temporal and spatial requirements for the accesses by mobile devices. However, there is a lack of formal treatment of the impact of mobility to the shared resource access control. In this paper, we introduce the shared resource access language, SRAL, to model the behavior of mobile devices. The language is structured and compositional so that programs of a mobile device can be constructed recursively from primitive accesses. We prove that SRAL is expressive enough for most resource access patterns. In particular, it is complete in the sense that it can specify any program of regular trace model. A constraint language is defined to specify spatial constraints for shared resource accesses. The problem of checking if a mobile object satisfies a given spatial constraint can be solved in a polynomial-time algorithm. We apply duration calculus to express temporal constraints, and show the temporal constraint satisfaction problem is decidable as well. We extend the role-based access control (RBAC) model to specify and enforce spatio-temporal constraints. This coordinated access control model has been implemented in a mobile agent system, which emulates mobile computing by software agents.
On the meshing of trimmed 3D surfaces
Authors: Sudhakar R. Marur
Venue: Advances in Engineering Software (2005)

A novel approach for generating quadrilateral meshes on trimmed three-dimensional surfaces is proposed. The parametric plane to Cartesian space mapping technique is extensively employed in this approach. Newly defined 'separators', are created on a given surface and nodes are generated on them. The relationship between nodes and separators, which is invariant in both the parametric plane and Cartesian space, is maintained for the ease of triangulation. Trimmed surfaces are discretized and the resulting meshes are presented to validate the proposed algorithm.
Compositionality and locality for improving model checking in the selective mu-calculus
Authors: Antonella Santone, Gigliola Vaglini
Venue: Science of Computer Programming (2005)

Model checking is an automatic technique for verifying properties of finite concurrent systems on a structure that represents the states of the system; the crucial point of the technique is to avoid the computation of all the possible states. In this paper a method of proof for concurrent systems is presented that combines several approaches to meet the previous goal. The method exploits compositionality issues, in the presence of a parallel composition of processes, to compute at most the states of each sequential process, and not their combinations; moreover the method employs abstraction techniques to compute but a subset of the states of each sequential process. Finally, tableau-based proofs are used to allow the dynamic generation of the system states when needed, taking into account the goal of the formula verification. The tableau system is proved finite, sound and complete, for finite state systems.
The L-fuzzy Nakano hypergroup
Authors: Ath. Kehagias, K. Serafimidis
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

In this paper we start with a lattice (X, ∨, ∧) and define, in terms of ∨, a family of crisp hyperoperations ⊔p (one hyperoperation for each p∈X). We show that, for every p, the hyperalgebra (X, ⊔p) is a join space and the hyperalgebra (X, ⊔p, ∧) is very similar to a hyperlattice. Then we use the hyperoperations ⊔p as p-cuts to introduce an L-fuzzy hyperoperation ⊔ and show that (X, ⊔) is an L-fuzzy join space and the hyperalgebra (X, ⊔p, ∧) is very similar to an L-fuzzy hyperlattice.
Low-Power Reconfigurable VLSI Architecture for the Implementation of FIR Filters
Authors: Evangelos F. Stefatos, Han Wei, Tughrul Arslan, Robert Thomson
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper presents a custom reconfigurable VLSI architecture that is tailored for the implementation of low-power, medium/high order, digital finite impulse response (FIR) filters. These are realized within a reconfigurable array that consists of heterogeneous, programmable, arithmetic-logic units. The reconfigurable design is based on the primitive operator design (POF) technique. The concept of a genetic algorithm (GA) is introduced, which utilizes a randix-4, 256-point fast-fourier-transform (FFT) to calculate the frequency response of the evolved filters. The results related to the performance, physical-area and power consumption make this architecture very competitive in comparison with other industrial, general purpose FPGAs.
Analysis of the dynamics of iterative interference cancellation in iterative decoding
Authors: M. V. Burnashev, C. B. Schlegel, W. A. Krzymien, Z. Shi
Venue: Problems of Information Transmission (2004)

Characteristics of a successive cancellation scheme, widely used in iterative decoding, is investigated. Comparison with another popular method, the minimum mean-square error (MMSE) method, is also provided.
A generalized model for characterizing content modification dynamics of web objects
Authors: Chi-Hung Chi, HongGuang Wang
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

In this paper, we would like to investigate one of the most fundamental questions behind dynamic web caching, the pattern and modeling for the content modification dynamics of web objects. Since content providers cannot guarantee 100% accuracy about the life-span of a web object, a single-valued expire time is found to be too simple to describe its content modification dynamics for risk analysis to reuse copies of the data in the local cache. To capture the statistical features of the content modification dynamics of a web object, a novel mathematical quantity matrix is proposed. The three statistical metrics of measurement are: dynamic degree, predictability index, and safety bound for prediction. All our arguments and models are verified through active monitoring of the content change of real web objects.
A Metadata Catalog Service for Data Intensive Applications
Authors: Gurmeet Singh, Shishir Bharathi, Ann Chervenak, Ewa Deelman, Carl Kesselman, Mary Manohar, Sonal Patil, Laura Pearlman
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Advances in computational, storage and network technologies as well as middle ware such as the Globus Toolkit allow scientists to expand the sophistication and scope of data-intensive applications. These applications produce and analyze terabytes and petabytes of data that are distributed in millions of files or objects. To manage these large data sets efficiently, metadata or descriptive information about the data needs to be managed. There are various types of metadata, and it is likely that a range of metadata services will exist in Grid environments that are specialized for particular types of metadata cataloguing and discovery. In this paper, we present the design of a Metadata Catalog Service (MCS) that provides a mechanism for storing and accessing descriptive metadata and allows users to query for data items based on desired attributes. We describe our experience in using the MCS with several applications and present a scalability study of the service.
Efficient structural joins with on-the-fly indexing
Authors: Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Previous work on structural joins mostly focuses on maintaining offline indexes on disks. Most of them also require the elements in both sets to be sorted. In this paper, we study an on-the-fly, in-memory indexing approach to structural joins. There is no need to sort the elements or maintain indexes on disks. We identify the similarity between the structural join problem and the stabbing query problem, and extend a main memory-based indexing technique for stabbing queries to structural joins.
IPS - Secure Internet Payment System
Authors: Zoran Djuric
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

There are a number of questions one might ask about security of money transactions on the Internet. A first question might be: "Why do we need to protect money transaction on the Internet?" The Internet is an insecure and unreliable communication medium - thus protection of sensitive data is needed. E-business systems inherently possess a higher degree of risk than mainstream applications, and thus require greater degree of security. Because of this risk, security should be considered a fundamental aspect of e-business system design. Especially big attention is dedicated to money transactions protection. There are dozens of electronic payment systems being developed to facilitate secure money transactions. The paper presents IPS (Internet Payment System) software implementation. Distributed system architecture allowed us to watch system segments as independent systems connected by corresponding communication protocol. Segments are: web shop, payment web segment, merchant server, payment gateway server and bank server. They communicate through secure communication tunnel, which consists of SSL tunnel and nested crypto tunnel. IPS use different cryptographic algorithms and techniques to achieve: privacy, integrity, authentication and non-repudiation.
Exponential separation between Res(k) and Res(k + 1) for k ≤ &949; logn
Authors: Nathan Segerlind
Venue: Information Processing Letters (2005)

Res(k) is a propositional proof system that extends resolution by working with k-DNFs instead of clauses. We show that there exist constants β,γ > 0 so that if k is a function from positive integers to positive integers so that for all n, k(n) ≤ βlogn, then for each n, there exists a set of clauses Cn of size nO(1) that has Res(k(n) + 1) refutations of size nO(1), yet every Res(k(n)) refutation of Cn has size at least 2nγ.
Wafer to wafer nano-imprinting lithography with monomer based thermally curable resin
Authors: Heon Lee, Gun-Young Jung
Venue: Microelectronic Engineering (2005)

Nano-imprinting lithography is one of the most promising key technologies for mass production of devices with nano-sized patterns. It is regarded as a tool for the next generation lithography (NGL). In this study, a thermally curable monomer solution was used for the imprinting process in order to lower imprinting pressure and temperature. A unique pressure vessel type imprinting system was used to imprint patterns as small as 150 nm over a whole 6 in. diameter wafer at a relatively low temperature (80 ^oC) and pressure (20 atm). Near zero residual layer under the trenches was successfully demonstrated over the whole 6 in. active area.
A systems engineering perspective on the human-centered design of health information systems
Authors: George M. Samaras, Richard L. Horst
Venue: Journal of Biomedical Informatics (2005)

The discipline of systems engineering, over the past five decades, has used a structured systematic approach to managing the "cradle to grave" development of products and processes. While elements of this approach are typically used to guide the development of information systems that instantiate a significant user interface, it appears to be rare for the entire process to be implemented. In fact, a number of authors have put forth development lifecycle models that are subsets of the classical systems engineering method, but fail to include steps such as incremental hazard analysis and post-deployment corrective and preventative actions. In that most health information systems have safety implications, we argue that the design and development of such systems would benefit by implementing this systems engineering approach in full. Particularly with regard to bringing a human-centered perspective to the formulation of system requirements and the configuration of effective user interfaces, this classical systems engineering method provides an excellent framework for incorporating human factors (ergonomics) knowledge and integrating ergonomists in the interdisciplinary development of health information systems.
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
Authors: Jan-Jan Wu, Pangfeng Liu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for solving this problem in systems where data transfer information is centrally available. This algorithm finds the optimal scheduling by constructing augmenting paths in the data transfer bipartite graph, requiring O(nmlog n + {\text{n}}^{\text{2}} {\text{log}}^{\frac{3}{2}} n) time, with n nodes and m edges in the bipartite graph. In this paper, we investigate this scheduling problem in distributed systems where data transfer information may not be centrally available. We propose a distributed scheduling algorithm, Highest Degree Lowest Workload First (HDLWF), which approximates the augmenting path algorithm in distributed environments. HDLWF is based on a distributed, two-step scheme that determines appropriate execution order of data requests through a small number of rounds of bidding between clients and I/O servers. Our experimental results indicate that HDLWF yields schedules close to the centralized optimal solution, and in some cases within 3% of the optimal solution.