• 복식
• /
• 제51권6호
• /
• pp.117-128
• /
• 2001

The purposes of this study was to investigate discriminative factors of clothing buying intention on Internet shopping mall. The sample included 435 male(44.8%) and female(55.2% ) adults, and an instrument was developed based on previous studies. The statistical analysis used for this study were factor analysis, 1-test, and LISREL. The results of factor analysis showed that consumers evaluated apparel internet shopping attributes based on perceptional dimensions of internet shopping consisted of clothing quality and value. web service quality and value, and adoption of internet shopping. Each dimension has sub-factors as follows: (1) clothing quality was perceived as 'artistry' 'sociality' and 'practicality'. (2) web interface service quality was perceived as 'visuality', 'advantage', 'response', 'dependability' and 'buying-confidence'. (3) internet shopping adoption was perceived as 'usefulness' and 'convenience'. T-test revealed that consumer's buying intention, re-entry intention, and store attitude were differed concerning all sub-factors including 'usefulness' and 'convenience' in adoption of Internet shopping dimension. As a result of LISREL, clothing buying intention path model was set up as following path. (1) 'artistry', 'sociality' and 'practicality' of clothing quality affected clothing value perception positively. (2) 'visuality', 'advantage', 'response' and 'buying-confidence' of web service quality affected web service value perception positively. (3) clothing and web service value perception affected store attitude positively. (4) store attitude affected clothing buying intention positively. However, Adoption of Internet shopping dimension that was perceived as usefulness and convenience did not affect clothing buying intention path model. Therefore, consumers buying, intention model in internet circumstance could be used nearly the same as real market circumstance.

• 정보처리학회논문지B
• /
• 제12B권3호
• /
• pp.313-322
• /
• 2005

유비쿼터스 장비를 통해 서버에 있는 디지털 아이템에 접근하기 위해서, 디지털 아이템은 시스템 환경과 장비 특성 및 사용자 선호에 따라 적응되어야한다. 유비쿼터스 환경에서 장비 의존적 적응의 요구 사항은 정적으로 결정되지 않으며 예측할 수 없다. 그러므로 특정한 응용에 대한 적용 절차는 일반적 디지털 아이템 적응 엔진에서 적용될 수 없다. 본 논문에서는 최소의 트랜스코더의 집합과 요구된 적응 요구를 위한 트랜스코딩 경로 생성기, 적응 스케줄러를 갖는 응용-독립적 디지털 아이템 적응 구조를 제안한다. 또한 트랜스코딩 경로인 여러 단위 트랜스코더의 연결을 문맥 자유 문법을 사용하여 찾는 방법을 설명하고, 실험을 하였다.

• 디지털산업정보학회논문지
• /
• 제12권2호
• /
• pp.7-14
• /
• 2016

In this paper presents a low power algorithm using a feasible cluster generation method considered glitch. The proposed algorithm is a method for reducing power consumption of a given circuit. The algorithm consists of a feasible cluster generation process and glitches removal process. So that glitches are not generated for the node to which the switching operation occurs most frequently in order to reduce the power consumption is a method for generating a feasible cluster. A feasible cluster generation process consisted of a node value set, dividing the node, the node aligned with the feasible cluster generation. A feasible cluster generation procedure is produced from the highest number of nodes in the output. When exceeding the number of OR-terms of the inputs of the selected node CLB prevents the signal path is varied by the evenly divided. If there are nodes with the same number of outputs selected by the first highest number of nodes in the input produces a feasible cluster. Glitch removal process removes glitches through the path balancing in the same manner as [5]. Experimental results were compared with the proposed algorithm [5]. Number of blocks has been increased by 5%, the power consumption was reduced by 3%.

• 한국정밀공학회지
• /
• 제31권6호
• /
• pp.543-550
• /
• 2014

A magnet gear composed of two layers of permanent magnets repeated circumferentially can transmit the power without mechanical contact. In the topology called by the magnet shutter gear known as the most competitive concept among the existing concepts, the number of pole-pairs on the high speed rotor corresponds to that of low speed rotor through electric steel set functioning as a magnetic modulator. The methodology is classified into radial type and axial type according to its magnetic path as in the motor. However, the magnetic modulator has multiple poles located separately. So, it is very complicated to assemble each module of the magnet gear mechanically and to sustain a mechanical stiffness of the modulator. The practical trouble can be solved partially through reconfiguring the modules. This paper deals with the novel magnetic shutter gear topology varying the magnetic path and its effectiveness is verified through real hardware implementation.

• 로봇학회논문지
• /
• 제2권3호
• /
• pp.275-281
• /
• 2007

This paper presents a motion planning strategy for legged robots using locomotion primitives in the complex 3D environments. First, we define configuration, motion primitives and locomotion primitives for legged robots. A hierarchical motion planning method based on a combination of 2.5 dimensional maps of the 3D workspace is proposed. A global navigation map is obtained using 2.5 dimensional maps such as an obstacle height map, a passage map, and a gradient map of obstacles to distinguish obstacles. A high-level path planner finds a global path from a 2D navigation map. A mid-level planner creates sub-goals that help the legged robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. A local obstacle map that describes the edge or border of the obstacles is used to find the sub-goals along the global path. A low-level planner searches for a feasible sequence of locomotion primitives between sub-goals. We use heuristic algorithm in local motion planner. The proposed planning method is verified by both locomotion and soccer experiments on a small biped robot in a cluttered environment. Experiment results show an improvement in motion stability.

• 한국군사과학기술학회지
• /
• 제15권6호
• /
• pp.770-778
• /
• 2012

In this paper, we propose a multi-path construction scheme to improve the survivability of a multicast session in military hybrid networks. A military hybrid network consists of a static backbone network and multiple mobile stub networks where some nodes are frequently susceptible to be disconnected due to link failure and node mobility. To improve the survivability of multicast sessions, we propose a construction scheme of ${\kappa}$ redundant multi-paths to each receiver. In order to take account of different characteristics of static and mobile networks, we propose quite different multi-path setup approaches for the backbone and stub networks, respectively, and combine them at the boundary point called gateway. We prove that our proposed scheme ensures that each receiver of a multicast session has ${\kappa}$ redundant paths to the common source. Through simulations, we evaluate the performance of the proposed schemes from three aspects : network survivability, recovery cost, and end-to-end delay.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.463-466
• /
• 2009

MANET(Mobile Ad-Hoc Network)은 고정된 기반망의 도움 없이 이동 단말로 구성되어 있는 네트워크를 뜻한다. MANET 내에서 노드는 유동성과 배터리 등의 자원적인 제약을 지닌다. 이러한 특징이 노드가 많은 밀집 지역이나 네트워크의 규모가 방대해 질수록 초기 경로 탐색 및 설정 및 노드 이탈로 인한 경로 재설정과 라우팅 오버헤드 등의 문제점이 발생한다. 본 논문에서는 Hybrid방식 중 ZRP(Zone Routing Protocol) 방식과 ZHLS(Zone-Based Hierarchical Link State) 방식을 비교 분석하여 노드가 밀집한 특정 지역에 대한 고정 노드를 이용하여 경로 발견 및 유지에 대한 효율성을 높이는 보조 통신 노드 방식인 Fixed ZRP를 제안한다.

• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.119-124
• /
• 2021

Elastic Optical Networks (EONs) allow to solve the high demand for bandwidth due to the increase in the number of internet users and the explosion of multicast applications. To support multicast applications, network operator computes a tree-shaped path, which is a set of optical channels. Generally, the demand for bandwidth on an optical channel is enormous so that, if there is a single fiber failure, it could cause a serious interruption in data transmission and a huge loss of data. To avoid serious interruption in data transmission, the tree-shaped path of a multicast connection may be protected. Several works have been proposed methods to do this. But these works may cause the duplication of some resources after recovery due to a link failure. Therefore, this duplication can lead to inefficient use of network resources. Our work consists to propose a method of protection that eliminates the link that causes duplication so that, the final backup path structure after link failure is a tree. Evaluations and analyses have shown that our method uses less backup resources than methods for protection of a multicast connection.

• Journal of Applied and Pure Mathematics
• /
• 제4권3_4호
• /
• pp.85-97
• /
• 2022

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}\;=\;\{\array{{\frac{p}{2}}&p\text{ is even}\\{\frac{p-1}{2}}\;&p\text{ is odd,}}$$ and M = {±1, ±2, ⋯ ± 𝜌} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling $\frac{{\lambda}(u)+{\lambda}(v)}{2}$ if λ(u) + λ(v) is even and $\frac{{\lambda}(u)+{\lambda}(v)+1}{2}$ if λ(u) + λ(v) is odd such that ${\mid}\bar{\mathbb{S}}_{{\lambda}_1}-\bar{\mathbb{S}}_{{\lambda}^c_1}{\mid}{\leq}1$ where $\bar{\mathbb{S}}_{{\lambda}_1}$ and $\bar{\mathbb{S}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling of graphs which are obtained from path and cycle.

• 한국멀티미디어학회논문지
• /
• 제25권2호
• /
• pp.237-246
• /
• 2022

Among the technologies of the 4th industrial revolution, drones that have grown rapidly and are being used in various industries can be operated by the pilot directly or can be operated automatically through programming. In order to be controlled by a pilot or to operate automatically, it is essential to predict and analyze the optimal path for the drone to move without obstacles. In this paper, after securing and analyzing the pilot training dataset through the unmanned aerial vehicle piloting training platform designed through prior research, the profile of the dataset that should be preceded to search and derive the optimal route of the unmanned aerial vehicle was designed. The drone pilot training data includes the speed, movement distance, and angle of the drone, and the data set is visualized to unify the properties showing the same pattern into one and preprocess the properties showing the outliers. It is expected that the proposed big data-based profile can be used to predict and analyze the optimal movement path of an unmanned aerial vehicle.