ppxscal/embedding_network huggingface dataset:
Methods for assessing web design through the internet
Authors: Elisabeth Cuddihy, Carolyn Wei, Jennifer Barrick, Brandon Maust, Alexandra L. Bartell, Jan H. Spyridakis
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Web design guidelines are often derived from best practices, conventional wisdom, or small-scale usability studies conducted in labs. We contend that if Web design guidelines are to inform the design of Web sites serving varied audiences with varied needs, the guidelines must be derived from empirical research that assesses users in their native environments as they interact with real Web sites. While we believe that the delivery of a remote Web-based experiment has many potential benefits, we acknowledge that it can be difficult to exercise experimental control so as to acquire reliable data, capture user behavior unobtrusively, extract meaningful information from server logs, and collect valid survey data. Therefore, we report on how we addressed some of the challenges of conducting remote empirical studies of the effect of navigational cues on Web browsing behavior.
A New Sparse Rule-Based Fuzzy Reasoning Method
Authors: Baowen Wang, Xia Li, Wenyuan Liu, Yan Shi
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper presents a new fuzzy interpolative reasoning method in the sparse fuzzy rule bases based on so-called similarity relations of fuzzy sets. By this reasoning method, an inference consequence can be simply obtained, and is a normal and convex fuzzy set without any limitation, which shows the potential ability of the proposed method in real-world fuzzy applications.
Biomedical named entity recognition using two-phase model based on SVMs
Authors: Ki-Joong Lee, Young-Sook Hwang, Seonho Kim, Hae-Chang Rim
Venue: Journal of Biomedical Informatics (2004)

Named entity (NE) recognition has become one of the most fundamental tasks in biomedical knowledge acquisition. In this paper, we present a two-phase named entity recognizer based on SVMs, which consists of a boundary identification phase and a semantic classification phase of named entities. When adapting SVMs to named entity recognition, the multi-class problem and the unbalanced class distribution problem become very serious in terms of training cost and performance. We try to solve these problems by separating the NE recognition task into two subtasks, where we use appropriate SVM classifiers and relevant features for each subtask. In addition, by employing a hierarchical classification method based on ontology, we effectively solve the multiclass problem concerning semantic classification. The experimental results on the GENIA corpus show that the proposed method is effective not only in reducing computational cost but also in improving performance. The F-score (β = 1) for the boundary identification is 74.8 and the F-score for the semantic classification is 66.7.
Applications of The Montgomery Exponent
Authors: Shay Gueron, Or Zuk
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

We de£ne here the Montgomery Exponent of orders, modulo the odd integer N, by MEXP =MEXP(A, X, N, s) = A^X 2^{-s(X-1)} (mod N), and illustrate some properties and usage of this operator. We show how A^X (mod N) can be obtained from MEXP(A, X, N, s) by one Montgomery multiplication. This suggests a new modulation exponentiation algorithm that uses one Montgomery multiplication less than the number required with the standard method.This improves the performance, although the improvement is signi£cant only when the exponent X is short (e.g., modular squaring or RSA veri£cation).However, and even more important, this achieves code size reduction, which is appreciated when the exponentiation algorithm is written in a low level language and stored in (expensive) ROM.We also illustrate the potential advantage in performance and code size when known cryptographic applications are modified in a way that MEXP replaces the standard modular exponentiation.
Applications of SHOP and SHOP2
Authors: Dana Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, Hector Munoz-Avila, J. William Murdock, Dan Wu, Fusun Yaman
Venue: IEEE Intelligent Systems (2005)

SHOP and SHOP2 are hierarchical task network (HTN) planning systems that were designed with two goals in mind: to investigate some research issues in automated planning, and to provide some simple, practical planning tools. They are available as open-source software and have an active base of users in government, industry, and universities. SHOP2 received one of the top four awards in the 2002 International Planning Competition. This article summarizes how SHOP and SHOP2 work, describes some of the applications that users have developed for them, and discusses directions for future work.
Construction of maximum cycles in faulty binary hypercubes
Authors: P. P. Parkhomenko
Venue: Automation and Remote Control (2005)

Consideration was given to the following problem. In the binary hypercube, given is a Hamiltonian cycle with faulty edges, or vertices, or both. Needed is to construct a length-maximum cycle without faulty components of the hypercube. The cycles are defined by the ring sequences of the weights of the hypercube edges belonging to them. The discussion was based on the example of a binary 4-dimensional hypercube.
A Perturbation Bound of the Drazin Inverse of a Matrix by Separation of Simple Invariant Subspaces
Authors: Yimin Wei, Xiezhang Li, Fanbin Bu
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

