ppxscal/embedding_network huggingface dataset:
The Dynamic and Stochastic Knapsack Problem
Authors: Anton J. Kleywegt, Jason D. Papastavrou
Venue: Operations Research (1998)

The Dynamic and Stochastic Knapsack Problem (DSKP) is defined as follows. Items arrive according to a Poisson process in time. Each item has a demand (size) for a limited resource (the knapsack) and an associated reward. The resource requirements and rewards are jointly distributed according to a known probability distribution and become known at the time of the item's arrival. Items can be either accepted or rejected. If an item is accepted, the item's reward is received; and if an item is rejected, a penalty is paid. The problem can be stopped at any time, at which time a terminal value is received, which may depend on the amount of resource remaining. Given the waiting cost and the time horizon of the problem, the objective is to determine the optim al policy that maximizes the expected value (rewards minus costs) accumulated. Assuming that all items have equal sizes but random rewards, optimal solutions are derived for a variety of cost structures and time horizons, and recursive algorithms for computing them are developed. Optimal closed-form solutions are obtained for special cases. The DSKP has applications in freight transportation, in scheduling of batch processors, in selling of assets, and in selection of investment projects.>
Specification and Analysis of the DCF and PCF Protocols in the 802.11 Standard Using Systems of Communicating Machines
Authors: Moustafa A. Youssef, Arunchandar Vasan, Raymond E. Miller
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

We propose formal models for coordination functions of the 802.11 MAC layer using systems of communicating machines and analyze them. We model the basic DCF (CSMA/CA) protocol, the DCF protocol with RTS/CTS (MACA), and the PCF protocol. Analyses show the following safety results: the CSMA/CA protocol is free from deadlocks and non-executable transitions, the MACA has a potential livelock, but is free from deadlocks and non-executabletransitions, and the PCF protocol is free from deadlocks and non-executable transitions. We also show that liveness is guaranteed in the PCF protocol.
Some results on positive eigenvalues of admissible maps
Authors: In-Sook Kim
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

The Birkhoff-Kellogg eigenvalue theorem is extended to a class of compact admissible set-valued maps with not necessarily convex values, where the proof is based on fixed point theorems of Jerofsky and uses elementary methods. Moreover, we prove a result on positive eigenvalues of condensing admissible maps which generalizes known results and has many consequences.
Paradoxes review
Authors: Feng Liu
Venue: Smarandache Notions Journal (2002)

I came across one of the Smarandache divine paradoxes and felt very strongly that it is really our Buddhist's obligation to help understand the underlying truth. There seem a lot of toughest points in the cultural difference, and it will be the most difficult job to reach the mutual point as neutrality. What I can do is to try our best and find cooperation. Limited to the time, I just put a few as my first review.
An empirical analysis of productivity gains from information technology's reduction of coordination costs
Authors: Namchul Shin
Venue: Creating business value with information technology: challenges and solutions (2003)

Most information systems (IS) research has examined the impact of information technology (IT) on the organization of economic activities by starting from the theoretical speculation that IT reduces coordination costs and improves coordination of economic activities. This theoretical speculation, however, has not been empirically analyzed in the IS field. The value of IT for reducing coordination costs has also not been considered in the studies on IT productivity gains. This study empirically examines the relationship between IT and coordination costs, and the relationship between IT and firm productivity by considering coordination as a factor of production. The results indicate that IT is strongly associated with a decline in coordination costs and that IT and coordination make a substantial and statistically significant contribution to firm output. The results show that IT contributes to firm output by reducing coordination costs and improving coordination; that is, by making a higher level of coordination more efficient.
Encapsulating binary tree traversal: a design exercise
Authors: John S. Mallozzi
Venue: Journal of Computing Sciences in Colleges (2003)

Traversal of binary trees is possible in many ways. A modern implementation of these methods should use encapsulation. In accord with the existing Java library, the Java Foundation Classes, we look into implementing the encapsulation using "cursors" and various kinds of iterators. Issues arising from the design of interfaces and implementations provide valuable lessons and experience for students in a data structures class. Issues include possible conflict between conformance with existing libraries and good design, tradeoffs between interface size and usefulness, and efficiency considerations.
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
Authors: Thomas T. Hildebrandt
Venue: Theoretical Computer Science (2003)

