ppxscal/embedding_network huggingface dataset:
Compression proxy server: design and implementation
Authors: Chi-Hung Chi, Jing Deng, Yan-Hong Lim
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Automatic data compression in the web proxy server is an important mechanism that can potentially reduce network bandwidth consumption and web access latency significantly. However, unlike traditional data compression, web protocols and data have unique characteristics that make compression challenging. These include data block streaming, wide range of data object sizes and types, and real-time response. In this paper, we focus on automatic web data compression in the HTTP proxy server. A new classification of web data compression based on system complexity and HTTP requirements is proposed: stream, block and file compression. Then, the concept of hybrid web data compression is introduced. To understand the potentials of web data compression better, an implementation of the proposed hybrid compression in the Squid proxy server is described. The result is very promising, as about 30% of the bandwidth can be saved easily. Furthermore, even with a low end Pentium 266 MHz PC as the proxy machine, the compression overhead is less than 1% of the transfer time.
A methodology for substrate crosstalk evaluation for system-on-a-chip
Authors: Nasser Masoumi, Safieddin Safavi-Naeini, Mohamed I. Elmasry
Venue: Integrated Computer-Aided Engineering (2002)

A major problem with substrate crosstalk extraction methods in the literature is their lengthy computational time. This practically renders them useless for large circuits. This paper presents efficient substrate parasitic extraction techniques employing closed-form models derived using a quasi-static approach. We develop an integral equation model based on the Green's theorem utilizing a novel fast-convergent Green's function. In addition, we propose another modeling technique based on point approximation of the elements of the impedance matrix of the system. Although the proposed techniques speed the parasitic extraction process up, we show that it is unnecessary to run a full substrate parasitic extraction among all the devices for a system-on-a-chip. As such, by applying the new modeling technique to a multi-contact substrate structure, we develop a methodology that is a large-scale solution for substrate parasitic extraction in VLSI and mixed-signal circuits. Moreover, we demonstrate that the coupling among the contacts in a large system decreases faster than an exponential function of the distance among them. Using the proposed methodology, we introduce a decomposed two-contact problem set, associated with the original complex problem. Then, the total crosstalk of a device in the original problem is simply computed from the associated decomposed problem set.
Linear time algorithms for Abelian group isomorphism and related problems
Authors: T. Kavitha
Venue: Journal of Computer and System Sciences (2007)

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(nlogn) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(nlogn) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian.
Aggregating preference rankings using OWA operator weights
Authors: Ying-Ming Wang, Ying Luo, Zhongsheng Hua
Venue: Information Sciences: an International Journal (2007)

One important issue of aggregating preference rankings is to determine the weights of different ranking places. This paper proposes the use of ordered weighted averaging (OWA) operator weights to aggregate preference rankings, which allows the weights associated with different ranking places to be determined in terms of a decision maker (DM)'s optimism level characterized by an orness degree. By adjusting the DM's optimism level, ties can be avoided and winner can be selected. Two numerical examples are examined using OWA operator weights to show their applications, simplicity and flexibility in aggregating preference rankings.
In the News
Authors: Danna Voth, Sara Reese Hedberg
Venue: IEEE Intelligent Systems (2007)

The first news story, "Toward More Intelligent Healthcare," looks at AI-based tools to help doctors make better diagnoses, gather enhanced information from medical tests, improve their surgery and examination skills, and more quickly make relevant biomedical discoveries. The second news story, "Life Annotation: Storing and Searching Our Personalized Digital Memories," reports on attempts to store and retrieve the memories of people's lives embedded in photos, emails, calendars, documents, videos, and so on.
Semi-Automatic Segmentation of Fibrous Liver Tissue
Authors: P. Andruszkiewicz, C. Boldak, J. Jaroszewicz
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

This article presents a semi-automatic segmentation of the fibrous liver tissue in the in-vivo liver biopsy color images. The segmentation is performed using a tree-based classifier, with decision rules as tree leaves and binary operators (AND, OR) as tree nodes. Several image's local characteristics have been exploited, based on the image points' intensity levels, as well as taken from the texture analysis domain (fractal dimension, FFT, Gabor filters). Their effectiveness concerning quality of extraction has been compared using real clinical images with a manual delimitation given by physicians, as a reference. A user friendly application has been developed which enables the operator to interactively create and store the classifiers. It also offers to a physician a predefined set of the best found classifiers, to allow him an effective work in his every-day practice. The method is semi-automatic -- it still leaves to the operator, beside the classifier choice, a possibility to manually (with the mouse) adjust the mainparameter(s) which visually, on the fly, grows/shrinks the extracted fibrous region.
An approximation algorithm for max-min fair allocation of indivisible goods
Authors: Arash Asadpour, Amin Saberi
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In this paper we give the first approximation algorithm for the problem of max-min fair allocation of indivisible goods. The approximation ratio of our algorithm is Ω1√k log3 k. As a part of our algorithm, we design an iterative method for rounding a fractional matching on a tree which might be of independent interest.
Polynomial differential equations compute all real computable functions on computable compact intervals
Authors: Olivier Bournez, Manuel L. Campagnolo, Daniel S. Graça, Emmanuel Hainry
Venue: Journal of Complexity (2007)

In the last decade, there have been several attempts to understand the relations between the many models of analog computation. Unfortunately, most models are not equivalent. Euler's Gamma function, which is computable according to computable analysis, but that cannot be generated by Shannon's General Purpose Analog Computer (GPAC), has often been used to argue that the GPAC is less powerful than digital computation. However, when computability with GPACs is not restricted to real-time generation of functions, it has been shown recently that Gamma becomes computable by a GPAC. Here we extend this result by showing that, in an appropriate framework, the GPAC and computable analysis are actually equivalent from the computability point of view, at least in compact intervals. Since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions over compact intervals can be defined by such models.
Segmentation and classification of white blood cells
Authors: S. F. Bikhet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Automated medical image processing and analysis offers a powerful tool for medical diagnosis. In this work we tackle the problem of white blood cell shape analysis based on the morphological characteristics of their outer contour and nuclei. The paper presents a set of preprocessing and segmentation algorithms along with a set of features that are able to recognize and classify different categories of normal white blood cells. The system was tested on gray level images obtained from a CCD camera through a microscope and produced a correct classification rate close to 91%.
An incentive charging scheme for differentiated services
Authors: Ren-Hung Hwang, Yung-Hsiang Miao
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Recently, many research efforts have been focused on providing differentiated services in the Internet. However, less attention has been focused on the service charging problem. In this paper, we propose an incentive charging scheme to optimize the coexistence of EF service and AF service in the network based on the DiffServ framework. This scheme imposes a lower service charge on AF service in order to attract customers to choose this service. Because of the concept of multiplexing gain, the Internet Service Provider (ISP) can get more revenue by serving more concurrent customers via AF service. On the other hand, customers can choose their preferred service based on their true needs. We use Markov Process with reward to derive the optimal tariff policy under different levels of network utilization. Moreover, the results also provide some interesting insights for the design of optimal charging schemes.
Access Control of XML Documents and Business Rule Processing for Advanced Information Exchange
Authors: Mizuho Iwaihara
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

In this paper, we summarize our research results obtained through the COE program. Our topics are classified into two categories. One is access control of XML documents, and the other is business rule processing for e-commerce. The former is dealing with various aspects of regulating access to XML documents, so that unauthorized access to data can be prevented. The latter is dealing with formal treatment of business rules for advanced automated e-commerce systems. We studied modeling and querying business rules, and extracting business rules from web pages. We also describe two topics in more detail, one is relevancy-based access control of XML documents, and the other is extracting global policies for efficient access control of XML documents.
Hypertools in image and volume visualization
Authors: Pierre-Louis Bossart
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

This paper describes our experience in image and volume visualization at the Lawrence Livermore National Laboratory. After an introduction on visualization issues, we present a new software approach to the analysis and visualization of images and volumes. The efficiency of the visualization process is improved by letting the user combine small and reusable applications by the means of a machine-independent interpreted language such as Tcl/Tk. These hypertools can communicate with each other over a network, which has a direct impact on the design of graphical interfaces. We first describe the implementation of a flexible gray-scale image widget that can handle large data sets, provides complete control of the color palette, and allows for manual and semi-interactive segmentation. This visulaization tool can be embedded in a data-flow image processing environment to assess the quality of acquisition, preprocessing and filtering of raw data. This approach combines the simplicity of visual programming with the power of a high-level interpreted language. We show how hypertools can be used in surface and volume rendering and how they increase the interaction efficiency by performing complex or tedious tasks automatically. One biomedical application is presented.
Adaptive and scalable comparison scheduling
Authors: Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

