• Title/Summary/Keyword: efficient path

Search Result 1,277, Processing Time 0.027 seconds

A Study on the Structural Relation among Purchase Decision Factors of Medical Devices, Satisfaction and Repurchasing Intention : Focused on Ultrasound Imaging System (의료기기의 구매결정요인과 만족 및 재구매 의도의 구조적 관계에 관한 연구 : 초음파영상진단장치를 중심으로)

  • Jung, Tae-young;Seo, Geon-seok;Kim, Su-beom
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.5
    • /
    • pp.3308-3314
    • /
    • 2015
  • The purpose of this study is to investigate the casual relationships among purchase decision factors of medical devices, satisfaction and repurchasing intention. Data of this study is a 2012 survey on medical institutions using medical devices of MW(ministry of health and welfare) and We analyzed 116 medical institutions having ultrasound imaging system lager than general hospitals among data. For empirical analysis, we carried out confirmative factor analysis and path-analysis using AMOS 21.0 package. Main results of this study are as follows: First, brand has positive influence on satisfaction and satisfaction has positive impaction on repurchase intention. Second, although not statistically significant, performance and service have positive impaction on satisfaction and price has negative influence on satisfaction. The significance of this study is to provide empirical basis on establishment of efficient marketing strategy and enhancement of competitiveness for the medical device industry.

Energy-efficient query processing based on partial attribute values in wireless sensor networks (무선 센서 네트워크에서 부분 속성값을 활용한 에너지 효율적인 질의처리)

  • Kim, Sung-Suk;Kim, Hyong-Soon;Yang, Sun-Ok
    • Journal of KIISE:Databases
    • /
    • v.37 no.3
    • /
    • pp.137-145
    • /
    • 2010
  • Wireless sensors play important roles in various areas as ubiquitous computing is generalized. Depending on applications properties, each sensor can be equipped with limited computing power in addition to general function of gathering environment-related information. One of main issues in this environment is to improve energy-efficiency in sensor nodes. In this paper, we devise a new attribute-query processing algorithm. Each sensor has to maintain partial information locally about attributes values gathered at its all descendent nodes. As the volume is higher, however, the maintenance cost also increases. And the update cost also has to be considered in the proposed algorithm. Thus, some bits, AVB(Attribute-Value Bits), are delivered instead of the value itself, where each bit represents a bound of attribute. Thus, the partial information can decrease the number of exchanged messages with a little cost during query processing. Through simulation works, the proposed algorithm is analyzed from several points of view.

Real-Time Scheduling Facility for Video-On-Demand Service (주문형 비디오 서비스를 위한 실시간 스케쥴링 기능)

  • Sohn, Jong-Moon;Kim, Gil-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2581-2595
    • /
    • 1997
  • In this paper, the real-time facility of the operating system for a VOD(Video On Demand) server have been analyzed and implemented. The requirements of the real-time scheduling have been gathered by analyzing the model of the video-data-transfer-path. Particularly, the influence of the bottleneck subsystem have been analyzed. Thus, we have implemented the real-time scheduler and primitives which is proper for processing the digital video. In performance measurements, the degree of the guarantee of the real-time scheduler have been experimented. The measured data show that the most time constraints of the process is satisfied. But, the network protocol processing by the interrupt is a major obstacle of the real-time scheduling. We also have compared the difference between the real-time scheduler and the non-real-time scheduler by measuring the inter-execution time. According to the measured results, the real-time scheduler should be used for efficient video service because the processor time allocated to the process can't be estimated when the non-real-time scheduler is used.

  • PDF

Mobility Management Scheme Using Efficient Relay Agent in Nested Mobile Networks (중첩된 이동망에서 효율적 릴레이 에이전트를 사용하는 이동성 관리 기법)

  • 이재걸;홍충선;이재조
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10A
    • /
    • pp.796-806
    • /
    • 2003
  • Mobile Node usually communicate with CN bia only it's own HA but Nested Mobile Networks correspond with CN bia all HA involved with them. when Mobile Network of a MR moves from its home link to a foreign link in the stationary network. then Mobile Network of another MR moves from its home link in stationary network to foreign link in previous mobile network. CN send Packet destined to the latter MR via both Home Agent of the former MR and the latter MR. There are two problem in this scenario. One is inefficient routing path that bypass via several HA. the other is waste of transmission resource and delay of Registration process which change of Nested Mobile Network Architecture cause Mobile Router. so We propose MRA(Mobile Relay Agent) to support effective routing by local mobility management.

Design and Implementation of Trajectory Preservation Indices for Location Based Query Processing (위치 기반 질의 처리를 위한 궤적 보존 색인의 설계 및 구현)

  • Lim, Duk-Sung;Hong, Bong-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.3
    • /
    • pp.67-78
    • /
    • 2008
  • With the rapid development of wireless communication and mobile equipment, many applications for location-based services have been emerging. Moving objects such as vehicles and ships change their positions over time. Moving objects have their moving path, called the trajectory, because they move continuously. To monitor the trajectory of moving objects in a large scale database system, an efficient Indexing scheme to processed queries related to trajectories is required. In this paper, we focus on the issues of minimizing the dead space of index structures. The Minimum Bounding Boxes (MBBs) of non-leaf nodes in trajectory-preserving indexing schemes have large amounts of dead space since trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. In this thesis, we propose entry relocating techniques to reduce dead space and overlaps in non-leaf nodes. we present performance studies that compare the proposed index schemes with the TB-tree and the R*-tree under a varying set of spatio-temporal queries.

  • PDF

Power and Location Information based Routing Protocol Design in Wireless Sensor Networks (무선 센서 네트워크에서 전력과 위치정보 기반 라우팅 프로토콜 디자인)

  • Son Byung-Rak;Kim Jung-Gyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.2
    • /
    • pp.48-62
    • /
    • 2006
  • In recent years, wireless sensor networks(WSNs) have emerged as a new fast-growing application domain for wireless distributed computing and embedded systems. Recent Progress in computer and communication technology has made it possible to organize wireless sensor networks composed tiny sensor nodes. Furthermore, ad-hoc network protocols do not consider the characteristics of wireless sensor nodes, making existing ad-hoc network protocols unsuitable for the wireless sensor networks. First, we propose power-aware routing protocols based on energy-centered routing metrics. Second, we describe power management techniques for wireless sensor nodes using the spatial locality of sensed data. Many nodes can go into a power-down mode without sacrificing the accuracy of sensed data. Finally, combining the proposed techniques, we describe an overall energy-efficient protocol for data collection. Experimental results show that the proposed routing protocol can extend the routing path lifetime more than twice. The average energy consumption per sensing period is reduced by up to 30%.

  • PDF

An Efficient Admission Control and Resource Allocation Methods in DiffServ Networks (인터넷 차별화 서비스 네트워크에서의 효율적인 호 수락 제어 및 자원 이용 방안에 관한 연구)

  • 조병일;유상조
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.698-712
    • /
    • 2004
  • DiffServ network architecture does not define a call admission control procedure explicitly. In this paper, a new DiffServ QoS control mechanism is suggested which, after the call admission control, can execute packet process according to the class while, at the same time, executing on the flow based call admission control in the DiffServ network. Routers on the path from the source to the destination estimate the aggregated class traffic of the existing flows and the new incoming flow and then, perform a call admission control in accordance with the type of classes efficiently based on the required bandwidth per each class that can meet the user's QoS requirements. In order to facilitate the packet process according to the class after the flow based call admission control, a mechanism is suggested that can adjust the network resources to classes dynamically. The performance analysis on this mechanism is carried out through a simulation.

  • PDF

Query Processing using Information of Parent Nodes in Partitioned Inverted Index Tables (분할된 역 인덱스 테이블에서 부모노드의 정보를 이용한 질의 처리)

  • Kim, Myung-Soo;Hwang, Byung-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.7
    • /
    • pp.905-913
    • /
    • 2008
  • Many heterogeneous XML documents are being widely used with the increasing employment of XML, and the importance of data structure research for more efficient document management has been growing steadily. We propose a query processing technique which uses parent node information in a partitioned inverted index tree. The searching efficiency of these heterogeneous documents is greatly influenced by the number of query processing and the amount of target data sets in many ways. Therefore, considering these two factors is very important for designing a data structure. First, our technique stores parent node's information in an inverted index table. Then using this information, we can reduce the number of query processing by half. Also, the amount of target data sets can be lessoned by using partitioned inverted index table. Some XML documents collected from the Internet will be used to demonstrate the new method, and its high efficiency will be compared with some of the existing searching methods.

  • PDF

Performance Analysis of Cellular If Using Combined Cache and Alternative Handoff Method for Realtime Data Transmission (실시간 데이터를 지원하는 통합 캐시 및 차별화된 핸드오프를 이용한 셀룰러 IP의 성능분석)

  • Seo, Jeong-Hwa;Han, Tae-Young;Kim, Nam
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.2
    • /
    • pp.65-72
    • /
    • 2003
  • In this paper, the new scheme using a Combined Cache(CC) that combing the Paging and Routing Cache(PRC) and an alternative handoff method according to the type of data transmission for achieving the efficient realtime communication. The PRC and quasi-soft handoff method reduce the path duplication. But they increase the network traffic load because of the handoff state packet of Mobile Host(MH). Moreover the use the same handoff method without differentiating the type of transmission data. Those problems are solved by operating U with a semi-soft handoff method for realtime data transmission and with a hard handoff method for non-realtime data transmission. As a result or simulation a better performance is obtained because of the reduction of the number of control packet in case that the number of cells are below 20. And the packet arrival time and loss of packet decreased significantly for realtime data transmission.

  • PDF

Design and Implementation of a Distributed Audio/Video Stream Service Framework based on CORBA (CORBA 기반의 분산 오디오/비디오 스트림 서비스 프레임워크의 설계 및 구현)

  • Kim, Jong-Hyeon;No, Yeong-Uk;Jeong, Gi-Dong
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.207-216
    • /
    • 2002
  • This paper present a design and implementation of a distributed audio, Video stream service framework based on CORBA for efficient processing and control of audio/video stream. We design software components which support processing, control and transmission of audio/video streams as distributed objects. For optimization of stream transmission performance, we separate the transmission path of control data and media data. Distributed objects are defined by IDL and implemented using JAVA. And device dependent facilities like media capturing, playing and communication channels are implemented using JMF (Java Media Framework) components. We show a connection establishment and control procedure of streams communication. And for evaluation, we implement a test system and experiment a system performance. Our experiments show that test system has somewhat longer connection latency time compared to TCP connection establishment, but has optimized media transmission time compared to CORBA IIOP. Also test system show acceptable service quality of media transmission.