• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.53-58
• /
• 2012

With a game-theoretic view, p-persistence slotted ALOHA is structured as a non-cooperative game, in which a Nash equilibrium is sought to provide a value for the probability of attempting to deliver a packet. An expression of Nash equilibrium necessarily includes the number of active outer stations, which is hardly available in many practical applications. In this paper, we thus propose a Bayesian scheme of predicting the number of active outer stations prior to deciding whether to attempt to deliver a packet or not. Despite only requiring the minimal information that an outer station is genetically able to acquire by itself, the Bayesian scheme demonstrates the competitive predicting performance against a method which depends on heavy information.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.2
• /
• pp.41-51
• /
• 1983

An efficient method for the desist of active filters from doubly terminated lossless ladder type passive filters is presented. This technique is based on the linear transformation of network variables from the voltage-current domain to a new domain for the active realization of the passive networks. The method developed herein applies the linear transformation to a ladder building block which contains both a shunt and a series reactive arm, resulting in the minimization of the number of operational amplifiers required for the active realization. The validity and efficiency of this method are verified by the design of the 8th-order Chebyshev low-pass filter followed by the measurement of its frequency characteristics which fairly agree with the theoretic ones.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.6
• /
• pp.543-551
• /
• 2020

In this paper, we introduce a method to improve the accuracy of the length estimation of targets using a radar. The HRRP (High Resolution Range Profile) obtained from a received radar signal represents the one-dimensional scattering characteristics of a target, and peaks of the HRRP means the scattering centers that strongly scatter electromagnetic waves. By using the extracted scattering centers, the downrange length of the target, which is the length in the RLOS (Radar Line of Sight), can be estimated, and the real length of the target should be estimated considering the angle between the target and the RLOS. In order to improve the accuracy of the length estimation, parametric estimation methods, which extract scattering centers more exactly than the method using the HRRP, can be used. The parametric estimation method is applied after the number of scattering centers is determined, and is thus greatly affected by the accuracy of the number of scattering centers. In this paper, in order to improve the accuracy of target length estimation, the number of scattering centers is estimated by using AIC (Akaike Information Criteria), MDL (Minimum Descriptive Length), and GLE (Gerschgorin Likelihood Estimators), which are the source number estimation methods based on information theoretic criteria. Using the ESPRIT algorithm as a parameter estimation method, a length estimation simulation was performed for simple target CAD models, and the GLE method represented excellent performance in estimating the number of scattering centers and estimating the target length.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.03a
• /
• pp.163-181
• /
• 1997

This dissertation provides a theroetic 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 in the real world network environment . The dissertation provides a thorough 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 procedure to make analysis plans of the firewall configuration. Based on the above investigation and analysis , this dissertation provides two approaches to network security, which address a number of issues both at the network and at application level. At the network level. a new methdo 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 exlored which employs security software , Firewall-1, on Bastion host. To demonstrate the feasibility and the effectiveness of the proposed methodologes, a prototype implementation is made. The experiment result shows that the screen router employing the proposesed anti-IP spoofing method at the network level is effective enough for the system to remain secure without being invaded by any illegarl packets entering from external hackers. Meanwhile , at the application level. the proposed software approach employing Firewall -1 is proved to be robust enough to provent hackings from the outer point to point protocol connection. Theoretically, it is not possible to provide complete secuirty to the network system, because the network security involove a number of issues raised from low level network equipments form high level network protocol. The result in this 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.3
• /
• pp.1439-1444
• /
• 2013

Recently, as the use of the applications like online banking and stock trading is increasing by the rapid development of the network, security of data content is becoming more and more important. Accordingly, public key or symmetric key encryption algorithm is widely used in open networks such as the internet for the protection of data. Generally, public key cryptographic systems is based on two famous number theoretic problems namely factoring or discrete logarithm problem. So, public key cryptographic systems is relatively slow compared to symmetric key cryptography systems. Among public key cryptographic systems, the advantage of ECC compared to RSA is that it offers equal security for a far smaller key. For this reason, ECC is faster than RSA. In this paper, we propose a efficient key generation method for elliptic curve cryptography system based on the real number field.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2427-2445
• /
• 2016

In contrast to traditional "store-and-forward" routing mechanisms, network coding offers an elegant solution for achieving maximum network throughput. The core idea is that intermediate network nodes linearly combine received data packets so that the destination nodes can decode original files from some authenticated packets. Although network coding has many advantages, especially in wireless sensor network and peer-to-peer network, the encoding mechanism of intermediate nodes also results in some additional security issues. For a powerful adversary who can control arbitrary number of malicious network nodes and can eavesdrop on the entire network, cryptographic signature schemes provide undeniable authentication mechanisms for network nodes. However, with the development of quantum technologies, some existing network coding signature schemes based on some traditional number-theoretic primitives vulnerable to quantum cryptanalysis. In this paper we first present an efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols. In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. Our scheme has many advantages, such as supporting multi-source networks, low computational complexity and low communication overhead.

• Journal of KIISE:Software and Applications
• /
• v.29 no.8
• /
• pp.595-603
• /
• 2002

Only a few studies have been conducted on how to select multiple classifiers from the pool of available classifiers for showing the good classification performance. Thus, the selection problem if classifiers on how to select or how many to select still remains an important research issue. In this paper, provided that the number of selected classifiers is constrained in advance, a variety of selection criteria are proposed and applied to tile construction of multiple classifier systems, and then these selection criteria will be evaluated by the performance of the constructed multiple classifier systems. All the possible sets of classifiers are trammed by the selection criteria, and some of these sets are selected as the candidates of multiple classifier systems. The multiple classifier system candidates were evaluated by the experiments recognizing unconstrained handwritten numerals obtained both from Concordia university and UCI machine learning repository. Among the selection criteria, particularly the multiple classifier system candidates by the information-theoretic selection criteria based on conditional entropy showed more promising results than those by the other selection criteria.

• Journal of The Korean Association of Information Education
• /
• v.9 no.1
• /
• pp.69-76
• /
• 2005

The researcher conducts the following research to correctly identify the gifted children of science information. First, the researcher makes sufficient theoretic research on gifted children for the sake of definition and identification of the gifted children of information science, and reconstructed the identification principles, factors and procedures of the gifted children of information science on the basis of those of the gifted children of math and science the theories of a number of scholars and presented new methods of identifying new gifted children of information science. Second, the researcher set the identification procedures of the gifted children of information science and the relevant content and conducted the identification of gifted children through the observation and evaluation of sixth graders through three stages. Third, the researcher compares and analyzed the selected gifted children based on the identification procedures and ordinary groups of students excellent in math and science in terms of task achievement and looked into validity.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.854-859
• /
• 2017

Caching popular videos in the storage of base stations is an efficient method to reduce the transmission latency. This paper proposes an incentive proactive cache mechanism in the wireless network to motivate the content providers (CPs) to participate in the caching procedure. The system consists of one/many Infrastructure Provider (InP) and many CPs. The InP aims to define the price it charges the CPs to maximize its revenue while the CPs compete to determine the number of files they cache at the InP's base stations (BSs). We conceive this system within the framework of Stackelberg game where InP is considered as the leader and CPs are the followers. By using backward induction, we show closed form of the amount of cache space that each CP renting on each base station and then solve the optimization problem to calculate the price that InP leases each CP. This is different from the existing works in that we consider the non-uniform pricing scheme. The numerical results show that InP's profit in the proposed scheme is higher than in the uniform pricing.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.149-158
• /
• 2012

Proposed is a hybrid randomizing function using two asymptotically optimal randomizing functions: Elias function and Peres function. Randomizing function is an mathematical abstraction of producing a uniform random bits from a source of randomness with bias. It is known that the output rate of Elias function and Peres function approaches to the information-theoretic upper bound. Especially, for each fixed input length, Elias function is optimal. However, its computation is relatively complicated and depends on input lengths. On the contrary, Peres function is defined by a simple recursion. So its computation is much simpler, uniform over the input lengths, and runs on a small footprint. In view of this tradeoff between computational complexity and output efficiency, we propose a hybrid randomizing function that has strengths of the two randomizing functions and analyze it.