ppxscal/embedding_network huggingface dataset:
Performance Evaluation of Multi-Object Auctions
Authors: Debasis Mishra, Sunil S. Reddy, Dharmaraj Veeramani
Venue: Electronic Commerce Research (2005)

The paper evaluates the performance of two multi-object auction models: sequential and simultaneous, using different performance measures. The objects put up for auction have different synergies for different bidders. We define different types of bidders who can exist in these multi-object auction models. The classification of bidders is based on the bidding strategies they use. We then study the effects of different parameters in auction and bidding strategies, on the performance of these auction models by simulating them using a JAVA based framework.
Stellar: A Fusion System for Scenario Construction and Security Risk Assessment
Authors: Stephen Boyer, Oliver Dain, Robert Cunningham
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

Stellar aggregates and correlates alerts from heterogeneous network defense systems, building scenarios and estimating the security risk of the entire scenario. Prior work considered Stellar scenario formation; in this paper we explore the advantages provided by using scenario context to assess the risk of actions occurring on a network. We describe the design and an evaluation of Stellar and its Security Assessment Declarative Language (SADL), a fast, stateful, simple-to-use language for assessing the priority of scenarios, on a high traffic network under constant attack. The evaluation of the Stellar system deployed on a large, operational enterprise network demonstrated its ability to scale to high alert volumes while accurately forming and prioritizing scenarios. Stellar not only produced high priority scenarios matching all incidents reported by human analysts, but also discovered additional scenarios of concern that had initially gone unnoticed. Furthermore, by following the simple formalism embedded in example SADL rules, system administrators quickly develop a correct understanding of the network they are protecting.
Reversible computing: from mathematical group theory to electronical circuit experiment
Authors: Alexis De Vos, Yvan Van Rentergem
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Reversible logic gates of a certain logic width w form a group (isomorphic to the symmetric group of order (2 w )!). Study of the subgroups of this group both teaches us a lot about properties of reversible gates and guides us to synthesize particular circuits. After design, circuits are implemented in prototype silicon chips.
Perceived Individual Collaboration Know-How Development Through Information Technology--Enabled Contextualization: Evidence from Distributed Teams
Authors: Ann Majchrzak, Arvind Malhotra, Richard John
Venue: Information Systems Research (2005)

In today's global market environment, enterprises are increasingly turning to use of distributed teams to leverage their resources and address diverse markets. Individual members of structurally diverse distributed teams need to develop their collaboration know-how to work effectively with others on their team. The lack of face-to-face cues creates challenges in developing the collaboration know-how--challenges that can be overcome by communicating not just content, but also context. We derive a theoretical model from Te'eni's (2001) cognitive-affective model of communication to elaborate how information technology (IT) can support an individual's communication of context to develop collaboration know-how. Two hundred and sixty-three individuals working in structurally diverse distributed teams using a variety of virtual workspace technologies to support their communication needs were surveyed to test the model. Results indicate that when individuals perceive their task as nonroutine, there is a positive relationship between an individual's perceived degree of IT support for communicating context information and his collaboration know-how development. However, when individuals perceive their task as routine, partial IT support for contextualization is associated with lower levels of collaboration know-how development. This finding is attributed to individuals' misunderstanding of the conveyed context, or their struggling to utilize the context conveyed with partial IT support, making a routine task more prone to misunderstanding and leaving the user worse than if she had no IT support for contextualization. We end the paper by drawing theoretical and practical implications based on these findings.
Signal Period Analysis Based on Hilbert-Huang Transform and Its Application to Texture Analysis
Authors: Zhihua Yang, Dongxu Qi, Lihua Yang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

An approach to analyze the period of a signal based on Hilbert-Huang Transform is presented in this paper. For an approximately periodic signal which contains plenty of high frequency components, the relation between its period and its main frequency is established. Our main result is that, for an approximately periodic signal which contains plenty of high frequency components, its period can be estimated accurately according to its main-frequency distribution. By applying the technique on texture analysis, a novel method to extract the perodicity features of a texture image is developed, which can be used in texture classification, segmentation, recognition and other applications.
The effectiveness of dictionary and web-based answer reranking
Authors: Chin-Yew Lin
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

We describe an in-depth study of using a dictionary (WordNet) and web search engines (Altavista, MSN, and Google) to boost the performance of an automated question answering system, Webclopedia, in answering definition questions. The results indicate applying dictionary and web-based answer reranking together increase the performance of Webclopedia on a set of 102 TREC-10 definition questions by 25% in mean reciprocal rank score and 14% in finding answers in the top 5.
Approximation algorithms for finding low-degree subgraphs
Venue: Networks (2004)

