ppxscal/embedding_network huggingface dataset:
A Semantic Publish/Subscribe System
Authors: Liangzhao Zeng, Hui Lei
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The publish/subscribe computing paradigm is rapidly gaining momentum due to its capability to integrate loosely coupled applications over the Internet. Existing publish/subscribe systems fall into one ofthree categories: topic-based, content-based and relational. They all require that the event publishers and subscribers adhere to the same organization of information (i.e., eventschema), and route events based on event values only. Such systems are inadequate in heterogeneous and dynamic environments where the event providers and consumers mayuse different event schemas. In this paper, we present a semantic publish/subscribe system. With our system, the event providers publish events and event consumers define subscription conditions using their respective event schema of choice. Our system uses ontologies to understand the semantics of events, and correlatesand maps events using relational operators as part of event brokering.
Remote Line Rendering for Mobile Devices
Authors: Joachim Diepstraten, Martin Gorke, Thomas Ertl
Venue: Proceedings of the Computer Graphics International (2004)

There is a growing interest for providing interactivegraphics also on mobile devices like PDAs, Smartphones,etc. Right now mobile devices are very limited concerninggraphical resources basically only simple 2D rasterizationoperations are available, that run completely on the mainCPU of the device. The desire to have more complex 3Dgraphics on these devices often results in a remote renderingsolution. Classical remote rendering solutions producethe final images on a server and transfer these to the clientdevice over a wired or non-wired network. With this paperwe present an alternative method to the image-basedapproach by splitting the rendering process between clientand server transfering couple of 2D line primitives over thenetwork, which are rendered locally by the mobile device.
Co-trained support vector machines for large scale unstructured document classification using unlabeled data and syntactic information
Authors: Seong-Bae Park, Byoung-Tak Zhang
Venue: Information Processing and Management: an International Journal (2004)

Most document classification systems consider only the distribution of content words of the documents, ignoring the syntactic information underlying the documents though it is also an important factor. In this paper, we present an approach for classifying large scale unstructured documents by incorporating both the lexical and the syntactic information of documents. For this purpose, we use the co-training algorithm, a partially supervised learning algorithm, in which two separated views for the training data are employed and the small number of labeled data are augmented by the large number of unlabeled data. Since both the lexical and the syntactic information can play roles of separated views for the unstructured documents, the co-training algorithm enhances the performance of document classification using both of them and a large number of unlabeled documents. The experimental results on Reuters-21578 corpus and TREC-7 filtering documents show the effectiveness of unlabeled documents and the use of both the lexical and the syntactic information.
'I didn't buy it for myself' privacy and ecommerce personalization
Authors: Lorrie Faith Cranor
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

Ecommerce personalization can help web sites build and retain relationships with customers, but it also raises a number of privacy concerns. This paper outlines the privacy risks associated with personalization and describes a number of approaches to personalization system design that can reduce these risks. This paper also provides an overview of the fair information practice principles and discusses how they may be applied to the design of personalization systems, and introduces privacy laws and self-regulatory guidelines relevant to personalization. Privacy risks can be reduced when personalization system designs allow for pseudonymous interactions, client-side data stores, and task-based personalization. In addition, interfaces that allow users to control the collection and use of their profile information can further ease privacy concerns.
Availability Measurement and Modeling for An Application Server
Authors: Dong Tang, Dileep Kumar, Sreeram Duvur, Oystein Torbjornsen
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Application Server is a standard middlewareplatform for deploying web-based business applicationswhich typically require the underlying platform to deliverhigh system availability and to minimize loss oftransactions. This paper presents a measurement-basedavailability modeling and analysis for a fault tolerantApplication Server system - Sun Java System ApplicationServer, Enterprise Edition 7. The study applieshierarchical Markov reward modeling techniques on thetarget software system. The model parameters areconservatively estimated from lab or field measurements.The uncertainty analysis method is used on the model toobtain average system availability and confidenceintervals by randomly sampling from possible ranges ofparameters that cannot be accurately measured in limitedtime frames or may vary widely in customer sites. Asdemonstrated in this paper, the combined use of labmeasurement, analytical modeling, and uncertaintyanalysis is a useful evaluation approach which canprovide a conservative availability assessment at statedconfidence levels for a new software product.
Building Blocks of a Semantic Web Framework - Requirements Analysis and Architectural Implications
Authors: Thomas Biskup, Jorge Marx Gomez
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The Internet initially spread to all areas of business, information and communication with amazing speed. Recent enhancements to its communicative and informative effectiveness have been much slower in acceptance. This is caused by the increased complexity of these new services. No longer can new technologies (e.g. web services and ontologies) be used by anyone (as is true for e.g. HTML). Quite to the contrast the new technologies require a deep understanding of the topics involved (e.g. agent architectures and knowledge engineering). One of the foremost tasks in the near future thus is to provide abstraction layers that facilitate the usage of these new technologies. Our WASP framework aims to simplify the access and reuse of technologies like web services, agents and large-scale knowledge bases. This paper describes the individual building blocks, the basic requirements and the necessary infrastructure to connect the individual building blocks in more detail.
Who Is Liable for Insecure Systems?
Authors: Nancy R. Mead
Venue: Computer (2004)

Over the past several years, we have seen both the enactment of legislationaffecting liability and the appearance of actual liability cases in the courts.Although several software flaws can make systems insecure, an entire industry including software vendors, systems administrators, consultants, network technicians, and clearing houses has developed to try to mitigate security holes after the fact.Nevertheless, the issue of liability lurks just beneath the surface of all their activities. Although the courts may not be the best venue for resolving this, liability cases will take place and an evolution of best practices will occur as well.
A unified approach to a fair document exchange system
Authors: N. Zhang, Q. Shi, M. Merabti
Venue: Journal of Systems and Software (2004)

This paper aims to propose a solution to unify different approaches to fair document exchange for the development of a flexible, general and secure fair document exchange system capable of guaranteeing strong fairness. The solution caters for a document exchange among any number of parties under various situations. At the heart of this unified solution are methods for a verifiable and recoverable encryption of a symmetric (or conventional) key for document encryption and decryption in a simple and efficient manner. The verifiability means that any party can verify the correctness of a key encrypted without actually viewing the key, and the recoverability implies that the party can be assured that a designated party or a group of designated parties can decrypt the encrypted key to recover the original key. These methods are essential for the unified solution to achieve strong fairness. The main novel contribution of the work presented in this paper is that the proposed unified solution represents the first effort on providing an efficient and unified approach to achieving strong fairness in document exchange under various situations.
Participant Activity Detection by Hands and Face Movement Tracking in the Meeting Room
Authors: Igor Potucek, Stanislav Sumec
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a collection of methods for anevaluation of participantsý activity in the meeting. Thetechniques of skin color detection, segmentation,feature extraction, and tracking detected objects andtheir identification are included. Our aim is to extractinformation from participant hands and face movementsuitable for intelligent video editing and as additionalinformation for speech recognition.
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
Authors: J. Breit
Venue: Information Processing Letters (2004)

We study the problem of scheduling n jobs in a two-machine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e., if a job cannot be finished before the down period it is continued after the machine becomes available again. The objective is to minimize the makespan. The best fast approximation algorithm for this problem guarantees a relative worst-case error bound of 4/3. We present an improved algorithm with a relative worst-case error bound of 5/4.
Message from the Chairs
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

mess-gen
Real-Time Simulation: Water Droplets on Glass Windows
Authors: Yonggao Yang, Changqian Zhu, Hua Zhang
Venue: Computing in Science and Engineering (2004)

Real-time simulation of water droplets on glass windows is a challenging computer-graphics task. Most existing work uses ray-tracing algorithms, a time-consuming computation and rendering process. In this installment, we present a new real-time approach.
Standards as an Enabler for Next Generation Networks
Authors: K. R. Dickerson
Venue: BT Technology Journal (2004)

The recession in the telecommunications industry has meant that the traditional telecommunications operators (BT, AT T, FT, etc) have found it difficult to provide the resources needed to participate effectively in the standards process. Thus, they are not influencing international standards to get what is needed to build the next generation of telecommunications networks. This could mean that the introduction of new services is delayed and that customers may have to pay more for their services than is necessary. A clear priority now is to re-engage operators in standardisation so that the equipment needed to build next generation networks (NGNs) is standardised to operator requirements. This is the only way to get network build costs down to a level where operators can afford to install it. This paper looks at ways of achieving this goal.
Transmission lines fabricated with CMOS interconnect technology
Authors: Guo Lihui, Zhang Yibin, Jeffrey Su Yong Yong
Venue: Microelectronic Engineering (2004)

Transmission lines, microstrip and coplanar waveguide, have been fabricated on lossy silicon substrates embedded in CMOS Cu/SiO2 interconnect layers. The characteristic impedance, the loss and the slowing factor have been studied in detail with the geometric size of transmission lines. It is shown that microstrips and coplanar waveguides embedded in silicon oxide can be achieved with CMOS compatible interconnect technology and with low loss on lossy silicon wafers, which provide the essential passive components for designing microwave and millimetre-wave circuits on silicon wafers.
Some verification problems in Pascal-like languages
Authors: Joseph V. Giordano
Venue: ACM SIGSOFT Software Engineering Notes (1980)

