• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.453-454
• /
• 2008

Modern VLSI designs get increasingly complex and time-to-market constraints get tighter. Using high level languages is one of the most promising solutions for improving design productivity by raising the level of abstraction. In high level synthesis process, most important step is scheduling. In this paper, we propose fast and efficient scheduling method under timing constraint based on list scheduling. Experimental results on well known data path intensive designs show fast execution times (less than 0.5 sec) and similar results when compared to optimal solutions [1].

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.2
• /
• pp.225-232
• /
• 2014

The traditional RAP (Redundancy Allocation Problem) of complex systems has considered only the redundancy of subsystem with homogeneous components. In this paper we extend it as a RAP of complex systems with heterogeneous components which is more flexible than the case of homogeneous components. We model this problem as a nonlinear integer programming problem, find its optimal solution by tabu search, and suggest an example of the efficient reliability design with heterogeneous components. In order to improve the quality of the solution of the tabu search, we suggest a modified tabu search to employ an adaptive procedure (1-opt or 2-opt exchange) to generate the efficient neighborhood solutions. Computational results show that our modified procedure obtains better solutions as the size of problem increases from 30 to 50, even though it requires rather more computing time. With some adjustment of the parameters of the proposed method, it can be applied to the optimal reliability designs of complex systems of ships.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1597-1608
• /
• 2016

Recently, a number of solutions were proposed to address the challenges and issues of vehicular networks. Vehicular Cloud Computing (VCC) is one of the solutions. The vehicular cloud computing is a new hybrid technology that has a remarkable impact on traffic management and road safety by instantly using vehicular resources. In this paper, we study an important vehicular cloud service, content-based delivery, that allows future vehicular cloud applications to store, share and search data totally within the cloud. We design a VCC-based system architecture for efficient sharing of vehicular contents, and propose a Hierarchical Hybrid Content Delivery scheme using Bloom Filter (H2CDBF) for efficient vehicular content delivery in Vehicular Ad-hoc Networks (VANETs). The performance of the proposed H2CDBF is evaluated through an analytical model, and is compared to the proactive content discovery scheme, Bloom-Filter Routing (BFR).

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.717-723
• /
• 2019

Smart systems and services aim to facilitate growing urban populations and their prospects of virtual-real social behaviors, gig economies, factory automation, knowledge-based workforce, integrated societies, modern living, among many more. To satisfy these objectives, smart systems and services must comprises of a complex set of features such as security, ease of use and user friendliness, manageability, scalability, adaptivity, intelligent behavior, and personalization. Recently, artificial intelligence (AI) is realized as a data-driven technology to provide an efficient knowledge representation, semantic modeling, and can support a cognitive behavior aspect of the system. In this paper, an integration of AI with the smart systems and services is presented to mitigate the existing challenges. Several novel researches work in terms of frameworks, architectures, paradigms, and algorithms are discussed to provide possible solutions against the existing challenges in the AI-based smart systems and services. Such novel research works involve efficient shape image retrieval, speech signal processing, dynamic thermal rating, advanced persistent threat tactics, user authentication, and so on.

• Steel and Composite Structures
• /
• v.13 no.1
• /
• pp.71-89
• /
• 2012

The paper investigates beam lateral buckling stability according to linear and non-linear models. Closed form solutions for single-symmetric cross sections are first derived according to a non-linear model considering flexural-torsional coupling and pre-buckling deformation effects. The closed form solutions are compared to a beam finite element developed in large torsion. Effects of pre-buckling deflection and gradient moment on beam stability are not well known in the literature. The strength of singly symmetric I-beams under gradient moments is particularly investigated. Beams with T and I cross-sections are considered in the study. It is concluded that pre-buckling deflections effects are important for I-section with large flanges and analytical solutions are possible. For beams with T-sections, lateral buckling resistance depends not only on pre-buckling deflection but also on cross section shape, load distribution and buckling modes. Effects of pre-buckling deflections are important only when the largest flange is under compressive stresses and positive gradient moments. For negative gradient moments, all available solutions fail and overestimate the beam strength. Numerical solutions are more powerful. Other load cases are investigated as the stability of continuous beams. Under arbitrary loads, all available solutions fail, and recourse to finite element simulation is more efficient.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.87-97
• /
• 2013

The purpose of this paper is to employ a new useful technique to solve the initial-Neumann boundary value problems for parabolic, hyperbolic and parabolic-hyperbolic equations and obtain a solution in form of infinite series. The results obtained indicate that this approach is indeed practical and efficient.

• East Asian mathematical journal
• /
• v.29 no.5
• /
• pp.503-510
• /
• 2013

A quadratic B-spline finite element method for the spatial variable combined with a Newton method for the time variable is proposed to approximate a solution of Benjamin-Bona-Mahony-Burgers (BBMB) equation. Two examples were considered to show the efficiency of the proposed scheme. The numerical solutions obtained for various viscosity were compared with the exact solutions. The numerical results show that the scheme is efficient and feasible.

• Communications of the Korean Mathematical Society
• /
• v.23 no.1
• /
• pp.141-151
• /
• 2008

In this paper, we derive the nonlinear equation for European option pricing containing liquidity risk which can be defined as the inverse of the partial derivative of the underlying asset price with respect to the amount of assets traded in the efficient market. Numerical solutions are obtained by using finite element method and compared with option prices of KOSPI200 Stock Index. These prices computed with liquidity risk are considered more realistic than the prices of Black-Scholes model without liquidity risk.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.545-553
• /
• 2009

String matching is a fundamental element of an important category of modern packet processing applications which involve scanning the content flowing through a network for thousands of strings at the line rate. To keep pace with high network speeds, specialized hardware-based solutions are needed which should be efficient enough to maintain scalability in terms of speed and the number of strings. In this paper, a novel architecture based upon a recently proposed data structure called the Bloomier filter is proposed which can successfully support scalability. The Bloomier filter is a compact data structure for encoding arbitrary functions, and it supports approximate evaluation queries. By eliminating the Bloomier filter's false positives in a space efficient way, a simple yet powerful exact string matching architecture is proposed that can handle several thousand strings at high rates and is amenable to on-chip realization. The proposed scheme is implemented in reconfigurable hardware and we compare it with existing solutions. The results show that the proposed approach achieves better performance compared to other existing architectures measured in terms of throughput per logic cells per character as a metric.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.9 no.1
• /
• pp.99-110
• /
• 2005

This paper suggests an efficient approach for stochastic bicriteria programming problem (SBCPP) with random variables in both the objective functions and in the right-hand side of the constraints. The suggested approach uses the statistical inference through two different techniques: In one of them, the SBCPP is transformed into an equivalent deterministic bicriteria programming problem (DBCPP), then the nonnegative weighted sum approach will be used to transform the bicriteria programming problem into a single objective programming problem, and the other technique, the nonnegative weighted sum approach is used to transform the SBCPP to an equivalent stochastic single objective programming problem, then apply the same procedure to convert stochastic single objective programming problem into its equivalent deterministic single objective programming problem (DSOPP). In both techniques the resulting problem can be solved as a nonlinear programming problem to get the efficient solutions. Finally, a comparison between the two different techniques is discussed, and illustrated example is given to demonstrate the actual application of these techniques.