• Title/Summary/Keyword: Web cluster system

Search Result 117, Processing Time 0.023 seconds

Guideline for Web 2.0 Cluster based Process and Performance Management System (Web 2.0 Cluster 기반의 공정 및 성과관리 시스템 구축에 따른 운영방안 제시)

  • Ong, Ho-Kyoung;Ahn, Jae-Gyu;Kim, Dae-Young
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2007.11a
    • /
    • pp.899-904
    • /
    • 2007
  • Process management techniques are highly important in the construction industry. However, indicators or details of assessment which will show process management and its performance are still very insufficient. In particular, it is true that local corporations or small and medium sized companies suffer more difficulties than ones in metropolitan areas. Therefore, it is necessary to prepare a flexible process management and performance assessment system suited to field situations. This study identified problems of local small and medium sized companies, implemented a process and performance management system using the Lean concept, and systemized a web-based system. Also, the study proposed operational strategies so that small and medium construction companies may access and use the system easily. This will ensure the competitiveness of local small and medium sized companies, will pursue visible outcomes such as construction period reduction and construction cost reduction, and will be utilized as data related to performance assessment both during construction progress and after construction.

  • PDF

Development of a Personalized Recommendation Procedure Based on Data Mining Techniques for Internet Shopping Malls (인터넷 쇼핑몰을 위한 데이터마이닝 기반 개인별 상품추천방법론의 개발)

  • Kim, Jae-Kyeong;Ahn, Do-Hyun;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.3
    • /
    • pp.177-191
    • /
    • 2003
  • Recommender systems are a personalized information filtering technology to help customers find the products they would like to purchase. Collaborative filtering is the most successful recommendation technology. Web usage mining and clustering analysis are widely used in the recommendation field. In this paper, we propose several hybrid collaborative filtering-based recommender procedures to address the effect of web usage mining and cluster analysis. Through the experiment with real e-commerce data, it is found that collaborative filtering using web log data can perform recommendation tasks effectively, but using cluster analysis can perform efficiently.

  • PDF

CERES: A Log-based, Interactive Web Analytics System for Backbone Networks (CERES: 백본망 로그 기반 대화형 웹 분석 시스템)

  • Suh, Ilhyun;Chung, Yon Dohn
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.10
    • /
    • pp.651-657
    • /
    • 2015
  • The amount of web traffic has increased as a result of the rapid growth of the use of web-based applications. In order to obtain valuable information from web logs, we need to develop systems that can support interactive, flexible, and efficient ways to analyze and handle large amounts of data. In this paper, we present CERES, a log-based, interactive web analytics system for backbone networks. Since CERES focuses on analyzing web log records generated from backbone networks, it is possible to perform a web analysis from the perspective of a network. CERES is designed for deployment in a server cluster using the Hadoop Distributed File System (HDFS) as the underlying storage. We transform and store web log records from backbone networks into relations and then allow users to use a SQL-like language to analyze web log records in a flexible and interactive manner. In particular, we use the data cube technique to enable the efficient statistical analysis of web log. The system provides users a web-based, multi-modal user interface.

A study of the load distributing algorithm on the heterogeneously clustered web system (이기종 웹 클러스터 시스템에 대한 부하분산 알고리즘의 연구)

  • Rhee, Young
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.225-230
    • /
    • 2003
  • In this paper, we develope algorithms that distribute the load on the heterogeneously clustered web system, The response time based on the concurrent user is examined for the suggested algorithms. Simulation experience shows that the response time using the dynamically weighted methods seems to have a good results compare to that with the fixed weighted methods. And, also the effectiveness of clustered system becomes better as long as the number of concurrent user increases.

