• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.57-60
• /
• 2000

본 논문은 전송되는 멀티캐스트 트래픽에 의해 아크별로 발생하는 전송비용의 합을 최소화하는 멀티캐스트 경로 설정 알고리즘을 제시한다. 비용함수는 콘벡스 형태이고 멀티캐스팅이 요구되는 트래픽은 분할 전송이 가능하다고 가정한다. 가정에 의해 분할되는 트래픽은 여러 개의 다른 멀티캐스트 트리경로 상으로 전송이 가능하며 총 전송비용도 줄일 수 있다. 트래픽의 분할전송이 가능하여도 만일 비용함수가 선형이면 이는 Steiner 문제가 된다. 본 연구는 단일 멀티캐스트 트래픽 수요형태만을 고려한 본 연구자들의 수행연구［1］에 대한 계속연구로서 복수개의 멀티캐스트 트래픽 수요형태를 고려한다. 또한 본 연구의 결과에서 얻는 많은 멀티캐스트 트리 경로들 중 전송비용을 최소화하도록 하면서 제한된 k개의 트리 경로들을 선택하는 휴리스틱 방법을 소개한다. 본 연구는 ATM 망의 멀티캐스트 트래픽을 위한 가상경로 설계 또는 인터넷 환경의 다양한 멀티캐스트 트래픽을 위한 경로설정 등에 적용될 수 있다. 임의의 적용 망에 대한 결과를 포함한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.197-204
• /
• 2012

We propose a new scheme combining the compensation of HPA nonlinearity and the calibration of the path imperfections in the downlink OFDM smart antenna systems. We use a two term third-order polynomial (without second-order term) and the feedforward method for compensation and calibration to make each path of the antenna array have equal characteristics. Since the proposed scheme does not alter the base-band signal, it can be applied to the smart antenna system independently of the base-band signal processing section. The result of computer simulations shows that, with the addition of only one third-order term, the adverse nonlinear effects can be effectively compensated, and the those of linear imperfections can be calibrated as well.

• Journal of Advanced Navigation Technology
• /
• v.24 no.2
• /
• pp.128-133
• /
• 2020

In this study, an 1-dimensional positioning method using iterative linear regression for path loss expression is proposed. In the proposed method, received signal strengths (RSS) measured in several locations and distances between the measuring locat ions obtained by dead reckoning are used to derive a linear regression for the path loss from the transmitting beacon. In the proposed method, for the distance between the transmitting beacon and a target measuring location, several tentative values are assumed. For each tentative value, a linear regression is obtained. Among the linear regression expressions, the one closest to the known reference RSS value is selected and used to derive the distance to the target location. Test results show that the proposed method is more accurate than path loss model.

• Journal of Educational Research in Mathematics
• /
• v.20 no.1
• /
• pp.85-102
• /
• 2010

Linear programming(LP) is useful for finding the best way in a given condition for some list of requirements represented as linear equations. This study analysed LP in mathematics contexts and LP in school mathematics contexts, considered learning process of LP from an epistemological point of view, and explored a hypothetical learning trajectory of LP. The differences between mathematics contexts and school mathematics contexts are whether they considered that the convex polytope $\Omega$ is feasible/infeasible or bounded/unbounded or not, and whether they prove the theorem that the optimum is always attained at a vertex of the polyhedronor not. And there is a possibility that students could not understand what is maximum and minimum of a linear function when the domain of the function is limited. By considering these three aspects, we constructed hypothetical learning trajectory consisted of 4 steps. The first step is to see a given linear expression as linear function, the second step is to partition a given domain by straight lines, the third step is to construct the conception of y-intercept by relating lines and the range of k, and the forth step is to identify whether there exists the optimum in a given domain or not.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.6
• /
• pp.1379-1392
• /
• 2018

The complexity of the differential-linear cryptanalysis is strongly influenced by the probability of the differential-linear characteristic computed under the assumption of round independence, linear approximation independence, and uniformity for the trail that does not satisfy differential trail. Therefore, computing the exact probability of the differential-linear characteristic is a very important issue related to the validity of the attack. In this paper, we propose a new concept called DLCT(Differential-Linear Connectivity Table) for the differential-linear cryptanalysis. Additionally, we propose an improved probability computation technique of differential-linear characteristic by applying DLCT. By doing so, we were able to weaken linear approximation independence assumption. We reanalyzed the previous results by applying DLCT to DES and SERPENT. The probability of 7-round differential-linear characteristic of DES is $1/2+2^{-5.81}$, the probability of 9-round differential-linear characteristic of SERPENT is computed again to $1/2+2^{-57.9}$, and data complexity required for the attack is reduced by $2^{0.2}$ and $2^{2.2}$ times, respectively.

• Journal of the Society of Naval Architects of Korea
• /
• v.28 no.1
• /
• pp.182-188
• /
• 1991

The modified arc-length algorithms for the automatic incremental solution of nonlinear finite element equations proposed by Riks are presented, which comprise the cylindrical arc-length method and the normal arc-length method. These methods are developed to trace the nonlinear path of large displacement problems such as a pre and post bucking/collapse response of general structures. These methods are applied to analyse the nonlinear behavior of arch and shell problems in parallel with the standard and modified Newton-Raphson method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.602-605
• /
• 1996

가상경로의 개념은 ATM망의 효율적인 전송체게임이 이미 여러 연구에 의하여 밝혀져 있다[1,2,7,9,10]. 본 논문에서는 등가대역의 개념을 이용하여 가상경로가 가질 수 있는 QoS를 다양하게 고려한 새로운 가상경로 설정모형(MVCAP)과 해법을 제사하였다. 모형 MVCAP은 (1) 가상경로의 설정에 따르는 용량비용(capacity cost)과 제어비용(control cost)간의 trade-off을 반영하였으며 (2) 가상경로의 QoS를 다양하게 고려하여 통계적 다중화 효과를 충분히 반영하도록 하였고 (3) 가상경로의 설정방법들인 분리설정법(segregation method)와 통합설정법(integration method)을 동시에 고려한 모형을 수립하였으며 (4) 등가대역식의 선형근사를 이용하여 목적함수를 단조 감소시키는 발견적 해법을 제시하였다. 소형문제에 대한 실험결과, 본 논문의 모형은 가상경로의 설정을 실시간 안에 이룰 수 있는 가능성을 열어 보였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.766-772
• /
• 2007

As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.48-56
• /
• 2002

This paper proposes an IP(Internet Protocol) multicast routing method by multiple tree routes. Multiple trees, instead of a single tree, improve the quality of multicast services with nonlinear link cost and huge traffic demand. The proposed method adds tree routes until it satisfies target conditions, and it splits the multicast traffic demand into the chosen tree routes. We develop a mathematical model and optimal conditions for traffic splitting. The method works on the problems with many different simultaneous multicast traffic. Various experiments were carried and the results show that the new multicasting is fairly effective on end-to-end quality of services.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.526-532
• /
• 1999

본 논문에서는 마이크로프로그램을 위한 테스트 데이타를 자동으로 생성하는 시스템을 제안하였다. 이 시스템에서는 주어진 경로를 따라 마이크로프로그램을 기호수행(symbolic execution)시켜 경로조건식을 구하고 이 식를 풀어서 테스트 데이타를 생성한다. 기호수행 방법을 이용하여 테스트 데이타를 생성하기 위해서는 경로조건식이 선형이어야 한다. 따라서 본 논문에서는 마이크로프로그램의 테스트 데이타를 생성하기 위하여 마이크로프로그램에서 사용되는 연산자들을 선형 연산자로 변환하는 방법을 제안하였다. Abstract In this paper, we propose an automated test data generation system for microprogram. This system symbolically executes microprogram along a given path, extracts path conditions for the given path, and generates test data by solving the path conditions. To generate test data using symbolic execution, the path conditions must be linear. Therefore, we propose a linearization method which transforms operators used in the microprogram into linear operators.