ppxscal/embedding_network huggingface dataset:
CCNA 100 Success Secrets
Authors: Gerard Blokdijk
Venue:  (2007)

There has never been a CCNA manual like this. 100 Success Secrets is not about the ins and outs of CCNA. Instead, it answers the top 100 questions that we are asked, that we come across in forums, in our consultancy and education programs. It tells exactly how to deal with those questions, with tips never before offered in print. This book is also not about CCNA's best practice and standards details. It introduces everything you want to know to be successful with CCNA. Samples of the content: What Should My CCNA Professional Resume Show? Sample CCNA Semester 2 Final Questions CCNA Study Guides for the CCNA Exam Selecting a CCNA Simulator to Practice With The Power Of the CCNA Study Guide The Particulars of CCNA Test v1.2 The Value of CCNA Resumes Downloading CCNA Quick Reference Sheets Can Be Helpful Looking for CCNA Test Answers? The Importance Cisco Certified Network Associate CCNA Practice Test The Power Of a CCNA Study Guide CCNA Prep Your Complete Solution Before Exams There's something new on practically every page of this new edition, and Gerard Blokdijk brings his celebrated wit and expertise to every one of them. CCNA 100 Success Secrets will give you the CCNA advantage to put you in the lead. 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
Handbook of Fingerprint Recognition, 2nd edition
Authors: Davide Maltoni, Dario Maio, Anil K. Jain, Salil Prabhakar
Venue:  (2009)

This handbook provides in-depth coverage of the most recent advances and practices. Readers will find comprehensive and authoritative coverage of all the major concepts, topics, and security methods associated with fingerprint recognition. Written with the same formula that made the success of the first edition, the book includes the most recent state-of-the-art techniques in the field, as well as enhanced and updated chapters covering sensor technology, performance evaluation, standards, and securing fingerprint systems. The accompanying DVD also provides FVC2004 DB.The second edition of this comprehensive and authoritative reference, written by leading international researchers, covers all critical aspects of fingerprint security systems and technology. It is an absolutely essential resource for all biometric security professionals, researchers, practitioners, developers, and systems administrators.
An extended GS method for dense linear systems
Authors: Hiroshi Niki, Toshiyuki Kohno, Kuniyoshi Abe
Venue: Journal of Computational and Applied Mathematics (2009)

Davey and Rosindale [K. Davey, I. Rosindale, An iterative solution scheme for systems of boundary element equations, Internat. J. Numer. Methods Engrg. 37 (1994) 1399-1411] derived the GSOR method, which uses an upper triangular matrix @W in order to solve dense linear systems. By applying functional analysis, the authors presented an expression for the optimum @W. Moreover, Davey and Bounds [K. Davey, S. Bounds, A generalized SOR method for dense linear systems of boundary element equations, SIAM J. Comput. 19 (1998) 953-967] also introduced further interesting results. In this note, we employ a matrix analysis approach to investigate these schemes, and derive theorems that compare these schemes with existing preconditioners for dense linear systems. We show that the convergence rate of the Gauss-Seidel method with preconditioner P"G is superior to that of the GSOR method. Moreover, we define some splittings associated with the iterative schemes. Some numerical examples are reported to confirm the theoretical analysis. We show that the EGS method with preconditioner P"G(@c"o"p"t) produces an extremely small spectral radius in comparison with the other schemes considered.
Preference-based Inconsistency Proving: When the Failure of the Best Is Sufficient
Authors: Ulrich Junker
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)

Inconsistency proving of CSPs is typically achieved by a combination of systematic search and arc consistency, which can both be characterized as resolution. However, it is well-known that there are cases where resolution produces exponential contradiction proofs, although proofs of polynomial size exist. For this reason, we will use optimization methods to reduce the proof size globally by 1. decomposing the original unsatisfiability problem into a conjunction of satisfiable subproblems and by 2. finding an ordering that separates the solution spaces of the subproblems. This principle allows Operation Research methods to prove the inconsistency of overconstrained linear programs even if domains are infinite. We exploit the principle for testing the satisfiability of global user requirements in product configuration problems.
Argue tuProlog: A Lightweight Argumentation Engine for Agent Applications
Authors: Daniel Bryant, Paul J. Krause, Gerard A. W. Vreeswijk
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

