ppxscal/embedding_network huggingface dataset:
Interconnect and current density stress: an introduction to electromigration-aware design
Authors: Jens Lienig
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

Electromigration due to excessive current density stress in the interconnect can cause the premature failure of an electronic circuit. The ongoing reduction of circuit feature sizes has aggravated the problem over the last couple of years. It is therefore an important reliability issue to consider electromigration-related design parameters during interconnect design. In this tutorial, we give an introduction to the electromigration problem and its relationship to current density. We then present various physical design constraints that affect electromigration. Finally, we introduce components of an electromigration-aware physical design flow.
University of Sheffield: description of the LaSIE system as used for MUC-6
Authors: R. Gaizauskas, K. Humphreys, H. Cunningham, Y. Wilks
Venue: Proceedings of the 6th conference on Message understanding (1995)

The LaSIE (Large Scale Information Extraction) system has been developed at the University of Sheffield as part of an ongoing research effort into information extraction and, more generally, natural language engineering.
A multicriteria analysis decision support system
Authors: Krasimira Genova, Vassil Vassilev, Filip Andonov, Mariyana Vassileva, Silvia Konstantinova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper presents a multicriteria analysis decision support system called MultiChoice, designed to support decision makers in solving different multicriteria analysis problems. Various well-known methods and software systems are discussed. The basic features of the solving modules, the interface modules and the system modules are described.
Compression Standards Roles in Image Processing: Case Study
Authors: Mohammad Eyadat, Imad Muhi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

With the rapid spread of image and video processing applications and the further development of multimedia technologies, compression standards become more and more important every day. This study was conducted to investigate the role of compression standards in image processing. Digital watermarking algorithm for securing multimedia application is considered one of the most important applications heavily rely on compression standards. It was selected to perform our experimental study by employing Wavelet and JPEG compression standards. An analysis of the experiment results indicated that the Wavelet outperform JPEG compression standard and applications implemented wavelet have better performance than those implemented JPEG.
Cognitive style, hypermedia navigation and learning
Authors: Andrea Calcaterra, Alessandro Antonietti, Jean Underwood
Venue: Computers Education (2005)

This study examined the influence of cognitive style, spatial orientation and computer expertise on hypertext navigation patterns and learning outcomes when participants interacted with a hypermedia presentation. A sample of 306 undergraduates was pre-tested both on their cognitive style and on their self-reported frequency and ability in using computers. From the initial sample, 40 students were selected to form four groups with the following characteristics: (a) 10 high computer users - sequential thinkers, (b) 10 high computer users - holistic thinkers, (c) 10 low computer users - sequential thinkers and (d) 10 low computer users - holistic thinkers. All participants completed a self-report questionnaire measuring spatial orientation and were then requested to browse freely a hypermedia presentation on the ancient Mayan civilisation. Finally, the students completed a post-test to assess the recall of the hypermedia presentation and the cognitive organisation of the acquired knowledge. The results indicated that hypermedia navigation behaviour was linked to computer skills rather than to cognitive style and that learning outcomes were unaffected by cognitive style or by computer skills. However, learning outcomes were positively affected by specific search patterns, that is by re-visiting hypermedia sections and visiting overview sections in the early stages of hypermedia browsing. Further, navigating overview sections and holistic processing fostered knowledge representation in the form of maps. These findings suggest that individual differences can affect hypermedia navigation even though their role in learning is complex and the impact of cognitive style on learning outcomes was proved to be less important than initially predicted.
A study on combination of block importance and relevance to estimate page relevance
Authors: Shen Huang, Yong Yu, Shengping Li, Gui-Rong Xue, Lei Zhang
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Some work showed that segmenting web pages into "semantic independent" blocks could help to improve the whole page retrieval. One key and unexplored issue is how to combine the block importance and relevance to a given query. In this poster, we first propose an automatic way to measure block importance to improve retrieval. After that, user information need is also concerned to refine block importance for different users.
Evaluating InfiniBand Performance with PCI Express
Authors: Jiuxing Liu, Amith Mamidala, Abhinav Vishnu, Dhabaleswar K. Panda
Venue: IEEE Micro (2005)

InfiniBand host channel adapters (HCAs) with PCI Express achieve 20 to 30 percent lower latency for small messages compared with HCAs using 64-bit, 133-MHz PCI-X interfaces. PCI Express also improves performance at the MPI level, achieving a latency of 4.1 µs for small messages. It can also improve MPI collective communication and bandwidth-bound MPI application performance.
Customisable Hardware Compilation
Authors: Tim Todman, José Gabriel Coutinho, Wayne Luk
Venue: The Journal of Supercomputing (2005)

