검색결과

검색조건
좁혀보기
검색필터
결과 내 재검색

간행물

    분야

      발행연도

      -

        검색결과 450

        441.
        2006.03 KCI 등재 서비스 종료(열람 제한)
        네트워크 게임이나 온라인 게임을 개발하는 데 있어서 네트워크 관련 프로그래밍 기술은 필수적이다. 그러나 필요한 네트워크에 관련 전문적인 지식을 포함하여 네트워크 통신 관련 고급 프로그래밍 기술들을 습득하고 또 이를 구현해 내는 데에는 적지 않은 노력과 시간이 소요된다. 본 연구는 이와 같은 노력과 시간을 줄일 수 있는 기술적 방법에 대한 것이다. 특히 Virtools 엔진의 서버 기술을 이용하여 P2P 방식의 네트워크 연결 모듈을개발해 봄으로써 개선할 수 있는 가능성을 제시하고자 한다.
        442.
        2005.08 KCI 등재 서비스 종료(열람 제한)
        전체 시스템을 최적상태로 유지하기 위한 정보공유의 필연성 등으로 대다수의 제어 시스템이 디지털 제어 시스템으로 대체되고 있다. 이러한 디지털 제어 시스템이 원활하게 운영되기 위해서는 전통적인 점대점 연결방식이 아닌 네트워크를 기반으로 한 시스템이 필수적이며, 이러한 산업용 네트워크를 지능형 항만 물류 시스템에 적용하기 위할 연구가 최근 다양하게 이루어지고 있다. 본 논문에서는 NMEA 2000의 기반이 되는 CAN 프로토콜을 이용한 크레인 시스템의 타당성을 검증하기 위하여 단순화된 네트워크 기반 제어 시스템을 구현하였다.
        443.
        2004.06 KCI 등재 서비스 종료(열람 제한)
        As urbanization has been expanded in Korea, open spaces, such as urban parks and public sites, have been utilized for other uses, and then this bring out environmental changes for the worse. It is expected that these changes become more serious problems due to overpopulation, increasing individualism, and development of transportation. This research base on the consideration of connecting between decreasing urban green spaces and distributed green sites so as to build the substantial plan for the Green Network construction for urban heat island mitigation in Dalseo district, Daegu Metropolitan City. The result were as follow; 1)Connecting existing natural sites to the remained parks green zone made an Ideal form of Green-Network system. 2)Some school sites were selected for usable open spaces in order to build Green-Network system, and the plan connecting together with exist natural sites was suggested. 3)Moreover, the scheme of planting on the road spaces for connecting green spaces was proposed. 4)The devices of planting on the urban riverside for enhancing the role of urban stream to form green network was conceived.
        444.
        2002.12 KCI 등재 서비스 종료(열람 제한)
        In T. S. Eliot's early poetic works, from his juvenilia to The Waste Land, the style changes are remarkable. The coherent, homogeneous, hypotactic, linear, logical style turns into the fragmented, heterogeneous, illogical, incoherent, paratactic style. Many literary critics have reviewed the diverse literary influences as well as philosophical, artistic, political, and social influences on his poems, but they have not taken into consideration one important factor: his writing tool. A writing tool is not merely a tool to record one's thought, but it can function as “a precondition of production that contributes to our thinking prior to any conscious reaction” (Friedrich Kittler, Gramophone, Film, Typewriter 214). In his early career, Eliot replaced the traditional writing tools of pen and ink with a modern mechanical writing tool, typewriter. These two writing tools are closely related with two distinct ratios of human senses and two different kinds of cultures. Handwriting requires the hand's collaboration with the eye that guides the hand through each movement and constantly attending to the creation of each letter. When the visual technology of handwriting is emphasized, it transforms fragmented and heterogeneous reality into “homogeneity, uniformity, and continuity” (Marshall McLuhan Understanding Media 87). However, typewriting that depends on blind and tactile technologies does not require the use of the eye in the act of composition. When the eye does not have to participate in the typewriting act, there is a radical change of the ratio of human senses in the moment of composition. On making tremendous impacts on modern human consciousness, and on the ways in which modern human beings perceive reality, think, and produce discourse, typewriting produces fragmented and disruptive writings, in which illogical thinking, heterogeneity, multi-formity, and discontinuity are prominent. Thus, I suggest that a new poetics of fragmentation and disruption in modernist works would be profitably reconsidered with respect to the typewriting technologies that dissociate the eye from the writing acts.
        445.
        2002.05 KCI 등재 서비스 종료(열람 제한)
        유 무선환경에서 침입 패턴이 다양화되고, 모바일의 편리성이 강조되면서 네트워크 대역폭이 다양한 전송 기반을 요구하고 있다. 그리고 무선기반의 자료가 급증하고 있어, 무선환경에서의 침입탐지시스템 성능에 문제가 될 수 있다. 그러므로 게이트웨이를 근간으로 한 무선전송 기반을 보호하고, 컴퓨터 운영체제 상에 내재된 보안상의 결함을 보호하기 위하여 기존의 운영체제 내에 보안 기능을 추가한 운영체제이며, 커널의 핵심 부분을 인지하여 무선기반의 시스템 사용자에 대한 식별 및 인증, 강제적 접근 통제, 임의적 접근 통제, 해킹 대응 등의 보안 기능 요소들을 갖추게 하여 보안성에 강한 시스템 유지를 요구한다. 그러므로 감시대상의 정보를 미리 알고, WAP환경하에서 감시대상에 유효한 침입패턴만을 검사하도록 침입패턴 데이터베이스를 분리하는 모델을 제시하여, 이러한 문제점에 대한 해결책을 제시하고자 하였다. 따라서 기존 침입탐지시스템의 패턴 데이터베이스를 분석하였고, 이를 적절히 분리하여 이를 다시 운영체제에 반영하는 기법이다. 그리고 이를 제시한 모델을 검증하고자 실제 구현과 실험을 통해 이를 검증하였다.
        447.
        2001.09 KCI 등재 서비스 종료(열람 제한)
        Optimum Ship Routing can be defined as 'The selection of an optimum track for a transoceanic crossing by the application of long-range predictions of wind, waves and currents to the knowledge of how the routed vessel reacts to these variables'. This paper treats the methodology how to solve optimum ship routing problem by network modeling and reveals the validity of the network model by some numerical experiments.
        448.
        2000.06 서비스 종료(열람 제한)
        A discrete system has interpreted by using the network model, and PERT network is one of these methods. For the purpose of analysing the real system, it is necessary to measure the parameter of the real system. And system identification problem is to assume the parameter of a real system when we get to know the system model, the input data and output data. System identification method has been only developed to a system of which a structure has expressed a differential equation or a polynomial expression. But it has been scarcely developed yet in that case of network model. The aim of this paper is to examine a changes when new system is introduced to the present system. The changes are as follows : how the present system will be changed, when the changes will be happened. In this paper, genetic algorithm is used to assume the parameter.
        450.
        1999.02 KCI 등재 서비스 종료(열람 제한)
        Our interest in this paper is in the efficient computation of a good low bound for the traveling salesman problem and is in the application of a network problem in agriculture. We base our approach on a relatively new formulation of the TSP as a two-commodity network flow problem. By assigning Lagrangian multipliers to certain constraints and relaxing them, the problem separates into two single-commodity network flow problems and an assignment problem, for which efficient algorithms are available.
        21 22 23