High performance, low latency double digit decimal multiplier on ASIC and FPGA

Decimal multiplication is an integral part of financial, commercial, and internet-based computations. This paper presents a novel double digit decimal multiplication (DDDM) technique that offers low latency and high throughput. This design performs two digit multiplications simultaneously in one clock cycle. Double digit fixed point decimal multipliers for 7digit, 16 digit and 34 digit are simulated using Leonardo Spectrum from Mentor Graphics Corporation using ASIC Library. The paper also presents area and delay comparisons for these fixed point multipliers on Xilinx, Altera, Actel and Quick logic FPGAs. This multiplier design can be extended to support decimal floating point multiplication for IEEE 754- 2008 standard.

Message Integrity in the World Wide Web: Use of Nested Hash Function and a Fast Stream Cipher

The focus of this work is to provide authentication and confidentiality of messages in a swift and cost effective manner to suit the fast growing Internet applications. A nested hash function with lower computational and storage demands is designed with a view to providing authentication as also to encrypt the message as well as the hash code using a fast stream cipher MAJE4 with a variable key size of 128-bit or 256-bit for achieving confidentiality. Both nested Hash function and MAJE4 stream cipher algorithm use primitive computational operators commonly found in microprocessors; this makes the method simple and fast to implement both in hardware and software. Since the memory requirement is less, it can be used for handheld devices for security purposes.

Cooperative Caching Framework for Mobile Cloud Computing

Due to the advancement in mobile devices and wireless networks mobile cloud computing, which combines mobile computing and cloud computing has gained momentum since 2009. The characteristics of mobile devices and wireless network makes the implementation of mobile cloud computing more complicated than for fixed clouds. This section lists some of the major issues in Mobile Cloud Computing. One of the key issues in mobile cloud computing is the end to end delay in servicing a request. Data caching is one of the techniques widely used in wired and wireless networks to improve data access efficiency. In this paper we explore the possibility of a cooperative caching approach to enhance data access efficiency in mobile cloud computing. The proposed approach is based on cloudlets, one of the architecture designed for mobile cloud computing.

Computing median and antimedian sets in median graphs

The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes

Soft Computing Approach for Optimization of siRNA Efficiency Prediction for Post-transcriptional Gene Silencing

Post-transcriptional gene silencing by RNA interference is mediated by small interfering RNA called siRNA. This gene silencing mechanism can be exploited therapeutically to a wide variety of disease-associated targets, especially in AIDS, neurodegenerative diseases, cholesterol and cancer on mice with the hope of extending these approaches to treat humans. Over the recent past, a significant amount of work has been undertaken to understand the gene silencing mediated by exogenous siRNA. The design of efficient exogenous siRNA sequences is challenging because of many issues related to siRNA. While designing efficient siRNA, target mRNAs must be selected such that their corresponding siRNAs are likely to be efficient against that target and unlikely to accidentally silence other transcripts due to sequence similarity. So before doing gene silencing by siRNAs, it is essential to analyze their off-target effects in addition to their inhibition efficiency against a particular target. Hence designing exogenous siRNA with good knock-down efficiency and target specificity is an area of concern to be addressed. Some methods have been developed already by considering both inhibition efficiency and off-target possibility of siRNA against agene. Out of these methods, only a few have achieved good inhibition efficiency, specificity and sensitivity. The main focus of this thesis is to develop computational methods to optimize the efficiency of siRNA in terms of “inhibition capacity and off-target possibility” against target mRNAs with improved efficacy, which may be useful in the area of gene silencing and drug design for tumor development. This study aims to investigate the currently available siRNA prediction approaches and to devise a better computational approach to tackle the problem of siRNA efficacy by inhibition capacity and off-target possibility. The strength and limitations of the available approaches are investigated and taken into consideration for making improved solution. Thus the approaches proposed in this study extend some of the good scoring previous state of the art techniques by incorporating machine learning and statistical approaches and thermodynamic features like whole stacking energy to improve the prediction accuracy, inhibition efficiency, sensitivity and specificity. Here, we propose one Support Vector Machine (SVM) model, and two Artificial Neural Network (ANN) models for siRNA efficiency prediction. In SVM model, the classification property is used to classify whether the siRNA is efficient or inefficient in silencing a target gene. The first ANNmodel, named siRNA Designer, is used for optimizing the inhibition efficiency of siRNA against target genes. The second ANN model, named Optimized siRNA Designer, OpsiD, produces efficient siRNAs with high inhibition efficiency to degrade target genes with improved sensitivity-specificity, and identifies the off-target knockdown possibility of siRNA against non-target genes. The models are trained and tested against a large data set of siRNA sequences. The validations are conducted using Pearson Correlation Coefficient, Mathews Correlation Coefficient, Receiver Operating Characteristic analysis, Accuracy of prediction, Sensitivity and Specificity. It is found that the approach, OpsiD, is capable of predicting the inhibition capacity of siRNA against a target mRNA with improved results over the state of the art techniques. Also we are able to understand the influence of whole stacking energy on efficiency of siRNA. The model is further improved by including the ability to identify the “off-target possibility” of predicted siRNA on non-target genes. Thus the proposed model, OpsiD, can predict optimized siRNA by considering both “inhibition efficiency on target genes and off-target possibility on non-target genes”, with improved inhibition efficiency, specificity and sensitivity. Since we have taken efforts to optimize the siRNA efficacy in terms of “inhibition efficiency and offtarget possibility”, we hope that the risk of “off-target effect” while doing gene silencing in various bioinformatics fields can be overcome to a great extent. These findings may provide new insights into cancer diagnosis, prognosis and therapy by gene silencing. The approach may be found useful for designing exogenous siRNA for therapeutic applications and gene silencing techniques in different areas of bioinformatics.

