• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.915-920
• /
• 1987

When a task requires two robot arms to move in a cooperative manner sharing a common workspace, potential collision exists between the two robot arm . In this paper, a novel approach for collision-free trajectory planning along paths of two SCARA-type robot arms is presented. Specifically, in order to describe potential collision between the links of two moving robot arms along the designated paths, an explicit form of "Virtual Obstacle" is adopted, according to which links of one robot arm are made to grow while the other robot arm is forced to shrink as a point on the path. Then, a notion of "Coordination Chart" is introduced to visualize the collision-free relationship of two trajectories.of two trajectories.

• ETRI Journal
• /
• 제21권4호
• /
• pp.23-28
• /
• 1999

In this paper, we analyze the performance benefits of broadband ATM networks when the call control and management flows are separated from user data flows. The virtual path tunneling concept for control and management flows are applied to the same physical ATM networks. The behaviors of channel throughput and transfer delay are analyzed. It results that the proposed virtual short-cut paths can maintain the network being stable with acceptable bandwidth. They are very useful to provide the stable control and management capabilities for Internet and mobile applications in the broadband ATM networks. In our numerical results, the effective throughputs of the proposed virtual shout-ut channel are about three times than those of end-to-end user data channels with hop distances of 10, and about two times than those with hop distance of 5 when the link blocking probability increases to 0.1. It concludes that the effective channel bandwidth are greatly reduced down while physical links are not stable and user traffic flows are occasionally overflowed.

• ETRI Journal
• /
• 제21권1호
• /
• pp.55-71
• /
• 1999

Recently, the increased handling of on-line standards information has emerged as an important feature of information and communications technology (ICT) standardization. In order to meet market needs for on-time standards deployment, most standards organizations are actively seeking more efficient ways of standardization using electronic means in order to accelerate the standards making process. This paper suggests a virtual standard development environment designed for standards developers to carry out their standards-related activities on-line. In this paper, we outline a conceptual model of a concurrent standardization process and describe the design and implementation of an Extranet-based network system called standards information cooperative network (SICN). The system was created with a view to fostering faster standards development with functionalities such as a virtual management of networked standards developers, collaboration support tools, a workflow-based electronic signature system, and dynamic links for ready retrieval of standards information stored in a database. We conclude this paper with an introduction to the concept of a virtual standards development organization (VSDO) that supports all the features needed by the relevant standards making bodies to carry out their activities in a dynamic on-line environment.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 가을 학술발표논문집 Vol.28 No.2 (1)
• /
• pp.169-171
• /
• 2001

XML을 기반으로 하는 가상문서는 인터넷 상의 정보 공유를 가능하게 하여 새로운 지식을 생성할 수 있도록 한다. 가상문서에서는 비정형(텍스트, 이미지, 멀티미디어 데이터)과 준정형(HTML, XML) 데이터를 링크로 연결하여 정보를 제공하고 있다. HTML과 같은 기존의 웹 문서에서는 스크립트나 CGI 같은 것을 통하여 정형 데이터(데이터베이스)의 정보를 제공하고 있으므로 가상문서에서도 자연스럽게 정형 데이터를 연결하여 사용이 가능하다. 본 논문에서는 디지털 도서관 시스템에서 정형 데이터를 지원하기 위해 질의 링크를 포함하는 가상문서를 효율적으로 처리할 수 있도록 데이터베이스를 설계 및 구현하며, 데이터베이스 스키마 정보를 관리하여 필요한 데이터베이스를 검색하여 질의 링크의 생성을 돕도록 하였다.

• 한국주거학회논문집
• /
• 제20권1호
• /
• pp.113-122
• /
• 2009

In the work of contemporary spatialization, the meaning of program is being an important conceptual element beyond simple functional dimension. The design of this diagram allows to balance among changing programs, and it comes into the spotlight as a medium, which links the virtual to the reality as embodying the virtual, which is not embodied realistically, realistically through the design process. In other words, this method is attracting the public attention as a design tool which can concentrate on design process rather than a fixed tool. This study focuses on the role of balancing among mixed programs and the diagram as a design tool. Therefore, the purpose of this study is to analyze and research the work of spatialization, which apply to diagrams of contemporary designers, is to identify operating mechanism and then is to examine the characteristics and importance of them.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.187-201
• /
• 1998

In ATM networks with high capacity, the effect of failures on transmission links or nodes can be catastrophic, so that the issue of survivability is of great importance. In this paper. we consider the routing problem for working and backup virtual paths(VPs). To accomplish a higher survivability. routing the two kinds of VPs should be taken into account at the same time because backup VP routing depends on the working VP routing. A coevolutionary algorithm is employed to solve the problem for simultaneously routing of working and backup VPs. To develop an efficient coevolutionary algorithm for the problem. structure of populations, encoding method, neighborhood, and genetic operators are studied in this paper. The results of extensive experiments are reported. The performance comparison of the proposed algorithm with a conventional genetic algorithm and existing heuristics shows that our approach is promising.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5694-5711
• /
• 2017

The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.

• 대한전자공학회논문지
• /
• 제20권3호
• /
• pp.13-20
• /
• 1983

본 논문은 도형 패턴에 대한 모서리를 결정하는 방법을 제안하였다. 도형 패턴의 윤곽선에 대한 라인 시그먼트(line segment)의 연결 상태로부터 후보 링크를 설정한다. 그리고 라인 시그먼트의 연결점으로부터 설정된 후보 링크에 대한 편차를 계산하여 모서리의 위치를 결정하는 알고리즘과 출. 철 구조의 모서리를 구분하여 식별하는 알고리즘을 제안한다. 그 결과 Freeman의 방법과 비교하여 훨씬 유연하고 효과적임을 화인하였다.

• 한국경영과학회지
• /
• 제21권2호
• /
• pp.125-140
• /
• 1996

Simulated annealing (SA) is a very promising general purpose algorithm which can be conveniently utilized for various complicated combinatorial optimization problems. But its slowness has been pointed as a major drawback. In this paper, we propose an accelerated SA and test its performance experimentally by applying it for two standard combinatorial optimization problems (TSP(Travelling Salesman Problem) and GPP(Graph Partitioning Problem) of various sizes. It turns out that performance of the proposed method is consistently better both in convergenge speed and the quality of solution than the conventional SA or SE (Stochastic Evolution). In the second part of the paper we apply the accelerated SA to solve the virtual path management problem encountered in ATM netowrks. The problem is modeled as a combinatorial optimization problem to optimize the utilizy of links and an efficient SA implementation scheme is proposed. Two application examples are given to demonstrate the validity of the proposed algorithm.

• 한국생활과학회지
• /
• 제8권3호
• /
• pp.511-524
• /
• 1999

This research examines 13 Korean Web sites and 15 foreign Web Sites to explore how companies present apparel products by both layout of graphics and information at the Web sites. The results show that most Web sites display tiny icons next to the item's text description. Clicking on these icons takes the customers to another web page, where the full size photograph of the item appears. The results also revealed that most web sites offer shopping bag function and payment options such as on-line and credit cards. The results indicate that Web sites are constantly evolving and following functions such as virtual dressing room, FAQ, the links, E-Cash payment, currency converter and multilingual sites are becoming standards in the near future.