Optimal design of the renewable energy map of Greece using weighted goal-programming and data envelopment analysis

Renewable energy forms have been widely used in the past decades highlighting a "green" shift in energy production. An actual reason behind this turn to renewable energy production is EU directives which set the Union's targets for energy production from renewable sources, greenhouse gas emissions and increase in energy efficiency. All member countries are obligated to apply harmonized legislation and practices and restructure their energy production networks in order to meet EU targets. Towards the fulfillment of 20-20-20 EU targets, in Greece a specific strategy which promotes the construction of large scale Renewable Energy Source plants is promoted. In this paper, we present an optimal design of the Greek renewable energy production network applying a 0-1 Weighted Goal Programming model, considering social, environmental and economic criteria. In the absence of a panel of experts Data Envelopment Analysis (DEA) approach is used in order to filter the best out of the possible network structures, seeking for the maximum technical efficiency. Super-Efficiency DEA model is also used in order to reduce the solutions and find the best out of all the possible. The results showed that in order to achieve maximum efficiency, the social and environmental criteria must be weighted more than the economic ones.

Educational Games for Learning Programming Languages

A concept of educational game for learning programming languages is presented. The idea of learning programming languages and improving programming skills through programming game characters’ behavior is described. The learning course description rules for using in games are suggested. The concept is implemented in a game for learning C# programming language. A common game architecture is modified for using in the educational game. The game engine is built on the base of the graphical engine Ogre3D and extended with game logic. The game has been developed as an industry level commercial product and is planned for sale to educational institutions.

Radial deformation measurement of a cylinder under compression using multicore fibre

A multicore fibre (MCF) sensor to measure the radial deformation of a compliant cylinder under compression is presented. The sensor is connectorised and need not be permanently bonded to the test object. A differential measurement technique using FBGs written into the MCF makes the sensor temperature insensitive. FBG measurement of axial strain of a cylinder under compression is also reported.

Two-axis accelerometer based on multicore fibre Bragg gratings

We report an accelerometer based upon a simple fibre cantilever constructed from a short length of multicore fibre(MCF) containing fibre Bragg gratings (FBGs). Two-axis measurement is demonstrated up to 3 kHz.

Long period grating in multicore optical fiber:an ultra-sensitive vector bending sensor for low curvatures

Long period grating was UV inscribed into a multicore fiber consisting of 120 single mode cores. The multicore fiber that hosts the grating was fusion spliced into a single mode fiber at both ends. The splice creates a taper transition between the two types of fiber that produces a nonadiabatic mode evolution; this results in the illumination of all the modes in the multicore fiber. The spectral characteristics of this fiber device as a function of curvature were investigated. The device yielded a significant spectral sensitivity as high as 1.23 nm/m-1 and 3.57 dB/m-1 to the ultra-low curvature values from 0 to 1 m-1. This fiber device can also distinguish the orientation of curvature experienced by the fiber as the long period grating attenuation bands producing either a blue or red wavelength shift. The finite element method (FEM) model was used to investigate the modal behavior in multicore fiber and to predict the phase-matching curves of the long period grating inscribed into multicore fiber. © 2014 Optical Society of America.

Development of Variational Thinking Skills in Programming Teaching

The paper presents an example of methodological approach to the development of variational thinking skills in teaching programming. Various ways in solving a given task are implemented for the purpose. One of the forms, through which the variational thinking is manifested, is related to trail practical actions. In the process of comprehension of the properties thus acquired, students are doing their own (correct or incorrect) conclusions for other, hidden properties and at the same time they discover possibilities for new ways of action and acquiring of new effects. The variability and the generalizing function of thinking are in a close interrelation, and their interaction to a great extend determines the dynamics of the cognitive activity of the student.

Integer Programming Approach to HP Folding

One of the most widely studied protein structure prediction models is the hydrophobic-hydrophilic (HP) model, which explains the hydrophobic interaction and tries to maximize the number of contacts among hydrophobic amino-acids. In order to find a lower bound for the number of contacts, a number of heuristics have been proposed, but finding the optimal solution is still a challenge. In this research, we focus on creating a new integer programming model which is capable to provide tractable input for mixed-integer programming solvers, is general enough and allows relaxation with provable good upper bounds. Computational experiments using benchmark problems show that our formulation achieves these goals.

Method of Linear Programming as an Idea for High School Curriculum

2010 Mathematics Subject Classification: 97D40, 97M10, 97M40, 97N60, 97N80, 97R80

A Language for Compositional Programming: A Rationale and Design

Бойко Бл. Банчев - Представена е обосновка и описание на език за програмиране в композиционен стил за опитни и учебни цели. Под “композиционен” имаме предвид функционален стил на програмиране, при който пресмятането е йерархия от композиции и прилагания на функции. Един от данновите типове на езика е този на геометричните фигури, които могат да бъдат получавани чрез прости правила за съотнасяне и така също образуват йерархични композиции. Езикът е силно повлиян от GeomLab, но по редица свойства се различава от него значително. Статията разглежда основните черти на езика; подробното му описание и фигурноконструктивните му възможности ще бъдат представени в съпътстваща публикация.

A Software Platform for Teaching Programming with Grading Systems

Красимир Манев, Милослав Средков, Петър Армянов - Състезателните системи (СС) са незаменимо средство за организация на състезания по програмиране. Напоследък СС се използват и в обучението по програмиране. В статията е предложена платформа, която да интегрира възможностите на СС, създадени или използвани от авторите. Целта е изграждането на проста и ефективна среда за обучение по програмиране, подпомагаща учебния процес. Специфицирани са основните елементи на платформата, като резултат от предходно изследване, и една нейна възможна архитектура.

CORE: A Multi-Purpose Programming Contest Repository System

Яни Чаушев, Милослав Средков, Красимир Манев - Всяко състезание по програмиране използва множество софтуерни инструменти за управление на процесите по време на състезанието. Въпреки че тези инструменти обикновено покриват спецификите на конкретния вид състезание задоволително, те рядко адресират трудностите на дългосрочното съхранение на данни и оперативната съвместимост. В тази статия е представен един софтуерен инструмент адресиращ тези проблеми. Вместо комплексна система, касаеща всички аспекти на състезанието, CORE е централизирано хранилище за съхраняване и поддържане на необходимите за различни състезания данни. Представени са основните му елементи, текущото състояние на реализацията и перспективите за развитие на системата.

A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.

Programming as Metacalculation

Report published in the Proceedings of the National Conference on "Education in the Information Society", Plovdiv, May, 2013

Programming and Testing a Two-Tree Algorithm

ACM Computing Classification System (1998): G.2.2, F.2.2.

Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica

ACM Computing Classification System (1998): G.1.2.