ppxscal/embedding_network huggingface dataset:
A game theoretic approach to provide incentive and service differentiation in P2P networks
Authors: Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, David K. Y. Yau
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Traditional peer-to-peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can obtain services without themselves contributing any information or service to a P2P community. This leads to the "free-riding" and "tragedy of the commons" problems, in which the majority of information requests are directed towards a small number of P2P nodes willing to share their resources. The objective of this work is to enable service differentiation in a P2P network based on the amount of services each node has provided to its community, thereby encouraging all network nodes to share resources. We first introduce a resource distribution mechanism between all information sharing nodes. The mechanism is driven by a distributed algorithm which has linear time complexity and guarantees Pareto-optimal resource allocation. Besides giving incentive, the mechanism distributes resources in a way that increases the aggregate utility of the whole network. Second, we model the whole resource request and distribution process as a competition game between the competing nodes. We show that this game has a Nash equilibrium and is collusion-proof. To realize the game, we propose a protocol in which all competing nodes interact with the information providing node to reach Nash equilibrium in a dynamic and efficient manner. Experimental results are reported to illustrate that the protocol achieves its service differentiation objective and can induce productive information sharing by rational network nodes. Finally, we show that our protocol can properly adapt to different node arrival and departure events, and to different forms of network congestion.
User&#x2019;s manual as a requirements specification: case studies
Authors: M. Berry, K. Daudjee, J. Dong, I. Fainchtein, A. Nelson, T. Nelson, L. Ou
Venue: Requirements Engineering (2004)

This paper argues that a user&#x2019;s manual makes an excellent software requirements specification. It describes several experiences, including one in industry, of writing user&#x2019;s manuals as requirements specifications. Finally, it discusses several lessons learned from the experiences.
Truth and absolute truth in neutrosophic logic
Authors: Feng Liu
Venue: Smarandache Notions Journal (2004)

As a philosophical analysis of some fatal paradoxes, the paper distinguishes the conceptual difference between representation of truth and source of truth, and leads to the conclusion that in order to acquire the genuine source of truth, independently of specific representations possibly belonging to different worlds, one is necessary to ignore all the ideas, logics, conceptions, philosophies and representable knowledge even himself belonging to those misleading worlds, returning to his infant nature, as a preliminary step for his cultivation of unconstrained wisdom. It also carries out some coordinative crucial issues as natural-doctrine, minded-unwitting, logic-infancy, conception-deconception, determinacy-indeterminacy. The paper tries to verify the role of neutrosophy and neutrosophic logic in religious issues and open a gateway toward the oriental classics, excavating the lost treasure.
Rational general solutions of algebraic ordinary differential equations
Authors: Ruyong Feng, Xiao-shan Gao
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a rational general solution if it exists. The algorithm is based on the relation between rational solutions of the first order ODE and rational parametrizations of the plane algebraic curve defined by the first order ODE and Padé approximants.
A Real-time Image Recognition System for Tiny Autonomous Mobile Robots
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Intelligent sensors for mobile robots play animportant role in many technical applications. In thispaper a real-time image recognition system for a tinysoccer playing robot is presented, capable of detectingobjects in real-time at a frame rate of up to 60frames/s.The image recognition module has very low powerconsumption of less than 250mW and fits into a packageof only 35x35mm including a CMOS camera and a lowpower, high performance signal processor. We proposean object recognition algorithm that is optimized fordeeply embedded systems used in energy andperformance constrained devices. The algorithm is basedon a combination of edge and color detection and uses afixed model for each object to be recognized. Results ofthe ball recognition application show that its relativepolar coordinates are found within 11ms.
iWatcher: Efficient Architectural Support for Software Debugging
Authors: Pin Zhou, Feng Qin, Wei Liu, Yuanyuan Zhou, Josep Torrellas
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

Recent impressive performance improvements in computer architecturehave not led to significant gains in ease of debugging.Software debugging often relies on inserting run-time softwarechecks. In many cases, however, it is hard to find the root causeof a bug. Moreover, program execution typically slows down significantly,often by 10-100 times.To address this problem, this paper introduces the IntelligentWatcher (iWatcher), novel architectural support to monitor dynamicexecution with minimal overhead, automatically, and flexibly.iWatcher associates program-specified monitoring functionswith memory locations. When any such location is accessed, themonitoring function is automatically triggered with low overhead.To further reduce overhead and support rollback, iWatcher canleverage Thread-Level Speculation (TLS). To test iWatcher, we useapplications with various bugs. Our results show that iWatcher detectsmany more software bugs than Valgrind, a well-known open-sourcebug detector. Moreover, iWatcher only induces a 4-80%execution overhead, which is orders of magnitude less than Valgrind.Even with 20% of the dynamic loads monitored in a program,iWatcher adds only 66-174% overhead. Finally, TLS is effective atreducing overheads for programs with substantial monitoring.
A suite of tools for teaching concurrency
Authors: Mordechai Ben-Ari
Venue: ACM SIGCSE Bulletin (2004)

