• Title/Summary/Keyword: sorting problem

Search Result 123, Processing Time 0.024 seconds

Optimization of Data Placement using Principal Component Analysis based Pareto-optimal method for Multi-Cloud Storage Environment

  • Latha, V.L. Padma;Reddy, N. Sudhakar;Babu, A. Suresh
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.248-256
    • /
    • 2021
  • Now that we're in the big data era, data has taken on a new significance as the storage capacity has exploded from trillion bytes to petabytes at breakneck pace. As the use of cloud computing expands and becomes more commonly accepted, several businesses and institutions are opting to store their requests and data there. Cloud storage's concept of a nearly infinite storage resource pool makes data storage and access scalable and readily available. The majority of them, on the other hand, favour a single cloud because of the simplicity and inexpensive storage costs it offers in the near run. Cloud-based data storage, on the other hand, has concerns such as vendor lock-in, privacy leakage and unavailability. With geographically dispersed cloud storage providers, multicloud storage can alleviate these dangers. One of the key challenges in this storage system is to arrange user data in a cost-effective and high-availability manner. A multicloud storage architecture is given in this study. Next, a multi-objective optimization problem is defined to minimise total costs and maximise data availability at the same time, which can be solved using a technique based on the non-dominated sorting genetic algorithm II (NSGA-II) and obtain a set of non-dominated solutions known as the Pareto-optimal set.. When consumers can't pick from the Pareto-optimal set directly, a method based on Principal Component Analysis (PCA) is presented to find the best answer. To sum it all up, thorough tests based on a variety of real-world cloud storage scenarios have proven that the proposed method performs as expected.

Approximate Multi-Objective Optimization of Robot Casting Considering Deflection and Weight (처짐과 무게를 고려한 주물 프레임의 다중목적 근사최적설계)

  • Choi, Ha-Young;Lee, Jongsoo;Park, Juno
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.21 no.6
    • /
    • pp.954-960
    • /
    • 2012
  • Nowadays, rapidly changing and unstable global economic environments request a lot of roles to engineers. In this situation, product should be designed to make more profit by cost down and to satisfy distinguished performance comparing to other competitive ones. In this research, the optimization design of the industrial robot casting will be done. The weight and deflection have to be reduced as objective functions and stress has to be constrained under some constant value. To reduce time cost, CCD (Central Composite Design) will be used to make experimental design. And RSM (Response Surface Methodology) will be taken to make regression model for objective functions and constraint function. Finally, optimization will be done with Genetic Algorithm. In this problem, the objective functions are multiple, so NSGA-II which is brilliant and efficient for such a problem will be used. For the solution quality check, the diversity between Pareto solutions will be also checked.

Deep CNN based Pilot Allocation Scheme in Massive MIMO systems

  • Kim, Kwihoon;Lee, Joohyung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4214-4230
    • /
    • 2020
  • This paper introduces a pilot allocation scheme for massive MIMO systems based on deep convolutional neural network (CNN) learning. This work is an extension of a prior work on the basic deep learning framework of the pilot assignment problem, the application of which to a high-user density nature is difficult owing to the factorial increase in both input features and output layers. To solve this problem, by adopting the advantages of CNN in learning image data, we design input features that represent users' locations in all the cells as image data with a two-dimensional fixed-size matrix. Furthermore, using a sorting mechanism for applying proper rule, we construct output layers with a linear space complexity according to the number of users. We also develop a theoretical framework for the network capacity model of the massive MIMO systems and apply it to the training process. Finally, we implement the proposed deep CNN-based pilot assignment scheme using a commercial vanilla CNN, which takes into account shift invariant characteristics. Through extensive simulation, we demonstrate that the proposed work realizes about a 98% theoretical upper-bound performance and an elapsed time of 0.842 ms with low complexity in the case of a high-user-density condition.

Design Optimization of Single-Stage Launch Vehicle Using Hybrid Rocket Engine

  • Kanazaki, Masahiro;Ariyairt, Atthaphon;Yoda, Hideyuki;Ito, Kazuma;Chiba, Kazuhisa;Kitagawa, Koki;Shimada, Toru
    • International Journal of Aerospace System Engineering
    • /
    • v.2 no.2
    • /
    • pp.29-33
    • /
    • 2015
  • The multidisciplinary design optimization (MDO) of a launch vehicle (LV) with a hybrid rocket engine (HRE) was carried out to investigate the ability of an HRE for a single-stage LV. The non-dominated sorting genetic algorithm-II (NSGA-II) was employed to solve two design problems. The design problems were formulated as two-objective cases involving maximization of the downrange distance over the target flight altitude and minimization of the gross weight, for two target altitudes: 50.0 km and 100.0 km. Each objective function was empirically estimated. Several non-dominated solutions were obtained using the NSGA-II for each design problem, and in each case, a trade-off was observed between the two objective functions. The results for the two design problem indicate that economical performance of the LV is limited with the HRE in terms of the maximum downrange distances achievable. The LV geometries determined from the non-dominated solutions were examined.

Insertion/Deletion algorithms on M-heap with an array representation (배열 표현을 이용한 M-힙에서 삽입/삭제 알고리즘)

  • Jung Hae-Jae
    • The KIPS Transactions:PartA
    • /
    • v.13A no.3 s.100
    • /
    • pp.261-266
    • /
    • 2006
  • Priority queues can be used in applications such as scheduling, sorting, and shortest path network problem. Fibonacci heap, pairing heap, and M-heap are priority queues based on pointers. This paper proposes a modified M-heap with an way representation, called MA-heap, that resolves the problem mentioned in [1]. The MA-heap takes O(1) amortized time and O(logn) time to insert an element and delete the max/min element, respectively. These time complexities are the same as those of the M-heap. In addition, it is much easier to implement an MA-heap than a heap proposed in [5] since it is based on the simple traditional heap.

Fast Channel Allocation for Ultra-dense D2D-enabled Cellular Network with Interference Constraint in Underlaying Mode

  • Dun, Hui;Ye, Fang;Jiao, Shuhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2240-2254
    • /
    • 2021
  • We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

Quarantine Pest Occurrence in Exporting Pear Fruits (Pyrus pyrifolia Nakai cv. Whangkeumbae) during Cold Storag (수출용 황금배의 저온저장 중 검역병해충 발생조사)

  • Lee, Ho-Ki;Woo, Chang-Nam;Namkoong, Seung-Bak;Seo, Yong-Sun;La, Jin-Ho;Kim, Young-Il;Kim, Ki-Gyung;Kim, Byung-Kee
    • Horticultural Science & Technology
    • /
    • v.18 no.1
    • /
    • pp.22-27
    • /
    • 2000
  • National plant quarantine inspector of exporting country should inspect agricultural products according to the quarantine requisites of counterpart country when the commodities are shipped. Export of pear fruits was held because quarantine pests including Conogethes punctiferalis were found at the point of entry in Canada. In order to examine the problems in detail, the inspected pear fruits were stored at a low temperature for 43 days, almost the same period necessary for fruit sorting, quarantine procedures, and transportation by ship. Dead larvae of fruit moths, C. punctiferalis and Grapholita molesta were found during cold storage. Quarantine pathogens were not found, but non-quarantine ones such as Penicillium sp. was infected through wounds by bruises and stabs resulted from sorting procedures. Because of the wounding problem during export procedures, pear fruits with thin exocarp, such as fruits of P. pyrifolia Nakai cv. Whangkeumbae, are required more careful handling during fruit sorting and conveyance.

  • PDF

Cost Analysis Model according to Mortality in Land-based Aquaculture (육상수조 어류양식 생존율에 따른 비용분석모형)

  • Eh, Youn-Yang
    • The Journal of Fisheries Business Administration
    • /
    • v.47 no.4
    • /
    • pp.1-13
    • /
    • 2016
  • Fish mortality is the most important success factor in aquaculture management. To analyze the effect of mortality considering biological and economic condition is a important problem in land-based aquaculture. This study is aimed to analyze the effect of mortality for duration of cultivation in land-based aquaculture. This study builds the mathematical model that finds the value of decision variable to minimize cost that sums up the water pool usage cost, sorting cost, fingerling cost and feeding cost under critical standing corp constraint. The proposed mathematical model involves many aspects, both biological and economical: (1) number of fingerlings (2) timing and number of batch splitting event, based on (3) fish growth rate, (4) mortality, and (5) several farming expense. Numerical simulation model presented here in. The objective of numerical simulation is to provide for decision makers to analyse and comprehend the proposed model. When extensive biological and cost data become available, the proposed model can be widely applied to yield more accurate results.

Multiobjective size and topolgy optimization of dome structures

  • Tugrul, Talaslioglu
    • Structural Engineering and Mechanics
    • /
    • v.43 no.6
    • /
    • pp.795-821
    • /
    • 2012
  • The size and topology of geometrically nonlinear dome structures are optimized thereby minimizing both its entire weight & joint (node) displacements and maximizing load-carrying capacity. Design constraints are implemented from provisions of American Petroleum Institute specification (API RP2A-LRFD). In accordance with the proposed design constraints, the member responses computed by use of arc-length technique as a nonlinear structural analysis method are checked at each load increment. Thus, a penalization process utilized for inclusion of unfeasible designations to genetic search is correspondingly neglected. In order to solve this complex design optimization problem with multiple objective functions, Non-dominated Sorting Genetic Algorithm II (NSGA II) approach is employed as a multi-objective optimization tool. Furthermore, the flexibility of proposed optimization is enhanced thereby integrating an automatic dome generating tool. Thus, it is possible to generate three distinct sphere-shaped dome configurations with varying topologies. It is demonstrated that the inclusion of brace (diagonal) members into the geometrical configuration of dome structure provides a weight-saving dome designation with higher load-carrying capacity. The proposed optimization approach is recommended for the design optimization of geometrically nonlinear dome structures.

The Relationship between Inductive-Deductive Reasoning Ability and Mental Capacity and Perseveration Error of Elementary School Students (초등학교 학생들의 귀납-연역적 추론 능력과 정신 용량 및 보속 오류와의 관계)

  • 김설한;정진우;김효남
    • Journal of Korean Elementary Science Education
    • /
    • v.17 no.1
    • /
    • pp.47-60
    • /
    • 1998
  • The purpose of this study was to analyze the problem solving strategies of elementary school students and to find out correlations between the functional mental capacity, the perseveration error and the Creature Card Task solving ability. To study this purpose, four categories were selected through pilot test. The sample consisted of 231, the 4th grade students and the 5th grade students in Inchon, Korea and selected 32 students among them. Three instruments were used in this study, Creature Card Task, FIT(Figural Intersection Test) and WCST(Wisconsin Card Sorting Test). Researcher interviewed 32 students about Creature Card Task solving strategies and tests with FIT, WCST. Major findings of the study are as follows: 1. Creature Card Task solving strategies of the selected 4th & 5th grade students were different. Some students solved problems during individual interviews. 2. Creature Card Task solving abilities were significantly correlated with the functional mental capacity and the perseveration error.

  • PDF