نتایج جستجو برای: malaekeh and badr shakir al

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

2015
Badr Ennaciri Mohamed Kharmaz

Pan African Medical Journal. 2015; 22:234 doi:10.11604/pamj.2015.22.234.7890 This article is available online at: http://www.panafrican-med-journal.com/content/article/22/234/full/ © Badr Ennaciri et al. The Pan African Medical Journal ISSN 1937-8688. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2....

Journal: :Theor. Comput. Sci. 2010
Markus Holzer Andreas Maletti

We improve a recent result [Badr: Hyper-minimization inO(n). Int. J. Found. Comput. Sci. 20, 2009] for hyper-minimized nite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic nite automaton (dfa) an almostequivalent dfa that is as small as possible such an automaton is called hyper-minimal. Here two nite automata are almost-equivalent if and only if the...

2015
Jeffrey S. Wieskopf Jayanti Mathur Walrati Limapichat Michael R. Post Mona Al-Qazzaz Robert E. Sorge Loren J. Martin Dmitri V. Zaykin Shad B. Smith Kelen Freitas Jean-Sebastien Austin Feng Dai Jie Zhang Jaclyn Marcovitz Alexander H. Tuttle Jeff Janes Shakir Al Sharari SamanthaK. Segall Eske K. Aasvang Weike Lai Reinhard Bittner Christopher I. Richards Gary D. Slade Henrik Kehlet John Walker Uwe Maskos Jean-Pierre Changeux Marshall Devor William Maixner Luda Diatchenko Inna Belfer Dennis A. Dougherty Andrew I. Su Sarah C. R. Lummis M. Imad Damaj Henry A. Lester Ardem Patapoutian Jeffrey S. Mogil

Jeffrey S. Wieskopf, Jayanti Mathur, Walrati Limapichat, Michael R. Post, Mona Al-Qazzaz, Robert E. Sorge, Loren J. Martin, Dmitri V. Zaykin, Shad B. Smith, Kelen Freitas, Jean-Sebastien Austin, Feng Dai, Jie Zhang, Jaclyn Marcovitz, Alexander H. Tuttle, PeterM. Slepian, SarahClarke, RyanM.Drenan, Jeff Janes, Shakir Al Sharari, SamanthaK. Segall, Eske K. Aasvang, Weike Lai, Reinhard Bittner, Ch...

Journal: : 2022

Jean-Paul Sartre and Badr Shakir al-Sayyabe are among the most prominent writers that critiqued destructive role of capitalism patriarchal power system in period Post-World War II crisis. Divided into three chapters, present study examines two eminent literary works history Western Eastern societies fifties last decade: Jean Paul Sartre’s play : The Respectful Prostitute Shaker al-Sayyabe’s poe...

2013
Shakir Mohamed Katherine A. Heller Zoubin Ghahramani

1 Partial membership and factor analysis 3 Shakir Mohamed, Katherine A. Heller, and Zoubin Ghahramani 1.

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده زبانهای خارجی 1394

the present research was an attempt to see how quranic lexical collocations were translated into english by two professional translators namely, abdullah yusuf(2005), and muhammad s. shakir(2012). the study attempted qualitatively to shed light on how translators dealt with quranic lexical collocations when transferring them to the target language based on the newmark(1988) model , and quantit...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده ادبیات و علوم انسانی 1389

abstract abstract of thesis (includes summary, goals, execution methods, and results) story “al-obnosat al-bayza” is one of the short stories from “hanna mineh” collection. this story is a selection of lives of some humans during a voyage together, each of them is a symbol of human nature (love, mind, kindness) and examine social, cultural, and political aspects of governing system, and it...

Journal: :CoRR 2018
M. Nikhil Krishnan P. Vijay Kumar

Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit delay-constrained recovery from an erasure burst of length up to B. A recent work by Badr et al. extended this result and introduced a sliding-window channel m...

2009
Markus Holzer Andreas Maletti

We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n logn) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only if...

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

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