• Title/Summary/Keyword: 휴리스틱평가

Search Result 207, Processing Time 0.026 seconds

Border-based HSFI Algorithm for Hiding Sensitive Frequent Itemsets (민감한 빈발항목집합을 숨기기 위한 경계기반 HSFI 알고리즘)

  • Lee, Dan-Young;An, Hyoung-Keun;Koh, Jae-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.10
    • /
    • pp.1323-1334
    • /
    • 2011
  • This paper suggests the border based HSFI algorithm to hide sensitive frequent itemsets. Node formation of FP-Tree which is different from the previous one uses the border to minimize the impacts of nonsensitive frequent itemsets in hiding process, including the organization of sensitive and border information, and all transaction as well. As a result of applying HSFI algorithms, it is possible to be the example transaction database, by significantly reducing the lost items, it turns out that HSFI algorithm is more effective than the existing algorithm for maintaining the quality of more improved database.

Task Scheduling and Multiple Operation Analysis of Multi-Function Radars (다기능 레이더의 임무 스케줄링 및 복수 운용 개념 분석)

  • Jeong, Sun-Jo;Jang, Dae-Sung;Choi, Han-Lim;Yang, Jae-Hoon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.42 no.3
    • /
    • pp.254-262
    • /
    • 2014
  • Radar task scheduling deals with the assignment of task to efficiently enhance the radar performance on the limited resource environment. In this paper, total weighted tardiness is adopted as the objective function of task scheduling in operation of multiple multi-function radars. To take into account real-time implementability, heuristic index-based methods are presented and investigated. Numerical simulations for generic search and track scenarios are performed to evaluate the proposed methods, in particular investigating the effectiveness of multi-radar operation concepts.

