ppxscal/embedding_network huggingface dataset:
A flexible GUI design system
Authors: S. D. Mullerworth
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

The Generic Hierarchical User Interface (GHUI) is a design package for creating forms-based user interfaces and was written at the UK Meteorological Office. The intention is that the package is simple enough, that a basic, working interface can be written quickly by developers with little experience of the package, but that later, the interface can be enhanced by incorporating application specific code. Generic functions provided by the GHUI include a client/server database system that allows users to save and copy work, a hierarchical tree widget for navigating with ease among a large number of windows, a flexible function for processing users' input into a text format that is suitable for controlling the related application, a function for creating uncomplicated input windows containing standard text, entry box, button and table widgets, and an error checking facility to prevent input of invalid responses. Application specific functions can be added to provide, for example, additional input validation checking or non-standard input windows.
Minimal factorization of lapped unimodular transforms
Authors: See-May Phoong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The lapped orthogonal transform (LOT) is a popular transform and has found many applications in signal processing. Its extension, the biorthogonal lapped transform (BOLT), has been investigated in detail by Vaidyanathan and Chen (see IEEE Trans. Signal Processing, p.1103-15, 1995). In this paper, we study the lapped unimodular transform (LUT). All of these three transforms are first-order matrices with FIR inverses. We show that like LOT and BOLT, all LUTs can be factorized into degree-one unimodular matrices. The factorization is both minimal and complete. We also show that all first-order systems with FIR inverses can be minimally factorized as a cascade of degree-one LOT, BOLT, and unimodular building blocks. However unlike LOT and BOLT, unimodular filter banks of any order (which include LUTs as a special case) can never have linear phase.
Note: Simple abelian quadruple systems
Authors: Akihiro Munemasa, Masanori Sawa
Venue: Journal of Combinatorial Theory Series A (2007)

We generalize a construction of simple cyclic 3-designs due to Kohler (1981) to that of simple abelian 3-designs. We prove that for any abelian group A of order v=2(mod4), there exists a simple 3-(v,4,3) design with A@?Aut(A) as an automorphism group.
A leader-based parallel cross entropy algorithm for MCP
Authors: Zhanhua Bai, Qiang Lv
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross Entropy algorithm faster, this paper proposes a leader-based cooperative parallel algorithm. Unlike the widely used coarse-grained parallelization strategy, our method has a leader, which can move around freely, and several controlled followers. To evaluate the performance of the algorithm, we implement our algorithm using OpenMPI on MIMD architecture, and has applied it on 25 selected MCP benchmark problems. The speedup and efficiency is analyzed, and the results obtained are compared with those obtained by four other best heuristic algorithms, GLS, Edge-AC+LS, EA/G and RLS.
New constraint-optimized multiuser detector for asynchronous CDMA channels with multipath
Authors: Gaonan Zhang, Guoan Bi, Yuanxin Zhang
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A constrained optimized multiuser detector for asynchronous CDMA Channel is presented. It is shown that the solution of the proposed detector is equal to the decorrelating detector with more simple implementation, while no channel estimation is necessary except for the synchronization of the desired user. Simulation results demonstrate that the proposed detector achieves good performance when the multipath length is short.
Stepping off the paper trail? rethinking the mainframe era at the public archives of canada
Authors: Betsey Baldwin
Venue:  (2006)