This poster describes a suite of new or improved tools for teaching concurrent and distributed computation. The tools are written in Java for portability and are freely available at the address http://stwww.weizmann.ac.il/g-cs/~benari/software.htm, under the GNU General Public License. (Some tools invoke other programs which have different licensing arrangements.)
A fast simulation framework for IEEE 802.11-operated wireless LANs
Authors: Hwangnam Kim, Jennifer C. Hou
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

In this paper, we develop a fast simulation framework for IEEE 802.11-operated wireless LANs (WLANs), in which a large number of packets are abstracted as a single fluid chunk, and their behaviors are approximated with analytic fluid models and figured into the simulation. We first derive the analytical model that characterizes data transmission activities in IEEE 802.11-operated WLANs with/without the RTS/CTS mechanism. All the control overhead incurred in the physical and MAC layers, as well as system parameters specified in IEEE 802.11 [12] are faithfully figured in. We validate the model with simulation in cases in which the network is and is not saturated. We then implement, with the use of the time stepping technique [21], the fast simulation framework for WLANs in ns-2 [2], and conduct a comprehensive simulation study to evaluate the framework in terms of speed-up and errors incurred under a variety of network configurations.The simulation results indicate that the proposed framework is indeed effective in simulating IEEE 802.11-operated WLANs. It achieves as much as two orders of magnitude improvement in terms of execution time as compared to packet-level simulation. The performance improvement is more pronounced when the number of wireless nodes, the number of applications running on each wireless node, or the number of WLANs increases. The relative error, on the other hand, falls within 2% in all cases, as long as the value of the time step is appropriately determined.
Dynamic core provisioning for quantitative differentiated services
Authors: Raymond R.-F. Liao, Andrew T. Campbell
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

Efficient network provisioning mechanisms that support service differentiation are essential to the realization of the Differentiated Services (DiffServ) Internet. Building on our prior work on edge provisioning, we propose a set of efficient dynamic node and core provisioning algorithms for interior nodes and core networks, respectively. The node provisioning algorithm prevents transient violations of service level agreements (SLA) by predicting the onset of service level violations based on a multiclass virtual queue measurement technique, and by automatically adjusting the service weights of weighted fair queueing schedulers at core routers. Persistent service level violations are reported to the core provisioning algorithm, which dimensions traffic aggregates at the network ingress edge. The core provisioning algorithm is designed to address the difficult problem of provisioning DiffServ traffic aggregates (i.e., rate-control can only be exerted at the root of any traffic distribution tree) by taking into account fairness issues not only across different traffic aggregates but also within the same aggregate whose packets take different routes through a core IP network. We demonstrate through analysis and simulation that the proposed dynamic provisioning model is superior to static provisioning for DiffServ in providing quantitative delay bounds with differentiated loss across per-aggregate service classes under persistent congestion and device failure conditions when observed in core networks.
Charge trapping in SiO2/HfO2 gate dielectrics: comparison between charge-pumping and pulsed ID-VG
Authors: A. Kerber, E. Cartier, L. Pantisano, R. Degraeve, G. Groeseneken, H. E. Maes, U. Schwalke
Venue: Microelectronic Engineering (2004)

Charge-pumping (amplitude sweep) and the pulsed ID-VG technique have recently been introduced to study fast transient charging effects in alternative gate dielectrics. In this work, a detailed comparison between the two techniques is made using various experimental conditions. It is demonstrated that charge-pumping and pulsed ID-VG measurements yield equivalent results, when base level, charging times and device geometry are chosen carefully.
The double role of the weight factor in the goal programming model
Authors: Ossama Kettani, Belaïd Aouni, Jean-Marc Martel
Venue: Computers and Operations Research (2004)

In Goal Programming model, the best solution is established in such a way that the sum of the weighted deviations from the goals is minimal. The weight factor of a given objective is composed of two components destined to represent two different roles. The first one is "normalization" meaning to bring all deviations to a common unit of measurement based on the degree of proximity to the goal. The second is "valorization" reflecting the decision-maker's preference structure. The weight factor related to an objective is not a simple constant but a function of the realized level of objectives. Because of this variable nature of the weights this model will be non-linear. To cope with this problem we intend to obtain an equivalent linear presentation so that the problem can be solved using standard software suitable for mixed linear programs.
Accessing and Visualizing Scientific Spatiotemporal Data
Authors: Daniel S. Katz, Attila Bergou, G. Bruce Berriman, Gary L. Block, Jim Collier, David W. Curkendall, John Good, Laura Husman, Joseph C. Jacob, Anastasia Laity, P. Peggy Li, Craig Miller, Tom Prince, Herb Siegel, Roy Williams
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

