ppxscal/embedding_network huggingface dataset:
Network impacts of distance-based road user charging
Authors: Astha Balwani, Sandeep Singh
Venue: Netnomics (2009)

Distance-based road user charging is being seen as one potential mechanism to implement national road charging schemes. This paper investigates the design aspects of universal distance-based charging schemes and incorporates procedures within a detailed network supply model to represent how a range of different permutations of distance-based charges across a given network (charging regimes) affect route-choice, travel characteristics and demand for road space. The results suggest that distance-based charging can reduce number and length of trips, congestion, accidents and pollution, and provide net economic benefits and revenues. However, these benefits are not found to be uniform throughout the network. Their magnitude largely depends on the charge level, the hierarchy of charges across the network, and the difference between the charge levels.
Global Information Technologies: Concepts, Methodologies, Tools and Applications
Authors: Felix Tan, Felix Tan
Venue:  (2007)

The increasingly pervasive distribution of networked information and communication technologies has diminished geographic and cultural boundaries and created unprecedented opportunities for interaction across previous physical and sociocultural divides. Yet this emerging context of global networking faces societies with perhaps as many challenges as opportunities. Global Information Technologies: Concepts, Methodologies, Tools, and Applications compiles a defining body of authoritative research on these topics, resulting in a complete reference collection that cuts across all major areas of concern in the global information domain. Among the more than 300 chapters from 250 international experts are examinations of culture in information systems, IT in developing countries, global e-business, and the worldwide information society. A matchless compendium on this topic for reference collections in libraries worldwide, this six-volume collection provides a critical mass of knowledge to fuel the future work of researchers, academicians and practitioners in a variety of fields that engage with the implications of global information technology, such as information science, political science, international relations, sociology, and many more.
ELMR: lightweight mobile health records
Authors: Arvind Kumar, Amey Purandare, Jay Chen, Arthur Meacham, Lakshminarayanan Subramanian
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Cell phones are increasingly being used as common clients for a wide suite of distributed, database-centric healthcare applications in developing regions. This is particularly true for rural developing regions where the bulk of the healthcare is handled by health workers due to lack of doctors; the widespread availability of cellular services have made mobile devices as an important computing platform for enabling healthcare applications for these health workers. Unfortunately, the current SQL model for distributed client/server systems is far too heavy-weight for these applications, particularly in light of the high communications cost and extremely limited data transmission capacity available in these environments. In this demonstration, we describe the Efficient Lightweight Mobile Records (ELMR) system that provides a practical and lightweight database access protocol for accessing and updating records remotely from mobile devices under an extremely bandwidth and cost-constrained Short Messaging Service (SMS) channel comprising of 140 byte packets. We have implemented ELMR using the RMS functionality in J2ME, and integrated it into an HIV treatment application we are developing for use by African health workers.
Impact of using electronic collaborative media on knowledge sharing phases
Authors: Mohammad Al-Ma'aitah
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The advances in computers and communication technologies have enabled many companies to leverage knowledge. The emerging powerful systems such as internet, intranet, Lotus Notes, and conferencing systems allow people to collaborate and share their complementary knowledge, without overly constraining them to geographic location and time. Therefore, Organizations especially those adapting to rapidly changing environments, face the challenge of being able to use these technologies, in order to gain knowledge sharing effectively within highly constrained timeframes. This study came to explore the effect of using electronic collaborative media on knowledge sharing phases. This study investigated a sample formed of (180) individuals operating in a number of hospitals within the Jordanian health sector; using the electronic collaborative system, to perform its different duties. In order to achieve this purpose the study proposed the following hypotheses: using of electronic collaborative media is positively influences on the knowledge sharing phases. The study concluded some important results such as that among the most important electronic collaborative media used in knowledge sharing in the hospitals subject to research are the E-mail and video conferencing, and existence of a significant effect between using the electronic collaborative media and the knowledge sharing process in the researched hospitals.
On the Relationship of Defeasible Argumentation and Answer Set Programming
Authors: Matthias Thimm, Gabriele Kern-Isberner
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

This paper investigates the relationship between defeasible argumentation (DeLP) and answer set programming by transforming a defeasible logic program into an answer set program. We propose two types of conversions that differ with respect to the handling of strict rules. Inference via a dialectical warrant procedure in DeLP turns out to be stronger than credulous answer set inference in both cases, while conversions of the second type bring DeLP inference closer to skeptical answer set inference. Moreover, we investigate some characteristics of the warrant procedure of DeLP which lead to a better understanding of the notion of warrant.
Computing generating sets of lattice ideals and Markov bases of lattices
Authors: Raymond Hemmecke, Peter N. Malkin
Venue: Journal of Symbolic Computation (2009)

In this article, we present an algorithm for computing generating sets of lattice ideals or equivalently for computing Markov bases of lattices. Generating sets of lattice ideals and Markov bases of lattices are essentially equivalent concepts. In contrast to other existing methods, the algorithm in this article computes with projections of lattices. This algorithm clearly outperforms other algorithms in our computational experience. Two areas of application for generating sets of lattice ideals and Markov bases lattices are algebraic statistics and integer programming.
Digital System Design
Authors: Balakrishnan
Venue:  (2007)

Digital System Design attempts to provide a comprehensive textbook on digital design for undergraduate students of engineering. The book exhaustively covers the basic principles of digital system design as well as demonstrates the use of VHDL and FPGAs in system design and also discusses the underlying algorithms. Beginning with review chapters on combinational and sequential circuits, the book goes on to describe combinational design using RT blocks, memory design and hardware-software codesign issues. Since memory organisation forms a core part of the system design challenges, this issue is illustrated comprehensively with examples. The theory is supported with several case studies to help students undertake design projects. Written in a lucid style the book would also benefit postgraduate students and designers in the industry. 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
Efficient Broadcast from Trapdoor Functions
Authors: Yi Mu, Willy Susilo, Xinyi Huang
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

We present a novel scheme of broadcast encryption that is suitable for broadcast servers such as pay TV services. The important feature of our scheme is that the length of a broadcast string in our scheme is independent of the number of receivers in the system; hence it is suitable for large groups. Our scheme is based on a trapdoor encryption technique under the RSA assumption. We also describe a variant of our scheme which provides stronger security.
What Is Expected of a Facilitator in a Virtual Learning Environment?
Authors: Ni Chang
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

Online teaching and learning significantly differs from traditional teaching and learning [1] because of the change of context. How to facilitate students via web-based information delivery systems is fundamentally imperative. However, there is a dearth of literature regarding facilitation across online interaction [2]. Therefore, the heart of this paper will focus on responsibilities and accountabilities expected of an e-facilitator.
Better Safe than SorryOptimal Troubleshooting through A* Search with Efficiency-based Pruning
Authors: Thorsten J. Ottosen, Finn V. Jensen
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

Decision theoretic troubleshooting combines Bayesian networks and cost estimates to obtain optimal or near optimal decisions in domains with inherent uncertainty. In this paper we use the well-known A* algorithm extended with pruning based on the efficiency of actions for finding optimal solutions in troubleshooting. In particular, we focus on models with dependent actions.
Analytical model of the CKC-based activity index variance
Authors: Rok Istenic, Damjan Zazula
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In this paper a new technique for estimating the number of signal sources is introduced. It is based on the convolution kernel compensation method, in particular on the variance of the activity index. An exact analytical model was build to describe the relationships between the activity index variance and the parameters of the modelled process, such as the number of sources, duration of source responses, and noise corruption. Simulation studies have shown that the activity index variance can be used for this estimation, while it changes with respect to the number of active sources in the signal in a known way incorporated in the derived analytical model. The obtained results are presented and discussed.
New Human Face Expression Tracking
Authors: Daria Kalinkina, André Gagalowicz
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

In this paper we propose a new method for precise face expression tracking in a video sequence which uses a hierarchical animation system built over a morphable polygonal 3D face model. Its low-level animation mechanism is based upon MPEG-4 specification which is implemented via local point-driven mesh deformations adaptive to the face geometry. The set of MPEG-4 animation parameters is in its turn controlled by a higher-level system based upon facial muscles structure. That allows us to perform precise tracking of complicated facial expressions as well as to produce face-to-face retargeting by transmitting the expression parameters to the different faces.
A finite volume method for approximating 3D diffusion operators on general meshes
Authors: F. Hermeline
Venue: Journal of Computational Physics (2009)

A finite volume method is presented for discretizing 3D diffusion operators with variable full tensor coefficients. This method handles anisotropic, non-symmetric or discontinuous variable tensor coefficients while distorted, non-matching or non-convex n-faced polyhedron meshes can be used. For meshes of polyhedra whose faces have not more than four edges, the associated matrix is positive definite (and symmetric if the diffusion tensor is symmetric). A second-order (resp. first-order) accuracy is numerically observed for the solution (resp. gradient of the solution).
Message fragmentation in opportunistic DTNs
Authors: Mikko Pitkanen, Ari Keranen, Jorg Ott
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Delay-tolerant networking is used for communication in challenged environments such as MANETs, in which links are unstable and end-to-end paths between communicating nodes may not exist. Messages may be significantly larger than packets in IP networks. Large messages lead to longer transfer times rendering it more likely that a link breaks in the middle of a message transfer. This motivates investigating how to support partial message transfers through fragmentation. In this paper, we formulate fragmentation independent of routing algorithms, introduce several fragmentation strategies, and evaluate these by simulations to derive recommendations for using fragmentation in DTNs.
Haplotype Inference in Complex Pedigrees
Authors: Bonnie Kirkpatrick, Javier Rosa, Eran Halperin, Richard M. Karp
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

Despite the desirable information contained in complex pedigree datasets, analysis methods struggle to efficiently process these datasets. The attractiveness of pedigree data sets is their power for detecting rare variants, particularly in comparison with studies of unrelated individuals. In addition, rather than assuming individuals in a study are unrelated, knowledge of their relationships can avoid spurious results due to confounding population structure effects. However, a major challenge for the applicability of pedigree methods is the ability handle complex pedigrees, having multiple founding lineages, inbreeding, and half-sibling relationships.A key ingredient in association studies is imputation and inference of haplotypes from genotype data. Existing haplotype inference methods either do not efficiently scales to complex pedigrees or their accuracy is limited. In this paper, we present algorithms for efficient haplotype inference and imputation in complex pedigrees. Our method, PhyloPed, leverages the perfect phylogeny model, resulting in an efficient method with high accuracy. In addition, PhyloPed effectively combines the founder haplotype information from different lineages and is immune to inaccuracies in prior information about the founders.
Trapping of cells by insulator-based dielectrophoresis using open-top microstructures
Authors: Chun-Ping Jen, Teng-Wen Chen
Venue: Microsystem Technologies (2009)

The ability to manipulate biological cells is a fundamental need of many biological and medical applications. Insulator-based dielectrophoresis (iDEP) trapping involves the use of insulating structures that squeeze the electric field in a conductive solution to create a nonuniform electric field. In this work, a microchip was designed and fabricated for iDEP trapping with open-top microstructures. Microelectrodes were deposited on the substrate and the voltage required was minimized by reducing the distance between them. Human carcinoma (HeLa) cells were trapped under different frequencies to demonstrate the usability of the present microchip. Negative and positive dielectrophoresis (DEP) of cells were observed at low and high frequencies, respectively. The open-top microstructures are suitable for trapping cells and biological samples that can then easily undergo further treatment, such as culturing or contact detection. Since the cover is absent in open-top microstructures, there is no interference in the intensity of the emitted light during fluorescent detection. Furthermore, the Joule heat, which is generated by the application of high voltage in the open-top microstructure, can be dissipated more effectively.
A performance evaluation protocol for symbol spotting systems in terms of recognition and location indices
Authors: Mar&#x00e7;al Rusi&#x00f1;ol, Josep Llad&#x00f3;s
Venue: International Journal on Document Analysis and Recognition (2009)

Symbol spotting systems are intended to retrieve regions of interest from a document image database where the queried symbol is likely to be found. They shall have the ability to recognize and locate graphical symbols in a single step. In this paper, we present a set of measures to evaluate the performance of a symbol spotting system in terms of recognition abilities, location accuracy and scalability. We show that the proposed measures allow to determine the weaknesses and strengths of different methods. In particular we have tested a symbol spotting method based on a set of four different off-the-shelf shape descriptors.
Cross-lingual speech recognition under runtime resource constraints
Authors: Dong Yu, Li Deng, Peng Liu, Jian Wu, Yifan Gong, Alex Acero
Venue: Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing (2009)

