Reinforcement Learning Solution for Unit Commitment Problem Considering Minimum Start Up and Shut Down Times

Unit Commitment Problem (UCP) in power system refers to the problem of determining the on/ off status of generating units that minimize the operating cost during a given time horizon. Since various system and generation constraints are to be satisfied while finding the optimum schedule, UCP turns to be a constrained optimization problem in power system scheduling. Numerical solutions developed are limited for small systems and heuristic methodologies find difficulty in handling stochastic cost functions associated with practical systems. This paper models Unit Commitment as a multi stage decision making task and an efficient Reinforcement Learning solution is formulated considering minimum up time /down time constraints. The correctness and efficiency of the developed solutions are verified for standard test systems

Matrix based Key Generation to Enhance Key Avalanche in Advanced Encryption Standard

In symmetric block ciphers, substitution and diffusion operations are performed in multiple rounds using sub-keys generated from a key generation procedure called key schedule. The key schedule plays a very important role in deciding the security of block ciphers. In this paper we propose a complex key generation procedure, based on matrix manipulations, which could be introduced in symmetric ciphers. The proposed key generation procedure offers two advantages. First, the procedure is simple to implement and has complexity in determining the sub-keys through crypt analysis. Secondly, the procedure produces a strong avalanche effect making many bits in the output block of a cipher to undergo changes with one bit change in the secret key. As a case study, matrix based key generation procedure has been introduced in Advanced Encryption Standard (AES) by replacing the existing key schedule of AES. The key avalanche and differential key propagation produced in AES have been observed. The paper describes the matrix based key generation procedure and the enhanced key avalanche and differential key propagation produced in AES. It has been shown that, the key avalanche effect and differential key propagation characteristics of AES have improved by replacing the AES key schedule with the Matrix based key generation procedure

Entwicklung eines Windleistungprognosemodells zur Verbesserung der Kraftwerkseinsatzplanung

Die Maßnahmen zur Förderung der Windenergie in Deutschland haben wichtige Anstöße zur technologischen Weiterentwicklung geliefert und die Grundlagen für den enormen Anlagenzubau geschaffen. Die installierte Windleistung hat heute eine beachtliche Größenordnung erreicht und ein weiteres Wachstum in ähnlichen Dimensionen ist auch für die nächsten Jahre zu erwarten. Die aus Wind erzeugte elektrische Leistung deckt bereits heute in einigen Netzbereichen die Netzlast zu Schwachlastzeiten. Dies zeigt, dass die Windenergie ein nicht mehr zu vernachlässigender Faktor in der elektrischen Energieversorgung geworden ist. Im Rahmen der Kraftwerkseinsatzplanung sind Betrag und Verlauf der Windleistung des folgenden Tages mittlerweile zu wichtigen und zugleich schwierig zu bestimmenden Variablen geworden. Starke Schwankungen und falsche Prognosen der Windstromeinspeisung verursachen zusätzlichen Bedarf an Regel- und Ausgleichsleistung durch die Systemführung. Das im Rahmen dieser Arbeit entwickelte Prognosemodell liefert die zu erwartenden Windleistungen an 16 repräsentativen Windparks bzw. Gruppen von Windparks für bis zu 48 Stunden im Voraus. Aufgrund von prognostizierten Wetterdaten des deutschen Wetterdienstes (DWD) werden die Leistungen der einzelnen Windparks mit Hilfe von künstlichen neuronalen Netzen (KNN) berechnet. Diese Methode hat gegenüber physikalischen Verfahren den Vorteil, dass der komplexe Zusammenhang zwischen Wettergeschehen und Windparkleistung nicht aufwendig analysiert und detailliert mathematisch beschrieben werden muss, sondern anhand von Daten aus der Vergangenheit von den KNN gelernt wird. Das Prognosemodell besteht aus zwei Modulen. Mit dem ersten wird, basierend auf den meteorologischen Vorhersagen des DWD, eine Prognose für den Folgetag erstellt. Das zweite Modul bezieht die online gemessenen Leistungsdaten der repräsentativen Windparks mit ein, um die ursprüngliche Folgetagsprognose zu verbessern und eine sehr genaue Kurzzeitprognose für die nächsten drei bis sechs Stunden zu berechnen. Mit den Ergebnissen der Prognosemodule für die repräsentativen Standorte wird dann über ein Transformationsmodell, dem so genannten Online-Modell, die Gesamteinspeisung in einem größeren Gebiet berechnet. Das Prognoseverfahren hat seine besonderen Vorzüge in der Genauigkeit, den geringen Rechenzeiten und den niedrigen Betriebskosten, da durch die Verwendung des bereits implementierten Online-Modells nur eine geringe Anzahl von Vorhersage- und Messstandorten benötigt wird. Das hier vorgestellte Prognosemodell wurde ursprünglich für die E.ON-Netz GmbH entwickelt und optimiert und ist dort seit Juli 2001 im Einsatz. Es lässt sich jedoch auch leicht an andere Gebiete anpassen. Benötigt werden dazu nur die Messdaten der Leistung ausgewählter repräsentativer Windparks sowie die dazu gehörenden Wettervorhersagen, um die KNN entsprechend zu trainieren.

