• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2084-2100
• /
• 2020

Operating system (OS) kernel function call graphs have been widely used in OS analysis and defense. However, most existing methods and tools for generating function call graphs are designed for application programs, and cannot be used for generating OS kernel function call graphs. This paper proposes a virtualization-based call graph generation method called Acquire in Trap (AIT). When target kernel functions are called, AIT dynamically initiates a system trap with the help of a virtualization technique. It then analyzes and records the calling relationships for trap handling by traversing the kernel stacks and the code space. Our experimental results show that the proposed method is feasible for both Linux and Windows OSs, including 32 and 64-bit versions, with high recall and precision rates. AIT is independent of the source code, compiler and OS kernel architecture, and is a universal method for generating OS kernel function call graphs.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.75-80
• /
• 2021

For a locus with two alleles (IA and IB), the frequencies of the alleles are represented by $$p=f(I^A)={\frac{2N_{AA}+N_{AB}}{2N} },\;q=f(I^B)={\frac{2N_{BB}+N_{AB}}{2N}}$$ where NAA, NAB and NBB are the numbers of IA IA, IA IB and IB IB respectively and N is the total number of populations. The frequencies of the genotypes expected are calculated by using p2, 2pq and q2. So in this paper, we consider the method of whether some genotypes is in Hardy-Weinburg equilibrium. Also we calculate the probability generating function for the offspring number of genotype produced by a mating of the ith male and jth female under a diploid model of N population with N1 males and N2 females. Finally, we have conditional joint probability generating function of genotype frequencies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.191-198
• /
• 2014

This paper proposes a simple linear function approximation method to solve an economic load dispatch problem with complex non-smooth generating cost function. This algorithm approximates a non-smooth power cost function to a linear approximate function and subsequently shuts down a generator with the highest operating cost and reduces the power of generator with more generating cost in order to balance the generating power and demands. When applied to the most prevalent benchmark economic load dispatch cases, the proposed algorithm is found to dramatically reduce the power cost than does heuristic algorithm. Moreover, it has successfully obtained results similar to those obtained through a quadratic approximate function method.

• Communications of the Korean Mathematical Society
• /
• v.17 no.2
• /
• pp.363-370
• /
• 2002

We show that G(x) = $e^{(x}$(1-x))/ -1 is the exponential generating function for the labeled digraphs whose weak components are transitive tournaments and derive both a recursive formula and an explicit formula for the number of them on n vertices. Moreover, we investigate the asymptotic behavior for the coefficients of G(x) using Hayman's method.d.

• Journal of Astronomy and Space Sciences
• /
• v.30 no.1
• /
• pp.17-24
• /
• 2013

The use of generating functions for solving optimal rendezvous problems has an advantage in the sense that it does not require one to guess and iterate the initial costate. This paper presents how to apply generating functions to analyze spacecraft optimal reconfiguration between projected circular orbits. The series-based solution obtained by using generating functions demonstrates excellent convergence and approximation to the nonlinear reference solution obtained from a numerical shooting method. These favorable properties are expected to hold for analyzing optimal formation reconfiguration under perturbations and non-circular reference orbits.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.102-106
• /
• 1988

Generally, average invest cost is widely used for expansion planning of generation in power system. But, other cost which is followed by adding generating capacity in electric system is increased in accordance with increasing plant reasons. In this study, we represent the invest cost with quadratic function and analyze its effect on the expansion planning. It is hoped that this method is used in expansion planning of generating system.

• Journal of the Society of Naval Architects of Korea
• /
• v.36 no.1
• /
• pp.70-81
• /
• 1999

To predict the viscous boundary layers and wakes around a ship, the CFD techniques are commonly used. For the efficient application of CFD tools to practical hull farms, a 3-D field grid generating system is developed. The present grid generating system utilizes the solution of Poisson equation. Sorenson's method developed for 2-D is extended into 3-D to provide the forcing functions controling grid interval and orthogonality on hull surface, etc. The weighting function scheme is used for the discretization of the Poisson equation and the linear equations are solved by using MSIP salver. The trans-finite interpolation is also employed to assure the smooth transition into boundary surface grids. To rove the applicability, the field grid systems around a container ship and a VLCC with bow and stem bulb are illustrated, and the procedures for generating 3-D field grid system are explained.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.1186-1190
• /
• 1995

This paper is focused on the formulation of explicit closed-form functions describing the performance measures of the general flexible manufacturing system (FMS)according to the strategy of material handling system(MHS). the performance measures such as the production rate, the production lead-time and the utilization rate of the general FMS are expressed, respectively, as the explicit closed-form functions of the part processing time, the service rate of the material handling system (MHS) and the number of machine tools in the FMS. For this, the gensral FMS is presented as a generalized stochastic Petri net model, then, the moment generating function (MGF) based approach is applied to obtain the steady-state probabity formulation. Based on the steady-state formulation, the explicit closed-form functions for performance measures of the probability FMS can be obtained. Finally, the analytical results are compared with the Petri net simulation results to verify the validity of the suggested method. The paper is of significance in the sense that it provides a comprehensive formula for performance measures of the FMS even to the industry engineers and academic reademic resuarchers who have no background on Markov chain analysis method or Petrinet modeling

• Honam Mathematical Journal
• /
• v.34 no.3
• /
• pp.327-340
• /
• 2012

Gottlieb polynomials were introduced and investigated in 1938, and then have been cited in several articles. Very recently Khan and Akhlaq introduced and investigated Gottlieb polynomials in two and three variables to give their generating functions. Subsequently, Khan and Asif investigated the generating functions for the $q$-analogue of Gottlieb polynomials. Very recently, Choi defined a $q$-extension of the generalized two variable Gottlieb polynomials ${\varphi}^2_n({\cdot})$ and presented their several generating functions. Also, by modifying Khan and Akhlaq's method, Choi presented a generalization of the Gottlieb polynomials in m variables to give two generating functions of the generalized Gottlieb polynomials ${\varphi}^m_n({\cdot})$. Here, in the sequel of the above results for their possible general $q$-extensions in several variables, again, we aim at trying to define a $q$-extension of the generalized three variable Gottlieb polynomials ${\varphi}^3_n({\cdot})$ and present their several generating functions.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.147-154
• /
• 2013

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.