• Title/Summary/Keyword: random programming

Search Result 91, Processing Time 0.027 seconds

Optimum design of lead-rubber bearing system with uncertainty parameters

  • Fan, Jian;Long, Xiaohong;Zhang, Yanping
    • Structural Engineering and Mechanics
    • /
    • v.56 no.6
    • /
    • pp.959-982
    • /
    • 2015
  • In this study, a non-stationary random earthquake Clough-Penzien model is used to describe earthquake ground motion. Using stochastic direct integration in combination with an equivalent linear method, a solution is established to describe the non-stationary response of lead-rubber bearing (LRB) system to a stochastic earthquake. Two parameters are used to develop an optimization method for bearing design: the post-yielding stiffness and the normalized yield strength of the isolation bearing. Using the minimization of the maximum energy response level of the upper structure subjected to an earthquake as an objective function, and with the constraints that the bearing failure probability is no more than 5% and the second shape factor of the bearing is less than 5, a calculation method for the two optimal design parameters is presented. In this optimization process, the radial basis function (RBF) response surface was applied, instead of the implicit objective function and constraints, and a sequential quadratic programming (SQP) algorithm was used to solve the optimization problems. By considering the uncertainties of the structural parameters and seismic ground motion input parameters for the optimization of the bearing design, convex set models (such as the interval model and ellipsoidal model) are used to describe the uncertainty parameters. Subsequently, the optimal bearing design parameters were expanded at their median values into first-order Taylor series expansions, and then, the Lagrange multipliers method was used to determine the upper and lower boundaries of the parameters. Moreover, using a calculation example, the impacts of site soil parameters, such as input peak ground acceleration, bearing diameter and rubber shore hardness on the optimization parameters, are investigated.

Expansion of Sensitivity Analysis for Statistical Moments and Probability Constraints to Non-Normal Variables (비정규 분포에 대한 통계적 모멘트와 확률 제한조건의 민감도 해석)

  • Huh, Jae-Sung;Kwak, Byung-Man
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.11
    • /
    • pp.1691-1696
    • /
    • 2010
  • The efforts of reflecting the system's uncertainties in design step have been made and robust optimization or reliabilitybased design optimization are examples of the most famous methodologies. The statistical moments of a performance function and the constraints corresponding to probability conditions are involved in the formulation of these methodologies. Therefore, it is essential to effectively and accurately calculate them. The sensitivities of these methodologies have to be determined when nonlinear programming is utilized during the optimization process. The sensitivity of statistical moments and probability constraints is expressed in the integral form and limited to the normal random variable; we aim to expand the sensitivity formulation to nonnormal variables. Additional functional calculation will not be required when statistical moments and failure or satisfaction probabilities are already obtained at a design point. On the other hand, the accuracy of the sensitivity results could be worse than that of the moments because the target function is expressed as a product of the performance function and the explicit functions derived from probability density functions.

The Performance Evaluation for PHY-LINK Data Transfer using SPI-4.2 (SPI-4.2 프로토콜을 사용한 PHY-LINK 계층간의 데이터 전송 성능평가)

  • 박노식;손승일;최익성;이범철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.3
    • /
    • pp.577-585
    • /
    • 2004
  • System Packet Interface Level 4 Phase(SPI-4.2) is an interface for packet and cell transfer between a physical layer(PHY) device and a link layer device, for aggregate bandwidths of OC-192 ATM and Packet Over Sonet/SDH(POS), as well as 10Gbps Ethernet applications. In this paper, we performs the research for SPI-4.2. Also we analyze the performance of SPI-4.2 interface module after modeling using C programming language. This paper shows that SPI-4.2 interface module with 512-word FIFO depth is able to be adapted for the offered loads to 97% in random uniform traffic and 94% in bursty traffic with bursty length 32. SPI-4.2 interface module can experience an performance degradation due to heavy overhead when it massively receives small size packets less than 14-byte. SPI-4.2 interface module is suited for line cards in gigabit/terabit routers, and optical cross-connect switches, and SONET/SDH-based transmission systems.

The Effects of Coding Education Using the Unplugged Robot Education System on the Perceived Useful and Easy

  • Song, JeongBeom
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.8
    • /
    • pp.121-128
    • /
    • 2015
  • This study aimed to investigate the effects of an unplugged robot education system capable of computerless coding education. Specifically, this study compared this education system with PicoCricket, an educational robot that can also be used with elementary students in lower grades, using assessment tools on perceived usefulness and ease. Using random sampling and randomized assignment for more objective validation, 30 participants were assigned to the unplugged robot education system group (experimental group) and 30 participants were assigned to the PicoCricket group (control group), for a total of 60 study participants. The research procedure included verification of the equivalence of the two groups by conducting a pretest after a 2-hour basic training session on algorithms and programming. The experimental and control groups learned the same content using different educational tools in accordance with software training guidelines for a total of 12 hours. Then, the difference in perceived usefulness and ease between the two groups was examined using a post-treatment test. The study results showed that scores on both dependent variables, perceived usefulness and perceived ease, were significantly higher in the experimental group than the control group. Moreover, scores on all sub-variables of the dependent variables were significantly higher in the experimental group than the control group. These results suggest that learners using the unplugged robot education system found it more useful and easier to use than learners using the existing educational robot, PicoCricket. This study's findings are significant, as according to the technology acceptance model, the perceived usefulness and ease of an educational tool are important variables that determine the acceptance of the tool (i.e., persistence of learning).

Mathematical Programming and Optimization of the Resource Allocation and Deployment for Disaster Response : AED case study (수리계획법을 활용한 방재자원 배치 최적화: AED 배치 사례)

  • Hwang, Seongeun;Lee, Nagyeong;Jang, Dongkuk;Shin, Dongil
    • Journal of the Korean Institute of Gas
    • /
    • v.25 no.3
    • /
    • pp.53-58
    • /
    • 2021
  • The number of patients with cardiovascular diseases who experience an out-of-hospital cardiac arrest (OHCA) are increasing among young adults as well as the aged population. An automated external defibrillator (AED) is vital in improving survival rates of OHCA victims. Survival rates of OHCA were shown to decline exponentially in time to defibrillation, yet studies in Korea are uncommon that captures the properties of their survival rates in examining optimal locations of AEDs. In this study, we worked on the maximal gradual coverage location problem (MGCLP) with exponential decay coverage function to decide on their optimal locations. The exponential decay coverage function mitigates the drawback of over-estimating survival rates of OHCA patients. It is expected that a more sophisticated facility location problem will be developed to identify the "emergent" characteristics of pedestrians who responds to the OHCA occurrence by incorporating random pedestrian locations and movement through simulation.

Optimization Algorithm of Gantry Route Problem for Odd-type Surface Mount Device (이형 부품 표면실장기에 대한 겐트리 경로 문제의 최적 알고리즘)

  • Jeong, Jaewook;Tae, Hyunchul
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.4
    • /
    • pp.67-75
    • /
    • 2020
  • This paper proposes a methodology for gantry route optimization in order to maximize the productivity of a odd-type surface mount device (SMD). A odd-type SMD is a machine that uses a gantry to mount electronic components on the placement point of a printed circuit board (PCB). The gantry needs a nozzle to move its electronic components. There is a suitability between the nozzle and the electronic component, and the mounting speed varies depending on the suitability. When it is difficult for the nozzle to adsorb electronic components, nozzle exchange is performed, and nozzle exchange takes a certain amount of time. The gantry route optimization problem is divided into the mounting order on PCB and the allocation of nozzles and electronic components to the gantry. Nozzle and electronic component allocation minimized the time incurred by nozzle exchange and nozzle-to-electronic component compatibility by using an mixed integer programming method. Sequence of mounting points on PCB minimizes travel time by using the branch-and-price method. Experimental data was made by randomly picking the location of the mounting point on a PCB of 800mm in width and 800mm in length. The number of mounting points is divided into 25, 50, 75, and 100, and experiments are conducted according to the number of types of electronic components, number of nozzle types, and suitability between nozzles and electronic components, respectively. Because the experimental data are random, the calculation time is not constant, but it is confirmed that the gantry route is found within a reasonable time.

Puzzle Rule Algorithm of Euler Square Game (오일러 방진 게임 퍼즐 규칙 알고리즘)

  • Lee, Sang-Un
    • Journal of Industrial Convergence
    • /
    • v.19 no.4
    • /
    • pp.23-28
    • /
    • 2021
  • This paper finds the regular pattern of n = [3, ∞] for Euler square game related with n = 6(6×6=36) thirty-six officer problem that is still unsolved problem. The solution of this problem is exists for n = [3, 10] without n = 6. Also, previous researchers finds the random assigned solution for specific number using computer programming. Therefore, the solution of n = [11, ∞] Euler squares are unsolved problem because of anything but easy. This paper attempts to find generalized patterns for domains that have been extended to n = [3, ∞], while existing studies have been limited to n = [3, 10]. This paper classify the n = [3, ∞] into n = odd, 4k even, 4k+2 even of three classes. Then we find the simple regular pattern solution for n = odd and 4k even(n/2 = even). But we can't find the regular pattern for 4k+2 even(n/2 = odd).

Determination of the stage and grade of periodontitis according to the current classification of periodontal and peri-implant diseases and conditions (2018) using machine learning algorithms

  • Kubra Ertas;Ihsan Pence;Melike Siseci Cesmeli;Zuhal Yetkin Ay
    • Journal of Periodontal and Implant Science
    • /
    • v.53 no.1
    • /
    • pp.38-53
    • /
    • 2023
  • Purpose: The current Classification of Periodontal and Peri-Implant Diseases and Conditions, published and disseminated in 2018, involves some difficulties and causes diagnostic conflicts due to its criteria, especially for inexperienced clinicians. The aim of this study was to design a decision system based on machine learning algorithms by using clinical measurements and radiographic images in order to determine and facilitate the staging and grading of periodontitis. Methods: In the first part of this study, machine learning models were created using the Python programming language based on clinical data from 144 individuals who presented to the Department of Periodontology, Faculty of Dentistry, Süleyman Demirel University. In the second part, panoramic radiographic images were processed and classification was carried out with deep learning algorithms. Results: Using clinical data, the accuracy of staging with the tree algorithm reached 97.2%, while the random forest and k-nearest neighbor algorithms reached 98.6% accuracy. The best staging accuracy for processing panoramic radiographic images was provided by a hybrid network model algorithm combining the proposed ResNet50 architecture and the support vector machine algorithm. For this, the images were preprocessed, and high success was obtained, with a classification accuracy of 88.2% for staging. However, in general, it was observed that the radiographic images provided a low level of success, in terms of accuracy, for modeling the grading of periodontitis. Conclusions: The machine learning-based decision system presented herein can facilitate periodontal diagnoses despite its current limitations. Further studies are planned to optimize the algorithm and improve the results.

Evaluating Reverse Logistics Networks with Centralized Centers : Hybrid Genetic Algorithm Approach (집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법)

  • Yun, YoungSu
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.55-79
    • /
    • 2013
  • In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

Empirical Analysis of the Effect of Avatars on Learner's e-Learning Performance : Emphasis on Trust Transference between Avatars and Contents (아바타가 학습자 이러닝 성과에 미치는 영향에 관한 실증연구:아바타와 학습내용간 신뢰전이를 중심으로)

  • Chae, Seong-Wook;Lee, Kun-Chang;Lee, Keun-Young
    • Asia pacific journal of information systems
    • /
    • v.19 no.4
    • /
    • pp.149-176
    • /
    • 2009
  • In the recent e-learning environment, avatars are often used to help learners get familiar with the contents, which is ultimately to motivate them to study more. Therefore, it is important to investigate whether avatars have actually the desirable effect on users of e-learning materials. Surprisingly, however, no extensive study has been conducted on this crucial issue Accordingly, main objectives this study are summarized as follows. First, we need to gain better understanding of how much learners' trust towards avatars (termed as "avatar trust") is transferred to learners' trust towards e-learning contents (termed as "contents trust"). Second, we need to investigate how much learners' personal relationships with avatars as well as learning behaviors change depending on avatar types (attractive vs. professional) and contents complexity (easy vs. difficult). As described in the study objectives, in order for us to analyze empirical data more systematically, we classified avatar types into two: "attractive" and "professional;" the contents are categorized as either "easy" or "difficult." Therefore, it is essential for this study to build a prototype e-learning website on which our research purpose can be realized and tested effectively with proper avatar types and e-learning contents. For this purpose, we built a prototype e-learning website, in which avatars are invited from currently working avatar instructors used in real-world e-learning websites, and e-learning contents are adapted from real-world contents about Java programming topic, which have been proved to have shown high quality and reliability. Our research method includes questionnaire survey by inviting a number of valid respondents comprised of office workers who are believed to have high demands for the e-learning contents as well as those who have previous experience with avatar instructors. Respondents were given one of the four e-learning experiment conditions (2 avatar types x 2 contents types) on a random basis. Each experimental e-learning condition is framed to have the same quality but different avatar type and content complexity. Then the respondents are asked to fill out the survey form which has questions about avatar trust, contents trust, personal relationships with avatar, and learning behavior, among others. Regarding the constructs used in research model, we based them rigorously on previous studies. For example, we used six constructs such as behavior to give information (BGI), behavior to obtain information (BOI), need for inclusion wanted, need for control wanted, contents trust, and avatar trust. To measure them, 7-Likert scales were used in the questionnaire. E-learning performance was measured indirectly through two constructs such as BGI and BOI. Six constructs used in the research model were adopted and revised from the FIRO-B model suggested by Schutz. Empirical results are as follows: First, professional avatars are more effective for difficult contents, while attractive avatars were not as effective for easy contents. Second, our study results ascertained that avatar trust transfers to contents trust regardless of avatar types and contents complexity.