ppxscal/embedding_network huggingface dataset:
Research on Model and Scheduling Algorithm for Double-Mode VoD Servers
Authors: Yu Chen, Qionghai Dai
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, we design Double-Mode VoD Server (DM-VS). DM-VS provides online on-Demand service and offline on-Demand service. For offline on-Demand service, DM-VS merges several requests accessing the same video clip into a batching multicast that willimprove the server's scalability and resource utilization, and decrease the servicing cost. In this paper, we design the model and scheduling algorithm for DM-VS. We use exclusive resource allocation and different resource scheduling algorithms for the two on-Demand services. Besides this, we present the cost functions for online on-Demand service and offline on-Demand service, and analyze the relation between the two functions.
What video games have to teach us about learning and literacy
Authors: James Paul Gee
Venue: Computers in Entertainment (CIE) (2003)

Good computer and video games like System Shock 2, Deus Ex, Pikmin, Rise of Nations, Neverwinter Nights, and Xenosaga: Episode 1 are learning machines. They get themselves learned and learned well, so that they get played long and hard by a great many people. This is how they and their designers survive and perpetuate themselves. If a game cannot be learned and even mastered at a certain level, it won't get played by enough people, and the company that makes it will go broke. Good learning in games is a capitalist-driven Darwinian process of selection of the fittest. Of course, game designers could have solved their learning problems by making games shorter and easier, by dumbing them down, so to speak. But most gamers don't want short and easy games. Thus, designers face and largely solve an intriguing educational dilemma, one also faced by schools and workplaces: how to get people, often young people, to learn and master something that is long and challenging--and enjoy it, to boot.
An Optoelectronic Multi-Terabit CMOS Switch Core for Local Area Networks
Authors: Honglin Wu, Amir Gourgy, Ted H. Szymanski
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Optoelectronic integrated circuits can supportthousands of integrated optical laser diodes andphotodetectors bonded to a high-performance CMOSsubstrate, and can be used in the design of Multi-Terabitoptical Local Area Networks. This paper describes thedesign of an integrated optoelectronic CMOS crossbarswitch to interconnect approx. 128 parallel fiber ribbonoptical links, each with 12 channels clocked at 2.5Gigabit/sec, to achieve a Local Area Network (LAN) withan aggregate capacity of 3.84 Terabits/second. Aprototype switch core has been designed in 0.18µmCMOS technology. Logic optimization and synthesis wasperformed using the Synopsis logic optimization tools,and VLSI layout was performed using the Cadence 2002tools. It is shown that using 0.18µm CMOS technology, a3.84 Terabit crossbar switch for an optoelectronic LANoccupies approx. 1.78 sq. cm of real estate, and consumesapprox. 90 watts of power.
From Conflict of Interest to Separation of Duties in WS-Policy for Web Services Matchmaking Process
Authors: Patrick C. K. Hung
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

A Web service is defined as an autonomous unit of application logic that provides either some business functionality or information to other applications through an Internet connection. Web services are based on a set of XML standards such as Simple Object Access Protocol (SOAP), Universal Description, Discovery and Integration (UDDI) and Web Services Description Language (WSDL). Web services architectures are built on an insecure, unmonitored and shared environment, which is open to events such as security threats. Security concerns are the major barrier that prevents many business organizations from implementing or employing Web services. Based on the previous research in Conflict of Interest (CIR), this paper further introduces another important security concept called Separation of Duties (SoD) for Web Services Matchmaking Process (WSMP). Next, this paper discusses the relationships between CIR and SoD in the context of matchmaking process. The paper then extends these two concepts into specifying and implementing CIR and SoD assertions in the newly developed WS-Policy. WS-Policy is an XML representation that provides a grammar for expressing Web services policies, to allow service locators to have acommon interpretation of security requirements in the matchmaking process. Further, this paper presents a matchmaking algorithm for maximizing the level of SoD. Lastly, this paper also describes a prototype framework with "CIRService" and "SoDService" services forsupporting CIR and SoD assertions in matchmaking process.
A fixed-parameter algorithm for minimum quartet inconsistency
Authors: Jens Gramm, Rolf Niedermeier
Venue: Journal of Computer and System Sciences (2003)

Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the MINIMUM QUARTET INCONSISTENCY (MQI) problem is the question whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in only k quartet topologies. The more general problem where we are not necessarily given a topology for every subset of four taxa appears to be fixed-parameter intractable. For MQI, however, which is also NP-complete, we can compute the required tree in time O(4kn + n4). This means that the problem is fixed-parameter tractable and that in the case of a small number k of "errors" the tree reconstruction can be done efficiently. In particular, for minimal k, our algorithm can produce all solutions that resolve k errors. Additionally, we discuss significant heuristic improvements. Experiments underline the practical relevance of our solutions.
Large Deviation Bounds for Markov Chains
Authors: Nabil Kahale
Venue: Combinatorics, Probability and Computing (1997)

