• Title/Summary/Keyword: 현위치 처리

Search Result 238, Processing Time 0.021 seconds

Sharing of DLNA Media Contents among Inter-homes based on DHCP or Private IP using Homeserver (동적 사설 IP 기반의 다중 홈간 DLNA 미디어 컨텐츠 공유)

  • Oh, Yeon-Joo;Lee, Hoon-Ki;Kim, Jung-Tae;Paik, Eui-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.709-716
    • /
    • 2006
  • According to the increase of various AV media devices and contents in the digital home, the DLNA becomes to play an important role as the interoperability standard between then Since this guideline only focuses on the interoperability among home networked devices, media players, and media contents existing inside of the homenetwork, there is no retrieval and transmission method for sharing multimedia contents located over several homes via Internet. Additionally, this guideline lets device-detection and notification messages to be transmitted using W multicast methods, and current Internet environment cannot guarantee consistent IP multicast services, it has the limitation that it cannot retrieve and control DLNA devices in other digital homes remotely via the Internet. Therefore, in this paper, we propose the IHM(Inter-Home Media) proxy system and its operating mechanism to provide a way of sharing media contents distributed over multiple DLNA-based homes, through analyzing these limitations and building up a sharing method for A/V media contents distributed over the DLNA homes based on the dynamic or private IP networks. Our method removes the limitation on the user locations through sharing distributed media contents, and also makes cost-downs for storing media contents, from the view point of individual residents.

Improved CS-RANSAC Algorithm Using K-Means Clustering (K-Means 클러스터링을 적용한 향상된 CS-RANSAC 알고리즘)

  • Ko, Seunghyun;Yoon, Ui-Nyoung;Alikhanov, Jumabek;Jo, Geun-Sik
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.6
    • /
    • pp.315-320
    • /
    • 2017
  • Estimating the correct pose of augmented objects on the real camera view efficiently is one of the most important questions in image tracking area. In computer vision, Homography is used for camera pose estimation in augmented reality system with markerless. To estimating Homography, several algorithm like SURF features which extracted from images are used. Based on extracted features, Homography is estimated. For this purpose, RANSAC algorithm is well used to estimate homography and DCS-RANSAC algorithm is researched which apply constraints dynamically based on Constraint Satisfaction Problem to improve performance. In DCS-RANSAC, however, the dataset is based on pattern of feature distribution of images manually, so this algorithm cannot classify the input image, pattern of feature distribution is not recognized in DCS-RANSAC algorithm, which lead to reduce it's performance. To improve this problem, we suggest the KCS-RANSAC algorithm using K-means clustering in CS-RANSAC to cluster the images automatically based on pattern of feature distribution and apply constraints to each image groups. The suggested algorithm cluster the images automatically and apply the constraints to each clustered image groups. The experiment result shows that our KCS-RANSAC algorithm outperformed the DCS-RANSAC algorithm in terms of speed, accuracy, and inlier rate.

Security Threats Analysis for Network-based Mobile IPv6 (네트워크 기반 Mobile IPv6 보안 취약점 분석)

  • Kim, Hyun-Gon;Seo, Jae-Hyeon;Oh, Byeong-Kyun;Ahn, Tae-Nam;Kim, Jin-Hyung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.137-147
    • /
    • 2007
  • In the host-based Mobile IPv6, a mobile node is responsible for doing the signaling to its home agent to enable session continuity as it moves between subnets. To remove the mobile node's signalling processing load, the network-based Mobile IPv6 has been proposed recently. It allows session continuity for a mobile node without its involvement in mobility management. The proxy mobility agent in the network performs the signaling and does the mobility management on behalf of the mobile node. However, to make secure communications for a mobile node, security mechanisms against diverse attacks should be adopted. To do this, first of all security threats to the network-based Mobile IPv6 should be also identified and analyzed. Potential attack objectives may be to consume network services at the cost of a legitimate mobile node and, eavesdropping and fabrication of user traffic through interception of a mobile node's communications. This paper identifies and discusses security threats to the network-based Mobile IPv6 in details. The results of threats analysis are limited to threats that are peculiar to the network-based Mobile IPv6 except threats to IPv6 in general.

Integration of Condensation and Mean-shift algorithms for real-time object tracking (실시간 객체 추적을 위한 Condensation 알고리즘과 Mean-shift 알고리즘의 결합)

  • Cho Sang-Hyun;Kang Hang-Bong
    • The KIPS Transactions:PartB
    • /
    • v.12B no.3 s.99
    • /
    • pp.273-282
    • /
    • 2005
  • Real-time Object tracking is an important field in developing vision applications such as surveillance systems and vision based navigation. mean-shift algerian and Condensation algorithm are widely used in robust object tracking systems. Since the mean-shift algorithm is easy to implement and is effective in object tracking computation, it is widely used, especially in real-time tracking systems. One of the drawbacks is that it always converges to a local maximum which may not be a global maximum. Therefore, in a cluttered environment, the Mean-shift algorithm does not perform well. On the other hand, since it uses multiple hypotheses, the Condensation algorithm is useful in tracking in a cluttered background. Since it requires a complex object model and many hypotheses, it contains a high computational complexity. Therefore, it is not easy to apply a Condensation algorithm in real-time systems. In this paper, by combining the merits of the Condensation algorithm and the mean-shift algorithm we propose a new model which is suitable for real-time tracking. Although it uses only a few hypotheses, the proposed method use a high-likelihood hypotheses using mean-shift algorithm. As a result, we can obtain a better result than either the result produced by the Condensation algorithm or the result produced by the mean-shift algorithm.

Cost Effective Remote Subscription scheme for Ubiquitous Convergence IP-based Network (유비쿼터스 컨버젼스 IP 기반 대용량 네트워크에서 비용 절감형 리모트-서브스크립션 기법)

  • Shin, Soo-Young;Yoon, Young-Muk;Park, Soo-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.95-104
    • /
    • 2007
  • Mobile multimedia services such as TV-call or video streaming are gradually becoming popular in the 3rd or more generation mobile network (IMT-2000). Multimedia traffic is expected to continue increasing into the coming years, and IP technology is considered to be the efficient way of transporting such huge volumes of multimedia traffic. IP-based IMT network platform represents an evolution from IMT-2000. The structure of IP-based IMT network as ubiquitous platform is three-layered model : Middleware including Network Control PlatForm (NCPF) and Service Support PlatForm (SSPF), IP-BackBone (IP-BB), access network including sensor network. Mobility Management (MM) architecture in NCPF is proposed for IP-based IMT network in order to manage routing information and location information separately. The generous existing method of multicast control in IP-based IMT network is Remote Subscription. But Remote Subscription has problem that should be reconstructed whole multicast tree when sender in multicast tree moves to another area. To solve this problem, we propose the way to put Multicast-manager in NCPF.

Development of a Framework for Anti-Collision System of Moving Drilling Machines on a Drill Floor (시추 작업장의 이동식 시추 장비 충돌 방지 시스템을 위한 프레임워크 개발)

  • Lee, Jaeyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.4
    • /
    • pp.330-336
    • /
    • 2020
  • An anti-collision system between equipment is essential on a drill floor where multiple moving machines are operated simultaneously. This is to prevent accidents by halting the machines when required, by inspecting possibility of a collision based on the relative position data sent by the equipment. In this paper, we propose a framework for an Anti-Collision System (ACS) by considering expandability of the number of machines and computational speed, to promote development of drilling machines and corresponding ACS software. Each drilling equipment is represented as an object in the software with its own message format, and the message is constructed with serialization/deserialization to manage any additional equipment or data. The data handling process receives the current status of machines from the drilling control network, and relays a collision related message (including bypass signal) back to the machines. A commercial visualization software shows the bounding boxes moving with the equipment and indicates probable collision. It has been determined that the proposed system maintains total execution time below 5ms to process data from the network and relay the information hence, the system has no effect on the machine control systems having 100ms control cycle.

Characteristics of Spore Density and Colonization Pattern of Arbuscular Mycorrhizal Fungi on the No-tillage Soil under Greenhouse Condition (시설재배지 무경운 토양에서 녹비작물별 Arbuscular Mycorrhizal Fungi(AMF) 감염양상과 포자밀도 특성)

  • Yang, Seung-Koo;Seo, Youn-Won;Kim, Byeong-Ho;Sohn, Bo-Kyoon;Wee, Chi-Do;Lee, Jeong-Hyun;Jung, Woo-Jin;Park, Ro-Dong
    • Korean Journal of Organic Agriculture
    • /
    • v.19 no.3
    • /
    • pp.343-355
    • /
    • 2011
  • This work was studied the effects of spore density and infection of arbuscular mycorrhizal fungi (AMF) for no-tillage organic cultivation of pepper with wintering green manure crops cultivation in greenhouse field. Spore density of arbuscular mycorrhizal fungi (AMF) in green manure crops was 189 spores/30g fresh soils in control including alive spore (82 spores). Spore density of AMF in all green manure crops was totally 196~226 spores/30g fresh soil and alive spore was 84~112 spores/30g fresh soil. Spore density of AMF in soils of Pepper crop was range of 48.0~56.7 spores/30g fresh soils after cultivation of green manure crops. Infection structure of AMF was not significantly difference in soils of green manure crops and Pepper crop after cultivation of green manure crops. Infection rate of AMF in roots of green crops was low level by 2.8% in giant chickweed, 7.4% in rye, 9.3% in hairy vetch. Infection rate of AMF in roots of barley was the highest level by 20.3%. Infection rate of AMF in roots of Pepper crop was range of 5.2~7.2% after cultivation of green manure crops Also, infection rate of AMF in roots of Pepper crop was 8.1% after the harvest of barley. Infection structure of AMF in barley very well consisted of network with internal hyphae, while hairy vetch and rye tended to no network. There was not a significant relationship between spore density in soils and infection rate of AMF in rhizosphere of Pepper.

