• Title/Summary/Keyword: Home Network Algorithm

Search Result 151, Processing Time 0.024 seconds

Voice Recognition using a Phoneme based Similarity Algorithm in Home Networks (음소 기반의 유사율 알고리즘을 이용한 Home Network 환경에서의 음성 인식)

  • Lee, Chang-Sub;Yu, Jae-Bong;Park, Joon-Seok;Yang, Soo-Ho;Kim, Yu-Seop;Park, Chan-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.767-770
    • /
    • 2005
  • 네트워크상에서 전달되는 음성데이터는 전달되는 과정에서 잡음 등의 외부 요인으로 인하여 데이터에 손실이 생기는 문제가 발생한다. 이렇게 전달된 음성데이터가 음성 인식기를 통과하면 바로 음성 인식기를 통과했을 때 보다 인식률이 낮아진다. 본 연구에서는 홈 네트워크를 제어하는데 있어서 음성 인식률을 향상시키기 위해서 음성 데이터를 입력받아, 이를 음소단위 기반의 유사율 알고리즘을 적용시켜 이미 구축된 홈 네트워크 용어 관련 사전에 등록된 단어와의 유사성을 검토하여 추출된 결과로 홈 네트워크를 제어하는 방안을 제안한다. 음소단위 기반의 유사율 알고리즘과 다중발화를 이용했을 때 Threshold 값이 85% 일 경우 사전에 구축된 단어와 매칭된 인식률은 100%였으며, 사전에 없는 단어의 오인식률은 2%로 감소되었다.

  • PDF

Greedy Heuristic Algorithm for the Optimal Location Allocation of Pickup Points: Application to the Metropolitan Seoul Subway System (Pickup Point 최적입지선정을 위한 Greedy Heuristic Algorithm 개발 및 적용: 서울 대도시권 지하철 시스템을 대상으로)

  • Park, Jong-Soo;Lee, Keum-Sook
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.14 no.2
    • /
    • pp.116-128
    • /
    • 2011
  • Some subway passengers may want to have their fresh vegetables purchased through internet at a service facility within the subway station of the Metropolitan Seoul subway system on the way to home, which raises further questions about which stations are chosen to locate service facilities and how many passengers can use the facilities. This problem is well known as the pickup problem, and it can be solved on a traffic network with traffic flows which should be identified from origin stations to destination stations. Since flows of the subway passengers can be found from the smart card transaction database of the Metropolitan Seoul smart card system, the pickup problem in the Metropolitan Seoul subway system is to select subway stations for the service facilities such that captured passenger flows are maximized. In this paper, we have formulated a model of the pickup problem on the Metropolitan Seoul subway system with subway passenger flows, and have proposed a fast heuristic algorithm to select pickup stations which can capture the most passenger flows in each step from an origin-destination matrix which represents the passenger flows. We have applied the heuristic algorithm to select the pickup stations from a large volume of traffic network, the Metropolitan Seoul subway system, with about 400 subway stations and five millions passenger transactions daily. We have obtained not only the experimental results in fast response time, but also displayed the top 10 pickup stations in a subway guide map. In addition, we have shown that the resulting solution is nearly optimal by a few more supplementary experiments.

  • PDF

An Adaptive Follow-Me Replication Scheme for Service Profile Management in Virtual Home Environment (가상 홈 환경에서 서비스 프로파일 관리를 위한 적응적 추종 중복 기법)

  • 황진경;권순종;박명순
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.545-558
    • /
    • 2003
  • It is expected that per-user customized services are widely used in next generation Personal Communication Network. The ultimate goal for personalized service is the Virtual home Environment (VHE) providing ´same-look-and-feel´ services for the subscriber wherever he roams to. To provide personalized services for each call, per-user service profiles are frequently referenced, so efficient service profile management is essentially required. To realized the VHE, typically two schemes, can be employed; One is Intelligent Network based service control and the other is a full replication scheme that always replicates profile in user´s current zone. The first scheme is referred as Central scheme and th second scheme is the modified replication scheme of IMT-2000, we refer to as Follow-Me Replication Unconditional (FMRU). Since the Central scheme only depends on the service cal rate and the FMRU is merely dependent on the movement rate, it is apparent that FMRU scheme outperforms the Central scheme if the call to mobility ratio (CMR) is large, and vice versa. In this paper, we propose a new service profile replication schemes, Adaptive Follow-Me Replication (AFMR) that determine replication automatically according to the user´s CMR. We compared the performance of the AFMR with the non-adaptive Follow-Me Replication unconditional on Demand (FMRUD) scheme. Performance results indicate that as the CMR of a user changes AFMR adapts well compared to the existing schemes.

DoS/DDoS attacks Detection Algorithm and System using Packet Counting (패킷 카운팅을 이용한 DoS/DDoS 공격 탐지 알고리즘 및 이를 이용한 시스템)

  • Kim, Tae-Won;Jung, Jae-Il;Lee, Joo-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.151-159
    • /
    • 2010
  • Currently, by using the Internet, We can do varius things such as Web surfing, email, on-line shopping, stock trading on your home or office. However, as being out of the concept of security from the beginning, it is the big social issues that malicious user intrudes into the system through the network, on purpose to steal personal information or to paralyze system. In addition, network intrusion by ordinary people using network attack tools is bringing about big worries, so that the need for effective and powerful intrusion detection system becomes very important issue in our Internet environment. However, it is very difficult to prevent this attack perfectly. In this paper we proposed the algorithm for the detection of DoS attacks, and developed attack detection tools. Through learning in a normal state on Step 1, we calculate thresholds, the number of packets that are coming to each port, the median and the average utilization of each port on Step 2. And we propose values to determine how to attack detection on Step 3. By programing proposed attack detection algorithm and by testing the results, we can see that the difference between the median of packet mounts for unit interval and the average utilization of each port number is effective in detecting attacks. Also, without the need to look into the network data, we can easily be implemented by only using the number of packets to detect attacks.

ECG Monitoring using High-Reliability Functional Wireless Sensor Node based on Ad-hoc network (고신뢰도 기능성 무선센서노드를 이용한 Ad-hoc기반의 ECG 모니터링)

  • Lee, Dae-Seok;Do, Kyeong-Hoon;Lee, Hoon-Jae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.6
    • /
    • pp.1215-1221
    • /
    • 2009
  • A novel approach for electrocardiogram (ECG) analysis within a functional sensor node has been developed and evaluated. The main aim is to reduce data collision, traffic overload and power consumption in healthcare applications of wireless sensor networks(WSN). The sensor node attached on the patient's body surface around the heart can perform ECG analysis based on a QRS detection algorithm to detect abnormal condition of the patient. Data transfer is activated only after detected abnormality in the ECG. This system can reduce packet loss during transmission by reducing traffic overload. In addition, it saves power supply energy leading to more reliable, cheap and user-friendly operation in the WSN for ubiquitous health monitoring.

A Multithreaded Implementation of HEVC Intra Prediction Algorithm for a Photovoltaic Monitoring System

  • Choi, Yung-Ho;Ahn, Hyung-Keun
    • Transactions on Electrical and Electronic Materials
    • /
    • v.13 no.5
    • /
    • pp.256-261
    • /
    • 2012
  • Recently, many photovoltaic systems (PV systems) including solar parks and PV farms have been built to prepare for the post fossil fuel era. To investigate the degradation process of the PV systems and thus, efficiently operate PV systems, there is a need to visually monitor PV systems in the range of infrared ray through the Internet. For efficient visual monitoring, this paper explores a multithreaded implementation of a recently developed HEVC standard whose compression efficiency is almost two times higher than H.264. For an efficient parallel implementation under a meshbased 64 multicore system, this work takes into account various design choices which can solve potential problems of a two-dimensional interconnects-based 64 multicore system. These problems may have not occurred in a small-scale multicore system based on a simple bus network. Through extensive evaluation, this paper shows that, for an efficient multithreaded implementation of HEVC intra prediction in a mesh-based multicore system, much effort needs to be made to optimize communications among processing cores. Thus, this work provides three design choices regarding communications, i.e., main thread core location, cache home policy, and maximum coding unit size. These design choices are shown to improve the overall parallel performance of the HEVC intra prediction algorithm by up to 42%, achieving a 7 times higher speed-up.

Improvement of Hierarchical Routing in ZigBee Networks (지그비 계층적 라우팅의 성능 향상 기법)

  • Kim, Taehong;Kim, Daeyoung;Yoo, Seong-Eun;Sung, Jongwoo;Kim, Youngsoo
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.1 no.2
    • /
    • pp.104-112
    • /
    • 2006
  • ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. It is used for low data rate and low power wireless network applications. Expected applications of ZigBee include wireless sensor networks for remote monitoring, home control, and industrial automation. Since one of the most important design goals of ZigBee is to reduce the installation and running costs, the ZigBee stack is embedded in the cheap and small micro-controller unit. The hierarchical routing algorithm is used for ZigBee end devices which have very limited resources. Using the block addressing scheme, end devices can send data to the destination without a routing table. However, hierarchical routing has the problem that the packets follow the tree hierarchy to the destination even if the destination is located nearby. In this paper, we propose a scheme to improve the hierarchical routing algorithm in ZigBee networks by employing the neighbor table that is originally used together with the routing table. We suggest selecting the neighbor node that has the minimum remaining hops to the destination as the next hop node. Simulation result shows that the proposed scheme saves more than 30% of the hop counts compared with the original hierarchical routing.

  • PDF

Multicast Routing and Cost Model with Source Mobility in Mobile IPv6 Networks (Mobile IPv6망에서 소스 이동성을 갖는 멀티캐스트 라우팅 및 비용모델)

  • Park Byoung-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.197-203
    • /
    • 2004
  • In mobile network, the maintenance o( host grouping or the multicast delivery tree for multicasting algorithm becomes a major issues. In this paper, we explore the issues of mobile Multicast scheme using Mobile-IPv6, and addresses case when a mobile host is a source as well as a recipient of a given multicast operation using MLD(Multicast Listener Discovery) scheme, and the proposed MLD-based multicasting protocol asks its HA(Home Agent) to stop forwarding multicast for group using tunneling. We examine and compare our model to existing approaches by proposed cost model, and observe an improved ferformacne.

  • PDF

Secure Authentication Mechanism using a Location Information of Device and an OTP Algorithm for Home Network Environment (홈네트워크에서의 기기 위치 정보와 OTP 알고리즘을 활용한 인증 보안 메커니즘)

  • Kim, Jong-Jin;Cho, Eun-Young;Son, Jin-Hyun
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.12-17
    • /
    • 2007
  • 홈네트워크를 이루는 대부분의 기기는 그 위치가 자주 변동되지 않는다. 때문에 기기의 실제적인 위치 값은 기기를 구분할 수 있는 유일한 ID로 활용이 가능하다. 위치 측정 센서를 통해 홈네트워크를 구성하는 제품의 위치정보를 측정하여 그 값을 인증 보안 메커니즘에 활용한다. 홈네트워크를 구성하는 각각의 기기마다 요구하는 보안 수준외 정도가 다르다. 때문에 각 기기마다 차등 보안 레벨 적용이 가능하다. 즉, 낮은 자원을 이용하는 기기에 대해서는 높은 보안 적용을 위해 기기에게 필요한 추가 자원의 만큼을 절약할 수 있게 된다. 보안 인증 통신을 위해 홈네트워크를 구성하는 저 성능의 기기에게 효과적으로 적용이 가능한 One-Time Password(OTP) 알고리즘을 이용한다. 본 논문에서는 홈네트워크를 구성하는 기기의 위치정보와 OTP의 두 가지 기술을 활용하여 홈네트워크 상의 보안 인증 문제를 해결하고자 한다.

  • PDF

User Location Based Intelligent Service Algorithm in Home Network Environments (홈 네트워크 환경에서 사용자 위치에 기반한 지능적인 서비스 알고리즘)

  • Choi, Jung- Hwan;Jang, Hyun-Su;Choi, Hyun-Woo;Kim, Gu-Su;Eom, Young-Ik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.713-716
    • /
    • 2007
  • 사용자의 지리적 위치에 기반한 서비스를 제공하는 위치 기반 서비스는 유비쿼터스 컴퓨팅의 중요한 응용이 되고 있으며, 이와 관련하여 다양한 연구들이 계속 진행 중이다. 기존의 연구들이 사용자의 위치 정보와 해당하는 서비스들의 단순 연결에 불과했다면, 본 논문에서는 사용자와 디바이스 간의 상호작용 정보를 기반으로 병합적 클러스터링 알고리즘을 이용하여 사용자의 위치에서 가장 적합한 지능적인 서비스를 제공하는 알고리즘을 제안한다.

  • PDF