• Title/Summary/Keyword: Address time

Search Result 1,642, Processing Time 0.026 seconds

Post Sender Recognition using SIFT (SIFT를 이용한 우편영상의 송신자 인식)

  • Kim, Young-Won;Jang, Seung-Ick;Lee, Sung-Jun
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.11
    • /
    • pp.48-57
    • /
    • 2010
  • Previous post sender recognition study was focused on recognizing the address of receiver. Relatively, there was lack of study to recognize the information of sender's address. Post sender recognition study is necessary for the service and application using sender information such as returning. This paper did the experiment and suggested how to recognize post sender using SIFT. Although SIFT shows great recognition rate, SIFT had problems with time and mis-recognition. One is increased time to match keypoints in proportion as the number of registered model. The other is mis-recognition of many similar keypoints even though they are all different models due to the nature of post sender. To solve the problem, this paper suggested SIFT adding distance function and did the experiment to compare time and function. In addition, it is suggested how to register and classify models automatically without the manual process of registering models.

Performance Enhancement of Handover in mSCTP using Pre-acquisition RA in WLAN (WLAN에서 RA 선수신을 이용한 mSCTP 핸드오버 성능 향상)

  • Choi, Soon-Won;Kim, Kwang-Ryoul;Min, Sung-Gi
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.156-164
    • /
    • 2006
  • The SCTP (Stream Control Transmission Protocol) implementation with the DAR (Dynamic Address Reconfiguration) extension is called the mSCTP (Mobile SCTP) that is proposed recently for mobility support in transport layer. The mSCTP does not satisfy short handover latency for real-time applications and it has no specific handover decision mechanisms. In this paper, we propose fast handover schemes for mobile nodes that are moving into different subnet using pre-acquisition RA (Router Advertisement) and L3 trigger for improving handover performance. Furthermore, we introduce three specific methods which are RA cache, FMIPv6 (Fast Handovers for Mobile IPv6) and dual interface and how proposed scheme can be interoperated with handover process respectively. Finally, we show two experimental results which are the mSCTP and the mSCTP using FMIPv6 on Linux platforms. Experimental results show that handover performance is improved with reducing the time of receiving RA which takes most of total handover latency.

Design and Implementation of an Embedded Audio Video Bridging Platform for Multichannel Multimedia Transmission (다채널 멀티미디어 전송용 임베디드 Audio Video Bridging 플랫폼 설계 및 구현)

  • Wee, Jungwook;Park, Kyoungwon;Kwon, Kiwon;Song, Byoungchul;Kang, Mingoo
    • Journal of Internet Computing and Services
    • /
    • v.16 no.2
    • /
    • pp.1-6
    • /
    • 2015
  • In this paper, we designed an embedded audio video bridging (AVB) platform based on IEEE 802.1BA for real-time multimedia transmission in smart-car, smart-home, smart-theater, and then evaluated a performance of the implemented platform by analysis of IEEE 802.1AS (time synchronization protocol) and IEEE 802.1Qat (stream reservation protocol). Especially, the AVB Layer-2 protocol of MRP(Multiple Registration Protocol), MMAP(Multicast Address Acquisition Protocol), IEEE 1722, 1722.1 etc. was and implemented by linux based operating system. It is shown by interoperability tests with commercial products that the implemented platform transmits real-time multichannel AV data over AVB networks for Multichannel Multimedia Transmission.

SiRENE: A new generation of engineering simulator for real-time simulators at EDF

  • David Pialla;Stephanie Sala;Yann Morvan;Lucie Dreano;Denis Berne;Eleonore Bavoil
    • Nuclear Engineering and Technology
    • /
    • v.56 no.3
    • /
    • pp.880-885
    • /
    • 2024
  • For Safety Assisted Engineering works, real-time simulators have emerged as a mandatory tool among all the key actors involved in the nuclear industry (utilities, designers and safety authorities). EDF, Electricité de France, as the leading worldwide nuclear power plant operator, has a crucial need for efficient and updated simulation tools for training, operating and safety analysis support. This paper will present the work performed at EDF/DT to develop a new generation of engineering simulator to fulfil these tasks. The project is called SiRENE, which is the acronym of Re-hosted Engineering Simulator in French. The project has been economically challenging. Therefore, to benefit from existing tools and experience, the SiRENE project combines: - A part of the process issued from the operating fleet training full-scope simulator. - An improvement of the simulator prediction reliability with the integration of High-Fidelity models, used in Safety Analysis. These High-Fidelity models address Nuclear Steam Supply System code, with CATHARE thermal-hydraulics system code and neutronics, with COCCINELLE code. - And taking advantage of the last generation and improvements of instructor station. The intensive and challenging uses of the new SiRENE engineering simulator are also discussed. The SiRENE simulator has to address different topics such as verification and validation of operating procedures, identification of safety paths, tests of I&C developments or modifications, tests on hydraulics system components (pump, valve etc.), support studies for Probabilistic Safety Analysis (PSA). etc. It also emerges that SiRENE simulator is a valuable tool for self-training of the newcomers in EDF nuclear engineering centers. As a modifiable tool and thanks to a skillful team managing the SiRENE project, specific and adapted modifications can be taken into account very quickly, in order to provide the best answers for our users' specific issues. Finally, the SiRENE simulator, and the associated configurations, has been distributed among the different engineering centers at EDF (DT in Lyon, DIPDE in Marseille and CNEPE in Tours). This distribution highlights a strong synergy and complementarity of the different engineering institutes at EDF, working together for a safer and a more profitable operating fleet.

Time Poverty and Quality of Life in Dual-Earner Families with Preschool Children: A Comparison between Time-Poor and Non-Time-Poor Groups (미취학 자녀를 둔 맞벌이 가정의 시간빈곤 수준과 삶의 질: 개인유지시간을 기준으로 한 시간빈곤 여부에 따른 집단 간 비교)

  • Kim, Mi Young;Park, Mee Ryeo
    • Human Ecology Research
    • /
    • v.55 no.1
    • /
    • pp.45-55
    • /
    • 2017
  • This study analyzes diverse factors in time poverty and quality of life in dual-earner families with preschool children that pertain to the individual, family, and occupation. Data were taken from the 17th edition of the Korean Labor and Income Panel Study developed by the Korea Labor Institute in 2014. The sample consists of 826 households who are dual-earner families with preschool children. The major findings are as follows. First, this study identified inadequacies in personal care time for dual-earner families with preschool children. Second, the results show that gender, recognition of gender role, and overall satisfaction of occupation are related to the time poverty of dual-earner families. Men are more likely to experience time poverty than women, and equal recognition of gender role and satisfaction of occupation indicate a negative relation on the time poverty of dual-earner families with preschool children. Last, quality of life in non-time-poor groups is higher than for groups who experience time poverty. Also, health state, earned income, work-family life conflict, and overall satisfaction of occupation are commonly related to quality of life in both groups. The results suggest implications for comprehensive policies to address family time issues.

Longest First Binary Search on Prefix Length for IP Address Lookup (최장 길이 우선 검색에 기초한 프리픽스 길이에 따른 이진 IP 검색 구조)

  • Chu Ha-Neul;Lim Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8B
    • /
    • pp.691-700
    • /
    • 2006
  • Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.

Implementation of Memory Copy Reduction Scheme for Networked Multimedia Service in Linux (리눅스 커널에서 네트워크 멀티미디어 서비스를 위한 메모리 복사 감소 기법 구현)

  • Kim, Jeong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2B
    • /
    • pp.129-137
    • /
    • 2003
  • Multimedia streams, like MPEG continuously retrieve multimedia data because of their incessant playback. While these streams need an efficient support of kernel, the current buffer cache mechanism of Linux kernel such as Unix operating system was designed apt for small files, which is aperiodically requested as well as time uncritical. But, in case of continuous media, the CPU must enormously copy memory from kernel address space to user address space. This must lead to a large CPU overhead. This overhead both degrades system throughput and cannot guarantee QOS. In this paper, we have designed and implemented two memory copy reduction schemes in Linux kernel, direct I/O and one copy. The direct I/O skips the buffer cache layer of Linux kernel and results in dramatic reduction of CPU memory copy overhead. And, the one copy provides a fast disk-to-network data path without copying to user address space. The experimental results show considerable reduction of CPU overhead and throughput improvements.

Address Space Maintaining Scheme for Fast Program Execution in Linux-based Systems (Linux 기반에서 빠른 프로그램 실행을 위한 주소 공간 유지 기법)

  • Noh, Seung Joon;Kang, Dong Hyun;Kim, Junghan;Kim, Inhyeok;Eom, Young Ik
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.12
    • /
    • pp.786-791
    • /
    • 2015
  • The environment of Internet of Things (IoT) wherein various devices are connected through the Internet with value-added network functions, is currently a subject of active study. Accordingly, the existing computing environment based on desktop or mobile systems is being expanded into a computing environment of more diverse devices. Because the response of program launching is important in terms of User Experience (UX) in IoT environments, the technology for guaranteeing rapid response of program launching in IoT devices is getting the focus of much current research. In this paper we analyze the Zygote technique, which is being used for faster program execution in Android systems, and, based on our results, we propose an address space maintaining scheme for the rapid launching of programs for use in Linux-based systems. Our scheme utilizes the Copy on Write (CoW) technique in Linux systems as well as the Zygote technique of Android systems. In order to evaluate the proposed scheme, we implemented our scheme on Linux systems and performed several experiments. The experimental results show that the proposed scheme shortens the launching time up to 99%, compared to the existing technique.

Fabrication technology of the focusing grating coupler using single-step electron beam lithography (Single-step 전자빔 묘화 장치를 이용한 Focusing Grating Coupler 제작 연구)

  • Kim, Tae-Youb;Kim, Yark-Yeon;Sohn, Yeung-Joon;Han, Gee-Pyeong;Paek, Mun-Cheol;Kim, Hae-Sung;Shin, Dong-Hoon;Rhee, Jin-Koo
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2002.07b
    • /
    • pp.976-979
    • /
    • 2002
  • A focusing grating coupler (FGC) was not fabricated by the 'Continuous Path Control' writing strategy but by an electron-beam lithography system of more general exposure mode, which matches not only the address grid with the grating period but also an integer multiple of the address grid resolution (5 nm), To more simplify the fabrication, we are able to reduce a process step without large decrease of pattern quality by excluding a conducting material or layer such as metal (Al, Cr, Au), which are deposited on top or bottom of an e-beam resist to prevent charge build-up during e-beam exposure. A grating pitch period and an aperture feature size of the FGC designed and fabricated by e-beam lithography and reactive ion etching were ranged over 384.3 nm to 448.2 nm, and $0.5{\times}0.5mm^2$ area, respectively, This fabrication method presented will reduce processing time and improve the grating quality by means of a consideration of the address grid resolpution, grating direction, pitch size and shapes when exposing. Here our investigations concentrate on the design and efficient fabrication results of the FGC for coupling from slab waveguide to a spot in free space.

  • PDF

A Method for Quantifying the Risk of Network Port Scan (네트워크 포트스캔의 위험에 대한 정량화 방법)

  • Park, Seongchul;Kim, Juntae
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.4
    • /
    • pp.91-102
    • /
    • 2012
  • Network port scan attack is the method for finding ports opening in a local network. Most existing IDSs(intrusion detection system) record the number of packets sent to a system per unit time. If port scan count from a source IP address is higher than certain threshold, it is regarded as a port scan attack. The degree of risk about source IP address performing network port scan attack depends on attack count recorded by IDS. However, the measurement of risk based on the attack count may reduce port scan detection rates due to the increased false negative for slow port scan. This paper proposes a method of summarizing 4 types of information to differentiate network port scan attack more precisely and comprehensively. To integrate the riskiness, we present a risk index that quantifies the risk of port scan attack by using PCA. The proposed detection method using risk index shows superior performance than Snort for the detection of network port scan.