We present a presheaf model for the observation of infinite as well as finite computations. We give a concrete representation of the presheaf model as a category of generalised synchronisation trees and show that it is coreflective in a category of generalised transition systems, which are a special case of the general transition systems of Hennessy and Stirling. This can be viewed as a first step towards representing fairness in categorical models for concurrency. The open map bisimulation is shown to coincide with extended bisimulation of Hennessy and Stirling, which is essentially fair CTL*-bisimulation. We give a denotational semantics of Milner's SCCS with finite delay in the presheaf model, which differs from previous semantics by giving the meanings of recursion by final coalgebras and meanings of finite delay by initial algebras of the process equations for delay. Finally, we formulate Milner's operational semantics of SCCS with finite delay in terms of generalised transition systems and prove that the presheaf semantics is fully abstract with respect to extended bisimulation.
Attendance or Providing Added Value: A Study of the Structure of Cooperative e-Business Applications
Authors: Lech Krzanik, Jari T. Karvonen
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

We discuss conditions for the structure of cooperative e-business applications that provide added value. The conclusions are based on the analysis of business improvement and reengineering experience, and on own results with cooperative product engineering support for e-business applications. It is recommended that e-business applications and services integrate virtual modeling with decision support and explicit workflow management. A concept of 2nd generation virtual model-based cooperative engineering support is introduced, and a respective implementation is reported.
An Adaptive Bayesian Replacement Policy with Minimal Repair
Authors: Savas Dayanik, "lk" G"rler
Venue: Operations Research (2002)

In this study, an adaptive Bayesian decision model is developed to determine the optimal replacement age for the systems maintained according to a general age-replacement policy. It is assumed that when a failure occurs, it is eithercritical with probabilityp ornoncritical with probability 1 --p, independently. A maintenance policy is considered where the noncritical failures are corrected with minimal repair and the system is replaced either at the first critical failure or at age t, whichever occurs first. The aim is to find the optimal value of t that minimizes the expected cost per unit time. Two adaptive Bayesian procedures that utilize different levels of information are proposed for sequentiallyupdating the optimal replacement times. Posterior density/mass functions of the related variables are derived when the time to failure for the system can be expressed as a Weibull random variable. Some simulation results are also presented for illustration purposes.
Detecting critical regions in scalar fields
Authors: Gunther H. Weber, Gerik Scheuermann, Bernd Hamann
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

Trivariate data is commonly visualized using isosurfaces or direct volume rendering. When exploring scalar fields by isosurface extraction it is often difficult to choose isovalues that convey "useful" information. The significance of visualizations using direct volume rendering depends on the choice of good transfer functions. Understanding and using isosurface topology can help in identifying "relevant" isovalues for visualization via isosurfaces and can be used to automatically generate transfer functions.Critical isovalues indicate changes in topology of an isosurface: the creation of new surface components, merging of surface components or the formation of holes in a surface component. Interesting isosurface behavior is likely to occur at and around critical isovalues. Current approaches to detect critical isovalues are usually limited to isolated critical points. Data sets often contain regions of constant value (i.e., mesh edges, mesh faces, or entire mesh cells). We present a method that detects critical points, critical regions and corresponding critical isovalues for a scalar field defined by piecewise trilinear interpolation over a uniform rectilinear grid. We describe how to use the resulting list of critical regions/points and associated values to examine trivariate data.
Random thoughts and prime numbers
Authors: Ubiquity staff
Venue: Ubiquity (2002)

Jin-Yi Cai on the nature of theoretical computer science research.
AttrActive windows: dynamic windows for digital bulletin boards
Authors: Laurent Denoue, Les Nelson, Elizabeth Churchill
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In this paper we describe AttrActive Windows, a novel interface for presenting live, interactive, multimedia content on a network of public, digital, bulletin boards. Implementing a paper flyer metaphor, AttrActive Windows are paper-like in appearance and are attached to a virtual corkboard by virtual pushpins. Windows can therefore appear in different orientations, creating an attractive, informal look. Attractive Windows can also have autonomous behaviors that are consistent with the corkboard metaphor, like fluttering in the wind. We describe the AttrActive Windows prototype, and offer the results of an initial evaluative user study.
Nice class diagrams admit good design?
Authors: Holger Eichelberger
Venue: Proceedings of the 2003 ACM symposium on Software visualization (2003)

Analysis and design of programs by using tools has emerged to a standard technique in object-oriented software engineering. Many of these tools claim to implement methods according to the UML standard and some of the tools provide automatic layout of the diagrams drawn by the user or generated automatically from source code. In this paper we propose a set of aesthetic criteria for UML class diagrams and discuss the relation between these criteria, HCI and design aspects of object-oriented software.First we describe critics from the viewpoint of HCI to the UML notation and restrict ourself to changes which do not require nonstandard modifications to the UML notation guide, then we list quality relations between class diagrams and object-oriented software models. After that our set of aesthetic criteria, that reflect the highly sophisticated structural and semantic features of UML class diagrams, is explained. Finally, we show that an implementation and measurement of this proposal is realizable using a prototypical graph drawing framework.
HMRSVP: a hierarchical mobile RSVP protocol
Authors: Chien-Chao Tseng, Gwo-Chuan Lee, Ren-Shiou Liu, Tsan-Pin Wang
Venue: Wireless Networks (2003)

In this paper, we propose a hierarchical Mobile RSVP (HMRSVP) that can achieve mobility independent QoS-guaranteed services in mobile computing environments. The HMRSVP integrates RSVP with Mobile IP regional registration and makes advance resource reservations only when an inter-region movement may possibly occur. We first show that, by NS simulator, our HMRSVP can achieve the same QoS guarantees as MRSVP does with fewer resource reservations. Then, we show that HMRSVP outperforms MRSVP in terms of reservation blocking, forced termination and session completion probabilities.
Value webs: cases, features, and success factors
Authors: Dorian Selz, Stefan Klein
Venue: Managing virtual web organizations in the 21st century: issues and challenges (2002)

The new information infrastructure redefines the roles and relationships between buyer, seller, and middleman, allowing new ways of accessing and tapping information and price arrangements. Most importantly information about a product or service may be separated from the product or service itself. The chapter scrutinizes how companies are using these opportunities to establish networked retail businesses and generate customer value in innovative ways. We have tried to reconstruct a widespread interorganizational arrangement for product and service retailing on the Web, its antecedents, its challenges and its economic logic.
A word-based approach for modeling and discovering temporal relations embedded in Chinese sentences
Authors: Wenjie Li, Kam-Fai Wong
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2002)

Conventional information extraction systems cannot effectively mine temporal information. For example, users' queries on how one event is related to another in time could not be handled effectively. For this reason, it is important to capture and deduce temporal knowledge associated with the relevant events. It is generally acknowledged that information extraction cannot be isolated from natural language processing. As Chinese has no tenses, conventional means for finding temporal references based on verb forms no longer apply. In this article we present an approach for formulating and discovering temporal relations in Chinese. A set of rules is devised to map the combinational effects of the temporal indicators (also known as temporal markers, gathered from various grammatical categories) in a sentence to its corresponding temporal relation. To evaluate the proposed algorithm, experiments were conducted using a set of news reports and the results look promising. Problem discussions are also provided. Through this work, we hope to open up new doors for future research in Chinese temporal information extraction and processing.
Texture classification using wavelet transform
Authors: S. Arivazhagan, L. Ganesan
Venue: Pattern Recognition Letters (2003)

Today, texture analysis plays an important role in many tasks, ranging from remote sensing to medical imaging and query by content in large image data bases. The main difficulty of texture analysis in the past was the lack of adequate tools to characterize different scales of textures effectively. The development in multi-resolution analysis such as Gabor and wavelet transform help to overcome this difficulty. This paper describes the texture classification using (i) wavelet statistical features, (ii) wavelet co-occurrence features and (iii) a combination of wavelet statistical features and co-occurrence features of one level wavelet transformed images with different feature databases. It is found that, the results of later method are promising.
Communicating sequential processes
Authors: C. A. R. Hoare
Venue: The origin of concurrent programming: from semaphores to remote procedure calls (2002)

This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded command, these concepts are surprisingly versatile. Their use is illustrated by sample solutions of a variety of familiar programming exercises.
An expectation-maximization algorithm working on data summary
Authors: Huidong Jin, Kwong-Sak Leung, Man-Leung Wong
Venue: Computational intelligence and applications (2002)

Scalable cluster analysis addresses the problem of processing large data sets with limited resources, e.g., memory and computation time. A data summarization or sampling procedure is an essential step of most scalable algorithms. It forms a compact representation of the data. Based on it, traditional clustering algorithms can process large data sets efficiently. However, there is little work on how to effectively perform cluster analysis on data summaries. From the principle of the general expectation-maximization algorithm, we propose a model-based clustering algorithm to make better use of these data summaries in this paper. The proposed EMACF (Expectation-Maximization Algorithm on Clustering Features) algorithm employs data summary features including weight, mean, and variance explicitly. We prove that EMACF converges to a local maximum likelihood value. The computation time of EMACF is linear with the number of data summaries instead of the number of data items, and thus can be integrated with any efficient data summarization procedure to construct a scalable clustering algorithm.
Fast system-level power profiling for battery-efficient system design
Authors: Kanishka Lahiri, Anand Raghunathan, Sujit Dey
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

An increasing disparity between the energy requirements of portable electronic devices and available buttry capacities is driving the development of new design methodologies for battery-efficient systems. A crucial requirement for battery efficient system design is to be able to efficiently and accurately estimate battery life for candidate system architectures. Recently, efficient techniques have been developed to estimate battery life under given profiles of system power consumption over time. However, techniques for generating the power profiles themselves are either too cumbersome for system level exploration, or too inaccurate for battery life estimation.In this paper, we present a new methodology for efficiently and accurately generating power profiles for different system-level architectures. The designer can specify the manner in which (i) system tasks are mapped to a set of available implementations, and (ii) system communications are mapped to a specified communication architecture. For a given architecture, a power profile is automatically generated by analyzing an abstract representation of the system execution traces, while taking into account the selected implementations of the system's computations and communications.Experiments conducted on the design of an IEEE 802.11 MAC processor indicate that the power profiling approach offers run times that are several orders of magnitude lower than a simulation based power profiling technique, while sustaining negligible loss of accuracy (average profiling error was observed to be less than 3.4%).
Using graded relevance assessments in IR evaluation
Authors: Jaana Kekäläinen, Kalervo Järvelin
Venue: Journal of the American Society for Information Science and Technology (2002)

This article proposes evaluation methods based on the use of nondichotomous relevance judgements in IR experiments. It is argued that evaluation methods should credit IR methods for their ability to retrieve highly relevant documents. This is desirable from the user point of view in modern large IR environments. The proposed methods are (1) a novel application of P-R curves and average precision computations based on separate recall bases for documents of different degrees of relevance, and (2) generalized recall and precision based directly on multiple grade relevance assessments (i.e., not dichotomizing the assessments). We demonstrate the use of the traditional and the novel evaluation measures in a case study on the effectiveness of query types, based on combinations of query structures and expansion, in retrieving documents of various degrees of relevance. The test was run with a best match retrieval system (InQuery1) in a text database consisting of newspaper articles. To gain insight into the retrieval process, one should use both graded relevance assessments and effectiveness measures that enable one to observe the differences, if any, between retrieval methods in retrieving documents of different levels of relevance. In modern times of information overload, one should pay attention, in particular, to the capability of retrieval methods retrieving highly relevant documents.
Overcoming obstacles to undergraduate research at a small institution
Authors: Jennifer A. Polack-Wahl, Peter N. Squire
Venue: Journal of Computing Sciences in Colleges (2003)

How can small colleges/universities have undergraduate students conduct "graduate"like research when many of the departments are already stretch to the limits? This paper addresses the problems associated with small departments and student research, a way to enhance the research experience at a small college/university, a students experience with undergraduate research and finally lessons learned while doing undergraduate research.
Algebraic and combinatorial graph theory for optimal structural analysis
Authors: A. Kaveh
Venue: Civil and structural engineering computing: 2001 (2001)

For an efficient analysis of structures, the corresponding matrices should be sparse, well conditioned, and well structured. Analysis having these properties for structural matrices is called an optimal analysis. Such analysis becomes more and more important as the number of nodes and members of the structure increases. In this paper, applications of graph theory, algebraic graph theory, and matroids are presented for optimal analysis of the structures. These methods are used either separately or in hybrid forms. Applications are extended to finite element nodal ordering using ten topological transformations.
Couple stresses and non-Riemannian plastic connection in finite elasto-plasticity
Authors: Sanda Cleja-Tigoiu
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

In this paper we propose a macroscopic model for elasto-plastic materials with continuously distributed dislocations. The crystal is not homogeneous and the relaxed state is described by a plastic non-Riemannian metric connection. The dynamic balance equations involve non-symmetric Cauchy stresses and couple stresses. The crystalline body behaves as an elastic material element with respect to the relaxed state. The evolution equations for plastic distortion and its gradient have to be compatible with the requirement of a vanishing plastic curvature.