Fracture investigation of U‐notch made of tungsten–copper functionally graded materials by means of strain energy density

The averaged strain energy density over a well‐defined control volume was employed to assess the fracture of U‐notched specimens made of tungsten–copper functionally graded materials under prevalent mode II loading. The boundary of control volume was evaluated by using a numerical method. Power law function was employed to describe the mechanical properties (elasticity modulus, Poisson's ratio, fracture toughness and ultimate tensile stress) through the specimen width. The effect of notch tip radius and notch depth on notch stress intensity factors and mode mixity parameter χ were assessed. In addition, a comparison based on fracture load between functionally graded and homogeneous W–Cu was made. Furthermore, in this research, it was shown that the mean value of the strain energy density over the control volume can be accurately determined using coarse meshes for functionally graded materials.     

Single point incremental forming: state-of-the-art and prospects

Incremental sheet metal forming in general and Single Point Incremental Forming (SPIF) specifically have gone through a period of intensive development with growing attention from research institutes worldwide. The result of these efforts is significant progress in the understanding of the underlying forming mechanisms and opportunities as well as limitations associated with this category of flexible forming processes. Furthermore, creative process design efforts have enhanced the process capabilities and process planning methods. Also, simulation capabilities have evolved substantially. This review paper aims to provide an overview of the body of knowledge with respect to Single Point Incremental Forming. Without claiming to be exhaustive, each section aims for an up-to-date state-of-the-art review with corresponding conclusions on scientific progress and outlook on expected further developments.     

Controlled gates for multi-level quantum computation

Multi-level (ML) quantum logic can potentially reduce the number of inputs/outputs or quantum cells in a quantum circuit which is a limitation in current quantum technology. In this paper we propose theorems about ML-quantum and reversible logic circuits. New efficient implementations for some basic controlled ML-quantum logic gates, such as three-qudit controlled NOT, Cycle, and Self Shift gates are proposed. We also propose lemmas about r-level quantum arrays and the number of required gates for an arbitrary n-qudit ML gate. An equivalent definition of quantum cost (QC) of binary quantum gates for ML-quantum gates is introduced and QC of controlled quantum gates is calculated.     

Double Auction-based Scheduling of Scientific Applications in Distributed Grid and Cloud Environments

Economy models have long been considered as a promising complement to the classical distributed resource management not only due of their dynamic and decentralized nature, but also because the concept of financial valuation of resources and services is an inherent part of any such model. In its broadest sense, scheduling of scientific applications in distributed Grid and Cloud environments can be regarded as a market-based negotiation between a scheduling service optimizing user-centric objectives (execution time, budget), and a resource manager optimizing provider-centric metrics (resource utilization, income, job throughput). In this paper, we propose a new instantiation of the negotiation protocol between the scheduler and resource manager using a market-based Continuous Double Auction (CDA) model. We analyze different scheduling strategies that can be applied and identify general strategic patterns that can lead to a fast and cheap work ow execution. In the experimental study, we demonstrate that under certain circumstances one can benefit by applying an aggressive scheduling strategy.     

The comparison of incomplete sensitivities and Genetic algorithms applications in 3D radial turbomachinery blade optimization

In the present work, a centrifugal pump impeller’s blades shape was redesigned to reach a higher efficiency in turbine mode using two different optimization algorithms: one is a local method as incomplete sensitivities–gradient based optimization algorithm coupled by 3D Navier–Stokes flow solver, and another is a global method as Genetic algorithms and artificial neural network coupled by 3D Navier–Stokes flow solver. New impeller was manufactured and tested in the test rig. Comparison of the local optimization method results with the global optimization method results showed that the gradient based method has detected the global optimum point. Experimental results confirmed the numerical efficiency improvement in all measured points. This study illustrated that the developed gradient based optimization method is efficient for 3D radial turbomachinery blade optimization.     

A hybrid capacitive pressure and temperature sensor fabricated by adhesive bonding technique for harsh environment of kraft pulp digesters

We have developed a compensated capacitive pressure and temperature sensor for kraft pulp digesters (pH 13.5, temperatures 25–175°C reaching a local maximum of 180°C and pressures up to 2 MPa). The gauge capacitive pressure sensor was fabricated by bonding silicon and Pyrex chips using a high temperature, low viscosity UV (ultraviolent) adhesive as the gap-controlling layer and heat curing adhesive as the bonding agent. A simple chip bonding technique, involving insertion of the adhesive into the gap between two chips was developed. A platinum thin-film wire was patterned on top of a silicon chip to form a resistance temperature detector (RTD) with a nominal resistance of 1,500 Ω. A silicon dioxide layer and a thin layer of Parylene were deposited to passivate the pressure sensor diaphragm and the sensors were embedded into epoxy for protection against the caustic environment in kraft digesters. The sensors were tested up to 2 MPa and 170°C in an environment chamber. The maximum thermal error of ±1% (absolute value of ±20 kPa) full scale output (FSO) and an average sensitivity of 0.554 fF/kPa were measured. Parylene-coated silicon chips were tested for a full kraft pulping cycle with no signs of corrosion.     

Genetic-based minimum classification error mapping for accurate identifying Peer-to-Peer applications in the internet traffic

In this paper, we propose a hybrid approach using genetic algorithm and neural networks to classify Peer-to-Peer (P2P) traffic in IP networks. We first compute the minimum classification error (MCE) matrix using genetic algorithm. The MCE matrix is then used during the pre-processing step to map the original dataset into a new space. The mapped data set is then fed to three different classifiers: distance-based, K-Nearest Neighbors, and neural networks classifiers. We measure three different indexes, namely mutual information, Dunn, and SD to evaluate the extent of separation of the data points before and after mapping is performed. The experimental results demonstrate that with the proposed mapping scheme we achieve, on average, 8% higher accuracy in classification of the P2P traffic compare to the previous solutions. Moreover, the genetic-based MCE matrix increases the classification accuracy more than what the basic MCE does.     

A fast and noise resilient cluster-based anomaly detection

Clustering, while systematically applied in anomaly detection, has a direct impact on the accuracy of the detection methods. Existing cluster-based anomaly detection methods are mainly based on spherical shape clustering. In this paper, we focus on arbitrary shape clustering methods to increase the accuracy of the anomaly detection. However, since the main drawback of arbitrary shape clustering is its high memory complexity, we propose to summarize clusters first. For this, we design an algorithm, called Summarization based on Gaussian Mixture Model (SGMM), to summarize clusters and represent them as Gaussian Mixture Models (GMMs). After GMMs are constructed, incoming new samples are presented to the GMMs, and their membership values are calculated, based on which the new samples are labeled as “normal” or “anomaly.” Additionally, to address the issue of noise in the data, instead of labeling samples individually, they are clustered first, and then each cluster is labeled collectively. For this, we present a new approach, called Collective Probabilistic Anomaly Detection (CPAD), in which, the distance of the incoming new samples and the existing SGMMs is calculated, and then the new cluster is labeled the same as of the closest cluster. To measure the distance of two GMM-based clusters, we propose a modified version of the Kullback–Libner measure. We run several experiments to evaluate the performances of the proposed SGMM and CPAD methods and compare them against some of the well-known algorithms including ABACUS, local outlier factor (LOF), and one-class support vector machine (SVM). The performance of SGMM is compared with ABACUS using Dunn and DB metrics, and the results indicate that the SGMM performs superior in terms of summarizing clusters. Moreover, the proposed CPAD method is compared with the LOF and one-class SVM considering the performance criteria of (a) false alarm rate, (b) detection rate, and (c) memory efficiency. The experimental results show that the CPAD method is noise resilient, memory efficient, and its accuracy is higher than the other methods.     

Classifying the Geometric Dilution of Precision of GPS satellites utilizing Bayesian decision theory

The errors resulting from satellite configuration geometry can be determined by Geometric Dilution of Precision (GDOP). Considering optimal satellite subset selection, lower GDOP value usually causes better accuracy in GPS positioning. However, GDOP computation based on complicated transformation and inversion of measurement matrices is a time consuming procedure. This paper deals with classification of GPS GDOP utilizing Parzen estimation based Bayesian decision theory. The conditional probability of each class is estimated by Parzen algorithm. Then based on Bayesian decision theory, the class with maximum posterior probability is selected. The experiments on measured dataset demonstrate that the proposed algorithm lead, in mean classification improvement, to 4.08% in comparison with Support Vector Machine (SVM) and 9.83% in comparison with K-Nearest Neighbour (KNN) classifier. Extra work on feature extraction has been performed based on Principle Component Analysis (PCA). The results demonstrate that the feature extraction approach has best performance respect to all classifiers.     

A new fuzzy decision-making procedure applied to emergency electric power distribution scheduling

In this paper a new fuzzy decision-making procedure is developed. Two levels of weightings, called upper and lower weights, are proposed to calculate the fuzzy weightings of different criteria. The preference table is introduced to calculate the upper and lower weights. Also a new method is developed to determine the expected preference values of different alternatives. These values are used for generating the priority list of alternatives. The procedure is applied for providing an emergency electric power distribution, scheduling time table. The IEEE 14-bus standard system and a 14-bus system with four power plants are considered as case studies. Using fuzzy decision-making procedure, the regions with more priorities are more connected to the distribution net, while the maximum consumption criterion is also reasonably respected.