ppxscal/embedding_network huggingface dataset:
Planning for future user services
Authors: Joan Franz
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

The purpose of this paper is to explore the changes that will occur within User Services as the nature of computing changes and affects changes in institutions. In the past, most institutions have had one major computer center which supplied the bulk of the computer power and all related services and activities. Currently we are seeing a shift away from this concept. We are seeing computers springing up all over. So how is this affecting the computer centers? Should the computer center continue to compete with these other centers or should it offer something else? A possible scenario is that the services and programming, including user services, will split off from the computer center and become a central unit within the institution, offering technical support for the central computer center and the satellites on an institution-wide basis. This paper will look at the various ingredients affecting computing and will try to predict what the future might look like for User Service organizations. 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
Enhancing E-Communities with Agent-Based Systems
Authors: Simon Case, Nader Azarmi, Marcus Thint, Takeshi Ohtani
Venue: Computer (2001)

Traditionally, the term community refers to a location where people with common interests gather to share experiences, ask questions, or collaborate. Because they are present in the same locale, members can meet easily to learn from each other by sharing their explicit knowledge and revealing information about their successes and failures. E-communities can use Web technologies to provide geographically disparate groups with the same sense of community. To thrive, these virtual communities require software agents that perform many of the functions that print resources and membership services provide to traditional communities. The authors' studies have shown that intelligent software agents, in the role of personal agents, can effectively provide data sharing, personalized services, and pooled knowledge while maintaining user privacy and promoting interaction in e-communities. Future research should include further investigation of several topics, including automatic learning of short- and long-term user interests, improving information retrieval accuracy, and ontology management. Successful deployment of multi-IDIoMS systems requires addressing ontology management--an issue that generally plagues the Internet. However, recognizing and efficiently collating information about similar topics within heterogeneous data sources remain difficult issues to resolve. Using XML and other standards can mitigate some concerns, but it does not provide a solution to other key issues, especially with regard to legacy data. Nonetheless, the authors believe that their agent-based information management system provides a powerful application for use in complex, distributed Internet e-communities.
FedStats: the gateway to federal statistics
Authors: Cathryn Dippo
Venue: Communications of the ACM (2003)

FedStats.gov is an award-winning portal to a distributed digital library of statistical information compiled by more than 70 federal agencies. The challenges in simply providing access are many---organizational, bureaucratic, technical, and usability to name just a few.
Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics
Authors: T. Osogami, H. Okano
Venue: Journal of Heuristics (2003)

The tradeoff between the speed and quality of the solutions obtained by various construction and local search algorithms for the elementary bin packing problem (BPP) are analyzed to obtain useful information for designing algorithms for real-world problems that can be modeled as BPPs. On the basis of intensive computational experiments, we observe that the framework of a solution (i.e., a part of a solution consisting of large items or items with tight constraints) should be constructed in the early stages of a local search. New local search algorithms are proposed as empirical support for the observation.
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
Authors: Suh-Yin Lee, Ruey-Long Liou
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

A locking model adopting a multi-granularity approach is proposed for concurrency control in object-oriented database systems. The model is motivated by a desire to provide high concurrency and low locking overhead in accessing objects. Locking in schemas and locking in instances are developed separately and then are integrated. Schema changes and composite objects are also taken into account. A dual queue scheme for efficient scheduling of lock requests is developed. The model consists of a rich set of lock modes, a compatibility matrix, and a locking protocol. Characteristic query examples on single class, class lattice, and composite objects are used to illustrate the comparison between the ORION model and the proposed model. It is shown that our locking model has indeed made some improvements and is suitable for concurrency control in object-oriented databases.
Optimizing Queries with Foreign Functions in a Distributed Environment
Authors: Pauray S. M. Tsai, Arbee L. P. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Foreign functions have been considered in the advanced database systems to support complex applications. In this paper, we consider optimizing queries with foreign functions in a distributed environment. In traditional distributed query processing, selection operations are locally processed before joins as much as possible so that the size of relations being transmitted and joined can be reduced. However, if selection predicates involve foreign functions, the cost of evaluating selections cannot be ignored. As a result, the execution order of selections and joins becomes significant, and the trade-off for reducing the costs of data transmission, join processing, and selection predicate evaluation needs to be carefully considered in query optimization. In this paper, a response time model is developed for estimating the cost of distributed query processing involving foreign functions. We explore the property of the problem and find an optimal algorithm with polynomial complexity for a special case of it. However, finding the optimal execution plan for the general case is NP-hard. We propose an efficient heuristic algorithm for solving the problem and the simulation result shows its good quality. The research result can also be applied to the advanced database systems and the multidatabase systems where the conversion function defined for the need of schema integration can be considered a type of foreign functions.
Large-Scale Industrial Reuse to Reduce Cost and Cycle Time
Authors: Emmanuel Henry, Benoît Faller
Venue: IEEE Software (1995)

