• Composites Research
• /
• v.37 no.3
• /
• pp.226-231
• /
• 2024

Coal ash has been used as a sand replacement in the construction industry. Due to the use of bituminous coal as a result of anthracite depletion, and quicklime as an air purifier in the desulfurization process, pop-out defects have recently occurred in concrete using coal ash, severely limiting the recycling of coal ash into concrete. In this study, the components that cause the pop-out problem of the coal ash filled concrete were identified and a pretreatment method to fully expand the expansive components in advance was proposed as a solution to this problem. By treating water twice for 10 min, allowing the CaO mixed in the coal ash to fully expand, the problems of pop-out and reduced compressive strength of the concrete were overcome. The cost and time efficient water treatment method proposed in this study is expected to promote the recycling of coal ash into concrete.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1189-1193
• /
• 2010

Mobility management is one of the most important research issues in 6LoWPAN, Since the IP-WSN application domain is expanded to real-time applications such as healthcare and surveillance systems, a fast and seamless handover becomes an important criterion in 6LoWPAN. However, a draft of IETF 6LoWPAN WG for mobility support does not decrease handover delay. Although LoWMob supports a fast intra-PAN handover. it can be supported when the infrastructure node has the location information of the other nodes in the mobile node's moving direction. In this paper, we propose a fast and seamless mobility protocol to support intra-PAN handover, named intra-MARIO. In intra-MARIO, a parent node of the mobile node preconfigures its handover to the PAN when the parent node detects its movement, thereby reducing the handover delay. Since intra-MARIO also supports route optimization, the mobile node can communicate with its corresponding nodes through the optimal route. In this paper, we analysis the signaling cost and evaluates that the handover can be completed in 20ms by simulation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.2
• /
• pp.153-163
• /
• 2010

In this paper a frequency response analysis using Krylov subspace-based model reduction and its design sensitivity analysis with respect to design variables are presented. Since the frequency response and its design sensitivity information are necessary for a gradient-based optimization, problems of high computational cost and resource may occur in the case that frequency response of a large sized finite element model is involved in the optimization iterations. In the suggested method model order reduction of finite element models are used to calculate both frequency response and frequency response sensitivity, therefore one can maximize the speed of numerical computation for the frequency response and its design sensitivity. As numerical examples, a semi-monocoque shell and an array-type $4{\times}4$ MEMS resonator are adopted to show the accuracy and efficiency of the suggested approach in calculating the FRF and its design sensitivity. The frequency response sensitivity through the model reduction shows a great time reduction in numerical computation and a good agreement with that from the initial full finite element model.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.97-104
• /
• 2016

Because of rapid growth of data size, the number of data storage has been increased. When using multiple data storages, a distribute file system is essential to insure the availability of data files. The power consumption is a major problem when using a distributed file system with many data storages. Previous works have aimed at reducing the energy consumption with efficient file block layout by changing some data servers into stand-by mode. The file block migration has not been seriously considered because migration causes large cost. But when we consider addition of a new data server or file, file block migration is needed. This paper formulates the minimization of data block migration as an ILP optimization problem and solves it using branch-and-bound method. Using this technique, we can maximize the number of stand-by data servers with the minimum number of file block movement. However, computation time of branch-and-bound method of an ILP optimization problem increases exponentially as the problem size grows. Therefore this paper also proposes a data block and data server grouping method to solve many small ILP problems.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 1995.12a
• /
• pp.9-21
• /
• 1995

A planning support system enhances our ability to use water capacity expansion as an urban growth management strategy. This paper reports the development of capacity expansion modeling of water supply as part of the continuing development of such a planning support system (PEGASUS: Planning Environment for Generation and Analysis of Spatial Urban Systems) to incorporate water supply, This system is designed from the understanding that land use and development drive the demand for infrastructure and infrastructure can have a significant influence on the ways in which land is developed and used. Capacity expansion Problems of water supply can be solved in two ways: 1) optimal control theory, and 2) mixed integer nonlinear programming (MINLP). Each method has its strengths and weaknesses. In this study the MINLP approach is used because of its strength of determining expansion sizing and timing simultaneously. A dynamic network optimization model and a water-distribution network analysis model can address the dynamic interdependence between water planning and land use planning. While the water-distribution network analysis model evaluates the performance of generated networks over time, the dynamic optimization model chooses alternatives to meet expanding water needs. In addition, the user and capacity expansion modeling-to-generate-alternatives (MGA) can generate alternatives. A cost benefit analysis module using a normalization technique helps in choosing the most economical among those alternatives. GIS provide a tool for estimating the volume of demanded water and showing results of the capacity expansion model.

• Korean Journal of Clinical Laboratory Science
• /
• v.56 no.2
• /
• pp.147-155
• /
• 2024

