ppxscal/embedding_network huggingface dataset:
Information handover in time-critical work
Authors: Aleksandra Sarcevic, Randall S. Burd
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Information transfer under time pressure and stress often leads to information loss. This paper studies the characteristics and problems of information handover from the emergency medical services (EMS) crew to the trauma team when a critically injured patient arrives to the trauma bay. We consider the characteristics of the handover process and the subsequent use of transferred information. Our goal is to support the design of technology for information transfer by identifying specific challenges faced by EMS crews and trauma teams during handover. Data were drawn from observation and video recording of 18 trauma resuscitations. The study shows how EMS crews report information from the field and the types of information that they include in their reports. Particular problems occur when reports lack structure, continuity, and complete descriptions of treatments given en route. We also found that trauma team members have problems retaining reported information. They pay attention to the items needed for immediately treating the patient and inquire about other items when needed during the resuscitation. The paper identifies a set of design challenges that arise during information transfer under time pressure and stress, and discusses characteristics of potential technological solutions.
Fuzzifying Gini Index based decision trees
Authors: B. Chandra, P. Paul Varghese
Venue: Expert Systems with Applications: An International Journal (2009)

Crisp decision tree algorithms face the problem of having sharp decision boundaries which may not be found in all real life classification problems. A fuzzy decision tree algorithm Gini Index based (G-FDT) is proposed in this paper to fuzzify the decision boundary without converting the numeric attributes into fuzzy linguistic terms. Gini Index is used as split measure for choosing the most appropriate splitting attribute at each node. The performance of G-FDT algorithm is compared with Gini Index based crisp decision tree algorithm (SLIQ) using several real life datasets taken from the UCI machine learning repository. G-FDT algorithm outperforms its crisp counterpart in terms of classification accuracy. The size of the G-FDT is significantly less compared to SLIQ.
Virtualized games for teaching about distributed systems
Authors: Joel Wein, Kirill Kourtchikov, Yan Cheng, Ron Gutierez, Roman Khmelichek, Matthew Topol, Chris Sherman
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets necessary to grapple with the complexity of such systems. We have developed and integrated into an undergraduate elective course on parallel and distributed computing a teaching tool that may help students develop these skill sets. The tool uses virtualization to ease the burden of resourcing and configuring complex systems for student study, and creates varied "firefighting" gaming scenarios in which students compete to keep the system up and running in the presence of multiple issues. Preliminary experience indicates that (1) students find the tool engaging and (2) it is a manageable way in which to give students a novel perspective on interaction with complex distributed systems.
Low-Resolution Chinese Character Recognition of Vehicle License Plate Based on ALBP and Gabor Filters
Authors: Ye Wang, Honggang Zhang, Xu Fang, Jun Guo
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Low-resolution Chinese character recognition of vehicle license plate is always a difficult problem. On the basic of existing Local Binary Patterns(LBP) operator, we propose a powerful and low-computation advanced LBP(ALBP)operator as feature extraction, and apply into Chinese character recognition for the first time. As local feature extraction operater, it produces a feature excursion for characters of barycenter departure. Therefore we use the advantage of global analysis of Gabor filters, construct Gabor filters to recognize characters of barycenter departure. The experimental results show the method is robust against low quality Chinese characters and more adaptive than conventional approach both on preciseness and recognition speed.
From Pāninian Sandhi to Finite State Calculus
Authors: Malcolm D. Hyman
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

