• 한국관광식음료학회:학술대회논문집
• /
• 한국관광식음료학회 2005년도 학술논문발표집
• /
• pp.80-91
• /
• 2005

Recently, hotel industry has realized the importance of food and beverage sales for the profit maximization, and the focuses on restaurant management has been growing. Accordingly, menu management in the F/B department is one of the most key factors determining the success or failure of business. Therefore, in this study, entree menu items of french restaurant in the deluxe hotel was analysed with presently theorized model of menu analysis, classified into four menu items. Also it was analyzed how those classified menu items influence on sales, number of sold, food cost percentage, contribution margin And, proper ways was presented to make restaurant managers and menu planner in order to increase food operation sales through proper modifications and methods on various menu analysis matrix. In Pavesic's menu analysis method, all of menu items have impact on the sales, number of sold, contribution margin and Primes, Sleepers do so on the food cost. The finding of this study was that Pavesic's menu analysis is superior to menu analysis in terms of the sales, number of sold, food cost percentage, contribution margin. Therefore, Pavesic's menu analysis is useful and efficient method in order to conduct menu engineering.

• International Journal of Internet, Broadcasting and Communication
• /
• 제10권3호
• /
• pp.11-25
• /
• 2018

While being believed that decrypting any RSA ciphertext is as hard as factorizing the RSA modulus, it was also shown that, if additional information is available, breaking the RSA cryptosystem may be much easier than factoring. For example, Coppersmith showed that, given the 1/2 fraction of the least or the most significant bits of one of two RSA primes, one can factorize the RSA modulus very efficiently, using the lattice-based technique. More recently, introducing the so called cold boot attack, Halderman et al. showed that one can recover cryptographic keys from a decayed DRAM image. And, following up this result, Heninger and Shacham presented a polynomial-time attack which, given 0.27-fraction of the RSA private key of the form (p, q, d, $d_p$, $d_q$), can recover the whole key, provided that the given bits are uniformly distributed. And, based on the work of Heninger and Shacham, this paper presents a different approach for recovering RSA private key bits from decayed key information, under the assumption that some random portion of the private key bits is known. More precisely, we present the algorithm of recovering RSA private key bits from erased key material and elaborate the formula of describing the number of partially-recovered RSA private key candidates in terms of the given erasure rate. Then, the result is justified by some extensive experiments.

• 대한수학교육학회지:학교수학
• /
• 제18권3호
• /
• pp.527-539
• /
• 2016

"평행사변형은 사다리꼴이다."에서 '이다'는 애매하고 그 의미가 매우 풍부한 기호이다. 이 연구는 일상적 언어 '이다'가 문맥과 상황에 따라 다양하게 해석되는 의미원소임을 밝히고 수학에서 사용되는 '이다'의 의미를 구분하여 논의한다. 그리고 '동일성'의 관념에 주목하여, 수학적으로 '같음'을 나타내기 위해 사용되기도 하는 '이다'를 동치관계의 개념과 Van Hieles의 기하 사고 수준 이론으로 재해석하여 살펴본다. 수학적 기호로서 '이다'에 대한 분석 결과 '이다'는 수학적 아이디어를 의미 있게 생성하는 데 중요한 의의가 있다고 판단된다.

• 대한수학회논문집
• /
• 제33권1호
• /
• pp.85-101
• /
• 2018

Let S be a polynomial ring over a field K, with a monomial order ${\prec}$, and let I be an unmixed graded ideal of S. In this paper we study two functions associated to I: The minimum distance function ${\delta}_I$ and the footprint function $fp_I$. It is shown that ${\delta}_I$ is positive and that $fp_I$ is positive if the initial ideal of I is unmixed. Then we show that if I is radical and its associated primes are generated by linear forms, then ${\delta}_I$ is strictly decreasing until it reaches the asymptotic value 1. If I is the edge ideal of a Cohen-Macaulay bipartite graph, we show that ${\delta}_I(d)=1$ for d greater than or equal to the regularity of S/I. For a graded ideal of dimension ${\geq}1$, whose initial ideal is a complete intersection, we give an exact sharp lower bound for the corresponding minimum distance function.