Argumentation is becoming increasingly important in the design and implementation of autonomous software agents. We believe that agents engaged in decision-making and reasoning should have access to a general purpose argumentation engine that can be configured to conform to one of a range of semantics. In this paper we discuss our current work on a prototype light-weight Java-based argumentation engine that can be used to implement a non-monotonic reasoning component in Internet or agent-based applications.
Arizona Literature Mapper: An integrated approach to monitor and analyze global bioterrorism research literature
Authors: Yan Dang, Yulei Zhang, Hsinchun Chen, Paul Jen-Hwa Hu, Susan A. Brown, Cathy Larson
Venue: Journal of the American Society for Information Science and Technology (2009)

Biomedical research is critical to biodefense, which is drawing increasing attention from governments globally as well as from various research communities. The U.S. government has been closely monitoring and regulating biomedical research activities, particularly those studying or involving bioterrorism agents or diseases. Effective surveillance requires comprehensive understanding of extant biomedical research and timely detection of new developments or emerging trends. The rapid knowledge expansion, technical breakthroughs, and spiraling collaboration networks demand greater support for literature search and sharing, which cannot be effectively supported by conventional literature search mechanisms or systems. In this study, we propose an integrated approach that integrates advanced techniques for content analysis, network analysis, and information visualization. We design and implement Arizona Literature Mapper, a Web-based portal that allows users to gain timely, comprehensive understanding of bioterrorism research, including leading scientists, research groups, institutions as well as insights about current mainstream interests or emerging trends. We conduct two user studies to evaluate Arizona Literature Mapper and include a well-known system for benchmarking purposes. According to our results, Arizona Literature Mapper is significantly more effective for supporting users' search of bioterrorism publications than PubMed. Users consider Arizona Literature Mapper more useful and easier to use than PubMed. Users are also more satisfied with Arizona Literature Mapper and show stronger intentions to use it in the future. Assessments of Arizona Literature Mapper's analysis functions are also positive, as our subjects consider them useful, easy to use, and satisfactory. Our results have important implications that are also discussed in the article. &copy; 2009 Wiley Periodicals, Inc.
Pattern-Based Genetic Algorithm Approach to Coverage Path Planning for Mobile Robots
Authors: Muzaffer Kapanoglu, Metin Ozkan, Ahmet Yazıcı, Osman Parlaktuna
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Sensor-based mobile robot coverage path planning (MRCPP) problem is a challenging problem in robotic management. We here develop a genetic algorithm (GA) for MRCPP problems. The area subject to coverage is modeled with disks representing the range of sensing devices. Then the problem is defined as finding a path which runs through the center of each disk at least once with minimal cost of full coverage. The proposed GA utilizes prioritized neighborhood-disk information to generate practical and high-quality paths for the mobile robot. Prioritized movement patterns are designed to generate efficient rectilinear coverage paths with no narrow-angle turn; they enable GA to find optimal or near-optimal solutions. The results of GA are compared with a well-known approach called backtracking spiral algorithm (BSA). Experiments are also carried out using P3-DX mobile robots in the laboratory environment.
AMPLIA Learning Environment Architecture
Authors: Cecilia Flores, Louise Seixas, João Gluz, Rosa Vicari, Diego Patrício, Felipe Giacomel, Leandro Gonçalves
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

The architecture of a multi-agent learning environment (AMPLIA) is detailed. The design of each agent is divided into Decision, Operational and Interaction levels. Decisions are modeled by means of a probabilistic inference process. At the operational level, each agent has a different set of modules or software components and a single ontology is used in the communication, sharing knowledge and information. The learning process of a student at an experimental course is presented.
Local Scale Measure for Remote Sensing Images
Authors: Bin Luo, Jean-François Aujol, Yann Gousseau
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

This paper addresses the problem of defining a scale measure for digital images, that is, the problem of assigning a meaningful scale information to each pixel. We propose a method relying on the set of level lines of an image, the so-called topographic map. We make use of the hierarchical structure of level lines to associate a level line to each pixel, enabling the computation of local scales. This computation is made under the assumption that blur is constant over the image, and therefore adapted to the case of satellite images. We then investigate the link between the proposed definition of local scale and recent methods relying on total variation diffusion. Eventually, we perform various experiments illustrating the spatial accuracy of the proposed approach.
Time Contexts in Document-Driven Projects on the Web: From Time-Sensitive Links towards an Ontology of Time
Authors: Anneli Heimbürger, Jari Multisilta, Kai Ojansuu
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

