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

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

Finite element analysis of viscoelastic flows in a domain with geometric singularities

  • Yoon, Sung-Ho;Kwon, Young-Don
    • Korea-Australia Rheology Journal
    • /
    • 제17권3호
    • /
    • pp.99-110
    • /
    • 2005
  • This work presents results of finite element analysis of isothermal incompressible creeping viscoelastic flows with the tensor-logarithmic formulation of the Leonov model especially for the planar geometry with singular comers in the domain. In the case of 4:1 contraction flow, for all 5 meshes we have obtained solutions over the Deborah number of 100, even though there exists slight decrease of convergence limit as the mesh becomes finer. From this analysis, singular behavior of the comer vortex has been clearly seen and proper interpolation of variables in terms of the logarithmic transformation is demonstrated. Solutions of 4:1:4 contraction/expansion flow are also presented, where there exists 2 singular comers. 5 different types spatial resolutions are also employed, in which convergent solutions are obtained over the Deborah number of 10. Although the convergence limit is rather low in comparison with the result of the contraction flow, the results presented herein seem to be the only numerical outcome available for this flow type. As the flow rate increases, the upstream vortex increases, but the downstream vortex decreases in their size. In addition, peculiar deflection of the streamlines near the exit comer has been found. When the spatial resolution is fine enough and the Deborah number is high, small lip vortex just before the exit comer has been observed. It seems to occur due to abrupt expansion of the elastic liquid through the constriction exit that accompanies sudden relaxation of elastic deformation.

Genetic Mapping of Resistant Genes in Brassica pekinensis Against Plasmodiophora brassicae Race 6

  • Lee, Gung-Pyo;Baek, Nam-Kwon;Park, Kuen-Woo
    • The Plant Pathology Journal
    • /
    • 제18권5호
    • /
    • pp.266-270
    • /
    • 2002
  • Inbred lines of Chinese cabbage KU-101 (resistant line against Plasmodiophora brassicae race race 6) and CS-113 (susceptible line) were crossed and their progeny lines F$_1$, BC$_1$F$_1$, F$_2$, and F$_3$ were produced for the construction of the genetic linkage map of R brassicae race 6-resistant Brassica campestris ssp. pekinensis genome. Restriction fragment length polymorphism (RFLP) was applied to compare between parents and their f$_2$ progenies with a total of 192 probes and 5 restriction enzymes. The constructed RFLP map covered 1,104 cM with a mean distance between genetic marker of 8.0 cM, and produced 10 linkage groups having 121 genetic loci. The loci of P. brassicae race 6 (CR6)-resistant Brassica genome were determined by interval mapping of quan-titative trait loci (QTL), which resulted from bioassay using the same race of the fungi in P3 population. Resistant loci were estimated in numbers 1 (Gl) and 3 (G3) linkage groups. In the regression test, Gl had a value of4.8 logarithm of odd (LOD) score, while C3 had values of 4.2-7.2. Given these results, the location of the CR6-resistant loci within the Brassica genome map can now be addressed.

${\varrho}$의 역사적 기원과 의의 (A History and Meaning of the Number ${\varrho}$)

  • 김성숙
    • 한국수학사학회지
    • /
    • 제17권3호
    • /
    • pp.33-42
    • /
    • 2004
  • 상수 ${\varrho}$는 미분적분학뿐만 아니라 실생활에서도 중요한 의미를 갖는 상수이다. 상수 ${\varrho}$의 개념은 1618년 출판된 네이피어의 논문 부록에 처음 나온다. 그 당시의 로그의 발전이 상수 ${\varrho}$를 이해하는 데 기여하였다. 1727년에 오일러가 상수 ${\varrho}$의 기호를 도입하며 명확한 정의와 함께 상수 ${\varrho}$에 대하여 연구하였다. 현재 고등학교에서 배우는 상수 ${\varrho}$의 개념을 정립하는 데 약 100년이 걸린 것이다. 상수 ${\varrho}$의 기원의 연구를 통해 현재 우리 시대에 행해지고 있는 많은 연구가 미래에 큰 의미를 부여할 수 있기를 기대한다.

  • PDF

