• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.8
• /
• pp.681-693
• /
• 2020

This study sees a critical gap in the previous body of research, which it seeks to fill; the disclosure of the unemployment ratio correlation has only been measured by the level of economic growth. This study is to add investment variables and government expenditure variables that objectively aim to measure the level of effectiveness in handling the unemployment ratio, which is then a measurement of the effectiveness of unemployment. Economic growth is measured by its impact on income inequality through empirical, conceptual relationships as a critical review and economic strategy for the future. The research uses secondary data on Indonesian macro and microeconomics since 2003-2018, then testing uses a quantitative approach to correlation, regression, and scatterplot. The results of this study show correlations between variables, and volatiles on the graphs show a similar trend. In other words, variables are bound together and support each other. The strategy of prioritizing the scale of government expenditure and investment to reach the target is the primary concern, so that the economic cycle can be optimal and equipped to face the possibility of an economic recession in the future. Many factors cause complex income inequality, though investment does not show a correlation to income inequality.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.582-591
• /
• 2009

The pyramid graph is an interconnection network topology based on regular square mesh and tree structures. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square mesh as a base sub-graph constituting of each layer in the pyramid graph. Edge set in the mesh can be divided into two disjoint sub-sets called as NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or shared in the upper layer of pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges in the original graph within the shrunk super-vertex on the resulting graph. In this paper, we analyze that the lower and upper bound on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n\times2^n$ mesh is $2^{2n-2}$ and $3*(2^{2n-2}-2^{n-1})$ respectively. By expanding this result into the pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}-3*2^{n-1}$-2n+7 in the n-dimensional pyramid.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.51-61
• /
• 2012

This paper suggests an algorithm that obtains Directed Graph Minimum Spanning Tree (DMST), using Prim MST algorithm which is Minimum Spanning Tree (MST) of undirected graph. At first, I suggested the Prim DMST algorithm that chooses Minimum Weight Arc(MWA) from out-going nodes from each node, considering differences between undirected graph and directed graph. Next, I proved a disadvantage of Prim DMST algorithm and Chu-Liu/Edmonds DMST (typical representative DMST) of not being able to find DMST, applying them to 3 real graphs. Last, as an algorithm that can always find DMST, an advanced Prim DMST is suggested. The Prim DMST algorithm uses a method of choosing MWA among out-going arcs of each node. On the other hand, the advanced Prim DMST algorithm uses a method of choosing a coinciding arc from the out-going and in-going arcs of each node. And if there is no coinciding arc, it chooses MWA from the out-going arcs from each node. Applying the suggested algorithm to 17 different graphs, it succeeded in finding the same DMST as that found by Chu-Liu/Edmonds DMST algorithm. Also, it does not require such a complicated calculation as that of Chu-Liu/Edmonds DMST algorithm to delete the cycle, and it takes less time for process than Prim DMST algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.1
• /
• pp.9-18
• /
• 2006

This paper describes a new program called GPS_QC needed to check the quality of GPS observations before post-processing so that the surveyors can be improved the precision of GPS data analysis. The GPS_QC was designed to calculate the quality control (QC) parameters such as data gaps, cycle slips, low elevation angle, inonspheric delay, multi-path effects and DOP etc, within the period of GPS observation. It can be used to read and calculate the QC parameters from RINEX files. This program gives users brief statistics, time series plots and graphs of QC parameters. The GPS_QC can simply be performed the quality checking of GPS data that was difficult for surveyors in the field. It is expected that we can be improved the precision of positioning and solved the time consuming problem of GPS observation.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.131-140
• /
• 2014

In this paper, we present an efficient implementation of Kruskal's algorithm to obtain a minimum spanning tree. The proposed method utilizes the union-find data structure, reducing the depth of the tree of the node set by making the nodes in the path to root be the child node of the root of combined tree. This method can reduce the depth of the tree by shortening the path to the root and lowering the level of the node. This is an efficient method because if the tree's depth reduces, it could shorten the time of finding the root of the tree to which the node belongs. The performance of the proposed method is evaluated through the graphs generated randomly. The results showed that the proposed method outperformed the conventional method in terms of the depth of the tree.

• Journal of the Korean earth science society
• /
• v.25 no.8
• /
• pp.647-655
• /
• 2004

PISA (Program for International Student Assessment) 2003, the second cycle of PISA, collected data with respect to students' cross-disciplinary problem solving capabilities. Problem solving is defined as the ability to use cognitive processes to solve real cross-disciplinary problems. For the purpose of PISA 2003 assessment, three problem types were chosen: Decision Making, System Analysis and Design, and Trouble Shooting. For this paper a preliminary analysis on Korean students' responses to the PISA 2003 problem-solving items was conducted. The quantitative analysis mainly focused on the difficulties of the PISA 2003 items, while the quantitative analysis dealt with students' responses to open-ended items, which helped understand Korean students' cognitive style and reasoning processes. According to the item analysis result, Korean students had difficulty in representing their answers with pictures or graphs, and interpreting long and complex text. They also showed low achievement with relatively unfamiliar topics or tasks. The paper concluded with several suggestions on improve the quality of science education.

• Tribology and Lubricants
• /
• v.31 no.3
• /
• pp.125-140
• /
• 2015

In this paper, we present the results of the wear analysis of journal bearings on a stripped-down single-cylinder engine during start-up and coast-down by motoring. We calculate journal bearing wear by using a modified specific wear rate considering the fractional film defect coefficient and load-sharing ratio for the asperity portion of a mixed elastohydrodynamic lubrication (EHL) regime coupled with previously presented graphical data of experimental lifetime linear wear in radial journal bearings. Based on the calculated wear depth, we obtain a new oil film thickness for every crank angle. By examination of the oil film thickness, we determine whether the oil film thickness at the wear scar region is in a mixed lubrication regime by comparing dimensionless oil film thickness, h/σ, to 3.0 at every crank angle. We present the lift-off speed and the crank angles involved with the wear calculation for bearings #1 and #2. The dimensionless oil film thickness, h/σ, illustrates whether the lubrication region between the two surfaces is still within the bounds of the mixed lubrication regime after scarring of the surface by wear. In addition, we present in tables the asperity contact pressure, the real minimum film thickness at the wear scar region, the modified specific wear rate, and the wear angle, α, for bearings #1 & #2. To show the real shape of the oil film at wear scar region, we depict the actual oil film thickness in graphs. We also tabulated the ranges of bearing angles related with wear scar. We present the wear volume for bearings #1 and #2 after one turn-on and turn-off of the engine ignition switch for five kinds of equivalent surface roughness. We show that the accumulated wear volume after a single turn-on and turn-off of an ignition switch normally increases with increasing surface roughness, with a few exceptions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.181-187
• /
• 2020

In this paper, we proposed a register allocation algorithm and resource allocation algorithm in the high level synthesis process for the SoC design synthesis system of high performance vehicles We have analyzed to the operator characteristics and structure of datapath in the most important high-level synthesis. We also introduced the concept of virtual operator for the scheduling of multi-cycle operations. Thus, we demonstrated the complexity to implement a multi-cycle operation of the operator, regardless of the type of operation that can be applied for commonly use in the resources allocation algorithm. The algorithm assigns the functional operators so that the number of connecting signal lines which are repeatedly used between the operators would be minimum. This algorithm provides regional graphs with priority depending on connected structure when the registers are allocated. The registers with connecting structure are allocated to the maximum cluster which is generated by the minimum cluster partition algorithm. Also, it minimize the connecting structure by removing the duplicate inputs for the multiplexor in connecting structure and arranging the inputs for the multiplexor which is connected to the operators. In order to evaluate the scheduling performance of the described algorithm, we demonstrate the utility of the proposed algorithm by executing scheduling on the fifth digital wave filter, a standard bench mark model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.103-114
• /
• 2013

This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and Reverse-delete algorithms verify whether the cycle occurs within the edges of the graph. For this reason, they have problems of unnecessarily performing extra algorithms from the edges, even though they've already obtained the minimum spanning tree. This paper, first of all, suggests the 1st method which reduces the no. of performances by introducing stop point criteria of algorithm, but at the same time, performs algorithms from all the edges, just like how Kruskal and Reverse-delete algorithms. Next, it suggests the 2nd method which finds the minimum spanning tree from the remaining edges after getting rid of all the unnecessary edges which are considered not to affect the minimum spanning tree. These suggested methods have an effect of terminating algorithm at least 1.4 times and at most 3.86times than Kruskal and Reverse-delete algorithms, when applied to the real graphs. We have found that the 2nd method of the Reverse-delete algorithm has the fastest speed in terminating an algorithm, among 4 algorithms which are results of the 2 suggested methods being applied to 2 algorithms.

• Korean Chemical Engineering Research
• /
• v.57 no.6
• /
• pp.868-873
• /
• 2019

In this study, the evaluation of performance of AORFB using methyl viologen and TEMPOL as organic active materials in neutral supporting electrolyte (NaCl) with various membrane types was performed. Using methyl viologen and TEMPOL as active materials in neutral electrolyte solution, the cell voltage is 1.37V which is relatively high value for AORFB. Two types of membranes were examined for performance comparison. First, when using Nafion 117 membrane which is commercial cation exchange membrane, only the charge process occurred in the first cycle and the single cell couldn't work because of its high resistance. However, when using Fumasep anion exchange membrane (FAA-3-50) instead of Nafion 117 membrane, the result was obtained as the totally different charge-discharge graphs. When current density was $40mA{\cdot}cm^{-2}$ and cut off voltage range was from 0.55 V to 1.7 V, the charge efficiency (CE) was 97% and voltage efficiency (VE) was 78%. In addition, the discharge capacity was $1.44Ah{\cdot}L^{-1}$ which was 54% of theoretical capacity ($2.68Ah{\cdot}L^{-1}$) at $10^{th}$ cycle and the capacity loss rate was $0.0015Ah{\cdot}L^{-1}$ per cycle during 50 cycles. Through cyclic voltammetry test, it seems that this difference in the performance between the full cell using Nafion 117 membrane and Fumasep anion exchange membrane came from increasing resistance due to chemical reaction between membrane and active material, not the capacity loss due to cross-over of active material through membrane.