• Title/Summary/Keyword: Condition-Search

Search Result 522, Processing Time 0.025 seconds

Development of a Stock Auto-Trading System using Condition-Search

  • Gyu-Sang Cho
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.203-210
    • /
    • 2023
  • In this paper, we develope a stock trading system that automatically buy and sell stocks in Kiwoom Securities' HTS system. The system is made by using Kiwoom Open API+ with the Python programming language. A trading strategy is based on an enhanced system query method called a Condition-Search. The Condition-Search script is edited in Kiwoom Hero 4 HTS and the script is stored in the Kiwoom server. The Condition-Search script has the advantage of being easy to change the trading strategy because it can be modified and changed as needed. In the HTS system, up to ten Condition-Search scripts are supported, so it is possible to apply various trading methods. But there are some restrictions on transactions and Condition-Search in Kiwoom Open API+. To avoid one problem that has transaction number and frequency are restricted, a method of adjusting the time interval between transactions is applied and the other problem that do not support a threading technique is solved by an IPC(Inter-Process Communication) with multiple login IDs.

Analysis of the Good Job Condition of Which Young People Think and the Impact of Job Search Behavior on Employment (청년들이 생각하는 좋은 일자리 조건과 직업탐색행동이 취업에 미치는 영향 분석)

  • Chang, Wook-hee
    • Journal of Practical Engineering Education
    • /
    • v.13 no.2
    • /
    • pp.351-368
    • /
    • 2021
  • This paper is meaningful in that it empirically studies the good job condition of which young people think and the impact of job search behavior on employment. In addition, employment status and additional job search performance were set as performance variables. The main research results of this study are as follows. First, as for the good job condition considered by young people, wages and salaries in terms of companies, job stability in terms of environment, and work-life balance in terms of individuals were found. Second, job search behavior was found to be a key variable influencing employment status and job search performance. Third, it was found that job-search stress injures employment. Finally, work experience promotes employment and job search performance. Therefore, to increase the employment success rate of young people, above all, various supports for increasing the frequency of young job seekers' active job search behavior are needed. To this end, it suggests that it is necessary to develop a customized youth policy service model and to provide systematic services to meet the needs of young people.