Supporting co-operative work in apron control and resource management offices on airports

A high demand exists to increase the efficiency of present airport ground facilities and the co-ordination of traffic and services. The Traffic Office plays a crucial role in managing the airport. The main tasks of the Traffic Office is management of equipment, services, and ressources based on the flight schedule and resolving conflicts arising from deviations from the schedule. A new tool will support information exchange between Traffic Office and other facilities on the airport.

Thread Scheduling Mechanisms for Multiple-Context Parallel Processors

Scheduling tasks to efficiently use the available processor resources is crucial to minimizing the runtime of applications on shared-memory parallel processors. One factor that contributes to poor processor utilization is the idle time caused by long latency operations, such as remote memory references or processor synchronization operations. One way of tolerating this latency is to use a processor with multiple hardware contexts that can rapidly switch to executing another thread of computation whenever a long latency operation occurs, thus increasing processor utilization by overlapping computation with communication. Although multiple contexts are effective for tolerating latency, this effectiveness can be limited by memory and network bandwidth, by cache interference effects among the multiple contexts, and by critical tasks sharing processor resources with less critical tasks. This thesis presents techniques that increase the effectiveness of multiple contexts by intelligently scheduling threads to make more efficient use of processor pipeline, bandwidth, and cache resources. This thesis proposes thread prioritization as a fundamental mechanism for directing the thread schedule on a multiple-context processor. A priority is assigned to each thread either statically or dynamically and is used by the thread scheduler to decide which threads to load in the contexts, and to decide which context to switch to on a context switch. We develop a multiple-context model that integrates both cache and network effects, and shows how thread prioritization can both maintain high processor utilization, and limit increases in critical path runtime caused by multithreading. The model also shows that in order to be effective in bandwidth limited applications, thread prioritization must be extended to prioritize memory requests. We show how simple hardware can prioritize the running of threads in the multiple contexts, and the issuing of requests to both the local memory and the network. Simulation experiments show how thread prioritization is used in a variety of applications. Thread prioritization can improve the performance of synchronization primitives by minimizing the number of processor cycles wasted in spinning and devoting more cycles to critical threads. Thread prioritization can be used in combination with other techniques to improve cache performance and minimize cache interference between different working sets in the cache. For applications that are critical path limited, thread prioritization can improve performance by allowing processor resources to be devoted preferentially to critical threads. These experimental results show that thread prioritization is a mechanism that can be used to implement a wide range of scheduling policies.

Preliminary Observations on Program Instability

