ppxscal/embedding_network huggingface dataset:
Impact of Time-Based Visualization on Situation Awareness
Authors: Mariëlle den Hengst, Michael McQuaid, Jiang Zhu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

We have developed a time-based visualization system and tested it in accordance with a well-developed theory of situation awareness during a simulation of an actual emergency. The client-server system is fed by a collaborative server, and uses linguistic parsing, suffix tree clustering, and multidimensional scaling to develop a changing picture of textual data related to an unfolding event. We provide a detailed account of situation awareness theory and use it to explain the effect of the visualization on perceptions of facts, comprehension of the situation, and projection of near term status. We developed a simulation of a tragic shooting atthe University of Arizona, performing requirements elicitation of officials involved in the actual event, and preparing a repeatable scenario based on, but differing from, the event. We ran the simulation with about 200 management students, half of whom used the visualization system and half of whom used a competing text-based system, and found that the visualization system aided comprehension and projection, but had no effect on perception of facts.
Object Recognition Using Local - Global Graphs
Authors: N. Bourbakis, P. Yuan, S. Makrogiannis
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

This paper presents a methodology for object recognition using the Local - Global (L-G) Graphapproach. In particular, the L-G graph approach based on an image segmentation approach and synthesis of the regions that compose an object. The synthesis of regions is based on the L-G modeling that compares a set of L-G based object models sitting in an L-G Database. The methodology accurate for objects existed in the DB and it has the ability of "learning". Illustrative examples are also provided.
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Authors: Jianyong Wang, Jiawei Han, Jian Pei
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Mining frequent closed itemsets provides complete and non-redundant results for frequent pattern analysis. Extensive studies have proposed various strategies for efficient frequent closed itemset mining, such as depth-first search vs. breadthfirst search, vertical formats vs. horizontal formats, tree-structure vs. other data structures, top-down vs. bottom-up traversal, pseudo projection vs. physical projection of conditional database, etc. It is the right time to ask "what are the pros and cons of the strategies?" and "what and how can we pick and integrate the best strategies to achieve higher performance in general cases?"In this study, we answer the above questions by a systematic study of the search strategies and develop a winning algorithm CLOSET+. CLOSET+ integrates the advantages of the previously proposed effective strategies as well as some ones newly developed here. A thorough performance study on synthetic and real data sets has shown the advantages of the strategies and the improvement of CLOSET+ over existing mining algorithms, including CLOSET, CHARM and OP, in terms of runtime, memory usage and scalability.
Facilitating knowledge discovery by integrating bottom-up and top-down knowledge sources: a text mining approach
Authors: Gondy A. Leroy
Venue:  (2003)

This dissertation aims to discover synergistic combinations of top-down (ontologies), interactive (relevance feedback), and bottom-up (machine learning) knowledge encoding techniques for text mining. The strength of machine learning techniques lies in their coverage and efficiency because they can discover new knowledge without human intervention. The output, however, is often imprecise and irrelevant. Human knowledge, top-down or interactively encoded, may remedy this. The research question addressed is if knowledge discovery can become more precise and relevant with hybrid systems. Three different combinations are evaluated. The first study investigates an ontology, the Unified Medical Language System (UMLS), combined with an automatically created thesaurus to dynamically adjust the thesaurus' output. The augmented thesaurus was added to a medical, meta-search portal as a keyword suggester and compared with the unmodified thesaurus and UMLS. Users preferred the hybrid approach. Thus, the combination of the ontology with the thesaurus was better than the components separately. The second study investigates implicit relevance feedback combined with genetic algorithms designed to adjust user queries for online searching. These were compared with pure relevance feedback algorithms. Users were divided into groups based on their overall performance. The genetic algorithm significantly helped low achievers, but hindered high achievers. Thus, the interactively elicited knowledge from relevance feedback was judged insufficient to guide machine learning for all users. The final study investigates ontologies combined with two natural language processing techniques: a shallow parser and an automatically created thesaurus. Both capture relations between phrases in biomedical text. Qualified researchers found all terms to be precise; however, terms that belonged to ontologies were more relevant. Parser relations were all precise. Thesaurus relations were less precise, but precision improved for relations that had their terms represented in ontologies. Thus, this integration of ontologies with natural language processing provided good results. In general, it was concluded that top-down encoded knowledge could be effectively integrated with bottom-up encoded knowledge for knowledge discovery in text. This is particularly relevant to business fields, which are text and knowledge intensive. In the future, it will be worthwhile to extend the parser and also to test similar hybrid approaches for data mining.
Making chalk and talk accessible
Authors: S. Bennett, J. Hewitt, D. Kraithman, C. Britton
Venue: Issue 73-74 (June-September 2002) (2002)

