Select data courtesy of the U.S. National Library of Medicine.

© 2026 DeepDyve, Inc. All rights reserved.

This site is protected by VikingCloud's Trusted Commerce program
      Home

    Concurrency and Computation

    Subject:
    Computational Theory and Mathematics
    Publisher:
    Wiley Subscription Services, Inc., A Wiley Company — Wiley
    ISSN:
    Scimago Journal Rank:
    69

    2026

    Volume 38
    Issue 13 (Jul)Issue 12 (Jun)Issue 11 (Jun)Issue 10 (May)Issue 9 (May)Issue 8 (Apr)Issue 7 (Apr)Issue 6 (Mar)Issue 5 (Mar)Issue 4 (Feb)Issue 3 (Feb)Issue 2 (Jan)Issue 1 (Jan)

    2025

    Volume 37
    Issue 27-28 (Dec)Issue 25-26 (Nov)Issue 23-24 (Oct)Issue 21-22 (Sep)Issue 18-20 (Aug)Issue 15-17 (Jul)Issue 12-14 (Jun)Issue 9-11 (May)Issue 6-8 (Apr)Issue 4-5 (Feb)Issue 2 (Jan)Issue 1 (Jan)

    2024

    Volume Early View
    DecemberNovemberJuly
    Volume 36
    Issue 28 (Dec)Issue 27 (Dec)Issue 26 (Nov)Issue 25 (Nov)Issue 24 (Nov)Issue 23 (Oct)Issue 22 (Oct)Issue 21 (Sep)Issue 20 (Sep)Issue 19 (Aug)Issue 18 (Aug)Issue 17 (Aug)Issue 16 (Jul)Issue 15 (Jul)Issue 14 (Jun)Issue 13 (Jun)Issue 12 (May)Issue 11 (May)Issue 10 (May)Issue 9 (Apr)Issue 8 (Apr)Issue 7 (Mar)Issue 6 (Mar)Issue 5 (Feb)Issue 4 (Feb)Issue 3 (Feb)Issue 2 (Jan)Issue 1 (Jan)

    2023

    Volume 35
    Issue 28 (Dec)Issue 27 (Dec)Issue 26 (Nov)Issue 25 (Nov)Issue 24 (Nov)Issue 23 (Oct)Issue 22 (Oct)Issue 21 (Sep)Issue 20 (Sep)Issue 19 (Aug)Issue 18 (Aug)Issue 17 (Aug)Issue 16 (Jul)Issue 15 (Jul)Issue 14 (Jun)Issue 13 (Jun)Issue 12 (May)Issue 11 (May)Issue 10 (May)Issue 9 (Apr)Issue 8 (Apr)Issue 7 (Mar)Issue 6 (Mar)Issue 5 (Feb)Issue 4 (Feb)Issue 3 (Feb)Issue 2 (Jan)Issue 1 (Jan)

    2022

    Volume Early View
    NovemberAugustJulyJuneMayFebruaryJanuary
    Volume 34
    Issue 28 (Dec)Issue 27 (Dec)Issue 26 (Nov)Issue 25 (Nov)Issue 24 (Nov)Issue 23 (Oct)Issue 22 (Oct)Issue 21 (Sep)Issue 20 (Sep)Issue 19 (Aug)Issue 18 (Aug)Issue 17 (Aug)Issue 16 (Jul)Issue 15 (Jul)Issue 14 (Jun)Issue 13 (Jun)Issue 12 (May)Issue 11 (May)Issue 10 (May)Issue 9 (Apr)Issue 8 (Apr)Issue 7 (Mar)Issue 6 (Mar)Issue 5 (Feb)Issue 4 (Feb)Issue 3 (Feb)Issue 2 (Jan)Issue 1 (Jan)

    2021

    Volume Early View
    November
    Volume 33
    Issue 24 (Dec)Issue 23 (Dec)Issue 22 (Nov)Issue 21 (Nov)Issue 20 (Oct)Issue 19 (Oct)Issue 18 (Sep)Issue 17 (Sep)Issue 16 (Aug)Issue 15 (Aug)Issue 14 (Jul)Issue 13 (Jul)Issue 12 (Jun)Issue 11 (Jun)Issue 10 (May)Issue 9 (May)Issue 8 (Apr)Issue 7 (Apr)Issue 6 (Mar)Issue 5 (Mar)Issue 4 (Feb)Issue 3 (Feb)Issue 2 (Jan)Issue 1 (Jan)

    2020

    Volume 2020
    Issue 2010 (Oct)
    Volume 32
    Issue 24 (Dec)Issue 23 (Dec)Issue 22 (Nov)Issue 21 (Nov)Issue 20 (Oct)Issue 19 (Oct)Issue 18 (Sep)Issue 17 (Sep)Issue 16 (Aug)Issue 15 (Aug)Issue 14 (Jul)Issue 13 (Jul)Issue 12 (Jun)Issue 11 (Jun)Issue 10 (May)Issue 9 (May)Issue 8 (Apr)Issue 7 (Apr)Issue 6 (Mar)Issue 5 (Mar)Issue 4 (Feb)Issue 3 (Feb)Issue 2 (Jan)Issue 1 (Jan)
    Volume 30
    Issue 24 (Jan)Issue 22 (Jan)Issue 20 (Jan)Issue 18 (Jan)Issue 16 (Jan)Issue 14 (Jan)Issue 12 (Jan)Issue 10 (Jan)Issue 8 (Jan)Issue 6 (Jan)Issue 4 (Jan)Issue 2 (Jan)

    2019

    Volume 31
    Issue 24 (Dec)Issue 23 (Oct)Issue 22 (Nov)Issue 21 (Oct)Issue 20 (Oct)Issue 19 (Oct)Issue 18 (Sep)Issue 17 (Oct)Issue 16 (Aug)Issue 15 (Oct)Issue 14 (Jul)Issue 13 (Oct)Issue 12 (Jun)Issue 11 (Oct)Issue 10 (May)Issue 9 (Oct)Issue 8 (Apr)Issue 7 (Oct)Issue 6 (Mar)Issue 5 (Oct)Issue 4 (Feb)Issue 3 (Oct)Issue 2 (Jan)Issue 1 (Oct)
    Volume 29
    Issue 24 (Jan)Issue 22 (Jan)Issue 20 (Jan)Issue 18 (Jan)Issue 16 (Jan)Issue 14 (Jan)Issue 12 (Jan)Issue 10 (Jan)Issue 8 (Jan)Issue 6 (Jan)Issue 4 (Jan)Issue 2 (Jan)

    2018

    Volume 2018
    Issue 1805 (May)
    Volume 31
    Issue 16 (Nov)
    Volume 30
    Issue 23 (Oct)Issue 21 (Oct)Issue 19 (Oct)Issue 17 (Oct)Issue 15 (Oct)Issue 13 (Oct)Issue 11 (Oct)Issue 9 (Oct)Issue 7 (Oct)Issue 5 (Oct)Issue 3 (Oct)Issue 1 (Oct)

    2017

    Volume 29
    Issue 23 (Oct)Issue 21 (Oct)Issue 19 (Oct)Issue 17 (Oct)Issue 15 (Oct)Issue 13 (Oct)Issue 11 (Oct)Issue 9 (Oct)Issue 7 (Oct)Issue 5 (Oct)Issue 3 (Oct)Issue 1 (Oct)

    2016

    Volume 28
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)
    Volume 26
    Issue 18 (Jan)Issue 14 (Jan)Issue 12 (Jan)Issue 9 (Jan)Issue 6 (Jan)Issue 4 (Jan)

    2015

    Volume 27
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2014

    Volume 26
    Issue 17 (Oct)Issue 16 (Nov)Issue 15 (Oct)Issue 13 (Oct)Issue 11 (Oct)Issue 10 (Jul)Issue 8 (Oct)Issue 7 (May)Issue 5 (Oct)Issue 3 (Oct)Issue 2 (Feb)Issue 1 (Jan)

    2013

    Volume 25
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Feb)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2012

    Volume 24
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2011

    Volume 23
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2010

    Volume 22
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2009

    Volume 21
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2008

    Volume 20
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2007

    Volume 19
    Issue 18 (Dec)Issue 17 (Dec)Issue 16 (Nov)Issue 15 (Oct)Issue 14 (Sep)Issue 13 (Sep)Issue 12 (Aug)Issue 11 (Aug)Issue 10 (Jul)Issue 9 (Jun)Issue 8 (Jun)Issue 7 (May)Issue 6 (Apr)Issue 5 (Apr)Issue 4 (Mar)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2006

    Volume 18
    Issue 15 (Dec)Issue 14 (Dec)Issue 13 (Nov)Issue 12 (Oct)Issue 11 (Sep)Issue 10 (Aug)Issue 9 (Aug)Issue 8 (Jul)Issue 7 (Jun)Issue 6 (May)Issue 5 (Apr)Issue 4 (Apr)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2005

    Volume 17
    Issue 15 (Dec)Issue 14 (Dec)Issue 13 (Nov)Issue 12 (Oct)Issue 11 (Sep)Issue 10 (Aug)Issue 9 (Aug)Issue 7‐8 (Jun)Issue 5‐6 (Apr)Issue 2‐4 (Feb)Issue 1 (Jan)

    2004

    Volume 16
    S1 (Dec)Issue 15 (Dec)Issue 14 (Dec)Issue 13 (Nov)Issue 12 (Oct)Issue 11 (Sep)Issue 10 (Aug)Issue 9 (Aug)Issue 8 (Jul)Issue 7 (Jun)Issue 6 (May)Issue 5 (Apr)Issue 4 (Apr)Issue 2‐3 (Feb)Issue 1 (Jan)

    2003

    Volume 15
    Issue 15 (Dec)Issue 14 (Dec)Issue 13 (Nov)Issue 11‐12 (Sep)Issue 10 (Aug)Issue 9 (Aug)Issue 7‐8 (Jun)Issue 6 (May)Issue 3‐5 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    2002

    Volume 14
    Issue 13‐15 (Nov)Issue 12 (Oct)Issue 11 (Aug)Issue 10 (Aug)Issue 8‐9 (Jul)Issue 6‐7 (May)Issue 5 (Apr)Issue 4 (Apr)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)
    Volume 12
    Issue 15 (Jan)Issue 10 (Jan)Issue 5 (Jan)

    2001

    Volume 13
    Issue 15 (Dec)Issue 14 (Dec)Issue 13 (Nov)Issue 12 (Oct)Issue 11 (Sep)Issue 10 (Aug)Issue 8‐9 (Jul)Issue 7 (Jun)Issue 6 (May)Issue 5 (Apr)Issue 4 (Apr)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)
    Volume 11
    Issue 15 (Jan)Issue 10 (Jan)Issue 5 (Jan)

    2000

    Volume 12
    Issue 14 (Oct)Issue 13 (Nov)Issue 12 (Oct)Issue 11 (Sep)Issue 9 (Oct)Issue 8 (Jul)Issue 7 (May)Issue 6 (May)Issue 4 (Oct)Issue 2‐3 (Feb)Issue 1 (Jan)
    Volume 10
    Issue 15 (Jan)Issue 10 (Jan)Issue 5 (Jan)

    1999

    Volume 11
    Issue 14 (Oct)Issue 13 (Nov)Issue 12 (Oct)Issue 11 (Sep)Issue 9 (Oct)Issue 8 (Jul)Issue 7 (Jun)Issue 6 (May)Issue 4 (Oct)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    1998

    Volume 10
    Issue 14 (Oct)Issue 11‐13 (Sep)Issue 9 (Oct)Issue 8 (Jul)Issue 7 (Jun)Issue 6 (May)Issue 4 (Oct)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    1997

    Volume 9
    Issue 12 (Dec)Issue 11 (Nov)Issue 10 (Oct)Issue 9 (Sep)Issue 8 (Aug)Issue 7 (Jul)Issue 6 (Jun)Issue 5 (May)Issue 4 (Apr)Issue 3 (Mar)Issue 2 (Feb)Issue 1 (Jan)

    1996

    Volume 8
    Issue 10 (Dec)Issue 9 (Nov)Issue 8 (Oct)Issue 7 (Sep)Issue 6 (Jul)Issue 5 (Jun)Issue 4 (May)Issue 3 (Apr)Issue 2 (Mar)Issue 1 (Jan)

    1995

    Volume 7
    Issue 8 (Dec)Issue 7 (Oct)Issue 6 (Sep)Issue 5 (Aug)Issue 4 (Jun)Issue 3 (May)Issue 2 (Apr)Issue 1 (Feb)

    1994

    Volume 6
    Issue 8 (Dec)Issue 7 (Oct)Issue 6 (Sep)Issue 5 (Aug)Issue 4 (Jun)Issue 3 (May)Issue 2 (Apr)Issue 1 (Feb)

    1993

    Volume 5
    Issue 8 (Dec)Issue 7 (Oct)Issue 6 (Sep)Issue 5 (Aug)Issue 4 (Jun)Issue 3 (May)Issue 2 (Apr)Issue 1 (Feb)

    1992

    Volume 4
    Issue 8 (Dec)Issue 7 (Oct)Issue 6 (Sep)Issue 5 (Aug)Issue 4 (Jun)Issue 3 (May)Issue 2 (Apr)Issue 1 (Feb)

    1991

    Volume 3
    Issue 6 (Dec)Issue 5 (Oct)Issue 4 (Aug)Issue 3 (Jun)Issue 2 (Apr)Issue 1 (Feb)

    1990

    Volume 2
    Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

    1989

    Volume 1
    Issue 2 (Dec)Issue 1 (Sep)
    journal article
    LitStream Collection
    Research on the Application of Improved BERT‐DPCNN Model in Chinese News Text Classification

    Wang, Heda; Zhang, Shuyan

    2024 Concurrency and Computation

    doi: 10.1002/cpe.8338pmid: N/A

    This paper introduces an enhanced BERT‐DPCNN model for the task of Chinese news text classification. The model addresses the common challenge of balancing accuracy and computational efficiency in existing models, especially when dealing with large‐scale, high‐dimensional text data. To tackle this issue, the paper proposes an improved BERT‐DPCNN model that integrates BERT's pre‐trained language model with DPCNN's efficient convolutional structure to capture deep semantic information and key features from the text. Additionally, the paper incorporates the zebra optimization algorithm (ZOA) to dynamically optimize the model's hyperparameters, overcoming the limitations of manual tuning in traditional models. By automatically optimizing hyperparameters such as batch size, learning rate, and the number of filters through ZOA, the model's classification performance is significantly enhanced. Experimental results demonstrate that the improved ZOA‐BERT‐DPCNN model outperforms traditional methods on the THUCNEWS Chinese news dataset, not only verifying its effectiveness in news text classification tasks but also showcasing its potential to enhance classification performance.
    journal article
    LitStream Collection
    REHAS: Robust and Efficient Hyperelliptic Curve‐Based Authentication Scheme for Internet of Drones

    Pratap, Bhanu; Singh, Ayush; Mehra, Pawan Singh

    2024 Concurrency and Computation

    doi: 10.1002/cpe.8333pmid: N/A

    Internet of Drones (IoD) is one of the most beneficial and has many versatile applications like Surveillance and Security, Delivery and Logistics, Environmental Monitoring, Agriculture, and so forth. The IoD network is crucial for collecting sensitive data like geo‐coordinates, vehicle traffic data, and property details while surveying the various deployment locations in smart cities. The communication between users and drones can be compromised over insecure wireless channels by multiple attacks such as Man‐in‐the‐middle‐attack, Denial of Service, and so forth. Many schemes have already been propounded in the field of IoD. Still, many of them cannot address the resource constraints problem of drones, and existing protocols have higher computation and communication costs. Therefore, this paper has proposed a robust and efficient Hyper‐Elliptic Curve‐based authentication scheme (REHAS), which provides a session key for secure communication. Artificial Identities are generated using a hash function and random numbers. Fuzzy Extractor is used for user biometric authentication, which makes the smart device secure when lost. HECC is used with a smaller bit size of 80 bits rather than ECC of 160 bits. The security of the REHAS has been ensured using Scyther simulation. Furthermore, the resilience, safety, and robustness of REHAS are ensured by Informal security analysis. Lastly, a comparative study of the REHAS has been performed with other related Authentication and key agreement (AKA) protocols regarding communication cost, Computation cost, and security features, demonstrating that REHAS incurred less computation cost (6.7171 ms), communication overhead (1696 bits), and energy consumption (22.5 mJ) than other existing AKA schemes.
    journal article
    LitStream Collection
    Fatigue Detection Based on Blood Volume Pulse Signal and Multi‐Physical Features

    Chen, Xiaowen; Lv, Jian; Xie, Qingsheng

    2024 Concurrency and Computation

    doi: 10.1002/cpe.8339pmid: N/A

    Fatigue detection holds paramount importance in the timely identification of safety hazards. Nonetheless, prevailing fatigue detection methodologies often overlook the diverse spectrum of fatigue features or temporal cues. To address this lacuna, we introduce fatigue detection based on blood volume pulse signal and multi‐physical features (FDBVPS‐MF). Initially, a non‐invasive technique is employed to extract the blood volume pulse signal (BVPS) from the forehead region, which is subsequently fed into a one‐dimensional convolutional neural network (1D CNN) to formulate a fatigue detection model based on BVPS. Concurrently, features such as percentage of eyelid closure (PERCLOS), blink frequency (BF), and maximum closing time (MCT) are computed from eye images, and amalgamated with yawning frequency (YF) derived from mouth images to generate multi‐physical features (MF). MF is then input into the 1D CNN network to construct a fatigue detection model based on MF. Subsequently, employing weights, derived through Adaboosting, a fusion approach is executed to integrate the outputs of the two fatigue detection models, thus facilitating multi‐modal fatigue detection. On the UTA‐RLDD dataset, the proposed FDBVPS‐MF exhibits an accuracy and precision of 88.9% and 88.2%, respectively. Experimental findings substantiate the superior efficacy of FDBVPS‐MF over conventional methodologies.

    Showing 1 to 3 of 3 Articles

    Articles per page
    Browse All Journals

    Related Journals: