• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.9
• /
• pp.643-651
• /
• 2001

Fused vertical directional coupler switches (FVCSs) with switching operation induced section (SOIS) and extinction ratio enhanced section (ERES) are proposed. In these FVCSs, switching operation is achieved by changing the refractive indices of both cores in SOIS and improvement of extinction ratios larger than 30dB for both cross and bar states is achieved by controlling the asymmetry of refractive indices between both cores in ERES. In addition, the design guidelines to have high extinction ratios larger than 30dB with large tolerances of the refractive index of cores are presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.41-60
• /
• 2018

Recently, road traffic congestion is becoming a serious urban phenomenon, leading to massive adverse impacts on the ecology and economy. Therefore, solving this problem has drawn public attention throughout the world. One new promising solution is to take full advantage of vehicular ad hoc networks (VANETs). In this study, we propose a new traffic congestion detection and quantification method based on vehicle clustering and fuzzy assessment in VANET environment. To enhance real-time performance, this method collects traffic information by vehicle clustering. The average speed, road density, and average stop delay are selected as the characteristic parameters for traffic state identification. We use a comprehensive fuzzy assessment based on the three indicators to determine the road congestion condition. Simulation results show that the proposed method can precisely reflect the road condition and is more accurate and stable compared to existing algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2189-2196
• /
• 2016

This paper proposes a new finite control set-model predictive control (FCS-MPC) method for induction motors. In the method, the reference state that satisfies the given torque and rotor flux requirements is derived. Cost indices for the FCS-MPC are defined using the state tracking error, and a linear matrix inequality is formulated to obtain a proper weighting matrix for the state tracking error. The on-line procedure of the proposed FCS-MPC comprises of two steps: select the output voltage vector of the two level inverter minimizing the cost index and compute the optimal modulation factor of the minimizing output voltage vector in order to reduce the state tracking error and torque ripple. The steady state tracking error is removed by using an integrator to adjust the reference state. The simulation and experimental results demonstrated that the proposed FCS-MPC shows good torque, rotor flux control performances at different rotating speeds.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2674-2697
• /
• 2019

Identity authentication is a crucial line of defense for network security, and passwords are still the mainstream of identity authentication. So far trawling password attacking has been extensively studied, but the research related with personal information is always sporadic. Probabilistic context-free grammar (PCFG) and Markov chain-based models perform greatly well in trawling guessing. In this paper we propose a systematic targeted attacking model based on structure partition and string reorganization by migrating the above two models to targeted attacking, denoted as TG-SPSR. In structure partition phase, besides dividing passwords to basic structure similar to PCFG, we additionally define a trajectory-based keyboard pattern in the basic grammar and introduce index bits to accurately characterize the position of special characters. Moreover, we also construct a BiLSTM recurrent neural network classifier to characterize the behavior of password reuse and modification after defining nine kinds of modification rules. Extensive experimental results indicate that in online attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 275%, and respectively outperforms its foremost counterparts, Personal-PCFG, TarGuess-I, by about 70% and 19%; In offline attacking, TG-SPSR outperforms traditional trawling attacking algorithms by average about 90%, outperforms Personal-PCFG and TarGuess-I by 85% and 30%, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4552-4567
• /
• 2014

A (n,t,n) secret sharing scheme is to share a secret among n group members, where each member also plays a role of a dealer,and any t shares can be used to recover the secret. In this paper, we propose a strong (k,t,n) verifiable multi-secret sharing scheme, where any k out of n participants operate as dealers. The scheme realizes both threshold structure and adversary structure simultaneously, and removes a trusted third party. The secret reconstruction phase is performed using an additive homomorphism for decreasing the storage cost. Meanwhile, the scheme achieves the pre-verification property in the sense that any participant doesn't need to reveal any information about real master shares in the verification phase. We compare our proposal with the previous (n,t,n) secret sharing schemes from the perspectives of what kinds of access structures they achieve, what kinds of functionalities they support and whether heavy storage cost for secret share is required. Then it shows that our scheme takes the following advantages: (a) realizing the adversary structure, (b) allowing any k out of n participants to operate as dealers, (c) small sized secret share. Moreover, our proposed scheme is a favorable candidate to be used in many applications, such as secure multi-party computation and privacy preserving data mining, etc.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.559-564
• /
• 2003

Recently, particle filters have attracted attentions for nonlinear state estimation. They evaluate a posterior probability distribution of the state variable based on observations in simulation using so-called importance sampling. However, degeneracy phenomena in the importance weights deteriorate the filter performance. A new filter, Evolution Strategies Based Particle Filter, is proposed to circumvent this difficulty and to improve the performance. Numerical simulation results illustrate the applicability of the proposed idea.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.114-123
• /
• 2006

We present in this paper the methodology for automatic generation of OWL-S service model ontology along with the results and issues. First, we extract information related to atomic services and their properties such as IOPE from the UML class diagram, and retrieve information related to the composition of services from the UML state-chart diagram. Then, the XSLT applications utilize the acquired information to generate the OWL-S service model ontology through the predefined mappings between OWL-S constructs for composite services and UML state-chart primitives. For the justification of generated service ontology, several validation checks are performed. Our service ontology generation method is general and fully automatic, as well as effective, in that it is achieved in an environment familiar to developers, and information needed to generate service ontology is provided necessarily during service development. It is also noticeable to facilitate representing the condition with GUI rather than a complex language such as OCL.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.135-138
• /
• 2023

In this paper, we study real-time error in the context of monitoring a binary information source through a delay system. To derive the average real-time error, we model the delay system as a discrete time Geo/D/1/1 queueing model. Using a discrete time three-dimensional Markov chain with finite state space, we analyze the queueing model. We also perform some numerical analysis on various system parameters: state transition probabilities of binary information source; transmission times; and transmission frequencies. When the state changes of the information source are positively correlated and negatively correlated, we investigate the relationship between transmission time and transmission frequency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.317-320
• /
• 2022

This paper studies real-time error in the context of monitoring a symmetric binary information source over a delay system. To obtain the average real-time error, the delay system is modeled and analyzed as a discrete time Markov chain with a finite state space. Numerical analysis is performed on various system parameters such as state transition probabilities of information source, transmission times, and transmission frequencies. Given state transition probabilities and transmission times, we investigate the relationship between the transmission frequency and the average real-time error. The results can be used to investigate the relationship between real-time errors and age of information.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.06a
• /
• pp.367-371
• /
• 2002

I construct a chaotically driven contraction system having some analogy with the information transfer mechanism in the brain system especially from CA1 cell to CA3 cell known from the empirical result. And I consider the properties of the response system on a state space according to the external input into the drive neuron by observing the fractal hierarchical structure. Then I induce the relation between the information about state transition of the chaotic time series and the spatial information on a fractal attractor to confirm the possibility of encoding of time series data to spatial information.