This paper investigates the development of an authoring package designed to mimic traditional "chalk and talk" delivery of content in education. It emphasizes the twin goals of making the output more accessible both for those with disabilities and for distance learners and also making the package usable by academic staff without requiring extensive training. It deals with issues arising from the capture of the material, the compromises and conflicts which are made in the satisfaction of accessibility guidelines and the implementation problems which arise. An authoring tool designed specifically for the production of accessible multimedia material is described as is preliminary work being undertaken to provide live subtitles of lectures.
Adapting Peer-to-Peer Topologies to Improve System Performance
Authors: Paul Silvey, Laurie Hurwitz
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Proposals for improving the performance of Peer-to-Peer file sharing systems like Gnutella often simply involve changes to the distributed search protocol. Since the effectiveness of any routing protocol is dependent on the P2P overlay network's interconnection topology, simultaneously controlling the network topology should enable performance enhancements as well. We consider how locally adaptive behaviors can lead to globally robust, scalable, and efficient P2P networks. We adapt topologies using operations of edge thinning, the removal of redundant links based on message passing utilities, and diameter folding, the selective addition of short-cut links between nodes at or near the diameter of the graph. Using network simulations, we establish how these locally selfish behaviors might help explain the ubiquitousnatural occurrence of scale-free networks, and demonstrate how P2P networks that adapt their topologies toward more regular degree distributions improve in both performance and robustness.
Gait malfunction identification and classification
Authors: Dieter Merkl
Venue: ACM SIGBIO Newsletter (1998)

Based on data recorded with ground reaction force measurement platforms we are working towards a tool for human gait malfunction identification. The data is recorded with patients during their stay at an Austrian rehabilitation centre after injuries to their locomotive system. Issues of interest are the representation of ground reaction force data for subsequent identification of gait malfunctions and tools for the identification and classification of gait malfunctions. So far we were primarily interested in evaluating different architectures of artificial neural networks to perform that task.
Affine transformations for multi-dimensional signal processing on ASIC regular arrays
Authors: Jan Rosseel, Michaël van Swaaij, Francky Catthoor, Hugo De Man
Venue: Proceedings of the conference on European design automation (1991)

In this paper the problems involved with high-level synthesis of ASIC regular arrays for multi-dimensional signal processing applications will be outlined. Our goal is to map non uniform recurrence equations on regular arrays with realistic constraints on area, throughput and I/O bandwidth.Algorithms for multi-dimensional signal processing often involve a a large number of indices. In this paper, novel techniques are presented that are needed to map these multi-index algorithms onto regular arrays with limited dimension.
No name: just notes on software reuse
Authors: Robert Biddle, Angela Martin, James Noble
Venue: ACM SIGPLAN Notices (2003)

In the beginning, so our myths and stories tell us, the programmer created the program from the eternal nothingness of the void. In this essay, we recognise that programs these days are like any other assemblage, and suggest that in fact programming has always been about reuse. We also explore the nature of reuse, and claim that Components themselves are not the most important consideration for reuse; it is the end product, the composition. The issues still involve value, investment, and return. But pervasive reuse promotes a change in the method of construction of the program, and in the program itself.
Language emulator, a helpful toolkit in the learning process of computer theory
Authors: Luiz Filipe M. Vieira, Marcos Augusto M. Vieira, Newton J. Vieira
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Language Emulator, written in Java, is a toolkit to help undergraduate students to understand the concepts of Automata Theory. The software allows the manipulation of regular expressions, regular grammars, deterministic finite automata, nondeterministic finite automata with and without lambda transitions, and Moore and Mealy machines. Language Emulator introduces error-detecting and internationalization functionalities into automata tools. It has been accepted by 95% of students in a recent survey, indicating that it is a helpful toolkit in learning Automata Theory.
Sparse LCS common substring alignment
Authors: Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
Venue: Information Processing Letters (2003)