A Simulated Annealing Algorithm for Maximum Lifetime Data Aggregation Problem in Wireless Sensor Networks (무선 센서 네트워크에서 최대 수명 데이터 수집 문제를 위한 시뮬레이티드 어닐링 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.7
    • /
    • pp.1715-1724
    • /
    • 2013
  • The maximum lifetime data aggregation problem is to maximize the network lifetime as minimizing the transmission energy of all deployed nodes in wireless sensor networks. In this paper, we propose a simulated annealing algorithm to solve efficiently the maximum lifetime data aggregation problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the network lifetime and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the maximum lifetime data aggregation problem in wireless sensor networks.

An Optimization Algorithm for Minimum Energy Broadcast Problem in Wireless Sensor Networks (무선 센서 네트워크에서 최소 전력 브로드캐스트 문제를 위한 최적화 알고리즘)

  • Jang, Kil-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.236-244
    • /
    • 2012
  • The minimum energy broadcast problem is for all deployed nodes to minimize a total transmission energy for performing a broadcast operation in wireless networks. In this paper, we propose a Tabu search algorithm to solve efficiently the minimum energy broadcast problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the total transmission energy of nodes and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the minimum energy broadcast problem in wireless sensor networks.

A Heuristic for the Operation Problem of the Vending Machine System (자판기 시스템 운영문제의 휴리스틱 해법 개발과 평가)

  • Park, Yang-Byung;Jang, Won-Jun;Park, Hae-Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.4
    • /
    • pp.152-161
    • /
    • 2011
  • The operation of vending machine system presents a decision-making problem which consists of determining the product allocation to vending-machine storage compartments, replenishment intervals of vending machines, and vehicle routes, all of which have critical effects on system profit. Especially, it becomes more difficult to determine the operation variables optimally when demand for a product that is out-of-stock spills over to another product or is lost. In this paper, we propose a heuristic for solving the operation problem of the vending machine system and evaluate it by comparing with Yang's algorithm on various test problems with respect to system profit via a computer simulation. The results of computational experiments show a substantial profit increase of the proposed heuristic over Yang's algorithm. Sensitivity analysis indicates that some input variables impact the profit increase significantly.

A Study on Node Selection Strategy for the Virtual Network Embedding (가상 네트워크 대응 시 노드 선택 기준에 대한 고찰)

  • Woo, Miae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.8
    • /
    • pp.491-498
    • /
    • 2014
  • Due to the ossification of current Internet, it is hard to accommodate new service requirements. One of the solutions to this problem is network virtualization. In this paper, we propose a heuristic virtual network embedding method for network virtualization. The proposed method checks whether the candidate substrate nodes in the substrate network have the possibility of satisfying virtual link requirements. It gives priority to the virtual nodes and the substrate nodes, and embeds the node with higher priority first. Also, the proposed method tries to cluster the mapped substrate nodes if possible. We evaluate the performance of the proposed method in terms of time complexity and virtual network acceptance rate.

Modelling of Image Acquisition Scenario and Verification of Mission Planning Algorithm for SAR Satellite (SAR위성의 영상획득 시나리오 모델링 및 임무설계 알고리즘 성능검증)

  • Shin, Hohyun;Kim, Jongpil
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.8
    • /
    • pp.590-598
    • /
    • 2019
  • Today, satellites are widely used in many fields like communication and image recoding. The image acquired by satellites contains variety information of wide region. Therefore, they are used for agriculture, resource exploitation and management, and military purpose. The satellite is required to acquire images effectively in a given time period. Because the period that satellites can acquire images is very restrictive. In this study, the modeling of processing time and attitude maneuvering for satellite image acquisition is performed. From this modeling, mission planning algorithm using heuristic evaluation function is suggested and performance of the proposed algorithm is verified by numerical simulation.

Learning Material Bookmarking Service based on Collective Intelligence (집단지성 기반 학습자료 북마킹 서비스 시스템)

  • Jang, Jincheul;Jung, Sukhwan;Lee, Seulki;Jung, Chihoon;Yoon, Wan Chul;Yi, Mun Yong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.179-192
    • /
    • 2014
  • Keeping in line with the recent changes in the information technology environment, the online learning environment that supports multiple users' participation such as MOOC (Massive Open Online Courses) has become important. One of the largest professional associations in Information Technology, IEEE Computer Society, announced that "Supporting New Learning Styles" is a crucial trend in 2014. Popular MOOC services, CourseRa and edX, have continued to build active learning environment with a large number of lectures accessible anywhere using smart devices, and have been used by an increasing number of users. In addition, collaborative web services (e.g., blogs and Wikipedia) also support the creation of various user-uploaded learning materials, resulting in a vast amount of new lectures and learning materials being created every day in the online space. However, it is difficult for an online educational system to keep a learner' motivation as learning occurs remotely, with limited capability to share knowledge among the learners. Thus, it is essential to understand which materials are needed for each learner and how to motivate learners to actively participate in online learning system. To overcome these issues, leveraging the constructivism theory and collective intelligence, we have developed a social bookmarking system called WeStudy, which supports learning material sharing among the users and provides personalized learning material recommendations. Constructivism theory argues that knowledge is being constructed while learners interact with the world. Collective intelligence can be separated into two types: (1) collaborative collective intelligence, which can be built on the basis of direct collaboration among the participants (e.g., Wikipedia), and (2) integrative collective intelligence, which produces new forms of knowledge by combining independent and distributed information through highly advanced technologies and algorithms (e.g., Google PageRank, Recommender systems). Recommender system, one of the examples of integrative collective intelligence, is to utilize online activities of the users and recommend what users may be interested in. Our system included both collaborative collective intelligence functions and integrative collective intelligence functions. We analyzed well-known Web services based on collective intelligence such as Wikipedia, Slideshare, and Videolectures to identify main design factors that support collective intelligence. Based on this analysis, in addition to sharing online resources through social bookmarking, we selected three essential functions for our system: 1) multimodal visualization of learning materials through two forms (e.g., list and graph), 2) personalized recommendation of learning materials, and 3) explicit designation of learners of their interest. After developing web-based WeStudy system, we conducted usability testing through the heuristic evaluation method that included seven heuristic indices: features and functionality, cognitive page, navigation, search and filtering, control and feedback, forms, context and text. We recruited 10 experts who majored in Human Computer Interaction and worked in the same field, and requested both quantitative and qualitative evaluation of the system. The evaluation results show that, relative to the other functions evaluated, the list/graph page produced higher scores on all indices except for contexts & text. In case of contexts & text, learning material page produced the best score, compared with the other functions. In general, the explicit designation of learners of their interests, one of the distinctive functions, received lower scores on all usability indices because of its unfamiliar functionality to the users. In summary, the evaluation results show that our system has achieved high usability with good performance with some minor issues, which need to be fully addressed before the public release of the system to large-scale users. The study findings provide practical guidelines for the design and development of various systems that utilize collective intelligence.

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

Conjunctive Boolean Query Optimization based on Join Sequence Separability in Information Retrieval Systems (정보검색시스템에서 조인 시퀀스 분리성 기반 논리곱 불리언 질의 최적화)

  • 박병권;한욱신;황규영
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.395-408
    • /
    • 2004
  • A conjunctive Boolean text query refers to a query that searches for tort documents containing all of the specified keywords, and is the most frequently used query form in information retrieval systems. Typically, the query specifies a long list of keywords for better precision, and in this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics and, therefore, cannot guarantee an optimal ordering. We can use a systematic approach by leveraging a database query processing algorithm like the dynamic programming, but it is not suitable for a text query with a typically long list of keywords because of the algorithm's exponential run-time (Ο(n2$^{n-1}$)) for n keywords. Considering these problems, we propose a new approach based on a property called the join sequence separability. This property states that the optimal join sequence is separable into two subsequences of different join methods under a certain condition on the joined relations, and this property enables us to find a globally optimal join sequence in Ο(n2$^{n-1}$). In this paper we describe the property formally, present an optimization algorithm based on the property, prove that the algorithm finds an optimal join sequence, and validate our approach through simulation using an analytic cost model. Comparison with the heuristic text query optimization approaches shows a maximum of 100 times faster query processing, and comparison with the dynamic programming approach shows exponentially faster query optimization (e.g., 600 times for a 10-keyword query).