ppxscal/embedding_network huggingface dataset:
Neurally-Driven Adaptive Decision Aids
Authors: Alexandra Geyer, Jared Freeman, Denise Nicholson, Cali Fidopiastis, Phan Luu, Joseph Cohn
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Warfighters are constantly challenged with increasingly complex mission environments, roles, and tasks, which require rapid and accurate decision making. Most current military and commercial decision aids leverage a single strategy: they retrieve and fuse information about well-defined objects and events for the user. Such aids effectively discourage users from considering contextual information and patterns that may help them recognize or think critically about hostile or innocent events. If a decision aiding system were to be truly effective, its adaptive strategies should be driven by more than manipulation of well-defined information presented to the user. In this paper, we propose several critical factors - (1) Information state, (2) User cognitive state, and (3) Interaction state --- that will enable for discern what must be decided and by when; discriminate which cognitive state and process are in play; and assess interactions (queries, selections, etc.) with the information. Most importantly, these factors will allow for a decision aid to capitalize on ---the distinctly human ability to find meaning in swarm of objects and events being perceived.
On-Line Communication Interface Design for Visually Impaired Users
Authors: Sheue-Ling Hwang, Che-Wei Chang
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

The visually impaired users encounter difficulties in acquiring information via image transmission, and then some misunderstandings might occur. In this study, recommendation of user interface layout is proposed. And a communication condition for on-line meeting with auditory interface is designed to give visually impaired users indication of speakers' identification. An experiment was conducted to evaluate how an on-line meeting was affected by the numbers of participants.
Spanning even subgraphs of 3-edge-connected graphs
Authors: Bill Jackson, Kiyoshi Yoshimoto
Venue: Journal of Graph Theory (2009)

By Petersen's theorem, a bridgeless cubic graph has a 2-factor. H. Fleischner extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has a spanning even subgraph. Our main result is that, under the stronger hypothesis of 3-edge-connectivity, we can find a spanning even subgraph in which every component has at least five vertices. We show that this is in some sense best possible by constructing an infinite family of 3-edge-connected graphs in which every spanning even subgraph has a 5-cycle as a component. &copy; 2009 Wiley Periodicals, Inc. J Graph Theory 62: 37&ndash;47, 2009 This research was carried out while the second author was visiting Queen Mary, University of London.
Algebraic Techniques in Differential Cryptanalysis
Authors: Martin Albrecht, Carlos Cid
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

In this paper we propose a new cryptanalytic method against block ciphers, which combines both algebraic and statistical techniques. More specifically, we show how to use algebraic relations arising from differential characteristics to speed up and improve key-recovery differential attacks against block ciphers. To illustrate the new technique, we apply algebraic techniques to mount differential attacks against round reduced variants of Present-128.
A Novel Fault-tolerant Particle Swarm Optimization Scheduler for Scheduling Independent Task in Grid Computing Environment
Authors: Mehdi Nikkhah, Mohammad Hosein Yektaie, Amir Masoud Rahmani, Mohammad Nikkhah
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Grid computing allows one to unite pools of servers, storage systems, and networks from different domain with their specific management policies, into a single large system. The Grid Environment is dynamic and its domains act autonomously. Unfortunately, in such an environment failure may occur occasionally or a volatile host can delay the entire execution for a long period of time, which in turn can fail task’s execution. In this paper, a Novel Fault-tolerant Particle Swarm Optimization Scheduler (NFPSO) is suggested to schedule independent tasks. This approach aims to generate a scheduling plan to overcome the resource failure problem while it decreases total task’s completion time, cost and the percentage of Unsuccessful scheduled task. The experimental results of NFPSO scheduler are compared with results of Genetic Algorithm, Simulated Annealing, mountain Climbing and a Random scheduler. NFPSO shows better result in cost and success rate criteria than all other, but in completion time criteria GA has better than our proposed algorithm which is better than other.
Simulating Perceptive Processes of Pilots to Support System Design
Authors: Andreas Lüdtke, Jan-Patrick Osterloh
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

