• Journal of Gifted/Talented Education
• /
• v.23 no.2
• /
• pp.289-310
• /
• 2013

The purpose of the study is to investigate science process skills and suggest several considerations about developing scientific inquiries for secondary science gifted students. To do this, we analyzed scientific inquiries of science gifted programs and evaluated them on the quantity of problem perception, problem finding and inquiry planning that are regarded as high level science process skills, then revised each inquiry to include those high level skills. The result was that the first, there were differences in frequencies and types of science process skills among those inquiries. The second, there were very few problem perception and problem finding and were not many inquiry planning. The third, some of the revised inquiries showed those high level skills. From this, we would like to suggest we should construct scientific inquiries of science gifted program out of many and various themes. And there should be more high level science process skills such as problem perception, problem finding, and inquiry planning. For this, scientific inquiry developers should have intentions to involve such science process skills which is appropriate for science gifted student.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.6
• /
• pp.62-66
• /
• 1982

A method finding out routability for unrouted signal lines and rerouting those which are turned out to be able to route in layout design of LSI is described. In this paper the problems of finding two-disjoint Paths represented by an undirected graph G=(V,E), where V,E are sets of vertices and edges respectively, are studied. The existence of two-disjoint paths from s1, to t1, (called P1) and from S2 to T2 (called P2) indicated by the four vertices on the graph s1, t1, s2, t2 $\in$ V means that two distinct signal lines exist in layout design. It turns out that the proposed time complexity in the algorithm is O (IVI x IEI).

• Journal of Elementary Mathematics Education in Korea
• /
• v.16 no.2
• /
• pp.269-293
• /
• 2012

This study is intended to figure out how the 6th grade students carry out newly added standards regard to the problem solving in the revised mathematics curriculum in 2007 and 2009, which are 'finding useless information in a given problem', 'finding insufficient information in a given problem', and 'posing new problem by changing conditions of the given problem.' In order to achieve this goal, we examined the characteristics of 200 elementary students' problem posing. We constructed and used the survey sheet which consisted of 6 items relevant to 'finding useless information in a given problem', 'finding insufficient information in a given problem', and 'posing new problem by changing conditions of the given problem.'

• Journal of Korean Society of Steel Construction
• /
• v.28 no.5
• /
• pp.337-344
• /
• 2016

In this study, a form-finding method of tensegrity systems by using the force density method combined with the stiffness matrix method was presented. Numerous studies have been made on form-finding methods of the tensegrity systems. However, these methods are limited in the tensegrity systems with multiple null space of the equilibrium matrix. The proposed method can uniquely define a single integral feasible set of force densities for the structures. In order to draw maximum natural frequency that can lead a maximum stiffness of the tensegrity systems, a constrained maximization problem is formulated in the genetic algorithm. Several numerical examples are presented to prove dfficiency in searching for self-equilibrium congifurations of tensegrity systems with multiple self-stress states. A good performance of the proposed method has been shown in the results.

• The Journal of the Society of Korean Medicine Diagnostics
• /
• v.9 no.1
• /
• pp.69-83
• /
• 2005

Background and purpose: The purpose of this study is to review the recent achievements on ryodoraku and suggest new ryodoraku studies. Methods: The study papers related with ryodoraku, published in foreign countries and Korea up to the present, were collected first by internet search & journal. And then the collected papers were classified and summarized. Results and Conclusion: There are three study trends. One is finding some effect and analysis for some symptoms, another is finding a distinguishing mark and a diagnostic index, and the other is raising several points & providing solution & studying about relativity with another diagnosis. Some studies finding some effect and analysis for some symptoms are to be classified into four items(1. effect of drugs medication. 2. effect of ryodoraku therapy. 3. effect of other treatments. 4. effect of other treatments with ryodoraku therapy). Other studies finding a distinguishing mark and a diagnostic index are to be classified into two items(1. diagnostic index of symptoms. 2. distinguishing mark of disease). The other studies are to be classified into three items(1. ryodoraku introduction and raising several points at issue. 2. improvement machinery and tools. 3. studying about relativity with another diagnosis). Finally we need solving the ryodoraku problems(the condition of measurement and reproducibility, relation with Kyung-rak(經絡) and Ryodoraku, the reason of Ryodoraku points producing and etc.).

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.289-294
• /
• 2015

