Implementing Green IT approach for transferring Big Data over Parallel Data Link

The whole research of the current Master Thesis project is related to Big Data transfer over Parallel Data Link and my main objective is to assist the Saint-Petersburg National Research University ITMO research team to accomplish this project and apply Green IT methods for the data transfer system. The goal of the team is to transfer Big Data by using parallel data links with SDN Openflow approach. My task as a team member was to compare existing data transfer applications in case to verify which results the highest data transfer speed in which occasions and explain the reasons. In the context of this thesis work a comparison between 5 different utilities was done, which including Fast Data Transfer (FDT), BBCP, BBFTP, GridFTP, and FTS3. A number of scripts where developed which consist of creating random binary data to be incompressible to have fair comparison between utilities, execute the Utilities with specified parameters, create log files, results, system parameters, and plot graphs to compare the results. Transferring such an enormous variety of data can take a long time, and hence, the necessity appears to reduce the energy consumption to make them greener. In the context of Green IT approach, our team used Cloud Computing infrastructure called OpenStack. It’s more efficient to allocated specific amount of hardware resources to test different scenarios rather than using the whole resources from our testbed. Testing our implementation with OpenStack infrastructure results that the virtual channel does not consist of any traffic and we can achieve the highest possible throughput. After receiving the final results we are in place to identify which utilities produce faster data transfer in different scenarios with specific TCP parameters and we can use them in real network data links.

Role of food safety in procedures adopted for the purchase of minimally processed and fresh vegetables by foodservices

This research was designed to analyze whether the procedures adopted by foodservice establishments for the purchase of minimally processed and fresh vegetables favor the acquisition of safe products. This research investigated the purchasing policies of such establishments, whether self-managed or administered by foodservice contractors, in the municipality of Campinas and its outlying districts. A random sample of thirty-nine establishments participated in the research. The instruments for data collection were pre-tested, and the actual interviews were conducted by trained personnel. Comparative analyses were made using various statistical tests. All of the participating establishments purchase fresh vegetables, although only six of them use minimally processed ones. For most of the establishments, price is at least one of the most important criteria for the selection of a supplier, and they do not normally monitor the safety of the fresh products purchased (51.3%), nor do they make regular technical visits to guarantee quality (46.2%); moreover, most do not carry out a supplier development program. It is suggested that routine technical visits to suppliers should be adopted, as well as the creation of courses, such as those dealing with the safety of vegetables and supplier development, to be offered to foodservices.

Análise da pureza genética e discriminação de cultivares de vinca (Catharanthus roseus (L.) G.Don) usando "random amplified polymorphic DNA" em DNA extraído de sementes e folhas

A técnica "Random Amplified Polymorphic DNA" (RAPD) surgiu como uma ferramenta útil para testar a pureza genética e a discriminação de cultivares em muitas espécies. É uma técnica simples, rápida, relativamente de baixo custo e permite o uso de DNA extraído de sementes secas, o que é muito importante em um programa de análise de sementes. O uso desta tecnologia no teste da pureza genética pode ser muito interessante para algumas espécies, como a vinca (Catharanthus roseus (L.) G.Don), pois pouco se conhece a respeito da seqüência de seu DNA. É interessante, também, pelo fato de existir grande número de "primers" comercialmente disponíveis, que podem ser prontamente utilizados para gerar dados. Essa técnica pode ser mais facilmente utilizada para gerar padrões de bandas polimórficas suficientes para discriminar genótipos diferentes. Todavia, no presente estudo, os padrões RAPD de bandas obtidas de amostras de DNA extraído de sementes de vinca em "bulk" foram não-consistentes, o mesmo ocorrendo com o uso de DNA extraído de sementes individuais de um mesmo cultivar, o que evidencia que a técnica não é aplicável para testar a pureza genética e a discriminação de cultivares de vinca. Entretanto, os padrões de bandas RAPD gerados a partir de DNA extraído de tecido foliar de plântulas foram mais reproduzíveis e poderiam ser considerados na caracterização de cultivares.

Is there a difference in artistic ability between learning -disabled students and "regular-class" students?

Research and practice regarding LO students usually has focussed upon defining and supplementing deficiencies rather than seeking unique talents and capability patterns for learning and expression. This study examined nine dimensions that may constitute artistic or creative talent and compared LDs with "regular-class" students, pair-wise and as groups, for levels and distributions of the dimensions. For 14 LO and 9 "regular-class" elementary-school subjects, both genders, data were taken by direct observation, from a standardized test and assessments by two practicing artists. Assessments by artists were in concord. LOs improved more in "Composition". No other significant class, age or gender-related differences were found.

Job satisfaction and dissatisfaction : comparison of behavioural and regular classroom teachers

Each of the forty Toronto Board of Education behavioural teachers was matched as closely as possible .with a regular cIassroom teacher from the same schooI, 0f the same sex, and teaching approxiately the same age group of chiIdren. A II of these teachers were sent a questionnaire (based on Herzberg's model) whose content reflected various aspects of job satisfaction or dissatisfaction. Demographic data was also gathered to be used in the study for examining correlations between satisfaction and various factors . T 10 additional questions were asked regarding factors that IOU Id influence the i r staying or Ieaving and one question was asked about lIerit pay . Chi Square tests and t-tests were conducted on the results. The majority of each group of teachers was very satisfied with their job while the behavioural teachers were significantly more satisfied than the regular teachers. Intrinsic factors played a more signi ficant role than did extrinsic ones. The demographic factors couId be found to be predictors of job satisfaction or dissatisfaction.

The effectiveness of a multisensory writing program in improving cursive writing ability in children with sensorimotor difficulties

It is estimated that five to ten percent of children experience sensory motor difficulties that result in various learnlng disabilitiies , among them. inabllity to output Information on paper in the appropriate manner (Ayres ,1985). The relationship between sensorimotorabillty and handwriting is well documented in the literature (Freeman,1917; Townsend , 1951; Nlkola-Ll sa, 1987). While much of the literature is inconclusive, there are findings to suggest that muitisensory handwriting programmes are an effective approach to improvlng writing abIlity in these chlldren. For a number of years, Occupational Therapists have been involved in the remediation of handwriting utllizing , amongst other approaches . multisensory programmes. While subjective assessments of effectiveness have been extremerly positive. scientIfic evaluation has been minimal . If further intervention in this area is to occur, it Is essential that the profession be able to justify the existence of such programmes . The purpose of this study was to examine what effects a multlsensory writing prog~am would have on the curslve writing ability of chlldren with sensorimotor dlfficulties. A single case with multiple baselines across be havlours design was used , with the behavlours being cursive writing abilIty of fIve distInct letter groups. The fIve groups were taught in random order, one group every two weeks , In a one-hour session. Repeated measurements of writing speed and qualIty for each letter group were made. This design was repeated over three other cases . Results of the study yielded statistical signifi cance in trend changes In specIfic letter groups for all of the chlldren following interventlon. One child achieved statistical significance In the overall change In quality , while none of the children achieved overall statistical significance In speed score changes . Teacher reports and an assessment of written language prior to and following the program suggest that Intervention may have had a positive effect on self-confidence in written output, and on the maturlty of written expression in some of the cases . Further research in this field is needed to validate the continual use of multisensory writing programmes by Occupational Theraplsts worklng with this specific population and to provide some directlon with regards to the Integration of multlsensory writing programmes within the regular academic remedial programme .

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.

Rings, Group Rings, and Their Graphs

We associate some graphs to a ring R and we investigate the interplay between the ring-theoretic properties of R and the graph-theoretic properties of the graphs associated to R. Let Z(R) be the set of zero-divisors of R. We define an undirected graph ᴦ(R) with nonzero zero-divisors as vertices and distinct vertices x and y are adjacent if xy=0 or yx=0. We investigate the Isomorphism Problem for zero-divisor graphs of group rings RG. Let Sk denote the sphere with k handles, where k is a non-negative integer, that is, Sk is an oriented surface of genus k. The genus of a graph is the minimal integer n such that the graph can be embedded in Sn. The annihilating-ideal graph of R is defined as the graph AG(R) with the set of ideals with nonzero annihilators as vertex such that two distinct vertices I and J are adjacent if IJ=(0). We characterize Artinian rings whose annihilating-ideal graphs have finite genus. Finally, we extend the definition of the annihilating-ideal graph to non-commutative rings.

Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles

The conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph Theory,68(2), October 2011, 169-176], have shown that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cycle, where 3<=j<=5 if i=3 and 4<=j<=6 if i=4. We improve the above mentioned result and prove that every planar graph without an i-cycle adjacent to a j-cycle with3<=j<=5 if i=3 and 4<=j<=5 if i=4 is acyclically 5-choosable.

Edge-choosability of Planar Graphs

According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesis, we discuss a relaxed version of this conjecture that every simple graph G is edge-(∆ + 1)-choosable as by Vizing’s Theorem ∆(G) ≤χ' (G)≤∆(G) + 1. We prove that if G is a planar graph without 7-cycles with ∆(G)≠5,6 , or without adjacent 4-cycles with ∆(G)≠5, or with no 3-cycles adjacent to 5-cycles, then G is edge-(∆ + 1)-choosable.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.