• Title/Summary/Keyword: Search Traffic

Search Result 259, Processing Time 0.034 seconds

A Study on the characteristics of model house designs applying a virtual reality technique (가상현실 모델하우스 활용 특성에 관한 연구)

  • 윤재은;이준규
    • Korean Institute of Interior Design Journal
    • /
    • no.33
    • /
    • pp.106-114
    • /
    • 2002
  • Through the computer simulation of virtual reality techniques, prospective clients can experience the surroundings such as the view, traffic and convenience facilities in advance. Also, consumers can reflect their own tastes in the real apartment Interior construction through their own work in relation to furniture arrangement, color choices, etc. inside the apartments. The virtual model house not only replaces the function of the existing model house but it can also provide some services that could not be provided easily due to some restrictions under real conditions. More, it can provide a precise view of the outside appearance and surrounding environment as well as inside the house, as virtual structures on the computer. Consumers can search for the information through the Web in advance and consumer-satisfaction type of apartments can be built. For this purpose, smooth communications among the designers, server managers, and consumers should be achieved as a prerequisite to the delivery of the necessary information.

An Efficient Implementation of Key Frame Extraction and Sharing in Android for Wireless Video Sensor Network

  • Kim, Kang-Wook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3357-3376
    • /
    • 2015
  • Wireless sensor network is an important research topic that has attracted a lot of attention in recent years. However, most of the interest has focused on wireless sensor network to gather scalar data such as temperature, humidity and vibration. Scalar data are insufficient for diverse applications such as video surveillance, target recognition and traffic monitoring. However, if we use camera sensors in wireless sensor network to collect video data which are vast in information, they can provide important visual information. Video sensor networks continue to gain interest due to their ability to collect video information for a wide range of applications in the past few years. However, how to efficiently store the massive data that reflect environmental state of different times in video sensor network and how to quickly search interested information from them are challenging issues in current research, especially when the sensor network environment is complicated. Therefore, in this paper, we propose a fast algorithm for extracting key frames from video and describe the design and implementation of key frame extraction and sharing in Android for wireless video sensor network.

Design and Evaluation of a Hierarchical Hybrid Content Delivery Scheme using Bloom Filter in Vehicular Cloud Environments (차량 클라우드 환경에서 블룸 필터를 이용한 계층적 하이브리드 콘텐츠 전송 방법의 설계 및 평가)

  • Bae, Ihn-Han
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.8
    • /
    • pp.1597-1608
    • /
    • 2016
  • Recently, a number of solutions were proposed to address the challenges and issues of vehicular networks. Vehicular Cloud Computing (VCC) is one of the solutions. The vehicular cloud computing is a new hybrid technology that has a remarkable impact on traffic management and road safety by instantly using vehicular resources. In this paper, we study an important vehicular cloud service, content-based delivery, that allows future vehicular cloud applications to store, share and search data totally within the cloud. We design a VCC-based system architecture for efficient sharing of vehicular contents, and propose a Hierarchical Hybrid Content Delivery scheme using Bloom Filter (H2CDBF) for efficient vehicular content delivery in Vehicular Ad-hoc Networks (VANETs). The performance of the proposed H2CDBF is evaluated through an analytical model, and is compared to the proactive content discovery scheme, Bloom-Filter Routing (BFR).

Development of driving simulator modules for driving safely (주행경제를 위한 드라이빙 시뮬레이터 모듈 연구)

  • Chung, Sung-Hak
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2008.11a
    • /
    • pp.569-578
    • /
    • 2008
  • The aim of this study is to propose economical safety driving speed index which those are geometric road status; examine the levels of which those cost-benefit of driving fuel expenditure; are search road safety design and operational technology for driving simulators. For the objective, we analyzed the current status of driving fuel expenditure and driving scenarios by the road alignments, and reviewed driving and technical specifications by the geometric types of road according to the implementation, and extended completion. Throughout the result of this study, diverse related driving information provision service, efficiently driving system is expected to be implemented in the national highway design system.

  • PDF

Optimizing delivery routing problem for logistics companies based on Integer Linear Programming method

  • Cao, Ngoc-Anh;Phan, Thanh-Hang;Chinh, Nguyen Thi;Tran, Duc-Quynh;Nguyen, Ha-Nam;Trang, Ngo-Thi-Thu;Choi, Gyoo-Seok
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.212-221
    • /
    • 2022
  • Currently, issues related to freight at Vietnamese logistics companies are becoming more and more urgent because of typical problems in Vietnam such as traffic, infrastructure, and application of information technology. This problem has been studied by applying many different approaches such as Integer Programming (LP), Mixed Integer Programming (MIP), hybrid, meta search, … In this paper, we applied the ILP model in order to deal with the VRP problem in a small size logistics company which is very popular in Vietnam. The experiments showed promising results with some optimal solutions with some small extra costs.

To Manage Use-Data of Nation-wide Transportation Card, Interoperable Traffic Information Collection System Development (전국호환 교통카드 이용정보의 유통관리를 위한 호환 교통정보집계시스템 구축)

  • Han, Ho-Hyeorn;Lee, Ki-Han;Kim, Hye-Hyeon;Kim, Tae-Hee;Maeng, Jae-Hwan;Park, Ha-Na
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.6
    • /
    • pp.1-12
    • /
    • 2010
  • The existing survey of the actual use relevant transportation, implemented in order to reflect transportation policy, has been performed for users by researcher directly, or thereby analysing the data of particular date-oriented of transportation card business's content so that such method have many problems. To solve such problem, we developed a new system, Interoperable Traffic Information Collection System which include several functions of effective collecting of transportation use-data created from the Nation-wide Interoperable Transportation System, accurate counting and easy inquiry. This system consists of Link-server to collect and count for transportation use-data, DB-server to store for this data and Inquiry terminal to search for the information needed. To verify for developed this system, we run test-bed by connection between this system and the Nation-wide Interoperable Transportation System developed by the KOREA Financial Telecommunications & Clearings, the KORAIL NETWORKS and the HiPlusCard. And through result of test-bed, we proved that Interoperable Traffic Information Collection System practically works well. Thus we can look for systematic reflect of reliable information.

Load-Balancing and Fairness Support Mechanisms in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서의 부하 균등화 및 공평성 지원 방법)

  • Ahn Sanghyun;Yoo Younghwan;Lim Yujin
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.889-894
    • /
    • 2004
  • Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

Optimal Path Searching for Efficient Migration of Mobile Agent (이동 에이전트의 효율적 이주를 위한 최적 경로 탐색)

  • Kim, Kwang-Jong;Ko, Hyun;Kim, Young-Ja;Lee, Yon-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.3
    • /
    • pp.117-124
    • /
    • 2006
  • In this paper, we propose the optimal migration path searching method including path adjustment and reassignment techniques for an efficient migration of mobile agent which has an autonomous ability for some task processing. In traditional agent system, if the various and large quantify of task processing were required from the users, it could be derive excessive network traffic and overload due to increasing the size of agent. And also, if an agent migrates from node to node according to routing schedules specified by the user at which the most of network traffic occurs, it could not actively cope with particular situations such as communication loss and node obstacles and required much cost for node traversal Therefore. this paper presents the migration method of agent which can try to adjust and reassign path to the destination automatically through the optimal path search using by network traffic perception in stead of the passive routing schedule by the user. An optimal migration path searching and adjustment methods ensure the migration reliability on distributed nodes and reduce the traversal task processing time of mobile agent by avoiding network traffic paths and node obstacles.

  • PDF

A Development of Maritime Search and Rescue Supporting System using Smartphone Application (스마트폰 어플리케이션을 활용한 해상 구조 지원 시스템 개발)

  • Hwang, Hun-Gyu;Kim, Bae-Sung;Woo, Yun-Tae;Shin, Il-Sik;Lee, Jang-Se
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.804-810
    • /
    • 2017
  • Distress accidents occur annually by and failure of sea rescue and time delay lead to fatal accident. In the event of maritime distress, most of the equipments used for search and rescue are in responsible for the position of ships. An MOB equipment is a representative equipment for lifesaving and uses AIS communication method. However, the MOB equipment has problems of interference with existing vessel traffic process and it is difficult to apply because there is no proper certification standard. Therefore, this paper proposes a maritime search and rescue supporting system using smartphone. Utilizing the widely constructed IT infrastructure, it collects position information of the fishing boat and leisure ship using GPS embedded in the smartphone. Also the developed system supports to participate in the rescue by sending the information about the occurrence of the survivor in a certain area to the ship operator.

