ppxscal/embedding_network huggingface dataset:
An analysis of XML database solutions for the management of MPEG-7 media descriptions
Authors: Utz Westermann, Wolfgang Klas
Venue: ACM Computing Surveys (CSUR) (2003)

MPEG-7 constitutes a promising standard for the description of multimedia content. It can be expected that a lot of applications based on MPEG-7 media descriptions will be set up in the near future. Therefore, means for the adequate management of large amounts of MPEG-7-compliant media descriptions are certainly desirable. Essentially, MPEG-7 media descriptions are XML documents following media description schemes defined with a variant of XML Schema. Thus, it is reasonable to investigate current database solutions for XML documents regarding their suitability for the management of these descriptions. In this paper, we motivate and present critical requirements for the management of MPEG-7 media descriptions and the resulting consequences for XML database solutions. Along these requirements, we discuss current state-of-the-art database solutions for XML documents. The analysis and comparison unveil the limitations of current database solutions with respect to the management of MPEG-7 media descriptions and point the way to the need for a new generation of XML database solutions.
A pipelined framework for multi-scale image comparison
Authors: Kellogg Booth
Venue:  (2003)

In this thesis we present a pipelined framework and a family of algorithms for determining meaningful differences between two images. The pipeline is structured in a way that makes it easy to use only a portion of the pipeline when that is appropriate, and any module in the pipeline can be replaced in its entirety by a new module that uses a different algorithm, while requiring minimal or no changes to other modules. Many pieces of the pipeline can be used individually. Three key design goals were to facilitate comparison of real images to computer-generated images, to take into account the sensitivity of the human visual system, and to accept pairs of images with arbitrary size differences and moderate misalignment in translation, rotation, and field of view. Most existing approaches fail badly at this task, requiring the two images to be of the same size and perfectly aligned with each other. The pipeline automatically aligns the two images as well as it can in the first four of its five phases. Images are first separated into octave-spaced bands of spatial frequencies, using the wavelet-based technique of Mallat and Zhong to find edges at multiple scales in each of the images. These edges are then matched using a graph-theoretic matching technique in the second phase, a least-squares fit is found for the alignment in the third phase, and the resulting transformation is applied using appropriate resampling in the fourth phase. The final phase of the pipeline computes difference measures for each spatial frequency band and three colour components, weighted according to the human contrast sensitivity function. The same Mallat-Zhong wavelet transform used for edge detection is used as the multi-band filter during comparison. We describe the pipeline and each component in detail, and discuss alternate approaches for each of the phases and generalizations of the framework. The flexibility of the framework is demonstrated by examples. We show how to restructure the data flow to implement an improved iterative multiscale alignment technique, and we analyze a Laplacian-based edge detector that could be used instead of wavelets.
On the Fluctuations of the Giant Component
Authors: D. Barraez, S. Boucheron, W. Fernandez De LaVega
Venue: Combinatorics, Probability and Computing (2000)

We provide an alternate proof of the central limit theorem for the uctuations of the size of the giant component in sparse random graphs. In contrast with previous proofs, the argument investigates a depth-first search algorithm, through first-passage analysis using couplings and martingale limit theorems. The analysis of the first passage limiting distribution for sequences of Markov chains might be interesting in its own right. This proof naturally provides an upper bound for the rate of convergence.
Using a computer message system for promoting reading and writing in a school for the deaf
Authors: Richard Rubinstein, E. Paul Goldenberg
Venue: Issue 24 (October 1978) (1978)

Deaf children usually have great difficulty with English. A significant problem in teaching written English to the deaf is providing students with opportunities to use it for their own purposes: for communicating with friends or teachers. As soon as the hearing child learns to speak, English becomes a source of power and control. Deaf children miss this strong early motivation to learn English. We have been using a computer-based message system to provide written communication for students, teachers, and staff in a school for the deaf. Our initial experience suggests that this is an effective way to motivate deaf children to write. Further, it is providing a good research vehicle for studying the development of written language in deaf children.
Strategic IS Alignment: The Necessity for a Hybrid Framework Linking Shared Vision, Leadership, Change Management and Diffusion Theory
Authors: LeAnn Hilgers, Barb Marcolin, Mike Chiasson, Mansour Javidan
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The rapid pace of business process change, partially fueled by information technology, is placing increasingly difficult demands on the organization. In many industries, organizations are required to evaluate and assess new information technologies and their organization-specific strategic potential, in order to remain competitive. The scanning, adoption and diffusion of this information technology must be carefully guided by strong strategic and technological leadership in order to infuse the organization and its members with strategic and technological visions, and to coordinate their diverse and decentralized expertise. This view of technological diffusion requires us to look beyond individuals and individual adoption, toward other levels of analysis and social theoretical viewpoints to promote the appropriate and heedful diffusion of often organization-wide information technologies. Particularly important is an examination of the diffusion champions and how a feasible and shared vision of the business and information technology can be created and communicated across organizational communities in order to unify, motivate and mobilize technology change process. The feasibility of this shared vision depends on its strategic fit and whether the shared vision is properly aligned with organizational objectives in order to filter and shape technological choice and diffusion. Shared vision is viewed as an organizational barometer for assessing the appropriateness of future technologies amidst a sea of overwhelming possibilities. We present a theoretical model to address an extended program ofresearch focusing on important phases during diffusion, shared vision, change management and social alignment. We also make a call for further research into these theoretical linkages and into the development of feasible shared visions.
A timed Petri-net model for fine-grain loop scheduling
Authors: Guang R. Gao, Yue-Bong Wong, Qi Ning
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Efficient execution of loops is one of the most important obstacles facing high-performance computer architectures. Loop scheduling involves handling a partially ordered set of operations which are to be performed repetitively over a number of iterations.In this paper we study loop scheduling using Petri nets, due to their unique power for modeling both partial orders and cycles. The behavior of loops can be modeled by constructing, at compile time, a Petri-net behavior graph which exhibits a repetitive firing sequence known as a cyclic frustum. From a cyclic frustum, a time-optimal schedule for the corresponding loop can be derived. A polynomial time bound for such a cyclic frustum to occur has been established. Simulation results on a number of Livermore loops, both with and without loop-carried dependences, have demonstrated the feasibility of determining the cyclic frustum at compile time.
How one product team met the quality challenge
Authors: Mark Changfoot, Ted Fines, Rod Lawson, Nick Lecic, Pat Morenz, Doug Mortson, Pramod Patel, Shelagh Roberts, Sheik Sahib, Rollie Sing
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

A primary goal of product development teams today is to ensure that quality is integral to everything they do. This article describes the initiatives the members of one product development team undertook to incorporate quality into every phase of their development process. The product was new, the team was new, and there was a strong commitment from every member of the team to prove just how much one product team could do to ensure the quality of its product.Development methodologies, process management techniques, software development imperatives, and project management principles were all applied to this project. This paper describes how these initiatives for quality product development were evaluated, implemented, and re-evaluated throughout the development cycle.
The bottleneck independent domination on the classes of bipartite graphs and block graphs
Authors: William Chung-Kung Yen
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Let G(V,E,W) denote a graph with vertex-set V and edge-set E, and each vertex v is associated with a cost W(v). For any set V' ⊆ V, the bottleneck cost of V' is defined as max{W(x)|x ∈ V'}. This paper considers the bottleneck independent dominating set problem (the BIDS problem) which determines an independent dominating set of G such that its bottleneck cost is minimized.This paper studies the problem on the classes of bipartite graphs and block graphs. This paper first proves that the problem is NP-hard on chordal-bipartite graphs. Second, a linear-time algorithm on convex-bipartite graphs is proposed. Next, a linear-time algorithm on trees is designed. Then, we generalize the algorithmic result to block graphs. All algorithms are designed by the dynamic programming strategy.
Hard deadline queueing system with application to unified messaging service
Authors: Wuqin Lin, Zhen Liu, Harry Stavropoulos, Cathy H. Xia
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

We consider a queueing system with jobs having hard deadlines. This is motivated by recent emerging unified messaging service applications. The service time of a job is assumed to be known upon arrival. A job will be lost if not being served by its deadline. For the single-server system, we propose an on-line ED-Push algorithm that is easy to implement and can achieve near-optimal performance in terms of minimizing the loss probability. Performance analyses for the underlying M/M/l+D and G/D/1+D systems are then provided. We also give approximation on the loss probability for the system with multiple servers under least workload routing scheme. The numerical results show that ED-Push algorithm performs well.
Asymptotically Exact A Posteriori Error Estimators, Part I: Grids with Superconvergence
Authors: Randolph E. Bank, Jinchao Xu
Venue: SIAM Journal on Numerical Analysis (2003)

In Part I of this work, we develop superconvergence estimates for piecewise linear finite element approximations on quasi-uniform triangular meshes where most pairs of triangles sharing a common edge form approximate parallelograms. In particular, we first show a superconvergence of the gradient of the finite element solution uh and to the gradient of the interpolant uI. We then analyze a postprocessing gradient recovery scheme, showing that $Q_h\nabla u_h$ is a superconvergent approximation to $\nabla u$. Here Qh is the global L2 projection. In Part II, we analyze a superconvergent gradient recovery scheme for general unstructured, shape regular triangulations. This is the foundation for an a posteriori error estimate and local error indicators.
A pressure-based algorithm for multi-phase flow at all speeds
Authors: F. Moukalled, M. Darwish, B. Sekar
Venue: Journal of Computational Physics (2003)

A new finite volume-based numerical algorithm for predicting incompressible and compressible multi-phase flow phenomena is presented. The technique is equally applicable in the subsonic, transonic, and supersonic regimes. The method is formulated on a non-orthogonal coordinate system in collocated primitive variables. Pressure is selected as a dependent variable in preference to density because changes in pressure are significant at all speeds as opposed to variations in density, which become very small at low Mach numbers. The pressure equation is derived from overall mass conservation. The performance of the new method is assessed by solving the following two-dimensional two-phase flow problems: (i) incompressible turbulent bubbly flow in a pipe, (ii) incompressible turbulent air-particle flow in a pipe, (iii) compressible dilute gas-solid flow over a flat plate, and (iv) compressible dusty flow in a converging diverging nozzle. Predictions are shown to be in excellent agreement with published numerical and/or experimental data.
Bringing e-democracy back in: why it matters for future research on e-governance
Authors: Andrew Chadwick
Venue: Social Science Computer Review (2003)

The author argues that contemporary digital information communication technologies (ICTs) facilitate new forms of e-government-enabled public sector policy making that enshrine some of the important norms and practices of e-democracy. The potential for linking e-democracy in civil society with e-government at the level of the local and national state is far from straightforward but nevertheless achievable. Following a consideration of the democratization effects of e-democracy and e-government, the author outlines how their norms and practices are converging in four principal areas: online consultations integrating civil societal groups with bureaucracies and legislatures, the internal democratization of the public sector itself, the involvement of users in the design and delivery of public services, and the diffusion of open-source collaboration in public organizations. These now feature as some of the core areas for research in this field and our broader understanding of how ICTs are reshaping governance, the state, and democracy.
Dense resultant of composed polynomials mixed-mixed case
Authors: Manfred Minimair
Venue: Journal of Symbolic Computation (2003)

The main question of this paper is: What is the dense (Macaulay) resultant of composed polynomials? By a composed polynomial f (g1,...,gn), we mean the polynomial obtained from a polynomial f in the variables y1,...,yn by replacing yj by some polynomial gj. Cheng, McKay and Wang and Jouanolou have provided answers for two particular subcases. The main contribution of this paper is to complete these works by providing a uniform answer for all subcases. In short, it states that the dense resultant is the product of certain powers of the dense resultants of the component polynomials and of some of their leading forms. It is expected that these results can be applied to compute dense resultants of composed polynomials with improved efficiency. We also state a lemma of independent interest about the dense resultant under vanishing of leading forms.
DVD players
Authors: Dave Phillips
Venue: Linux Journal (2003)

Dave compares and tests the best DVD-playingsoftware.
The validity of computer-mediated communicative language tests
Authors: Julian Charles Heather
Venue:  (2003)

A recent innovation in language testing involves the use of computer-mediated communicative language tests i.e., assessment of individuals' second language ability from transcripts of their interactions via computer-mediated communication (CMC). Studies have shown that such interactions in the first language involve a hybrid discourse with features of both written and spoken language, which suggests the possibility of making inferences about oral language ability from performance in a CMC environment. The literature to date offers little guidance on this matter. Research on computer-mediated communication has focused on its use in the second language classroom rather than in a testing context while studies of the linguistic and interactional features of second language learners' CMC discourse have mostly been descriptive with little direct comparison of CMC and face-to-face discourse. This study, therefore, examines the validity of making inferences from computer-mediated discourse to oral discourse through a comparison of the performance of 24 third-semester French students on two tests: a computer-mediated communicative French test; and its nearest equivalent format in face-to-face testing, the group oral exam. Using a within-subjects design, counterbalanced for testing condition and discussion topic, the present study focuses on five areas which have important implications for validity: (a) the predictability of ratings of pronunciation on the group oral test; (b) the similarity of scores achieved on the CMC and group oral tests; the presence of similar (c) linguistic and (d) interactional features in the discourse of both tests; and (e) students' attitudes to the two tests. Results show that although scores on the two tests showed no statistically significant difference, students' discourse differed in many respects which would, thus, invalidate any inferences made about oral ability from computer-mediated performance. Moreover, this study raises an important question about the role of computer-mediated communication in promoting second language acquisition since the computer-mediated discourse contained fewer examples of the negotiation of meaning routines that interactionist theories hold to be important to language acquisition.
On implementing relational databases on DNA strands
Authors: István Katsányi
Venue: Acta Cybernetica (2003)

This work describes the theoretical bases of the implementation of relational databases in test tubes, using an abstract model of molecular computing. It specifies the representation of relations and the execution program of the relational algebra (RA) operations. We investigate the possibilities of practical usage of the proposed model as well as the bounds of it.
Designing Safety-Critical Computer Systems
Authors: William R. Dunn
Venue: Computer (2003)

The ubiquitous computer is the electronic component of choice for systemdevelopers, who increasingly exploit computing's power in safety-critical applications such as steer-by-wire automotive systems and powered prosthetics.However, these computer-based systems raise the ongoing concern that they might fail and cause harm. Exploring the systematic design of safety-critical computer systems helps to show how engineers canverify that these designs will be safe. Achieving risk reduction requires dealing with all the system's components: hardware and software, sensors, effectors, the operator, and the primary source of harmfulenergy or toxicity¿the application.
Equuleus: Presentation from Legacy Documents
Authors: Susan W. McRoy, Syed S. Ali, Nipat Nalamlieng
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

We are investigating computational models for human-computer interaction based on a uniform, declarative, knowledge representation. We describe a new implementationof our work called Equuleus, a system for interactive, adaptive, document presentation. Equuleus achieves this by using annotated descriptions of a document to be presented and a planner to plan the document's presentation. All pressentation occurs as a result of planning and re-planning presentation goals.
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information
Authors: James Newsome, Dawn Song
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting energy by sending large amounts of raw data to reply to a query. Some efficient data dissemination methods, particularly data-centric storage and information aggregation, rely on efficient routing from one node to another. In this paper we introduce GEM (Graph EMbedding for sensor networks), an infrastructure for node-to-node routing and data-centric storage and information processing in sensor networks. Unlike previous approaches, it does not depend on geographic information, and it works well even in the face of physical obstacles. In GEM, we construct a labeled graph that can be embedded in the original network topology in an efficient and distributed fashion. In that graph, each node is given a label that encodes its position in the original network topology. This allows messages to be efficiently routed through the network, while each node only needs to know the labels of its neighbors.To demonstrate how GEM can be applied, we have developed a concrete graph embedding method, VPCS (Virtual Polar Coordinate Space). In VPCS, we embed a ringed tree into the network topology, and label the nodes in such a manner as to create a virtual polar coordinate space. We have also developed VPCR, an efficient routing algorithm that uses VPCS. VPCR is the first algorithm for node-to-node routing that guarantees reachability, requires each node to keep state only about its immediate neighbors, and requires no geographic information. Our simulation results show that VPCR is robust on dynamic networks, works well in the face of voids and obstacles, and scales well with network size and density.
A Middleware Service for Secure Group Communication in Mobile Ad Hoc Networks
Authors: Stephen S. Yau, Xinyu Zhang
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Secure group communication in mobile ad hoc networksis often dynamic and impromptu, and thus requiresefficient and automated secure group management andseamless combination of secure groups with distributedapplications running upon them. Existing approaches tosecure group communication cannot satisfy theserequirements. In this paper, an automated secure groupmanagement approach is presented. Based on thisapproach, a middleware service for secure groupcommunication is developed to facilitate developmentand execution of distributed applications using securegroup communication in mobile ad hoc networks. Thismiddleware service is implemented in a context sensitivemiddleware RCSM.
estWin: adaptively monitoring the recent change of frequent itemsets over online data streams
Authors: Joong Hyuk Chang, Won Suk Lee
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Knowledge embedded in a data stream is likely to be changed as time goes by. Consequently, identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. However, most of mining algorithms or frequency approximation algorithms for a data stream do not able to extract the recent change of information in a data stream adaptively. This paper proposes a sliding window-based method that finds recently frequent itemsets over an online data stream adaptively. The size of a window defines a desired life-time of the information in a newly generated transaction. Consequently, only recently generated transactions in the range of the window are considered to find the frequent itemsets of a data stream.