Schema matchers are used to find related entities in schemas. Automated schema matchers are not infallible, consequently they need to improve on accuracy. Since the accuracy of schema matchers is scenario-dependent, our objective was to define universal methods with which the pre-run optimization of schema matchers for a given scenario is feasible. In this paper, we present our enhanced schema matcher optimization framework which allows the automated, scenario-based optimization of schema matchers. The output of this framework is the recombined schema matcher, which attained 33% average f-measure improvement over the input schema matchers. As part of the framework, we also devised a systematic comparison method for schema matcher components, the Comparative Component Analysis. We propose several performance evaluation bases for the ranking of schema matcher components.

The aim of the following article is to create system for automatic deployment of an operating system, which enables to deploy operating system from the network with priority of throughput and data transfer efficiency. There are lots of software solutions but majority of them use multicast for data transfer efficiency which is, very often, disabled in many network topologies. This led us to the intention of design which will applies peer-to-peer communication. Proposed system architecture utilizes peer-to-peer communication between nodes that leads to increasing throughput while deploying multiple systems OS, even through cloud services.

The following article deals with static analysis of source code in Java and it is intended for readers interested in techniques focused on evaluation of programming abilities of students or potential job candidates. The main objective of the static analysis is to collect the most relevant and significant data about programmers. If such data is properly visualized, it can result in knowledge profile which further determines programmer’s real programming abilities as well as his habits. This can be useful mainly for impartial observer who does not know the code author. In the following article we present our first attempts to create and visualize knowledge profiles through static analysis and statistics regarding frequency of language elements. In perspective, the conclusion combines advanced techniques towards creation of more precise profiles as the future work.

In this paper we report an experiment conducted to measure and compare the resources consumed by a program during execution, and then we discuss the results obtained when compiled without any optimization and compiled with different levels of optimization, in order to understand the relationship between a program’s energy consumption and its optimization level. Namely, we will analyze the optimizations performed by the GNU Compiler Collection (GCC) on C, C++, Objective-C and GO programs. Java was also considered, but thereafter abandoned. In the paper we describe the experimental setup and the method followed in the study carried on to get a deeper knowledge about the factors that actually impact on the energy consumption of a given program. With the study described, the main lesson extracted is that the optimizations that generate a faster code are the more convenient in terms of green computing because they also decreases the energy consumed. The work report was developed in the context of a research project aimed at studying patterns for energy consumption at runtime in order to transform the original software into executable programs that consume less energy; in this context we are specially interested to look for ways to get this improvement at the code generation phase.

Meshless methods have attracted considerable interest to the flexibility of adding or removing nodes in the domain of study without any need to remeshing with elements. In this paper the meshless local Petrov Galerkin (MLPG) method is applied to electromagnetic field with a moving structure. The method is an effective truly meshless method for solving PDEs. Formulations are based on a local weak form using the moving least square (MLS) for interpolation schemes. This paper focuses on the application of this method to electromagnetic linear actuators which are finding increasing use in various fields. The device presents an axisymmetric structure with a moving part displaced longitudinally with a constant step. The global magnetic force was calculated using the meshless magnetic potential solutions. Numerical results were compared to the FEM ones considering the structure both in pause and movement cases.

The purpose of this study is to present various wind turbine control systems for different objectives according the wind speed as maximum wind power tracking, constant speed operation and constant power generation, which we present a news algorithm in the case of constant speed operation, the operating area at a constant speed is a intermediate control allow a smooth transition between the two other control. The modeling of wind turbine is presented .Then two different control systems are detailed and evaluated using Matlab/ Simulink softwares.