Time Synchronization Robust to Topology Change Through Reference Node Re-Election (기준노드의 재선정을 통한 토폴로지 변화에 강인한 시간 동기화)

  • Jeon, Young;Kim, Taehong;Kim, Taejoon;Lee, Jaeseang;Ham, Jae-Hyun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.8
    • /
    • pp.191-200
    • /
    • 2019
  • In an Ad-hoc network, a method of time synchronizing all the nodes in a network centering on one reference node can be used. A representative algorithm based on a reference node is Flooding Time Synchronization Protocol (FTSP). In the process of sending and receiving messages, predictable and unpredictable delays occur, which should be removed because it hinders accurate time synchronization. In multi-hop communications, hop delays occur when a packet traverses a number of hops. These hop delays significantly degrade the synchronization performance among nodes. Therefore, we need to find a method to reduce these hop delays and increase synchronization performance. In the FTSP scheme, hop delays can be greatly increased depending on the position of a reference node. In addition, in FTSP, a node with the smallest node ID is elected as a reference node, hence, the position of a reference node is actually arbitrarily determined. In this paper, we propose an optimal reference node election algorithm to reduce hop delays, and compare the performance of the proposed scheme with FTSP using the network simulator OPNET. In addition, we verify that the proposed scheme has an improved synchronization performance, which is robust to topology changes.

A Fog-based IoT Service Interoperability System using Blockchain in Cloud Environment (클라우드 환경에서 블록체인을 이용한 포그 기반 IoT 서비스 상호운용 시스템)

  • Kim, Mi Sun;Park, Yong Suk;Seo, Jae Hyun
    • Smart Media Journal
    • /
    • v.11 no.3
    • /
    • pp.39-53
    • /
    • 2022
  • Cloud of Things (CoT) can provide IoT applications with unlimited storage functions and processing power supported by cloud services. However, in a centralized cloud of things, it can create a single point of failure that can lead to bottleneck problems, outages of the CoT network. In this paper, to solve the problem of centralized cloud of things and interoperate between different service domains, we propose an IoT service interoperability system using distributed fog computing and blockchain technology. Distributed fog is used to provide real-time data processing and services in fog systems located at a geographically close distance to IoT devices, and to enable service interoperability between each fog using smart contracts and distributed ledgers of the blockchain. The proposed system provides services within a region close to the distributed fog entrusted with the service from the cloud, and it is possible to access the services of other fogs without going through the cloud even between fogs. In addition, by sharing a service right token issuance information between the cloud and fog nodes using a blockchain network, the integrity of the token can be guaranteed and reliable service interoperability between fog nodes can be performed.

Mouse Embryonic Stem Cell Uptakes of Buforin 2 and pEP-1 Conjugated with EGFP (생쥐 배아 줄기세포의 Buforin 2 및 pEP-1에 결합된 EGFP의 세포 내 수송)

  • Jung, Su-Hyun;Park, Seong-Soon;Lim, Hyun-Jung;Cheon, Yong-Pil
    • Development and Reproduction
    • /
    • v.11 no.2
    • /
    • pp.111-119
    • /
    • 2007
  • Differentiation of cells can be induced through modulation of endogenous regulators using exogenous factors. Useful transfection systems to transport a specific exogenous regulator into cell have been tried but still there are many obstacles to overcome. In this study, we examined the transfection efficiency of cell permeable peptides (CPPs) in mouse embryonic stem cell under the various conditions. To identify the CPP-mediated translocation of a protein, we employed recombinant CPP-enhanced green fluorescent protein (EGFP). Viability of R1 cells was different between experimental groups depending on the kind of CPP and the concentration of CPP-EGFP. Translocation of CPP-EGFPs into the R1 cells was not detected until 30 min after CPP-EGFPs treatment in all groups. After 1 hr, translocation of pEP-1-EGFP-N was detected, but it could not be detected in the other group. Transfection of pEP-1EGFP-N was independent on its concentration. The time course did not show saturation even after 24 hr in pEP-1-EGFP-N. These results showed that the permeability depended on the kind of CPP and the location of His-tag in the case of examined CPPs, and did not need biological energy. On summary, the efficiency of transfection of CPP-EGFP depends on the CPP sequences but the culture time is not a key factor in transfection for the mouse embryonic stem cell. For the future studies to improve the efficiency of translocation of protein into embryonic stem cells, it is needed to develop modified CPP or mediator. The studies would be very useful to induce the differentiation of embryonic stem cells.

  • PDF