ppxscal/embedding_network huggingface dataset:
Supporting Load Balancing and Efficient Reorganization During System Scaling
Authors: Feng Zhu, Xiaowei Sun, Betty Salzberg, Svein-Olaf Hvasshovd
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Reorganization becomes constantly necessary for maintaining load balancing as distributed storage systems scale up and down. To support load balancing and efficient reorganization during system scaling, we propose a new hashing method called Prime Based Hashing (PBH) that can be used for data allocation in large distributed systems. PBH distributes objects among storage units based on residues (congruence) of hash-transformed key values modulo prime numbers. PBH provides nearly perfect load balancing, distributes objects evenly and rebalances to preserve the even distribution as system scales. At the same time it facilitates cost-effective reorganization by minimizing data migration during system scaling. Locating an object in PBH is fast through low complexity computations, requiring only the knowledge of the total number of storage units. We also propose a local data clustering method to couple with PBH to make reorganizationmore efficient. Objects are clustered according to the order of migration so that only the part of the data that needs to be migrated is scanned. In addition, we show that by storing a small amount of pre-computed information, ordering of objects for clustering can be very efficient. We demonstrate through analysis and experiments the effectiveness of our algorithms.
Automated Decomposition of Access Control Policies
Authors: Linying Su, David W. Chadwick, Andrew Basden, James A. Cunningham
Venue: Proceedings of the Sixth IEEE International Workshop on Policies for Distributed Systems and Networks (2005)

Modern dynamic distributed information systems need access control policies to address controlling access to multiple resources that are distributed. The resources may be considered as a single abstract hierarchical resource. An access control policy at a high level should be able to define who is allowed to use the resources. At lower levels, the policy will address controlling access to concrete resources. By modelling the resource hierarchy, it is possible that low level policies can be automatically produced from the high level policy. These low level policies can then be distributed to the concrete resources that use an existing policy based access control decision system so that the high level policy can be enforced throughout the system. In this paper a model for representing and refining high level policies is presented. Other relevant issues and examples for demonstrating the capability of the policy decomposition (refinement) process are also presented.
A New Approach to Abstracting AltPSM Lithography Requirements for IC Design Domains
Authors: Pradiptya Ghosh
Venue: Analog Integrated Circuits and Signal Processing (2005)

This paper lays the groundwork for defining the components needed to get clean alternating phase-shifting masks (altPSM) that ensure the manufacturability of subwavelength circuit designs. The authors create an abstract set of rules that can be used to advantage in various IC CAD tool domains. A new methodology and algorithm are presented that can quickly and easily integrate altPSM into existing and future tools earlier in the IC design flow. Finally, experimental results show how the methodology and algorithm is used to debug process-aware designs and make them altPSM-compliant.
A note on the paper: optimizing web servers using page rank prefetching for clustered accesses
Authors: Wai-Ki Ching
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

In this short note, we briefly present and discuss an example of page rank algorithm given in [Information Sciences 150 (2003) 165-176].
Exploiting the dynamic networking effects of the web
Authors: Ramesh Sarukkai, Soumen Chakrabarthi, Gary William Flake, Narayanan Shivakumar, Asim M. Ansari
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This panel aims to explore the dynamic networking effects of the Web. Today, linkages on the Web are augmented with dynamic connectivities based on various monetization strategies: e.g. ads and sponsored links. Such linkages change the dynamics of user click/flow on the Web. The key focus of this panel is to debate whether/how such dynamic effects on the Web can be modeled and best exploited. How can we derive cooperative placement strategies that are optimal from a customer perspective? As the World Wide Web becomes more dynamic with fluid link placements guided by different factors, optimizing link placement in a cooperative fashion across the Web will be an integral and crucial component. URL: <http://research.yahoo.com/workshops/www2005/NetworkingEffectsWeb/>.
A Comparison of some Clustering Techniques via Color Segmentation
Authors: Shilpa Agarwal, Shweta Madasu, Madasu Hanmandlu, Shantaram Vasikarla
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper proposes a new improved modified mountain clustering technique. The proposed technique is being compared with some existing techniques such as FCM, Gath-Geva, Probabilistic Clustering and Modified Mountain clustering. The performance of all these clustering techniques is compared by applying them to color segmentation in terms of cluster validity and computational complexity.
XML Representation of Digital Videos for Visual Data Mining Applications
Authors: Mark Smith, Alireza Khotanzad
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