During the 1960s and 1970s, Canadians increasingly used computers and computerized processes for government and business purposes. By the 1980s, some began to have personal computers at home. This thesis examines the experiences of emerging computerization by focusing on the Public Archives of Canada during this period.The 1960s saw the first computer projects at the Public Archives, although these efforts had mixed reviews. Many archivists feared that automated information retrieval would compromise the quality of their service, and professional position, while others argued that computers were a necessary efficiency to meet the growing demands on their institution. Overall, the decade of the 1960s was one in which many archivists encountered computers, computerized processes and computer records for the first time, and they responded with a range of feelings and reactions.By the outset of the 1970s, a select group of advocates proposed the concept of a Machine Readable Archives. When the creation of this division was approved in 1973, its staff members formed a distinct professional community within the Public Archives. They held a complex position as the computer "haves" of the federal archives and records management community, and the relative "have nots" in their communication with departmental computer personnel. The Machine Readable Archives became the hub of attempted communication and cooperation among all of these players, during the period of major technological development during the 1970s and early 1980s.By the time of the Machine Readable Archives' closure in 1986, computers were frequently used as an archival tool. A survey among archival leaders in the mid-1980s concluded that archivists, once a technologically conservative profession, had not only adopted the use of computers into their repositories, but most of them were optimistic about their profession's role in the evolving technological environment.Archivists' changing views of computers paralleled the increasing acceptance and familiarity of computer technology within Canadian society. To accommodate computerization, many Canadians adapted their work processes, and negotiated new work relationships. In Canada during these years, individuals responded to computers, personally and professionally, in complex and contradictory ways that reflected both reservations and excitement. The Public Archives of Canada, and especially the Machine Readable Archives, provide a significant focus to analyse this dynamic and changing milieu as Canadians engaged with the technological and cultural transformations of the era.
ITHERM 2000. The Seventh Intersociety Conference on Thermal and Thermomechanical Phenomena in Electronic Systems (Cat. No.00CH37069)
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The following topics were dealt with: interfaces and contacting surfaces; flow network modelling; MEMS; heat sinks; thermal modelling; space systems; conduction fundamentals; mechanics simulation; heat pipes; convection; solder joint reliability; power electronics; and phase change materials. 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
Optimizing Peer Relationships in a Super-Peer Network
Authors: Pawel Garbacki, Dick H. J. Epema, Maarten van Steen
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Super-peer architectures exploit the heterogeneity of nodes in a P2P network by assigning additional responsi- bilities to higher-capacity nodes. In the design of a super- peer network for file sharing, several issues have to be ad- dressed: how client peers are related to super-peers, how super-peers locate files, how the load is balanced among the super-peers, and how the system deals with node failures. In this paper we introduce a self-organizing super-peer net- work architecture (SOSPNET) that solves these issues in a fully decentralized manner. SOSPNET maintains a super- peer network topology that reflects the semantic similarity of peers sharing content interests. Super-peers maintain se- mantic caches of pointers to files which are requested by peers with similar interests. Client peers, on the other hand, dynamically select super-peers offering the best search per- formance. We show how this simple approach can be em- ployed not only to optimize searching, but also to solve gen- erally difficult problems encountered in P2P architectures such as load balancing and fault tolerance. We evaluate SOSPNET using a model of the semantic structure derived from the 8-month traces of two large file-sharing communi- ties. The obtained results indicate that SOSPNET achieves close-to-optimal file search performance, quickly adjusts to changes in the environment (node joins and leaves), sur- vives even catastrophic node failures, and efficiently dis- tributes the system load taking into account peer capacities.
Visualising Collaboration: Qualitative Analysis of an Email Visualisation Case Study
Authors: Onn Azraai Puade, Theodor G. Wyeld
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper reports on continuing work on visualising email collaboration [11]. It reports on the reinterviewing of participants of a previous email collaboration visualisation study regarding the identification of key players. Participants were asked to comment on the finding of key player impact on the collaboration as determined by our analysis and methods. We found, while they mostly agreed with our analysis they expressed reservations regarding the methods used. This forms the ground work for yet further work in developing a real-time visualisation tool for email-mediated collaboration. The qualitative analysis case-study method used in this study helped gain a deeper understanding of the nature and characteristic of the collaboration that would otherwise have been hidden in a quantitative analysis.
Types for Access Control in a Calculus of Mobile Resources
Authors: Hans Hüttel, Morten Kühnrich
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper presents a type system for the calculus of Mobile Resources (MR) proposed by Godskesen et al. The type system is able to prevent undesirable border-crossing behaviour such as Trojan horses. This is achieved by combining the notion of group with a notion of security policy. Well-typed processes satisfy a safety property which is preserved under reduction. An algorithm is presented which computes the minimal security policy making a process well typed.
Samplify: Real-time Compression for Electronic Measurements
Authors: Al Wegener
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Compression has not been used for high-speed electronic measurement system for two primary reasons. First, electronic measurements cannot use speech, audio, image, and video compression algorithms that exploit characteristics of human hearing and vision. These characteristics are irrelevant & inappropriate for electronic measurements. Second, electronic measurements often require real-time performance of hundreds of megasamples per second. Existing compression algorithms do not scale cost-effectively to such rates. Furthermore, they usually do not offer both lossless and lossy compression.
Improving RAID-5 Performance by Un-striping Moderate-Sized Files
Authors: Ronald K. McMurdy, Badrinath Roysam
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

A method to reduce the average operation time, and increase the transfer rate of RAID-5 disk arrays is presented, along with quantitative models for these paramaers as a funcrion of load. The modified controller allocates moderate sized files (1-20 sectors), and parity information for groups of consecutive sectors, entirely on one disk, avoiding the compounding of latency and queuing delaysfor multiple disks.
Segmentation of textures defined on flat vs. layered surfaces using neural networks: Comparison of 2D vs. 3D representations
Authors: Sejong Oh, Yoonsuck Choe
Venue: Neurocomputing (2007)

Texture boundary detection (or segmentation) is an important capability in human vision. Usually, texture segmentation is viewed as a 2D problem, as the definition of the problem itself assumes a 2D substrate. However, an interesting hypothesis emerges when we ask a question regarding the nature of textures: What are textures, and why did the ability to discriminate texture evolve or develop? A possible answer to this question is that textures naturally define physically distinct (i.e., occluded) surfaces. Hence, we can hypothesize that 2D texture segmentation may be an outgrowth of the ability to discriminate surfaces in 3D. In this paper, we conducted computational experiments with artificial neural networks to investigate the relative difficulty of learning to segment textures defined on flat 2D surfaces vs. those in 3D configurations where the boundaries are defined by occluding surfaces and their change over time due to the observer's motion. It turns out that learning is faster and more accurate in 3D, very much in line with our expectation. Furthermore, our results showed that the neural network's learned ability to segment texture in 3D transfers well into 2D texture segmentation, bolstering our initial hypothesis, and providing insights on the possible developmental origin of 2D texture segmentation function in human vision.
Generating war game strategies using a genetic algorithm
Authors: T. E. Revello, R. McCartney
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Unlike most games which have fixed rules, the rules for war games can contain uncertainty. This uncertainty makes war games difficult to address with methods typically used for playing games by machine. The characteristics of war games match well with the domain for which genetic algorithms are effective. We explore the use of genetic algorithms for generating war game strategies.
Sharing visual information in virtual environments using projective texture mapping
Authors: Yannick Francken, Johan Huysmans, Philippe Bekaert
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We present a method for sharing visual information in 3D virtual environments, using a projective texture mapping based method. Avatars can share information with other avatars by projecting relevant information into the environment. In addition to standard projective texture mapping, an important depth cue is added: projected light is attenuated in function of the light-travel distance. This is efficiently accomplished on a per vertex basis by adaptively super-sampling under-sampled polygons. This way, the projection quality is maximized while keeping a fixed frame rate. Our technique is implemented into the Quake III engine, extending its shading language with GLSL fragment and vertex shaders.
Cross layer techniques to secure peer-to-peer protocols for location, adjacency, and identity verification
Authors: Mart Molle
Venue:  (2006)

In the virtual world of networked electronic services, finding the physical location of a device, or determining the properties of the link between two devices, might be as important as knowing their identities. Consider, for example, a sensor whose role is counting traffic at some location, or the link between a proximity card and its reader. Moreover, since there is no compulsion to believe a device (called prover), its location should be independently computable by its neighbors (called verifiers). Thus, the goal of our work is to develop a set of techniques for merging the concepts of "identity authentication" with either "location authentication" or "adjacency authentication" into a single peer-to-peer protocol. First, we study the problem of improving the accuracy with which a higher-layer protocol entity (running in software on an ordinary computer system, say) can determine the time-of-arrival for a particular packet and/or the inter-arrival time between a particular packet pair. We show that by making a few minor changes to the network card and its software interface to the operating system device driver, the protocol entity can easily obtain this information, offline, with reference to the high-precision clock maintained by the physical layer in its own network card. Next, we propose two methods for reducing timing errors related to the prover's response processing delay. For wired network connections (such as full-duplex Ethernet links), we propose a physical layer assisted approach, which reduces this delay to its theoretical minimum (i.e., one inter-symbol time on the link), and forces the prover to send its response simultaneously and at the identical data rate with the incoming challenge. For wireless networks (such as 802.11 networks), we propose a multi-verifier approach that completely eliminates that delay from the position computation. However, any measurement might involve unintended errors; we found that, in positioning, same magnitude of measurement error leads to different amount positioning error depending on the relative location of the participants. Finally, we propose the Principle of Partial Response (PPR), which is a novel technique for binding together existing methods for identity authentication with a new protocol for solving the "proof-of-adjacency" problem between two peer nodes.
Declarative reasoning about moving objects
Authors: Dana S. Nau
Venue:  (2006)

There are numerous applications where there is a critical need to reason about moving object plans under uncertainty. Previous work on spatio-temporal logics is limited to qualitative approaches and the work on spatio-temporal databases focus on the observations ignoring the intended movements of the objects. This thesis presents a Logic of Motion (LOM), a novel theory and algorithms that combine logic, constraint satisfaction and geometric reasoning. LOM provides a declarative syntax and model theory and formalizes how to reason about planned movements of objects, when there is uncertainty. LOM is the first quantitative logical treatment of moving objects that can account for the fact that we are not always sure when an object will leave or arrive a given location, and what its velocity will be. The thesis includes the following contributions: (1) LOM, the first quantitative logic to reason about flexible plans for moving objects. (2) An analysis of the computational complexity of reasoning with flexible plans for moving objects. This analysis includes an important theoretical result showing that complexity of consistency checking for LOM theories is at least NP-hard. I also provide algorithms to check consistency of a fraction of LOM theories called go-theories. (3) A class of motion theories, called Simple Go-Theories that are tractable. (4) Efficient algorithms to answer ground and non-ground queries in LOM concerning the possible location of the object and its proximity to other objects. (5) A study of default reasoning for motion-theories. It presents a motion closed world assumption for LOM that restrict the reasoning within a class of preferred models of the theory. Motion closed world assumption allows us to make more intelligent and customized inferences. (6) An investigation of deconfliction of motion-theories with respect to some integrity constraints. A deconfliction of a theory is a modification to the theory such that any model of the modified theory will entail the integrity constraints. I present an algorithm for efficiently computing a deconfliction of a theory. (7) Extensive empirical evaluation to demonstrate the efficiency of consistency checking, query answering and deconfliction algorithms.
Nonmonotonic inductive logic programming by instance patterns
Authors: Chongbing Liu, Enrico Pontelli
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

In this paper, we present a new approach, called NM-ILP-IP, for inductive learning in the context of nonmonotonic logic frameworks. This approach is based on the notations of concept instances and instance patterns introduced in [13]. When a strictly correct Horn theory cannot be induced, this approach induces a normal logic program, by specializing a previously learned overly-general theory. The advantages of this approach over others include: (a) it does not rely on existing ILP systems, and it avoids many of the effectiveness and efficiency drawbacks of ordinary ILP systems; (b) no theorem prover is needed during the learning process; (c) it introduces negation as failure (NAF) of existing predicates and introduces new abnormality predicates only when necessary, making the final theory more compact.
Speaker recognition in two-speaker data: recent results from Dragon Systems
Authors: F. Weber
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

NIST has introduced two-speaker tasks in its Speaker Recognition evaluation scheme. We discuss Dragon Systems' explorations of these tasks using a GMM-based speaker ID system. We present baseline results submitted for the NIST two-speaker evaluation in April 1999. We also report on some "cheating" experiments and investigations of alternative segmentation and channel normalization techniques, which illuminate some challenges specific to the two-speaker environment.
Exact polynomial system solving for robust geometric computation
Authors: Donald Friesen, John Keyser
Venue:  (2006)

I describe an exact method for computing roots of a system of multivariate polynomials with rational coefficients, called the rational univariate reduction. This method enables performance of exact algebraic computation of coordinates of the roots of polynomials. In computational geometry, curves, surfaces and points are described as polynomials and their intersections. Thus, exact computation of the roots of polynomials allows the development and implementation of robust geometric algorithms. I describe applications in robust geometric modeling. In particular, I show a new method, called numerical perturbation scheme, that can be used successfully to detect and handle degenerate configurations appearing in boundary evaluation problems. I develop a derandomized version of the algorithm for computing the rational univariate reduction for a square system of multivariate polynomials and a new algorithm for a non-square system. I show how to perform exact computation over algebraic points obtained by the rational univariate reduction. I give a formal description of numerical perturbation scheme and its implementation.
A Metric for Paraphrase Detection
Authors: Joao Cordeiro, Gael Dias, Pavel Brazdil
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

Monolingual text-to-text generation is an emerging research area in Natural Language Processing. One reason for the interest in such generation systems is the possibility to automatically learn text-to-text generation strategies from aligned monolingual corpora. In this context, paraphrase detection can be seen as the task of aligning sentences that convey the same information but yet are written in different forms, thereby building a training set of rewriting examples. In this paper, we propose a new metric for unsupervised detection of paraphrases and test it over a set of standard paraphrase corpora. The results are promising as they outperform state-of-the-art measures developed for similar tasks.