Hardware compilers for high-level languages are increasingly recognised to be the key to reducing the productivity gap for advanced circuit development in general, and for reconfigurable designs in particular. This paper explains how customisable frameworks for hardware compilation can enable rapid design exploration, and reusable and extensible hardware optimisation. It describes such a framework, based on a parallel imperative language, which supports multiple levels of design abstraction, transformational development, optimisation by compiler passes, and metalanguage facilities. Our approach has been used in producing designs for applications such as signal and image processing, with different trade-offs in performance and resource usage.
A flexible interface design for Web directories to accommodate different cognitive styles: Research Articles
Authors: Sherry Y. Chen, George D. Magoulas, Dionisios Dimakopoulos
Venue: Journal of the American Society for Information Science and Technology (2005)

Search engines are very popular tools for collecting information from distributed resources. They provide not only search facilities, but they also offer directories for users to browse content divided into groups. In this paper, we've adopted an individual differences approach to explore user's attitudes towards various interface features provided by existing Web directories. Among a variety of individual differences, cognitive style is a particularly important characteristic that influences the effectiveness of information seeking. Empirical results indicate that users' cognitive styles influence their reactions to the organization of subject categories, presentation of the results, and screen layout. We developed a set of design guidelines on the basis of these results, and propose a flexible interface that adopts these guidelines to accommodate the preferences of different cognitive style groups. &copy; 2005 Wiley Periodicals, Inc.
FootIO " Design and Evaluation of a Device to Enable Foot Interaction over a Computer Network
Authors: A. F. Rovers, H. A. van Essen
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The development of a device that enables haptic foot interaction for communication over a network is presented. Considering the physical properties of feet we demonstrate that feet are suited for personal, concealed communication over a computer network. First experiments to investigate both the usability and fun of using foot interaction indicate promising results and concrete opportunities for further development.
Congestion games with failures
Authors: Michal Penn, Maria Polukarov, Moshe Tennenholtz
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents share a common set of facilities (service providers), where each service provider (SP) may fail with some known probability. For reliability reasons, an agent may choose a subset of the SPs in order to try and perform his task. The cost of an agent for utilizing any SP is a function of the total number of agents using this SP. A main feature of this setting is that the cost for an agent for successful completion of his task is the minimum of the costs of his successful attempts. We show that although BCGFs do not admit a potential function, and thus are not isomorphic to classic congestion games, they always possess a pure-strategy Nash equilibrium. We also show that the SPs' congestion experienced in different Nash equilibria is (almost) unique. For the subclass of symmetric BCGFs we give a characterization of best and worst Nash equilibria. We extend the basic model by making task submission costly and define a model for taxed CGFs (TCGFs). We prove the existence of a pure-strategy Nash equilibrium for quasi-symmetric TCGFs, and present an efficient algorithm for constructing such Nash equilibrium in symmetric TCGFs.
A case based reasoning approach for development of intelligent services
Authors: Stanimir Stojanov, Ivan Popchev, Daniela Chaushkova, Malina Trendafilova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

A specific electronic catalog named "Cultural, historical and natural objects of Bulgaria" (BULCHINO) is developed in the E-Commerce Laboratory of the University of Plovdiv. In this paper we present a reengineering approach for the development of an intelligent electronic service. Furthermore two Case-Based Reasoning (CBR) models which are implemented in the service, are described. The service offer tourist routes, which include cultural, historical and natural objects (selected from the catalog). The service will be integrated in the next version of the catalog.
A Method to Generate Soft Shadows Using a Layered Depth Image and Warping
Authors: Yeon-Ho Im Chang-Young Han Lee-Sup Kim
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

We present an image-based method for propagating area light illumination through a Layered Depth Image (LDI) to generate soft shadows from opaque and nonrefractive transparent objects. In our approach, using the depth peeling technique, we render an LDI from a reference light sample on a planar light source. Light illumination of all pixels in an LDI is then determined for all the other sample points via warping, an image-based rendering technique, which approximates ray tracing in our method. We use an image-warping equation and McMillan's warp ordering algorithm to find the intersections between rays and polygons and to find the order of intersections. Experiments for opaque and nonrefractive transparent objects are presented. Results indicate our approach generates soft shadows fast and effectively. Advantages and disadvantages of the proposed method are also discussed.
On random pm 1 matrices: singularity and determinant
Authors: Terence Tao, Van Vu
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We proved several results concerning the determinant of a random pm 1 matrix. In particular, we show that with high probability, the determinant has absolute value very close to √n!.
Tolerating malicious gossip
Authors: Yaron M. Minsky, Fred B. Schneider
Venue: Distributed Computing (2003)

