• 제목/요약/키워드: Community algorithm

검색결과 194건 처리시간 0.027초

가시화 프로그램에서의 데이터 구조와 가시화 알고리즘 (Data Structure and Visualization Algorithm in a Post-processing Program)

  • 나정수;김기영;김병수
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2003년도 추계 학술대회논문집
    • /
    • pp.82-87
    • /
    • 2003
  • Post-processing programs play an important role in the CFD data visualization and analysis. A variety of post-processing softwares have been developed and are being used in the CFD community. Developing a good quality of post-processing program requires dedication and efforts. In this paper an experience obtained through previous studies and developing post-processing programs are introduced which includes data structure and visualization algorithms.

  • PDF

CES 발전소의 최적운용 알고리즘 개발 (Development of Optimal Operation Algorithm about CES Power Plant)

  • 김용하;박화용;김의경;우성민;이원구
    • 조명전기설비학회논문지
    • /
    • 제26권2호
    • /
    • pp.61-70
    • /
    • 2012
  • Recently due to the increasing of the importance on the green energy is getting higher by implementing EERS(Energy Efficiency Resource Standards) and NA(Negotiated Agreement) such as lacks of natural resources and The United Nations Framework Convention on Climate Change. And the most practical solution is CHP(Combined Heat and Power) which performs the best energy efficiency. This paper developed optimal operation mechanism of CES(Community Energy System) for enhancement of energy efficiency using CHP(Combined Heat and Power), PLB(Peak Load Boiler) and ACC(ACCumulator) capacities. This method optimally operated these capacities calculated the maximum profits by Dynamic Programing. Through the case studies, it is verified that the proposed algorithm of can evaluate availability.

An Efficient Algorithm for Mining Frequent Sequences In Spatiotemporal Data

  • ;지정희;류근호
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 한국공간정보시스템학회 2005년도 추계학술대회
    • /
    • pp.61-66
    • /
    • 2005
  • Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

  • PDF

Thermo-Elastic Analysis for Chattering Phenomenon of Automotive Disk Brake

  • Cho, Chongdu;Ahn, Sooick
    • Journal of Mechanical Science and Technology
    • /
    • 제15권5호
    • /
    • pp.569-579
    • /
    • 2001
  • This study investigates the effects of operating conditions on the chattering of an automotive disk brake by experimental and computational methods. Design factors, which cause chattering in automobiles, have attracted great attentions for long time; but they are not well understood yet. For this study, we construct a brake dynamometer for measuring the disk surface temperature during chattering, and propose an efficient hybrid algorithm (combining FFT-FEA and traditional FEA program) for analyzing the thermo-elastic behavior of three-dimensional brake system. We successfully measure the judder in a brake system via the dynamometer and efficiently simulate the contact pressure variation by the hybrid algorithm. The three-dimensional simulation of thermo-mechanical interactions on the automotive brake, showing the transient thermo-elastic instability phenomenon, is presented for the first time in this academic community. We also find from the experimental study that the disk bulk temperature strongly influences the brake chattering in the automotive disk brakes.

  • PDF

An Optimization Approach to Data Clustering

  • Kim, Ju-Mi;Olafsson, Sigurdur
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
    • /
    • pp.621-628
    • /
    • 2005
  • Scalability of clustering algorithms is critical issues facing the data mining community. This is particularly true for computationally intense tasks such as data clustering. Random sampling of instances is one possible means of achieving scalability but a pervasive problem with this approach is how to deal with the noise that this introduces in the evaluation of the learning algorithm. This paper develops a new optimization based clustering approach using an algorithms specifically designed for noisy performance. Numerical results illustrate that with this algorithm substantial benefits can be achieved in terms of computational time without sacrificing solution quality.

  • PDF

Data Reduction Method in Massive Data Sets

  • Namo, Gecynth Torre;Yun, Hong-Won
    • Journal of information and communication convergence engineering
    • /
    • 제7권1호
    • /
    • pp.35-40
    • /
    • 2009
  • Many researchers strive to research on ways on how to improve the performance of RFID system and many papers were written to solve one of the major drawbacks of potent technology related with data management. As RFID system captures billions of data, problems arising from dirty data and large volume of data causes uproar in the RFID community those researchers are finding ways on how to address this issue. Especially, effective data management is important to manage large volume of data. Data reduction techniques in attempts to address the issues on data are also presented in this paper. This paper introduces readers to a new data reduction algorithm that might be an alternative to reduce data in RFID Systems. A process on how to extract data from the reduced database is also presented. Performance study is conducted to analyze the new data reduction algorithm. Our performance analysis shows the utility and feasibility of our categorization reduction algorithms.

