Indeks Kromatik Kuat Beberapa Klas Graf

Misal adalah sebuah graf, sebuah pewarnaan-sisi-kuat- pada sebuah graf adalah sebuah fungsi yang memetakan setiap sisi ke sebuah warna, sehingga setiap dua buah sisi yang yang berjarak maksimum dua, mendapat warna yang berbeda, dengan menggunakan paling banyak warna. Minimum warna yang digunakan disebut Indeks kromatik kuat dari graf dan dilambangkan dengan . Pada artikel ini akan ditunjukkan indeks kromati kuat dari Graf Sikel ( , Graf Komplet ( , Graf Bipartit Komplet ( , Graf Pohon, dan Graf Ubur-ubur Kata Kunci: pewarnaan sisi kuat, indeks kromatik kuat, Graf Pohon, Graf Ubur-ubu

Genome Assembly Techniques

Since the publication of the human genome in 2001, the price and the time of DNA sequencing have dropped dramatically. The genome of many more species have since been sequenced, and genome sequencing is an ever more important tool for biologists. This trend will likely revolutionize biology and medicine in the near future where the genome sequence of each individual person, instead of a model genome for the human, becomes readily accessible. Nevertheless, genome assembly remains a challenging computational problem, even more so with second generation sequencing technologies which generate a greater amount of data and make the assembly process more complex. Research to quickly, cheaply and accurately assemble the increasing amount of DNA sequenced is of great practical importance. In the first part of this thesis, we present two software developed to improve genome assemblies. First, Jellyfish is a fast k-mer counter, capable of handling large data sets. k-mer frequencies are central to many tasks in genome assembly (e.g. for error correction, finding read overlaps) and other study of the genome (e.g. finding highly repeated sequences such as transposons). Second, Chromosome Builder is a scaffolder and contig placement software. It aims at improving the accuracy of genome assembly. In the second part of this thesis we explore several problems dealing with graphs. The theory of graphs can be used to solve many computational problems. For example, the genome assembly problem can be represented as finding an Eulerian path in a de Bruijn graph. The physical interactions between proteins (PPI network), or between transcription factors and genes (regulatory networks), are naturally expressed as graphs. First, we introduce the concept of "exactly 3-edge-connected" graphs. These graphs have only a remote biological motivation but are interesting in their own right. Second, we study the reconstruction of ancestral network which aims at inferring the state of ancestral species' biological networks based on the networks of current species

Critical phenomena in complex networks

The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researchers have made important steps toward understanding the qualitatively new critical phenomena in complex networks. We review the results, concepts, and methods of this rapidly developing field. Here we mostly consider two closely related classes of these critical phenomena, namely structural phase transitions in the network architectures and transitions in cooperative models on networks as substrates. We also discuss systems where a network and interacting agents on it influence each other. We overview a wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, k-core percolation, phenomena near epidemic thresholds, condensation transitions, critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks. We also discuss strong finite size effects in these systems and highlight open problems and perspectives.Comment: Review article, 79 pages, 43 figures, 1 table, 508 references, extende

Soundings: the Newsletter of the Monterey Bay Chapter of the American Cetacean Society. 2007

(PDF contains 88 pages.

Dynamic Q-learning and fuzzy CNN based vertical handover decision for integration of DSRC, mmWave 5G and LTE in internet of vehicles (IoV)

Internet of vehicles commonly known as IOV is a newly emerged area which with the help of internet assisted communication provides the support to the vehicles. Due to the access of more than one radio access network, 5G makes the connectivity ubiquitous. Vehicle mobility demands for handover in such heterogeneous networks. Instead of using better technology for long ranges and other types of traffic, the vehicles are using devoted short range communications at short ranges. Commonly, networks for handovers were used to be selected directly or with the available radio access it used to connect automatically. With the help of this, the hand over occurrence now takes places frequently. This paper is based on the incorporation of DSRC, LTE as well as mm Wave on Internet of vehicles which is integrated with the Handover decision making algorithm, Network Selection and Routing. The decision of the handovers is to ensure that if there is any requirement of the vertical handovers using dynamic Q-learning algorithms in which entropy function is used to predict the threshold according to the characteristics of the environment. The network selection process is done using Fuzzy Convolution Neural Network commonly known as FCNN which makes the fuzzy rules by considering the parameters such as strength of its signal, its distance, the density of the vehicle, the type of its data as well the Line of Sight (LoS). V2V chain routing is presented in such a manner that V2V pairs are also selected with the help of jellyfish optimization algorithm considering three metrics – Vehicle metrics, Channel metrics and Vehicle performance metrics. OMNET++ simulator is the software in which system is developed. The performance evaluation is done according to its Handover Success Probability, Handover Failure, Redundant Handover, Mean Throughput, delay and Packet Loss

Estuarine Studies : An Activities Text for Maine Schools

Estuarine Studies : An Activities Text for Maine Schools Fisheries Education Unit #16 - Produced by The Education Division, Department of Marine Resources, State House Station 21, Augusta, Maine 04333-0021. Revised 1990. Printed Under Appropriation No. 3140.3260.https://digitalcommons.usm.maine.edu/me_collection/1047/thumbnail.jp

An Eye for the Invisible: Exploring the Role of Image-Making in Science

This thesis tracks the evolution of filmed and photographed depictions of science, emphasizing in particular their dual existence as empirical research tools and stunning works of art