• Title/Summary/Keyword: Resource Search

Search Result 408, Processing Time 0.026 seconds

Optimal Operation Scheme of MicroGrid System based on Renewable Energy Resources (신재생 에너지원 기반의 마이크로그리드 최적운영 방안)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;Lee, Sang-Geun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.8
    • /
    • pp.1467-1472
    • /
    • 2011
  • This paper presents an optimal operation of microgrid systems and considering a tie-lines capacities that concerned each grid. The microgrid system consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile and wind resource for wind turbine generator were used for the study. For the grid interconnection, tie-line capacities were applied as constraints. The capacity constraints of tie-lines in production cost analysis are very important issues in the operation and planning of microgrid. In optimization, the Harmony Search (HS) algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch.

APPLICATION OF CONSTRAINT LOGIC PROGRAMMING TO JOB SEQUENCING

  • Ko, Jesuk;Ku, Jaejung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.617-620
    • /
    • 2000
  • In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

  • PDF

Multi-level Scheduling Algorithm Based on Storm

  • Wang, Jie;Hang, Siguang;Liu, Jiwei;Chen, Weihao;Hou, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1091-1110
    • /
    • 2016
  • Hybrid deployment under current cloud data centers is a combination of online and offline services, which improves the utilization of the cluster resources. However, the performance of the cluster is often affected by the online services in the hybrid deployment environment. To improve the response time of online service (e.g. search engine), an effective scheduling algorithm based on Storm is proposed. At the component level, the algorithm dispatches the component with more influence to the optimal performance node. Inside the component, a reasonable resource allocation strategy is used. By searching the compressed index first and then filtering the complete index, the execution speed of the component is improved with similar accuracy. Experiments show that our algorithm can guarantee search accuracy of 95.94%, while increasing the response speed by 68.03%.

Collaborative Information Retrieval (협동에이전트를 이용한 정보검색)

  • 명순희
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.2
    • /
    • pp.43-49
    • /
    • 2000
  • The World Wide Web has become a vast information resource where virtually any information can be found. There is a pressing need for appropriate Web search tools due to the very vastness of information space, the rate of growth, and the volatility of data. The agent technology has been studied to address these issues and led to the creation of an adaptive, Proactive. personalized search tools. This study looks into the mechanism of collaborative filtering of information and suggests a decentralized collaborating agents model for information discovery.

  • PDF

Advanced Manufacturing Technologies on the World Wide Web: Methodologies and Application Techniques (World Wide Web 상의 첨단 생산 기술: 방법론과 응용기술)

  • Kim, Seong-Jip;Kim, Nak-Hyun;Yang, Tae-Kon
    • IE interfaces
    • /
    • v.9 no.3
    • /
    • pp.306-316
    • /
    • 1996
  • The easily use of WWW and Web browser of INTERNET makes the world our stage. But when we search for the information and resource that we want, the information supplied by search engine (e.g., Yahoo, Lycos, WebCrawler, Alta Vista) is inadequate to acquire the necessary and related information of research issues. This paper surveys AMT(Advanced Manufacturing Technology) which is the research topics recently on the WWW(WorLd Wide Web) and provides searching methods and information for academic research, technical report, proceedings, software, etc. It also briefly surveys WWW-VL(Virtual Library) and reviews the major three technology, CALS (Commerce At Light Speed), AMS(Agile Manufacturing System), CE(Concurrent Engineering), that is recently the focus of the research issue of Industrial Engineer.

  • PDF

Search Performance Experiments of SQLite Database on Linux Environments (Linux환경에서 SQLite 데이터베이스의 검색 성능 실험)

  • Kim, Soo-hwan;Choi, Jin-oh
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.445-447
    • /
    • 2016
  • SQLite, Realm, etc. are database engines which are suitable for small devices that have large resource restriction and are used a lot in mobile devices based on Linux. These engines are open source programs and have advantages which are lighter weight and faster speed than general purpose databases. This paper implements performance test program and performs performance experiment of SQLite database to test search efficiency in Linux environments. The experiment is processed by comparison with the results of a Oracle database working out at the same environment.

  • PDF

