• Title/Summary/Keyword: Research Information Systems

Search Result 12,210, Processing Time 0.045 seconds

Extending Model Checker for Real-time Verification of Statecharts (스테이트차트의 실시간 검증을 위한 모델체커의 확장)

  • 방호정;홍형석;김태효;차성덕
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.6
    • /
    • pp.773-783
    • /
    • 2004
  • This paper presents a method for real-time verification of Statecharts. Statecharts has been widely used for real-time reactive systems, and supports two time models: synchronous and asynchronous. However, existing real-time verification methods for them are incompatible with the asynchronous time model or increase state space by introducing new variables to the target models. We solved these problems by extending existing model checking algorithms. The extended algorithms can be used with both time models of Statecharts because they consider time increasing transitions only. In addition, they do not increase target state space since they count those transitions internally without additional variables. We extended an existing model checker, NuSMV, based on the proposed algorithms and conducted some experiments to show their advantage.

Fractal Compression using Range Block Coherence (레인지 블록 유사성을 이용한 프랙탈 압축)

  • Kim, Young-Bong;Lee, Yun-Jung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.117-122
    • /
    • 2000
  • The fractal image compression is based on the self-similarity that some area in an image is very similar to others. This compression method offers high compression ratio and fast decompression, but it has very long encoding time. To cut-off the encoding time, most researches give a restriction on domain blocks to be compared with a range block or make an effective search sequence of the domain blocks for a range block. However, most of them take much encoding time yet. In this research, we propose an algorithm that greatly reduces the encoding time by considering the coherence between range blocks. This algorithm first classifies all range blocks into some groups using the coherence between range blocks, and then searches corresponding domain blocks only for the key block of each group. If this scheme is joined in a prior work of the other fractal compression algorithm, it will give a great effectiveness to encoding time.

  • PDF

A Study on Optimal Design for Linear Electromagnetic Generator of Electricity Sensor System using Vibration Energy Harvesting (진동에너지 하베스팅을 이용한 전력감지시스템용 리니어 전자기 발전기에 관한 최적설계)

  • Cho, Seong Jin;Kim, Jin Ho
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.16 no.2
    • /
    • pp.7-15
    • /
    • 2017
  • Recently, an electricity sensor system has been installed and operated to prevent failures and accidents by identifying whether a transformer is normal in advance of failure. This electricity sensor system is able to both measure and monitor the transformer's power and voltage remotely and send information to a manager when unusual operation is discovered. However, a battery is required to operate power detection devices, and battery systems need ongoing management such as regular replacement. In addition, at a maintenance cost, occasional human resources and worker safety problems arise. Accordingly, we apply a linear electromagnetic generator using vibration energy from a transformer for an electric sensor system's drive in this research and we conduct optimal design to maximize the linear electromagnetic generator's power. We consider design variables using the provided design method from Process Integration, Automation, and Optimization (PIAnO), which is common tool from process integration and design optimization (PIDO). In addition, we analyze the experiment point from the design of the experiments using "MAXWELL," which is a common electromagnet analysis program. We then create an approximate model and conduct accuracy verification. Finally, we determine the optimal model that generates the maximum power using the proven approximate kriging model and evolutionary optimization algorithm, which we then confirm via simulation.

Measuring Interfacial Tension between Brine and Carbon Dioxide in Geological CO2 Sequestration Conditions using Pendant Bubble Methods (수적(垂滴)법을 이용한 이산화탄소 지중저장 조건에서의 염수-이산화탄소 간 계면장력 측정)

  • Park, Gyuryeong;An, Hyejin;Kim, Seon-ok;Wang, Sookyun
    • Journal of Soil and Groundwater Environment
    • /
    • v.21 no.6
    • /
    • pp.46-55
    • /
    • 2016
  • This experimental study was aimed to estimate interfacial tension of brine-$CO_2$ by using a pendant bubble method and image analysis. Measurements were performed for wide ranges of temperatures, pressures, and salinities covering reservoir conditions in Pohang basin, a possible candidate for $CO_2$ storage operation in Korea. The profiles of $CO_2$ bubbles in brine obtained from image analysis with the densities of brine and $CO_2$ from previous studies were applied to Laplace-Young equation for calculating interfacial twnsion in brine-$CO_2$ system. The experimental results reveals that the interfacial tension is significantly affected by reservoir conditions such as pressure, temperature and water salinity. For conditions of constant temperature and water salinity, the interfacial tension decreases as pressure increases for low pressures (P < $P_c$), and approaches to a constant value for high pressures. For conditions of constant pressure and water salinity, the interfacial tension increases as temperature increases for T < $T_c$, with an asymptotic trend towards a constant value for high temperatures. For conditions of constant pressure and temperature, the interfacial tension increases with increasing water salinity. The trends in changes of interfacial tension can be explained by the effects of the reservoir conditions on the density difference of brine and $CO_2$, and the solubility of $CO_2$ in brine. The information on interfacial tensions obtained from this research can be applied in predicting the migration and distribution of injecting and residual fluids in brine-$CO_2$-rock systems in deep geological environments during geological $CO_2$ sequestrations.

