• Journal of Computing Science and Engineering
• /
• 제9권1호
• /
• pp.1-8
• /
• 2015

Accessing and searching in a sequence of numbers are fundamental operations in computing that are encountered in a wide range of applications. One of the applications of the problem is cryptanalytic time-memory tradeoff which is aimed at a one-way function. A rainbow table, which is a common method for the time-memory tradeoff, contains elements from an input domain of a hash function that are normally sorted integers. In this paper, we present a practical indexing method for a monotonically increasing static sequence of numbers where the access and search queries can be addressed efficiently in terms of both time and space complexity. For a sequence of n numbers from a universe $U=\{0,{\ldots},m-1\}$, our data structure requires n lg(m/n) + O(n) bits with constant average running time for both access and search queries. We also give an analysis of the time and space complexities of the data structure, supported by experiments with rainbow tables.

• Journal of Computing Science and Engineering
• /
• 제3권1호
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• Environmental Engineering Research
• /
• 제25권1호
• /
• pp.123-128
• /
• 2020

Non-point source pollutant load reductions were calculated using the Hydrologic Simulation Program-Fortran (HSPF) model under the assumption that landuse pattern was changed according to land purchases. Upon the simulation of non-point pollutant and areas with high land purchase ratios to select a buffer zone, the Namgang dam Reach 11, Imha dam Reach 10, and the Reach 136 watershed of the main river were found to rank high for the construction of buffer zones. Assuming that the forms of the purchased lands were changed to wetlands, biological oxygen demand (BOD) loads were changed through the HSPF model. No changes of BOD were present in the Namgang dam and the Imha dam watersheds. BOD loads in Reach 136 according to landuse change were analyzed through a flow duration analysis based on the total maximum daily loads of the United States. The flow duration analyses undertaken to examine changes in BOD of main river Reach 136 watershed indicated a shift of 0.64 kg/d from 3.16 to 2.52 during high flow. The change of BOD under the conditions of moist, mid-range and dry were 11.9%, 9% and 4.5%. At the low flow condition, the variation range in the BOD load was from 0.58 kg/d to 0.41 kg/d.

• 응용통계연구
• /
• 제17권3호
• /
• pp.459-473
• /
• 2004

본 논문에서는 Breiman 등(1984)의 전체탐색법이 갖고 있는 변수선택 편향을 극복할 수 있는 알고리즘을 제안하였다. 제안한 알고리즘은 노드의 분리 변수를 선택하는 단계와 그 선택된 변수에 대해서만 이진분리를 위한 분리점을 찾는 단계로 나뉘어져 있다. 예측변수가 연속형 일 때는 스피어만의 순위상관계수에 의한 검정을 수행하고, 범주형일 때는 크루스칼-왈리스의 통계량에 의한 검정을 수행하여 통계적으로 가장 유의한 변수를 분리변수로 선택하였고 Breiman 등(1984)의 전체탐색법을 그 변수에만 적용하여 노드의 분리기준을 정하였다 모의실험 연구를 통해 Breiman등(19히)의 CART와 제안한 알고리즘을 변수선택 편의, 변수선택력파 평균제곱오차 측면에서 서로 비교하였다. 아울러 두 알고리즘을 실제 자료에 적용하여 효율을 서로 비교하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5563-5582
• /
• 2016

Parametric min-cuts is an object proposal algorithm, which can be used for accurate image segmentation. In parametric min-cuts, foreground seeds generation plays an important role since the number and quality of foreground seeds have great effect on its efficiency and accuracy. To improve the performance of parametric min-cuts, this paper proposes a new framework for foreground seeds generation. First, to increase the odds of finding objects, saliency detection at multiple scales is used to generate a large set of diverse candidate seeds. Second, to further select good-quality seeds, a two-stage cascaded ranking classifier is used to filter and rank the candidates based on their appearance features. Experimental results show that parametric min-cuts using our seeding strategy can obtain a relative small pool of proposals with high accuracy.

• 한국정보통신학회논문지
• /
• 제15권1호
• /
• pp.163-168
• /
• 2011

블로그는 인터넷 공간에서 가장 손쉽게 정보 출간, 토론 참여, 커뮤니티 형성하는 수단이다. 그러나 최근에 광고를 유치하거나 페이지 순위를 올리기 위한 목적의 다양한 스팸 블로그가 범람하고 있다. 본 연구의 목적은 웹 환경에서 이러한 스팸 블로그(Splog)를 자동으로 판별하는 시스템을 개발하는 것이다. 먼저 블로그의 HTML을 제거한 후 품사를 부착하였다. 어휘/품사 쌍을 자질로 사용하였으며 카이제곱 통계량을 이용하여 유용한 자질을 선택하였다. 선택된 자질의 가중치를 벡터로 표현한 후, 지지벡터기계(Support Vector Machines)를 학습하여 자동으로 스팸 블로그를 판별하는 시스템을 제안하였으며, SPLOG 데이터 집합으로 실험한 결과 F1척도로 90.5%의 정확률을 얻었다.

• International Journal of Contents
• /
• 제5권3호
• /
• pp.8-13
• /
• 2009

The recent Web service field emerges as the fastest growing IT paradigm as a result of the increasing interest in SOA (Services-Oriented Architecture) and the expansion of B2B market. With an increasing number of Web service that provide similar features, it becomes more important to provide the most appropriate service for the user's request. A service user in general requires the quality information of Web service when selecting a service among a number of similar Web services. Yet, finding a service through UDDI (Universal Description, Discovery and Integration) does not consider the non-functional aspects of users because it is only based on the functional aspects. That is, the quality, non-functional aspect will be an important factor for the mutual success of the user and provider. Using 3 factors in the Qos factors of the existing studies: the execution cost, reliability, and the quality level, the QoS of Web service is saved and the factors for the QoS are recorded in order to consider non-functional factors when selecting a Web service in this study. The Quality Broker determines the rank and shows the desired result of the service for users. The Quality Broker suggested in this thesis can be used to select a Web Service that considers the user-oriented and non-functional factors.

• ETRI Journal
• /
• 제39권5호
• /
• pp.683-694
• /
• 2017

Several studies have focused on multimedia transmission over wireless sensor networks (WSNs). In this paper, we propose a comprehensive and robust model to transmit images over cognitive radio WSNs (CRWSNs). We estimate the spectrum sensing frequency and evaluate its impact on the peak signal-to-noise ratio (PSNR). To enhance the PSNR, we attempt to maximize the number of pixels delivered to the receiver. To increase the probability of successful image transmission within the maximum allowed time, we minimize the average number of packets remaining in the send buffer. We use both single- and multi-channel transmissions by focusing on critical transmission events, namely hand-off (HO), No-HO, and timeout events. We deploy our advanced updating method, the dynamic parameter updating procedure, to guarantee the dynamic adaptation of model parameters to the events. In addition, we introduce our ranking method, named minimum remaining packet best channel selection, to enable us to rank and select the best channel to improve the system performance. Finally, we show the capability of our proposed image scrambling and filtering approach to achieve noticeable PSNR improvement.

• 품질경영학회지
• /
• 제39권2호
• /
• pp.244-255
• /
• 2011

In this study, we try to evaluate the efficiency of the photonics industry using a data envelopment analysis(DEA) model. We first develope four stage procedures for selecting proper input and output variables which consist of selecting the first candidate variables from literature survey, selecting the second candidate variables through experts' discussion, measuring the partial efficiency of the selected variables based on Tofallis' profiling, and clustering some variables through the rank correlation analysis of partial efficiency proposed by Min and Kim(l998). With this procedure, we select 4 input variables(capital, number of employee, R&D cost, operating cost) and 2 output variables(sales, growth of sales) and then utilize CCR and BCC model to measure efficiencies of 26 photonics companies in Gwangju. Moreover, we perform the reference group analysis to figure out what causes inefficiencies and to provide the desirable values for input and output variables at which inefficient photonics companies become efficient. Finally, we classify 26 photonics companies into three groups such as optical communications, optical applications, and optical sources, and perform the Kruskal-Wallis test to check if there exist some differences between efficiencies of three groups.

• 유통과학연구
• /
• 제19권12호
• /
• pp.45-56
• /
• 2021

Purpose: This study aims to introduce a hybrid MCDM model to support the selection of retail store location. Research design, data, and methodology: The hybrid approach of ANP and TOPSIS was used to address the location selection problem. The ANP technique was employed to compute the weights of the selection criteria, whilst the TOPSIS was used to rank alternatives. The proposed approach was then applied into a fashion company in Vietnam to select the best alternatives to be the retail store. Results: The results showed that Candidate 1 - Hai Ba Trung street is the most appropriate selection for locating retail stores. Conclusions: The proposed approach provides the decision makers with more useful methods than traditional ones. Therefore, the model can be applied to the location selection in all industries. In terms of academic contribution, the selection criteria proposed in the research can devote to the literature in the selection of location along with the concept of distribution channels. Additionally, the research also provides insight and guidelines for firms in making decision on retail store location based on limited resources to avoid the waste of funds. However, the results only answer to the context of Vietnam - a developing country. Thus, future research may be extended to developed countries where have better conditions.