Second Sound Measurements Near the Tricritical Point in 3He-4He Mixtures

In this paper we discuss a pulsed second sound experiment, aimed at determining accurately the critical exponent , and the predicted logarithmic correction to scaling, for the superfluid density along a tricritical path in the ³ He- ⁴ He phase diagram. We present an accurate estimate for the limits for closest approach to the tricritical point, as set by gravitationally induced sample inhomogeneities and finite size effects, and discuss some of the complications associated with measurements close to the tricritical point.     

A Combinational Perspective in Stimulating Cooperation in Mobile Ad Hoc Networks

In wireless ad hoc networks cooperation among nodes cannot always be assumed since nodes with limited resources and different owners are capable of making independent decisions. Cooperation problems in topology control and packet forwarding tasks have been mostly studied separately but these two tasks are not independent. Considering a joint cooperation problem by taking into account dependencies between tasks will result in more reliable and efficient networks. In this paper topology control definition is extended to cover cooperation problem in both packet forwarding and topology control in a single problem. In this definition nodes have to adjust their transmission power and decide on their relay role. This paper models the interactions of nodes as a potential game with two-dimensional utility function. The presented model, named TCFORCE (Topology Control packet FORwarding Cooperation Enforcement), preserves the network connectivity and reduces the energy consumption by providing cooperative paths between all pairs of nodes in the network.     

Hamshahri: A standard Persian text collection

The Persian language is one of the dominant languages in the Middle East, so there are significant amount of Persian documents available on the Web. Due to the different nature of the Persian language compared to the other languages such as English, the design of information retrieval systems in Persian requires special considerations. However, there are relatively few studies on retrieval of Persian documents in the literature and one of the main reasons is the lack of a standard test collection. In this paper, we introduce a standard Persian text collection, named Hamshahri, which is built from a large number of newspaper articles according to TREC specifications. Furthermore, statistical information about documents, queries and their relevance judgments are presented in this paper. We believe that this collection is the largest Persian text collection, so far.     

Convergence Results of the Biconjugate Residual Algorithm for Solving Generalized Sylvester Matrix Equation

In this article, we investigate a variant of the biconjugate residual (BCR) algorithm to solve the generalized Sylvester matrix equation which includes the well‐known Lyapunov, Stein and Sylvester matrix equations. We show that the BCR algorithm with any (special) initial matrix pair can smoothly compute the (least Frobenius norm) solution pair of the generalized Sylvester matrix equation within a finite number of iterations in the absence of round‐off errors. Finally the accuracy and effectiveness of the BCR algorithm in comparison to some existing algorithms are demonstrated by two numerical examples.     

Finite time control of robotic manipulators with position output feedback

This paper deals with the robust finite time tracking of desired trajectories for a wide group of robotic manipulators in spite of unknown disturbances, uncertainties, and saturations of actuators while only manipulator's positions are available and its velocities are not measurable physically. A new form of chattering‐free second order fast nonsingular terminal sliding mode control scheme is introduced to design input torques for fulfilling the determined tracking objective in the adjustable total finite settling time. The proposed control algorithm is incorporated with two nonlinear observers to estimate disturbances and velocities of joints within finite settling times. The global finite time stability of the closed‐loop manipulator is analytically proved. Finally, a numerical simulation is carried out to verify the effectiveness of the designed input torques. Copyright © 2017 John Wiley & Sons, Ltd.     

Evolution of fuzzy logic: from intelligent systems and computation to human mind

Inspired by human’s remarkable capability to perform a wide variety of physical and mental tasks without any measurements and computations and dissatisfied with classical logic as a tool for modeling human reasoning in an imprecise environment, Lotfi A. Zadeh developed the theory and foundation of fuzzy logic with his 1965 paper “Fuzzy sets” (Zadeh in Inf Control 8:378–53, 1965) and extended his work with his 2005 paper “Toward a generalized theory of uncertainty (GTU)—an outline” (Zadeh in Inf Control, 2005). Fuzzy logic has at least two main sources over the past century. The first of these sources was initiated by Peirce in the form what he called a logic of vagueness in 1900s, and the second source is Lotfi’s A. Zadeh work, fuzzy sets and fuzzy Logic in the 1960s and 1970s.     

PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids

In recent years, grid technology has had such a fast growth that it has been used in many scientific experiments and research centers. A large number of storage elements and computational resources are combined to generate a grid which gives us shared access to extra computing power. In particular, data grid deals with data intensive applications and provides intensive resources across widely distributed communities. Data replication is an efficient way for distributing replicas among the data grids, making it possible to access similar data in different locations of the data grid. Replication reduces data access time and improves the performance of the system. In this paper, we propose a new dynamic data replication algorithm named PDDRA that optimizes the traditional algorithms. Our proposed algorithm is based on an assumption: members in a VO (Virtual Organization) have similar interests in files. Based on this assumption and also file access history, PDDRA predicts future needs of grid sites and pre-fetches a sequence of files to the requester grid site, so the next time that this site needs a file, it will be locally available. This will considerably reduce access latency, response time and bandwidth consumption. PDDRA consists of three phases: storing file access patterns, requesting a file and performing replication and pre-fetching and replacement. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid projects. The simulation results show that our proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, effective network usage, total number of replications, hit ratio and percentage of storage filled.     

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.     

A hybrid metaheuristic approach for the capacitated p-median problem

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from the current solution to a neighbor solution, an open median is selected and closed. Then, a linear programming (LP) model is generated by relaxing binary constraints and adding new constraints. The generated LP solution is improved using cutting-plane inequalities. The solution of this strong LP is considered as a new neighbor solution. In order to select an open median to be closed, several strategies are proposed. The neighborhood structure is combined with a tabu search algorithm in the proposed approach. The parameters of the proposed hybrid algorithm are tuned using design of experiments approach. The proposed algorithm is tested on several sets of benchmark instances. The statistical analysis shows efficiency and effectiveness of the hybrid algorithm in comparison with the best approach found in the literature.