• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.655-669
• /
• 2019

Supplier evaluation is of great significance in green supply chain management. Influenced by factors such as economic globalization, sustainable development, a holistic index framework is difficult to establish in green supply chain. Furthermore, the initial index values of candidate suppliers are often characterized by uncertainty and incompleteness and the index weight is variable. To solve these problems, an index framework is established after comprehensive consideration of the major factors. Then an adaptive weight D-S theory model is put forward, and a fuzzy-rough-sets-AHP method is proposed to solve the adaptive weight in the index framework. The case study and the comparison with TOPSIS show that the adaptive weight D-S theory model in this paper is feasible and effective.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.413-416
• /
• 2002

In this paper, a speech enhancement system using microphone array with adaptive Post-Processing is implemented in real-lime with TMS320C6201 DSP. It consists of delay-and-sum beamformer and adaptive post-processing filters with NLMS (Normalized Least Mean Square) algorithm. THS1206 ADC is used for collection of 4-channel microphone signals. Sizes of program memory, data ROM and data RAM of the implemented system are 15,744, 748 and 47,540 bytes, respectively. Finally 21.839${\times}$106 clocks per second is required for real-time operation.

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1559-1566
• /
• 2017

Recently in the IoT(Internet of Things) environment, a data collection in real-time through device's sensor has increased with an emergence of various devices. Collected data from IoT environment shows a large scale, non-uniform generation cycle and atypical. For this reason, the distributed processing technique is required to analyze the IoT sensor data. However if you do not consider the optimal scheduling for data and the processor of IoT in a distributed processing environment complexity increase the amount in assigning a task, the user is difficult to guarantee the QoS(Quality of Service) for the sensor data. In this paper, we propose APQTA(Adaptive Priority Queue-driven Task Allocation method for sensor data processing) to efficiently process the sensor data generated by the IoT environment. APQTA is to separate the data into job and by applying the priority allocation scheduling based on the deadline to ensure that guarantee the QoS at the same time increasing the efficiency of the data processing.

• Journal of electromagnetic engineering and science
• /
• v.14 no.2
• /
• pp.79-81
• /
• 2014

In B-scan data measured by a pulse-type monostatic borehole radar, target signatures are seriously obscured by two clutters that differ in orientation and intensity. The primary clutter appears as a nearly constant time delay, which is caused by internal ringing between antenna and transceiver in the radar system. The secondary clutter occurs as an oblique time delay due to the guided borehole wave along the logging cable of the radar antenna. This issue led us to perform adaptive filtering processing for orientation-based clutter removal. This letter describes adaptive filtering processing consisting of a combination of edge detection, data rotation, and eigenimage filtering. We show that the hyperbolic signatures of a dormant air-filled tunnel target can be more distinctly enhanced by applying the proposed approach to the B-scan data, which are measured in a well-suited test site for underground tunnel detection.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.199-202
• /
• 2009

Adaptive memory management is a serious issue in data stream management. Data stream differ from the traditional stored relational model in several aspect such as the stream arrives online, high volume in size, skewed data distributions. Data skew is a common property of massive data streams. We propose the predicted allocation strategy, which uses predictive processing to cope with time varying data skew. This processing includes memory usage estimation and indexing with timestamp. Our experimental study shows that the predictive strategy reduces both required memory space and latency time for skewed data over varying time.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.327-341
• /
• 2006

As we are getting to deal with more applications that generate streaming data such as sensor network, monitoring, and SDI (selective dissemination of information), active research is being conducted to support efficient processing of queries over streaming data. The applications on the Web environment like SDI, among others, require query processing over streaming XML data, and its investigation is very important because XML has been established as the standard for data exchange on the Web. One of the major problems with the previous systems that support query processing over streaming XML data is that they cannot deal adaptively with dynamically changing stream because they rely on static query plans. On the other hand, the stream query processing systems based on relational data model have achieved adaptiveness in query processing due to query operator routing. In this paper, we propose a system of adaptive query processing over streaming XML data in which the model of adaptive query processing over streaming relational data is applied. We compare our system with YFiiter, one of the representative systems that provide XML stream query processing capability, to show efficiency of our system.

• 전기의세계
• /
• v.29 no.9
• /
• pp.584-593
• /
• 1980

Conventional radar antenna systems are susceptible to performance degradation caused by unwanted signals received via the antenna sidelobes and/or mainlobes. Adaptive array systems offer possible solution to this interference problem by automatically steering nulls to unwanted signals providing significant system performance improvement. Another important andvantage of the adaptive array is its self-optimization capability which uses the collective incoming noise data for the nulling purposes. This paper provides a tutorial introduction to adaptive arrays as well as some new development of recent research in this area. Optimum link between the antenna theory and signal processing has been sought by illustrating the gain patterns and output signal-to-noise ratio. Signal acqusition methods are shown including a new attempt of the use of spread-spectrum techniques in conjuction with array systems.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.555-566
• /
• 2012

The cloud environment makes it possible to analyze large data sets in a scalable computing infrastructure. In the bioinformatics field, the applications are composed of the complex workflow tasks, which require huge data storage as well as a computing-intensive parallel workload. Many approaches have been introduced in distributed solutions. However, they focus on static resource provisioning with a batch-processing scheme in a local computing farm and data storage. In the case of a large-scale workflow system, it is inevitable and valuable to outsource the entire or a part of their tasks to public clouds for reducing resource costs. The problems, however, occurred at the transfer time for huge dataset as well as there being an unbalanced completion time of different problem sizes. In this paper, we propose an adaptive resource-provisioning scheme that includes run-time data distribution and collection services for hiding the data transfer time. The proposed adaptive resource-provisioning scheme optimizes the allocation ratio of computing elements to the different datasets in order to minimize the total makespan under resource constraints. We conducted the experiments with a well-known sequence alignment algorithm and the results showed that the proposed scheme is efficient for the cloud environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.05a
• /
• pp.562-565
• /
• 2018

A wide range of IoT applications use information collected from networks of sensors for monitoring and controlling purposes. However, the frequent appearance of fault data makes it difficult to extract correct information, thereby sending incorrect commands to actuators that can threaten human privacy and safety. For this reason, it is necessary to have a mechanism to detect fault data collected from sensors. In this paper, we present a trend-adaptive multi-scale principal component analysis (Trend-adaptive MS-PCA) model for data fault detection. The proposed model inherits advantages of Discrete Wavelet Transform (DWT) in capturing time-frequency information and advantages of PCA in extracting correlation among sensors' data. Experimental results on a real dataset show the high effectiveness of the proposed model in data fault detection.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.240-240
• /
• 2000

This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.