• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.23-31
• /
• 2003

Link-based search engines generate the rank using linked information of related web-documents . HITS(Hypertext Internet Topic Search), representative ranking evaluation algorithm using a special feature of web-documents based on such link, evaluates the importance degree of related pages from linked information and presents by ranking information. Problem of such HITS algorithm only is considered the link frequency within documents and depends on the set of web documents as input value. In this paper, we design the search agent based on better HITS algorithm according to advanced suitability between query and search-result in the set of given documents from link-based web search engine. It then complements locality of advanced search performance and result.

• Journal of the Korean Statistical Society
• /
• v.26 no.2
• /
• pp.261-276
• /
• 1997

In the context of binary response regression, the problem of constructing Bayesian goodness-of-link test for testing logit link versus probit link is considered. Based upon the well known facts that cdf of logistic variate .approx. cdf of $t_{8}$/.634 and, as .nu. .to. .infty., cdf of $t_{\nu}$ approximates to that of N(0,1), Bayes factor is derived as a test criterion. A synthesis of the Gibbs sampling and a marginal likelihood estimation scheme is also proposed to compute the Bayes factor. Performance of the test is investigated via Monte Carlo study. The new test is also illustrated with an empirical data example.e.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.11 no.4
• /
• pp.307-312
• /
• 2006

This paper proposes the SRM drive system, which accurately estimates the phase currents from the DC-link current to drive SRM instead of detecting the three-phase currents. In addition, the detecting circuit of DC-link current is also proposed to increase the resolution and decrease the off-set influence. Comparing with the general drive system based on the phase current, it is verified through the experiments that the proposed SRM drive system based on the DC-link current has the good performance in steady-state response of the speed control. Using the DC-link current, all of the 3-phase currents can be easily estimated for driving the SRM.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.439-441
• /
• 2005

본 논문에서는 센서네트워크에서 Link Quality를 이용하여 코드와 같은 대용량의 데이터를 적을 에너지로 다르게 전파하는 LQNP 기법을 제안한다. 센서 네트워크에서 코드의 전파 방법에 대한 기존 연구들은 Link Quality를 고려하지 않고 코드를 전파하는 정책을 쓰고 있다. 패킷 손실이 많은 센서네트워크에서 이 방법은 적합하지 않기 때문에 본 논문에서는 패킷 손실이 많은 상황에서도 효율적인 코드 전파를 수행할 수 있도록 Link Quality를 이용하는 방법을 살펴본다.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.395-401
• /
• 2008

In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and link state. The information is stored in Link State Database (LSDB) located in each router and managed. If link states information is changed, routers inform their neighbor of link state information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual link state information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.11a
• /
• pp.498-502
• /
• 2004

In a link-motion mechanism, numerous links are interconnected and each link executes a constrained motion at a high speed. Due to the complicated constrained motions of the constituent links, dynamic unbalance forces and moments are generated and transmitted to the main frame. Therefore unwanted vibration is produced. This degrades productivity and precise work. Based on constrained multi-body dynamics, the kinematic analysis is carried out to enable design changes to be made. This will provide the fundamental information for significantly reducing dynamic unbalance forces and moments which are transmitted to the main frame. In this work, a link-motion punch press is selected as an example of a link-motion mechanism. To calculate the mass and inertia properties of every link comprising a link-motion punch press, 3-dimensional CAD software is utilized. The main issue in this work is to eliminate the first-order unbalance force and moment in a link-motion punch press. The mass, moment of inertia link length, location of the mass center in each link have a great impact on the degree of dynamic balancing which can be achieved maximally. Achieving good dynamic balancing in a link motion punch press is quite essential fur reliable operation at high speed.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.8
• /
• pp.63-72
• /
• 2017

In this paper, we propose a security architecture for HDLC-based T4 class common data link. The common data links are composed of point-to-point, multi-to-point, and point-to-multi mode. For multi-to-point mode, one node has a bundle of point-to-point links with different end-point on the other side of the links. Thus multi-to-point mode can be considered as a bundle of point-to-point mode. Point-to-multi mode is broadcasting link. For point-to-point mode we adopted robust security network scheme to establish a secure data link, and for multi-to-point mode we use broadcast encryption scheme based on ID-based cryptography to distribute encryption key for broadcasting message encryption. We also included MACsec technology for point-to-point data link security. Computational and communicational complexity analysis on the broadcast encryption have been done.

• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.58-67
• /
• 2016

With the large amount of complex network data that is increasingly available on the Web, link prediction has become a popular data-mining research field. The focus of this paper is on a link-prediction task that can be formulated as a binary classification problem in complex networks. To solve this link-prediction problem, a sparse-classification algorithm called "Truncated Kernel Projection Machine" that is based on empirical-feature selection is proposed. The proposed algorithm is a novel way to achieve a realization of sparse empirical-feature-based learning that is different from those of the regularized kernel-projection machines. The algorithm is more appealing than those of the previous outstanding learning machines since it can be computed efficiently, and it is also implemented easily and stably during the link-prediction task. The algorithm is applied here for link-prediction tasks in different complex networks, and an investigation of several classification algorithms was performed for comparison. The experimental results show that the proposed algorithm outperformed the compared algorithms in several key indices with a smaller number of test errors and greater stability.

• Current Optics and Photonics
• /
• v.3 no.3
• /
• pp.210-214
• /
• 2019

The allowable path-deviation time of aircraft in a free-space optical communication system has been estimated from various trajectories, using different values of aircraft speeds and turn rates. We assumed the existence of a link between the aircraft and a ground base station. First, the transmitter beam's divergence angle was calculated through two different approaches, one based on a simple optical-link equation, and the other based on an attenuation coefficient. From the calculations, the discrepancy between the two approaches was negligible when the link distance was approximately 110 km, and was under 5% when the link distance ranged from 80 to 140 km. Subsequently, the allowable path-deviation time of the aircraft within the tracking-error tolerance of the system was estimated, using different aircraft speeds, turn rates, and link distances. The results indicated that the allowable path-deviation time was primarily determined by the aircraft's speed and turn rate. For example, the allowable path-deviation time was estimated to be ~3.5 s for an aircraft speed of 166.68 km/h, a turn rate of $90^{\circ}/min$, and a link distance of 100 km. Furthermore, for a constant aircraft speed and turn rate, the path-deviation time was observed to be almost unchanged when the link distance ranged from 80 to 140 km.