• Title/Summary/Keyword: area assignment

Search Result 186, Processing Time 0.026 seconds

A study on teletraffic analysis in overlaid PCS system (다중계위 셀 구성을 갖는 PCS망의 트래픽 분석)

  • 김영일;진용옥
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.2
    • /
    • pp.394-408
    • /
    • 1996
  • In this paper, we classify the transfer method of overflowed traffic from microcell to macrocell in micor/macro overlaid PCS system using CDMA technology, and analyze the traffic characteristics of traffic transfer methods. Soft-handoff is charaterized by communications with a new bastation on the same CDMA frequency assignment before terminating communications with the old basestation. Therefore, soft-handoff is superior to hard-handoff with respect to Grade Of Service, but it decreases the carried traffic of system. Therefore, we analyze the effect of soft-handoff with respect to handoff area variation. In order to analyze soft-handoff effect, we resolve the probability of dewelling time in soft-handoff area, and calculates the carried traffic of microcell using this result.

  • PDF

The Forwarding Channel of a BTS in IS-95 CDMA Cellular Network

  • Kwag, Min-kok;Jung, Duk-in;Shin, In-Cheol
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.990-994
    • /
    • 2000
  • The design of LAI(Local Area Identifier), the first paging area for searching the mobile terminal has a close relation with the performance of paging channel in CDMA cellular network. This paper discusses the performance of the forward channel of IS-95 CDMA standard, known as the paging through the related messages such as call control message, channel assignment message. Modeling and simulation work were conducted to quantify the performance of paging channel in terms of traffic handling capacity and blocking levels. This result serves as illustrative guidelines for the proper engineering of common control channel, which has a major impact on the overall performance of cellular network.

  • PDF

Developing algorithms for providing evacuation and detour route guidance under emergency conditions (재난.재해 시 대피 및 우회차량 경로 제공 알고리즘 개발)

  • Yang, Choong-Heon;Son, Young-Tae;Yang, In-Chul;Kim, Hyun-Myoung
    • International Journal of Highway Engineering
    • /
    • v.11 no.3
    • /
    • pp.129-139
    • /
    • 2009
  • The transportation network is a critical infrastructure in the event of natural and human caused disasters such as rainfall, snowfall, and terror and so on. Particularly, the transportation network in an urban area where a large number of population live is subject to be negatively affected from such events. Therefore, efficient traffic operation plans are required to assist rapid evacuation and effective detour of vehicles on the network as soon as possible. Recently, ubiquitous communication and sensor network technology is very useful to improve data collection and connection related emergency information. In this study, we develop a specific algorithm to provide evacuation route and detour information only for vehicles under emergency situations. Our algorithm is based on shortest path search technique and dynamic traffic assignment. We perform the case study to evaluate model performance applying hypothetical scenarios involved terror. Results show that the model successfully describe effective path for each vehicle under emergency situation.

  • PDF

A Study on the Performance of Occupational Health Services in Kyung In Areas (산업장에서의 보건관리업무 수행실태에 관한 연구 -경인 지역 산업장을 대상으로-)

  • Cho, Dong-Ran;Kim, Myung-Soon;Ahn, Tae-Sung;Ko, Bong-Ryeon
    • Research in Community and Public Health Nursing
    • /
    • v.4 no.1
    • /
    • pp.25-37
    • /
    • 1993
  • This study was designed to identify the performance of occupational health services of 37 industries located in Kyung in area. The data was collected by a structured questionnaire developed by the Academic society of Community Nursing. This analysis had two factors, one was related to six of the industries, and the other was the actual assignment procedures of the health team members. This study was undertaken from December 4, 1992 to January 21, 1993. The results of the study were as follows: 1. The study group was primarily manufacturing industries which employed 300-1,000 employees. 2. The actual assignment state of occupation health team members with the exception of nurses was not kept to the regulations of the industrial safety health law. 3. The following was the analysis of the performance of occupational health services with two factors: 1). The larger the size of the six industries, the more the performance of health education, health assessment, and health screening. 2) The actual. practice of occupational health team members working environmental measurement, was more frequently performed by a nurse other than health team members together. 4. 1) The subscription rate of the laborers for primary health screening was 94%, and of these 10% had the need of secondary health screening. As a results of the secondary health screening the degrees were 'A' 45%, 'C' 92%, 'R' 21%. Of these degrees 'C', 'R' 4% were follow up cases. 2) 43% of laborers needed special health screening and .of these the subscription rate was 99%. The main item of the special health screening was physical factors. After the special health screening 46% required .follow up, 30% required medical treatment, only reporting 18%, change work 8%, suspension from work place 2%.

  • PDF

A Study on the Assignment and the Procurement Method of Wood Works' Craftsman in Royal Tombs Constructions in the Late Joseon Period (조선후기 왕릉 조성 시 목공사 장인의 배정과 조달 방식)

  • Lee, Sang-Myeong
    • Journal of architectural history
    • /
    • v.26 no.4
    • /
    • pp.19-34
    • /
    • 2017
  • The purpose of this study was to comprehend the assignment and the procurement method of wood works' craftsman through the Salleung-dogamuigwes in royal tombs constructions in the late Joseon period. Following conclusions have been reached through the study. First, Carpenter and other nine craftsmen were introduced in carpentry works. The craftsmen were put in by occupation to maintain the quality of the government building construction by wood processing area. It was distinguished by frame member, Sujangjae, window framing wood, decorative member. Second, sawyer showed a sharp increase in the latter half of the 18th century and declined since the middle of the 19th century. This is closely related to the increase in demand for building materials and the growth of civilian wood products. As a maximum of 300 people have been assigned to the craftsmen in the woodwork, it can be seen that the work has been divided by the process. Third, the national carpenter was difficult to procure from the 17th century to the beginning of the 18th century. From the middle 18th century, the system procuring national carpenter was stabilized. In the 19th century, the input ratio of the national craftsmen seems to have decreased significantly and seems to have kept it at the minimum level. Forth, sawyer were procured through Seongonggam from the late 18th century through the mid 19th century. That means that the role of the sawyer had become important. Since Jogakjang is not a necessary manpower, it usually has civilian artisans.

Optimization of Coverage Extension in OFDMA Based MMR System (OFDMA 방식을 사용하는 MMR시스템의 최적화된 커버리지 확장)

  • Kim, Seung-Yeon;Kim, Se-Jin;Ryu, Seung-Wan;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.567-574
    • /
    • 2008
  • In this paper, we propose an optimal coverage extension scheme in the OFDMA based mobile multi-hop relay system. First, we propose an optimal frequency and time assignment scheme for maximizing system throughput and analyze the frame efficiency of schemes. Then, under the given BS capacity, we find the maximum number of relay hops that can be used to estimate the maximum coverage area of a BS in a multi-hop relay system. Analytical results show that the proposed scheme is efficient in coverage extension and throughput maximization in OFDMA based multi-hop relay system. Our work may be a rough guideline to control the parameters for multi-hop relay system optimization.

The Verification of Image Merging for Lumber Scanning System (제재목 화상입력시스템의 화상병합 성능 검증)

  • Kim, Byung Nam;Kim, Kwang Mo;Shim, Kug-Bo;Lee, Hyoung Woo;Shim, Sang-Ro
    • Journal of the Korean Wood Science and Technology
    • /
    • v.37 no.6
    • /
    • pp.556-565
    • /
    • 2009
  • Automated visual grading system of lumber needs correct input image. In order to create a correct image of domestic red pine lumber 3.6 m long feeding on a conveyer, part images were captured using area sensor and template matching algorithm was applied to merge part images. Two kinds of template matching algorithms and six kinds of template sizes were adopted in this operation. Feature extracted method appeared to have more excellent image merging performance than fixed template method. Error length was attributed to a decline of similarity related by difference of partial brightness on a part image, specific pattern and template size. The mismatch part was repetitively generated at the long grain. The best size of template for image merging was $100{\times}100$ pixels. In a further study, assignment of exact template size, preprocessing of image merging for reduction of brightness difference will be needed to improve image merging.

Optimization of Planning-Level Locomotive Scheduling at KNR and Development of Its Implementation Prototype Program (한국철도에서의 계획단계 동력차 스케줄링 최적화 및 전문가 지원시스템의 프로토타입 프로그램 개발에 관한 연구)

  • 문대섭;김동오
    • Proceedings of the KSR Conference
    • /
    • 1999.11a
    • /
    • pp.46-53
    • /
    • 1999
  • As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

  • PDF

Design of a High-Speed Data Packet Allocation Circuit for Network-on-Chip (NoC 용 고속 데이터 패킷 할당 회로 설계)

  • Kim, Jeonghyun;Lee, Jaesung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.459-461
    • /
    • 2022
  • One of the big differences between Network-on-Chip (NoC) and the existing parallel processing system based on an off-chip network is that data packet routing is performed using a centralized control scheme. In such an environment, the best-effort packet routing problem becomes a real-time assignment problem in which data packet arriving time and processing time is the cost. In this paper, the Hungarian algorithm, a representative computational complexity reduction algorithm for the linear algebraic equation of the allocation problem, is implemented in the form of a hardware accelerator. As a result of logic synthesis using the TSMC 0.18um standard cell library, the area of the circuit designed through case analysis for the cost distribution is reduced by about 16% and the propagation delay of it is reduced by about 52%, compared to the circuit implementing the original operation sequence of the Hungarian algorithm.

  • PDF

A Study on Multiplexer Assignment Problem for Efficient Dronebot Network (효율적인 드론봇 네트워크 구성을 위한 Multiplexer 할당모형에 관한 연구)

  • Seungwon Baik
    • Journal of The Korean Institute of Defense Technology
    • /
    • v.5 no.2
    • /
    • pp.17-22
    • /
    • 2023
  • In the midst of the development of science and technology based on the 4th industrial revolution, the ROK Army is moving forward with the ARMY TIGER 4.0 system, a ground combat system that combines future advanced science and technology. The system is developing around an AI-based hyper-connected ground combat system, and has mobility, intelligence, and networking as core concepts. Especially, the dronebot combat system is used as a compound word that refers to unmanned combat systems including drones and ground unmanned systems. In future battlefields, it is expected that the use of unmanned and artificial intelligence-based weapon systems will increase. During the transition to a complete unmanned system, it is a very important issue to ensure connectivity individual unmanned systems themselves or between manned and unmanned systems on the battlefield. This paper introduces the Multiplexer Allocation Problem (MAP) for effective command control and communication of UAV/UGV, and proposes a heuristic algorithm. In addition, the performance of the proposed algorithm is analyzed by comparing the solutions and computing time. Also, we discuss future research area for the MAP.

  • PDF