Una iniciativa social en la recuperación textil que genera empleo: Berohi S. Coop.

[ES] El incremento del consumo de ropa provoca que año a año aumente el volumen de ropa desechada, y con éste, la conciencia sobre la necesidad de reutilizar dicho recurso. Berohi S. Coop. es una de las empresas dedicadas a la recuperación y reciclaje del textil usado, con origen en Bizkaia. La concepción inicial y desarrollo del proyecto empresarial Berohi S. Coop. constituyen el eje central del caso.

Facilitated advocacy: supporting farmers to have a voice in policy making and the development of service provision

Listening to people, especially those who are poor, and involving them in policy making and decisions about service delivery processes are logical steps in building better services and improving policies aimed at poverty alleviation. This case describes a facilitated advocacy that helped to negotiate and support a role for poor people who farm and fish, to contribute recommendations for changes in services and policies that impact on their lives. The national Government of India’s Department of Animal Husbandry and Dairying and the Indian Council for Agricultural Research, both in the capital Delhi, have been linking with farmers and fishers and state government officials in the eastern states of Jharkhand, Orissa and West Bengal, in partnership with the STREAM Initiative of the intergovernmental Network of Aquaculture Centers in Asia Pacific and with the support of the UK Government Department for International Development, Natural resources Systems Program supporting farmers to have a voice(13 p.)

Information Preservation (IP) Method in Simulation

This paper reviews firstly methods for treating low speed rarefied gas flows: the linearised Boltzmann equation, the Lattice Boltzmann method (LBM), the Navier-Stokes equation plus slip boundary conditions and the DSMC method, and discusses the difficulties in simulating low speed transitional MEMS flows, especially the internal flows. In particular, the present version of the LBM is shown unfeasible for simulation of MEMS flow in transitional regime. The information preservation (IP) method overcomes the difficulty of the statistical simulation caused by the small information to noise ratio for low speed flows by preserving the average information of the enormous number of molecules a simulated molecule represents. A kind of validation of the method is given in this paper. The specificities of the internal flows in MEMS, i.e. the low speed and the large length to width ratio, result in the problem of elliptic nature of the necessity to regulate the inlet and outlet boundary conditions that influence each other. Through the example of the IP calculation of the microchannel (thousands long) flow it is shown that the adoption of the conservative scheme of the mass conservation equation and the super relaxation method resolves this problem successfully. With employment of the same measures the IP method solves the thin film air bearing problem in transitional regime for authentic hard disc write/read head length ( ) and provides pressure distribution in full agreement with the generalized Reynolds equation, while before this the DSMC check of the validity of the Reynolds equation was done only for short ( ) drive head. The author suggests degenerate the Reynolds equation to solve the microchannel flow problem in transitional regime, thus provides a means with merit of strict kinetic theory for testing various methods intending to treat the internal MEMS flows.

Information preservation (IP) method in simulation of internal rarefied gas flows in MEMS

This paper reviews firstly methods for treating low speed rarefied gas flows: the linearised Boltzmann equation, the Lattice Boltzmann method (LBM), the Navier-Stokes equation plus slip boundary conditions and the DSMC method, and discusses the difficulties in simulating low speed transitional MEMS flows, especially the internal flows. In particular, the present version of the LBM is shown unfeasible for simulation of MEMS flow in transitional regime. The information preservation (IP) method overcomes the difficulty of the statistical simulation caused by the small information to noise ratio for low speed flows by preserving the average information of the enormous number of molecules a simulated molecule represents. A kind of validation of the method is given in this paper. The specificities of the internal flows in MEMS, i.e. the low speed and the large length to width ratio, result in the problem of elliptic nature of the necessity to regulate the inlet and outlet boundary conditions that influence each other. Through the example of the IP calculation of the microchannel (thousands m ? long) flow it is shown that the adoption of the conservative scheme of the mass conservation equation and the super relaxation method resolves this problem successfully. With employment of the same measures the IP method solves the thin film air bearing problem in transitional regime for authentic hard disc write/read head length ( 1000 L m ? = ) and provides pressure distribution in full agreement with the generalized Reynolds equation, while before this the DSMC check of the validity of the Reynolds equation was done only for short ( 5 L m ? = ) drive head. The author suggests degenerate the Reynolds equation to solve the microchannel flow problem in transitional regime, thus provides a means with merit of strict kinetic theory for testing various methods intending to treat the internal MEMS flows.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Ahozkotasunaren irakaskuntza bigarren hezkuntzako testuliburuetan

[EN]Traditionally writing skills have been given priority in language teaching and so, oral skills have been put aside. However, during the last years many voices have asserted the importance of oral skills. Therefore, they claim that oral language teaching must be emphasized at school. Also, the necessity of strengthening oral language is shown in the new curriculum. Nevertheless, those intentions are reflected in very different ways in textbooks. In this work we have looked into the treatment that oral language is given in teaching materials because, in our opinion, textbooks are one of the most important tools for teachers. The facts show that the importance given to oral language and the exercises and tools needed to work that skill are very different from one publishing house to another. Besides, we have confirmed that all the textbooks don’t satisfy the requirements proposed in the Basque official curriculum (e.g. didactic sequences) or that the approach to the text or the way to work with it are not always what they should be. Therefore, it is obvious that we have still a long way in the field of oral language and specially in the way of teaching oral skills

Designing marine fishery reserves using passive acoustic telemetry

Marine Fishery Reserves (MFRs) are being adopted, in part, as a strategy to replenish depleted fish stocks and serve as a source for recruits to adjacent fisheries. By necessity, their design must consider the biological parameters of the species under consideration to ensure that the spawning stock is conserved while simultaneously providing propagules for dispersal. We describe how acoustic telemetry can be employed to design effective MFRs by elucidating important life-history parameters of the species under consideration, including home range, and ecological preferences, including habitat utilization. We then designed a reserve based on these parameters using data from two acoustic telemetry studies that examined two closely-linked subpopulations of queen conch (Strombus gigas) at Conch Reef in the Florida Keys. The union of the home ranges of the individual conch (aggregation home range: AgHR) within each subpopulation was used to construct a shape delineating the area within which a conch would be located with a high probability. Together with habitat utilization information acquired during both the spawning and non-spawning seasons, as well as landscape features (i.e., corridors), we designed a 66.5 ha MFR to conserve the conch population. Consideration was also given for further expansion of the population into suitable habitats.

Breeding programs on Atlantic salmon in Norway: lessons learned

An early establishment of selective breeding programs on Atlantic salmon has been crucial for the success of developing efficient and sustainable salmon farming in Norway. A national selective breeding program was initiated by AKVAFORSK at the beginning of the 1970s, by collecting fertilized eggs from more than 40 Norwegian river populations. Several private selective breeding programs were also initiated in the 1970s and 1980s. While these private programs were initiated using individual selection (i.e. massselection) to genetically improve growth, the national program was designed to gradually include all economically important traits in the breeding objective (i.e. growth, age at sexual maturation, disease resistance and quality traits) using a combined family and within-family selection strategy. Independent of which selection strategy and program design used, it is important to secure and maintain a broad genetic variation in the breeding populations to maximize selection response. It has been documented that genetically improved salmon from the national selective breeding program grow twice as fast as wild Atlantic salmon and require 25 per cent less feed, while salmon representing the private breeding programs all show an intermediate growth performance. As a result of efficient dissemination of genetically improved Atlantic salmon, the Norwegian salmon farming industry has reduced its feed costs by more than US$ 230 million per year! The national selective breeding program on Atlantic salmon was commercialized into a breeding company (AquaGen) in 1992. Five years later, several private companies and the AKVAFORSK Genetics Center (AFGC) established a second breeding company (SalmoBreed) using breeding candidates from one of the private breeding programs. These two breeding companies have similar products, but different strategies on how to organize the breeding program and to disseminate the genetically improved seed to the Norwegian salmon industry. Greater competition has increased the necessity to document the genetic gain obtained from the different programs and to market the economic benefits of farming the genetically improved breeds. Both breeding companies have organized their dissemination to get a sufficient share of the economic benefits in order to sustain and improve their breeding programs.

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

On the impact of independence of irrelevant alternatives: the case of two-person NTU games

On several classes of n-person NTU games that have at least one Shapley NTU value, Aumann characterized this solution by six axioms: Non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives (IIA). Each of the first five axioms is logically independent of the remaining axioms, and the logical independence of IIA is an open problem. We show that for n = 2 the first five axioms already characterize the Shapley NTU value, provided that the class of games is not further restricted. Moreover, we present an example of a solution that satisfies the first five axioms and violates IIA for two-person NTU games (N, V) with uniformly p-smooth V(N).

Multi-agent modelling for the simulation of a simple smart microgrid

The smart grid is a highly complex system that is being formed from the traditional power grid, adding new and sophisticated communication and control devices. This will enable integrating new elements for distributed power generation and also achieving an increasingly automated operation so for actions of the utilities as for customers. In order to model such systems a bottom-up method is followed, using only a few basic elements which are structured into two layers: a physical layer for the electrical power transmission, and one logical layer for element communication. A simple case study is presented to analyse the possibilities of simulation. It shows a microgrid model with dynamic load management and an integrated approach that can process both electrical and communication flows.

Modeling smart grids as complex systems through the implementation of intelligent hubs

ICINCO 2010

Austauschprozesse zwischen den Dorschbeständen der westlichen und östlichen Ostsee

Quantitative proofs for the occurrence of juvenile cods in the Bornholm Sea, which had been spawned in Kiel Bay or Mecklenburg Bay, were the staring point to develop a method, which makes quantitative estimates possible. From these analyses it could be estimated that 20 to 50 % of the cods in the area of the eastern Baltic stock had been spawned in the western Baltic Sea. This expansion in eastern direction was determined partly by passive transport of pelagic cod stages. The main factor was an active migration of cod in the first year of their life. These analyses suggest the necessity to reassess the actual model of the relations between the Baltic cod stocks.

Desarrollo de servicios para vigilancia tecnológica

[EN]If a frog is placed in boiling water, it will jump out; but if it is placed in cold water that is slowly heated, it will not perceive the danger and will be cooked to death. Without de ability to observe changing environmental conditions, the frog can find itself boiled alive before realizing it is in trouble. This is known as the boiling frog syndrome. In the same manner, it is impossible to be competitive without knowing and being aware of the environmental changes. From here comes the necessity for the Technological Watch and Competitive Intelligence. The main goals of this project are to evaluate the current Technological Vigilance System of the IK4-Tekniker research center and to develop services that help in improving the system. For that purpose, first of all the Technological Vigilance is going to be placed in the business field and its origins are going to be explained. Following that, the Technological Vigilance system of IK4-Tekniker is going to be analyzed for its evaluation. Finally the creation of the services previously mentioned are going to be described in detail, showing the technologies and tools used for that purpose like the Responsive Web Design.

Procedimiento de refutación para un conjunto de restricciones sobre documentos XML

We present a prototype that implements a set of logical rules to prove the satis ability for a class of speci cations on XML documents. Speci cations are given by means of constraints built on Boolean XPath patterns. The main goal of this tool is to test if a given speci cation is satis able or not, showing the history of the execution. It can also be used to test if a given document is a model of a given speci cation and, as a subproduct, it allows to look for all the relations (monomorphisms) between two patterns or the result of doing some operations by combining patterns in di erent ways. The results of these operations are visually shown and therefore the tool makes these operations more understandable. The implementation of the algorithm has been written in Prolog but the prototype has a Java interface for an easy and friendly use.