ppxscal/embedding_network huggingface dataset:
Effects of low & high literacy on user performance in information search and retrieval
Authors: Neesha Kodagoda, B L William Wong
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

This study was part of research into understanding the nature of how low literacy users search for and retrieve information, and to therefore develop systems and user interface designs that would empower low literacy users to find information they need in the rapidly evolving e-government and e-social services environment. We compared information search and retrieval performance between high and low literacy users of a Citizens Advice Bureau information kiosk system in the UK. The kiosk provided self-help information in a number of social services areas. Six high literacy and six low literacy users were presented with information search tasks classified as having low, medium and high complexity. Key results indicate that (i) low literacy users take eight times more time than high literacy users to complete an information search task, and yet were significantly less accurate, (ii) low literacy users on average spent one-third more time on a web page than high literacy users, but did not seem to be informed by it, (iii) low literacy users employed a much less focused information search strategy than high literacy users visiting eight times more web pages in total, (iv) low literacy users back-tracked 13 times more frequently than high literacy users, and are four times more likely to re-visit web pages, and (v) low literacy users are 13 times more likely to be lost than high literacy users.
A Novel Parallel Manipulator for Rotary Humanoid Wrist Based on Screw Theory
Authors: Guoxin Zhang, Song Zhu, Dachang Zhu, Cui Wu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

A class of parallel manipulators known as Rotary Humanoid Wrist (RHW), which is actuated by six circular motors on the circular base and dose not involve any prismatic joint, is analyzed based on screw theory. Model of RHW is build by using simulink tools with constant length limbs. The mobility of RHW is analyzed and the optimal combination of the main parameters for maximizing the workspace volume of RHW is also given
Generating priority rewrite systems for OSOS process languages
Authors: Irek Ulidowski, Shoji Yuen
Venue: Information and Computation (2009)

We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisimulation and head normalising. The algorithm is inspired by a procedure which was developed by Aceto, Bloom and Vaandrager and presented in Turning SOS rules into equations [L. Aceto, B. Bloom, F.W. Vaandrager, Turning SOS rules into equations, Information and Computation 111 (1994) 1-52]. For a subclass of OSOS process languages representing finite behaviours the PRSs that are generated by our algorithm are strongly normalising (terminating) and confluent, where termination is proved using the dependency pair and dependency graph techniques. Additionally, such PRSs are complete for bisimulation on closed process terms modulo associativity and commutativity of the choice operator of CCS. We illustrate the usefulness of our results, and the benefits of rewriting with priorities in general, with several examples.
Digraph Decompositions and Monotonicity in Digraph Searching
Authors: Stephan Kreutzer, Sebastian Ordyniak
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games --- underlying DAG- and Kelly-decompositions --- are non-monotone.Furthermore, we explore the limits of algorithmic applicability of digraph decompositions and show that various natural candidates for problems, which potentially could benefit from digraphs having small "directed width", remain NP-complete even on almost acyclic graphs.
A characterization of some distance-regular graphs by strongly closed subgraphs
Authors: Akira Hiraki
Venue: European Journal of Combinatorics (2009)

In this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pair of vertices at distance d-1 there exists a strongly closed subgraph of diameter d-1 containing them. We prove several inequalities for intersection numbers of ΓC. We show that if the equalities hold in some of these inequalities, then Γ is either the Odd graph, the doubled Odd graph, the doubled Grassmann graph, the Hamming graph or the dual polar graph.
As-if-serial exception handling semantics for Java futures
Authors: Lingli Zhang, Chandra Krintz
Venue: Science of Computer Programming (2009)

