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

검색결과 612건 처리시간 0.03초

대학수학능력시험의 '중국어 I'과 SAT의 'Chinese with Listening' 비교 - 체제와 문항을 중심으로 (Comparative studies of systems and questions between Chinese I in the Korea National Scholastic Aptitude Test and Chinese with Listening in the SAT)

  • 박찬욱
    • 비교문화연구
    • /
    • 제23권
    • /
    • pp.351-382
    • /
    • 2011
  • This paper aims to compare systems and questions between Chinese I in the Korea National Scholastic Aptitude Test(abbreviated by KNSAT) and Chinese with Listening in the SAT. In the beginning, we compared KNSAT and SAT, and then focused our attention on Chinese I in KNSAT and Chinese with Listening in SAT in terms of assessment purposes, sections, ranges, questions. Through the research, the following results were obtained: Firstly, compared KNSAT with SAT, it is found that Chinese I is less important in KNSAT than Chinese with Listening in SAT. Chinese I belongs to one of the second foreign languages section, and it is placed under common rule of its section. However, Chinese with Listening is similar to Chinese I in that it also belongs to one of the languages section, but it keeps under its control, so it has its own system e.g. purpose, range etc.. Next, compared Chinese I with Chinese with Listening, in the matter of purposes of them, Chinese I is less explicit and less concrete to explain it than Chinese with Listening, and in respect of sections of them, the sections of Chinese I are leaning more toward language materials contrary to Chinese with Listening leaning more toward language functions. And in terms of ranges of them, Chinese I is limited to Basic vocabulary and Examples of communicative function in curriculum of Chinese I, but Chinese with Listening has not any limit on the ranges of questions. Lastly, with regard to questions of them, Chinese I has more tendency toward assessing knowledge of Chinese, on the contrary, Chinese with Listening has more tendency toward assessing performance of it.

Intracutaneous Delivery of Gelatins Reduces Fat Accumulation in Subcutaneous Adipose Tissue

  • An, Sung-Min;Kim, Min Jae;Seong, Keum-Yong;Jeong, Jea Sic;Kang, Hyeon-Gu;Kim, So Young;Kim, Da Som;Kang, Da Hee;Yang, Seung Yun;An, Beum-Soo
    • Toxicological Research
    • /
    • 제35권4호
    • /
    • pp.395-402
    • /
    • 2019
  • Subcutaneous adipose tissue (SAT) accumulation is a constitutional disorder resulting from metabolic syndrome. Although surgical and non-surgical methods for reducing SAT exist, patients remain non-compliant because of potential adverse effects and cost. In this study, we developed a new minimally-invasive approach to achieve SAT reduction, using a microneedle (MN) patch prepared from gelatin, which is capable of regulating fat metabolism. Four gelatin types were used: three derived from fish (SA-FG, GT-FG 220, and GT-FG 250), and one from swine (SM-PG 280). We applied gelatin-based MN patches five times over 4 weeks to rats with high-fat diet (HD)-induced obesity, and determined the resulting amount of SAT. We also investigated the histological features and determined the expression levels of fat metabolism-associated genes in SAT using hematoxylin and eosin staining and western blotting, respectively. SAT decreased following treatment with all four gelatin MN patches. Smaller adipocytes were observed in the regions treated with SA-FG, GT-FG 250, and SM-PG 280 MNs, demonstrating a decline in fat accumulation. The expression levels of fat metabolism-associated genes in the MN-treated SAT revealed that GT-FG 220 regulates fatty acid synthase (FASN) protein levels. These findings suggest that gelatin MN patches aid in decreasing the quantity of unwanted SAT by altering lipid metabolism and fat deposition.

