Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines

In spite of many studies, investigating balancing and sequencing problems in Mixed-Model Assembly Line (MMAL) individually, this paper solves them simultaneously aiming to minimize total utility work. A new Mixed-Integer Linear Programming (MILP) model is developed to provide the exact solution of the problem with station-dependent assembly times. Because of NP-hardness, a Simulated Annealing (SA) is applied and compared to the Co-evolutionary Genetic Algorithm (Co-GA) from the literature. To strengthen the search process, two main hypotheses, namely simultaneous search and feasible search, are developed contrasting Co-GA. Various parameters of SA are reviewed to calibrate the algorithm by means of Taguchi design of experiments. Numerical results statistically show the efficiency and effectiveness of the proposed SA in terms of both the quality of solution and the time of achieving the best solution. Finally, the contribution of each hypothesis in this superiority is analyzed.     

Solving coupled matrix equations over generalized bisymmetric matrices

In this paper, an iterative algorithm is established for finding the generalized bisymmetric solution group to the coupled matrix equations (including the generalized (coupled) Lyapunov and Sylvester matrix equations as special cases). It is proved that proposed algorithm consistently converges to the generalized bisymmetric solution group for any initial generalized bisymmetric matrix group. Finally a numerical example indicates that proposed algorithm works quite effectively in practice.     

Theoretical and experimental analyses of rheological,compatibility and mechanical properties of PVMQ/XNBR-g GMA/XNBR/GO ternary hybrid nanocomposites

Iranian Polymer Journal - Effects of graphene oxide (GO) on various properties of rubber hybrid nanocomposites based on PVMQ/XNBR-g-GMA/XNBR (phenyl-vinyl-methyl-polysiloxane/carboxylated nitrile...     

Mesoporous SBA-15@n-Pr-THAM-ZrO organic–inorganic hybrid: as a highly efficient reusable nanocatalyst for the synthesis of polyhydroquinolines and 2,3-dihydroquinazolin-4 (1h)-ones

Journal of Porous Materials - In this work, tris(hydroxymethyl)aminomethane-Zirconium complex supported on modified SBA-15 (SBA-15@n-Pr-THMAM-ZrO) prepared as a novel mesoporous catalyst. The...     

Formal process algebraic modeling,verification, and analysis of an abstract Fuzzy Inference Cloud Service

In cloud computing, services play key roles. Services are well defined and autonomous components. Nowadays, the demand of using Fuzzy inference as a service is increasing in the domain of complex and critical systems. In such systems, along with the development of the software, the cost of detecting and fixing software defects increases. Therefore, using formal methods, which provide clear, concise, and mathematical interpretation of the system, is crucial for the design of these Fuzzy systems. To obtain this goal, we introduce the Fuzzy Inference Cloud Service (FICS) and propose a novel discipline for formal modeling of the FICS. The FICS provides the service of Fuzzy inference to the consumers. We also introduce four novel formal verification tests, which allow strict analysis of certain behavioral disciplines in the FICS as follows: (1) Internal consistency, which analyzes the service in a strict and delicate manner; (2) Deadlock freeness; (3) Divergence freeness; and (4) Goal reach ability. The four tests are discussed and the FICS is verified to ensure that it can pass all these tests.     

Bi-level fuzzy based advanced reservation of Cloud workflow applications on distributed Grid resources

The increasing demand on execution of large-scale Cloud workflow applications which need a robust and elastic computing infrastructure usually lead to the use of high-performance Grid computing clusters. As the owners of Cloud applications expect to fulfill the requested Quality of Services (QoS) by the Grid environment, an adaptive scheduling mechanism is needed which enables to distribute a large number of related tasks with different computational and communication demands on multi-cluster Grid computing environments. Addressing the problem of scheduling large-scale Cloud workflow applications onto multi-cluster Grid environment regarding the QoS constraints declared by application’s owner is the main contribution of this paper. Heterogeneity of resource types (service type) is one of the most important issues which significantly affect workflow scheduling in Grid environment. On the other hand, a Cloud application workflow is usually consisting of different tasks with the need for different resource types to complete which we call it heterogeneity in workflow. The main idea which forms the soul of all the algorithms and techniques introduced in this paper is to match the heterogeneity in Cloud application’s workflow to the heterogeneity in Grid clusters. To obtain this objective a new bi-level advanced reservation strategy is introduced, which is based upon the idea of first performing global scheduling and then conducting local scheduling. Global-scheduling is responsible to dynamically partition the received DAG into multiple sub-workflows that is realized by two collaborating algorithms: (1) The Critical Path Extraction algorithm (CPE) which proposes a new dynamic task overall critically value strategy based on DAG’s specification and requested resource type QoS status to determine the criticality of each task; and (2) The DAG Partitioning algorithm (DAGP) which introduces a novel dynamic score-based approach to extract sub-workflows based on critical paths by using a new Fuzzy Qualitative Value Calculation System to evaluate the environment. Local-scheduling is responsible for scheduling tasks on suitable resources by utilizing a new Multi-Criteria Advance Reservation algorithm (MCAR) which simultaneously meets high reliability and QoS expectations for scheduling distributed Cloud-base applications. We used the simulation to evaluate the performance of the proposed mechanism in comparison with four well-known approaches. The results show that the proposed algorithm outperforms other approaches in different QoS related terms.     

Modification of leather properties by grafting. I. Effect of monomer chain on the physico‐mechanical properties of grafted leather

Although leather has a number of desirable properties such as thermal stability and fire retardancey, in addition to high toughness, it has a few drawbacks such as weight, high water absorption, poor soil and rot resistance, and nonuniformity. If these defects are overcome, leather's usefulness would be further enhanced and its competitive position with respect to synthetics would increase. This study reports the physical and mechanical properties of buffalo leather after chemical graft copolymerization with ethyl acrylate, butyl acrylate, and 2‐ethyl hexyl acrylate using benzoyl peroxide as an initiator. The optimum conditions for grafting (e.g., monomer and initiator concentrations, temperature and time of grafting, and solvent leather ratio) were extensively investigated. The study achieved outstanding properties for buffalo leather in reduction of water uptake after grafting, especially on using 2‐ethyl hexyl acrylate and butyl acrylate monomers. FT‐IR and solid ¹³C‐NMR for leather before and after grafting confirmed the grafting process.© 2003 Wiley Periodicals, Inc. J Appl Polym Sci 89: 1478–1483, 2003     

Performance evaluation of an importance sampling technique in a Jackson network

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queueing theory, and in applied probability at large. In this article, we analyse the performance of an importance sampling estimator for a rare event probability in a Jackson network. This article carries out strict deadlines to a two-node Jackson network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We have estimated the probability of network blocking for various sets of parameters, and also the probability of missing the deadline of customers for different loads and deadlines. We have finally shown that the probability of total population overflow may be affected by various deadline values, service rates and arrival rates.     

On detecting co-resident cloud instances using network flow watermarking techniques

Virtualization is the cornerstone of the developing third-party compute industry, allowing cloud providers to instantiate multiple virtual machines (VMs) on a single set of physical resources. Customers utilize cloud resources alongside unknown and untrusted parties, creating the co-resident threat—unless perfect isolation is provided by the virtual hypervisor, there exists the possibility for unauthorized access to sensitive customer information through the exploitation of covert side channels. This paper presents co-resident watermarking, a traffic analysis attack that allows a malicious co-resident VM to inject a watermark signature into the network flow of a target instance. This watermark can be used to exfiltrate and broadcast co-residency data from the physical machine, compromising isolation without reliance on internal side channels. As a result, our approach is difficult to defend against without costly underutilization of the physical machine. We evaluate co-resident watermarkingunder a large variety of conditions, system loads and hardware configurations, from a local laboratory environment to production cloud environments (Futuregrid and the University of Oregon’s ACISS). We demonstrate the ability to initiate a covert channel of 4 bits per second, and we can confirm co-residency with a target VM instance in $<$ 10 s. We also show that passive load measurement of the target and subsequent behavior profiling is possible with this attack. We go on to consider the detectability of co-resident watermarking, extending our scheme to create a subtler watermarking attack by imitating legitimate cloud customer behavior. Our investigation demonstrates the need for the careful design of hardware to be used in the cloud.     

On the stability issues of switched singular time‐delay systems with slow switching based on average dwell‐time

The issue of exponential stability analysis of continuous‐time switched singular systems consisting of a family of stable and unstable subsystems with time‐varying delay is investigated in this paper. It is very difficult to analyze the stability of such systems because of the existence of time‐delay and unstable subsystems. In this regard, on the basis of the free‐weighting matrix approach, by constructing the new Lyapunov‐like Krasovskii functional, and using the average dwell‐time approach, delay‐dependent sufficient conditions are derived and formulated in terms of LMIs to check the exponential stability of such systems. This paper also highlights the relationship between the average dwell‐time of the switched singular time‐delay system, its stability, exponential convergence rate of differential states, and algebraic states. Finally, a numerical example is given to confirm the analytical results and illustrate the effectiveness of the proposed strategy. Copyright © 2012 John Wiley & Sons, Ltd.