Non-functional properties in the model-driven development of service-oriented systems

Systems based on the service-oriented architecture (SOA) principles have become an important cornerstone of the development of enterprise-scale software applications. They are characterized by separating functions into distinct software units, called services, which can be published, requested and dynamically combined in the production of business applications. Service-oriented systems (SOSs) promise high flexibility, improved maintainability, and simple re-use of functionality. Achieving these properties requires an understanding not only of the individual artifacts of the system but also their integration. In this context, non-functional aspects play an important role and should be analyzed and modeled as early as possible in the development cycle. In this paper, we discuss modeling of non-functional aspects of service-oriented systems, and the use of these models for analysis and deployment. Our contribution in this paper is threefold. First, we show how services and service compositions may be modeled in UML by using a profile for SOA (UML4SOA) and how non-functional properties of service-oriented systems can be represented using the non-functional extension of UML4SOA (UML4SOA-NFP) and the MARTE profile. This enables modeling of performance, security and reliable messaging. Second, we discuss formal analysis of models which respect this design, in particular we consider performance estimates and reliability analysis using the stochastically timed process algebra PEPA as the underlying analytical engine. Last but not least, our models are the source for the application of deployment mechanisms which comprise model-to-model and model-to-text transformations implemented in the framework VIATRA. All techniques presented in this work are illustrated by a running example from an eUniversity case study.     

Improving literacy and metacognition with electronic portfolios: Teaching and learning with ePEARL

Can an electronic portfolio that is both a multimedia container for student work and a tool to support key learning processes have a positive impact on the literacy practices and self-regulated learning skills of students? This article presents the findings of a yearlong study conducted in three Canadian provinces during the 2007–2008 school year initially involving 32 teachers and 388 students. Due to varying levels of implementation our final data set included 14 teachers and 296 students. Using a non-equivalent pre-test/post-test design, we found that grade 4–6 students who were in classrooms where the teacher provided regular and appropriate use of the electronic portfolio tool ePEARL (i.e., medium–high implementation condition, n = 7 classrooms and 121 students), compared to control students (n = 7 classrooms and 175 students) who did not use ePEARL, showed significant improvements (p < .05) in their writing skills on a standardized literacy measure (i.e., the constructed response subtest of the Canadian Achievement Test-4th ed.) and certain metacognitive skills measured via student self-report. The results of this study indicate that teaching with ePEARL has positive impacts on students’ literacy and self-regulated learning skills when the tool is used regularly and integrated into classroom instruction.     

On the nature of support in computer-supported collaborative learning using gStudy – January 17, 2009

The authors of the articles in this special issue of Computers in Human Behavior explore the nature of support in gStudy, a computer-supported collaborative learning (CSCL) environment, especially from the perspective of the theory of self-regulation [e.g., Zimmerman, B. J. (2000). Attainment of self-regulation: A social cognitive perspective. In M. Boekaerts, P. Pintrich, & M. Zeidner (Eds.), Handbook of self-regulation, research and applications (pp. 13–39). Orlando, FL: Academic Press]. To comment critically on the systematic and comprehensive research this collection of articles represents is a daunting task. Therefore, I want to begin by insuring that the reader has the appropriate impression of the quality and importance of the collection of studies and the tool itself.     

Energy optimal spacecraft attitude control subject to convergence rate constraints

Attitude control of operational satellites is still predominantly performed by standard controllers such as Proportional plus Derivative (PD) control laws, which are still preferred for implementation to the computationally intensive nonlinear optimal control techniques, representing higher implementation complexity. In this paper, an inverse optimal control approach based on phase space geometry is presented, which is easy to implement and free from numerical and computational issues. The optimal control objective is to minimize a norm of the control torque subject to a rapidity constraint on the convergence rate of a Lyapunov function, under the effect of a benchmark controller. The proposed optimization method is shown to significantly enhance the torque-rapidity trade-off compared to the benchmark controller, chosen to be a PD law then a sliding mode controller. The inverse optimal control scheme is implemented on an air bearing table experimental platform.     

一种互联网海量情报规则优化方法