Real-Time Power Electronics Remote Wiring and Measurement Laboratory (PermLAB) Using 3-D Matrix Switching Algorithms

  • Asumadu, Johnson A.;Tanner, Ralph;Ogunley, Hakeem
    • Journal of Power Electronics
    • /
    • v.10 no.6
    • /
    • pp.611-620
    • /
    • 2010
  • This paper presents a new architecture, called "Power Electronics Remote Wiring and Measurement Laboratory (PermLAB)", that translates a common gateway interface (CGI) string from a remote web user to a web server connected to a 3-dimension switching matrix board, can be used to switch on and off, and to control a cluster of instruments and components. PermLAB addresses real-time connection, switching, and data acquisition over the Internet instead of using simulated data. A software procedure uses a signature system to identify each instrument and component in a complex system. The Web-server application is developed in HTML, JavaScript and Java, and in C language for the CGI interface, which resides in a controller portion of LabVIEW. The LabVIEW software fully integrates the Web sever, LabVIEW data acquisition boards and controllers, and the 3-dimensional switching matrix board. The paper will analyze a half-wave rectifier (AC - DC converter) circuit connected over the Internet using the PermLAB. PermLAB allows students to obtain real data by real-time wiring of real circuits in the laboratory using a "virtual breadboard" on the Web. The software for the Web-based 3-dimensional system is flexible, portable, can be integrated into many laboratory applications or expanded, and easily accessible worldwide.

An Optimized User Behavior Prediction Model Using Genetic Algorithm On Mobile Web Structure

  • Hussan, M.I. Thariq;Kalaavathi, B.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1963-1978
    • /
    • 2015
  • With the advancement of mobile web environments, identification and analysis of the user behavior play a significant role and remains a challenging task to implement with variations observed in the model. This paper presents an efficient method for mining optimized user behavior prediction model using genetic algorithm on mobile web structure. The framework of optimized user behavior prediction model integrates the temporary and permanent register information and is stored immediately in the form of integrated logs which have higher precision and minimize the time for determining user behavior. Then by applying the temporal characteristics, suitable time interval table is obtained by segmenting the logs. The suitable time interval table that split the huge data logs is obtained using genetic algorithm. Existing cluster based temporal mobile sequential arrangement provide efficiency without bringing down the accuracy but compromise precision during the prediction of user behavior. To efficiently discover the mobile users' behavior, prediction model is associated with region and requested services, a method called optimized user behavior Prediction Model using Genetic Algorithm (PM-GA) on mobile web structure is introduced. This paper also provides a technique called MAA during the increase in the number of models related to the region and requested services are observed. Based on our analysis, we content that PM-GA provides improved performance in terms of precision, number of mobile models generated, execution time and increasing the prediction accuracy. Experiments are conducted with different parameter on real dataset in mobile web environment. Analytical and empirical result offers an efficient and effective mining and prediction of user behavior prediction model on mobile web structure.

A Study on The e-Business Strategy and Corporate Performance (e-비즈니스 전략유형과 기업성과에 관한 연구)

  • Kim, Hee-Cheol;Moon, Young-Ja
    • International Commerce and Information Review
    • /
    • v.9 no.3
    • /
    • pp.33-57
    • /
    • 2007
  • This study tests e-business performance difference of the inter group by strategy type through the cluster analysis, after confirming the linear relationship between the e-business strategy type and its performance. According to the result of the study the effect on the e-business performance reveals to differ by the e-business strategy type. That is to say, while the firm's information system performance, e-business realization and the inter group competition dominance are affected positively by the e-process strategy, web application strategy and customer attracting strategy. This confirms that the information system performance, the realization performance and the competition dominance are affected by e - business strategy type. The key factor leading to the success of e-business is the commitment of e-process strategy and web application strategy. For the case of the customer attracting strategy the result shows the importance of the strategy. In the cluster group analysis, the additional analysis, the effect is seen to be more powerful in the firm's information system performance, e - business realization and securing the competition advantage for the case of the multiple strategy than that of single one. Accordingly, the firm needs to adopt the multiple strategy suited for the characteristic of the firm rather than the single strategy.

  • PDF

