• Journal of Intelligence and Information Systems
• /
• v.25 no.1
• /
• pp.85-107
• /
• 2019

Online consumers browse products belonging to a particular product line or brand for purchase, or simply leave a wide range of navigation without making purchase. The research on the behavior and purchase of online consumers has been steadily progressed, and related services and applications based on behavior data of consumers have been developed in practice. In recent years, customization strategies and recommendation systems of consumers have been utilized due to the development of big data technology, and attempts are being made to optimize users' shopping experience. However, even in such an attempt, it is very unlikely that online consumers will actually be able to visit the website and switch to the purchase stage. This is because online consumers do not just visit the website to purchase products but use and browse the websites differently according to their shopping motives and purposes. Therefore, it is important to analyze various types of visits as well as visits to purchase, which is important for understanding the behaviors of online consumers. In this study, we explored the clustering analysis of session based on click stream data of e-commerce company in order to explain diversity and complexity of search behavior of online consumers and typified search behavior. For the analysis, we converted data points of more than 8 million pages units into visit units' sessions, resulting in a total of over 500,000 website visit sessions. For each visit session, 12 characteristics such as page view, duration, search diversity, and page type concentration were extracted for clustering analysis. Considering the size of the data set, we performed the analysis using the Mini-Batch K-means algorithm, which has advantages in terms of learning speed and efficiency while maintaining the clustering performance similar to that of the clustering algorithm K-means. The most optimized number of clusters was derived from four, and the differences in session unit characteristics and purchasing rates were identified for each cluster. The online consumer visits the website several times and learns about the product and decides the purchase. In order to analyze the purchasing process over several visits of the online consumer, we constructed the visiting sequence data of the consumer based on the navigation patterns in the web site derived clustering analysis. The visit sequence data includes a series of visiting sequences until one purchase is made, and the items constituting one sequence become cluster labels derived from the foregoing. We have separately established a sequence data for consumers who have made purchases and data on visits for consumers who have only explored products without making purchases during the same period of time. And then sequential pattern mining was applied to extract frequent patterns from each sequence data. The minimum support is set to 10%, and frequent patterns consist of a sequence of cluster labels. While there are common derived patterns in both sequence data, there are also frequent patterns derived only from one side of sequence data. We found that the consumers who made purchases through the comparative analysis of the extracted frequent patterns showed the visiting pattern to decide to purchase the product repeatedly while searching for the specific product. The implication of this study is that we analyze the search type of online consumers by using large - scale click stream data and analyze the patterns of them to explain the behavior of purchasing process with data-driven point. Most studies that typology of online consumers have focused on the characteristics of the type and what factors are key in distinguishing that type. In this study, we carried out an analysis to type the behavior of online consumers, and further analyzed what order the types could be organized into one another and become a series of search patterns. In addition, online retailers will be able to try to improve their purchasing conversion through marketing strategies and recommendations for various types of visit and will be able to evaluate the effect of the strategy through changes in consumers' visit patterns.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.326-354
• /
• 2014

In this paper, a new green clustering algorithm is proposed to be as a first approach in the framework of an energy efficient strategy for centralized enterprise high-density WLANs. Traditionally, in order to maintain the network coverage, all the APs within the WLAN have to be powered-on. Nevertheless, the new algorithm can power-off a large proportion of APs while the coverage is maintained as its always-on counterpart. The two main components of the new approach are the faster procedure based on K-means and the more accurate procedure based on Evolutionary Algorithm (EA), respectively. The two procedures are processes in parallel for different designed requirements and there is information interaction in between. In order to implement the new algorithm, EA is applied to handle the optimization of multiple objectives. Moreover, we adapt the method for selection and recombination, and then introduce a new operator for mutation. This paper also presents simulations in scenarios modeled with ray-tracing method and FDTD technique, and the results show that about 67% to 90% of energy consumption can be saved while it is able to maintain the original network coverage during periods when few users are online or the traffic load is low.

• Journal of Power Electronics
• /
• v.17 no.1
• /
• pp.149-160
• /
• 2017

To improve the performance of sensorless induction motor (IM) drives, an adaptive speed estimation method based on a strong tracking extended Kalman filter with a least-square algorithm (LS-STEKF) for induction motors is proposed in this paper. With this method, a fading factor is introduced into the covariance matrix of the predicted state, which forces the innovation sequence orthogonal to each other and tunes the gain matrix online. In addition, the estimation error is adjusted adaptively and the mutational state is tracked fast. Simultaneously, the fading factor can be continuously self-tuned with the least-square algorithm according to the innovation sequence. The application of the least-square algorithm guarantees that the information in the innovation sequence is extracted as much as possible and as quickly as possible. Therefore, the proposed method improves the model adaptability in terms of actual systems and environmental variations, and reduces the speed estimation error. The correctness and the effectiveness of the proposed method are verified by experimental results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4A
• /
• pp.393-401
• /
• 2006

Energy consumption is an important design parameter for battery-operated embedded systems. Dynamic power management is one of the most well-known low-power design techniques. This paper proposes an online realtime scheduling algorithm, which we call energy-aware realtime scheduling using slack stealing (EARSS). The proposed algorithm gives the highest priority to the task with the largest degree of device overlap when the slack time exists. Scheduling result enables an efficient power management by reducing the number of state transitions. Experimental results show that the proposed algorithm can save the energy by 23% on average compared to the DPM-enabled system scheduled by the EDF algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1137-1145
• /
• 2017

This paper proposes the dead time effect compensation algorithm using proportional resonant controller in pulse width modulation inverter of motor drive. To avoid a short circuit in the dc link, the dead time of the switch device is surely required. However, the dead time effect causes the phase current distortions, torque pulsations, and degradations of control performance. To solve these problems, the output current including ripple components on the synchronous reference frame and stationary reference frame are analyzed in detail. As a results, the distorted synchronous d-and q-axis currents contain the 6th, 12th, and the higher harmonic components due to the influence of dead time effect. In this paper, a new dead time effect compensation algorithm using proportional resonant controller is also proposed to reduce the output current harmonics due to the dead time and nonlinear characteristics of the switching devices. The proposed compensation algorithm does not require any additional hardware and the offline experimental measurements. The experimental results are presented to demonstrate the effectiveness of the proposed dead time effect compensation algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.11
• /
• pp.1578-1586
• /
• 2015

Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

• International Journal of Quality Innovation
• /
• v.7 no.2
• /
• pp.141-156
• /
• 2006

This study describes a novel algorithm for optimizing the quality yield of silicon wafer slicing. 12 inch wafer slicing is the most difficult in terms of semiconductor manufacturing yield. As silicon wafer slicing directly impacts production costs, semiconductor manufacturers are especially concerned with increasing and maintaining the yield, as well as identifying why yields decline. The criteria for establishing the proposed algorithm are derived from a literature review and interviews with a group of experts in semiconductor manufacturing. The modified Delphi method is then adopted to analyze those results. The proposed algorithm also incorporates the analytic hierarchy process (AHP) to determine the weights of evaluation. Additionally, the proposed algorithm can select the evaluation outcomes to identify the worst machine of precision. Finally, results of the exponential weighted moving average (EWMA) control chart demonstrate the feasibility of the proposed AHP-based algorithm in effectively selecting the evaluation outcomes and evaluating the precision of the worst performing machines. So, through collect data (the quality and quantity) to judge the result by AHP, it is the key to help the engineer can find out the manufacturing process yield quickly effectively.

• Nuclear Engineering and Technology
• /
• v.53 no.4
• /
• pp.1304-1310
• /
• 2021

Two-phase flow, especially gas-liquid two-phase flow, has a wide application in industrial field. The diagnosis of two-phase flow parameters, which directly determine the flow and heat transfer characteristics, plays an important role in providing the design reference and ensuring the security of online operation of two-phase flow system. Computer tomography (CT) is a good way to diagnose such parameters with imaging method. This paper has proposed a novel image reconstruction method for thermal neutron CT of two-phase flow with improved simulated annealing (ISA) algorithm, which makes full use of the prior information of two-phase flow and the advantage of stochastic searching algorithm. The reconstruction results demonstrate that its reconstruction accuracy is much higher than that of the reconstruction algorithm based on weighted total difference minimization with soft-threshold filtering (WTDM-STF). The proposed method can also be applied to other types of two-phase flow CT modalities (such as X(𝛄)-ray, capacitance, resistance and ultrasound).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4364-4384
• /
• 2021

The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.295-303
• /
• 2008

With universality of e-commerce through internet, smaller online shopping malls are increased. A Smaller online shopping mall by nature lacks an extra space to load many inventory quantities. Therefore, it is difficult to response immediately with client request with traditional inventory management method. VMI has a character that supplier can control volume of inventory according to sales of seller. This paper proposes SOHO-VMI that is applied VMI into smaller online shopping mall. Proposed SOHO-VMI supports M $\times$ N structure can interact with multiple suppliers and sellers. And it uses XML/EDI for interaction with EDI documents use to legacy system. Also, This paper proposes logistics statistic prediction algorithm can adjust production and distribution volumes to supplier considering seller's product distribution information and seasonal factor.