GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Wiley  (6)
  • Mathematics  (6)
Material
Publisher
  • Wiley  (6)
Language
Years
Subjects(RVK)
  • Mathematics  (6)
RVK
  • 1
    Online Resource
    Online Resource
    Wiley ; 2018
    In:  Concurrency and Computation: Practice and Experience Vol. 30, No. 20 ( 2018-10-25)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 30, No. 20 ( 2018-10-25)
    Abstract: Nowadays, cloud service providers usually offer users virtual machines with various combinations of configurations and prices. As this new service scheme emerges, the problem of choosing the cost‐minimized combination under a deadline constraint is becoming more complex for users. The complexity of determining the cost‐minimized combination may be resulted from different causes: the characteristics of user applications and providers' setting on the configurations and pricing of virtual machine. In this paper, we proposed an algorithm with two variants to help the users to schedule their workflow applications on clouds so that the cost can be minimized and the deadline constraints can be satisfied. The proposed algorithm is evaluated by extensive simulation experiments with two realistic workflows.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2018
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Wiley ; 2022
    In:  Concurrency and Computation: Practice and Experience Vol. 34, No. 1 ( 2022-01-10)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 34, No. 1 ( 2022-01-10)
    Abstract: Blockchain has decentralization characteristics and requires more targeted security schemes to protect user privacy. In contrast, existing signature schemes have many high‐complexity operations and impose an enormous computational burden on wireless nodes. This article proposes a light‐weighted identity privacy scheme for blockchain‐based on edge computing. We construct linkable identity privacy and non‐linkable identity privacy, which can resist collusion attacks while virtually guaranteeing blockchain nodes' identity privacy. Since edge computing offloads heavily, the proposed scheme has lower computational complexity than the existing techniques.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2022
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Wiley ; 2018
    In:  Concurrency and Computation: Practice and Experience Vol. 30, No. 15 ( 2018-08-10)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 30, No. 15 ( 2018-08-10)
    Abstract: Recently, microblog sites such as Twitter attract a great deal of attention as an information resource for topic detection task. Most of existing feature‐pivot topic detection algorithms in Twitter just take a single feature into account rather than multiple features. Thus, these methods always only detect the topics related to the single feature and miss some important topics, which causes a relatively low performance. In this paper, we build a flexible term representation framework for feature‐pivot topic detection based on four features. A Learning‐based Topic Detection using Multiple Features (LTDMF) method is proposed to improve the performance of topic detection. We define a correlation function based on a specific neural network to integrate various features. A Hierarchical Agglomerative Clustering (HAC) algorithm is applied to cluster terms as topics. Based on multiple features, LTDMF detects all types of topics and improves the accuracy of topic detection to solve the problem of missing topics. Experiments show that LTDMF gets a better performance compared with several baseline methods in terms of precision and recall.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2018
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Wiley ; 2021
    In:  Concurrency and Computation: Practice and Experience Vol. 33, No. 15 ( 2021-08-10)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 33, No. 15 ( 2021-08-10)
    Abstract: This paper proposes a new method for generating 3D objects based on generative adversarial networks (GANs). Recently, GANs have been used in 3D object generation, but it is still very challenging to generate high‐quality 3D objects because of the complex data distribution over 3D objects. In this paper, we propose a system based on GAN that makes the generated objects more realistic. We use multiple generators and discriminators to enhance the ability of the model for learning complex distributions. Such a stacked structure can be considered as a coarse‐to‐fine or low‐to‐high–resolution mechanism. We employ the spectral normalization technology to control the Lipschitz constant of the discriminators by literally constraining the spectral norm of each layer to get a more stable training process. In this way, the proposed model can generate realistic and high‐quality 3D objects. Moreover, our system can also recover incomplete 3D objects into complete 3D objects. Experiments demonstrate that our model performs better in the quality of the generated objects than the baselines.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2021
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Wiley ; 2020
    In:  Concurrency and Computation: Practice and Experience Vol. 32, No. 13 ( 2020-07-10)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 32, No. 13 ( 2020-07-10)
    Abstract: After the rapid development for more than 20 years, Internet has gradually become the main carrier of people's information and behaviors in people's daily life. In addition, the innovation and popularization of smartphone GPS makes user location information much more available and accurate, helping it to create remarkable values by which people are attracted to focus on social media–related data mining and applications. However, because of the sparsity of social media geographical information, direct inferences of locations have plenty of difficulties. Under the background of big data, this research has revised the UGC‐LI model in the preprocess of texts and the creation of the local dictionaries in which we take existed local dictionaries from the Internet into consideration, with the purpose of the inferences for users' and texts' locations. At the time of writing, through the crawler, we acquire users' personal information, the blog content, and customer relationships' (follows, fans) information more than 410 331 pieces from Sina Weibo. The experimental results show that the recall rate of the user location inference is 86.0%, whereas the precise rate is 77.4%, and the accuracy of text posted location inference is 66.8%. Compared with some other related algorithms, this revised model has comparatively better results in location inference for users and text publication.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2020
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Wiley ; 2021
    In:  Concurrency and Computation: Practice and Experience Vol. 33, No. 13 ( 2021-07-10)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 33, No. 13 ( 2021-07-10)
    Abstract: With the development of information technology, the Internet of Things terminals are vulnerable to threats such as eavesdropping, tampering, and counterfeiting. The application of threshold group signature technology can effectively ensure the security of the system in applications such as battlefield intelligent decision‐making, connected vehicles, and intelligent manufacturing. However, the existing threshold group signature schemes lack the two‐way trusted authentication mechanism between group members and group manager, and group manager can easily become a security risk for the entire signature system. To solve this problem, this paper proposes a threshold group signature scheme based on elliptic curve that achieves mutual authentication of group members and group manager. The security analysis proves that the proposed scheme is anonymous, traceable, and can resist collusion attacks and frame attacks. The results of performance analysis and comparison also show that under the same security strength, the scheme proposed has shorter signature length, lower calculation amount for signature generation and signature verification, which can effectively reduce the communication and calculation overhead of the IoT terminal, and can be better applied to the Internet of Things application scenarios.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2021
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...