• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1990.10a
• /
• pp.34-39
• /
• 1990

For the analysis of structures, specifically if it is large-scale, in which case it can not be solved within the core memory, the majority of computation time is consumed In the solution of simultaneous linear equation. In this study an efficient in- and out-of-core column solver for sparse symmetric matrix utilizing memory moving scheme is developed. Compare with existing blocking methods the algorithm is simple, therefore the coding and computational efficiencies are greatly enhanced. Upon available memory size, the solver automatically performs solution within the core or outside core. Analysis example shows that the proposed method efficiently solve the large structural problem on the small-memory microcomputer.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1730-1738
• /
• 2008

Quality of Service (QoS) Guarantees grant ways for service providers to establish service differentiation among subscribers. On the other hand, service subscribers are also assured the level of service they paid for. In addition, the efficient level of service quality can be selected according to the subscribers' needs thus ensuring efficient use of available bandwidth. While network utility optimization techniques assure certain QoS metrics, a number of situations exist where some QoS goals are not met. The optimality of the network parameters is not mandatory to guarantee specified QoS levels. This paper proposes a joint data rate and power control scheme that guarantees service contract QoS level to a subscriber using Goal Programming. In using goal programming, this paper focuses on finding the range of feasible solutions as opposed to solving for the optimal. In addition, in case no feasible solution is found, an acceptable compromised solution is solved.

• Earthquakes and Structures
• /
• v.17 no.3
• /
• pp.329-336
• /
• 2019

An efficient shear deformation beam theory is developed for thermo-elastic vibration of FGM beams. The theory accounts for parabolic distribution of the transverse shear strains and satisfies the zero traction boundary conditions on the on the surfaces of the beam without using shear correction factors. The material properties of the FGM beam are assumed to be temperature dependent, and change gradually in the thickness direction. Three cases of temperature distribution in the form of uniformity, linearity, and nonlinearity are considered through the beam thickness. Based on the present refined beam theory, the equations of motion are derived from Hamilton's principle. The closed-form solutions of functionally graded beams are obtained using Navier solution. Numerical results are presented to investigate the effects of temperature distributions, material parameters, thermal moments and slenderness ratios on the natural frequencies. The accuracy of the present solutions is verified by comparing the obtained results with the existing solutions.

• Proceedings of the PSK Conference
• /
• 2002.10a
• /
• pp.341.2-341.2
• /
• 2002

An efficient process for the solution-phase synthesis of biaryl amides has been developed. Girard's reagent T. an inexpensive scanvenger. was found to be very efficient in trapping excess aromatic acid chlorides. resulting in water soluble by-products. which were easily removed from the products by liquid-liquid extraction. The ease of use. and the excellent purity of the amide libraries obtained are important features of this protocol. (omitted)

• Korean Journal of Computational Design and Engineering
• /
• v.16 no.3
• /
• pp.236-245
• /
• 2011

Many researchers have recently studied multi-level formulation strategies to solve the MDO problems and they basically distributed the coupling compatibilities across all disciplines, while single-level formulations concentrate all the controls at the system-level. In addition, approximation techniques became remedies for computationally expensive analyses and simulations. This paper studies comparisons of the MDO methods with respect to computing performance considering both conventional sequential and modem distributed/parallel processing environments. The comparisons show Individual Disciplinary Feasible (IDF) formulation is the most efficient for sequential processing and IDF with approximation (IDFa) is the most efficient for parallel processing. Results incorporating to popular design examples show this finding. The author suggests design engineers should firstly choose IDF formulation to solve MDO problems because of its simplicity of implementation and not-bad performance. A single drawback of IDF is requiring more memory for local design variables and coupling variables. Adding cheap memories can save engineers valuable time and effort for complicated multi-level formulations and let them free out of no solution headache of Multi-Disciplinary Analysis (MDA) of the Multi-Disciplinary Feasible (MDF) formulation.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.10
• /
• pp.3610-3613
• /
• 2011

CdS nanoparticles (NPs) were synthesized in an aqueous phase in order to investigate their spectral behaviors as efficient fluorescence resonance energy transfer (FRET) donors for various organic dye acceptors. Our prepared CdS NPs exhibiting strong and broad emission spectra between 480-520 nm were able to transfer energy in a wide wavelength region from green to red fluorescence dyes. Rhodamine 6G (Rh6G), rhodamine B (RhB), and sulforhodamine 101 acid (Texas red) were tested as acceptors of the energy transfer from the CdS NPs. The three dyes and synthesized CdS NPs exhibited good FRET behaviors as acceptors and donors, respectively. Energy transfers from the CdS NPs and organic Cy3 dye were compared to the same acceptor Texas red dye at different concentrations. Our prepared CdS NPs appeared to exhibit better FRET behaviors comparable to those of the Cy3 dye. These CdS NPs in an aqueous solution may be efficient FRET donors for various organic dyes in a wide wavelength range between green and red colors.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.212-218
• /
• 2021

Low-power and Lossy Networks (LLNs) have become the common network infrastructure for a wide scope of Internet of Things (IoT) applications. For efficient routing in LLNs, IETF provides a standard solution, namely the IPv6 Routing Protocol for LLNs (RPL). It enables effective interconnectivity with IP networks and flexibly can meet the different application requirements of IoT deployments. However, it still suffers from different open issues, particularly in large-scale setups. These include the node unreachability problem which leads to increasing routing losses at RPL sink nodes. It is a result of the event of memory overflow at LLNs devices due to their limited hardware capabilities. Although this can be alleviated by the establishment of multi-sink topologies, RPL still lacks the support for effective load balancing among multiple sinks. In this paper, we address the need for an efficient multi-sink load balancing solution to enhance the performance of PRL in large-scale scenarios and alleviate the node unreachability problem. We propose a new RPL objective function, Multi-Sink Load Balancing Objective Function (MSLBOF), and introduce the Memory Utilization metrics. MSLBOF enables each RPL node to perform optimal sink selection in a way that insure better memory utilization and effective load balancing. Evaluation results demonstrate the efficiency of MSLBOF in decreasing packet loss and enhancing network stability, compared to MRHOF in standard RPL.

• International Journal of Computer Science & Network Security
• /
• v.24 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.201-209
• /
• 2014

This paper proposes a genetic algorithm to maximize the connectivity among the mobile nodes for the cooperative communication in ad-hoc networks. In general, as the movement of the mobile nodes in the networks increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time for a high-density network, we propose a genetic algorithm to obtain the optimal solution for maximizing the connectivity. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the maximum number of connections and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.739-742
• /
• 2005

In this paper, an efficient detection algorithm for the flicker, which is caused by mismatching between light frequency and exposure time at CMOS image sensor (CIS), is proposed. The flicker detection can be implemented by specific hardware or complex signal processing logic. However it is difficult to implement on single chip image sensor, which has pixel, CDS, ADC, and ISP on a die, because of limited die area. Thus for the flicker detection, the simple algorithm and high accuracy should be achieved on single chip image sensor,. To satisfy these purposes, the proposed algorithm organizes only simple operation, which calculates the subtraction of horizontal luminance mean between continuous two frames. This algorithm was verified with MATLAB and Xilinx FPGA, and it is implemented with Magnachip 0.18 standard cell library. As a result, the accuracy is 95% in average on FPGA emulation and the consumed gate count is about 7,500 gates (@40MHz) for implementation using Magnachip 0.18 process.