• 한국해양공학회지
• /
• 제18권5호
• /
• pp.29-35
• /
• 2004

A new approach, referred to as a successive zooming genetic algorithm (SZGA), is proposed for identifying a global solution, using continuous zooming factors for optimization problems. In order to improve the local fine-tuning of the GA, we introduced a new method whereby the search space is zoomed around the design variable with the best fitness per 100 generation, resulting in an improvement of the convergence. Furthermore, the reliability of the optimized solution is determined based on the theory of probability, and the parameter used for the successive zooming method is optimized. With parameter optimization, we can eliminate the time allocated for deciding parameters used in SZGA. To demonstrate the superiority of the proposed theory, we tested for the minimization of a multiple function, as well as simple functions. After testing, we applied the parameter optimization to a truss problem and wicket gate servomotor optimization. Then, the proposed algorithm identifies a more exact optimum value than the standard genetic algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제23권4호
• /
• pp.367-380
• /
• 2019

A 1kW-class horizontal axis wind turbine (HAWT) rotor blade is taken into account to investigate elastic characteristics in 2-D. The elastic blade field is composed of symmetric cross-ply laminated composite material. Blade element momentum theory is applied to obtain the boundary conditions pressuring the blade, and the plane stress elasticity problem is formulated in terms of two displacement parameters with mixed boundary conditions. For the elastic characteristics a fair of differential equations are derived based on the elastic theory. The domain is divided by triangular and rectangular elements due to the complexity of the blade configuration, and a finite element method is developed for the governing equations to search approximate solutions. The results describe that the elastic behavior is deeply influenced by the layered angle of the middle laminate and the stability of the blade can be improved by controlling the layered angle of laminates, which can be evaluated by the mathematical approach.

• 감성과학
• /
• 제11권1호
• /
• pp.1-10
• /
• 2008

본 논문에서는 퍼지이론을 이용하여 색채공간의 사용자가 원하는 분위기에 해당하는 언어 입력에 따라 조화로운 색채공간을 설계해가는 의사결정 보조 시스템을 개발하였다. 개발된 시스템에서 형용사 이미지 스케일의 언어적인 입력이 주어지면 형용사와 색채와의 관계를 퍼지관계로 가정하고 색채공간의 전체적인 분위기에 맞는 색채가 선택되며 퍼지화된 Moon-Spencer등의 색채조화에 관한 지식은 어울리는 조화색 결정의 탐색 영역을 제한하는 역할을 담당하고 이에 따라 조화색이 결정된다.

• East Asian mathematical journal
• /
• 제30권4호
• /
• pp.405-438
• /
• 2014

This study analyzed and discussed instruction methods of polyhedrons in elementary mathematics textbook by using the didactic transposition theory. By further segmenting instruction methods, we analyzed the period and order of teaching of polyhedrons, its definitions and presentation methods, and how instruction methods has changed so far. In elementary mathematics textbooks from the 1st to the 2007 revised curriculum, we choose the part where polyhedrons are introduced as the search-target, and analyzed instruction methods in these textbooks by using phenomenological description. The instruction period and order of polyhedrons were systemized when the system of Euclid geometry was introduced, considering the psychological condition of students, and the instruction period and order had been refined according to the curriculum. And methods of definition took into consideration both the academic systems and psychological situations. Also, the subject of learning has changed from textbook and teachers to students. Polyhedrons were connected to real life and students could build up their knowledge by themselves. Constructions were aimed at the understanding of meaning of contents, rather than at itself. Through these analyses, we have some suggestions on the teaching of polyhedrons in the elementary mathematics.

• 대한인간공학회지
• /
• 제26권2호
• /
• pp.103-112
• /
• 2007

This study was designed to validate Spreading Activation Theory (SAT) for an evaluation methodology for menu structure through Eye-Tracking approach. When a visual search is on the way, more eye fixations and time are necessary to visually process complex and vague area. From the aspect of recognition, well-designed menu structures were hypothesized to have fewer numbers of fixations and shorter duration because well-designed menu structures reflecting the users' mental model would be well matched with the product's menu structure, resulting in reducing the number of fixations and duration time. The results show that the shorter reaction times for SAT had significantly fewer numbers of fixation and shorter duration time as the hypothesis for this study stated. In conclusion, SAT was proved to be an effective evaluation methodology for menu structure with the eye tracking equipment. In addition, using SAT instead of the real performance experiment would be useful for designing user-centered systems and convenient information structures because SAT was proven to be the theoretical background for design and evaluation of menu structures.

• Steel and Composite Structures
• /
• 제28권2호
• /
• pp.195-207
• /
• 2018

First-order reliability method (FORM) is enhanced based on the search direction using relaxed conjugate reliability (RCR) approach for the embedded nanocomposite beam under buckling failure mode. The RCR method is formulated using discrete conjugate map with a limited scalar factor. A dynamical relaxed factor is proposed to control instability of proposed RCR, which is adjusted using sufficient descent condition. The characteristic of equivalent materials for nanocomposite beam are obtained by micro-electro-mechanical model. The probabilistic model of nanocomposite beam is simulated using the sinusoidal shear deformation theory (SSDT). The beam is subjected to external applied voltage in thickness direction and the surrounding elastic medium is modeled by Pasternak foundation. The governing equations are derived in terms of energy method and Hamilton's principal. Using exact solution, the implicit buckling limit state function of nanocomposite beam is proposed, which is involved various random variables including thickness of beam, length of beam, spring constant of foundation, shear constant of foundation, applied voltage, and volume fraction of ZnO nanoparticles in polymer. The robustness, accuracy and efficiency of proposed RCR method are evaluated for this engineering structural reliability problem. The results demonstrate that proposed RCR method is more accurate and robust than the excising reliability methods-based FORM. The volume fraction of ZnO nanoparticles and the applied voltage are the sensitive variables on the reliable levels of the nanocomposite beams.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• Journal of Information Science Theory and Practice
• /
• 제8권1호
• /
• pp.6-19
• /
• 2020

When information professionals deal with other disciplines in the course of digital humanities projects, they often assume that they are dealing with 'needful users' who have an 'information gap' to fill. This paper argues that the traditional view that information/knowledge is transferred from an information specialist donor to a domain specialist receiver is no longer appropriate in the digital humanities context, where the gap-and-search (or gap-and-filler) approach to information has given way to more direct, explorative engagement with information. The paper asks whether information science and the practising profession are ready for this paradigm shift and examines information science conservatism in two common collaboration scenarios, library support and digital development. It is shown that information science theory still assumes a traditional donor role in both scenarios. How information scientists deal with conservatism in practice is discussed in the example of the Prior project, in which the information science team exerted an ambiguous, hybrid approach with both conservative and non-conservative elements. Finally, two rather hypothetical answers are offered to the question of how information professionals should approach scholarly collaboration in the digital humanities context, where users have ceased to be supplicants. From a purely pragmatic perspective, information scientists need to shift their focus from information needs to research practices and the implications of these practices for digital information systems. More fundamentally, the emergence of digital humanities challenges information professionals to transform information systems designed for searching into digital objects that can be explored more freely by the digital humanities community.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.