• Journal of the Korean Society for Library and Information Science
• /
• v.42 no.4
• /
• pp.5-31
• /
• 2008

In this study, after Library-Assisted Instruction is set out and executed, it is surveyed and verified the connection between Learning Attitude and Life competence. This study indicates that Learning Attitude and Life skills of Library-Assisted Instruction have close correlation and the extension of Life competence(Communication, Problem Solving. Self-Directed Learning) is under the influence of Learning Attitude. This study suggests that cooperative learning, Information Processing Model and constructivism learning theory have to be adopted as a means of increasing more educational effects and extensions of Library-Assisted Instruction.

• Journal of Power Electronics
• /
• v.17 no.6
• /
• pp.1433-1444
• /
• 2017

A family of non-isolated DC-DC three-port converters (TPCs) that allows for a more flexible power flow among a renewable energy source, an energy storage device and a current-reversible DC bus is introduced. Most of the reported non-isolated topologies in this area consider only a power consuming load. However, for applications such as hybrid-electric vehicle braking systems and DC microgrids, the load power generating capability should also be considered. The proposed three-port family consists of one unidirectional port and two bi-directional ports. Hence, they are well-suited for photovoltaic (PV)-battery-DC bus systems from the power flow viewpoint. Three-port converters are derived by combining different commonly known power converters in an integrated manner while considering the voltage polarity, voltage levels among the ports and the overall voltage conversion ratio. The derived converter topologies are able to allow for seven different modes of operation among the sources and load. A three-port converter which integrates a boost converter with a buck converter is used as a design example. Extensions of these topologies by combining the soft-switching technique with the proposed design example are also presented. Experiment results are given to verify the proposed three-port converter family and its analysis.

• Structural Engineering and Mechanics
• /
• v.15 no.2
• /
• pp.159-180
• /
• 2003

In this paper spacing and width of flexural cracks in reinforced concrete beams are determined using two-dimensional finite element analysis. At early loading stages on the beam the primary crack spacing is based on the slip length, which is the development length required to resist the steel stress increment that occurs at a cracked section on the formation of the first flexural crack. A semi-empirical formula is presented in this paper for the determination of the slip length for a given beam. At higher load levels, the crack spacing is based on critical crack spacing, which is defined as the particular crack spacing that would produce a concrete tensile stress equal to the flexural strength of concrete. The resulting crack width is calculated as the relative difference in extensions of steel reinforcement and adjacent concrete evaluated at the cracked section. Finally a comparative study is undertaken, which indicates that the spacing and width of cracks calculated by this method agree well with values measured by other investigators.

• Structural Engineering and Mechanics
• /
• v.35 no.3
• /
• pp.283-299
• /
• 2010

This paper addresses the numerical simulation of fatigue crack growth in arbitrary 2D geometries under constant amplitude loading by the using a new finite element software. The purpose of this software is on the determination of 2D crack paths and surfaces as well as on the evaluation of components Lifetimes as a part of the damage tolerant assessment. Throughout the simulation of fatigue crack propagation an automatic adaptive mesh is carried out in the vicinity of the crack front nodes and in the elements which represent the higher stresses distribution. The fatigue crack direction and the corresponding stress-intensity factors are estimated at each small crack increment by employing the displacement extrapolation technique under facilitation of singular crack tip elements. The propagation is modeled by successive linear extensions, which are determined by the stress intensity factors under linear elastic fracture mechanics (LEFM) assumption. The stress intensity factors range history must be recorded along the small crack increments. Upon completion of the stress intensity factors range history recording, fatigue crack propagation life of the examined specimen is predicted. A consistent transfer algorithm and a crack relaxation method are proposed and implemented for this purpose. Verification of the predicted fatigue life is validated with relevant experimental data and numerical results obtained by other researchers. The comparisons show that the program is capable of demonstrating the fatigue life prediction results as well as the fatigue crack path satisfactorily.

• Structural Engineering and Mechanics
• /
• v.25 no.6
• /
• pp.717-732
• /
• 2007

A formula to approximate the fundamental period of a fixed-free mass-spring system with varying mass and varying stiffness is formulated. The formula is derived mainly by taking the dominant parts from the general form of the characteristic polynomial, and adjusting the initial approximation by a coefficient derived from the exact solution of a uniform case. The formula is tested for a large number of randomly generated structures, and the results show that the approximated fundamental periods are within the error range of 4% with 90% of confidence. Also, the error is shown to be normally distributed with zero mean, and the width of the distribution (as measured by the standard deviation) tends to decrease as the total number of discretized elements in the system increases. Other possible extensions of the formula are discussed, including an extension to a continuous cantilever structure with distributed mass and stiffness. The suggested formula provides an efficient way to estimate the fundamental period of building structures and other systems that can be modeled as mass-spring systems.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.2
• /
• pp.187-204
• /
• 2011