In this paper we present an approach towards supporting the ergonomic design of aircraft cockpits by predicting the probability that pilots might miss relevant information due to routine learning effects combined with non-adequate placement of display instruments. The approach is based on an executable cognitive pilot model. We focus on the cognitive interaction between (1) rule-based processing of flight procedures, (2) the pilot's mental model of the current situation and (3) pilot's attention. The cognitive model is coupled with a formal cockpit design to simulate human-machine interaction during flight procedures. As an example we analyze the perception of automatic flight mode changes.
The Design and Optimization of High Power Oscillator in Broad Band
Authors: Bin Wang, Defang Liu, Ning Zhou, Linzhen Zhou
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Based on the analysis of traditional high power oscillator, a brand-new oscillator of single-skeleton, dual-coil style is introduced to eliminate the steep troughs and peaks existing in the frequency curve produced by traditional high power oscillator. At the same time, the shape of the skeleton is optimized which minimizes additional mass effect on the evaluated object and broadens the oscillator’s frequency range.
Detecting and Correcting Errors in an English Tectogrammatical Annotation
Authors: Václav Klimeš
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

We present our first experiments with detecting and correcting errors in a manual annotation of English texts, taken from the Penn Treebank, at the dependency-based tectogrammatical layer, as it is defined in the Prague Dependency Treebank. The main idea is that errors in the annotation usually result in an inconsistency, i. e. the state when a phenomenon is annotated in different ways at several places in a corpus. We describe our algorithm for detecting inconsistencies (it got positive feedback from annotators) and we present some statistics on the manually corrected data and results of a tectogrammatical analyzer which uses these data for its operation. The corrections have improved the data just slightly so far, but we outline some ways to more significant improvement. 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
A Method Based on Discrete Tangent for Curvature Estimation of Digital Curve
Authors: Qian Cui, Lin Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Many applications of geometry processing and computer vision rely on geometric properties of curves, particularly on their curvature. So the estimation of digital curve’s curvature is important. An algorithm of curvature estimation is proposed in this paper, which is based on the recognition of discrete straight segments. For each point of a digital curve, its curvature is estimated by searching the discrete tangents of this point and of its neighboring points. To test the effectiveness and the precision of this algorithm, it’s compared with Hermann algorithm by a lot of experiments conducted on the digital circles in a wide range of resolution. For each curve, the maximum and the mean of errors are recorded. Experimental results show that the new method has an overall good performance.
The Evaluation Study of the Natural Suitability of Human Settlements Based on RS and GIS - Take Sichuan for Example
Authors: Ren Ping, Zhou Jieming, Zhang Guo, Yang Cun-jian
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Because of the development of social economy, attentions have been given to human settlements. And the distribution of geographic population is determined by the natural suitability and the restriction of human settlements. Due to most researches focus on evaluation studies of urban human environment and deficiency of research methods chiefly composed by qualitative methods, this paper mainly adopts the geographic spatial evaluation system by RS and GIS to study and evaluate the general conditions of 21 cities or states in Sichuan province from the view of middle scale and natural suitability. Consequently, this paper divides Sichuan into four different zones that reflect different natural living environment: unsuitable area, general suitable area, comparatively suitable area and quite suitable area.The research result of this paper reveals the evolution of the human settlements in Sichuan Province that offer references for decision-making on improving the regional population distribution flow and the living environment.
Voronoi Based Area Coverage Optimization for Directional Sensor Networks
Authors: Jing Li, Ru-chuan Wang, Hai-ping Huang, Li-juan Sun
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Sensing coverage is a fundamental problem in sensors networks. Different from traditional isotropic sensors with sensing disk, directional sensors may have a limited angle of sensing range due to special applications. In this paper, we study the area coverage problem in directional sensor networks with the rotatable orientation for each sensor. We propose the optimal coverage in directional sensor networks (OCDSN) problem to cover maximal area while activating as few sensors as possible. Then we prove the OCDSN to be NP-complete and propose the greedy approximation algorithm of the solution to the OCDSN problem, based on the boundary Voronoi diagram. Finally, extensive simulation is executed to demonstrate the performance of the proposed algorithm.
UJM at INEX 2008: Pre-impacting of Tags Weights
Authors: Mathias Géry, Christine Largeron, Franck Thollard
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

This paper addresses the impact of structure on terms weighting function in the context of focused Information Retrieval (IR). Our model considers a certain kind of structural information: tags that represent logical structure (title, section, paragraph, etc.) and tags related to formatting (bold, italic, center, etc.). We take into account the tags influence by estimating the probability that a tag distinguishes relevant terms. This weight is integrated in the terms weighting function. Experiments on a large collection during INEX 2008 IR competition showed improvements for focused retrieval.
On the predictive performance of queueing network models for large-scale distributed transaction processing systems
Authors: Oliver Hühn, Christian Markl, Martin Bichler
Venue: Information Technology and Management (2009)