Rezentralisierung: Server-Based Computing in der Praxis einer Universitätsbibliothek

Der Beitrag beschreibt die Ein- und Durchführung einer Server-basierten Computerinfrastruktur in einer Universitätsbibliothek. Beschrieben wird das so genannte MetaFrame-DV-Konzept der Universitätsbibliothek Kassel, das das dortige Informationsmanagement in den letzten vier Jahren initiiert, konzipiert und umgesetzt hat. Hierbei werden nunmehr nicht mehr nur Applikationsserver z.B. für das CD-Angebot eingesetzt, sondern sämtliche ca. 200 Mitarbeiter- und Funktionsarbeitsplätze über eine Citrix MetaFrame-Installation serverseitig betreut. Besonderes Augenmerk gilt in diesem Beitrag der Konfiguration, der praktischen Administration und den täglichen Arbeitsbedingungen an den Bibliotheksmitarbeiterarbeitsplätzen.

A User-Centric Perspective on Parallel Programming with Focus on OpenMP

The process of developing software that takes advantage of multiple processors is commonly referred to as parallel programming. For various reasons, this process is much harder than the sequential case. For decades, parallel programming has been a problem for a small niche only: engineers working on parallelizing mostly numerical applications in High Performance Computing. This has changed with the advent of multi-core processors in mainstream computer architectures. Parallel programming in our days becomes a problem for a much larger group of developers. The main objective of this thesis was to find ways to make parallel programming easier for them. Different aims were identified in order to reach the objective: research the state of the art of parallel programming today, improve the education of software developers about the topic, and provide programmers with powerful abstractions to make their work easier. To reach these aims, several key steps were taken. To start with, a survey was conducted among parallel programmers to find out about the state of the art. More than 250 people participated, yielding results about the parallel programming systems and languages in use, as well as about common problems with these systems. Furthermore, a study was conducted in university classes on parallel programming. It resulted in a list of frequently made mistakes that were analyzed and used to create a programmers' checklist to avoid them in the future. For programmers' education, an online resource was setup to collect experiences and knowledge in the field of parallel programming - called the Parawiki. Another key step in this direction was the creation of the Thinking Parallel weblog, where more than 50.000 readers to date have read essays on the topic. For the third aim (powerful abstractions), it was decided to concentrate on one parallel programming system: OpenMP. Its ease of use and high level of abstraction were the most important reasons for this decision. Two different research directions were pursued. The first one resulted in a parallel library called AthenaMP. It contains so-called generic components, derived from design patterns for parallel programming. These include functionality to enhance the locks provided by OpenMP, to perform operations on large amounts of data (data-parallel programming), and to enable the implementation of irregular algorithms using task pools. AthenaMP itself serves a triple role: the components are well-documented and can be used directly in programs, it enables developers to study the source code and learn from it, and it is possible for compiler writers to use it as a testing ground for their OpenMP compilers. The second research direction was targeted at changing the OpenMP specification to make the system more powerful. The main contributions here were a proposal to enable thread-cancellation and a proposal to avoid busy waiting. Both were implemented in a research compiler, shown to be useful in example applications, and proposed to the OpenMP Language Committee.

Computing Generators of Free Modules over Orders in Group Algebras

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

Das Internet und die Leugnung des Holocaust

Der Nationalsozialismus und damit auch der Holocaust gilt als die am besten erforschte Periode der deutschen Geschichte. Unzählige Berichte und Dokumente belegen den Völkermord an den europäischen Juden und ermöglichen so ein genaues und detailliertes Bild der Vorgänge. Trotz der sehr guten Quellenlage behaupten Holocaustleugner, dass es sich bei der Shoah um eine Inszenierung handele oder dass die geschätzten Opferzahlen als maßlose Übertreibung zurückzuweisen seien. Die vorliegende Studie untersucht, wie Holocaustleugner argumentieren und mit welchen Manipulationstechniken sie historische Tatsachen verfälschen. Im Zentrum stehen dabei propagandistische Texte im Internet, dem Medium, welches gegenwärtig als häufigster Verbreitungskanal für holocaustleugnende Propaganda genutzt wird. Um aktuelle Tendenzen deutlich zu machen und um Brüche und Kontinuitäten herauszuarbeiten, werden jüngste Internet-Publikationen mit Printmedien aus den 1970er und 1980er Jahren verglichen. Die Analyse macht dabei deutlich, dass sich holocaustleugnende Argumentationsmuster mit der „digitalen Revolution“ gewandelt haben und die Protagonisten der Szene sich auf neue Zielgruppen einstellen. Während frühe Printmedien vor allem für einen begrenzten Kreis einschlägig Interessierter publiziert wurden, haben Holocaustleugner heute die Gesamtheit der Internet-Nutzer als Zielgruppe erkannt. Vor diesem Hintergrund wandeln sich die Verschleierungstaktiken und Täuschungsmanöver, auch aber der Habitus der Texte. Argumentierten die Autoren in früheren Veröffentlichungen oftmals offensiv und radikal, konzentrieren sie sich gegenwärtig auf moderatere Argumentationsmuster, die darauf abzielen, die Shoah zu trivialisieren und zu minimieren. Derartige Propagandaformen sind kompatibler mit dem politischem Mainstream, weil sie weniger verschwörungstheoretisch angelegt sind und ihr antisemitisches Motiv besser verbergen können. Radikale Holocaustleugnung, die behauptet, der gesamte wissenschaftliche Erkenntnisbestand zur Shoah sei ein Phantasiegebilde, findet sich seltener im Internet. Häufiger wird eine „Nadelstich-Taktik“ verfolgt, die einzelne Detailaspekte aufgreift, in Frage stellt oder zu widerlegen vorgibt. Diese Angriffe sollen ihre Wirkung nicht für sich entfalten, sondern in der Summe suggerieren, dass die Tatsachenbasis des Holocaust durchaus hinterfragenswert sei.

Informática e internet : herramientas útiles en un aula de Primaria.

Se presenta memoria final de proyecto educativo que propone la organización de un rincón de informática en un aula de primaria para su uso en diversas áreas de conocimiento y en actividades con el hogar del pensionista. Se realiza en el CEIP Reina de los Ángeles en Jimena de la Frontera, Cádiz. Los objetivos son: potenciar la relación existente entre la práctica docente y las nuevas tecnologías; mejorar los materiales informáticos existentes en el aula; utilizar prácticamente las tecnologías de la comunicación como recurso educativo; propiciar un aprendizaje interactivo; utilizar las NNTT como herramienta y recurso en el proceso de enseñanza-aprendizaje; introducción al alumnado en el mundo de la red de redes e iniciarlos en su utilización; dar respuesta a distintas situaciones de aprendizaje que se producen en el aula; potenciar la pro-acción como elemento colaborador de la práctica docente; poner en marcha mecanismos que colaboren con la atención a la diversidad desarrollada en el aula; desarrollar el espíritu de cooperación entre el alumnado; interrelacionar al alumnado con el de otros centros; aproximar el mundo de las personas de la tercera edad al del alumnado para transmitir conocimientos y experiencias; conseguir un aprendizaje autónomo del alumnado a base de plantear trabajos de enseñanza a las personas de la tercera edad; trasladar al aula el aprendizaje que se pueda obtener de las experiencias de las personas adultas utilizando algunas herramientas informáticas.

Compartir y mantener información a través de Internet como recurso para la resolución de problemas tecnológicos.

El proyecto pretende aplicar los contenidos de informática a la Tecnología, creando una base de datos que estaría disponible en Internet, con la información necesaria para resolver proyectos tecnológicos: materiales, estructura, electricidad, dibujo, etc. y ejemplos de proyectos terminados.

Informática e internet aplicados al aula.

Se trata de un proyecto que se enmarca en el PLAN REDAULA y pretenden optimizar el uso de la dotación informática recibida; tratan de incorporarse, de la forma más efectiva, al uso de las TICs y de incorporarlas al currículum buscando mejorar la práctica educativa del centro.

Evaluación continua para alumnos enfermos por medio de internet.

Facilitar la escolarización de un alumno enfermo, que no puede asistir al centro educativo desde primero de ESO, mediante asistencia educativa virtual, desarrollando materiales en soporte digital, estableciendo la comunicación virtual alumno-profesorado y alumno-compañeros y compañeras del grupo de referencia y de otros de niveles superiores, a través de la red, mediante webcam y además haciendo intervenciones domiciliarias.