ppxscal/embedding_network huggingface dataset:
A document model for multimedia information
Authors: J. Emery, A. Karmouch
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Multimedia documents differ significantly from traditional documents, which are composed of text and possibly geometric graphics. The inclusion of continuous media such as audio and video imposes new requirements on document representation. The MEDIADOC model supports the creation of multimedia documents by means of a logical structure, a layout structure, and a rendering scenario that is a schedule for document playback. Special document creation tools are also required to facilitate the potentially complicated nature of multimedia document design. In this paper we will provide a description of the MEDIADOC model including a discussion of hierarchical structures, rendering scenarios, and multimedia document creation tools.
Centering Sequences with Bounded Differences
Authors: Colin McDiarmid
Venue: Combinatorics, Probability and Computing (1997)

Inequalities for martingales with bounded differences have recently proved to be very useful in combinatorics and in the mathematics of operational research and computer science. We see here that these inequalities extend in a natural way to &lsquo;centering sequences&rsquo; with bounded differences, and thus include, for example, better inequalities for sequences related to sampling without replacement.
ArtStream: Web art in a curatorial setting
Authors: Tom Hapgood, Lucy Petrovich, Peter Briggs, Mike Holcomb, Charles Guerin, James Smith, Cynthia Barlow
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

ArtStream, a Web-based, curated exhibition space for Internet art, seeks to promote the work of Internet artists while bringing it into the "legitimized" world of traditional museum culture. Therefore, ArtStream makes it easy for a curator from a less technical background to administer an exhibit. ArtStream is the product of a collaboration between the University of Arizona Museum of Art and the Treistman Center for New Media, in the University of Arizona College of Fine Arts. The project was funded by a New Learning Environments grant from the university.
Flexible Support for Spatial Decision-Making
Authors: Shan Gao, John Paynter, David Sundaram
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Decision makers perceive the decision-making processes for solving complex spatial problems as unsatisfactory and lacking in generality. Current Spatial Decision Support Systems (SDSS) fulfil their specific objectives, but fail to address many of the requirements for effective spatial problem solving, as they are inflexible, complex to use and often domain-specific. As technology progresses, there is an increasing opportunity for the use of SDSS in a numberof domains. Flexible support for spatial decision-making to solve complex, semi-structured orunstructured spatial problems can offer advantages to individuals and organisations.This research attempts to overcome problems identified in the fields of spatial decision-making and SDSS. It synthesises ideas, frameworks and architectures from Geographic Information Systems (GIS), Decision Support Systems (DSS) and SDSS. Concepts from spatial modelling, model and scenario life cycle management, knowledge management and Multi-Criteria Decision-Making (MCDM) methodology are explored and leveraged in the implementation of a Flexible Spatial Decision Support System (FSDSS) using object-oriented concepts and technologies.As part of the research, we proposed a generic spatial decision-making process, developed a domain-independent FSDSS framework and architecture to support this process. We also implemented a prototypical FSDSS that acts as a proof of concept for the spatial decision-making process, FSDSS framework and architecture. The proposed spatial decision-making process and the implemented FSDSS were successfully evaluated through five scenarios across spatial decision problem domains including location, allocation, routing, layout, and spatiotemporal.
Fundamental fuzzy relation concepts of a D.S.S. for the estimation of natural disasters' risk (the case of a trapezoidal membership function)
Authors: Lazaros S. Iliadis, Stefanos H. Spartalis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The effective protection from natural disasters requires the development of a rational and sensible policy. The cases of the recent (2003) floods in northern, central and southern Greece and the big problem of the forest fire breakouts (during the summer season) have revealed the necessity for a serious strategic planning that will reduce the consequences and especially the cost in human lives.Computer science and Fuzzy Mathematical relations can provide significant aid in this direction. Given a specific kind of disaster the estimation of the degree of natural disasters' risk (D.N.D.R.) for a prefecture of Greece can be performed by the use of a Decision Support Ststem (D.S.S.).
Correlation of the entrance examination result and the study success at the Medical Faculty, Charles University Prague
Authors: Cestmir Stuka, Daniel Smutek
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Students wishing to study more demanding disciplines are required to pass an entrance examination before entering the university in Czech Republic. The goal of this study is finding, by statistical analysis of the data available at the time of entrance examination, parameters that predict the student's ability to finish his/her studies successfully. Following predictors were found: mean value of grades from physics during four years study at high school, grade from mathematics from the 3rd year of the high school and grade from physics from the 2nd year of the high school.
Coalgebras of bounded type
Authors: H. Peter Gumm, Tobias Schröder
Venue: Mathematical Structures in Computer Science (2002)

We use some results of Trnkov&aacute; to show first that subcoalgebras are always closed under finite intersections. Assuming that the type functor F is bounded, we obtain a concrete representation of the terminal F-coalgebra. We also provide several equivalent characterizations of boundedness.
Runge-Kutta methods with minimal dispersion and dissipation for problems arising from computational acoustics
Authors: K. Tselios, T. E. Simos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this paper new symplectic Runge-Kutta methods with minimal dispersion and dissipation errors are developed. The proposed schemes are more efficient than the classical Runge-Kutta schemes for computational acoustics problems.
Scalable load balancing on distributed web servers using mobile agents
Authors: Jiannong Cao, Yudong Sun, Xianbin Wang, Sajal K. Das
Venue: Journal of Parallel and Distributed Computing (2003)

Distributed web servers on the immensely expanding Internet require high scalability and availability to provide efficient services to millions of clients on the web. To provide rapid responses to enormous number of client requests, load balancing is an important technique to evenly distribute the requests to web servers. In this paper, we propose a framework called Mobile Agent based LoaD balancing (MALD) that uses mobile agents technology to implement scalable load balancing on distributed web servers. The web servers can dispatch mobile agents to collect system-wide load information and accomplish load redistribution on all servers. Various load-balancing policies can be incorporated with versatile mobile agents in the framework. Compared with the traditional message-passing-based load-balancing methods, the mobile-agent-based approaches have the merits of high flexibility, low network traffic and high asynchrony. The performance evaluation demonstrates that the MALD framework provides a foundation to develop efficient load-balancing schemes on wide range of web server systems from cluster to the Internet.
The readiness of IDSC to adopt knowledge management
Authors: Ahmed Abdel Kader Hussein, Khaled Wahba
Venue: Knowledge management: current issues and challenges (2003)

Over the last two years Knowledge Management has become the latest hot topic in the business world. Companies are realizing that their competitive edge is mostly the brain power or intellectual capital of their employees and management. Many organizations are drowning in information, but starving for knowledge. In order to stay ahead of the pack, organizations must leverage their knowledge internally and externally to survive. Knowledge management is believed to be the current savior of organizations. Creative and innovative people form the core of any organization. In turn, those people form the corporate memory. The Information Decision Support Center for the Cabinet of Ministers for the Egyptian Government (IDSC) faces a problem of employees' high turnover rate (17%), which threatens to cause IDSC to lose its memory. One common mistake many organizations make when they implement KM initiatives is to place too much emphasis on the technological aspect of KM and ignore the human resources aspects. IDSC developed a knowledge management system called the Organizational Memory (http://www.home.idsc.gov.eg/), but ignored the human factor of KM. The purpose of this chapter is to test the readiness of employees and managers working at IDSC to adopt knowledge management. Human issues were clearly shown to outweigh any technology constraints, and views of managers and employees differed to some extent. It is recommended that these human and managerial concerns be addressed if KM is to be successful in organizations.
The Inevitability of Reconfigurable Systems
Authors: Nick Tredennick
Venue: Queue (2003)

The introduction of the microprocessor in 1971 marked the beginning of a 30-year stall in design methods for electronic systems. The industry is coming out of the stall by shifting from programmed to reconfigurable systems. In programmed systems, a linear sequence of configuration bits, organized into blocks called instructions, configures fixed hardware to mimic custom hardware. In reconfigurable systems, the physical connections among logic elements change with time to mimic custom hardware. The transition to reconfigurable systems will be wrenching, but this is inevitable as the design emphasis shifts from cost performance to cost performance per watt. Here’s the story.
Knowledge base internet search for construction and real estate information system
Authors: Chung Kit Pang
Venue:  (2002)

