• Title/Summary/Keyword: Information Systems Security Strategy

검색결과 170건 처리시간 0.031초

유도무기체계 탐색기 기술에 관한 연구 (A Study on the Seeker Technology in Guided Weapon System)

  • 이영욱
    • 융합보안논문지
    • /
    • 제8권2호
    • /
    • pp.103-109
    • /
    • 2008
  • 본 논문에서는 유도무기체계의 탐색기 기술에 대한 사항과 발전방향에 대해 연구하였다. 탐색기는 유도무기에 탑재되는 장치로서 호밍유도의 구현을 위해 표적을 찾고 확인하여 포착한 후 표적을 추적하며, 유도명령을 계산하는 데 필요한 표적의 방향 또는 위치 정보를 유도조종 장치에 제공하는 일련의 기능들을 수행한다. 따라서 탐색기는 유도무기의 체계 및 유도조종 성능을 결정하는 핵심장치 중의 하나이다. 탐색기는 전술 및 전력용 유도무기에 이르기까지 서로 다른 목표와 사양으로 개발되고 있으며 유도무기체계의 경제성, 운용성, 신뢰성과 명중률의 향상을 위해 설계 요구조건이 더욱 다양화되고 있다. 따라서 본 연구를 통해서 유도무기체계 탐색기의 특성 및 세부기술의 발전방향을 제시하였다.

  • PDF

Autonomous Transmission Power Adjustment Strategy for Femtocell Base Station

  • Alotaibi, Sultan
    • International Journal of Computer Science & Network Security
    • /
    • 제22권4호
    • /
    • pp.367-373
    • /
    • 2022
  • Femtocells have recently been recognized for their potential to boost network capacity, improve end-user QoS and throughput, and do so at a cheap cost and with ease of implementation. The use of femtocells in indoor environments, such as residential buildings with neighboring homes, is becoming more popular. Femtocells are subject to interference from other femtocells, and the unwanted effects of interference are amplified when femtocells are deployed in close proximity to one another. As a consequence, the network's overall performance is degraded to a significant degree. One of the strategies that is thought to be effective in reducing the impact of interference is altering the transmission power of the femtocells. In this paper, a dynamic downlink transmission power of femtocells is suggested. In accordance with the observed cost function unit, each femtocell automatically changes its transmission power. If a femtocell causes too much interference for its neighbors, its transmission power level will be limited by that interference's rate. A simulation experiment is conducted to validate the effectiveness of the suggested system when compared with other schemes. When compared to previous schemes, which are addressed in this study, the numerical results show that the proposed strategy could provide more capacity while also ideally mitigating the influence of interference among co-channel deployed femtocells.

Evolving Internet Information & Technology as Enablers for Creating Shared Values

  • Song, In Kuk;Chun, Junchul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.309-317
    • /
    • 2015
  • Recently many companies began to realize their visions for the sustainable growth with the advent of CSV(Creating Shared Values). Michael E. Porter, a Harvard Professor, claims that placing social value creation at the core of business strategy has the potential to uncover big opportunities for individual companies and that shared value can play a significant role in increasing competitive advantages while fostering social prosperity. In consequence, the various researches have illustrated how to get the opportunity for competitive advantages from building a social value proposition into corporate strategy, and considerable studies have been promoted heavily from the managerial perspective. However, due to the lack of capability converging information technology with business strategy, any research effort to identify technological or Internet-related issues and to link the issues to CSV does not exist. With Korean being a Internet leading country, the demands of researches analyzing core technology, information, and service utilizing Internet are rapidly growing. The study aims to find out Internet-related enablers for CSV. This paper describes the concepts and features of CSV, identifies emerging Internet-related issues toward the opportunity for competitive advantage, and then depicts the rigorous research endeavors in the areas of Internet information, technology, and services. As a result, 11 papers presented and selected as the outstanding papers at APIC-IST 2014 handle the issues to be brought together, which include: Wireless and Sensor Network, Image Processing and HCI, Big Data and Business Intelligence, Security & Privacy in Internet, SNS & Communication, Smart-Learning and e-Learning, and Internet Business Strategy. The study finally recommends indispensible terms for substantially vitalizing CSV.

A Robust Method for Speech Replay Attack Detection

  • Lin, Lang;Wang, Rangding;Yan, Diqun;Dong, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권1호
    • /
    • pp.168-182
    • /
    • 2020
  • Spoofing attacks, especially replay attacks, pose great security challenges to automatic speaker verification (ASV) systems. Current works on replay attacks detection primarily focused on either developing new features or improving classifier performance, ignoring the effects of feature variability, e.g., the channel variability. In this paper, we first establish a mathematical model for replay speech and introduce a method for eliminating the negative interference of the channel. Then a novel feature is proposed to detect the replay attacks. To further boost the detection performance, four post-processing methods using normalization techniques are investigated. We evaluate our proposed method on the ASVspoof 2017 dataset. The experimental results show that our approach outperforms the competing methods in terms of detection accuracy. More interestingly, we find that the proposed normalization strategy could also improve the performance of the existing algorithms.

Vulnerable Path Attack and its Detection

  • She, Chuyu;Wen, Wushao;Ye, Quanqi;Zheng, Kesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권4호
    • /
    • pp.2149-2170
    • /
    • 2017
  • Application-layer Distributed Denial-of-Service (DDoS) attack is one of the leading security problems in the Internet. In recent years, the attack strategies of application-layer DDoS have rapidly developed. This paper introduces a new attack strategy named Path Vulnerabilities-Based (PVB) attack. In this attack strategy, an attacker first analyzes the contents of web pages and subsequently measures the actual response time of each webpage to build a web-resource-weighted-directed graph. The attacker uses a Top M Longest Path algorithm to find M DDoS vulnerable paths that consume considerable resources when sequentially accessing the pages following any of those paths. A detection mechanism for such attack is also proposed and discussed. A finite-state machine is used to model the dynamical processes for the state of the user's session and monitor the PVB attacks. Numerical results based on real-traffic simulations reveal the efficiency of the attack strategy and the detection mechanism.

Optimal Allocation Strategy Based on Stackelberg Game for Inspecting Drunk Driving on Traffic Network

  • Jie, Yingmo;Li, Mingchu;Tang, Tingting;Guo, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권12호
    • /
    • pp.5759-5779
    • /
    • 2017
  • As the main means to cope with the stubborn problem of drunk driving, the inspection of drunk driving has already been paid more attention and thus reinforced. In this paper, we model this scenario as a Stackelberg game, where the police department (called defender) allocates resources dynamically in terms of the traffic situation on the traffic network to arrest drink drivers and drivers who drink (called attacker), whether choosing drunk driving or designated driving service, expect to minimize their cost for given travel routes. However, with the number of resources are limited, our goal is to calculate the optimal resource allocation strategy for the defender. Therefore, first, we provide an effective approach (named OISDD) to fulfill our goal, i.e., generate the optimal strategy to inspect drunk driving. Second, we apply OISDD to directed graphs (which are abstracted from Dalian traffic network) to analyze and test its correctness and rationality. The experimental results show that OISDD is feasible and efficient.

거래비용이 상이한 복수의 유통채널에 대한 다자간 협상전략에 관한 연구 (Strategic Analysis of the Multilateral Bargaining for the Distribution Channels with Different Transaction Costs)

  • 조형래;이민호
    • 산업경영시스템학회지
    • /
    • 제38권4호
    • /
    • pp.80-87
    • /
    • 2015
  • The proliferation of the Internet and communication technologies and applications, besides the conventional retailers, has led to a new form of distribution channel, namely home sopping through the telephone, TV, catalog or the Internet. The conventional and new distribution channels have different transaction costs perceived by the consumers in the following perspectives: the accessibility to the product information, the traffic cost and the opportunity cost for the time to visit the store, the possibility of 'touch and feel' to test the quality of the product, the delivery time and the concern for the security for the personal information. Difference in the transaction costs between the distribution channels results in the different selling prices even for the same product. Moreover, distribution channels with different selling prices necessarily result in different business surpluses. In this paper, we study the multilateral bargaining strategy of a manufacturer who sells a product through multiple distribution channels with different transaction costs. We first derive the Nash equilibrium solutions for both simultaneous and sequential bargaining games. The numerical analyses for the Nash equilibrium solutions show that the optimal bargaining strategy of the manufacturer heavily depends not only on the degree of competition between the distribution channels but on the difference of the business surpluses of the distribution channels. First, it is shown that there can be four types of locally optimal bargaining strategies if we assume the market powers of the manufacturer over the distribution channels can be different. It is also shown that, among the four local optimal bargaining strategies, simultaneous bargaining with the distribution channels is the most preferred bargaining strategy for the manufacturer.

