Semantic networks qualify the meaning of an edge relating any two vertices. Determining which vertices are most "central" in a semantic network is difficult because one relationship type may be deemed subjectively more important than another. For this reason, research into semantic network metrics has focused primarily on context-based rankings (i.e. user prescribed contexts). Moreover, many of the current semantic network metrics rank semantic associations (i.e. directed paths between two vertices) and not the vertices themselves. This article presents a framework for calculating semantically meaningful primary eigenvector-based metrics such as eigenvector centrality and PageRank in semantic networks using a modified version of the random walker model of Markov chain analysis. Random walkers, in the context of this article, are constrained by a grammar, where the grammar is a user defined data structure that determines the meaning of the final vertex ranking. The ideas in this article are presented within the context of the Resource Description Framework (RDF) of the Semantic Web initiative.

- In every mathematical model, parameters regulate the behaviour of equations describing temporal and spatial changes of model state variables and their interactions. Generally, there is some uncertainty associated with each parameter. Model calibration is performed by comparing observed with predicted data and it is a crucial phase in the modelling process. It's an iterative and interactive task in which, after each simulation, the "modeller" analyses the results and performs changes on one or more equation's parameters trying to tune the model. This "tuning" procedure is a hard and "tedious" work requiring a good understanding of the effects of different parameters over the available variables. Automatic calibration procedures, based on systematic and exhaustive generation of parameter vectors and using several convergence methods, are available but they require a large number of model runs and are, therefore, not applicable to very complex ecosystem models demanding large computational times.

While statistics focusses on hypothesis testing and on estimating (properties of) the true sampling distribution, in machine learning the performance of learning algorithms on future data is the primary issue. In this paper we bridge the gap with a general principle (PHI) that identifies hypotheses with best predictive performance. This includes predictive point and interval estimation, simple and composite hypothesis testing, (mixture) model selection, and others as special cases. For concrete instantiations we will recover well-known methods, variations thereof, and new ones. PHI nicely justifies, reconciles, and blends (a reparametrization invariant variation of) MAP, ML, MDL, and moment estimation. One particular feature of PHI is that it can genuinely deal with nested hypotheses.

Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This class of optimization problems, known as rank minimization, is NP-HARD, and for most practical problems there are no efficient algorithms that yield exact solutions. A popular heuristic algorithm replaces the rank function with the nuclear norm--equal to the sum of the singular values--of the decision variable. In this paper, we provide a necessary and sufficient condition that quantifies when this heuristic successfully finds the minimum rank solution of a linear constraint set. We additionally provide a probability distribution over instances of the affine rank minimization problem such that instances sampled from this distribution satisfy our conditions for success with overwhelming probability provided the number of constraints is appropriately large. Finally, we give empirical evidence that these probabilistic bounds provide accurate predictions of the heuristic's performance in non-asymptotic scenarios.

The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical work of universities. Here, students have to be assigned to scientific topics which are proposed and supported by members of staff. The problem involves the optimization under given preferences of students which may be expressed when applying for certain topics. It is possible to observe that variable neighborhood search leads to superior results for the tested problem instances. One instance is taken from an actual case, while others have been generated based on the real world data to support the analysis with a deeper analysis. An extension of the problem has been formulated by integrating a second objective function that simultaneously balances the workload of the members of staff while maximizing utility of the students. The algorithmic approach has been prototypically implemented in a computer system. One important aspect in this context is the application of the research work to problems of other scientific institutions, and therefore the provision of decision support functionalities.

In the current paper, we present an optimization system solving multi objective production scheduling problems (MOOPPS). The identification of Pareto optimal alternatives or at least a close approximation of them is possible by a set of implemented metaheuristics. Necessary control parameters can easily be adjusted by the decision maker as the whole software is fully menu driven. This allows the comparison of different metaheuristic algorithms for the considered problem instances. Results are visualized by a graphical user interface showing the distribution of solutions in outcome space as well as their corresponding Gantt chart representation. The identification of a most preferred solution from the set of efficient solutions is supported by a module based on the aspiration interactive method (AIM). The decision maker successively defines aspiration levels until a single solution is chosen. After successfully competing in the finals in Ronneby, Sweden, the MOOPPS software has been awarded the European Academic Software Award 2002 (http://www.bth.se/llab/easa_2002.nsf)

The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Timetabling Competition 2007 (ITC 2007). The heuristic search procedure is based on Threshold Accepting to overcome local optima. A stochastic neighborhood is proposed and implemented, randomly removing and reassigning events from the current solution. The overall concept has been incrementally obtained from a series of experiments, which we describe in each (sub)section of the paper. In result, we successfully derived a potential candidate solution approach for the finals of track 3 of the ITC 2007.

HE term "bin packing" describes a class of well-known, classical problems with numerous applications in logistics, operations research and related disciplines. From single dimensional to multidimensional problems, various types can be identified in practice. Common to all is the overall task of packing a finite number of n items into a minimum number of bins (knapsacks) subject to a set of practical constraints and requirements. These include given capacities of the bins, but also other considerations such as irregularly shaped bins, load balancing of the bins, etc. Numerous approaches including exact, heuristic, and metaheuristic algorithms have been proposed for the resolution of bin packing problems, and a rich literature on packing problems exists, with important classifications by D

The tests have been performed on 50 problem instances generated based on the job characteristics of the practical case in the Sherwood Press, and the results have been averaged. Results Conducting significance tests at a level of 0.99, it has been possible to obser ve that for the single criterion formulation EX leads in 90% of the instances to better results than BSH, which is found to be better than FSH. The results are stable over time, thus the altering of the weights does not lead to significantly different results. The comparison of the neighbourhood search on the bicriteria extension of the problem with the results of the single criterion version reveals an interesting pattern, shown in Figure 1. After approximately 1,000 initial iterations, the single criterion search is able to significantly outperform the bicriteria formulation in more problem instances than vice versa. However, this effect is reversed after the local search approaches have been allowed more evaluations. While the monocriterion hillclimber tends to get stuck in local optima, its bicriterion counterpart successfully overcomes local optimality, leading to significantly better results. As Figure 1 reveals, this effect is each time repeated after changing the weight settings. While the neighbourhood search for the single criterion problem allows comparably fast improvements, its advantage over the multi criterion extension is decreasing over time, and the results are reversed given the necessary amount of iterations.

The article presents a framework for the resolution of rich vehicle routing problems which are difficult to address with standard optimization techniques. We use local search on the basis on variable neighborhood search for the construction of the solutions, but embed the techniques in a flexible framework that allows the consideration of complex side constraints of the problem such as time windows, multiple depots, heterogeneous fleets, and, in particular, multiple optimization criteria. In order to identify a compromise alternative that meets the requirements of the decision maker, an interactive procedure is integrated in the resolution of the problem, allowing the modification of the preference information articulated by the decision maker. The framework is prototypically implemented in a computer system. First results of test runs on multiple depot vehicle routing problems with time windows are reported.