ppxscal/embedding_network huggingface dataset:
An intelligent agent-based cooperative information processing model
Authors: Li Yao, Weiming Zhang
Venue: Information management: support systems & multimedia technology (2003)

This chapter presents a Basic Organization Structure (BOS) model for building the large and complex distributed cooperative information system in large mutual networks. It argues that a large and complex cooperative information system and its subsystems in a LAN can be modeled by multi-agent organization and basic organization respectively. With the BOS model, such a cooperative information system can be developed easily and it is more manageable, effectively supporting the complicated cooperative methods under uncertain conditions. BOS is mainly used to support the cooperative problem solving among the coarse-grained, loosely coupled, and groups of semiautonomous agents. The essential characteristics, knowledge representations, and computational models of the BOS model are illuminated in this chapter. As an application example, we use the BOS model to realize the distributed Assumption-based Cooperative Problem Solving (ACPS) in the Distributed Traveling Information Management System prototype.
Transformation rules for CNOT-based quantum circuits and their applications
Authors: Kazuo Iwama, Shigeru Yamashita
Venue: New Generation Computing (2003)

This paper introduces a simple but nontrivial set of local transformation rules for designing Control-NOT(CNOT)-based combinatorial circuits. We also provide a proof that the rule set is complete, namely, for any two equivalent circuits, S1 and S2, there is a sequence of transformations, each of them in the rule set, which changes S1 to S2. Two applications of the rule set are also presented. One is to simulate Resolution with only polynomial overhead by the rule set. Therefore we can conclude that the rule set is reasonably powerful. The other is to reduce the cost of CNOT-based circuits by using the transformations in the rule set. This implies that the rule set might be used for the practical circuit design.
Power Aware Variable Partitioning and Instruction Scheduling for Multiple Memory Banks
Authors: Zhong Wang, Xiaobo Sharon Hu
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures presents a great challenge to compiler design. In this paper, we present an approach for variable partitioning and instruction scheduling to maximally exploit the benefits provided by such architectures. Our approach is built on a novel graph model which strives to capture both performance and power demands. We propose an algorithm to iteratively find the variable partition such that the maximum energy saving is achieved while satisfying the given performance constraint. Experimental results demonstrate the effectiveness of our approach.
Factorizations of an n-cycle into two n-cycles
Authors: Leonardo Cangelmi
Venue: European Journal of Combinatorics (2003)

We prove by elementary combinatorial methods that the number of factorizations of an n-cycle (with n odd) into the product of two n-cycles is 2(n - 1)!/(n + 1). Moreover, we generalize our method to the factorization of an even permutation in Sn into the product of two n-cycles, and we present an algorithm giving all the factorizations of any odd permutation in Sn+1 into the product of an (n + 1)-cycle and an n-cycle, where the fixed element of the second permutation is given.
Scaffolding with object diagrams in first year programming classes: some unexpected results
Authors: Lynda Thomas, Mark Ratcliffe, Benjy Thomasson
Venue: ACM SIGCSE Bulletin (2004)

This paper reports on an experiment in which first year programming students were given explicit encouragement to use Object (Instance) diagrams when tracing code in multiple-choice questions. We conjectured that by providing scaffolding in this technique, students would be helped to understand the code better and that they would then continue to draw their own diagrams in similar situations. This turned out not to be the case. Although generally students who draw diagrams do better in questions that test their understanding of code behaviour and object referencing, our intervention does not appear to have helped students and the students who were exposed to the intervention were not more likely to go on to use the technique themselves.
A global router for sea-of-gates circuits
Authors: Kai-Win Lee, Carl Sechen
Venue: Proceedings of the conference on European design automation (1991)

We describe a new global routing algorithm designed specifically for sea-of-gates circuits. The algorithm has been generalized to handle gate array and standard cell circuits. The main features of the algorithm are: (1) interconnection length minimization using a new Steiner tree generation method, (2) a two-stage coarse global routing method which seeks to even congestion, (3) a maze routing procedure which removes overflows and reduces the congestion, (4) vertical track assignment, and (5) congestion evening at the detailed global routing level. In tests on the MCNC benchmark circuits, the algorithm produced layouts with an average of 11% fewer routing tracks than the other algorithms. In tests on gate array benchmark circuits, the algorithm not only achieved uniform channel densities, but the maximum channel densities it produced are the lowest values that have ever been reported.
IT Enabled Applications in Government Hospitals in India: Illustrations of Telemedicine, E-Governance, and BPR
Authors: K. V. Ramani
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Governments all over the world are getting increasingly concerned about their ability to meet their social obligations in the health sector. The situation has become critical in light of rapidly increasing costs for medical care, aging population, lack of government funds, and so on, all of which threaten the quality of services delivered. The hospital managers are very concerned about the lack of hospital infrastructure and resources to provide a satisfactory level of service. Equally concerned are the government administrators who have limited financial resources to offer healthcare services at subsidized rates. In this paper, we first describe a set of critical problems faced by government hospitals in India based on a study of governmenthospitals in several states. We then discuss three successful IT enabled applications (telemedicine, egovernance, and BPR) to satisfactorily address some of these problems in government hospitals in India.
New Product Innovation with Multiple Features and Technology Constraints
Authors: Kathy A. Paulson Gjerde, Susan A. Slotnick, Matthew J. Sobel
Venue: Management Science (2002)

We model a firm's decisions about product innovation, focusing on the extent to which features should be improved or changed in the succession of models that comprise a life cycle. We show that the structure of the internal and external environment in which a firm operates suggests when to innovate to the technology frontier. The criterion is maximization of the expected present value of profits during the life cycle. Computational studies complement the theoretical results and lead to insights about when to bundle innovations across features. The formalization was influenced by extensive interviews with managers in a high-technology firm that dominates its industry.
Structured multimedia document classification
Authors: Ludovic Denoyer, Jean-Noël Vittaut, Patrick Gallinari, Sylvie Brunessaux, Stephan Brunessaux
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

We propose a new statistical model for the classification of structured documents and consider its use for multimedia document classification. Its main originality is its ability to simultaneously take into account the structural and the content information present in a structured document, and also to cope with different types of content (text, image, etc). We present experiments on the classification of multilingual pornographic HTML pages using text and image data. The system accurately classifies porn sites from 8 European languages. This corpus has been developed by EADS company in the context of a large Web site filtering application.
A C toolkit to support parallel programming
Authors: Donald Acton
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

The programming of parallel and distributed systems is difficult. Existing approaches to coarse-grained parallelism rely upon some form of process creation combined with the exchange or sharing of data. Coarse-grained parallelism usually is in the form of a combination of pipes, message passing, or shared memory. The problem with this approach is that in addition to coping with decomposing programs into functions and procedures, is added the task of managing low-level process creation, interprocess communication and process synchronization, and of maintaining the consistency of concurrently accessed data. These additional responsibilities increase the complexity of writing, debugging, and maintaining an application program in a parallel environment.The approach taken is to provide a C toolkit that allows for the creation of objects and for their manipulation. The toolkit uses the method interface of an object to extract parallelism through this interaction point with the object. This extension to method usage is accomplished through facilities to achieve parallelism at the point when an object is invoked or through the way the method is run. The toolkit provides a runtime environment to support these parallel operations and a locking system to arbitrate concurrent accesses to an object.
A Domain Analysis Method for Software Product Lines Based on Scenarios, Goals and Features
Authors: Minseong Kim, Hwasil Yang, Sooyong Park
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

A feature-oriented approach has been used extensivelyfor commonality and variability (C&V) analysis inSoftware Product Lines (SPL). However, this feature-orientedapproach contains no proposal to systematicallyidentify features and provide the rationale for both thefeatures and C&V. Therefore, this paper proposes adomain analysis method for the SPL based on scenarios,goals and features in order to overcome some of thedeficiencies and limitations of the feature-orientedapproach. In particular, the paper presents a domainrequirements model (DRM) that integrates features withboth goals and scenarios. Using this DRM, we alsopropose a domain requirements modeling method. At theend, this approach is applied to a home integrationsystem (HIS) and then is also evaluated. Our approachmakes it possible to systematically identify features andprovide the rationale for both the features and C&V. Thus,the approach provides a systematic and concrete domainanalysis method for the SPL.
Probabilistic logic learning
Authors: Luc De Raedt, Kristian Kersting
Venue: ACM SIGKDD Explorations Newsletter (2003)

The past few years have witnessed an significant interest in probabilistic logic learning, i.e. in research lying at the intersection of probabilistic reasoning, logical representations, and machine learning. A rich variety of different formalisms and learning techniques have been developed. This paper provides an introductory survey and overview of the state-of-the-art in probabilistic logic learning through the identification of a number of important probabilistic, logical and learning concepts.
Adaptive inter-piconet scheduling in small scatternets
Authors: Vojislav B. Mišić, Jelena Mišić
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