A novel approach utilizing the eXtended Markup Language (XML) for representing digital videos is proposed. This new method is based on segmenting the video sequences into real-world objects and then translating the objects into a hierarchy that is easily represented by XML. The algorithm segments each frame of the video sequence into consistent objects without using MPEG motion vectors or intra-block information, thus eliminating common errors contributed from these computed sources. This efficient identification and representation of corresponding objects between frames allows for a host of visual data mining applications utilizing digital libraries, databases and Internet image searches. This new algorithm is tested on various video segments (pans, zooms, dissolves, closeups, and multiple-object motion) with results included.
New Models of Prefix Adder Topologies
Authors: Neil Burgess
Venue: Journal of VLSI Signal Processing Systems (2005)

This paper introduces a variety of approaches for assessing logarithmic-depth parallel prefix adders: a delay model based on a slight modification to the Logical Effort methodology is derived; a simple area model based on wire pitch is described; a new parameter, span(i), is defined that provides a mechanism for determining cell count and whether a prefix tree exhibits idempotency. The models are tested against Knowles' Family of Adders and found to give results that are within 5% of those reported by Knowles, as well as allowing a full assessment of the family to be made. Finally, the delay and area models are used to assess the Flagged Prefix Adder, an enhanced adder capable of computing absolute differences.
Polymorphic Malicious Executable Scanner by API Sequence Analysis
Authors: J-Y. Xu, A. H. Sung, P. Chavez, S. Mukkamala
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The proliferation of malware (viruses, Trojans, and other malicious code) in recent years has presented a serious threat to enterprises, organizations, and individuals. Polymorphic (or variant versions of) computer viruses are more complex and difficult than their original versions to detect, often requiring antivirus companies to spend much time to create the routines needed to catch them. In this paper, we propose a new approach for detecting polymorphic malware in the Windows platform. Our approach rests on an analysis based on the Windows API calling sequence that reflects the behavior of a piece of particular code. The analysis is carried out directly on the PE (portable executable) code. It is achieved in two major steps: construct the API calling sequences for both the known virus and the suspicious code, and perform a similarity measurement between the two sequences after a sequence realignment operation is done. Favorable experimental results are obtained and presented.
An addition to the methods of test determination for fault detection in combinational circuits
Authors: Ljubomir Cvetković
Venue: Acta Cybernetica (2004)

We propose a procedure for determining fault detection tests for single and multiple fault in combinational circuits. The stuck-at-fault model is used. By the proposed procedure all test vectors for single and multiple stuck-at-fault in combinational circuit are determined. The path sensitization method is used in the test signal propagation while test signals are defined on a four element set. The procedure can also be applied to the fault detection in programmable logic devices. We consider two-level combinational circuits which are realized by the PAL architecture and we propose a procedure for determining a test set which detects all single stuck-at-faults. As a mathematical tool, the cube theory is used.
Architecture and Application of PLATO, A Reconfigurable Active Network Platform
Authors: Apostolos Dollas, Dionisios Pnevmatikatos, Nikolaos Aslanides, Stamatios Kavvadias, Euripides Sotiriades, Sotirios Zogopoulos, Kyprianos Papademetriou, Nikolaos Chrysos, Konstantinos Harteros, Emanouil Antonidakis, Nikolaos Petrakis
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

A new, configurable architecture has been designed and built in order to serve as a platform for experimentation with active networks. This architecture, named PLATO, provides 4 physical bi-directional connections for ATM networks, large reconfigurable resources, 256 Mbytes SDRAM for buffer space, a PCI port, and auxiliary expansion ports. Several applications are presented for this platform, one of which has been prototyped on the PCI Pamette and on PLATO. Detailed simulations and experimental results show that, for some applications, a significant improvement can be obtained using this approach as compared to using conventional network architectures.
A Formula for N-Row Macdonald Polynomials
Authors: Ellison-Anne Williams
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We derive a formula for the n-row Macdonald polynomials with the coefficients presented both combinatorically and in terms of very-well-poised hypergeometric series.
GPU-accelerated high-quality hidden surface removal
Authors: Daniel Wexler, Larry Gritz, Eric Enderton, Jonathan Rice
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

