• 제목/요약/키워드: even if

검색결과 6,508건 처리시간 0.034초

영어의 두 가지 양보조건문과 even의 의미에 대한 함의 (Two Types of Concessive Conditionals in English and Their Implications to the Semantics of 'even')

  • 임동식
    • 한국언어정보학회지:언어와정보
    • /
    • 제18권2호
    • /
    • pp.123-140
    • /
    • 2014
  • The aim of this paper is twofold: to identify two types of even if concessive conditionals, standing-ifs and introduced-ifs (Bennett 1982) in terms of whether the truth of the consequent is 'entailed' (the consequent-entailment problem in terms of Lycan 2001); and to analyze these two types of concessive conditionals in a compositional way. Here we argue that, following Guerzoni and Lim (2007), even if conditionals can be analyzed as the cases where even gets its focus in conditionals. We also argue that the consequent-entailment problem can be accounted for in a compositional way if we identify the focus as well as the scope of even in conditionals correctly. We further argue that the analysis presented in this paper supports the scope theory of even, among two theories of even previously proposed in various works. We also consider the possibility where concessive conditionals without even can be analyzed as an extension of the analysis proposed in this paper.

  • PDF

Court's Criteria for Judging Research Misconduct and JRPE Goals

  • HWANG, Hee-Joong
    • 연구윤리
    • /
    • 제1권1호
    • /
    • pp.23-28
    • /
    • 2020
  • Purpose: Focusing on Supreme Court precedents, we intend to establish criteria for judging research misconduct. Research design, data and methodology: In addition, I would like to propose the criteria for judging research misconduct by the KODISA, which applies the court's standards well in practice, and guidelines for preventing research misconduct. Research design, data and methodology: After classifying the case of research misconduct into six cases, the court's judgment and practical application will be reviewed. Results: First, research misconduct that has passed the disciplinary prescription can be punished. This is because the state of illegality continues to this day. Second, even if there were no punishment regulations at the time of research misconduct, it can be retroactively punished with the current punishment regulations. This is because research ethics is a universal and common standard and does not change. Third, if there is a fact that infringes on intellectual property rights, it is presumed unwritten intentions. Therefore, the act of taking and using the work of another person without permission or proper citation procedure, even if it is unintentional and for the public interest, is a research misconduct. Fourth, if there is an inappropriate citation notation, the intention of research misconduct is presumed. It is the judgment of the court that even if a quotation is marked, if it is incomplete, it is recognized as plagiarism. Fifth, if the author uses the work of another person without proper source indication, it is plagiarism even if the other person who owns the copyright agrees to it. The understanding or consent of some parties does not justify research misconduct in violation of public trust. Sixth, it is a research misconduct to create a new work without citations for one's previous work. In addition, even if there is a citation, if the subsequent writing is not original, it is a research misconduct. Conclusions: Academia should clarify the scope of research misconduct by referring to the Research Ethics Regulations of KODISA, and deal with research results that lack the value as creative works similar to those of research misconduct.

A Corpus-Based Analysis of Crosslinguistic Influence on the Acquisition of Concessive Conditionals in L2 English

  • Newbery-Payton, Laurence
    • 아시아태평양코퍼스연구
    • /
    • 제3권1호
    • /
    • pp.35-49
    • /
    • 2022
  • This study examines crosslinguistic influence on the use of concessive conditionals by Japanese EFL learners. Contrastive analysis suggests that Japanese native speakers may overuse the concessive conditional even if due to partial similarities to Japanese concessive conditionals, whose formal and semantic restrictions are fewer than those of English concessive conditionals. This hypothesis is tested using data from the written module of the International Corpus Network of Asian Learners of English (ICNALE). Comparison of Japanese native speakers with English native speakers and Chinese native speakers reveals the following trends. First, Japanese native speakers tend to overuse concessive conditionals compared to native speakers, while similar overuse is not observed in Chinese native speaker data. Second, non-nativelike uses of even if appear in contexts allowing the use of concessive conditionals in Japanese. Third, while overuse and infelicitous use of even if is observed at all proficiency levels, formal errors are restricted to learners at lower proficiency levels. These findings suggest that crosslinguistic influence does occur in the use of concessive conditionals, and that its particular realization is affected by L2 proficiency, with formal crosslinguistic influence mediated at an earlier stage than semantic cross-linguistic influence.

On the Subsemigroups of a Finite Cyclic Semigroup

  • Dobbs, David Earl;Latham, Brett Kathleen
    • Kyungpook Mathematical Journal
    • /
    • 제54권4호
    • /
    • pp.607-617
    • /
    • 2014
  • Let S = C(r,m), the finite cyclic semigroup with index r and period m. Each subsemigroup of S is cyclic if and only if either r = 1; r = 2; or r = 3 with m odd. For $r{\neq}1$, the maximum value of the minimum number of elements in a (minimal) generating set of a subsemigroup of S is 1 if r = 3 and m is odd; 2 if r = 3 and m is even; (r-1)/2 if r is odd and unequal to 3; and r/2 if r is even. The number of cyclic subsemigroups of S is $r-1+{\tau}(m)$. Formulas are also given for the number of 2-generated subsemigroups of S and the total number of subsemigroups of S. The minimal generating sets of subsemigroups of S are characterized, and the problem of counting them is analyzed.