Automated business processes running on distributed transaction processing (DTP) systems characterize the IT backbone of services industries. New web services standards such as BPEL have increased the importance of DTP systems in business practice. IT departments are forced to meet pre-defined quality-of-service metrics, therefore performance prediction is essential. Unfortunately, the complexity of multiple interacting services running on multiple hardware resources as well as the volatility in the demand for these services can make performance analysis extremely difficult. While business process automation has been a dominant topic in the recent years, surprisingly little has been published on performance modelling of large-scale DTP systems. In this paper, we will describe these systems with respect to the workloads and technical features, and compare the predictive accuracy of different types of queueing models and discrete event simulations experimentally. The experiments are based on two real-world DTP systems and respective data sets of a telecom company. Overall, we found that while the results for average utilization scenarios are quite similar, the effort to implement and run analytic solutions is much lower. As long as standard distributional assumptions of analytical models hold, they provide a reliable and fast methodology to explore different demand mix scenarios even for large-scale systems. The difficulty to estimate service and arrival time parameters and demand mix for the respective queueing network models can largely be reduced with appropriate tooling. Often, this information is missing in IT departments. Also, complex event conditions and error handling in DTP systems can make the analysis difficult. For many DTP applications, however, performance modelling could provide valuable decision support for service level management.
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
Authors: Hiroaki Yamamoto, Daichi Takenouchi
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

The following tree pattern matching problem is considered: Given two unordered labeled trees P and T, find all occurrences of P in T. Here P and T are called a pattern tree and a target tree, respectively. We first introduce a new problem called the pseudo-tree pattern matching problem. Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs in $O(L_P\cdot n\cdot l\cdot \lceil \frac{h}{W}\rceil)$ time and $O(n\cdot l\cdot \lceil \frac{h}{W}\rceil)$ space, and another one runs in $O((L_P\cdot n+h\cdot 2^l)\cdot \lceil \frac{h\cdot l}{W}\rceil)$ time and $O((n+h\cdot 2^l)\cdot \lceil \frac{h\cdot l}{W}\rceil)$ space, where n is the number of nodes in T, h and l are the height of P and the number of leaves of P, respectively, and W is the length of a computer-word. The parameter L P , called a recursive level of P, is defined to be the number of occurrences of the same label on a path from the root to a leaf. Hence we have L P ≤ h. Finally, we give an algorithm to extract all occurrences from pseud-occurrences in $O(n\cdot L_P\cdot l^{3/2})$ time and O(n·L P ·l) space.
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
Authors: Naoki Kobayashi, C.-H. Luke Ong
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

The model checking of higher-order recursion schemes has important applications in the verification of higher-order programs. Ong has previously shown that the modal mu-calculus model checking of trees generated by order-n recursion scheme is n-EXPTIME complete, but his algorithm and its correctness proof were rather complex. We give an alternative, type-based verification method: Given a modal mu-calculus formula, we can construct a type system in which a recursion scheme is typable if, and only if, the (possibly infinite, ranked) tree generated by the scheme satisfies the formula. The model checking problem is thus reduced to a type checking problem. Our type-based approach yields a simple verification algorithm, and its correctness proof (constructed without recourse to game semantics) is comparatively easy to understand. Furthermore, the algorithm is polynomial-time in the size of the recursion scheme, assuming that the formula and the largest order and arity of non-terminals of the recursion scheme are fixed.
Earth and Planetary System Science Game Engine
Authors: Gloria J. Brown-Simmons, Falko Kuester, Christopher J. Knox, So Yamaoka
Venue: Transactions on Edutainment II (2009)

The widespread use of on-line computer games makes the medium a prime vehicle for communicating information and their scalability is especially conducive for facilitating global collaboration focused on developing a better understanding of the underpinnings and complexities of planetary systems beginning with climate change. Game engines generally provide an intuitive interface allowing focus to be shifted to the understanding of scientific elements rather than hiding them between a wealth of menus and other counterintuitive user interface components. Unconventional interaction and visualization techniques are introduced as a method to experience geophysical environments. Players are provided with dynamic visualization "assets," which enable them to discover, interrogate and correlate scientific data in a game space. The spirit of exploration is to give players the impetus to truly understand how complex Earth and planetary systems work and their intrinsic beauty, the impact of humans, and a sense of responsibility to serve as caretakers of those systems.
Brain Response to Good and Bad Design
Authors: Haeinn Lee, Jungtae Lee, Ssanghee Seo
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

