• Title/Summary/Keyword: Range Searches

Search Result 69, Processing Time 0.025 seconds

A Study on Cost Function of Distributed Stochastic Search Algorithm for Ship Collision Avoidance (선박 간 충돌 방지를 위한 분산 확률 탐색 알고리즘의 비용 함수에 관한 연구)

  • Kim, Donggyun
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.2
    • /
    • pp.178-188
    • /
    • 2019
  • When using a distributed system, it is very important to know the intention of a target ship in order to prevent collisions. The action taken by a certain ship for collision avoidance and the action of the target ship it intends to avoid influence each other. However, it is difficult to establish a collision avoidance plan in consideration of multiple-ship situations for this reason. To solve this problem, a Distributed Stochastic Search Algorithm (DSSA) has been proposed. A DSSA searches for a course that can most reduce cost through repeated information exchange with target ships, and then indicates whether the current course should be maintained or a new course should be chosen according to probability and constraints. However, it has not been proven how the parameters used in DSSA affect collision avoidance actions. Therefore, in this paper, I have investigated the effect of the parameters and weight factors of DSSA. Experiments were conducted by combining parameters (time window, safe domain, detection range) and weight factors for encounters of two ships in head-on, crossing, and overtaking situations. A total of 24,000 experiments were conducted: 8,000 iterations for each situation. As a result, no collision occurred in any experiment conducted using DSSA. Costs have been shown to increase if a ship gives a large weight to its destination, i.e., takes selfish behavior. The more lasting the expected position of the target ship, the smaller the sailing distance and the number of message exchanges. The larger the detection range, the safer the interaction.

An Analysis of Key Words Related to Traditional Korean Medicine Using Big Data of Two Search Engines (2대 포털사이트 빅데이터를 이용한 한방관련 키워드 분석)

  • Ahn, Jung-Yun;Keum, Ga-Jeong;Jang, Ah-Ryeong;Song, Ji-Chung
    • The Journal of Korean Medical History
    • /
    • v.30 no.2
    • /
    • pp.45-61
    • /
    • 2017
  • Objectives : This research aims to investigate the consumer's interest in the Korean Medicine (KM) industry by using Google-trends and Naver-Data lab. A quick and uncomplicated way for those who are already involved with KM industry but do not have expertise in utilizing Big-data searches, is introduced. Methods : 'Direct keyword' was set by FGI (Focus Group Interview) and 'Detailed keyword' was set by using relevant word search and autocomplete search functions in the search engine. By inquiring Naver-Data lab, keyword search volumes are compared by age and sex, date range, and originating region of the researcher. It is possible to determine whether the data is reliable or authentic through examining the associated query. Selected direct keywords used through FGI (Focus Group Interview) were 'Acupuncture', 'Herbal Medicine', 'Cupping', 'Musculoskeletal Disease', 'Diet', and 'Stemina'. Based on these keywords, the following results were derived from the keyword analysis. Results : From August 2016, there was a noticeable surge of interest in men's 'Cupping'. The search for 'Diet' increased in the second quarter of 2016 from all ages. The search volume of 'Stemna' for individuals in their 20s is higher than that of those in their 30s or 40s'. Researchers from the region of Chungcheongbuk-do had a higher level of interest in analgesics and less interest in Korean Medicine. There is a greater interest in the KM market from European countries and America, than from Korea, China, and other Asian countries. Discussion : Despite the limitations of the research, it is meaningful to introduce a quick and easy data search method to compare information by age, sex, and region. Conclusion : The future of research into Korea Medicine and this market is confirmed by our data results which indicate interest from Europe, the United States, and other western countries, but less interest from Korea, China and other Asian countries.

Development of Korean Version of the Dementia Eating Evaluation Tool based on Behavioral Observation (행동관찰 기반 치매 식이 평가 도구의 한국판 개발)

  • Seo, Sang-Min;Woo, Hee-Soon
    • Therapeutic Science for Rehabilitation
    • /
    • v.9 no.1
    • /
    • pp.56-68
    • /
    • 2020
  • Objective : This study introduces domestic and overseas systematic assessment tools that can identify eating problems of dementia patients based on abnormal behavior observations and turns them into Korean through the verification of content placement by expert groups. Methods : Three types of assessment tools were selected for final development in Korean version through several meetings based on a wide range of relevant literature searches. The 3 selected assessment tools were first translated by the researchers, and a 9-person expert team was used to verify the Content Validity Index. Results : The EBS content equivalence calculation shows that all 6 questions and 1 response item had a CVI value 0.9, and all items were included in Korean EBS without modification. The EdFED content equivalence calculation showed that all 11 questions had CVI value 0.9, which was included in the Korean edition of EdFED without modification. The content equivalence calculation of the FDI showed that all 19 questions had a CVI of 0.8 or higher, and all items were included in the Korean version of the FDI without modification of the item. Conclusion : Korean versions of the EBS, EdFED and FDI, which are based on behavioral observation and diet tools for people with dementia, have been developed. Early determination of problems related to diet in dementia patients and providing proper intervention through observational Korean version assessment tools is vital in terms of strengthening patient nutrition and reducing caregivers' burden.

Effects of Biofeedback Based Deep Neck Flexion Exercise on Neck Pain: Meta-analysis (바이오피드백을 이용한 심부목굽힘근운동이 목 질환에 미치는 영향: 메타분석)

  • Park, Joo-Hee;Jeon, Hye-Seon;Kim, Ji-hyun;Kim, Ye Jin;Moon, Gyeong Ah;Lim, One-bin
    • Physical Therapy Korea
    • /
    • v.28 no.1
    • /
    • pp.18-26
    • /
    • 2021
  • Previous studies have reported that deep neck flexor (DNF) exercise can improve neck problems, including neck pain, forward head posture, and headache, by targeting the deep and superficial muscles of the neck. Despite the prevailing opinion across studies, the benefits of DNF can vary according to the type of neck problems and the outcome measures adopted, ranging from positive outcomes to non-significant benefits. A meta-analysis was conducted in this study to assess conclusive evidence of the impact of DNF exercise on individuals with neck problems. We used PUBMED, MEDLINE, NDSL, EMBASE, and Web of Science to search for primary studies and the key terms used in these searches were "forward head posture (FHP)," "biofeedback," "pressure biofeedback unit," "stabilizer," "headache," and "neck pain." Twenty-four eligible studies were included in this meta-analysis and were coded according to the type of neck problems and outcome measures described, such as pain, endurance, involvement of neck muscle, craniovertebral angle (CVA), neck disability index (NDI), cervical range of motion (CROM), radiographs of the neck, posture, strength, endurance, and headache disability index. The overall effect size of the DNF exercise was 0.489. The effect sizes of the neck problems were 0.556 (neck pain), -1.278 (FHP), 0.176 (headache), and 1.850 (mix). The effect sizes of outcome measures were 1.045 (pain), 0.966 (endurance), 0.894 (deep neck flexor), 0.608 (superficial neck flexor), 0.487 (CVA), 0.409 (NDI), and 0.252 (CROM). According to the results of this study, DNF exercise can effectively reduce neck pain. Thus, DNF exercise is highly recommend as an effective exercise method for individuals suffering from neck pain.

Analyzing Global Startup Trends Using Google Trends Keyword Big Data Analysis: 2017~2022 (Google Trends 의 키워드 빅데이터 분석을 활용한 글로벌 스타트업 트렌드 분석: 2017~2022 )

  • Jaeeog Kim;Byunghoon Jeon
    • Journal of Platform Technology
    • /
    • v.11 no.4
    • /
    • pp.19-34
    • /
    • 2023
  • In order to identify the trends and insights of 'startups' in the global era, we conducted an in-depth trend analysis of the global startup ecosystem using Google Trends, a big data analysis platform. For the validity of the analysis, we verified the correlation between the keywords 'startup' and 'global' through BIGKinds. We also conducted a network analysis based on the data extracted using Google Trends to determine the frequency of searches for the keyword or term 'startup'. The results showed a strong positive linear relationship between the keywords, indicating a statistically significant correlation (correlation coefficient: +0.8906). When exploring global startup trends using Google Trends, we found a terribly similar linear pattern of increasing and decreasing interest in each country over time, as shown in Figure 4. In particular, startup interest was low in the range of 35 to 76 from mid-2020 due to the COVID-19 pandemic, but there was a noticeable upward trend in startup interest after March 2022. In addition, we found that the interest in startups in each country except South Korea is very similar, and the related topics are startup company, technology, investment, funding, and keyword search terms such as best startup, tech, business, invest, health, and fintech are highly correlated.

  • PDF