A dynamical stochastic finite element method based on the moment equation approach for the analysis of linear and nonlinear uncertain structures

  • Falsone, Giovanni;Ferro, Gabriele
    • Structural Engineering and Mechanics
    • /
    • 제23권6호
    • /
    • pp.599-613
    • /
    • 2006
  • A method for the dynamical analysis of FE discretized uncertain linear and nonlinear structures is presented. This method is based on the moment equation approach, for which the differential equations governing the response first and second-order statistical moments must be solved. It is shown that they require the cross-moments between the response and the random variables characterizing the structural uncertainties, whose governing equations determine an infinite hierarchy. As a consequence, a closure scheme must be applied even if the structure is linear. In this sense the proposed approach is approximated even for the linear system. For nonlinear systems the closure schemes are also necessary in order to treat the nonlinearities. The complete set of equations obtained by this procedure is shown to be linear if the structure is linear. The application of this procedure to some simple examples has shown its high level of accuracy, if compared with other classical approaches, such as the perturbation method, even for low levels of closures.

EVEN 2-UNIVERSAL QUADRATIC FORMS OF RANK 5

  • Ji, Yun-Seong;Kim, Myeong Jae;Oh, Byeong-Kweon
    • 대한수학회지
    • /
    • 제58권4호
    • /
    • pp.849-871
    • /
    • 2021
  • A (positive definite integral) quadratic form is called even 2-universal if it represents all even quadratic forms of rank 2. In this article, we prove that there are at most 55 even 2-universal even quadratic forms of rank 5. The proofs of even 2-universalities of some candidates will be given so that exactly 20 candidates remain unproven.

PAIR MEAN CORDIAL LABELING OF GRAPHS OBTAINED FROM PATH AND CYCLE

  • PONRAJ, R.;PRABHU, S.
    • Journal of Applied and Pure Mathematics
    • /
    • 제4권3_4호
    • /
    • pp.85-97
    • /
    • 2022
  • Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}\;=\;\{\array{{\frac{p}{2}}&p\text{ is even}\\{\frac{p-1}{2}}\;&p\text{ is odd,}}$$ and M = {±1, ±2, ⋯ ± 𝜌} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling $\frac{{\lambda}(u)+{\lambda}(v)}{2}$ if λ(u) + λ(v) is even and $\frac{{\lambda}(u)+{\lambda}(v)+1}{2}$ if λ(u) + λ(v) is odd such that ${\mid}\bar{\mathbb{S}}_{{\lambda}_1}-\bar{\mathbb{S}}_{{\lambda}^c_1}{\mid}{\leq}1$ where $\bar{\mathbb{S}}_{{\lambda}_1}$ and $\bar{\mathbb{S}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling of graphs which are obtained from path and cycle.

ON PAIR MEAN CORDIAL GRAPHS

  • R. PONRAJ;S. PRABHU
    • Journal of Applied and Pure Mathematics
    • /
    • 제5권3_4호
    • /
    • pp.237-253
    • /
    • 2023
  • Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} & \;\;p\text{ is even} \\ {\frac{p-1}{2}} & \;\;p\text{ is odd,}$$ and M = {±1, ±2, … ± ρ} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling ${\frac{{\lambda}(u)+{\lambda}(v)}{2}}$ if λ(u) + λ(v) is even and ${\frac{{\lambda}(u)+{\lambda}(v)+1}{2}}$ if λ(u) + λ(v) is odd such that ${\mid}{\bar{{\mathbb{S}}}}_{\lambda}{_1}-{\bar{{\mathbb{S}}}}_{{\lambda}^c_1}{\mid}{\leq}1$ where ${\bar{{\mathbb{S}}}}_{\lambda}{_1}$ and ${\bar{{\mathbb{S}}}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of few graphs including the closed helm graph, web graph, jewel graph, sunflower graph, flower graph, tadpole graph, dumbbell graph, umbrella graph, butterfly graph, jelly fish, triangular book graph, quadrilateral book graph.

PAIR MEAN CORDIAL LABELING OF SOME UNION OF GRAPHS

  • R. PONRAJ;S. PRABHU
    • Journal of Applied and Pure Mathematics
    • /
    • 제6권1_2호
    • /
    • pp.55-69
    • /
    • 2024
  • Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} && p\;\text{is even} \\ {\frac{p-1}{2}} && p\;\text{is odd,}}$$ and M = {±1, ±2, … ± 𝜌} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling $\frac{{\lambda}(u)+{\lambda}(v)}{2}$ if λ(u) + λ(v) is even and $\frac{{\lambda}(u)+{\lambda}(v)+1}{2}$ if λ(u) + λ(v) is odd such that ${\mid}\bar{\mathbb{s}}_{{\lambda}_1}-\bar{\mathbb{s}}_{{\lambda}^c_1}{\mid}\,{\leq}\,1$ where $\bar{\mathbb{s}}_{{\lambda}_1}$ and $\bar{\mathbb{s}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G with a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of some union of graphs.

데이터마이닝을 이용한 대학생들의 취업 로드맵에 관한 기초 연구 (A Basic Study on the Career Roadmap of University Students Using Data Mining)

  • 김효정;오새내
    • 디지털산업정보학회논문지
    • /
    • 제19권1호
    • /
    • pp.129-138
    • /
    • 2023
  • The purpose of this study is to explore factors that directly affect the employment of college graduates. To this end, employment data of graduates of private four-year university in Daegu metropolitan area and Gyeongsangbuk-do province were collected from 2019 to 2021, filtered data using a RapidMiner, and analyzed by applying a decision tree model. As a result of the study, long-term internship for more than 12 weeks, TOEIC score of 787.5 or higher was advantageous for employment, and if there was no TOEIC score, the graduation average score was 3.67 or higher, so the possibility of employment was high. Even if the TOEIC score was low, it was advantageous for employment if participating in the contest and continuous professor counseling, and even if the average graduation score was low, the possibility of employment was high if actively participating in the comparison program. This study can present a job education guide based on actual data to university management and use it to establish policies to support employment of college students.