• International Journal of Internet, Broadcasting and Communication
• /
• 제11권4호
• /
• pp.1-10
• /
• 2019

This Dietary cholesterol augments lipid profile and primes production and activation of platelets, leading to development of atherosclerosis which produce several detrimental effects on cardiovascular health. Ethnomedicine and Mediterranean diet are natural sources and cost effective modes against several ailments including cardiovascular diseases while fermented foods have gained interest due to their increased nutrient profile, enhanced bioavailability and efficacy. Garlic has been known to reduce cholesterol and inhibit platelet activation. We examined whether fermented garlic ameliorates effects of hypercholesterolemia and platelet functions in rats. Methodology: Male SD rats were fed with hypercholesterolemia diet and treated with spirulina, fermented and non-fermented preparations of garlic for one month. Platelet aggregation and granule secretion were assessed to evaluate platelet activation. Liver and kidney weights, lipid and enzymatic profile of serum and whole blood analysis was performed. Expressions of SREBP, ACAT-2 and HMG-CoA were assessed using RT-PCR while liver and adipose tissues were analyzed for histological changes. Both fermented and non-fermented garlic inhibited platelet aggregation and granule secretion while fermented garlic showed greater inhibitor tendency. Fermented garlic significantly reduced liver weight and triglycerides concentrations than non-fermented garlic. Similarly, fermented garlic greatly abrogated the detrimental effects of steatosis on liver and adipose tissues. Fermented garlic significantly improved lipid profile and modulated platelet functions, thereby inhibiting atherosclerosis and platelet related cardiovascular disorders.

• 정보보호학회논문지
• /
• 제19권5호
• /
• pp.195-200
• /
• 2009

CRT-RSA 알고리즘이 스마트카드나 마이크로컨트롤러 등의 암호 장치에 구현된 경우 레이저 주입, 전자파 방사, 이온 빔 주사, 전압 글리치 주입 등의 오류 주입 기술 등에 의해 CRT-RSA 알고리즘의 비밀 소인수 p, q가 쉽게 노출 될 수 있다. 그 중 전압 글리치 오류는 대상 암호 장치에 어떠한 조작이나 변형 없이 적용 가능하여 보다 실제적이다. 본 논문에서는 비정상 전원 전압을 이용한 오류 주입 공격을 실험하였다. 실험 결과 기존에 알려진 고전압 글리치를 주입하는 방법 외에도 전원 전압을 일정 시간동안 단절함으로써 CRT-RSA의 비밀 소인수 p, q를 알아낼 수 있었다.

• 대한수학회지
• /
• 제60권5호
• /
• pp.1073-1085
• /
• 2023

A partition of n is called a t-core partition if none of its hook number is divisible by t. In 2019, Hirschhorn and Sellers [5] obtained a parity result for 3-core partition function a3(n). Motivated by this result, both the authors [8] recently proved that for a non-negative integer α, a3αm(n) is almost always divisible by an arbitrary power of 2 and 3 and at(n) is almost always divisible by an arbitrary power of pji, where j is a fixed positive integer and t = pa11pa22···pamm with primes pi ≥ 5. In this article, by using Hecke eigenform theory, we obtain infinite families of congruences and multiplicative identities for a2(n) and a13(n) modulo 2 which generalizes some results of Das [2].

• BMB Reports
• /
• 제56권11호
• /
• pp.584-593
• /
• 2023

