• Journal of KIISE:Databases
• /
• 제31권3호
• /
• pp.331-339
• /
• 2004

XML has got to be a new standard for data representation and exchanging by its many good points, and the core part of many new researches and emerging technologies. However, the self-describing characteristic, which is one of XML's good points, caused the spreading of XML documents with different structures, and so the need of the research for the effective XML-document search has been proposed. This paper is for the analysis of the problem in BitCube, which is a bitmap indexing that shows high performance grounded on its fast retrieval. In addition, to resolve the problem of BitCube, we did design and implement xPlaneb(XML Plane Web) which it a new 3-dimensional bitmap indexing made of linked lists. We propose an effective information retrieval technique by replacing BitCube operations with new ones and reconstructing 3-dimensional array index of BitCube with effective nodes. Performance evaluation shows that the proposed technique is better than BitCube, as the amount of document increases, in terms of memory consumptions and operation speed.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2004년도 추계학술대회 논문집 전력기술부문
• /
• pp.190-193
• /
• 2004

Optimal Power Flow (OPF) is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. So this paper presents parallel genetic algorithm-tap search for the solution of the OPF. The control variables modeled unit active power outputs, generator-bus voltage magnitudes and transformer-tap settings. A number of functional operating constraints, such as branch flow limits, load bus boltage magnitude limits and generator reactive capabilities are included as penalties in the fitness function. In parallel GA-TS, GA operators are executed for each process. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper three populations to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on an IEEE 30-bus system in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient for the OPF.

• Journal of Korea Multimedia Society
• /
• 제5권4호
• /
• pp.361-371
• /
• 2002

An efficient access technique is one of the most Important requirements in GIS. Using level -of-detailed data, we can access spatial data efficiently, because of no access to the fully detailed spatial data. Previous spatial access methods do not access data with level of detail efficiently. To solve it, a few spatial access methods for spatial data with level of detail, are known. However these methods support only a few kinds of data with level of detail, i.e, data through selection and simplification operations. For the effects, we propose a new spatial indexing method supporting fast searching in all kinds of data with level of detail. In the proposed method, the collection of indexes in its own level are integrated into a single index structure. Experimental results show that our method offers both no data redundancy and high search performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제11권11호
• /
• pp.2158-2165
• /
• 2007

In this paper, a Modified Fuzzy C-Means algorithm with Gaussian Weights(MFCM_GW) is presented for nonlinear blind channel equalization. The proposed algorithm searches the optimal channel output states of a nonlinear channel from the received symbols, based on the Bayesian likelihood fitness function and Gaussian weighted partition matrix instead of a conventional Euclidean distance measure. Next, the desired channel states of a nonlinear channel are constructed with the elements of estimated channel output states, and placed at the center of a Radial Basis Function(RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a simplex genetic algorithm(GA), a hybrid genetic algorithm(GA merged with simulated annealing(SA): GASA), and a previously developed version of MFCM. It is shown that a relatively high accuracy and fast search speed has been achieved.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.861-865
• /
• 2009

Technical development in car has utilized electronic controls (ECU, Electronic Control Unit) recently if was achieved machine such as engine performance in priority and electronic side technical development that improve safety, convenience, expense etc. is proceeded vigorously. Also, preference of consumers for car is various model's number according to change at the fast speed and complexity of software required from vanguard service development was increased greatly. Software development expense dominated considerable weight in car manufacture expense by such change and automakers established OSEK/VDX that is standard of automobile embeded system to reuse application software by module to respond this and transplant easily to other control device. Do when search about all item that is necessary in real-time OS structure that examines OSEK/VDX standard that is presented as the alternative to respond environment that change rapidly that refer in dignified mien after it is original, and uses actuality OSEK/VDX.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제42권1호
• /
• pp.33-40
• /
• 2019

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제28권6호
• /
• pp.1523-1537
• /
• 2018

The AI speaker is a simple operation that provides users with useful functions such as music playback, online search, and so the AI speaker market is growing at a very fast pace. However, AI speakers always wait for the user's voice, which can cause serious problems such as eavesdropping and personal information exposure if exposed to security threats. Therefore, in order to provide overall improved security of all AI speakers, it is necessary to identify potential security threats and analyze them systematically. In this paper, security threat modeling is performed by selecting four products with high market share. Data Flow Diagram, STRIDE and LINDDUN Threat modeling was used to derive a systematic and objective checklist for vulnerability checks. Finally, we proposed a method to improve the security of AI speaker by comparing the vulnerability analysis results and the vulnerability of each product.

• The Journal of the Acoustical Society of Korea
• /
• 제37권6호
• /
• pp.437-442
• /
• 2018

In this paper, we propose a method for estimating the position of a source in a closed form when a single source has coherently distributed property against a circular array. When a sound source reaches a sensor through multipath environments, it is seen as a distributed source and can be represented by four variables: the nominal azimuth, nominal elevation, azimuth angular spread, elevation angular spread. Therefore, it requires a lot of computation by a search method such as DSPE (Distributed Source Parameter Estimator). In this paper, we propose a method of estimating the nominal azimuth and elevation angle in a closed form using correlation function and least squares method for fast position estimation. In particular, if the source is assumed as Gaussian distribution model, the standard deviation is also estimated in a closed form. In the simulation, the validity of the proposed method is confirmed by comparing with the DSPE.

• Journal of Convergence for Information Technology
• /
• 제11권6호
• /
• pp.99-106
• /
• 2021

This study examined whether relationship marketing activities affected relationship satisfaction and ultimately relationship continuity intention for 180 online store users. As a result of hypothesis test through path analysis, it was found that financial activities and structural activities such as delivery services in shopping malls had a positive effect on relationship satisfaction. In particular, it was found that the influence of structural activities was greater. This suggests that fast delivery or easy-to-search traffic is more meaningful to relationship satisfaction than economic benefits. At the significance level p<0.05, it was found that social activities did not have a significant effect on relationship satisfaction. Because it is not easy to develop social bonds between salespeople and customers at online stores, but the direction is considered positive. Therefore, if online stores can form social bonds with customers, this will have a positive effect on relationship satisfaction, but it is expected that this will become a factor that can differentiate them from competitors.

• International Journal of Computer Science & Network Security
• /
• 제22권2호
• /
• pp.406-412
• /
• 2022

Storing large amounts of data has always been a big problem from the beginning of computing history. Big Data has made huge advancements in improving business processes by finding the customers' needs using prediction models based on web and social media search. The main purpose of big data stream processing frameworks is to allow programmers to directly query the continuous stream without dealing with the lower-level mechanisms. In other words, programmers write the code to process streams using these runtime libraries (also called Stream Processing Engines). This is achieved by taking large volumes of data and analyzing them using Big Data frameworks. Streaming platforms are an emerging technology that deals with continuous streams of data. There are several streaming platforms of Big Data freely available on the Internet. However, selecting the most appropriate one is not easy for programmers. In this paper, we present a detailed description of two of the state-of-the-art and most popular streaming frameworks: Apache Ignite and Hazelcast. In addition, the performance of these frameworks is compared using selected attributes. Different types of databases are used in common to store the data. To process the data in real-time continuously, data streaming technologies are developed. With the development of today's large-scale distributed applications handling tons of data, these databases are not viable. Consequently, Big Data is introduced to store, process, and analyze data at a fast speed and also to deal with big users and data growth day by day.