Exception handling enables programmers to specify the behavior of a program when an exceptional event occurs at runtime. Exception handling, thus, facilitates software fault tolerance and the production of reliable and robust software systems. With the recent emergence of multi-processor systems and parallel programming constructs, techniques are needed that provide exception handling support in these environments that are intuitive and easy to use. Unfortunately, extant semantics of exception handling for concurrent settings is significantly more complex to reason about than their serial counterparts. In this paper, we investigate a similarly intuitive semantics for exception handling for the future parallel programming construct in Java. Futures are used by programmers to identify potentially asynchronous computations and to introduce parallelism into sequential programs. The intent of futures is to provide some performance benefits through the use of method-level concurrency while maintaining as-if-serial semantics that novice programmers can easily understand - the semantics of a program with futures is the same as that for an equivalent serial version of the program. We extend this model to provide as-if-serial exception handling semantics. Using this model our runtime delivers exceptions to the same point it would deliver them if the program was executed sequentially. We present the design and implementation of our approach and evaluate its efficiency using an open source Java virtual machine.
HITS: a symbolic testing and debugging system for multilingual microcomputer software
Authors: Takeshi Chusho, Atsushi Tanaka, Eri Okamoto, Akinori Honda, Toru Kurosaki
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The use of a large-scale computer is the key to the development of increasingly numerous and large-scale microcomputer software programs. HITS (Highly Interactive Testing-and-debugging System) constructs an integrated programming environment for 68000 microcomputer systems on a large-scale computer in cooperation with language translators. This system supports efficient and effective software validation from module testing through system testing. Functions of HITS are provided in the test-procedure description language, in which test data, expected results and the testing environment are described and separated from the target program. The main features are (1) symbolic support of both a high-level language and an assembly language, (2) module testing facilities such as driver and stub definitions, (3) a testing coverage monitor for branch testing, (4) debugging commands added temporarily to a test procedure from a terminal, and (5) a macro definition for language extension. HITS has already been used at many sites. In our early experience of applying it to the software development of various communication systems, software productivity and reliability were considerably improved.
A Digital Signature Scheme Based on NP-Complete Lattice Problems
Authors: Shunichi Hayashi, Mitsuru Tada
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.
The Marriage of Cryptography and Watermarking -- Beneficial and Challenging for Secure Watermarking and Detection
Authors: Ahmad-Reza Sadeghi
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

Multimedia applications deploy various cryptographic and watermarking techniques to maintain security. In this context, we survey the main work on two promising approaches for the secure embedding and detection of a watermark in an untrusted environment, and we point out some associated challenges.In the former case we consider Zero-Knowledge Watermark Detection (ZKWMD) that allows a legitimate party to prove to a potentially untrusted verifying party that a watermark is detectable in certain content, without jeopardizing the security of the watermark. ZKWMD protocols are useful primitives for direct proofs of authorship (i.e., without online involvement of a trusted third party) and dispute resolving in distributed systems. In the latter case we consider a Chameleon-like stream cipher that achieves simultaneous decryption and fingerprinting of data, and can serve as the second line of defense for tracing illegal distribution of broadcast messages, termed as Fingercasting.
Research on Personalized Sports Teaching Network Resources System
Authors: Luo Qi, Bin Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With the quick development and the combination of modern education technology, multimedia technology and network technology, multimedia network curriculum based on internet will become the major resource of future education. Network curriculum refers to the content of courses and teaching activities of a certain discipline displayed by the network. It not only helps to enhance students' initiatives and ability but also facilitates to realize the individualized teaching and learning by laying emphasis on the importance of learner focused method, to combine the classroom teaching with the extracurricular learning though network, curriculum extends classroom teaching and helps to solve the existing problems in current mode of classroom teaching. Basing on it, technologies of Personality, data mining and adaptive filtering are applied in the paper, while the model of personalized sports teaching network resources system (PSTNRS) is proposed. The resultmanifests that PSTNRS can support sports teaching better.
Linear optimal filtering for discrete-time systems with random jump delays
Authors: Chunyan Han, Huanshui Zhang
Venue: Signal Processing (2009)

This paper is concerned with the dynamic Markov jump filters for discrete-time system with random delays in the observations. It is assumed that the delay process is modeled as a finite state Markov chain. To overcome the difficulty of estimation caused by the random delays, the single random delayed measurement system is firstly rewritten as the multiplicative noise constant-delay system. Then, by applying the measurement reorganization approach, the system is further transformed into the delay-free one with Markov jump parameters. Finally, the estimator is derived by using the standard Markov jump filter theories. It is interesting to show that the presented filter for the system with random jump delays can be designed by performing two sets of standard Riccati equations with the same dimension as that of the original system. A simulation example is given to illustrate the effectiveness of the proposed result.
Parallelized Characteristic Basis Finite Element Method (CBFEM-MPI)-A non-iterative domain decomposition algorithm for electromagnetic scattering problems
Authors: Ozlem Ozgun, Raj Mittra, Mustafa Kuzuoglu
Venue: Journal of Computational Physics (2009)

In this paper, we introduce a parallelized version of a novel, non-iterative domain decomposition algorithm, called Characteristic Basis Finite Element Method (CBFEM-MPI), for efficient solution of large-scale electromagnetic scattering problems, by utilizing a set of specially defined characteristic basis functions (CBFs). This approach is based on the decomposition of the computational domain into a number of non-overlapping subdomains wherein the CBFs are generated by employing a novel procedure, which differs from all those that have been used in the past. Clearly, the CBFs are obtained by calculating the fields radiated by a finite number of dipole-type sources, which are placed hypothetically along the boundary of the conducting object. The major advantages of the proposed technique are twofold: (i) it provides a substantial reduction in the matrix size, and thus, makes use of direct solvers efficiently and (ii) it enables the utilization of parallel processing techniques that considerably decrease the overall computation time. We illustrate the application of the proposed approach via several 3D electromagnetic scattering problems.
Action Recognition Using a Bio-Inspired Feedforward Spiking Network
Authors: Maria-Jose Escobar, Guillaume S. Masson, Thierry Vieville, Pierre Kornprobst
Venue: International Journal of Computer Vision (2009)

We propose a bio-inspired feedforward spiking network modeling two brain areas dedicated to motion (V1 and MT), and we show how the spiking output can be exploited in a computer vision application: action recognition. In order to analyze spike trains, we consider two characteristics of the neural code: mean firing rate of each neuron and synchrony between neurons. Interestingly, we show that they carry some relevant information for the action recognition application. We compare our results to Jhuang et al. (Proceedings of the 11th international conference on computer vision, pp. 1---8, 2007) on the Weizmann database. As a conclusion, we are convinced that spiking networks represent a powerful alternative framework for real vision applications that will benefit from recent advances in computational neuroscience.
Software engineering technology transfer
Authors: Lorraine Duvall
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Software that has been developed with the tools, techniques, and methodologies of software engineering has proven to be more reliable, efficient, and maintainable than conventionally developed software. The use of these software engineering techniques by data processing practitioners would result in higher quality software and an attendant increase in effectiveness of an organization's data processing function. 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 TANGRAMII integrated modeling environment for computer systems and networks
Authors: Edmundo de Souza e Silva, Daniel R. Figueiredo, Rosa M.M. Leão
Venue: ACM SIGMETRICS Performance Evaluation Review (2009)

The TANGRAM-II tool has been developed aiming at supporting the performance analyst throughout the entire modeling process, from model construction and model solution to experimentation. The tool has a powerful user interface that can be tailored to specific problem domain, it includes a rich set of analytic solution techniques, distinct options for obtaining the measures of interest, a hybrid fluid and event driven simulator, visualization features to follow the model's evolution with time, traffic generators and active measurement techniques to assist the user in performing computer networking experimentation. These and additional characteristics make TANGRAM-II a unique tool for research and education.
Biphasic GaN nanowires: Growth mechanism and properties
Authors: J. B. Halpern, A. Bello, J. Gilcrease, G. L. Harris, M. He
Venue: Microelectronics Journal (2009)

Catalyst-free vapor-solid nanowire growth has been used to produce novel multiphase zinc-blende/wurtzite gallium nitride nanowires. Multiphase nanowire growth occurred at nanoscale nucleation sites on platelets of gallium nitride. Growth temperature has been shown to exert a strong influence on nucleation site formation. Scanning electron microscopy (SEM) was used to characterize the matrix from which the nanowires grew. Nanowires were characterized with transmission electron microscopy (TEM).
BSP Design for Fiscal Cash Register Embedded System
Authors: An-kun He, Ping Su, Zhuang Wu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The hardware components of embedded system for fiscal cash register is introduced. The functions and characteristics of BSP (Board Support Package) in the development of embedded system is discussed. The key techniques of BootLoader and its driver’s design within Nucleus Plus operating system is analyzed in detail. Design examples are given. The BSP presented in this paper is manufactured and works for fiscal cash register. The functions and performance meet national standards.
On being supple: in search of rigor without rigidity in meeting new design and evaluation challenges for HCI practitioners
Authors: Katherine Isbister, Kristina Höök
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we argue that HCI practitioners are facing new challenges in design and evaluation that can benefit from the establishment of commonly valued use qualities, with associated strategies for producing and rigorously evaluating work. We present a particular use quality 'suppleness' as an example. We describe ways that use qualities can help shape design and evaluation process, and propose tactics for the CHI community to use to encourage the evolution of bodies of knowledge around use qualities.
A Multiagent Genetic Particle Swarm Optimization
Authors: Lianguo Wang, Yi Hong, Fuqing Zhao, Dongmei Yu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

The efforts of this paper are proposing a multi-agent genetic particle swarm optimization algorithm (MAGPSO) by introducing the multi-agent system to the particle swarm optimization(PSO) algorithm. Through the competition and cooperation operation with its neighbors, the neighborhood random crossing operation within its neighboring area, the mutation operation, and combining the evolutionary mechanism of the PSO algorithm, every individual senses local environment unceasingly, and affects the entire agent grid gradually, so that it enhances its fitness to the environment. This algorithm can maintain the diversity of the swarm effectively, and improve the precision of optimization, and simultaneously, restrain the prematurity phenomenon efficiently. The results of testing three high dimension benchmark function and comparing with some optimization results of other methods illustrate this algorithm has higher optimization performance in the field of high dimension functions optimization.
Frequent value compression in packet-based NoC architectures
Authors: Ping Zhou, Bo Zhao, Yu Du, Yi Xu, Youtao Zhang, Jun Yang, Li Zhao
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The proliferation of Chip Multiprocessors (CMPs) has led to the integration of large on-chip caches. For scalability reasons, a large on-chip cache is often divided into smaller banks that are interconnected through packet-based Network-on-Chip (NoC). With increasing number of cores and cache banks integrated on a single die, the on-chip network introduces significant communication latency and power consumption. In this paper, we propose a novel scheme that exploits Frequent Value compression to optimize the power and performance of NoC. Our experimental results show that the proposed scheme reduces the router power by up to 16.7%, with CPI reduction as much as 23.5% in our setting. Comparing to the recent zero pattern compression scheme, the frequent value scheme saves up to 11.0% more router power and has up to 14.5% more CPI reduction. Hardware design of the FV table and its overhead are also presented.
Intelligently creating and recommending reusable reformatting rules
Authors: Christopher Scaffidi, Brad Myers, Mary Shaw
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

When users combine data from multiple sources into a spreadsheet or dataset, the result is often a mishmash of different formats, since phone numbers, dates, course numbers and other string-like kinds of data can each be written in many different formats. Although spreadsheets provide features for reformatting numbers and a few specific kinds of string data, they do not provide any support for the wide range of other kinds of string data encountered by users. We describe a user interface where a user can describe the formats of each kind of data. We provide an algorithm that uses these formats to automatically generate reformatting rules that transform strings from one format to another. In effect, our system enables users to create a small expert system called a "tope" that can recognize and reformat instances of one kind of data. Later, as the user is working with a spreadsheet, our system recommends appropriate topes for validating and reformatting the data. With a recall of over 80% for a query time of under 1 second, this algorithm is accurate enough and fast enough to make useful recommendations in an interactive setting. A laboratory experiment shows that compared to manual typing, users can reformat sample spreadsheet data more than twice as fast by creating and using topes.
How can diagramming tools help support programming activities?
Authors: Seonah Lee, Gail C. Murphy, Thomas Fritz, Meghan Allen
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

We report on an exploratory study we conducted to investigate what kind of diagrammatic tool support, if any, is desired by programmers. The study involved 19 professional programmers working at three different companies. We found that the study participants desire a wide range of information content in diagrams, which would change depending upon the particular context of use. Meeting these needs may require flexible, adaptive and responsive diagramming tool support.
Complexity control in a mixture model by the Hardy-Weinberg equilibrium
Authors: Ella Bingham, Heikki Mannila
Venue: Computational Statistics Data Analysis (2009)

A method of complexity control in multinomial mixture modeling of multiple-marker genotype data, imposing the Hardy-Weinberg equilibrium (HWE) between the genotype values, is studied. This is a very natural restriction, and known to hold at population level under modest assumptions. The hypothesis under study is that imposing this restriction will prevent overfitting and lead to a better model. This is shown to indeed be case. Experimental results on chromosomes 1 and 17 of the HapMap data demonstrate that the restricted model generalizes better to unseen data, and also finds clusters that correspond better to the ethnic groups of the HapMap, when compared with a model without the HWE restriction.