The most authoritative description of the morphophonemic rules that apply at word boundaries (external sandhi) in Sanskrit is by the great grammarian Pānini (fl. 5th c. b. c. e.). These rules are stated formally in Pānini's grammar, the Aṣṭ ādhyā yī 'group of eight chapters'. The present paper summarizes Pānini's handling of sandhi, his notational conventions, and formal properties of his theory. An XML vocabulary for expressing Pānini's rules is introduced and the application to morphophonemic rules demonstrated. Although Pānini's notation potentially exceeds a finite state grammar in power, individual rules do not rewrite their own output, and thus they may be automatically translated into a rule cascade from which a finite state transducer can be compiled. 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 novel full-duplex radio-over-fiber system with photonics frequency quadruple for optical millimeter wave generation
Authors: Jing He, Lin Chen, Shuangchun Wen
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We propose and experimentally demonstrate a novel full-duplex radio-over-fiber system using a Mach-Zehnder modulator along with fiber Bragg grating to generate an optical millimeter-wave signal that has four times the frequency of the microwave drive signal, which can carry downstream data. Meanwhile centralized lightwave reflect from the fiber Bragg gating is reused to carry upstream data. Since the centralized lightwave with high power is reused, the optical power can be utilized effectively. The experimental results show that the penalty of 2.5 Gb/s upstream data after transmission over 20km single-mode fiber is 1dB at the BER of 10-9. In this system, it can greatly reduce the bandwidth of microwave component and modulator, and the cost of system.
Automatic Classification of Tv News Articles Based on Telop Character Recognition
Authors: Yasuo Ariki, Katsumi Matsuura
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The purpose of this study is to develop a multi-media database system for TV news video data. TV news video data consist of speech, characters and images. In this study, telop characters are recognized and given to the news articles as indices for classification. At first, telop frames which include telop characters are detected and then the telop characters are extracted and recognized. Through morphological analysis of the recognized telop characters, keywords are extracted which consist of more than two characters. Their keywords are used as indices to classify the TV news articles. We carried out the experiments for 30 days of NHK 5 minutes news and obtained 95.4\% telop character extraction rate, 81.4\% character recognition rate and 83.8\% article classification rate. We improved the article classification rate by 43.4\% through character recognition improvement from 44.1% to 81.4%.
Interoperability in e-tendering: the case of the virtual company dossier
Authors: Ansgar Mondorf, Maria Wimmer
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The effective use of ICT to enable interoperability in public procurement is an area of great significance for achieving the Lisbon objectives, i.e. to become the most competitive and dynamic knowledge-based economy in the world. However, the current European public e-Procurement infrastructure is inappropriate because it is characterized through a high market fragmentation and a lack of interoperability. To facilitate EU-wide interoperability in public e-Procurement the European Commission co-funds the PEPPOL (Pan-European Public Procurement On-Line) project within the Competitive Innovation Programme (CIP) Framework. PEPPOL aims at setting up pan-European pilot solutions that conjointly exist with national infrastructures. The project consists of several building blocks for e-Procurement that cover the entire e-Procurement process from pre-awarding to post-awarding. One of the key building blocks for the pre-awarding phase is the Virtual Company Dossier (VCD), an electronic cross-border document container that carries certificates and attestations required for the qualitative selection of tenderers. In this paper, we introduce findings from existing studies for designing a VCD, such as a feasibility study on Electronic Business Attestation and VCD related European legislations (e.g. Directive 2004/17/EC & Directive 2004/18/EC). Moreover we sketch the approach taken in the PEPPOL project to design pilots in two Member States.
Space Regression Analysis on Geochemical Data by the GEP Evolutionary Model Based on Kriging
Authors: Dongmei Zhang, Ao Wang, Zhifen Chen
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

There are several approaches to handle spatial trends: Kriging, stochastic simulation models, fractal and so on. The paper presents some contemporary approaches to spatial data analysis. The main topics are concentrated on the problems of space regression analysis by geochemical exploration data modeling. The innovative part of the paper presents integrated/hybrid model-combine GEP evolution modeling with spatial structure analysis. The models are based on GEP evolution modeling algorithm. Geostatistical tools on the basis of spatial autocorrelation thesis are used to extract representative data to fully utilize spatial structural information and weaken the influence of noise. Case study from mineral deposits in Gejiu illustrates the performance of the proposed model and BP neural network model is chosen as comparative study. It is shown that the fitting of the model and precision of test, provided by the combination of GEP evolution modeling and geostatistical model based approaches, are obviously improved.
A type system for functional traversal-based aspects
Authors: Bryan Chadwick, Karl Lieberherr
Venue: Proceedings of the 2009 workshop on Foundations of aspect-oriented languages (2009)

We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in sets of functions that implement a fold over a data structure with the help of a generic traversal. In this paper we define the syntax, semantics, and typing rules of a simple AP-F model, together with a proof of soundness that guarantees that traversal expressions result in a value of the expected type. Applying a function set to a different structure can then be statically checked to eliminate some runtime tests and sources of program errors.
Offline signature authentication using cross-validated graph matching
Authors: A C Ramachandra, K Pavithra, K Yashasvini, K B Raja, K R Venugopal, L M Patnaik
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

