ppxscal/embedding_network huggingface dataset:
Design Accessible Web Sites: 36 Keys to Creating Content for All Audiences and Platforms
Authors: Jeremy Sydik
Venue:  (2007)

It's not a one-browser web anymore. You need to reach audiences that use cell phones, PDAs, game consoles, or other "alternative" browsers, as well as users with disabilities. Legal requirements for assistive technologies as well as a wide array of new browsing experiences means you need to concentrate on semantics, alternate access paths, and progressive enhancement. Give your audience the power to interact with your content on their own terms. It's the right thing to do, and with a $100 billion a year market for accessible content, new laws and new technologies, you can't afford to ignore accessibility. With this book, you'll learn basic principles and techniques for developing accessible HTML, audio, video, and multimedia content. In addition, you will understand how to apply the principles you learn in this book to new technologies when they emerge. You'll learn how to: Use best practices of accessibility to develop accessible web content Build testing into projects to improve results and reduce costs Create high quality alternative representations for your audience Add accessibility features to external media like PDF and Flash Negotiate the terrain of accessibility standards Apply principles of accessiblity to new technologies as they emerge 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
On guiding the augmentation of an automated test suite via mutation analysis
Authors: Ben H. Smith, Laurie Williams
Venue: Empirical Software Engineering (2009)

Mutation testing has traditionally been used as a defect injection technique to assess the effectiveness of a test suite as represented by a "mutation score." Recently, mutation testing tools have become more efficient, and industrial usage of mutation analysis is experiencing growth. Mutation analysis entails adding or modifying test cases until the test suite is sufficient to detect as many mutants as possible and the mutation score is satisfactory. The augmented test suite resulting from mutation analysis may reveal latent faults and provides a stronger test suite to detect future errors which might be injected. Software engineers often look for guidance on how to augment their test suite using information provided by line and/or branch coverage tools. As the use of mutation analysis grows, software engineers will want to know how the emerging technique compares with and/or complements coverage analysis for guiding the augmentation of an automated test suite. Additionally, software engineers can benefit from an enhanced understanding of efficient mutation analysis techniques. To address these needs for additional information about mutation analysis, we conducted an empirical study of the use of mutation analysis on two open source projects. Our results indicate that a focused effort on increasing mutation score leads to a corresponding increase in line and branch coverage to the point that line coverage, branch coverage and mutation score reach a maximum but leave some types of code structures uncovered. Mutation analysis guides the creation of additional "common programmer error" tests beyond those written to increase line and branch coverage. We also found that 74% of our chosen set of mutation operators is useful, on average, for producing new tests. The remaining 26% of mutation operators did not produce new test cases because their mutants were immediately detected by the initial test suite, indirectly detected by test suites we added to detect other mutants, or were not able to be detected by any test.
Factored conditional restricted Boltzmann Machines for modeling motion style
Authors: Graham W. Taylor, Geoffrey E. Hinton
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

The Conditional Restricted Boltzmann Machine (CRBM) is a recently proposed model for time series that has a rich, distributed hidden state and permits simple, exact inference. We present a new model, based on the CRBM that preserves its most important computational properties and includes multiplicative three-way interactions that allow the effective interaction weight between two units to be modulated by the dynamic state of a third unit. We factor the three-way weight tensor implied by the multiplicative model, reducing the number of parameters from O(N3) to O(N2). The result is an efficient, compact model whose effectiveness we demonstrate by modeling human motion. Like the CRBM, our model can capture diverse styles of motion with a single set of parameters, and the three-way interactions greatly improve the model's ability to blend motion styles or to transition smoothly among them.
A power delivery and decoupling network minimizing ohmic loss and supply voltage variation in silicon nanoscale technologies
Authors: Mark M. Budnik, Kaushik Roy
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