This paper discusses the design of programming languages suitable for program verification, considering in particular Pascal, Euclid, Gypsy, and Ada. Basing our discussion on programming capabilities found in Pascal, we evaluate (a) how well each language solves or reduces verification problems such as name visibility, aliasing, relative completeness, side effects and (b) how the language's treatment of these verification problems impacts other language design concerns.
A study of the lot-sizing polytope
Authors: Alper Atamt&#x00fc;rk, Juan Carlos Mu&#x00f1;oz
Venue: Mathematical Programming: Series A and B (2004)

The lot-sizing polytope is a fundamental structure contained in many practical production planning problems. Here we study this polytope and identify facet&#x2013;defining inequalities that cut off all fractional extreme points of its linear programming relaxation, as well as liftings from those facets. We give a polynomial&#x2013;time combinatorial separation algorithm for the inequalities when capacities are constant. We also report computational experiments on solving the lot&#x2013;sizing problem with varying cost and capacity characteristics.
Linear Discrepancy of Totally Unimodular Matrices
Authors: Benjamin Doerr
Venue: Combinatorica (2004)

We show that the linear discrepancy of a totally unimodular m&#x00d7;n matrix A is at most $${\text{lindisc}}{\left( A \right)} \leqslant 1 - \frac{1}{{n + 1}}$$.This bound is sharp. In particular, this result proves Spencer&#x2019;s conjecture $${\text{lindisc}}(A) \leqslant {\left( {1 - \frac{1}{{n + 1}}} \right)}$$ herdisc(A) in the special case of totally unimodular matrices. If m&#x2265;2, we also show $${\text{lindisc}}{\left( A \right)} \leqslant 1 - \frac{1}{m}$$.Finally we give a characterization of those totally unimodular matrices which have linear discrepancy $$1 - \frac{1}{{n + 1}}$$: Besides m&#x00d7;1 matrices containing a single non-zero entry, they are exactly the ones which contain n+1 rows such that each n thereof are linearly independent. A central proof idea is the use of linear programs.
Do senior CS students capitalize on recursion?
Authors: David Ginat
Venue: ACM SIGCSE Bulletin (2004)

CS students learn and practice recursion in CS1, Data-Structures, Introduction-to-Algorithms, and additional courses throughout the curriculum. Previous studies revealed difficulties of CS1 students with the concept and the construct of recursion. What about advanced students? They may well understand the concept and the construct of recursion; but do they invoke and utilize recursion as a problem solving means? The paper examines this aspect, with senior CS students. The students were given three algorithmic tasks, for which the suitable solution approach was recursive. The student solutions and explanations demonstrate very limited capitalization on recursion as a problem solving means. We discuss the findings and suggest pedagogical implications for teaching.
Building a Self-Adaptive Content Distribution Network
Authors: Gawesh Jawaheer, Julie McCann
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper, we propose a framework for building a self-adaptive Content Distribution Network (CDN). Such a CDN will exhibit self-adaptive behaviour at a coarse grained granularity. It will be able to cope with serving heterogeneous resources under unpredictable conditions. We describe the concepts that underpin our framework and we discuss the issues that it raises.
GeneWays: a system for extracting, analyzing, visualizing, and integrating molecular pathway data
Authors: Andrey Rzhetsky, Ivan Iossifov, Tomohiro Koike, Michael Krauthammer, Pauline Kra, Mitzi Morris, Hong Yu, Pablo Ariel Duboué, Wubin Weng, W. John Wilbur, Vasileios Hatzivassiloglou, Carol Friedman
Venue: Journal of Biomedical Informatics (2004)

The immense growth in the volume of research literature and experimental data in the field of molecular biology calls for efficient automatic methods to capture and store information. In recent years, several groups have worked on specific problems in this area, such as automated selection of articles pertinent to molecular biology, or automated extraction of information using natural-language processing, information visualization, and generation of specialized knowledge bases for molecular biology. GeneWays is an integrated system that combines several such subtasks. It analyzes interactions between molecular substances, drawing on multiple sources of information to infer a consensus view of molecular networks. GeneWays is designed as an open platform, allowing researchers to query, review, and critique stored information.
Reducing null messages overhead through load balancing in conservative distributed simulation systems
Authors: Azzedine Boukerche, Sajal K. Das
Venue: Journal of Parallel and Distributed Computing (2004)

