• Title/Summary/Keyword: Four-network model

Search Result 548, Processing Time 0.026 seconds

The development of four efficient optimal neural network methods in forecasting shallow foundation's bearing capacity

  • Hossein Moayedi;Binh Nguyen Le
    • Computers and Concrete
    • /
    • v.34 no.2
    • /
    • pp.151-168
    • /
    • 2024
  • This research aimed to appraise the effectiveness of four optimization approaches - cuckoo optimization algorithm (COA), multi-verse optimization (MVO), particle swarm optimization (PSO), and teaching-learning-based optimization (TLBO) - that were enhanced with an artificial neural network (ANN) in predicting the bearing capacity of shallow foundations located on cohesionless soils. The study utilized a database of 97 laboratory experiments, with 68 experiments for training data sets and 29 for testing data sets. The ANN algorithms were optimized by adjusting various variables, such as population size and number of neurons in each hidden layer, through trial-and-error techniques. Input parameters used for analysis included width, depth, geometry, unit weight, and angle of shearing resistance. After performing sensitivity analysis, it was determined that the optimized architecture for the ANN structure was 5×5×1. The study found that all four models demonstrated exceptional prediction performance: COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP. It is worth noting that the MVO-MLP model exhibited superior accuracy in generating network outputs for predicting measured values compared to the other models. The training data sets showed R2 and RMSE values of (0.07184 and 0.9819), (0.04536 and 0.9928), (0.09194 and 0.9702), and (0.04714 and 0.9923) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively. Similarly, the testing data sets produced R2 and RMSE values of (0.08126 and 0.07218), (0.07218 and 0.9814), (0.10827 and 0.95764), and (0.09886 and 0.96481) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively.

Deep Neural Network-Based Scene Graph Generation for 3D Simulated Indoor Environments (3차원 가상 실내 환경을 위한 심층 신경망 기반의 장면 그래프 생성)

  • Shin, Donghyeop;Kim, Incheol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.5
    • /
    • pp.205-212
    • /
    • 2019
  • Scene graph is a kind of knowledge graph that represents both objects and their relationships found in a image. This paper proposes a 3D scene graph generation model for three-dimensional indoor environments. An 3D scene graph includes not only object types, their positions and attributes, but also three-dimensional spatial relationships between them, An 3D scene graph can be viewed as a prior knowledge base describing the given environment within that the agent will be deployed later. Therefore, 3D scene graphs can be used in many useful applications, such as visual question answering (VQA) and service robots. This proposed 3D scene graph generation model consists of four sub-networks: object detection network (ObjNet), attribute prediction network (AttNet), transfer network (TransNet), relationship prediction network (RelNet). Conducting several experiments with 3D simulated indoor environments provided by AI2-THOR, we confirmed that the proposed model shows high performance.

Use of an Artificial Neural Network to Predict Risk Factors of Nosocomial Infection in Lung Cancer Patients

  • Chen, Jie;Pan, Qin-Shi;Hong, Wan-Dong;Pan, Jingye;Zhang, Wen-Hui;Xu, Gang;Wang, Yu-Min
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.13
    • /
    • pp.5349-5353
    • /
    • 2014
  • Statistical methods to analyze and predict the related risk factors of nosocomial infection in lung cancer patients are various, but the results are inconsistent. A total of 609 patients with lung cancer were enrolled to allow factor comparison using Student's t-test or the Mann-Whitney test or the Chi-square test. Variables that were significantly related to the presence of nosocomial infection were selected as candidates for input into the final ANN model. The area under the receiver operating characteristic (ROC) curve (AUC) was used to evaluate the performance of the artificial neural network (ANN) model and logistic regression (LR) model. The prevalence of nosocomial infection from lung cancer in this entire study population was 20.1% (165/609), nosocomial infections occurring in sputum specimens (85.5%), followed by blood (6.73%), urine (6.0%) and pleural effusions (1.82%). It was shown that long term hospitalization (${\geq}22days$, P= 0.000), poor clinical stage (IIIb and IV stage, P=0.002), older age (${\geq}61days$ old, P=0.023), and use the hormones were linked to nosocomial infection and the ANN model consisted of these four factors. The artificial neural network model with variables consisting of age, clinical stage, time of hospitalization, and use of hormones should be useful for predicting nosocomial infection in lung cancer cases.