이탄의 장기압밀특성에 관한 연구 (Studies on the Long-term Consolidation Characteristics of Peats)

  • 김재영;주재우
    • 한국농공학회지
    • /
    • 제31권1호
    • /
    • pp.106-116
    • /
    • 1989
  • This study aims at scrutinizing the long4errn consolidation characteristics of peats sampled at three different regions of Chonbuk province. The standard consolidation test and the single load consolidation test were performed about these samples and especially in case of the latter the loading period was 350 days. The main condusions analyzed are as follows. 1. Void ratio showed much greater values than that of the general clay and was decresed greatly according to the increase of the load. 2. In case of the relationship between the sefflement and the long-term settlement time the rate of settlement increment became great according to the increase of the load step and the long4erm settlement became linely proportional to the logarithm of time alter 10 minutes. 3. The linear correlation was showed between the long4erm settlement time and the void ratio and therefore equations by regression analysis were derived in order to estimate the long-term settlement The slope of straight lines increased according th the increase of the load step and secondary consolidation coefficients ranged from 0.04-0.27. 4. The secondary consolidation coeffcient became linealy proportional to the compression index and the ratio of Ca to CC was 0.072. 5. The period required in ending the primary consolidation was about 10 minutes and alter that the secondary consolidation coefficient appeared to have constant value. Therefore the secondary consolidation coefficient was judged to be used as a significant factor in estimating the long4erm settlement. 6. In case of the single load consolidation test the secondary consolidation coefficient showed the tendancy increasing according to the increase of the consolidation pressure.

  • PDF

캐리어 막에 의한 알카리 금속 이온의 업-힐 수송의 특성 연구 (Study of Characteristic of Up-hill Transport in Alkali Metal-ions Through a Carrier Membrane)

  • 박근덕;양원강
    • 분석과학
    • /
    • 제12권3호
    • /
    • pp.224-229
    • /
    • 1999
  • 최근 캐리어를 이용한 액체막의 연구가 대단히 활발하다. 항생물질의 모넨신을 사용하여 옥타놀의 유기용매에 용해시켜 양이온교환막을 제조하였다. 이막의 평가를 Nernst-Planck식과 Fick식으로 막전위와 물질의 투과선택도를 분석하였다. 사용한 알카리이온의 농도에 대한 높은 투과선택성을 확인하였고, 시간에 따른 이온농도값은 선형관계를 알았다. 그러나 이온의 높은농도에서 변화량은 선형이 아니였다. 이를 위한 해석은 정지층(Stagnent Layer)을 하나 더 도입하여 업 - 힐 수송에서 직선관계를 얻었다.

  • PDF

폐기물매립지의 장기침하 특성에 관한 연구 (A Study on the Characteristics of Long-term Settlement for Solid Waste Landfill)

  • 박정준;신은철;김동식
    • 한국재난정보학회 논문집
    • /
    • 제4권2호
    • /
    • pp.52-66
    • /
    • 2008
  • It has been a growing concern about reusing Sudokwon landfill 2nd site and other sanitary landfills located around the metropolitan areas. In this paper, settlement characteristics of Sudokwon landfill 2nd site were studied by analyzing the data collected over the period of six years. Three equations are combined in order to modeling the long-term settlement behavior of refuse landfill caused by mechanical secondary composition and secondary composition caused by the decomposition of biodegradable refuse. It is suggested that mechanical secondary composition is linear with respect to the logarithm of time. The models proposed by hyperbolic method and Gibson & Lo model, power creep law are considered to be suitable for the long-term prediction value of Sudokwon landfill 2nd site. The fifteen-year-period prediction value of hyperbolic method and Gibson & Lo model is considerably different from that of power creep law model. The average settlement for Block I in Sudokwon 2nd site is approximately 3.9m with 4 steps of final landfill stages.

  • PDF

2차원 평면에서 이동장애물에 대한 항공기의 유도/회피기동 연구 (Aircraft Collision-Avoidance/Guidance Strategy in Dynamic Environments for Planar Flight)

  • 이인석
    • 한국항공우주학회지
    • /
    • 제32권7호
    • /
    • pp.69-75
    • /
    • 2004
  • 비행중인 다른 항공기를 회피하며 항공기를 목표점까지 유도하는 문제를 2차원 평면에서 고려하였다. 항공기는 속도의 크기가 일정한 질점이며, 제어입력으로 측가속도를 사용하는 것으로 가정하였다. 이동장애물에는 척력 포텐셜함수를 목적점에는 인력 포텐셜함수를 인공적으로 부여하여 항공기에 척력과 인력이 작용하도록 하였다. 유도/회피명령은 이들 포텐셜력과 상대속도를 사용하여 실시간으로 구현 가능한 유도/회피법칙을 구현하였다. Log 형태의 포텐셜함수를 사용하면 구현된 유도법칙은 잘 알려진 비례항법유도법칙이 되며, 회피법칙은 장애물까지 도달시간에 반비례하고 시선각 변화의 반대 방향으로 항공기를 회전시킨다. 제안된 유도/회피법칙은 시뮬레이션을 통하여 타당성을 검증하였다.

Feature Voting for Object Localization via Density Ratio Estimation

  • Wang, Liantao;Deng, Dong;Chen, Chunlei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권12호
    • /
    • pp.6009-6027
    • /
    • 2019
  • Support vector machine (SVM) classifiers have been widely used for object detection. These methods usually locate the object by finding the region with maximal score in an image. With bag-of-features representation, the SVM score of an image region can be written as the sum of its inside feature-weights. As a result, the searching process can be executed efficiently by using strategies such as branch-and-bound. However, the feature-weight derived by optimizing region classification cannot really reveal the category knowledge of a feature-point, which could cause bad localization. In this paper, we represent a region in an image by a collection of local feature-points and determine the object by the region with the maximum posterior probability of belonging to the object class. Based on the Bayes' theorem and Naive-Bayes assumptions, the posterior probability is reformulated as the sum of feature-scores. The feature-score is manifested in the form of the logarithm of a probability ratio. Instead of estimating the numerator and denominator probabilities separately, we readily employ the density ratio estimation techniques directly, and overcome the above limitation. Experiments on a car dataset and PASCAL VOC 2007 dataset validated the effectiveness of our method compared to the baselines. In addition, the performance can be further improved by taking advantage of the recently developed deep convolutional neural network features.

Plagiarism Detection among Source Codes using Adaptive Methods

  • Lee, Yun-Jung;Lim, Jin-Su;Ji, Jeong-Hoon;Cho, Hwaun-Gue;Woo, Gyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권6호
    • /
    • pp.1627-1648
    • /
    • 2012
  • We propose an adaptive method for detecting plagiarized pairs from a large set of source code. This method is adaptive in that it uses an adaptive algorithm and it provides an adaptive threshold for determining plagiarism. Conventional algorithms are based on greedy string tiling or on local alignments of two code strings. However, most of them are not adaptive; they do not consider the characteristics of the program set, thereby causing a problem for a program set in which all the programs are inherently similar. We propose adaptive local alignment-a variant of local alignment that uses an adaptive similarity matrix. Each entry of this matrix is the logarithm of the probabilities of the keywords based on their frequency in a given program set. We also propose an adaptive threshold based on the local outlier factor (LOF), which represents the likelihood of an entity being an outlier. Experimental results indicate that our method is more sensitive than JPlag, which uses greedy string tiling for detecting plagiarism-suspected code pairs. Further, the adaptive threshold based on the LOF is shown to be effective, and the detection performance shows high sensitivity with negligible loss of specificity, compared with that using a fixed threshold.

Analysis of Certificateless Signcryption Schemes and Construction of a Secure and Efficient Pairing-free one based on ECC

  • Cao, Liling;Ge, Wancheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권9호
    • /
    • pp.4527-4547
    • /
    • 2018
  • Signcryption is a cryptographic primitive that provides authentication (signing) and confidentiality (encrypting) simultaneously at a lower computational cost and communication overhead. With the proposition of certificateless public key cryptography (CLPKC), certificateless signcryption (CLSC) scheme has gradually become a research hotspot and attracted extensive attentions. However, many of previous CLSC schemes are constructed based on time-consuming pairing operation, which is impractical for mobile devices with limited computation ability and battery capacity. Although researchers have proposed pairing-free CLSC schemes to solve the issue of efficiency, many of them are in fact still insecure. Therefore, the challenging problem is to keep the balance between efficiency and security in CLSC schemes. In this paper, several existing CLSC schemes are cryptanalyzed and a new CLSC scheme without pairing based on elliptic curve cryptosystem (ECC) is presented. The proposed CLSC scheme is provably secure against indistinguishability under adaptive chosen-ciphertext attack (IND-CCA2) and existential unforgeability under adaptive chosen-message attack (EUF-CMA) resting on Gap Diffie-Hellman (GDH) assumption and discrete logarithm problem in the random oracle model. Furthermore, the proposed scheme resists the ephemeral secret leakage (ESL) attack, public key replacement (PKR) attack, malicious but passive KGC (MPK) attack, and presents efficient computational overhead compared with the existing related CLSC schemes.