Kramerius - Fedora based open source system for a digital library

Presentation at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014

SimpleREST -RESTful DSpace API

Poster at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014

Natiivin Android-pelin käyttöliittymän skaalautuminen ja suorituskyvyn optimointi

Tässä työssä esiteltiin Android laitteisto- ja sovellusalustana sekä kuvattiin, kuinka Android-pelisovelluksen käyttöliittymä voidaan pitää yhtenäisenä eri näyttölaitteilla skaalauskertoimien ja ankkuroinnin avulla. Toisena osiona työtä käsiteltiin yksinkertaisia tapoja, joilla pelisovelluksien suorituskykyä voidaan parantaa. Näistä tarkempiin mittauksiin valittiin matalatarkkuuksinen piirtopuskuri ja näkymättömissä olevien kappaleiden piilotus. Mittauksissa valitut menetelmät vaikuttivat demosovelluksen suorituskykyyn huomattavasti. Tässä työssä rajauduttiin Android-ohjelmointiin Java-kielellä ilman ulkoisia kirjastoja, jolloin työn tuloksia voi helposti hyödyntää mahdollisimman monessa eri käyttökohteessa.

Developing an introductory object-oriented programming course

The state of the object-oriented programming course in Lappeenranta University of Technology had reached the point, where it required changes to provide better learning opportunities and thus the learning outcomes. Based on the student feedback the course was partially dated and ineffective. The components of the course were analysed and the ineffective elements were removed and new methods were introduced to improve the course. The major changes included the change from traditional teaching methods to reverse classroom method and the use of Java as the programming language. The changes were measured by the student feedback, lecturer’s observations and comparison to previous years. The feedback suggested that the changes were successful; the course received higher overall grade than before.

Implementation of Quantitative Reaction-based Model Refinement

Building a computational model for complex biological systems is an iterative process. It starts from an abstraction of the process and then incorporates more details regarding the specific biochemical reactions which results in the change of the model fit. Meanwhile, the model’s numerical properties such as its numerical fit and validation should be preserved. However, refitting the model after each refinement iteration is computationally expensive resource-wise. There is an alternative approach which ensures the model fit preservation without the need to refit the model after each refinement iteration. And this approach is known as quantitative model refinement. The aim of this thesis is to develop and implement a tool called ModelRef which does the quantitative model refinement automatically. It is both implemented as a stand-alone Java application and as one of Anduril framework components. ModelRef performs data refinement of a model and generates the results in two different well known formats (SBML and CPS formats). The development of this tool successfully reduces the time and resource needed and the errors generated as well by traditional reiteration of the whole model to perform the fitting procedure.

Telemedicina: Desenvolvimento de um sistema para atendimento à distância de pacientes com doença renal crônica pré-dialítica

ResumoIntrodução:O foco no tratamento da doença renal crônica (DRC) é evitar a sua progressão com o uso do controle clínico otimizado. O uso de tecnologias leves apresenta-se como forma promissora de cuidado em saúde. A internet oferece a oportunidade de instrumentalizar o médico em seu contato profissional com o usuário.Objetivo:Desenvolver um sistema web para o atendimento a distância de pacientes com DRC nos estágios não dialíticos e clinicamente estáveis.Métodos:Desenvolvido um sistema utilizando a linguagem Java, banco de dados MySQL e framework PrimeFaces; disponibilizado em um servidor de aplicações Glassfish.Resultados:O acesso inicial é realizado pelo nefrologista, que cadastra os pacientes com suas informações pessoais e dados de acesso. Após ser cadastrado, o paciente (ou médico de família) pode inserir os dados de sua consulta e estes serão, na sequência, repassados ao nefrologista para avaliação. O formulário com os dados de interesse é pré-determinado, mas ainda há possibilidade de acrescentar informações de forma livre. O sistema possibilita, adicionalmente, que haja troca de mensagens entre os médicos e os pacientes. Além disso, os usuários recebem mensagens via e-mail alertando-os de suas tarefas. O sigilo é garantido por senhas individuais para médicos e pacientes.Conclusão:Essa ferramenta possibilitará aumentar a área de abrangência dos nefrologistas, diminuir os custos e aproximar o paciente ao seu médico da atenção básica, utilizando o Programa de Saúde de Família como interface entre o paciente e a atenção secundária nefrológica.

Measuring software security from the design of software

The vast majority of our contemporary society owns a mobile phone, which has resulted in a dramatic rise in the amount of networked computers in recent years. Security issues in the computers have followed the same trend and nearly everyone is now affected by such issues. How could the situation be improved? For software engineers, an obvious answer is to build computer software with security in mind. A problem with building software with security is how to define secure software or how to measure security. This thesis divides the problem into three research questions. First, how can we measure the security of software? Second, what types of tools are available for measuring security? And finally, what do these tools reveal about the security of software? Measuring tools of these kind are commonly called metrics. This thesis is focused on the perspective of software engineers in the software design phase. Focus on the design phase means that code level semantics or programming language specifics are not discussed in this work. Organizational policy, management issues or software development process are also out of the scope. The first two research problems were studied using a literature review while the third was studied using a case study research. The target of the case study was a Java based email server called Apache James, which had details from its changelog and security issues available and the source code was accessible. The research revealed that there is a consensus in the terminology on software security. Security verification activities are commonly divided into evaluation and assurance. The focus of this work was in assurance, which means to verify one’s own work. There are 34 metrics available for security measurements, of which five are evaluation metrics and 29 are assurance metrics. We found, however, that the general quality of these metrics was not good. Only three metrics in the design category passed the inspection criteria and could be used in the case study. The metrics claim to give quantitative information on the security of the software, but in practice they were limited to evaluating different versions of the same software. Apart from being relative, the metrics were unable to detect security issues or point out problems in the design. Furthermore, interpreting the metrics’ results was difficult. In conclusion, the general state of the software security metrics leaves a lot to be desired. The metrics studied had both theoretical and practical issues, and are not suitable for daily engineering workflows. The metrics studied provided a basis for further research, since they pointed out areas where the security metrics were necessary to improve whether verification of security from the design was desired.

Independent Chronicle Vol. XLVI No. 3477- August 8, 1814

A semi-weekly paper that was published from 1801 to 1817. It was previously called the Independent chronicle and the universal advertiser, and was later the Independent chronicle and Boston patriot (Semiweekly). Publishers were Abijah Adams and Ebenezer Rhoades. Topics of interest in this issue include: Page 1: notice from the U.S. War Department seeking proposals for the supply of rations to troops; account of the battle of Bridgewater; list of important military figures wounded in the battle; news of prisoner exchange; Americans and the British negotiate and new prisoner exchange convention; Page 2: report of more British troops sailing to North America; report of some Indian tribes signing a treaty to fight against the British; report of battle near Detroit; report of militia moving from Fredricksburg, Virginia to Baltimore, Maryland; report of troop numbers and casualties in the battle of Bridgewater; report that Commodore Chauncey has recovered from his illness; news of American Naval forces sailing from Sackett's Harbor; Indian tribes sign peace treaty with U.S.; news of U.S. relations with Indians in the southern U.S.; account of battle of Bridgewater and list of casualties; report of the number of men killed and wounded on both sides in the battle of Chippewa; Page 3: report of surprise attack on the British; news of warship movements in and out of Halifax; frigate Java launched in Baltimore; news of British ship movements; 3 companies of Massachusetts militia arrive at Fort Warren; news of ship movements in and out of the Port of Boston; various Marshal's notices alleging U.S. ships supplying goods to the British;

RelMDD-A Library for Manipulating Relations Based on MDDs

Relation algebras is one of the state-of-the-art means used by mathematicians and computer scientists for solving very complex problems. As a result, a computer algebra system for relation algebras called RelView has been developed at Kiel University. RelView works within the standard model of relation algebras. On the other hand, relation algebras do have other models which may have different properties. For example, in the standard model we always have L;L=L (the composition of two (heterogeneous) universal relations yields a universal relation). This is not true in some non-standard models. Therefore, any example in RelView will always satisfy this property even though it is not true in general. On the other hand, it has been shown that every relation algebra with relational sums and subobjects can be seen as matrix algebra similar to the correspondence of binary relations between sets and Boolean matrices. The aim of my research is to develop a new system that works with both standard and non-standard models for arbitrary relations using multiple-valued decision diagrams (MDDs). This system will implement relations as matrix algebras. The proposed structure is a library written in C which can be imported by other languages such as Java or Haskell.

An Interactive Theorem Prover for First-Order Dynamic Logic

Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.

Royal Navy Ship Collection, 1784-1816