We study the fraction of time that a Markov chain spends in a given subset of states. We give an exponential bound on the probability that it exceeds its expectation by a constant factor. Our bound depends on the mixing properties of the chain, and is asymptotically optimal for a certain class of Markov chains. It beats the best previously known results in this direction. We present an application to the leader election problem.
Mathematical Assessment of Object-Oriented Design Quality
Authors: Alexander Chatzigeorgiou
Venue: IEEE Transactions on Software Engineering (2003)

A method of link analysis employed for retrieving information from the Web is extended in order to evaluate one aspect of quality in an object-oriented model. The principal eigenvectors of matrices derived from the adjacency matrix of a modified class diagram are used to identify and quantify heavily loaded portions of an object-oriented design that deviate from the principle of distributed responsibilities.
Face recognition: component-based versus global approaches
Authors: Bernd Heisele, Purdy Ho, Jane Wu, Tomaso Poggio
Venue: Computer Vision and Image Understanding (2003)

We present a component-based method and two global methods for face recognition and evaluate them with respect to robustness against pose changes. In the component system we first locate facial components, extract them, and combine them into a single feature vector which is classified by a support vector machine (SVM). The two global systems recognize faces by classifying a single feature vector consisting of the gray values of the whole face image. In the first global system we trained a single SVM classifier for each person in the database. The second system consists of sets of view-specific SVM classifiers and involves clustering during training. We performed extensive tests on a database which included faces rotated up to about 40° in depth. The component system clearly outperformed both global systems.
Custom scheduling algorithms in a simulation-like environment
Authors: Robert H. Storer, Emory W. Zimmers
Venue:  (2003)

We present a new framework that allows users to easily develop scheduling algorithms that are both highly customized and powerful. This environment is a unique and simple way to satisfactorily solve real-world problems using embedded Problem Space Search heuristics, Genetic Algorithms, and user-coded models. We use an easy and powerful methodology that utilizes simulation-like constructs borrowed from the discrete event simulation field for developing the environment, since simulation is a straightforward way to describe a specific manufacturing system. We show that this solution methodology is easily adapted to various manufacturing settings and it produces high-fidelity shop floor models. We illustrate this idea using real industrial shop floor scheduling problems that contain simultaneously: lot sizing, batch aggregation and disaggregation, alternate routings, sequence dependent setup times, and due date constraints. Problems from three different industries are tested in order to prove real-world applicability and demonstrate robustness. We also solve jobshop problems from academia and introduce modified jobshop problems with alternate routes. The ease of a simulation-type language is demonstrated. We argue that our framework overcomes shortcomings of currently available methods that can be too general, too costly, and/or too simple.
The virGIS WFS-based spatial mediation system
Authors: Omar Boucelma, Jean-Yves Garinet, Zoé Lacroix
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

The proliferation of spatial data on the Internet is beginning to allow a much wider access to data currently available in various Geographic Information Systems (GIS). In order to provide effective spatial database integration, we need to provide flexible and powerful GIS data integration solutions. Indeed, GIS are highly heterogeneous: not only they differ by their data representations, but they also offer radically different query languages. A GIS mediation approach should provide an integrated view of the data supplied by all sources, and a geographical query language to access and manipulate integrated data.
JEstelle novel approach to the distributed Java systems specification and development
Authors: Marcin Czenko, Jean-Luc Raffy
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The design of distributed Java applications is a very complicated task. Regardless of Java's ease of use and portability, a method that provides a means of testing and validating complex systems in a satisfactory manner is still lacking. In addition system portability is often decreased due to strong dependencies between subsystem implementation and the way they communicate. In this article we would like to introduce JEstelle -- the union of Java and the Estelle Formal Description Technique. JEstelle provides a solution that can significantly simplify the distributed Java applications development. JEstelle introduces some level of formalism to the communication part of a distributed Java application, thus allowing for its validation and improving readability of the system design. JEstelle does not introduce serious Java API restrictions and naturally supports automatic implementation code generation. Development of JEstelle support tools is simplified due to a combination of specific features of Java technology and the use of existing Estelle development tools. JEstelle is easy to use and practically does not require the designer to be familiar with Formal Description Techniques at all, and with Estelle in particular.
Robust approximations to the distribution of link distances in a wireless network occupying a rectangular region
Authors: John P. Mullen
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