Methodology for Computer Security Incident Response Teams into IoT Strategy

  • Bernal, Alejandro Enciso;Monterrubio, Sergio Mauricio Martinez;Fuente, Javier Parra;Crespo, Ruben Gonzalez;Verdu, Elena
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권5호
    • /
    • pp.1909-1928
    • /
    • 2021
  • At present, the Colombian government shares information on threats or vulnerabilities in the area of cybersecurity and cyberdefense, from other government agencies or departments, on an ad-hoc basis but not in real time, with the surveillance entities of the Government of the Republic of Colombia such as the Joint Command of Cybernetic Operations (CCOCI) and the Cybernetic Emergencies Response Team of Colombia (ColCERT). This research presents the MS-CSIRT (Management System Computer Security Incident Response Teams) methodology, that is used to unify the guidelines of a CSIRT towards a joint communication command in cybersecurity for the surveillance of Information Technology (IT), Technological Operations (TO), Internet Connection Sharing (ICS) or Internet of Things (IoT) infrastructures. This methodology evaluates the level of maturity, by means of a roadmap, to establish a CSIRT as a reference framework for government entities and as a guide for the areas of information security, IT and TO to strengthen the growth of the industry 4.0. This allows the organizations to draw a line of cybersecurity policy with scope, objectives, controls, metrics, procedures and use cases for the correct coordination between ColCERT and CCOCI, as support entities in cybersecurity, and the different companies (ICS, IoT, gas and energy, mining, maritime, agro-industrial, among others) or government agencies that use this methodology.

Countermeasure against Fire Disaster in Regional Heritage Villages on the Concept of ICT-Based Disaster Prevention Design

  • Park, Sun-Gyu;Mishima, Nobuo;Noh, Hwang-Woo;Yoo, Jae-Soo;Oh, Sang-Hoon;Min, Byung-Won;Oh, Yong-Sun
    • International Journal of Contents
    • /
    • 제11권1호
    • /
    • pp.62-68
    • /
    • 2015
  • Many severe earthquakes have occurred along the main fault lines in the world. In recent years, there has been a high incidence of small- and large-scale earthquakes in our country. These occurrences of earthquakes have become increasingly serious, owing to a degrading earth environment. An earthquake, in general, causes far more serious damages like disruptions in electricity or gas facilities, and fire disasters from its annexed effects than by its vibrations or the shock itself. In this paper, we present a countermeasure and its necessity in safeguarding against fire disasters in regional heritage villages such as "Asan Oeam," "Jeonju Hanok," and "Andong Hahoe." A more systematic and effective strategy for prevention systems against severe fire disasters is proposed after performing various related investigations and analyses of existing domestic and international systems. We investigated the existing fire security systems and their historical records with the tendency of earthquake occurrences in these three folk villages. In this proposal, we present a strategic approach for safeguarding against fire damages in our regional heritage villages derived from ICT (information communication technology)-based DPD (disaster prevention design), after examining the laws and regulations of fire-prevention strategies in Japan, America, and Europe.

Worst Closed-Loop Controlled Bulk Distributions of Stochastic Arrival Processes for Queue Performance

  • Lee Daniel C.
    • Journal of Communications and Networks
    • /
    • 제7권1호
    • /
    • pp.87-92
    • /
    • 2005
  • This paper presents basic queueing analysis contributing to teletraffc theory, with commonly accessible mathematical tools. This paper studies queueing systems with bulk arrivals. It is assumed that the number of arrivals and the expected number of arrivals in each bulk are bounded by some constraints B and (equation omitted), respectively. Subject to these constraints, convexity argument is used to show that the bulk-size probability distribution that results in the worst mean queue performance is an extremal distribution with support {1, B} and mean equal to A. Furthermore, from the viewpoint of security against denial-of-service attacks, this distribution remains the worst even if an adversary were allowed to choose the bulk-size distribution at each arrival instant as a function of past queue lengths; that is, the adversary can produce as bad queueing performance with an open-loop strategy as with any closed-loop strategy. These results are proven for an arbitrary arrival process with bulk arrivals and a general service model.