All the changes in an organization's management, methods, and tools necessary to encourage reuse take time, delaying and sometimes wiping out the return on investment. We think that long-term reuse strategies must be based on short-term reuse successes. For this reason, our company -- Matra Cap Systemes -- founded its reuse strategy on pragmatic, opportunistic reuse-based projects.Here we report the results from two large industrial projects, in which project-based and cross-organizational reuse improved time-to-market, productivity, and quality (as measured through error rates). These positive results can be attributed to both reuse and the iterative nature of the development process. One project confirmed the interest of cross-organizational reuse. As a matter of fact, we record more and more projects that are reusing large parts of existing systems, although they come from different departments in the company.We now face another interesting consequence of our opportunistic reuse policy: several versions of similar modules, whose maintenance could be expensive if managed by different groups. For this reason, we are in the process of centralizing the maintenance of common code. We believe that our new internal-products policy will make a priori reuse easier in the long run.
Partitioning and Labeling of Loops by Unimodular Transformations
Authors: E. H. D'Hollander
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A general method for the identification of the independent subsets in loops with constant dependence vectors is presented. It is shown that the dependence relation remains invariant under a unimodular transformation. Then a unimodular transformation is used to bring the dependence matrix into a form where the independent subsets are obtained bya direct and inexpensive partitioning algorithm. This leads to a procedure for the automatic conversion of a serial loop into a nest of parallel DO-ALL loops. Another unimodular transformation results in an algorithm to label the dependent iterations of an n-fold nested loop in O(n/sup 2/) time. This provides a multithreaded dynamic scheduling scheme requiring only one fork and one join primitive.
Fuzzy Logic-A Modern Perspective
Authors: John Yen
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Traditionally, fuzzy logic (FL) has been viewed in the artificial intelligence (AI) community as an approach for managing uncertainty. In the 1990s, however, fuzzy logic has emerged as a paradigm for approximating a functional mapping. This complementary modern view about the technology offers new insights about the foundation of fuzzy logic, as well as new challenges regarding the identification of fuzzy models. In this paper, we will first review some of the major milestones in the history of developing fuzzy logic technology. After a short summary of major concepts in fuzzy logic, we discuss a modern view about the foundation of two types of fuzzy rules. Finally, we review some of the research in addressing various challenges regarding automated identification of fuzzy rule-based models.
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
Authors: J. Gergov, C. Meinel
Venue: IEEE Transactions on Computers (1994)

OBDD's are the state-of-the-art data structure for Boolean function manipulation. Basic tasks of Boolean manipulation such as equivalence test, satisfiability test, tautology test and single Boolean synthesis steps can be performed efficiently in terms of fixed ordered OBDD's. The bottleneck of most OBDD-applications is the size of the represented Boolean functions since the total computation merely remains tractable as long as the OBDD-representations remain of reasonable size. Since it is well known that OBDD's are restricted FBDD's (free BDD's, i.e., BDD's that test, on each path, each input variable at most once), and that FBDD-representations are often much more (sometimes even exponentially more) concise than OBDD-representations. We propose to work with a more general FBDD-based data structure. We show that FBDD's of a fixed type provide, similar as OBDD's of a fixed variable ordering, canonical representations of Boolean functions, and that basic tasks of Boolean manipulation can be performed in terms of fixed typed FBDD's similarly efficient as in terms of fixed ordered OBDD's. In order to demonstrate the power of the FBDD-concept we show that the verification of the circuit design for the hidden weighted bit function proposed Bryant can be carried out efficiently in terms of FBDD's while this is, for principal reasons, impossible in terms of OBDD's.
Parallel Algorithms for the Longest Common Subsequence Problem
Authors: M. Lu, H. Lin
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

