• 제목/요약/키워드: Search Terms

검색결과 1,509건 처리시간 0.032초

CDMA 디지틀 셀룰라용 음성 부호화기 (QCELP) 의 복잡도 감소 알고리즘 (Complexity-Reduction Algorithm of Speech Coder (QCELP) for CDMA Digital Cellular System)

  • 이인성
    • 전자공학회논문지B
    • /
    • 제33B권3호
    • /
    • pp.126-132
    • /
    • 1996
  • In this paper, the complexity reduction method for QCELP speech coder (IS-96) without any perfomrance degradation is proposed for the vecoder of CDMA digital cellular system. The energy terms in pitch parameter search and codebook search routines that require large computations are calculated recursively by utilizing the overlapped structure of code vectors in adaptive codebook and excitation codebook. The additional complexity reduction in the codebook search routine can be achieved by using a simple form in calculation of the energy term when the initial codebook value is zero. In the case of lower transmission rates such as 4,2,1 kbps, the complexity reduction by recursive calulations of energy term is increased.

  • PDF

도서관 포털 통합 유저인터페이스 시스템 비교.분석 (A Comparative Analysis of Library Portal User Interface Systems)

  • 김성희;이정수
    • 한국문헌정보학회지
    • /
    • 제40권2호
    • /
    • pp.175-194
    • /
    • 2006
  • 다양한 도서관 포털시스템의 서브셋인 통합 유저인터페이스 시스템을 (1) 검색(searching)기능, (2) 이용자 상호작용, (3) 인터페이스 customization, (4) 이용자 인증(authentication), (5) 디자인, (6) 데이터베이스 통신 프로토콜, (7) 벤더의 지원, (8) 소프트웨어 플랫폼 같이 8개 기준으로 비교 분석하였다. 그 결과 통합 유저인터페이스는 EnCompass. MetaLib, Musesearch, SingleSearch가 가장 높은 평가 점수를 얻었으며 국내에서는 KDB의 메타서치가 가장 좋은 점수를 얻었다.

Can Big Data Help Predict Financial Market Dynamics?: Evidence from the Korean Stock Market

  • Pyo, Dong-Jin
    • East Asian Economic Review
    • /
    • 제21권2호
    • /
    • pp.147-165
    • /
    • 2017
  • This study quantifies the dynamic interrelationship between the KOSPI index return and search query data derived from the Naver DataLab. The empirical estimation using a bivariate GARCH model reveals that negative contemporaneous correlations between the stock return and the search frequency prevail during the sample period. Meanwhile, the search frequency has a negative association with the one-week- ahead stock return but not vice versa. In addition to identifying dynamic correlations, the paper also aims to serve as a test bed in which the existence of profitable trading strategies based on big data is explored. Specifically, the strategy interpreting the heightened investor attention as a negative signal for future returns appears to have been superior to the benchmark strategy in terms of the expected utility over wealth. This paper also demonstrates that the big data-based option trading strategy might be able to beat the market under certain conditions. These results highlight the possibility of big data as a potential source-which has been left largely untapped-for establishing profitable trading strategies as well as developing insights on stock market dynamics.

유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법 (Improved Route Search Method Through the Operation Process of the Genetic Algorithm)

  • 지홍일;서창진
    • 전기학회논문지P
    • /
    • 제64권4호
    • /
    • pp.315-320
    • /
    • 2015
  • Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

타부 탐색에 근거한 집락문제의 발견적 해법 (Tabu Search Heuristics for Solving a Class of Clustering Problems)

  • 정주성;염봉진
    • 대한산업공학회지
    • /
    • 제23권3호
    • /
    • pp.451-467
    • /
    • 1997
  • Tabu search (TS) is a useful strategy that has been successfully applied to a number of complex combinatorial optimization problems. By guiding the search using flexible memory processes and accepting disimproved solutions at some iterations, TS helps alleviate the risk of being trapped at a local optimum. In this article, we propose TS-based heuristics for solving a class of clustering problems, and compare the relative performances of the TS-based heuristic and the simulated annealing (SA) algorithm. Computational experiments show that the TS-based heuristic with a long-term memory offers a higher possibility of finding a better solution, while the TS-based heuristic without a long-term memory performs better than the others in terms of the combined measure of solution quality and computing effort required.

  • PDF

Optimization of trusses under uncertainties with harmony search

  • Togan, Vedat;Daloglu, Ayse T.;Karadeniz, Halil
    • Structural Engineering and Mechanics
    • /
    • 제37권5호
    • /
    • pp.543-560
    • /
    • 2011
  • In structural engineering there are randomness inherently exist on determination of the loads, strength, geometry, and so on, and the manufacturing of the structural members, workmanship etc. Thus, objective and constraint functions of the optimization problem are functions that depend on those randomly natured components. The constraints being the function of the random variables are evaluated by using reliability index or performance measure approaches in the optimization process. In this study, the minimum weight of a space truss is obtained under the uncertainties on the load, material and cross-section areas with harmony search using reliability index and performance measure approaches. Consequently, optimization algorithm produces the same result when both the approaches converge. Performance measure approach, however, is more efficient compare to reliability index approach in terms of the convergence rate and iterations needed.

Tabu 탐색법과 신경회로망을 이용한 SVC용 적응 퍼지제어기의 설계 (Design of Adaptive Fuzzy Logic Controller using Tabu search and Neural Network)

  • 손종훈;황기현;김형수;문경준;박준호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 A
    • /
    • pp.34-36
    • /
    • 2000
  • This paper proposes the design of SVC adaptive fuzzy logic controller(AFLC) using Tabu search and neural network. We tuned the gain of input-output variables of fuzzy logic controller and weights of neural network using Tabu search. Neural network used to tune the output gain of FLC adaptively. We have weights of neural network learned using back propagation algorithm. We performed the nonlinear simulation on an single-machine infinite system to prove the efficiency of the proposed method. The proposed AFLC showed the better performance than PD controller in terms of the settling time and damping effect, for power system operation condition.

  • PDF

Metaheuristics for reliable server assignment problems

  • Jang, Kil-Woong;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제38권10호
    • /
    • pp.1340-1346
    • /
    • 2014
  • Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper, we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.

2-레벨 탐색을 이용한 스피어 디코딩 알고리즘 (Sphere Decoding Algorithm Using Two-Level Search)

  • 현 트롱안;조종민;김진상;조원경
    • 한국통신학회논문지
    • /
    • 제33권12A호
    • /
    • pp.1133-1137
    • /
    • 2008
  • 스피어 디코딩은 MIMO 심볼검출 기법 중 가장 유망한 기법 중 하나로 알려져 있다. 본 논문에서는 새로운 2 레벨 탐색 스피어 디코딩 알고리즘을 제안한다. 제안된 알고리즘은 심볼검출 시에 성능향상에 영향을 줄 수 있는 유용한 후보군이 이전 단계에서 버려지는 것을 피하기 위해서, 2 레벨 트리 탐색을 동시에 수행한다. 시뮬레이션 결과, 제안된 알고리즘이 BER 측면에서 기존의 알고리즘보다 성능이 우수함을 확인하였다.

실버용품 구매시 인터넷을 활용한 소비자 정보탐색 및 만족도에 관한 연구 (Consumer을s Information Search and Satisfaction for Elderly related Goods on the Internet Shopping)

  • 정현정;계선자
    • 가족자원경영과 정책
    • /
    • 제6권1호
    • /
    • pp.149-165
    • /
    • 2002
  • This study is to understand consumer's information search activity and satisfaction. When they buy the elderly related goods through internet market and to get some ideas for silver industry on internet shopping. The 382 subjects by online banner formatted Questionnaires were analyzed by frequency, percentage, standard deviation, Person's relation and regression analysis by SPSS PC program. The major findings are summarized as follows. (1) The most respondents were young and well-educated. In terms of psychological variables, the degree of the consumer's perception for internet usefulness and using capability were relatively high. (2) Information search amount of the group who have experienced purchasing elderly related goods through internet shopping and had low perception of internet risk is higher than other group. (3) The variables influenced mostly on consumer satisfaction were the age, the sex, the purchasing experience from Internet shopping, the Internet using capacity and the perception of internee usefulness as well as of the perception of internet risk.

  • PDF