This paper discusses work done by JPL's ParallelApplications Technologies Group in helping scientistsaccess and visualize very large data sets through the useof multiple computing resources, such as parallelsupercomputers, clusters, and grids. These tools do oneor more of the following tasks: visualize local data setsfor local users, visualize local data sets for remote users,and access and visualize remote data sets. The tools areused for various types of data, including remotely sensedimage data, digital elevation models, astronomicalsurveys, etc. The paper attempts to pull some commonelements out of these tools that may be useful for otherswho have to work with similarly large data sets.
Patience is a virtue: the effect of slack on competitiveness for admission control
Authors: Michael H. Goldwasser
Venue: Journal of Scheduling (2003)

We consider the online competitiveness for scheduling a single resource non-preemptively in order to maximize its utilization. Our work examines this model when parameterizing an instance by a new value which we term the patience. This parameter measures each job's willingness to endure a delay before starting, relative to this same job's processing time. Specifically, the slack of a job is defined as the gap between its release time and the last possible time at which it may be started while still meeting its deadline. We say that a problem instance has patience κ, if each job with length ||J|| has a slack of at least κ ċ ||J||.Without any restrictions placed on the job characteristics, previous lower bounds show that no algorithm, deterministic or randomized, can guarantee a constant bound on the competitiveness of a resulting schedule. Previous researchers have analyzed a problem instance by parameterizing based on the ratio between the longest job's processing time and the shortest job's processing time. Our main contribution is to provide a fine-grained analysis of the problem when simultaneously parameterized by patience and the range of job lengths. We are able to give tight or almost tight bounds on the deterministic competitiveness for all parameter combinations.If viewing the analysis of each parameter individually, our evidence suggests that parameterizing solely on patience provides a richer analysis than parameterizing solely on the ratio of the job lengths. For example, in the special case where all jobs have the same length, we generalize a previous bound of 2 for the deterministic competitiveness with arbitrary slacks, showing that the competitiveness for any κ ≥ 0 is exactly 1 + 1/(⌊κ⌋ + 1). Without any bound on the job lengths, a simple greedy algorithm is (2+ 1/κ)- competitive for any κ > 0. More generally we will find that for any fixed ratio of job lengths, the competitiveness of the problem tends towards 1 as the patience is increased. The converse is not true, as for any fixed κ > 0 we find that the competitiveness is bounded away from 1, no matter what further restrictions are placed on the ratio of job lengths.
The number of graphs without forbidden subgraphs
Authors: József Balogh, Béla Bollobás, Miklós Simonovits
Venue: Journal of Combinatorial Theory Series B (2004)

Given a family L of graphs, set p = p(L) = minL ⊂ L χ(L) - 1 and, for n ≥ 1, denote by P(n, L) the set of graphs with vertex set [n] containing no member of L as a subgraph, and write ex(n, L) for the maximal size of a member of P(n, L). Extending a result of Erdös, Frankl and Rödl (Graphs Combin. 2 (1986) 113), we prove that |P(n, L)|≤ 2½(1-1/p)n2 . O(n2-σ) for some constant γ = γ(L) > 0, and characterize γ in terms of some related extremal graph problems. In fact, if ex(n, L) = O(n2 δ), then any γ<δ will do. Our proof is based on Szemerédi's Regularity Lemma and the stability theorem of Erdös and Simonovits. The bound above is essentially best possible.
Application of VaR methodology to risk management in the stock market in China
Authors: Ying Fan, Yi-Ming Wei, Wei-Xuan Xu
Venue: Computers and Industrial Engineering (2004)

