In the entire world, there is a widespread recognition that evaluation framework is a key to building stronger and fairer academic institution system. All countries emphasize the evaluation not as end in itself but instead an important tool for achieving improved student outcomes. Teacher evaluation typically has two major purposes. First, it seeks to improve the teacher’s own practice by ident...

We consider some inverse min-max (or max-min) network problems. Such an inverse problem is to modify the weights with bound constraints so that a given feasible solution becomes an optimal solution of a min-max (or max-min) network problem, and the deviation of the weights, measured by the weighted l1 norm or weighted l∞ norm, is minimum. In this paper, we present strongly polynomial time algor...

This paper describes the participation of MIRACLE research consortium at the ImageCLEF Photographic Retrieval task of ImageCLEF 2007. For this campaign, the main purpose of our experiments was to thoroughly study different merging strategies, i.e. methods of combination of textual and visual retrieval techniques. While we have applied all the well known techniques which we had already used in p...

We present SmartJavaMod, a language of mixin modules supporting compositional compilation, and constructed on top of the Java language. More in detail, this means that basic modules are collections of Java classes which can be typechecked in isolation, inferring constraints on missing classes and allowing safe reuse of the module in as many contexts as possible. Furthermore, it is possible to w...

Structured surfaces are used to reduce reflection and enhance light-trapping in silicon solar cells. In this simulation study, we investigated the relationship between refractive index of front-side coupling structures on top planar wafer-based crystalline cells performance structures. A crossed diffraction grating with a period 1 μm random pyramid varying indices were considered. Simulations c...

We consider the max-size popular matching problem in a roommates instance G = (V,E) with strict preference lists. A matching M is popular if there is no matching M ′ in G such that the vertices that prefer M ′ to M outnumber those that prefer M to M ′. We show it is NP-hard to compute a max-size popular matching in G. This is in contrast to the tractability of this problem in bipartite graphs w...