• Structural Engineering and Mechanics
• /
• v.88 no.4
• /
• pp.301-309
• /
• 2023

In this paper, a new modified conjugate gradient (MCG) method is presented which is based on a new gradient regularizer, and this method is used to identify the dynamic load on airfoil structure without and with considering random structure parameters. First of all, the newly proposed algorithm is proved to be efficient and convergent through the rigorous mathematics theory and the numerical results of determinate dynamic load identification. Secondly, using the perturbation method, we transform uncertain inverse problem about force reconstruction into determinate load identification problem. Lastly, the statistical characteristics of identified load are evaluated by statistical methods. Especially, this newly proposed approach has successfully solved determinate and uncertain inverse problems about dynamic load identification. Numerical simulations validate that the newly developed method in this paper is feasible and stable in solving load identification problems without and with considering random structure parameters. Additionally, it also shows that most of the observation error of the proposed algorithm in solving dynamic load identification of deterministic and random structure is respectively within 11.13%, 20%.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.580-582
• /
• 2005

This paper presents a new method which applies a genetic algorithm(GA) for determining which sectionalizing switch to operate in order to solve the distribution system loss minimization re-configuration problem. The distribution system loss minimization re-configuration problem is in essence a 0-1 planning problem which means that for typical system scales the number of combinations requiring searches becomes extremely large. In order to deal with this problem, a new a roach which applies a GA was presented. Briefly, GA are a type of random number search method, however, they incorporate a multi-point search feature. Further, every point is not is not separately and respectively renewed, therefore, if parallel processing is applied, we can expect a fast solution algorithm to result.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.197-199
• /
• 2001

This paper presents a Tabu Search (TS) based algorithm to solve the Optimal Power Flow (OPF) problem, converses rapidly to global optima by means of escaping local minima. In this paper, a new approach based on the random TS algorithm with continuous variable is proposed to find that a solution to the OPF problem within reasonable time complexity. To verify the efficiency of the proposed approach, case studies are made for IEEE 30-bus system.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2071-2074
• /
• 2002

This paper introduces an encoder design method of Turbo TCM (Trellis Coded Modulation) with symbol puncturing. TTCM consists of two simple trellis codes in parallel and modulator. To obtain an good encoder, we calculate the free distance by the assumption that the punctured symbol is transmitted from the subset that consist of signals with the same systematic bit at random. We develop a search program to find the component encoder which maximize the free distance. Especially, for 8-PSK with code rate 2/3, we search for the component codes. We find a new encoder which has better BER performance than that of Robertson′s encoder. We verify the results through the simulation."

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.306-312
• /
• 2000

In this paper, the efficient architecture of small Reed-solomon architecture is suggested. Here, 3-stage pipeline is adopted. In decoding, error-location polynomials are obtained by BMA using fast iteration method, and syndrome polynomials, where calculation complexity is required, are obtained by parallel calculation using ROM table, and the roots of error location polynomial are calculated by ROM table using Chein search algorithm. In the suggested decoder, it is confirmed that 3 symbol random errors can be corrected and 124Mbps decoding rate is obtained using 25 Mhz system clock.

• Electronics and Telecommunications Trends
• /
• v.34 no.4
• /
• pp.32-42
• /
• 2019

The performance of machine learning algorithms significantly depends on how a configuration of hyperparameters is identified and how a neural network architecture is designed. However, this requires expert knowledge of relevant task domains and a prohibitive computation time. To optimize these two processes using minimal effort, many studies have investigated automated machine learning in recent years. This paper reviews the conventional random, grid, and Bayesian methods for hyperparameter optimization (HPO) and addresses its recent approaches, which speeds up the identification of the best set of hyperparameters. We further investigate existing neural architecture search (NAS) techniques based on evolutionary algorithms, reinforcement learning, and gradient derivatives and analyze their theoretical characteristics and performance results. Moreover, future research directions and challenges in HPO and NAS are described.

• The Journal of Industrial Distribution & Business
• /
• v.8 no.6
• /
• pp.7-16
• /
• 2017

Purpose - Today's world revolves around search engines which are the driving force behind any marketer. The thirst for marketing has led to the evolution of online 'Pay per click' over last few years and is the most widely used instrument. Research design, data, and methodology - Exploratory research design highlights many marketing variables getting affected by pay per click marketing. To analyze the said phenomenon, the data was gathered through questionnaire from the sample of 338 respondents which were selected by simple random sampling method mostly from the National Capital Region (NCR) of Delhi in India. The data collected from the respondents was loaded on SAS base for exploratory factor analysis and multiple regression analysis. Results - Pay per click as a marketing tool has significant impact on the consumers. The most prominent factors of pay per click marketing identified in the research are Ad quality, Competition, Targeting, Trend and Budget. Conclusions - Organic as well as inorganic ads, keeping in mind the end goal to gage the exchange of these two postings in the marked look territory. Additionally, here we dissected supported pursuit promotions in all. It would be beneficial to break down the impact of promotion position on the pay per click marketing.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.320-326
• /
• 2002

Distribution system loss minimization re-configuration is 0-1 planning problem, and the number of combinations requiring searches is extremely large when dealing with typical system scales. For this reason, the application of a genetic algorithm (GA) seems attactive to solve this problem. Although Genetic algorithms are a type of random number search method, they incorporate a multi-point search feature and are therefore superior to one-point search techniques. The efficiency of GAs for solving large combinational problem has received wide attention. Further, parallel searching can be performed and the optimal solution is more easily reached. In this paper, for improving GA convergence characteristics in the distribution system loss minimization re-configeration problem, a chromosome "Limited Life" concept is intro duced. Briefly, considering the population homogenization and genetic drift problems, natural selection is achieved by providing this new concept, in addition to natural selection by fitness. This is possible because individuals in a population have an age value. Simulations were carried out using a model system to check this method's validity.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.264-269
• /
• 2006

This paper presents the strategy for searching a hidden object in an unknown area for using by multiple distributed autonomous robotic systems (DARS). To search the target in Markovian space, DARS should recognize th ε ir surrounding at where they are located and generate some rules to act upon by themselves. First of all, DARS obtain 6-distances from itself to environment by infrared sensor which are hexagonally allocated around itself. Second, it calculates 6-areas with those distances then take an action, i.e., turn and move toward where the widest space will be guaranteed. After the action is taken, the value of Q will be updated by relative formula at the state. We set up an experimental environment with five small mobile robots, obstacles, and a target object, and tried to research for a target object while navigating in a un known hallway where some obstacles were placed. In the end of this paper, we present the results of three algorithms - a random search, an area-based action making process to determine the next action of the robot and hexagon-based Q-learning to enhance the area-based action making process.

• Annals of Clinical Neurophysiology
• /
• v.8 no.1
• /
• pp.44-47
• /
• 2006

Background: The present study used magnetoencephalography (MEG) to investigate the neural substrates for modified version of Treisman's visual search task. Methods: Two volunteers who gave informed consent participated MEG experiment. One was 27- year old male and another was 24-year-old female. All were right handed. Experiment were performed using a 306-channel biomagnetometer (Neuromag LTD). There were three task conditions in this experiment. The first was searching an open circle among seven closed circles (open condition). The second was searching a closed circle among seven uni-directionally open circles (closed condition). And the third was searching a closed circle among seven eight-directionally open circles (random (closed) condition). In one run, participants performed one task condition so there were three runs in one session of experiment. During one session, 128 trials were performed during every three runs. One participant underwent one session of experiment. The participant pressed button when they found targets. Magnetic source localization images were generated using software programs that allowed for interactive identification of a common set of fiduciary points in the MRI and MEG coordinate frames. Results: In each participant we can found activations of anterior cingulate, primary visual and association cortices, posterior parietal cortex and brain areas in the vicinity of thalamus. Conclusions: we could find activations corresponding to anterior and posterior visual attention systems.