Hypoxia, a widespread occurrence observed in various malignant tumors, results from rapid tumor growth that outpaces the oxygen supply. Tumor hypoxia precipitates several effects on tumor biology; these include activating angiogenesis, intensifying invasiveness, enhancing the survival of tumor cells, suppressing anti-tumor immunity, and fostering resistance to therapy. Aligned with the findings that correlate CMGC kinases with the regulation of Hypoxia-Inducible Factor (HIF), a pivotal modulator, reports also indicate that hypoxia governs the activity of CMGC kinases, including DYRK1 kinases. Prolyl hydroxylation of DYRK1 kinases by PHD1 constitutes a novel mechanism of kinase maturation and activation. This modification "primes" DYRK1 kinases for subsequent tyrosine autophosphorylation, a vital step in their activation cascade. This mechanism adds a layer of intricacy to comprehending the regulation of CMGC kinases, and underscores the complex interplay between distinct post-translational modifications in harmonizing precise kinase activity. Overall, hypoxia assumes a substantial role in cancer progression, influencing diverse aspects of tumor biology that include angiogenesis, invasiveness, cell survival, and resistance to treatment. CMGC kinases are deeply entwined in its regulation. To fathom the molecular mechanisms underpinning hypoxia's impact on cancer cells, comprehending how hypoxia and prolyl hydroxylation govern the activity of CMGC kinases, including DYRK1 kinases, becomes imperative. This insight may pave the way for pioneering therapeutic approaches that target the hypoxic tumor microenvironment and its associated challenges.

• 인지과학
• /
• 제18권4호
• /
• pp.371-398
• /
• 2007

이 연구는 의미점화과제와 반복점화과제를 사용하여 사용빈도와 의미투명성이 복합명사의 분리처리 양상에 어떤 영향을 미치는지를 알아보았다. 실험 1에서는 사용빈도에 따라 복합명사의 분리처리 양상이 달라지는지를 검토하였다. 의미점화효과가 복합명사 연상어 조건에서 자극제시시차나 사용빈도와 무관하게 관찰되었으며, 반복점화효과는 부분조건과 전체조건에서 모두 관찰되었지만 부분조건에서 더 큰 반복점화효과를 보였다. 이 결과는 복합명사가 하위 형태소로 분리되어 처리되는 경로와 복합명사 전체로 처리되는 경로가 함께 존재할 가능성을 보여준다. 실험 2에서는 의미투명도에 따라 복합명사의 분리처리 양상이 달라지는지를 검토하였다. 의미점화효과가 복합명사 연상어 조건에서 자극제시시차나 의미투명도에 무관하게 관찰되었으며, 반복점화과제에서도 실험 1b와 유사한 결과를 보였다. 실험 1과 2의 결과는 어휘수준에서 분리처리경로와 전체처리경로를 통해 활성화된 의미가 개념 수준에서 이루어지는 상호작용과정을 통해 복합명사의 의미를 결정함을 시사한다.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.335-346
• /
• 2010

The present study investigates the difficulty of solving the mathematical problem, namely the DLP (Discrete Logarithm Problem) for ephemeral keys. The DLP is the basis for many public key cryptosystems. The ephemeral keys are used in such systems to ensure security. The DLP defined on a prime field $Z^*_p of random prime is considered in the present study. The most effective method to solve the DLP is the ICM (Index Calculus Method). In the present study, an efficient way of computing the DLP for ephemeral keys by using a new variant of the ICM when the factors of p-1 are known and small is proposed. The ICM has two steps, a pre-computation and an individual logarithm computation. The pre-computation step is to compute the logarithms of a subset of a group and the individual logarithm step is to find the DLP using the precomputed logarithms. Since the ephemeral keys are dynamic and change for every session, once the logarithms of a subset of a group are known, the DLP for the ephemeral key can be obtained using the individual logarithm step. Therefore, an efficient way of solving the individual logarithm step based on the newly proposed precomputation method is presented and the performance is analyzed using a comprehensive set of experiments. The ephemeral keys are also solved by using other methods, which are efficient on random primes, such as the Pohlig-Hellman method, the Van Oorschot method and the traditional individual logarithm step. The results are compared with the newly proposed individual logarithm step of the ICM. Also, the DLP of ephemeral keys used in a popular password key exchange protocol known as Chang and Chang are computed and reported to launch key recovery attack.