The biometric system is used to identify a person depending on his physiological or behavioral characteristics. Signature verification is a commonly accepted biometric method and is widely used for banking transactions. In this paper, we propose Offline Signature Authentication using Cross-validated Graph Matching (OSACGM) algorithm. The signatures are pre-processed in which signature extraction method is used to obtain high resolution for smaller normalization box. The similarity measure between two signatures in the database is determined by (i) constructing a bipartite graph G, (ii) obtaining complete matching in G and (iii) finding minimum Euclidean distance by Hungarian method. An optimum decision threshold value is determined using Cross-validation technique to select reference signatures. The test feature is extracted from the given test signature by pre-processing. Then the test feature is compared with the threshold value to authenticate the test signature. Compared to the existing algorithm, our algorithm gives better Equal Error Rate (EER) for skilled and random forgeries.
Explaining the split-attention effect: Is the reduction of extraneous cognitive load accompanied by an increase in germane cognitive load?
Authors: Gabriele Cierniak, Katharina Scheiter, Peter Gerjets
Venue: Computers in Human Behavior (2009)

The phenomenon that the physical integration of verbal and pictorial information sources, compared to their physical separation, enhances learning is known as the split-attention effect. This paper investigates how the split-attention effect can be best explained against the background of cognitive load theory. In an experimental study, students learned about physiological processes with either an integrated or a split-source format. Secondary task performance was used to measure overall cognitive load, whereas subjective ratings were used to measure intrinsic, extraneous and germane load individually. Learners with split-source format achieved lower learning outcomes, but did not show worse secondary task performance than learners with integrated format. These results contradict the assumption that only an increase in extraneous load for learners with a split-source format mediates the split-attention effect. Mediation analyses of the subjective load ratings revealed that both, extraneous and germane load contributed to the split-attention effect. These results support the assumption that germane load also plays a crucial role in mediating the split-attention effect.
Contour Grouping Based on Contour-Skeleton Duality
Authors: Nagesh Adluru, Longin Jan Latecki
Venue: International Journal of Computer Vision (2009)

In this paper we present a method for grouping relevant object contours in edge maps by taking advantage of contour-skeleton duality. Regularizing contours and skeletons simultaneously allows us to combine both low level perceptual constraints as well as higher level model constraints in a very effective way. The models are represented using paths in symmetry sets. Skeletons are treated as trajectories of an imaginary virtual robot in a discrete space of "symmetric points" obtained from pairs of edge segments. Boundaries are then defined as the maps obtained by grouping the associated pairs of edge segments along the trajectories. Casting the grouping problem in this manner makes it similar to the problem of Simultaneous Localization and Mapping (SLAM). Hence we adapt the state-of-the-art probabilistic framework namely Rao-Blackwellized particle filtering that has been successfully applied to SLAM. We use the framework to maximize the joint posterior over skeletons and contours.
Sensor network to monitor underground state transition against mad slide disaster
Authors: Kouji Kajimoto, Yusuke Yokota, Fumiko Harada, Hiromitsu Shimakawa
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

A mad slide in a slope facing a road threatened lives of many people. This paper explains a method to detect symptoms of mad slides with the pore-water pressure in the soil mass in the slope. To represent the characteristic transition of the pore water pressure. This paper proposes a model to construct a time tube. A system has been developed to predict a mad slide using time tubes. The paper explains the system, along with an experiment to demonstrate the effectiveness of the time tube. In the experiment, the system can predict two cases of collapses of model slope in a soil tank.
Design, implementation, and evaluation of a Programmable Bandwidth Aggregation System for home networks
Authors: Tzu-Chi Huang, Sherali Zeadally, Naveen Chilamkurti, Ce-Kuen Shieh
Venue: Journal of Network and Computer Applications (2009)

Bandwidth aggregation is a promising technology that can speed up access to the Internet by bandwidth sharing and multi-path communication. Current Bandwidth Aggregation Systems (BASs) deployed in public networks provide limited performance and flexibility when they are directly used in home networking environments. To reap the full performance benefits of BASs in home networks, they need to be easily and dynamically programmable by home network users. We present the design and implementation of a Programmable Bandwidth Aggregation System (PBAS) that can provide home network users improved performance when sharing bandwidth for activities that access the Internet. We also present an empirical performance evaluation of the system and we demonstrate the superior efficiency of our proposed PBAS over a traditional BAS in terms of computational overheads, loadable code, throughput performance, and programmability.
Autonomous mobile agent routing for efficient server resource allocation
Authors: Vasileios Baousis, Stathes Hadjiefthymiades, George Alyfantis, Lazaros Merakos
Venue: Journal of Systems and Software (2009)

Mobile agents are becoming increasingly important in the highly distributed applications frameworks seen today. Their routing/dispatching from node to node is a very important issue as we need to safeguard application efficiency, achieve better load balancing and resource utilization throughout the underlying network. Selecting the best target server for dispatching a mobile agent is, therefore, a multi-faceted problem that needs to be carefully tackled. In this paper we propose distributed, adaptive routing schemes (next node selection) for mobile agents. The proposed schemes overcome risks like load oscillations, i.e., agents simultaneously abandoning a congested node in search for other, less saturated node. We try to induce different routing decisions taken by agents to achieve load balancing and better utilization of network resources. We consider five different algorithms and evaluate them through simulations. Our findings are quite promising both from the user/application and the network/infrastructure perspective.
A Novel Hierarchical Mode Selection Algorithm for P-Slices in H.264/AVC
Authors: Xinxin Zhou, Chun Yuan, Chunhua Li, Yuzhuo Zhong
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, a novel hierarchical mode selection algorithm is proposed to reduce the complexity of the mode selection process for P-Slices in H.264/AVC. Generally, the proposed algorithm is divided into two major stages ---inter mode selection and intra mode selection. For inter mode selection, a three-level prediction structure is proposed with a flexible early termination strategy, which can efficiently skip the unnecessary mode checking while achieving a high prediction accuracy. For intra mode selection, the spatial correlation and the information of the best inter mode are exploited to decide whether the intra mode selection can be skipped. If intra mode selection is necessary, an early selection between Intra16x16 and Intra4x4 will be given. Experiment results show that with this algorithm, 50%~80% encoding time can be saved with a negligible loss in PSNR and very little increment in bit rates.
Hybridization in Nonbinary Trees
Authors: Simone Linz, Charles Semple
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

Reticulate evolution&#x2014;the umbrella term for processes like hybridization, horizontal gene transfer, and recombination&#x2014;plays an important role in the history of life of many species. Although the occurrence of such events is widely accepted, approaches to calculate the extent to which reticulation has influenced evolution are relatively rare. In this paper, we show that the NP-hard problem of calculating the minimum number of reticulation events for two (arbitrary) rooted phylogenetic trees parameterized by this minimum number is fixed-parameter tractable.
Efficient triangulation for P2P networked virtual environments
Authors: Eliya Buyukkaya, Maha Abdallah
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

Peer-to-peer (P2P) architectures have recently become a popular design choice for building scalable Networked Virtual Environments (NVEs). In P2P-based NVEs, system and data management is distributed among all participating users. Towards this end, a Delaunay triangulation can be used to provide connectivity between the different NVE users depending on their positions in the virtual world. However, a Delaunay triangulation clearly suffers from a high maintenance cost as it is subject to high connection change rate due to continuous users' movement. In this paper, we propose a new variant to the Delaunay triangulation algorithm that provides network connectivity to support P2P NVEs while dramatically decreasing maintenance overhead by reducing the number of connection changes due to users' insertion and movement. Performance evaluations show that our solution drastically reduces overlay maintenance cost in highly dynamic NVEs.
Optimizing Distributed Joins with Bloom Filters
Authors: Sukriti Ramesh, Odysseas Papapetrou, Wolf Siberski
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

Distributed joins have gained importance in the past decade, mainly due to the increased number of available data sources on the Internet. In this work we extend Bloomjoin, the state of the art algorithm for distributed joins, so that it minimizes the network usage for the query execution based on database statistics. We present 4 extensions of the algorithm, and construct a query optimizer for selecting the best extension for each query. Our theoretical analysis and experimental evaluation shows significant network cost savings compared to the original Bloomjoin algorithm.
Composability and On-Line Deniability of Authentication
Authors: Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but neither party can convince anyone else that the other party took part in the protocol. We introduce and study on-line deniability, where deniability should hold even when one of the parties colludes with a third party during execution of the protocol. This turns out to generalize several realistic scenarios that are outside the scope of previous models.We show that a protocol achieves our definition of on-line deniability if and only if it realizes the message authentication functionality in the generalized universal composability framework; any protocol satisfying our definition thus automatically inherits strong composability guarantees. Unfortunately, we show that our definition is impossible to realize in the PKI model if adaptive corruptions are allowed (even if secure erasure is assumed). On the other hand, we show feasibility with respect to static corruptions (giving the first separation in terms of feasibility between the static and adaptive setting), and show how to realize a relaxation termed deniability with incriminating abort under adaptive corruptions.