Substitution of crude cell wall for neutral detergent fibre in the equations of the Cornell Net Carbohydrate and Protein System that predict carbohydrate fractions: application to sunflower (Helianthus annulus L.)

Prediction of carbohydrate fractions using equations from the Cornell Net Carbohydrate and Protein System (CNCPS) is a valuable tool to assess the nutritional value of forages. In this paper these carbohydrate fractions were predicted using data from three sunflower (Helianthus annuus L.) cultivars, fresh or as silage. The CNCPS equations for fractions B(2) and C include measurement of ash and protein-free neutral detergent fibre (NDF) as one of their components. However, NDF lacks pectin and other non-starch polysaccharides that are found in the cell wall (CW) matrix, so this work compared the use of a crude CW preparation instead of NDF in the CNCPS equations. There were no differences in the estimates of fractions B, and C when CW replaced NDF; however there were differences in fractions A and B2. Some of the CNCPS equations could be simplified when using CW instead of NDF Notably, lignin could be expressed as a proportion of DM, rather than on the basis of ash and protein-free NDF, when predicting CNCPS fraction C. The CNCPS fraction B(1) (starch + pectin) values were lower than pectin determined through wet chemistty. This finding, along with the results obtained by the substitution of CW for NDF in the CNCPS equations, suggests that pectin was not part of fraction B(1) but present in fraction A. We suggest that pectin and other non-starch polysaccharides that are dissolved by the neutral detergent solution be allocated to a specific fraction (B2) and that another fraction (B(3)) be adopted for the digestible cell wall carbohydrates.

The net benefit of saving the Asian Elephant: A policy and contingent valuation Study

Reports results from a contingent valuation survey of willingness to pay for the conservation of the Asian elephant of a sample of urban residents living in three selected housing schemes in Colombo, the capital of Sri Lanka. Face–to–face surveys were conducted using an interview schedule. A non-linear logit regression model is used to analyse the respondents’ responses for the payment principle questions and to identify the factors that influence their responses. We investigate whether urban residents’ willingness to pay for the conservation of elephants is sufficient to compensate farmers for the damage caused by elephants. We find that the beneficiaries (the urban residents) could compensate losers (the farmers in the areas affected by human–elephant conflict) and be better off than in the absence of elephants in Sri Lanka. Therefore, there is a strong economic case for the conservation of the wild elephant population in Sri Lanka. However, we have insufficient data to determine the optimal level of this elephant population in the Kaldor-Hicks sense. Nevertheless, the current population of elephant in Sri Lanka is Kaldor-Hicks preferable to having none.

Architectural prototyping: from CCS to .Net

Over the last decade, software architecture emerged as a critical issue in Software Engineering. This encompassed a shift from traditional programming towards software development based on the deployment and assembly of independent components. The specification of both the overall systems structure and the interaction patterns between their components became a major concern for the working developer. Although a number of formalisms to express behaviour and to supply the indispensable calculational power to reason about designs, are available, the task of deriving architectural designs on top of popular component platforms has remained largely informal. This paper introduces a systematic approach to derive, from CCS behavioural specifications the corresponding architectural skeletons in the Microsoft .Net framework, in the form of executable C and Cω code. The prototyping process is fully supported by a specific tool developed in Haskell

Prototyping Behavioural Specifications in the.NET framework

Over the last decade, software architecture emerged as a critical design step in Software Engineering. This encompassed a shift from traditional programming towards the deployment and assembly of independent components. The specification of the overall system structure, on the one hand, and of the interactions patterns between its components, on the other, became a major concern for the working developer. Although a number of formalisms to express behaviour and supply the indispensable calculational power to reason about designs, are available, the task of deriving architectural designs on top of popular component platforms has remained largely informal. This paper introduces a systematic approach to derive, from behavioural specifications written in Ccs, the corresponding architectural skeletons in the Microsoft .Net framework in the form of executable C] code. Such prototyping process is automated by means of a specific tool developed in Haskell

Rootstocks resistant to Meloidogyne incognita and compatibility of grafting in net melon

Due to the few studies about grafting in net melon, in order to obtain better control of soil pathogens, the aim of the present study was to evaluate 16 genotypes of Cucurbitaceae: Benincasa hispida, Luffa cylindrica, pumpkin 'Jacarezinho', pumpkin 'Menina Brasileira', squash 'Exposição', squash 'Coroa', pumpkin 'Canhão Seca', pumpkin 'Squash', pumpkin 'Enrrugado Verde', pumpkin 'Mini Paulista', pumpkin 'Goianinha', watermelon 'Charleston Gray', melon 'Rendondo Gaucho', melon 'Redondo Amarelo', cucumber 'Caipira HS' and cucumber 'Caipira Rubi', regarding to compatibility of grafting in net melon and resistance to Meloidogyne incognita, based on the reproduction factor (RF), according to Oostenbrink (1966). To assess resistance, the seedlings were transplanted to ceramic pots and inoculated with 300/mL eggs and/or second stage juveniles of M. incognita. At 50 days after transplanting, the plants were removed from the pots and the resistance was evaluated. The compatibility between resistant rootstock and grafts of net melon was determined by performing simple cleft grafting, in a commercial net melon hybrid of great market acceptance and susceptible to M. incognita (Bonus no. 2). The genotypes Luffa cylindrica, pumpkin 'Goianinha', pumpkin 'Mini-Paulista', melon 'Redondo Amarelo', watermelon 'Charleston Gray' are resistant to the nematode M. incognita. The better compatibilities occurred with the rootstocks melon 'Amarelo', which presented 100% of success, followed by pumpkin 'Mini-Paulista' with 94%. On the other hand, Sponge gourd, watermelon 'Charleston Gray' and pumpkin 'Goianinha' showed low graft take percentages of 66%, 62% and 50%, respectively.

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Synthesis of meeting and recommendations from the Net-Biome round table discussion on "motivated" science on biodiversity management and use in support of overseas sutainable development

Net-Biome Final Meeting (Paris, 15 & 16 February, 2012).

Automatic synthesis of VHDL Hardware Components from IOPT Petri Net models

Conferência: 39th Annual Conference of the IEEE Industrial-Electronics-Society (IECON), Vienna, Austria, Nov 10-14, 2013

Evaluating P-NET message's response time with fixed priority queuing at application process level

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the actual token utilisation. We then analyse the possibility of implementing a local priority-based scheduling policy to improve the real-time behaviour of P-NET.

Supporting real-time distributed computer-controlled systems with multi-hop P-NET networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within process control applications. Therefore, they constitute the foundation upon which real-time distributed computer-controlled systems can be implemented. P-NET is a fieldbus communication standard, which uses a virtual token-passing medium-access-control mechanism. In this paper pre-run-time schedulability conditions for supporting real-time traffic with P-NET networks are established. Essentially, formulae to evaluate the upper bound of the end-to-end communication delay in P-NET messages are provided. Using this upper bound, a feasibility test is then provided to check the timing requirements for accessing remote process variables. This paper also shows how P-NET network segmentation can significantly reduce the end-to-end communication delays for messages with stringent timing requirements.

Communication response time in P-NET networks: worst-case analysis considering the actual token utilisation

Fieldbus networks aim at the interconnection of field devices such as sensors, actuators and small controllers. Therefore, they are an effective technology upon which Distributed Computer Controlled Systems (DCCS) can be built. DCCS impose strict timeliness requirements to the communication network. In essence, by timeliness requirements we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit, which means that in the worst-case the communication response time could be derived considering that the token is fully utilised by all stations. However, such analysis can be proved to be quite pessimistic. In this paper we propose a more sophisticated P-NET timing analysis model, which considers the actual token utilisation by different masters. The major contribution of this model is to provide a less pessimistic, and thus more accurate, analysis for the evaluation of the worst-case communication response time in P-NET fieldbus networks.

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model rises several issues well known within the real-time systems community: message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks.