980 resultados para Dynamic code generation
Resumo:
This work proposes a model for planning of education based on resources and layers. Each learning material or concept is determined by certain characteristics: a layer and a list of resources and resource values. Models of studied subject domain, learner, information and verification unit, learning material, plan of education and education have been defined. The plan of education can be conventional, statical, author’s and dynamic. Algorithms for course generation, dynamic plan generation and carrying out education are presented. The proposed model for planning of education based on resources and layers has been included in the system PeU.
Resumo:
To benefit from the advantages that Cloud Computing brings to the IT industry, management policies must be implemented as a part of the operation of the Cloud. Among others, for example, the specification of policies can be used for the management of energy to reduce the cost of running the IT system or also for security policies while handling privacy issues of users. As cloud platforms are large, manual enforcement of policies is not scalable. Hence, autonomic approaches for management policies have recently received a considerable attention. These approaches allow specification of rules that are executed via rule-engines. The process of rules creation starts by the interpretation of the policies drafted by high-rank managers. Then, technical IT staff translate such policies to operational activities to implement them. Such process can start from a textual declarative description and after numerous steps terminates in a set of rules to be executed on a rule engine. To simplify the steps and to bridge the considerable gap between the declarative policies and executable rules, we propose a domain-specific language called CloudMPL. We also design a method of automated transformation of the rules captured in CloudMPL to the popular rule-engine Drools. As the policies are changed over time, code generation will reduce the time required for the implementation of the policies. In addition, using a declarative language for writing the specifications is expected to make the authoring of rules easier. We demonstrate the use of the CloudMPL language into a running example extracted from a management energy consumption case study.
Resumo:
Wireless sensor networks (WSNs) differ from conventional distributed systems in many aspects. The resource limitation of sensor nodes, the ad-hoc communication and topology of the network, coupled with an unpredictable deployment environment are difficult non-functional constraints that must be carefully taken into account when developing software systems for a WSN. Thus, more research needs to be done on designing, implementing and maintaining software for WSNs. This thesis aims to contribute to research being done in this area by presenting an approach to WSN application development that will improve the reusability, flexibility, and maintainability of the software. Firstly, we present a programming model and software architecture aimed at describing WSN applications, independently of the underlying operating system and hardware. The proposed architecture is described and realized using the Model-Driven Architecture (MDA) standard in order to achieve satisfactory levels of encapsulation and abstraction when programming sensor nodes. Besides, we study different non-functional constrains of WSN application and propose two approaches to optimize the application to satisfy these constrains. A real prototype framework was built to demonstrate the developed solutions in the thesis. The framework implemented the programming model and the multi-layered software architecture as components. A graphical interface, code generation components and supporting tools were also included to help developers design, implement, optimize, and test the WSN software. Finally, we evaluate and critically assess the proposed concepts. Two case studies are provided to support the evaluation. The first case study, a framework evaluation, is designed to assess the ease at which novice and intermediate users can develop correct and power efficient WSN applications, the portability level achieved by developing applications at a high-level of abstraction, and the estimated overhead due to usage of the framework in terms of the footprint and executable code size of the application. In the second case study, we discuss the design, implementation and optimization of a real-world application named TempSense, where a sensor network is used to monitor the temperature within an area.
Resumo:
Enterprise apps on mobile devices typically need to communicate with other system components by consuming web services. Since most of the current mobile device platforms (such as Android) do not provide built-in features for consuming SOAP services, extensions have to be designed. Additionally in order to accommodate the typical enhanced security requirements of enterprise apps, it is important to be able to deal with SOAP web service security extensions on client side. In this article we show that neither the built-in SOAP capabilities for Android web service clients are sufficient for enterprise apps nor are the necessary security features supported by the platform as is. After discussing different existing extensions making Android devices SOAP capable we explain why none of them is really satisfactory in an enterprise context. Then we present our own solution which accommodates not only SOAP but also the WS-Security features on top of SOAP. Our solution heavily relies on code generation in order to keep the flexibility benefits of SOAP on one hand while still keeping the development effort manageable for software development. Our approach provides a good foundation for the implementation of other SOAP extensions apart from security on the Android platform as well. In addition our solution based on the gSOAP framework may be used for other mobile platforms in a similar manner.
Resumo:
In this report, we develop an intelligent adaptive neuro-fuzzy controller by using adaptive neuro fuzzy inference system (ANFIS) techniques. We begin by starting with a standard proportional-derivative (PD) controller and use the PD controller data to train the ANFIS system to develop a fuzzy controller. We then propose and validate a method to implement this control strategy on commercial off-the-shelf (COTS) hardware. An analysis is made into the choice of filters for attitude estimation. These choices are limited by the complexity of the filter and the computing ability and memory constraints of the micro-controller. Simplified Kalman filters are found to be good at estimation of attitude given the above constraints. Using model based design techniques, the models are implemented on an embedded system. This enables the deployment of fuzzy controllers on enthusiast-grade controllers. We evaluate the feasibility of the proposed control strategy in a model-in-the-loop simulation. We then propose a rapid prototyping strategy, allowing us to deploy these control algorithms on a system consisting of a combination of an ARM-based microcontroller and two Arduino-based controllers. We then use a combination of the code generation capabilities within MATLAB/Simulink in combination with multiple open-source projects in order to deploy code to an ARM CortexM4 based controller board. We also evaluate this strategy on an ARM-A8 based board, and a much less powerful Arduino based flight controller. We conclude by proving the feasibility of fuzzy controllers on Commercial-off the shelf (COTS) hardware, we also point out the limitations in the current hardware and make suggestions for hardware that we think would be better suited for memory heavy controllers.
Resumo:
We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.
Resumo:
For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.
Resumo:
Theories on social capital and on social entrepreneurship have mainly highlighted the attitude of social capital to generate enterprises and to foster good relations between third sector organizations and the public sector. This paper considers the social capital in a specific third sector enterprise; here, multi-stakeholder social cooperatives are seen, at the same time, as social capital results, creators and incubators. In the particular enterprises that identify themselves as community social enterprises, social capital, both as organizational and relational capital, is fundamental: SCEs arise from but also produce and disseminate social capital. This paper aims to improve the building of relational social capital and the refining of helpful relations drawn from other arenas, where they were created and from where they are sometimes transferred to other realities, where their role is carried on further (often working in non-profit, horizontally and vertically arranged groups, where they share resources and relations). To represent this perspective, we use a qualitative system dynamic approach in which social capital is measured using proxies. Cooperation of volunteers, customers, community leaders and third sector local organizations is fundamental to establish trust relations between public local authorities and cooperatives. These relations help the latter to maintain long-term contracts with local authorities as providers of social services and enable them to add innovation to their services, by developing experiences and management models and maintaining an interchange with civil servants regarding these matters. The long-term relations and the organizational relations linking SCEs and public organizations help to create and to renovate social capital. Thus, multi-stakeholder cooperatives originated via social capital developed in third sector organizations produce new social capital within the cooperatives themselves and between different cooperatives (entrepreneurial components of the third sector) and the public sector. In their entrepreneurial life, cooperatives have to contrast the "working drift," as a result of which only workers remain as members of the cooperative, while other stakeholders leave the organization. Those who are not workers in the cooperative are (stake)holders with "weak ties," who are nevertheless fundamental in making a worker's cooperative an authentic social multi-stakeholders cooperative. To maintain multi-stakeholder governance and the relations with third sector and civil society, social cooperatives have to reinforce participation and dialogue with civil society through ongoing efforts to include people that provide social proposals. We try to represent these processes in a system dynamic model applied to local cooperatives, measuring the social capital created by the social cooperative through proxies, such as number of volunteers and strong cooperation with public institutions. Using a reverse-engineering approach, we can individuate the determinants of the creation of social capital and thereby give support to governance that creates social capital.
Resumo:
A procedure for the dynamic generation of 1,6-hexamethylene diisocyanate (HDI) aerosol atmospheres of 70 micrograms m-3 (0.01 ppm) to 1.75 mg m-3 (0.25 ppm), based on the precise control of the evaporation of pure liquid HDI and subsequent dilution with air, was developed. The apparatus consisted of a home-made glass nebulizer coupled with a separation stage to exclude non-respirable droplets (greater than 10 microns). The aerosol concentrations were achieved by passing air through the nebulizer at 1.5-4.5 l. min-1 to generate dynamically 0.01-0.25 ppm of diisocyanate in an experimental chamber of 8.55 m3. The distribution of the liquid aerosol was established with an optical counter and the diisocyanate concentration was determined from samples collected in impingers by a high-pressure liquid chromatographic method. The atmospheres generated were suitable for the evaluation both of sampling procedures full scale, and of analytical methods: at 140 micrograms m-3 (0.02 ppm) they remained stable for 15-min provocation tests in clinical asthma, as verified by breath-zone sampling of exposed patients.
Resumo:
We present a nonequlibrium approach for the study of a flexible bilayer whose two components induce distinct curvatures. In turn, the two components are interconverted by an externally promoted reaction. Phase separation of the two species in the surface results in the growth of domains characterized by different local composition and curvature modulations. This domain growth is limited by the effective mixing due to the interconversion reaction, leading to a finite characteristic domain size. In addition to these effects, first introduced in our earlier work [ Phys. Rev. E 71 051906 (2005)], the important new feature is the assumption that the reactive process actively affects the local curvature of the bilayer. Specifically, we suggest that a force energetically activated by external sources causes a modification of the shape of the membrane at the reaction site. Our results show the appearance of a rich and robust dynamical phenomenology that includes the generation of traveling and/or oscillatory patterns. Linear stability analysis, amplitude equations, and numerical simulations of the model kinetic equations confirm the occurrence of these spatiotemporal behaviors in nonequilibrium reactive bilayers.
Resumo:
In this paper we draw on the theory of dynamic capabilities to examine development of the only surviving family-owned Liverpool shipping company. The Bibby Line was founded in 1807 to take advantage of the growing sea-trade based in Liverpool. The company remained in shipping until the mid-1960s, when a series of external crises led the owner, Derek Bibby, to begin a process of diversification. In the last 50 years, the Bibby Line has grown into a £1bn business with interests in retail, distribution and financial services as well as a continuing commitment to shipping. Our intention is to demonstrate how multigenerational ownership contributes to the creation of dynamic capabilities in family firms. The distinctive nature of Bibby as a long-standing family business is related to unique assets such as patient capital, flexible governance structures as well as the ability to mobilise social and human capital.
Resumo:
Dynamic soundtracking presents various practical and aesthetic challenges to composers working with games. This paper presents an implementation of a system addressing some of these challenges with an affectively-driven music generation algorithm based on a second order Markov-model. The system can respond in real-time to emotional trajectories derived from 2-dimensions of affect on the circumplex model (arousal and valence), which are mapped to five musical parameters. A transition matrix is employed to vary the generated output in continuous response to the affective state intended by the gameplay.
Resumo:
Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In this study, we propose an approach to support dynamic lightpath scheduling in such networks. To minimize blocking probability in a network that accommodates dynamic scheduled lightpath demands (DSLDs), resource allocation should be optimized in a dynamic manner. However, for the network users who desire deterministic services, resources must be reserved in advance and guaranteed for future use. These two objectives may be mutually incompatible. Therefore, we propose a two-phase dynamic lightpath scheduling approach to tackle this issue. The first phase is the deterministic lightpath scheduling phase. When a lightpath request arrives, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with the deterministic lightpath schedule. The second phase is the lightpath re-optimization phase, in which the network control plane re-provisions some already scheduled lightpaths. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce WDM network blocking.