This paper studies the problem of load balancing for conservative distributed simulations for execution on a multicomputer architecture. The synchronization protocol makes use of Chandy-Misra null messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length which indicates the workload at each processor.We examine two variations of the algorithm--referred to as the centralized and multi-level hierarchical methods--and experiment with four simulation workload models to study the scalability of our algorithm. The experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40% the synchronization overhead when compared to the use of a static partitioning algorithm. The results also indicate that the hierarchical version outperforms both the centralized version of the dynamic load balancing algorithm and the static partitioning scheme.
A Case Study of Organizational Effects in a Distributed Sensor Network
Authors: Bryan Horling, Roger Mailler, Victor Lesser
Venue: Proceedings of the Intelligent Agent Technology, IEEE/WIC/ACM International Conference (2004)

We describe how a system employing different types of organizational techniques addresses the challenges posed by a large-scale distributed sensor network environment. The high-level multi-agent architecture of real-world system is given in detail, and empirical and analytic results are provided showing the various effects that organizational characteristics have on the system's performance. We show how partitioning of the environment can lead to better locality and more constrained communication, as well as disproportionate load on individuals or increased load on the population as a whole. The presence of such tradeoffs motivates the need for a better understanding of organizational effects.
Using REFSENO to Represent Knowledge in the Software Maintenance Process
Authors: Aurora Vizcaino, Francisco Ruiz, Mario Piattini, Felix Garcia
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Many papers describe ontological designs but few of them explain how the ontology may be implemented. This paper describes how an ontology to represent software maintenance knowledge was specified by using the REFSENO Methodology. The paper also explains the use of similarity functions to compare products and requirements in order to reuse previous solutions and lessons learned.
A Comparative Study of the Design of Synchronous and Asynchronous Self-Checking RISC Processors
Authors: P. D. Hyde, G. Russell
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

The use of deep sub-micron technology raises anumber of concerns about reliability in VLSI circuits.Shrinking geometries and reduced power supplies leavethe circuits vulnerable to 'soft' and transient errors. Thecombination of high clock speed and large circuit arearesult in high power consumption and skew in clockdistribution. This paper investigates the use ofConcurrent Error Detection (CED) and asynchronousdesign to overcome these problems. Four pipelinedprocessor designs are compared - two synchronous, twoasynchronous with one of each type using CED. Initialresults indicate an area overhead of 12% in return for afault coverage of 98.54% of all unidirectional errors.Additionally, the asynchronous CED processor has anarea overhead of only 4% when compared to thesynchronous non-CED design.
A CAD Framework for Co-Design and Analysis of CMOS-SET Hybrid Integrated Circuits
Authors: Santanu Mahapatra, Kaustav Banerjee, Florent Pegeon, Adrian Mihai Ionescu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper introduces a CAD framework for co-simulation ofhybrid circuits containing CMOS and SET (Single ElectronTransistor) devices. An improved analytical model for SET is alsoformulated and shown to be applicable in both digital and analogdomains. Particularly, the extension of the recent MIB model forsingle/multi gate symmetric/asymmetric device for a wide range ofdrain to source voltage and temperature is addressed. Circuit levelco-simulations are successfully performed by implementing theSET analytical model in Analog Hardware Description Language(AHDL) of a professional circuit simulator SMARTSPICE.Validation at device and circuit level is carried out by Monte-Carlosimulations. Some novel functionality hybrid CMOS-SETcircuit characteristics: (i) SET neuron (ii) Multiple valued logiccircuit and (iii) a new Negative Differential Resistance (NDR)circuit, are also predicted by the proposed SET model andanalyzed using the new hybrid simulator.
Deformable Object Model Matching by Topological and Geometric Similarity
Authors: Kwok-Leung Tam, Rynson W. H. Lau, Chong-Wah Ngo
Venue: Proceedings of the Computer Graphics International (2004)

In this paper, we present a novel method for efficient3D model comparison. The method is designed tomatch highly deformed models through capturing twotypes of information. First, we propose a feature pointextraction algorithm, which is based on "Level SetDiagram", to reliably capture the topological points ofa general 3D model. These topological pointsrepresent the skeletal structure of the model. Second,we also capture both spatial and curvatureinformation, which describes the global surface of a3D model. This is different from traditional topological3D matching methods that use only low-dimensionlocal features. Our method can accurately distinguishdifferent types of 3D models even if they have similartopology. By applying the bipartite graph matchingtechnique, our method can achieve a high precision of0.54 even at a recall rate of 1.0 as demonstrated in ourexperimental results.