• Journal of Information Processing Systems
• /
• 제10권3호
• /
• pp.395-411
• /
• 2014

Temporal medical data is often collected during patient treatments that require personal analysis. Each observation recorded in the temporal medical data is associated with measurements and time treatments. A major problem in the analysis of temporal medical data are the missing values that are caused, for example, by patients dropping out of a study before completion. Therefore, the imputation of missing data is an important step during pre-processing and can provide useful information before the data is mined. For each patient and each variable, this imputation replaces the missing data with a value drawn from an estimated distribution of that variable. In this paper, we propose a new method, called Newton's finite divided difference polynomial interpolation with condition order degree, for dealing with missing values in temporal medical data related to obesity. We compared the new imputation method with three existing subspace estimation techniques, including the k-nearest neighbor, local least squares, and natural cubic spline approaches. The performance of each approach was then evaluated by using the normalized root mean square error and the statistically significant test results. The experimental results have demonstrated that the proposed method provides the best fit with the smallest error and is more accurate than the other methods.

• Journal of Internet Computing and Services
• /
• 제3권2호
• /
• pp.39-56
• /
• 2002

In distributed computing environments, there are many database applications that should share data each other such as data warehousing and data mining with autonomy on local databases. The first step to such applications is the integration of heterogeneous database schema, but there is no accepted common data model for the integration and also are difficulties on the construction of integration program. In this paper, we use the XML Schema for the representation of common data model and exploit XSLT for reducing the programming difficulties. We define the schema integration operations and develop a methodology for the semi-automatic schema integration according to schema conflicts types. Our integration method has benefits on standardization, extendibility on schema integration process comparing to existing methodologies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제12권10호
• /
• pp.1815-1821
• /
• 2008

Recently, Since growth of the ubiquitous computing environment and development of networking technology, User is a possible to connect the Internet out of constraints of time and space. Using RFID of core technique of ubiquitous computing, various application cases are increasing rapidly. In this paper, we propose design of the User-Centered Document Generation System which can makes several format of documents using RFID information stored in relational database. Our system can makes HTML file, EXCEL file and XML document file that provide for users over internet. Also, whenever user need to the document that can save easy and conveniently them on local computer and then is a possible to exploit them for other works.

• Journal of Astronomy and Space Sciences
• /
• 제38권1호
• /
• pp.55-63
• /
• 2021

The universe is well known to be consists of dark energy, dark matter and the standard model (SM) particles. The dark matter dominates the density of matter in the universe. The dark matter is thought to be linked with dark photon which are hypothetical hidden sector particles similar to photons in electromagnetism but potentially proposed as force carriers. Due to the extremely small cross-section of dark matter, a large amount of data is needed to be processed. Therefore, we need to optimize the central processing unit (CPU) time. In this work, using MadGraph5 as a simulation tool kit, we examined the CPU time, and cross-section of dark matter at the electron-positron collider considering three parameters including the center of mass energy, dark photon mass, and coupling constant. The signal process pertained to a dark photon, which couples only to heavy leptons. We only dealt with the case of dark photon decaying into two muons. We used the simplified model which covers dark matter particles and dark photon particles as well as the SM particles. To compare the CPU time of simulation, one or more cores of the KISTI-5 supercomputer of Nurion Knights Landing and Skylake and a local Linux machine were used. Our results can help optimize high-energy physics software through high-performance computing and enable the users to incorporate parallel processing.

• International Journal of Computer Science & Network Security
• /
• 제24권4호
• /
• pp.11-25
• /
• 2024

The proliferation of IoT devices has presented an unprecedented challenge in managing device identities securely and efficiently. In this paper, we introduce an innovative Hybrid Blockchain-Based Approach for IoT Identity Management that prioritizes both security and efficiency. Our hybrid solution, strategically combines the advantages of direct and indirect connections, yielding exceptional performance. This approach delivers reduced latency, optimized network utilization, and energy efficiency by leveraging local cluster interactions for routine tasks while resorting to indirect blockchain connections for critical processes. This paper presents a comprehensive solution to the complex challenges associated with IoT identity management. Our Hybrid Blockchain-Based Approach sets a new benchmark for secure and efficient identity management within IoT ecosystems, arising from the synergy between direct and indirect connections. This serves as a foundational framework for future endeavors, including optimization strategies, scalability enhancements, and the integration of advanced encryption methodologies. In conclusion, this paper underscores the importance of tailored strategies in shaping the future of IoT identity management through innovative blockchain integration.

• Nuclear Engineering and Technology
• /
• 제56권7호
• /
• pp.2498-2515
• /
• 2024

In this study, we propose a fully parallelized adaptive particle refinement (APR) algorithm for smoothed particle hydrodynamics (SPH) to construct a stable and efficient multi-resolution computing system for nuclear safety analysis. The APR technique, widely employed by SPH research groups to adjust local particle resolutions, currently operates on a serialized algorithm. However, this serialized approach diminishes the computational efficiency of the system, negating the advantages of acceleration achieved through high-performance computing devices. To address this drawback, we propose a fully parallelized APR algorithm designed to enhance both efficiency and computational accuracy, facilitated by a new adaptive smoothing length model. For model validation, we simulated both hydrostatic and hydrodynamic benchmark cases in 2D and 3D environments. The results demonstrate improved computational efficiency compared to the conventional SPH method and APR with a serialized algorithm, and the model's accuracy was confirmed, revealing favorable outcomes near the resolution interface. Through the analysis of jet breakup, we verified the performance and accuracy of the model, emphasizing its applicability in practical nuclear safety analysis.

• KIISE Transactions on Computing Practices
• /
• 제20권11호
• /
• pp.573-578
• /
• 2014

In this letter, we propose a noise reduction method for use in magnetic resonance images that is based on non-local mean and guided image filters. Our method consists of two phases. In the first phase, the guidance image is obtained from a noisy image by using an adaptive non-local mean filter. The spread of the kernel is adaptively by controlled by implementing the concept of edgeness. In the second phase, the noisy images and the guidance images are provided to the guided image filter as input in order to produce a noise-free image. The improved performance of the proposed method is investigated by conducting experiments on standard datasets that contain magnetic resonance images. The results show that the proposed scheme is superior over the existing approaches.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2325-2330
• /
• 2005

A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5522-5536
• /
• 2017

In this paper, a video based smoke detection method using dynamic texture feature extraction with volume local binary patterns is studied. Block based method was used to distinguish smoke frames in high definition videos obtained by experiments firstly. Then we propose a method that directly extracts dynamic texture features based on irregular motion regions to reduce adverse impacts of block size and motion area ratio threshold. Several general volume local binary patterns were used to extract dynamic texture, including LBPTOP, VLBP, CLBPTOP and CVLBP, to study the effect of the number of sample points, frame interval and modes of the operator on smoke detection. Support vector machine was used as the classifier for dynamic texture features. The results show that dynamic texture is a reliable clue for video based smoke detection. It is generally conducive to reducing the false alarm rate by increasing the dimension of the feature vector. However, it does not always contribute to the improvement of the detection rate. Additionally, it is found that the feature computing time is not directly related to the vector dimension in our experiments, which is important for the realization of real-time detection.

• Steel and Composite Structures
• /
• 제33권1호
• /
• pp.37-66
• /
• 2019

In cold-formed steel structures, such as trusses, wall frames and portal frames, the use of back-to-back built-up cold-formed stainless-steel lipped channels as compression members are becoming increasingly popular. The advantages of using stainless-steel as structural members are corrosion resistance and durability, compared with carbon steel. The AISI/ASCE Standard, SEI/ASCE-8-02 and AS/NZS do not include the design of stainless-steel built-up channels and very few experimental tests or finite element analyses have been reported in the literature for such back-to back cold-formed stainless-steel channels. Current guidance by the American Iron and Steel Institute (AISI) and the Australian and New Zealand (gAS/NZS) standards for built-up carbon steel sections only describe a modified slenderness approach, to consider the spacing of the intermediate fasteners. Thus, this paper presents a numerical investigation on the behavior of back-to-back cold-formed stainless-steel built-up lipped channels. Three different grades of stainless steel i.e., duplex EN1.4462, ferritic EN1.4003 and austenitic EN1.4404 have been considered. Effect of screw spacing on the axial strength of such built-up channels was investigated. As expected, most of the short and intermediate columns failed by either local-global or local-distortional buckling interactions, whereas the long columns, failed by global buckling. All three grades of stainless-steel stub columns failed by local buckling. A comprehensive parametric study was then carried out covering a wide range of slenderness and different cross-sectional geometries to assess the performance of the current design guidelines by AISI and AS/NZS. In total, 647 finite element models were analyzed. From the results of the parametric study, it was found that the AISI & AS/NZS are conservative by around 10 to 20% for cold-formed stainless-steel built-up lipped channels failed through overall buckling, irrespective of the stainless-steel grades. However, the AISI and AS/NZS can be un-conservative by around 6% for all three grades of stainless-steel built-up channels, which failed by local buckling.