An Evolution Model of Rumor Spreading Based on WeChat Social Circle

  • Wang, Lubang;Guo, Yue
    • Journal of Information Processing Systems
    • /
    • v.15 no.6
    • /
    • pp.1422-1437
    • /
    • 2019
  • With the rapid development of the Internet and the Mobile Internet, social communication based on the network has become a life style for many people. WeChat is an online social platform, for about one billion users, therefore, it is meaningful to study the spreading and evolution mechanism of the rumor on the WeChat social circle. The Rumor was injected into the WeChat social circle by certain individuals, and the communication and the evolution occur among the nodes within the circle; after the refuting-rumor-information injected into the circle, subsequently,the density of four types of nodes, including the Susceptible, the Latent, the Infective, and the Recovery changes, which results in evolving the WeChat social circle system. In the study, the evolution characteristics of the four node types are analyzed, through construction of the evolution equation. The evolution process of the rumor injection and the refuting-rumor-information injection is simulated through the structure of the virtual social network, and the evolution laws of the four states are depicted by figures. The significant results from this study suggest that the spreading and evolving of the rumors are closely related to the nodes degree on the WeChat social circle.

An Implementation of the Position Controller for Multiple Motors Using CAN (CAN 통신을 이용한 다중모터 위치제어기 구현)

  • Yi, Keon-Young
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.2
    • /
    • pp.55-60
    • /
    • 2002
  • This paper presents a controller for the multiple DC motors using the CAN(Controller Area Network). The controller has a benefit of reducing the cable connections and making the controller boards compact through the network including expansibility. CAN, among the field buses, is a serial communication methodology which has the physical layer and the data link layer in the ISO's OSI (Open System Interconnect) 7 layered reference model. It provides the user with many powerful features including multi-master functionality and the ability to broadcast / multicast telegrams. When we use a microprocessor chip embedding the CAN function, the system becomes more economical and reliable to react shortly in the data transmission. The controller, we proposed, is composed of two main controllers and a sub controller, which have built with a one-chip microprocessor having CAN function. The sub controller is plugged into the Pentium PC to perform a CAN communication, and connected to the main controllers via the CAN. Main controllers are responsible for controlling two motors respectively. Totally four motors, actuators for the biped robot in our laboratory, are controlled in the experiment. We show that the four motors are controlled properly to actuate the biped robot through the network in real time.

Shield TBM disc cutter replacement and wear rate prediction using machine learning techniques

  • Kim, Yunhee;Hong, Jiyeon;Shin, Jaewoo;Kim, Bumjoo
    • Geomechanics and Engineering
    • /
    • v.29 no.3
    • /
    • pp.249-258
    • /
    • 2022
  • A disc cutter is an excavation tool on a tunnel boring machine (TBM) cutterhead; it crushes and cuts rock mass while the machine excavates using the cutterhead's rotational movement. Disc cutter wear occurs naturally. Thus, along with the management of downtime and excavation efficiency, abrasioned disc cutters need to be replaced at the proper time; otherwise, the construction period could be delayed and the cost could increase. The most common prediction models for TBM performance and for the disc cutter lifetime have been proposed by the Colorado School of Mines and Norwegian University of Science and Technology. However, design parameters of existing models do not well correspond to the field values when a TBM encounters complex and difficult ground conditions in the field. Thus, this study proposes a series of machine learning models to predict the disc cutter lifetime of a shield TBM using the excavation (machine) data during operation which is response to the rock mass. This study utilizes five different machine learning techniques: four types of classification models (i.e., K-Nearest Neighbors (KNN), Support Vector Machine, Decision Tree, and Staking Ensemble Model) and one artificial neural network (ANN) model. The KNN model was found to be the best model among the four classification models, affording the highest recall of 81%. The ANN model also predicted the wear rate of disc cutters reasonably well.

