This research investigates the factors that affect existence of pinholes in surgical gloves during manufacturing process. Since eight gloves, a two-level fractional factorial design 28-4 was used to study main effects and first-order interactions multiple variables. Multiple linear regressions are model data. paper also examines presence influential points data using measures regression such as...

Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...

The Intentional Fast-Forward (IFF) planner is an attempt to apply fast forward-chaining state-space search methods to intentional planning—planning such that every action is directed toward some character’s goal. The IFF heuristic is based on Hoffmann’s original Fast Forward heuristic (2001), which solves a simplified version of the problem and uses that solution as a guide for the real problem...

Using TI digits recognition experiments, we show that a combination of two dynamic speech features, Liftered Forward Masked (LFM) MFCC and 2-D cepstrum, can improve system robustness to additive Volvo noise while maintaining system performance comparable to standard MFCC features in clean conditions. Through experiments, we show that the information extracted by forward masking and by the 2D ce...

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by conjoining “building block” subsets of length three in V(G). We prove the correctness of this algorithm and present an asymptotic time complexity analysis of...

W-CDMA and SW-CDMA air interfaces are based on code division multiple access and as in all spread spectrum systems the initial acquisition procedure is a challenging issue. This procedure is identified as cell search in W-CDMA and beam search in SWCDMA. Although the terrestrial air interface W-CDMA and the satellite one SW-CDMA are very similar, the suggested cell/beam search procedures are dif...

Heuristic search with reachability-based heuristics is arguably the most successful paradigm in Automated Planning to date. In its earlier stages of development, heuristic search was proposed as both forward and backward search. Due to the disadvantages of backward search, in the last decade researchers focused mainly on forward search, and backward search was abandoned for the most part as a v...