• 제목/요약/키워드: Efficient solutions

Search Result 1,312, Processing Time 0.026 seconds

A Study on Approximate and Exact Algorithms to Minimize Makespan on Parallel Processors (병렬처리리례 상에서 동작업완료시간의 최소화해법에 관한 연구)

  • Ahn, Sang-Hyung;Lee, Song-Kun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.16 no.2
    • /
    • pp.13-35
    • /
    • 1991
  • The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

  • PDF

Efficient Ρ-median approach to GT cell formation (GT 셀 형성을 위한 효율적 Ρ-median 접근법)

  • Won, Youkyung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.40-43
    • /
    • 2000
  • This paper is concerned with development of an efficient Ρ-median approach applicable to large cell formation(CF) problems. A two-phase methodology that seeks to minimize the number of exceptional elements is proposed. In phase I, two efficient Ρ-median formulations which contain fewer binary variables than existing Ρ-median formulations are constructed. These make it possible to implement large CF problem within reasonable computer runtime with commercially available linear integer programming codes. Given the initial cell configuration found with the new p-median formulations, in phase II bottleneck machines and parts are reassigned to reduce the number of exceptional elements. This procedure has the flexibility to provide the cell designer with alternative solutions. Test results on large CF problems show a substantial efficiency of the new Ρ-median formulations.

  • PDF

Efficient Computations for Evaluating Extended Stochastic Petri Nets using Algebraic Operations

  • Kim, Dong-Sung;Moon, Hong-Ju;Bahk, Je-Hyeong;Kwon, Wook-Hyun;Zygmunt J. Haas
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.4
    • /
    • pp.431-443
    • /
    • 2003
  • This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

EFFICIENT ESTIMATION OF THE REGULARIZATION PARAMETERS VIA L-CURVE METHOD FOR TOTAL LEAST SQUARES PROBLEMS

  • Lee, Geunseop
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.5
    • /
    • pp.1557-1571
    • /
    • 2017
  • The L-curve method is a parametric plot of interrelation between the residual norm of the least squares problem and the solution norm. However, the L-curve method may be hard to apply to the total least squares problem due to its no closed form solution of the regularized total least squares problems. Thus the sequence of the solution norm under the fixed regularization parameter and its corresponding residual need to be found with an efficient manner. In this paper, we suggest an efficient algorithm to find the sequence of the solutions and its residual in order to plot the L-curve for the total least squares problems. In the numerical experiments, we present that the proposed algorithm successfully and efficiently plots fairly 'L' like shape for some practical regularized total least squares problems.

A Survey of Energy Efficiency Optimization in Heterogeneous Cellular Networks

  • Abdulkafi, Ayad A.;Kiong, Tiong S.;Sileh, Ibrahim K.;Chieng, David;Ghaleb, Abdulaziz
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.462-483
    • /
    • 2016
  • The research on optimization of cellular network's energy efficiency (EE) towards environmental and economic sustainability has attracted increasing attention recently. In this survey, we discuss the opportunities, trends and challenges of this challenging topic. Two major contributions are presented namely 1) survey of proposed energy efficiency metrics; 2) survey of proposed energy efficient solutions. We provide a broad overview of the state of-the-art energy efficient methods covering base station (BS) hardware design, network planning and deployment, and network management and operation stages. In order to further understand how EE is assessed and improved through the heterogeneous network (HetNet), BS's energy-awareness and several typical HetNet deployment scenarios such as macrocell-microcell and macrocell-picocell are presented. The analysis of different HetNet deployment scenarios gives insights towards a successful deployment of energy efficient cellular networks.

An efficient six-node plate bending hybrid/mixed element based on mindlin/reissner plate theory

  • Mei, Duan;Miyamoto, Yutaka;Iwasaki, Shoji;Deto, Hideaki;Zhou, Benkuan
    • Structural Engineering and Mechanics
    • /
    • v.5 no.1
    • /
    • pp.69-83
    • /
    • 1997
  • A new efficient hybrid/mixed thin~moderately thick plate bending element with 6-node (HM6-14) is formulated based on the Reissner-Mindlin plate bending theory. The convergence of this element is proved by error estimate theories and verified by patch test respectively. Numerical studies on such an element as HM6-14 demonstrate that it has remarkable convergence, invariability to geometric distorted mesh situations, to axial rotations, and to node positions, and no "locking" phenomenon in thin plate limit. The present element is suitable to many kinds of shape and thin~moderately thick plate bending problems. Further, in comparison with original hybrid/mixed plate bending element HP4, the present element yields an improvement of solutions. Therefore, it is an efficient element and suitable for the development of adaptive multi-field finite element method (FEM).

Efficient elastic stress analysis method for piping system with wall-thinning and reinforcement

  • Kim, Ji-Su;Jang, Je-Hoon;Kim, Yun-Jae
    • Nuclear Engineering and Technology
    • /
    • v.54 no.2
    • /
    • pp.732-740
    • /
    • 2022
  • A piping system stress analysis need to be re-performed for structural integrity assessment after reinforcement of a pipe with significant wall thinning. For efficient stress analysis, a one-dimensional beam element for the wall-thinned pipe with reinforcement needs to be developed. To develop the beam element, this work presents analytical equations for elastic stiffness of the wall-thinned pipe with reinforcement are analytically derived for axial tension, bending and torsion. Comparison with finite element (FE) analysis results using detailed three-dimensional solid models for wall-thinned pipe with reinforcement shows good agreement. Implementation of the proposed solutions into commercial FE programs is explained.