High-quality off-line rendering requires many features not natively supported by current commodity graphics hardware: wide smooth filters, high sampling rates, order-independent transparency, spectral opacity, motion blur, depth of field. We present a GPU-based hidden-surface algorithm that implements all these features. The algorithm is Reyes-like but uses regular sampling and multiple passes. Transparency is implemented by depth peeling, made more efficient by opacity thresholding and a new method called z batches. We discuss performance and some design trade-offs. At high spatial sampling rates, our implementation is substantially faster than a CPU-only renderer for typical scenes.
Designing an Enhanced PC Cluster System for Scalable Network Services
Authors: Yi-Hsing Chang, J. Wey Chen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

With the increasing availability of inexpensive yet powerful personal computers and servers, there has been an increasing trend toward personal computer cluster systems for network services. In this paper, we present a small-scale personal computer based cluster system for network servers as a low-cost alternative to traditional high-performance computing systems. The enhanced cluster system for scalable network services (CSSNS) consists of the parallel virtual file system (PVFS), the Linux Virtual Server (LVS), the Director, and several high-end Pentium PC connected by high-speed switched Ethernet networks for I/O nodes and cluster nodes. The design and development of the cluster system for scalable network services is characterized by its high performance, high availability, high scalable file system, low cost, load balance on cluster servers, and convenient managing/set-up for a broad range of applications. The transmission performance experiments for the entire system further validates and confirms that CSSNS is truly a self-made high-performance, high reliability and scalability personal computer based cluster system for scalable network servers.
Simplification and improvement of tetrahedral models for simulation
Authors: B. Cutler, J. Dorsey, L. McMillan
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Most 3D mesh generation techniques require simplification and mesh improvement stages to prepare a tetrahedral model for efficient simulation. We have developed an algorithm that both reduces the number of tetrahedra in the model to permit interactive manipulation and removes the most poorly shaped tetrahedra to allow for stable physical simulations such as the finite element method. The initial tetrahedral model may be composed of several different materials representing internal structures. Our approach targets the elimination of poorly-shaped elements while simplifying the model using edge collapses and other mesh operations, such as vertex smoothing, tetrahedral swaps, and vertex addition. We present the results of our algorithm on a variety of inputs, including models with more than a million tetrahedra. In practice, our algorithm reliably reduces meshes to contain only tetrahedra that meet specified shape requirements, such as the minimum solid angle.
Concrete breakout strength of single anchors in tension using neural networks
Authors: A. F. Ashour, M. A. Alqedra
Venue: Advances in Engineering Software (2005)

A feed forward neural network model for evaluating the concrete breakout strength of single cast-in and post-installed mechanical anchors in tension is presented. The nodes of the neural network input layer represent the embedment depth, anchor head diameter, concrete strength and anchor installation system, and the neural network output is the tensile capacity of anchors as governed by the concrete breakout. Three different techniques have been adopted to represent the anchor installation system in the neural network input layer. The training, validation and testing of the developed networks were based on a database of 451 experimental tests obtained from previous laboratory anchor tests. Testing of the trained neural network indicates good predictions of the concrete breakout strength of cast-in and post-installed mechanical anchors in tension.The relationships between the concrete breakout strength of anchors and different influencing parameters obtained from the trained neural networks were in general agreement with those of the ACI 318-02 for cast-in and post-installed mechanical anchors. It has been shown that the concrete breakout strength of anchors in tension is approximately proportional to the embedment depth of 1.5 power and marginally affected by changing the anchor head diameter.
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Authors: Yaoyun Shi
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.
Reachability solution characterization of parametric real-time systems
Authors: Farn Wang, Hsu-Chun Yen
Venue: Theoretical Computer Science (2004)

We investigate the problem of characterizing the solution spaces for timed automata augmented by unknown timing parameters (called timing parameter automata (TPA)). The main contribution of this paper is that we identify three non-trivial subclasses of TPAs, namely, upper-bound, lower-bound and bipartite TPAs, and analyze how hard it is to characterize the solution spaces. As it turns out, we are able to give complexity bounds for the sizes of the minimal (resp., maximal) elements which completely characterize the upward-closed (resp., downward-closed) solution spaces of upper-bound (resp., lower-bound) TPAs. For bipartite TPAs, it is shown that their solution spaces are not semilinear in general. We also extend our analysis to TPAs equipped with counters without zero-test capabilities.
Book Review: Non-Standard Logics for Automated Reasoning by P. Smets, E. H. Mamdani, D. Dubois, and H. Prade (Academic Press)
Venue: Issue 108 (April 1989) (1989)

A common way of creating collections is to have a small conference on some topic and then publish revised versions of the papers presented at the conference. A common problem with such collections is a lack of cohesiveness, as there is little or no attempt to have the papers refer to each other or to have a common terminology.
Design of agent-based middleware for flexible connection control
Authors: Susumu Konno, Gen Kitagata, Takuo Suganuma, Kenji Sugawara, Tetsuo Kinoshita
Venue: Systems and Computers in Japan (2004)

Controlling connections between operating networks in an extranet according to various requests from users or applications creates a huge load for network administrators. In response to this problem, the authors herein propose a type of agent-based middleware for dynamically configuring and providing network services based on requests assigned from applications. In addition, they describe a method of designing this agent-based middleware and construct an experimental system that incorporates it to show the effectiveness of the proposed technique through experiments using the system. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 50&ndash;62, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10656
Predictions of CMOS compatible on-chip optical interconnect
Authors: Guoqing Chen, Hui Chen, Mikhail Haurylau, Nicholas Nelson, Philippe M. Fauchet, Eby G. Friedman, David Albonesi
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

Interconnect has become a primary bottleneck in integrated circuit design. As CMOS technology is scaled, it will become increasingly difficult for conventional copper interconnect to satisfy the design requirements of delay, power, bandwidth, and noise. On-chip optical interconnect has been considered as a potential substitute for electrical interconnect in the past two decades. In this paper, predictions of the performance of CMOS compatible optical devices are made based on current state-of-art optical technologies. Electrical and optical interconnects are compared for various design criteria based on these predictions. The critical dimensions beyond which optical interconnect becomes advantageous over electrical interconnect are shown to be approximately one tenth of the chip edge length at the 22 nm technology node.
Architecture based analysis of performance, reliability and security of software systems
Authors: Vibhu Saujanya Sharma, Kishor S. Trivedi
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

With software systems becoming more complex, and handling diverse and critical applications, the need for their thorough evaluation has become ever more important at each phase of software development. With the prevalent use of component-based design, the software architecture as well as the behavior of the individual components of the system needs to be taken into account when evaluating it. In recent past a number of studies have focused on architecture based reliability estimation. But areas such as security and cache behavior still lack such an approach. In this paper we propose an architecture based unified hierarchical model for software reliability, performance, security and cache behavior prediction. We define a metric called the vulnerability index of a software component for quantifying its (in)security. We provide expressions for predicting the overall behavior of the system based on the characteristics of individual components, which also takes into account second order architectural effects for providing an accurate prediction. This approach also facilitates the identification of reliability, performance, security and cache performance bottlenecks. In addition we illustrate how the approach could be applied to software systems by case studies and also provide expressions to perform sensitivity analysis.
Pricing and Resource Allocation in Computational Grid with Utility Functions
Authors: Li Chunlin, Li Layuan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

To solve the problem of heterogeneous demand in the grid, grid users' preferences are summarized by means of their utility functions. This paper proposes to use measurable characteristics to formulate utility functions, rather than abstract utility function used in other works. The grid user utility is defined as a function of the grid user' s the resource units allocated. An optimal solution maximizes the aggregate utilities of all grid users subject to the grid resource capacity and job complete times constraints. At same time, the grid provider adjusts the unit price in order to maximize its revenue, which is measured as the sum of the individual payments. This paper proposes an iterative algorithm that computes the price and resource allocation, which is proved to converge to the optimal point. Simulation results show that our proposed algorithm is more efficient than conventional allocation scheme.