A new class of gossip protocols to diffuse updates securely is presented. The protocols rely on annotating updates with the path along which they travel. To avoid a combinatorial explosion in the number of annotated updates, rules are employed to choose which updates to keep. Different sets of rules lead to different protocols. Results of simulated executions for a collection of such protocols are described-the protocols would appear to be practical, even in large networks.
The strongly connected reliability of complete digraphs
Authors: J. I. Brown, Xiaohu Li
Venue: Networks (2005)

Given a digraph D, consider the model where each vertex is always operational, but the edges are independently operational with probability p. The strongly connected reliability of D, scRel(D,p), is the probability that the spanning subgraph of D consisting of the operational edges is strongly connected. One can view strongly connected reliability as the probability that any vertex can send information to any other vertex, given that edges fail independently. There are very few classes for which there is an efficient algorithm for calculating the strongly connected reliability. This article presents the fist polynomial time algorithm for computing the strongly connected reliability of complete digraphs, that is, digraphs in which every vertex is joined to every other vertex by exactly one edge (one in each direction). &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45(3), 165168 2005
Multi-View Geometry for General Camera Models
Authors: Peter Sturm
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We consider the structure-from-motion problem for a highly general imaging model, where cameras are modeled as possibly unconstrained sets of projection rays. This allows to describe most existing camera types, including pinhole cameras, sensors with radial or more general distortions, catadioptric cameras (central or non-central), etc. We introduce a hierarchy of general camera models: the most general model has unconstrained projection rays whereas the most constrained model dealt with here is the central model, where all rays pass through a single point. Intermediate models are what we call axial cameras (all rays touch a single line), and x-slit cameras (rays touch two lines). The foundations for a multi-view geometry of completely non-central cameras are given, leading to the formulation of multi-view matching tensors, analogous to the fundamental/essential matrices, trifocal and quadrifocal tensors of perspective cameras. This framework is then specialized explicitly for the two-view case, for the intermediate camera types mentioned above.
Cataclysm: policing extreme overloads in internet applications
Authors: Bhuvan Urgaonkar, Prashant Shenoy
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

In this paper we present the Cataclysm server platform for handling extreme overloads in hosted Internet applications. The primary contribution of our work is to develop a low overhead, highly scalable admission control technique for Internet applications. Cataclysm provides several desirable features, such as guarantees on response time by conducting accurate size-based admission control, revenue maximization at multiple time-scales via preferential admission of important requests and dynamic capacity provisioning, and the ability to be operational even under extreme overloads. Cataclysm can transparently trade-off the accuracy of its decision making with the intensity of the workload allowing it to handle incoming rates of several tens of thousands of requests/second. We implement a prototype Cataclysm hosting platform on a Linux cluster and demonstrate the benefits of our integrated approach using a variety of workloads.
A Conceptual View of Web-Based E-Learning Systems
Authors: Klaus-Dieter Schewe, Bernhard Thalheim, Aleksander Binemann-Zdanowicz, Roland Kaschek, Thomas Kuss, Bernd Tschiedel
Venue: Education and Information Technologies (2005)

