Complexity

Complexity Problems Handled by Advanced Computer Simulation Technology in Smart Cities 2020


Publishing date
01 Mar 2021
Status
Published
Submission deadline
23 Oct 2020

Lead Editor

1Qingdao University, Qingdao, China

2Muroran Institute of Technology, Muroran, Japan

3Universitat Politecnica de Valencia, Valencia, Spain

4James Cook University, Cairns, Australia

5Università di Bologna, Bologna, Italy


Complexity Problems Handled by Advanced Computer Simulation Technology in Smart Cities 2020

Description

Complexity science technology will bring opportunities for the continuous expansion of new simulation research fields, especially for human simulation, social simulation, and human brain simulation, and provide unprecedented opportunities for simulation for social governance, prediction, and urbanization. The development of complexity science technology provides an important opportunity to use modeling and simulation methods to study new virtual information spaces. As we all know, the advantage of modeling and simulation technology is to provide a bridge from the real world to the virtual space, which provides a substitute for studying the unknown fields of human society and the physical world.

However, virtual information spaces are a completely new virtual space that is completely different from the physical world and human society. This virtual space is not only "human, machine, object”, it is a space where the three are fused, and at the same time it also has the characteristics of multi-layer mesh and cross-domain association. The study of this new virtual space is a hot and difficult point of current scientific research. On the basis of making full use of the results of complexity science research, using parallel systems, embedded simulation, and other methods to build a bridge to this new type of space, and they provide a virtual alternative for the interaction or behavioral characteristics between the research. Using the results of complexity science to constantly modify and test the models built are issues that need to be addressed for the further development of modeling and simulation science.

This Special Issue aims to collate high quality research and review articles with a focus on up-to-date technology related to computer simulation for complexity issues in smart cities and serves as a forum for researchers all over the world to discuss their work and recent advances in this field. In particular, this Special Issue aims to showcase the most recent achievements and developments in complexity problem discovery and exploration. Both theoretical studies and state-of-the-art practical applications are welcome for submission.

Potential topics include but are not limited to the following:

  • Development of the science of complexity in smart cities
  • New generation of information technology and big data technology under innovative 2.0 environment
  • Big data strengthens open data and social involvement in smart cities
  • Open data and privacy protection under big data background
  • Complexity problems handled by numerical simulation in smart cities
  • Complexity problems handled by artificial intelligence in smart cities
  • Complex fluid dynamics handled by computer simulation technology
  • Complex modeling solutions handled by computer situation technology in smart cities
  • Mechanic systems handled by computer simulation technology
  • Control system handled by computer simulation technology
  • Internet of Things handled by computer simulation technology in smart cities

Articles

  • Special Issue
  • - Volume 2024
  • - Article ID 9893437
  • - Retraction

Retracted: Analysis of Feature Extraction and Anti-Interference of Face Image under Deep Reconstruction Network Algorithm

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9857974
  • - Retraction

Retracted: Optimal Pricing Decision of Fashion Apparel considering Experiential Service and Design Enhancement

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9891615
  • - Retraction

Retracted: Improved Newton Iterative Algorithm for Fractal Art Graphic Design

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9852378
  • - Retraction

Retracted: Study on the 2D Optimization Simulation of Complex Five-Hole Cutting Blasting under Different Lateral Pressure Coefficients

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9827214
  • - Retraction

Retracted: Application Research of Intelligent Classification Technology in Enterprise Data Classification and Gradation System

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9840567
  • - Retraction

Retracted: An Anonymous Authentication Scheme in VANETs of Smart City Based on Certificateless Group Signature

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9854101
  • - Retraction

Retracted: A 3D Reconstruction Method Using Multisensor Fusion in Large-Scale Indoor Scenes

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9818413
  • - Retraction

Retracted: A Complexity Analysis of User Interaction with Hotel Robots

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9842574
  • - Retraction

Retracted: Impact of Financial R&D Resource Allocation Efficiency Based on VR Technology and Machine Learning in Complex Systems on Total Factor Productivity

Complexity
  • Special Issue
  • - Volume 2024
  • - Article ID 9849324
  • - Retraction

Retracted: Hemodynamic-Based Evaluation on Thrombosis Risk of Fusiform Coronary Artery Aneurysms Using Computational Fluid Dynamic Simulation Method

Complexity
Complexity
Publishing Collaboration
More info
Wiley Hindawi logo
 Journal metrics
See full report
Acceptance rate11%
Submission to final decision127 days
Acceptance to publication19 days
CiteScore4.400
Journal Citation Indicator0.720
Impact Factor2.3
 Submit Evaluate your manuscript with the free Manuscript Language Checker

We have begun to integrate the 200+ Hindawi journals into Wiley’s journal portfolio. You can find out more about how this benefits our journal communities on our FAQ.