• Journal of Convergence for Information Technology
• /
• v.10 no.10
• /
• pp.65-70
• /
• 2020

With the appearance of Bitcoin that builds peer-to-peer networks for transaction of digital content and issuance of cryptocurrency, lots of blockchain networks have been developed to improve transaction performance. Recently, Joseph Lubin discussed Decentralization Transaction per Second (DTPS) against alleviating the value of biased TPS. However, this Lubin's trust model did not enough consider a security issue in scalability trilemma. Accordingly, we proposed a trust metric based on blockchain size, stale block rate, and average block size, using a sigmoid function and convex optimization. Via numerical analysis, we presented the optimal blockchain size of popular blockchain networks and then compared the proposed trust metric with the Lubin's trust model. Besides, Bitcoin based blockchain networks such as Litecoin were superior to Ethereum for trust satisfaction and data volume.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.108-117
• /
• 2015

If typical contrast enhancement algorithms for natural images are applied to X-ray images, they may cause artifacts such as overshooting or produce unnatural visual quality because they do not consider inherent characteristics of X-ray images. In order to overcome such problems, we propose a locally adaptive block-based contrast enhancement algorithm for X-ray images. After we derive a weighted cumulative distribution function for each block, we apply it to each block for contrast enhancement. Then, we obtain images that are removed from block effect by adopting block-based overlapping. In post-processing, we obtain the final image by emphasizing high frequency components. Experimental results show that the proposed block-based contrast enhancement algorithm provides at maximum 5-times higher visual quality than the exiting algorithm in terms of quantitative contrast metric.

• Journal of the Korea Convergence Society
• /
• v.8 no.10
• /
• pp.45-52
• /
• 2017

Drifter is an equipment for observing the characteristics of seawater in the ocean, and it can be used to predict effluent oil diffusion and to observe ocean currents. In this paper, we design models or the prediction of drifter trajectory using machine learning. We propose methods for estimating the trajectory of drifter using support vector regression, radial basis function network, Gaussian process, multilayer perceptron, and recurrent neural network. When the propose mothods were compared with the existing MOHID numerical model, performance was improve on three of the four cases. In particular, LSTM, the best performed method, showed the imporvement by 47.59% Future work will improve the accuracy by weighting using bagging and boosting.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.53-62
• /
• 2010

This paper introduces a classification algorithm which can be applied to a learning problem with incomplete data sets, missing variable values or a class value. This algorithm uses a data expansion method which utilizes weighted values and probability techniques. It operates by extending a classifier which are considered to be in the optimal projection plane based on Fisher's formula. To do this, some equations are derived from the procedure to be applied to the data expansion. To evaluate the performance of the proposed algorithm, results of different measurements are iteratively compared by choosing one variable in the data set and then modifying the rate of missing and non-missing values in this selected variable. And objective evaluation of data sets can be achieved by comparing, the result of a data set with non-missing variable with that of C4.5 which is a known knowledge acquisition tool in machine learning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• Journal of the Korea Institute of Building Construction
• /
• v.14 no.6
• /
• pp.515-522
• /
• 2014

In order to quantitatively evaluate the effect of fly ash (FA) as partial replacement of cement on the life-cycle environmental impact of concrete, a comprehensive database including 4023 laboratory mixes and 2120 plant mixes was analyzed. The environmental loads on the life-cycle assessment were quantitatively converted into environmental impact indicators through categorization, characterization, normalization and weighting process. The life-cycle environmental impacts of concrete could be classified into three categories including global warming, photochemical oxidant creation and abiotic resource depletion. Furthermore, these environmental impacts of concrete was decreased with the increase of the replacement level of FA and governed by the unit content of ordinary portland cement (OPC). As a result, simple equations to assess the environmental impact indicators could be formulated as a function of the unit content of binder and the replacement level of FA.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.87-96
• /
• 2005

In this paper, a mesh simplification algorithm using face constriction is proposed which considers the conservation of the volume of a 3D model. The face constriction method replaces three vertices of the candidate triangle with a new vertex, removing four faces at once. We propose a modified method, compensating an existing method, of considering curvature in the decision of the removing order of triangles. We also propose a method of determining a new vertex replacing the candidate triangle, which reflects curvature difference of the three surrounding areas of the three vertices of the triangle, while conserving the volume. It is shown by simulation that the proposed method conserves the volume and shows good constriction performance comparable to the other methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.171-180
• /
• 2013

Generally, when we apply zernike moments value for matching, we can use those moments value obtained from projecting image information under circumscribed circle to zernike basis function. However, the problem is that the power of discrimination can be reduced because hand images include lots of overlapped information due to its special characteristic. On the other hand, when distinguishing hand poses, information in specific area of image information except for overlapped information can increase the power of discrimination. In this paper, in order to solve problems like those, we design R3 ring mask by combining image obtained from R2 ring mask, which can weight information of the power of discrimination and image obtained from R1 ring mask, which eliminate the overlapped information. The moments which are obtained by R3 ring mask decrease operational time by reducing dimension through principle component analysis. In order to confirm the superiority of the suggested method, we conducted some experiments by comparing our method to other method using seven different hand poses.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.4
• /
• pp.21-27
• /
• 2018

In this paper, we propose a real-time interaction method using user's mouth wind in mobile device. In mobile and virtual reality, user interaction technology is important, but various user interface methods is still lacking. Most of the interaction technologies are hand touch screen touch or motion recognition. In this study, we propose an interface technology that can interact with real time using user's mouth wind. The direction of the wind is determined by using the angle and the position between the user and the mobile device, and the size of the wind is calculated by using the magnitude of user's mouth wind. To show the superiority of the proposed technique, we show the result of visualizing the flow of the vector field in real time by integrating the mouth-wind interface into the Navier-Stokes equations. We show the results of the paper on mobile devices, but can be applied in the Agumented reality(AR) and Virtual reality(VR) fields requiring interface technology.

• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.901-906
• /
• 2009

This paper proposes a call admission control(CAC) method for wireless networks, which is based on the upper bound of a possibility distribution of handoff calls dropping rates. The possibility distribution is estimated in a fuzzy inference and a learning algorithm in neural network. The learning algorithm is considered for tuning the membership functions(then parts)of fuzzy rules for the inference. The fuzzy inference method is based on a weighted average of fuzzy sets. The proposed method can avoid estimating excessively large handoff calls dropping rates, and makes possibile self-compensation in real time for the case where the estimated values are smaller than real values. So this method makes secure CAC, thereby guaranteeing the allowed CDR. From simulation studies we show that the estimation performance for the upper bound of call dropping rate is good, and then handoff call dropping rates in CAC are able to be sustained below user's desired value.