The Shortest Remaining Processing Time (SRPT) scheduling disciplineis optimal and its superior performance, compared with the policies that do not use the knowledge of job sizes, can be quantified using mean-value analysis as well as our new a symptotic distribution allimits for the relatively smaller heavy-tailed jobs. However, the main difficulty in implementing SRPT in large practical systems, e.g., Web servers, is that its complexity grows with the number of jobs in the queue. Hence, in order to lower the complexity, it is natural to approximate SRPT by grouping the arrivals into a fixed (small) number of classes containing jobs of approximately equal size and then serve the classes of smaller jobs with higher priorities. In this paper, we design a novel adaptive grouping mechanism based on relative size comparison of a newly arriving job to the preceding m arrivals. Specifically, if the newly arriving job is smallerthan k and larger than m-k of the previous m jobs, it isrouted into class k. The excellent performance of this mechanism,even for a small number of classes m+1, is demonstrated using both the asymptotic queueing analysis under heavy tails and extensive simulations. We also discuss refinements of the comparison grouping mechanism that improve the accuracy of job classification at the expense of a small additional complexity.
Use of an interval global optimization tool for exploring feasibility of batch extractive distillation
Authors: Erika R. Frits, Mihály Csaba Markót, Zoltán Lelkes, Zsolt Fonyó, Tibor Csendes, Endre Rév
Venue: Journal of Global Optimization (2007)

An interval arithmetic based branch-and-bound optimizer is applied to find the singular points and bifurcations in studying feasibility of batch extractive distillation. This kind of study is an important step in synthesizing economic industrial processes applied to separate liquid mixtures of azeotrope-forming chemical components. The feasibility check methodology includes computation and analysis of phase plots of differential algebraic equation systems (DAEs). Singular points and bifurcations play an essential role in judging feasibility. The feasible domain of parameters can be estimated by tracing the paths of the singular points in the phase plane; bifurcations indicate the border of this domain. Since the algebraic part of the DAE cannot be transformed to an explicit form, implicit function theorem is applied in formulating the criterion of bifurcation points. The singular points of the maps at specified process parameters are found with interval methodology. Limiting values of the parameters are determined by searching for points satisfying bifurcation criteria.
High-speed parallel hard and soft-decision Golay decoder: algorithm and VLSI-architecture
Authors: Weixun Cao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

An efficient algorithm and the VLSI-architecture for fast soft-decision permutation decoding of the (24,12) extended Golay code are presented. The new decoding technique consists of an optimized permutation decoding with look-ahead error-correction and a modified parity-check soft-decision decoding with reduced test patterns based on the Chase's (1972) algorithm-2. The simulation results for the Gaussian fading channel were found to be only slightly inferior to Chase's algorithm-2 although performing only four test patterns. A parallel VLSI-architecture is also proposed, which will allow for data rates reaching in the hundreds of Mbit/s. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Smartsockets: solving the connectivity problems in grid computing
Authors: Jason Maassen, Henri E. Bal
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Tightly coupled parallel applications are increasingly run in Grid environments. Unfortunately, on many Grid sites the ability of machines to create or accept network connections is severely limited by ?rewalls, network address translation (NAT)or non-routed networks. Multi homing further complicates connection setup and machine identi?cation. Although ad-hoc solutions exist for some of these problems, it is usually up to the application's user to discover the cause of the connectivity problems and ?nd a solution. In this paper we describe SmartSockets1 a communication library that lifts this burden by automatically discovering the connectivity problems and solving them with as little support from the user as possible.
Formal Analysis of Quasi Delay Insensitive Circuits Behavior in the Presence of SEUs
Authors: Y. Monnet, M. Renaudin, R. Leveugle
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Asynchronous circuits are often claimed as being an interesting alternative to design robust systems against faults. In this study, a method is proposed to model the behavior of Quasi Delay Insensitive (QDI) asynchronous circuits in the presence of SEUs (memory bit flips). The circuits and the fault injection process are both described using this model. The method, based on symbolic simulation, consists of exploring all the reachable states in the presence of faults in order to draw up an exhaustive list of behaviors. A case study shows that this method enables us to verify some properties on the circuits. SEU resistance can be formally proven using this analysis.
Weights modulo pe of linear codes over rings
Authors: Bahattin Yildiz
Venue: Designs, Codes and Cryptography (2007)

