• Title/Summary/Keyword: 경로설정기법

Search Result 375, Processing Time 0.034 seconds

A Study on the Analysis Technique of Sequence Landscaping through the Application and Development of Visual Amount Calculation Program of Landscapes (경관의 시각량 산출 프로그램 개발과 적용을 통한 연속경관 시퀀스 분석기법 연구)

  • Koo, Min-Ah
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.44 no.5
    • /
    • pp.12-25
    • /
    • 2016
  • In this study, in order to facilitate analysis in a continuous sequence, including the concept of the landscape experience time, countless frames of a continuous landscape were extracted. The amount of visual elements in each frame was data-converted numerically to take advantage of the quantitative data necessary for landscape planning and design was calculated in the rhythm of the sequence. In Order to shoot video with the flow of the line of sight of experience in landscape districts and landscape control points along the landscape corridor which is a continuous path, each of the corresponding computer motion techniques. This study developed a CRVP Koo computer program to effectively calculate the continuous visual number of specific landscape components by extracting uncounted frames at regular intervals, and after verifying, attempting to apply this to the target site. Through the applied result, it was possible to extract the digitized quantitative rhythm for each component of each landscape, the margin of error is very small when compared with the results of manual in photoshop, it was able to overcome the drawbacks of the manual. Using the rhythm of the derived sequence, and those close to the experience of the landscape, it was possible to achieve quantitative analysis derived from a variety of perspectives as well as was possible to be used as quantitative basis data and analysis technique for landscape planning and design.

Grid-based Trajectory Cloaking Method for protecting Trajectory privacy in Location-based Services (위치기반서비스에서 개인의 궤적 정보를 보호하기 위한 그리드 기반 궤적 클로킹 기법)

  • Youn, Ji-hye;Song, Doo-hee;Cai, Tian-yuan;Park, Kwang-jin
    • Journal of Internet Computing and Services
    • /
    • v.18 no.5
    • /
    • pp.31-38
    • /
    • 2017
  • Recently with the rapid development of LBS (Location-based Services) technology, approaches of protecting user's location have gained tremendous attentions. For using LBS, users need to forward their real locations to LBS server. However, if the user sends his/her real location to LBS server, the server will have the all the information about user in LBS. Moreover, if the user opens it to LBS server for a long time, the trajectory of user may be released. In this paper, we propose GTC (Grid-based Trajectory Cloaking) method to address the privacy issue. Different from existing approaches, firstly the GTC method sets the predicting trajectory and divides the map into $2^n*2^n$ grid. After that we will generate cloaking regions according to user's desired privacy level. Finally the user sends them to LBS server randomly. The GTC method can make the cost of process less than sequential trajectory k-anonymity. Because of confusing the departure and destination, LBS server could not know the user's trajectory any more. Thus, we significantly improve the privacy level. evaluation results further verify the effectiveness and efficiency of our GTC method.

PrimeFilter: An Efficient XML Data Filtering based on Prime Number Indexing (PrimeFilter: 소수 인덱싱 기법에 기반한 효율적 XML 데이타 필터링)

  • Kim, Jae-Hoon;Kim, Sang-Wook;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.35 no.5
    • /
    • pp.421-431
    • /
    • 2008
  • Recently XML is becoming a de facto standard for online data exchange between heterogeneous systems and also the research of streaming XML data filtering comes into the spotlight. Since streaming XML data filtering technique needs rapid matching of queries with XML data, it is required that the query processing should be efficiently performed. Until now, most of researches focused only on partial sharing of path expressions or efficient predicate processing and they were work for time and space efficiency. However, if containment relationship between queries is previously calculated and the lowest level query is matched with XML data, we can easily get a result that high level queries can match with the XML data without any other processing. That is, using this containment technique can be another optimal solution for streaming XML data filtering. In this paper, we suggest an efficient XML data filtering based on prime number indexing and containment relationship between queries. Through some experimental results, we present that our suggested method has a better performance than the existing method. All experiments have shown that our method has a more than two times better performance even though each experiment has its own distinct test purpose.

The Effects of Job Atisfaction and Organizational Commitment on the Level of Organizational Learning for the Private Security Guards (민간경비원의 조직학습화 수준에 따른 조직몰입이 직무만족에 미치는 영향)

  • Kang, Dong-beom;Kim, Sang Jin
    • Convergence Security Journal
    • /
    • v.16 no.1
    • /
    • pp.49-58
    • /
    • 2016
  • This study is to suggest that the Effects of job satisfaction and Organizational Commitment on the Level of Organizational Learning for the Private Security Guards. in Seoul and in the sales launch of the eight companies selected by the wireless, Companies under the cooperation of managers throughout the visit and the subjects of this study was good enough for the purpose described by the following stratified cluster random sampling 2009 September to 10 October to call a total of 320 questionnaires distributed 51 copies unfaithful 259 copies were used except for analysis. I used SPSSWIN 21.0 and AMOS 21.0 to reliability analysis, factor analysis, correlation analysis, independent-sample t-test, analysis of variance, stepwise multiple regression analysis and path analysis. The level of statistical significance was set to .05. The following are conclusions. the business aspect and human aspect in the Level of Organizational Learning has an effect on the Organizational Commitment. and the Organizational Commitment has an effect on the Job Satisfaction.