An important characteristic of a Mobile Ad Hoc Network (MANET) is the distribution of the link distance between communicating nodes. Knowing this distribution is a step in determining the distribution of the number of neighbor nodes, the number of hops required to transmit a message, etc. This paper presents two robust approximations to the link distance distribution for nodes within a rectangular area, providing the x and p node coordinates follow independent continuous spatial distributions. This paper also presents an approximate link distance distribution for the Random Waypoint Mobility model and examines the approximation error in a number of situations.
Bartholdi zeta functions of digraphs
Authors: Hirobumi Mizuno, Iwao Sato
Venue: European Journal of Combinatorics (2003)

We give a determinant expression for the Bartholdi zeta function of a digraph which is not symmetric. This is a generalization of Bartholdi's result on the Bartholdi zeta function of a graph or a symmetric digraph.
Developing Workflow-Based Information Integration (WII) with Exception Support in a Web Services Environment
Authors: Patrick C. K. Hung, Dickson K. W. Chiu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Assembling a coherent view of distributed heterogeneous information and information processing resources is a challenging and important process for inter-organizational collaboration and service provision. We refer to this process as information integration. However, traditional information integration approaches do not consider human intervention and exceptions, such as obtaining access approvals from service providers. Therefore, we propose a workflow-based approach to address this problem. This is particularly suitable in a loosely coupled and autonomous Web services environment. In this paper, we propose an implementation framework of Workflow-based Information Integration (WII) comprise four layers, namely, application layer, workflow layer, service layer, and message layer. In particular, our paper focuses on the workflow layer from the aspects of control-flows, data-flows and exception-flows by using the Business Process Execution Language for Web Services (BPEL4WS), extended with our proposed data-integration and exception-handling assertions. Each service provider provides Web services at the service layer and BPEL4WS orchestrates them together in order to achieve workflow-based information integration plans. The message layer comprises SOAP message specifications. We map information into SOAP messages and link the proposed exception-handling assertions in BPEL4WS to SOAP-fault implementations. Lastly, we demonstrate the feasibility of our approach with a practical healthadministrative information integration case study at the application layer and examine some typical use cases of exceptions.
Proximity as a Security Property in a Mobile Enterprise Application Context
Authors: Christian Decker, Serge Nguissi, Jochen Haller, Roger Kilian-Kehr
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

M-Commerce will not prosper without reliable and usable security concepts. Concepts which are not prone to scare users away from utilizing mobile applications, secured by complicated and cryptic mechanisms are the essential building blocks of M-Commerce.This publication specifies a highly usable security solution for a mobile worker by introducing a so-called proximity device. It is a physically small device, for instance unobtrusively wearable as a ring, cryptographically proving its presence to a security module in order to facilitate use of critical functionality. The paper introduces an architecture based on a security module which is implemented as tamper resistant hardware such as a smart card. Thesecurity module operates as expected if the proximity device can cryptographically prove its presence within a safe physical proximity.The user benefits from the proximity device in many ways, for instance it is no longer necessary to perform frequent activation processes for the security module and one stolen device alone is no longer usable for a thief.
Two diet plans for fat PDF
Authors: Thomas A. Phelps, Robert Wilensky
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

As Adobe's Portable Document Format has exploded in popularity so too has the number PDF generators, and predictably the quality of generated PDF varies considerably. This paper surveys a range of PDF optimizations for space, and reports the results of a tool that can postprocess existing PDFs to reduce file sizes by 20 to 70% for large classes of PDFs. (Further reduction can often be obtained by recoding images to lower resolutions or with newer compression methods such as JBIG2 or JPEG2000, but those operations are independent of PDF per se and not a component of the results reported here.) A new PDF storage format called "Compact PDF" is introduced that achieves for many classes of PDF an additional reduction of 30 to 60% beyond what is possible in the latest PDF specification (version 1.5, corresponding to Acrobat 6); for example, the PDF 1.5 Reference manual shrinks from 12.2MB down to 4.2MB. The changes required by Compact PDF to the PDF specification and to PDF readers are easily understood and straightforward to implement.
&aelig;ther: reading with tactile vision
Authors: Erik Conrad
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