Pharmacoacupuncture for the Treatment of Frozen Shoulder: protocol for a systematic review and meta-analysis

  • Ji-Ho Lee;Hyeon-Sun Park;Sang-Hyeon Park;Dong-Ho Keum;Seo-Hyun Park
    • Journal of Pharmacopuncture
    • /
    • v.27 no.1
    • /
    • pp.14-20
    • /
    • 2024
  • Objectives: Frozen shoulder (FS) is one of the most challenging shoulder disorders for patients and clinicians. Its symptoms mainly include any combination of stiffness, nocturnal pain, and limitation of active and passive glenohumeral joint movement. Conventional treatment options for FS are physical therapy, nonsteroidal anti-inflammatory drugs, injection therapy, and arthroscopic capsular release, but adverse and limited effects continue to present problems. As a result, pharmacoacupuncture (PA) is getting attention as an alternative therapy for patients with FS. PA is a new form of acupuncture treatment in traditional Korean medicine (TKM) that is mainly used for musculoskeletal diseases. It has similarity and specificity compared to corticosteroid injection and hydrodilatation, making it a potential alternative injection therapy for FS. However, no systematic reviews investigating the utilization of PA for FS have been published. Therefore, this review aims to standardize the clinical use of PA for FS and validate its therapeutic effect. Methods: The protocol was registered in Prospero (CRD42023445708) on 18 July 2023. Until Aug. 31, 2023, seven electronic databases will be searched for randomized controlled trials of PA for FS. Authors will be contacted, and manual searches will also be performed. Two reviewers will independently screen and collect data from retrieved articles according to predefined criteria. The primary outcome will be pain intensity, and secondary outcomes will be effective rate, Constant-Murley Score, Shoulder Pain and Disability Index, range of motion, quality of life, and adverse events. Bias and quality of the included trials will be assessed using the Cochrane handbook's risk-of-bias tool for randomized trials. Meta analyses will be conducted using Review Manager V.5.3 software. GRADE will be used to evaluate the level of evidence for each outcome. Results: This systematic review and meta-analysis will be conducted following PRISMA statement. The results will be published in a peer-reviewed journal. Conclusion: This review will provide scientific evidence to support health insurance policy as well as the standardization of PA in clinical practice.

Intelligent Brand Positioning Visualization System Based on Web Search Traffic Information : Focusing on Tablet PC (웹검색 트래픽 정보를 활용한 지능형 브랜드 포지셔닝 시스템 : 태블릿 PC 사례를 중심으로)

  • Jun, Seung-Pyo;Park, Do-Hyung
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.3
    • /
    • pp.93-111
    • /
    • 2013
  • As Internet and information technology (IT) continues to develop and evolve, the issue of big data has emerged at the foreground of scholarly and industrial attention. Big data is generally defined as data that exceed the range that can be collected, stored, managed and analyzed by existing conventional information systems and it also refers to the new technologies designed to effectively extract values from such data. With the widespread dissemination of IT systems, continual efforts have been made in various fields of industry such as R&D, manufacturing, and finance to collect and analyze immense quantities of data in order to extract meaningful information and to use this information to solve various problems. Since IT has converged with various industries in many aspects, digital data are now being generated at a remarkably accelerating rate while developments in state-of-the-art technology have led to continual enhancements in system performance. The types of big data that are currently receiving the most attention include information available within companies, such as information on consumer characteristics, information on purchase records, logistics information and log information indicating the usage of products and services by consumers, as well as information accumulated outside companies, such as information on the web search traffic of online users, social network information, and patent information. Among these various types of big data, web searches performed by online users constitute one of the most effective and important sources of information for marketing purposes because consumers search for information on the internet in order to make efficient and rational choices. Recently, Google has provided public access to its information on the web search traffic of online users through a service named Google Trends. Research that uses this web search traffic information to analyze the information search behavior of online users is now receiving much attention in academia and in fields of industry. Studies using web search traffic information can be broadly classified into two fields. The first field consists of empirical demonstrations that show how web search information can be used to forecast social phenomena, the purchasing power of consumers, the outcomes of political elections, etc. The other field focuses on using web search traffic information to observe consumer behavior, identifying the attributes of a product that consumers regard as important or tracking changes on consumers' expectations, for example, but relatively less research has been completed in this field. In particular, to the extent of our knowledge, hardly any studies related to brands have yet attempted to use web search traffic information to analyze the factors that influence consumers' purchasing activities. This study aims to demonstrate that consumers' web search traffic information can be used to derive the relations among brands and the relations between an individual brand and product attributes. When consumers input their search words on the web, they may use a single keyword for the search, but they also often input multiple keywords to seek related information (this is referred to as simultaneous searching). A consumer performs a simultaneous search either to simultaneously compare two product brands to obtain information on their similarities and differences, or to acquire more in-depth information about a specific attribute in a specific brand. Web search traffic information shows that the quantity of simultaneous searches using certain keywords increases when the relation is closer in the consumer's mind and it will be possible to derive the relations between each of the keywords by collecting this relational data and subjecting it to network analysis. Accordingly, this study proposes a method of analyzing how brands are positioned by consumers and what relationships exist between product attributes and an individual brand, using simultaneous search traffic information. It also presents case studies demonstrating the actual application of this method, with a focus on tablets, belonging to innovative product groups.

