ppxscal/embedding_network huggingface dataset:
Unsupervised Link Discovery in Multi-relational Data via Rarity Analysis
Authors: Shou-de Lin, Hans Chalupsky
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

A significant portion of knowledge discovery and datamining research focuses on finding patterns of interest indata. Once a pattern is found, it can be used to recognizesatisfying instances. The new area of link discoveryrequires a complementary approach, since patterns ofinterest might not yet be known or might have too fewexamples to be learnable. This paper presents anunsupervised link discovery method aimed at discoveringunusual, interestingly linked entities in multi-relationaldatasets. Various notions of rarity are introduced tomeasure the "interestingness" of sets of paths andentities. These measurements have been implemented andapplied to a real-world bibliographic dataset where theygive very promising results.
Task Feasibility Analysis and Dynamic Voltage Scaling in Fault-Tolerant Real-Time Embedded Systems
Authors: Ying Zhang, Krishnendu Chakrabarty
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

We investigate dynamic voltage scaling (DVS) in realtime embedded systems that use checkpointing for fault tolerance. We present feasibility-of-scheduling tests for checkpointing schemes for a constant processor speed as well as for variable processor speeds. DVS is then carried out on the basis of the feasibility analysis. We incorporate practical issues such as faults during checkpointing and state restoration, rollback recovery time, memory access time and energy, and DVS overhead. Simulation results are presented for real-life checkpointing data and embedded processors.
Hierarchical, adaptive learning objects
Authors: Othoniel Rodriguez-Jimenez
Venue:  (2003)

Standards for describing Learning Objects (LO) are becoming increasingly important as exemplified by the work of several organizations most notably the IEEE and the IMS Global Learning Consortium. These efforts continue to advance the goals of interoperability for learning objects, but so far do not address the need for accessibility to their internal composition. Under the present standards the learning object remains an opaque entity from which valuable information cannot be easily gleaned or harvested, nor introduced or adapted. Neither the need for introducing adaptive features to the learning objects, nor the need for learner modeling is well addressed. This dissertation proposes a hierarchical approach to the design of learning objects (HALO), which is based on open standards, mostly XML markup languages and related tools, and on generic support agents. It defines an architecture for collaborative authoring, for extraction of the results of learner-to-LO interaction, for learning object adaptation, and learning object delivery through generic agents. We specify as inner-metadata the collection of layered metadata mechanisms that are used to describe these hierarchical, adaptive learning objects (HALOs), their adaptive features, and the learner interaction tracing. Learning objects designed according to this architecture still retain aspects that an author would like to reserve for future enhancement and growth, yet they provide an open architecture that supports collaborative LO authoring, adaptation and learner interaction tracing.
Telemedicine Encounter Quality: Comparing Patient and Provider Perspectives of a Socio-Technical System
Authors: Cynthia LeRouge, Alan Hevner, Rosann Collins, Monica Garfield, David Law
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

The effectiveness of the telemedicine encounter is dependent on the use of state-of-the-art technology and the quality of the technology-based interactions. We take a socio-technical approach to understanding quality during telemedicine encounters. This approach has not been well studied in telemedicine service encounter research. To enrich understanding, we use a multi-method (direct observation, interview, focus group, survey) field study to collect and interpret a rich set of data. We conduct this study from two perspectives. First, we focus on the perceptions of the medical providers (e.g. physicians) who directly use the technology and are accountable for patient care. We then compare provider perspectives to those ofpatients, who act as indirect users of telemedicine technology and are the ultimate consumers of health care services provided via telemedicine. The result of this field study is a comparative framework of quality attributes for telemedicine service encounters that prioritizes the attributes from the provider and patient perspectives.
An introduction to Web Services
Authors: Paul Muschamp
Venue: BT Technology Journal (2004)

This paper provides an introduction to Web Services. A brief history of Web Services is given, leading into an overview of the key Web Services technologies. The paper describes the way in which the IT industry has embraced Web Services and the uses to which the technologies are currently being applied. It concludes with a view of the role of both the key developers and standards bodies in the creation of Web Services and discusses the ways in which this process needs to be supported in order for Web Services to evolve.
Total Path Length for Random Recursive Trees
Authors: Robert P. Dobrow, James Allen Fill
Venue: Combinatorics, Probability and Computing (1999)

Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. Mahmoud [10] showed that Wn := (Tn &minus; E[Tn])&#x002F;n converges almost surely and in L2 to a nondegenerate limiting random variable W. Here we give recurrence relations for the moments of Wn and of W and show that Wn converges to W in Lp for each 0 < p < &infin;. We confirm the conjecture that the distribution of W is not normal. We also show that the distribution of W is characterized among all distributions having zero mean and finite variance by the distributional identity***** Insert equation here *****where &Escr;(x) := &minus; x ln x &minus; (1 minus; x) ln(1 &minus; x) is the binary entropy function, U is a uniform (0, 1) random variable, W&#x002A; and W have the same distribution, and U, W and W&#x002A; are mutually independent. Finally, we derive an approximation for the distribution of W using a Pearson curve density estimator.
A design representation for high level synthesis
Authors: Mikael R. K. Patel
Venue: Proceedings of the conference on European design automation (1990)

