Optimization of forging processes using Finite Element simulations

During the last decades, simulation software based on the Finite Element Method (FEM) has significantly contributed to the design of feasible forming processes. Coupling FEM to mathematical optimization algorithms offers a promising opportunity to design optimal metal forming processes rather than just feasible ones. In this paper Sequential Approximate Optimization (SAO) for optimizing forging processes is discussed. The algorithm incorporates time-consuming nonlinear FEM simulations. Three variants of the SAO algorithm—which differ by their sequential improvement strategies—have been investigated and compared to other optimization algorithms by application to two forging processes. The other algorithms taken into account are two iterative algorithms (BFGS and SCPIP) and a Metamodel Assisted Evolutionary Strategy (MAES). It is essential for sequential approximate optimization algorithms to implement an improvement strategy that uses as much information obtained during previous iterations as possible. If such a sequential improvement strategy is used, SAO provides a very efficient algorithm to optimize forging processes using time-consuming FEM simulations.     

Group decision making problems in a linguistic and dynamic context

The aim of this paper is to present a new model of decision support system for group decision making problems based on a linguistic approach and dynamic sets of alternatives. The model incorporates a mechanism that allows to manage dynamic decision situations in which some information about the problem is not constant in time. We assume that the set of alternatives can change during the decision making process. The model is presented in a mobile and dynamic context where the experts’ preferences can be incomplete. The linguistic approach is used to represent both the experts’ preferences about the alternatives and the agreement degrees to manage the change of some alternatives. A prototype of such mobile decision support system in which the experts use mobile devices to provide their linguistic preferences at anytime and anywhere has been implemented. In such a way, we provide a new linguistic group decision making framework that is mobile and dynamic.     

APROMORE: An advanced process model repository

Business process models are becoming available in large numbers due to their widespread use in many industrial applications such as enterprise and quality engineering projects. On the one hand, this raises a challenge as to their proper management: how can it be ensured that the proper process model is always available to the interested stakeholder? On the other hand, the richness of a large set of process models also offers opportunities, for example with respect to the re-use of existing model parts for new models. This paper describes the functionality and architecture of an advanced process model repository, named APROMORE. This tool brings together a rich set of features for the analysis, management and usage of large sets of process models, drawing from state-of-the art research in the field of process modeling. A prototype of the platform is presented in this paper, demonstrating its feasibility, as well as an outlook on the further development of APROMORE.     

A proposal for student modeling based on ontologies and diagnosis rules

The advances in the educational field and the high complexity of student modeling have provoked it to be one of the aspects more investigated in Intelligent Tutoring Systems (ITSs). The Student Models (SMs) should not only represent the student’s knowledge, but rather they should reflect, as faithfully as possible, the student’s reasoning process. To facilitate this goal, in this article a new approach to student modeling is proposed that benefits from the advantages of Ontological Engineering, advancing in the pursue of a more granular and complete knowledge representation. It’s focused, mainly, on the SM cognitive diagnosis process, and we present a method providing a rich diagnosis about the student’s knowledge state – especially, about the state of learning objectives reached or not. The main goal is to achieve SMs with a good adaptability to the student’s features and a high flexibility for its integration in varied ITSs.     

An interactive whiteboard student survey: Development,validity and reliability

The interactive whiteboard (IWB) has become a popular technology for instructors over the last decade. Though research asserts that the IWBs facilitate learning in different ways, there is a lack of studies examining actual IWB use in classroom settings based on learners’ perspectives by means of valid instruments. The purpose of this study is to develop a valid and reliable interactive whiteboard student survey in order to evaluate the IWB use based on perceptions of students who have been taught with IWBs. In establishing the theoretical base of the survey, the Technology Acceptance Model (TAM) and constructivist learning theories were considered. In addition, with respect to IWB use in classrooms, a number of studies emanated from countries such as the UK, the USA, and Australia were examined, and similar research questionnaires and findings and also reflections of students about IWBs were utilized to create an item pool. A 39-item survey was conducted among middle school students (N = 263) from the city of Istanbul in Turkey. Collected data was exposed to exploratory factor analysis and resulted in a 26-item, three-factor survey, whose factors were named as the perceived efficiency of IWB, perceived learning contribution and motivation, and the perceived negative effects of IWB. The results of the analyses illustrated that this new IWB student scale, which explains 50% of the total variance with a good level of Cronbach’s Alpha coefficient (0.93) is a valid and reliable instrument designed specifically for measuring the use of IWBs in real classroom settings. Besides, theoretical foundations of interactive whiteboard use, the development process of the instrument, and results of validity and reliability analyses were discussed in detail.     

Size-reduction heuristics for the unrelated parallel machines scheduling problem

In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job differs from machine to machine. We deal with the objective of the minimisation of the maximum completion time of the jobs, usually referred to as makespan or C_max. This is a type of assignment problem that has been frequently studied in the scientific literature due to its many potential applications. We propose a set of metaheuristics based on a size-reduction of the original assignment problem that produce solutions of very good quality in a short amount of time. The underlying idea is to consider only a few of the best possible machine assignments for the jobs and not all of them. The results are simple, yet powerful methods. We test the proposed algorithms with a large benchmark of instances and compare them with current state-of-the-art methods. In most cases, the proposed size-reduction algorithms produce results that are statistically proven to be better by a significant margin.     

A simulation-based scheduling system for real-time optimization and decision making support

This paper presents an industrial application of simulation-based optimization (SBO) in the scheduling and real-time rescheduling of a complex machining line in an automotive manufacturer in Sweden. Apart from generating schedules that are robust and adaptive, the scheduler must be able to carry out rescheduling in real time in order to cope with the system uncertainty effectively. A real-time scheduling system is therefore needed to support not only the work of the production planner but also the operators on the shop floor by re-generating feasible schedules when required. This paper describes such a real-time scheduling system, which is in essence a SBO system integrated with the shop floor database system. The scheduling system, called OPTIMISE scheduling system (OSS), uses real-time data from the production line and sends back expert suggestions directly to the operators through Personal Digital Assistants (PDAs). The user interface helps in generating new schedules and enables the users to easily monitor the production progress through visualization of production status and allows them to forecast and display target performance measures. Initial results from this industrial application have shown that such a novel scheduling system can help both in improving the line throughput efficiently and simultaneously supporting real-time decision making.     

Guaranteed and Fully Robust a posteriori Error Estimates for Conforming Discretizations of Diffusion Problems with Discontinuous Coefficients

We study in this paper a posteriori error estimates for H ¹-conforming numerical approximations of diffusion problems with a diffusion coefficient piecewise constant on the mesh cells but arbitrarily discontinuous across the interfaces between the cells. Our estimates give a global upper bound on the error measured either as the energy norm of the difference between the exact and approximate solutions, or as a dual norm of the residual. They are guaranteed, meaning that they feature no undetermined constants. (Local) lower bounds for the error are also derived. Herein, only generic constants independent of the diffusion coefficient appear, whence our estimates are fully robust with respect to the jumps in the diffusion coefficient. In particular, no condition on the diffusion coefficient like its monotonous increasing along paths around mesh vertices is imposed, whence the present results also include the cases with singular solutions. For the energy error setting, the key requirement turns out to be that the diffusion coefficient is piecewise constant on dual cells associated with the vertices of an original simplicial mesh and that harmonic averaging is used in the scheme. This is the usual case, e.g., for the cell-centered finite volume method, included in our analysis as well as the vertex-centered finite volume, finite difference, and continuous piecewise affine finite element ones. For the dual norm setting, no such a requirement is necessary. Our estimates are based on H(div)-conforming flux reconstruction obtained thanks to the local conservativity of all the studied methods on the dual grids, which we recall in the paper; mutual relations between the different methods are also recalled. Numerical experiments are presented in confirmation of the guaranteed upper bound, full robustness, and excellent efficiency of the derived estimators.     

Edge Detection by Adaptive Splitting

In this paper we propose an algorithm (EDAS-d) to approximate the jump discontinuity set of functions defined on subsets of ℝ ^d . We have limited our study to the 1D (EDAS-1) and 2D (EDAS-2) versions of the algorithm. Theoretical and computational results prove its effectiveness in the case of piecewise continuous 1D functions and piecewise constant 2D functions. The algorithm is based on adaptive splitting of the domain of the function guided by the value of an average integral. EDAS-d exhibits a number of attractive features: accurate determination of the jump points, fast processing, absence of oscillatory behavior, precise determination of the magnitude of the jumps, and ability to differentiate between real jumps (discontinuities) and steep gradients. Moreover, low-dimensional versions of EDAS-d can be used for solving higher dimensional problems. Computational experiments also show that EDAS-d can be applied to solve some problems involving general piecewise continuous functions. EDAS-1 and EDAS-2 have been used to determine edges in 2D-images. The results are quite satisfactory for practical purposes.