The "Common Substring Alignment" problem is defined as follows. The input consists of a set of strings S1, S2...,Sc, with a common substring appearing at least once in each of them, and a target string T. The goal is to compute similarity of all strings Si with T, without computing the part of the common substring over and over again.In this paper we consider the Common Substring Alignment problem for the LCS (Longest Common Subsequence) similarity metric. Our algorithm gains its efficiency by exploiting the sparsity inherent to the LCS problem. Let Y be the common substring, n be the size of the compared sequences, Ly be the length of the LCS of T and Y, denoted |LCS[T, Y]|, and L be max{|LCS[T, Si]|}. Our algorithm consists of an O(nLy) time encoding stage that is executed once per common substring, and an O(L) time alignment stage that is executed once for each appearance of the common substring in each source string. The additional running time depends only on the length of the parts of the strings that are not in any common substring.
Open-ended system for high-level synthesis of flexible signal processors
Authors: D. Lanneer, F. Catthoor, G. Goossens, M. Pauwels, J. Van Meerbergen, H. De Man
Venue: Proceedings of the conference on European design automation (1990)

CATHEDRAL-2nd is a new synthesis environment, intended to be the follow-up of our current CATHEDRAL-II approach. It is tuned towards the mapping of complex medium sample rate DSP applications onto flexible microcoded architectures. An important novel feature, is the increase in architectural freedom. As opposed to the formerly predefined limited set of execution units (EXUs) in CATHEDRAL-II, the system supports more flexibility in the composition of EXUs. The paper treats the impact of this feature on scheduling, hardware assignment and memory management.
Mobile data communications in China
Authors: Xu Yan
Venue: Communications of the ACM (2003)

Despite hundreds of millions of paying mobile subscribers and enormous potential for many more, the key to prosperity is enticing them to pay for extra services like text messaging and IP telephony.
Conjugate orthogonal diagonal Latin squares with missing subsquares
Authors: Frank E. Bennett, Beiliang Du, Hantao Zhang
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

We shall refer to a diagonal Latin square which is orthogonal to its (3, 2, 1)-conjugate, and the latter is also a diagonal Latin square, as a (3, 2, 1)-conjugate orthogonal diagonal Latin square, briefly CODLS. This article investigates the spectrum of CODLS with a missing sub-square. The main purpose of this paper is two-fold. First of all, we show that for any positive integers n ≥ 1, a CODLS of order υ with a missing subsquare of order n exists if υ ≥ 13n/4 + 93 and υ - n is even. Secondly, we show that for 2 ≤ n ≤ 6, a CODLS of order υ with a missing subsquare of order n exists if and only if υ ≥ 3n + 2 and υ - n is even, with one possible exception.
Sound compositions for expanding musicianship education
Authors: Thomas A. Regelski
Venue: Organised Sound (2002)

Composing has been slighted at all levels of education. Following an analysis of the history and failure of compositional pedagogy for developing musicianship, a new rationale for such pedagogy is presented. This pedagogy is argued to be essential for preparing contemporary musicians and audiences to understand most properly what music &lsquo;is&rsquo; and &lsquo;is good for&rsquo;, and for promoting ever-new conceptions of &lsquo;music&rsquo; and of its evolving values. In addition to advancing general musicianship in relation to the standard repertory, the special contribution of pedagogy rooted in composing organised sound pieces is outlined in relation to a new praxial philosophy of music that is challenging the limited and limiting theory of music and its value provided by traditional aesthetic theory. The latter is seen to be a major impediment to new compositional modes that expand musical frontiers, while the praxial theory supports, as well as gains support from, various new attempts to organise sound for expressive and other purposes. 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
The existence of 2-SOLSSOMs
Authors: R. Julian R. Abel, F. E. Bennett
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

In this paper, we investigate the existence of two self-orthogonal Latin squares with a symmetric orthogonal mate (2-SOLSSOMs). It is found that a 2-SOLSSOM(υ) exists for all υ ≥ 701 with at most 183 possible exceptions below this value. Also given are six MOLS of orders 45, 55, five of which give 2-SOLSSOM(45) and 2-SOLSSOM(55).
A Genetic Algorithm for the Overlay Multicast Routing Problem
Authors: Yun Pan, Zhenwei Yu, Licheng Wang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, we analyze several models of overlay multicast routing problem, and bring forward a new model based on multi-objective programming, discussing the solution of the model simultaneously. Then we employ the Prüfer sequence as chromosome code and then propose a genetic algorithm to solve the model. Finally, we analyze the complexity of the algorithm.
4+4: an architecture for evolving the Internet address space back toward transparency
Authors: Zoltán Turányi, András Valkó, Andrew T. Campbell
Venue: ACM SIGCOMM Computer Communication Review (2003)

