Evaluation of Grid-Connected Photovoltaic Plants Based on Clustering Methods

Photovoltaic (PV) systems are electric power systems designed to supply usable solar power by means of photovoltaics, which is the conversion of light into electricity using semiconducting materials. PV systems have gained much attention and are a very attractive energy resource nowadays. The substantial advantage of PV systems is the usage of the most abundant and free energy from the sun. PV systems play an important role in reducing feeder losses, improving voltage profiles and providing ancillary services to local loads. However, large PV grid-connected systems may have a destructive impact on the stability of the electric grid. This is due to the fluctuations of the output AC power generated from the PV systems according to the variations in the solar energy levels. Thus, the electrical distribution system with high penetration of PV systems is subject to performance degradation and instabilities. For that, this project attempts to enhance the integration process of PV systems into electrical grids by analyzing the impact of installing grid-connected PV plants. To accomplish this, an indicative representation of solar irradiation datasets is used for planning and power flow studies of the electric network prior to PV systems installation. Those datasets contain lengthy historical observations of solar energy data, that requires extensive analysis and simulations. To overcome that the lengthy historical datasets are reduced and clustered while preserving the original data characteristics. The resultant clusters can be utilized in the planning stage and simulation studies. Accordingly, studies related to PV systems integration into the electric grid are conducted in an efficient manner, avoiding computing resources and processing times with easier and practical implementation.     

Control and Navigation Framework for Quadrotor Helicopters

This paper presents the development of a nonlinear quadrotor simulation framework together with a nonlinear controller. The quadrotor stabilization and navigation problems are tackled using a nested loops control architecture. A nonlinear Backstepping controller is implemented for the inner stabilization loop. It asymptotically tracks reference attitude, altitude and heading trajectories. The outer loop controller generates the reference trajectories for the inner loop controller to reach the desired waypoint. To ensure boundedness of the reference trajectories, a PD controller with a saturation function is used for the outer loop. Due to the complexity involved in controller development and testing, a simulation framework has been developed. It is based on the Gazebo 3D robotics simulator and the Open Dynamics Engine (ODE) library. The framework can effectively facilitate the development and validation of controllers. It has been released and is available at Gazebo quadrotor simulator (2012).     

On the hierarchy of distribution-sensitive properties for data structures

In this paper new dependencies are added to the hierarchy of the distribution-sensitive properties for data structures. Most remarkably, we prove that the working-set property is equivalent to the unified-bound property; a fact that had gone unnoticed since the introduction of such bounds in the Eighties by Sleator and Tarjan.     

Fatigue Life Evaluation of Concrete Bridge Deck Slabs Reinforced with Glass FRP Composite Bars

Since bridge deck slabs directly sustain repeated moving wheel loads, they are one of the most bridge elements susceptible to fatigue failure. Recently, glass fiber-reinforced polymer (FRP) composites have been widely used as internal reinforcement for concrete bridge deck slabs as they are less expensive compared to the other kinds of FRPs (carbon and aramid). However, there is still a lack of information on the performance of FRP–reinforced concrete elements subjected to cyclic fatigue loading. This research is designed to investigate the fatigue behavior and fatigue life of concrete bridge deck slabs reinforced with glass FRP bars. A total of five full-scale deck slabs were constructed and tested under concentrated cyclic loading until failure. Different reinforcement types (steel and glass FRP), ratios, and configurations were used. Different schemes of cyclic loading (accelerated variable amplitude fatigue loading) were applied. Results are presented in terms of deflections, strains in concrete and FRP bars, and crack widths at different levels of cyclic loading. The results showed the superior fatigue performance and longer fatigue life of concrete bridge deck slabs reinforced with glass FRP composite bars.     

An Indexing Method for Answering Queries on Moving Objects

We consider the problem of indexing a set of objects moving in d-dimensional spaces along linear trajectories. A simple external-memory indexing scheme is proposed to efficiently answer general range queries. The following are examples of the queries that can be answered by the proposed method: report all moving objects that will (i) pass between two given points within a specified time interval; (ii) become within a given distance from some or all of a given set of other moving objects. Our scheme is based on mapping the objects to a dual space, where queries about moving objects are transformed into polyhedral queries concerning their speeds and initial locations. We then present a simple method for answering such polyhedral queries, based on partitioning the space into disjoint regions and using a B+-tree to index the points in each region. By appropriately selecting the boundaries of each region, we guarantee an average search time that matches a known lower bound for the problem. Specifically, for a fixed d, if the coordinates of a given set of N points are statistically independent, the proposed technique answers polyhedral queries, on the average, in O((N/B)^1−1/d⋅(log _B N)^1/d+K/B) I/O's using O(N/B) space, where B is the block size, and K is the number of reported points. Our approach is novel in that, while it provides a theoretical upper bound on the average query time, it avoids the use of complicated data structures, making it an effective candidate for practical applications. The proposed index is also dynamic in the sense that it allows object insertion and deletion in an amortized update cost of log _B(N) I/O's. Experimental results are presented to show the superiority of the proposed index over other methods based on R-trees. recommend Ahmed Elmagarmid     

Early detection of Alzheimer’s disease based on the state-of-the-art deep learning approach: a comprehensive survey

Multimedia Tools and Applications - Alzheimer’s disease (AD) is a form of brain disorder that causes functions’ loss in a person’s daily activity. Due to the tremendous progress...     

Structured literature image finder: Parsing text and figures in biomedical literature

The SLIF project combines text-mining and image processing to extract structured information from biomedical literature.SLIF extracts images and their captions from published papers. The captions are automatically parsed for relevant biological entities (protein and cell type names), while the images are classified according to their type (e.g., micrograph or gel). Fluorescence microscopy images are further processed and classified according to the depicted subcellular localization.The results of this process can be queried online using either a user-friendly web-interface or an XML-based web-service. As an alternative to the targeted query paradigm, SLIF also supports browsing the collection based on latent topic models which are derived from both the annotated text and the image data.The SLIF web application, as well as labeled datasets used for training system components, is publicly available at http://slif.cbi.cmu.edu.     

Fast computation of spatial selections and joins using graphics hardware

Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly determine a set of candidate objects. In the refinement step, the actual geometries of the objects are retrieved and compared to the query geometry or each other. Because of the complexity of the computational geometry algorithms involved, the CPU cost of the refinement step is usually the dominant cost of the operation for complex geometries such as polygons. Although many run-time and pre-processing-based heuristics have been proposed to alleviate this problem, the CPU cost still remains the bottleneck. In this paper, we propose a novel approach to address this problem using the efficient rendering and searching capabilities of modern graphics hardware. This approach does not require expensive pre-processing of the data or changes to existing storage and index structures, and is applicable to both intersection and distance predicates. We evaluate this approach by comparing the performance with leading software solutions. The results show that by combining hardware and software methods, the overall computational cost can be reduced substantially for both spatial selections and joins. We integrated this hardware/software co-processing technique into a popular database to evaluate its performance in the presence of indexes, pre-processing and other proprietary optimizations. Extensive experimentation with real-world data sets show that the hardware-accelerated technique not only outperforms the run-time software solutions but also performs as well if not better than pre-processing-assisted techniques.     

Neural networks of data inhibiting long memory pattern

We experiment with three neural network models for forecasting to better understand the performance of neural networks for the case when the data exhibits a long memory pattern. To obtain the optimum networks, the effect of network characteristics such as the training parameters, the number of hidden layers, and the testing and training percentages are simulated. The third model, which consists of a combination of individual time series forecasts, provides superior results.