• Title/Summary/Keyword: performance-based optimization

Search Result 2,575, Processing Time 0.031 seconds

Robust Rear Center-Hinge Bracket Optimization Based on Taguchi Method (다구찌 방법을 활용한 Rear Center-Hinge Bracket 강건 설계)

  • Jung, Sebin;Kim, Minho
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.22 no.3
    • /
    • pp.203-209
    • /
    • 2014
  • The rear center-hinge bracket is designed for supporting and folding the rear-seat backrest. This bracket needs to be strong enough to be able to rigidly hold the rear-seat backrest and to withstand luggage loads from the car trunk that are generated when a vehicle is driving on the roads. Particularly, current accident studies report that many serious occupant injuries occurred when the rear-seat back easily folded inward toward the car interior, driven by the luggage loads in the trunk. Given this fact, the robust design of the rear center-hinge bracket that mainly supports the rear backrest has become more important for providing customer safety and preventing high warranty and durability problems. However, none of the studies have emphasized its significant role and considered its robust optimization. Therefore, this paper presents how the hinge-bracket design is optimized based on an application of the finite-element method coupled with the parameter design using Taguchi's design experiment. Finally, Taguchi method's application optimizes a robust center-hinge bracket that shows more rigid performance although it has lighter weight and thinner thickness.

Optimization of 3D Triangular Mesh Watermarking Using ACO-Weber's Law

  • Narendra, Modigari;Valarmathi, M.L.;Anbarasi, L.Jani
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4042-4059
    • /
    • 2020
  • The development of new multimedia techniques such as 3D printing is increasingly attracting the public's attention towards 3D objects. An optimized robust and imperceptible watermarking method based on Ant Colony Optimization (ACO) and Weber Law is proposed for 3D polygonal models. The proposed approach partitions the host model into smaller sub meshes and generates a secret watermark from the sub meshes using Weber Law. ACO based optimized strength factor is identified for embedding the watermark. The secret watermark is embedded and extracted on the wavelet domain. The proposed scheme is robust against geometric and photometric attacks that overcomes the synchronization problem and authenticates the secret watermark from the distorted models. The primary characteristic of the proposed system is the flexibility achieved in data embedding capacity due to the optimized strength factor. Extensive simulation results shows enhanced performance of the recommended framework and robustness towards the most common attacks like geometric transformations, noise, cropping, mesh smoothening, and the combination of such attacks.

Optimization of Manufacturing Conditions of Pressure-Sensitive Ink Based on MWCNTs (MWCNTs 기반 인쇄형 압력감응잉크의 제조 조건 최적화)

  • Park, Sung-Chul;Lee, In-Hwan;Bae, Yong-Hwan;Kim, Ho-chan
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.18 no.8
    • /
    • pp.1-7
    • /
    • 2019
  • Materials that can be used for 3D printing have been developed in terms of phase and functionality. Materials should also be easily printed with high accuracy. In recent years, the concept of 4D printing has been extended to materials whose physical properties such as shape or volume can change depending on the environment. Typically, such high-performance 3D printing materials include bio-inks and inks for sensors. This study deals with the optimization of the manufacturing method to improve the functional properties of the pressure sensitive material, which can be used as a sensor based on change of the resistance according to the pressure. Specifically, the number of milling for dispersion, the ratio of hardener for controlling elasticity, and the content of MWCNTs were optimized. As a result, a method of manufacturing a highly sensitive pressure-sensitive ink capable of use in 3D printing was introduced.

PSO-based Resource Allocation in Software-Defined Heterogeneous Cellular Networks

  • Gong, Wenrong;Pang, Lihua;Wang, Jing;Xia, Meng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2243-2257
    • /
    • 2019
  • A heterogeneous cellular network (HCN) is useful to increase the spectral and energy efficiency of wireless networks and to reduce the traffic load from the macro cell. The performance of the secondary user equipment (SUE) is affected by interference from the eNodeB (eNB) in a macro cell. To decrease the interference between the macro cell and the small cell, allocating resources properly is essential to an HCN. This study considers the scenario of a software-defined heterogeneous cellular network and performs the resource allocation process. First, we show the system model of HCN and formulate the optimization problem. The optimization problem is a complex process including power and frequency resource allocation, which imposes an extremely high complexity to the HCN. Therefore, a hierarchical resource allocation scheme is proposed, which including subchannel selection and a particle swarm optimization (PSO)-based power allocation algorithm. Simulation results show that the proposed hierarchical scheme is effective in improving the system capacity and energy efficiency.

Shape Optimization for Lightweight of the Line Center for Processing Complex Shape Parts (복합형상 부품 가공용 라인센터의 경량화를 위한 형상 최적화에 관한 연구)

  • Park, Do-Hyun;Jeong, Ho-In;Kim, Sang-Won;Lee, Choon-Man
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.20 no.8
    • /
    • pp.86-92
    • /
    • 2021
  • As interest and demand for high value-added industries, including the global automobile and aerospace industries, have increased recently, demand for line centers with excellent performance that can respond to the production system for producing high value-added products is also rapidly increasing. A line center improves productivity based on the installed area using a multi-spindle compared to a conventional machining center. However, as the number of spindles increases, the weight increases and results in structural problems owing to the heat and vibration generated by each spindle. Therefore, it is necessary to improve machining precision through the structural improvement of the line center. This study presents research on the stabilization design of the line center through structural stability analysis through structural analysis to develop a compact multi-axis line center. An optimization model of the line center has been proposed to improve the processing precision and increase the rigidity by performing weight reduction based on the structural analysis results.

Joint Optimization Algorithm Based on DCA for Three-tier Caching in Heterogeneous Cellular Networks

  • Zhang, Jun;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2650-2667
    • /
    • 2021
  • In this paper, we derive the expression of the cache hitting probability with random caching policy and propose the joint optimization algorithm based on difference of convex algorithm (DCA) in the three-tier caching heterogeneous cellular network assisted by macro base stations, helpers and users. Under the constraint of the caching capacity of caching devices, we establish the optimization problem to maximize the cache hitting probability of the network. In order to solve this problem, a convex function is introduced to convert the nonconvex problem to a difference of convex (DC) problem and then we utilize DCA to obtain the optimal caching probability of macro base stations, helpers and users for each content respectively. Simulation results show that when the density of caching devices is relatively low, popular contents should be cached to achieve a good performance. However, when the density of caching devices is relatively high, each content ought to be cached evenly. The algorithm proposed in this paper can achieve the higher cache hitting probability with the same density.

An Optimized Deep Learning Techniques for Analyzing Mammograms

  • Satish Babu Bandaru;Natarajasivan. D;Rama Mohan Babu. G
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.39-48
    • /
    • 2023
  • Breast cancer screening makes extensive utilization of mammography. Even so, there has been a lot of debate with regards to this application's starting age as well as screening interval. The deep learning technique of transfer learning is employed for transferring the knowledge learnt from the source tasks to the target tasks. For the resolution of real-world problems, deep neural networks have demonstrated superior performance in comparison with the standard machine learning algorithms. The architecture of the deep neural networks has to be defined by taking into account the problem domain knowledge. Normally, this technique will consume a lot of time as well as computational resources. This work evaluated the efficacy of the deep learning neural network like Visual Geometry Group Network (VGG Net) Residual Network (Res Net), as well as inception network for classifying the mammograms. This work proposed optimization of ResNet with Teaching Learning Based Optimization (TLBO) algorithm's in order to predict breast cancers by means of mammogram images. The proposed TLBO-ResNet, an optimized ResNet with faster convergence ability when compared with other evolutionary methods for mammogram classification.

Multi-Parameter Based Scheduling for Multi-user MIMO Systems

  • Chanthirasekaran, K.;Bhagyaveni, M.A.;Parvathy, L. Rama
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.6
    • /
    • pp.2406-2412
    • /
    • 2015
  • Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4th generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-parameter based scheduling (MPS) for downlink multi-user multiple-input multiple-output (MU-MIMO) system under space-time block coding (STBC) transmissions. Goal of this MPS scheme is to offer improved link level performance in terms of a low average bit error rate (BER), high packet delivery ratio (PDR) with improved resource utilization and service fairness among the user. This scheme allows the set of users to send data based on their channel quality and their demand rates. Simulation compares the MPS performance with other scheduling scheme such as fair scheduling (FS), normalized priority scheduling (NPS) and threshold based fair scheduling (TFS). The results obtained prove that MPS has significant improvement in average BER performance with improved resource utilization and fairness as compared to the other scheduling scheme.

Quality of Service Assurance Model for AMR Voice Traffic in Downlink WCDMA System (순방향 WCDMA 채널에서 AMR 음성 트래픽의 품질 보증 모델)

  • Jung, Sung Hwan;Hong, Jung Wan;Lie, Chang Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.2
    • /
    • pp.191-200
    • /
    • 2007
  • We propose the QoS (Quality of Service) assurance model for AMR (Adaptive MultiRate) voice users considering the capacity and service quality jointly in downlink WCDMA system. For this purpose, we introduce a new system performance measure and the number-based AMR mode allocation scheme. The proposed number-based AMR mode allocation can be operated only with the information of total number of ongoing users. Therefore, it can be more simply implemented than the existing power-based allocation. The proposed system performance measure considers the stochastic variations of AMR modes of ongoing users and can be analytically obtained using CTMC (Continuous Time Markov Chain) modeling. In order to validate the proposed analytical model, a discrete event-based simulation model is also developed. The performance measure obtained from the analytical model is in agreement with the simulation results and is expected to be useful for parameter optimization.

Utility Bounds of Joint Congestion and Medium Access Control for CSMA based Wireless Networks

  • Wang, Tao;Yao, Zheng;Zhang, Baoxian;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.193-214
    • /
    • 2017
  • In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.