We propose 4+4, a simple address extension architecture for Internet that provides an evolutionary approach to extending the existing IPv4 address space in comparison to more complex and disruptive approaches best exemplified by IPv6 deployment. The 4+4 architecture leverages the existence of Network Address Translators (NATs) and private address realms, and importantly, enables the return to end-to-end address transparency as the incremental deployment of 4+4 progresses. During the transition to 4+4, only NATs and end-hosts need to be updated and not the network routers. The 4+4 architecture retains the existing semantics of Internet names and addresses, and only proposes simple changes to the network layer that focus entirely on address extension. Encapsulation is used as the main tool to maintain backward compatibility. We present the design, implementation, and evaluation of the 4+4 architecture and discuss our implementation experiences and results from local and wide-area Internet experimentation. The 4+4 source code is freely available from the Web (comet.columbia.edu/ipv44) for experimentation.
Proposals for Fortran data structures
Authors: David N. Smith
Venue: ACM SIGPLAN Notices (1977)

Three proposals for extensions to the Fortran language for data structuring are made. The first is similar to the STRUCTURE statement of IBM Fortran H [1]; no processor storage allocation function is required. The second is a variation of Hoare records [2] and the third is a variation of PL/I structures [3]. These three illustrate various posibilities and are hoped to be a basis for discussion of requirements which will lead to structuring facilities in the proposed Fortran standard. [4,6,7]
Structuring Information on the Web from Below: The Case of Educational Organizations in Chile
Authors: Ernesto Krsulovic-Morales, Claudio Gutiérrez
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

We present an ongoing work to help populate the Web with metadata by structuring and integrating information of organizations at a small scale. This is a natural complement to big scale projects to build the Semantic Web infrastructure We show an implementation for Computer Science departments in Chile, and present current work on educational organizations generalizing previous experience.
Gene expression temporal patterns classification with hierarchical bayesian neural networks and time lagged recurrent neural networks
Authors: Yulan Liang
Venue:  (2003)

DNA microarray technology allows simultaneous measurement of thousands of mRNA concentrations from a single cell across different conditions or over time. By systematically investigating thousands of genes in parallel and by monitoring the time dependence of expression levels we can study various patterns of gene expression profiles. Often cell functions and status can be determined from their patterns of expression. Highly accurate classification of gene patterns is crucial for revealing relationships among the genes and the genes with diseases in the presence of environmental hazards. Identification of subsets of relevant information (experimental conditions or genes), which include high correlations and overwhelming interactions is difficult, but critical. Handling the high level noise involved in the measurements and the presence of uncertainties in the modeling process pose further challenges for the task at hand. Moreover, microarray gene expressions typically follow multiple complicated dynamic patterns. These interesting challenges inspirited this thesis to investigate and explore automated learning systems with the combination of advanced statistical techniques to facilitate the characterization of large scale gene temporal patterns according to known functions of the relative gene expression. In this work, Hierarchical Bayesian Neural Networks and Time Lagged Recurrent Neural Networks with appropriate data preprocessing for information selection, noise estimation and reduction are presented for characterizing the multiple gene expression temporal patterns. We investigate Automatic Relevance Determination with Bayesian regularization algorithm and an algorithm, which employs dynamic trajectory learning with back-propagation through time to deal with dynamic data and other complicated features in order to avoid overtraining and improve the generalization performance. A new Hierarchical Bayesian Neural Network with correlated weight structure is developed and implemented to model the correlation of multidimensional gene data. With the hierarchical Bayesian setting, the network parameters and hyperparameters were simultaneously optimized. By optimizing regularized performance functions and statistical criteria, such as Bayesian Information Criteria, the optimal network architecture for modeling gene expressions is learned. The model performance of the proposed methods was compared to other popular machine learning methods such as Nearest Neighbor, Support Vector Machine, and Self Organized Map.