Memory in visual search: Evidence from search efficiency (시각 탐색에서의 기억: 탐색 효율성에 근거한 증거)

  • Baek Jongsoo;Kim Min-Shik
    • Korean Journal of Cognitive Science
    • /
    • v.16 no.1
    • /
    • pp.1-15
    • /
    • 2005
  • Since human visual system has limited capacity for visual information processing, it should select goal-relevant information for further processing. There have been several studies that emphasized the possible involvement of memory in spatial shift of selective attention (Chun & Jiang, 1998, 1999; Klein, 1988; Klein & MacInnes, 1999). However, other studies suggested the inferiority of human visual memory in change detection(Rensink, O'Regan, & Clark, 1997; Simons & Levin, 1997) and in visual search(Hotowitz & Wolfe, 1998). The present study examined the involvement of memory in visual search; whether memory for the previously searched items guides selective attentional shift or not. We investigated how search works by comparing visual search performances in three different conditions; full exposure condition, partial exposure condition, and partial-to-full exposure condition. Revisiting searched items was allowed only in full exposure condition and not in either partial or partial-to-full exposure condition. The results showed that the efficiencies of attentional shift were nearly identical for all conditions. This finding implies that even in full exposure condition the participants scarcely re-examined the previously searched items. The results suggest that instant memory can be formed and used in visual search process. These results disagree with the earlier studies claiming thar visual search has no memory. We discussed the problems of the previous research paradigms and suggested some alternative accounts.

  • PDF

The Evaluation of Customer Satisfaction for Internet Search Engine (인터넷 검색엔진의 고객만족도 평가)

  • 최성운;이락구
    • Journal of the Korea Safety Management & Science
    • /
    • v.3 no.1
    • /
    • pp.67-79
    • /
    • 2001
  • This study is based on Parasuraman, Zeithaml 8l Berry[19]`s SERVQUAL measure that develop for estimation of service quality, so this study proposes the present condition of customer service and improvement method on internet search engine. This study also develops a questionnaire for analyzing customer satisfaction considering the present condition of internet service. We're going to analyze the customer service quality that classified by search engines, service quality with university students who use usually internet.

  • PDF

Fractal Depth Map Sequence Coding Algorithm with Motion-vector-field-based Motion Estimation

  • Zhu, Shiping;Zhao, Dongyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.242-259
    • /
    • 2015
  • Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substations

  • Ko Yun-Seok
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.177-185
    • /
    • 2005
  • This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substation (자동화된 변전소의 이벤트 발생시 준최적 탐색법에 기반한 모선 재구성 전략의 개발)

  • Ko Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.10
    • /
    • pp.565-572
    • /
    • 2004
  • This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

$L_2$-Norm Pyramid--Based Search Algorithm for Fast VQ Encoding (고속 벡터 양자 부호화를 위한 $L_2$-평균 피라미드 기반 탐색 기법)

  • Song, Byeong-Cheol;Ra, Jong-Beom
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.1
    • /
    • pp.32-39
    • /
    • 2002
  • Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.

Prediction of visual search performance under multi-parameter monitoring condition using an artificial neural network (뉴럴네트?을 이용한 다변수 관측작업의 평균탐색시간 예측)

  • 박성준;정의승
    • Proceedings of the ESK Conference
    • /
    • 1993.10a
    • /
    • pp.124-132
    • /
    • 1993
  • This study compared two prediction methods-regression and artificial neural network (ANN) on the visual search performance when monitoring a multi-parameter screen with different occurrence frequencies. Under the highlighting condition for the highest occurrence frequency parameter as a search cue, it was found from the requression analysis that variations of mean search time (MST) could be expained almost by three factors such as the number of parameters, the target occurrence frequency of a highlighted parameter, and the highlighted parameter size. In this study, prediction performance of ANN was evaluated as an alternative to regression method. Backpropagation method which was commonly used as a pattern associator was employed to learn a search behavior of subjects. For the case of increased number of parameters and incresed target occurrence frequency of a highlighted parameter, ANN predicted MST's moreaccurately than the regression method (p<0.000). Only the MST's predicted by ANN did not statistically differ from the true MST's. For the case of increased highlighted parameter size. both methods failed to predict MST's accurately, but the differences from the true MST were smaller when predicted by ANN than by regression model (p=0.0005). This study shows that ANN is a good predictor of a visual search performance and can substitute the regression method under certain circumstances.

  • PDF

Influence of Perceptual Information of Previewing Stimulus on the Target Search Process: An Eye-tracking Study (사전제시 자극의 지각적 정보가 목표자극 탐색에 미치는 영향: 안구추적연구)

  • Lee, Donghoon;Kim, Shinjung;Jeong, Myung Yung
    • Korean Journal of Cognitive Science
    • /
    • v.25 no.3
    • /
    • pp.211-232
    • /
    • 2014
  • People search a certain object or a person so many time in a day. Besides the information about what the target is, perceptual information of the target can influence on the search process. In the current study, using an eye-tracker we aimed to examine whether the perceptual information of previewing target stimuli on the visual search process of the target and the task performance. Participants had to identify the previewing target stimulus presented in the middle of the screen, and then had to search the target among 8 items presented in a circle array, and had to decide whether the size of the target in the search display was same as that of the previewing stimulus. The experimental conditions were divided into 8 within-subject conditions by whether the search display was consisted of all the same size items or different size items (homogeneous search display vs. inhomogeneous search display), by the size of the preview target stimulus, and by the size of the target stimulus in the search display. Research hypothesis is that the size information of the previewing influence on the visual search process of the target and task performance when the items in the search display are in different sizes. In the results of behavioral data analysis, the reaction time showed the main effect of the search display, and the size of the target stimulus in the search display. and the interaction between the size consistency effect of target stimulus and the search display condition. In the results of analysis of eye-movement information, the Initial Saccade to Target Ratio measurement showed the interaction between the size consistency effect of target stimulus and the search display condition as the reaction time measurement did. That is, the size consistency effect of target stimulus only in the inhomogeneous search display condition indicated that participants searched the items in the same size as that of preview target stimulus. Post-hoc analyses revealed that the search and task performance in the inhomogeneous display condition were faster when the target size was consistent, but rather slower when the target size was inconsistent.