• 제목/요약/키워드: modifying

검색결과 2,524건 처리시간 0.027초

Introduction of Modifying Solvents to Carbon Dioxide in Supercritical Extractions

  • 이정미정;David J. Chesney
    • Bulletin of the Korean Chemical Society
    • /
    • 제19권12호
    • /
    • pp.1351-1355
    • /
    • 1998
  • A simple apparatus for adding a modifying solvent to supercritical CO2 extractant was described. Small, fixed volumes (typically 100 μL) of liquid modifying solvents were delivered during the extraction process by use of an in-line high pressure loop injector and an air pump. Without disconnecting the extraction cell from the supercritical fluid extraction system, the modifying solvent was repeatedly delivered. The solvent modification device was optimized during the extraction of carbaryl and bis(acetylacetonato) copper(Ⅱ). Extraction recoveries from spiked filter paper and soil samples ranged between 22% and 109%, depending on the analyte and matrix components. The addition of polar modifying solvents were necessary to improve the extractability of the nonpolar CO2.

Rate-Modifying 활동이 있는 병렬기계의 Makespan 최소화를 위한 일정 계획 (Parallel Machines Scheduling with Rate-Modifying Activities to Minimize Makespan)

  • 조항민;임승빈;정인재
    • 산업경영시스템학회지
    • /
    • 제30권2호
    • /
    • pp.44-50
    • /
    • 2007
  • This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

증점제를 사용한 고유동콘크리트의 기초 물성 (Fundamental Properties of Self-Compacting Concrete Using Viscosity Modifying Admixture)

  • 김진철;안태송;문한영
    • 콘크리트학회논문집
    • /
    • 제11권6호
    • /
    • pp.69-78
    • /
    • 1999
  • Hydroxyethyl cellulose -based-viscosity modifying admixture and melamine-basd-superplasticizer were selected to be admixtures for self-compacting concrete based on the test results of fluidity and air content of mortar using 3 different viscosity modifying admixtures. The experimental results show that the initial and final set of self-compacting concrete and fly ash concrete with viscosity modifying admixture only have been delayed approximately 5 hours and 8~9 hours, respectively. It is found that the optimum dosage of viscosity modifying admixtures, coarse aggregate and cement content are 0.2% of water content, under 742 kg/$\textrm{m}^3$ and over 364 kg/$\textrm{m}^3$, respectively. Test results also show that the optimum fly ash in replacement of cement is 10% of cement weight for the enhancement of fluidity and long-term strength.

콘크리트 혼화제로 활용하기 위한 신규 증점제의 성능 평가 (Evaluation on Performance of New Viscosity Modifying Admixture for Concrete Agent)

  • 임서형;강군중;김재훈
    • 한국구조물진단유지관리공학회 논문집
    • /
    • 제4권3호
    • /
    • pp.177-184
    • /
    • 2000
  • The purpose of this study is to evaluate the performance of a new viscosity modifying admixture for concrete agent. For this purpose, selected test variables were the ratio of water to cement, the ratio of cement to fine aggregate, contents of superplasticizer, contents of viscosity modifying admixture. As a result of this study, it has been found that addition of viscosity modifying admixture to mortar modfies its fluidity and reduces its segregation by increasing the mortar viscosity. And it has been found that a new viscosity modifying admixture do not significantly affect the setting time, air content of mortar.

  • PDF

4학년 아동들의 수학적 문제 설정 활동의 효과 (The Effects of Mathematical Problem Posing Activities by the Fourth Graders)

  • 조제호;신인선
    • 한국수학교육학회지시리즈C:초등수학교육
    • /
    • 제2권2호
    • /
    • pp.133-144
    • /
    • 1998
  • We examined two kinds of problem posing, 'problem making' and 'problem modifying' to find which one is more effective for improving mathematical problem solving ability according to the student's learning-levels and sexes. The results showed that 'problem making' is more effective for high and middle-level groups than 'problem modifying'. There was no big difference according to the sexes. These facts implies that making a problem when a situation was presented is more effective to develop problem solving ability than modifying a problem : modifying some conditions and contents of given problem.

  • PDF

Production of the taste-modifying protein, miraculin, in transgenic lettuce

  • Ezura, Hiroshi;Sun, Heyon-Jin
    • 한국식물생명공학회:학술대회논문집
    • /
    • 한국식물생명공학회 2005년도 추계학술대회 및 한일 식물생명공학 심포지엄
    • /
    • pp.126-131
    • /
    • 2005
  • Richadella dulcifica, a native shrub in tropical West Africa, gives red berries that have the unusual property of modifying a sour taste into a sweet taste. The red berries contain a taste-modifying protein named miraculin. A synthetic gene encoding miraculin was placed under the control of constitutive promoters and transferred to lettuce. High expression of miraculin was obtained, with accumulation of up to 1% total soluble protein in lettuce leaf. In addition, the miraculin expressed in lettuce possesses a taste-modifying activity.

  • PDF

