نتایج جستجو برای: الگوریتم f5

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

Journal: :Des. Codes Cryptography 2003
Iliya Bouyukliev Juriaan Simonis

We present some results on almost maximum distance separable (AMDS) codes and Griesmer codes of dimension 4 over F5. We prove that no AMDS code of length 13 and minimum distance 5 exists, and we give a classification of some AMDS codes. Moreover, we classify the projective strongly optimal Griesmer codes over F5 of dimension 4 for some values of the minimum distance.

2017
Nir Lipovetzky Hector Geffner

It has been shown recently that heuristic and width-based search can be combined to produce planning algorithms with a performance that goes beyond the state-of-the-art. Such algorithms are based on best-first width search (BFWS), a plain best-first search set with evaluations functions combined lexicographically to break ties, some of which express noveltybased preferences. In BFWS(f5), for ex...

Journal: :Molecular medicine reports 2015
Tae-Ho Kim Seung-Hoon Baek Jeong Ok Lim Sang-Han Lee Shin-Yoon Kim

Osteonecrosis of the femoral head (ONFH) is characterized by the death of the cellular portion of the femoral head due a reduction or disruption in the blood supply. Certain studies have implicated coagulation disorders, including thrombophilia and hypofibrinolysis, in the pathogenesis of ONFH. The factor V (F5) Leiden mutation has been suggested to be a genetic risk factor for venous thromboem...

Journal: :Vision Research 2001
Sérgio S Fukusima Jocelyn Faubert

Visual performance for judging the length of a simultaneously presented pair of radial lines, reciprocally opposed by 180 degrees at a central fixation point, was assessed for 24 radial positions of test lines, for three viewing conditions (binocular, left and right monocular) and five different standard line sizes (1.43-7.13 degrees ). Generally, the results showed underestimation of the test ...

Journal: :The Journal of neuroscience : the official journal of the Society for Neuroscience 2013
Sebastian J Lehmann Hansjörg Scherberger

Voluntary movements are frequently composed of several actions that are combined to achieve a specific behavior. For example, prehension involves reaching and grasping actions to transport the hand to a target to grasp or manipulate it. For controlling these actions, separate parietofrontal networks have been described for generating reaching and grasping actions. However, this separation has b...

2013

Applications running across networks encounter a wide range of performance, security, and availability challenges that can cost organizations an enormous amount in lost productivity, sales, and damage to reputations. F5* addresses these challenges with an intelligent services framework that delivers a set of extensible and programmable application delivery services on the F5 BIG-IP Application ...

Journal: :Journal of biochemistry and molecular biology 2004
Il Hwan Cho Eui Sung Choi Hun Gil Lim Hyung Hoan Lee

The six lumbrokinase fractions (F1 to F6) with fibrinolytic activities were purified from earthworm Lumbricus rubellus lysates using the procedures of autolysis, ammonium sulfate fractionation, and column chromatography. The proteolytic activities on the casein substrate of the six iso-enzymes ranged from 11.3 to 167.5 unit/mg with the rank activity orders of F2 > F1 > F5 > F6 > F3 > F4. The fi...

2017
Valerio Fasano Michael J Ingleson

Lower Lewis acidity boranes demonstrate greater tolerance to combinations of water/strong Brønsted bases than B(C6 F5 )3 , this enables Si-H bond activation by a frustrated Lewis pair (FLP) mechanism to proceed in the presence of H2 O/alkylamines. Specifically, BPh3 has improved water tolerance in the presence of alkylamines as the Brønsted acidic adduct H2 O-BPh3 does not undergo irreversible ...

2001
Steven Willmott Ion Constantinescu Monique Calisti

! " # $ % & ! " ')(* + -,. "/ 0 " # 12 % 31 4 0 # 5 68794" ! : &5 ; < 4 % >=?5" 5@ % BAC ' ' # $1D 8 % ' : 81" ' AC ) 4E F5"' +"'! : 9 D/ G5 " ! % H'I % 53 , F5"') !+"' GAJ (@ K =J 0L"+@ & & M # % 31N G5 ') + ' > ' %(N +@ & O % " 6 P " <AJ (Q E1" $ %'-AC ) 4M 4 C4 0 # ) R(M C (S !1" )=?(@ % T # $U S ! # '<V " AC' $1@ +@ & O % WAC ) 4T X % "/ ; & O % # . ' ( +@ & O % ZY[

2008
Christian Eder

Faugère’s criterion used in the F5 algorithm is still not understand and thus there are not many implementations of this algorithm. We state its proof using syzygies to explain the normalization condition of a polynomial. This gives a new insight in the way the F5 criterion works.

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

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