ppxscal/embedding_network huggingface dataset:
Issues in managing long transactions and large objects in a multidatabase system
Authors: Gopi Attaluri
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

Transactions are a useful and important facility in database systems. Transactions have been incorporated into not only traditional database systems, but also advanced transaction systems (such as file systems (LOCUS), engineering design database systems (CAD/CAM) and general programming languages (Avalon, Argus)). A variety of techniques has been used to support transactions.An environment may be comprised of multiple transaction systems. Writing a global application in such an environment can be difficult because of the heterogeneity and autonomy of the systems involved. A multidatabase system. (MDBS) is an abstraction over a set of local database systems (LDBSs) that attempts to hide possible idiosyncrasies of local database systems and provide a uniform interface to a global user. MDBS techniques may be extended to include support for advanced transaction systems.This paper describes problems that arise involving long transactions and large nonuniform objects in a MDBS that provides an advanced transaction system. It surveys background work related to the problem and discusses the problem in light of the background knowledge.
Coloring the Maximal Cliques of Graphs
Authors: Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebo
Venue: SIAM Journal on Discrete Mathematics (2004)

In this paper we are concerned with the so-called clique-colorations of a graph, that is, colorations of the vertices so that no maximal clique is monochromatic. On one hand, it is known to be NP-complete to decide whether a perfect graph is 2-clique-colorable, or whether a triangle-free graph is 3-clique-colorable; on the other hand, there is no example of a perfect graph where more than three colors would be necessary. We first exhibit some simple recursive methods to clique-color graphs and then relate the chromatic number, the domination number, and the maximum cardinality of a stable set to the clique-chromatic number. We show exact bounds and polynomial algorithms that find the clique-chromatic number for some classes of graphs and prove NP-completeness results for some others, trying to find the boundary between the two. For instance, while it is NP-complete to decide whether a graph of maximum degree 3 is 2-clique-colorable, K1,3-free graphs without an odd hole turn out to be always 2-clique-colorable by a polynomial algorithm. Finally, we show that "almost" all perfect graphs are 3-clique-colorable.
Building communities with rich Internet applications
Authors: Robert Reinhardt
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

The session presents a case study of a Web site specifically designed as a RIA. The structure of the Web site, iknowbetter.com, is based upon traditional online forums wherein a community of members shares ideas and opinions within moderated or un-moderated discussion areas. Members, however, can also utilize Web cams and microphones to add audio/video streams to text-based posts. The forum provides categories (or searches) based on content/theme, geographic location, or member name. Members can engage in live audio/video discussions, create their own private online diaries, and designate specific members to view such blog-like entries.
Evolution of an optimal lexicon under constraints from embodiment
Authors: Willem Zuidema, Gert Westermann
Venue: Artificial Life (2003)

Research in language evolution is concerned with the question of how complex linguistic structures can emerge from the interactions between many communicating individuals. Thus it complements psycholinguistics, which investigates the processes involved in individual adult language processing, and child language development studies, which investigate how children learn a given (fixed) language. We focus on the framework of language games and argue that they offer a fresh and formal perspective on many current debates in cognitive science, including those on the synchronic-versus-diachronic perspective on language, the embodiment and situatedness of language and cognition, and the self-organization of linguistic patterns. We present a measure for the quality of a lexicon in a population, and derive four characteristics of the optimal lexicon: specificity, coherence, distinctiveness, and regularity. We present a model of lexical dynamics that shows the spontaneous emergence of these characteristics in a distributed population of individuals that incorporate embodiment constraints. Finally, we discuss how research in cognitive science could contribute to improving existing language game models.
Towards a visualization architecture for time-critical applications
Authors: Jörn Kohlhammer, David Zeltzer
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Time-critical domains, such as emergency management, demand fast decisions from expert users under stress. Our Decision-Centered Visualization (DCV) system supports decision making by integrating domain knowledge and knowledge about human situation awareness for time-critical visualization. Efficient information presentation is vital for the user's situation awareness and, in consequence, to his or her task performance. We address the problem of efficiently visualizing both existing and incoming information by connecting domain data types and presentation requirements of the domain's tasks.
Cost-Sensitive Learning by Cost-Proportionate Example Weighting
Authors: Bianca Zadrozny, John Langford, Naoki Abe
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We propose and evaluate a family of methods for convertingclassifier learning algorithms and classification theoryinto cost-sensitive algorithms and theory. The proposedconversion is based on cost-proportionate weighting of thetraining examples, which can be realized either by feedingthe weights to the classification algorithm (as often done inboosting), or by careful subsampling. We give some theoreticalperformance guarantees on the proposed methods,as well as empirical evidence that they are practical alternativesto existing approaches. In particular, we proposecosting, a method based on cost-proportionate rejectionsampling and ensemble aggregation, which achievesexcellent predictive performance on two publicly availabledatasets, while drastically reducing the computation requiredby other methods.
Configurable Network Processing for Mobile Agents on the Internet
Authors: Ichiro Satoh
Venue: Cluster Computing (2004)

This paper presents a framework for building and deploying protocols for migrating mobile agents over the Internet. The framework enables network protocols for agent migration to be naturally implemented within mobile agents and then dynamically deployed at remote hosts by migrating the agents that perform the protocols. It is built on a hierarchical mobile agent system, called MobileSpaces, and several protocols for migrating agents for managing cluster computing systems have been designed and implemented based on the framework. This paper describes the framework and its prototype implementation, which uses Java as both the implementation language and the protocol development language.
Simultaneous Capacity and Production Management of Short-Life-Cycle, Produce-to-Stock Goods Under Stochastic Demand
Authors: Alexandar Angelus, Evan L. Porteus
Venue: Management Science (2002)

This paper derives the optimal simultaneous capacity and production plan for a shortlife-cycle, produce-to-stock good under stochastic demand. Capacity can be reduced as well as added, at exogenously set unit prices. In both cases studied, with and without carryover of unsold units, a target interval policy is optimal: There is a (usually different) target interval for each period such that capacity should be changed as little as possible to bring the level available into that interval. Our contribution in the case of no carry-over, is a detailed characterization of the target intervals, assuming demands increase stochastically at the beginning of the life cycle and decrease thereafter. In the case of carry-over, we establish the general result and show that capacity and inventory are economic substitutes: The target intervals decrease in the initial stock level and the optimal unconstrained base stock level decreases in the capacity level. In both cases, optimal service rates are not necessarily constant over time. A numerical example illustrates the results.
From Organization Man to Free Agent
Authors: Mohan Babu
Venue: Computer (2004)

To thrive in a rapidly changing world, computing professionals must become free agents.
An Algorithm for Total Variation Minimization and Applications
Authors: Antonin Chambolle
Venue: Journal of Mathematical Imaging and Vision (2004)

We propose an algorithm for minimizing the total variation of an image, and provide a proof of convergence. We show applications to image denoising, zooming, and the computation of the mean curvature motion of interfaces.
Modeling and simulation of semiconductor transceivers
Authors: Jennifer Leonard, Anup Savla, Mohammed Ismail
Venue: Applied system simulation: methodologies and applications (2003)

This chapter presents calculations and methods necessary for simulation and modeling of semiconductor transceivers. Additionally, some current tools used for such modeling and simulation tasks are presented and critiqued. A complete discussion on the methods associated with transceiver simulation and modeling, specifically multi-standard wireless, is presented.
On the infinigons of the hyperbolic plane, a combinatorial approach
Authors: Maurice Margenstern
Venue: Fundamenta Informaticae (2002)

In this paper, we pay a new visit to an object of hyperbolic geometry which, perhaps, did not draw on itself all the attention it may deserve. The paper gives a simple definition of this object, infinigons, which was implicit in general considerations about filings of the hyperbolic plane, and which was not definied in its all possible extensions. From the simple construction of the infinigons and using the ideas of the splitting method being introduced by the author in the case of tilings being based on the replication of regular polygons, we give an algorithmic construction of the infinigrids. On the way, we give a simple geometrical characterisation of the infinigons in terms of pencils of lines.
Optimized code generation from extended-entry decision tables
Authors: C. Geoffrey Woods, Mary K. Hawes
Venue: ACM SIGPLAN Notices (1971)

Optimized algorithms have been developed for the processing of extendad-entry decision tables. and for the direct conversion of extended-entry tables to code without translation of the extended-entry decision tables to limited-entry tables. One of the algorithms is described and discussed in this paper. Examples are given to illustrate why direct code conversion is better, and why it is better. Although the amount of improvement will very from table to table. and indication of the savings is included.
Parallel VLSI design for a real-time video-impulse noise-reduction processor
Authors: Shih-Chang Hsia
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

High-quality televisions (TVs) such as improve digital TV, enhanced TV, and high-definition TV have become popular in recent years. However, impulse noise affects TV broadcasts. This paper proposes an efficient noise-removal algorithm using an adaptive digital signal-processing approach. Simulations have demonstrated that the new adaptive algorithm could efficiently reduce impulse noise even in highly corrupted images. In order to achieve real-time implementation, a cost-effective architecture is proposed using a parallel structure and pipelined processing. The proposed processor can achieve the throughput rate of 45M pixels/s using only 4k gates and two line buffers. Unlike median-filtering chips, this processor provides better filtering quality and its circuit is much less complex.
Alert-Driven E-Service Management
Authors: Dickson K. W. Chiu, Benny W. C. Kwok, Ray L. S. Wong, S. C. Cheung, Eleanna Kafeza
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Process management technology has recently been employed not only within businesses but also in provision of E-services over the Internet. Urgent requests and critical messages in these systems (referred to as alerts) should be delivered and handled timely. In particular, humans are often involved in critical conditions. Presently, most E-service systems cannot address these requirements, and alerts are often handled in an ad-hoc manner. In this paper, we propose a sophisticated alert management system for effective e-service integration under urgent constraints. We develop a model for specifying alerts, in which alerts are associated with service requests and a set of parameters are captured for their routing. The alert monitor matches the service provider to receive an alert, based on the alert specification. We thenpropose a routing mechanism that is initiated when the alert message is not acknowledged or serviced within the deadline, so that the alert can be forwarded to other suitable services if necessary. Monitoring is especially essential to ensure timeliness and availability of services, otherwise suitable exceptions should be raised and handled. We outline our implementation framework of an Alert Management System (AMS) with includes Web Services for B2B interactions, together with multiple-platform support for human users. We demonstrate our approach with an example medical house-call AMS.
The use of computer-aided software engineering technology in systems and software design
Authors: D. F. Burrows
Venue: Proceedings of the conference on European design automation (1990)

This paper describes Computer Aided Software Engineering (CASE) Technology and its use in large-scale systems and software design projects. This paper is written in the form of a tutorial and heavy use is made of real CASE and CAD design examples. The last part of this paper presents recommendations and conclusions, and explores some future ideas about the use of CASE technology for hardware and system design as well.
The topology of symmetric, second-order tensor fields
Authors: Thierry Delmarcelle, Lambertus Hesselink
Venue: Proceedings of the conference on Visualization '94 (1994)

We study the topology of symmetric, second-order tensor fields. The goal is to represent their complex structure by a simple set of carefully chosen points and lines analogous to vector field topology. We extract topological skeletons of the eigenvector fields, and we track their evolution over time. We study tensor topological transitions and correlate tensor and vector data.The basic constituents of tensor topology are the degenerate points, or points where eigenvalues are equal to each other. Degenerate points play a similar role as critical points in vector fields. We identify two kinds of elementary degenerate points, which we call wedges and trisectors. They can combine to form more familiar singularities---such as saddles, nodes, centers, or foci. However, these are generally unstable structures in tensor fields.Finally, we show a topological rule that puts a constraint on the topology of tensor fields defined across surfaces, extending to tensor fields the Pointcar&eacute;-Hopf theorem for vector fields.
A ProtoG Algorithm Applied to the Traveling Salesman Problem
Authors: Iloneide C. O. Ramos, Marco C. Goldbarg, Elizabeth F. G. Goldbarg, Adrião D. Dória Neto, João P. F. Farias
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

This work reports the application of a transgeneticalgorithm, called ProtoG, to the Traveling SalesmanProblem. ProtoG is an evolutionary algorithm based onthe Computational Transgenetics approach. Thecomputational experiment considers twenty TSP instancesand compares the performance of ProtoG with a hybridsimulated annealing algorithm. A descriptive andinferential statistical analysis based on survival functionsshows that the transgenetic algorithm finds bettersolutions and runs in less time than the hybrid simulatedannealing algorithm.
WebCoM: a tool to use peer review to improve student interaction
Authors: Elaine Silva, Dilvan Moreira
Venue: Journal on Educational Resources in Computing (JERIC) (2003)

The peer review, known by almost everyone in the academic world, is proposed as a method for computer science classes to improve interaction among student groups. By this method, groups of students publish their assignments over the Internet using the WebCoM tool developed to support this activity. A group of fellow students reviews their work and publishes their findings (in the Internet) also using the WebCoM tool. Finally, the two groups debate their points of view in front of the class (in traditional courses) or in a chat room (in distance education courses). Debate and competition between the groups provide a chance for the students to learn more about each other's work. They also gain an opportunity to learn how to give and receive criticisms in a constructive way. This should increase the students' ability to interact and work in groups: an important skill for computer science professionals. We show how the method is applied and how it is supported by WebCoM. In addition, results from past course experiences are presented to help evaluate the method and the tool.
Mobile clinical support system for pediatric emergencies
Authors: Wojtek Michalowski, Steven Rubin, Roman Slowinski, Szymon Wilk
Venue: Decision Support Systems (2003)

This paper describes the process and methodology of designing and developing a mobile support system to triage abdominal pain in the emergency room (ER) of a hospital. Application of rough sets theory and fuzzy measures to data collected at Children's Hospital of Eastern Ontario allowed us to identify the most relevant clinical symptoms and signs while evaluating an abdominal pain patient. This information was used to develop a multilevel clinical algorithm that forms the reasoning module of a clinical support system. We describe a client system called Mobile Emergency Triage (MET) that is installed on Palm handheld and that can be used to triage a child irrespective of the available information. We present MET's functions allowing for the electronic data capture and wireless data transfer.
A multi-dimensional histogram for selectivity estimation and fast approximate query answering
Authors: Hai Wang, Kenneth C. Sevcik
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Histograms have been widely used for selectivity estimation in query optimization, as well as for fast approximate query answering in many data mining, OLAP, and data visualization applications. This paper presents a new type of multi-dimensional histogram, the multi-dimensional VI histogram. Unlike other types of multi-dimensional histograms, which are seldom used in practice due to their high construction costs, the multi-dimensional VI histogram can be constructed in just one scan through the data. Through a set of experiments, we show that the multi-dimensional VI histogram is capable of providing more accurate estimations than the techniques currently used in major commercial database management systems, including IBM DB2, Oracle Database, and Microsoft SQL Server.
Distinctive Features of Minimization of a Risk Functional in Mass Data Sets
Authors: O. L. Perevozchikova, V. G. Tul'Chinskii, A. V. Kharchenko
Venue: Cybernetics and Systems Analysis (2003)

A statistical learning model is considered within the framework of the theory of uniform convergence of frequencies of errors in the case where the convergence is violated as a result of increasing the informativeness of training examples. Drawbacks of nonconstructive refinements of Vapnik-Chervonenkis estimates based on an assumption on the distribution law of violations are shown. A new approach to obtaining constructive estimates for mass data sets is proposed.
State assignment of controllers for optimal area implementation
Authors: Gabriele Saucier, Christopher Duff, Franck Poirot
Venue: Proceedings of the conference on European design automation (1990)

The state assignment of controllers presented here aims at preparing further minimizations of the next-state and output logic implementation on standard cells. This is done by detecting situations in the control flowgraph leading to these further minimizations, deducing constraints on the state assignment and finding a solution on the hypercube satisfying them. The originality of this paper is to propose situations minimizing both the gate area and the wiring area. For this purpose, full collapsing product term constraints are defined and are respected first. In a second step, constraints leading to factorizations are respected as long as they do not prevent the previous factorizations. Results on global area decrease are given on controller benchmarks.
Role of boundary conditions in improving the working characteristics of superconductor-based nanostructures
Authors: Serghej L. Prischepa, V. N. Kushnir, C. Attanasio
Venue: Microelectronic Engineering (2003)

We examined the effect of boundary conditions on the critical parallel magnetic field Hc2|| and the critical current density Jc in superconductor-based nanostructures. For superconductor-normal metal superlattices, we observed the influence of the finiteness of the multilayers on the Hc2|| values. The result depends on the actual symmetry of the system. When the symmetry plane is in the center of the superconductor layer, Hc2|| iS larger at high temperatures with respect to the situation when the symmetry plane is in the center of nonsuperconductor layers. For superlattices with an regular array of antidotes, we observed the sudden increase in the critical current at T=2.18 K. The effect could be explained in terms of larger pinning efficiency at the antidote-multilayer boundary due to the wetting of the antidotes below 2.18 K. The results of this work indicate the importance of the boundary conditions on the critical parameters of superconductor-based nanostructures.
High-Order Radiation Boundary Conditions for the Convective Wave Equation in Exterior Domains
Authors: Thomas Hagstrom, S. I. Hariharan, David Thompson
Venue: SIAM Journal on Scientific Computing (2003)

We construct and apply radiation boundary conditions of arbitrary order for wave propagation with subsonic convection in exterior domains. The conditions generalize those we constructed earlier for the isotropic wave equation. As in the well-known work of Bayliss and Turkel, the construction is based on the progressive wave (or multipole) expansion of outgoing solutions. Using auxiliary functions defined only on the artificial boundary, problems associated with the use of high-order derivatives, as in the original Bayliss-Turkel formulation, are avoided. The order of the conditions is thus increased simply by using more auxiliary variables. By generalizing to the convective case, we have developed conditions which can be used in aeroacoustics applications whenever the Euler equations linearized about a uniform flow are sufficiently accurate in the far field. Numerical experiments in two space dimensions are presented to illustrate the stability and accuracy of the proposed technique.