자체 수정 코드를 탐지하는 정적 분석방법의 LLVM 프레임워크 기반 구현 및 실험 (An LLVM-Based Implementation of Static Analysis for Detecting Self-Modifying Code and Its Evaluation)

  • 유재일;최광훈
    • 정보보호학회논문지
    • /
    • 제32권2호
    • /
    • pp.171-179
    • /
    • 2022
  • 자체 수정 코드(Self-Modifying-Code)란 실행 시간 동안 스스로 실행 코드를 변경하는 코드를 말한다. 이런 기법은 특히 악성코드가 정적 분석을 우회하는 데 악용된다. 따라서 이러한 악성코드를 효과적으로 검출하려면 자체 수정 코드를 파악하는 것이 중요하다. 그동안 동적 분석 방법으로 자체 수정 코드를 분석해왔으나 이는 시간과 비용이 많이 든다. 만약 정적 분석으로 자체 수정 코드를 검출할 수 있다면 악성코드 분석에 큰 도움이 될 것이다. 본 논문에서는 LLVM IR로 변환한 바이너리 실행 프로그램을 대상으로 자체 수정 코드를 탐지하는 정적 분석 방법을 제안하고, 자체 수정 코드 벤치마크를 만들어 이 방법을 적용했다. 본 논문의 실험 결과 벤치마크 프로그램을 컴파일로 변환한 최적화된 형태의 LLVM IR 프로그램에 대해서는 설계한 정적 분석 방법이 효과적이었다. 하지만 바이너리를 리프팅 변환한 비정형화된 LLVM IR 프로그램에 대해서는 자체 수정 코드를 검출하기 어려운 한계가 있었다. 이를 극복하기 위해 바이너리를 리프팅 하는 효과적인 방법이 필요하다.

Application of sweet and taste modifying genes for development in plants: current status and prospects

  • Akter, Shahina;Huq, Md. Amdadul;Jung, Yu-Jin;Cho, Yong-Gu;Kang, Kwon-Kyoo
    • Journal of Plant Biotechnology
    • /
    • 제43권4호
    • /
    • pp.397-404
    • /
    • 2016
  • Sweet and taste modifying proteins are natural alternatives to synthetic sweeteners and flavor enhancers, and have been used for centuries in different countries. Use of these proteins is limited due to less stability and availability. However, recent advances in biotechnology have enhanced their availability. These include production of sweet and taste modifying proteins in transgenic organisms, and protein engineering to improve their stability. Their increased availability in the food, beverage or medicinal industries as sweeteners and flavor enhancers will reduce the dependence on artificial alternatives. Production of transgenic plants using sweet and taste modifying genes, is an interesting alternative to the extraction of these products from natural source. In this review paper, we briefly describe various sweet and taste modifying proteins (such as thaumatin, monellin, brazzein, curculin and miraculin), their properties, and their application for plant development using biotechnological approaches.

A Method of Data Hiding in a File System by Modifying Directory Information

  • Cho, Gyu-Sang
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권8호
    • /
    • pp.85-93
    • /
    • 2018
  • In this research, it is proposed that a method to hide data by modifying directory index entry information. It consists of two methods: a directory list hiding and a file contents hiding. The directory list hiding method is to avoid the list of files from appearing in the file explorer window or the command prompt window. By modifying the file names of several index entries to make them duplicated, if the duplicated files are deleted, then the only the original file is deleted, but the modified files are retained in the MFT entry intact. So, the fact that these files are hidden is not exposed. The file contents hiding is to allocate data to be hidden on an empty index record page that is not used. If many files are made in the directory, several 4KB index records are allocated. NTFS leaves the empty index records unchanged after deleting the files. By modifying the run-list of the index record with the cluster number of the file-to-hide, the contents of the file-to-hide are hidden in the index record. By applying the proposed method to the case of hiding two files, the file lists are not exposed in the file explorer and the command prompt window, and the contents of the file-to-hide are hidden in the empty index record. It is proved that the proposed method has effectiveness and validity.

복구조정 활동과 복구조정 후 시간경과에 따라 퇴화하는 작업시간을 갖는 단일기계의 일정계획에 관한 연구 (A Study on Single Machine Scheduling with a Rate-Modifying Activity and Time-Dependent Deterioration After the Activity)

  • 김병수;주철민
    • 경영과학
    • /
    • 제30권1호
    • /
    • pp.15-24
    • /
    • 2013
  • We consider the single machine scheduling problem with a rate-modifying activity and time-dependent deterioration after the activity. The class of scheduling problems with rate-modifying activities and the class of scheduling problems with time-dependent processing times have been studied independently. However, the integration of these classes is motivated by human operators of tasks who has fatigue while carrying out the operation of a series of tasks. This situation is also applicable to machines that experience performance degradation over time due to mal-position or mal-alignment of jobs, abrasion of tools, and scraps of operations, etc. In this study, the integration of the two classes of scheduling problems is considered. We present a mathematical model to determine job-sequence and a position of a rate-modifying activity for the integration problem. Since the model is difficult to solve as the size of real problem being very large, we propose genetic algorithms. The performance of the algorithms are compared with optimal solutions with various problems.