نتایج جستجو برای: fadama users group fug

تعداد نتایج: 1171487  

Journal: :The Journal of neuroscience : the official journal of the Society for Neuroscience 2011
Jürgen Hänggi Diana Wotruba Lutz Jäncke

Synesthesia is a perceptual phenomenon in which stimuli in one particular modality elicit a sensation within the same or another sensory modality (e.g., specific graphemes evoke the perception of particular colors). Grapheme-color synesthesia (GCS) has been proposed to arise from abnormal local cross-activation between grapheme and color areas because of their hyperconnectivity. Recently publis...

Journal: :Bussecon Review of Social Sciences (2687-2285) 2019

Journal: :International Journal of Computer Applications 2016

2018
Shachar Lovett

The GM-MDS conjecture of Dau et al. (ISIT 2014) speculates that the MDS condition, which guarantees the existence of MDS matrices with a prescribed set of zeros over large fields, is in fact sufficient for existence of such matrices over small fields. We prove this conjecture.

2012
Fernando Israel Goḿez-Castro Vicente Rico-Ramírez Juan Gabriel Segovia-Hernańdez Salvador Hernańdez-Castro Guillermo Gonzaĺez-Alatorre Mahmoud M. El-Halwagi

New intensified schemes have been recently proposed as an attempt to reduce energy requirements and equipment costs in reaction−separation processes. A design methodology for thermally coupled reactive distillation systems is proposed in this work. To design the columns, a method based on the Fenske−Underwood−Gilliland (FUG) equations is proposed and tested. The FUG equations, the mass and ener...

Journal: :Indian Journal of Pathology and Microbiology 2009

Journal: :Discrete Mathematics 1995
Jean E. Dunbar Frederick C. Harris Sandra Mitchell Hedetniemi Stephen T. Hedetniemi Alice A. McRae Renu C. Laskar

In a graph G = (V; E), a set of vertices S is nearly perfect if every vertex in V ? S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and eecient dominating sets. We say a nearly perfect set S is 1-minimal if for every vertex u in S, the set S ? fug is not nearly perfect. Similarly, a nearly perfect s...

Journal: :IEEE Internet of Things Journal 2022

The current random access (RA) allocation techniques suffer from congestion and high signaling overhead while serving massive machine-type communication (mMTC) applications. To this end, third-generation partnership project introduced the need to use fast uplink grant (FUG) in order reduce latency increase reliability for smart Internet of Things (IoT) applications with strict Quality-of-Servic...

Journal: :TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید