The decoupling of clients of abstractions from the implementations of those abstractions is a key benefit of objectoriented programming. However, many object-oriented languages provide instance variables in such a way that implementation-level representation decisions seep through interfaces, introducing coupling between clients and abstractions. As part of the Cecil language, we have developed...

In this paper it’s investigated the impact of the Tabu List size, neighborhood generation approach and the managing of the decision variables of the Objective Function in the quality of a Tabu Search solution to the Scheduling Problem applied to a Flexible Manufacturing System. It was used a Part Scheduling Model, which starts with qualitatively different initial solutions that yields experimen...

The present paper investigates monitoring of fatigue cracks of a metal structure using an eddy current micro sensor. Fatigue cracks tend to occur at bolt-jointed structures on an aircraft. In order to detect the damage quantitatively, a kind of change-prone micro eddy current sensor is designed and fabricated with flexible printed circuit board (FPCB) technology. A forward semi-analytical model...

Zhigang Wu 1,2,*, Yongan Huang 1,2 and Rong Chen 1,2 1 State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074, China; [email protected] (Y.H.); [email protected] (R.C.) 2 Flexible Electronics Research Center, Huazhong University of Science and Technology, Wuhan 430074, China * Correspondence: [email protected]...

This study’s overarching aim is to establish the areal extent and characteristics of the rapid sugarcane expansion and land use change in São Paulo state (Brazil) as a result of an increase in the demand for ethanol, using Landsat type remotely sensed data. In 2003 flex fuel automobiles started to enter the Brazilian consumer market causing a dramatic expansion of sugarcane areas from 2.57 mill...

The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowl-ege operator. As the full common knowledge predicate logics are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with at...

Let z = (z1, z2, · · · , zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be a unital commutative ring of any characteristic and Ft(z) = z−Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉 ×n and o(Ht(z)) ≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F (z) := z−Ht=1(z) when it makes sense. The inverse map Gt(z) of Ft(z) can always be written as Gt(...

In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one fre...

Affine λ-terms are λ-terms in which each bound variable occurs at most once and linear λ-terms are λ-terms in which each bound variable occurs once. and only once. In this paper we count the number of closed affine λ-terms of size n, closed linear λ-terms of size n, affine β-normal forms of size n and linear β-normal forms of size n, for different ways of measuring the size of λ-terms. From the...