• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.165-168
• /
• 2013

The USA has declared the cyber space as the 5th battlefield following land, sea, air, and space. In contrast to physical wars, in national cyberwarfare differentiation between friend and foe is impossible, and the boundaries between the lines of attack and defense are obscure. Therefore, to perform national cyberwarfare, credibility of all command delivery information performed in the cyber space should be confirmed. In this paper, the authors have determined the commands performed in national cyberwarfare, granted authorized IPv6 in space including the earth, moon and Mars for information credibility, and used LINK joints loaded with stealth functions to secure the credibility of command information.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.83-93
• /
• 2002

To improve the performance of estimation, the research that uses additional information addition to traffic count and target OD with additional survey cost have been studied. The purpose of this paper is to improve the performance of OD estimation by reducing the feasible solutions with cost-efficiently additional information addition to traffic counts and target OD. For this purpose, we Propose the OD estimation method with sample link use proportion as additional information. That is, we obtain the relationship between OD trip and link flow from sample link use proportion that is high reliable information with roadside survey, not from the traffic assignment of target OD. Therefore, this paper proposes OD estimation algorithm in which the conservation of link flow rule under the path-based non-equilibrium traffic assignment concept. Numerical result with test network shows that it is possible to improve the performance of OD estimation where the precision of additional data is low, since sample link use Proportion represented the information showing the relationship between OD trip and link flow. And this method shows the robust performance of estimation where traffic count or OD trip be changed, since this method did not largely affected by the error of target OD and the one of traffic count. In addition to, we also propose that we must set the level of data precision by considering the level of other information precision, because "precision problem between information" is generated when we use additional information like sample link use proportion etc. And we Propose that the method using traffic count as basic information must obtain the link flow to certain level in order to high the applicability of additional information. Finally, we propose that additional information on link have a optimal counting location problem. Expecially by Precision of information side it is possible that optimal survey location problem of sample link use proportion have a much impact on the performance of OD estimation rather than optimal counting location problem of link flow.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.46-53
• /
• 2007

The link-fault recovery in the normal Ethernet bridged networks has relied on the Spanning Tree Protocol(STP) or Rapid STP. However, STP can not offer fast error recovery which is needed real-time services such as aircraft. In this paper, we compare automatic protection switching(APS) providing fault-tolerant function in the BcN back bone system with Avionic Full Duplex Switched Ethernet(AFDX) which is recently equipped in the A380 for Airbone Databuses. Also, we propose a link-bypass scheme for improving fault-tolerant performance of the AFDX by connecting switches and bypass fault section when a fault is originated on the link. For comparing and verifying the performance of proposed scheme, we simulated Ethernet, AFDX, APS and proposed AFDX with link-bypass scheme using NS-2. The proposed AFDX with link-bypass scheme can be applied to aircrafts, BcN backbone networks and industrial automatic networks.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.75-82
• /
• 2015

Major corporations and portals have implemented a link server that connects Content Management Systems (CMS) to the physical address of content in a database (DB) to support efficient content use in web-based environments. In particular, a link server automatically connects the physical address of content in a DB to the content URL shown through a web browser screen, and re-connects the URL and the physical address when either is modified. In recent years, the number of users of digital content over the web has increased significantly because of the advent of the Big Data environment, which has also increased the number of link validity checks that should be performed in a CMS and a link server. If the link validity check is performed through an existing URL-based sequential method instead of petabyte or even etabyte environments, the identification rate of dead links decreases because of the degradation of validity check performance; moreover, frequent link checks add a large amount of workload to the DB. Hence, this study is aimed at providing a link server that can recognize URL link deletion or addition through analysis on the B-tree-based Information Identifier count per interval based on a large amount of URLs in order to resolve the existing problems. Through this study, the dead link check that is faster and adds lower loads than the existing method can be performed.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.57-75
• /
• 2015

In evaluating the performance of a dual-hop wireless link, the effects of large and small scale fading has to be considered. To overcome this fading effect, several schemes, such as multiple-input multiple-output (MIMO) with orthogonal space time block codes (OSTBC), different combining schemes at the relay and receiving end, and orthogonal frequency division multiplexing (OFDM) are used in both the transmitting and the relay links. In this paper, we first make compare the performance of a two-hop wireless link under a different combination of space diversity in the first and second hop of the amplify-and-forward (AF) case. Our second task in this paper is to incorporate the weak signal of a direct link and then by applying the channel model of two random variables (one for a direct link and another for a relayed link) we get very impressive result at a low signal-to-noise ratio (SNR) that is comparable with other models at a higher SNR. Our third task is to bring other three schemes under a two-hop wireless link: use of transmit antenna selection (TAS) on both link with weak direct link, distributed Alamouti scheme in two-hop link and single relay antenna with OFDM subcarrier. Finally, all of the schemes mentioned above are compared to select the best possible model. The main finding of the paper is as follows: the use of MIMO on both hops but application TAS on both links with weak direct link and the full rate OFDM with the sub-carrier for an individual link provide a better result as compared to other models.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.247-253
• /
• 2008

Web 2.0 and Semantic Web technology will be merged to be a next generation Web that leads presentation-oriented Web to data-centric Web. In the next generation Web. semantic processing. Web Platform, and data fusion are most important technology factors. Resolving the Link Rot is the one of the essential technologies to enable these features. The Link Rot causes not only simple annoyances to users but also more serious problems including data integrity. loss of knowledge. breach of service. and so forth. We have suggested a new XRI-based persistent Web link architecture to cure the Link Rot that has been considered as a deep-seated Problem of the Web. The Proposed architecture is based on the XRI suggested by OASIS and it is designed to support a persistent link by using URL rewriting. Since the architecture is designed as a server-side technology, it is superior to existing research especially in Interoperability. Transparency and Adoptability. In addition to this, the architecture provides a metadata identification to be used fer context-aware link resolution.

• Proceedings of the KIPE Conference
• /
• 2004.07a
• /
• pp.6-10
• /
• 2004

This paper newly proposes the SRM drive system based on DC-link current information, from which the phase currents can be estimated in accuracy and also they can be used in driving SRM instead of the phase currents. Comparing to the general drive system based on the phase current information, it is verified through the simulation(which are peformed by RMxprt and Simplorer) that the proposed SRM drive system has the good performance in dynamic and steady-state responses of the speed control. Using the DC-link current information, all of the multi-phase currents can be easily estimated in driving the SRM.

• Proceedings of the KIEE Conference
• /
• 2008.10c
• /
• pp.237-239
• /
• 2008

본 논문에서는 Matlab Simulink을 사용하여 고성능 BLDC(Brushless DC) 전동기 드라이브를 위한 DC Link 가변 전압 인버터 모델링을 제안한다. 다른 프로그램을 이용한 BLDC 전동기 시뮬레이션은 하드웨어적인 구현에는 유리하지만 처리속도가 늦고, 계산상의 오차가 크게 발생하는 단점이 있다. 이러한 단점을 보완하기 위해 수식기반인 Matlab Simulink를 활용하여 보다 정확하고 연산 속도가 빠른 시뮬레이션을 수행하였다. 제안된 모델은 승압 및 강압모드가 가능한 2-스위치 buck-boost 컨버터와 6-스위치 인버터 및 BLDC 전동기로 구성되고, 시뮬레이션을 통하여 전동기의 속도에 따른 DC Link 전압의 가변을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.1
• /
• pp.319-333
• /
• 2022

In order to enhance system energy efficiency, bidirectional link resource allocation strategy in GFDM-based multiuser SWIPT systems is proposed. In the downlink channel, each SWIPT user applies power splitting (PS) receiver structure in information decoding (ID) and non-linear energy harvesting (EH). In the uplink channel, information transmission power is originated from the harvested energy. An optimization problem is constructed to maximize weighted sum ID achievable rates in the downlink and uplink channels via bidirectional link power allocation as well as subcarriers and subsymbols scheduling. To solve this non-convex optimization problem, Lagrange duality method, sub-gradient-based method and greedy algorithm are adopted respectively. Simulation results show that the proposed strategy is superior to the fixed subcarrier scheme regardless of the weighting coefficients. It is superior to the heuristic algorithm in larger weighting coefficients scenario.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.760-766
• /
• 2012

In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.