An Integration of Searching Area Extraction Scheme and Bi-directional Link Searching Algorithm for the Urban ATIS Application (도시부 ATIS 효율적 적용을 위한 탐색영역기법 및 양방향 링크탐색 알고리즘의 구현)

  • 이승환;최기주;김원길
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.45-59
    • /
    • 1996
  • The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

  • PDF

The Sharing Economy Business Model per the Analysis of Value Attributes (공유경제 비즈니스 모델의 가치 요인 분석)

  • Lee, Junmin;Hwang, Junseok;Kim, Jonglip
    • Journal of Information Technology Services
    • /
    • v.15 no.4
    • /
    • pp.153-174
    • /
    • 2016
  • On account of multiple causes, including prolonged global economic crisis, addressing environmental pollution and the advent of hyper-connected society, a new paradigm called 'sharing economy' has rapidly emerged. Many startups have attempted to build promising business model based on the sharing economy concept. Nevertheless, successful cases are still very rare in the global level, except for Uber and Airbnb cases. Therefore, this study analyzes necessary causes and sufficient causes for successful settlements in the market through a comparative case analysis on digital matching firms in the sharing economy businesses. For the case study, we compare five successful cases (Uber, Airbnb, Kickstarter, TaskRabbit and DogVacay), three failure cases (Homejoy, Ridejoy and Tuterspree) and a platform cooperativism case (Juno) in accordance with six value attributes of business model including value proposition, market segment, value chain, cost structure and profit potential, value network and competitive strategy. We apply Boolean method to support controlled comparison and eliminate unnecessary attributes. The Boolean analysis result shows that value proposition, cost structure and profit potential, value network and competitive strategy are the essential attributes. Furthermore, the result indicates that each attribute is a necessary condition, where all four conditions should be met simultaneously in order to be successful. With this result, we discuss essential consideration for those who are planning startup based on the sharing economy business model.

Machine learning-based analysis and prediction model on the strengthening mechanism of biopolymer-based soil treatment

  • Haejin Lee;Jaemin Lee;Seunghwa Ryu;Ilhan Chang
    • Geomechanics and Engineering
    • /
    • v.36 no.4
    • /
    • pp.381-390
    • /
    • 2024
  • The introduction of bio-based materials has been recommended in the geotechnical engineering field to reduce environmental pollutants such as heavy metals and greenhouse gases. However, bio-treated soil methods face limitations in field application due to short research periods and insufficient verification of engineering performance, especially when compared to conventional materials like cement. Therefore, this study aimed to develop a machine learning model for predicting the unconfined compressive strength, a representative soil property, of biopolymer-based soil treatment (BPST). Four machine learning algorithms were compared to determine a suitable model, including linear regression (LR), support vector regression (SVR), random forest (RF), and neural network (NN). Except for LR, the SVR, RF, and NN algorithms exhibited high predictive performance with an R2 value of 0.98 or higher. The permutation feature importance technique was used to identify the main factors affecting the strength enhancement of BPST. The results indicated that the unconfined compressive strength of BPST is affected by mean particle size, followed by biopolymer content and water content. With a reliable prediction model, the proposed model can present guidelines prior to laboratory testing and field application, thereby saving a significant amount of time and money.

An Analysis of Location Management Cost by Predictive Location Update Policy in Mobile Cellular Networks (이동통신망에서 예측 위치 등록 정책을 통한 위치관리 비용 감소 효과 분석)

  • Go, Han-Seong;Jang, In-Gap;Hong, Jeong-Sik;Lee, Chang-Hun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • pp.388-394
    • /
    • 2007
  • In wireless network, we propose a predictive location update scheme which considers mobile user's(MU's) mobility patterns. MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

  • PDF