• Title/Summary/Keyword: updating system

Search Result 601, Processing Time 0.029 seconds

The Security Life Cycler Energy Service Platform for Universal Middleware (유니버설미들웨어기반 생명주기 보안에너지 서비스플랫폼 연구)

  • Lee, Hae-Jun;Hwang, Chi-Gon;Yoon, Chang-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.6
    • /
    • pp.1197-1202
    • /
    • 2017
  • Security services that support electric energy service gateway require relatively high reliability. In particular, the application services that accompany communications and data are run organically. Each of the security services should support a secure service platform that supports a secure, scalable life cycle for existing services which should be extends security layer of Universal Middleware. In this convergence platform, it is the study of security transfer modular services that allow independent life cycle management of systems through Universal middleware. First, It is modular in terms of energy consumption service and data, enabling real-time operation, communications, remote management and applications. Second, the life cycle of the secure module to support start, stop and updating of the security module by applying the security policy module layer concept. It is modular system enabling to design of dyanmic models in the smart grid, the service was intended to be standardized and applied to the security service platform.

Development of a Secure Routing Protocol using Game Theory Model in Mobile Ad Hoc Networks

  • Paramasivan, Balasubramanian;Viju Prakash, Maria Johan;Kaliappan, Madasamy
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.75-83
    • /
    • 2015
  • In mobile ad-hoc networks (MANETs), nodes are mobile in nature. Collaboration between mobile nodes is more significant in MANETs, which have as their greatest challenges vulnerabilities to various security attacks and an inability to operate securely while preserving its resources and performing secure routing among nodes. Therefore, it is essential to develop an effective secure routing protocol to protect the nodes from anonymous behaviors. Currently, game theory is a tool that analyzes, formulates and solves selfishness issues. It is seldom applied to detect malicious behavior in networks. It deals, instead, with the strategic and rational behavior of each node. In our study,we used the dynamic Bayesian signaling game to analyze the strategy profile for regular and malicious nodes. This game also revealed the best actions of individual strategies for each node. Perfect Bayesian equilibrium (PBE) provides a prominent solution for signaling games to solve incomplete information by combining strategies and payoff of players that constitute equilibrium. Using PBE strategies of nodes are private information of regular and malicious nodes. Regular nodes should be cooperative during routing and update their payoff, while malicious nodes take sophisticated risks by evaluating their risk of being identified to decide when to decline. This approach minimizes the utility of malicious nodes and it motivates better cooperation between nodes by using the reputation system. Regular nodes monitor continuously to evaluate their neighbors using belief updating systems of the Bayes rule.

The Strategic Ambidexterity of Online Game Companies: The Exploitation and Exploration of NCsoft (온라인 게임회사의 전략적 양면성: 엔씨소프트의 활용과 탐험)

  • Bae, Joonheui;Koo, Dong Mo
    • Journal of Korea Game Society
    • /
    • v.15 no.1
    • /
    • pp.115-124
    • /
    • 2015
  • This research analyzed the case of Ncsoft to study the organizational learning, exploitation and exploration that create dynamic capability in hypercompetitive environment. First of all, we demonstrated the activities of exploitation and exploration in Ncsoft according to the life cycle of online game industry. An exploitation related to routine, learning and fit with existing environment brings about incremental innovation. In contrast, an exploration associated with non-learning, flexibility with changing environment results in radical innovation. We examined them based on the life cycle of its various game services. NCsoft that built the leading position in online game industry focused the exploitation activities at the stage of beginning period and growth, whereas NCsoft has increased the activities of exploration at period of mature. In addition, the firm conducts an exploration for its brand new game services and R&D. Conversely, An exploitation is conducted for sustainable updating of patch service and marketing and system building. The result implies that online game companies create sustainable competitive advantage using the balance between exploitation and exploration.

Image-Based Relighting Rendering System (영상 기반 실시간 재조명 렌더링 시스템)

  • Kim, Soon-Hyun;Lee, Joo-Haeng;Kyung, Min-Ho
    • Journal of the HCI Society of Korea
    • /
    • v.2 no.1
    • /
    • pp.25-31
    • /
    • 2007
  • We develop an interactive relighting renderer allowing camera view changes based on a deep-frame buffer approach. The renderer first caches the rendering parameters for a given 3D scene in an auxiliary buffer with the same size of the output image. The rendering parameters independent from light changes are selected from the shading models used for shading pixels. Next, as the user interactively edits one light at one time, the relighting renderer instantly re-shades each pixel by updating the contribution of the changed light with the shading parameters cached in the deep-frame buffer. When the camera moves, the cache values should be re-computed because the currently cached values become obsolete. We present a novel method to synthesize them quickly from the cache images of the user specified cameras by using an image-based technique. This computations are all performed on GPU to achieve real-time performance.

  • PDF

Design and Implementation of a Java Package for Sharing Array Data by the DSM Interface on a Cluster of Workstations (워크스테이션 클러스터 상에서 분산공유메모리 인터페이스로 배열 데이터의 공유를 지원하는 Java 패키지의 설계와 구현)

  • Lim, Hae-Jung;Kim, Myung
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.3
    • /
    • pp.355-365
    • /
    • 1999
  • In this paper, we present JPAS(Java Package for Array Sharing) which is a Java Package for sharing arrays of data on a cluster of workstations. It allows us to divide an array of data into several pieces, and to place each piece on a different host. JPAS uses Java RMI so that the entire array can be accessed by a location transparent interface which is similar to that of a distributed shared memory system. JPAS is portable and easy to use since it is implemented using pure Java. In order to reduce network overhead, JPAS allows programmers to use their prior knowledge of the application. Data consistency can be maintained through the value updating methods defined for all the elements of an array. We developed parallel programs which use JPAS, and tested them on a cluster of workstations. The test results show that JPAS is a parallel programming tool with reasonably good performance.

  • PDF

Digital Satellite Radio Broadcast Channel Information Search Process Method (Digital Satellite Radio 방송의 채널 정보 Searching 처리 Method에 관한 연구)

  • Lee, Seung-Hun;Na, Sang-Sin;Kim, Young-Kil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.803-809
    • /
    • 2011
  • In this paper, we present a very useful method for updating digital satellite radio broadcast channel information. When a devices equipped with function to receive Digital Satellite Radio such as Home Theater, MP3 player, mobile phones, car audio system and various other types of Digital Devices, receives new Digital satellite radio (will be mentioned as XM radio onwards) broadcast channel information, only the current received XM radio broadcast channel and N number of pre/post nearby broadcast channels are scanned randomly in zigzag manner. Then the previous XM radio broadcast channel information updated with the newly received XM radio broadcast channel information. Since this method can prevent batch update for all XM radio channel, including some channels which less likely did not select by user, update process for real time frequently changed XM radio broadcast channel information can be performed efficiently with minimal or without delay.

Motion Detection using Adaptive Background Image and A Net Model Pixel Space of Boundary Detection (적응적 배경영상과 그물형 픽셀 간격의 윤곽점 검출을 이용한 객체의 움직임 검출)

  • Lee Chang soo;Jun Moon seog
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.92-101
    • /
    • 2005
  • It is difficult to detect the accurate detection which leads the camera it moves follows in change of the noise or illumination and Also, it could be recognized with backgound if the object doesn't move during hours. In this paper, the proposed method is updating changed background image as much as N*M pixel mask as time goes on after get a difference between imput image and first background image. And checking image pixel can efficiently detect moving by computing fixed distance pixel instead of operate all pixel. Also, set up minimum area of object to use boundary point of object abstracted through checking image pixel and motion detect of object. Therefore motion detection is available as is fast and correct without doing checking image pixel every Dame. From experiment, the designed and implemented system showed high precision ratio in performance assessment more than 90 percents.

Efficient Processing method of OLAP Range-Sum Queries in a dynamic warehouse environment (다이나믹 데이터 웨어하우스 환경에서 OLAP 영역-합 질의의 효율적인 처리 방법)

  • Chun, Seok-Ju;Lee, Ju-Hong
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.427-438
    • /
    • 2003
  • In a data warehouse, users typically search for trends, patterns, or unusual data behaviors by issuing queries interactively. The OLAP range-sum query is widely used in finding trends and in discovering relationships among attributes in the data warehouse. In a recent environment of enterprises, data elements in a data cube are frequently changed. The problem is that the cost of updating a prefix sum cube is very high. In this paper, we propose a novel algorithm which reduces the update cost significantly by an index structure called the Δ-tree. Also, we propose a hybrid method to provide either approximate or precise results to reduce the overall cost of queries. It is highly beneficial for various applications that need quick approximate answers rather than time consuming accurate ones, such as decision support systems. An extensive experiment shows that our method performs very efficiently on diverse dimensionalities, compared to other methods.

Generation of Building and Contour Layers for Digital Mapping Using LiDAR Data (LiDAR 데이터를 이용한 수치지도의 건물 및 등고선 레이어 생성)

  • Lee Dong-Cheon;Yom Jae-Hong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.3
    • /
    • pp.313-322
    • /
    • 2005
  • Rapid advances in technology and changes in human and cultural activities bring about changes to the earth surface in terms of spatial extension as well as time frame of the changes. Such advances introduce shorter updating frequency of maps and geospatial database. To satisfy these requirements, recent research efforts in the geoinformatics field have been focused on the automation and speeding up of the mapping processes which resulted in products such as the digital photogrammetric workstation, GPSIINS, applications of satellite imagery, automatic feature extraction and the LiDAR system. The possibility of automatically extracting buildings and generating contours from airborne LiDAR data has received much attention because LiDAR data produce promising results. However, compared with the manually derived building footprints using traditional photogrammetric process, more investigation and analysis need to be carried out in terms of accuracy and efficiency. On the other hand, generation of the contours with LiDAR data is more efficient and economical in terms of the quality and accuracy. In this study, the effects of various conditions of the pre-processing phase and the subsequent building extraction and contour generation phases for digital mapping have on the accuracy were investigated.

Information entropy based algorithm of sensor placement optimization for structural damage detection

  • Ye, S.Q.;Ni, Y.Q.
    • Smart Structures and Systems
    • /
    • v.10 no.4_5
    • /
    • pp.443-458
    • /
    • 2012
  • The structural health monitoring (SHM) benchmark study on optimal sensor placement problem for the instrumented Canton Tower has been launched. It follows the success of the modal identification and model updating for the Canton Tower in the previous benchmark study, and focuses on the optimal placement of vibration sensors (accelerometers) in the interest of bettering the SHM system. In this paper, the sensor placement problem for the Canton Tower and the benchmark model for this study are first detailed. Then an information entropy based sensor placement method with the purpose of damage detection is proposed and applied to the benchmark problem. The procedure that will be implemented for structural damage detection using the data obtained from the optimal sensor placement strategy is introduced and the information on structural damage is specified. The information entropy based method is applied to measure the uncertainties throughout the damage detection process with the use of the obtained data. Accordingly, a multi-objective optimal problem in terms of sensor placement is formulated. The optimal solution is determined as the one that provides equally most informative data for all objectives, and thus the data obtained is most informative for structural damage detection. To validate the effectiveness of the optimally determined sensor placement, damage detection is performed on different damage scenarios of the benchmark model using the noise-free and noise-corrupted measured information, respectively. The results show that in comparison with the existing in-service sensor deployment on the structure, the optimally determined one is capable of further enhancing the capability of damage detection.