An Exploratory Study on Issues Related to chatGPT and Generative AI through News Big Data Analysis

  • Jee Young Lee
    • International Journal of Advanced Culture Technology
    • /
    • v.11 no.4
    • /
    • pp.378-384
    • /
    • 2023
  • In this study, we explore social awareness, interest, and acceptance of generative AI, including chatGPT, which has revolutionized web search, 30 years after web search was released. For this purpose, we performed a machine learning-based topic modeling analysis based on Korean news big data collected from November 30, 2022, when chatGPT was released, to August 31, 2023. As a result of our research, we have identified seven topics related to chatGPT and generative AI; (1)growth of the high-performance hardware market, (2)service contents using generative AI, (3)technology development competition, (4)human resource development, (5)instructions for use, (6)revitalizing the domestic ecosystem, (7)expectations and concerns. We also explored monthly frequency changes in topics to explore social interest related to chatGPT and Generative AI. Based on our exploration results, we discussed the high social interest and issues regarding generative AI. We expect that the results of this study can be used as a precursor to research that analyzes and predicts the diffusion of innovation in generative AI.

Quay Wall Scheduling of Ships Using Assignment Method and Tabu Search Algorithm (할당기법과 타부서치 알고리즘을 이용한 선박의 안벽배치 계획)

  • Lee, Sang Hyup;Hong, Soon Ik;Ha, Seung Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.1
    • /
    • pp.1-9
    • /
    • 2015
  • In shipbuling processes, a quay wall is a major resource for additional operations after an erection operation at dock. A quay wall is becoming a new bottleneck instead of docks, while ship types with long operation time at quay wall are increasing recently. We developed a quay wall scheduling algorithm for the quayside operations of ships in this paper. The objective function is to minimize the sum of not assigned days of ships which have to be assigned to any quay wall under limited numbers of quay walls. The scheduling algorithm is based on an assignment method to assign each ship to a quay wall among its alternative quay walls at the time of launching or moving to another quay wall. The scheduling algorithm is also using Tabu Search algorithm to optimize assignment sequence of ships. The experiment shows that the algorithms in this paper are effective to make schedule of the quayside operations of ships.

An Effective Backtracking Search Algorithm for the P2P Resources (효과적인 역 추적 P2P 자원 검색 알고리즘)

  • Kim, Boon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.49-57
    • /
    • 2007
  • The P2P distributed systems are proceeded various studies lively to use the idleness computing resources under the network connected computing environments. It's a general mean to communication from the peer of the shortest downloaded time among same target files to be searched. The P2P search algorithms are very important primary factor to decide a real downloaded time in the criteria to select the peer of a shortest downloaded time. However the peer to give resources could be changed into offline status because the P2P distributed systems have very weakness connection. In these cases. we have a choice to retransmit resources mainly. In this study, we suggested an effective backtracking search algorithm to improve the performance about the request to retransmit the resource.

  • PDF

Search for Ultra-faint Dwarfs in the Halo of M60, Giant Elliptical Galaxy in Virgo

  • LEE, JEONG HWAN;LEE, MYUNG GYOON;JANG, IN SUNG
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.2
    • /
    • pp.63.2-63.2
    • /
    • 2016
  • One of the well-known problems in the lambda cold dark matter (${\Lambda}CDM$) models is a missing satellite problem. The slope of the mass function of low mass galaxies predicted by ${\Lambda}CDM$ models is much steeper than that based on the luminosity function of dwarf galaxies in the local universe. This implies that the model prediction is an overestimate of low mass galaxies, or that the current census of dwarf galaxies in the local universe may be an underestimate of dwarf galaxies. Previous studies of galaxy luminosity functions to address this problem are based mostly on the sample of galaxies brighter than Mv ~ -10 in the nearby galaxies. In this study we try to search for ultra-faint galaxies (UFDs), which are much fainter than those in the previous studies. We use multi-field HST ACS images of M60 in the archive. M60 is a giant elliptical galaxy located in the east part of the Virgo cluster, and hosts a large population of globular clusters and UCDs. Little is known about the dwarf galaxies in this galaxy. UFDs are much fainter, much smaller, and have lower surface brightness than normal dwarf galaxies so HST images of massive galaxies are an ideal resource. We present preliminary results of this search.

  • PDF