• Interaction and multiscale mechanics
• /
• v.1 no.1
• /
• pp.33-51
• /
• 2008

This paper investigates the modelling of coupled soil-structure interaction problems by domain decomposition techniques. It is assumed that the soil-structure system is physically partitioned into soil and structure subdomains, which are independently modelled. Coupling of the separately modelled partitioned subdomains is undertaken with various algorithms based on the sequential iterative Dirichlet-Neumann sub-structuring method, which ensures compatibility and equilibrium at the interface boundaries of the subdomains. A number of mathematical and computational characteristics of the coupling algorithms, including the convergence conditions and choice of algorithmic parameters leading to enhanced convergence of the iterative method, are discussed. Based on the presented coupling algorithms a simulation environment, utilizing discipline-oriented solvers for nonlinear structural and geotechnical analysis, is developed which is used here to demonstrate the performance characteristics and benefits of various algorithms. Finally, the developed tool is used in a case study involving nonlinear soil-structure interaction analysis between a plane frame and soil subjected to ground excavation. This study highlights the relative performance of the various considered coupling algorithms in modelling real soil-structure interaction problems, in which nonlinearity arises in both the structure and the soil, and leads to important conclusions regarding their adequacy for such problems as well as the prospects for further enhancements.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.8 no.3
• /
• pp.44-52
• /
• 2004

In this study, a component map generation method using experimental data and the genetic algorithms are newly proposed. In order to generate the performance map for components of this engine, after obtaining engine performance data through many experimental tests, and then the third order equations which have relationships the mass flow function the pressure ratio and the isentropic efficiency as to the engine rotational speed were derived by using the genetic algorithms. A steady-state performance analysis was performed with the generated maps of the compressor by the commercial gas turbine performance analysis program GASTURB. In comparison, it was found that the component maps can be generated from the experimental test data by using the genetic algorithms, and it was confirmed that the analysis results using the generated maps were very similar to those using the scaled maps from the GASTURB.

• Genomics & Informatics
• /
• v.10 no.3
• /
• pp.194-199
• /
• 2012

In addition to single-nucleotide polymorphisms (SNP), copy number variation (CNV) is a major component of human genetic diversity. Among many whole-genome analysis platforms, SNP arrays have been commonly used for genomewide CNV discovery. Recently, a number of CNV defining algorithms from SNP genotyping data have been developed; however, due to the fundamental limitation of SNP genotyping data for the measurement of signal intensity, there are still concerns regarding the possibility of false discovery or low sensitivity for detecting CNVs. In this study, we aimed to verify the effect of combining multiple CNV calling algorithms and set up the most reliable pipeline for CNV calling with Affymetrix Genomewide SNP 5.0 data. For this purpose, we selected the 3 most commonly used algorithms for CNV segmentation from SNP genotyping data, PennCNV, QuantiSNP; and BirdSuite. After defining the CNV loci using the 3 different algorithms, we assessed how many of them overlapped with each other, and we also validated the CNVs by genomic quantitative PCR. Through this analysis, we proposed that for reliable CNV-based genomewide association study using SNP array data, CNV calls must be performed with at least 3 different algorithms and that the CNVs consistently called from more than 2 algorithms must be used for association analysis, because they are more reliable than the CNVs called from a single algorithm. Our result will be helpful to set up the CNV analysis protocols for Affymetrix Genomewide SNP 5.0 genotyping data.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.3
• /
• pp.553-568
• /
• 2022

In this paper, we introduce and study two different iterative hybrid projection algorithms for solving a fixed point problem of nonexpansive mappings. The first algorithm is generated by the combination of the inertial method and the hybrid projection method. On the other hand, the second algorithm is constructed by the convex combination of three updated vectors and the hybrid projection method. The strong convergence of the two proposed algorithms are proved under very mild assumptions on the scalar control. For illustrating the advantages of these two newly invented algorithms, we created some numerical results to compare various numerical performances of our algorithms with the algorithm proposed by Dong and Lu [11].

• Journal of the military operations research society of Korea
• /
• v.13 no.1
• /
• pp.45-64
• /
• 1987

Power algorithms for analysis of variance tests are presented. In experimental design of operational tests and evaluations the selection of design parameters so as to attain an experiment with desired power is a difficult and important problem. An interactive computer program is presented which uses the power algorithms for ANOVA tests and creates graphical presentations which can be used to assist decision makers in statistical design. ANOVA tests and associated parameters (such as sample size, types and levels of treatments, and alpha-level)are examined.

• Proceedings of the KSR Conference
• /
• 2000.05a
• /
• pp.108-115
• /
• 2000

This paper presents the new simulation algorithms using network methods to analysis the steady-state train voltage distribution characteristics in ac auto-transformer fed railroads. In general, the supply system of railroads is composed of non-symmetrical and unbalance transmission line. Therefore, the general method using simplified old algorithms have the self-contradictory errors because the supply line of train railroads is completely unbalanced. In this paper, the simulation results of new developed algorithms is compared with those of EMTP to confirm the effectiveness.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.165-170
• /
• 2023

Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, Non preemptive scheduling, Preemptive scheduling, Shortest Job scheduling and Round Robin algorithm has been discussed with an example and the results has been analyzed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1994.10a
• /
• pp.157-164
• /
• 1994

Finite element analysis of material deformation is successfully utilized to understand metal forming processes such as forging, extrusion and deep drawing. However, such analysis involves contact problems; a free node touches a die surface and a contact node slips along the die surface. In the present investigation, appropriate contact algorithms were developed assuming that a three dimensional surface can be divided into bilinear patches and that nodal velocities are linear during an incremental time. The algorithms were coded into a computer program and tested for a simple surface. Comparison of the test result with that obtained from a commercial code is presented and discussed.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.1-9
• /
• 2016

Algorithms implementing distributed shared memory (DSM) were developed for ensuring consistency. The performance of DSM algorithms is dependent on system and usage parameters. However, ensuring these algorithms to tolerate faults is a problem that needs to be researched. In this study, we proposed fault-tolerant scheme for DSM system and analyzed reliability and fault-tolerant overhead. Using our analysis, we can choose a proper algorithm for DSM on error prone environment.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2000.03b
• /
• pp.125-132
• /
• 2000

This study presents the application of genetic algorithms(GA) to the back analysis of tunnels. GA based on the theory of natural evolution, and have been evaluated very effective for their robust performances, particularly for optimizing structure problems. In the back analysis method, the selection of initial value and uncertainty of field measurements influence significantly on the analysis result. GA can improve this problems through a probabilistic approach. Besides, this technique have two other advantages over the back analysis. One is that it is not significantly affected by the form of problems. Another one is that it can consider two known parameter simultaneously. The propriety of this study is verified as the comparison in the same condition of the back analysis(Gens et al, 1987). In this study, it was performed to estimated the geotechnical parameters in the case of weak rock mass at the Kyung Bu Express railway tunnel. GA have been shown for effective application to a geotechnical engineering.