• Title/Summary/Keyword: 실행 횟수

Search Result 149, Processing Time 0.022 seconds

Optimistic Concurrency Control based on TimeStamp Intervals for Broadcast Environment: OCC/TI (방송환경에서 타임스탬프 구간에 기반을 둔 낙관적 동시성 제어 기법)

  • 이욱현;황부현
    • Journal of KIISE:Databases
    • /
    • v.29 no.6
    • /
    • pp.477-491
    • /
    • 2002
  • The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

Train Topology Discovery Protocol(TTDP) over Dual-Band WLAN-Based Train Communication Network (이중 무선랜 기반 차량 통신망에서의 열차 토폴러지 구성 프로토콜(TTDP))

  • Kang, Shinkwang;Park, Jaehyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.1102-1109
    • /
    • 2017
  • In Train Control Network(TCN), to support advanced services beyond control applications, it was revised to support high speed ethernet as IEC 61375-2-5(ETB) and IEC 61375-3-4(ECN). And Train Topology Discovery Protocol(TTDP) was included by which train-consist can be automatically configured. Meanwhile, to adopt wireless LAN as an next onboard network, TTDP need to be modified to reflect the characteristics of WLAN. This paper proposed a TTDP for WLAN using transmission power control and the number of HELLO-ACK handshake. And it determined whether the TTDP executed using the two WLAN interfaces having different bandwidths is correct or not. The proposed TTDP can allow to reduce interference from other nodes. For evaluation of performance of TTDP, NS-2 was used. The evaluation result shows the high reliability of the TTDP in wireless environment.

Balancing the Tradeoffs Between Exploration and Exploitation (탐색 (Exploration)과 이용(Exploitation)의 상반관계의 균형에 관한 연구)

  • Park, Sun-Ju
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.11
    • /
    • pp.1099-1110
    • /
    • 2005
  • As auctions become popular, developing good agent bidding strategies has been an important focus in agent-based electronic commerce research. Especially for the continuous double auctions where no single dominant strategy is known, the agent bidding strategy has practical significance. This paper introduces an adaptive agent strategy for the countinuous double auction. The central idea is to let the agent figure out at run time when the sophisticated strategy (called the p-strategy) is beneficial and when a simpler strategy is better. Balance between exploration and exploitation is achieved by using a heuristic exploration function that trades off the expected profits and the number of tries of each strategy. We have experimentally evaluated the performance of the adaptive strategy in a wide variety of environments. The experiment results indicate that the adaptive strategy outperforms the plain p-strategy when the p-strategy performs poorly, while it performs similar to the p-strategy when the p-strategy dominates the other simple strategies.

A Efficient Debugging Method for Java Programs (자바 프로그램을 위한 효율적인 디버깅 방법)

  • 고훈준;유원희
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2002.06a
    • /
    • pp.170-176
    • /
    • 2002
  • Java language is a representative object-oriented language that is used at the various platform and fields. A structure of java language is simpler than traditional procedural-oriented language because of characters of object-oriented language But it is difficult to debug complicated java programs. Debugging has always been a costly part of software development. Syntax errors of java programs is easily found by the current debugging system. But it is difficult to locate logical errors included in java programs. Traditional debugging techniques locating logical errors in java program have been still used with conventional methods that are used at procedural-oriented languages. Unfortunately, these traditional methods are often inadequate for the task of isolating specific program errors. Debugger users may spend considerable time debugging code of program development with sequential methods according as program size is large and is complicated. It is important to easily locate errors included in java program in the software development. In this paper, we apply algorithmic debugging method that debugger user can easily debug programs to java program. This method executes a program and makes an execution tree from calling relation of functions. And it locates errors at the execution tree. So, Algorithmic debugging method can reduce the number of debugging than conventional sequential method.

  • PDF

Array Localization for Multithreaded Code Generation (다중스레드 코드 생성을 위한 배열 지역화)

  • Yang, Chang-Mo;Yu, Won-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1407-1417
    • /
    • 1996
  • In recent researches on thread partitioning algorithms break a thread at the long latency operation and merge threads to get the longer threads under the given constraints. Due to this limitation, even a program with little parallelism is partitioned into small-sized threads and context-swithings occur frequently. In the paper, we propose another method array localization about the array name, dependence distance(the difference of accessed element index from loop index), and the element usage that indicates whether element is used or defined. Using this information we can allocate array elements to the node where the corresponding loop activation is executed. By array localization, remote accesses to array elements can be replaced with local accesses to localized array elements. As a resuit,the boundaries of some threads are removed, programs can be partitioned into the larger threads and the number of context switchings reduced.

  • PDF

Cross-cultural Comparison of Landscape Preference for the National Park: An Approach from a Typicality of Landscape (국립공원 선호의 문화권간 비교: 경관의 전형성으로부터의 접근)

  • Lee, Duk-Jae
    • Korean Journal of Environment and Ecology
    • /
    • v.20 no.4
    • /
    • pp.482-492
    • /
    • 2006
  • This study has a purpose of examining the relationship between visual preference and typicality of natural landscapes in view of cross-cultural comparison. Both the photographs of the Cairngorms National Park of Scotland and those of the Jirisan National Park of Korea were used for selecting typical landscape of each National Park. To measure landscape preferences, a photo-questionnaire was implemented to the visitors of each National Park. Results showed that there was a significant relationship between age and number of visits and that Cairngorms visitors had visited the Park more frequently. The high typicality of Cairngorms landscape was negatively related to visual preferences. On the other hand, in case of Jirisan visitors, the high typicality of Jirlsan landscape was positively related to visual preferences. Although there was a significant relationship between typicality and visual preference, the way in which they were related differed between the separate cultural regions.

Investigation of Impacts of Truck Lane Restrictions on Multilane Highways Using Micro Traffic Simulation (미시적 시뮬레이션을 이용한 화물차 차로이용제한 영향분석)

  • Yang, Choong-Heon;Son, Young-Tae;Kwon, Yong-Suk
    • International Journal of Highway Engineering
    • /
    • v.9 no.4
    • /
    • pp.75-82
    • /
    • 2007
  • This study was performed to investigate impacts of truck lane restrictions on multilane highways on traffic flow variables such as average speed, the frequency of lane changes, and change in traffic volume and also to verify whether or not different lane restriction scenarios were proper. Two types of hypothetical highway networks and OD demands were developed for traffic simulation models in order to conduct the experimental study. Three types of scenarios were also developed according to the number of restricted lanes for trucks. The PARAMICS microscopic traffic simulation software package was used as the primary analytical tool. Statistical analysis was conducted with simulation outputs. Results showed that truck lane restrictions may lead to positive impacts on traffic flow on multilane highways. In addition, this study demonstrated that the number of restricted lanes can be very an important factor to lead successful implementation of truck lane restrictions.

  • PDF

An Improvement in Loading Speed Using RAM-based Java Card Installer (RAM기반 자바카드 인스톨러를 이용한 로딩속도 개선)

  • Jin, Min-Sik;Choi, Won-Ho;Lee, Dong-Wook;Kim, Han-Na;Jung, Min-Soo;Park, Kyoo-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.5
    • /
    • pp.604-611
    • /
    • 2007
  • Java Card has gained genera1 acceptance with standard for smart card and (U)SIM technology, and it is in distinction from native card by its post-issuance of an application and independence from hardware platforms. However, a main weak point of Java Card is its low execution speed caused by the hardware limitation and Java programming language itself. In this paper, we propose a new Java Card Installer to improve the download speed during the post-issuance of an application by resolving symbolic references to physical references in HAM. Our Resolution_In_RAM is based on the improved new RAM writing is 100,000 times faster than EEPROM writing and PageBuffer that is operated as block mode, rather than cell mode is used to write to EEPROM. Consequently, the total number of EEPROM writing are reduced 37%, and the times of downloading are reduced over 30% by using the Resolution_In_RAM-based Java Card Installer.

  • PDF

A DOM-Based Fuzzing Method for Analyzing Seogwang Document Processing System in North Korea (북한 서광문서처리체계 분석을 위한 Document Object Model(DOM) 기반 퍼징 기법)

  • Park, Chanju;Kang, Dongsu
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.5
    • /
    • pp.119-126
    • /
    • 2019
  • Typical software developed and used by North Korea is Red Star and internal application software. However, most of the existing research on the North Korean software is the software installation method and general execution screen analysis. One of the ways to identify software vulnerabilities is file fuzzing, which is a typical method for identifying security vulnerabilities. In this paper, we use file fuzzing to analyze the security vulnerability of the software used in North Korea's Seogwang Document Processing System. At this time, we propose the analysis of open document text (ODT) file produced by Seogwang Document Processing System, extraction of node based on Document Object Mode (DOM) to determine test target, and generation of mutation file through insertion and substitution, this increases the number of crash detections at the same testing time.

Analysis of simulation results using statistical models (통계모형을 이용하여 모의실험 결과 분석하기)

  • Kim, Ji-Hyun;Kim, Bongseong
    • The Korean Journal of Applied Statistics
    • /
    • v.34 no.5
    • /
    • pp.761-772
    • /
    • 2021
  • Simulation results for the comparison of estimators of interest are usually reported in tables or plots. However, if the simulations are conducted under various conditions for many estimators, the comparison can be difficult to be made with tables or plots. Furthermore, for algorithms that take a long time to run, the number of iterations of the simulation is costly to to be increased. The analysis of simulation results using regression models allows us to compare the estimators more systematically and effectively. Since variances in performance measures may vary depending on the simulation conditions and estimators, the heteroscedasticity of the error term should be allowed in the regression model. And multiple comparisons should be made because multiple estimators should be compared simultaneously. We introduce background theories of heteroscedasticity and multiple comparisons in the context of analyzing simulation results. We also present a concrete example.