The consensus problem is finding a representative string, called a consensus, of a given set S of k strings. Circular strings are different from linear strings in that the last symbol precedes the first symbol. Given a set S of circular strings of length n over an alphabet ${\Sigma}$, we first present an $O({\mid}{\Sigma}{\mid}nlogn)$ time parallel algorithm for finding a consensus of S minimizing both radius and distance sum when k=3 using O(n) threads. Then we present an $O({\mid}{\Sigma}{\mid}n^2logn)$ time parallel algorithm for finding a consensus of S minimizing distance sum when k=4 using O(n) threads. Finally, we compare execution times of our algorithms implemented using CUDA with corresponding sequential algorithms.

• The Korean Journal of Nuclear Medicine
• /
• v.22 no.1
• /
• pp.47-53
• /
• 1988

Budd-Chiari syndrome (BCS) is a rare clinical entity characterized by post-sinusoidal portal hypertension caused by the obstruction to the hepatic vein outflow The diagnosis is suggested by hepatic scintigraphy and is usually confirmed by hepatic venography, inferior vena cavography and biopsy. The scintigraphic finding of BCS caused by the obstruction of main hepatic vein has been reported to consist typically of hypertrophy of the caudate lobe with increased radionuclide accumulation. Such a typical finding has been accounted for by the fact that the venous outflow from the caudate lobe is preserved when the main hepatic vein is obstructed. But usually, the hepatic venous outflow from the caudate lobe is also obstructed in BCS due to inferior vena caval obstruction. So hepatic scintigraphic findings of BCS due to inferior vena caval obstruction show different findings as compared with the BCS due to hepatic vein obstruction. We evaluate the hepatic scintigrams of the 13 cases of BCS due to inferior vena caval obstruction and review the literatures. The results are as follows : 1) We cannot observe the caudate lobe hypertrophy with increased uptake, which is known as a classic finding in BCS due to hepatic vein obstruction. 2) The most prominent hepatic scintigraphic findings of BCS are nonhomogenous uptake in the liver with extrahepatic uptake in the all cases. 3) We can see cold areas at the superior aspect of right hepatic lobe in 7 cases (54%). This is a useful finding suggesting BCS due to inferior vena caval obstruction.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.760-766
• /
• 2017

Repetitive strings have been studied in diverse fields such as data compression, bioinformatics and so on. Recently, two problems of approximate periods of strings over integer alphabets were introduced, finding minimum ${\delta}-approximate$ periods and finding minimum ${\gamma}-approximate$ periods. Both problems can be solved in $O(n^2)$ time when n is the length of the string. In this paper, we present two parallel algorithms for solving the above two problems in O(n) time using $O(n^2)$ threads, respectively. The experimental results show that our parallel algorithms for finding minimum ${\delta}-approximate$ (resp. ${\gamma}-approximate$) periods run approximately 19.7 (resp. 40.08) times faster than the sequential algorithms when n = 10,000.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.405-410
• /
• 2009

This paper proposes an efficient path finding scheme capable of searching the paths to k static objects from a given query point, aiming at both improving the legacy k-nearest neighbor search and making it easily applicable to the road network environment. To the end of improving the speed of finding one-to-many paths, the modified A* obviates the duplicated part of node scans involved in the multiple executions of a one-to-one path finding algorithm. Additionally, the cost to the each object found in this step makes it possible to finalize the k objects according to the network distance from the candidate set as well as to order them by the path cost. Experiment results show that the proposed scheme has the accuracy of around 100% and improves the search speed by $1.3{\sim}3.0$ times of k-nearest neighbor searches, compared with INE, post-Dijkstra, and $na{\ddot{i}}ve$ method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2367-2372
• /
• 2009

Recently, Many studies have been progressing to path-finding adapted dynamic information on the Terminal Based Navigation System(TBNS). The algorithms proposed are based on $A^*$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost. Path-finding with an abstract graph which expresses real road network as a simple graph is proposed for reducing dependency of heuristic and exploring cost. In this paper, two abstract graph that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost and the number of node access but $AG^C$ has worse performance than AGH at exploring cost.