A subsequence of a given string is any string obtained by deleting none or some symbolsfrom the given string. A longest common subsequence (LCS) of two strings is a commonsubsequence of both that is as long as any other common subsequences. The problem isto find the LCS of two given strings. The bound on the complexity of this problem underthe decision tree model is known to be mn if the number of distinct symbols that canappear in strings is infinite, where m and n are the lengths of the two strings,respectively, and m/spl les/n. In this paper, we propose two parallel algorithms far thisproblem on the CREW-PRAM model. One takes O(log/sup 2/m + log n) time with mn/log m processors, which is faster than all the existing algorithms on the same model. The other takes O(log/sup 2/m log log m) time with mn/(log/sup 2/m log log m) processors when log/sup 2/m log log m
A Logic Programming Framework for Modeling Temporal Objects
Authors: F. Nihan Kesim, Marek Sergot
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

We present a general approach for modeling temporal aspects of objects in a logic programming framework. Change is formulated in the context of a database which stores explicitly a record of all changes that have occurred to objects and thus (implicitly) all states of objects in the database. A snapshot of the database at any given time is an object-oriented database, in the sense that it supports an object-based data model. An object is viewed as a collection of simple atomic formulas, with support for an explicit notion of object identity, classes and inheritance. The event calculus is a treatment of time and change in first-order classical logic augmented with negation as failure. The paper develops a variant of the event calculus for representing changes to objects, including change in internal state of objects, creation and deletion of objects, and mutation of objects over time. The concluding sections present two natural and straightforward extensions, to deal with versioning of objects and schema evolution, and a sketch of implementation strategies for practical application to temporal object-oriented databases.
Error resilience and recovery in streaming of embedded video
Authors: Sungdae Cho, William A. Pearlman
Venue: Signal Processing (2002)

The three-dimensional (3-D) SPIHT coder is a scalable or embedded coder that has proved its efficiency and its real-time capability in compression of video. A forward-error-correcting (FEC) channel (RCPC) code combined with a single automatic repeat request (ARQ) proved to be an effective means for protecting the bitstream. There were two problems with this scheme: the noiseless reverse channel ARQ may not be feasible in practice; and, in the absence of channel coding and ARQ, the decoded sequence was hopelessly corrupted even for relatively clean channels. In this paper, we introduce a new method of partitioning wavelet coefficients into spatio-temporal (s-t) tree blocks to achieve error resilience. Each of these s-t blocks corresponds to the full 3-D image region, because roots of these trees are wavelet coefficients taken at fixed intervals in the root low-frequency subband. Previously, we reported on grouping contiguous root subband coefficients to generate s-t tree blocks that correspond to local 3-D regions. The new procedure brings higher error resilience, since lost coefficients can be concealed with the surrounding coefficients even if some of the coded s-t blocks are totally missing. The bitstreams of the coded s-t blocks are packetized and encoded with a channel code to correct errors and to prevent decoding of erroneous data after errors are detected. Because the separately encoded s-t blocks produce embedded bitstreams, the packets from the bitstreams are interleaved to generate an embedded composite bitstream. The embedded property, whereby successive compressed bits convey successively smaller value information, suggests unequal error protection, where earlier bits are more strongly protected by the channel code than later bits. Therefore, unequal error protection is also incorporated into our video bitstreams to bring an even higher degree of resilience to channel bit errors. Our claims are supported by extensive simulations with decoding of the various 3-D SPIHT bitstreams compared to each other and to MPEG-2. Superiority to MPEG-2 in noiseless and noisy channels, nnder equal conditions with or without FEC, is clearly demonstrated by the results of these simulations.
On some new analytic inequalities
Authors: Mihály Bencze, Chang-jian Zhao
Venue: Octogon Mathematical Magazine (2002)

In this paper, we find some new inequalities by Redheffer inequality, Jordan inequality and Jensen inequality. As application, we generalize one result which was given in [1].
A Fault Tolerant Hybrid Memory Structure and Memory Management Algorithms
Authors: Dhiraj K. Pradhan, Nicholas S. Bowen
Venue: IEEE Transactions on Computers (1995)

This paper proposes a cost effective fault tolerant memory structure. It uses the modified status of virtual memory pages as the basis to propose a system with two classes of memory. One class is for modified pages, and the other is for pages not modified. The term hybrid memory system is used to describe this system. Results show the cost savings for a hybrid system over a traditional fault tolerant system. Hybrid virtual memory algorithms are proposed for the system. The traditional lifetime and space-time measures of virtual memory algorithms are extended for the hybrid algorithms. This includes ¿cost-weighted¿ measures to reflect the fact that the two classes of memory may have different resource allocation constraints. A theoretical result is presented for the effect of combining the hybrid lifetime functions. Finally, a framework for developing hybrid algorithms is presented with experimental results illustrating the analysis. It is shown that the lifetime measure for the hybrid policies can show improvements over traditional algorithms.
Challenges of interconnection technology till the end of the roadmap and beyond
Authors: M. Engelhardt, G. Schindler, W. Steinhögl, G. Steinlesberger
Venue: Microelectronic Engineering (2002)

Electrical results obtained with interconnects with end-of-roadmap feature sizes give confidence in a smooth and evolutionary extension of local interconnect technology for at least one decade. The requirements regarding RC signal delay for intermediate and global interconnects will not be met by technology alone like introduction of advanced low-k approaches such as airgaps, but will require further advances in disciplines which have not been product drivers in the past. Further advances in architecture, system design, and CAD tools will be indispensible and will become enablers for fabrication of CMOS products with CDs down to at least a few 10 nm. Further miniaturization driven by the need to reduce fabrication costs will result in further performance gain from device scaling without compromizing performance by interconnect signal delay. An interconnect crisis is avoidable.
Platform-Based Design and Software Design Methodology for Embedded Systems
Authors: Alberto Sangiovanni-Vincentelli, Grant Martin
Venue: IEEE Design Test (2001)

Embedded products have become so complex and must be developed so quickly that current design methodologies are no longer adequate. The authors' vision for the future of embedded-system design involves two essential components: a rigorous methodology for embedded software development and platform-based design.
The role for framework libraries in CS2
Authors: William Collins, Josh Tenenberg, Raymond Lister, Suzanne Westbrook
Venue: ACM SIGCSE Bulletin (2003)

The recent emergence of object-oriented framework libraries of classic data structures and algorithms such as the Standard Template Library and Java's Collection classes provides a set of general and efficient data structure components for use by practicing software developers. A number of textbook writers are beginning to incorporate the use of these frameworks into "CS2", the traditional first course in data structures at the university level.There has scarcely been a discussion of how these frameworks should best be incorporated into CS2, if they should be used at all. The proposed panel will examine the role of standardized framework libraries in the first data structures course at the university level. Panelists will focus on the following questions. What are the fundamental objectives of CS2, and what role might frameworks have in meeting these objectives? How does an instructor balance student needs for additional instruction in programming basics (e.g. arrays and pointers) versus practice in larger scale design and code reuse? What would be given up to incorporate frameworks into CS2? And to what extent is it important for students to construct elementary data structures from first principles? What assumptions about student cognition and learning does a pro- or con-frameworks approach imply.By trying to articulate answers to some of the above questions, we hope to raise the level of discussion concerning the evolution of the introductory computer science curriculum. This panel will thus try to make explicit, and hence available for critical examination, some of the arguments and assumptions that inform this debate.
Block, Multistride Vector, and FFT Accesses in Parallel Memory Systems
Authors: D. T. Harper,  III
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A discussion is presented of the use of dynamic storage schemes to improve parallelmemory performance during three important classes of data accesses: vector accesses inwhich multiple strides are used to access a single vector, block accesses, andconstant-geometry FFT accesses. The schemes investigated are based on linear addresstransformations, also known as XOR schemes. It has been shown that this class ofschemes can be implemented more efficiently in hardware and has more flexibility thanschemes based on row rotations or other techniques. Several analytical results areshown. These include: quantitative analysis of buffering effects in pipelined memorysystems; design rules for storage schemes that provide conflict-free access usingmultiple strides, blocks, and FFT access patterns; and an analysis of the effects ofmemory bank cycle time on storage scheme capabilities.
Hard handoff minimization using genetic algorithms
Authors: T. M. Chan, S. Kwong, K. F. Man, K. S. Tang
Venue: Signal Processing (2002)

To set up personal communication services networks using code division multiple access cellular system standard, cost is always an important factor for consideration. In this paper, we aim to present a genetic algorithm-based method to reduce the cost of facilities as much as possible while the service performance is guaranteed. Handoff induces a cost to the investment significantly; thus, hard handoff minimization is desired. We formulate a combinatorial optimization problem to minimize the weighted-distance costs and hard handoff cost. Also, an efficient searching technique, genetic algorithms (GA), is adopted in this minimization problem. Both single objective and multiple objective approaches of GA are applied to the problem. It is found that the results obtained by the single objective approach can provide small weighted distance costs and hard handoff cost while the network partition is still balanced.