• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.891-895
• /
• 2001

An alternative inverse feedback structure for adaptive active control of periodic noise is introduced for systems with nonminimum phase cancellation path. To obtain the inverse model of the nonminimum phase cancellation path, the cancellation path model can be factorized into a minimum phase term and a maximum phase term. The maximum phase term containing unstable zeros makes the inverse model unstable. To avoid the instability, we alter the inverse model of the maximum phase system into an anti-causal FIR one. An LMS predictor estimates the future samples of the noise, which are necessary for causality of both anti-causal FIR approximation for the stable inverse of the maximum phase system and time-delay existing in the cancellation path. The proposed method has a faster convergence behavior and a better transient response than the conventional filtered-x LMS algorithms with the same internal model control structure since a filtered reference signal is not required. We compare the proposed methods with the conventional methods through simulation studies.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.5
• /
• pp.73-82
• /
• 2023

Optimization of Construction Site Layout Planning (CSLP) heavily relies on workers' travel paths. However, traditional path generation approaches predominantly focus on the shortest path, often neglecting critical variables such as individual wayfinding tendencies, the spatial arrangement of site objects, and potential hazards. These oversights can lead to compromised path simulations, resulting in less reliable site layout plans. While Deep Reinforcement Learning (DRL) has been proposed as a potential alternative to address these issues, it has shown limitations. Despite presenting more realistic travel paths by considering these variables, DRL often struggles with efficiency in complex environments, leading to extended learning times and potential failures. To overcome these challenges, this study introduces a refined model that enhances spatial navigation capabilities and learning performance by integrating workers' visibility into the reward functions. The proposed model demonstrated a 12.47% increase in the pathfinding success rate and notable improvements in the other two performance measures compared to the existing DRL framework. The adoption of this model could greatly enhance the reliability of the results, ultimately improving site operational efficiency and safety management such as by reducing site congestion and accidents. Future research could expand this study by simulating travel paths in dynamic, multi-agent environments that represent different stages of construction.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.383-388
• /
• 2004

In this paper an alternative Active Matrix LCD technology is described with scalable, low cost processing. The Dual Select Diode AMLCD requires 60% lower capital investment in the array process than a-Si TFT arrays and results in 20% lower cost LCD modules. Development at several AMLCD manufacturers is in progress.

• Journal of Distribution Science
• /
• v.13 no.8
• /
• pp.41-48
• /
• 2015

Purpose - This study's objective is to confirm the effects of the perceived relationship value, alternative attractiveness, and investment size on Korean food service franchisees' commitment, using an investment model. Among the three factors, the study examines which factors enhance or weaken the commitment in the franchising investment model. Research design, data, methodology - The data were collected from 495 franchisees and analyzed by a SEM (Structure Equation Model) using path analysis by SPSS 18.0 and AMOS 18.0. Results - 1) The perceived relationship value has a positive effect on franchisee commitment. 2) The alternative attractiveness has a negative effect on franchisee commitment. 3) The investment size has a positive effect on franchisee commitment. Conclusions - The findings show that the investment model can be adapted to franchising and confirms previous investment model study results. We can assume that the higher the perceived relationship value and the bigger the investment, the stronger the commitment, and the greater the alternative attractiveness, the weaker the commitment. These results offer managerial implications for a franchisor wanting to strengthen franchisee commitment.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.131-143
• /
• 2004

Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.111-120
• /
• 2005

A mobile ad-hoc network is an autonomous system of mobile nodes which are free to move around randomly and organize themselves arbitrarily, hence a routing protocol that handles the dynamic network topology changes is required for the network. In this paper we present a multi -Path on-demand routing protocol called R-DSR (Robust Dynamic Source Routing), an extension to the existing IETF protocol DSR. The proposed protocol has it that every pair of 2-hop away nodes on the single route is additionally connected via an alternative node. Throughout mathematical analysis we show the proposed protocol reveals higher message delivery rate than that of the Das's multi-path protocol, currently known as one of the most typical approaches related to DSR.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.1
• /
• pp.42-49
• /
• 2009

In this paper, an alternative method was introduced to conduct a transfer path analysis for airborne noise. The method used the transfer function matrix composed of acoustic transfer functions that are referenced by the input voltage of a calibration source. A calibration factor which is converting a virtual voltage to source strength was deduced by vibro-acoustical reciprocity theorem. The calibration factor is then multiplied to the virtual input voltage to estimate the operational source strength. Three loudspeakers were used to noise sources of acrylic half car model. The method was applied to airborne noise transfer path analysis of the half car. The estimated source strength by transfer path analysis was compared the deduced source strength by vibro-acoustical reciprocity to verify the method.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.4
• /
• pp.109-120
• /
• 2021

Despite the growing online exposure of retailes, offline retail channels still outperform online channels in the total retail volume of some countries. There is much interest in the physical layout plans of retail stores to expand sales. Product placement that have a large impact on customer purchasing behavior at offline retailers influences customer movement and sales volume. But in many cases, each retailer relies on unsystematic and autonomous product placement. When multiple products are sold with one purchase, the customer's movement for shopping may be evaluated in terms of customer efficiency and additional impulse purchase. In this paper, the social network is applied to sales data of a retail store and the result is used for evaluation of product placement and customer path. The frequent sales product composition was identified using k-core from sales data in the form of shopping baskets. The location was checked for the identified compositions of products, the spatial variance was measured and the customer's path was identified. With these results, the store arrangement of products was evaluated with appropriate improvement directions. The analysis method of this paper can be an alternative analysis approach for better layout of retail stores.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.292-300
• /
• 2008

In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.