There are a lot of curved subway stations in Seoul metropolitan area. These must be straightly constructed as many as possible. But some of stations are roundly designed and built in order to avoid pre-existed underground obstacle such as basement of high rise building, underground gas or water pipe line and subway stations from another line. As shown fig 1, one of the biggest problem occurring curved subway station is considered large gap between platform and vehicle when vehicle completely stop at the station. The gap potentially is in existence to subway passenger as very dangerous factors in rush hours. If passenger accidentally drop their food or leg between this gap when they get on the train and train leaves station, the passenger will be seriously injured by vehicle. In this paper, various design and instruments are introduced and best solution for this matter will be presented. In order to eliminate any possibility of accident happened gap between platform and vehicle, KRRI(Korea Railroad Research Institute) have been developed new safety instrument. These technologies were applied for patent by KRRI. These mechanisms will provide confidence as well as safety to Korean subway passenger
Journal of the Institute of Electronics Engineers of Korea TC
/
v.45
no.6
/
pp.34-51
/
2008
Today, the Internet is a part of our life. For that reason, we regard revealing characteristics of Internet traffic as an important research theme. However, Internet traffic cannot be easily manipulated because it usually occupy huge capacity. This problem is a serious obstacle to analyze Internet traffic. Many researchers use various sampling techniques to reduce capacity of Internet traffic. In this paper, we compare several famous sampling techniques, and propose efficient sampling scheme. We chose some sampling techniques such as Systematic Sampling, Simple Random Sampling and Stratified Sampling with some sampling intensities such as 1/10, 1/100 and 1/1000. Our observation focused on Traffic Volume, Entropy Analysis and Packet Size Analysis. Both the simple random sampling and the count-based systematic sampling is proper to general case. On the other hand, time-based systematic sampling exhibits relatively bad results. The stratified sampling on Transport Layer Protocols, e.g.. TCP, UDP and so on, shows superior results. Our analysis results suggest that efficient sampling techniques satisfactorily maintain variation of traffic stream according to time change. The entropy analysis endures various sampling techniques well and fits detecting anomalous traffic. We found that a traffic volume diminishment caused by bottleneck could induce wrong results on the entropy analysis. We discovered that Packet Size Distribution perfectly tolerate any packet sampling techniques and intensities.
The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.
The ships over the certain navigation area or her length are required to carry charts under the relevant laws. Charts are indispensible to the ships and fishing vessel, because their crew should know the water depth and location of obstacle in order to avoid danger in the navigation and fishing area. But it was found that many ships do not carry proper charts onboard according to the research marine accidents files of marine accident inquiry agency, and questionnaire survey. Consequently, many ships run aground on the coast and port. This study examined the present status of the coastal ship and the fishing vessels, and explained some problems in the aspect of the covering area, the place, the number of the selling agent and adjoining chart, as well as the geographical and traffic density, the crew on board the ship's characteristics, and so on. In this study we propose the way to solve the problem. firstly, the category of the fishing vessel which should carry the chart on bard under the related laws are required to be lowered to 10 gross tons. Besides a ship inspector should examine if the charts covering the area where to navigate even when the temporary inspection is done are carried on board property. Secondly, the inspection body or the controlling office of ship's entry and departure should check throughly whether the ships concerned carry the chart on board. Thirdly the fishing vessels should used the fishing charts, and the body concerned should train the offices about how to use chart, especiany the difference between Tokyo datum and WGS-84 datum. Fourthly the customized chart such as an atlas like a map, a calenda-type chart, a small chart, as a coated chart needs to be publish for the safety of small ship and fishing vessel. Fifthly, it is advisable to draw a recommended course in the route where the coastal navigate mainly and in the narrow channel, The adjoining area should be improved, as well as the qualify of the chart paper. Sixthly, publication of additional new chart in the southern part of East Sea, the eastern part of South Sea, the western part of South Sea and middle part of Yellow Sea near Incheon port should be thought over. Seventhly, the number of chart selling agent should be increased for the sake of purchaser in proportion to the number of port, and small correction of charts in selling agent must be carried out completely.
The main purpose of this study is to analyze the reform of deadministration of universities in China by the Cooper's 4-dimension of education policy theory. Based on the theory, the reform of deadministration was analyzed in four dimensions(normative, structural, constituent, and technical dimension). First, in the normative dimension, the Chinese university deadministration policy is fully guaranteed by law, and mainly aimed at "modernization of education management system and management ability". Second, in the structural dimension, a highly administrative management paradigm of universities has played an important role during the early stages of higher education development, but it now becomes one of the main obstacle to its further development. However, the Chinese university de-administration policy is a policy that has taken almost 60 years. Therefore, this problem must be solved step by step. Third, in the constituent dimension, although there were some differences in the attitudes towards "the administration" and "the de-administration" of Chinese scholars, university presidents and the public(students), most of them agreed on eliminating "the administration of universities." Fourth, in the technical dimension, Chinese central government and many universities have accumulated many achievements of "the deadministration policies" in management and practice, while some criticisms are heard, either. However, I hope that all reform cases, regardless of their success or failure, will become a model for future administrative reforms.
Proceedings of the Korean Institute of Information and Commucation Sciences Conference
/
2014.05a
/
pp.867-870
/
2014
Currently a number of universities and other educational institutions in the e-learning education system being implemented. Also that there is a demand. However, existing e-learning system has many problems. First, the theory of how the university -centered education and training institutions to adopt e-learning system has become the biggest obstacle. In addition, students can not engage the problem of a one-way lecture. In this paper, the theory -oriented and practice to overcome the one-way river systems programming language will develop e-learning content. Using socket communication and multi-threaded server-side Web browser on the client side through the compiler without installing a separate application installation and environmental learning environment can be unrestricted. Hands- content programming language allows the learner to direct the client-side source code in a web browser by entering the lecture is leading the way. For learners to enter the source code compiled to run on the server side, the compiler provides the learner results. Hands- because the future e-learning content development in e-learning systems will be a major contribution to.
Journal of the Computational Structural Engineering Institute of Korea
/
v.32
no.2
/
pp.75-86
/
2019
The biggest obstacle in the nuclear power generation is the high level radioactive waste such as the spent nuclear fuel. High level radioactivities and generated heat make the safe treatment of the spent nuclear fuel very difficult. Nowadays, the only treatment method is a deep geological disposal technology. This paper treats the structural safe design problem of the spent nuclear fuel disposal canister which is one of the core technologies of the deep geological disposal technology. Especially, this paper executed the nonlinear structural analysis for the stresses and deformations occurring in the canister due to the impulsive force applied to the spent nuclear fuel disposal canister in the case of an accidental drop and ground impact event from the transportation vehicle in the repository. The main content of the analysis is about that the impulsive force is obtained using the commercial rigid body dynamic analysis computer code, RecurDyn, and the stress and deformation caused by this impulsive force are obtained using the commercial finite element static structural analysis computer code, NISA. The analysis results show that large stresses and deformations may occur in the canister, especially in the rid or the bottom of the canister, due to the impulsive force occurring during the collision impact period.
Journal of the Computational Structural Engineering Institute of Korea
/
v.34
no.6
/
pp.403-408
/
2021
Currently, in the design process of civil structures such as bridges, it is common to make final products by repeating the process of redesigning, if the initial design is found to not meet the standards after a structural review. This iterative process extends the design time, and causes inefficient consumption of engineering manpower, which should be put into higher-level design, on simple repetitive mechanical work. This problem can be resolved by automating the design process, but the external analysis program used in the design process has been the biggest obstacle to such automation. In this study, we constructed an AI-based automation system for the bridge design process, including an interface that could control both a reinforcement learning algorithm, and an external analysis program, to replace the repetitive tasks in the current design process. The prototype of the system built in this study was developed for a 2-span RC Rahmen bridge, which is one of the simplest bridge systems. In the future, it is expected that the developed interface system can be utilized as a basic technology for linking the latest AI with other types of bridge designs.
The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.
In the domestic data exchanging market, unreasonable pricing of purchase data is consistently mentioned as a major obstacle in data trading. This is a problem caused by the inability to properly evaluate the value of data products due to lack of product information and experience in using them. In order to activate trading, the data exchanges need to provide information that allows consumers to comprehensively judge the value of data products in addition to prices. The cost-based, income-based, and market-based methods, which are mainly applied to data valuation, are insufficient as data valuation methods to stimulate trading and distribution because only price information, a result of valuation from a supplier's point of view, can be shared with consumers. This study aims to develop a measurable valuation method that allows data trading stakeholders (exchanges, suppliers, and consumers) to judge and share the value of data products from a common perspective. To this end, we identified the value drivers of data products, which are considered important in overseas data exchanges and related research, and derived an evaluation method that can quantitatively measure each value driver. In addition, evaluation criteria in the form of a rating table were developed using data products for transactions, and a value evaluation index was developed through stratification analysis (AHP) to enable relative value comparison. As a result of applying the evaluation criteria to actual data products, it was found that the evaluation values were differentiated according to the characteristics of individual data products, so it could be used as a relative value comparison tool.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.