This white paper reports emerging findings at the end of Phase I of the Lean Aircraft Initiative in the Policy focus group area. Specifically, it provides details about research on program instability. Its objective is to discuss high-level findings detailing: 1) the relative contribution of different factors to a program’s overall instability; 2) the cost impact of program instability on acquisition programs; and 3) some strategies recommended by program managers for overcoming and/or mitigating the negative effects of program instability on their programs. Because this report comes as this research is underway, this is not meant to be a definitive document on the subject. Rather, is it anticipated that this research may potentially produce a number of reports on program instability-related topics. The government managers of military acquisition programs rated annual budget or production rate changes, changes in requirements, and technical difficulties as the three top contributors, respectively, to program instability. When asked to partition actual variance in their program’s planned cost and schedule to each of these factors, it was found that the combined effects of unplanned budget and requirement changes accounted for 5.2% annual cost growth and 20% total program schedule slip. At a rate of approximately 5% annual cost growth from these factors, it is easy to see that even conservative estimates of the cost benefits to be gained from acquisition reforms and process improvements can quickly be eclipsed by the added cost associated with program instability. Program management practices involving the integration of stakeholders from throughout the value chain into the decision making process were rated the most effective at avoiding program instability. The use of advanced information technologies was rated the most effective at mitigating the negative impact of program instability.

Strategies for Lean Product Development

The essence of lean is very simple, but from a research and implementation point of view overwhelming. Lean is the search for perfection through the elimination of waste and the insertion of practices that contribute to reduction in cost and schedule while improving performance of products. This concept of lean has wide applicability to a large range of processes, people and organizations, from concept design to the factory floor, from the laborer to the upper management, from the customer to the developer. Progress has been made in implementing and raising the awareness of lean practices at the factory floor. However, the level of implementation and education in other areas, like product development, is very low.

Optimal Methodology for Synchronized Scheduling of Parallel Station Assembly with Air Transportation

We present an optimal methodology for synchronized scheduling of production assembly with air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain (CESC). This problem was motivated by a major PC manufacturer in consumer electronics industry, where it is required to schedule the delivery requirements to meet the customer needs in different parts of South East Asia. The overall problem is decomposed into two sub-problems which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as a Linear Programming Problem with earliness tardiness penalties for job orders. For the assembly scheduling problem, it is basically required to sequence the job orders on the assembly stations to minimize their waiting times before they are shipped by flights to their destinations. Hence the second sub-problem is modelled as a scheduling problem with earliness penalties. The earliness penalties are assumed to be independent of the job orders.

Preliminary Observations on Program Instability

This white paper reports emerging findings at the end of Phase I of the Lean Aircraft Initiative in the Policy focus group area. Specifically, it provides details about research on program instability. Its objective is to discuss high-level findings detailing: 1) the relative contribution of different factors to a program’s overall instability; 2) the cost impact of program instability on acquisition programs; and 3) some strategies recommended by program managers for overcoming and/or mitigating the negative effects of program instability on their programs. Because this report comes as this research is underway, this is not meant to be a definitive document on the subject. Rather, is it anticipated that this research may potentially produce a number of reports on program instability-related topics. The government managers of military acquisition programs rated annual budget or production rate changes, changes in requirements, and technical difficulties as the three top contributors, respectively, to program instability. When asked to partition actual variance in their program’s planned cost and schedule to each of these factors, it was found that the combined effects of unplanned budget and requirement changes accounted for 5.2% annual cost growth and 20% total program schedule slip. At a rate of approximately 5% annual cost growth from these factors, it is easy to see that even conservative estimates of the cost benefits to be gained from acquisition reforms and process improvements can quickly be eclipsed by the added cost associated with program instability. Program management practices involving the integration of stakeholders from throughout the value chain into the decision making process were rated the most effective at avoiding program instability. The use of advanced information technologies was rated the most effective at mitigating the negative impact of program instability.

La cooperación estratégica de Centros Comerciales

El presente trabajo desarrolla el concepto de cooperación empresarial aplicado al sector económico de Centros Comerciales. Se parte del supuesto que tanto los seres vivos como las organizaciones sociales son esencialmente cooperantes. Se confirma tal apreciación por los postulados de la biología y las ciencias económicas a través de los conceptos del apoyo mutuo, la sociobiología, las teorías de los costos de transacción y la agencia, entre otras. Así mismo, se aborda las diferentes escuelas de estrategia, su relación con la gestión organizacional y sus implicaciones y alcances con la cooperación interfirmas. Seguidamente se analizan los diferentes tipos de cooperación, las principales variables a tener en cuenta en la selección de las formas cooperativas. Posteriormente se hace un análisis a la luz del caso Colombiano de las diferentes experiencias colaborativas de la mediana y gran empresa. En la parte final del proyecto se presenta un diagnóstico del sector de Centro Comerciales donde se analizan sus principales indicadores tales como truput, tráfico, inversión de mercadeo entre otros. Así mismo, se presentan los resultados de una investigación aplicada a los gerentes de los Centros Comerciales para medir el grado de acogida que puede tener una iniciativa colaborativa. Todo esto con el propósito de formular un modelo de colaboración estratégica que se aplicara al sector, en su análisis se presentan sus factores condicionantes, su estructura organizativa, sus ejes estratégicos y su agenda de prioridades.

COMP1205 Student Presentations I-L

Thursday 8th May Building 6 (Eustace) Room 1007, 15.00-16.40 Su & Elena Presenting: Groups: I, J, K, L Marking Groups: M, N, O, P Schedule and Topics 15.00-15.05: Introduction and protocol for the session 15.05-15.25 Group I: Sustainablity – responsiblities and legislation 15.25-15.45 Group J: Green IT – solutions and benefits 16.45-16.05 Group K: Open and linked data 16.05-16.25 Group L: What is Web Science? 16.25-16.45: Wash-up: feedback session for presentation groups

COMP1205 Student Presentations E-H

Monday 12th May Building 34 Room 3001, 12.00-13.45 Su & Rikki Presenting: Groups: E, F, G, H Marking Groups: I, J, K, L Schedule and Topics 12.00-12.05: Introduction and protocol for the session 12.05-12.25 Group E: Creative commons, open source, open movements 12.25-12.45 Group F: Trolling, Banter, Cyber Hate, Online Bullying 12.45-13.05 Group G: Personal Privacy and Security 13.05-13.25 Group H: Crime online; cyber security 13.25-13.45: Wash-up: feedback session for presentation groups

COMP1205 Student Presentations M-P

Tuesday 13th May Building 34 Room 3001, 16.15-17.45 Elena & Rikki/Jian Presenting: Groups: M, N, O, P Marking Groups: Q, R, S, T Schedule and Topics 16.15-16.20: Introduction and protocol for the session 16.20 Group M: Serious games – gaming as a driver for applications online 16.40 Group N: Open Education OERs 17.00 Group O: Big Data – the big picture 17.20 Group P: Rights and equality in the workplace 17.40-18.00: Wash-up: feedback session for presentation groups

COMP1205 Student Presentations Q-T

Monday 12th May Building 34 Room 3001, 10.00-12.45 Su & Rikki Presenting: Groups: Q, R, S, T Marking Groups: U, V, W, X Schedule and Topics 10.00-10.05: Introduction and protocol for the session 10.05-10.25 Group Q: Disablitites and rights – legal responsibilities 10.25-10.45 Group R: Computer Ethics, Professional bodies and accreditation 10.45-11.05 Group S: Digital divide 11.05-11.25 Group T: How the web is chaning the world: co-operation, co-creation, crowd funding and crowd sourcing 11.25-11.45: Wash-up: feedback session for presentation groups

COMP1205 Student Presentations U-X

Thursday 15th May Building 02A Room 2077, 15.00-16.45 Elena & Rikki Presenting: Groups: U, V, W, X Marking Groups: A, B, C, D Schedule and Topics 15.00-15.05: Introduction and protocol for the session 15.05-15.25 Group U: Digital Literacies 15.25-15.45 Group V: Will MOOCs destroy face-to-face University Education? 15.45-16.05 Group W: Groupwork and leadership skills in MMORPGs 16.05-16.25 Group X: Tools and techniques for agile project management 16.25-16.45: Wash-up: feedback session for presentation groups