• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.26-35
• /
• 2011

In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.5
• /
• pp.441-446
• /
• 2020

In this paper, we propose the α-Feature Map Scaling (α-FMS) method which extends the FMS method that was designed to enhance the discriminative power of feature maps of deep neural networks in Speaker Verification (SV) systems. The FMS derives a scale vector from a feature map and then adds or multiplies them to the features, or sequentially apply both operations. However, the FMS method not only uses an identical scale vector for both addition and multiplication, but also has a limitation that it can only add a value between zero and one in case of addition. In this study, to overcome these limitations, we propose α-FMS to add a trainable parameter α to the feature map element-wise, and then multiply a scale vector. We compare the performance of the two methods: the one where α is a scalar, and the other where it is a vector. Both α-FMS methods are applied after each residual block of the deep neural network. The proposed system using the α-FMS methods are trained using the RawNet2 and tested using the VoxCeleb1 evaluation set. The result demonstrates an equal error rate of 2.47 % and 2.31 % for the two α-FMS methods respectively.

• Fire Science and Engineering
• /
• v.21 no.4
• /
• pp.1-11
• /
• 2007

This study aims to investigate, review, and summarize the definition, development, and applications of "percent agent in pipe", "percent of agent in pipe" which is used as a key factor in testing and evaluating the performance of gaseous fire extinguishing agents, including Halon 1301 and $CO_2$. This study also analyzes and compares the local and international standards on testing and evaluating the performance of gaseous fire extinguishing systems, as well as the results of system performance tests conducted as a part of performance evaluation and approval programs for gaseous fire extinguishing systems, especially, Korean Gaseous Fire Extinguishing System Performance Approval Program called KFI Approval. Percent agent in pipe was defined first in NFPA 12A, Standard on Halon 1301 Fire Extinguishing Systems, dating back to the 1970's. After the phaseout of Halon 1301 systems in 1994 in the developed countries, the percent agent in pipe has been widely used in Halon 1301 alternative clean agent fire extinguishing systems, both halocarbon clean agent systems and inert gas clean agent systems, as an essential criterion to assure the system design accuracy, determine the limitations and performance of a system, and to predict the system performance results accurately, especially, in association with their system flow calculations. Underwriters Laboratories has their own standards such as UL 2127 and 2166 applying percent agent in pipe in testing and evaluating the performance of clean agent fire extinguishing systems. As a part of a system performance test and approval program called KFI Approval System, Korea also has started to apply the percent agent in pipe as a key factor to test, evaluate, and approve the performance of gaseous fire extinguishing systems, including both high and low pressure $CO_2$ systems, from the early 2000's. This study outlines and summarizes the relevant UL and KFI standards and also describes the actual test resultant data, including the maximum percents of agent in pipe for gaseous fire extinguishing systems. As evidenced in lots of tests conducted as a part of the system performance test and approval programs like KFI Approval System, it has been proven that the percent agent in pipe may work as a key factor in testing, evaluating, and determining the limitations and performance of gaseous fire extinguishing systems, especially compared with the hydraulic flow calculations of computer design programs of gaseous fire extinguishing systems, and will remain as such in the future. As one thing to note, however, there are some difficulties in using the unified percent agent in pipe to determine the maximum lengths of pipe networks for gaseous fire extinguishing systems, because the varying definitions used by some of the flow calculations (not in accordance with NFPA 12A definition) make it impossible to do any direct comparison of pipe lengths based on percent agent in pipe.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.6
• /
• pp.53-67
• /
• 2002

The multimedia synchronization is one of the key issues to be resolved in order to provide a good quality of multimedia related services, such as Video on Demands(VoD), Lecture on Demands(LoD), and tele-conferences. In this paper, we introduce an adaptive multimedia synchronization algorithm using the level of buffers and load of servers, which are modeled and analyzed by ExSpect, a Petri net based simulation tool. In the proposed algorithm, the audio and video buffers are divided to 5 different levels, and the pre-defined play-out speed controller tries to make the buffer level to be normal in different temporal relations between multimedia streams using buffer levels and server loads. Because each multimedia packet is played by the pre-defined play-out speed, the media data can be reproduced within the permissible limit of errors while preserving the level of buffers to be normal. The proposed algorithm is able to handle and support various communication restrictions between providers and users, and offers little jitter play-out to many users in networks with the limited transmission capability. The performance of the developed algorithm is analyzed in various network conditions using a Petri net simulation tool.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.2D
• /
• pp.295-302
• /
• 2011

Ubiquitous is an information communication environment which peoples could connect on network without being conscious of the network and computer condition at anytime and anywhere. Presently, advanced technology, digital cities and eco-friendly cities using Ubiquitous technology are being focused through out the world. As recent information industry and communication technology have developed remarkably, studies on intelligent structures and structural maintenance methods by combining a general idea of connecting all objects on network by interpolating computers which is called Ubiquitous Computing, and USN(Ubiquitous Sensor Network) are being attempted. In this paper, a basic experiment on penetration of RF(Radio Frequency) sensor nodes using an experimental sample setting concrete and reinforcing bar as variables is studied to estimate the possibility of applying wireless sensor networks in structures. The spring of reinforcing bars, concrete thickness, intensity of radio frequency were set up as variables, transmitting and receiving distance were checked vertically and horizontally. Moreover, Spectrum Analyzer was used for checking the magnitude of the frequency used in order to measure the reduction of radio wave exactly. The radio wave reduction was numerically analyzed, and the influence of the wavelength was analysed as well. As a result, the penetration depth in concrete without reinforcing bars was 45cm, and in reinforced concretes which reinforcing bars placed at spacing of 5cm and 15cm, the penetration depth were 37cm and 45cm each. No influence on radio wave penetration depth were found when the spacing of reinforcing bars in the reinforced concrete structures becomes over 15cm.

• Journal of Convergence Society for SMB
• /
• v.3 no.2
• /
• pp.51-56
• /
• 2013

Real-time processing of sensor data network, is one of the important factors. Each node in the detected data are required to be transmitted within a certain time since the accurate processing is possible. Thus, the data nodes are successfully delivered within a specified time, it is very important to check whether the. Recently more and more accurate real-time embedded systems are reliable and haejyeoseo been able to provide sophisticated services. Because of the inherent complexity of embedded systems in the physical world and the difficulty of predicting the difficulty of a safe design constraints on the runtime violation of system as to cause unexpected causes. Each node data in time detected by the time required to be passed in the appropriate processing is possible because the data transfer time in this paper, the monitoring of the sensor network through a node are allowed to exist within the time range and transmits data to the server Analysis of the data transfer time for checking whether the system was implemented. Implementation of the data transmission time to the process for analyzing and presenting, according to the procedure suggested by the transit time required for analysis a time difference analysis method, a data collection method and a data transmission time and transmission time calculating method presented.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.3 s.303
• /
• pp.17-28
• /
• 2005

Recently intelligent characters in computer games have been an important element more and more because they continually stimulate gamers' interests. As a typical method for implementing such intelligent characters, neural networks have been used for training action patterns of opponent's characters and game rules. However, some of the game rules can be abruptly changed and action properties of garners in on-line game environments are quite different according to gamers. In this paper, we address how a neural network adapts to those environmental changes. Our adaptation solution includes two components: an individual adaptation mechanism and a group adaptation mechanism. With the individual adaptation algorithm, an intelligent character steadily checks its game score, assesses the environmental change with taking into consideration of the lastly earned scores, and initiates a new learning process when a change is detected. In multi-user games, including massively multiple on-line games, intelligent characters confront diverse opponents that have various action patterns and strategies depending on the gamers controlling the opponents. The group adaptation algorithm controls the birth of intelligent characters to conserve an equilibrium state of a game world by using a genetic algorithm. To show the performance of the proposed schemes, we implement a simple fighting action game and experiment on it with changing game rules and opponent characters' action patterns. The experimental results show that the proposed algorithms are able to make intelligent characters adapt themselves to the change.

• Journal of IKEEE
• /
• v.15 no.4
• /
• pp.354-362
• /
• 2011

One of the unsolved problems in Artificial Neural Networks is related to the capacity of a neural network. This paper presents a CoreNet which has a multi-leveled input and a multi-leveled output as a 2-layered artificial neural network. I have suggested an equation for calculating the capacity of the CoreNet, which has a p-leveled input and a q-leveled output, as $a_{p,q}=\frac{1}{2}p(p-1)q^2-\frac{1}{2}(p-2)(3p-1)q+(p-1)(p-2)$. With an odd value of p and an even value of q, (p-1)(p-2)(q-2)/2 needs to be subtracted further from the above equation. The simulation model 1(3)-1(6) has 3 levels of an input and 6 levels of an output with no hidden layer. The simulation result of this model gives, out of 216 possible functions, 80 convergences for the number of implementable function using the cot(x) input leveling method. I have also shown that, from the simulation result, the two diverged functions become implementable by precalculating the weight values. The simulation result and the precalculation of the weight values give the same result as the above equation in the total number of implementable functions.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.75-81
• /
• 2003

User authentication, including confidentiality, integrity over untrusted networks, is an important part of security for systems that allow remote access. Using human-memorable Password for remote user authentication is not easy due to the low entropy of the password, which constrained by the memory of the user. This paper presents a new password authentication and key agreement protocol suitable for authenticating users and exchanging keys over an insecure channel. The new protocol resists the dictionary attack and offers perfect forward secrecy, which means that revealing the password to an attacher does not help him obtain the session keys of past sessions against future compromises. Additionally user passwords are stored in a form that is not plaintext-equivalent to the password itself, so an attacker who captures the password database cannot use it directly to compromise security and gain immediate access to the server. It does not have to resort to a PKI or trusted third party such as a key server or arbitrator So no keys and certificates stored on the users computer. Further desirable properties are to minimize setup time by keeping the number of flows and the computation time. This is very useful in application which secure password authentication is required such as home banking through web, SSL, SET, IPSEC, telnet, ftp, and user mobile situation.