An enriched FEM technique for modeling hydraulically driven cohesive fracture propagation in impermeable media with frictional natural faults: Numerical and experimental investigations

In this paper, an enriched finite element technique is presented to simulate the mechanism of interaction between the hydraulic fracturing and frictional natural fault in impermeable media. The technique allows modeling the discontinuities independent of the finite element mesh by introducing additional DOFs. The coupled equilibrium and flow continuity equations are solved using a staggered Newton solution strategy, and an algorithm is proposed on the basis of fixed‐point iteration concept to impose the flow condition at the hydro‐fracture mouth. The cohesive crack model is employed to introduce the nonlinear fracturing process occurring ahead of the hydro‐fracture tip. Frictional contact is modeled along the natural fault using the penalty method within the framework of plasticity theory of friction. Moreover, an experimental investigation is carried out to perform the hydraulic fracturing experimental test in fractured media under plane strain condition. The results of several numerical and experimental simulations are presented to verify the accuracy and robustness of the proposed computational algorithm as well as to investigate the mechanisms of interaction between the hydraulically driven fracture and frictional natural fault. Copyright © 2015 John Wiley & Sons, Ltd.     

Two-stage Robust Network Design with Exponential Scenarios

We study two-stage robust variants of combinatorial optimization problems on undirected graphs, like Steiner tree, Steiner forest, and uncapacitated facility location. Robust optimization problems, previously studied by Dhamdhere et al. (Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05), pp. 367–378, 2005), Golovin et al. (Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2006), and Feige et al. (Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference, pp. 439–453, 2007), are two-stage planning problems in which the requirements are revealed after some decisions are taken in Stage 1. One has to then complete the solution, at a higher cost, to meet the given requirements. In the robust k-Steiner tree problem, for example, one buys some edges in Stage 1. Then k terminals are revealed in Stage 2 and one has to buy more edges, at a higher cost, to complete the Stage 1 solution to build a Steiner tree on these terminals. The objective is to minimize the total cost under the worst-case scenario. In this paper, we focus on the case of exponentially many scenarios given implicitly. A scenario consists of any subset of k terminals (for k-Steiner tree), or any subset of k terminal-pairs (for k-Steiner forest), or any subset of k clients (for facility location). Feige et al. (Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference, pp. 439–453, 2007) give an LP-based general framework for approximation algorithms for a class of two stage robust problems. Their framework cannot be used for network design problems like k-Steiner tree (see later elaboration). Their framework can be used for the robust facility location problem, but gives only a logarithmic approximation. We present the first constant-factor approximation algorithms for the robust k-Steiner tree (with exponential number of scenarios) and robust uncapacitated facility location problems. Our algorithms are combinatorial and are based on guessing the optimum cost and clustering to aggregate nearby vertices. For the robust k-Steiner forest problem on trees and with uniform multiplicative increase factor for Stage 2 (also known as inflation), we present a constant approximation. We show APX-hardness of the robust min-cut problem (even with singleton-set scenarios), resolving an open question of (Dhamdhere et al. in Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05), pp. 367–378, 2005) and (Golovin et al. in Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2006).     

A local linear radial basis function neural network for financial time-series forecasting

In this paper a Local Linear Radial Basis Function Neural Network (LLRBFN) is presented. The difference between the proposed neural network and the conventional Radial Basis Function Neural Network (RBFN) is connection weights between the hidden layer and the output layer which are replaced by a local linear model in the LLRBFN. A modified Particle Swarm Optimization (PSO) with hunter particles is introduced for training the LLRBFN. The proposed methods have been applied for prediction of financial time-series and the result shows the feasibility and effectiveness.     

On the use of the RMR system for estimation of rock mass deformation modulus

Estimation of rock mass deformation modulus is the subject of many studies in rock engineering research work. Although numerous predictive models have been developed for the estimation of the deformation modulus, they cannot be generalized for other sites because of inadequate accuracy. Furthermore, it is very valuable that the predictive models involve some accessible input parameters. The rock mass rating (RMR) is a well-known geomechanical parameter, which is usually determined to describe the quality of rock mass in rock engineering projects. In this study, five parameter ratings of the RMR classification system are used to predict the deformation modulus of rock mass in the abutment of the Gotvand earth dam. Statistical analysis and an artificial neural network are employed to present two new predictive models. Finally, probabilistic analysis is used to predict the rock mass deformation modulus, which overcomes the low accuracy caused by the inherent uncertainty in prediction. The results indicated that the parameter ratings used in the RMR classification system can predict the rock mass deformation modulus with a satisfactory correlation. However, the parameters don’t have the same influence on the rock mass deformability with the joint condition and the groundwater as the major and minor influencing parameters, respectively.     

A fuzzy irregular cellular automata-based method for the vertex colouring problem

ABSTRACT

Vertex colouring is among the most important problems in graph theory which has been widely applied across different real-world problems. In vertex colouring problem (VCP), the goal is to assign a distinct colour to each vertex of the graph in such a way that no two adjacent vertices have the same colour. This paper presents a fuzzy irregular cellular automaton (FICA) for finding a near-optimal solution for the VCP. FICA is an extension fuzzy cellular automaton (FCA) in which the cells of the automaton can be arranged in an irregular structure. The aim of the proposed method is to reap the benefits of both FCA and irregular cellular automata while minimising their drawbacks. To evaluate the proposed method, various computer simulations have been conducted on a variety of graphs. The results suggest that the proposed method is able to achieve better results in terms of the minimum number of required colours and the execution time of the algorithm, compared to other peer algorithms.     

Mangrove Oyster (Crassostrea belcheri) as a Biomonitor Species for Bioavailability of Polycyclic Aromatic Hydrocarbons (PAHs) from Sediment of the West Coast of Peninsular Malaysia

ABSTRACT

Rapid industrialization and urbanization in the west coast of Peninsular Malaysia has caused increasing pollution particularly of petroleum and petroleum by-products. Surface sediment and mangrove oyster (Crassostrea belcheri) were collected from five mangrove ecosystems in the west coast of Peninsular Malaysia and investigated for bioavailability of polycyclic aromatic hydrocarbons (PAHs). Sampling locations were selected from both remote areas with few or no previous records of petroleum pollution such as Pulau Merambong and polluted areas that are under international attention such as Klang mangrove ecosystem. PAH fractions were obtained through soxhlet extraction and two-step column chromatography and the fractions were injected to gas chromatography-mass spectrometry (GC-MS) for analysis. The concentrations of PAHs ranged from 151 to 4973 ng g^?1 dw in the sediments, while from 309 to 2225 ng g^?1 dw in the oysters. When tested for diagnostic ratios, a predominance of pyrogenic source PAHs was detected in the sediments, whereas PAHs in the oysters had mixed petrogenic and pyrogenic sources. A significant correlation (p < 0.05) was found between high molecular weight (HMW) PAHs in the sediments and oysters and biota accumulation factors (BAFs) of PAHs were approaching or exceeding unity indicating the ability of mangrove oyster in bioaccumulation of PAHs. Overall, this study indicates that mangrove oyster (C. belcheri) can be used as a biomonitor species for PAHs in an aquatic environment.     

sEMG-based impedance control for lower-limb rehabilitation robot

Recently, various rehabilitation robots have been developed for therapeutic exercises. Additionally, several control methods have been proposed to control the rehabilitation robots based on user’s motion intention. One of the common control methods used is torque-based impedance control. This paper presents an electromyogram-based robust impedance control for a lower-limb rehabilitation robot using a voltage-based strategy. The proposed control strategy uses surface electromyogram (sEMG) signals in place of force sensors to estimate the exerted force. In addition, the control is based on the voltage control strategy, which differs from the common torque control strategies. For example, unlike the torque-based impedance control, the controller is not dependent on the dynamical models of the patient and the robot. This is particularly important as the dynamic of the patient is both difficult to model precisely and changes during the rehabilitation period. These simplifications results in a significant reduction in calculation time. To illustrate the effectiveness of the control approach, a 1-DOF lower-limb rehabilitation robot is designed. Experimental sEMG-force data are collected and used to train an artificial neural network. Simulation results show that compared with a torque-based control approach, the voltage-based is simpler, less computational and more efficient while it considers the presence of actuators. Finally, we design an adaptive fuzzy system to estimate and compensate the uncertainty in performing the impedance rule. The adaptive fuzzy system has an advantage that does not need new feedback to estimate the uncertainty. The control approach is further verified by stability analysis. Simulation results show the efficiency of the control approach in performing some therapeutic exercises.     

Permutation Betting Markets: Singleton Betting with Extra Information

We study permutation betting markets, introduced by Chen et al. (Proceedings of the ACM Conference on Electronic Commerce, 2007). For these markets, we consider subset bettings in which each trader can bet on a subset of candidates ending up in a subset of positions. We consider the revenue maximization problem for the auctioneer in two main frameworks: the risk-free revenue maximization (studied in Chen et al., Proceedings of the ACM Conference on Electronic Commerce, 2007), and the probabilistic revenue maximization. We also explore the use of some certain knowledge or extra information about the possible outcomes of the market. We first show that finding the optimal revenue in the risk-free model for the subset betting problem is inapproximable. This resolves an open question posed by Chen et al. (Proceedings of the ACM Conference on Electronic Commerce, 2007). In order to identify solvable variants of the problem, we propose the singleton betting language which allows traders to bet an arbitrary value on one candidate for one position. For singleton bettings, we first provide a linear-time implementable necessary and sufficient condition for existence of a solution with positive revenue for any possible outcome. Furthermore, we develop an LP-based polynomial-time algorithm to find the optimum solution of this problem. In addition, we show how to extend this LP-based method to handle some extra information about the possible outcomes. Finally, we consider the revenue maximization problem in a probabilistic setting. For this variant, we observe that the problem of maximizing the expected revenue is polynomial-time solvable, but we show that maximizing the probability of achieving a pre-specified revenue is #P-Complete.     

A case study on energy and exergy analyses for an industrial-scale vertical roller mill assisted grinding in cement plant

In this study, the analyses of energy and exergy were implemented for an industrial-scale vertical roller mill (VRM) of Kerman Momtazan Cement Company (KMCC) of Iran. The energy and exergy analyses demonstrated the first law efficiency of the VRM is 62.1%, while the second law efficiency of the VRM is 34.6%. Comparing to the widely applied ball milling, the second law efficiency is 16.4% higher for the VRM than the ball mill. Results also showed when the classifier rotor speed increases from 53 to 65 rpm, the particle size of the product decreases from P_90µm = 18.2% to P_90µm = 10.8%, but the power consumption of the VRM unit increases from 19.7 to 22.3 kWh/t of raw materials. Finally, the power consumption of the VRM unit compared with 14 raw mill units around Iran and the international best available technology (IBAT). The results demonstrated that the VRM unit consumes around 81% (9.75 kWh/t of raw materials), and 36% (5.8 kWh/t of raw materials) more energy to grind raw material than the IBAT unit and domestic best raw mill (DBRM), respectively.