• Journal of Chest Surgery
• /
• v.23 no.2
• /
• pp.342-351
• /
• 1990

In recent years there are so many medical informations that surgeons should know to handle or analyze their large amount of surgical cases. Proper use of computer system offers new opportunities for the storage and manipulation of their hospital informations. But little is reported about which system, is appropriate, how much can we do with such a system, or what kind of work can be done with that, especially in the area of Thoracic and Cardiovascular Surgery section. Authors designed a computer-based patient file management system using 16 Bit AT IBM personal computer and dBASE IV program, and developed a coding system for the diagnosis and operation name, which offers the basis for the classification of the surgical patient data. And the result of some experiences which was got from the total surgical cases of Thoracic and Cardiovascular Section, Seoul District Armed Forces General Hospital during past 5years, was described.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.449-449
• /
• 2000

Many researchers have studied architectures for non-Neumann's computers because of escaping its bottleneck. To avoid the bottleneck, a neuron-based computer has been developed. The computer has only neurons and their connections, which are constructed of the learning. But still it has information processing facilities, and at the same time, it is like as a simplified brain to make inference; it is called "neuron-computer". No instructions are considered in any neural network usually; however, to complete complex processing on restricted computing resources, the processing must be reduced to primitive actions. Therefore, we introduce the instructions to the neuron-computer, in which the most important function is implications. There is an implication represented by binary-operators, but general implications for multi-value or fuzzy logics can't be done. Therefore, we need to use Lukasiewicz' operator at least. We investigated a neuron-computer having instructions for general implications. If we use the computer, the effective inferences base on multi-value logic is executed rapidly in a small logical unit.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.34 no.3
• /
• pp.31-34
• /
• 2016

This article reviews Apache SINGA, a general distributed deep learning (DL) platform. The system components and its architecture are presented, as well as how to configure and run SINGA for different types of distributed training using model/data partitioning. Besides, several features and performance are compared with other popular DL tools.

• Communications for Statistical Applications and Methods
• /
• v.11 no.1
• /
• pp.169-179
• /
• 2004

Partially balanced diallel cross designs with m-associate classes are defined and two general methods of construction are presented. Two-associate class designs based upon group divisible, triangular, and extended group divisible association schemes obtained using the general methods are also given. Tables of designs for p$\leq$24 are also provided.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.193-210
• /
• 1997

In this paper we find the irreducible complex characters of the automorphism group of the general linear group of degree 7 over a field with two elements. It is shown that this group has 114 irreducible complex characters.

• Communications of the Korean Mathematical Society
• /
• v.18 no.4
• /
• pp.713-723
• /
• 2003

We study a limit problem of reflected solutions of parabolic stochastic partial differential equations driven by martingale measures. The existence of solutions is found in an extension of the work with respect to white noise by Donati-Martin and Pardoux [4]. We show that if a certain sequence of driving martingale measures converges, the corresponding solutions also converge in the Skorohod topology.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.225-234
• /
• 2021

Let D be a division ring and n > 1 be an integer. In this paper, it is shown that if D ≠ ��3, then every subpermutable subgroup of the general skew linear group GLn(D) is normal. By applying this result, we show that every subpermutable subgroup of the unit group (ℝG)∗ of the real group algebras RG of finite groups G is normal in (ℝG)∗.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2230-2234
• /
• 2003

This paper proposes a distributed simulator for general control system in CEMTool. Systems can be described by SIMTool likes the simulink in Matlab. For distributed simulation, we can seperate any system into several parallel subsystems in SIMTool. The number of parallel subsystem can be determined by the system's property. After seperation, parallel simulator will do initialization, one-step-ahead simulation, block-distribution and ordering and so on. Finally, simulator will create independent C codes and executive files for each subsystem. The whole system is fulfilled by several PCs, and each PC executes one subsystem. There are communications among these subsystem using reflective memory or ethernet. We have made several experiments, and the 5-stand cold rolling mill control system is our main target. The result of parallel simulation has shown effective speedup in comparison with one pc simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.155-160
• /
• 2002

The personnel and salary management business among computation by computer of a general enterprise is very important. The attendance-absence of our office and in and out of office work for employees in business is very important data element. Because of computation by computer system introduction in a general small and medium enterprise is very expensive, until now it is managed simply by handwork data in the attendance book. On the other hand, to solve the cost problem I designed and implemented a diligence and indolence communication management system for using P.O.P Terminal.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.9-16
• /
• 2016

Recently, many research groups have focused on GPGPUs in order to improve the performance of computing systems. GPGPUs can execute general-purpose applications as well as graphics applications by using parallel GPU hardware resources. GPGPUs can process thousands of threads based on warp scheduling and CTA scheduling. In this paper, we utilize the traditional CTA scheduler to assign a various number of CTAs to SMs. According to our simulation results, increasing the number of CTAs assigned to the SM statically does not improve the performance. To solve the problem in traditional CTA scheduling schemes, we propose a new IPC-based dynamic CTA scheduling scheme. Compared to traditional CTA scheduling schemes, the proposed dynamic CTA scheduling scheme can increase the GPU performance by up to 13.1%.