ppxscal/embedding_network huggingface dataset:
An Architecture for High-Performance Scalable Shared-Memory Multiprocessors Exploiting On-Chip Integration
Authors: Manuel E. Acacio Jose Gonzalez, Jose M. Garcia, Jose Duato
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Recent technology improvements allow multiprocessor designers to put some key components inside the processor chip, such as the memory controller, the coherence hardware, and the network interface/router. In this paper, we exploit such integration scale, presenting a novel node architecture aimed at reducing the long L2 miss latencies and the memory overhead of using directories that characterize cc-NUMA machines and limit their scalability. Our proposal replaces the traditional directory with a novel three-level directory architecture, as well as it adds a small shared data cache to each of the nodes of a multiprocessor system. Due to their small size, the first-level directory and the shared data cache are integrated into the processor chip in every node, which enhances performance by saving accesses to the slower main memory. Scalability is guaranteed by having the second and third-level directories out of the processor chip and using compressed data structures. A taxonomy of the L2 misses, according to the actions performed by the directory to satisfy them, is also presented. Using execution-driven simulations, we show that significant latency reductions can be obtained by using the proposed node architecture, which translates into reductions of more than 30 percent in several cases in the application execution time.
Deformation techniques to solve generalised Pham systems
Authors: Luis Miguel Pardo, Jorge San Martín
Venue: Theoretical Computer Science (2004)

In Heintz et al. (Electron. J. SADIO 1(1) (1998) 37), Castro et al. (Found., Comput. Math. (2003) to appear) and Pardo (Proceedings EACA'2000, 2000, pp. 25-51), the authors have shown that universal solving procedures require exponential running time. Roughly speaking, a universal solving procedure takes as input a system of multivariate polynomial equations and outputs complete symbolic information on the solution variety. Here, we introduce a nonuniversal solving procedure adapted to Generalised Pham Systems. The aim is to compute partial information of the variety defined by the input system. The Algorithm is based on an homotopic deformation and on a non-Archimedean lifting procedure from a non-singular zero of the homotopy curve. The complexity of the procedure is also stated and it depends on some intrinsic quantity called the deformation degree of the given input system.
Spatio-Temporal Data Warehouse Design for Human Activity Pattern Analysis
Authors: L. Savary, T. Wan, K. Zeitouni
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Many applications refer to moving objects or phenomena and require spatio-temporal modelling and specific analysis. Unlike conventional data where attributes are simple values (numerical or textual), object motion defines a continue variation in space and time. This makes it difficult to handle such datasets, for instance, answering the query "how many objects cross a given area during a given time period?" This article addresses spatio-temporal data warehouse schema modelling in order to facilitate those queries and more generally, on-line analytical processing (OLAP) on spatio-temporal databases. It is illustrated on a space-time human activity survey database within the framework of a European IST project.
Pricing Strategies for Information Products: A Review
Authors: Kanliang Wang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Information product grows rapidly with the penetration of the Internet and communication technologies. Due to its unique cost structure and characteristics, it is almost impossible for its publisher to follow the traditional pricing strategy (cost plus). The essay presents a brief review of the available pricing strategies based on the framework of Pigouýs typology of price discrimination. Some recent advances related to the pricing strategy of information products are outlined.
Cult Classics
Authors: Marc Donner
Venue: IEEE Security and Privacy (2004)

In this installment of Biblio Tech, weýll look at some sci-fi works that challenge classification but have become cult items. Each has become a perennial favorite with the sci-fi community, and several have become fixtures in the computer science community. Two of these works, Dark Star and Alien, are movies, while the other, The Hitchhikerýs Guide to the Galaxy, is part of an extended novel whose universe and characters have taken on lives of their own. All three play with interesting ideas.
Protection of Cultural Heritage Contents on the Web
Authors: Vito Cappellini, Giovanna Damiani, Alessandro Piva
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The main aspects of protection of Cultural heritage contents on the Web are considered in this paper. Technological solutions related to IPR protection are presented with particular reference to Digital Rights Management Systems (DRMS). Data hiding technologies and Business Models are also described for the protection of Cultural Heritage data.
In pursuit of desktop evolution: User problems and practices with modern desktop systems
Authors: Pamela Ravasio, Sissel Guttormsen Schär, Helmut Krueger
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2004)

This study deals with the problems users encounter in their daily work with computers and the typical practices that they employ. Sixteen daily computer users were interviewed about their habits and problems that they encountered during document classification and retrieval. For both these areas, we provide an overview of identified user practices and a citation-based analysis of the problems users encountered, including those related to the use of the screen real estate (the actual desktop). Two types of problems were identified: (1) Problems that concern the actual use of the system installed on the computer. (2) Problems that arise when people realise that they are using a system that does not allow for the desired work or organizational functions sought. We were able to show that skill continues to be an important factor with respect to the ease of using today's systems. We suggest the following necessary improvements for the evolution of personal information systems: A storage facility that represents the user's view of information; replacing pure technical file metadata with more user-friendly attributes; and introduction of annotations as a new information type.
Home Automated Telemanagement in Hypertension
Authors: J. Finkelstein, A. Joshi, M. Arora
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Recent studies demonstrated that successful chronic disease management requires acoordinated effort that includes health care providers who follow recent clinical guidelines intheir every day practice, educated patients who are adherent to their prescribed treatment plans and comprehensive patient-provider communication. Studies employing telecommunication technologies have been successful in affecting the major components of chronic disease care including physician practice patterns, patient adherence to therapy, and patient-provider communication. These studies were focused mainly on an improvement of a single component of clinical care process. To date there have been no studies targeting a comprehensive coordinated approach that concurrently employs all of these components in an integrated framework linked to primary care. In this study we propose a multi-component telemanagement system providing an integrated support both to clinicians and patients in implementing hypertension treatment guidelines promulgated by the Seventh Report of the Joint National Committee on Prevention detection, Evaluation, and Treatment of High Blood Pressure.
QoS in Ontology-Based Service Classification and Discovery
Authors: D. Bianchini, V. De Antonellis, M. Melchiori
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Nowadays, many different organizations which operate in the Web distributed environment become more and more dependent on services to automate their activities and to improve their interoperability. Services are provided and published on the Web by independent organizations and their number is growing. Therefore suitable approaches to classify and organize them to support their discovery and delivery are required. In this paper, we extend our ontology-based service classification and discovery approach to consider also the important and topical aspects related to QoS. In particular, in our approach services are firstly looked for on the basis of their functional conformance to the user request and then filtered on the basis of their quality features.
Dimensional hierarchy of retail website quality
Authors: Soyoung Kim, Leslie Stoel
Venue: Information and Management (2004)

This study used Loiacono's WebQualTM scale to examine the dimensional hierarchy of the quality of apparel websites. A total of 273 female online apparel shoppers responded to a mail survey. We compared five alternative models proposing relationships among 12 dimensions of website quality. The results supported our hypothesis that website quality for sites selling apparel products was conceptualized as a 12-dimensional construct rather than as a general construct. Our results did not support Loiacono's five-dimensional second-order factor structure or our proposed six-dimensional second-order factor structure.
Boosted sampling: approximation algorithms for stochastic optimization
Authors: Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the Steiner Tree problem, for example, edges must be chosen to connect terminals (clients); in Vertex Cover, vertices must be chosen to cover edges (clients); in Facility Location, facilities must be chosen and demand vertices (clients) connected to these chosen facilities. We consider a stochastic version of such a problem where the solution is constructed in two stages: Before the actual requirements materialize, we can choose elements in a first stage. The actual requirements are then revealed, drawn from a pre-specified probability distribution π thereupon, some more elements may be chosen to obtain a feasible solution for the actual requirements. However, in this second (recourse) stage, choosing an element is costlier by a factor of σ> 1. The goal is to minimize the first stage cost plus the expected second stage cost.We give a general yet simple technique to adapt approximation algorithms for several deterministic problems to their stochastic versions via the following method. First stage: Draw σ independent sets of clients from the distribution π and apply the approximation algorithm to construct a feasible solution for the union of these sets. Second stage: Since the actual requirements have now been revealed, augment the first-stage solution to be feasible for these requirements. We use this framework to derive constant factor approximations for stochastic versions of Vertex Cover, Steiner Tree and Uncapacitated Facility Location for arbitrary distributions π in one fell swoop. For special (product) distributions, we obtain additional and improved results. Our techniques adapt and use the notion of strict cost-shares introduced in [5].
A Parallel Algorithm Based on Search Space Partition for Generating Concepts
Authors: Hong Qi, Dayou Liu, Chengquan Hu, Ming Lu, Liang Zhao
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Concept Lattice, the core data structure in FormalConcept Analysis, has been used widely in machinelearning, data mining and knowledge discovery,information retrieval, etc. The main difficulty with conceptlattice-based system comes from the lattice constructionitself. In this paper, a parallel algorithm based on theclosure search space partition for computing concepts isproposed. This algorithm divides the closure search spaceinto several subspaces in accordance with criterionsprescribed ahead and introduces an efficient scheme torecognize the valid ones, in which the searching forclosures is bounded. An intermediate structure isemployed to judge the validity of a subspace and computeclosures more efficiently. Since the searching in subspacesare independent tasks, a parallel algorithm based onsearch space partition can be directly reached.
A Comparison of Pharmacokinetic Models of Dynamic Contrast Enhanced MRI
Authors: Rujirutana Srikanchana, David Thomasson, Peter Choyke, Andrew Dwyer
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Dynamic Contrast Enhanced MRI (DCE-MRI) is often employed as an indicator of drugactivity in clinical trials of angiogenic inhibitors. The data obtained with DCE-MRI isreported semi quantitatively using parameters derived from pharmacokinetic models. MostMRI kinetic models were developed from Nuclear Medicine quantitative studies but thelimitations of MRI dictated specific modifications. A number of these MRI models are incurrent use. In this work, we review several pharmacokinetic models used in DCE-MRI inorder to determine the most appropriate model to assess tumor angiogenesis. These modelsare compared with respect to their physiological appropriateness; compartmental analysis;initial and boundary conditions; and clinically relevant output parameters.
Efficient algorithms for periodic scheduling
Authors: Amotz Bar-Noy, Vladimir Dreizin, Boaz Patt-Shamir
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

In a perfectly periodic schedule, time is divided into time slots, and each client gets a slot precisely every predefined number of time slots. The input to a schedule design algorithm is a frequency request for each client, and its task is to construct a perfectly periodic schedule that matches the requests as "closely" as possible. The quality of the schedule is measured by the ratios between the requested frequency and the allocated frequency for each client (either by the weighted average or by the maximum of these ratios over all clients). Perfectly Periodic schedules enjoy maximal fairness, and are very useful in many contexts of asymmetric communication, e.g., push systems and Bluetooth networks. However, finding an optimal perfectly periodic schedule is NP-hard.Tree scheduling is a methodology for developing perfectly periodic schedules based on hierarchical round-robin, where the hierarchy is represented by trees. In this paper, we study algorithms for constructing scheduling trees. First, we give optimal (exponential time) algorithms for both the average and the maximum measures. Second, we present a few efficient heuristic algorithms for generating schedule trees, based on the structure and the analysis of the optimal algorithms. Simulation results indicate that some of these heuristics produce excellent schedules in practice, sometimes even beating the best known non-perfectly periodic scheduling algorithms.
Assured Reconfiguration of Embedded Real-Time Software
Authors: Elisabeth A. Strunk, John C. Knight
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

It is often the case that safety-critical systems have tobe reconfigured during operation because of issues such aschanges in the systemýs operating environment or the failureof software or hardware components. Operational systemsexist that are capable of reconfiguration, but previousresearch and the techniques employed in operational systemsfor the most part either have not addressed the issue ofassurance or have been developed in an ad hoc manner. Inthis paper we present a comprehensive approach to assuredreconfiguration, providing a framework for formal verificationthat allows the developer of a reconfigurable system touse a set of application-level properties to show generalreconfiguration properties. The properties and design areillustrated through an example from NASA's Runway IncursionPrevention System.
Numerical optimization of a new robotized glass blowing process
Authors: C. Marechal, P. Moreau, D. Lochegnies
Venue: Engineering with Computers (2004)

To answer an increasing need for glass product manufacturing in both small and medium series, the first glass-blower robot was recently developed. In the face of this new technology, which particularly interests crystal glass-makers, expertise remains the main decision-making element which intervenes in the choices of the design and implementation of these new processes. Finite element models of this new blowing process were developed. After the analysis of the process and of these stages, an initial sensibility study allowed us to find the essential parameters for the success of the operation. With the results of these sensitivity analyses, an optimizer was developed to adjust virtually the forming process of a linear cylindrical vase by determining the optimal forming parameters. A second optimization allowed us to determine the initial shape of the parison, an essential parameter in the successful forming of a convex cylindrical vase. Finally, the numerical tools were validated during trial campaigns carried out in crystal glass-makers.
An Interview with Jerry Harding: Mainframes redux
Authors: M. E. Kabay
Venue: Ubiquity (2004)