Time is the core resource of a project. A project combines human and non-human resources together into a temporary organization that aims to achieve a specified objective. A project has a temporal structure of its own, with related operations and deliverables that also are functions of time. In knowledge-intensive organizations, more and more projects are distributed, document-driven processes with parallel phases and tasks. Change management between parallel phases and tasks with associated documents has become one of the core functions in distributed project management. In our paper, we present a framework for time contexts in distributed project management environments, particularly from a project manager's point of view. In document-driven projects, document life-cycles, the statuses of documents, temporal relations between documents, all define the document logistics of a project and describe the overall temporal structure of a project. We analyze the life-cycles of project documents with related time statuses and temporal relations between different documents. We apply time-sensitive links to illustrate the temporal characteristics of project documents and to construct time-based navigation support through the life-cycles and temporal relations of the project documents in single and simple project environments. Our approach is designed to be applied especially to the analysis phase of document logistics from a time-based project management point of view before an organization selects and implements a commercial or customized distributed project management system. We extend our approach to more complex, multi-project environments. We discuss an ontology of time, and Topic Maps as a means of analyzing, deriving and managing time rule sets separated from project document space. The focus of our approach is on knowledge-intensive organizations, on Web-based document-centric projects and on solutions based on W3C Recommendations.
iPhone Fully Loaded
Authors: Andy Ihnatko
Venue:  (2007)

iPhone Fully Loaded is a one-of-a-kind reference that teaches you how to fully exploit the power of your Phone or iPod touch. Clear step-by-step instructions teach you how to convert any form of home, office, or online media -- dusty LPs, movies on DVD, spreadsheets, databases, presentations, downloadable books, comic books, as well as music and video to an iPhone or iPod Touch compatible format. Written by wildly popular technology expert and Chicago Sun Times columnist Andy Ihnatko, iPhone Fully Loaded is a full-color guide designed to work for both Mac OS X and Windows users. From uploading Web pages to downloading television shows and a variety of documents, including Microsoft Word, Excel, and PowerPoint documents, the iPhone does much more than make phone calls, play music, and send e-mail.
An optimal wake-up scheduling algorithm for minimizing energy consumption while limiting maximum delay in a mesh sensor network
Authors: Reuven Cohen, Boris Kapchits
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm is optimal and requires simple computing operations that can be implemented by simple devices. To the best of our knowledge, this is the first paper to propose a sensor wake-up frequency that depends on the sensor's location in the routing paths. Using simulations, we show that the proposed algorithm significantly increases the lifetime of the network while guaranteeing a maximum on the end-to-end delay.
Learning structural SVMs with latent variables
Authors: Chun-Nam John Yu, Thorsten Joachims
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application problems, with an optimization problem that can be solved efficiently using Concave-Convex Programming. The generality and performance of the approach is demonstrated through three applications including motiffinding, noun-phrase coreference resolution, and optimizing precision at k in information retrieval.
A flow calculus of mwp-bounds for complexity analysis
Authors: Neil D. Jones, Lars Kristiansen
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We present a method for certifying that the values computed by an imperative program will be bounded by polynomials in the program's inputs. To this end, we introduce mwp-matrices and define a semantic relation &models; C : M, where C is a program and M is an mwp-matrix. It follows straightforwardly from our definitions that there exists M such that &models; C : M holds iff every value computed by C is bounded by a polynomial in the inputs. Furthermore, we provide a syntactical proof calculus and define the relation &vdash; C : M to hold iff there exists a derivation in the calculus where C : M is the bottom line. We prove that &vdash; C : M implies &models; C : M. By means of exhaustive proof search, an algorithm can decide if there exists M such that the relation &vdash; C : M holds, and thus, our results yield a computational method.
Computing the behavior of malicious code with function extraction technology
Authors: Richard Linger, Stacy Prowell, Kirk Sayre
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Modern society is irreversibly dependent on computer-based infrastructure systems of astonishing scope and complexity. Yet these systems are increasingly vulnerable to disabling intrusions by adversaries equipped with the knowledge and resources to mount sophisticated attacks [1, 2]. Technical and organizational preparation for major attacks is essential to national security. Preparation takes time and effort, and when a major attack occurs, it is too late to prepare. Preparation must provide capability for fast and precise analysis of the technical structure of an attack as a basis for fast response to limit damage and deploy countermeasures.
A SWIFT Take on Identity Management
Authors: Gabriel López, Óscar Cánovas, Antonio F. Gómez-Skarmeta, Joao Girao
Venue: Computer (2009)

A proposed identity management framework provides privacy protection, by means of virtual identities, and cross-layer single sign-on for users who subscribe to multiple service and identity providers.
Policies of System Level Pipeline Modeling
Authors: Ed Harcourt
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Pipelining is a well understood and often used implementation technique for increasing the performance of a hardware system. We develop several SystemC/C++ modeling techniques that allow us to quickly model, simulate, and evaluate pipelines. We employ a small domain specific language (DSL) based on resource usage patterns that automates the drudgery of boilerplate code needed to configure connectivity in simulation models. The DSL is embedded directly in the host modeling language SystemC/C++. Additionally we develop several techniques for parameterizing a pipeline's behavior based on policies of function, communication, and timing (performance modeling).
Towards Information Security Ontology in Business Networks
Authors: Jukka Aaltonen, Oliver Krone, Pekka Mustonen
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

The existing business information and asset protection models are mainly based on organizational aspects of security management. Having the focal company as the unit of analysis makes it difficult to represent the complex network-wide phenomena, for example inter-organizational knowledge exchange and dynamic nature of security requirements. Here, a future research perspective is outlined, that makes ground to enable the design of ontologies applicable in the domain of knowledge exchange and information security in business networks. The topics that should be addressed include conceptual review of existing security models, analysis of business resource classification approaches, extending service oriented roles-linkage relationship models with network-wide security requirements, and the research perspectives in knowledge integration and requirements engineering.
HIROFILOS: a medical expert system for prostate diseases
Authors: Constantinos Koutsojannis, Maria Tsimara, Eman Nabil
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

Prostate gland diseases, including cancer are estimated to be one of the leading cause of male death worldwide and its management is based on guidelines regarding diagnosis, evaluation, treatment and continuing care. In this study a fuzzy expert system for diagnosing, and learning purpose of the prostate diseases is described. HIROFILOS is a fuzzy expert system for diagnosis and treatment of prostate diseases according to symptoms that are realized in one patient and usually recorded through his clinical examination as well as specific test results. The user-friendly proposed intelligent system is accommodated on a hospital web page for use as a decision support system for resident doctors, as an educational tool for medical students, as well as, an introductory advisory tool for interested patients. It is based on knowledge representation provided from urology experts in combination with rich bibliographic search and study ratified with statistical results from clinical practice. Preliminary experimental results on a real patient hospital database provide an acceptable performance that can be improved using more than one computational intelligence approaches in the future.
A visualisation tool for the programming process
Authors: Charles R. Boisvert
Venue: ACM SIGCSE Bulletin (2009)

eL-CID (e-Learning to Communicate Iterative Development) demonstrates computer programs' iterative design using computer animation. It translates descriptions of iterative editing into a dynamic visualisation of the changes, as if code was being edited in front of the user. A range of animations has been developed and the system evaluated through action research. The evaluation shows that it is particulary useful as a reflective tool, revealing the problem solving inherent to development.
Turkish pre-service science and mathematics teachers' computer related self-efficacies, attitudes, and the relationship between these variables
Authors: Savas Pamuk, Deniz Peker
Venue: Computers Education (2009)

The purpose of this study was to investigate Turkish pre-service science and mathematics teachers' computer self-efficacies (CSEs) and computer attitude (CA) considering gender, year in program, and computer ownership as independent variables. Additionally the study aimed to examine the relationship between CSE and CA. Computer Self-efficacy Scale (CSES) and Computer Attitude Scale (CAS) were administered to 605 freshmen and senior teacher candidates. Descriptive results indicated that overall pre-service teachers had relatively high scores on both scales. Multivariate analysis of variance showed that a participant's gender was not a significant factor on his/her CSE and CA scores except for the computer liking sub-scale of the CAS. Seniors had higher scores than freshmen in the CSES and in the confidence dimension of the CAS. Those participants who owned computers had significantly higher scores on the CSES and CAS as compared to those who did not own a computer. A significant three-way interaction was found among the three independent variables, namely gender, major of study and computer ownership. Finally, correlational analysis showed that participants' CSES scores related to sub-scale scores of the CAS at varying degrees.
Mass Segmentation using a Pattern Matching Approach with a Mutual Information Based Metric
Authors: Arnau Oliver, Jordi Freixenet, Joan Martí, Marta Peracaula
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

As an ongoing effort to develop a computer aided system for the detection of masses on mammograms, we propose on this work a new model-based segmentation algorithm. The algorithm is based on a template matching scheme by using the mutual information approach in the similarity metric. Thus, the system will be able to determine if it exists a true mass on the studying image. The proposal was developed and evaluated using a database of 120 mammograms, 40 mammograms with confirmed masses and 80 normal ones. CAD performance was assessed using Receiver Operating Characteristics (ROC) and Free Receiver Operating Characteristics (FROC) analysis. The results prove the validity of the proposed method.