• Title/Summary/Keyword: common call

Search Result 128, Processing Time 0.024 seconds

Common Calls of Poodle (Poodle의 발성음)

  • 연성찬;서강문;권오경;남치주
    • Journal of Veterinary Clinics
    • /
    • v.13 no.2
    • /
    • pp.163-170
    • /
    • 1996
  • This study was performed to analyse the common calls of poddle spectrographically : bark, growl, howl, snore, yelp and whine. The sonograms of 6 common calls were shown their own specific features. There were significant differences among each types of common callsin the parceter of minimun frequency of call (MIFC), maximun frequency of call (MAFC), duration of call (DC), interval between call (IBC), dominant frequency (DF), F1 formant, F2 formant and F3 formant (P<0.01). It was considered that it was possible to record the main common calls dogs by sonograms and it sould be applied to objective basic data for understanding the psychological stats of dogs, the social relationship among them and the relationship sith human being.

  • PDF

An effective call admission control using virtual path in ATM networks (ATM망에서 가상경로를 이용한 효율적인 호 수락 제어)

  • 이문호;장성현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2897-2908
    • /
    • 1996
  • This paper presents an effective call admission control algorithm using the Common Pool on the virtual path in ATM networks. Call admission control decides whether or not to accept a new call, so as to ensure the service quality of both individiual existing calls and of the new call itself. In the proposed algorithm, a new call is accepted when the sum of the bandwidths of existing calls and of the new call will not exceed lind capacity. If the sum of their bandwidths exceed link capacity, reserved bandwidth of Common Pool is considreed to accept the new call. Computer simulation results using a simuple network model are algorithm given to evaluate accuracy and call blocking probability by the proposed method.

  • PDF

An efficient signaling protocol for point-to-point multi-connection call in B-ISDN (B-ISDN에서 점 대 점 다중연결 호를 위한 효율적인 신호프로토콜)

  • 배상재;조현철;주언경
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.12
    • /
    • pp.1-9
    • /
    • 1997
  • The signaling protocol for B-ISDN should support variety of services including point-to-pont single-connection call, point-to-point multi-connection call and point-to-multipoint connection call. an efficient signaling protocol for point-to-point multi-connection call based on ITU-T Recommendation Q.298X is presented in this paper. Sequential establishment of madatory and optional connections and common routing scheme for synchronization, along with separation of information elements for establishement of multi-connection call are included in the proposed signaling protocol. Limited network resources can be used more efficiently by proposed sequential establishement of mandartory and optional connection for point-to-point multi-connection call which can provide multimedia services. And common routing can be provided effectively by proposed common routing scheme for connectios requiring synchronization like as video-phone and video-conference.

  • PDF

Different Characteristics of Toxic Substance/poison Exposure Data that Collected from Pre-hospital Telephone Response and Emergency Department (일부 지역의 전화상담을 통해 얻어진 독성물질 노출정보와 응급실 기반 중독 정보 분석)

  • Kim, Su-Jin;Choa, Min-Hong;Park, Jong-Su;Lee, Sung-Woo;Hong, Yun-Sik
    • Journal of The Korean Society of Clinical Toxicology
    • /
    • v.12 no.1
    • /
    • pp.1-7
    • /
    • 2014
  • Purpose: The purpose of this study is to find differences in the demographics of toxic exposed patients and substance between call based poison information data and hospital based poison information data. Methods: Seoul 1339 call-response data were used as call based poison data and toxic related injury surveillance data of the Korean center for disease control and prevention (KCDC) were used as hospital based poison data. Age, sex, the kind of exposed substance, reasons for exposure, and exposure routes were compared between two data sets. We analyzed the presence or not of documentation on the name and amount of exposed substance, symptoms after exposure in call based poison data. Results: Seoul1339 poison data included a total of 2260 information related to toxic exposure and KCDC poison data included 5650 poison cases. There was no difference in sexual distribution. Pediatric exposure and accidental exposure were more common in call based poison data. The most common exposed substances were household products in call based poison data and medicines in hospital based poison data, respectively. Documents regarding amount and time of toxic exposure and symptoms after toxic exposure were not recorded exactly in call based poison data. Conclusion: There were significant differences in age, reasons for toxic exposure, and the kinds of exposed substances. Poison information data from both pre-hospital and hospital must be considered.

  • PDF

Implementation of Kalman Filter as a Remote Procedure Call Webservice (원격 프로시저 호출 웹서비스로 칼만필터 구현)

  • Yim, Jaegeol;Du, Vu Quang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.1365-1368
    • /
    • 2011
  • The Kalman Filter is one of the most common techniques of tracking mobile user. Web service is a promising method of reusing programs. Therefore, this paper presents our implementation of Kalman Filter web service. There are three ways of implementing a web service system. Ours is Kalman filter as RPC web service.

Analysis of ISUP signalling Delay in Common Channel Signaling System (공통선 신호 시스템의 ISDN 사용자부 신호 지연 분석)

  • 박철근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1377-1386
    • /
    • 2000
  • As all delays resulting from the signaling network directly affect the response time of network management activity, all control informations have to be transported most efficiently. It is very important to know the performance of the signaling system not only because of smooth network operation but also because of efficient engineering of signaling networks. In this paper, we analyzed mean queueing delay of signaling link for ISUP signaling messages in common channel signaling system by using M[X]/G/1 and M[X]/D/1 batch arrival queueing system. This is because we modeled arrival process of the signaling messages as batch arrival process considering that many kinds of signaling messages are generated at short intervals when a call requests a connection. Analysis was carried out considering different call processing scenario based on ITU-T specification. We also described the numerical results from the different types of queueing models.

  • PDF

Estimating Detection Probabilities and Site Occupancy Rates of Three Anuran Species Using Call Surveys in Haenam Gun, Korea

  • Sung, Ha-Cheol;Kim, Su-Kyung;Cheong, Seok-Wan;Park, Shi-Ryong;Roh, Dong-Chan;Baek, Kyung-Whan;Lee, Jung-Hyun;Park, Dae-Sik
    • Journal of Ecology and Environment
    • /
    • v.29 no.4
    • /
    • pp.331-335
    • /
    • 2006
  • We investigated the distribution of three anuran species, Three-striped pond frogs (Rana nigromaculata), Bullfrogs (Rana catesbeiana), and Narrow-mouthed toads (Kaloula borealis), in an administrative district, Haenam Gun, Junnam Province, Korea using volunteer call surveys. Twenty-eight volunteer call surveyors were assigned to each $2{\times}2km^2$ survey plot. Call surveys on whether the species are present or not were conducted for 5 minutes between 30 minutes after sunset and the midnight on rice fields and ponds from 10 April to 28 August in 2005. Depending on species, call surveys were carried out at seven to 28 plots with average 8.4 to 10.7 visits per the plot. We calculated the detection probabilities and occupancy rates of the three species using four models with three covariates: temperature, humidity, and the amount of water at the habitat. The model average detection probabilities of three anuran species of R. nigromaculata, R. catesbeiana, and K. borealis were 0.53, 0.74, and 0.41 respectively, and the site occupancy rates of them were 0.93, 0.94, and 0.86 respectively. Our results indicate that R. nigromaculata, R. catesbeiana, and K. borealis are common in Haenam Gun.

A Component-Based Localization Algorithm for Sparse Sensor Networks Combining Angle and Distance Information

  • Zhang, Shigeng;Yan, Shuping;Hu, Weitao;Wang, Jianxin;Guo, Kehua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.1014-1034
    • /
    • 2015
  • Location information of sensor nodes plays a critical role in many wireless sensor network (WSN) applications and protocols. Although many localization algorithms have been proposed in recent years, they usually target at dense networks and perform poorly in sparse networks. In this paper, we propose two component-based localization algorithms that can localize many more nodes in sparse networks than the state-of-the-art solution. We first develop the Basic Common nodes-based Localization Algorithm, namely BCLA, which uses both common nodes and measured distances between adjacent components to merge components. BCLA outperforms CALL, the state-of-the-art component-based localization algorithm that uses only distance measurements to merge components. In order to further improve the performance of BCLA, we further exploit the angular information among nodes to merge components, and propose the Component-based Localization with Angle and Distance information algorithm, namely CLAD. We prove the merging conditions for BCLA and CLAD, and evaluate their performance through extensive simulations. Simulations results show that, CLAD can locate more than 90 percent of nodes in a sparse network with average node degree 7.5, while CALL can locate only 78 percent of nodes in the same scenario.

A Static Analyzer for Detecting Memory Leaks based on Procedural Summary (함수 요약에 기반한 메모리 누수 정적 탐지기)

  • Jung, Yung-Bum;Yi, Kwang-Keun
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.7
    • /
    • pp.590-606
    • /
    • 2009
  • We present a static analyzer that detects memory leaks in C programs. It achieves relatively high accuracy at a relatively low cost on SPEC2000 benchmarks and several open-source software packages, demonstrating its practicality and competitive edge against other reported analyzers: for a set of benchmarks totaling 1,777 KLOCs, it found 332 bugs with 47 additional false positives (a 12.4% false-positive ratio), and the average analysis speed was 720 LOC/sec. We separately analyze each procedure's memory behavior into a summary that is used in analyzing its call sites. Each procedural summary is parameterized by the procedure's call context so that it can be instantiated at different call sites. What information to capture in each procedural summary has been carefully tuned so that the summary should not lose any common memory-leak-related behaviors in real-world C program. Because each procedure is summarized by conventional fixpoint iteration over the abstract semantics ('a la abstract interpretation), the analyzer naturally handles arbitrary call cycles from direct or indirect recursive calls.

A Study on Common Spaces and Building Landscape with Sharing according to Village Lane Pattern (마을길에 따른 공유공간과 경관형성에 관한 연구)

  • Chong, Geon-Chai
    • Journal of the Korean Institute of Rural Architecture
    • /
    • v.20 no.1
    • /
    • pp.37-44
    • /
    • 2018
  • The purpose of this study is to know how to make common space, find a type of it, and build a village landscape with it in countryside. There are five types of village including suburban according to typological locality in rural area. Each of them have remarkable common spaces that are combined with community identity and usage. They usually are located along with the street and lane of the village. Most of the villages I surveyed have common places for residents to rest, share, and meet together. Representatively, pavilion with symbolic tree we call Jeonja is very popular place to them, and village people also require public parking or pocket park in their modern life. I researched common places in ten communities in rural area so that I can suggest a way of community design through them. According to this research, there are three results. First, the common space of the village is placed to motivate emotional and attractive community design in the village. Second, the common space has an identity and landscape architectural relationship to build sustainable community. Third, countries' streets that I surveyed have four types, which are liner, tree, loop, and radiate patterns of lane. In line with those types, each one makes different and historical community landscape.