Information is at the centre of the construction and real estate management. In the past, construction professionals have to go through tedious operations to find the relevant information in need. This thesis presents a feasible solution to solve the problem stated. Nowadays information is increasingly available in web format that can be reviewed via browsers. However surfing the Internet is perceived as inefficient and ineffective for professional use. Search engines are used instead to find the required information based on user's specification (often in words). Based on techniques established in pattern recognition and experience of using knowledge bases in intelligent applications, the knowledge base approach has been proposed to significantly increase the usefulness and effectiveness of search engines used in the area of professional applications. The knowledge base approach has the advantages of being more relevant to user and adaptable to shift in environmental parameters. A prototype system was built to illustrate the knowledge base Internet search approach. It was observed that feature vectors had been successfully used in searching for the underlying texts. Search results were accumulated and processed for new knowledge. The acquired new knowledge was found to be useful in enhancing the relevancy of subsequent search process. Practically the knowledge base approach can be used unattended to automatically generate new and relevant knowledge for professional users.
On the composition of Java frameworks control-flows
Authors: Ana C. V. de Melo, Bruno M. Moutinho
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Object oriented programming languages provide, in principle, mechanisms to enhance code reuse, As an effort of designing object oriented software, design patterns and frameworks are recognised as good techniques for reuse. Frameworks are of particular interest as design and code reuse are achieved. Despite of that, most frameworks were designed to be adapted to applications and not to be composed with other frameworks. As a result, problems such as control-flow composition, legacy components composition, frameworks gap, entities overlap and composition of frameworks behaviour arise. The present work is a study on the composition of Java frameworks control-flows, where a third framework is created from two existing ones. With this study we have checked the potential problems that may appear as two control-flows are composed via message passing.
Graph algorithms for assembling integrated genome maps
Authors: Anthony Bonner
Venue:  (2003)

This dissertation is a computational study in the field of bioinformatics, a relatively new discipline at the intersection of computer science and biological science. As such, the dissertation contributes to each of these disciplines. The problems we address within biological science are in the area of physical mapping, i.e., mapping experimentally-produced fragments of a genome to their original locations in the genome. The thesis makes two primary contributions in this area: (i) a method to improve contig identification and verification, and (ii) a method which improves contig formation by uniformly integrating probe and overlap data. The problems addressed within computer science arise in the above application and are in the area of heuristic graph algorithms. The thesis makes three primary contributions in this area: (i) a modification of a well-known algorithm for listing maximal cliques, which markedly improves its efficiency on large, sparse graphs; (ii) a new clustering algorithm which is appropriate for &ldquo;noisy&rdquo; interval graphs; and (iii) a method which reveals piecewise linearity in a noisy interval graph. The methods and algorithms are tested on human genome mapping data and also on simulated data. The results from applying our structure graph algorithm to Sequenced Tag Site (STS) mapping data reveal a network-like pattern where linear segments often correlate with data from continuous pieces (contigs) of the genome. The underlying interval graph nature of the probe mapping data is thus revealed, thereby facilitating identification and extraction of contigs. Results from the application of our &ldquo;virtual probe&rdquo; technique for integrating probe and overlap data indicate that this method can produce longer double-linkage contigs than STS probes alone, and that it provides a new way of assessing overlap data. Results of experiments on enumeration of cliques in large, sparse graphs representing genome mapping data show that our modification of the Bron-Kerbosch algorithm requires time which is approximately linear in the number of vertices, whereas other tested algorithms had worse than linear time complexity. Results from tests of the clustering algorithm on simulated noisy overlap data indicate that it effectively counters the increase in clique numbers caused by false negatives.
Securely sharing neuroimagery
Authors: Kenneth Smith, Vipin Swarup, Sushil Jajodia, Donald Faatz, Todd Cornett, Jeff Hoyt
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Shared scientific data, such as neuroimagery, offers great benefits to science. However, data owners must exercise custodial responsibilities which can conflict with the unhindered sharing of their data. Given simple choices of sharing widely or not at all, the result will frequently be no sharing. We hypothesize that neuroimagery sharing will be enhanced if data owners are provided with well-defined intermediate levels of data visibility. In this paper, we describe a broadly applicable data sharing model, Structured Sharing Communities (SSC), in which data becomes incrementally visible to communities structured as a complete partial-order; the associated properties of Privacy and Fairness regulate access to shared data. Within SSC, a customized policy space is defined capturing the sharing relationships among specific collaborators.
Proof of the Van den Berg&ndash;Kesten Conjecture
Authors: David Reimer
Venue: Combinatorics, Probability and Computing (2000)

We prove the following conjecture of J. van den Berg and H. Kesten. For any events Ascr; and Bscr; in a product probability space, Prob( Ascr;□ Bscr;) &le; Prob( Ascr;)Prob( Bscr;), where Ascr;□ Bscr; is the event that Ascr; and Bscr; occur disjointly.
Software Implemented Fault Injection for Safety-Critical Distributed Systems by Means of Mobile Agents
Authors: Thomas M. Galla, Karin A. Hummel, Roman Pallierer
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

The availability of inexpensive powerful microprocessors leads to increasing deployment of those electronic devices in ever new application areas. Currently, the automotive industry considers the replacement of mechanical or hydraulic implementations of safety-critical automotive systems (e.g., braking, steering) by electronic counterparts (so-called "by-wire systems") for safety, comfort, and cost reasons.In order to remain operational in the presence of faults, these kinds of systems are built as fault-tolerant distributed real-time systems consisting of interconnected control units. To assure the correct operation of the fault tolerance mechanisms, software implemented fault injection provides low cost and easy to control techniques to test the system under faulty conditions.In this paper we propose a distributed software implemented fault injection framework based on the mobile agent approach. Software agents are designed to utilize the real-time system's global time and messages to trigger the fault injection experiments. We introduce a lightweight agent implementation language to model the fault injection and the concerned system resources, agent migration and logging of the fault injection experiments.We argue the feasibility of our approach by applying it to a "drive-by-wire" application. Here, incorporating the fault injection software in a mobile agent provides a clear separation of the fault injection software from the application software. Thus, the fault injection code is easily exchangeable -- providing means to inject different faults -- and can be removed smoothly from the production system after the test run is completed.
Using GMDH in ecological and socio-economical monitoring problems
Authors: Ljudmila Sarycheva
Venue: Systems Analysis Modelling Simulation (2003)

Geographically distributed and time-phased ecological and socio-economical indices are treated as source data for the analysis, carried out for taking reasoned management decision. Analysis complexity, related to multi-dimensional data is overcome thanks to using group methods of data handling (GMDH). This work shows the results of Ukraine's regions cluster analysis by the totality of ecological and socio-economical indices. These results are visualized as homogeneity classes' map in geographic information system.
Women in computing programs: does the incredible shrinking pipeline apply to all computing programs?
Authors: Cindy Randall, Barbara Price, Han Reichgelt
Venue: ACM SIGCSE Bulletin (2003)

Despite the fact that demand for employees with skills in computing still exceeds supply, there has been a steady decline in the number of women entering and graduating from computer science programs. Many attempts have been made to remedy the situation. A recurrent theme for both engineering and computer science programs is that programs can be made more attractive to women if they place a greater emphasis on applications of the technology. To date, most of the research on the under-representation of women has been conducted on computer science programs, and ignores the fact that many students enter the IT workplace with degrees in Information Systems (IS) or Information Technology (IT). Moreover, programs in IS and IT place a greater emphasis on applications. Given the reported importance of applications for the recruitment and retention of women, one might expect to see a higher participation of women in these programs. Using data obtained from baccalaureate or above institutions within the University System of Georgia, this paper shows that this indeed seems to be the case.
A framework for analyzing the cognitive complexity of computer-assisted clinical ordering
Authors: Jan Horsky, David R. Kaufman, Michael I. Oppenheim, Vimla L. Patel
Venue: Journal of Biomedical Informatics (2003)

Computer-assisted provider order entry is a technology that is designed to expedite medical ordering and to reduce the frequency of preventable errors. This paper presents a multifaceted cognitive methodology for the characterization of cognitive demands of a medical information system. Our investigation was informed by the distributed resources (DR) model, a novel approach designed to describe the dimensions of user interfaces that introduce unnecessary cognitive complexity. This method evaluates the relative distribution of external (system) and internal (user) representations embodied in system interaction. We conducted an expert walkthrough evaluation of a commercial order entry system, followed by a simulated clinical ordering task performed by seven clinicians. The DR model was employed to explain variation in user performance and to characterize the relationship of resource distribution and ordering errors. The analysis revealed that the configuration of resources in this ordering application placed unnecessarily heavy cognitive demands on the user, especially on those who lacked a robust conceptual model of the system. The resources model also provided some insight into clinicians' interactive strategies and patterns of associated errors. Implications for user training and interface design based on the principles of human-computer interaction in the medical domain are discussed.
Teaching computer security at a small college
Authors: Cathie LeBlanc, Evelyn Stiller
Venue: ACM SIGCSE Bulletin (2004)

Computer and network security are important topics for computer professionals in US companies today. An adequate education in these topics would probably involve several classes at the undergraduate level but many computer science curricula do not have room to have numerous required courses. In addition, most computer science faculty members have not taken classes covering these topics and have never worked as professionals dealing with these areas. Dealing with these difficult issues can be a challenge, especially in a small college environment. In this paper, we present our experiences teaching computer security topics in both a system administration course and a computer security course.