Genetic algorithm of network graph multi-objective optimization as an instrument of project monitoring

© 2015 Canadian Center of Science and Education. All rights reserved. Proper tracking of progress remains a vital part of modern project management, defining prospects of successful implementation of planned tasks. There are several popular concepts of project monitoring, such as logical framework approach (LFA), earned value management (EVM), etc., and each of them depends on properly optimized network graph that represents dependences between project tasks. Article describes the features and problems of multi-objective optimization in project management with reference to network graphs. The significant role of network graph optimization for project monitoring systems is proved and the model of multi-objective optimization of the network graph on criterion functions of duration and project cost based on NSGA-II genetic algorithm is proposed as the main purpose of research. Model takes into account the reserves of time on a critical way of the network graph, possibility of decreasing the load of available resources at the expense of time reserves on non-critical ways of the network graph, variety of used resources and options of delegation. One of its main advantages is quite low laboriousness of implementation, that depends on number of nodes on the network graph of the project and on number of possible options of delegation for the project tasks with several alternatives of delegation. Model has been tested on sample project with real data and results have been analyzed

Context dependent revocation in delegated XACML

The XACML standard defines an XML based language for defining access control policies and a related processing model. Recent work aims to add delegation to XACML in order to express the right to administrate XACML policies within XACML itself. The delegation profile draft explains how to validate the right to issue a policy, but there are no provisions for removing a policy. This paper proposes a revocation model for delegated XACML. A novel feature of this model is that whether a revocation is valid or not, depends not only on who issued the revocation, but also on the context in which an attempt to use the revoked policy is done

The design of fiscal rules and forms of governance in European Union countries

This paper uses a new data set on budgetary institutions in Europe to examine the impact of fiscal rules and budget procedures in EU countries on public finances. It briefly describes the main pattern of budgetary institutions and their determinants across the EU 15 member states. Empirical evidence for the time period 1985-2004 suggests that the centralisation of budgeting procedures restrains public debt. In countries with one-party governments or coalition governments where parties are closely aligned and where political competition among them is low, this is achieved by the delegation of decision-making power to the minister of finance. Fiscal contracts that require countries to set multi-year targets and that reinforce those targets increase fiscal discipline in countries with ideologically dispersed coalitions and where parties regularly compete against each other

Service re-routing for service network graph: efficiency, scalability and implementation

The key to success in Next Generation Network is service routing in which service requests may need to be redirected as in the case of the INVITE request in Session Initiation Protocol. Service Path (SPath) holds the authentication and server paths along side with service information. As the number of hops in a redirection increases, the length of SPath increases. The overhead for service routing protocols which uses SPath increases with the length of SPath. Hence it is desirable to optimize SPath to ensure efficiency and scalability of protocols involving service routing. In this paper, we propose a re-routing strategy to optimize service routing, and demonstrate how this strategy can be implemented using SPath to enhance the efficiency and scalability of Service Network Graph (SNG)

Liquid FM: Recommending Music through Viscous Democracy

Most modern recommendation systems use the approach of collaborative filtering: users that are believed to behave alike are used to produce recommendations. In this work we describe an application (Liquid FM) taking a completely different approach. Liquid FM is a music recommendation system that makes the user responsible for the recommended items. Suggestions are the result of a voting scheme, employing the idea of viscous democracy. Liquid FM can also be thought of as the first testbed for this voting system. In this paper we outline the design and architecture of the application, both from the theoretical and from the implementation viewpoints

On Rational Delegations in Liquid Democracy

Liquid democracy is a proxy voting method where proxies are delegable. We propose and study a game-theoretic model of liquid democracy to address the following question: when is it rational for a voter to delegate her vote? We study the existence of pure-strategy Nash equilibria in this model, and how group accuracy is affected by them. We complement these theoretical results by means of agent-based simulations to study the effects of delegations on group's accuracy on variously structured social networks.Comment: 17 pages, 3 figures. This paper (without Appendix) appears in the proceedings of AAAI'1

Implementation of the National SAM Innovation Project: A Comparison of Project Designs

Compares increases in principals' instructional time and other benefits of hiring school administration managers specifically for the position to help principals with time management and of assigning the task to those who hold other school positions

Refinement for Administrative Policies

Flexibility of management is an important requisite for access control systems as it allows users to adapt the access control system in accordance with practical requirements. This paper builds on earlier work where we defined administrative policies for a general class of RBAC models. We present a formal definition of administrative refinnement and we show that there is an ordering for administrative privileges which yields administrative refinements of policies. We argue (by giving an example) that this privilege ordering can be very useful in practice, and we prove that the privilege ordering is tractable