• Title/Summary/Keyword: Internet Computing

Search Result 3,534, Processing Time 0.029 seconds

Optimal Header Compression of MIPv6 and NEMO Protocol for Mobility Support in 6LoWPAN (6LoWPAN의 이동성 지원을 위한 MIPv6와 NEMO Protocol의 최적 헤더 압축)

  • Ha, Min-Keun;Hong, Sung-Min;Kim, Young-Joo;Kim, Dae-Young
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.55-59
    • /
    • 2010
  • Currently in a Ubiquitous Sensor Network (USN) research field, supporting mobility is recognized as an important technology. MIPv6 and Network Mobility(NEMO) Basic Support Protocol are standard protocols to support mobility in the Internet. However, if they are applied to USN with no modification, handoff performance decreases due to the size of their binding message. An existing lightweight protocol for NEMO protocol has a compatibility problem of Sequence Num. and does not optimally compress binding messages considering 6LoWPAN network structure and addressing. This paper proposes optimal header compression which supports node-based mobility and network-based mobility. Our optimal compression technique compresses a 32bytes binding update(BU) message and a 12bytes binding ACK(BA) message of MIPv6 into 13bytes and 3bytes, and a 40bytes BU message and a 12bytes BA message of NEMO protocol into 13bytes and 3bytes. The result shows that our protocol compresses 15bytes (NEMO-BU) and 1byte (NEMO-BA) more than the existing protocol and achieves 8.72% handoff performance improvement.

An Algorithm Generating All the Playable Transcoding Paths using the QoS Transition Diagram for a Multimedia Presentation Requiring Different QoS between the Source and the Destination (근원지와 목적지에서 서로 다른 서비스 품질(QoS)을 필요로 하는 멀티미디어 연출의 재생을 위한 서비스 품질 전이도 기반의 변환 경로 생성 알고리즘)

  • 전성미;임영환
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.2
    • /
    • pp.208-215
    • /
    • 2003
  • For playing a multimedia presentation in a Internet, the case that the presentation QoS(Quality of Services) at a destination nay be different from the QoS of multimedia data at the source occurs frequently. In this case, the process of trancoding the multimedia data at the source Into the multimedia data satisfying the QoS at the destination should be requited. In addition, even the presentation description having the homogeneous QoS at both sides may have different transcoding paths due to the limitation of display terminals or network bandwidth. That is, for a multimedia description, it is required to regenerate a proper transcoding path whenever the displaying terminals or the network environment gets decided. And the delay time required to go through the transcoding path may affect the playability of the give presentation. Therefore it should be checked whether the presentation requiring a transcoding process is able to be played in a real time. In this paper, the algorithm for generating all the possible transcoding paths for a given multimedia description under a fixed set of transcoders and the network environment is proposed. The algorithm adopts the concept of QoS transition diagram to Prevent from a trancoding Path being cycled by the repetition of a cyclic Path which generates the same QoS of multimedia data as its input QoS. By eliminating all the cyclic Paths, the algorithm can guarantee the termination of the process. And for the playability check, a method of computing the transcoding time and the delay lime between logical data units are proposed.Finally all the proposed methods were implemented in the stream engine, called TransCore and the presentation-authoring tool, called VIP, we had developed. And the test results with sample scenarios were presented at the last.

  • PDF

A Filtering Technique of Streaming XML Data based Postfix Sharing for Partial matching Path Queries (부분매칭 경로질의를 위한 포스트픽스 공유에 기반한 스트리밍 XML 데이타 필터링 기법)

  • Park Seog;Kim Young-Soo
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.138-149
    • /
    • 2006
  • As the environment with sensor network and ubiquitous computing is emerged, there are many demands of handling continuous, fast data such as streaming data. As work about streaming data has begun, work about management of streaming data in Publish-Subscribe system is started. The recent emergence of XML as a standard for information exchange on Internet has led to more interest in Publish - Subscribe system. A filtering technique of streaming XML data in the existing Publish- Subscribe system is using some schemes based on automata and YFilter, which is one of filtering techniques, is very popular. YFilter exploits commonality among path queries by sharing the common prefixes of the paths so that they are processed at most one and that is using the top-down approach. However, because partial matching path queries interrupt the common prefix sharing and don't calculate from root, throughput of YFilter decreases. So we use sharing of commonality among path queries with the common postfixes of the paths and use the bottom-up approach instead of the top-down approach. This filtering technique is called as PoSFilter. And we verify this technique through comparing with YFilter about throughput.