现在很多部门都需要通过规则处理海量情报数据,规则的数量一旦达到海量级规模,对规则的处理技术的要求将会变得越来越高,海量规则的优化将是一个十分重要的问题.文中展示了一种海量规则的优化方法.若两个规则网最后的计算结果是一样的,则可以认为这两个规则网是等价的.基于该等价规则模块的变换可以将代价小的规则模块替换掉代价大的规则模块,从而以后可以选择一种代价最小的规则模块.本文提出规则网模块等价替换的5种优化方法,并对其做了相应的证明.通过优化,可以使得海量规则网处于计算代价尽量最小状态,以此减少处理机的计算工作量.分析表明,通过等价规则替换,可以大大提高规则处理效率.     

A simulation-based scheduling system for real-time optimization and decision making support

This paper presents an industrial application of simulation-based optimization (SBO) in the scheduling and real-time rescheduling of a complex machining line in an automotive manufacturer in Sweden. Apart from generating schedules that are robust and adaptive, the scheduler must be able to carry out rescheduling in real time in order to cope with the system uncertainty effectively. A real-time scheduling system is therefore needed to support not only the work of the production planner but also the operators on the shop floor by re-generating feasible schedules when required. This paper describes such a real-time scheduling system, which is in essence a SBO system integrated with the shop floor database system. The scheduling system, called OPTIMISE scheduling system (OSS), uses real-time data from the production line and sends back expert suggestions directly to the operators through Personal Digital Assistants (PDAs). The user interface helps in generating new schedules and enables the users to easily monitor the production progress through visualization of production status and allows them to forecast and display target performance measures. Initial results from this industrial application have shown that such a novel scheduling system can help both in improving the line throughput efficiently and simultaneously supporting real-time decision making.     

An observer-based approach for the projection onto a 2d-curve under movement

Standard path control laws of autonomous vehicles use the shortest distance between the vehicle’s position and the path as a control error. In order to determine this distance, the projection point onto the path needs to be determined continuously. This requires fast algorithms that feature high numerical reliability in the field of vehicle application.This paper presents two different observer-based approaches for the projection problem. The identity observer reconstructs all states of interest for path control. The second one, a reduced observer, only possesses the curve parameter as a state and calculates the other values by algebraic formulas. Both algorithms consider the continuous movement of the vehicle, the run of the curve, and work without any approximation of the curve. Furthermore, they are applicable for arbitrary parameterized smooth curves, guarantee the required numerical stability, have short calculating time, and show good statistical properties. The performance is shown in several simulations as well as under real conditions.     

Graph OLAP: a multi-dimensional framework for graph data analysis

Databases and data warehouse systems have been evolving from handling normalized spreadsheets stored in relational databases, to managing and analyzing diverse application-oriented data with complex interconnecting structures. Responding to this emerging trend, graphs have been growing rapidly and showing their critical importance in many applications, such as the analysis of XML, social networks, Web, biological data, multimedia data and spatiotemporal data. Can we extend useful functions of databases and data warehouse systems to handle graph structured data? In particular, OLAP (On-Line Analytical Processing) has been a popular tool for fast and user-friendly multi-dimensional analysis of data warehouses. Can we OLAP graphs? Unfortunately, to our best knowledge, there are no OLAP tools available that can interactively view and analyze graph data from different perspectives and with multiple granularities. In this paper, we argue that it is critically important to OLAP graph structured data and propose a novel Graph OLAP framework. According to this framework, given a graph dataset with its nodes and edges associated with respective attributes, a multi-dimensional model can be built to enable efficient on-line analytical processing so that any portions of the graphs can be generalized/specialized dynamically, offering multiple, versatile views of the data. The contributions of this work are three-fold. First, starting from basic definitions, i.e., what are dimensions and measures in the Graph OLAP scenario, we develop a conceptual framework for data cubes on graphs. We also look into different semantics of OLAP operations, and classify the framework into two major subcases: informational OLAP and topological OLAP. Second, we show how a graph cube can be materialized by calculating a special kind of measure called aggregated graph and how to implement it efficiently. This includes both full materialization and partial materialization where constraints are enforced to obtain an iceberg cube. As we can see, due to the increased structural complexity of data, aggregated graphs that depend on the underlying “network” properties of the graph dataset are much harder to compute than their traditional OLAP counterparts. Third, to provide more flexible, interesting and informative OLAP of graphs, we further propose a discovery-driven multi-dimensional analysis model to ensure that OLAP is performed in an intelligent manner, guided by expert rules and knowledge discovery processes. We outline such a framework and discuss some challenging research issues for discovery-driven Graph OLAP.