Includes 41 copies of plans of Royal Navy ships, ranging in date from 1784 to 1816. Some of the ships included are the Bonne Citoyenne, Niagara, Epervier, Comet, Contest, Ferret, Childers, Anacreon, Florida, Hind, Hermes, Psyche, Princess Charlotte, Contest, Prince Regent, Caroline, Thetis, Statira, Forte, Pelican, Crescent, Euryalus, Chesapeake, Acasta, Banterer, Leda, Endymion, Amphion, President, Tonnant, Ramillies, Boyne, and St. Lawrence. Many of these ships were used by the British during the War of 1812. The original plans are at the National Maritime Museum in Greenwich, London. Also included is a copy of a handwritten chart with the number and size of the British and United States Squadrons on Lake Ontario, March 1814 (during the War of 1812). This includes the number and caliber of long guns and carronades, as well as the weight of metal, for different ships. British ships include the Prince Regent, Princess Charlotte, Wolfe, Royal George, Melville, Moira, Sir Sidney Smith, and Beresford. American ships include the [General] Pike, Madison, Oneida, Sylph, Gen’l Tompkins[?], Conquest, Fair American, Ontario, Pert, Asp, and Lady of the Lake. Also included is a copy of a map titled “Track of the Action”, tracking the movements of the HMS Java and the USS Constitution, dated December 29, 1812, and a copy of a map of Lake Champlain and Plattsburgh Bay showing the position of a vessel(s), undated.

AnaBench: a Web/CORBA-based workbench for biomolecular sequence analysis

Affiliation: Département de biochimie, Faculté de médecine, Université de Montréal

AURA : a hybrid approach to identify framework evolution

Les cadriciels et les bibliothèques sont indispensables aux systèmes logiciels d'aujourd'hui. Quand ils évoluent, il est souvent fastidieux et coûteux pour les développeurs de faire la mise à jour de leur code. Par conséquent, des approches ont été proposées pour aider les développeurs à migrer leur code. Généralement, ces approches ne peuvent identifier automatiquement les règles de modification une-remplacée-par-plusieurs méthodes et plusieurs-remplacées-par-une méthode. De plus, elles font souvent un compromis entre rappel et précision dans leur résultats en utilisant un ou plusieurs seuils expérimentaux. Nous présentons AURA (AUtomatic change Rule Assistant), une nouvelle approche hybride qui combine call dependency analysis et text similarity analysis pour surmonter ces limitations. Nous avons implanté AURA en Java et comparé ses résultats sur cinq cadriciels avec trois approches précédentes par Dagenais et Robillard, M. Kim et al., et Schäfer et al. Les résultats de cette comparaison montrent que, en moyenne, le rappel de AURA est 53,07% plus que celui des autre approches avec une précision similaire (0,10% en moins).

Un formalisme pour la traçabilité des transformations

Dans le développement logiciel en industrie, les documents de spécification jouent un rôle important pour la communication entre les analystes et les développeurs. Cependant, avec le temps, les changements de personel et les échéances toujours plus courtes, ces documents sont souvent obsolètes ou incohérents avec l'état effectif du système, i.e., son code source. Pourtant, il est nécessaire que les composants du système logiciel soient conservés à jour et cohérents avec leurs documents de spécifications pour faciliter leur développement et maintenance et, ainsi, pour en réduire les coûts. Maintenir la cohérence entre spécification et code source nécessite de pouvoir représenter les changements sur les uns et les autres et de pouvoir appliquer ces changements de manière cohérente et automatique. Nous proposons une solution permettant de décrire une représentation d'un logiciel ainsi qu'un formalisme mathématique permettant de décrire et de manipuler l'évolution des composants de ces représentations. Le formalisme est basé sur les triplets de Hoare pour représenter les transformations et sur la théorie des groupes et des homomorphismes de groupes pour manipuler ces transformations et permettrent leur application sur les différentes représentations du système. Nous illustrons notre formalisme sur deux représentations d'un système logiciel : PADL, une représentation architecturale de haut niveau (semblable à UML), et JCT, un arbre de syntaxe abstrait basé sur Java. Nous définissons également des transformations représentant l'évolution de ces représentations et la transposition permettant de reporter les transformations d'une représentation sur l'autre. Enfin, nous avons développé et décrivons brièvement une implémentation de notre illustration, un plugiciel pour l'IDE Eclipse détectant les transformations effectuées sur le code par les développeurs et un générateur de code pour l'intégration de nouvelles représentations dans l'implémentation.

Sur la validation des modèles de séries chronologiques spatio-temporelles multivariées

Dans ce mémoire, nous avons utilisé le logiciel R pour la programmation.