Search results for: local grid refinement
1951 Study on a Nested Cartesian Grid Method
Authors: Yih-Ferng Peng
Abstract:
In this paper, the local grid refinement is focused by using a nested grid technique. The Cartesian grid numerical method is developed for simulating unsteady, viscous, incompressible flows with complex immersed boundaries. A finite volume method is used in conjunction with a two-step fractional-step procedure. The key aspects that need to be considered in developing such a nested grid solver are imposition of interface conditions on the inter-block and accurate discretization of the governing equation in cells that are with the inter-block as a control surface. A new interpolation procedure is presented which allows systematic development of a spatial discretization scheme that preserves the spatial accuracy of the underlying solver. The present nested grid method has been tested by two numerical examples to examine its performance in the two dimensional problems. The numerical examples include flow past a circular cylinder symmetrically installed in a Channel and flow past two circular cylinders with different diameters. From the numerical experiments, the ability of the solver to simulate flows with complicated immersed boundaries is demonstrated and the nested grid approach can efficiently speed up the numerical solutions.Keywords: local grid refinement, Cartesian grid, nested grid, fractional-step method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15491950 Cost-Effective Private Grid Using Object-based Grid Architecture
Authors: M. Victor Jose, V. Seenivasagam
Abstract:
This paper proposes a cost-effective private grid using Object-based Grid Architecture (OGA). In OGA, the data process privacy and inter communication are increased through an object- oriented concept. The limitation of the existing grid is that the user can enter or leave the grid at any time without schedule and dedicated resource. To overcome these limitations, cost-effective private grid and appropriate algorithms are proposed. In this, each system contains two platforms such as grid and local platforms. The grid manager service running in local personal computer can act as grid resource. When the system is on, it is intimated to the Monitoring and Information System (MIS) and details are maintained in Resource Object Table (ROT). The MIS is responsible to select the resource where the file or the replica should be stored. The resource storage is done within virtual single private grid nodes using random object addressing to prevent stolen attack. If any grid resource goes down, then the resource ID will be removed from the ROT, and resource recovery is efficiently managed by the replicas. This random addressing technique makes the grid storage a single storage and the user views the entire grid network as a single system.Keywords: Object Grid Architecture, Grid Manager Service, Resource Object table, Random object addressing, Object storage, Dynamic Object Update.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10201949 Parallel and Distributed Mining of Association Rule on Knowledge Grid
Authors: U. Sakthi, R. Hemalatha, R. S. Bhuvaneswaran
Abstract:
In Virtual organization, Knowledge Discovery (KD) service contains distributed data resources and computing grid nodes. Computational grid is integrated with data grid to form Knowledge Grid, which implements Apriori algorithm for mining association rule on grid network. This paper describes development of parallel and distributed version of Apriori algorithm on Globus Toolkit using Message Passing Interface extended with Grid Services (MPICHG2). The creation of Knowledge Grid on top of data and computational grid is to support decision making in real time applications. In this paper, the case study describes design and implementation of local and global mining of frequent item sets. The experiments were conducted on different configurations of grid network and computation time was recorded for each operation. We analyzed our result with various grid configurations and it shows speedup of computation time is almost superlinear.Keywords: Association rule, Grid computing, Knowledge grid, Mobility prediction.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21701948 Grid Learning; Computer Grid Joins to e- Learning
Authors: A. Nassiry, A. Kardan
Abstract:
According to development of communications and web-based technologies in recent years, e-Learning has became very important for everyone and is seen as one of most dynamic teaching methods. Grid computing is a pattern for increasing of computing power and storage capacity of a system and is based on hardware and software resources in a network with common purpose. In this article we study grid architecture and describe its different layers. In this way, we will analyze grid layered architecture. Then we will introduce a new suitable architecture for e-Learning which is based on grid network, and for this reason we call it Grid Learning Architecture. Various sections and layers of suggested architecture will be analyzed; especially grid middleware layer that has key role. This layer is heart of grid learning architecture and, in fact, regardless of this layer, e-Learning based on grid architecture will not be feasible.Keywords: Distributed learning, Grid Learning, Grid network, SCORM standard.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17071947 Refinement of Object-Z Specifications Using Morgan-s Refinement Calculus
Authors: Mehrnaz Najafi, Hassan Haghighi
Abstract:
Morgan-s refinement calculus (MRC) is one of the well-known methods allowing the formality presented in the program specification to be continued all the way to code. On the other hand, Object-Z (OZ) is an extension of Z adding support for classes and objects. There are a number of methods for obtaining code from OZ specifications that can be categorized into refinement and animation methods. As far as we know, only one refinement method exists which refines OZ specifications into code. However, this method does not have fine-grained refinement rules and thus cannot be automated. On the other hand, existing animation methods do not present mapping rules formally and do not support the mapping of several important constructs of OZ, such as all cases of operation expressions and most of constructs in global paragraph. In this paper, with the aim of providing an automatic path from OZ specifications to code, we propose an approach to map OZ specifications into their counterparts in MRC in order to use fine-grained refinement rules of MRC. In this way, having counterparts of our specifications in MRC, we can refine them into code automatically using MRC tools such as RED. Other advantages of our work pertain to proposing mapping rules formally, supporting the mapping of all important constructs of Object-Z, and considering dynamic instantiation of objects while OZ itself does not cover this facility.Keywords: Formal method, Formal specification, Formalprogram development, Morgan's Refinement Calculus, Object-Z
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13071946 New Hybrid Algorithm for Task Scheduling in Grid Computing to Decrease missed Task
Authors: Z. Pooranian, A. Harounabadi, M. Shojafar, N. Hedayat
Abstract:
The purpose of Grid computing is to utilize computational power of idle resources which are distributed in different areas. Given the grid dynamism and its decentralize resources, there is a need for an efficient scheduler for scheduling applications. Since task scheduling includes in the NP-hard problems various researches have focused on invented algorithms especially the genetic ones. But since genetic is an inherent algorithm which searches the problem space globally and does not have the efficiency required for local searching, therefore, its combination with local searching algorithms can compensate for this shortcomings. The aim of this paper is to combine the genetic algorithm and GELS (GAGELS) as a method to solve scheduling problem by which simultaneously pay attention to two factors of time and number of missed tasks. Results show that the proposed algorithm can decrease makespan while minimizing the number of missed tasks compared with the traditional methods.Keywords: Grid Computing, Genetic Algorithm, Gravitational Emulation Local Search (GELS), missed task
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19321945 Resource Discovery in Web-Services Based Grids
Authors: Damandeep Kaur, Jyotsna Sengupta
Abstract:
A Web-services based grid infrastructure is evolving to be readily available in the near future. In this approach, the Web services are inherited (encapsulated or functioned) into the same existing Grid services class. In practice there is not much difference between the existing Web and grid infrastructure. Grid services emerged as stateful web services. In this paper, we present the key components of web-services based grid and also how the resource discovery is performed on web-services based grid considering resource discovery, as a critical service, to be provided by any type of grid.
Keywords: Web services, resource discovery, grid computing, OGSA.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16231944 Performance Evaluation of Refinement Method for Wideband Two-Beams Formation
Authors: C. Bunsanit
Abstract:
This paper presents the refinement method for two beams formation of wideband smart antenna. The refinement method for weighting coefficients is based on Fully Spatial Signal Processing by taking Inverse Discrete Fourier Transform (IDFT), and its simulation results are presented using MATLAB. The radiation pattern is created by multiplying the incoming signal with real weights and then summing them together. These real weighting coefficients are computed by IDFT method; however, the range of weight values is relatively wide. Therefore, for reducing this range, the refinement method is used. The radiation pattern concerns with five input parameters to control. These parameters are maximum weighting coefficient, wideband signal, direction of mainbeam, beamwidth, and maximum of minor lobe level. Comparison of the obtained simulation results between using refinement method and taking only IDFT shows that the refinement method works well for wideband two beams formation.
Keywords: Fully spatial signal processing, beam forming, refinement method, smart antenna, weighting coefficient, wideband.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10651943 Numerical Modelling of Surface Waves Generated by Low Frequency Electromagnetic Field for Silicon Refinement Process
Authors: V. Geza, J. Vencels, G. Zageris, S. Pavlovs
Abstract:
One of the most perspective methods to produce SoG-Si is refinement via metallurgical route. The most critical part of this route is refinement from boron and phosphorus. Therefore, a new approach could address this problem. We propose an approach of creating surface waves on silicon melt’s surface in order to enlarge its area and accelerate removal of boron via chemical reactions and evaporation of phosphorus. A two dimensional numerical model is created which includes coupling of electromagnetic and fluid dynamic simulations with free surface dynamics. First results show behaviour similar to experimental results from literature.
Keywords: Numerical modelling, silicon refinement, surface waves, VOF method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7941942 Jacobi-Based Methods in Solving Fuzzy Linear Systems
Authors: Lazim Abdullah, Nurhakimah Ab. Rahman
Abstract:
Linear systems are widely used in many fields of science and engineering. In many applications, at least some of the parameters of the system are represented by fuzzy rather than crisp numbers. Therefore it is important to perform numerical algorithms or procedures that would treat general fuzzy linear systems and solve them using iterative methods. This paper aims are to solve fuzzy linear systems using four types of Jacobi based iterative methods. Four iterative methods based on Jacobi are used for solving a general n × n fuzzy system of linear equations of the form Ax = b , where A is a crisp matrix and b an arbitrary fuzzy vector. The Jacobi, Jacobi Over-Relaxation, Refinement of Jacobi and Refinement of Jacobi Over-Relaxation methods was tested to a five by five fuzzy linear system. It is found that all the tested methods were iterated differently. Due to the effect of extrapolation parameters and the refinement, the Refinement of Jacobi Over-Relaxation method was outperformed the other three methods.
Keywords: Fuzzy linear systems, Jacobi, Jacobi Over- Relaxation, Refinement of Jacobi, Refinement of Jacobi Over- Relaxation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23961941 Numerical Grid Generation of Oceanic Model for the Andaman Sea
Authors: Nitima Aschariyaphotha, Pratan Sakkaplangkul, Anirut Luadsong
Abstract:
The study of the Andaman Sea can be studied by using the oceanic model; therefore the grid covering the study area should be generated. This research aims to generate grid covering the Andaman Sea, situated between longitudes 90◦E to 101◦E and latitudes 1◦N to 18◦N. A horizontal grid is an orthogonal curvilinear with 87 × 217 grid points. The methods used in this study are cubic spline and bilinear interpolations. The boundary grid points are generated by spline interpolation while the interior grid points have to be specified by bilinear interpolation method. A vertical grid is sigma coordinate with 15 layers of water column.Keywords: Sigma Coordinate, Curvilinear Coordinate, AndamanSea.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15561940 Agents Network on a Grid: An Approach with the Set of Circulant Operators
Authors: Babiga Birregah, Prosper K. Doh, Kondo H. Adjallah
Abstract:
In this work we present some matrix operators named circulant operators and their action on square matrices. This study on square matrices provides new insights into the structure of the space of square matrices. Moreover it can be useful in various fields as in agents networking on Grid or large-scale distributed self-organizing grid systems.Keywords: Pascal matrices, Binomial Recursion, Circulant Operators, Square Matrix Bipartition, Local Network, Parallel networks of agents.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10911939 A Robust Deterministic Energy Smart-Grid Decisional Algorithm for Agent-Based Management
Authors: C. Adam, G. Henri, T. Levent, J.-B. Mauro, A. -L. Mayet
Abstract:
This paper is concerning the application of a deterministic decisional pattern to a multi-agent system which would provide intelligence to a distributed energy smart grid at local consumer level. Development of multi-agent application involves agent specifications, analysis, design and realization. It can be implemented by following several decisional patterns. The purpose of present article is to suggest a new approach to control the smart grid system in a decentralized competitive approach. The proposed algorithmic solution results from a deterministic dichotomous approach based on environment observation. It uses an iterative process to solve automatic learning problems. Through memory of collected past tries, the algorithm monotonically converges to very steep system operation point in attraction basin resulting from weak system nonlinearity. In this sense, system is given by (local) constitutive elementary rules the intelligence of its global existence so that it can self-organize toward optimal operating sequence.
Keywords: Decentralized Competitive System, Distributed Smart Grid, Multi-Agent System
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16701938 Optimal Planning of Ground Grid Based on Particle Swam Algorithm
Authors: Chun-Yao Lee, Yi-Xing Shen
Abstract:
This paper presents an application of particle swarm optimization (PSO) to the grounding grid planning which compares to the application of genetic algorithm (GA). Firstly, based on IEEE Std.80, the cost function of the grounding grid and the constraints of ground potential rise, step voltage and touch voltage are constructed for formulating the optimization problem of grounding grid planning. Secondly, GA and PSO algorithms for obtaining optimal solution of grounding grid are developed. Finally, a case of grounding grid planning is shown the superiority and availability of the PSO algorithm and proposal planning results of grounding grid in cost and computational time.Keywords: Genetic algorithm, particle swarm optimization, grounding grid.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20481937 Dynamic Performance Analysis of Distribution/ Sub-Transmission Networks with High Penetration of PV Generation
Authors: Cristian F.T. Montenegro, Luís F. N. Lourenço, Maurício B. C. Salles, Renato M. Monaro
Abstract:
More PV systems have been connected to the electrical network each year. As the number of PV systems increases, some issues affecting grid operations have been identified. This paper studied the impacts related to changes in solar irradiance on a distribution/sub-transmission network, considering variations due to moving clouds and daily cycles. Using MATLAB/Simulink software, a solar farm of 30 MWp was built and then implemented to a test network. From simulations, it has been determined that irradiance changes can have a significant impact on the grid by causing voltage fluctuations outside the allowable thresholds. This work discussed some local control strategies and grid reinforcements to mitigate the negative effects of the irradiance changes on the grid.
Keywords: Utility-scale PV systems, reactive power control, solar irradiance, voltage fluctuation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12391936 Resource Matching and a Matchmaking Service for an Intelligent Grid
Authors: Xin Bai, Han Yu, Yongchang Ji, Dan C. Marinescu
Abstract:
We discuss the application of matching in the area of resource discovery and resource allocation in grid computing. We present a formal definition of matchmaking, overview algorithms to evaluate different matchmaking expressions, and develop a matchmaking service for an intelligent grid environment.Keywords: Grid, Matchmaking, Ontology
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15611935 A Fitted Random Sampling Scheme for Load Distribution in Grid Networks
Authors: O. A. Rahmeh, P. Johnson, S. Lehmann
Abstract:
Grid networks provide the ability to perform higher throughput computing by taking advantage of many networked computer-s resources to solve large-scale computation problems. As the popularity of the Grid networks has increased, there is a need to efficiently distribute the load among the resources accessible on the network. In this paper, we present a stochastic network system that gives a distributed load-balancing scheme by generating almost regular networks. This network system is self-organized and depends only on local information for load distribution and resource discovery. The in-degree of each node is refers to its free resources, and job assignment and resource discovery processes required for load balancing is accomplished by using fitted random sampling. Simulation results show that the generated network system provides an effective, scalable, and reliable load-balancing scheme for the distributed resources accessible on Grid networks.
Keywords: Complex networks, grid networks, load-balancing, random sampling.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17701934 A Survey of Job Scheduling and Resource Management in Grid Computing
Authors: Raksha Sharma, Vishnu Kant Soni, Manoj Kumar Mishra, Prachet Bhuyan
Abstract:
Grid computing is a form of distributed computing that involves coordinating and sharing computational power, data storage and network resources across dynamic and geographically dispersed organizations. Scheduling onto the Grid is NP-complete, so there is no best scheduling algorithm for all grid computing systems. An alternative is to select an appropriate scheduling algorithm to use in a given grid environment because of the characteristics of the tasks, machines and network connectivity. Job and resource scheduling is one of the key research area in grid computing. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. Motivation of the survey is to encourage the amateur researcher in the field of grid computing, so that they can understand easily the concept of scheduling and can contribute in developing more efficient scheduling algorithm. This will benefit interested researchers to carry out further work in this thrust area of research.Keywords: Grid Computing, Job Scheduling, ResourceScheduling.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 33951933 Mobile Ad-Hoc Service Grid – MASGRID
Authors: Imran Ihsan, Muhammad Abdul Qadir, Nadeem Iftikhar
Abstract:
Mobile devices, which are progressively surrounded in our everyday life, have created a new paradigm where they interconnect, interact and collaborate with each other. This network can be used for flexible and secure coordinated sharing. On the other hand Grid computing provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. In this paper, efforts are made to map the concepts of Grid on Ad-Hoc networks because both exhibit similar kind of characteristics like Scalability, Dynamism and Heterogeneity. In this context we propose “Mobile Ad-Hoc Services Grid – MASGRID".Keywords: Mobile Ad-Hoc Networks, Grid Computing, Resource Discovery, Routing
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17781932 Metadata Update Mechanism Improvements in Data Grid
Authors: S. Farokhzad, M. Reza Salehnamadi
Abstract:
Grid environments include aggregation of geographical distributed resources. Grid is put forward in three types of computational, data and storage. This paper presents a research on data grid. Data grid is used for covering and securing accessibility to data from among many heterogeneous sources. Users are not worry on the place where data is located in it, provided that, they should get access to the data. Metadata is used for getting access to data in data grid. Presently, application metadata catalogue and SRB middle-ware package are used in data grids for management of metadata. At this paper, possibility of updating, streamlining and searching is provided simultaneously and rapidly through classified table of preserving metadata and conversion of each table to numerous tables. Meanwhile, with regard to the specific application, the most appropriate and best division is set and determined. Concurrency of implementation of some of requests and execution of pipeline is adaptability as a result of this technique.Keywords: Grids, data grid, metadata, update.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16831931 A Local Decisional Algorithm Using Agent- Based Management in Constrained Energy Environment
Authors: C. Adam, G. Henri, T. Levent, J-B Mauro, A-L Mayet
Abstract:
Energy Efficiency Management is the heart of a worldwide problem. The capability of a multi-agent system as a technology to manage the micro-grid operation has already been proved. This paper deals with the implementation of a decisional pattern applied to a multi-agent system which provides intelligence to a distributed local energy network considered at local consumer level. Development of multi-agent application involves agent specifications, analysis, design, and realization. Furthermore, it can be implemented by following several decisional patterns. The purpose of present article is to suggest a new approach for a decisional pattern involving a multi-agent system to control a distributed local energy network in a decentralized competitive system. The proposed solution is the result of a dichotomous approach based on environment observation. It uses an iterative process to solve automatic learning problems and converges monotonically very fast to system attracting operation point.
Keywords: Energy Efficiency Management, Distributed Smart- Grid, Multi-Agent System, Decisional Decentralized Competitive System.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14011930 An Improved Greedy Routing Algorithm for Grid using Pheromone-Based Landmarks
Authors: Lada-On Lertsuwanakul, Herwig Unger
Abstract:
This paper objects to extend Jon Kleinberg-s research. He introduced the structure of small-world in a grid and shows with a greedy algorithm using only local information able to find route between source and target in delivery time O(log2n). His fundamental model for distributed system uses a two-dimensional grid with longrange random links added between any two node u and v with a probability proportional to distance d(u,v)-2. We propose with an additional information of the long link nearby, we can find the shorter path. We apply the ant colony system as a messenger distributed their pheromone, the long-link details, in surrounding area. The subsequence forwarding decision has more option to move to, select among local neighbors or send to node has long link closer to its target. Our experiment results sustain our approach, the average routing time by Color Pheromone faster than greedy method.
Keywords: Routing algorithm, Small-World network, Ant Colony Optimization, and Peer-to-peer System.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18411929 A Review on Impacts of Grid-Connected PV System on Distribution Networks
Authors: Davud Mostafa Tobnaghi
Abstract:
This paper aims to investigate and emphasize the importance of the grid-connected photovoltaic (PV) systems regarding the intermittent nature of renewable generation, and the characterization of PV generation with regard to grid code compliance. The development of Photovoltaic systems and expansion plans relating to the futuristic in worldwide is elaborated. The most important impacts of grid connected photovoltaic systems on distribution networks as well as the Penetration level of PV system was investigated.Keywords: Grid-connected photovoltaic system, distribution network, penetration levels, power quality.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 48031928 2D Validation of a High-order Adaptive Cartesian-grid finite-volume Characteristic- flux Model with Embedded Boundaries
Authors: C. Leroy, G. Oger, D. Le Touzé, B. Alessandrini
Abstract:
A Finite Volume method based on Characteristic Fluxes for compressible fluids is developed. An explicit cell-centered resolution is adopted, where second and third order accuracy is provided by using two different MUSCL schemes with Minmod, Sweby or Superbee limiters for the hyperbolic part. Few different times integrator is used and be describe in this paper. Resolution is performed on a generic unstructured Cartesian grid, where solid boundaries are handled by a Cut-Cell method. Interfaces are explicitely advected in a non-diffusive way, ensuring local mass conservation. An improved cell cutting has been developed to handle boundaries of arbitrary geometrical complexity. Instead of using a polygon clipping algorithm, we use the Voxel traversal algorithm coupled with a local floodfill scanline to intersect 2D or 3D boundary surface meshes with the fixed Cartesian grid. Small cells stability problem near the boundaries is solved using a fully conservative merging method. Inflow and outflow conditions are also implemented in the model. The solver is validated on 2D academic test cases, such as the flow past a cylinder. The latter test cases are performed both in the frame of the body and in a fixed frame where the body is moving across the mesh. Adaptive Cartesian grid is provided by Paramesh without complex geometries for the moment.
Keywords: Finite volume method, cartesian grid, compressible solver, complex geometries, Paramesh.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16011927 An Off-the-Shelf Scheme for Dependable Grid Systems Using Virtualization
Authors: Toshinori Takabatake
Abstract:
Recently, grid computing has been widely focused on the science, industry, and business fields, which are required a vast amount of computing. Grid computing is to provide the environment that many nodes (i.e., many computers) are connected with each other through a local/global network and it is available for many users. In the environment, to achieve data processing among nodes for any applications, each node executes mutual authentication by using certificates which published from the Certificate Authority (for short, CA). However, if a failure or fault has occurred in the CA, any new certificates cannot be published from the CA. As a result, a new node cannot participate in the gird environment. In this paper, an off-the-shelf scheme for dependable grid systems using virtualization techniques is proposed and its implementation is verified. The proposed approach using the virtualization techniques is to restart an application, e.g., the CA, if it has failed. The system can tolerate a failure or fault if it has occurred in the CA. Since the proposed scheme is implemented at the application level easily, the cost of its implementation by the system builder hardly takes compared it with other methods. Simulation results show that the CA in the system can recover from its failure or fault.Keywords: grid computing, restarting application, certificate authority, virtualization, dependability.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13651926 Covering-based Rough sets Based on the Refinement of Covering-element
Authors: Jianguo Tang, Kun She, William Zhu
Abstract:
Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a partition of the universe. Therefore it is more powerful in describing some practical problems than rough sets. However, by extending the rough sets, covering-based rough sets can increase the roughness of each model in recognizing objects. How to obtain better approximations from the models of a covering-based rough sets is an important issue. In this paper, two concepts, determinate elements and indeterminate elements in a universe, are proposed and given precise definitions respectively. This research makes a reasonable refinement of the covering-element from a new viewpoint. And the refinement may generate better approximations of covering-based rough sets models. To prove the theory above, it is applied to eight major coveringbased rough sets models which are adapted from other literature. The result is, in all these models, the lower approximation increases effectively. Correspondingly, in all models, the upper approximation decreases with exceptions of two models in some special situations. Therefore, the roughness of recognizing objects is reduced. This research provides a new approach to the study and application of covering-based rough sets.Keywords: Determinate element, indeterminate element, refinementof covering-element, refinement of covering, covering-basedrough sets.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13111925 3A Distributed Method Algorithm for Exact Side Load Managing Smart Grid Using LABVIEW
Authors: N. Ravi Kumar, R. Kamalakannan
Abstract:
The advancement of hybrid energy resources such as solar and wind power leading to the emergence of customer owned grid. It provides an opportunity to regulars to obtain low energy costs as well as enabling the power supplier to regulate the utility grid. There is a need to develop smart systems that will automatically submit energy demand schedule and monitors energy price signals in real-time without the prompt of customers. In this paper, a demand side energy management for a grid connected household and also smart preparation of electrical appliance have been presented. It also reduces electricity bill for the consumers in the grid. In addition to this, when production is high, the surplus energy fashioned in the customer owned grid is given to main grid or neighboring micro grids. The simulation of the entire system is presented using LabVIEW software.
Keywords: Distributed renewable energy resource, power storage devices, scheduling, smart meters, smart micro grid, electric vehicle.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10751924 Grid Artifacts Suppression in Computed Radiographic Images
Authors: Igor Belykh
Abstract:
Anti-scatter grids used in radiographic imaging for the contrast enhancement leave specific artifacts. Those artifacts may be visible or may cause Moiré effect when digital image is resized on a diagnostic monitor. In this paper we propose an automated grid artifactsdetection and suppression algorithm which is still an actual problem. Grid artifacts detection is based on statistical approach in spatial domain. Grid artifacts suppression is based on Kaiser bandstop filter transfer function design and application avoiding ringing artifacts. Experimental results are discussed and concluded with description of advantages over existing approaches.
Keywords: Computed radiography, grid artifacts, image filtering.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 42771923 Optimized Hybrid Renewable Energy System of Isolated Islands in Smart-Grid Scenario - A Case Study in Indian Context
Authors: Aurobi Das, V. Balakrishnan
Abstract:
This paper focuses on the integration of hybrid renewable energy resources available in remote isolated islands of Sundarban-24 Parganas-South of Eastern part of India to National Grid of conventional power supply to give a Smart-Grid scenario. Before grid-integration, feasibility of optimization of hybrid renewable energy system is monitored through an Intelligent Controller proposed to be installed at Moushuni Island of Sundarban. The objective is to ensure the reliability and efficiency of the system to optimize the utilization of the hybrid renewable energy sources and also a proposition of how theses isolated Hybrid Renewable Energy Systems at remote islands can be grid-connected is analyzed towards vision of green smart-grid.
Keywords: Intelligent controller, hybrid renewable, solar photo voltaic, smart-grid.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 28411922 Smart Grid Communication Architecture Modeling for Heterogeneous Network Based Advanced Metering Infrastructure
Authors: S. Prem Kumar, H. Thameemul Ansari, V. Saminadan
Abstract:
A smart grid is an emerging technology in the power delivery system which provides an intelligent, self-recovery and homeostatic grid in delivering power to the users. Smart grid communication network provides transmission capacity for information transformation within the connected nodes in the network, in favor of functional and operational needs. In the electric grids communication network delay is based on choosing the appropriate technology and the types of devices enforced. In distinction, the combination of IEEE 802.16 based WiMAX and IEEE 802.11 based WiFi technologies provides improved coverage and gives low delay performances to meet the smart grid needs. By incorporating this method in Wide Area Monitoring System (WAMS) and Advanced Metering Infrastructure (AMI) the performance of the smart grid will be considerably improved. This work deals with the implementation of WiMAX-WLAN integrated network architecture for WAMS and AMI in the smart grid.Keywords: WiMAX, WLAN, WAMS, Smart Grid, HetNet, AMI.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1004