Results 21 to 30 of about 1,658,857 (271)
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2006 An arc in a projective plane whose secants meet some exterior line in the minimum number of points is said to be hyperfocused on that line. Such arcs are related to geometrically based secret sharing schemes. A \(k\)-arc \(\mathcal{K}\) is sharply focused on a line \(\ell\) which is external to \(\mathcal{K}\) if the \({k\choose2}\) secants of ...
Cherowitzo, William E. +1 more
openaire +3 more sources
Arc Discharge–Induced Ignition of Combustibles Placed on a Damaged AC Power Supply Cord
Energies, 2020 One of the major causes of unintentional electrical fires is short circuit of an electrically and/or mechanically damaged alternating power supply cord.
Kiyoto Takenaka +3 more
doaj +1 more source
Investigation of the evolution of arc: Azadegan magmatic rocks, north of Shahrekord, Sanandaj-Sirjan zone [PDF]
پترولوژی, 2021 The magmatic complex of Azadegan, composed of basalt, andesitic basalt, andesite, gabbro and diorite, located 45 km northwest of Shahrekord and in the middle part of the Sanandaj-Sirjan zone..
Maryam Ahankoub +2 more
doaj +1 more source
Discrete Mathematics, 1994 In \(\text{PG}(n,q)\), a \(k\)-arc is a set of \(k\) points such that \(k\geq n+1\) but not \(n+1\) points belong to a hyperplane. A normal rational curve in \(\text{PG}(n,q)\), \(2\leq n\leq q-2\) is a \(q+1\) arc projectively equivalent to the set of points \(\{(1,t, \cdots, t^ n)\mid t\in \text{GF} (q)^ +\}\) where \(\text{GF}(q)^ +\) denotes ...
Storme, L., Thas, J.A.
openaire +2 more sources
Arc-consistency and arc-consistency again [PDF]
Artificial Intelligence, 1994 There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [9] have proposed AC-4, an algorithm with optimal worst-case time complexity. But it has two drawbacks: its space complexity and average time complexity.
openaire +2 more sources
Isomorphism of graph classes related to the circular-ones property [PDF]
, 2012 We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, \Gamma ...
Curtis, Andrew R. +6 more
core +4 more sources
Arc‐Disjoint Cycles and Feedback Arc Sets [PDF]
Journal of Graph Theory, 2013 AbstractIsaak posed the following problem. Suppose T is a tournament having a minimum feedback arc set, which induces an acyclic digraph with a hamiltonian path. Is it true that the maximum number of arc‐disjoint cycles in T equals the cardinality of minimum feedback arc set of T? We prove that the answer to the problem is in the negative.
openaire +2 more sources
A Quantitative Analysis of Sectoral Interrelationship in the Framework of the Structural Path Analysis [PDF]
فصلنامه پژوهشهای اقتصادی ایران, 2004 In this paper we analyze quantitatively the interrelationship between three major sectors of the Iranian economy, viz. agriculture, industry and services.
Ali Asghar Banouei +4 more
doaj
Optimizing the Process of Arc-Spraying To Improve Wear Resistance of Crank Shaft [PDF]
Engineering and Technology Journal, 2011 This research studies the factors effecting on coating produced by electrical arcspraying. The studied variables are applied voltage, wire feed rate and spraying distance.In this investigation used wires made from martinsitic stainless steel to coat the ...
Asmaa Ali Hussein, Abdullah F. Hauier
doaj +1 more source
Fast Arc-Annotated Subsequence Matching in Linear Space [PDF]
, 2010 An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings $P$ and $Q$ the arc-preserving subsequence problem is to determine if $P$ can be obtained ...
D. Harel +10 more
core +3 more sources