Modelling of residual stresses in the shot peened material C-1020 by artificial neural network

This study consists of two cases: (i) The experimental analysis: Shot peening is a method to improve the resistance of metal pieces to fatigue by creating regions of residual stress. In this study, the residual stresses induced in steel specimen type C-1020 by applying various strengths of shot peening, are investigated using the electrochemical layer removal method. The best result is obtained using 0.26 mm A peening strength and the stress encountered in the shot peened material is ?276 MPa, while the maximum residual stress obtained is ?363 MPa at a peening strength of 0.43 mm A. (ii) The mathematical modelling analysis: The use of ANN has been proposed to determine the residual stresses based on various strengths of shot peening using results of experimental analysis. The back-propagation learning algorithm with two different variants and logistic sigmoid transfer function were used in the network. In order to train the neural network, limited experimental measurements were used as training and test data. The best fitting training data set was obtained with four neurons in the hidden layer, which made it possible to predict residual stress with accuracy at least as good as that of the experimental error, over the whole experimental range. After training, it was found the R² values are 0.996112 and 0.99896 for annealed before peening and shot peened only, respectively. Similarly, these values for testing data are 0.995858 and 0.999143, respectively. As seen from the results of mathematical modelling, the calculated residual stresses are obviously within acceptable uncertainties.     

A survey on search results diversification techniques

The quantity of information placed on the web has been greater than before and is increasing rapidly day by day. Searching through the huge amount of data and finding the most relevant and useful result set involves searching, ranking, and presenting the results. Most of the users probe into the top few results and neglect the rest. In order to increase user’s satisfaction, the presented result set should not only be relevant to the search topic, but should also present a variety of perspectives, that is, the results should be different from one another. The effectiveness of web search and the satisfaction of users can be enhanced through providing various results of a search query in a certain order of relevance and concern. The technique used to avoid presenting similar, though relevant, results to the user is known as a diversification of search results. This article presents a survey of the approaches used for search result diversification. To this end, this article not only provides a technical survey of existing diversification techniques, but also presents a taxonomy of diversification algorithms with respect to the types of search queries.     

Wire antennas optimized using genetic algorithm

In this work, wire antennas are designed to jam GSM frequencies using genetic algorithms. These antennas are designed to block communication at 3-band GSM frequencies. They are planned to be mounted on a vehicle and therefore are modeled on a ground plane. Jammer antennas designed in this work are composed of wires, placed on two square dielectric frames, perpendicular to each other. Genetic optimization routines are developed on MATLAB environment for the designs carried out in this work. Electromagnetic simulation program called SuperNEC, which analyses antennas by the method of moments, is used to determine the antenna performances and is called by the developed GA routines. The purpose of the antenna optimization is to obtain low VSWR values and omni-directional radiation pattern near ground at θ = [70° 80° 90°] planes at all GSM frequencies, since the targets will be near ground for this application. Original and interesting antenna designs are obtained as the result of genetic optimization, and are presented in the paper.     

A novel distributed scheduling scheme for OFDMA uplink using channel information and probabilistic transmission

Distributed uplink scheduling in OFDMA systems is considered. In the proposed model, mobile terminals have the responsibility of making their own transmission decisions. The proposed scheme is based on two dimensional reservation in time and frequency. Terminals use channel state information in order to favor transmissions over certain subchannels, and transmission is done in a probabilistic manner. The proposed approach provides more autonomy to mobile devices in making transmission decisions. Furthermore, it allows avoiding collisions during transmission since it leads to collision detection during the resource reservation phase. The proposed approach is compared to other random access methods and shown to be superior in terms of increasing sum-rate, reducing the number of users in outage, and reducing the collision probability in the reservation phase.     

Minimal model generation for refined answering of generalized queries in disjunctive deductive databases

Generalized queries are defined as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized queries under the minimal model semantics for the class of disjunctive deductive databases (DDDBs). The advanced approach is based on having the query induce an order on the models returned by a sound and complete minimal model generating procedure. We consider answers that are true in all and those that are true in some minimal models of the theory. We address the issue of answering positive queries through the construction of the minimal model state of the DDDB, using a minimal model generating procedure. The refinements allowed by the procedure include isolating a minimal component of a disjunctive answer, the specification of possible updates to the theory to enable the derivability of certain queries and deciding the monotonicity properties of answers to different classes of queries.     

On-line tuning strategy for model predictive controllers

This paper presents an intuitive on-line tuning strategy for linear model predictive control (MPC) algorithms. The tuning strategy is based on the linear approximation between the closed-loop predicted output and the MPC tuning parameters. By direct utilization of the sensitivity expressions for the closed-loop response with respect to the MPC tuning parameters, new values of the tuning parameters can be found to steer the MPC feedback response inside predefined time-domain performance specifications. Hence, the algorithm is cast as a simple constrained least squares optimization problem which has a straightforward solution. The simplicity of this strategy makes it more practical for on-line implementation. Effectiveness of the proposed strategy is tested on two simulated examples. One is a linear model for a three-product distillation column and the second is a non-linear model for a CSTR. The effectiveness of the proposed tuning method is compared to an exiting offline tuning method and showed superior performance.     

Evaluation of an adaptive and intelligent educational hypermedia for enhanced individual learning of mathematics: A qualitative study

The purpose of this study is to design a personalized adaptive and intelligent web based tutoring system based on learning style and expert system named UZWEBMAT and to evaluate its effects on 10th grade students’ learning of the unit of probability. In the study, initially, learning objects were prepared in three different ways in relation to three sub-learning areas of Visual–Auditory–Kinesthetic (VAK) learning style for each subject of the probability unit. These were appropriate for secondary school mathematics curricula. Then, they were transferred into the digital environment. Each student’s dominant learning style determines the content to which s/he will be directed since s/he is directed to the content that is appropriate for his/her learning style. The course to be followed by the students within UZWEBMAT and their browsing around the pages are decided by expert system integrated into the system. This expert system sets the situations in which s/he will get solution supports and the course s/he will follow in accordance with the performance of the student. Hereby, each student may follow a different course, and the solution supports s/he will get may also differ highlighting the individual learning. The sample of the study consists of 81 10th grade students and 3 mathematics teachers from two high schools in Trabzon, Turkey. Qualitative data were obtained both from the teachers and students participating in the study in order to answer the research questions about the implementation and evaluation of UZWEBMAT for mathematics teaching in a high school classroom. Obtained data were analyzed using qualitative data analysis methods. According to the results of the present study, positive opinions of students and teachers such as taking into account the individual learning differences and deriving mathematical relations and formulas through exploration became prominent. In addition, there were also other positive opinions of students and teachers such as providing permanent learning and introducing learning responsibility to the students. In this sense, it was concluded that UZWEBMAT is a beneficial instrument for both students and teachers.     

SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy

SATCHMORE was introduced as a mechanism to integrate relevancy testing with the model-generation theorem prover SATCHMO. This made it possible to avoid invoking some clauses that appear in no refutation, which was a major drawback of the SATCHMO approach. SATCHMORE relevancy, however, is driven by the entire set of negative clauses and no distinction is accorded to the query negation. Under unfavorable circumstances, such as in the presence of large amounts of negative data, this can reduce the efficiency of SATCHMORE. In this paper we introduce a further refinement of SATCHMO called SATCHMOREBID: SATCHMORE with BIDirectional relevancy. SATCHMOREBID uses only the negation of the query for relevancy determination at the start. Other negative clauses are introduced on demand and only if a refutation is not possible using the current set of negative clauses. The search for the relevant negative clauses is performed in a forward chaining mode as opposed to relevancy propagation in SATCHMORE which is based on backward chaining. SATCHMOREBID is shown to be refutationally sound and complete. Experiments on a prototype SATCHMOREBID implementation point to its potential to enhance the efficiency of the query answering process in disjunctive databases. Donald Loveland, Ph.D.: He is Emeritus Professor of Computer Science at Duke University. He received his Ph.D. in mathematics from New York University and taught at NYU and CMU prior to joining Duke in 1973. His research in automated deduction includes defining the model elimination proof procedure and the notion of linear resolution. He is author of one book and editor/co-editor of two other books on automated theorem proving. He has done research in the areas of algorithms, complexity, expert systems and logic programming. He is an AAAI Fellow, ACM Fellow and winner of the Herbrand Award in Automated Reasoning. Adnan H. Yahya, Ph.D.: He is an associate professor at the Department of Electrical Engineering, Birzeit University, Palestine. He received his Diploma and PhD degrees from St. Petersburg Electrotechnical University and Nothwestern University in 1979 and 1984 respectively. His research interests are in Artificial Intelligence in general and in the areas of Deductive Databases, Logic Programming and Nonmonotonic Reasoning in particular. He had several visiting appointments at universities and research labs in the US, Germany, France and the UK. Adnan Yahya is a member of the ACM, IEEE and IEEE Computer Society.     

Closed-form solution for reliability of SCI-based multiprocessor systems using Weibull distribution and self-healing rings

This paper introduces a new closed-form solution for the reliability of large-scale multiprocessor systems. The systems are based on SCI rings interconnected in hierarchical structures. Reliability expressions using enumeration technique are derived assuming Weibull failure process. The reliability function derived in this paper is general and valid for any hierarchical ring-based system with arbitrary number of levels. The hierarchical interconnections are constructed from self-healing rings and basic rings. The analysis shows the improvement achieved in reliability when self-healing rings are used. Although we used hierarchical systems based on SCI rings, the technique followed in this work is applied for any type of rings such as slotted or token rings.     

An optimization model for guiding the petrochemical industry development in Saudi Arabia

A mixed integer linear programming model is formulated for determining the optimum plan for the expansion of the Saudi Arabian petrochemical industry. The products selected for consideration fall into four categories: propylene derivatives, ethylene derivatives, synthesis gas derivatives, and aromatic derivatives. The model incorporates new variables and constraints, and realistic estimates of production costs, which are calculated based on local conditions in Saudi Arabia. For each production process, the unit production cost is assumed to be a function of production capacity. The input data for each product includes relevant production technologies, capacities, local production costs, and selling price. The solution of the model gives the recommended products under different scenarios of available capital investment and feedstock. The results are reported and analyzed.