Predicting roadheader performance by using artificial neural network

With growing use of roadheaders in the world and its significant role in the successful accomplishment of a tunneling project, it is a necessity to accurately predict performance of this machine in different ground conditions. On the other hand, the existence of some shortcomings in the prediction models has made it necessary to perform more research on the development of the new models. This paper makes an attempt to model the rate of roadheader performance based on the geotechnical and geological site conditions. For achieving the aim, an artificial neural network (ANN), a powerful tool for modeling and recognizing the sophisticated structures involved in data, is employed to model the relationship between the roadheader performance and the parameters influencing the tunneling operations with a high correlation. The database used in modeling is compiled from laboratory studies conducted at Azad University at Science and Research Branch, Tehran, Iran. A model with architecture 4-10-1 trained by back-propagation algorithm is found to be optimum. A multiple variable regression (MVR) analysis is also applied to compare performance of the neural network. The results demonstrate that predictive capability of the ANN model is better than that of the MVR model. It is concluded that roadheader performance could be accurately predicted as a function of unconfined compressive strength, Brazilian tensile strength, rock quality designation, and alpha angle R ² = 0.987. Sensitivity analysis reveals that the most effective parameter on roadheader performance is the unconfined compressive strength.     

Biclustering meets triadic concept analysis

Biclustering numerical data became a popular data-mining task at the beginning of 2000’s, especially for gene expression data analysis and recommender systems. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So-called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non-redundant enumeration of such patterns, a well-known intractable problem, while no formal framework exists. We introduce important links between biclustering and Formal Concept Analysis (FCA). Indeed, FCA is known to be, among others, a methodology for biclustering binary data. Handling numerical data is not direct, and we argue that Triadic Concept Analysis (TCA), the extension of FCA to ternary relations, provides a powerful mathematical and algorithmic framework for biclustering numerical data. We discuss hence both theoretical and computational aspects on biclustering numerical data with triadic concept analysis. These results also scale to n-dimensional numerical datasets.     

Oil thermal annealed nano‐structured indium tin oxide thin films for display applications

Indium tin oxide‐coated thin films (200 nm) are deposited on glass substrates by using R.f. sputtering technique. Here, we investigate the influence of new technique of treatment, which is called as “oil thermal annealing” on the nano‐structured indium tin oxide thin films at fixed temperature (150 °C) which improves adhesion strength, electrical conductivity and optical properties (transmittance) of the films. Oil thermal annealing is used to reduce inherent defects that may be introduced during the prepared thin film and cooling processes. Proposed technique is highly suitable for liquid crystal displays, solar cells and organic light emitting diodes, and many other display‐related applications.     

Relating Sediment Yield Estimations to the Wet Front Term Using Rainfall Simulator Field Experiments

Water Resources Management - Depth to wet front is generally considered as the amount of water that penetrates into soil and wets the internal soil layer. This is an important variable especially...     

An efficient approach to reliability-based topology optimization for continua under material uncertainty

This contribution presents a computationally efficient method for reliability-based topology optimization for continuum domains under material properties uncertainty. Material Young’s modulus is assumed to be lognormally distributed and correlated within the domain. The computational efficiency is achieved through estimating the response statistics with stochastic perturbation of second order, using these statistics to fit an appropriate distribution that follows the empirical distribution of the response, and employing an efficient gradient-based optimizer. Two widely-studied topology optimization problems are examined and the changes in the optimized topology is discussed for various levels of target reliability and correlation strength. Accuracy of the proposed algorithm is verified using Monte Carlo simulation.     

Sound source localization using compressive sensing-based feature extraction and spatial sparsity

In this paper, we propose a source localization algorithm based on a sparse Fast Fourier Transform (FFT)-based feature extraction method and spatial sparsity. We represent the sound source positions as a sparse vector by discretely segmenting the space with a circular grid. The location vector is related to microphone measurements through a linear equation, which can be estimated at each microphone. For this linear dimensionality reduction, we have utilized a Compressive Sensing (CS) and two-level FFT-based feature extraction method which combines two sets of audio signal features and covers both short-time and long-time properties of the signal. The proposed feature extraction method leads to a sparse representation of audio signals. As a result, a significant reduction in the dimensionality of the signals is achieved. In comparison to the state-of-the-art methods, the proposed method improves the accuracy while the complexity is reduced in some cases.     

Modeling and robust discrete LQ repetitive control of electrically driven robots

Discrete linear quadratic control has been efciently applied to linear systems as an optimal control.However,a robotic system is highly nonlinear,heavily coupled and uncertain.To overcome the problem,the robotic system can be modeled as a linear discrete-time time-varying system in performing repetitive tasks.This modeling motivates us to develop an optimal repetitive control.The contribution of this paper is twofold.For the frst time,it presents discrete linear quadratic repetitive control for electrically driven robots using the mentioned model.The proposed control approach is based on the voltage control strategy.Second,uncertainty is efectively compensated by employing a robust time-delay controller.The uncertainty can include parametric uncertainty,unmodeled dynamics and external disturbances.To highlight its ability in overcoming the uncertainty,the dynamic equation of an articulated robot is introduced and used for the simulation,modeling and control purposes.Stability analysis verifes the proposed control approach and simulation results show its efectiveness.     

A hybrid aggregation and compression technique for road network databases

Vector data and in particular road networks are being queried, hosted and processed in many application domains such as in mobile computing. Many client systems such as PDAs would prefer to receive the query results in unrasterized format without introducing an overhead on overall system performance and result size. While several general vector data compression schemes have been studied by different communities, we propose a novel approach in vector data compression which is easily integrated within a geospatial query processing system. It uses line aggregation to reduce the number of relevant tuples and Huffman compression to achieve a multi-resolution compressed representation of a road network database. Our experiments performed on an end-to-end prototype verify that our approach exhibits fast query processing on both client and server sides as well as high compression ratio.

The solution and duality of imprecise network problems

Duality properties have been investigated by many researchers in the recent literature. They are introduced in this paper for a fully fuzzified version of the minimal cost flow problem, which is a basic model in network flow theory. This model illustrates the least cost of the shipment of a commodity through a capacitated network in terms of the imprecisely known available supplies at certain nodes which should be transmitted to fulfil uncertain demands at other nodes. First, we review on the most valuable results on fuzzy duality concepts to facilitate the discussion of this paper. By applying Hukuhara’s difference, approximated and exact multiplication and Wu’s scalar production, we exhibit the flow in network models. Then, we use combinatorial algorithms on a reduced problem which is derived from fully fuzzified MCFP to acquire fuzzy optimal flows. To give duality theorems, we utilize a total order on fuzzy numbers due to the level of risk and realize optimality conditions for providing some efficient combinatorial algorithms. Finally, we compare our results with the previous worthwhile works to demonstrate the efficiency and power of our scheme and the reasonability of our solutions in actual decision-making problems.