ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (191)
  • Springer  (191)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Institute of Electrical and Electronics Engineers (IEEE)
  • National Academy of Sciences
  • 2015-2019  (78)
  • 2005-2009  (54)
  • 1990-1994
  • 1980-1984  (59)
  • 2017  (78)
  • 2009  (54)
  • 1983  (59)
  • Computing  (26)
  • 4372
  • Computer Science  (191)
Collection
  • Articles  (191)
Publisher
  • Springer  (191)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Institute of Electrical and Electronics Engineers (IEEE)
  • +
Years
  • 2015-2019  (78)
  • 2005-2009  (54)
  • 1990-1994
  • 1980-1984  (59)
Year
Topic
  • Computer Science  (191)
  • 1
    facet.materialart.
    Unknown
    Springer
    In: Computing
    Publication Date: 2017-03-20
    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 ...
  • 2
    Publication Date: 2017-03-03
    Description: Despite the massive influence of business related social network sites (SBNSs) like Xing or LinkedIn regarding our professional networking-behavior, little is known about how motivational components (especially considering the ‘Big Three Motives’ affiliation, achievement and power motive) affect user behavior in SNSs. The study’s findings indicate that the explicit conscious affiliation, achievement and power motive were related to different networking outcomes. While the explicit affiliation motive predicted the percentage of colleagues in the contact list, the total amount of SBNS contacts was predicted by the explicit power motive. Also, people with high explicit achievement motivation networked significantly more often with persons of lower hierarchical status unlike people with less achievement motivated characteristics. This presents us with new research results and closes an empirical gap in motive research.
    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 ...
  • 3
    facet.materialart.
    Unknown
    Springer
    In: Computing
    Publication Date: 2017-05-11
    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 ...
  • 4
    facet.materialart.
    Unknown
    Springer
    In: Computing
    Publication Date: 2017-05-21
    Description: Viterbi algorithm is used in different scientific applications including biological sequence alignment, speech recognition, and probabilistic inference. However, high computational complexity of the Viterbi algorithm is a major concern. Accelerating the Viterbi algorithm is important, especially when the number of states or the length of the sequences increase significantly. In this paper, a parallel solution to improve the performance of Viterbi algorithm is presented. This is achieved by formulating a matrix product based algorithm. This algorithm has been mapped to a NVIDIA graphics processing unit. The performance for different parameters and realizations are compared. The results depicts matrix product is not a viable option for small number of states. However, matrix product solution using shared memory for large number of states gains good performance when compared with the serial version.
    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 ...
  • 5
    Publication Date: 2017-05-09
    Description: Kronecker algebra until now has been applied to concurrent programs that use semaphores and protected objects for synchronization. Like many other programming languages, Ada uses barriers, too. In this paper, we present a new synchronization construct for barriers. By applying this, we are able to statically analyze Ada multi-tasking programs that employ barriers for synchronization issues. It turns out that we can use our existing Kronecker algebra implementation completely unmodified for concurrent program graphs using such barrier synchronization primitives. In addition, we extend a static WCET technique such that our barrier synchronization primitive is supported.
    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 ...
  • 6
    Publication Date: 2017-03-10
    Description: Convenience and the ability to perform advanced transactions encourage banks clients to use e-banking systems. As security and usability are two growing concerns for e-banking users, banks have invested heavily in improving their web portals security and user experience and trust in them. Despite considerable efforts to evaluate particular security and usability features in e-banking systems, a dedicated security and usability evaluation model that can be used as a guide in the development of e-banking assets remains much less explored. To build a comprehensive security and usability evaluation framework, we first extract security and usability evaluation metrics from the conducted literature review and then include several other evaluation metrics that were not previously identified in the literature. We then propose a structured inspection model for thoroughly evaluating the usability and security of internal and external e-banking assets. We argue that the proposed e-banking security and usability evaluation frameworks in the literature in addition to the existing standards of security best practices (e.g., NIST and ISO) are by no means comprehensive and lack some essential and key evaluation metrics that are of particular interest to e-banking portals. In order to demonstrate the inadequacy of existing models, we use the proposed framework to evaluate five major banks. The evaluation reveals several shortcomings in identifying both missing or incorrectly implemented security and privacy features. Our goal is to encourage other researchers to build upon our work.
    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 ...
  • 7
    Publication Date: 2017-03-11
    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 ...
  • 8
    Publication Date: 2017-02-04
    Description: In modern corporate environments, having a disaster recovery solution is no longer a luxury but a business necessity. The adoption of a disaster recovery solution, however, can be costly and often only affordable by large enterprises. Disaster-Recovery-as-a-Service (DRaaS) is a cloud-based solution that small and medium-sized businesses have been adopting to guarantee availability even in catastrophic situations. It offers lower acquisition and operational costs than traditional solutions. This work presents availability models for evaluating a DRaaS solution taking into account crucial disaster recovery metrics, such as downtime, costs, recovery time objective, and transaction loss. Furthermore, we performed sensitivity analysis on the DRaaS model to determine the parameters that cause the greatest impact on the system availability. Based on these analyses, disaster recovery coordinators can determine the optimum point to recover the damaged system by balancing the cost of system downtime against the cost of resources required for restoring the system. Our numerical results show the effectiveness of a DRaaS solution in terms of downtime, cost, and transition loss.
    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 ...
  • 9
    Publication Date: 2017-04-12
    Description: Document matching has become a crucial task for data integration. A considerable amount of algorithms for comparing XML documents have been proposed in the literature. Yet, the existing approaches fall short in ability to identify structural similarities of fuzzy XML documents. To fill this gap, in this paper, we provide an integrated comparison approach to cope with structural similarities of the fuzzy XML documents. Firstly, we propose a new fuzzy XML document tree model to represent fuzzy XML document. Secondly, we offer element/attribute features similarity measure approach to identify matching nodes. Thirdly, we present an effective algorithm based on the tree edit distance to detect the structural similarities between fuzzy XML document trees represented with the proposed model. Finally, the experimental results demonstrate that our approach can efficiently perform structural similarity measure of the fuzzy XML documents.
    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 ...
  • 10
    facet.materialart.
    Unknown
    Springer
    In: Computing
    Publication Date: 2017-04-15
    Description: In this paper, we propose a query relaxation approach to handle the problem of empty or too little answers returned from RDF query. We apply RDF entailment to triple patterns in the original query to get more general answers. We propose the notion of semantic similarity degree so that the returned answers are semantically close to the original query. We present how to compute the semantic similarity degree of a relaxed query with respect to the original query. With the semantic similarity degrees, we can choose the relaxed queries that are semantically close to the original query. On this basis, we give the query relaxation algorithm. We verify our approach by experiments. It is shown that our approach of RDF query relaxation based on the semantic similarity degree has some good performances and is feasible.
    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 ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...