In this paper we look at linear codes over the Galois ring $$GR(p^{\ell}, m)$$ with the homogeneous weight and we prove that the number of codewords with homogenous weights in a particular residue class modulo p e are divisible by high powers of p. We also state a result for a more generalized weight on linear codes over Galois rings. We obtain similar results for the Lee weights of linear codes over $$\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$$ and we prove that the results we obtain are best possible. The results that we obtain are an improvement to Wilson's results in [Wilson RM (2003) In: Proceedings of international workshop on Cambridge linear algebra and graph coloring]
Latency and bandwidth-minimizing failure detectors
Authors: Kelvin C. W. So, Emin Gün Sirer
Venue: ACM SIGOPS Operating Systems Review (2007)

Failure detectors are fundamental building blocks in distributed systems. Multi-node failure detectors, where the detector is tasked with monitoring N other nodes, play a critical role in overlay networks and peer-to-peer systems. In such networks, failures need to be detected quickly and with low overhead. Achieving these properties simultaneously poses a difficult tradeoff between detection latency and resource consumption. In this paper, we examine this central tradeoff, formalize it as an optimization problem and analytically derive the optimal closed form formulas for multi-node failure detectors. We provide two variants of the optimal solution for optimality metrics appropriate for two different deployment scenarios. &radic;s-LM is a latency-minimizing optimal failure detector that achieves the lowest average failure detection latency given a fixed bandwidth constraint for system maintenance. &radic;s-BM is a bandwidth-minimizing optimal failure detector that meets a desired detection latency target with the least amount of bandwidth consumed. We evaluate our optimal results with node lifetimes chosen from bimodal and Pareto distributions, as well as real-world trace data from PlanetLab hosts, web sites and Microsoft PCs. Compared to standard failure detectors in wide use, &radic;s failure detectors reduce failure detection latencies by 40% on average for the same bandwidth consumption, or conversely, reduce the amount of bandwidth consumed by 30% for the same failure detection latency.
Redesigning Tcl-DP
Authors: Mike Perham, Brian C. Smith, Tibor Jánosi, Ioi Lam
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Tcl-DP is a loadable module for Tcl that adds advanced communication features to Tcl/Tk. Tcl-DP supports communication by serial links, IP-multicast, TCP, UDP, and email, contains a remote procedure call (RPC) mechanism, and supports the design of new protocols using modules called filters. Tcl-DP 1.0 [Smi93] was released four years ago and has since been used for numerous commercial and academic projects. With age, however, the code became so brittle that adding new features and porting to new versions of Tcl was nearly impossible. Furthermore, many of Tcl-DP's original features were incorporated in the Tcl core, making them redundant in Tcl-DP. Hence, we decided to write the latest version of Tcl-DP (version 4.0) from scratch. In this paper, we describe the new features of Tcl-DP 4.0, its architecture and implementation, and problems we encountered with Tcl's new I/O system.
Integrating component-based and reuse-driven software engineering business into software and information engineering curriculum
Authors: G. Pour
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Component-based enterprise software engineering (CBESE) is a rapidly emerging trend in the software engineering area. In the CBESE approach, software systems are no longer built from scratch. Instead, reusable software components, built by in-house developers or commercial vendors, are used as the building blocks of new component-based enterprise software systems. The transition from traditional software engineering to component-based enterprise software engineering is often blocked or hindered by a variety of engineering, process-related, business-oriented, infrastructure, organizational and management issues. Resolving those issues requires a systematic approach to building a component-based and reuse-driven software engineering business. That is why software engineers need to acquire a new set of skills. This has introduced the need for a new course sequence that integrates component-based enterprise software engineering into the software and information engineering curriculum. A new major course in this sequence is focused on component-based and reuse-driven software engineering businesses. In this paper, we share our experience of developing such a new course. The course is intended to provide a solid foundation for integrating of research into education in the area of component-based enterprise software engineering. In this paper, we present the course's organization, its components, and our future plans for the course.