Applications of Cloud Computing, Big Data, and Data Dissemination in Information Engineering

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Engineering Mathematics".

Deadline for manuscript submissions: closed (30 July 2023) | Viewed by 3744

Special Issue Editor


E-Mail Website
Guest Editor
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan
Interests: Information security and network security; artificial intelligence; quantum computer; digital life technology; computer network; machine learning; wireless communication; mobile computing; design and performance analysis of mobile computing; multimedia; real-time systems
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Since 2021, as more and more enterprises begin to adopt the cloud computing model, the transmission of data from the cloud and edge devices will become more and more integrated into our lives. As far as cloud computing is concerned, artificial intelligence plays an important role, enabling anyone who is not familiar with machine learning to enjoy cloud services in a low-cost way, such as image recognition, natural language processing, and recommendation systems. Cloud computing will enable these tools to be more widely deployed by enterprises of all sizes and domains, thereby improving productivity and efficiency.

This periodical publication focuses on applications of cloud computing and data dismission in information engineering. Topics of interest include but are not limited to cloud computing, data distribution, artificial intelligence, information engineering, machine learning, mathematical models, scientific computing, big data, data security and other applications.

Prof. Dr. Sheng-Tzong Cheng
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • cloud computing
  • data dismission
  • artificial intelligence
  • information engineering
  • machine learning
  • mathematical models
  • scientific computing
  • big data

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

27 pages, 485 KiB  
Article
Multi-Keyword Searchable Identity-Based Proxy Re-Encryption from Lattices
by Er-Shuo Zhuang and Chun-I Fan
Mathematics 2023, 11(18), 3830; https://doi.org/10.3390/math11183830 - 6 Sep 2023
Viewed by 849
Abstract
To protect the privacy of cloud data, encryption before uploading provides a solution. However, searching for target data in ciphertext takes effort. Therefore, searchable encryption has become an important research topic. On the other hand, since the advancement of quantum computers will lead [...] Read more.
To protect the privacy of cloud data, encryption before uploading provides a solution. However, searching for target data in ciphertext takes effort. Therefore, searchable encryption has become an important research topic. On the other hand, since the advancement of quantum computers will lead to the crisis of cracking traditional encryption algorithms, it is necessary to design encryption schemes that can resist quantum attacks. Therefore, we propose a multi-keyword searchable identity-based proxy re-encryption scheme from lattices. In addition to resisting quantum attacks, the proposed scheme uses several cryptographic techniques to improve encryption efficiency. First, identity-based encryption is used to reduce the computation and transmission costs caused by certificates. Second, the proposed scheme uses proxy re-encryption to achieve the purpose of outsourced computing, allowing the proxy server to reduce the computation and transmission costs of the users. Third, the proposed multi-keyword searchable encryption can provide AND and OR operators to increase the flexibility of searchability. Moreover, the access structure of the proposed scheme is not based on a linear secret sharing scheme (LSSS), avoiding the errors caused by an LSSS-based structure in decryption or search results. Finally, we also give formal security proof of the proposed scheme under the decisional learning with errors assumption. Full article
Show Figures

Figure 1

22 pages, 17389 KiB  
Article
Automatic Creation of 3D Documentation in CAD/BIM Based on Topology
by Dalibor Bartoněk
Mathematics 2023, 11(17), 3758; https://doi.org/10.3390/math11173758 - 31 Aug 2023
Viewed by 899
Abstract
This paper deals with reverse engineering, namely the as-built documentation of actual construction. The input is data measured in the field using geodetic methods. In addition to modern methods of surveying 3D objects, such as laser scanning, it is still necessary to use [...] Read more.
This paper deals with reverse engineering, namely the as-built documentation of actual construction. The input is data measured in the field using geodetic methods. In addition to modern methods of surveying 3D objects, such as laser scanning, it is still necessary to use classic surveying using a total station. The bottleneck of the process is the creation of documentation of the construction, which is still created manually in the appropriate CAD/BIM software. The goal of this research was to find a method that would reduce the amount of manual work when drawing documentation in CAD/BIM to a minimum. The core of the solution is the use of a topology that interconnects the points measured in-field. The entire procedure has two parts: (1) creating a topological drawing template in a suitable CAD/GIS software (digital sketch) and (2) adding geometry to this sketch and creating a drawing using topological codes. This method was verified in practice by applying it to several specific buildings in the Czech Republic. The practical application of the method demonstrated 30% time savings and a reduction in work and error rate in the entire process. Full article
Show Figures

Figure 1

28 pages, 6507 KiB  
Article
A D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure Paths
by Wei Kuang Lai, Chin-Shiuh Shieh and Chao-Ping Yang
Mathematics 2022, 10(18), 3321; https://doi.org/10.3390/math10183321 - 13 Sep 2022
Cited by 2 | Viewed by 1440
Abstract
The Device-to-Device (D2D) communication introduced in 3GPP’s Release 12 is a promising option for the accommodation of increasing traffic demand and the alleviation of core networks’ loading. The D2D communication mode prevails in scenarios where mobile users in proximity form a communication group [...] Read more.
The Device-to-Device (D2D) communication introduced in 3GPP’s Release 12 is a promising option for the accommodation of increasing traffic demand and the alleviation of core networks’ loading. The D2D communication mode prevails in scenarios where mobile users in proximity form a communication group sharing the same interest in digital content. A user can download intended content from peers in the same communication group rather than from the Internet via the base station. This article addresses the routing issue within D2D communication groups. It is, in effect, a path selection problem. We define a utility function considering both delay and throughput. The path selection problem can be formulated as an NP-hard optimization problem. A Bidirectional and InCremental A-star (BICA*) algorithm incorporating the concept of bidirectional search and lifelong planning is developed to tackle the NP-hard optimization problem. Simulations reveal that the proposed approach outperforms existing ones in terms of less delay, higher throughput, and higher satisfaction ratio. The Greedy approach, Two-Stage Relay Selection (TSRS), and the standard A* algorithm were included in the comparative study. The throughput improvements of the proposed scheme are up to 23% and 46.5% compared to TSRS and Greedy, respectively. The proposed scheme possesses the lowest delay and the highest satisfaction rate, among others. With less computational time, the proposed BICA* is more responsive than the standard A* in dynamic environments. Full article
Show Figures

Figure 1

Back to TopTop