A Study on the Relationship Between Length of Time and Contamination in Open Intravenous Solutions (정맥주사용 수액의 개방후 시간경과에 따른 오염도에 관한 실험연구)

  • 김일원
    • Journal of Korean Academy of Nursing
    • /
    • v.16 no.1
    • /
    • pp.67-80
    • /
    • 1986
  • The use of intravenous solutions for fluid replacement has become an integral part of patient care, This widespread use of intravenous solutions has increased the risk of contamination that can lead to septicemia and phlebitis. The literature regarding contamination of in use intravenous solutions recommends a standard 24-hour time limit on the use of these fluids. But the desings of these studies did not incorporate a time variable related to contamination. In other studies, however, time was a manipulated variable: but data regarding the onset of contamination were conflicting. Because published reports conflict with regard to a time standard related to the use of intravenous therapy, additional empirical data are needed upon which to base the standards of care regulating use of intravenous therapy. This study investigated rate of contamination in simulated in-use intravenous solutions to obtain data from which to recomend a standard time period for the administration of intravenous solutions. In this study samples were drawn from 60 bottles of 5% D/W solution at predetermined time intervals over 48 hours and samples were inoculated to Thio-glychollate Broth. After 10 days' culturing in that Broth, samples were cultured on blood agar plates for 18∼48 hours to determine the rate of contamination. was found at all time Period, regardless of the presence or absence of nurse's gloving in the preparation of fluids, the location in which the experimentations were performed, the contamination level of surrounding air, or the length of time during which solutions were opened. Data from this study support the use of a 48-hour time period on which to base the standard involved in ready-to-use simple intravenous solutions without additives. In emergency departments and critical care areas where intravenous solutions are prepared in advance, the suggested time standard supported by the data generated from this study is 48 hours, not 24 hour. Data from this study support a 24-hour time standard for changing in-use intravenous solutions when the contamination results from the manipulation of intravenous infusion system by hospital personnel, or from some other exogenous sources during administration. Because contamination that does occur within 48 hours in intravenous solutions must be introduced from some exogenous sources, further empirical studies based on the identification of sources of contamination and factors that affect the rate of contamination, are needed to investigate the currently employed standard of intravenous therapy and to provide the patient with more efficient and safer intravenous thereapy.

  • PDF

Analytical and higher order finite element hybrid approach for an efficient simulation of ultrasonic guided waves I: 2D-analysis

  • Vivar-Perez, Juan M.;Duczek, Sascha;Gabbert, Ulrich
    • Smart Structures and Systems
    • /
    • v.13 no.4
    • /
    • pp.587-614
    • /
    • 2014
  • In recent years the interest in online monitoring of lightweight structures with ultrasonic guided waves is steadily growing. Especially the aircraft industry is a driving force in the development of structural health monitoring (SHM) systems. In order to optimally design SHM systems powerful and efficient numerical simulation tools to predict the behaviour of ultrasonic elastic waves in thin-walled structures are required. It has been shown that in real industrial applications, such as airplane wings or fuselages, conventional linear and quadratic pure displacement finite elements commonly used to model ultrasonic elastic waves quickly reach their limits. The required mesh density, to obtain good quality solutions, results in enormous computational costs when solving the wave propagation problem in the time domain. To resolve this problem different possibilities are available. Analytical methods and higher order finite element method approaches (HO-FEM), like p-FEM, spectral elements, spectral analysis and isogeometric analysis, are among them. Although analytical approaches offer fast and accurate results, they are limited to rather simple geometries. On the other hand, the application of higher order finite element schemes is a computationally demanding task. The drawbacks of both methods can be circumvented if regions of complex geometry are modelled using a HO-FEM approach while the response of the remaining structure is computed utilizing an analytical approach. The objective of the paper is to present an efficient method to couple different HO-FEM schemes with an analytical description of an undisturbed region. Using this hybrid formulation the numerical effort can be drastically reduced. The functionality of the proposed scheme is demonstrated by studying the propagation of ultrasonic guided waves in plates, excited by a piezoelectric patch actuator. The actuator is modelled utilizing higher order coupled field finite elements, whereas the homogenous, isotropic plate is described analytically. The results of this "semi-analytical" approach highlight the opportunities to reduce the numerical effort if closed-form solutions are partially available.

Efficient Data Clustering using Fast Choice for Number of Clusters (빠른 클러스터 개수 선정을 통한 효율적인 데이터 클러스터링 방법)

  • Kim, Sung-Soo;Kang, Bum-Su
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.2
    • /
    • pp.1-8
    • /
    • 2018
  • K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, this method has the limitation to be used with fixed number of clusters because of only considering the intra-cluster distance to evaluate the data clustering solutions. Silhouette is useful and stable valid index to decide the data clustering solution with number of clusters to consider the intra and inter cluster distance for unsupervised data. However, this valid index has high computational burden because of considering quality measure for each data object. The objective of this paper is to propose the fast and simple speed-up method to overcome this limitation to use silhouette for the effective large-scale data clustering. In the first step, the proposed method calculates and saves the distance for each data once. In the second step, this distance matrix is used to calculate the relative distance rate ($V_j$) of each data j and this rate is used to choose the suitable number of clusters without much computation time. In the third step, the proposed efficient heuristic algorithm (Group search optimization, GSO, in this paper) can search the global optimum with saving computational capacity with good initial solutions using $V_j$ probabilistically for the data clustering. The performance of our proposed method is validated to save significantly computation time against the original silhouette only using Ruspini, Iris, Wine and Breast cancer in UCI machine learning repository datasets by experiment and analysis. Especially, the performance of our proposed method is much better than previous method for the larger size of data.