• Coupled systems mechanics
• /
• v.9 no.5
• /
• pp.397-410
• /
• 2020

The present investigation is concerned with two-dimensional deformation in a homogeneous isotropic non local thermoelastic solid with two temperatures due to thermomechanical sources. The theory of memory dependent derivatives has been used for the study. The bounding surface is subjected to concentrated and distributed sources (mechanical and thermal sources). The Laplace and Fourier transforms have been used for obtaining the solution to the problem in the transformed domain. The analytical expressions for displacement components, stress components and conductive temperature are obtained in the transformed domain. For obtaining the results in the physical domain, numerical inversion technique has been applied. Numerical simulated results have been depicted graphically for explaining the effects of nonlocal parameter on the components of displacements, stresses and conductive temperature. Some special cases have also been deduced from the present study. The results obtained in the investigation should be useful for new material designers, researchers and physicists working in the field of nonlocal material sciences.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1993.10a
• /
• pp.38-43
• /
• 1993

It is one of classical problems in the elastic theory to analyze contact stresses between elastic bodies. Concrete pavements under traffic wheel loads can be considered as one of these typical problems. In this paper, an elastic plate resting on tensionless elastic half-space is analyzed by finite element method. The Boussinesq's solution of elastic half-space is used to evaluate the flexibility of foundation. One of the principal difficulties in solving the local seperation phenomena between plate and foundation is that the geometry of the system is unknown. To obtain the boundary of contact area, the flexibility matrix of foundation is modified after each cycle of analysis iteratively. Some numerical examples are presented by using these method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.3
• /
• pp.62-69
• /
• 2006

Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle routing problem with time windows is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4799-4818
• /
• 2015

In this paper, we investigate the problem of achieving global optimization for distributed carrier aggregation (CA) in small cell networks, using a game theoretic solution. To cope with the local interference and the distinct cost of intra-band and inter-band CA, we propose a non-cooperation game which is proved as an exact potential game. Furthermore, we propose a spatial adaptive play learning algorithm with heterogeneous learning parameters to converge towards NE of the game. In this algorithm, heterogeneous learning parameters are introduced to accelerate the convergence speed. It is shown that with the proposed game-theoretic approach, global optimization is achieved with local information exchange. Simulation results validate the effectivity of the proposed game-theoretic CA approach.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.9
• /
• pp.46-58
• /
• 1993

Owing to the nature of locality in mask layouts, it appears that most mask layout problems can be solved by transforming a part of the given mask layout into a better layout segment continuously toward a global suboptimal solution. This notion of local transformation addresses major weak points of existing mask layout processing systems, which lack both extensibility and unifiability. This paper attempts to elaborate upon developing a new rule-based mask layout transformation system wherein most of the mask layout problems can be solved under the unified framework of local mask layout transformation. The rule-based mask layout transformation system is applicable to various mask layout problems such as net extraction, mask layout compaction, mask layout editing, and design rule checking. The experimental results show that the rule-based expert system approach is an efficient means of solving those mask layout problems, and thus confronting major drawbacks of existing layout processing systems.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.281-295
• /
• 2005

The purpose of this paper is to study a class of delay differential equations with two delays. First, we consider the existence of periodic solutions for some delay differential equations. Second, we investigate the local stability of the zero solution of the equation by analyzing the corresponding characteristic equation of the linearized equation. The exponential stability of a perturbed delay differential system with a bounded lag is studied. Finally, by choosing one of the delays as a bifurcation parameter, we show that the equation exhibits Hopf and saddle-node bifurcations.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.22 no.12
• /
• pp.1647-1656
• /
• 1998

The drag reduction is the phenomenon that occurs only when the shear stress from the wall of pipe is beyond the critical point. The drag reduction increase as the molecular weight, concentration of the polymer and Reynolds number increase, but it is limited by Virk's maximum drag reduction asymptote. Because of the strong shear force for the polymer on the turbulent flow, the molecular weight and the drag reduction do not decrease. Such mechanical degradation of the polymer occurs in all polymer solvent systems. This paper is to identify and develop high performance polymer additives for fluid transportations with the benefits of turbulent drag reduction. In addition, drag reduction in vertical flow by measuring the pressure drop and local void fraction on vertical-up flow of close system is evaluated.

• Korean Management Science Review
• /
• v.22 no.2
• /
• pp.99-107
• /
• 2005

Recently, Tang and Chanson proposed a minimum cost distribution model for replicated Web contents subject to an expiration-based consistency management. Their model is a progress in that it can consider multiple replicas via the network of servers located on the Web. The proposed greedy heuristic, however, has an undesirable feature that the solution tends to converge a local optimum at an early stage of the algorithm. in this paper, we propose an algorithm based on a simple idea of preventing the early local convergence. The new algorithm provides solutions whose cost are, on the average, 27$\%$ lower than in the previous algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.490-490
• /
• 2000

Parallel genetic algorithms are particularly easy to implement and promise substantial gains in performance. Its basic idea is to keep several subpopulations that are processed by genetic algorithms. Furthermore, a migration mechanism produces a chromosome exchange between subpopulation. In this paper, a new selection method based on non-linear fitness assignment presented. The use of proposed ranking selection permits higher local exploitation search, where the diversity of populations is structure. Experimental results show that the relation between local-global search balance and the probabilities of reaching a desired solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.278-278
• /
• 2000

In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve optimization problems such as the Traveling Salesman Problem(TSP) and maximizing or minimizing functions. In particular, because TSP is a well-known combinational optimization problem andbelongs to a NP-complete problem, there is huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. Additionally, the non-schema part is applied to inversion for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.