• Title/Summary/Keyword: Hybrid programs

검색결과 125건 처리시간 0.027초

From Complexity to Hybridity: Transformative Combinations of Different Programs in Stadium Architecture

  • Shin, Yoon Jeong;Baek, Jin
    • Architectural research
    • /
    • 제21권3호
    • /
    • pp.59-67
    • /
    • 2019
  • Although many stadiums around the world have incorporated various profitable facilities, many are making conventional and cursory decisions without deep consideration of the interrelationships of different programs. This paper investigates cases in which new programs such as a hotel, a youth hostel, and a dormitory have been introduced into stadiums, showing different results. In the first part of this paper, the theoretical precedents of program combination are studied. Although Bernard Tschumi's notion of the combination of different programs presented its prophetic probability, this paper discern different approaches addressing program mixture, engendering eventually a productive modification of his notion based on the empirical observation of the cases. This paper classifies the manner of programmatic combination into complexity and hybridity, arguing that the latter transforms the spaces and gives rise to unexpected synergy, while the former merely assembles different programs. The second part compares the spaces of complexity and hybridity in stadiums. Through the plan and the section analysis of the spatial structure and the interrelationship of programs, this section reveals how the two different ways of the program combinations have had different results. In hybrid stadiums, programs are not simply gathered, but directly connected and intertwined. In the third part, the nature of the spatial transformation in the hybrid space is researched in detail. In the hybrid stadiums, the collision of the different programs changes the conception of the programs themselves and their related spaces. Hotels and stadiums are not what they once were, provoking unanticipated situations. These transformed spaces not only suggest a method of reutilizing of disused urban spaces, but also of meaningful and communicative program mixture, diversifying and vitalizing a city, not isolated islands of discrepancy. The ultimate purpose of this paper is clarifying the programmatic hybrid paradigm, surpassing complexity through the analysis of the stadium cases and illuminating the manner by which the hybridity breaks the typical tie between the program and space, to cause transformed situations.

과학 CAI 프로그램의 유형 분석 (A study on analysis of CAI program type for the science CAI programs developed by KEDI and teachers in KOREA)

  • 김영민;김희정;이미경
    • 한국과학교육학회지
    • /
    • 제14권1호
    • /
    • pp.24-33
    • /
    • 1994
  • This study is aimed at categorizing the CAl programs through analyzing the 82 science CAl programs developed by KEDI( Korean Educational Development Institutes ) and the 19 science CAl programs developed by the teachers who won the prizes in the first national educational software contest. The findings are as follows. 1) The main types of science CAl programs developed by KEDI are hybrid design type of tutorials and simulations, tutorials, and hybrid design type of instructional games and drill and practice. The other type of programs are very few. 2) The main types of science CAl programs developed by the teachers, who won the prizes in 1st educational software contest, are tutorials and hybrid design type of tutorials and simulations. There is no other type of programs except only two simulation type programs. 3) The science CAl programs developed by KEDI as well as by teachers who won the prizes in the contest are biased in two or three types, and the trend is severe in the programs developed by the teachers.

  • PDF

Enhancing GPU Performance by Efficient Hardware-Based and Hybrid L1 Data Cache Bypassing

  • Huangfu, Yijie;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • 제11권2호
    • /
    • pp.69-77
    • /
    • 2017
  • Recent GPUs have adopted cache memory to benefit general-purpose GPU (GPGPU) programs. However, unlike CPU programs, GPGPU programs typically have considerably less temporal/spatial locality. Moreover, the L1 data cache is used by many threads that access a data size typically considerably larger than the L1 cache, making it critical to bypass L1 data cache intelligently to enhance GPU cache performance. In this paper, we examine GPU cache access behavior and propose a simple hardware-based GPU cache bypassing method that can be applied to GPU applications without recompiling programs. Moreover, we introduce a hybrid method that integrates static profiling information and hardware-based bypassing to further enhance performance. Our experimental results reveal that hardware-based cache bypassing can boost performance for most benchmarks, and the hybrid method can achieve performance comparable to state-of-the-art compiler-based bypassing with considerably less profiling cost.

Breeding Hybrid Rice with Genes Resistant to Diseases and Insects Using Marker-Assisted Selection and Evaluation of Biological Assay

  • Kim, Me-Sun;Ouk, Sothea;Jung, Kuk-Hyun;Song, Yoohan;Le, Van Trang;Yang, Ju-Young;Cho, Yong-Gu
    • Plant Breeding and Biotechnology
    • /
    • 제7권3호
    • /
    • pp.272-286
    • /
    • 2019
  • Developing elite hybrid rice varieties is one important objective of rice breeding programs. Several genes related to male sterilities, restores, and pollinators have been identified through map-based gene cloning within natural variations of rice. These identified genes are good targets for introducing genetic traits in molecular breeding. This study was conducted to breed elite hybrid lines with major genes related to hybrid traits and disease/insect resistance in 240 genetic resources and F1 hybrid combinations of rice. Molecular markers were reset for three major hybrid genes (S5, Rf3, Rf4) and thirteen disease/insect resistant genes (rice bacterial blight resistance genes Xa3, Xa4, xa5, Xa7, xa13, Xa21; blast resistance genes Pita, Pib, Pi5, Pii; brown planthopper resistant genes Bph18(t) and tungro virus resistance gene tsv1). Genotypes were then analyzed using molecular marker-assisted selection (MAS). Biological assay was then performed at the Red River Delta region in Vietnam using eleven F1 hybrid combinations and two control vatieties. Results showed that nine F1 hybrid combinations were highly resistant to rice bacterial blight and blast. Finally, eight F1 hybrid rice varieties with resistance to disease/insect were selected from eleven F1 hybrid combinations. Their characteristics such as agricultural traits and yields were then investigated. These F1 hybrid rice varieties developed with major genes related to hybrid traits and disease/insect resistant genes could be useful for hybrid breeding programs to achieve high yield with biotic and abiotic resistance.

자바 원시 코드에서 논리적인 오류를 찾는 복합 디버깅 기술의 설계 (Design of Hybrid Debugging Technique for Locating Logical Errors in Java Source Codes)

  • 고훈준
    • 한국콘텐츠학회논문지
    • /
    • 제6권10호
    • /
    • pp.114-125
    • /
    • 2006
  • 이전 논문은 자바 프로그램에서 논리적인 오류를 찾기 위한 기술로 HDT를 제안했었다. HDT는 알고리즈믹 프로그램 디버깅 기술을 이용하여 실행트리에서 오류를 포함하고 있는 메소드를 찾고, 단계적 프로그램 디버깅 기술을 이용하여 오류를 포함하고 있는 메소드에서 오류가 있는 문장을 찾아낸다. 이 기술은 전통적인 디버깅 기술보다 자바 프로그램에서 프로그래머가 디버깅하는 횟수를 줄였다. 그러나 최근에는 프로그램 크기가 증가하고 메소드의 수가 증가하고 있기 때문에 아직까지 HDT는 디버깅하는 횟수가 많다. 이 논문은 HDT에 프로그램 분할 기술을 적용하는 HDTS를 제안한다. 이 방법은 자바 프로그램을 디버깅할 때, HDT보다 프로그래머가 디버깅하는 횟수를 줄여 줄 수 있다. 특히, HDTS는 메소드와 문장의 수가 증가할수록 효율성이 증가한다.

  • PDF

EPfuzzer: Improving Hybrid Fuzzing with Hardest-to-reach Branch Prioritization

  • Wang, Yunchao;Wu, Zehui;Wei, Qiang;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권9호
    • /
    • pp.3885-3906
    • /
    • 2020
  • Hybrid fuzzing which combines fuzzing and concolic execution, has proved its ability to achieve higher code coverage and therefore find more bugs. However, current hybrid fuzzers usually suffer from inefficiency and poor scalability when applied to complex, real-world program testing. We observed that the performance bottleneck is the inefficient cooperation between the fuzzer and concolic executor and the slow symbolic emulation. In this paper, we propose a novel solution named EPfuzzer to improve hybrid fuzzing. EPfuzzer implements two key ideas: 1) only the hardest-to-reach branch will be prioritized for concolic execution to avoid generating uninteresting inputs; and 2) only input bytes relevant to the target branch to be flipped will be symbolized to reduce the overhead of the symbolic emulation. With these optimizations, EPfuzzer can be efficiently targeted to the hardest-to-reach branch. We evaluated EPfuzzer with three sets of programs: five real-world applications and two popular benchmarks (LAVA-M and the Google Fuzzer Test Suite). The evaluation results showed that EPfuzzer was much more efficient and scalable than the state-of-the-art concolic execution engine (QSYM). EPfuzzer was able to find more bugs and achieve better code coverage. In addition, we discovered seven previously unknown security bugs in five real-world programs and reported them to the vendors.

A Hybrid Approach for Regression Testing in Interprocedural Program

  • Singh, Yogesh;Kaur, Arvinder;Suri, Bharti
    • Journal of Information Processing Systems
    • /
    • 제6권1호
    • /
    • pp.21-32
    • /
    • 2010
  • Software maintenance is one of the major activities of the software development life cycle. Due to the time and cost constraint it is not possible to perform exhaustive regression testing. Thus, there is a need for a technique that selects and prioritizes the effective and important test cases so that the testing effort is reduced. In an analogous study we have proposed a new variable based algorithm that works on variables using the hybrid technique. However, in the real world the programs consist of multiple modules. Hence, in this work we propose a regression testing algorithm that works on interprocedural programs. In order to validate and analyze this technique we have used various programs. The result shows that the performance and accuracy of this technique is very high.

A hybrid cardiac rehabilitation is as effective as a hospital-based program in reducing chest pain intensity and discomfort

  • Saeidi, Mozhgan;Soroush, Ali;Komasi, Saeid;Singh, Puneetpal
    • The Korean Journal of Pain
    • /
    • 제30권4호
    • /
    • pp.265-271
    • /
    • 2017
  • Background: Health care services effort to provide alternative cardiac rehabilitation (CR) models to serve patients according to their preferences and needs. So, the present study aimed to assess and compare the effects of hospital-based and hybrid CR programs on chest pain intensity and discomfort in cardiac surgery patients. Methods: In this prospective study, 110 cardiac surgery patients were invited to the CR department of a hospital in the western part of Iran between March and July 2016. Patients were divided into two groups: hospital-based and hybrid CR. The hospital-based program included 26 sessions, and the hybrid program included 10 training sessions and exercise. The Brief Pain Inventory and Pain Discomfort Scale were used as research instrument, and data were analyzed using the paired t-test and ANCOVA. Results: The results indicated that both hospital-based and hybrid CR are effective in reducing the chest pain intensity and discomfort of cardiac surgery patients (P < 0.05). In addition, the comparison of scores before and after treatment using ANCOVA shows that no significant differences were observed between the two programs (P > 0.05). Conclusions: Traditional hospital-based CR delivery is still the first choice for treatment in developing countries. However, hybrid CR is as effective as a hospital-based program in reducing pain components and it includes only 38% of the total cost in comparison to hospital-based delivery. So, we recommend using hybrid CR according with the recommendations of American Heart Association about using CR for the management of angina symptoms.

A Formulation of Hybrid Algorithm for Linear Programming

  • Kim, Koon-Chan
    • 한국경영과학회지
    • /
    • 제19권3호
    • /
    • pp.187-201
    • /
    • 1994
  • This paper introduces an effective hybridization of the usual simplex method and an interior point method in the convergent framework of Dembo and Sahi. We formulate a specific and detailed algorithm (HYBRID) and report the results of some preliminary testing on small dense problems for its viability. By piercing through the feasible region, the newly developed hybrid algorithm avoids the combinatorial structure of linear programs, and several other interesting and important characteristics of this algorithm are also discussed.

  • PDF