di/dt and IR events may cause large supply voltage variations and ohmic losses due to system parasitics. Today, decoupling capacitance is used to minimize the supply voltage variation, and parallelism in the power delivery path is used to reduce ohmic loss. Future integrated circuits, however, will exhibit large enough currents and current transients to mandate additional safeguards. A novel, distributed power delivery and decoupling network is introduced that reduces the supply voltage variation magnitude by more than 66% or the future ohmic loss by more than 27% (compared to today's power delivery and decoupling networks) using conventional processing and packaging techniques.
A Guided Tour of Microsoft Expression Web, 1st edition
Authors: Corinne Hoisington
Venue:  (2007)

This CD of movie tutorials will help you get up to speed quickly on Microsoft Expression Web, the newest web design program from Microsoft. Dynamic and engaging author Corinne Hoisington presents the highlights and key new features, including creating a web site using different tools and CSS style sheets.
Discriminant Saliency, the Detection of Suspicious Coincidences, and Applications to Visual Recognition
Authors: Dashan Gao, Sunhyoung Han, Nuno Vasconcelos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

A discriminant formulation of top-down visual saliency, intrinsically connected to the recognition problem, is proposed. The new formulation is shown to be closely related to a number of classical principles for the organization of perceptual systems, including infomax, inference by detection of suspicious coincidences, classification with minimal uncertainty, and classification with minimum probability of error. The implementation of these principles with computational parsimony, by exploitation of the statistics of natural images, is investigated. It is shown that Barlow's principle of inference by the detection of suspicious coincidences enables computationally efficient saliency measures which are nearly optimal for classification. This principle is adopted for the solution of the two fundamental problems in discriminant saliency, feature selection and saliency detection. The resulting saliency detector is shown to have a number of interesting properties, and act effectively as a focus of attention mechanism for the selection of interest points according to their relevance for visual recognition. Experimental evidence shows that the selected points have good performance with respect to 1) the ability to localize objects embedded in significant amounts of clutter, 2) the ability to capture information relevant for image classification, and 3) the richness of the set of visual attributes that can be considered salient.
Semantic representation and recognition of human activities
Authors: J. K. Aggarwal
Venue:  (2008)

This dissertation describes a methodology for automated recognition of complex human activities. The dissertation presents a general framework which reliably recognizes various types of high-level human activities including human actions, human-human interactions, human-object interactions, and group activities. Our approach is a description-based approach, which enables a user to encode the structure of a high-level human activity as a formal representation. Recognition of human activities is done by semantically matching constructed representations with actual observations. The methodology uses a context-free grammar (CFG) based representation scheme as a formal syntax for representing composite activities. Our CFG-based representation enables us to define complex human activities based on simpler activities or movements. We have constructed a hierarchical framework which automatically matches activity representations with input observations. In the low-level of the system, image sequences are processed to extract poses and gestures. Based on the recognition of gestures, the high-level of the system hierarchically recognizes complex occurring human activities by searching for gestures that satisfies the temporal, spatial, and logical structure described in the representation. The concept of hallucinations and a probabilistic semantic-level recognition algorithm is introduced to cope with imperfect lower-layers. As a result, the system recognizes human activities including &lsquo;fighting&rsquo;, &lsquo;assault&rsquo;, &lsquo;a person leaving a suitcase&rsquo;, and &lsquo;a group of thieves stealing an object from owners&rsquo;, which are high-level activities that previous systems had difficulties. The experimental results show that our system reliably recognizes sequences of various types of complex human activities with a high recognition rate.
Away with computer literacy modules at universities, or not?
Authors: Engela Dednam
Venue: Proceedings of the 2009 Annual Conference of the Southern African Computer Lecturers' Association (2009)

In this paper an investigation into the need of university students to be computer literate and their computer literacy profile is reported. Questionnaires were prepared and sent to programme directors of programmes that included computer literacy modules in their curricula. The directors, in response, indicated which of the listed outcomes their students use during their studies. They also indicated additional desired outcomes which were not included in the current computer literacy modules. Statistics were also drawn to determine whether the number of students who are not computer literate decreased over the past few years or not. Data from questionnaires to students were also analysed to determine what their computer literacy levels are before they commence with the basic computer literacy module. It is concluded that it is still necessary for tertiary institutions to continue to present computer literacy modules because large numbers of students still do not have sufficient computer knowledge to apply during their studies and later in the work place.
Scholarly research process: investigating the effects of link type and directionality
Authors: Mark Leslie Alford, Emilia Mendes
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Hypertext research has discovered new ways to explore, represent and visualise data and has led to many improvements in the usability and usefulness of systems. However, in the field of scholarly writing research, several studies discuss the need for improving the current state of affairs [18][24][29]. This research aimed to investigate whether typed and/or bi-directional links have an effect on users' performance and confidence when undertaking a literature survey [18], considered one of the phases of a scholarly writing process [29]. Two empirical studies were conducted - a survey and a formal experiment, and results showed that both typed and bi-directional links had significant effect on users' performance and confidence when undertaking common early scholarly writing tasks, specifically benefiting tasks relating to surveying existing literature.
AVER: Argument Visualization for Evidential Reasoning
Authors: Susan W. van den Braak, Gerard A. W. Vreeswijk
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

This paper reports on the ongoing development of a collaborative, web-based application for argument visualization named AVER (Argument Visualization for Evidential Reasoning). It is targeted at police officers who may use it to express their reasoning about a case based on evidence. AVER provides an interface which supports the construction and visualization of argument graphs and handles more advanced argumentation concepts such as schemes. Further, it is based on a known argument ontology and has a solid theoretical underpinning in formal theories of argumentation.
Computational approaches to protein classification and multiple whole genome alignment
Authors: Jitender S. Deogun
Venue:  (2008)

Protein classification is an important problem in automated protein functional and structural annotation. Alignment-based methods have degraded performance when the sequence identity among proteins is low. Therefore, we work on alignment-free methods for protein classification in the first part of this dissertation. G protein-coupled receptors (GPCRs) and beta-barrel outer membrane proteins are chosen as test cases because of their low overall sequence identity and their importance in biological research. We propose to use the probabilistic suffix tree (PST), a generative classification model that can be constructed from unaligned protein sequences, to model protein families and to classify proteins. We then investigate how different reduced amino acid alphabets impact protein classification when simple sequential features are used by the support vector machine (SVM), a discriminative classification model, to classify proteins. Compared with using the full alphabet of 20 amino acids, using reduced alphabets of as few as 2 letters can provide similar performance. In a comparative study, the PST provides the classification accuracy rate of 92.62% while the SVM using sequential features on a four-letter reduced alphabet has 92.41% in 2-fold cross-validation tests on 19 level I GPCR subfamilies, comparing favorably with a variety of other classification methods which have the best accuracy rate of 91.15% among all. We further use amino acid indices of physicochemical properties to convert protein sequences into feature vectors for the SVM, examining a large range of different physicochemical properties with respect to their ability for protein classification. Hydrophobicity related indices provide best performance for both GPCR classification and beta-barrel outer membrane protein discrimination. We have previously proposed the EMAGEN (Efficient Multiple Alignment algorithm for whole GENomes) system for multiple whole genome alignment. In the second part of this dissertation, we propose an improved method EMAGEN-R to incorporate genome rearrangement events in alignment. EMAGEN-R can successfully detect rearrangement events and provide improved alignments in experiments.
Ten ways to waste a parallel computer
Authors: Katherine Yelick
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

As clock speed increases taper off and hardware designers struggle to scale parallelism within a chip, software developers and researchers must face the challenge of writing portable software with no clear architectural target. On the hardware side, energy considerations will dominate many of the design decisions, and will ultimately limit what systems and applications can be built. This is especially true at the high end, where the next major milestone of exascale computing will be unattainable without major improvements in efficiency. Although hardware designers have long worried about the efficiency of their designs, especially for battery-operated devices, software developers in general have not. To illustrate this point, I will describe some of the top ways to waste time and therefore energy waiting for communication, synchronization, or interactions with users or other systems. Data movement, rather than computation, is the big consumer of energy, yet software often moves data up and down the memory hierarchy or across a network multiple times. At the same time, hardware designers need to take into account the constraints of the computational problems that will run on their systems, as a design that is poorly matched to the computational requirements will end up being inefficient. Drawing on my own experience in scientific computing, I will give examples of how to make the combination of hardware, algorithms and software more efficient, but also describe some of the challenges that are inherent in the application problems we want to solve. The community needs to take an integrated approach to the problem, and consider how much business or science can be done per Joule, rather than optimizing a particular component of the system in isolation. This will require rethinking the algorithms, programming models, and hardware in concert, and therefore an unprecedented level of collaboration and cooperation between hardware and software designers.
Plenary lecture 2ISO standards: measuring software product quality with: an information model
Authors: Rafa E. Al-Qutaish
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

The ISO is developing a new ISO 25000 series on Software Product Quality Requirements and Evaluation (SQuaRE) to improve the interpretation and use of quality measures for software products. This chapter explains how the ISO 19539 Measurement Information Model can be used to implement the ISO 9126 models for software product quality. It also identifies some of the harmonization issues arising as a result of the addition of new documents like ISO 25020 and ISO 25021, in particular with respect to previously published measurement standards for software engineering.
Emerging Technologies in Wireless LANs: Theory, Design, and Deployment, 1st edition
Authors: Benny Bing
Venue:  (2007)

Using fundamental tutorials, standards, case studies, mathematical analysis, and modeling, this book provides the key practical considerations for deploying wireless LANs and a solid understanding of the emerging technologies. It is invaluable resource for researchers and graduate students in electrical engineering and computer science departments and for practitioners in the wireless communications 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
A Redundancy-based Method for Relation Instantiation from the Web
Authors: Viktor de Boer, Maarten van Someren, Bob J. Wielinga
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

The Semantic Web requires automatic ontology population methods. We developed an approach, that given existing ontologies, extracts instances of ontology relations, a specific subtask of ontology population. We use generic, domain independent techniques to extract candidate relation instances from the Web and exploit the redundancy of information on the Web to compensate for loss of precision caused by the use of these generic methods. The candidate relation instances are then ranked based on co-occurrence with a seed set. In an experiment, we extracted instances of the relation between artists and art styles. The results were manually evaluated against selected art resources.
Efficient argumentation over ontology correspondences
Authors: Paul Doran, Valentina Tamma, Ignazio Palmisano, Terry R. Payne
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

The ability to communicate is one of the key capabilities of an agent within a Multi-Agent System. In open environments, where agents are likely to use heterogeneous ontologies, it is necessary to use formally defined ontologies [1] to support communication. However, this requires either a shared ontology, or a set of correspondences (alignment) that map semantically related entities from one ontology to another. The open nature of such environments results in this being unlikely due to few a priori assumptions being made about the agents present; thus requiring techniques for dynamic alignment and reconciliation. To dynamically reconcile heterogeneous ontologies, agents need to be able to agree on an acceptable alignment between their ontologies. Various approaches attempt to resolve ontological mismatches in open environments [8, 4], using negotiation approaches that search the space of alignments to find a mutually acceptable set of correspondences. However, this search can become prohibitively costly when negotiation mechanisms such as argumentation are involved, reaching II(p)2-complete [5]. Hence, it is important to reduce the search space before the argumentation process takes place. The Meaning-based Argumentation approach [8] allows two agents to dynamically and automatically reach consensus by arguing over a set of candidate mappings (or correspondences) obtained from a mapping repository. We have explored the use of Ontology Modularization as a filtering mechanism for reducing the number of candidate mappings, by isolating only those mappings that are relevant to the communication, and hence reducing the size of the search space for the argumentation process.
Merging possibilistic networks
Authors: Salem Benferhat
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

This paper deals with merging multiple-source uncertain pieces of information, which are encoded by means of possibilistic networks. We first show that the merging of possibilistic networks having the same graphical structure can be easily achieved in polynomial time. When possibilistic networks have different graphical structures we show that their fusion can also be efficiently done by extending initial possibilistic networks into a same common structure. We then address two important problems: how to deal with cycles, and how to solve the subnormalization problem which reflects conflicts between sources?
An efficient numerical scheme for singularly perturbed parabolic problems with interior layer
Authors: Kaushik Mukherjee, Srinivasan Natesan
Venue: Neural, Parallel Scientific Computations (2008)

In this article, a class of singularly perturbed parabolic initial-boundary-value problems possessing strong interior layer due to discontinuous convection coefficient are considered. To solve these problems, we propose a numerical scheme which comprises of classical backward-Euler method tor the time discretization and a hybrid finite difference scheme (which is a proper combination of the midpoint upwind scheme in the outer regions and the classical central difference scheme in the interior layer regions) for the spatial discretization. Computationally we show that the proposed numerical scheme is uniformly convergent with respect to the singular perturbation parameter. This is accomplished by constructing a special rectangular mesh involving a piecewise-uniform Shishkin mesh for the spatial variable. Further, we show higher order accuracy of the proposed scheme by comparing it with a classical implicit upwind finite difference scheme.
Boosting the Robustness of Controller Area Networks: CANcentrate and ReCANcentrate
Authors: Manuel Barranco, Julián Proenza, Luís Almeida
Venue: Computer (2009)

Two proposed star architectures for systems based on the Controller Area Network (CAN) protocol aim to improve CAN's error containment and fault tolerance for general distributed embedded systems and safety-critical applications.