최소 빈도수 문자 우선 선택 방법의 3-SAT 다항시간 알고리즘 (A 3-SAT Polynomial Time Algorithm Based on Minimum Frequency Literal-First Selection Method)

  • 이상운
    • 한국인터넷방송통신학회논문지
    • /
    • 제23권1호
    • /
    • pp.157-162
    • /
    • 2023
  • 본 논문은 NP-완전으로 알려진 3-SAT 문제에 대해 O(nm)의 다항시간 알고리즘을 제안하였다. 여기서 n은 3-SAT 수식 f에 포함된 문자수이며, m은 모든 문자의 총 발생 빈도수이다. 제안된 알고리즘은 우선순위롤 정하여 문자의 진리 값을 결정하였다. 하나의 절에 포함된 최소 문자의 수가 1개(k=1)인 문자, k≥2 이고 진리 값이 '0' 또는 '1'만 존재하는 문자, 발생 빈도수가 최소인 문자 우선순위로 진리 값을 결정하였다. 진리 값이 결정된 문자의 r인 절을 삭제하고, 남아 있는 절에서 해당 문자를 삭제하는 방법으로 식을 축소시킨다. 이 과정을 문자 수 l회를 수행하면 주어진 f의 충족 가능 여부를 결정할 수 있다. 이 방법을 적용한 결과 주어진 식 f의 충족 가능 여부를 판단할 수 있었으며, 모든 문자의 진리 값도 결정할 수 있었다. 제안된 알고리즘을 다양한 문제들에 적용한 결과 모든 문제들에서 충족가능 여부를 정확히 결정할 수 있었다. 결국, 제안된 알고리즘은 모든 SAT 문제를 선형시간으로 풀 수 있는 일반화된 알고리즘으로 확장 가능하며, 오랜 숙원이던 P vs. NP 문제를 풀 수 있는 기반을 제공하였다.

젯슨 나노 기반의 차량 추적 캔위성 시스템 개발 (Development of CanSat System for Vehicle Tracking based on Jetson Nano)

  • 이영건;이상현;유승훈;이상구
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2022년도 추계학술대회
    • /
    • pp.556-558
    • /
    • 2022
  • 본 논문에서는 인공지능 알고리즘을 운용할 수 있는 고성능 소형 컴퓨터인 젯슨 나노를 기반으로 차량 추적 기능을 가진 캔위성 시스템을 제안한다. 캔위성 시스템은 캔위성과 지상국으로 구성되며, 캔위성은 대기권 내에서 낙하하며 장착된 센서를 통해 얻은 데이터를 무선통신을 이용해 지상국으로 전송한다. 기존 캔위성은 단순히 수집된 정보를 지상국에 전송하는 임무로 제한되며, 제한된 낙하 시간과 무선통신의 대역폭 제한으로 효율적인 임무 수행에는 한계가 있었다. 본 논문에서 제안하는 젯슨 나노 기반의 캔위성은 사전에 학습된 신경망 모델을 이용하여 공중에서 촬영한 영상에서 차량의 위치를 실시간으로 탐지 후, 2축 모터를 이용하여 카메라를 움직여 차량을 추적한다.

  • PDF

Model Accumulation 을 이용한 SAT Hard Instance의 해결 방법 연구 (Research of model accumulation to solve SAT Hard instance)

  • 장민경;최진영;곽희환
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (1)
    • /
    • pp.505-507
    • /
    • 2003
  • SAT 문제는 하드웨어/소프트웨어 검증과 모델 체킹 등 다양한 분야에서 유용하게 사용되고 있으나 복잡도가 NP-complete 라는 어려움을 가지고 있다. 다양한 알고리즘과 휴리스틱, 도구들이 개발되었지만 그럼에도 불구하고 해결할 수 없는 hard instance 들이 존재한다. 이 논문에서는 그러한 hard instance를 해결하기 위한 방법의 하나로 model accumulation을 제안한다.

  • PDF

R&D프로젝트의 계획시스템대체안의 선정을 위한 CISAT모형의 개발 (Development of CISAT Model for Selecting R&D Planning System Alternatives)

  • 강일중;권철신
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2008년도 추계학술대회 및 정기총회
    • /
    • pp.8-23
    • /
    • 2008
  • The purpose of this study is to develop a Cross Impact System Alternatives Tree(CISAT) model necessary for selecting the interdependent R&D planning system alternatives. This model modifies System Alternatives Tree(SAT) model developed by Kwon et al.. The SAT model is composed of several functions necessary for the achievement of a final goal and several subsystems for satisfying each function. In case that the relationship of technology alternatives is interdependent, this model overlooked a relative importance derived from occurrence or nonoccurrence of the technology alternatives in the future time varience. However, a complex evaluation process within the ballot system is another disadvantage of the SAT. To solve such problems, the Cross Impact Analysis(CIA) model is applied in the SAT model so as to consider the cross impact among interdependent system alternatives.

  • PDF

1차원 현장 soil column 실험을 통한 SAT 반응 모델 검증

  • 김정우;;차우석;최희철
    • 한국지하수토양환경학회:학술대회논문집
    • /
    • 한국지하수토양환경학회 2003년도 추계학술발표회
    • /
    • pp.83-86
    • /
    • 2003
  • Soil Aquifer Treatment (SAT) is a technique in which secondary- or tertiary-treated wastewater is infiltrated through unsaturated soil and stored in the saturated zone. In SAT, contaminants are removed by physical and biochemical reactions taking place in soils. In this study, a numerical model was developed to predict changes in water quality during SAT operations. The contaminant species considered in the model were ammonium, nitrate, dissolved organic carbon, and dissolved oxygen. The model was calibrated against experimental data obtained from one dimensional soil column tests conducted for 84 days. The calibrated model will be used to find out optimum conditions for the pilot- and regional-scale SAT operations to be scheduled for the next phase of this project.

  • PDF

토양/대수층 처리를 이용한 깨끗하고 안전한 도심하천 유지용수 확보 기술 (Application of soil aquifer treatment to secure clean and safe river water in urban watershed)

  • 김정우;차성민;최희철
    • 한국방재학회:학술대회논문집
    • /
    • 한국방재학회 2008년도 정기총회 및 학술발표대회
    • /
    • pp.409-411
    • /
    • 2008
  • Water conveyance from waste water treatment plant can play a role in securing river water quantitatively in urban watershed, but it can also cause more severe contamination of river water due to lack of water quality management. Soil aquifer treatment(SAT) has been introduced to overcome the worsening water quality in the water conveyance system considering the characteristics of Korean urban watershed. The application of SAT to the water conveyance system not only improve water quality of ordinarily discharged water but also prevent accidential water pollution to the urban watershed. Since most domestic urban watersheds are consist of narrow terrace lands and surrounded by roads, SAT is estimated not to be appropriate to the urban watershed with respect to the quantitative efficiency. However, since the upstream of urban watershed in which discharge ports are located usually consists of agricultural lands, SAT can be applied near discharge ports. Therefore, combination of water conveyance and SAT is expected to supply clean and safe river water in urban watershed.

  • PDF

Implementing a Verified Efficient RUP Checker

  • 어덕기
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2012년도 춘계학술발표대회
    • /
    • pp.1176-1179
    • /
    • 2012
  • To ensure the correctness of high performance satisfiability (SAT) solvers, several proof formats have been proposed. SAT solvers can report a formula being unsatisfiable with a proof, which can be independently verified by a trusted proof checker. Among the proof formats accepted at the SAT competition, the Reverse Unit Propagation (RUP) format is considered the most popular. However, the official proof checker was not efficient and failed to check many of the proofs at the competition. This inefficiency is one of the drawbacks of SAT proof checking. In this paper, I introduce a work-in-progress project, vercheck to implement an efficient RUP checker using modern SAT solving techniques. Even though my implementation is larger and more complex, the level of trust is preserved by statically verifying the correctness of the code. The vercheck program is written in GURU, a dependently typed functional programming language with a low-level resource management feature.

카운팅 문제에 대한 SAT, PB, SMT의 성능 분석 (Performance Analysis on SAT, PB and SMT for Counting Problems)

  • 박호진;박사천;권기현
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2008년도 춘계학술발표대회
    • /
    • pp.371-374
    • /
    • 2008
  • n개의 이진 변수 집합 중에 k개를 선택하는 카운팅 문제(Counting Problem)들은 여러 방법으로 풀이가 가능하다. 본 논문에서는 카운팅 문제를 풀기 위해 SAT, PB, SMT를 소개하고, 칸 칠하기(Fill-a-Pix) 퍼즐을 예로 들어 카운팅 문제의 인코딩 방법을 제시하고 처리 결과를 비교해 보았다. SAT이 상대적으로 인코딩은 가장 복잡했으나, 처리 시 가장 우수한 성능을 보였다. 따라서 본 논문은 카운팅 문제를 다룰 때에는 SAT이 가장 적합하다는 것을 제안한다.