A constructive perturbation bound of the Drazin inverse of a square matrix is derived using a technique proposed by G. Stewart and based on perturbation theory for invariant subspaces. This is an improvement of the result published by the authors Wei and Li [Numer. Linear Algebra Appl., 10 (2003), pp. 563--575]. It is a totally new approach to developing perturbation bounds for the Drazin inverse of a matrix. A numerical example which indicates the sharpness of the perturbation bound is presented.
B-Theory of general linear methods for Volterra functional differential equations
Authors: Shoufu Li
Venue: Applied Numerical Mathematics (2005)

B-theory of general linear methods (GLMs) for nonlinear Volterra functional differential equations (VFDEs) is established, which provides unified theoretical foundation for the study of GLMs when applied to nonlinear initial value problems (IVPs) in stiff ordinary differential equations (ODEs), delay differential equations (DDEs), integro-differential equations (IDEs) and VFDEs of other type which appear in practice, and can be regarded as extension of the B-theory of Runge-Kutta methods for VFDEs presented by the same author in a previous paper. The extension from Runge-Kutta methods to the much more general class of GLMs is of essential importance since there exist many B-stable methods which are not one-step Runge-Kutta methods but can be regarded as special cases of GLMs.
AN UPDATE ON THE CHI'91 VIDEO PROGRAM
Authors: James Alexander, Dennis R. Goldenson
Venue: ACM SIGCHI Bulletin (1992)