This paper proposes and compares four cross-lingual and bilingual automatic speech recognition techniques under the constraint that only the acoustic model (AM) of the native language is used at runtime. The first three techniques fall into the category of lexicon conversion where each phoneme sequence (PHS) in the foreign language (FL) lexicon is mapped into the native language (NL) phoneme sequence. The first technique determines the PHS mapping through the international phonetic alphabet (IPA) features; The second and third techniques are data-driven. They determine the mapping by converting the PHS into corresponding context-independent and context-dependent hidden Markov models (HMMs) respectively and searching for the NL PHS with the least Kullback-Leibler divergence (KLD) between the HMMs. The fourth technique falls into the category of AM merging where the FL's AM is merged into the NL's AM by mapping each senone in the FL's AM to the senone in the NL's AM with the minimum KLD. We discuss the strengths and limitations of each technique developed, report empirical evaluation results on recognizing English utterances with a Korean recognizer, and demonstrate the high correlation between the average KLD and the word error rate (WER). The results show that the AM merging technique performs the best, achieving 60% relative WER reduction over the IPA-based technique.
Comparing bioinformatics software development by computer scientists and biologists: An exploratory study
Authors: Parmit K. Chilana, Carole L. Palmer, Andrew J. Ko
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering for Computational Science and Engineering (2009)

We present the results of a study designed to better understand information-seeking activities in bioinformatics software development by computer scientists and biologists. We collected data through semi-structured interviews with eight participants from four different bioinformatics labs in North America. The research focus within these labs ranged from computational biology to applied molecular biology and biochemistry. The findings indicate that colleagues play a significant role in information seeking activities, but there is need for better methods of capturing and retaining information from them during development. Also, in terms of online information sources, there is need for more centralization, improved access and organization of resources, and more consistency among formats. More broadly, the findings illustrate a variety of information problems that end-user biologists and professional software developers face in developing bioinformatics software and how they are influenced by the level of domain knowledge and technical expertise.
Changing Attitudes and Performance with Computer-generated Social Models
Authors: Rinat B. Rosenberg-Kima, E. Ashby Plant, Amy L. Baylor, Celeste E. Doerr
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Women's under-representation in fields such as engineering may result in part from female students' negative beliefs regarding these fields and their low self-efficacy for these fields. Empirical evidence indicates that computer-generated interface agents are effective in influencing students' interest, motivation, attitudes, and self-efficacy. Hence, in this experimental study, we investigated the potential of interface agents to serve as effective social models for changing attitudes regarding the utility of math and the hard sciences and self-efficacy for these fields. 113 middle-school students interacted with either a female or a male computer-generated interface agent or they did not interact with an interface agent. The findings from this study indicate that interface agents may be used effectively as social models for influencing middle school students' attitudes and beliefs about mathematics and the hard sciences and their mathematical ability. Nevertheless, the efficacy of the agent depended on the characteristics of the agent with the female agent tending to be the most effective regardless of the subject gender.
An Iterative Multiresolution Scheme for SFM with Missing Data
Authors: Carme Julià, Angel D. Sappa, Felipe Lumbreras, Joan Serrat, Antonio López
Venue: Journal of Mathematical Imaging and Vision (2009)

Several techniques have been proposed for tackling the Structure from Motion problem through factorization in the case of missing data. However, when the percentage of unknown data is high, most of them may not perform as well as expected. Focussing on this problem, an iterative multiresolution scheme, which aims at recovering missing entries in the originally given input matrix, is proposed. Information recovered following a coarse-to-fine strategy is used for filling in the missing entries. The objective is to recover, as much as possible, missing data in the given matrix. Thus, when a factorization technique is applied to the partially or totally filled in matrix, instead of to the originally given input one, better results will be obtained. An evaluation study about the robustness to missing and noisy data is reported. Experimental results obtained with synthetic and real video sequences are presented to show the viability of the proposed approach.
Applications of high dimensional model representations to computer vision
Authors: Emre Demiralp
Venue: Proceedings of the 2nd WSEAS international conference on Multivariate analysis and its application in science and engineering (2009)

A new and powerful method for matrix decomposition is developed in this work. It is similar to singular value decomposition and the main idea comes from the univariate approximation of a function, given on a planar grid's nodes, by two variable high dimensional model representation. The proposed method is less iteration dependent than the singular value decomposition and the components are determined via straightforward steps containing recursions. It seems to have more capabilities than the singular value decomposition as an alternative method. An illustrative application is also given.