Comparison of Association Rule Learning and Subgroup Discovery for Mining Traffic Accident Data (교통사고 데이터의 마이닝을 위한 연관규칙 학습기법과 서브그룹 발견기법의 비교)

  • Kim, Jeongmin;Ryu, Kwang Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.1-16
    • /
    • 2015
  • Traffic accident is one of the major cause of death worldwide for the last several decades. According to the statistics of world health organization, approximately 1.24 million deaths occurred on the world's roads in 2010. In order to reduce future traffic accident, multipronged approaches have been adopted including traffic regulations, injury-reducing technologies, driving training program and so on. Records on traffic accidents are generated and maintained for this purpose. To make these records meaningful and effective, it is necessary to analyze relationship between traffic accident and related factors including vehicle design, road design, weather, driver behavior etc. Insight derived from these analysis can be used for accident prevention approaches. Traffic accident data mining is an activity to find useful knowledges about such relationship that is not well-known and user may interested in it. Many studies about mining accident data have been reported over the past two decades. Most of studies mainly focused on predict risk of accident using accident related factors. Supervised learning methods like decision tree, logistic regression, k-nearest neighbor, neural network are used for these prediction. However, derived prediction model from these algorithms are too complex to understand for human itself because the main purpose of these algorithms are prediction, not explanation of the data. Some of studies use unsupervised clustering algorithm to dividing the data into several groups, but derived group itself is still not easy to understand for human, so it is necessary to do some additional analytic works. Rule based learning methods are adequate when we want to derive comprehensive form of knowledge about the target domain. It derives a set of if-then rules that represent relationship between the target feature with other features. Rules are fairly easy for human to understand its meaning therefore it can help provide insight and comprehensible results for human. Association rule learning methods and subgroup discovery methods are representing rule based learning methods for descriptive task. These two algorithms have been used in a wide range of area from transaction analysis, accident data analysis, detection of statistically significant patient risk groups, discovering key person in social communities and so on. We use both the association rule learning method and the subgroup discovery method to discover useful patterns from a traffic accident dataset consisting of many features including profile of driver, location of accident, types of accident, information of vehicle, violation of regulation and so on. The association rule learning method, which is one of the unsupervised learning methods, searches for frequent item sets from the data and translates them into rules. In contrast, the subgroup discovery method is a kind of supervised learning method that discovers rules of user specified concepts satisfying certain degree of generality and unusualness. Depending on what aspect of the data we are focusing our attention to, we may combine different multiple relevant features of interest to make a synthetic target feature, and give it to the rule learning algorithms. After a set of rules is derived, some postprocessing steps are taken to make the ruleset more compact and easier to understand by removing some uninteresting or redundant rules. We conducted a set of experiments of mining our traffic accident data in both unsupervised mode and supervised mode for comparison of these rule based learning algorithms. Experiments with the traffic accident data reveals that the association rule learning, in its pure unsupervised mode, can discover some hidden relationship among the features. Under supervised learning setting with combinatorial target feature, however, the subgroup discovery method finds good rules much more easily than the association rule learning method that requires a lot of efforts to tune the parameters.

Evaluating Reverse Logistics Networks with Centralized Centers : Hybrid Genetic Algorithm Approach (집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법)

  • Yun, YoungSu
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.55-79
    • /
    • 2013
  • In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.