Gallium-68-prostate-specific membrane antigen-11 (⁶⁸Ga-PSMA-11) is a positron emission tomography radiopharmaceutical that labels a Glu-urea-Lys-based ligand with ⁶⁸Ga, binding specifically to the PSMA. It is used widely for imaging recurrent prostate cancer and metastases. On the other hand, the preparation and quality control testing of ⁶⁸Ga-PSMA-11 in medical institutions takes over 60 minutes, limiting the daily capacity of ⁶⁸Ge/⁶⁸Ga generators. While the generator provides 1,110 MBq (30 mCi) nominally, its activity decreases over time, and the labeling yield declines irregularly. Consequently, additional preparations are needed, increasing radiation exposure for medical technicians, prolonging patient wait times, and necessitating production schedule adjustments. This study aimed to reduce the ⁶⁸Ga-PSMA-11 preparation time and optimize the automated synthesis system. By shortening the reaction time between ⁶⁸Ga and the PSMA-11 precursor and adjusting the number of purification steps, a faster and more cost-effective method was tested while maintaining quality. The final synthesis time was reduced from 30 to 20 minutes, meeting the standards for the HEPES content, residual solvent EtOH content, and radiochemical purity. This optimized procedure minimizes radiation exposure for medical technicians, reduces patient wait times, and maintains consistent production schedules, making it suitable for clinical application.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.135-146
• /
• 2004

For improving the effectiveness of travel information, some rational paths are needed to provide them to users driving in real road network. To meet it, k-shortest path algorithms have been used in general. Although the k-shortest path algorithm can provide several alternative paths, it has inherent limit of heavy overlapping among derived paths, which nay lead to incorrect travel information to the users. In case of considering the network consisting of several turn prohibitions popularly adopted in real world network, it makes difficult for the traditional network optimization technique to deal with. Banned and penalized turns are not described appropriately for in the standard node/link method of network definition with intersections represented by nodes only. Such problem could be solved by expansion technique adding extra links and nodes to the network for describing turn penalties, but this method could not apply to large networks as well as dynamic case due to its overwhelming additional works. This paper proposes a link-based shortest path algorithm for the travel information in real road network where exists turn prohibitions. It enables to provide efficient alternative paths under consideration of overlaps among paths. The algorithm builds each path based on the degree of overlapping between each path and stops building new path when the degree of overlapping ratio exceeds its criterion. Because proposed algorithm builds the shortest path based on the link-end cost instead or node cost and constructs path between origin and destination by link connection, the network expansion does not require. Thus it is possible to save the time or network modification and of computer running. Some numerical examples are used for test of the model proposed in the paper.

• Journal of the Korea Organic Resources Recycling Association
• /
• v.23 no.2
• /
• pp.47-52
• /
• 2015

A microbial fuel cell (MFC) is a device that can be obtained electricity from a variety of organic through the catalytic reaction of the microorganism. The MFC can be applied to various fields, and research is required to promote the performance of the microbial fuel cell for commercialization. The lower performance of an MFC is due to oxygen reduction at the cathode and the longer time of microbial degradation at anode. The MFC amount of power is sufficient but, in consideration of many factors, as a renewable energy, now commonly power density as compared to Nafion117 it is an ion exchange membrane used is PP (Poly Propylene) from 80 to about 11 fold higher, while reducing the cost to process wastewater is changed to a microporous non-woven fabric of a low cost, it may be energy-friendly environment to generate electricity. All waste, in that it can act as a bait for microorganisms, sustainability of the microbial fuel cell is limitless. The latest research on the optimization and performance of the operating parameters are surveyed and through the SSaM-GG(Smart, Shared, and Mutual- Green Growth) or GG-SSaM(Green Growth - Smart, Shared, and Mutual) as the concept of sustainable development in MFC, the middle indices are developed in this study.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.15-30
• /
• 2000

The important considerations in the design of fiber-optic networks are reliability and survivability preparing against a failure. The SDH(Synchronous Digital Hierarchy), the international standard of optical transmission, offers several network reconfiguration methods that enable network to be automatically restored from failure. One of the methods is the SHR(Self Healing Ring), which is a ring topology system. Most network providers have constructed their backbone networks with SHR architecture since it can provide survivability economically. The network architecture has eventually evolved into a multi-ring network comprised of interconnected rings. This paper addresses multi-ring network design problems is to minimize ring-construction cost. This problem can be formulated with MIP(mixed integer programming) model. However, it is difficult to solve the model within reasonable computing time on a large scale network because the model is NP-complete. Furthermore, in practice we should consider the problem of routing demands on rings to minimize total cost. This routing problem involves multiplex bundling at the intermediate nodes. A family of heuristic algorithms is presented for this problem. These algorithms include gateway selection and routing of inter-ring demands as well as load balancing on single rings. The developed heuristic algorithms are applied to some network provider's regional and long-distance transmission networks. We show an example of ring design and compare it with another ring topology design. Finally, we analysis the effect bundling.