نتایج جستجو برای: to fan
تعداد نتایج: 10617886 فیلتر نتایج به سال:
Introduction: We have studied a terraced fan deposit centered at 15.0° S, 299.7° E within one of the troughs of Coprates Catena in order to investigate the role that water may have played in its formation. Only a handful of these unique terraced fan deposits have been identified on Mars [1-4], although their small sizes make them difficult to identify with the current data sets. The few fan dep...
Algorithms have been developed for image reconstruction within a region-of-interest (ROI) from fan-beam data less than that required for reconstructing the entire image. However, these algorithms do not admit truncated data. In this work, we investigate exact ROI-image reconstruction from fan-beam data containing truncations by use of the so-called fan-beam backprojection-filtration (BPF) algor...
Understanding why sport fans socially interact with other fans, participate in team-related discussions, recruit new members, and retain membership in sport fan communities is an important issue for sport marketers. In this study, we tested a model of fan community identification that included outcome and moderator variables in the contexts of two major professional sport leagues (soccer and ba...
We generalise the notion of Gröbner fan to ideals in RJtK[x1, . . . , xn] for certain classes of coefficient rings R and give a constructive proof that the Gröbner fan is a rational polyhedral fan. For this we introduce the notion of initially reduced standard bases and show how these can be computed in finite time. We deduce algorithms for computing the Gröbner fan, implemented in the computer...
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who proved that every n-vertex fan-planar drawing has at most 5n − 10 edges, and that this bound is tight for n ≥ 20. We extend their result, both from the combinatorial and the algorithmic point of view. We prove tight bounds on t...
This research focuses on the need for preserving fruits in rural areas to prevent waste. The solar drier is made of vital chambers i.e. the concentrator chamber (that harvests the solar irradiance), the transport pipe (that transports the heat generated by convection) and hanger chamber (where the fruits are placed). The temperature within the concentrator chamber and hanger chamber was monitor...
An inversion formula was developed by Bukhgeim and Kazantsev for attenuated fan-beam projections [Russian Academy of Science Siberian Branch: The Sobolev Institute of Mathematics (2002)]. The inversion formula was obtained by relating the attenuated fan-beam projections to unattenuated fan-beam projections and by trickily processing the unattenuated fan-beam projections. We show in this paper t...
We consider boolean circuits computing n-operators f : {0, 1} n → {0, 1} n. As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operator is linear if it computes n linear forms, that is, computes a matrix-vector product A x over GF (2). We prove the existence of n-operators requiring about n 2 wires in any circuit, and linear n-operators requiring ...
This paper presents a parametrized design technique for cellular permutation arrays based on coset decompositions of symmetric groups. A new type of permutation cell, referred to as a coset generator, is introduced to customize the propagation delay, fan-in, fan-out, and number of edges in the target network. To aid in the design process, a cost function is derived expressing the number of edge...
We show an efficient method for converting a logic circuit of gates with fan-out 1 into an equivalent circuit that works even if some fraction of its gates are short-circuited, i.e., their output is shortcircuited to one of their inputs. Our conversion can be applied to any circuit with fan-in k>= 2, yielding a resilient circuit whose size is polynomial in the size of the (non-resilient) input ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید