• Title/Summary/Keyword: executing

Search Result 1,025, Processing Time 0.025 seconds

The Transfrontier Development Strategies in European Union - A Case Study of the Transfrontier among France-Belgium-Luxemburg - (유럽연합의 접경지역 개발 전략 - 프랑스-벨기에-룩셈부르크의 P. E. D.를 사례로 -)

  • 문남철
    • Journal of the Korean Geographical Society
    • /
    • v.37 no.4
    • /
    • pp.442-459
    • /
    • 2002
  • With the formation of European Union, the frontier function which was existed among the member nations was vanished. The European Union, each national government, and local or regional self-government search actively for the transfrontier development strategies in order to make the underdeveloped transfrontiers an united internal region of European Union with an augmentation of mutual activities inter-transfrontier and a cooperative development of transfrontier. On the transfrontier among France-Belgium-Luxemburg which was the iron industry center of Europe, the cooperative development strategies(P.E.D.) of the inter-government and inter-local are executing for the restructuring of the stable regional economic on the basis of the INITRREG program of the European Union. In recent years, the locals self-govemments transfrontier are executing not only restructuring of regional economic but formation of urban community with the unification of the urban and regional planning, administration, and society.

An Efficient Smart Phone Applications Executing Method by ART2 Algorithm (ART2 알고리즘을 이용한 효율적인 스마트폰 어플리케이션 실행 방법)

  • Kim, Kwang-Beak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.4
    • /
    • pp.569-574
    • /
    • 2013
  • With probably too many smart phone applications downloaded, it is sometimes frustrating to find frequently used applications quickly. In this paper, we propose a learning application that learns what applications a user frequently uses and match them with several signals that user designated. This learning applications uses ART2 algorithm that is good for stable real-time learning. By executing this learning application, a user simply chooses an application that is to be quickly searched and then draw a figure that would match the designated application at the upper left corner of our learning application. The proposed learning application transforms the background with 0's and the figure with 1's and normalize them to be used as inputs for ART2 and ART2 does clustering to setup a match table between applications and figures. After learning, a user simply draws a figure to execute one's frequently used application.

A Study on the Outcome Evaluation Criteria of Executing Negotiation on BTL project -Focused on Cultural Facilities- (BTL사업 협상수행 성과평가 지표에 관한 연구 - 문화시설을 대상으로 -)

  • Lee, Hyun-Chul;Lee, Jae-Hong;GO, Seong-Seok
    • Korean Journal of Construction Engineering and Management
    • /
    • v.10 no.4
    • /
    • pp.3-13
    • /
    • 2009
  • When promoting BTL(Build Transfer Lease; below BTL) project, negotiation is a stage of examining observation and reflection of RFP(Request for Proposal below RFP) in terms with facilities, operating and financing. It keeps an important position in whole process. However, there is no consistent guideline or model which helps evaluating the result of negotiation. It is difficult to apprise the quantitative outcome after executing negotiation. Thus, this study presented the Value Engineering -based process and model of estimating the outcome of negotiation for the purpose of estimating and verifying the result of negotiation objectively, Evaluating factors of negotiation were classified into 6 fields, 38 divisions and 135 items, focused on cultural facilities on BTL project. Weight of every factor was estimated, and quantitative checklist was established. This study presented the model which could measure the outcome of negotiation. This result would be a critical checklist before negotiation on BTL project, an index of feedback during negotiation, and also a standard of estimating the outcome after negotiation.

An Automated Test Technique of GUI Based on Source Code (소스코드기반의 GUI 테스트 자동화 기법의 구현)

  • Moon, Joong-Hee;Lee, Nam-Yong
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.9
    • /
    • pp.697-705
    • /
    • 2009
  • A GUI automated test can be divided into two areas. The first one is a regression test automation and the second one is an automated test. The former includes generating test cases manually and executing them automatically but the latter includes both generating test cases and executing them automatically. Costs of a software test are increasing more and more. Many companies are searching for a test automation method but most used things are limited to regression test automation. So, when testing at first, there should be test cases which are drawn up by a human. This paper explains to make test cases based on a source code and execute them automatically. In this paper, the study proceeds with a digital television set-top box application and explains to test without any effort of human. Of course, this study is far from a realization to industries. But this paper has a contribution at reducing more human efforts than the previous regression test automation and showing that later, fully automated test can be possible.

Executing System of Virtual Machine Code using Decompiling Method (역컴파일링 기법을 이용한 가상기계 코드 실행 시스템)

  • Ahn, Duk-Ki;Yi, Chang-Hwan;Oh, Se-Man
    • The KIPS Transactions:PartA
    • /
    • v.14A no.2
    • /
    • pp.91-98
    • /
    • 2007
  • Generally, virtual machine platform is composed of a compiler, an assembler, and VM(Virtual Machine). To develop it, the design of VMC(Virtual Machine Code) is an essential task. And it is very important to verify the virtual machine platform. To do this and furthermore to execute VMC, it needs to implement VMC execution system using compiling method, interpreting method, or decompiling method. In this paper, we suggested and implemented the executing system of VMC using decompiling method out of three methods to execute the VMC. In our implementation, the VMC is SIL(Standard Intermediate Language) that is an intermediate code of EVM(Embedded Virtual Machine). Actually, we verified the usefulness of the decompiling method. And the decompiling method suggested in this paper can be used to minimize the mistake in developing Virtual machine platform.

A Study for Control of Thermal Cracking by Heat of Hydration in Subway Concrete Box Structure (지하철 콘크리트 BOX 구조물의 수화열에 의한 온도균열 제어 방안 연구)

  • Song, Suk-Jun;Yoo, Sang-Geon;Park, Ji-Woong;Kim, Eun-Kyum
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.6
    • /
    • pp.1024-1029
    • /
    • 2009
  • According to increase of massive concrete structures, Thermal crack done by heat of hydration have been increased in a process of the execution. In case of a subway concrete box structure, thickness of structures are almost over 1 meter, and penetrating crack by external restraint takes a bad effect on the durability with a water leakage and deterioration in especially concrete wall. A try of shortening a constructing period often occurs as subway is generally constructed according to a road to decrease a traffic jam. The research proposes executing method by skipping one block as a plan of shortening a constructing period and investigate an influence on thermal cracking control. Additionally, sensitivity analysis is accomplished by changing a height of a concrete wall, and concrete placing and air temperature met with a field condition.

Analysis of the End-of-Chapter Questions in Chemistry II according to Revised Bloom's Taxonomy of Educational Objectives (Bloom의 개정된 교육목표 분류에 따른 화학II 단원 평가 문항 분석)

  • Seo, Young-Jin;Kim, Hyoung-Soo;Chae, Hee-K.
    • Journal of the Korean Chemical Society
    • /
    • v.54 no.3
    • /
    • pp.329-337
    • /
    • 2010
  • In this study, we analyzed the end-of-chapter questions in 8 types of chemistry II textbooks for science teachers according to revised Bloom's taxonomy of educational objectives not only to raise interests of questions in textbooks but also acquire a basic material for using questions in textbooks effectively. The results of classification following Bloom's cognitive category showed that 'Understanding(44.7%)' level was the most, then 'Application(29.9%)', Knowledge(15.6%) and 'Analysis (9.5%)' in order, which is distinct difference from the result of classification of the end-of-chapter questions in college general chemistry books which was 'Application', 'Analysis' and 'Understanding' in order. Especially, questions of 'Evaluation' level were not found at all in any textbook investigated and 'Synthesis(0.3%)' level was very few. On the other hand, the percentage of questions in 'Understanding' and 'Executing Quantitative' which required specific algorithms was 70% of total with most of the questions in 'Application' were 'Executing Quantitative'.

Core Point Detection Using Labeling Method in Fingerprint (레이블링 방법을 이용한 지문 영상의 기준점 검출)

  • 송영철;박철현;박길흠
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9C
    • /
    • pp.860-867
    • /
    • 2003
  • In this paper, an efficient core point detection method using orientation pattern labeling is proposed in fingerprint image. The core point, which is one of the singular points in fingerprint image, is used as the reference point in the most fingerprint recognizing system. Therefore, the detection of the core point is the most essential step of the fingerprint recognizing system, it can affect in the whole system performance. The proposed method could detect the position of the core point by applying the labeling method for the directional pattern which is come from the distribution of the ridges in fingerprint image and applying detailed algorithms for the decision of the core point's position. The simulation result of proposed method is better than the result of Poincare index method and the sine map method in executing time and detecting rate. Especially, the Poincare index method can't detect the core point in the detection of the arch type and the sine map method takes too much times for executing. But the proposed method can overcome these problems.

Fixed Time Synchronous IPC in Zephyr Kernel (Zephyr 커널에서 고정 시간 동기식 IPC 구현)

  • Jung, Jooyoung;Kim, Eunyoung;Shin, Dongha
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.4
    • /
    • pp.205-212
    • /
    • 2017
  • Linux Foundation has announced a real-time kernel, called Zephyr, for IoT applications recently. Zephyr kernel provides synchronous and asynchronous IPC for data communication between threads. Synchronous IPC is useful for programming multi-threads that need to be executed synchronously, since the sender thread is blocked until the data is delivered to the receiver thread and the completion of data transfer can be known to two threads. In general, 'IPC execution time' is defined as the time duration between the sender thread sends data and the receiver thread receives the data sent. Especially, it is important that 'IPC execution time' in the synchronous IPC should be fixed in real-time kernel like Zephyr. However, we have found that the execution time of the synchronous IPC in Zephyr kernel increases in proportion to the number of threads executing in the kernel. In this paper, we propose a method to implement a fixed time synchronous IPC in Zephyr kernel using Direct Thread Switching(DTS) technique. Using the technique, the receiver thread executes directly after the sender thread sends a data during the remaining time slice of the sender thread and we can archive a fixed IPC execution time even when the number of threads executing in the kernel increases. In this paper, we implemented synchronous IPC using DTS in the Zephyr kernel and found the IPC execution time of the IPC is always 389 cycle that is relatively small and fixed.

Research on An Energy Efficient Triangular Shape Routing Protocol based on Clusters (클러스터에 기반한 에너지 효율적 삼각모양 라우팅 프로토콜에 관한 연구)

  • Nurhayati, Nurhayati;Lee, Kyung-Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.115-122
    • /
    • 2011
  • In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.