• Journal of applied mathematics & informatics
• /
• 제11권1_2호
• /
• pp.305-316
• /
• 2003

Recently, an iterative algorithm for finding the interior eigenvalues of a definite matrix by CG-type method has been proposed. This method compares to the inverse power method. The given matrices A, and B are assumed to be large and sparse, and SPD( Symmetric Positive Definite) The CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for smallest eigenvalue. Also, it is very amenable to parallel computations, like the CG method for the linear systems. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. But for parallel computations we need to find an efficient parallel preconditioner. Our candidates we ILU(0) in the wave-front order, ILU(0) in the multi-coloring order, Point-SSOR(Symmetric Successive Overrelaxation), and Multi-Color Block SSOR preconditioner. Wavefront order is a simple way to increase parallelism in the natural order, and Multi-coloring realizes a parallelism of order(N), where N is the order of the matrix. Another choice is the Multi-Color Block SSOR(Symmetric Successive OverRelaxation) preconditioning. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test problem was drawn from the discretizations of partial differential equations by finite difference methods. The results show that for small number of processors Multi-Color ILU(0) has the best performance, while for large number of processors Multi-Color Block SSOR performs the best.

• 응용통계연구
• /
• 제35권2호
• /
• pp.217-227
• /
• 2022

분위수 회귀 모형은 변수에 숨겨진 복잡한 정보를 살펴보기 위한 효율적인 도구를 제공하는 장점을 바탕으로 많은 분야에서 널리 사용되고 있다. 그러나 현대의 대용량-고차원 데이터는 계산 시간 및 저장공간의 제한으로 인해 분위수 회귀 모형의 추정을 매우 어렵게 만든다. 분할-정복은 전체 데이터를 계산이 용이한 여러개의 부분집합으로 나눈 다음 각 분할에서의 요약 통계량만을 이용하여 전체 데이터의 추정량을 재구성하는 기법이다. 본 연구에서는 분할-정복 기법을 벌점화 분위수 회귀에 적용하고 베이즈 정보기준을 활용하여 변수를 선택하는 방법에 관하여 연구하였다. 제안 방법은 분할 수를 적절하게 선택하였을 때, 전체 데이터로 계산한 일반적인 분위수 회귀 추정량만큼 변수 선택의 측면에서 일관된 결과를 제공하면서 계산 속도의 측면에서 효율적이다. 이러한 제안된 방법의 장점은 시뮬레이션 데이터 및 실제 데이터 분석을 통해 확인하였다.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제38권2호
• /
• pp.247-261
• /
• 2024

본 연구는 스크래치 같은 드래그 앤 드롭 방식 교육용 프로그래밍 언어를 활용하여 복잡한 도형의 한붓그리기 과제를 해결하는 활동의 교육적 활용가능성을 논의하고자 한다. 주어진 도형이 한붓그리기가 가능한지를 판별하는 문제와 실제로 한붓그리기의 경로를 찾아서, 프로그래밍으로 구현하는 것은 별개의 문제가 된다. 특히 규칙성을 가지는 복잡한 도형에 대해 한붓그리기가 가능한 규칙적인 경로를 찾고, 이를 프로그래밍으로 구현하는 것은 다양한 수학지식의 융합을 바탕으로 하는 문제해결 역량을 요구한다. 이에 본 연구에서는 다각형 관련 도형들, 테셀레이션 관련 도형들, 프랙탈 도형들 중에 한붓그리기와 관련된 문제를 제시하고, 해당 도형의 한붓그리기 프로그래밍 결과를 예시하였다. 또 예시된 문제의 해결과정을 위해 필요한 수학지식과 계산적 사고 요소들을 분석하였다. 본 연구는 수학과 정보가 융합하는 수학교육에 대한 새로운 예시라는 의미를 갖는다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3852-3864
• /
• 2016

Patients' health data is very sensitive and the access to individual's health data should be strictly restricted. However, many data consumers may need to use the aggregated health data. For example, the insurance companies needs to use this data to setup the premium level for health insurances. Therefore, privacy-preserving data aggregation solutions for health data have both theoretical importance and application potentials. In this paper, we propose a privacy-preserving health data aggregation scheme using differential privacy. In our scheme, patients' health data are aggregated by the local healthcare center before it is used by data comsumers, and this prevents individual's data from being leaked. Moreover, compared with the existing schemes in the literature, our work enjoys two additional benefits: 1) it not only resists many well known attacks in the open wireless networks, but also achieves the resilience against the human-factor-aware differential aggregation attack; 2) no trusted third party is employed in our proposed scheme, hence it achieves the robustness property and it does not suffer the single point failure problem.

• 응용통계연구
• /
• 제29권7호
• /
• pp.1361-1371
• /
• 2016

분위수 회귀모형은 설명변수가 반응변수의 조건부 분위수 함수에 어떻게 관계되는지 탐색함으로서 많은 유용한 정보를 제공한다. 그러나 설명변수와 반응변수가 비선형 관계를 갖는다면 선형형태를 가정하는 전통적인 분위수 회귀모형은 적합하지 않다. 또한 고차원 자료 또는 설명변수간 상관관계가 높은 자료에 대해서 변수선택의 방법이 필요하다. 이러한 이유로 본 연구에서는 벌점화 분위수 회귀나무모형을 제안하였다. 한편 제안한 방법의 분할규칙은 과도한 계산시간과 분할변수 선택편향 문제를 극복한 잔차 분석을 기반으로 하였다. 본 연구에서는 모의실험과 실증 예제를 통해 제안한 방법의 우수한 성능과 유용성을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 학술대회 논문집 전문대학교육위원
• /
• pp.183-186
• /
• 2007

Realistic deformation of computer simulated anatomical structures is computationally intensive. As a result, simple methodologies not based in continuum mechanics have been employed for achieving real time deformation of virtual reality. Since the graphical interpolations and simple spring models commonly used in these simulations are not based on the biomechanical properties of tissue structures, these "quick and dirty"methods typically do not accurately represent the complex deformations and force-feedback interactions that can take place during surgery. Finite Element(FE) analysis is widely regarded as the most appropriate alternative to these methods. However, because of the highly computational nature of the FE method, its direct application to real time force feedback and visualization of tissue deformation has not been practical for most simulations. If the mathematics are optimized through pre-processing to yield only the information essential to the simulation task run-time computation requirements can be drastically reduced. To apply the FEM, We examined a various in verse matrix method and a deformed material model is produced and then the graphic deformation with this model is able to force. As our simulation program is reduced by the real-time calculation and simplification because the purpose of this system is to transact in the real time.

• 대한의용생체공학회:의공학회지
• /
• 제30권4호
• /
• pp.279-287
• /
• 2009

Magnetic resonance electrical impedance tomography (MREIT) is a new medical imaging modality providing cross-sectional images of a conductivity distribution inside an electrically conducting object. MREIT has rapidly progressed in its theory, algorithm and experimental technique and now reached the stage of in vivo animal and human experiments. Conductivity image reconstructions in MREIT require various steps of carefully implemented numerical computations. To facilitate MREIT research, there is a pressing need for an MREIT software package with an efficient user interface. In this paper, we present an example of such a software, called CoReHA which stands for conductivity reconstructor using harmonic algorithms. It offers various computational tools including preprocessing of MREIT data, identification of boundary geometry, electrode modeling, meshing and implementation of the finite element method. Conductivity image reconstruction methods based on the harmonic $B_z$ algorithm are used to produce cross-sectional conductivity images. After summarizing basics of MREIT theory and experimental method, we describe technical details of each data processing task for conductivity image reconstructions. We pay attention to pitfalls and cautions in their numerical implementations. The presented software will be useful to researchers in the field of MREIT for simulation as well as experimental studies.

• Wind and Structures
• /
• 제26권1호
• /
• pp.35-43
• /
• 2018

This paper describes the effect of different testing parameters (configuration of infrastructure and truck position on road) on truck aerodynamic coefficients under cross wind conditions, by means of a numerical approach known as Large Eddy Simulation (LES). In order to estimate the air flow behaviour around both the infrastructure and the truck, the filtered continuity and momentum equations along with the Smagorinsky-Lilly model were solved. A solution for these non-linear equations was approached through the finite volume method (FVM) and using temporal and spatial discretization schemes. As for the results, the aerodynamic coefficients acting on the truck model exhibited nearly constant values regardless of the Reynolds number. The flat ground is the infrastructure where the rollover coefficient acting on the truck model showed lowest values under cross wind conditions (yaw angle of $90^{\circ}$), while the worst infrastructure studied for vehicle stability was an embankment with downward-slope on the leeward side. The position of the truck on the road and the value of embankment slope angle that minimizes the rollover coefficient were determined by successfully applying the Response Surface Methodology.

• 대한수학회보
• /
• 제53권4호
• /
• pp.1051-1069
• /
• 2016

Combining the concept of self-certified public key and message recovery, Li-Zhang-Zhu (LZZ) gives the proxy signature scheme with message recovery using self-certified public key. The security of the proposed scheme is based on the discrete logarithm problem (DLP) and one-way hash function (OWHF). Their scheme accomplishes the tasks of public key verification, proxy signature verification, and message recovery in a logically single step. In addition, their scheme satisfies all properties of strong proxy signature and does not use secure channel in the communication between the original signer and the proxy signer. In this paper, it is shown that in their signature scheme a malicious signer can cheat the system authority (SA), by obtaining a proxy signature key without the permission of the original signer. At the same time malicious original signer can also cheat the SA, he can also obtain a proxy signature key without the permission of the proxy signer. An improved signature scheme is being proposed, which involves the remedial measures to get rid of security flaws of the LZZ et al.'s. The security and performance analysis shows that the proposed signature scheme is maintaining higher level of security, with little bit of computational complexity.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.116-122
• /
• 2006

Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.