Inter-piconet scheduling in a Bluetooth scatternet may be performed in an adaptive manner, so as to minimize end-to-end packet delays. Using the theory of queues with vacations, we analyze the impact of different values of scatternet parameters on end-to-end delays, and then investigate the possibility of minimization of the aforementioned delays. We show that such minimization is possible for scatternets with both Slave/Slave and Master/Slave bridges, and that it should be based on inter-piconet traffic. We also describe simple algorithms that enable the scatternet to achieve near minimum delays in a wide range of traffic parameter values.
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
Authors: Uri Lublin, Dror G. Feitelson
Venue: Journal of Parallel and Distributed Computing (2003)

The analysis of workloads is important for understanding how systems are used. In addition, workload models are needed as input for the evaluation of new system designs, and for the comparison of system designs. This is especially important in costly large-scale parallel systems. Luckily, workload data are available in the form of accounting logs. Using such logs from three different sites, we analyze and model the job-level workloads with an emphasis on those aspects that are universal to all sites. As many distributions turn out to span a large range, we typically first apply a logarithmic transformation to the data, and then fit it to a novel hyper-Gamma distribution or one of its special cases. This is a generalization of distributions proposed previously, and leads to good goodness-of-fit scores. The parameters for the distribution are found using the iterative EM algorithm. The results of the analysis have been codified in a modeling program that creates a synthetic workload based on the results of the analysis.
A case similarity metric for software reuse and design
Authors: Paulo Gomes, Carlos Bento
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

When the idea of software reuse appeared in 1968, new horizons for software design were open. But some major problems appeared and most of the expectations were not met. One of the problems encountered is the selection of the right software component. This is related not only to the similarity between the desired functionality and the function delivered by the retrieved software component, but also to the effort needed to modify the chosen component to accommodate the desired functionality. Most of the research done in the case-based reasoning area has been in developing accurate and efficient retrieval algorithms. We think that case-based reasoning retrieval concepts and ideas can be successfully applied to software reuse. In this article we propose a metric to assess similarity between software cases supported on functional and behavioral knowledge. One important aspect of this metric is that reusability is taken into account to estimate the amount of effort needed to reuse retrieved software cases. We also present experimental work that shows that similarity at the functional level is the most important aspect of the similarity metric proposed.
An adaptive multiplexing algorithm of delay-sensitive multiple VBR-coded bit streams
Authors: Jin-soo Kim, Byeong-hee Roh
Venue: Multimedia Systems (2003)

This paper describes a novel multiplexing scheme for delay-sensitive multiple VBR-coded bit streams in live multimedia service offered to high-speed networks. The primary goal of multiplexing in this paper is to keep the delay limits of each bit stream and to enhance network resource utilization. For this end, this paper presents an adaptive control scheme which does not cause violation of any delay constraints inherent to each bit stream. The scheme is based on the assumption that the recent behavior of each bit stream has a high correlation with near-term future behavior. Such a property is used to make as flat as possible both temporal averaging on a stream-by-stream basis and spatial averaging on multiple VBR-coded bit streams. Through several computer simulations, it is shown that the proposed scheme can effectively reduce the peak rate, the coefficient of variation, and the effective bandwidth of the multiplexed transmission rate.
Detab/65 in third-generation Cobol
Authors: Bruce Silberg
Venue: ACM SIGPLAN Notices (1971)

Detab/65, which was distributed by the ACM, is a decision table preprocessor written in second-generation Cobol (Cobol-61). This paper indicates the history of decision tables, reviews their structure, advantages and disadvantages, and presents the modifications to Detab/65 that are needed to allow its compilation by Cobol-65 or ANS Cobol.
Information technology accreditation activities
Authors: Eydie Lawson, Doris K. Lidtke, Barbara Price
Venue: ACM SIGCSE Bulletin (2004)

Programs in Information Technology (IT) have begun at many universities over the past decade and many are now eager for accreditation. This paper describes the activities undertaken in preparation for accreditation of IT programs by the Computing Accreditation Commission of ABET.
Programming portable optimized multimedia applications
Authors: Juan Carlos Rojas, Miriam Leeser
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Multimedia computer architectures can speed-up applications significantly when programmed manually. Optimized programs have been non-portable up to now, because of differences in instruction sets, register lengths, alignment requirements and programming styles. We solve all these problems by using a library of C pre-processor macros called MMM. We implemented three examples from video compression in MMM, and automatically translated them into optimized code for four distinct multimedia processors. Their performance is comparable, and in several cases better, than equivalent examples optimized by the processor vendors.
Generation of Inequivalent Generalized Bell Bases
Authors: Antoni Wójcik, Andrzej Grudka, Ravindra W. Chhajlany
Venue: Quantum Information Processing (2003)

