ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

You have 0 saved results.
Mark results and click the "Add To Watchlist" link in order to add them to this list.
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Books  (34)
  • Articles  (92,330)
  • Data
  • 2010-2014  (21,358)
  • 2005-2009  (12,762)
  • 1995-1999  (22,277)
  • 1980-1984  (19,404)
  • 1975-1979  (9,921)
  • 1935-1939  (4,462)
  • 1930-1934
  • 1925-1929  (2,180)
  • 2014  (21,358)
  • 2005  (12,762)
  • 1999  (11,845)
  • 1997  (10,432)
  • 1984  (6,406)
  • 1983  (6,413)
  • 1982  (6,585)
  • 1978  (5,968)
  • 1977  (3,953)
  • 1938  (2,250)
  • 1935  (2,212)
  • 1925  (2,180)
  • Computer Science  (92,364)
Collection
  • Books  (34)
  • Articles  (92,330)
  • Data
Language
Years
  • 2010-2014  (21,358)
  • 2005-2009  (12,762)
  • 1995-1999  (22,277)
  • 1980-1984  (19,404)
  • 1975-1979  (9,921)
  • +
Year
  • 1
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Computer programming ; Computer Science ; Programming Techniques
    Description / Table of Contents: The number of Android devices running on Intel processors has increased since Intel and Google announced, in late 2011, that they would be working together to optimize future versions of Android for Intel Atom processors. Today, Intel processors can be found in Android smartphones and tablets made by some of the top manufacturers of Android devices, such as Samsung, Lenovo, and Asus. The increase in Android devices featuring Intel processors has created a demand for Android applications optimized for Intel Architecture: Android Application Development for the Intel® Platform is the perfect introduction for software engineers and mobile app developers. Through well-designed app samples, code samples and case studies, the book teaches Android application development based on the Intel platform—including for smartphones, tablets, and embedded devices—covering performance tuning, debugging and optimization. This book is jointly developed for individual learning by Intel Software College and China Shanghai JiaoTong University
    Pages: Online-Ressource (XX, 520 pages) , 278 illustrations
    ISBN: 9781484201008
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Keywords: Computer science ; Multimedia information systems ; Computer Science ; Computer Science, general ; Multimedia Information Systems
    Description / Table of Contents: Digital Video Concepts, Methods, and Metrics: Quality, Compression, Performance, and Power Trade-off Analysis is a concise reference for professionals in a wide range of applications and vocations. It focuses on giving the reader mastery over the concepts, methods and metrics of digital video coding, so that readers have sufficient understanding to choose and tune coding parameters for optimum results that would suit their particular needs for quality, compression, speed and power. The practical aspects are many: Uploading video to the Internet is only the beginning of a trend where a consumer controls video quality and speed by trading off various other factors. Open source and proprietary applications such as video e-mail, private party content generation, editing and archiving, and cloud asset management would give further control to the end-user. Digital video is frequently compressed and coded for easier storage and transmission. This process involves visual quality loss due to typical data compression techniques and requires use of high performance computing systems. A careful balance between the amount of compression, the visual quality loss and the coding speed is necessary to keep the total system cost down, while delivering a good user experience for various video applications. At the same time, power consumption optimizations are also essential to get the job done on inexpensive consumer platforms. Trade-offs can be made among these factors, and relevant considerations are particularly important in resource-constrained low power devices. To better understand the trade-offs this book discusses a comprehensive set of engineering principles, strategies, methods and metrics. It also exposes readers to approaches on how to differentiate and rank video coding solutions
    Pages: Online-Ressource (XVII, 368 pages) , 115 illustrations
    ISBN: 9781430267133
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Keywords: Computer science ; Computer Science ; Computer Science, general
    Description / Table of Contents: Optimizing HPC Applications with Intel® Cluster Tools takes the reader on a tour of the fast-growing area of high performance computing and the optimization of hybrid programs. These programs typically combine distributed memory and shared memory programming models and use the Message Passing Interface (MPI) and OpenMP for multi-threading to achieve the ultimate goal of high performance at low power consumption on enterprise-class workstations and compute clusters. The book focuses on optimization for clusters consisting of the Intel® Xeon processor, but the optimization methodologies also apply to the Intel® Xeon Phi™ coprocessor and heterogeneous clusters mixing both architectures. Besides the tutorial and reference content, the authors address and refute many myths and misconceptions surrounding the topic. The text is augmented and enriched by descriptions of real-life situations
    Pages: Online-Ressource (XXIV, 300 pages) , 74 illustrations
    ISBN: 9781430264972
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Keywords: Computer science ; Software engineering ; Data encryption (Computer science) ; Computer Science ; Software Engineering/Programming and Operating Systems ; Data Encryption
    Description / Table of Contents: It's our thesis that privacy will be an integral part of the next wave in the technology revolution and that innovators who are emphasizing privacy as an integral part of the product life cycle are on the right track. --The authors of The Privacy Engineer's Manifesto The Privacy Engineer's Manifesto: Getting from Policy to Code to QA to Value is the first book of its kind, offering industry-proven solutions that go beyond mere theory and adding lucid perspectives on the challenges and opportunities raised with the emerging "personal" information economy. The authors, a uniquely skilled team of longtime industry experts, detail how you can build privacy into products, processes, applications, and systems. The book offers insight on translating the guiding light of OECD Privacy Guidelines, the Fair Information Practice Principles (FIPPs), Generally Accepted Privacy Principles (GAPP) and Privacy by Design (PbD) into concrete concepts that organizations, software/hardware engineers, and system administrators/owners can understand and apply throughout the product or process life cycle—regardless of development methodology—from inception to retirement, including data deletion and destruction. In addition to providing practical methods to applying privacy engineering methodologies, the authors detail how to prepare and organize an enterprise or organization to support and manage products, process, systems, and applications that require personal information. The authors also address how to think about and assign value to the personal information assets being protected. Finally, the team of experts offers thoughts about the information revolution that has only just begun, and how we can live in a world of sensors and trillions of data points without losing our ethics or value(s)...and even have a little fun. The Privacy Engineer's Manifesto is designed to serve multiple stakeholders: Anyone who is involved in designing, developing, deploying and reviewing products, processes, applications, and systems that process personal information, including software/hardware engineers, technical program and product managers, support and sales engineers, system integrators, IT professionals, lawyers, and information privacy and security professionals. This book is a must-read for all practitioners in the personal information economy. Privacy will be an integral part of the next wave in the technology revolution; innovators who emphasize privacy as an integral part of the product life cycle are on the right track. Foreword by Dr. Eric Bonabeau, PhD, Chairman, Icosystem, Inc. & Dean of Computational Sciences, Minerva Schools at KGI
    Pages: Online-Ressource (XXXVI, 400 pages) , 104 illustrations
    ISBN: 9781430263562
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Software engineering ; User interfaces (Computer systems) ; Computer Science ; User Interfaces and Human Computer Interaction ; Software Engineering/Programming and Operating Systems
    Description / Table of Contents: GUI Design for Android Apps is the perfect—and concise—introduction for mobile app developers and designers. Through easy-to-follow tutorials, code samples, and case studies, the book shows the must-know principles for user-interface design for Android apps running on the Intel platform, including smartphones, tablets and embedded devices. This book is jointly developed for individual learning by Intel Software College and China Shanghai JiaoTong University, and is excerpted from Android Application Development for the Intel® Platform
    Pages: Online-Ressource (XI, 156 pages) , 65 illustrations
    ISBN: 9781484203828
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Computer Science ; Computer Science, general
    Description / Table of Contents: Learn how to leverage the BlackBerry 10 Cascades framework to create rich native applications. Learn BlackBerry 10 App Development gives you a solid foundation for creating BlackBerry 10 apps efficiently. Along the way, you will learn how to use QML and JavaScript for designing your app’s UI, and C++/Qt for the application logic. No prior knowledge of C++ is assumed and the book covers the fundamental aspects of the language for writing BlackBerry 10 apps. Also a particular emphasis is put on how to create a visually enticing user experience with the Cascades framework, which is based on Qt and QML. Starting with the native SDK configuration and an overview of the Momentics IDE, the book is fast-paced and you will rapidly learn many of the best practices and techniques required for developing beautiful BlackBerry 10 apps. Learn BlackBerry 10 App Development is written for developers wishing to learn how to write apps for the new BlackBerry 10 OS and those interested in porting existing iOS and Android apps to BlackBerry 10 as native applications
    Pages: Online-Ressource (XVI, 356 pages) , 104 illustrations
    ISBN: 9781430261582
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Computer security ; Data encryption (Computer science) ; Computer Science ; Systems and Data Security ; Data Encryption
    Description / Table of Contents: For cloud users and providers alike, security is an everyday concern, yet there are very few books covering cloud security as a main subject. This book will help address this information gap from an Information Technology solution and usage-centric view of cloud infrastructure security. The book highlights the fundamental technology components necessary to build and enable trusted clouds. Here also is an explanation of the security and compliance challenges organizations face as they migrate mission-critical applications to the cloud, and how trusted clouds, that have their integrity rooted in hardware, can address these challenges. This book provides: Use cases and solution reference architectures to enable infrastructure integrity and the creation of trusted pools leveraging Intel Trusted Execution Technology (TXT). Trusted geo-location management in the cloud, enabling workload and data location compliance and boundary control usages in the cloud. OpenStack-based reference architecture of tenant-controlled virtual machine and workload protection in the cloud. A reference design to enable secure hybrid clouds for a cloud bursting use case, providing infrastructure visibility and control to organizations. "A valuable guide to the next generation of cloud security and hardware based root of trust. More than an explanation of the what and how, is the explanation of why. And why you can’t afford to ignore it!" —Vince Lubsey, Vice President, Product Development, Virtustream Inc. " Raghu provides a valuable reference for the new 'inside out' approach, where trust in hardware, software, and privileged users is never assumed—but instead measured, attested, and limited according to least privilege principles." —John Skinner, Vice President, HyTrust Inc. "Traditional parameter based defenses are in sufficient in the cloud. Raghu's book addresses this problem head-on by highlighting unique usage models to enable trusted infrastructure in this open environment. A must read if you are exposed in cloud." —Nikhil Sharma, Sr. Director of Cloud Solutions, Office of CTO, EMC Corporation
    Pages: Online-Ressource (XXVI, 244 pages) , 95 illustrations
    ISBN: 9781430261469
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Keywords: LINUX ; Netzwerkverwaltung
    Pages: Online-Ressource (359 Seiten)
    Edition: 3. Aufl.
    ISBN: 3897214148
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Unknown
    Amsterdam ; New York : Elsevier Science
    Keywords: DDC 512.9/42 ; LC QA214 ; Equations, Simultaneous - Numerical solutions ; Iterative methods (Mathematics)
    Pages: Online-Ressource (vii, 400 pages)
    ISBN: 9780444827777
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Keywords: DDC 512/.72 ; LC QA242 ; Algebras, Linear ; Euclidean algorithm ; Orthogonal polynomials ; Pade´ approximant
    Pages: Online-Ressource (xvii, 446 pages)
    ISBN: 9780444828729
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Unknown
    Bonn : Galileo Press
    Keywords: Windows Server 2012 R2 ; Hyper-V ; Active Directory ; Remotedesktopdienste ; Webserver IIS ; Netzwerkprotokolle ; Kerberos-Authentifizierung
    Description / Table of Contents: Das lösungsorientierte und umfassende Buch zum Windows Server 2012 R2 mit zahlreichen fundierten Hintergrundinformationen. Der Autor Ulrich B. Boddenberg greift bei der Beschreibung des Servers auf seine praktischen Erfahrungen in zahlreichen Projekten bei mittleren und großen Kunden zurück. Denn ein modernes Betriebssystem wie Windows Server 2012 R2 bietet weit mehr als nur die Möglichkeit, Programme auszuführen. Er beschreibt alle zentralen Technologien wie die Virtualisierung mit Hyper-V V3, Active Directory, Remotedesktopdienste, den Webserver IIS sowie SharePoint. Neben diesen konkreten Technologien geht es auch um Grundlagen wie Netzwerkprotokolle, Kerberos-Authentifizierung oder die eingesetzte Hardware. Zentrale Aspekte wie Performance, Verfügbarkeit und Sicherheit ziehen sich durch das gesamte Buch.
    Pages: Online-Ressource (1392 Seiten)
    Edition: 4., akt. Aufl.
    ISBN: 9783836220132
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Unknown
    Beijing : O'Reilly
    Keywords: DocBook
    Pages: Online-Ressource (635 Seiten)
    Edition: 1st ed.
    ISBN: 1565925807
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Keywords: LINUX
    Pages: Online-Ressource (430 Seiten)
    Edition: 1. Aufl.
    ISBN: 3897214164
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Keywords: Spam-Mail ; Computervirus ; Mail-Filter ; Open Source
    Pages: Online-Ressource (351 Seiten)
    Edition: 1. Aufl.
    ISBN: 389721377X
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Unknown
    Saarbrücken : Bomots
    Keywords: Scribus
    Pages: Online-Ressource (118 Seiten)
    Edition: 2. Aufl.
    ISBN: 9783000143878
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Keywords: PHP ; PEAR ; PECL
    Description / Table of Contents: Wer PHP effizient einsetzen will, sollte die umfangreichen Erweiterungen von PEAR nutzen. Dabei ist PEAR mehr als nur eine einfache Bibliothek. Vergleichbar dem CPAN-Projekt für Perl bietet PEAR zahlreiche Bibliotheken und nützliche Hilfsmittel für PHP-Entwickler, die sich dank des PEAR-Installers auf einfache Weise in bestehende PHP-Installationen integrieren lassen. So lassen sich Entwicklungprozesse erheblich verkürzen. Ein Hindernis stellten bisher lediglich die unzureichnenden Dokumentationen dar. Das Buch von Carsten Möhrke schafft Abhilfe. Es führt in die Nutzung ein, beschreibt ausführlich die Installation und alle wichtigen PEAR- und PECL-Pakete. Auch die Entwicklung eigener Pakete für das Archiv wird beschrieben.
    Pages: Online-Ressource (798 Seiten)
    Edition: 1. Aufl.
    ISBN: 3898425800
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Unknown
    Beijing : O'Reilly
    Keywords: Debian GNU/LINUX
    Pages: Online-Ressource (343 Seiten)
    Edition: 1st ed.
    ISBN: 1565927052
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Keywords: LINUX ; Linux device drivers ; Treiber
    Pages: Online-Ressource (615 Seiten)
    Edition: 3rd ed.
    ISBN: 9780596005900
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Keywords: GNU ; GNU Emacs ; Make ; Utilities
    Pages: Online-Ressource (280 Seiten)
    Edition: 3rd ed., completely rev. & updated
    ISBN: 0596006101
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Keywords: Open Source ; Lizenzvertrag
    Pages: Online-Ressource (182 Seiten)
    Edition: 1. Aufl.
    ISBN: 3897213893
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Keywords: Computer science ; Computers ; Database management ; Artificial intelligence ; Computer Science ; Database Management ; Artificial Intelligence (incl. Robotics) ; Information Systems and Communication Service
    Description / Table of Contents: Introduction to LOD2, Sören Auer --- Advances in Large-scale RDF Data --- Knowledge Base Creation, Enrichment and Repair --- Interlinking and Knowledge Fusion --- Facilitating the Exploration and Visualization of Linked Data --- Supporting the Linked Data life cycle using an integrated tool stack --- LOD2 for Media and Publishing --- Building Enterprise Ready Applications Using Linked Open Data --- Lifting Open Data Portals to the Data Web --- Linked Open Data for Public Procurement
    Pages: Online-Ressource (VII, 215 pages) , 73 illustrations
    ISBN: 9783319098463
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Keywords: VMware ; virtuelle Server
    Description / Table of Contents: Bei steigender Komplexität moderner Server-Landschaften und stetig wachsender Rechenleistung ist Servervirtualisierung nicht mehr als die logische Konsequenz. Die Entwicklung in der Unternehmenspraxis bestätigt das: Die Produkte der Firma VMware, der GSX und der ESX-Server, sind gefragt wie nie. Mittlerweile bietet neben einigen anderen Herstellern auch Microsoft eine eigene Softwarelösung an: den Virtual Server. Dieses Buch bietet von der Konzeption bis zum Einsatz das nötige Wissen für professionelle Virtualisierungsprojekte im Unternehmen. Es klärt nicht nur die Frage, was Virtualisierung bedeutet und welches Produkt sich für welchen Zweck am besten eignet, sondern liefert auch umfassendes Profi-Wissen für den praktischen Einsatz, die Einrichtung und Verwaltung virtueller Server-Welten.
    Pages: Online-Ressource (612 Seiten)
    Edition: 1. Aufl.
    ISBN: 9783898427012
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Data encryption (Computer science) ; Computers ; Computer Science ; Data Encryption ; Information Systems and Communication Service
    Description / Table of Contents: The InfoSec Handbook offers the reader an organized layout of information that is easily read and understood. Allowing beginners to enter the field and understand the key concepts and ideas, while still keeping the experienced readers updated on topics and concepts. It is intended mainly for beginners to the field of information security, written in a way that makes it easy for them to understand the detailed content of the book. The book offers a practical and simple view of the security practices while still offering somewhat technical and detailed information relating to security. It helps the reader build a strong foundation of information, allowing them to move forward from the book with a larger knowledge base. Security is a constantly growing concern that everyone must deal with. Whether it’s an average computer user or a highly skilled computer user, they are always confronted with different security risks. These risks range in danger and should always be dealt with accordingly. Unfortunately, not everyone is aware of the dangers or how to prevent them and this is where most of the issues arise in information technology (IT). When computer users do not take security into account many issues can arise from that like system compromises or loss of data and information. This is an obvious issue that is present with all computer users. This book is intended to educate the average and experienced user of what kinds of different security practices and standards exist. It will also cover how to manage security software and updates in order to be as protected as possible from all of the threats that they face
    Pages: Online-Ressource (XXIV, 392 pages) , 303 illustrations
    ISBN: 9781430263838
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Keywords: Computer science ; Computer security ; Data encryption (Computer science) ; Computer Science ; Systems and Data Security ; Data Encryption
    Description / Table of Contents: For cloud users and providers alike, security is an everyday concern, yet there are very few books covering cloud security as a main subject. This book will help address this information gap from an Information Technology solution and usage-centric view of cloud infrastructure security. The book highlights the fundamental technology components necessary to build and enable trusted clouds. Here also is an explanation of the security and compliance challenges organizations face as they migrate mission-critical applications to the cloud, and how trusted clouds, that have their integrity rooted in hardware, can address these challenges. This book provides: Use cases and solution reference architectures to enable infrastructure integrity and the creation of trusted pools leveraging Intel Trusted Execution Technology (TXT). Trusted geo-location management in the cloud, enabling workload and data location compliance and boundary control usages in the cloud. OpenStack-based reference architecture of tenant-controlled virtual machine and workload protection in the cloud. A reference design to enable secure hybrid clouds for a cloud bursting use case, providing infrastructure visibility and control to organizations. "A valuable guide to the next generation of cloud security and hardware based root of trust. More than an explanation of the what and how, is the explanation of why. And why you can’t afford to ignore it!" —Vince Lubsey, Vice President, Product Development, Virtustream Inc. " Raghu provides a valuable reference for the new 'inside out' approach, where trust in hardware, software, and privileged users is never assumed—but instead measured, attested, and limited according to least privilege principles." —John Skinner, Vice President, HyTrust Inc. "Traditional parameter based defenses are in sufficient in the cloud. Raghu's book addresses this problem head-on by highlighting unique usage models to enable trusted infrastructure in this open environment. A must read if you are exposed in cloud." —Nikhil Sharma, Sr. Director of Cloud Solutions, Office of CTO, EMC Corporation
    Pages: Online-Ressource (XXVI, 244 pages) , 95 illustrations
    ISBN: 9781430261469
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Unknown
    London : Ubiquity Press
    Keywords: Open Data ; Open Science ; Open Access ; Text Mining ; Data Mining
    Description / Table of Contents: In 2010 the Panton Principles for Open Data in Science were published. These principles were founded upon the idea that "Science is based on building on, reusing and openly criticising the published body of scientific knowledge" (http://pantonprinciples.org) and they provide a succinct list of the fundamentals to observe when making your data open. Intended for a broad audience of academics, publishers and librarians, Issues in Research Data explores the implications of the Panton Principles through a number of perspectives on open research data in the sciences and beyond. The book features chapters by open data experts in a range of academic disciplines, covering practical information on licensing, ethics, and advice for data curators, alongside more theoretical issues surrounding the adoption of open data. As the book is open access, each chapter can stand alone from the main volume so that communities can host, distribute, build upon and remix the content that is relevant to them. Readers can access the online version via the QR code or DOI link at the front of the book.
    Pages: Online-Ressource (VI, 164 Seiten)
    ISBN: 9781909188327
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Unknown
    Bonn : Galileo Press
    Keywords: Shell ; Shellscript
    Description / Table of Contents: In den ersten zehn Kapiteln des Buches erfahren Sie alles, was Sie zur Shell-Programmierung wissen müssen. Weitere Kapitel gehen auf die unverzichtbaren Tools grep, sed und awk ein, die in Kombination (oder auch allein) mit der Shellscript-Programmierung zu wertvollen Helfern werden können.
    Pages: Online-Ressource (782 Seiten)
    Edition: 1. Aufl.
    ISBN: 3898426831
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Keywords: Subversion
    Pages: Online-Ressource (329 Seiten)
    Edition: 1. Aufl.
    ISBN: 3897213907
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Unknown
    Köln : O'Reilly
    Keywords: Open Source
    Pages: Online-Ressource (59 Seiten)
    Edition: 1. Aufl.
    ISBN: 3897212226
    Language: German
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Keywords: Computer science ; Computer Science ; Computer Science, general
    Description / Table of Contents: Intel® Galileo and Intel® Galileo Gen 2: API Features and Arduino Projects for Linux Programmers provides detailed information about Intel® Galileo and Intel® Galileo Gen 2 boards for all software developers interested in Arduino and the Linux platform. The book covers the new Arduino APIs and is an introduction for developers on natively using Linux. Author Manoel Carlos Ramon is a member of the Intel Galileo development team; in this book he draws on his practical experience in working on the Galileo project as he shares the team’s findings, problems, fixes, workarounds, and techniques with the open source community. His areas of expertise are wide-ranging, including Linux-embedded kernel and device drivers, C/C++, Java, OpenGL, Assembler, Android NDK/SDK/ADK, and 2G/3G/4G modem integration. He has more than 17 years of experience in research and development of mobile devices and embedded circuits. His personal blog about programming is BytesThink (www.bytesthink.com)
    Pages: Online-Ressource (XXII, 680 pages) , 256 illustrations
    ISBN: 9781430268383
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Data encryption (Computer science) ; Computers ; Computer Science ; Data Encryption ; Information Systems and Communication Service
    Description / Table of Contents: The InfoSec Handbook offers the reader an organized layout of information that is easily read and understood. Allowing beginners to enter the field and understand the key concepts and ideas, while still keeping the experienced readers updated on topics and concepts. It is intended mainly for beginners to the field of information security, written in a way that makes it easy for them to understand the detailed content of the book. The book offers a practical and simple view of the security practices while still offering somewhat technical and detailed information relating to security. It helps the reader build a strong foundation of information, allowing them to move forward from the book with a larger knowledge base. Security is a constantly growing concern that everyone must deal with. Whether it’s an average computer user or a highly skilled computer user, they are always confronted with different security risks. These risks range in danger and should always be dealt with accordingly. Unfortunately, not everyone is aware of the dangers or how to prevent them and this is where most of the issues arise in information technology (IT). When computer users do not take security into account many issues can arise from that like system compromises or loss of data and information. This is an obvious issue that is present with all computer users. This book is intended to educate the average and experienced user of what kinds of different security practices and standards exist. It will also cover how to manage security software and updates in order to be as protected as possible from all of the threats that they face
    Pages: Online-Ressource (XXIV, 392 pages) , 303 illustrations
    ISBN: 9781430263838
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Software engineering ; Data encryption (Computer science) ; Computer Science ; Data Encryption ; Software Engineering/Programming and Operating Systems
    Description / Table of Contents: Platform Embedded Security Technology Revealed is an in-depth introduction to Intel’s platform embedded solution: the security and management engine. The engine is shipped inside most Intel platforms for servers, personal computers, tablets, and smartphones. The engine realizes advanced security and management functionalities and protects applications’ secrets and users’ privacy in a secure, light-weight, and inexpensive way. Besides native built-in features, it allows third-party software vendors to develop applications that take advantage of the security infrastructures offered by the engine. Intel’s security and management engine is technologically unique and significant, but is largely unknown to many members of the tech communities who could potentially benefit from it. Platform Embedded Security Technology Revealed reveals technical details of the engine. The engine provides a new way for the computer security industry to resolve critical problems resulting from booming mobile technologies, such as increasing threats against confidentiality and privacy. This book describes how this advanced level of protection is made possible by the engine, how it can improve users’ security experience, and how third-party vendors can make use of it. It's written for computer security professionals and researchers; embedded system engineers; and software engineers and vendors who are interested in developing new security applications on top of Intel’s security and management engine. It’s also written for advanced users who are interested in understanding how the security features of Intel’s platforms work
    Pages: Online-Ressource (XX, 272 pages) , 74 illustrations
    ISBN: 9781430265726
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Keywords: data science
    Description / Table of Contents: Chapter 1 Introduction --- Overview --- Data Science Is OSEMN --- Intermezzo Chapters --- What Is the Command Line? --- Why Data Science at the Command Line? --- A Real-World Use Case --- Further Reading --- Chapter 2 Getting Started --- Overview --- Setting Up Your Data Science Toolbox --- Essential Concepts and Tools --- Further Reading --- Chapter 3 Obtaining Data --- Overview --- Copying Local Files to the Data Science Toolbox --- Decompressing Files --- Converting Microsoft Excel Spreadsheets --- Querying Relational Databases --- Downloading from the Internet --- Calling Web APIs --- Further Reading --- Chapter 4 Creating Reusable Command-Line Tools --- Overview --- Converting One-Liners into Shell Scripts --- Creating Command-Line Tools with Python and R --- Further Reading --- Chapter 5 Scrubbing Data --- Overview --- Common Scrub Operations for Plain Text --- Working with CSV --- Working with HTML/XML and JSON --- Common Scrub Operations for CSV --- Further Reading --- Chapter 6 Managing Your Data Workflow --- Overview --- Introducing Drake --- Installing Drake --- Obtain Top Ebooks from Project Gutenberg --- Every Workflow Starts with a Single Step --- Well, That Depends --- Rebuilding Specific Targets --- Discussion --- Further Reading --- Chapter 7 Exploring Data --- Overview --- Inspecting Data and Its Properties --- Computing Descriptive Statistics --- Creating Visualizations --- Further Reading --- Chapter 8 Parallel Pipelines --- Overview --- Serial Processing --- Parallel Processing --- Distributed Processing --- Discussion --- Further Reading --- Chapter 9 Modeling Data --- Overview --- More Wine, Please! --- Dimensionality Reduction with Tapkee --- Clustering with Weka --- Regression with SciKit-Learn Laboratory --- Classification with BigML --- Further Reading --- Chapter 10 Conclusion --- Let’s Recap --- Three Pieces of Advice --- Where to Go from Here? --- Getting in Touch
    Pages: Online-Ressource (XVII, 191 pages) , illustrations, diagrams
    ISBN: 9781491947852
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Unknown
    Berkeley, CA : Apress
    Keywords: Computer science ; Text processing (Computer science) ; Image processing ; Computer Science ; Image Processing and Computer Vision ; Document Preparation and Text Processing
    Description / Table of Contents: Computer Vision Metrics provides an extensive survey and analysis of over 100 current and historical feature description and machine vision methods, with a detailed taxonomy for local, regional and global features. This book provides necessary background to develop intuition about why interest point detectors and feature descriptors actually work, how they are designed, with observations about tuning the methods for achieving robustness and invariance targets for specific applications. The survey is broader than it is deep, with over 540 references provided to dig deeper. The taxonomy includes search methods, spectra components, descriptor representation, shape, distance functions, accuracy, efficiency, robustness and invariance attributes, and more. Rather than providing ‘how-to’ source code examples and shortcuts, this book provides a counterpoint discussion to the many fine opencv community source code resources available for hands-on practitioners
    Pages: Online-Ressource (XXXI, 508 pages) , 216 illustrations
    ISBN: 9781430259305
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Unknown
    Berkeley, CA : Apress
    Keywords: Open source software ; Computer programming ; Software engineering ; Open Source ; Software Engineering/Programming and Operating Systems
    Description / Table of Contents: Pro Git (Second Edition) is your fully-updated guide to Git and its usage in the modern world. Git has come a long way since it was first developed by Linus Torvalds for Linux kernel development. It has taken the open source world by storm since its inception in 2005, and this book teaches you how to use it like a pro. Effective and well-implemented version control is a necessity for successful web projects, whether large or small. With this book you’ll learn how to master the world of distributed version workflow, use the distributed features of Git to the full, and extend Git to meet your every need. Written by Git pros Scott Chacon and Ben Straub, Pro Git (Second Edition) builds on the hugely successful first edition, and is now fully updated for Git version 2.0, as well as including an indispensable chapter on GitHub. It’s the best book for all your Git needs
    Pages: Online-Ressource (XXI, 456 pages) , 208 illustrations
    Edition: 2nd edition
    ISBN: 9781484200766
    Language: English
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Publication Date: 2014-01-01
    Print ISSN: 1867-4828
    Electronic ISSN: 1869-0238
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Publication Date: 2014-01-01
    Print ISSN: 1867-4828
    Electronic ISSN: 1869-0238
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Publication Date: 2014-01-01
    Print ISSN: 1867-4828
    Electronic ISSN: 1869-0238
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Publication Date: 2014-01-01
    Print ISSN: 1867-4828
    Electronic ISSN: 1869-0238
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Publication Date: 2014-01-01
    Print ISSN: 1867-4828
    Electronic ISSN: 1869-0238
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Publication Date: 2014-01-01
    Print ISSN: 1867-4828
    Electronic ISSN: 1869-0238
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Publication Date: 2014-11-08
    Print ISSN: 1867-4828
    Electronic ISSN: 1869-0238
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Publication Date: 2014-12-13
    Description: Replication in herpesvirus genomes is a major concern of public health as they multiply rapidly during the lytic phase of infection that cause maximum damage to the host cells. Earlier research has established that sites of replication origin are dominated by high concentration of rare palindrome sequences of DNA. Computational methods are devised based on scoring to determine the concentration of palindromes. In this paper, we propose both extraction and localization of rare palindromes in an automated manner. Discrete Cosine Transform (DCT-II), a widely recognized image compression algorithm is utilized here to extract palindromic sequences based on their reverse complimentary symmetry property of existence. We formulate a novel approach to localize the rare palindrome clusters by devising a Minimum Quadratic Entropy (MQE) measure based on the Renyi’s Quadratic Entropy (RQE) function. Experimental results over a large number of herpesvirus genomes show that the RQE based scoring of rare palindromes have higher order of sensitivity, and lesser false alarm in detecting concentration of rare palindromes and thereby sites of replication origin.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: GO relation embodies some aspects of existence dependency. If GO term x is existence-dependent on GO term y , the presence of y implies the presence of x . Therefore, the genes annotated with the function of the GO term y are usually functionally and semantically related to the genes annotated with the function of the GO term x . A large number of gene set enrichment analysis methods have been developed in recent years for analyzing gene sets enrichment. However, most of these methods overlook the structural dependencies between GO terms in GO graph by not considering the concept of existence dependency. We propose in this paper a biological search engine called RSGSearch that identifies enriched sets of genes annotated with different functions using the concept of existence dependency. We observe that GO term x cannot be existence-dependent on GO term y , if x and y have the same specificity (biological characteristics). After encoding into a numeric format the contributions of GO terms annotating target genes to the semantics of their lowest common ancestors (LCAs), RSGSearch uses microarray experiment to identify the most significant LCA that annotates the result genes. We evaluated RSGSearch experimentally and compared it with five gene set enrichment systems. Results showed marked improvement.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: The Tikhonov regularized nonnegative matrix factorization (TNMF) is an NMF objective function that enforces smoothness on the computed solutions, and has been successfully applied to many problem domains including text mining, spectral data analysis, and cancer clustering. There is, however, an issue that is still insufficiently addressed in the development of TNMF algorithms, i.e., how to develop mechanisms that can learn the regularization parameters directly from the data sets. The common approach is to use fixed values based on a priori knowledge about the problem domains. However, from the linear inverse problems study it is known that the quality of the solutions of the Tikhonov regularized least square problems depends heavily on the choosing of appropriate regularization parameters. Since least squares are the building blocks of the NMF, it can be expected that similar situation also applies to the NMF. In this paper, we propose two formulas to automatically learn the regularization parameters from the data set based on the L-curve approach. We also develop a convergent algorithm for the TNMF based on the additive update rules. Finally, we demonstrate the use of the proposed algorithm in cancer clustering tasks.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: Analysis of probability distributions conditional on species trees has demonstrated the existence of anomalous ranked gene trees (ARGTs), ranked gene trees that are more probable than the ranked gene tree that accords with the ranked species tree. Here, to improve the characterization of ARGTs, we study enumerative and probabilistic properties of two classes of ranked labeled species trees, focusing on the presence or avoidance of certain subtree patterns associated with the production of ARGTs. We provide exact enumerations and asymptotic estimates for cardinalities of these sets of trees, showing that as the number of species increases without bound, the fraction of all ranked labeled species trees that are ARGT-producing approaches $1$ . This result extends beyond earlier existence results to provide a probabilistic claim about the frequency of ARGTs.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: The existence of various types of correlations among the expressions of a group of biologically significant genes poses challenges in developing effective methods of gene expression data analysis. The initial focus of computational biologists was to work with only absolute and shifting correlations. However, researchers have found that the ability to handle shifting-and-scaling correlation enables them to extract more biologically relevant and interesting patterns from gene microarray data. In this paper, we introduce an effective shifting-and-scaling correlation measure named Shifting and Scaling Similarity (SSSim), which can detect highly correlated gene pairs in any gene expression data. We also introduce a technique named Intensive Correlation Search (ICS) biclustering algorithm, which uses SSSim to extract biologically significant biclusters from a gene expression data set. The technique performs satisfactorily with a number of benchmarked gene expression data sets when evaluated in terms of functional categories in Gene Ontology database.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Publication Date: 2014-12-13
    Description: Attractors in gene regulatory networks represent cell types or states of cells. In system biology and synthetic biology, it is important to generate gene regulatory networks with desired attractors. In this paper, we focus on a singleton attractor, which is also called a fixed point. Using a Boolean network (BN) model, we consider the problem of finding Boolean functions such that the system has desired singleton attractors and has no undesired singleton attractors. To solve this problem, we propose a matrix-based representation of BNs. Using this representation, the problem of finding Boolean functions can be rewritten as an Integer Linear Programming (ILP) problem and a Satisfiability Modulo Theories (SMT) problem. Furthermore, the effectiveness of the proposed method is shown by a numerical example on a WNT5A network, which is related to melanoma. The proposed method provides us a basic method for design of gene regulatory networks.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Publication Date: 2014-12-13
    Description: In this paper, we study Copy Number Variation (CNV) data.The underlying process generating CNV segments is generally assumed to be memory-less, giving rise to an exponential distribution of segment lengths. In this paper, we provide evidence from cancer patient data, which suggests that this generative model is too simplistic , and that segment lengths follow a power-law distribution instead . We conjecture a simple preferential attachment generative model that provides the basis for the observed power-law distribution. We then show how an existing statistical method for detecting cancer driver genes can be improved by incorporating the power-law distribution in the null model.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: Proteins fold into complex three-dimensional shapes. Simplified representations of their shapes are central to rationalise, compare, classify, and interpret protein structures. Traditional methods to abstract protein folding patterns rely on representing their standard secondary structural elements (helices and strands of sheet) using line segments. This results in ignoring a significant proportion of structural information. The motivation of this research is to derive mathematically rigorous and biologically meaningful abstractions of protein folding patterns that maximize the economy of structural description and minimize the loss of structural information. We report on a novel method to describe a protein as a non-overlapping set of parametric three dimensional curves of varying length and complexity. Our approach to this problem is supported by information theory and uses the statistical framework of minimum message length (MML) inference. We demonstrate the effectiveness of our non-linear abstraction to support efficient and effective comparison of protein folding patterns on a large scale.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Publication Date: 2014-12-13
    Description: The organization of global protein interaction networks (PINs) has been extensively studied and heatedly debated. We revisited this issue in the context of the analysis of dynamic organization of a PIN in the yeast cell cycle. Statistically significant bimodality was observed when analyzing the distribution of the differences in expression peak between periodically expressed partners. A close look at their behavior revealed that date and party hubs derived from this analysis have some distinct features. There are no significant differences between them in terms of protein essentiality, expression correlation and semantic similarity derived from gene ontology (GO) biological process hierarchy. However, date hubs exhibit significantly greater values than party hubs in terms of semantic similarity derived from both GO molecular function and cellular component hierarchies. Relating to three-dimensional structures, we found that both single- and multi-interface proteins could become date hubs coordinating multiple functions performed at different times while party hubs are mainly multi-interface proteins. Furthermore, we constructed and analyzed a PPI network specific to the human cell cycle and highlighted that the dynamic organization in human interactome is far more complex than the dichotomy of hubs observed in the yeast cell cycle.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Publication Date: 2014-12-13
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Publication Date: 2014-12-13
    Description: The articles in this special section were presented at the 2012 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS 2012) that was held in Washington DC from December 2nd to 4th.
    Print ISSN: 1545-5963
    Electronic ISSN: 1557-9964
    Topics: Biology , Computer Science
    Published by Institute of Electrical and Electronics Engineers (IEEE) on behalf of The IEEE Computational Intelligence Society ; The IEEE Computer Society ; The IEEE Control Systems Society ; The IEEE Engineering in Medicine and Biology Society ; The Association for Computing Machinery.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: Disk additions to an RAID-6 storage system can increase the I/O parallelism and expand the storage capacity simultaneously. To regain load balance among all disks including old and new, RAID-6 scaling requires moving certain data blocks onto newly added disks. Existing approaches to RAID-6 scaling, restricted by preserving a round-robin data distribution, require migrating all the data, which results in an expensive cost for RAID-6 scaling. In this paper, we propose RS6—a new approach to accelerating RDP RAID-6 scaling by reducing disk I/Os and XOR operations. First, RS6 minimizes the number of data blocks to be moved while maintaining a uniform data distribution across all data disks. Second, RS6 piggybacks parity updates during data migration to reduce the cost of maintaining consistent parities. Third, RS6 selects parameters of data migration so as to reduce disk I/Os for parity updates. Our mathematical analysis indicates that RS6 provides uniform data distribution, minimal data migration, and fast data addressing. We also conducted extensive simulation experiments to quantitatively characterize the properties of RS6. The results show that, compared with existing “moving-everything” Round-Robin approaches, RS6 reduces the number of blocks to be moved by 60.0%–88.9%, and saves the migration time by 40.27%–69.88%.
    Print ISSN: 0018-9340
    Electronic ISSN: 1557-9956
    Topics: Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: This paper focuses on designing a distributed medium access control algorithm for fairly sharing network resources among contending stations in an 802.11 wireless network. Because the notion of fairness is not universal and there lacks a rigorous analysis on the relationships among the four types of most popular fairness criteria, we first mathematically prove that there exist certain connections between these types of fairness criteria. We then propose an efficient medium access algorithm that aims at achieving time fairness and throughput enhancement in a fully distributed manner. The core idea of our proposed algorithm lies in that each station needs to select an appropriate contention window size so as to fairly share the channel occupancy time and maximize the throughput under the time fairness constraint. The derivation of the proper contention window size is addressed rigorously. We evaluate the performance of our proposed algorithm through an extensive simulation study, and the evaluation results demonstrate that our proposed algorithm leads to nearly perfect time fairness, high throughput, and low collision overhead.
    Print ISSN: 0018-9340
    Electronic ISSN: 1557-9956
    Topics: Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-12-13
    Description: This paper investigates the limits of adaptive voltage scaling (AVS) applied to commercial FPGAs which do not specifically support voltage adaptation. An adaptive power architecture based on a modified design flow is created with in-situ detectors and dynamic reconfiguration of clock management resources. AVS is a power-saving technique that enables a device to regulate its own voltage and frequency based on workload, process and operating conditions in a closed-loop configuration. It results in significant improved energy profiles compared with dynamic voltage frequency scaling (DVFS) in which the device uses a number of pre-calculated valid working points. The results of deploying AVS in FPGAs with in-situ detectors shows power and energy savings exceeding 85 percent compared with nominal voltage operation at the same frequency. The in-situ detector approach compares favorably with critical path replication based on delay lines since it avoids the need of cumbersome and error-prone delay line calibration.
    Print ISSN: 0018-9340
    Electronic ISSN: 1557-9956
    Topics: Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Publication Date: 2014-12-14
    Description: Background: Biomedical ontologies are increasingly instrumental in the advancement of biological research primarily through their use to efficiently consolidate large amounts of data into structured, accessible sets. However, ontology development and usage can be hampered by the segregation of knowledge by domain that occurs due to independent development and use of the ontologies. The ability to infer data associated with one ontology to data associated with another ontology would prove useful in expanding information content and scope. We here focus on relating two ontologies: the Gene Ontology (GO), which encodes canonical gene function, and the Mammalian Phenotype Ontology (MP), which describes non-canonical phenotypes, using statistical methods to suggest GO functional annotations from existing MP phenotype annotations. This work is in contrast to previous studies that have focused on inferring gene function from phenotype primarily through lexical or semantic similarity measures. Results: We have designed and tested a set of algorithms that represents a novel methodology to define rules for predicting gene function by examining the emergent structure and relationships between the gene functions and phenotypes rather than inspecting the terms semantically. The algorithms inspect relationships among multiple phenotype terms to deduce if there are cases where they all arise from a single gene function.We apply this methodology to data about genes in the laboratory mouse that are formally represented in the Mouse Genome Informatics (MGI) resource. From the data, 7444 rule instances were generated from five generalized rules, resulting in 4818 unique GO functional predictions for 1796 genes. Conclusions: We show that our method is capable of inferring high-quality functional annotations from curated phenotype data. As well as creating inferred annotations, our method has the potential to allow for the elucidation of unforeseen, biologically significant associations between gene function and phenotypes that would be overlooked by a semantics-based approach. Future work will include the implementation of the described algorithms for a variety of other model organism databases, taking full advantage of the abundance of available high quality curated data.
    Electronic ISSN: 1471-2105
    Topics: Biology , Computer Science
    Published by BioMed Central
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Publication Date: 2014-12-14
    Description: The multiple sequence alignment (MSA) problem has become relevant to several areas in bioinformatics from finding sequences family, detecting structural homologies of protein/DNA sequences, determining functions of protein/DNA sequences to predict patients diseases by comparing DNAs of patients in disease discovery, etc. The MSA is a NP-hard problem. In this paper, two new methods based on a cultural algorithm, namely the method of musical composition, for the solution of the MSA problem are introduced. The performance of the first and second versions were evaluated and analyzed on 26 and 12 different benchmark alignments, respectively. Test instances were taken from BAliBASE 3.0. Alignment accuracies are computed using the QSCORE program, which is a quality scoring program that compares two multiple sequence alignments. Numerical results on the tackled instances indicate that the performance levels of the proposed versions of the MMC are promising. In particular, the experimental results show that the second version found the best alignment reported in the specialized literature in 25  \(\%\) of the tested instances. Besides, for 50  \(\%\) of the tested instances, the second version achieved the second best alignment. Finally, the significance of the numerical results were analyzed according to the Wilcoxon rank-sum test, which indicated that the second proposed version is statistically similar to some state-of-the-art techniques for the MSA problem.
    Print ISSN: 0010-485X
    Electronic ISSN: 1436-5057
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Publication Date: 2014-12-14
    Description: In an amplify-and-forward cooperative network, a closed-form expression of the a priori distribution of the complex-valued gain of the global relay channel is intractable, so that a priori information is often not exploited for estimating this gain. Here, we present two iterative channel gain and noise variance estimation algorithms that make use of a priori channel information and exploit the presence of not only pilot symbols but also unknown data symbols. These algorithms are approximations of maximum a posteriori estimation and linear minimum mean-square error estimation, respectively. A substantially reduced frame error rate is achieved as compared to the case where only pilot symbols are used in the estimation.
    Print ISSN: 1687-1472
    Electronic ISSN: 1687-1499
    Topics: Electrical Engineering, Measurement and Control Technology , Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    facet.materialart.
    Unknown
    IOS Press
    Publication Date: 2014-12-14
    Description: This paper describes the Ontologies of Linguistic Annotation (OLiA) as one of the data sets currently available as part of Linguistic Linked Open Data (LLOD) cloud. Within the LLOD cloud, the OLiA ontologies serve as a reference hub for annotation terminology for linguistic phenomena on a great band-width of languages, they have been used to facilitate interoperability and information integration of linguistic annotations in corpora, NLP pipelines, and lexical-semantic resources and mediate their linking with multiple community-maintained terminology repositories. Content Type Journal Article Pages - DOI 10.3233/SW-140167 Authors Christian Chiarcos, Applied Computational Linguistics (ACoLi), Department of Computer Science and Mathematics, Goethe-University Frankfurt am Main, Germany, http://acoli.cs.uni-frankfurt.de Maria Sukhareva, Applied Computational Linguistics (ACoLi), Department of Computer Science and Mathematics, Goethe-University Frankfurt am Main, Germany, http://acoli.cs.uni-frankfurt.de Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844
    Print ISSN: 1570-0844
    Electronic ISSN: 2210-4968
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    facet.materialart.
    Unknown
    IOS Press
    Publication Date: 2014-12-14
    Description: This paper describes the publication and linking of (parts of) PAROLE SIMPLE CLIPS (PSC), a large scale Italian lexicon, to the Semantic Web and the Linked Data cloud using the lemon model. The main challenge of the conversion is discussed, namely the reconciliation between the PSC semantic structure which contains richly encoded semantic information, following the qualia structure of the Generative Lexicon theory and the lemon view of lexical sense as a reified pairing of a lexical item and a concept in an ontology. The result is two datasets: one consists of a list of lemon lexical entries with their lexical properties, relations and senses; the other consists of a list of OWL individuals representing the referents for the lexical senses. These OWL individuals are linked to each other by a set of semantic relations and mapped onto the SIMPLE OWL ontology of higher level semantic types. Content Type Journal Article Pages - DOI 10.3233/SW-140168 Authors Riccardo Del Gratta, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Francesca Frontini, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Fahad Khan, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Monica Monachini, Istituto Di Linguistica Computazionale ‘A. Zampolli’, Consiglio Nazionale delle Ricerche, Via Moruzzi 1, Pisa, Italy. E-mail: first.last@ilc.cnr.it Journal Semantic Web Online ISSN 2210-4968 Print ISSN 1570-0844
    Print ISSN: 1570-0844
    Electronic ISSN: 2210-4968
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Publication Date: 2014-12-15
    Description: Numerous statistical methods have been published for designing and analyzing microarray projects. Traditional genome-wide microarray platforms (such as Affymetrix, Illumina, and DASL) measure the expression level of tens of thousands genes. Since the sets of genes included in these array chips are selected by the manufacturers, the number of genes associated with a specific disease outcome is limited and a large portion of the genes are not associated. nCounter is a new technology by NanoString to measure the expression of a selected number (up to 800) of genes. The list of genes for nCounter chips can be selected by customers. Due to the limited number of genes and the price increase in the number of selected genes, the genes for nCounter chips are carefully selected among those discovered from previous studies, usually using traditional high-throughput platforms, and only a small number of definitely unassociated genes, called control genes, are included to standardize the overall expression level across different chips. Furthermore, nCounter chips measure the expression level of each gene using a counting observation while the traditional high-throughput platforms produce continuous observations. Due to these differences, some statistical methods developed for the design and analysis of high-throughput projects may need modification or may be inappropriate for nCounter projects. In this paper, we discuss statistical methods that can be used for designing and analyzing nCounter projects.
    Electronic ISSN: 1176-9351
    Topics: Computer Science , Medicine
    Published by Libertas Academica
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Publication Date: 2014-12-17
    Description: Nowadays, with the advance of technology, many applications generate huge amounts of data streams at very high speed. Examples include network traffic, web click streams, video surveillance, and sensor networks. Data stream mining has become a hot research topic. Its goal is to extract hidden knowledge/patterns from continuous data streams. Unlike traditional data mining where the dataset is static and can be repeatedly read many times, data stream mining algorithms face many challenges and have to satisfy constraints such as bounded memory, single-pass, real-time response, and concept-drift detection. This paper presents a comprehensive survey of the state-of-the-art data stream mining algorithms with a focus on clustering and classification because of their ubiquitous usage. It identifies mining constraints, proposes a general model for data stream mining, and depicts the relationship between traditional data mining and data stream mining. Furthermore, it analyzes the advantages as well as limitations of data stream algorithms and suggests potential areas for future research.
    Print ISSN: 0219-1377
    Electronic ISSN: 0219-3116
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Publication Date: 2014-12-18
    Description: A computational approach for estimating the overall, population, and individual cancer hazard rates was developed. The population rates characterize a risk of getting cancer of a specific site/type, occurring within an age-specific group of individuals from a specified population during a distinct time period. The individual rates characterize an analogous risk but only for the individuals susceptible to cancer. The approach uses a novel regularization and anchoring technique to solve an identifiability problem that occurs while determining the age, period, and cohort (APC) effects. These effects are used to estimate the overall rate, and to estimate the population and individual cancer hazard rates. To estimate the APC effects, as well as the population and individual rates, a new web-based computing tool, called the CancerHazard@Age, was developed. The tool uses data on the past and current history of cancer incidences collected during a long time period from the surveillance databases. The utility of the tool was demonstrated using data on the female lung cancers diagnosed during 1975–2009 in nine geographic areas within the USA. The developed tool can be applied equally well to process data on other cancer sites. The data obtained by this tool can be used to develop novel carcinogenic models and strategies for cancer prevention and treatment, as well as to project future cancer burden.
    Electronic ISSN: 1176-9351
    Topics: Computer Science , Medicine
    Published by Libertas Academica
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Publication Date: 2014-12-18
    Description: To be successful, cybercriminals must figure out how to scale their scams. They duplicate content on new websites, often staying one step ahead of defenders that shut down past schemes. For some scams, such as phishing and counterfeit goods shops, the duplicated content remains nearly identical. In others, such as advanced-fee fraud and online Ponzi schemes, the criminal must alter content so that it appears different in order to evade detection by victims and law enforcement. Nevertheless, similarities often remain, in terms of the website structure or content, since making truly unique copies does not scale well. In this paper, we present a novel optimized combined clustering method that links together replicated scam websites, even when the criminal has taken steps to hide connections. We present automated methods to extract key website features, including rendered text, HTML structure, file structure, and screenshots. We describe a process to automatically identify the best combination of such attributes to most accurately cluster similar websites together. To demonstrate the method?s applicability to cybercrime, we evaluate its performance against two collected datasets of scam websites: fake escrow services and high-yield investment programs (HYIPs). We show that our method more accurately groups similar websites together than those existing general-purpose consensus clustering methods.
    Print ISSN: 1687-4161
    Electronic ISSN: 1687-417X
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Publication Date: 2014-12-18
    Description: The decentralized many-to-many negotiation for resource allocation in Cloud and multi-agent systems presents numerous challenges, including ones related to the buyer strategy which is the focus of the present paper. Current approaches deriving required resources each bid must ask for aren't in all market cases an optimal choice. For this reason, we have proposed a hybrid negotiation strategy consisting of a combination of two modes of negotiation strategies that generates required resources of each bid in parallel, the first one is an existent fixed negotiation strategy and the second one is a learning selection strategy over the buyer's agreement space. Moreover, acting dynamically in the market place by adjusting appropriately the buyer's resource provisioning times and calling for proposal to hand over contracted resources in order to break some deadlocks involving buyers' tasks has been shown via simulation results to achieve better performances both in terms of social welfare and buyer utility. Content Type Journal Article Pages 165-183 DOI 10.3233/MGS-140221 Authors Mohamed Raouf Habes, Department of Computer Science, University of Badji Mokhtar, Annaba, Algeria Habiba Belleili-Souici, Department of Computer Science, University of Badji Mokhtar, Annaba, Algeria Laurent Vercouter, INSA de Rouen, Saint-Etienne du Rouvray, France Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 10 Journal Issue Volume 10, Number 3 / 2014
    Print ISSN: 1574-1702
    Electronic ISSN: 1875-9076
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Publication Date: 2014-12-18
    Description: In future energy systems, peaks in the daily electricity generation and consumption are expected to increase. The "smart grid" concept aims to maintain high levels of efficiency in the energy system by establishing distributed intelligence. Software agents (operating on devices with unknown computational capabilities) can implement dynamic and autonomous decision making about energy usage and generation, e.g. in domestic households, farms or offices. To reach satisfactory levels of efficiency and reliability, it is crucial to include planning-ahead of the energy-involving activities. Market mechanisms are a promising approach for large-scale coordination problems about energy supply and demand, but existing electricity markets either do not involve planning-ahead sufficiently or require a high level of sophistication and computing power from participants, which is not suitable for smart grid settings. This paper proposes a new market mechanism for smart grids, ABEM (Ahead- and Balancing Energy Market). ABEM performs an ahead market and a last-minute balancing market, where planning-ahead in the ahead market supports both binding ahead-commitments and reserve capacities in bids (which can be submitted as price functions). These features of planning-ahead reflect the features in modern wholesale electricity markets. However, constructing bids in ABEM is straightforward and fast. We also provide a model of a market with the features mentioned above, which a strategic agent can use to construct a bid (e.g. in ABEM), using a decision-theoretic approach. We evaluate ABEM experimentally in various stochastic scenarios and show favourable outcomes in comparison with a benchmark mechanism. Content Type Journal Article Pages 137-163 DOI 10.3233/MGS-140220 Authors Nicolas Höning, Centrum Wiskunde en Informatica, Amsterdam, The Netherlands Han La Poutré, Centrum Wiskunde en Informatica, Amsterdam, The Netherlands Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 10 Journal Issue Volume 10, Number 3 / 2014
    Print ISSN: 1574-1702
    Electronic ISSN: 1875-9076
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    facet.materialart.
    Unknown
    IOS Press
    Publication Date: 2014-12-18
    Description: The Belief-Desire-Intention (BDI) model of agency provides a powerful technique for describing goal-based behavior for both individual agents and, more recently, agent teams. Numerous frameworks have been developed since the model was first proposed in the early 1980's. However, none of these frameworks have explicitly represented intention, which has meant that intention-based reasoning has had no direct framework support. Given the importance of this in the development of practical agent applications, we consider this to be a major shortcoming of existing frameworks. This paper explores how explicitly represented goals can be used as both a unifying modeling concept for the management of intention, and as the basis for a BDI framework. The exploration is grounded both in terms of software – a recently developed BDI framework called GORITE and in application – an execution system for a robotic assembly cell. Both are discussed in detail. Content Type Journal Article Pages 119-136 DOI 10.3233/MGS-140219 Authors D. Jarvis, School of Engineering and Technology, Central Queensland University, Brisbane, Queensland, Australia J. Jarvis, School of Engineering and Technology, Central Queensland University, Brisbane, Queensland, Australia R. Rönnquist, Intendico Pty. Ltd., Carlton, Australia Journal Multiagent and Grid Systems Online ISSN 1875-9076 Print ISSN 1574-1702 Journal Volume Volume 10 Journal Issue Volume 10, Number 3 / 2014
    Print ISSN: 1574-1702
    Electronic ISSN: 1875-9076
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Publication Date: 2014-12-18
    Description: Background: Identification of individual components in complex mixtures is an important and sometimes daunting task in several research areas like metabolomics and natural product studies. NMR spectroscopy is an excellent technique for analysis of mixtures of organic compounds and gives a detailed chemical fingerprint of most individual components above the detection limit. For the identification of individual metabolites in metabolomics, correlation or covariance between peaks in 1H NMR spectra has previously been successfully employed. Similar correlation of 2D 1H-13C Heteronuclear Single Quantum Correlation spectra was recently applied to investigate the structure of heparine. In this paper, we demonstrate how a similar approach can be used to identify metabolites in human biofluids (post-prostatic palpation urine). Results: From 50 1H-13C Heteronuclear Single Quantum Correlation spectra, 23 correlation plots resembling pure metabolites were constructed. The identities of these metabolites were confirmed by comparing the correlation plots with reported NMR data, mostly from the Human Metabolome Database. Conclusions: Correlation plots prepared by statistically correlating 1H-13C Heteronuclear Single Quantum Correlation spectra from human biofluids provide unambiguous identification of metabolites. The correlation plots highlight cross-peaks belonging to each individual compound, not limited by long-range magnetization transfer as conventional NMR experiments.
    Electronic ISSN: 1471-2105
    Topics: Biology , Computer Science
    Published by BioMed Central
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Publication Date: 2014-12-18
    Description: Background: Alternative Splicing (AS) as a post-transcription regulation mechanism is an important application of RNA-seq studies in eukaryotes. A number of software and computational methods have been developed for detecting AS. Most of the methods, however, are designed and tested on animal data, such as human and mouse. Plants genes differ from those of animals in many ways, e.g., the average intron size and preferred AS types. These differences may require different computational approaches and raise questions about their effectiveness on plant data. The goal of this paper is to benchmark existing computational differential splicing (or transcription) detection methods so that biologists can choose the most suitable tools to accomplish their goals. Results: This study compares the eight popular public available software packages for differential splicing analysis using both simulated and real Arabidopsis thaliana RNA-seq data. All software are freely available. The study examines the effect of varying AS ratio, read depth, dispersion pattern, AS types, sample sizes and the influence of annotation. Using a real data, the study looks at the consistences between the packages and verifies a subset of the detected AS events using PCR studies. Conclusions: No single method performs the best in all situations. The accuracy of annotation has a major impact on which method should be chosen for AS analysis. DEXSeq performs well in the simulated data when the AS signal is relative strong and annotation is accurate. Cufflinks achieve a better tradeoff between precision and recall and turns out to be the best one when incomplete annotation is provided. Some methods perform inconsistently for different AS types. Complex AS events that combine several simple AS events impose problems for most methods, especially for MATS. MATS stands out in the analysis of real RNA-seq data when all the AS events being evaluated are simple AS events.
    Electronic ISSN: 1471-2105
    Topics: Biology , Computer Science
    Published by BioMed Central
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Publication Date: 2014-11-06
    Print ISSN: 0937-6429
    Electronic ISSN: 1861-8936
    Topics: Computer Science , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    facet.materialart.
    Unknown
    Springer
    Publication Date: 2014-11-06
    Description: Domänenspezifische Modellierungssprachen (engl.: “domain-specific modeling languages”, DSMLs) versprechen deutliche Vorteile gegenüber universellen Modellierungssprachen. Ihr Entwurf ist allerdings mit einer essentiellen Herausforderung verbunden. Um ansehnliche Skaleneffekte zu erreichen, empfiehlt sich die Entwicklung von DSMLs, die in einer größeren Nutzungsbandbreite einsetzbar sind. Gleichzeitig spricht der Gewinn an Modellierungsproduktivität im Einzelfall für Sprachkonzepte, die an individuelle Anforderungen angepasst sind. In dem vorliegenden Beitrag wird ein neuartiger Ansatz zur konzeptuellen Modellierung wie auch zur Konstruktion von Informationssystemen präsentiert, der durch die faktische Nutzung von Fachsprachen inspiriert ist – die Mehrebenen-Modellierung. Im Unterschied zu traditionellen Spracharchitekturen wie der „Meta Object Facility“ (MOF) basiert er auf einer rekursiven Architektur, die eine beliebige Zahl von Klassifikationsebenen ermöglicht und dadurch den Entwurf von Sprachhierarchien – von einer Referenz-DSML bis hin zu „lokalen“ DSMLs – erlaubt. Auf diese Weise wird nicht nur der essentielle Konflikt des Entwurfs von DSMLs deutlich entschärft, sondern auch die Wiederverwendung und Integration von Software-Komponenten im Allgemeinen gefördert. Zudem ermöglicht der Ansatz die Reduktion von Modellkomplexität, indem er die Dichotomie von Spezialisierung und Instanzierung teilweise aufhebt. Darüber hinaus integriert er eine Metamodellierungssprache mit dem Metamodell einer Metaprogrammiersprache, wodurch ausführbare Modelle ermöglicht werden. Die Spezifikation der Spracharchitektur wird ergänzt durch die Darstellung von Anwendungsszenarien, die die Potentiale der Mehrebenen-Modellierung verdeutlichen, sowie eine kritische Betrachtung ihrer Besonderheiten.
    Print ISSN: 0937-6429
    Electronic ISSN: 1861-8936
    Topics: Computer Science , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Publication Date: 2014-11-07
    Description: Motivation: Mapping of high-throughput sequencing data and other bulk sequence comparison applications have motivated a search for high-efficiency sequence alignment algorithms. The bit-parallel approach represents individual cells in an alignment scoring matrix as bits in computer words and emulates the calculation of scores by a series of logic operations composed of AND, OR, XOR, complement, shift and addition. Bit-parallelism has been successfully applied to the longest common subsequence (LCS) and edit-distance problems, producing fast algorithms in practice. Results: We have developed BitPAl, a bit-parallel algorithm for general, integer-scoring global alignment. Integer-scoring schemes assign integer weights for match, mismatch and insertion/deletion. The BitPAl method uses structural properties in the relationship between adjacent scores in the scoring matrix to construct classes of efficient algorithms, each designed for a particular set of weights. In timed tests, we show that BitPAl runs 7–25 times faster than a standard iterative algorithm. Availability and implementation: Source code is freely available for download at http://lobstah.bu.edu/BitPAl/BitPAl.html . BitPAl is implemented in C and runs on all major operating systems. Contact : jloving@bu.edu or yhernand@bu.edu or gbenson@bu.edu Supplementary information : Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Publication Date: 2014-11-07
    Description: : Next-generation sequencing (NGS) has a large potential in HIV diagnostics, and genotypic prediction models have been developed and successfully tested in the recent years. However, albeit being highly accurate, these computational models lack computational efficiency to reach their full potential. In this study, we demonstrate the use of graphics processing units (GPUs) in combination with a computational prediction model for HIV tropism. Our new model named gCUP, parallelized and optimized for GPU, is highly accurate and can classify 〉175 000 sequences per second on an NVIDIA GeForce GTX 460. The computational efficiency of our new model is the next step to enable NGS technologies to reach clinical significance in HIV diagnostics. Moreover, our approach is not limited to HIV tropism prediction, but can also be easily adapted to other settings, e.g. drug resistance prediction. Availability and implementation: The source code can be downloaded at http://www.heiderlab.de Contact: d.heider@wz-straubing.de
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    facet.materialart.
    Unknown
    Oxford University Press
    Publication Date: 2014-11-07
    Description: : We present a new method to incrementally construct the FM-index for both short and long sequence reads, up to the size of a genome. It is the first algorithm that can build the index while implicitly sorting the sequences in the reverse (complement) lexicographical order without a separate sorting step. The implementation is among the fastest for indexing short reads and the only one that practically works for reads of averaged kilobases in length. Availability and implementation: https://github.com/lh3/ropebwt2 Contact: hengli@broadinstitute.org
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Publication Date: 2014-11-07
    Description: : AliView is an alignment viewer and editor designed to meet the requirements of next-generation sequencing era phylogenetic datasets. AliView handles alignments of unlimited size in the formats most commonly used, i.e. FASTA, Phylip, Nexus, Clustal and MSF. The intuitive graphical interface makes it easy to inspect, sort, delete, merge and realign sequences as part of the manual filtering process of large datasets. AliView also works as an easy-to-use alignment editor for small as well as large datasets. Availability and implementation: AliView is released as open-source software under the GNU General Public License, version 3.0 (GPLv3), and is available at GitHub ( www.github.com/AliView ). The program is cross-platform and extensively tested on Linux, Mac OS X and Windows systems. Downloads and help are available at http://ormbunkar.se/aliview Contact: anders.larsson@ebc.uu.se Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Publication Date: 2014-11-07
    Description: Motivation: The ability to accurately read the order of nucleotides in DNA and RNA is fundamental for modern biology. Errors in next-generation sequencing can lead to many artifacts, from erroneous genome assemblies to mistaken inferences about RNA editing. Uneven coverage in datasets also contributes to false corrections. Result: We introduce Trowel, a massively parallelized and highly efficient error correction module for Illumina read data. Trowel both corrects erroneous base calls and boosts base qualities based on the k -mer spectrum. With high-quality k -mers and relevant base information, Trowel achieves high accuracy for different short read sequencing applications.The latency in the data path has been significantly reduced because of efficient data access and data structures. In performance evaluations, Trowel was highly competitive with other tools regardless of coverage, genome size read length and fragment size. Availability and implementation: Trowel is written in C++ and is provided under the General Public License v3.0 (GPLv3). It is available at http://trowel-ec.sourceforge.net . Contact: euncheon.lim@tue.mpg.de or weigel@tue.mpg.de Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Publication Date: 2014-11-07
    Description: : The application of protein–protein docking in large-scale interactome analysis is a major challenge in structural bioinformatics and requires huge computing resources. In this work, we present MEGADOCK 4.0, an FFT-based docking software that makes extensive use of recent heterogeneous supercomputers and shows powerful, scalable performance of 〉97% strong scaling. Availability and Implementation: MEGADOCK 4.0 is written in C++ with OpenMPI and NVIDIA CUDA 5.0 (or later) and is freely available to all academic and non-profit users at: http://www.bi.cs.titech.ac.jp/megadock . Contact: akiyama@cs.titech.ac.jp Supplementary information: Supplementary data are available at Bioinformatics online
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Publication Date: 2014-11-07
    Description: Background: PGxClean is a new web application that performs quality control analyses for data produced by the Affymetrix DMET chip or other candidate gene technologies. Importantly, the software does not assume that variants are biallelic single-nucleotide polymorphisms, but can be used on the variety of variant characteristics included on the DMET chip. Once quality control analyses has been completed, the associated PGxClean-Viz web application performs principal component analyses and provides tools for characterizing and visualizing population structure.FindingsThe PGxClean web application accepts genotype data from the Affymetrix DMET chip or the PLINK PED format with genotypes annotated as (A,C,G,T or 1,2,3,4). Options for removing missing data and calculating genotype and allele frequencies are offered. Data can be subdivided by cohort characteristics, such as family ID, sex, phenotype, or case-control status. Once the data has been processed through the PGxClean web application, the output files can be entered into the PGxClean-Viz web application for performing principal component analysis to visualize population substructure. Conclusions: The PGxClean software provides rapid quality-control processing, data analysis, and data visualization for the Affymetrix DMET chip or other candidate gene technologies while improving on common analysis platforms by not assuming that variants are biallelic. The web application is available at www.pgxclean.com.
    Electronic ISSN: 1756-0381
    Topics: Biology , Computer Science
    Published by BioMed Central
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Publication Date: 2014-11-07
    Description: Motivation: The identification of active transcriptional regulatory elements is crucial to understand regulatory networks driving cellular processes such as cell development and the onset of diseases. It has recently been shown that chromatin structure information, such as DNase I hypersensitivity (DHS) or histone modifications, significantly improves cell-specific predictions of transcription factor binding sites. However, no method has so far successfully combined both DHS and histone modification data to perform active binding site prediction. Results: We propose here a method based on hidden Markov models to integrate DHS and histone modifications occupancy for the detection of open chromatin regions and active binding sites. We have created a framework that includes treatment of genomic signals, model training and genome-wide application. In a comparative analysis, our method obtained a good trade-off between sensitivity versus specificity and superior area under the curve statistics than competing methods. Moreover, our technique does not require further training or sequence information to generate binding location predictions. Therefore, the method can be easily applied on new cell types and allow flexible downstream analysis such as de novo motif finding. Availability and implementation: Our framework is available as part of the Regulatory Genomics Toolbox. The software information and all benchmarking data are available at http://costalab.org/wp/dh-hmm . Contact: ivan.costa@rwth-aachen.de or eduardo.gusmao@rwth-aachen.de Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Publication Date: 2014-11-07
    Description: Motivation: A proper target or marker is essential in any diagnosis (e.g. an infection or cancer). An ideal diagnostic target should be both conserved in and unique to the pathogen. Currently, these targets can only be identified manually, which is time-consuming and usually error-prone. Because of the increasingly frequent occurrences of emerging epidemics and multidrug-resistant ‘superbugs’, a rapid diagnostic target identification process is needed. Results: A new method that can identify uniquely conserved regions (UCRs) as candidate diagnostic targets for a selected group of organisms solely from their genomic sequences has been developed and successfully tested. Using a sequence-indexing algorithm to identify UCRs and a k -mer integer-mapping model for computational efficiency, this method has successfully identified UCRs within the bacteria domain for 15 test groups, including pathogenic, probiotic, commensal and extremophilic bacterial species or strains. Based on the identified UCRs, new diagnostic primer sets were designed, and their specificity and efficiency were tested by polymerase chain reaction amplifications from both pure isolates and samples containing mixed cultures. Availability and implementation: The UCRs identified for the 15 bacterial species are now freely available at http://ucr.synblex.com . The source code of the programs used in this study is accessible at http://ucr.synblex.com/bacterialIdSourceCode.d.zip Contact: yazhousun@synblex.com Supplementary Information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Publication Date: 2014-11-07
    Description: Motivation: A popular method for classification of protein domain movements apportions them into two main types: those with a ‘hinge’ mechanism and those with a ‘shear’ mechanism. The intuitive assignment of domain movements to these classes has limited the number of domain movements that can be classified in this way. Furthermore, whether intended or not, the term ‘shear’ is often interpreted to mean a relative translation of the domains. Results: Numbers of occurrences of four different types of residue contact changes between domains were optimally combined by logistic regression using the training set of domain movements intuitively classified as hinge and shear to produce a predictor for hinge and shear. This predictor was applied to give a 10-fold increase in the number of examples over the number previously available with a high degree of precision. It is shown that overall a relative translation of domains is rare, and that there is no difference between hinge and shear mechanisms in this respect. However, the shear set contains significantly more examples of domains having a relative twisting movement than the hinge set. The angle of rotation is also shown to be a good discriminator between the two mechanisms. Availability and implementation: Results are free to browse at http://www.cmp.uea.ac.uk/dyndom/interface/ . Contact: sjh@cmp.uea.ac.uk . Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Publication Date: 2014-11-07
    Description: Motivation: Recent studies on human disease have revealed that aberrant interaction between proteins probably underlies a substantial number of human genetic diseases. This suggests a need to investigate disease inheritance mode using interaction, and based on which to refresh our conceptual understanding of a series of properties regarding inheritance mode of human disease. Results: We observed a strong correlation between the number of protein interactions and the likelihood of a gene causing any dominant diseases or multiple dominant diseases, whereas no correlation was observed between protein interaction and the likelihood of a gene causing recessive diseases. We found that dominant diseases are more likely to be associated with disruption of important interactions. These suggest inheritance mode should be understood using protein interaction. We therefore reviewed the previous studies and refined an interaction model of inheritance mode, and then confirmed that this model is largely reasonable using new evidences. With these findings, we found that the inheritance mode of human genetic diseases can be predicted using protein interaction. By integrating the systems biology perspectives with the classical disease genetics paradigm, our study provides some new insights into genotype–phenotype correlations. Contact: haodapeng@ems.hrbmu.edu.cn or biofomeng@hotmail.com Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Publication Date: 2014-11-07
    Description: : Recently, several high profile studies collected cell viability data from panels of cancer cell lines treated with many drugs applied at different concentrations. Such drug sensitivity data for cancer cell lines provide suggestive treatments for different types and subtypes of cancer. Visualization of these datasets can reveal patterns that may not be obvious by examining the data without such efforts. Here we introduce Drug/Cell-line Browser (DCB), an online interactive HTML5 data visualization tool for interacting with three of the recently published datasets of cancer cell lines/drug-viability studies. DCB uses clustering and canvas visualization of the drugs and the cell lines, as well as a bar graph that summarizes drug effectiveness for the tissue of origin or the cancer subtypes for single or multiple drugs. DCB can help in understanding drug response patterns and prioritizing drug/cancer cell line interactions by tissue of origin or cancer subtype. Availability and implementation: DCB is an open source Web-based tool that is freely available at: http://www.maayanlab.net/LINCS/DCB Contact: avi.maayan@mssm.edu Supplementary information: Supplementary data are available at Bioinformatics online.
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Publication Date: 2014-11-07
    Description: In recent years, Bayesian Network has become an important modeling method for decision making problems of real-world applications. In this paper learning parameters of a fuzzy Bayesian Network (BN) based on imprecise/fuzzy observations is considered, where imprecise observations particularly refers to triangular fuzzy numbers. To achieve this, an extension to fuzzy probability theory based on imprecise observations is proposed which employs both the "truth" concept of Yager and the Extension Principle in fuzzy set theory. In addition, some examples are given to demonstrate the concepts of the proposed idea. The aim of our suggestion is to be able to estimate joint fuzzy probability and the conditional probability tables (CPTs) of Bayesian Network based on imprecise observations. Two real-world datasets, Car Evaluation Database (CED) and Extending Credibility (EC), are employed where some of attributes have crisp (exact) and some of them have fuzzy observations. Estimated parameters of the CED's corresponding network, using our extension, are shown in tables. Then, using Kullback-Leibler divergence, two scenarios are considered to show that fuzzy parameters preserve more knowledge than that of crisp parameters. This phenomenon is also true in cases where there are a small number of observations. Finally, to examine a network with fuzzy parameters versus the network with crisp parameters, accuracy result of predictions is provided which shows improvements in the predictions. Content Type Journal Article Pages 167-180 DOI 10.3233/KES-140296 Authors Mostafa Ghazizadeh-Ahsaee, Ferdowsi University of Mashhad, Mashhad, Iran Mahmoud Naghibzadeh, Ferdowsi University of Mashhad, Mashhad, Iran Bahram Sadeghpour Gildeh, Ferdowsi University of Mashhad, Mashhad, Iran Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014
    Print ISSN: 1327-2314
    Electronic ISSN: 1875-8827
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Publication Date: 2014-11-07
    Description: This paper presents an interactive verifier for logic programs. These logic programs are constructed by a schema-based method. Each program is associated with proof schemes due to the program development method. The correctness proof of a program is guided by its associated proof schemes. The main components of the verifier are the prover which carries out the proof steps, the knowledge base (KB) which includes representations of all theories and transformation rules, the KB update which supports the update of KB and the graphical user interface (GUI). The emphasis in the design of this proof checker is on effective guidance of the proof based on the activated proof schemes and on performance by the verifier of tedious, trivial and time consuming tasks. The difficult proof decisions are taken by the user, then, the proof checker applies them. The design of the interface is based on providing the user the required support for the proof of a theorem and for the update of KB. This system is an effective and useful tool for the interactive verification of non-trivial logic programs. Content Type Journal Article Pages 143-156 DOI 10.3233/KES-140294 Authors Emmanouil Marakakis, Department of Informatics Engineering, Technological Educational Institute of Crete, Heraklion, Greece Haridimos Kondylakis, Department of Informatics Engineering, Technological Educational Institute of Crete, Heraklion, Greece Nikos Papadakis, Department of Informatics Engineering, Technological Educational Institute of Crete, Heraklion, Greece Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014
    Print ISSN: 1327-2314
    Electronic ISSN: 1875-8827
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Publication Date: 2014-11-07
    Description: We concern the issue of preference recommendation towards more reliable recommender system. General recommender system provides a collection of items or several bests of them, on the basis of a fixed preference constraint. However, the realistic preference from users may be such complicated that makes conventional recommender system unreliable. In real-world applications, e.g. travel planning or hotel selection, specific constraints may be involved like a limited travel time or an appropriate budget for hotel accommodation. Motivated by these applications, we investigate the constrained preference recommendation (CPR), in which two main types are studied including Threshold-CPR (T-CPR) and Range-CPR (R-CPR). We firstly analyze and define the related problems. Then, we provide solutions with illustration of problem-solving procedure. The results are analogized with other representative techniques. Finally, we provide an extension study on the general CPR problems. Therein, we firstly provide a normalized system for constraint representation. Secondly, we utilize the proposed normalized system to analyze representative literature. Content Type Journal Article Pages 157-165 DOI 10.3233/KES-140295 Authors Anming Li, Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Hong Kong, China Junyi Chai, Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Hong Kong, China Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014
    Print ISSN: 1327-2314
    Electronic ISSN: 1875-8827
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Publication Date: 2014-11-07
    Description: The purpose of security checks at airports is to achieve a reduction in the risk of malevolent attacks on the aviation system. The introduction of new security measures aims at reducing this perceived level of risk, and often takes place as a direct reaction to (attempted) attacks. This procedure means that offenders remain one step ahead of security agents. The aim of the approach presented here is to overcome this shortfall by supporting decision-making in the context of airport security by a systematically created knowledge base. The combination of two well-accepted methods – scenario analysis and structural complexity management – supports a structured knowledge acquisition process that serves as a basis for the proactive identification of system weaknesses. Furthermore, this combination of methods can be applied to the search for optimisation potentials concerned with possible future threats. The basis for the approach is composed of threat scenario components, security measures and dependencies between these elements. A Multiple-Domain Matrix is applied for system modelling. Clustering of threat scenarios and intensity of relations to security measures are used for analysis. The interpretation of findings makes use of portfolio representations. Content Type Journal Article Pages 191-200 DOI 10.3233/KES-140300 Authors Mara Cole, Bauhaus Luftfahrt e.V., Munich, Germany Maik Maurer, Institute of Product Development, Technische Universität München, Garching, Germany Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014
    Print ISSN: 1327-2314
    Electronic ISSN: 1875-8827
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Publication Date: 2014-11-07
    Description: A generalized Bayesian inference nets model (GBINM) to aid developers to construct self-adaptive Bayesian inference nets for various applications and a new approach of defining and assigning statistical parameters to Bayesian inference nodes needed to calculate propagation of probabilities and address uncertainties are proposed. GBINM and the proposed approach are applied to design an intelligent medical system to diagnose cardiovascular diseases. Thousands of site-sampled clinical data are used for designing and testing such a constructed system. The preliminary diagnostic results show that the proposed methodology has salient validity and effectiveness Content Type Journal Article Pages 181-190 DOI 10.3233/KES-140299 Authors Booma Devi Sekar, Department of ECE, Faculty of Science and Technology, University of Macau, Macau, China Mingchui Dong, Department of ECE, Faculty of Science and Technology, University of Macau, Macau, China Journal International Journal of Knowledge-Based and Intelligent Engineering Systems Online ISSN 1875-8827 Print ISSN 1327-2314 Journal Volume Volume 18 Journal Issue Volume 18, Number 3 / 2014
    Print ISSN: 1327-2314
    Electronic ISSN: 1875-8827
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Publication Date: 2014-11-07
    Description: This paper presents a cost optimization model for scheduling scientific workflows on IaaS clouds such as Amazon EC2 or RackSpace. We assume multiple IaaS clouds with heterogeneous virtual machine instances, with limited number of instances per cloud and hourly billing. Input and output data are stored on a cloud object store such as Amazon S3. Applications are scientific workflows modeled as DAGs as in the Pegasus Workflow Management System. We assume that tasks in the workflows are grouped into levels of identical tasks. Our model is specified using mathematical programming languages (AMPL and CMPL) and allows us to minimize the cost of workflow execution under deadline constraints. We present results obtained using our model and the benchmark workflows representing real scientific applications in a variety of domains. The data used for evaluation come from the synthetic workflows, from general purpose cloud benchmarks, as well as from the data measured in our own experiments with Montage, an astronomical application, executed on Amazon EC2 cloud. We indicate how this model can be used for scenarios that require resource planning for scientific workflows and their ensembles. Content Type Journal Article Pages - DOI 10.3233/SPR-140406 Authors Maciej Malawski, Department of Computer Science AGH, Kraków, Poland Kamil Figiela, Department of Computer Science AGH, Kraków, Poland Marian Bubak, Department of Computer Science AGH, Kraków, Poland Ewa Deelman, USC Information Sciences Institute, Marina del Rey, CA, USA Jarek Nabrzyski, Center for Research Computing, University of Notre Dame, Notre Dame, IN, USA. E-mails: malawski@agh.edu.pl, kfigiela@agh.edu.pl, bubak@agh.edu.pl, deelman@isi.edu, naber@nd.edu Journal Scientific Programming Online ISSN 1875-919X Print ISSN 1058-9244
    Print ISSN: 1058-9244
    Topics: Computer Science
    Published by IOS Press
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Publication Date: 2014-11-07
    Description: by Ryan Tasseff, Anjali Bheda-Malge, Teresa DiColandrea, Charles C. Bascom, Robert J. Isfort, Richard Gelinas The hair cycle is a dynamic process where follicles repeatedly move through phases of growth, retraction, and relative quiescence. This process is an example of temporal and spatial biological complexity. Understanding of the hair cycle and its regulation would shed light on many other complex systems relevant to biological and medical research. Currently, a systematic characterization of gene expression and summarization within the context of a mathematical model is not yet available. Given the cyclic nature of the hair cycle, we felt it was important to consider a subset of genes with periodic expression. To this end, we combined several mathematical approaches with high-throughput, whole mouse skin, mRNA expression data to characterize aspects of the dynamics and the possible cell populations corresponding to potentially periodic patterns. In particular two gene clusters, demonstrating properties of out-of-phase synchronized expression, were identified. A mean field, phase coupled oscillator model was shown to quantitatively recapitulate the synchronization observed in the data. Furthermore, we found only one configuration of positive-negative coupling to be dynamically stable, which provided insight on general features of the regulation. Subsequent bifurcation analysis was able to identify and describe alternate states based on perturbation of system parameters. A 2-population mixture model and cell type enrichment was used to associate the two gene clusters to features of background mesenchymal populations and rapidly expanding follicular epithelial cells. Distinct timing and localization of expression was also shown by RNA and protein imaging for representative genes. Taken together, the evidence suggests that synchronization between expanding epithelial and background mesenchymal cells may be maintained, in part, by inhibitory regulation, and potential mediators of this regulation were identified. Furthermore, the model suggests that impairing this negative regulation will drive a bifurcation which may represent transition into a pathological state such as hair miniaturization.
    Print ISSN: 1553-734X
    Electronic ISSN: 1553-7358
    Topics: Biology , Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Publication Date: 2014-11-07
    Description: by Varsha Dhankani, J. Nathan Kutz, Joshua T. Schiffer Herpes simplex virus-2 (HSV-2) is a chronic reactivating infection that leads to recurrent shedding episodes in the genital tract. A minority of episodes are prolonged, and associated with development of painful ulcers. However, currently, available tools poorly predict viral trajectories and timing of reactivations in infected individuals. We employed principal components analysis (PCA) and singular value decomposition (SVD) to interpret HSV-2 genital tract shedding time series data, as well as simulation output from a stochastic spatial mathematical model. Empirical and model-derived, time-series data gathered over 〉30 days consists of multiple complex episodes that could not be reduced to a manageable number of descriptive features with PCA and SVD. However, single HSV-2 shedding episodes, even those with prolonged duration and complex morphologies consisting of multiple erratic peaks, were consistently described using a maximum of four dominant features. Modeled and clinical episodes had equivalent distributions of dominant features, implying similar dynamics in real and simulated episodes. We applied linear discriminant analysis (LDA) to simulation output and identified that local immune cell density at the viral reactivation site had a predictive effect on episode duration, though longer term shedding suggested chaotic dynamics and could not be predicted based on spatial patterns of immune cell density. These findings suggest that HSV-2 shedding patterns within an individual are impossible to predict over weeks or months, and that even highly complex single HSV-2 episodes can only be partially predicted based on spatial distribution of immune cell density.
    Print ISSN: 1553-734X
    Electronic ISSN: 1553-7358
    Topics: Biology , Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    facet.materialart.
    Unknown
    Public Library of Science (PLoS)
    Publication Date: 2014-11-07
    Description: by Marcin J. Skwark, Daniele Raimondi, Mirco Michel, Arne Elofsson Given sufficient large protein families, and using a global statistical inference approach, it is possible to obtain sufficient accuracy in protein residue contact predictions to predict the structure of many proteins. However, these approaches do not consider the fact that the contacts in a protein are neither randomly, nor independently distributed, but actually follow precise rules governed by the structure of the protein and thus are interdependent. Here, we present PconsC2, a novel method that uses a deep learning approach to identify protein-like contact patterns to improve contact predictions. A substantial enhancement can be seen for all contacts independently on the number of aligned sequences, residue separation or secondary structure type, but is largest for β -sheet containing proteins. In addition to being superior to earlier methods based on statistical inferences, in comparison to state of the art methods using machine learning, PconsC2 is superior for families with more than 100 effective sequence homologs. The improved contact prediction enables improved structure prediction.
    Print ISSN: 1553-734X
    Electronic ISSN: 1553-7358
    Topics: Biology , Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Publication Date: 2014-11-07
    Description: by Veronika Boskova, Sebastian Bonhoeffer, Tanja Stadler Quantifying epidemiological dynamics is crucial for understanding and forecasting the spread of an epidemic. The coalescent and the birth-death model are used interchangeably to infer epidemiological parameters from the genealogical relationships of the pathogen population under study, which in turn are inferred from the pathogen genetic sequencing data. To compare the performance of these widely applied models, we performed a simulation study. We simulated phylogenetic trees under the constant rate birth-death model and the coalescent model with a deterministic exponentially growing infected population. For each tree, we re-estimated the epidemiological parameters using both a birth-death and a coalescent based method, implemented as an MCMC procedure in BEAST v2.0. In our analyses that estimate the growth rate of an epidemic based on simulated birth-death trees, the point estimates such as the maximum a posteriori/maximum likelihood estimates are not very different. However, the estimates of uncertainty are very different. The birth-death model had a higher coverage than the coalescent model, i.e. contained the true value in the highest posterior density (HPD) interval more often (2–13% vs. 31–75% error). The coverage of the coalescent decreases with decreasing basic reproductive ratio and increasing sampling probability of infecteds. We hypothesize that the biases in the coalescent are due to the assumption of deterministic rather than stochastic population size changes. Both methods performed reasonably well when analyzing trees simulated under the coalescent. The methods can also identify other key epidemiological parameters as long as one of the parameters is fixed to its true value. In summary, when using genetic data to estimate epidemic dynamics, our results suggest that the birth-death method will be less sensitive to population fluctuations of early outbreaks than the coalescent method that assumes a deterministic exponentially growing infected population.
    Print ISSN: 1553-734X
    Electronic ISSN: 1553-7358
    Topics: Biology , Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Publication Date: 2014-11-07
    Description: by Junaid Hassan, Linda L. Bergaust, I. David Wheat, Lars R. Bakken In response to impending anoxic conditions, denitrifying bacteria sustain respiratory metabolism by producing enzymes for reducing nitrogen oxyanions/-oxides (NO x ) to N 2 (denitrification). Since denitrifying bacteria are non-fermentative, the initial production of denitrification proteome depends on energy from aerobic respiration. Thus, if a cell fails to synthesise a minimum of denitrification proteome before O 2 is completely exhausted, it will be unable to produce it later due to energy-limitation. Such entrapment in anoxia is recently claimed to be a major phenomenon in batch cultures of the model organism Paracoccus denitrificans on the basis of measured e − -flow rates to O 2 and NO x . Here we constructed a dynamic model and explicitly simulated actual kinetics of recruitment of the cells to denitrification to directly and more accurately estimate the recruited fraction (). Transcription of nirS is pivotal for denitrification, for it triggers a cascade of events leading to the synthesis of a full-fledged denitrification proteome. The model is based on the hypothesis that nirS has a low probability (, h −1 ) of initial transcription, but once initiated, the transcription is greatly enhanced through positive feedback by NO, resulting in the recruitment of the transcribing cell to denitrification. We assume that the recruitment is initiated as [O 2 ] falls below a critical threshold and terminates (assuming energy-limitation) as [O 2 ] exhausts. With  = 0.005 h −1 , the model robustly simulates observed denitrification kinetics for a range of culture conditions. The resulting (fraction of the cells recruited to denitrification) falls within 0.038–0.161. In contrast, if the recruitment of the entire population is assumed, the simulated denitrification kinetics deviate grossly from those observed. The phenomenon can be understood as a ‘bet-hedging strategy’: switching to denitrification is a gain if anoxic spell lasts long but is a waste of energy if anoxia turns out to be a ‘false alarm’.
    Print ISSN: 1553-734X
    Electronic ISSN: 1553-7358
    Topics: Biology , Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Publication Date: 2014-11-07
    Description: by Thomas R. Caulfield, Fabienne C. Fiesel, Elisabeth L. Moussaud-Lamodière, Daniel F. A. R. Dourado, Samuel C. Flores, Wolfdieter Springer Loss-of-function mutations in PINK1 or PARKIN are the most common causes of autosomal recessive Parkinson's disease. Both gene products, the Ser/Thr kinase PINK1 and the E3 Ubiquitin ligase Parkin, functionally cooperate in a mitochondrial quality control pathway. Upon stress, PINK1 activates Parkin and enables its translocation to and ubiquitination of damaged mitochondria to facilitate their clearance from the cell. Though PINK1-dependent phosphorylation of Ser65 is an important initial step, the molecular mechanisms underlying the activation of Parkin's enzymatic functions remain unclear. Using molecular modeling, we generated a complete structural model of human Parkin at all atom resolution. At steady state, the Ub ligase is maintained inactive in a closed, auto-inhibited conformation that results from intra-molecular interactions. Evidently, Parkin has to undergo major structural rearrangements in order to unleash its catalytic activity. As a spark, we have modeled PINK1-dependent Ser65 phosphorylation in silico and provide the first molecular dynamics simulation of Parkin conformations along a sequential unfolding pathway that could release its intertwined domains and enable its catalytic activity. We combined free (unbiased) molecular dynamics simulation, Monte Carlo algorithms, and minimal-biasing methods with cell-based high content imaging and biochemical assays. Phosphorylation of Ser65 results in widening of a newly defined cleft and dissociation of the regulatory N-terminal UBL domain. This motion propagates through further opening conformations that allow binding of an Ub-loaded E2 co-enzyme. Subsequent spatial reorientation of the catalytic centers of both enzymes might facilitate the transfer of the Ub moiety to charge Parkin. Our structure-function study provides the basis to elucidate regulatory mechanisms and activity of the neuroprotective Parkin. This may open up new avenues for the development of small molecule Parkin activators through targeted drug design.
    Print ISSN: 1553-734X
    Electronic ISSN: 1553-7358
    Topics: Biology , Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Publication Date: 2014-11-08
    Description: Background: Accurate prediction of cancer prognosis based on gene expression data is generally difficult, and identifying robust prognostic markers for cancer remains a challenging problem. Recent studies have shown that modular markers, such as pathway markers and subnetwork markers, can provide better snapshots of the underlying biological mechanisms by incorporating additional biological information, thereby leading to more accurate cancer classification. Results: In this paper, we propose a novel method for simultaneously identifying robust synergistic subnetwork markers that can accurately predict cancer prognosis. The proposed method utilizes an efficient message-passing algorithm called affinity propagation, based on which we identify groups ? or subnetworks ? of discriminative and synergistic genes, whose protein products are closely located in the protein-protein interaction (PPI) network. Unlike other existing subnetwork marker identification methods, our proposed method can simultaneously identify multiple nonoverlapping subnetwork markers that can synergistically predict cancer prognosis. Conclusions: Evaluation results based on multiple breast cancer datasets demonstrate that the proposed message-passing approach can identify robust subnetwork markers in the human PPI network, which have higher discriminative power and better reproducibility compared to those identified by previous methods. The identified subnetwork makers can lead to better cancer classifiers with improved overall performance and consistency across independent cancer datasets.
    Print ISSN: 1687-4145
    Electronic ISSN: 1687-4153
    Topics: Biology , Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-11-08
    Description: In microprocessor-based systems, such as the cloud computing infrastructure, high reliability is essential. As multiprocessor systems become more widespread and increasingly complex, system-level diagnosis will increasingly be adopted to determine their robustness. In this paper, we consider a pessimistic diagnostic strategy for hypermesh multiprocessor systems under the PMC model. The pessimistic strategy is a diagnostic process whereby all faulty processors are correctly identified and at most one fault-free processor may be misjudged to be a faulty processor. We first determine the pessimistic diagnosability of a hypermesh to be ${2}{{n}}({{k}} - {1}) - {{k}}$ . We then propose an efficient pessimistic diagnostic algorithm to identify at most ${ 2}{{n}}({{k}} - { 1}) - {{k}}$ faults in ${{O}}({{N}})$ time, where ${mbi{k}}$ is the radix, ${mbi{n}}$ is the number of dimensions, and ${{N}} = {{k^n}}$ is the total number of processors. This result is superior to the best precise diagnostic algorithm, which runs in ${{O}}({{N}}{log _{{k}}}{{N}})$ time. Furthermore, the Cartesian product network, a subgraph of the hypermesh and the proposed algorithm can be employed to determine faults in the product network.
    Print ISSN: 0018-9340
    Electronic ISSN: 1557-9956
    Topics: Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    facet.materialart.
    Unknown
    Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2014-11-08
    Description: In a top- $k$ Geometric Intersection Query (top- $k$ GIQ) problem, a set of $n$ weighted, geometric objects in ${bb R}^d$ is to be pre-processed into a compact data structure so that for any query geometric object, $q$ , and integer $k>0$ , the $k$ largest-weight objects intersected by $q$ can be reported efficiently. While the top- $k$ problem has been studied extensively for non-geometric problems (e.g., recommender systems), the geometric version has received little attention. This paper gives a general technique to solve any top-
    Print ISSN: 1041-4347
    Electronic ISSN: 1558-2191
    Topics: Computer Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...