TAO is a hierarchical graph representation of behaviour for High Level Synthesis of Hardware Structures. Typically a High Level Synthesis System takes a behavioural description and a set of constraints as input and generates a structural description of a hardware realization as output. One of the main question when realizing an internal design representation is what data structures should be used to reduced time complexity of algorithms applied and how to organize these data structures. When using the TAO graph representation one must consider several types of graphs operations such as node merge and distribution. These require different representations to reduce the overall computational complexity of the procedure at hand. In this paper data structures for the three levels of TAO, Task, Algorithm, and Operation graphs, are selected, defined, and discussed with examples of typical graph operations performed during the synthesis process from a behavioural towards a structural description.
Sojourn-time approximations for a multi-server processor sharing system with priorities
Authors: R. D. van der Mei, J. L. van der Berg, R. Vranken, B. M. M. Gijsen
Venue: Performance Evaluation (2003)

We study mean sojourn times in a multi-server processor sharing system with two priority classes and with general service-time distributions. For high-priority customers, the mean sojourn time follows directly from classical results on symmetric queues. For low-priority customers, in the absence of exact results, we propose a simple and explicit approximation for the mean sojourn time. Extensive numerical experiments demonstrate that the approximations are highly accurate for a wide range of parameter settings.
Redundancy estimates for the Lempel-Ziv algorithm of data compression
Authors: V. N. Potapov
Venue: Discrete Applied Mathematics (2004)

The problem of non-distorting compression (or coding) of sequences of symbols is considered. For sequences of asymptotically zero empirical entropy, a modification of the Lempel-Ziv coding rule is offered whose coding cost is at most a finite number of times worse than the optimum. A combinatorial proof is offered for the well-known redundancy estimate of the Lempel-Ziv coding algorithm for sequences having a positive entropy.
Foundations of 4Thought
Authors: Arthur Ryman
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

4Thought, a prototype design tool, is based on the notion that design artifacts are complex, formal, mathematical objects that require complementary textual and graphical views to be adequately comprehended. This paper describes the combined use of Entity- Relationship modelling and GraphLog to bridge the textual and graphical views. These techniques are illustrated by an example that is formally specified in Z Notation.
Knowledge management: the missing element in business continuity planning
Authors: Denise Johnson McManus, Charles A. Snyder
Venue: Knowledge management: current issues and challenges (2003)

This chapter provides a new perspective for Knowledge Management applications within organizations. The relevance of knowledge management components in disaster planning has been underscored by the large-scale terror attacks of September 11, 2001. The objective of the chapter is to provide a different perspective on the risk management category of business continuity planning or disaster recovery. Specifically, the authors show how most plans ignore or downplay the essential requirement for the organization to preserve its critical knowledge resources in the event the possessors of that knowledge are killed. Most proponents of Knowledge Management have neglected this important facet of the field. At the same time, the risk management and disaster recovery fields have ignored the important contributions of Knowledge Management to a viable business continuity plan.
Optimum Power/Performance Pipeline Depth
Authors: A. Hartstein, Thomas R. Puzak
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

The impact of pipeline length on both the power andperformance of a microprocessor is explored boththeoretically and by simulation. A theory is presented fora wide range of power/performance metrics, BIPSm/W.The theory shows that the more important power is to themetric, the shorter the optimum pipeline length thatresults. For typical parameters neither BIPS/W norBIPS2/W yield an optimum, i.e., a non-pipelined design isoptimal. For BIPS3/W the optimum, averaged over all 55workloads studied, occurs at a 22.5 FO4 design point, a 7stage pipeline, but this value is highly dependent on theassumed growth in latch count with pipeline depth. Asdynamic power grows, the optimal design point shifts toshorter pipelines. Clock gating pushes the optimum todeeper pipelines. Surprisingly, as leakage power grows,the optimum is also found to shift to deeper pipelines. Theoptimum pipeline depth varies for different classes ofworkloads: SPEC95 and SPEC2000 integer applications,traditional (legacy) database and on-line transactionprocessing applications, modern (e. g. web) applications,and floating point applications.
Static profile and dynamic behavior of COBOL programs
Authors: R. J. Chevance, T. Heidet
Venue: ACM SIGPLAN Notices (1978)