Bactericidal Efficacy of a Powder Disinfectant Containing Phosphate Compounds Against Salmonella Typhimurium

  • Park, Eun-Kee;Cha, Chun-Nam;Yoo, Chang-Yeul;Kim, Suk;Lee, Hu-Jang
    • Journal of Food Hygiene and Safety
    • /
    • v.31 no.6
    • /
    • pp.471-475
    • /
    • 2016
  • Salmonella Typhimurium (S. Typhimurium) is one of the common food pathogens which may cause gastroenteritidis in human and animals. The microorganism also causes the economic loss in animal farming and food industry. In this study, the disinfection efficacy of a powder disinfectant containing phosphate compounds as a main ingredient, was evaluated against S. Typhimurium. A bactericidal efficacy test by broth dilution method was used to determine the lowest effective dilution of the disinfectant following exposure to test bacteria for 30 min at $4^{\circ}C$. The disinfectant and test bacteria were diluted with hard water (HW) or organic matter suspension (OM) according to treatment condition. On HW and OM conditions, the bactericidal activity of the disinfectant against S. Typhimurium was 4- and 2-fold dilutions, respectively. As the disinfectant composed to phosphate compounds possesses bactericidal efficacy against pathogenic bacteria such as S. Typhimurium, the powder disinfectant can be used to control the spread of bacterial diseases.

A Low Power FPGA Architecture using Three-dimensional Structure (3차원 구조를 이용한 저전력 FPGA 구조)

  • Kim, Pan-Ki;Lee, Hyoung-Pyo;Kim, Hyun-Pil;Jun, Ho-Yoon;Lee, Yong-Surk
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.12
    • /
    • pp.656-664
    • /
    • 2007
  • Field-Programmable Gate Arrays (FPGAs) are a revolutionary new type of user-programmable integrated circuits that provide fast, inexpensive access to customized VLSI. However, as the target application speed increases, power-consumption and wire-delay on interconnection become more critical factors during programming an FPGA. Especially, the interconnection of the FPGA consumes 65% of the total FPGA power consumption. A previous research show that if the length of interconnection is shirked, power-consumption can be reduced because an interconnection has a lot of effect on power-consumption. For solving this problem that reducing the number of wires routed, the three dimension FPGA is proposed. However, this structure physical wires and an area of switches is increased by making topology complex. This paper propose a novel FPGA architecture that modifies the three dimension FPGA and compare the number of interconnection of Virtex II and 3D FPGA with the proposed FPGA architecture using the FPGA Editor of Xilinx ISE and a global routing and length estimation program.

University Linkages in Technology Clusters of Emerging Economies - Exploratory Case Studies from Cyberjaya, Malaysia - a Greenfield Development and Cyberabad, India - a Brownfield Development

  • Mohan, Avvari V.;Ejnavarzala, Haribabu;Lakshmi, C.N.
    • World Technopolis Review
    • /
    • v.1 no.1
    • /
    • pp.42-55
    • /
    • 2012
  • This paper is concerned with the linkages between universities and industry in the information and communications technology (ICT) in Cyberjaya, Malaysia and Cyberabad, India. In the case of the ICT cluster of Cyberjaya, the context can be termed as greenfield cluster development as the whole project is developed from scratch. In the case of Cyberabad, India, the context can be seen as a brownfield development, where the cluster developed based on existing and new organisations in a region. There is extant literature in research, be it from an Innovation systems or a Triple Helix perspective that has given significant attention to the importance of universities as engines of growth and also about the significance of their linkages with industry innovation in regions. But as argued by scholars like Chaminade et al, most of these papers tend to ignore the specific context in which this interaction between the university and the industry takes place - this study aims to fill this gap through an exploratory study from emerging economies and in a greenfield and brownfield contexts. The findings from the two cases point towards (1) the role of intermediary organisations in developing the linkages, (2) the issue of capabilities of universities for supporting industry development and (3) university-industry linkages are different in greenfield and brown field developments. The paper presents the cases and discusses the findings and provides insights to cluster development officials and policy makers and implications to researchers for developing studies of university-industry from a capabilities and context perspectives.

A Study on Vacant House Distribution and Management of Urban Declining Area (도시쇠퇴지역의 빈집 분포현황과 관리체계에 관한 연구)

  • Kim, Jinha;Nam, Jin
    • Journal of the Korean Regional Science Association
    • /
    • v.32 no.1
    • /
    • pp.105-122
    • /
    • 2016
  • Recently people are starting to pay attention to the vacant house. Vacant house across the country are expected to be a Million. Ministry of Land, Transport and Maritime Affairs has created a new legal provisions regarding maintenance to Vacant on the Construction Law. But Vacant house information systems in government are not available Other countries to clarify the role each entity to manage these Vacant and manages the Vacant. The national government has made the operating budget support program for the Vacant management. The local government has made legislation of self-government to create a DB for the Vacant management. A non-profit corporation is developing a program operated by the Vacant, and the Vacant intermediaries to consumers. Therefore, our country is also to expand the national budget for the Vacant administration, local governments should establish a comprehensive management system for managing and providing Vacant house research and DB.

Counter-Based Approaches for Efficient WCET Analysis of Multicore Processors with Shared Caches

  • Ding, Yiqiang;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • v.7 no.4
    • /
    • pp.285-299
    • /
    • 2013
  • To enable hard real-time systems to take advantage of multicore processors, it is crucial to obtain the worst-case execution time (WCET) for programs running on multicore processors. However, this is challenging and complicated due to the inter-thread interferences from the shared resources in a multicore processor. Recent research used the combined cache conflict graph (CCCG) to model and compute the worst-case inter-thread interferences on a shared L2 cache in a multicore processor, which is called the CCCG-based approach in this paper. Although it can compute the WCET safely and accurately, its computational complexity is exponential and prohibitive for a large number of cores. In this paper, we propose three counter-based approaches to significantly reduce the complexity of the multicore WCET analysis, while achieving absolute safety with tightness close to the CCCG-based approach. The basic counter-based approach simply counts the worst-case number of cache line blocks mapped to a cache set of a shared L2 cache from all the concurrent threads, and compares it with the associativity of the cache set to compute the worst-case cache behavior. The enhanced counter-based approach uses techniques to enhance the accuracy of calculating the counters. The hybrid counter-based approach combines the enhanced counter-based approach and the CCCG-based approach to further improve the tightness of analysis without significantly increasing the complexity. Our experiments on a 4-core processor indicate that the enhanced counter-based approach overestimates the WCET by 14% on average compared to the CCCG-based approach, while its averaged running time is less than 1/380 that of the CCCG-based approach. The hybrid approach reduces the overestimation to only 2.65%, while its running time is less than 1/150 that of the CCCG-based approach on average.

Communication Schedule for GEN_BLOCK Redistribution (GEN_BLOCK간 재분산을 위한 통신 스케줄)

  • Yook, Hyun-Gyoo;Park, Myong-Soon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.450-463
    • /
    • 2000
  • Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. GEN_BLOCK redistribution, which is redistribution between different GEN_BLOCKs, is essential for load balancing. However, prior research on redistribution has been focused on regular redistribution, such as redistribution between different CYCLIC(N)s. GEN_BLOCK redistribution is very different from regular redistribution. Message passing in regular redistribution involves repetitions of basic message passing patterns, while message passing for GEN_BLOCK redistribution shows locality. This paper proves that two optimal condition, reducing the number of communication steps and minimizing redistribution size, are essential in GEN_BLOCK redistribution. Additionally, by adding a relocation phase to list scheduling, we make an optimal scheduling algorithm for GEN_BLOCK redistribution. To evaluate the performance of the algorithm, we have performed experiments on a CRAY T3E. According to the experiments, it was proven that the scheduling algorithm shows better performance and that the conditions are critical in enhancing the communication speed of GEN_BLOCK redistribution.

  • PDF