&aelig;ther is an interactive, haptic surface for computer mediated visual information that allows for a physical experience of textual analogous to the visual experience of whitespace in a poem.
Contemplate sorting with columnsort
Authors: Lester I. McCann
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

The efficiency of Internet search engines has made it trivial for students to find implementations of standard algorithms. This fact has led computer science educators to be more creative with their assignments to encourage students to create their own implementations. Unfortunately, excessive creativity can obscure learning objectives, particularly for less insightful students. We demonstrate that recasting the parallel sorting algorithm Columnsort for a uniprocessor environment provides the foundation for a variety of sorting assignments that can engage students while not obscuring educational objectives.
Towards systematic design of distance functions for data mining applications
Authors: Charu C. Aggarwal
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the context of a particular data domain. It is also often a challenging and non-trivial task to find the most effective form of the distance function. For example, in the text domain, distance function design has been considered such an important and complex issue that it has been the focus of intensive research over three decades. The final design of distance functions in this domain has been reached only by detailed empirical testing and consensus over the quality of results provided by the different variations. With the increasing ability to collect data in an automated way, the number of new kinds of data continues to increase rapidly. This makes it increasingly difficult to undertake such efforts for each and every new data type. The most important aspect of distance function design is that since a human is the end-user for any application, the design must satisfy the user requirements with regard to effectiveness. This creates the need for a systematic framework to design distance functions which are sensitive to the particular characteristics of the data domain. In this paper, we discuss such a framework. The goal is to create distance functions in an automated waywhile minimizing the work required from the user. We will show that this framework creates distance functions which are significantly more effective than popularly used functions such as the Euclidean metric.
Quaternary to binary bit conversion CMOS integrated circuit design using multiple-input floating gate MOSFETS
Authors: A. Srivastava, H. N. Venkata
Venue: Integration, the VLSI Journal (2003)

Multiple-input floating gate MOSFETs and floating gate potential diagrams have been used for the conversion of quaternary-valued input into corresponding binary output in CMOS integrated circuit design environments. The method is demonstrated through the design of a circuit for conversion of quaternary inputs into the corresponding binary bits in a standard 1.5 µm digital CMOS technology. The physical design of the circuit is simulated and tested with SPICE using MOSIS BSIM3 model parameters. Measurements on fabricated devices for the conversion of quaternary input (decimal 0-3) into binary output (binary 00-11) have shown agreement with the corresponding simulated values. The conversion method is simple and compatible with the present CMOS process. The circuit can be embedded in digital CMOS VLSI design architectures.
eXtensible content protection
Authors: Florian Pestoni, Clemens Drews
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper describes a proof of concept implementation of xCP, a content protection scheme for home networks.
Free software developers as an occupational community: resolving conflicts and fostering collaboration
Authors: Margaret S. Elliott, Walt Scacchi
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

In this paper, we present results from the study of a free software development virtual organization, the GNU Enterprise (GNUe) project, and how they develop software in a globally distributed free software development project. In particular, examples of how they mitigate and resolve conflict are presented. Conflict arises over the use of a non-free tool to create GNUe graphic, and over the use of a non-free tool for GNUe documentation. The GNUe developers resolve the conflict using internet relay chat (IRC), threaded email discussions, and community digests. We characterize the GNUe developers as an occupational subculture within the occupational community of free/open source software (F/OSS) developers and show how the beliefs in free software and freedom of choice, and values in cooperative work and community assist GNUe contributors in mitigating and resolving conflict. In addition, we show how, despite fluctuating boundaries of membership in a virtual organization, daily discussions on the GNUe IRC serve to build and perpetuate the global community of GNUe contributors as well as F/OSS developers in general.
A review of machine learning in dynamic scheduling of flexible manufacturing systems
Authors: Paolo Priore, David De La Fuente, Alberto Gomez, Javier Puente
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

A common way of dynamically scheduling jobs in a flexible manufacturing system (FMS) is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no single rule exists that is better than the rest in all the possible states that the system may be in. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning can be used. Analyzing the previous performance of the system (training examples) by means of this technique, knowledge is obtained that can be used to decide which is the most appropriate dispatching rule at each moment in time. In this paper, a review of the main machine learning-based scheduling approaches described in the literature is presented.