A measurement system for gathering a static profile and dynamic characteristics of COBOL programs at the source language level is described. Static and dynamic results are presented and discussed.
A visualization model of interactive knowledge discovery systems and its implementations
Authors: Jianchao Han, Xiaohua Hu, Nick Cercone
Venue: Information Visualization (2003)

We briefly introduce an interactive visualization model, RuleViz, for knowledge discovery and data mining, which consists of five components: data preparation and visualization, interactive data reduction, data preprocessing, pattern discovery, and pattern visualization. With this model, the implementation issues are considered and three implementation paradigms, including image-based paradigm, algorithm-embedded paradigm, and interaction-driven paradigm, are discussed. We implement an interactive Visualization system, AViz, which discovers 3D numerical association rules from large data sets based on the image-based paradigm. The framework of the AViz system is presented and each component is explored. To discretize numerical attributes, three approaches, including equal-sized, bin-packing-based equal-depth, and interaction-based approaches are proposed, and the algorithm for mining and visualizing numerical association rules is developed. Our experimental result on a census data set is illustrated, which shows that the AViz system is useful and helpful for discovering and visualizing numerical association rules.
G2-cubic contours
Authors: Giovanni Figueroa, Marco Paluszny, Francisco Tovar
Venue: Applied Numerical Mathematics (2003)

Let b0, b2,...,b2n be the vertex sequence of a convex polygon and through each b2j choose a line such that b2j-2 and b2j+2 lie on one of its sides, and let b2j+1 be the intersection point of line through b2j and b2j+2. For any choice q2j+1 of an interior point in each triangle b2jb2j+1b2j+2 we construct G2-cubic algebraic splines which interpolate the vertices b0,b2,...,b2n and the points q2j+1. At each b2j the spline is tangent to the prescribed line at this point and it is contained in the union of the triangles b2jb2j+1bj+2. For any j = 0, 1,....,n we show how the choice of q2j+1 limits the range of variation of the curvatures at the vertices b2j and b2j+2. We study the conditions for the curvatures at the specific vertices to vary arbitrarily, hence allowing for the construction of G2-interpolating cubic splines which are as flat or as sharp, as desired at these points. A generalization for nonconvex data sequences is given by breaking the polygon into maximal monotonically convex subsequences. The resulting spline has inflections at user controlled points.
Modeling of business rules for active database application specification
Authors: Youssef Amghar, Madjid Mezaine, André Flory
Venue: Advanced topics in database research vol. 1 (2003)

Active database applications require the classic cycle of analysis, design, prototyping and implementation. During analysis and design steps of the information system engineering process, modeling behavior is an important task. This task is both essential and crucial when information system is centered on active databases, which allow the replacement of parts of application programs with active rules. For that reason, the specification of business rules during analysis and design steps becomes an actual requirement. Business rules ensure the well-functioning of information system. They are descriptive (integrity constraints) or functional (derivation rules and active rules). To relieve programmers from using either traditional or ad hoc techniques to design active databases, it is necessary to develop new techniques to model business rules. These techniques have to enhance the specification of dynamic aspect through a high-level description language able to express precisely and completely rule semantic. In this chapter, we propose a uniform approach to model business rules (active rules, integrity constraints, etc.). To improve the behavior specification we extend the state diagrams that are widely used for dynamic modeling. This extension is a transformation of state transitions according to rule semantics. In addition, we outline new functionalities of Computer-Aided System Engineering (CASE) to take into consideration the active database specificities. In this way, the designer can be assisted to control, maintain and reuse a set of rules.
A dynamic model of end-user computing
Authors: Neil McBride, A. Trevor Wood-Harper
Venue: Advanced topics in end user computing (2003)