The notion of equivalence of maximally entangled bases of bipartite d&ndash;dimensional Hilbert spaces &hamilt;d &otimes; &hamilt;d is introduced. An explicit method of inequivalent bases construction is presented.PACS: 03.67.-a
Breaking out of Eclipse: developing an ActiveX host for SWT
Authors: Li-Te Cheng
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

SWT enables Eclipse developers to create user interfaces with native OS look-and-feel and performance. Without significant extra effort, however, SWT applications are limited to operate within the confines of Eclipse, or as a standalone desktop application. This paper describes the motivation and initial efforts to embed SWT applications within an ActiveX container, presents a simple API to enable SWT applications for ActiveX containment, and discusses future directions for embedding the Eclipse framework into other external native OS applications.
Metacognition in information systems education
Authors: Steve Benson
Venue: Current issues in IT education (2003)

My interest in producing this chapter arises from the fact that I am mildly afflicted with Asperger's syndrome and have some medium-term memory degradation. The level of introspection that I have had to develop onto my own mental processes in order to function has been useful to me in my role as an academic, because I can understand many of the learning problems that students face. Conversations at international conferences and email interactions suggested that my personal insights would be useful to other academics. Here, I present data from a six-semester period that suggest that it would be beneficial to change Information Systems curricula to incorporate metacognitive education. I also describe the changes that I have made to my own teaching methods and the elements of a metacognitive teaching program.
Probabilistic methods for searching ocr-degraded arabic text
Authors: Kareem M. Darwish
Venue:  (2003)

Since many Arabic documents are available only in print, automating retrieval from collections of scanned Arabic document images using Optical Character Recognition (OCR) is an important problem. This dissertation addresses retrieval of Arabic document images based on OCR, with emphasis on probabilistic methods to improve retrieval effectiveness. Arabic's rich morphology (word construction) and complex orthography (writing system) present unique challenges for OCR and Information Retrieval (IR) systems. New probabilistic structured query methods that leverage replacement probabilities were developed in this research to improve retrieval effectiveness in OCR degraded text retrieval and their generality has been shown in cross-language information retrieval. For the OCR-degraded text retrieval, the probabilistic structured query methods were applied using the most effective index terms for OCR-degraded text, with replacement probabilities estimated using an OCR degradation model. Overlapping character n-grams and combinations of character n-grams with terms obtained through morphological analysis were found to be the most effective indexing terms for Arabic collections of varying sizes, genres, and degradation levels. For index terms requiring morphological analysis, existing automated Arabic morphological analysis techniques were adapted to make them more suitable for IR applications. Different OCR models were developed to account for the complex Arabic orthography and a group of tests were crafted to verify that modeled and real OCR degradation have similar effects on IR. One of the models was also used to synthetically degrade a large document collection. The techniques presented in this dissertation offer the potential to unlock access to printed documents of Arabic and other languages with similar orthographic characteristics.
Universal Coding of Function Spaces as a Model for Signal Compression
Authors: Boris Ryabko, Jaakko Astola
Venue: Proceedings of the Conference on Data Compression (2004)

We address the problem of signal compression, basing on the mathematicalmodel, in which a set of all possible signals is considered as a function spacewith a metric p. The main attention is focused on the minimization of thesize of compressed representation, when function characteristics are not knownprecisely.
Concurrent Browsing of Bilingual Web Sites by Content-Synchronization and Difference-Detection
Authors: Akiyo Nadamoto, Ma Qiang, Katsumi Tanaka
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

We propose a new way of browsing bilingual web sites through concurrent browsing with automatic similar-content synchronization and difference-detection facilities. Our prototype browser system is called the Bilingual Comparative Web Browser (B-CWB) and it concurrently presents bilingual web pages in a way that enables their content of the Web pages to be automatically synchronized.The B-CWB allows users to browse two web news sites concurrently and compare the similar news articles written in different languages (English and Japanese). The major characteristics of the B-CWB are its content synchronization and differnce detection: Content synchronization means that user operation (scrolling or clicking) on one web page automatically invokes not necessarily same operations on the other web page to preserve similarity of content between the two web pages. For example, scrolling a web page may involve passage-level similarity retrieval on the other web page. Clicking a web page (and obtaining a new web page) invokes page-level similarity retrieval within the other web site pages through the use of a English-Japanese dictionary. Difference detection means that the B-CWB analyzes two similar web pages shown concurrently to discover the several "differences" between them. This facility is important in comparing two news articles that report the same affairs.
Programming languages and gender
Authors: Ronald Dattero, Stuart D. Galup
Venue: Communications of the ACM (2004)

Comparing differences and similarities in programming language usage according to programmer gender.