This paper is about the decision of whether good or bad design is the result of the human brain process. Our research team has used the technique of functional MRI and Electroencephalogram (EEG) to address the question of how the brain answers while subjects viewed different designs. Classifying the good or bad designs, subjects chose a mouse button to decide their perception of good or bad design and we analyzed their patterns of EEG rhythms and fMRI. The results of fMRI showed that the perceptions of different feelings of designs are associated with the frontal lobe and the occipital lobe. After analyzing the EEG by the Event-related brain potentials (ERP) method, we also found that the amplitude of ERP components in perception of bad design is greater and latency is shorter than that of good design. Therefore, the human brain responds sooner and stronger in perception of bad feeling.
Conditional plausibility measures and Bayesian networks
Authors: Joseph Y. Halpern
Venue: Journal of Artificial Intelligence Research (2001)

A general notion of algebraic conditional plausibility measures is defined. Probability measures, ranking functions, possibility measures, and (under the appropriate definitions) sets of probability measures can all be viewed as defining algebraic conditional plausibility measures. It is shown that algebraic conditional plausibility measures can be represented using Bayesian networks.
The Conditional Diagnosability of Hypercubes under the Comparison Model
Authors: Shuming Zhou
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The growing size of the multiprocessor systems increases their vulnerability to component failures. It is crucial to local and to replace the faulty processors to maintain system’s high reliability. The fault diagnosis is the process of identifying fault processors in a system through testing. The conditional diagnosis requires that for each processor v in a system, all the processors that are directly connected to v do not fail at the same time. In this paper, the conditional diagnosability of the Hypercubes Q_nunder the comparison diagnosis model is 3n-5when n>6. Hence the conditionaldiagnosability ofQ_nis three times larger thanits classical diagnosability.
The Application of the Flexilevel Approach for the Assessment of Computer Science Undergraduates
Authors: Mariana Lilley, Andrew Pyper
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

This paper reports on the use of the flexilevel approach for the formative assessment of Computer Science undergraduates. A computerized version of the flexilevel was designed and developed, and its scores were compared with those of a traditional computer-based test. The results showed that the flexilevel and traditional scores were highly and significantly correlated (p<0.01). Findings from this study suggest that the flexilevel approach is a viable adaptive testing strategy, and may be a good candidate for smaller applications where IRT-based CATs may be too demanding in terms of resources.
Iterative-Interpolation Super-Resolution Image Reconstruction: A Computationally Efficient Technique, 1st edition
Authors: Vivek Bannore
Venue: Studies In Computational Intelligence (2009)

This book presents a novel and hybrid, computationally efficient, reconstruction scheme for solving the problem of super-resolution restoration of high-resolution images from sequences of geometrically warped, aliased and under-sampled low-resolution images. The scheme proposed is referred as the Iterative-Interpolation Super-Resolution (IISR) technique. The optimization-based technique for super-resolution is reinvestigated for comparative analysis to evaluate the accuracy and efficiency of the IISR technique. The significant influence of the regularization term over the fidelity of reconstruction is also analysed. The IISR technique addresses the problem of super-resolution image enhancement in terms of maintaining highest fidelity of reconstruction and a low computational cost to achieve maximum applicability of super-resolution to the real-world applications. 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
Creating Hollywood-Style Movies with Adobe Premiere Elements 7, 1st edition
Authors: Carl Plumer, Paul Ekert
Venue:  (2009)

Creating Hollywood-Style Movies with Adobe Premiere Elements 7 is a book that will help users get to the next level in video editing, and that next level goes beyond simply splicing together clips and creating simple titles. In no time readers will be overlaying multiple tracks of videos and adjusting transparency; creating Picture-in-Picture overlays; using key frames and motion paths; setting and refining greenscreens and bluescreens; using color effects for emotional impact; and a whole range of other special effects to help them tell their story. Readers will also discover how to use new features, such as adding Smart Tags, using Adobe Videomerge to place a subject in a new setting, and harnessing the InstantMovie feature for the most creative results. What sets this book apart is the author's expertise in carefully showing readers how to execute each of these movie-making techniques step-by-step in a clear and friendly writing style. With this book, budding film-makers of all levels will find how to create better-looking movies and have a lot of fun doing it.