As most SIGCHI Bulletin readers know videos are becoming important communications tools augmenting traditional written media. The Formal Video Program at the most recent Human Factors in Computing Systems conference (CHI'91) included seventeen referred technical videos.
MSR 2005 international workshop on mining software repositories
Authors: Ahmed E. Hassan, Richard C. Holt, Stephan Diehl
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
The skip quadtree: a simple dynamic data structure for multidimensional data
Authors: David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our data structure combines the best features of two well-known data structures, in that it has the well-defined "box"-shaped regions of region quadtrees and the logarithmic-height search and update hierarchical structure of skip lists. Indeed, the bottom level of our structure is exactly a region quadtree (or octree for higher dimensional data). We describe efficient algorithms for inserting and deleting points in a skip quadtree, as well as fast methods for performing point location, approximate range, and approximate nearest neighbor queries.
Asymptotically efficient estimation of smooth functionals of the regression function for a known distribution of the observation noise
Authors: Yu. I. Pastukhova
Venue: Problems of Information Transmission (2004)

Under the assumption that the distribution function of the observation noise is known, both for the case of a predefined observation design and the case where observation designing is possible, we construct estimates of smooth functionals of the regression function, for which lower bounds on mean-square risks of arbitrary estimates of smooth functionals obtained in [1, 2] are asymptotically attained.
A remote personal device management framework based on SyncML DM specifications
Authors: Hailiang Mei, Johan Lukkien
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

This paper describes a new design of the remote device management (RDM) framework, which is suited to personal devices. Once this Remote Personal Device Management (RPDM) framework is enabled, parties like manufacturing companies, service providers, and consumers can immediately benefit from gaining access to critical information about the operational status, maintenance functionalities and potential security issues of these devices.We give an overview and comparison of existing remote management systems and rate them on several aspects. Our new system focuses more on the special requirements of personal computing devices such as security and privacy, and complies with the newly released SyncML DM specifications. We also demonstrate the implementation to prove the feasibility of our framework. Furthermore, it is one of the very first open implementations based on the SyncML DM specifications, which, in our opinion, will help researchers and developers to better understand and work more easily with this standard in the future.
Fundamental Principles and Issues of High-speed Piezoactuated Three-legged Motion for Miniature Robots Designed for Nanometer-scale Operations
Authors: Sylvain Martel
Venue: International Journal of Robotics Research (2005)

One of the important aspects in the development of high-throughput platforms based on a fleet of scientific instruments in the form of miniature wireless robots designed for fast operations at the nanometer-scale, is the conception of an embedded locomotion system capable of fast displacements between two successive locations while being accurate enough to position the robot within the range of the embedded instrument, typically within a few tenths of nanometers. This paper describes not only the fundamental principles of the locomotion method and mechanisms but the main constraints, challenges, and environmental conditions that must be taken into account in the implementation of such a system. Preliminary experimental results show the validity of this approach.
Superconductive logic circuits constructed by the use of two thresholds of SQUID
Authors: Masahiro Kawai, Yoichiro Sato, Hiroto Kagotani, Takuji Okamoto
Venue: Systems and Computers in Japan (2005)

This paper proposes a method for constructing superconductive logic circuits by actively using two thresholds in a superconducting quantum interference device (SQUID). First, it is demonstrated that the input&ndash;output characteristics of a SQUID with multiple inputs can be represented as a two-threshold logic function. Next, a SQUID structure is shown in which all of the input currents have the same significance and the threshold current can be varied without varying the characteristics of the Josephson junction. Each input is weighted by adjusting the internal impedance rather than the input current, and the SQUID thresholds are varied using the value of the steady current applied to an additional input. Finally, it is explained that when logic functions of two to four variables are realized using such SQUIDs, the number of logic functions that can be realized with a single SQUID is much greater than when an existing method is used, and the operating regions are reduced only slightly. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(2): 42&ndash;50, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20136
Ontology Application in Software Component Registry to Achieve Semantic Interoperability
Authors: Dan Song, Wudong Liu, Yangfan He, Keqing He
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The ebXML registry has become one of the most well accepted registry standards for governments and industries. Though originally designed for B2B artifacts, almost any industrial artifact can be registered into an ebXML registry by extending the ebXML registry information model. However, this extensibility also debilitates its interoperability caused by insufficient semantic provided for it. This paper presents our solution to extend semantic for a software component in our development of SCRR system. An attribute ontology of software component is introduced to provide rich semantic information. We also explain how to implement a software component registry based on classification by applying the attribute ontology.
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
Authors: Lin Guo, Jayavel Shanmugasundaram, Kevin Beyer, Eugene Shekita
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search queries over text columns. Our main contribution is a new family of inverted list indices and associated query algorithms that can support SVR efficiently in update-intensive databases, where the structured data values (and hence the scores of documents) change frequently. Our experimental results on real and synthetic data sets using BerkeleyDB show that we can support SVR efficiently in relational databases.
Toward an Evaluation Infrastructure for Power and Energy Optimizations
Authors: Chunling Hu, Daniel A. Jimenez, Ulrich Kremer
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12 (2005)

Execution-driven simulators are often used for power/energy and performance evaluation. Simulators can provide semantic details but they provide insufficient speed and accuracy for compiler and OS research. Physical measurement is fast and objective but lacks a semantic connection between the measurement result and the evaluated program. The objective of our research is to bring together the advantages of simulation and physical measurement to build an infrastructure for power and energy optimization. Power and energy behavior is obtained through physical measurement. Simulation is used for observing the connection between power and energy behavior and the evaluated program. Our preliminary results demonstrate the ability of this infrastructure to capture detailed power behavior of any region of a program. To simplify the power/energy evaluation of programs with long execution times and overcome the limitation of physical devices, we propose using the SimPoints methodology developed by researchers at UC San Diego to find representative slices of a program. Through simulation, we validate the feasibility of the SimPoint idea in simplifying power/energy evaluation. We expect that this infrastructure will help researchers in OS/compiler power/energy optimization to evaluate their optimizations more efficiently and observe more optimization opportunities.
Sensor fusion and automatic vulnerability analysis
Authors: Rayford B. Vaughn, John Farrell, Ronda Henning, Margaret Knepper, Kevin Fox
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Security analysis of networked computing systems continues to present a challenge. The growing complexity of network and computing systems, the increasing sophistication of computer attacks, and the limited supply of security specialist make automated security solutions a necessity. A number of independent solutions are often suggested for a system and then implemented as independent sensors. Little work has been done in fusing sensor outputs in a meaningful way in order to recognize an attack in progress in time to mitigate its impact.
Effects of DOF Separation on Elastic Devices for the Navigation in 3D Virtual Environments with Force Feedback
Authors: Gery Casiez, Christophe Chaillou
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We investigated the use of a new haptic device called DigiHaptic in a 3D navigation task. Unlike other devices intended to interact in 3D with one end-effector, theDigi-Haptic has three levers that the user may handle simultaneously or not in elastic mode to rate control objects. We compared it to the SpaceMouse - another elastic device - to evaluate the influence that degrees of freedom (DOF) separation and force feedback have in terms of accuracy (errors) and speed (time) in a 3D navigation task. We found that users performed the task with the same amount of time on both devices but that DOF separation increases the control accuracy of the camera.
How to teach software modeling
Authors: Tetsuo Tamai
Venue: Proceedings of the 27th international conference on Software engineering (2005)

To enhance motivation of students to study software engineering, some way of finding balance between the scientific aspect and the practical aspect of software engineering is required. In this paper, we claim that teaching multiple software modeling techniques from a unified viewpoint is a good way of obtaining the balance and attracting the students' interest as well.
A New Full Pixel and Sub-Pixel Motion Vector Search Algorithm for Fast Block-Matching Motion Estimation in H.264
Authors: Zhenyu Wei, Baochen Jiang, Xudong Zhang, Yu Chen
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

H.264 is a new recommendation for moving picture coding proposed by JVT. In this standard, full pixel and sub-pixel motion estimation are the most important parts. The Unequal-arm adaptive rood pattern search (APRS-3) algorithm has shown a good performance on search speed-up. In this paper, we propose an improved algorithm called APRS-4 which applies an early termination technology on APRS-3 by using adaptive threshold. This early termination technology is also applied on sub-pixel motion estimation, and a new fast sub-pixel motion estimation algorithm is proposed which uses the motion vector information of the neighbor blocks. Experimental results show that both algorithms have achieved a good speed-up ratio. Compared with full-pixel motion estimation, our new algorithm could keep image quality well with almost the same bit rate.
Compact scheduling of zero-one time operations in multi-stage systems
Authors: Krzysztof Giaro, Marek Kubale
Venue: Discrete Applied Mathematics (2004)

A problem of no-wait scheduling of zero-one time operations without allowing inserted idle times is considered in the case of open, flow and mixed shop. We show that in the case of open shop this problem is equivalent to the problem of consecutive coloring the edges of a bipartite graph G. In the cases of flow shop and mixed shop this problem is equivalent to the problem of consecutive coloring the edges of G with some additional restrictions. Moreover, in all shops under consideration the problem is shown to be strongly NP-hard. Since such colorings are not always possible when the number of processors m > 3 for open shop (m > 2 for flow shop), we concentrate on special families of scheduling graphs, e.g. paths and cycles, trees, complete bipartite graphs, which can be optimally colored in polynomial time.
Autonomous Decentralized Community Communication for Information Dissemination
Authors: Khaled Ragab, Naohiro Kaji, Yuji Horikoshi, Hisayuki Kuriyama, Kinji Mori
Venue: IEEE Internet Computing (2004)

To meet the increasing demand for real-time content delivery, the proposed Autonomous Community Information System offers an efficient information dissemination infrastructure with a decentralized architecture. The aim of ACIS is to help end-user communities communicate and exchange information efficiently; to meet this goal, the system uses an application-level multicast technique that arbitrarily scales to large groups. The ACIS system also features a scalable community-construction and maintenance scheme that eases the burden of organizing an online community network.
A J2EE application for process accounting, LPAR accounting, and transaction accounting
Authors: C. Eric Wu, William P. Horn
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Accounting is critical for information technology budgeting and chargeback. Traditional accounting in UNIX/Linux systems is known as process accounting, in which an accounting record is created when a process ends. System administrators typically aggregate accounting records based on individual users or groups. As Web and application servers along with databases handle requests and transactions for multiple entities in various Web applications and services, LPAR accounting and transaction accounting become increasingly critical for service providers in shared resource environments. In this paper we present the design and implementation of a J2EE accounting application for resource usage metering. For process accounting the resulting system can generate usage reports by projects, by groups, by users, by commands, or by a combination of these identifiers. For dynamically changing partitions it generates reports for shared resources including CPUs, memories, disks, file systems, and network interfaces. For transaction accounting it generates reports based on account classes provided that applications are instrumented. It is the first known J2EE accounting application for UNIX/Linux transaction accounting.
Performance Analysis of Banyan-Type Multistage Interconnection Networks Under Nonuniform Traffic Pattern
Authors: Youngsong Mun
Venue: The Journal of Supercomputing (2005)

Multistage Interconnection Networks(MINs) have a number of applications in the areas of computer and communications. The most widely researched structure among MIN's is the (1)banyan type network. It has several variations such as buffered banyan, batcher-banyan, tandem banyan, recirculating banyan and banyan with contention resolution phase. Analytical performance evaluation is crucial for justifying the merit of the design in different operational conditions. While several analytical models have been proposed for the performance evaluation of MINs, they are mainly for uniform traffics. Even the models for nonuniform traffics have several shortcomings such as they only consider output buffered structure or do not consider blocking conditions.In this paper, the more accurate models than any other ones so far have been proposed for the performance evaluation of multibuffered banyan-type MIN's under nonuniform traffic condition is obtained. The accuracy of proposed models are conformed by comparing with the results from simulation.Firstly, single buffer model is developed. Markov chain is used for the analysis. Multibuffer model is obtained from single buffer model. Simulation is performed using Discrete Evenet Simulaton(DES) method. As a results, proposed model proves to be very accurate.