Control is a major issue in end-user computing. The migration of responsibility, resources and authority from IT departments to user departments is frequently seen as a loss of power by the IT departments and an erosion of cost control by senior management. Reactions to this situation tend to focus on technology and formal control mechanisms. This chapter contrasts such an IT-oriented view with a proposed, alternative user-oriented view. An IT-oriented view of EUC focuses on the problems it causes, the technology it requires, the methods that should be used and the means of limiting, controlling and standardizing. A user-oriented view of EUC focuses on the problems it solves, the user's task and the organizational environment. The chapter advocates a shift in EUC research away from the technology and the IT issues towards the political, social and cultural issues associated with the users. EUC problems are, in the main, organizational problems requiring a research approach which addresses dynamic issues emerging over a period of time. As a basis for such research, the chapter proposes a dynamic model for EUC in which the progression of EUC within an organization is visualized as a series of inference loops.
FAIM: integrating automated facial affect analysis in instant messaging
Authors: Rana El Kaliouby, Peter Robinson
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

One of the limitations in traditional instant messaging platforms is that they predominantly rely on text messages as the primary form of expression. This paper presents FAIM, an instant messaging application that analyzes a person's facial affect in real time and augments the dialogue with an emotive character representing them. Throughout the paper, we identify a number of design challenges that arise from integrating facial affect into instant messaging, and discuss how each of these issues is addressed in the design of FAIM. We also present a use case scenario of how FAIM works.
CMOS Scaling for sub-90 nm to sub-10 nm
Authors: Hiroshi Iwai
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Recently, CMOS downsizing has beenaccelerated very aggressively in both production andreseach level, and even transistor operation of a 6 nmgate length p-channel MOSFET was reported in aconference. However, many serious problems areexpected for implementing such small-geometryMOSFETs into large scale integrated circuits, and it isstill questionable whether we can successfullyintroduce sub-10 nm CMOS LSIs into market or not.In this paper, limitation and its possible causes for thedownscaling of CMOS towards sub-10 nm arediscussed with consideration of past CMOS predictionsfor the limitation.
Itemset Trees for Targeted Association Querying
Authors: Miroslav Kubat, Alaaeldin Hafez, Vijay V. Raghavan, Jayakrishna R. Lekkala, Wei Kian Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.
Designing and implementing a cyberwar laboratory exercise for a computer security course
Authors: Paul J. Wagner, Jason M. Wudi
Venue: ACM SIGCSE Bulletin (2004)

The development of a cyberwar laboratory exercise for a computer security course raises many pedagogical and management issues relating to the structure of the laboratory, its network and the exercise itself. We have designed, implemented and given such an exercise, and faced many of these issues. Evaluation of this exercise leads to multiple insights about the proper goals, structure and implementation of such an exercise.
Modeling and Simulating Memory Hierarchies in a Platform-Based Design Methodology
Authors: Pablo Viana, Edna Barros, Sandro Rigo, Rodolfo Azevedo, Guido Araújo
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents an environment based on SystemC for architecture specification of programmable systems. Making use of the new architecture description language ArchC, able to capture the processor description as well as the memory subsystem configuration, this environment offers support for system-level specification, intended for platform-based design. As a case study, it is presented the memory architecture exploration for a simple image processing application, yet a more robust environment evaluation is performed through the execution of some real-world benchmarks.
A new scanning method for H.264 based fine granular scalable video coding
Authors: Won-Sik Cheong, Kyuheon Kim, Gwang Hoon Park
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we introduce a new scanning method for H.264 based Fine Granular Scalable video coding, which can significantly improve the subjective picture quality of a decoded scalable video. Since the network condition is fluctuated, it is often happened that the important part of the streaming data, especially video sequences, cannot be transmitted, and thus a viewer watches less interesting parts of the sequences or poorer quality of pictures in important regions. Therefore, this paper presents a new scanning method, called water ring scan method, for improving the subjective picture quality of the decoded scalable video by encoding and transmitting the visually important region most-preferentially as a watering is expanded in the lake from the location where gravel falls. The water ring scan method presented in this paper is to encode and decode video sequences at the location designated by a user. From the simulation results, it has been found that the proposed scan method can achieve significantly improved picture quality, especially on the region of interest as being compared with the traditional FGS scheme.
A processor array for computing wavelet energies
Authors: Neil Dunstan, Stephen Hodgson
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Efficient remediation of sites contaminated with buried unexploded ordnance (UXO) requires highly accurate discrimination between intact ordnance and fragments or other objects. The energies at each level of the discrete wavelet transformation (DWT) of electromagnetic signal responses from subsurface objects have been shown to be characteristic of some types of ordnance. This paper investigates low-level parallel processing of energy calculations that may form part of a classification system that uses energies as characteristic features. Existing designs for the DWT are discussed as well as specific architectural requirements for the remediation application. The proposed design is described in terms of space-time diagrams, recurrence equations, scheduling and allocation functions.