Starting from a general framework for web-based e-learning systems that is based on an abstraction layer model, this paper presents a conceptual modelling approach, which captures the modelling of learners, the modelling of courses, the personalisation of courses, and the management of data in e-learning systems. Courses are modelled by outline graphs, which are further refined by some form of process algebra. The linguistic analysis of word fields referring to an application domain helps to set up these course outlines. Learners are modelled by classifying value combinations for their characteristic properties. Each learner type gives rise to intentions as well as rights and obligations in using a learning system. Intentions can be formalised as postconditions, while rights and obligations lead to deontic constraints. The intentions can be used for the personalisation of the learning system to a learner type. Finally, the management of data in an e-learning system is approached on two different levels dealing with the content of individual learning units and the integrated content of the whole system, respectively. This leads to supporting databases and views defined on them.
Increasing the Performance of CDNs Using Replication and Caching: A Hybrid Approach
Authors: Spiridon Bakiras, Thanasis Loukopoulos
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Caching and replication have emerged as the two primary techniques for reducing the delay experienced by end users when downloading web pages. Even though these techniques may benefit from each other, previous research work tends to focus on either one of them separately. In this paper we investigate the potential performance gains by using a CDN server both as a replicator and as a proxy server. We assume a common storage space for both techniques, and develop an analytical model that characterizes caching performance under various system parameters. Based on the models predictions, we can reason whether it is beneficial to reduce the caching space in order to allocate extra replicas. The resulting problem of finding which object replicas should be created where, given that any free space will be used for caching, is NP-complete. Therefore, we propose a hybrid heuristic algorithm (based on the greedy paradigm), in order to solve the combined replica placement and storage allocation problem. Our simulation results indicate that a simple LRU caching scheme can considerably improve the response time of HTTP requests, when utilized over a replication-based infrastructure.
IC Tag Based Traceability: System and Solutions
Authors: Yoji Taniguchi, Nobutoshi Sagawa
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

An increasing number of companies want to improve product traceability for several reasons: to meet stricter government regulations about food and medical safety, to cope with ever-stronger consumer demands to know exactly what they are buying, and to improve and protect the company's brand value through more transparent business operations. Two aspects of traceability are technically important: (1) techniques for tracing the events associated with the goods a company handles at all necessary points of the business operation, possibly through the use of IC tags and tag readers; and (2) ways to store, manage, and use the collected logs of events either to cope with problems or to improve business processes. In this paper, we first review currently available traceability systems by considering examples from real-world situations. After that, we discuss the likely directions and possibilities of next-generation traceability systems.
Real-Time Connectivity Constrained Depth Map Computation Using Programmable Graphics Hardware
Authors: Nico Cornelis, Luc Van Gool
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents a passive depth map computation algorithm which runs entirely on programmable 3D graphics hardware at real-time speed. Previous implementations relied on the use of either mipmapping or correlation windows to increase the robustness of the calculated depth map. These methods, however, are inherently unable to compute the depths for fine 3D structures. To overcome this obstacle we introduce a pixel-based method which incorporates connectivity information between neighboring pixels, while maintaining the performance boost gained by implementing the algorithm on a highly parallelized architecture such as graphics hardware.
Sentence ordering in multidocument summarization
Authors: Regina Barzilay, Noemie Elhadad, Kathleen R. McKeown
Venue: Proceedings of the first international conference on Human language technology research (2001)

The problem of organizing information for multidocument summarization so that the generated summary is coherent has received relatively little attention. In this paper, we describe two naive ordering techniques and show that they do not perform well. We present an integrated strategy for ordering information, combining constraints from chronological order of events and cohesion. This strategy was derived from empirical observations based on experiments asking humans to order information. Evaluation of our augmented algorithm shows a significant improvement of the ordering over the two naive techniques we used as baseline.
Genealogy database for Butler Area Public Library
Authors: Andrew Beers, Stephan Browarny
Venue: Journal of Computing Sciences in Colleges (2004)

The Butler Area Public Library (BAPL) houses the largest collection of genealogy resources in Butler County including approximately 120,000 cards of selected data from obituaries from 1885 -1960 and 1990 to the present. Due to the enormous size of the database and its continual growth, a versatile database that efficiently stores and retrieves the data was implemented. A basic search web page provides Internet access to the database; local web pages exist to securely add data to the SQL database.
Fast Multipole Method for Multivariable Integrals
Authors: Olivier Bokanowski, Mohammed Lemou
Venue: SIAM Journal on Numerical Analysis (2004)

We give a fast numerical algorithm to evaluate a class of multivariable integrals. A direct numerical evaluation of these integrals costs $N^m$, where $m$ is the number of variables and $N$ is the number of the quadrature points for each variable. For $m=2$ and $m=3$ and for only one-dimensional variables, we present an algorithm which is able to reduce this cost from $N^m$ to a cost of the order of $O((-\log \epsilon )^{\mu_m} N)$, where $\epsilon$ is the desired accuracy and $\mu_m$ is a constant that depends only on $m$. Then, we make some comments about possible extensions of such algorithms to number of variables $m\geq 4$ and to higher dimensions. This recursive algorithm can be viewed as an extension of ``fast multipole methods" to situations where the interactions between particles are more complex than the standard case of binary interactions. Numerical tests illustrating the efficiency and the limitation of this method are presented.