Analysis of surface integrity for minimum quantity lubricant—MQL in grinding

The quality of machined components is currently of high interest, for the market demands mechanical components of increasingly high performance, not only from the standpoint of functionality but also from that of safety. Components produced through operations involving the removal of material display surface irregularities resulting not only from the action of the tool itself, but also from other factors that contribute to their superficial texture. This texture can exert a decisive influence on the application and performance of the machined component. This article analyzes the behavior of the minimum quantity lubricant (MQL) technique and compares it with the conventional cooling method. To this end, an optimized fluid application method was devised using a specially designed nozzle, by the authors, through which a minimum amount of oil is sprayed in a compressed air flow, thus meeting environmental requirements. This paper, therefore, explores and discusses the concept of the MQL in the grinding process. The performance of the MQL technique in the grinding process was evaluated based on an analysis of the surface integrity (roughness, residual stress, microstructure and microhardness). The results presented here are expected to lead to technological and ecological gains in the grinding process using MQL.     

Importance of Reservoir Tributaries to Spawning of Migratory Fish in the Upper Paraná River

Regulation of rivers by dams transforms previously lotic reaches above the dam into lentic ones and limits or prevents longitudinal connectivity, which impairs access to suitable habitats for the reproduction of many migratory fish species. Frequently, unregulated tributaries can provide important habitat heterogeneity to a regulated river and may mitigate the influence of impoundments on the mainstem river. We evaluated the importance of tributaries to spawning of migratory fish species over three spawning seasons, by comparing several abiotic conditions and larval fish distributions in four rivers that are tributaries to an impounded reach of the Upper Paraná River, Brazil. Our study confirmed reproduction of at least 8 long‐distance migrators, likely nine, out of a total of 19 occurring in the Upper Paraná River. Total larval densities and percentage species composition differed among tributaries, but the differences were not consistent among spawning seasons and unexpectedly were not strongly related to annual differences in temperature and hydrology. We hypothesize that under present conditions, densities of larvae of migratory species may be better related to efficiency of fish passage facilities than to temperature and hydrology. Our study indicates that adult fish are finding suitable habitat for spawning in tributaries, fish eggs are developing into larvae, and larvae are finding suitable rearing space in lagoons adjacent to the tributaries. Our findings also suggest the need for establishment of protected areas in unregulated and lightly regulated tributaries to preserve essential spawning and nursery habitats. Copyright © 2014 John Wiley & Sons, Ltd.     

Genetic programming for QoS-aware web service composition and selection

Web services, which can be described as functionality modules invoked over a network as part of a larger application are often used in software development. Instead of occasionally incorporating some of these services in an application, they can be thought of as fundamental building blocks that are combined in a process known as Web service composition. Manually creating compositions from a large number of candidate services is very time consuming, and developing techniques for achieving this objective in an automated manner becomes an active research field. One promising group of techniques encompasses evolutionary computing, which can effectively tackle the large search spaces characteristic of the composition problem. Therefore, this paper proposes the use of genetic programming for Web service composition, investigating three variations to ensure the creation of functionally correct solutions that are also optimised according to their quality of service. A variety of comparisons are carried out between these variations and two particle swarm optimisation approaches, with results showing that there is likely a trade-off between execution time and the quality of solutions when employing genetic programming and particle swarm optimisation. Even though genetic programming has a higher execution time for most datasets, the results indicate that it scales better than particle swarm optimisation.     

Fast intra prediction algorithm based on texture analysis for 3D-HEVC encoders

The advances in display technologies and the growing popularity of 3D video systems have attracted more consumers for 3D viewing experiences, and, consequently, the demand for storage and transmission of 3D video content is increasing. To cope with this demand, a 3D video extension of high-efficiency video coding (HEVC) standard is being developed and near the final standardization stage. The upcoming 3D-HEVC standard is expected to provide higher encoding efficiency than its predecessors, supporting multiple views with high resolution, at a cost of considerable increase in computational complexity, which can be an obstacle to its use in real-time applications. This article proposes a novel complexity reduction algorithm developed to optimize the 3D-HEVC intra mode decision targeting real-time video processing for consumer devices with limited computational power, such as 3D camcorders and smartphones equipped with multiple cameras and depth acquisition capabilities. The proposed algorithm analyzes the texture frames and depth maps to estimate the orientation of edges present in the prediction unit data, speeding up the intra prediction process and reducing the 3D-HEVC encoding processing time. Experimental results demonstrate that the proposed algorithm can save 26 % in computational complexity on average with negligible loss of encoding efficiency. This solution contributes to make more feasible the compression of 3D videos targeting real-time applications in power-constrained devices.     