Development of Real time Air Quality Prediction System

  • Oh, Jai-Ho;Kim, Tae-Kook;Park, Hung-Mok;Kim, Young-Tae
    • Proceedings of the Korean Environmental Sciences Society Conference
    • /
    • 2003.11a
    • /
    • pp.73-78
    • /
    • 2003
  • In this research, we implement Realtime Air Diffusion Prediction System which is a parallel Fortran model running on distributed-memory parallel computers. The system is designed for air diffusion simulations with four-dimensional data assimilation. For regional air quality forecasting a series of dynamic downscaling technique is adopted using the NCAR/Penn. State MM5 model which is an atmospheric model. The realtime initial data have been provided daily from the KMA (Korean Meteorological Administration) global spectral model output. It takes huge resources of computation to get 24 hour air quality forecast with this four step dynamic downscaling (27km, 9km, 3km, and lkm). Parallel implementation of the realtime system is imperative to achieve increased throughput since the realtime system have to be performed which correct timing behavior and the sequential code requires a large amount of CPU time for typical simulations. The parallel system uses MPI (Message Passing Interface), a standard library to support high-level routines for message passing. We validate the parallel model by comparing it with the sequential model. For realtime running, we implement a cluster computer which is a distributed-memory parallel computer that links high-performance PCs with high-speed interconnection networks. We use 32 2-CPU nodes and a Myrinet network for the cluster. Since cluster computers more cost effective than conventional distributed parallel computers, we can build a dedicated realtime computer. The system also includes web based Gill (Graphic User Interface) for convenient system management and performance monitoring so that end-users can restart the system easily when the system faults. Performance of the parallel model is analyzed by comparing its execution time with the sequential model, and by calculating communication overhead and load imbalance, which are common problems in parallel processing. Performance analysis is carried out on our cluster which has 32 2-CPU nodes.

  • PDF

Implementation of a Large-scale Web Query Processing System Using the Multi-level Cache Scheme (계층적 캐시 기법을 이용한 대용량 웹 검색 질의 처리 시스템의 구현)

  • Lim, Sung-Chae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.669-679
    • /
    • 2008
  • With the increasing demands of information sharing and searches via the web, the web search engine has drawn much attention. Although many researches have been done to solve technical challenges to build the web search engine, the issue regarding its query processing system is rarely dealt with. Since the software architecture and operational schemes of the query processing system are hard to elaborate, we here present related techniques implemented on a commercial system. The implemented system is a very large-scale system that can process 5-million user queries per day by using index files built on about 65-million web pages. We implement a multi-level cache scheme to save already returned query results for performance considerations, and the multi-level cache is managed in 4-level cache storage areas. Using the multi-level cache, we can improve the system throughput by a factor of 4, thereby reducing around 70% of the server cost.

A Scalable OWL Horst Lite Ontology Reasoning Approach based on Distributed Cluster Memories (분산 클러스터 메모리 기반 대용량 OWL Horst Lite 온톨로지 추론 기법)

  • Kim, Je-Min;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.307-319
    • /
    • 2015
  • Current ontology studies use the Hadoop distributed storage framework to perform map-reduce algorithm-based reasoning for scalable ontologies. In this paper, however, we propose a novel approach for scalable Web Ontology Language (OWL) Horst Lite ontology reasoning, based on distributed cluster memories. Rule-based reasoning, which is frequently used for scalable ontologies, iteratively executes triple-format ontology rules, until the inferred data no longer exists. Therefore, when the scalable ontology reasoning is performed on computer hard drives, the ontology reasoner suffers from performance limitations. In order to overcome this drawback, we propose an approach that loads the ontologies into distributed cluster memories, using Spark (a memory-based distributed computing framework), which executes the ontology reasoning. In order to implement an appropriate OWL Horst Lite ontology reasoning system on Spark, our method divides the scalable ontologies into blocks, loads each block into the cluster nodes, and subsequently handles the data in the distributed memories. We used the Lehigh University Benchmark, which is used to evaluate ontology inference and search speed, to experimentally evaluate the methods suggested in this paper, which we applied to LUBM8000 (1.1 billion triples, 155 gigabytes). When compared with WebPIE, a representative mapreduce algorithm-based scalable ontology reasoner, the proposed approach showed a throughput improvement of 320% (62k/s) over WebPIE (19k/s).