Type80 Security Software, Inc. Managing Director Jerry Harding reflects on three decades of involvement with mainframe computers.
New Techniques for Disambiguation in Natural Language and Their Application to Biological Text
Authors: Filip Ginter, Jorma Boberg, Jouni Järvinen, Tapio Salakoski
Venue: The Journal of Machine Learning Research (2004)

We study the problems of disambiguation in natural language, focusing on the problem of gene vs. protein name disambiguation in biological text and also considering the problem of context-sensitive spelling error correction. We introduce a new family of classifiers based on ordering and weighting the feature vectors obtained from word counts and word co-occurrence in the text, and inspect several concrete classifiers from this family. We obtain the most accurate prediction when weighting by positions of the words in the context. On the gene/protein name disambiguation problem, this classifier outperforms both the Naive Bayes and SNoW baseline classifiers. We also study the effect of the smoothing techniques with the Naive Bayes classifier, the collocation features, and the context length on the classification accuracy and show that correct setting of the context length is important and also problem-dependent.
The AGEDIS tools for model based testing
Authors: A. Hartman, K. Nagin
Venue: ACM SIGSOFT Software Engineering Notes (2004)

We describe the tools and interfaces created by the AGEDIS project, a European Commission sponsored project for the creation of a methodology and tools for automated model driven test generation and execution for distributed systems. The project includes an integrated environment for modeling, test generation, test execution, and other test related activities. The tools support a model based testing methodology that features a large degree of automation and also includes a feedback loop integrating coverage and defect analysis tools with the test generator and execution framework. Prototypes of the tools have been tried in industrial settings providing important feedback for the creation of the next generation of tools in this area.
Reliability and Power Management of Integrated Systems
Authors: Kresimir Mihic, Tajana Simunic, Giovanni De Micheli
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

A new approach for dynamic reliability and power management of Integrated Systems, such as Systems on Chips (SoCs) and Networks on Chips (NoCs) is presented. With aggressive transistor scaling, decreased voltage margins, and increased processor power and temperature, reliability assessment has become a significant issue in design. Our work combines for the first time dynamic power management with reliability models. The joint model is used to determine system level reliability as a function of failure rates, system configuration and power management policies. We show that the overall system reliability is strongly affected by reliability network topology and power management policy.
FAME: A Fault-Pattern Based Memory Failure Analysis Framework
Authors: Kuo-Liang Cheng, Chih-Wea Wang, Jih-Nung Lee, Yung-Fa Chou, Chih-Tsun Huang, Cheng-Wen Wu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

A memory failure analysis framework is developed-the FailureAnalyzer for MEmories (FAME). The FAME integrates the MemoryError Catch and Analysis (MECA) system and the Memory Defect Diagnostics(MDD) system. The fault-type based diagnostics approachused by MECA can improve the efficiency of the test and diagnosticalgorithms. The fault-pattern based diagnostics approach used byMDD further improves the defect identification capability. The FAMEalso comes with a powerful viewer for inspecting the failure patternsand fault patterns. It provides an easy way to narrow down the potentialcause of failures and identify possible defects more accuratelyduring the memory product development and yield ramp-up stage.An experiment has been done on an industrial case, demonstratingvery accurate results in a much shorter time as compared with theconventional way.
Knowledge Sharing and Web-Based Knowledge-Sharing Platform
Authors: An Fengjie, Qiao Fei, Chen Xin
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Facing a knowledge economy and knowledge-based competition, many kinds of new management theories and techniques are adopted by the enterprises to win the competition. In this paper, the reason why Knowledge Management (KM) is imperative to the modern enterprise has been discussed. Focusing on knowledge sharing, the kernel of KM, the concept, processes, as well as obstacles to knowledge sharing have been analyzed. Based on them, a case study of knowledge sharing with background of an architecture planning enterprise is discussed. The case study illuminates how to carry out knowledge sharing inside enterprise according to the individual situation. Based on Microsoft.net, a web-based knowledge-sharing platform is developed to support knowledge sharing inside enterprise.
Storage Access Support for Soft Real-Time Applications
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Most research on QoS-aware storage has focused on theuse of QoS-aware disk schedulers. However, the increasingintelligence and autonomy of modern disk drives havemade fine-grained external disk scheduling difficult. As thistrend continues, providing QoS-aware storage through externaldisk schedulers may become infeasible in the future.In this paper, we present a coarse-grained approach to storagebandwidth management that does not rely on externaldisk schedulers. The goal is to provide better storage accesssupport for storage-bound soft real-time applications.Our approach gives priority to disk requests generated bysoft real-time applications by controlling the rate that best-effortdisk requests may be dispatched.