• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.467-482
• /
• 2000

Testing equality of two and k distributions has long been an interesting issue in statistical inference. To overcome the sparseness of data points in high-dimensional space and deal with the general cases, we suggest several projection pursuit type statistics. Some results on the limiting distributions of the statistics are obtained, some properties of Bootstrap approximation are investigated. Furthermore, for computational reasons an approximation for the statistics the based on Number theoretic method is applied. Several simulation experiments are performed.

• 한국통신학회논문지
• /
• 제19권5호
• /
• pp.952-958
• /
• 1994

본 논문에서 정수론에 기초한 이진수호와 이전된 이진부호 사이의 시간옵셉을 계산하는 방법을 제시한다. 이 방법을 이용하여 이진부호 사이의 시간옵셉을 계산할 수 있다. 모든 기지국은 동일한 확산부호를 사용하므로써 동기 부호분할 다원접속 시스템에서 기준(영 \ulcorner\ulcornerV)부호를 정의하는 것은 중요하다. 다른 기지국으로부터 이동국에 수신되는 신호를 구별하기 위하여 영옵셉부호에 대한 시간옵셉을 사용하고 있다. 본 논문은 기준부호를 정의하는 방법을 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권8호
• /
• pp.2816-2830
• /
• 2022

Number Theoretic Transform (NTT) is a method to design efficient multiplier for large integer multiplication, which is widely used in cryptography and scientific computation. On top of that, it has also received wide attention from the research community to design efficient hardware architecture for large size RSA, fully homomorphic encryption, and lattice-based cryptography. Existing NTT hardware architecture reported in the literature are mainly designed based on radix-2 NTT, due to its small area consumption. However, NTT with larger radix (e.g., radix-4) may achieve faster speed performance in the expense of larger hardware resources. In this paper, we present the performance evaluation on NTT architecture in terms of hardware resource consumption and the latency, based on the proposed radix-2 and radix-4 technique. Our experimental results show that the 16-point radix-4 architecture is 2× faster than radix-2 architecture in expense of approximately 4× additional hardware. The proposed architecture can be extended to support the large integer multiplication in cryptography applications (e.g., RSA). The experimental results show that the proposed 3072-bit multiplier outperformed the best 3k-multiplier from Chen et al. [16] by 3.06%, but it also costs about 40% more LUTs and 77.8% more DSPs resources.

• Journal of applied mathematics & informatics
• /
• 제8권2호
• /
• pp.361-370
• /
• 2001

Testing equality of covariance matrix of k populations has long been an interesting issue in statistical inference. To overcome the sparseness of data points in a high-dimensional space and deal with the general cases, we suggest several projection pursuit type statistics. Some results on the limiting distributions of the statistics are obtained. some properties of Bootstrap approximation are investigated. Furthermore, for computational reasons an approximation which is based on Number theoretic method for the statistics is adopted. Several simulation experiments are performed.

• International Journal of Safety
• /
• 제7권1호
• /
• pp.39-43
• /
• 2008

With ever increasing number of citizen using subway stations everyday, safety, health and comfort of passengers and occupants (mostly metro personnel) have become important social issues. Considering the fact that various physical variables and pollutants such as particulate, VOCs and biological agents are closely related to indoor air quality (IAQ) which may cause health problems, a method of quantitative assessment using information-theoretic measure on such variables needs to be devised and implemented for comfort, health and safety of passengers and occupants in the subway station. A basic framework for assessing indoor air quality (for comfort and health) and safety in subway station is suggested. In particular, application of information-theoretic measure for the assessment of indoor air quality, comfort and safety in subway station is discussed. Some examples are presented as well.

• Smart Structures and Systems
• /
• 제2권2호
• /
• pp.189-208
• /
• 2006

Monitoring large-scale civil engineering structures such as offshore platforms and high-large buildings requires a large number of sensors of different types. Innovative sensor data information technologies are very extremely important for data transmission, storage and retrieval of large volume sensor data generated from large sensor networks. How to obtain the optimal sensor set and placement is more and more concerned by researchers in vibration-based SHM. In this paper, a method of determining the sensor location which aims to extract the dynamic parameter effectively is presented. The method selects the number and place of sensor being installed on or in structure by through the tolerance domain statistical inference algorithm combined with second order sensitivity technology. The method proposal first finds and determines the sub-set sensors from the theoretic measure point derived from analytical model by the statistical tolerance domain procedure under the principle of modal effective independence. The second step is to judge whether the sorted out measured point set has sensitive to the dynamic change of structure by utilizing second order characteristic value sensitivity analysis. A 76-high-building benchmark mode and an offshore platform structure sensor optimal selection are demonstrated and result shows that the method is available and feasible.

• 한국산업정보학회논문지
• /
• 제2권1호
• /
• pp.103-123
• /
• 1997

This dissertation provides a theoretic study on the network security in general , the firewall in particular. In fact the firewall has been recognized as a very promising option to obtain the security inthe real work network environment . The dissertation provides a throuth theoretic investigation on the various problems raised in the computer network, and also explores a methodology of the security against IP spoofing. Moreover, it investigates a systematic procddure to make analysis and plans of the firewall configuration . Based on the above investigation and analysis, this dissertation provides two approaches to network security , which address anumber of issuesboth at the network and at applicatino level. At the network level, a new method is proposed which uses packet filtering based on the analysis of the counter plot about the screen router.On the other hand, at the application level, a novel method is explored which employs secureity software. Firewall-1 , on Bastion host. To demonstrate the feasibililty and the effectiveness of the proposed methodologties , a prototype implementation is made The experiment result shows that the screen router employing the proposed anti-IP spoofing method at the network level is effective enough for the system to remain secure without being invaded by any illegal packets entering form external hackers. Meanwhile , at the application level, the proposed software approach employing Firewall-1 is proved to be robust enugh to prevent hackings from the outer point the point protocal connnection . Theoretically, it is not possible to provide complete security to the network system, because the network security involve a number of issues raised form low level network equipments form high level network protocol. The result inthis dissertation provides a very promising solution to network security due to its high efficiency of the implementation and superb protectiveness from a variety of hacking.

• 전자공학회논문지SC
• /
• 제46권6호
• /
• pp.1-8
• /
• 2009

여러 대의 카메라를 이용한 감시 시스템이 정확하고 효율적으로 동작하기 위하여 카메라 시야 간의 연결 관계를 아는 것이 필수적이다. 카메라들의 연결 관계를 파악하기 위하여 카메라 시야 내의 출입 영역을 검출하는 일이 선행되어야 한다. 본 논문에서는 카메라 시야에서 객체의 등장 및 퇴장으로부터 얻은 데이터에 그래프 이론 기반의 클러스터링(clustering)을 적용하여 시야 내의 출입 영역을 검출하는 방법을 제안한다. 데이터 포인트들 사이의 관계를 조사하여 최소신장트리를 구성하고, 트리의 에지들 중 일관성을 갖지 않는 것들을 삭제하여 well-formed 클러스터를 얻는다. 본 논문에서는 클러스터의 형태를 설명하는 두 가지 특징을 정의하고 이를 클러스터의 분할 조건으로 사용하였다. 실험결과를 통하여 데이터 포인트의 분포가 조밀하지 않은 경우 expectation maximization(EM)에 기반을 둔 방법에 비하여 치안하는 방법이 보다 효과적으로 클러스터링을 수행함을 확인하였다. 또한 EM 기반 방법들에 비하여 안정적인 결과를 얻기 위해 필요한 데이터 포인트의 개수가 적으므로 출입영역에 대한 학습시간을 단축할 수 있다.

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.170-178
• /
• 1994

The nearest neighbor classification rule is widely used because it is not only simple but the error rate is asymptotically less than twice Bayes theoretical minimum error. But the method basically use the whole training patterns as the reference vectors. so that both storage and classification time increase as the number of training patterns increases. LVQ(Learning Vector Quantization) resolved this problem by training the reference vectors instead of just storing the whole training patterns. But it is a heuristic algorithm which has no theoretic background there is no terminating condition and it requires a lot of iterations to get to meaningful result. This paper is to propose a new training method of the reference vectors. which minimize the given error function. The nearest neighbor network,the network version of the nearest neighbor classification rule is proposed. The network is funtionally identical to the nearest neighbor classification rule is proposed. The network is funtionally identical to the nearest neighbor classification rule and the reference vectors are represented by the weights between the nodes. The network is trained to minimize the error function with respect to the weights by the steepest descent method. The learning algorithm is derived and it is shown that the proposed method can adjust more reference vectors than LVQ in each iteration. Experiment showed that the proposed method requires less iterations and the error rate is smaller than that of LVQ2.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권1호
• /
• pp.74-96
• /
• 2023

At present, the smart grid has become one of the indispensable infrastructures in people's lives. As a commonly used communication method, wireless communication is gradually, being widely used in smart grid systems due to its convenient deployment and wide range of serious challenges to security. For the insecurity of the schemes based on large integer factorization and discrete logarithm problem in the quantum environment, an identity-based key management scheme for smart grid over lattice is proposed. To assure the communication security, through constructing intra-cluster and inter-cluster multi-hop routing secure mechanism. The time parameter and identity information are introduced in the relying phase. Through using the symmetric cryptography algorithm to encrypt improve communication efficiency. Through output the authentication information with probability, the protocol makes the private key of the certification body no relation with the distribution of authentication information. Theoretic studies and figures show that the efficiency of keys can be authenticated, so the number of attacks, including masquerade, reply and message manipulation attacks can be resisted. The new scheme can not only increase the security, but also decrease the communication energy consumption.