B. C. Carlson [Some extensions of Lardner's relations between $_0F_3$ and Bessel functions, SIAM J. Math. Anal. 1(2) (1970), 232-242] presented several useful relations between Bessel and generalized hypergeometric functions that generalize some earlier results. Here, by simply splitting Srivastava's hypergeometric function $H_B$ into eight parts, we show how some useful and generalized relations between Srivastava's hypergeometric functions $H_B$ and $F^{(3)}$ can be obtained. These main results are shown to be specialized to yield certain relations between functions $_0F_1$, $_1F_1$, $_0F_3$, ${\Psi}_2$, and their products including different combinations with different values of parameters and signs of variables. We also consider some other interesting relations between the Humbert ${\Psi}_2$ function and $Kamp\acute{e}$ de $F\acute{e}riet$ function, and between the product of exponential and Bessel functions with $Kamp\acute{e}$ de $F\acute{e}riet$ functions.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.835-855
• /
• 2021

With the recent increase in data disclosure, the Comprehensive Knowledge Archive Network (CKAN), which is an open-source data distribution platform, is drawing much attention. CKAN is used together with additional extensions, such as Datastore and Datapusher for data management and Harvest and DCAT for data collection. This study derives the problems of CKAN itself and Harvest Extension. First, CKAN causes two problems of data inconsistency and storage space waste for data deletion. Second, Harvest Extension causes three additional problems, namely source deletion that deletes only sources without deleting data themselves, job stop that cannot delete job during data collection, and service interruption that cannot provide service, even if data exist. Based on these observations, we propose herein an improved CKAN that provides a new deletion function solving data inconsistency and storage space waste problems. In addition, we present an improved Harvest Extension solving three problems of the legacy Harvest Extension. We verify the correctness and the usefulness of the improved CKAN and Harvest Extension functions through actual implementation and extensive experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.617-636
• /
• 2021

This paper presents a privacy-preserving data aggregation scheme deals with the multidimensional data. It is essential that the multidimensional data is rarely mentioned in all researches on smart grid. We use the Paillier Cryptosystem and blinding factor technique to encrypt the multidimensional data as a whole and take advantage of the homomorphic property of the Paillier Cryptosystem to achieve data aggregation. Signature and efficient batch verification have also been applied into our scheme for data integrity and quick verification. And the efficient batch verification only requires 2 pairing operations. Our scheme also supports fault tolerance which means that even some smart meters don't work, our scheme can still work well. In addition, we give two extensions of our scheme. One is that our scheme can be used to compute a fixed user's time-of-use electricity bill. The other is that our scheme is able to effectively and quickly deal with the dynamic user situation. In security analysis, we prove the detailed unforgeability and security of batch verification, and briefly introduce other security features. Performance analysis shows that our scheme has lower computational complexity and communication overhead than existing schemes.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1333-1354
• /
• 2019

In authors' paper in 2007, it was shown that the BSE-extension of $C^1_0(R)$, the algebra of continuously differentiable functions f on the real number space R such that f and df /dx vanish at infinity, is the Lipschitz algebra $Lip_1(R)$. This paper extends this result to the case of $C^n_0(R^d)$ and $C^{n-1,1}_b(R^d)$, where n and d represent arbitrary natural numbers. Here $C^n_0(R^d)$ is the space of all n-times continuously differentiable functions f on $R^d$ whose k-times derivatives are vanishing at infinity for k = 0, ${\cdots}$, n, and $C^{n-1,1}_b(R^d)$ is the space of all (n - 1)-times continuously differentiable functions on $R^d$ whose k-times derivatives are bounded for k = 0, ${\cdots}$, n - 1, and (n - 1)-times derivatives are Lipschitz. As a byproduct of our investigation we obtain an important result that $C^{n-1,1}_b(R^d)$ has a predual.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.411-424
• /
• 2021

Inference following two-stage adaptive designs (also known as two-stage randomization designs) with survival endpoints usually focuses on estimating and comparing survival distributions for the different treatment strategies. The aim is to identify the treatment strategy(ies) that leads to better survival of the patients. The objectives of this study were to assess the performance three commonly cited methods for estimating survival distributions in two-stage randomization designs. We review three non-parametric methods for estimating survival distributions in two-stage adaptive designs and compare their performance using simulation studies. The simulation studies show that the method based on the marginal mean model is badly affected by high censoring rates and response rate. The other two methods which are natural extensions of the Nelson-Aalen estimator and the Kaplan-Meier estimator have similar performance. These two methods yield survival estimates which have less bias and more precise than the marginal mean model even in cases of small sample sizes. The weighted versions of the Nelson-Aalen and the Kaplan-Meier estimators are less affected by high censoring rates and low response rates. The bias of the method based on the marginal mean model increases rapidly with increase in censoring rate compared to the other two methods. We apply the three methods to a leukemia clinical trial dataset and also compare the results.