A study on context-aware and Energy Efficient Routing Protocol for Mobile Ad-hoc Network (상황인식 기반의 에너지 효율적인 경로 설정 기법 연구)

  • Mun, Chang-Min;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.377-380
    • /
    • 2010
  • MANET(Mobile Ad-hoc Network) has been proposed as a infrastructure-less network using distributed algorithm for remote environment monitoring and control. The mobility of MANET would make the topology change frequently compared with a static network and a node is resource-constrained. Hence, to improve the routing protocol in MANET, energy efficient routing protocol is required as well as considering the mobility would be needed. In this paper, we extend RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure by a modifying the level of cluster. We call this network protocol CACH-RODMRP. Our contribution consists estimating the optimal level of clustering depth with considering node position and reducing the network residual energy. The simulation results of proposal algorithm show that the energy is significantly reduced compared with the previous clustering based routing algorithm for the MANET.

  • PDF

Point Cloud Content in Form of Interactive Holograms (포인트 클라우드 형태의 인터랙티브 홀로그램 콘텐츠)

  • Kim, Dong-Hyun;Kim, Sang-Wook
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.9
    • /
    • pp.40-47
    • /
    • 2012
  • Existing art, media art, accompanied by a new path of awareness and perception instrumentalized by the human body, creating a new way to watch the interaction is proposed. Western art way to create visual images of the point cloud that represented a form that is similar to the Pointage. This traditional painting techniques using digital technology means reconfiguration. In this paper, a new appreciation of fusion of aesthetic elements and digital technology, making the point cloud in the form of video. And this holographic film projection of the spectator, and gestures to interact with the video content is presented. A Process of making contents is intent planning, content creation, content production point cloud in the form of image, 3D gestures for interaction design process, go through the process of holographic film projection. Visual and experiential content of memory recall process takes place in the consciousness of the people expressed. Complete the process of memory recall, uncertain memories, memories materialized, recalled. Uncertain remember the vague shapes of the point cloud in the form of an image represented by the image. As embodied memories through the act of interaction to manipulate images recall is complete.

MPICH-GP : An MPI Extension to Supporting Private IP Clusters in Grid Environments (MPICH-GP : 그리드 상에서 사설 IP 클러스터 지원을 위한 MPI 확장)

  • Park, Kum-Rye;Yun, Hyun-Jun;Park, Sung-Yong;Kwon, Oh-Young;Kwon, Oh-Kyoung
    • The KIPS Transactions:PartA
    • /
    • v.14A no.1 s.105
    • /
    • pp.1-14
    • /
    • 2007
  • MPICH-G2 is an MPI implementation to solve complex computational problems by utilizing geographically dispersed computing resources in grid environments. However, the computation nodes in MPICH-G2 are exposed to the external network due to the lack of supporting the private IP clusters, which raises the possibility of malicious security attacks. In order to address this problem, we propose MPICH-GP with a new relay scheme combining NAT(Network Address Translation) service and an user-level proxy. The proxy running on the front-end system of private IP clusters forwards the incoming connection requests to the systems inside the clusters. The outgoing connection requests out of the cluster are forwarded through the NAT service on the front-end system. Through the connection path between the pair of processes, the requested MPI jobs can be successfully executed in grid environments with various clusters including private IP clusters. By simulations, we show that the performance of MPICH-GP reaches over 80% of the performance of MPICH-G2, and over 95% in ease of using RANK management method.

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.

Research for improving vulnerability of unmanned aerial vehicles (무인항공기 보안 취약점 개선을 위한 연구)

  • Lee, Kyung-Hwan;Ryu, Gab-Sang
    • Smart Media Journal
    • /
    • v.7 no.3
    • /
    • pp.64-71
    • /
    • 2018
  • Utilization of unmanned aerial vehicles (UAVs) are rapidly expanding to various fields ranging from defense, industry, entertainment and personal hobbies. Due to the increased activities of unmanned airplanes, many security problems have emerged, including flight path errors to undesired destinations, secondary threats due to exposed securities caused by the capture of unmanned airplanes in hostile countries. In this paper, we find security vulnerabilities in UAVs such as GPS spoofing, hacking captured video information, malfunction due to signal attenuation through jamming, and exposure of personal information due to image shooting. In order to solve this problem, the stability of the unstructured data is secured by setting the encryption of the video shooting information section using the virtual private network (VPN) to prevent the GPS spoofing attack. In addition, data integrity was ensured by applying personal information encryption and masking techniques to minimize the secondary damage caused by exposure of the UAV and to secure safety. It is expected that it will contribute to the safe use and stimulation of industry in the application field of UAV currently growing.

Peer to Peer Anonymous Protocol Based Random Walk (랜덤 워크 기반의 P2P 익명 프로토콜)

  • Cho, Jun-Ha;Rhee, Hyun-Sook;Park, Hyun-A;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.6
    • /
    • pp.65-76
    • /
    • 2007
  • The P2P file sharing system sends the results to users by searching the files in the shared folders. In the process of it, the problem is that the transferred information includes the pathname and file information and it can be revealed who searches which files. In related to this problem, anonymous file sharing P2P protocol has been an active research area where a number of works have been produced. However, the previous studies still have a few of weakness. Therefore, We propose two anonymous P2P file sharing protocols based on the decentralized and unstructured Random Walk. The first scheme uses the dynamic onion routing where the requester can receive the wanted file without knowing other peers' IDs. The second scheme uses the IP multicast method which lowers the computational overhead. Both of them are more suited for the dynamic P2P system.