We give quasipolynomial-time approximation algorithms for designing networks with a minimum degree. Using our methods, one can design networks whose connectivity is specified by &ldquo;proper&rdquo; functions, a class of 0&ndash;1 functions indicating the number of edges crossing each cut. We also provide quasipolynomial-time approximation algorithms for finding two-edge-connected spanning subgraphs of approximately minimum degree of a given two-edge-connected graph, and a spanning tree &lpar;branching&rpar; of approximately minimum degree of a directed graph. The degree of the output network in all cases is guaranteed to be at most &lpar;1 &plus; &epsi;&rpar; times the optimal degree, plus an additive O&lpar;log1&plus;&epsi;n&rpar; for any &epsi; > 0. Our analysis indicates that the degree of an optimal subgraph for each of the problems above is well estimated by certain polynomially solvable linear programs. This suggests that the linear programs we describe could be useful in obtaining optimal solutions via branch and bound. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;3&rpar;, 203&ndash;215 2004
Software Engineering Issues for Small-Scale Parallelism
Authors: Ryan Eccles, Deborah A. Stacey
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The availability of low-cost commodity multiprocessor machines will change the nature of mainstream programming. This discipline will be required to include small-scale, dual and quadruple processor machines, to remain competitive. These small-scale parallel systems will require software engineering principles capable of encapsulating the complex parallel programming issues. This paper discusses a technique that provides a simple model for incorporating parallel programming in a scheduler. This model can dynamically adjust to single and small-scale multiple processor environments.
A cone-based distributed topology-control algorithm for wireless multi-hop networks
Authors: Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

The topology of a wireless multi-hop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based distributed topology-control (CBTC) algorithm. This algorithm does not assume that nodes have GPS information available; rather it depends only on directional information. Roughly speaking, the basic idea of the algorithm is that a node u transmits with the minimum power Pu, α required to ensure that in every cone of degree α around u, there is some node that u can reach with power Pu, α. We show that taking α = 5π/6 is a necessary and sufficient condition to guarantee that network connectivity is preserved. More precisely, if there is a path from s to t when every node communicates at maximum power then, if α ≤ 5π/6, there is still a path in the smallest symmetric graph Gα containing all edges (u,v) such that u can communicate with v using power Pu, α. On the other hand, if α > 5π/6, connectivity is not necessarily preserved. We also propose a set of optimizations that further reduce power consumption and prove that they retain network connectivity. Dynamic reconfiguration in the presence of failures and mobility is also discussed. Simulation results are presented to demonstrate the effectiveness of the algorithm and the optimizations.
An optimal hierarchical clustering algorithm for gene expression data
Authors: Sudip Seal, Srikanth Komarina, Srinivas Aluru
Venue: Information Processing Letters (2005)

Microarrays are used for measuring expression levels of thousands of genes simultaneously. Clustering algorithms are used on gene expression data to find co-regulated genes. An often used clustering strategy is the Pearson correlation coefficient based hierarchical clustering algorithm presented in [Proc. Nat. Acad. Sci. 95 (25) (1998) 14863-14868], which takes O(N3) time. We note that this run time can be reduced to O(N2) by applying known hierarchical clustering algorithms [Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 619-628] to this problem. In this paper, we present an algorithm which runs in O(N log N) time using a geometrical reduction and show that it is optimal.
Shared Protection Based on Matrix Decomposition in Tropical Semi-Rings
Authors: Janos Tapolcai, Pin-Han Ho, Xiaohong Jiang, Susumu Horiguchi
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

It is observed that the Singular Value Decomposition (SVD) transformation based on min-plus algebra (or called Tropical Semi-Rings) leads to a very good characteristic in zero underestimating the reconstructed matrix. This paper introduces a novel distributed control framework for shared protection in optical networks with reduced routing information based on the Tropical Semi-Rings technique, called Sharing with Reduced Information with Tropical Semi-Rings (SRI-TROP). The design of the proposed framework aims to initiate a compromise between the amount of link-state dissemination and the performance impairment due to the incompleteness of routing information, such that the precision in the link-state matrix reconstruction can efficiently map to the reduction in blocking probability. Based on the framework, a series of novel schemes are proposed, which are verified and compared with the reported counterparts in a simulation. The simulation results show that the performance in terms of the precision in the reconstructed link-state and the resultant blocking probability can be significantly improved.
An efficient parallel algorithm for solving the Knapsack problem on hypercubes
Authors: A. Goldman, D. Trystram
Venue: Journal of Parallel and Distributed Computing (2004)