Characterizing peers communities and dynamics in a P2P live streaming system

Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships.     

A Strategy of Density-Based Partitioning for Scalability Problem in Network Self-management

A density-based partitioning strategy is proposed for large domain networks in order to deal with the scalability issue found in autonomic networks considering, as a scenario, the autonomic Quality of Service （QoS） management context. The approach adopted focus as on obtaining dense network partitions having more paths for a given vertices set in the domain. It is demonstrated that dense partitions improve autonomic processing scalability, for instance, reducing routing process complexity. The solution looks for a significant trade-off between partition autonomic algorithm execution time and path selection quality in large domains. Simulation scenarios for path selection execution time are presented and discussed. Authors argue that autonomic networks may benefit from the dense partition approach proposed by achieving scalable, efficient and near real-time support for autonomic management systems.     

Experience with model-based performance, reliability, and adaptability assessment of a complex industrial architecture

In this paper, we report on our experience with the application of validated models to assess performance, reliability, and adaptability of a complex mission critical system that is being developed to dynamically monitor and control the position of an oil-drilling platform. We present real-time modeling results that show that all tasks are schedulable. We performed stochastic analysis of the distribution of task execution time as a function of the number of system interfaces. We report on the variability of task execution times for the expected system configurations. In addition, we have executed a system library for an important task inside the performance model simulator. We report on the measured algorithm convergence as a function of the number of vessel thrusters. We have also studied the system architecture adaptability by comparing the documented system architecture and the implemented source code. We report on the adaptability findings and the recommendations we were able to provide to the system’s architect. Finally, we have developed models of hardware and software reliability. We report on hardware and software reliability results based on the evaluation of the system architecture.     

Spectroscopic Multicomponent Analysis Using Multi-objective Optimization for Variable Selection

The multiple determination tasks of chemical properties are a classical problem in analytical chemistry. The major problem is concerned in to find the best subset of variables that better represents the compounds. These variables are obtained by a spectrophotometer device. This device measures hundreds of correlated variables related with physicocbemical properties and that can be used to estimate the component of interest. The problem is the selection of a subset of informative and uncorrelated variables that help the minimization of prediction error. Classical algorithms select a subset of variables for each compound considered. In this work we propose the use of the SPEA-II （strength Pareto evolutionary algorithm II）. We would like to show that the variable selection algorithm can selected just one subset used for multiple determinations using multiple linear regressions. For the case study is used wheat data obtained by NIR （near-infrared spectroscopy） spectrometry where the objective is the determination of a variable subgroup with information about E protein content （%）, test weight （Kg/HI）, WKT （wheat kernel texture） （%） and farinograph water absorption （%）. The results of traditional techniques of multivariate calibration as the SPA （successive projections algorithm）, PLS （partial least square） and mono-objective genetic algorithm are presents for comparisons. For NIR spectral analysis of protein concentration on wheat, the number of variables selected from 775 spectral variables was reduced for just 10 in the SPEA-II algorithm. The prediction error decreased from 0.2 in the classical methods to 0.09 in proposed approach, a reduction of 37%. The model using variables selected by SPEA-II had better prediction performance than classical algorithms and full-spectrum partial least-squares.     

Flatness-Based Control of a Single Qubit Gate

This work considers the open-loop control problem of steering a two-level quantum system from any initial to any final condition. The model of this system evolves on the state space , having two inputs that correspond to the complex amplitude of a resonant laser field. A symmetry preserving flat output is constructed using a fully geometric construction and quaternion computations. Simulation results of this flatness-based open-loop control are provided.     

Performance bounds in linear control of unstable MIMO systems with pole location constraint

This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals.