• IE interfaces
• /
• v.15 no.3
• /
• pp.247-255
• /
• 2002

For the recent multimedia service, the network should be fast, stable, and reliable. In order to provide reliability of the network, certain survivability of the network, which guarantees it's functions even though there is some failure on the network, should be satisfied. Also, for a pair of nodes on the network, there must be paths of which numbers of hops are within a certain limit for realtime service between them. In this paper, we propose a longest shortcut method for solving the survivable network design problems with hop limit. Through the computational results, we compare the efficiency of the method with an existing shortest shortcut method and find that the proposed method is more efficient than the shortest shortcut method.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.74-84
• /
• 2001

In the current Internet, InteServ model based on Resource reSerVation Protocol (RSVP), DiffServ Model based on service differentiation according to per hope behavior(PHB) and traffic engineering policy, and two-tire model of above mentioned two models which are adapted differently as the target network status for providing the end-to-end QoS Path are suggested. But, when we integrated this internet QoS into the ATM based network, differences of the connection setup procedure, name/address translation methods, and QoS provisioning mechanisms for end-to-end path setup procedures are introduced. In this paper, we propose the method of shortcut based QoS path setup procedure to solve these problems, and to guarantee the integration and scalability of Next Generation Internet(NGI) names/address in Integrated IP network into ATM based network. This network should support the engineering differentiated into the multiple service classes, which depend on established by this path is designed suitably into the target router and host step by step. In the near future, this function which provide the QoS guaranteed path based on end-to-end shortcut between the configuration devices are extended into the NGI target network.

• The Journal of Society for e-Business Studies
• /
• v.19 no.1
• /
• pp.131-143
• /
• 2014

A triple database consisting of a number of three-column tables require high cost of query processing, whereby building a shortcut is known as an effective way to reduce the cost. It is important to figure out what shortcuts needs to be selectively built. Most shortcut selection algorithms make use of a benefit model that considers the query frequency. However they work poor to reflect the database update. In this paper, we consider a benefit model for triple databases. The model considers not only the profit of query response times but also the building and maintenance costs of the shortcuts. We apply the model to design a benefit function which can be plugged in a greedy-based shortcut selection algorithm. We perform the empirical experiments on a real-world dataset and analyze the effect of each factor employed in the benefit function.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.529-532
• /
• 2000

This paper addresses how to be connected with end-to-end shortcut using ATM Switched Virtual Connection (SVC) in ATM-based Multi-Protocol Label Switching (MPLS) Networks. Without additionally existing ATM Ships-in-the-Night (SIN) mode, when the stream is continuously transmitted at the same destination with the lapse of determined aging time, the connection is changed with end-to-end shortcut connection using ATM signaling. An ATM direct short circuit is performed an IP and ATM effective integration. An ATM shortcut has a number of advantages, like higher throughput, shorter end-to-end delay, reduced router load, better utilization of L2 Quality of Service (QoS) capabilities, and route optimization. In particular between other MPLS domains, this can be efficiently improved the performance of networks.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.269-272
• /
• 2007

The shortcut shot detection based on MPEG compressed video bitstream is presented in this paper. The detection algorithm is used the video picture frame from MPEG compressed video directly not to be decompressed the original image. For shortcut detection, I and P frame of MPEG video bitstream are classified. The changing scene cuts at I pictures are detected by the decompressed DC image and scene cuts at P picture frame by monitoring the percentage of intra-macroblocks per P picture are detected. Experimental results using test video bitstream QVGA results in average 92% detection rate, searching time is taken around 4.5 times faster in comparison with changing scene shot detection algorithm which is decompressed the compressed bitstream.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1475-1482
• /
• 2009

In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.

• Clinical Endoscopy
• /
• v.56 no.5
• /
• pp.590-591
• /
• 2023

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.91-98
• /
• 2003

Visitors who browse the web from wireless PDAs, cell phones are frequently frustrated by interfaces. Simply replacing graphics with text and reformatting tables does not solve this problem, because deep link structures can still require more time. To solve this problem, in the paper we propose an algorithm, Minimal Path Algorithm that automatically improves wireless web navigation by suggesting useful shortcut links in real time. In the result of this paper, Minimal Path algorithm offer the shortcut and the number of shortest links to web users.

• Journal of Industrial and Engineering Chemistry
• /
• v.67
• /
• pp.255-265
• /
• 2018

The huge amount of solvents used in the semi-conductor and display industry typically result in waste of valuable solvents which often form complex azeotropic mixtures. This study explored a recovery process of a quaternary waste solvent, comprising methyl 2-hydroxybutyrate, propylene glycol monomethyl ether acetate, ethyl lactate, and ethyl-3-ethoxy propionate. In this study, a novel shortcut column method with a graphical approach was exploited for the distillation column design of complex quaternary azeotropic mixtures. As a result, the proposed shortcut method and design procedure solved the complex separation paths successfully with less computational efforts while achieving all requirements for component purity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.7
• /
• pp.2407-2424
• /
• 2022

Recently, Transformer has made great progress in video retrieval tasks due to its high representation capability. For the structure of a Transformer, the cascaded self-attention modules are capable of capturing long-distance feature dependencies. However, the local feature details are likely to have deteriorated. In addition, increasing the depth of the structure is likely to produce learning bias in the learned features. In this paper, an improved Transformer structure named TransDCS (Transformer with Dynamic Convolution and Shortcut) is proposed. A Multi-head Conv-Self-Attention module is introduced to model the local dependencies and improve the efficiency of local features extraction. Meanwhile, the augmented shortcuts module based on a dual identity matrix is applied to enhance the conduction of input features, and mitigate the learning bias. The proposed model is tested on MSRVTT, LSMDC and Activity-Net benchmarks, and it surpasses all previous solutions for the video-text retrieval task. For example, on the LSMDC benchmark, a gain of about 2.3% MdR and 6.1% MnR is obtained over recently proposed multimodal-based methods.