We present in this paper an efficient algorithm for solving the integral Knapsack problem on hypercube. The main idea is to represent the computations of the dynamic programming formulation as a precedence graph (which has the structure of an irregular mesh). Then, we propose a time optimal scheduling algorithm for computing the irregular meshes on hypercube.
Distributed computing in practice: the Condor experience: Research Articles
Authors: Douglas Thain, Todd Tannenbaum, Miron Livny
Venue: Concurrency and Computation: Practice Experience (2005)

Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the world-wide computational Grid. In this paper, we provide the history and philosophy of the Condor project and describe how it has interacted with other projects and evolved along with the field of distributed computing. We outline the core components of the Condor system and describe how the technology of computing must correspond to social structures. Throughout, we reflect on the lessons of experience and chart the course travelled by research ideas as they grow into production systems. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A distance regular graph with intersection array (21, 16, 8; 1, 4, 14) does not exist
Authors: K. Coolsaet
Venue: European Journal of Combinatorics (2005)

We show that a distance regular graph Γ with intersection array (21, 16, 8; 1, 4, 14) does not exist. The proof uses algebraic properties of a positive semidefinite matrix related to the neighbourhood of a vertex of Γ.
Playing the game: cheating, loopholes, and virtual identity
Authors: Phillip J. Brooke, Richard F. Paige, John A. Clark, Susan Stepney
Venue: ACM SIGCAS Computers and Society (2004)

A broad range of interactive and distributed systems are essentially virtual worlds; these include examples such as multiplayer games, and even operating systems. They enable the formation and maintenance of virtual societies, which must be healthy in order to be prosperous and useful. We describe properties, inspired by writings on law and psychology, that we use to define the notion of fairness, which is an essential characteristic of a healthy society. By using multiplayer gaming as a running example, we discuss how a fair virtual society will interact with its real-world counterparts, and outline how one might choose to detect and deal with transgressors who violate rules designed to enable fair interaction and prohibit cheating. This is a conceptual paper, and raises a number of issues and problems that must be considered when designing virtual worlds. Our aim is to develop guidelines for the design of fair virtual societies.
Applying NavOptim to minimise navigational effort
Authors: David Lowe, Xiaoying Kong
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

A major factor in the effectiveness of the interaction which users have with Web applications is the ease with which they can locate information and functionality which they are seeking. Effective design is however complicated by the multiple design purposes and diverse users which Web applications typically support. In this paper we describe a navigational design method aimed at optimising designs through minimizing navigational entropy. The approach uses a theoretical navigational depth for the various information and service components to moderate a nested hierarchical clustering of the content.
Migratable sockets in cluster computing
Authors: Kamran Malik, Osama Khan, Tahir Mobashir, Mansoor Sarwar
Venue: Journal of Systems and Software (2005)

Optimal utilization of cluster computing is partly dependent upon pre-emptive process migration. However, this migration involves a host of issues, one of them being the transfer of system-dependent resources. We focus on the overhead incurred by migrated processes using sockets. We then describe a solution that we devised and implemented to avoid this overhead through the use of 'migratable sockets', Our studies show that the use of 'migratable sockets' considerably improves the execution time of a process sing sockets as compared to the execution time of a process that uses standard sockets and thus bears the communication overhead.
The performance impact of kernel prefetching on buffer cache replacement algorithms
Authors: Ali R. Butt, Chris Gniady, Y. Charlie Hu
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

A fundamental challenge in improving the file system performance is to design effective block replacement algorithms to minimize buffer cache misses. Despite the well-known interactions between prefetching and caching, almost all buffer cache replacement algorithms have been proposed and studied comparatively without taking into account file system prefetching which exists in all modern operating systems. This paper shows that such kernel prefetching can have a significant impact on the relative performance in terms of the number of actual disk I/Os of many well-known replacement algorithms; it can not only narrow the performance gap but also change the relative performance benefits of different algorithms. These results demonstrate the importance for buffer caching research to take file system prefetching into consideration.
Relation between psychological amount in polyhedron recognition and 3D object image entropy
Authors: Hiroyo Ishikawa, Yukio Sato
Venue: Systems and Computers in Japan (2005)

