• Title/Summary/Keyword: Call patterns

Search Result 98, Processing Time 0.027 seconds

A Kernel-Level Communication Module for Linux Clusters (리눅스 클러스터를 위한 커널 수준 통신 모듈)

  • 박동식;박성용;양지훈
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.3
    • /
    • pp.289-300
    • /
    • 2003
  • Traditional kernel-level communication systems for clusters are dependent upon computing platforms. Futhermore, they are not easy to use and do not provide various functions for clusters. This paper presents an architecture and various implementation issues of a kernel-level communication system, KCCM(Kernel level Cluster Communication Module), for linux cluster. The KCCM provides asynchronous communication services as well as standard synchronous communication services using send and receive. The KCCM also automatically detects and recovers connection failures at runtime. This allows programmers to use KCCM when they build mission critical applications over TCP-based connection-oriented communication environments. Having developed using standard socket interfaces, it can be easily ported to various platforms. The experimental results show that the KCCM provides good performance for asynchronous communication patterns.

The Chronic Health Effects of Work-Related Stressors Experienced by Police Communications Workers

  • Perez, Rodolfo A.;Jetelina, Katelyn K.;Reingle Gonzalez, Jennifer M.
    • Safety and Health at Work
    • /
    • v.12 no.3
    • /
    • pp.365-369
    • /
    • 2021
  • Background: Law enforcement communications (i.e., 911 dispatch and call takers) is a challenging and stressful occupation. The purpose of this study is to identify the main stressors associated with employment in law enforcement communications, and to identify and provide context to how these stressors affect workers' health and wellbeing. Methods: This research study included focus groups with 23 call takers and 911 dispatchers employed by a large, urban law enforcement agency in 2018. Thematic analyses were conducted to identify trends. Results: Four themes of stressors emerged (i.e., the high stakes nature of some 911 calls for service, understaffing, supervisor-related stress, and recruiting practice). Two health-related themes emerged as being occupation-related: weight gain and poor sleep patterns/insufficient sleep). Specifically, participants reported negative eating habits resulting in weight gain and obesity, lack of sleep and irregular sleep schedules, and development of hypertension and/or diabetes since beginning their jobs. Conclusion: Law enforcement communications professionals experience a number of the same stressors facing law enforcement officers in patrol. These stressors, combined with the sedentary nature of the job, could result in long-term, chronic health problems.

An Optimized Sleep Mode for Saving Battery Consumption of a Mobile Node in IEEE 802.16e Networks (IEEE 802.16e 시스템에서 이동 단말의 전력 소모 최소화를 위한 취적 휴면 기법)

  • Park, Jae-Sung;Kim, Beom-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.221-229
    • /
    • 2007
  • In this paper, we propose and analyze the optimized sleep mode for a mobile node (MN) in IEEE 802.16e wireless metropolitan area networks. Because a MN in a sleep mode specified in 802.16e specification should maintain state information with the base station currently attached, it must renew sleep state with a new base station after handover which leads to unnecessary waste of battery power. Noting that the mobility pattern of a MN is independent of call arrival patterns, we propose an optimized sleep mode to eliminate unnecessary standby period of a MN in sleep state after handover. We also propose an analytical model for the proposed scheme in terms of power consumption and the initial call response time. Simulation studies that compare the performance between the sleep mode and the optimized sleep mode show that our scheme marginally increases initial call response delay with the huge reduction in power consumption.

A Nonblocking $Multi-Log_2N$ Multiconnection Network : Theoretical Characterization and Design Example for a Photonic Switching System (넌블럭킹 $Multi-Log_2N$다중 접속망 : 이론적 특성 및 광 교환시스템을 위한 설계예)

  • Yeong Hwan TSCHA;Kyoon Ha LEE
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.7
    • /
    • pp.680-695
    • /
    • 1991
  • In this paper, the conditions on the number of required copies of a self-routing network with and without extra stages in back-to-back manner are presented respectively for a nonblocking $Multi-Log_2N$ multiconnection network. Actually the obained results hold regardless of connection patterns, i.e., whether a network deploys on-to-one connections or multiconnections. Thus open problems on the nonblocking condition for a multi $Multi-Log_2N$ multiconnection network are solved. Interestingly some of the given formulas comprise the Benes network and the Canto network as a special case repectively. A novel switching system architecture deploying a distributed calls-distribution algorithm is provided to design a nonblocking $Multi-Log_2N$ photonic switching network using a directional coupler. And a directional couplex based call holding demultiplexer is introduced to hold a call until blocking disappears in a switching network and let it enter to a network, provided that the number of switching networks is less than that of required switching networks for a nonblocking $Multi-Log_2N$ network.

  • PDF

Searching Sequential Patterns by Approximation Algorithm (근사 알고리즘을 이용한 순차패턴 탐색)

  • Sarlsarbold, Garawagchaa;Hwang, Young-Sup
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.29-36
    • /
    • 2009
  • Sequential pattern mining, which discovers frequent subsequences as patterns in a sequence database, is an important data mining problem with broad applications. Since a sequential pattern in DNA sequences can be a motif, we studied to find sequential patterns in DNA sequences. Most previously proposed mining algorithms follow the exact matching with a sequential pattern definition. They are not able to work in noisy environments and inaccurate data in practice. Theses problems occurs frequently in DNA sequences which is a biological data. We investigated approximate matching method to deal with those cases. Our idea is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call approximated pattern. The existing PrefixSpan algorithm can successfully find sequential patterns in a long sequence. We improved the PrefixSpan algorithm to find approximate sequential patterns. The experimental results showed that the number of repeats from the proposed method was 5 times more than that of PrefixSpan when the pattern length is 4.

The APIs Design for the Database Management of the Network Game Using Design Patterns (디자인 패턴을 적용한 네트워크 게임의 DB 관리 APIs 설계)

  • Kim Jong-Soo;Kwon Oh-Jun;Kim Tai-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.1
    • /
    • pp.101-108
    • /
    • 2006
  • Developing a network game that is serviced on the internet requires a lot of work, time and manpower. Therefore, it is important to design a game in such a way so that existing design codes could be used. The database for the multi-player network game is accessed from many clients. To manage the resource effectively, it is required to design the APIs to be minimized the database access and to be dealt with the related data efficiently. For this, it is needed to apply the object-oriented design for the related software modules. In the paper, we propose the design patterns of GoF to implement the APIs thatis needed to deal with the database resource. The database design through the analysis of some game's GUI has the advantage to create the optimized schema set more quickly, because it minimize the review step and the modification step of the database design generally. In addition, we apply to the design patterns of GoF for the APIs design of the server-side database. These reduce the times of the program call between the game server and the database server. These also make easily the maintenance for the already developed APIs, and it makes easily the addition of new APIs.

  • PDF

Predictive Location Management Strategy Using Two Directional Consecutive LAs in a Cellular Network (이동 통신망에서 방향성을 지닌 2개의 연속적 위치영역을 이용한 예측 위치 관리 전략)

  • Chang, I.K.;Hong, J.S.;Kim, J.P.;Lie, C.H.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.3
    • /
    • pp.43-58
    • /
    • 2008
  • In this paper, we have presented a dynamic, predictive location update scheme that takes into account each user's mobility patterns. A user's past movement history is used to create two-dimensional transition probability matrix which makes use of two directional consecutive location areas. A mobile terminal utilizes the transition probability to develop a predictive path which consists of several predictive nodes and then the location update is saved as long as a mobile user follows the predictive path. Using continuous-time Markov chain, cost functions of location update and paging are derived and it is shown that the number of predictive nodes can be determined optimally. To evaluate the proposed scheme, simulations are designed and the numerical analysis is carried out. The numerical analysis features user's mobility patterns and regularity, call arrival rates, and cost ratio of location update to paging. Results show that the proposed scheme gives lower total location management cost, compared to the other location update schemes.

Location Management using LA-Division Scheme in Personal Communication Systems (이동통신망에서 영역분할 방식의 위치관리 기법)

  • Park, N.Y.;Chang, I.K.;Hong, J.W.;Lie, C.H.
    • IE interfaces
    • /
    • v.16 no.4
    • /
    • pp.507-514
    • /
    • 2003
  • In personal communication systems location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. The rest of cells in the location area are included into the second paging area. To reduce the paging cost the first paging area is decided by reflecting various residence patterns of mobile terminals. For an incoming call, the sequential paging is performed in the order of the paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than an existing strategy that uses the anchor cell in the location area.

Reducing Paging Cost Using LA-Division Scheme in Personal Communication Systems (이동 통신망에서 영역 분할 방식을 이용한 페이지 비용 감소 방안)

  • Park N.Y;Chang I.K;Hong J.W.;Lie C.H.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.425-432
    • /
    • 2003
  • In personal communication systems, location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is introduced, which is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. We propose the decision criterion of the first paging area by comparing the cost against zone-based strategy. For an incoming call. we perform the sequential paging by the order of the first paging area and the rest of cells in the location area called by the second paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than existing strategy using anchor cell in the location area because it reflects various residence patterns of mobile terminals.

  • PDF

STUDY OF RECOGNITION OF MALOCCLUSION AND ORTHODONTIC TREATMENTS (부정교합과 교정치료에 대한 인식변화에 관한 연구)

  • Lee, SShin-Jae;Kim, Tae-Woo;Suhr, Cheong-Hoon
    • The korean journal of orthodontics
    • /
    • v.24 no.1 s.44
    • /
    • pp.193-198
    • /
    • 1994
  • In this study, in order to survey the effect on public recognition in malocclusion and orthodontic treatment by brochures made by Korean orthodontic association, sample were divided into control and experimental group and a questionnaire was inguired and the results were as follows: 1. In the experimental group, frequency of recognition for the need of orthodontic treatment was high, and this indicates dental health behavior and recognition can be inspired by adequate giving of information. 2. Between the control and the experimental group, patterns of the negative opinion was different, and especially the demand for specific orthodontic treatment can be influenced by the content of brochures. 3. The brochures used in this study can call attention to develope the orthodontic aspect for the malocclusion, hereafter more systemic and active measures for development of public dental behavior and recognition should be needed.

  • PDF