• 제목/요약/키워드: 선출

검색결과 439건 처리시간 0.028초

Analysis of Research Trends on Public Broadcasting Governance: Focusing on Korean Studies since 2000 (디지털 미디어 환경에서의 공영방송 지배구조에 대한 국내 연구동향 분석: 2000년 이후를 중심으로)

  • Hong, Won-Sik;Kim, Chang-Suk
    • Informatization Policy
    • /
    • 제29권4호
    • /
    • pp.3-25
    • /
    • 2022
  • The governance structure of public broadcasters is the hottest topic in domestic media policy. This study examines the flow of discussions by period by synthesizing the research literature on the governance structure of domestic public broadcasting since 2000. As a result, active discussion on the governance structure of public broadcasting was confirmed to have appeared following the conservative governments after 2008, derived from the "crisis theory of public broadcasting." In addition, the discussion was conducted centered on the public values of public broadcasting and direction of system improvement, political independence of public broadcasting, composition of the board of directors, and presidential election system. This study suggested that future discussions on the governance structure of public broadcasting should expand the existing discussion of political independence to encompass the values, responsibilities, and systems of public broadcasting that presuppose citizen participation.

Cluster Management Scheme for Safety Message Dissemination in a VANET Environment (VANET 환경에서 안전 메시지 배포를 위한 클러스터 관리 기법)

  • Pyun, Do-Woong;Lim, Jongtae;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • 제22권5호
    • /
    • pp.26-36
    • /
    • 2022
  • Recently, studies have been conducted to cluster vehicles and disseminate safety messages in a VANET environment for driver safety and smoothy traffic. This paper proposes cluster management scheme for safety message dissemination through V2V communication and V2I communication in a VANET environment with high vehicle density and mobility. The proposed scheme reduces packet loss by selecting CH considering reception quality, total data owned by vehicles, moving speed, and connected vehicles, and maintaining cluster head candidates, which are the main agents of message dissemination, considering frequent cluster departures and subscriptions. In addition, the proposed scheme reduces duplicate messages by utilizing clusters by collaborating with a Road side unit(RSU). To prove the excellence of the proposed scheme, various performance evaluations are performed in terms of message packet loss and the number of RSU processing requests. As a result of performance evaluation, the cluster management scheme proposed in this paper shows better performance than the existing scheme.

Terminological Misuses and Institutional Coherence in Electoral Systems (선거제도의 개념 오용과 정합성: 비례대표성을 중심으로)

  • Kim, Chae-Han
    • Korean Journal of Legislative Studies
    • /
    • 제25권3호
    • /
    • pp.5-31
    • /
    • 2019
  • In the process of changing the Korean electoral system, various terms such as representation, majority, minority, plurality, and proportionality are not used correctly, making normative judgment on its desirable electoral system difficult. This paper clarifies the concepts and terminology related to the electoral system in order to enable proper normative discussion. First, the misuse of the names of the electoral system is reviewed. This includes the majority representative system versus the minority representative system, the single-member constituency versus the multi-member constituency, the absolute majority system versus the relative majority system, and the majority representative system versus the proportional representative system. Next, the principles of representation, proportionality, democracy, direct ballot, and equal ballot are discussed to evaluate the decisions made by the Constitutional Court of Korea. In the current electoral system of the National Assembly, the equivalence between its constituency member and its proportional representation member is very low in terms of proportionality between votes received and seats allotted. Finally, the coherence between proportional representation and other political institutions is examined. Strengthening the proportionality of parliamentary elections alone does not necessarily increase the proportionality of the entire power structure.

Waiting Time and Sojourn Time Analysis of Discrete-time Geo/G/1 Queues under DT-policy (DT-정책 하에서 운영되는 이산시간 Geo/G/1 시스템의 대기시간과 체재시간 분석)

  • Se Won Lee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • 제29권2호
    • /
    • pp.69-80
    • /
    • 2024
  • In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.

Directions for More Effective County Extension Committees (군 농촌지도위원회의 효율적 운영 방안)

  • Martens, Daniel C.;Kim, Sung-Soo
    • Journal of Agricultural Extension & Community Development
    • /
    • 제6권2호
    • /
    • pp.75-84
    • /
    • 1999
  • Minnesota state law requires County Extension Committees (CECs). The County Board of Commissioners appoints committee members. Extension Educators are responsible for using CECs to assure the value of Extension work in the County. This paper will explore underlying values, principles and practices that can effect the utilization of CECs in ways that benefit the work of Extension and make the process a good experience for CEC members and Extension Educator. The paper is based primarily on readings in the Journal of Extension, interviews with two Extension Educator, and information provided by the University of Minnesota Extension Service for CEC members.

  • PDF

An Energy Efficient Unequal Clustering Algorithm for Wireless Sensor Networks (무선 센서 네트워크에서의 에너지 효율적인 불균형 클러스터링 알고리즘)

  • Lee, Sung-Ju;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • 제16C권6호
    • /
    • pp.783-790
    • /
    • 2009
  • The necessity of wireless sensor networks is increasing in the recent years. So many researches are studied in wireless sensor networks. The clustering algorithm provides an effective way to prolong the lifetime of the wireless sensor networks. The one-hop routing of LEACH algorithm is an inefficient way in the energy consumption of cluster-head, because it transmits a data to the BS(Base Station) with one-hop. On the other hand, other clustering algorithms transmit data to the BS with multi-hop, because the multi-hop transmission is an effective way. But the multi-hop routing of other clustering algorithms which transmits data to BS with multi-hop have a data bottleneck state problem. The unequal clustering algorithm solved a data bottleneck state problem by increasing the routing path. Most of the unequal clustering algorithms partition the nodes into clusters of unequal size, and clusters closer to the BS have small-size the those farther away from the BS. However, the energy consumption of cluster-head in unequal clustering algorithm is more increased than other clustering algorithms. In the thesis, I propose an energy efficient unequal clustering algorithm which decreases the energy consumption of cluster-head and solves the data bottleneck state problem. The basic idea is divided a three part. First of all I provide that the election of appropriate cluster-head. Next, I offer that the decision of cluster-size which consider the distance from the BS, the energy state of node and the number of neighborhood node. Finally, I provide that the election of assistant node which the transmit function substituted for cluster-head. As a result, the energy consumption of cluster-head is minimized, and the energy consumption of total network is minimized.

A Study on the Organization and Authority of the Personal Information Protection Commission (개인정보보호위원회의 조직과 권한에 관한 연구)

  • Kim, Ilhwan;Kim, Jaehyoun
    • Journal of Internet Computing and Services
    • /
    • 제16권4호
    • /
    • pp.149-156
    • /
    • 2015
  • The Personal Information Protection Commission shall be established under the direct jurisdiction of the President and shall independently perform affairs under its authority. It shall be comprised of total 15 members (5 members designated by the President, 5 members elected at the National Assembly and 5 members designated by the Chief Justice of the Supreme Court), including one minister-level Chairperson and one vice-minister-level standing member. Main functions of the Personal Information Protection Commission include deliberation and resolution of major policies and improvement of ordinances and systems related to personal information protection, coordination of opinions among public institutions in regards to the management of personal information, recommendation of improvement such as suspension of infringement by a central administrative agency, a local government and a constitutional institution, and submission of annual reports on personal information protection to the National Assembly. The function and role of the Personal Information Protection Commission regulated by the current law are insufficient in terms of independence and authorities of protection agencies compared to the international standard or level of discussion. The Commission thus cannot play a sufficient role as an independent agency for efficient protection of personal information. Therefore, there is a need for law revision that revives the purpose of the establishment of the Personal Information Protection Commission.

The storage characteristic study of pelletized RDF (펠렛형 폐기물 고형연료의 저장 특성 연구)

  • Choi, Yeonseok;Kim, Yeongjae;Han, Soyoung;Jeong, Minhong
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 한국신재생에너지학회 2010년도 추계학술대회 초록집
    • /
    • pp.157-157
    • /
    • 2010
  • RDF는 장기저장이 가능한 것이 특징 중의 하나이지만, 우리나라보다 앞서 대량저장을 시작한 일본의 RDF 저장 사일로에서 폭발사고가 발생한 사례가 있어, RDF를 실제로 저장하여 RDF 온도 및 가연성가스 발생상황 등을 장기간 감시 측정하여 사일로 안전관리지표를 도출하였다. 실험에 사용한 RDF 저장조는 직경 3.1m, 높이 11.4m의 사일로방식으로 제작하였다. RDF 저장량은 $70m^3$이었으며, 저장기간은 475일이었다. 사일로에는 15개의 열전대를 설치하여 사일로 표면, 직경방향 1.2m 지점 및 기온을 측정하여 수직방향 및 수평방향의 온도변화를 분석하였다. 가스 샘플링포트는 온도측정지점과 동일한 위치 설치하여 진공펌프로 흡인하여 테트라 백에 포집하여 GC로 분석하였으며, 가스샘플링은 17회 실시하였다. 비교적 대형 저장설비이고 RDF가 열전도성이 낮은 물질임에도 불구하고 사일로 내부온도는 기온보다는 높았지만, 기온의 영향을 많이 받아 7월에 정점, 1월에 하점을 나타내는 사인곡선과 같은 패턴을 보였다. 측정지점별 온도차는 수평방향 보다 수직방향에서 높게 나타났으며, RDF층으로 전열 및 축열이 진행되고 생화학반응을 촉진시키는 상승작용의 결과로 월평균온도가 $49^{\circ}C$를 나타내는 지점도 있었다. 실제 사일로는 RDF의 투입과 배출이 연속적으로 진행되어 방열이 이루어지므로 하계에 대량저장을 실시하지 않는 한 RDF층 내부에서 생화학적 반응열이 생성되더라도 $40^{\circ}C$를 상회할 가능성은 매우 희박할 것으로 판단된다. RDF 저장시 발생하는 가스는 대부분 $CO_2$였으며, 미량이지만 $H_2$, CO, $CH_4$도 검출되었다. 가연성 가스는 저장 후 2개월 동안은 발생하지 않았으며, 하계에는 타 계절에 비해 상대적으로 고농도로 검출되었다. 발생가스와 온도 및 $CO_2$$H_2$농도의 상관성은 높게 나타나지 않았지만, 정의 상관관계를 나타내었다. 저장한 RDF의 성상(수분, 발열량, 분화물)은 실험개시 전의 RDF분석결과와 실험종료 후 분석결과에서는 큰 차이가 나타나지 않았다. 따라서 RDF의 안전 저장을 위해서는 (1) 반입되는 RDF성상관리, (2) RDF가 2개월 이상 장기간 체류하는 데드스페이스가 발생하지 않고 선입선출이 확보되는 저장조 설계, (3) 사일로 내부에 최소 3개 이상의 지점에서 온도를 측정하여 상시감시하고 $40^{\circ}C$이하로 관리, (4) 발생가스는 CO, $CO_2$, $H_2$, $CH_4$ 등의 가연성가스를 모두 측정 감시하는 것이 바람직하지만, 최소 $CO_2$$H_2$는 상시감시하고 각각 1%와 100ppm 미만으로 관리, (5) 배풍기 등을 이용한 상시 환기실시, (6) 하계에는 대량저장이 이루어지지 않도록 저장조 운용계획 수립 등을 실시해야 한다.

  • PDF

Efficient Broadcasting Scheme of Emergency Message based on VANET and IP Gateway (VANET과 IP 게이트웨이에 기반한 긴급메시지의 효율적 방송 방법)

  • Kim, Dongwon;Park, Mi-Ryong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • 제16권4호
    • /
    • pp.31-40
    • /
    • 2016
  • In vehicular ad-hoc networks (VANETs), vehicles sense information on emergency incidents (e.g., accidents, unexpected road conditions, etc.) and propagate this information to following vehicles and a server to share the information. However, this process of emergency message propagation is based on multiple broadcast messages and can lead to broadcast storms. To address this issue, in this work, we use a novel approach to detect the vehicles that are farthest away but within communication range of the transmitting vehicle. Specifically, we discuss a signal-to-noise ratio (SNR)-based linear back-off (SLB) scheme where vehicles implicitly detect their relative locations to the transmitter with respect to the SNR of the received packets. Once the relative locations are detected, nodes that are farther away will set a relatively shorter back-off to prioritize its forwarding process so that other vehicles can suppress their transmissions based on packet overhearing. We evaluate SLB using a realistic simulation environment which consists of a NS-3 VANET simulation environment, a software-based WiFi-IP gateway, and an ITS server operating on a separate machine. Comparisons with other broadcasting-based schemes indicate that SLB successfully propagates emergency messages with latencies and hop counts that is close to the experimental optimal while reducing the number of transmissions by as much as 1/20.

Cache Memory and Replacement Algorithm Implementation and Performance Comparison

  • Park, Na Eun;Kim, Jongwan;Jeong, Tae Seog
    • Journal of the Korea Society of Computer and Information
    • /
    • 제25권3호
    • /
    • pp.11-17
    • /
    • 2020
  • In this paper, we propose practical results for cache replacement policy by measuring cache hit and search time for each replacement algorithm through cache simulation. Thus, the structure of each cache memory and the four types of alternative policies of FIFO, LFU, LRU and Random were implemented in software to analyze the characteristics of each technique. The paper experiment showed that the LRU algorithm showed hit rate and search time of 36.044% and 577.936ns in uniform distribution, 45.636% and 504.692ns in deflection distribution, while the FIFO algorithm showed similar performance to the LRU algorithm at 36.078% and 554.772ns in even distribution and 45.662% and 489.574ns in bias distribution. Then LFU followed, Random algorithm was measured at 30.042% and 622.866ns at even distribution, 36.36% at deflection distribution and 553.878ns at lowest performance. The LRU replacement method commonly used in cache memory has the complexity of implementation, but it is the most efficient alternative to conventional alternative algorithms, indicating that it is a reasonable alternative method considering the reference information of data.