Chilling requirement for seed germination and phenological observations on peach cultivars

In subtropical climate areas, the models and methods proposed to evaluate the chilling requirement of temperate fruit crops often do not provide satisfactory results, thus calling for the development of alternative techniques. The aim of this study was to evaluate the correlations between some phonological traits and chilling requirement for seed germination of 18 peach cultivars and one nectarine cultivar. Two experiments were installed separately for the correlation studies. In experiment 1, the phenological traits were observed in the field, while in experiment 2, the chilling requirement for 50 and 100% seed germination of each cultivar was assessed. The number of days for beginning of bloom (r = 0.70**, 0.61**) and full bloom (r = 0.72**, 0.76**) were both significantly correlated with the number of chilling units for 50% and 100% germination of seeds. The number of days for beginning of budding and dormancy break were both significantly correlated with the number of chilling units for 50% and 100% germination (r = 0.48*, 0.50*, respectively). However, the same significant effect for these phenological traits was not found between chilling units and 50% germination of seeds, as well as between chilling units and harvest dates.

Tools for testing the Solvency Capital Requirement for life insurance

Longevity risk is one of the major risks that an insurance company or a pension fund has to deal with and it is expected that its importance will grow in the near future. In agreement with these considerations, in Solvency II regulation the Standard formula furnished for calculating the Solvency Capital Requirement explicitly considers this kind of risk. According to the new European rules in our paper we suggest a multiperiod approach to evaluate the SCR for longevity risk. We propose a backtesting framework for measuring the consistency of SCR calculations for life insurance policies.

Specification of software architecture reconfiguration

In the past years, Software Architecture has attracted increased attention by academia and industry as the unifying concept to structure the design of complex systems. One particular research area deals with the possibility of reconfiguring architectures to adapt the systems they describe to new requirements. Reconfiguration amounts to adding and removing components and connections, and may have to occur without stopping the execution of the system being reconfigured. This work contributes to the formal description of such a process. Taking as a premise that a single formalism hardly ever satisfies all requirements in every situation, we present three approaches, each one with its own assumptions about the systems it can be applied to and with different advantages and disadvantages. Each approach is based on work of other researchers and has the aesthetic concern of changing as little as possible the original formalism, keeping its spirit. The first approach shows how a given reconfiguration can be specified in the same manner as the system it is applied to and in a way to be efficiently executed. The second approach explores the Chemical Abstract Machine, a formalism for rewriting multisets of terms, to describe architectures, computations, and reconfigurations in a uniform way. The last approach uses a UNITY-like parallel programming design language to describe computations, represents architectures by diagrams in the sense of Category Theory, and specifies reconfigurations by graph transformation rules.

Model driven development implementation of a control systems user interfaces specification tool

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática

A contribution to the e-framework: a specification of a programming exercise evaluation service

This work is a contribution to the e-Framework, arguably the most prominent e-learning framework today, and consists of the definition of a service for the automatic evaluation of programming exercises. This evaluation domain differs from trivial evaluations modelled by languages such as the IMS Question & Test Interoperability (QTI) specification. Complex evaluation domains justify the development of specialized evaluators that participate in several business processes. These business processes can combine other type of systems such as Programming Contest Management Systems, Learning Management Systems, Integrated Development Environments and Learning Object Repositories where programming exercises are stored as Learning Objects. This contribution describes the implementation approaches used, more precisely, behaviours & requests, use & interactions, applicable standards, interface definition and usage scenarios.

Multilingual ontology specification: a collaborative approach

19-22 June 2012 Madrid, Spain

Hox genes control the specification of global vertebral domains

Dissertação apresentada para obtenção do grau de doutor em Biologia pelo Instituto de Tecnologia Química e Biológica da Universidade Nova de Lisboa

Quality-of-service aware routing for static and mobile IPv6-based low-power and lossy sensor networks using RPL

The Internet of Things (IoT) has emerged as a paradigm over the last few years as a result of the tight integration of the computing and the physical world. The requirement of remote sensing makes low-power wireless sensor networks one of the key enabling technologies of IoT. These networks encompass several challenges, especially in communication and networking, due to their inherent constraints of low-power features, deployment in harsh and lossy environments, and limited computing and storage resources. The IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) [1] was proposed by the IETF ROLL (Routing Over Low-power Lossy links) working group and is currently adopted as an IETF standard in the RFC 6550 since March 2012. Although RPL greatly satisfied the requirements of low-power and lossy sensor networks, several issues remain open for improvement and specification, in particular with respect to Quality of Service (QoS) guarantees and support for mobility. In this paper, we focus mainly on the RPL routing protocol. We propose some enhancements to the standard specification in order to provide QoS guarantees for static as well as mobile LLNs. For this purpose, we propose OF-FL (Objective Function based on Fuzzy Logic), a new objective function that overcomes the limitations of the standardized objective functions that were designed for RPL by considering important link and node metrics, namely end-to-end delay, number of hops, ETX (Expected transmission count) and LQL (Link Quality Level). In addition, we present the design of Co-RPL, an extension to RPL based on the corona mechanism that supports mobility in order to overcome the problem of slow reactivity to frequent topology changes and thus providing a better quality of service mainly in dynamic networks application. Performance evaluation results show that both OF-FL and Co-RPL allow a great improvement when compared to the standard specification, mainly in terms of packet loss ratio and average network latency. 2015 Elsevier B.V. Al

Constraint-based verification of imperative programs

work presented in the context of the European Master’s program in Computational Logic, as the partial requirement for obtaining Master of Science degree in Computational Logic

Insulin reduces the requirement for serum in Plasmodium falciparum culture

Insulin added to Plasmodium falciparum cultures (0.2 IU/ml) reduced the requirement for human serum from ten to five percent. This represents an obvious advantage by its serum-sparing effect and by reducing the chances of using contaminated serum in cultures. The growth-promoting ability of insulin was observed eitherin culture- adapted P. falciparum or in newly-isolated samples.

Specification of a partial replication protocol with TLA+

Nowadays, data available and used by companies is growing very fast creating the need to use and manage this data in the most efficient way. To this end, data is replicated overmultiple datacenters and use different replication protocols, according to their needs, like more availability or stronger consistency level. The costs associated with full data replication can be very high, and most of the times, full replication is not needed since information can be logically partitioned. Another problem, is that by using datacenters to store and process information clients become heavily dependent on them. We propose a partial replication protocol called ParTree, which replicates data to clients, and organizes clients in a hierarchy, using communication between them to propagate information. This solution addresses some of these problems, namely by supporting partial data replication and offline execution mode. Given the complexity of the protocol, the use of formal verification is crucial to ensure the protocol two correctness properties: causal consistency and preservation of data. The use of TLA+ language and tools to formally specificity and verify the proposed protocol are also described.

Enrollment time as a requirement for biometric hand recognition systems

Biometric systems are increasingly being used as a means for authentication to provide system security in modern technologies. The performance of a biometric system depends on the accuracy, the processing speed, the template size, and the time necessary for enrollment. While much research has focused on the first three factors, enrollment time has not received as much attention. In this work, we present the findings of our research focused upon studying user’s behavior when enrolling in a biometric system. Specifically, we collected information about the user’s availability for enrollment in respect to the hand recognition systems (e.g., hand geometry, palm geometry or any other requiring positioning the hand on an optical scanner). A sample of 19 participants, chosen randomly apart their age, gender, profession and nationality, were used as test subjects in an experiment to study the patience of users enrolling in a biometric hand recognition system.

A domain-specific language for ETL patterns specification in Data Warehousing Systems

During the last few years many research efforts have been done to improve the design of ETL (Extract-Transform-Load) systems. ETL systems are considered very time-consuming, error-prone and complex involving several participants from different knowledge domains. ETL processes are one of the most important components of a data warehousing system that are strongly influenced by the complexity of business requirements, their changing and evolution. These aspects influence not only the structure of a data warehouse but also the structures of the data sources involved with. To minimize the negative impact of such variables, we propose the use of ETL patterns to build specific ETL packages. In this paper, we formalize this approach using BPMN (Business Process Modelling Language) for modelling more conceptual ETL workflows, mapping them to real execution primitives through the use of a domain-specific language that allows for the generation of specific instances that can be executed in an ETL commercial tool.

Using relational algebra on the specification of real world ETL processes

Modeling Extract-Transform-Load (ETL) processes of a Data Warehousing System has always been a challenge. The heterogeneity of the sources, the quality of the data obtained and the conciliation process are some of the issues that must be addressed in the design phase of this critical component. Commercial ETL tools often provide proprietary diagrammatic components and modeling languages that are not standard, thus not providing the ideal separation between a modeling platform and an execution platform. This separation in conjunction with the use of standard notations and languages is critical in a system that tends to evolve through time and which cannot be undermined by a normally expensive tool that becomes an unsatisfactory component. In this paper we demonstrate the application of Relational Algebra as a modeling language of an ETL system as an effort to standardize operations and provide a basis for uncommon ETL execution platforms.

Optimum dietary protein requirement for Amazonian Tambaqui, Colossoma macropomum Cuvier, 1818, fed fish meal free diets

Fish meal free diets were formulated to contain graded protein levels as 25% (diet 1), 30% (diet 2), 35% (diet 3) and 40% (diet 4). The diets were fed to tambaqui juveniles (Colossoma macropomum) (46.4 ± 6.3g) in randomly designed recirculating systems for 60 days, to determine the optimum protein requirement for the fish. The final weight of the fish, weight gain (28.1, 28.5, 32.2, 28.0g) and specific growth rate increased (P>0.05) consistently with increasing dietary protein up to treatment with 35% protein diet and then showed a declining trend. Feed intake followed the same trend resulting in best feed efficiency (62.5%) in fish fed diet with 35% protein. Similarly, the protein intake increased significantly with increasing dietary protein levels and reduced after the fish fed with 35% protein; while protein efficiency ratio (2.28, 1.99, 1.87, 1.74) decreased with increasing dietary protein levels. Carcass ash and protein had linear relationship with dietary protein levels while the lipid showed a decreasing trend. Ammonia content (0.68, 0.73, 0.81, 1.21 mg L-1) of the experimental waters also increased (P<0.05) with increasing protein levels while pH, dissolved oxygen and temperature remained fairly constant without any clear pattern of inclination. Broken-line estimation of the weight gain indicated 30% protein as the optimum requirement for the fish.