APE machine : a novel stochastic computer based on a set of automonous [sic] processing elements /

Thesis--University of Illinois at Urbana-Champaign.

Evaluation of IDDM8 susceptibility locus in a Russian simplex family data set

Type 1 diabetes (TID) susceptibility locus, IDDM8, has been accurately mapped to 200 kilobases at the terminal end of chromosome 6q27. This is within the region which harbours a cluster of three genes encoding proteasome subunit beta 1 (PMSB1), TATA-box binding protein (TBP) and a homologue of mouse programming cell death activator 2 (PDCD2). In this study, we evaluated whether these genes contribute to TID susceptibility using the transmission disequilibrium test of the data set from 114 affected Russian simplex families. The A allele of the G/A1180 single nucleotide polymorphism (SNP) at the PDCD2 gene, which was significant in its preferential transfer from parents to diabetic children (75 transmissions vs. 47 non-transmissionS, x(2) = 12.85, P corrected = 0.0038), was found to be associated with T1D. G/A1180 dimorphism and two other SNPs, C/T771 TBP and G/T(-271) PDCD2, were shown to share three common haplotypes, two of which (A-T-G and A-T-T) have been associated with higher development risk of TID. The third haplotype (G-T-G) was related to having a lower risk of disease. These findings suggest that the PDCD2 gene is a likely susceptibility gene for TID within IDDM8. However, it was not possible to exclude the TBP gene from being another putative susceptibility gene in this region. (c) 2005 Elsevier Ltd. All rights reserved.

Incorporating level set methods in Geographical Information Systems (GIS) for land-surface process modelling

Land-surface processes include a broad class of models that operate at a landscape scale. Current modelling approaches tend to be specialised towards one type of process, yet it is the interaction of processes that is increasing seen as important to obtain a more integrated approach to land management. This paper presents a technique and a tool that may be applied generically to landscape processes. The technique tracks moving interfaces across landscapes for processes such as water flow, biochemical diffusion, and plant dispersal. Its theoretical development applies a Lagrangian approach to motion over a Eulerian grid space by tracking quantities across a landscape as an evolving front. An algorithm for this technique, called level set method, is implemented in a geographical information system (GIS). It fits with a field data model in GIS and is implemented as operators in map algebra. The paper describes an implementation of the level set methods in a map algebra programming language, called MapScript, and gives example program scripts for applications in ecology and hydrology.

Combining analytic hierarchy process and goal programming for logistics distribution network design

Logistics distribution network design is one of the major decision problems arising in contemporary supply chain management. The decision involves many quantitative and qualitative factors that may be conflicting in nature. This paper applies an integrated multiple criteria decision making approach to design an optimal distribution network. In the approach, the analytic hierarchy process (AHP) is used first to determine the relative importance weightings or priorities of alternative warehouses with respect to both deliverer oriented and customer oriented criteria. Then, the goal programming (GP) model incorporating the constraints of system, resource, and AHP priority is formulated to select the best set of warehouses without exceeding the limited available resources. In this paper, two commercial packages are used: Expert Choice for determining the AHP priorities of the warehouses, and LINDO for solving the GP model. © 2007 IEEE.

Finding relevant search engine results:a minimax linear programming approach

For a submitted query to multiple search engines finding relevant results is an important task. This paper formulates the problem of aggregation and ranking of multiple search engines results in the form of a minimax linear programming model. Besides the novel application, this study detects the most relevant information among a return set of ranked lists of documents retrieved by distinct search engines. Furthermore, two numerical examples aree used to illustrate the usefulness of the proposed approach.

The effective use of implicit parallelism through the use of an object-oriented programming language

This thesis explores translating well-written sequential programs in a subset of the Eiffel programming language - without syntactic or semantic extensions - into parallelised programs for execution on a distributed architecture. The main focus is on constructing two object-oriented models: a theoretical self-contained model of concurrency which enables a simplified second model for implementing the compiling process. There is a further presentation of principles that, if followed, maximise the potential levels of parallelism. Model of Concurrency. The concurrency model is designed to be a straightforward target for mapping sequential programs onto, thus making them parallel. It aids the compilation process by providing a high level of abstraction, including a useful model of parallel behaviour which enables easy incorporation of message interchange, locking, and synchronization of objects. Further, the model is sufficient such that a compiler can and has been practically built. Model of Compilation. The compilation-model's structure is based upon an object-oriented view of grammar descriptions and capitalises on both a recursive-descent style of processing and abstract syntax trees to perform the parsing. A composite-object view with an attribute grammar style of processing is used to extract sufficient semantic information for the parallelisation (i.e. code-generation) phase. Programming Principles. The set of principles presented are based upon information hiding, sharing and containment of objects and the dividing up of methods on the basis of a command/query division. When followed, the level of potential parallelism within the presented concurrency model is maximised. Further, these principles naturally arise from good programming practice. Summary. In summary this thesis shows that it is possible to compile well-written programs, written in a subset of Eiffel, into parallel programs without any syntactic additions or semantic alterations to Eiffel: i.e. no parallel primitives are added, and the parallel program is modelled to execute with equivalent semantics to the sequential version. If the programming principles are followed, a parallelised program achieves the maximum level of potential parallelisation within the concurrency model.

The Technology of Programming for a Cluster Computer by the Remote Terminal with OS Windows

The problem of preparation of a program to perform it on multiprocessor system of a cluster type is considered. When developing programs for a cluster computer the technology based on use of the remote terminal is applied. The situation when such remote terminal is the computer with operational system Windows is considered. The set of the tool means, allowing carrying out of editing program texts, compiling and starting programs on a cluster computer, is suggested. Advantage of an offered way of preparation of programs to execution is that it allows as much as possible to use practical experience of programmers used to working in OS Windows environment.

Data Flow Analysis and the Linear Programming Model

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

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.

CORE: A Multi-Purpose Programming Contest Repository System

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

Maximization of a Linear Utility Function over the Set of the Housing Market Short-Term Equilibria

AMS subject classification: 90C05, 90A14.

Bloom's Taxonomy and Training in Programming Style

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

A green perspective on Structured parallel programming

Structured parallel programming, and in particular programming models using the algorithmic skeleton or parallel design pattern concepts, are increasingly considered to be the only viable means of supporting effective development of scalable and efficient parallel programs. Structured parallel programming models have been assessed in a number of works in the context of performance. In this paper we consider how the use of structured parallel programming models allows knowledge of the parallel patterns present to be harnessed to address both performance and energy consumption. We consider different features of structured parallel programming that may be leveraged to impact the performance/energy trade-off and we discuss a preliminary set of experiments validating our claims.

Climbing Up the Leaderboard: An Empirical Study of Applying Gamification Techniques to a Computer Programming Class

Conventional taught learning practices often experience difficulties in keeping students motivated and engaged. Video games, however, are very successful at sustaining high levels of motivation and engagement through a set of tasks for hours without apparent loss of focus. In addition, gamers solve complex problems within a gaming environment without feeling fatigue or frustration, as they would typically do with a comparable learning task. Based on this notion, the academic community is keen on exploring methods that can deliver deep learner engagement and has shown increased interest in adopting gamification – the integration of gaming elements, mechanics, and frameworks into non-game situations and scenarios – as a means to increase student engagement and improve information retention. Its effectiveness when applied to education has been debatable though, as attempts have generally been restricted to one-dimensional approaches such as transposing a trivial reward system onto existing teaching materials and/or assessments. Nevertheless, a gamified, multi-dimensional, problem-based learning approach can yield improved results even when applied to a very complex and traditionally dry task like the teaching of computer programming, as shown in this paper. The presented quasi-experimental study used a combination of instructor feedback, real time sequence of scored quizzes, and live coding to deliver a fully interactive learning experience. More specifically, the “Kahoot!” Classroom Response System (CRS), the classroom version of the TV game show “Who Wants To Be A Millionaire?”, and Codecademy’s interactive platform formed the basis for a learning model which was applied to an entry-level Python programming course. Students were thus allowed to experience multiple interlocking methods similar to those commonly found in a top quality game experience. To assess gamification’s impact on learning, empirical data from the gamified group were compared to those from a control group who was taught through a traditional learning approach, similar to the one which had been used during previous cohorts. Despite this being a relatively small-scale study, the results and findings for a number of key metrics, including attendance, downloading of course material, and final grades, were encouraging and proved that the gamified approach was motivating and enriching for both students and instructors.

Heurística de programação da produção para uma indústria cerâmica

Atualmente, uma organização industrial com vista a singrar no mercado global é fortemente influenciada por pressões que visam o aumento da eficiência global e consequente redução de custos operacionais. O desafio para as mesmas passa, portanto, por expurgar do produto tudo aquilo que não lhe acrescenta valor percetível pelo cliente e por maximizar a utilização dos vários recursos industriais instalados. No seguimento deste desafio, surge o Problema de Planeamento e Programação da Produção, ao qual é necessário dar uma resposta eficiente. Este projeto tem como objetivo estudar o problema da Programação da Produção numa indústria de pavimentos e revestimentos cerâmicos, desenvolvendo uma heurística construtiva capaz de traduzir com fiabilidade a realidade do processo produtivo da mesma e, se possível, auxiliar na sua resolução. O problema da programação da produção em estudo visa responder às questões: o quê, em que quantidade, quando e em que linha produzir, por forma a satisfazer as necessidades dos clientes num prazo previamente estipulado como admissível, garantindo o enchimento dos fornos ligados. Sem grandes constrangimentos ao normal lavor da Produção, pretende obter-se com a heurística planos de produção viáveis, que minimizem o tempo necessário para a conclusão do conjunto de referências com necessidades produtivas. O problema é também abordado através de um modelo exato como um problema de máquinas paralelas idênticas capacitado, com matriz de compatibilidades, setups de família e de subfamília e com lotes mínimos de produção. Quer a heurística quer o modelo de programação inteira mista desenvolvidos permitem obter planos de produção válidos, equivalentes aos obtidos atualmente pela empresa através dos meios de programação atuais, embora com um dispêndio de tempo muito inferior.