This paper applies the new risk management tool, Value at Risk (VaR) methodology, to the stock market in China. From the comparison between the predicted VaR and real return, the calculated results are mostly satisfied with the confidence level at 95%.
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Authors: Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Given a metric space G on n nodes, with a start node r and deadlines D(v) for each vertex v, we consider the Deadline-TSP problem of finding a path starting at r that visits as many nodes as possible by their deadlines. We also consider the more general Vehicle Routing with Time-Windows problem, in which each node v also has a release-time R(v) and the goal is to visit as many nodes as possible within their "time-windows" [R(v),D(v)]. No good approximations were known previously for these problems on general metric spaces. We give an O(logn) approximation algorithm for Deadline-TSP, and extend this algorithm to an O(log2n) approximation for the Time-Window problem. We also give a bicriteria approximation algorithm for both problems: Given an ε>0, our algorithm produces a (1/ε) approximation, while exceeding the deadlines by a factor of 1+ε. We use as a subroutine for these results a constant-factor approximation that we develop for a generalization of the orienteering problem in which both the start and the end nodes of the path are fixed. In the process, we give a 3-approximation to the orienteering problem, improving on the previously best known 4-approximation of [6].
An Interest Group Model for Content Location in Peer-to-Peer Systems
Authors: Guang-Tao Xue, Jin-Yuan You, Zhao-Qing Jia
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Intuitively, the peers who share common interests tend to have a high probability of connecting to each other and sharing the resources. In this paper, we use the probabilistic decision tree to represent users interests. Based on the interest probabilistic decision tree, we use an interest group model to organize the peers with common interests into one group. When using our algorithm, a significant amount of flooding can be avoided so as to make the unstructured Peer-to-Peer network a more competitive solution. The extensive simulation results show the effectiveness of the proposed model in a Peer-to-Peer system.
Smarandache sequences: explorations and discoveries with a computer algebra system
Authors: Paulo D. F. Gouveia, Delfim F. M. Torres
Venue: Smarandache Notions Journal (2004)

We study Smarandache sequences of numbers, and related problems, via a Computer Algebra System. Solutions are discovered, and some conjectures presented.
A Fundamental Problem in Computer and Communication
Authors: Sanguthevar Rajasekaran, Jaime Davila
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Partitioned Optical Passive Stars (POPS) network has been proposedrecently as a desirable model of parallel computing. Many papers have been published that address fundamental problems on these networks. Packet routing is onesuch important problem. We present a randomized algorithm in this paper thatperforms better than the best prior algorithms. We also present a randomized algorithm for selection on the POPS network.
Efficient set joins on similarity predicates
Authors: Sunita Sarawagi, Alok Kirpal
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coefficient, cosine similarity, and edit-distance. This expands the existing suite of algorithms for set joins on simpler predicates such as, set containment, equality and non-zero overlap. We start with a basic inverted index based probing method and add a sequence of optimizations that result in one to two orders of magnitude improvement in running time. The algorithm folds in a data partitioning strategy that can work efficiently with an index compressed to fit in any available amount of main memory. The optimizations used in our algorithm generalize to several weighted and unweighted measures of partial word overlap between sets.
The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8
Authors: David A. Drake, Wendy Myrvold
Venue: Designs, Codes and Cryptography (2004)

We establish the non-existence of a maximal set of four mols (mutually orthogonal Latin squares) of order 8 and the non-existence of (8, 5) projective Hjelmslev planes. We present a maximal set of four mols of order 9.
A Hierarchical Mixture of Markov Models for Finding Biologically Active Metabolic Paths Using Gene Expression and Protein Classes
Authors: Hiroshi Mamitsuka, Yasushi Okuno
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

With the recent development of experimental high-throughput techniques, the type and volume of accumulating biological data have extremely increased these few years. Mining from different types of data might lead us to find new biological insights. We present a new methodology for systematically combining three different datasets to find biologically active metabolic paths/patterns. This method consists of two steps: First it synthesizes metabolic paths from a given set of chemical reactions, which are already known and whose enzymes are co-expressed, in an efficient manner. It then represents the obtained metabolic paths in a more comprehensible way through estimating parameters of a probabilistic model by using these synthesized paths. This model is built upon an assumption that an entire set of chemical reactions corresponds to a Markov state transition diagram. Furthermore, this model is a hierarchical latent variable model, containing a set of protein classes as a latent variable, for clustering input paths in terms of existing knowledge of protein classes. We tested the performance of our method using a main pathway of glycolysis, and found that our method achieved higher predictive performance for the issue of classifying gene expressions than those obtained by other unsupervised methods. We further analyzed the estimated parameters of our probabilistic models, and found that biologically active paths were clustered into only two or three patterns for each expression experiment type, and each pattern suggested some new long-range relations in the glycolysis pathway.
Learning phonetic similarity for matching named entity translations and mining new translations
Authors: Wai Lam, Ruizhang Huang, Pik-Shan Cheung
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We propose a novel named entity matching model which considers both semantic and phonetic clues. The matching is formulated as an optimization problem. One major component is a phonetic matching model which exploits similarity at the phoneme level. We investigate three learning algorithms for obtaining the similarity information of basic phoneme units based on training examples. By applying this proposed named entity matching model, we also develop a mining framework for discovering new, unseen named entity translations from online daily Web news. This framework harvests comparable news in different languages using an existing bilingual dictionary. It is able to discover new name translations not found in the dictionary.