In this paper, the authors examine the relationship between a psychological information amount quantified by humans and the 3D object image entropy representing a physical information amount in relation to the ease of perceiving the shape of a 3D object that varies according to the view direction. They propose a method of using the pair comparison method and Thurstone's law of comparative judgment to construct a psychological information amount representing the psychological amount for which the shape of a 3D object is felt to be easy to perceive. The 3D object image entropy, which is a one-dimensional scale that is defined based on the number of visible surfaces in the 3D object image and the proportions of their surface areas, represents the amount of information that reflects the qualitative characteristic called aspect that the 3D object has and the quantitative characteristic called the proportion of the surface area. The authors limit the target objects to polyhedrons and measure the psychological information amount and 3D object image entropy for various types of shapes to examine the relationship between these kinds of information. Although some shapes were exceptions, the results showed a monotonically increasing relationship between the psychological information amount and the 3D object image entropy for many types of 3D objects. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(3): 75&ndash;84, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10526
Acyclic networks maximizing the printing complexity
Authors: Franck Guingne, Florent Nicart, André Kempe
Venue: Theoretical Computer Science (2004)

This article estimates the worst-case running time complexity for traversing and printing all successful paths of a normalized trim acyclic automaton. First, we show that the worst-case structure is a festoon. Then, we prove that the complexity is maximal when we have a distribution of e (Napier constant) outgoing arcs per state on average, and that it can be exponential in the number of arcs.
A server for real-time event tracking in news
Authors: Ralf D. Brown
Venue: Proceedings of the first international conference on Human language technology research (2001)

As the flood of information continues to grow, it becomes ever more necessary to extract just the portion of the flow which is of interest to each user. The Topic Detection and Tracking (TDT) project [1, 3, 6, 5] addressed and continues to address this need, but has been of necessity applied in a batch-processing context on a static collection. What is required for topic detection and tracking to be of utility to end-users is a real-time system which operates on a live stream of information. This paper describes the extension and modification of a batch-oriented tracking system into a real-time server for event detection, event tracking, document summarization, and translation.
A Methodology for Designing Countermeasures against Current and Future Code Injection Attacks
Authors: Yves Younan, Wouter Joosen, Frank Piessens
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

This paper proposes a methodology to develop counter-measures against code injection attacks, and validates the methodology by working out a specific counter-measure. This methodology is based on modeling the execution environment of a program. Such a model is then used to build countermeasures. The paper justifies the need for a more structured approach to protect programs against code injection attacks: we examine advanced techniques for injecting code into C and C++ programs and we discussstate-of-the-art (often ad hoc) approaches that typically protect singular memory locations. We validate our methodology by building countermeasures that prevent attacks by protecting a broad variety of memory locations that may be used by attackers to perform code injections. The paper evaluates our approach and discusses ongoing and future work.
Issues in the development of a practical NoC: the Proteo concept
Authors: David Sigüenza-Tortosa, Tapani Ahonen, Jari Nurmi
Venue: Integration, the VLSI Journal (2004)

Network-on-Chip will be one of the cornerstones of future electronics. At Tampere University of Technology we have been working on the development of our own proposal for a flexible on-chip communication network, called Proteo. Proteo introduces the concept of an open library of communication components that can be selected and configured to build highly-customized networks-on-chip. The designer of a new System-on-Chip platform starts with a description of the hardware components of the system and an abstract model of the problem application, and with the help of the Proteo software tools, obtains a synthesizable instance of a packet-switching network that, ideally, meets his requirements. The constraints placed on the type of designs that may use Proteo are minimal and an important part of the process should be automated. In this article we introduce the philosophy behind the project in relation to fundamental deep submicron technology problems, and some of our initial results.
The impact of interstratal interconnect density on the performance of three-dimensional integrated circuits
Authors: Viet H. Nguyen, Phillip Christie
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

This work examines the impact of interstratal interconnect density on the wire-length distribution and on the performance of three-dimensional integrated circuits. A model for the wire-length distribution of 3D-ICs, which takes into account the interstratal interconnect density, is proposed first. The wire-length distributions of 2D-IC, homogeneous (ideal), semi-ideal and realistic 3D-ICs containing two strata are generated using the established model. Finally, the system-level performance of these circuits is assessed by evaluating the delay time and the dynamic switching energy of a critical path containing several interconnected inverters. The lengths of wires connecting inverters are randomly sampled from the wire-length distributions of the circuits under investigation. The inverters and interconnects have electrical properties of recent proposals for the 45-nm technology node.