Design of Client-Server Model For Effective Processing and Utilization of Bigdata (빅데이터의 효과적인 처리 및 활용을 위한 클라이언트-서버 모델 설계)

  • Park, Dae Seo;Kim, Hwa Jong
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.4
    • /
    • pp.109-122
    • /
    • 2016
  • Recently, big data analysis has developed into a field of interest to individuals and non-experts as well as companies and professionals. Accordingly, it is utilized for marketing and social problem solving by analyzing the data currently opened or collected directly. In Korea, various companies and individuals are challenging big data analysis, but it is difficult from the initial stage of analysis due to limitation of big data disclosure and collection difficulties. Nowadays, the system improvement for big data activation and big data disclosure services are variously carried out in Korea and abroad, and services for opening public data such as domestic government 3.0 (data.go.kr) are mainly implemented. In addition to the efforts made by the government, services that share data held by corporations or individuals are running, but it is difficult to find useful data because of the lack of shared data. In addition, big data traffic problems can occur because it is necessary to download and examine the entire data in order to grasp the attributes and simple information about the shared data. Therefore, We need for a new system for big data processing and utilization. First, big data pre-analysis technology is needed as a way to solve big data sharing problem. Pre-analysis is a concept proposed in this paper in order to solve the problem of sharing big data, and it means to provide users with the results generated by pre-analyzing the data in advance. Through preliminary analysis, it is possible to improve the usability of big data by providing information that can grasp the properties and characteristics of big data when the data user searches for big data. In addition, by sharing the summary data or sample data generated through the pre-analysis, it is possible to solve the security problem that may occur when the original data is disclosed, thereby enabling the big data sharing between the data provider and the data user. Second, it is necessary to quickly generate appropriate preprocessing results according to the level of disclosure or network status of raw data and to provide the results to users through big data distribution processing using spark. Third, in order to solve the problem of big traffic, the system monitors the traffic of the network in real time. When preprocessing the data requested by the user, preprocessing to a size available in the current network and transmitting it to the user is required so that no big traffic occurs. In this paper, we present various data sizes according to the level of disclosure through pre - analysis. This method is expected to show a low traffic volume when compared with the conventional method of sharing only raw data in a large number of systems. In this paper, we describe how to solve problems that occur when big data is released and used, and to help facilitate sharing and analysis. The client-server model uses SPARK for fast analysis and processing of user requests. Server Agent and a Client Agent, each of which is deployed on the Server and Client side. The Server Agent is a necessary agent for the data provider and performs preliminary analysis of big data to generate Data Descriptor with information of Sample Data, Summary Data, and Raw Data. In addition, it performs fast and efficient big data preprocessing through big data distribution processing and continuously monitors network traffic. The Client Agent is an agent placed on the data user side. It can search the big data through the Data Descriptor which is the result of the pre-analysis and can quickly search the data. The desired data can be requested from the server to download the big data according to the level of disclosure. It separates the Server Agent and the client agent when the data provider publishes the data for data to be used by the user. In particular, we focus on the Big Data Sharing, Distributed Big Data Processing, Big Traffic problem, and construct the detailed module of the client - server model and present the design method of each module. The system designed on the basis of the proposed model, the user who acquires the data analyzes the data in the desired direction or preprocesses the new data. By analyzing the newly processed data through the server agent, the data user changes its role as the data provider. The data provider can also obtain useful statistical information from the Data Descriptor of the data it discloses and become a data user to perform new analysis using the sample data. In this way, raw data is processed and processed big data is utilized by the user, thereby forming a natural shared environment. The role of data provider and data user is not distinguished, and provides an ideal shared service that enables everyone to be a provider and a user. The client-server model solves the problem of sharing big data and provides a free sharing environment to securely big data disclosure and provides an ideal shared service to easily find big data.