Protein Interaction Possibility Ranking Method based on Domain Combination (도메인 조합 기반 단백질 상호작용 가능성 순위 부여 기법)

  • Han Dong-Soo;Kim Hong-Song;Jong Woo-Hyuk;Lee Sung-Doke
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.5
    • /
    • pp.427-435
    • /
    • 2005
  • With the accumulation of protein and its related data on the Internet, many domain based computational techniques to predict protein interactions have been developed. However, most of the techniques still have many limitations to be used in real fields. They usually suffer from a low accuracy problem in prediction and do not provide any interaction possibility ranking method for multiple protein pairs. In this paper, we reevaluate a domain combination based protein interaction prediction method and develop an interaction possibility ranking method for multiple protein pairs. Probability equations are devised and proposed in the framework of domain combination based protein interaction prediction method. Using the ranking method, one can discern which protein pair is more probable to interact with each other than other protein pairs in multiple protein pairs. In the validation of the ranking method, we revealed that there exist some correlations between the interacting probability and the precision of the prediction in case of the protein pair group having the matching PIP(Primary Interaction Probability) values in the interacting or non interacting PIP distributions.

An Adaptive FIHS Fusion Using Spatial and Spectral Band Characteristics of Remote Sensing Image (위성 영상의 공간 및 분광대역 특성을 활용한 적응 FIHS 융합)

  • Seo, Yong-Su;Kim, Joong-Gon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.12 no.4
    • /
    • pp.125-135
    • /
    • 2009
  • Owing to its fast computing capability for fusing images, the FIHS(Fast Intensity Hue Saturation) fusion is widely used for fusion purposes. However, the FIHS fusion also distorts color in the same way such as the IHS(Intensity Hue Saturation) fusion technique. In this paper, a FIHS fusion technique(FIHS-BR) which reduces color distortion by using the ratio of each spectral band and an adaptive FIHS fusion(FIHS-SABR) using spatial information and the ratio of each spectral band are proposed. The proposed FIHS-BR fusion reduces color distortion by adding different spatial detail improvement values for each spectral band. The spatial detail improvement values are derived from the ratio of spectral band. And the proposed FIHS-SABR fusion reduces more color distortion by readjusting the spatial detail improvement values for each spectral band according to the ratio of the spectral bands. The spatial detail improvement values are derived adaptively from the characteristics of spatial information of the local image. To evaluate the performance of the proposed FIHS-BR fusion and FIHS-SABR fusion, a computer simulation is performed for IKONOS remote sensing image. Results from the experiments show that the proposed methods have less color distortion for the forest regions which reveal severe color distortion in the traditional FIHS fusion. From the evaluation results of the characteristics of spectral information for fused image, we show that the proposed methods have best results.

  • PDF

Development of Korea Ocean Satellite Center (KOSC): System Design on Reception, Processing and Distribution of Geostationary Ocean Color Imager (GOCI) Data (해양위성센터 구축: 통신해양기상위성 해색센서(GOCI) 자료의 수신, 처리, 배포 시스템 설계)

  • Yang, Chan-Su;Cho, Seong-Ick;Han, Hee-Jeong;Yoon, Sok;Kwak, Ki-Yong;Yhn, Yu-Whan
    • Korean Journal of Remote Sensing
    • /
    • v.23 no.2
    • /
    • pp.137-144
    • /
    • 2007
  • In KORDI (Korea Ocean Research and Development Institute), the KOSC (Korea Ocean Satellite Center) construction project is being prepared for acquisition, processing and distribution of sensor data via L-band from GOCI (Geostationary Ocean Color Imager) instrument which is loaded on COMS (Communication, Ocean and Meteorological Satellite); it will be launched in 2008. Ansan (the headquarter of KORDI) has been selected for the location of KOSC between 5 proposed sites, because it has the best condition to receive radio wave. The data acquisition system is classified into antenna and RF. Antenna is designed to be $\phi$ 9m cassegrain antenna which has 19.35 G/T$(dB/^{\circ}K)$ at 1.67GHz. RF module is divided into LNA (low noise amplifier) and down converter, those are designed to send only horizontal polarization to modem. The existing building is re-designed and arranged for the KOSC operation concept; computing room, board of electricity, data processing room, operation room. Hardware and network facilities have been designed to adapt for efficiency of each functions. The distribution system which is one of the most important systems will be constructed mainly on the internet. and it is also being considered constructing outer data distribution system as a web hosting service for offering received data to user less than an hour.

Design of detection method for smoking based on Deep Neural Network (딥뉴럴네트워크 기반의 흡연 탐지기법 설계)

  • Lee, Sanghyun;Yoon, Hyunsoo;Kwon, Hyun
    • Convergence Security Journal
    • /
    • v.21 no.1
    • /
    • pp.191-200
    • /
    • 2021
  • Artificial intelligence technology is developing in an environment where a lot of data is produced due to the development of computing technology, a cloud environment that can store data, and the spread of personal mobile phones. Among these artificial intelligence technologies, the deep neural network provides excellent performance in image recognition and image classification. There have been many studies on image detection for forest fires and fire prevention using such a deep neural network, but studies on detection of cigarette smoking were insufficient. Meanwhile, military units are establishing surveillance systems for various facilities through CCTV, and it is necessary to detect smoking near ammunition stores or non-smoking areas to prevent fires and explosions. In this paper, by reflecting experimentally optimized numerical values such as activation function and learning rate, we did the detection of smoking pictures and non-smoking pictures in two cases. As experimental data, data was constructed by crawling using pictures of smoking and non-smoking published on the Internet, and a machine learning library was used. As a result of the experiment, when the learning rate is 0.004 and the optimization algorithm Adam is used, it can be seen that the accuracy of 93% and F1-score of 94% are obtained.

A Study on the Connective Validity of Technology Maturity and Industry for Core Technologies based on 4th Industrial Revolution (4차 산업혁명 기반 핵심기술에 대한 기술성숙도와 산업과 연계 타당성 연구)

  • Cho, Han-Jin;Jeong, Kyuman
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.3
    • /
    • pp.49-57
    • /
    • 2019
  • The core technology development of the Fourth Industrial Revolution is linked to the development of other core technologies, which will change the industrial structure in the future and create a new smart business model. In this paper, tried to analyze the technology maturity level and analyze the technology maturity. To do this, used technology trend information to investigate and integrate the market, policy, etc. Of core technology of the 4th Industrial Revolution to achieve a comprehensive maturity level. Because technology maturity measures are scored by technology developers, prejudices may be acted upon according to a person's tendency, which may be a subjective evaluation. It is also a measure of the maturity of individual technologies, and thus is not suitable for evaluating the overall system integration perspective. However, it is possible to evaluate the maturity before integrating the core element technologies constituting the whole system and to use it as a means to compare the effect of the whole system and its feasibility and play an important role in the planning of technology development.

A Novel Reference Model for Cloud Manufacturing CPS Platform Based on oneM2M Standard (제조 클라우드 CPS를 위한 oneM2M 기반의 플랫폼 참조 모델)

  • Yun, Seongjin;Kim, Hanjin;Shin, Hyeonyeop;Chin, Hoe Seung;Kim, Won-Tae
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.2
    • /
    • pp.41-56
    • /
    • 2019
  • Cloud manufacturing is a new concept of manufacturing process that works like a single factory with connected multiple factories. The cloud manufacturing system is a kind of large-scale CPS that produces products through the collaboration of distributed manufacturing facilities based on technologies such as cloud computing, IoT, and virtualization. It utilizes diverse and distributed facilities based on centralized information systems, which allows flexible composition user-centric and service-oriented large-scale systems. However, the cloud manufacturing system is composed of a large number of highly heterogeneous subsystems. It has difficulties in interconnection, data exchange, information processing, and system verification for system construction. In this paper, we derive the user requirements of various aspects of the cloud manufacturing system, such as functional, human, trustworthiness, timing, data and composition, based on the CPS Framework, which is the analysis methodology for CPS. Next, by analyzing the user requirements we define the system requirements including scalability, composability, interactivity, dependability, timing, interoperability and intelligence. We map the defined CPS system requirements to the requirements of oneM2M, which is the platform standard for IoT, so that the support of the system requirements at the level of the IoT platform is verified through Mobius, which is the implementation of oneM2M standard. Analyzing the verification result, finally, we propose a large-scale cloud manufacturing platform based on oneM2M that can meet the cloud manufacturing requirements to support the overall features of the Cloud Manufacturing CPS with dependability.

Real-Time GPU Task Monitoring and Node List Management Techniques for Container Deployment in a Cluster-Based Container Environment (클러스터 기반 컨테이너 환경에서 실시간 GPU 작업 모니터링 및 컨테이너 배치를 위한 노드 리스트 관리기법)

  • Jihun, Kang;Joon-Min, Gil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.11
    • /
    • pp.381-394
    • /
    • 2022
  • Recently, due to the personalization and customization of data, Internet-based services have increased requirements for real-time processing, such as real-time AI inference and data analysis, which must be handled immediately according to the user's situation or requirement. Real-time tasks have a set deadline from the start of each task to the return of the results, and the guarantee of the deadline is directly linked to the quality of the services. However, traditional container systems are limited in operating real-time tasks because they do not provide the ability to allocate and manage deadlines for tasks executed in containers. In addition, tasks such as AI inference and data analysis basically utilize graphical processing units (GPU), which typically have performance impacts on each other because performance isolation is not provided between containers. And the resource usage of the node alone cannot determine the deadline guarantee rate of each container or whether to deploy a new real-time container. In this paper, we propose a monitoring technique for tracking and managing the execution status of deadlines and real-time GPU tasks in containers to support real-time processing of GPU tasks running on containers, and a node list management technique for container placement on appropriate nodes to ensure deadlines. Furthermore, we demonstrate from experiments that the proposed technique has a very small impact on the system.