Silver space-time trellis-coded modulation

Silver Code (SilC) was originally discovered in [1–4] for 2×2 multiple-input multiple-output (MIMO) transmission. It has non-vanishing minimum determinant 1/7, slightly lower than Golden code, but is fast-decodable, i.e., it allows reduced-complexity maximum likelihood decoding [5–7]. In this paper, we present a multidimensional trellis-coded modulation scheme for MIMO systems [11] based on set partitioning of the Silver Code, named Silver Space-Time Trellis Coded Modulation (SST-TCM). This lattice set partitioning is designed specifically to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions. Viterbi algorithm is applied for trellis decoding, while the branch metrics are computed by using a sphere-decoding algorithm. It is shown that the proposed SST-TCM performs very closely to the Golden Space-Time Trellis Coded Modulation (GST-TCM) scheme, yetwith a much reduced decoding complexity thanks to its fast-decoding property.

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.

On the set of subrings wich are directed unions of Artinian subrings

The paper contributes to the investigation of zero-dimensional rings which can be written as a directed union of Artinian subrings. We give conditions on DU(R) in order to be nonempty.

Testing of stair climbing point-of-choice prompts in Barcelona at an outdoor set of stairs and scalators on the Montjuïc site

Regular stair climbing has well-documented health dividends, such as increased fitness and strength, weight loss and reduced body fat, improved lipid profiles and reduced risk of osteoporosis. The general absence of barriers to participation makes stair climbing an ideal physical activity (PA) for health promotion. Studies in the US and the UK have consistently shown that interventions to increase the accumulation of lifestyle PA by climbing stairs rather than using the escalators are effective. However, there are no previous in Catalonia. This project tested one message for their ability to prompt travelers on the Montjuïc site to choose the stairs rather than the escalator when climbing up the Monjuïc hill. One standard message, " Take the stairs! 7 minutes of stair climbing a day protects your heart" provided a comparison with previous research done in the UK. Translated into Catalan and Spanish, it was presented on a poster positioned at the point of choice between the stairs and the escalator. The study used a quasi-experimental, interrupted time series design. Travelers, during several and specific hours on two days of the week, were coded for stair or escalator use, gender, age, ethnic status, presence of accompanying children or bags by one observer. Overall, the intervention resulted in a 81% increase in stair climbing. In the follow-up period without messages, stair climbing dropped out to baseline levels. This preliminary study showed a significant effect on stair use. However, caution is needed since results are based on a small sample and, only a low percentage of the sample took the stairs at baseline or the intervention phase . Future research on stair use in Catalonia should focus on using bigger samples, different sites (metro stations, airports, shopping centers, etc) , different messages and techniques to promote stair climbing.

Renormalization and α-limit set for expanding Lorenz maps

We establish a one-to-one correspondence between the renormalizations and proper totally invariant closed sets (i.e., α-limit sets) of expanding Lorenz map, which enable us to distinguish periodic and non-periodic renormalizations. We describe the minimal renormalization by constructing the minimal totally invariant closed set, so that we can define the renormalization operator. Using consecutive renormalizations, we obtain complete topological characteriza- tion of α-limit sets and nonwandering set decomposition. For piecewise linear Lorenz map with slopes ≥ 1, we show that each renormalization is periodic and every proper α-limit set is countable.

A general construction of internal sheaves in algebraic set theory

We present a solution to the problem of defining a counterpart in Algebraic Set Theory of the construction of internal sheaves in Topos Theory. Our approach is general in that we consider sheaves as determined by Lawvere-Tierney coverages, rather than by Grothen-dieck coverages, and assume only a weakening of the axioms for small maps originally introduced by Joyal and Moerdijk, thus subsuming the existing topos-theoretic results.

Avaluació de set materials representatius del programa didàctic aplicat a les Escoles Bressol Municipals de Mataró dins del projecte de formació del professorat 2006/07

ii. Desprès de finalitzar el primer any d’aplicació del projecte “La música a les Escoles Bressol Municipals de Mataró”, s’inicia la present recerca, en la que participen tots els grups que formen part del projecte, amb l’objectiu de valorar-ho i veure’n la continuïtat. Es detecta que els materials emprats en la proposta didàctica són l’element que ha esdevingut més exitós fins al moment. Definint-ne una mostra de set materials, es procedeix a determinar l’ús que les educadores els atorguen en relació a la proposta didàctica i a avaluar-los

Persistent bundles over a two dimensional compact set

"Vegeu el resum a l'inici del document del fitxer adjunt."

Continuity of set-valued maps revisited in the light of tame geometry

Continuity of set-valued maps is hereby revisited: after recalling some basic concepts of variational analysis and a short description of the State-of-the-Art, we obtain as by-product two Sard type results concerning local minima of scalar and vector valued functions. Our main result though, is inscribed in the framework of tame geometry, stating that a closed-valued semialgebraic set-valued map is almost everywhere continuous (in both topological and measure-theoretic sense). The result –depending on stratification techniques– holds true in a more general setting of o-minimal (or tame) set-valued maps. Some applications are briefly discussed at the end.

On Cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Second, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.

EU cohesion aid to Spain: a data set. Part I: 2000-06 planning period

In this paper we construct a data set on EU cohesion aid to Spain during the planning period 2000-06. The data are disaggregated by region, year and function and attempt to approximate the timing of actual executed expenditure on assisted projects.

On the stability of the optimal value and the optimal set in optimization problems

The paper develops a stability theory for the optimal value and the optimal set mapping of optimization problems posed in a Banach space. The problems considered in this paper have an arbitrary number of inequality constraints involving lower semicontinuous (not necessarily convex) functions and one closed abstract constraint set. The considered perturbations lead to problems of the same type as the nominal one (with the same space of variables and the same number of constraints), where the abstract constraint set can also be perturbed. The spaces of functions involved in the problems (objective and constraints) are equipped with the metric of the uniform convergence on the bounded sets, meanwhile in the space of closed sets we consider, coherently, the Attouch-Wets topology. The paper examines, in a unified way, the lower and upper semicontinuity of the optimal value function, and the closedness, lower and upper semicontinuity (in the sense of Berge) of the optimal set mapping. This paper can be seen as a second part of the stability theory presented in [17], where we studied the stability of the feasible set mapping (completed here with the analysis of the Lipschitz-like property).

Generalized descriptive set theory and classification theory

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical, countable case. We also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. Our results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations.