• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.239-242
• /
• 2003

In this paper, we propose how to determine the optimal camera position using inverse kinematics of virtual link model and manipulability measure. We model the variable distance and viewing direction between a target object and a camera position as a virtual link. And, by using inverse kinematics of virtual link model, we find out regions that satisfy the direction and distance constraints for the observation of target object. The solution of inverse kinematics of virtual link model simultaneously satisfies camera accessibility as well as a direction and distance constraints. And we use a manipulability measure of active camera system in order to determine an optimal camera position among the multiple solutions of inverse kinematics. By using the inverse kinematics of virtual link model and manipulability measure, the optimal camera position in order to observe a target object can be determined easily and rapidly.

• Kyungpook Mathematical Journal
• /
• v.55 no.1
• /
• pp.191-203
• /
• 2015

We introduce a quasitoric virtual braid and show that every virtual link can be obtained by the closure of a quasitoric virtual braid. Also, we show that the set of quasitoric virtual braids with n strands forms a group which is a subgroup of the n-virtual braid group.

• East Asian mathematical journal
• /
• v.25 no.4
• /
• pp.487-494
• /
• 2009

We show that if two virtual link diagrams which are normal are equivalent under generalized Reidemeister moves, then they are equivalent under generalized Reidemeister moves preserving the normality of diagrams.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.19-22
• /
• 2005

In order to achieve high capacity and reliable link quality in user communication, this paper proposes a new concept of virtual cell: the Dual Virtual Cell(DVC), and DVC employment strategy based on DWCS. The proposed system uses two kinds of virtual cell. One is the AVC(Active Virtual Cell) which exists for actual traffic and the other is the CVC(Candidate Virtual Cell) which contains a set of candidate antennas to protect user's link quality from performance degradation or interruption. And also this system aims to reduce MT's overloads and acheive a prompt link change successfuly by introducing DVC structure which makes it possible for network to monitor real-time channel and to conrol communication links. The proposed system constructs DVC by using antenna selection method and improves frame error performance with employing Space-Time Trellis Code(STTC).

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.99-108
• /
• 1999

B-ISDN link dimensioning is often known as a difficult problem because of the characteristics of Asynchronous Transfer Mode(ATM) such as various Quality of Services of different service requirements, and the statistical multiplexing resulting from virtual path/virtual circuit connections. In this paper, we propose a nonlinear integer optimization model for dimensioning B-ISDN considering the statistical multiplexing effects of virtual path connections(VPCs) and the modularity of resources allocated to a transmission link. The algorithm based on the simultaneous linear approximation technique as well as some numerical results will be also presented.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.14-20
• /
• 2003

This paper presents a multi-criteria decision model and Multi-Criteria Generic Algorithm(MCGA) approach to improve backbone topology by leveraging the Virtual Link(VL) system in an hierarchical Link-State(LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in an hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MCGA.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.2
• /
• pp.148-157
• /
• 2004

Interactive simulators that simulate mechanical systems are being developed for the purpose of performance evaluation of product design, replacement of physical training, and entertainment game. Use of flight simulator is increasing to reduce risk and cost of physical training, and we need virtual environment which covers large area terrain. We need a method that can reduce development cost and construction time of virtual environment that simulate the real environment. There have been attempts to link GIS or remote sensing field with virtual reality. This paper examines a method that helps to construct virtual environment, and attempts to link geographic information with virtual reality. A construction method of virtual environment based on digital map and satellite image has been studied.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.105-111
• /
• 1995

The inverse dynamic equations for 5 link robot including a closed chain have been derived. The closed chain is virtually cut open, and the kinematics and dynamics of the virtual open chain robot are analyzed. The constraints are applied to the virtually cut joints by the Jacobian matrix which represents the configuration of the closed chain. The topology of tree structrued open chain robot is described by a FATHER array. The FATHER array of a link indicates the link tha tis connected in the direction of base link. Based on the inverse dynamic equations, the torque sensitivity models of the 5 link robot have been developed. The sensitivity models characterize the sensitivity of the driving torque with respect to the link parameters. All the procedures are illustrated through the 2 link robot.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.101-104
• /
• 2000

Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith＇s principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.