Advances in Chemical Process Control and Operation -A view experienced in joint university-industry projects

  • Ohshima, Masahiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
    • /
    • pp.1.2-6
    • /
    • 1994
  • A state or the arts in Japanese chemical process control is reviewed based on experience in applying advanced process control schemes to several industrial chemical processes. The applications validate model predictive control (MPC), the most popular advanced control scheme in the process control community, as, indeed, a powerful and practical control algorithm. However, at the same time, it is elucidated that MPC can solve only the control algorithm part of the problem and one needs chemical and systems engineering aspects to solve the entire problem. By illustrating several industrial process control problems, the need for chemical engineering aspects as well as the future direction for process control are addressed, especially in light or current attitudes toward product quality.

  • PDF

재무부실화 예측을 위한 랜덤 서브스페이스 앙상블 모형의 최적화 (Optimization of Random Subspace Ensemble for Bankruptcy Prediction)

  • 민성환
    • 한국IT서비스학회지
    • /
    • 제14권4호
    • /
    • pp.121-135
    • /
    • 2015
  • Ensemble classification is to utilize multiple classifiers instead of using a single classifier. Recently ensemble classifiers have attracted much attention in data mining community. Ensemble learning techniques has been proved to be very useful for improving the prediction accuracy. Bagging, boosting and random subspace are the most popular ensemble methods. In random subspace, each base classifier is trained on a randomly chosen feature subspace of the original feature space. The outputs of different base classifiers are aggregated together usually by a simple majority vote. In this study, we applied the random subspace method to the bankruptcy problem. Moreover, we proposed a method for optimizing the random subspace ensemble. The genetic algorithm was used to optimize classifier subset of random subspace ensemble for bankruptcy prediction. This paper applied the proposed genetic algorithm based random subspace ensemble model to the bankruptcy prediction problem using a real data set and compared it with other models. Experimental results showed the proposed model outperformed the other models.

Toward a New Safer Cybersecurity Posture using RC6 & RSA as Hybrid Crypto-Algorithms with VC Cipher

  • Jenan.S, Alkhonaini;Shuruq.A, Alduraywish;Maria Altaib, Badawi
    • International Journal of Computer Science & Network Security
    • /
    • 제23권1호
    • /
    • pp.164-168
    • /
    • 2023
  • As our community has become increasingly dependent on technology, security has become a bigger concern, which makes it more important and challenging than ever. security can be enhanced with encryption as described in this paper by combining RC6 symmetric cryptographic algorithms with RSA asymmetric algorithms, as well as the Vigenère cipher, to help manage weaknesses of RC6 algorithms by utilizing the speed, security, and effectiveness of asymmetric algorithms with the effectiveness of symmetric algorithm items as well as introducing classical algorithms, which add additional confusion to the decryption process. An analysis of the proposed encryption speed and throughput has been conducted in comparison to a variety of well-known algorithms to demonstrate the effectiveness of each algorithm.

잠재적 소셜 네트워크를 이용하여 스펙트럼 분할하는 방식 기반 영화 추천 시스템 (A Movie recommendation using method of Spectral Bipartition on Implicit Social Network)

  • 일홈존 ;펭소니 ;싯소포호트 ;김대영 ;박두순
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2023년도 추계학술발표대회
    • /
    • pp.322-326
    • /
    • 2023
  • We propose a method of movie recommendation that involves an algorithm known as spectral bipartition. The Social Network is constructed manually by considering the similar movies viewed by users in MovieLens dataset. This kind of similarity establishes implicit ties between viewers. Because we assume that there is a possibility that there might be a connection between users who share the same set of viewed movies. We cluster users by applying a community detection algorithm based on the spectral bipartition. This study helps to uncover the hidden relationships between users and recommend movies by considering that feature.