893,576 Hits in 6.5 sec

On set systems determined by intersections

Svatopluk Poljak, Vojtěch Rödl
1981 Discrete Mathematics  
The set syseems determined by intersections are studied and a sufikient cond%ion for this property is &en. For ,w of graphs a necessary and sufficient condition is estakished.  ...  Another example of a set system which is not determined by intersections but the intersection graph of which is u.i. was suggested by Dr.  ...  From our result follows e.g. that almost all systems of k-subsets of rl-set are determined by intersections.  ... 
doi:10.1016/0012-365x(81)90065-0 fatcat:3qoh6jfxpndz5dc3erqgboakx4

The UWB Radar Application in the Aviation Security Systems

Milan Džunda, Peter Dzurovčin, Peter Kaľavský, Peter Korba, Zoltán Cséfalvay, Michal Hovanec
2021 Applied Sciences  
systems.  ...  The article did not examine the accuracy of determining the position of a person behind the obstacle.  ...  finding the intersections of ellipses, we determine the intersections of the ellipses from the TOA times measured by the given set.  ... 
doi:10.3390/app11104556 fatcat:t7uimasai5eqlbbm5x3nsxz6sm

Determination of the Relative Positions of Three Planes: Action Research

Tuba Ada, Aytaç Kurtuluş
2016 Turkish Online Journal of Qualitative Inquiry  
In this stage, the candidate teachers tried to determine the relative positions of the planes in one direction by examining the plane equations in pairs.  ...  In Implementation 2, the candidate teachers were asked to find the solution set of the linear equation system consisting of three equations with three unknowns and to come up with geometric interpretation  ...  each intersected by a third one along straight lines".  ... 
doi:10.17569/tojqi.69714 fatcat:nlwbc5qvpbhwnhl67j4vjsajdu

Most-Intersection of Countable Sets [article]

Ahmet Çevik, Selçuk Topal
2021 arXiv   pre-print
We introduce a novel set-intersection operator called 'most-intersection' based on the logical quantifier 'most', via natural density of countable sets, to be used in determining the majority characteristic  ...  The new operator determines, based on the natural density, the elements which are in 'most' sets in a given collection.  ...  Applications of Most-Intersection One of the many applications of the most-intersection operator concerns the determination of the overall characteristic of infinitely many dynamical systems.  ... 
arXiv:2005.12753v3 fatcat:lv2vygoeuvcknprodlplbpg5wi

The Fine Intersection Problem for Steiner Triple Systems

Yeow Meng Chee, Alan C. H. Ling, Hao Shen
2008 Graphs and Combinatorics  
The intersection of two Steiner triple systems (X,A) and (X,B) is the set A intersect B.  ...  The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that there exist two Steiner triple systems of order v whose  ...  A partial triple system is a 3-uniform set system (X, A) where every 2-subset of X is contained in at most one block of A.  ... 
doi:10.1007/s00373-006-0690-z fatcat:mmgl3j2qx5hulps4h3dxodamz4

SAMATS – Edge Highlighting and Intersection Rating Explained [chapter]

Joe Hegarty, James D. Carswell
2005 Lecture Notes in Computer Science  
Many modeling systems created to date require manual correspondences to be made across the image set in order to determine the models 3D structure.  ...  correspondences by using a set of geo-referenced terrestrial images.  ...  [3] is one of the most robust systems using this approach which allows the user to create models using a set of block primitives and by setting constraints on those primitives.  ... 
doi:10.1007/11568346_33 fatcat:5jx77ysxe5f2xfxbra6dcjh4nq

On the number of databases and closure operations

G. Burosch, J. Demetrovics, G.O.H. Katona, D.J. Kleitman, A.A. Sapozhenko
1991 Theoretical Computer Science  
Estimates on the number of closure operations on n elements (or equivalently, on the number of databases with n attributes) are given. 0304-3975/91/%03.50 @I l991-Elsevier Science Publishers B.V.  ...  Sapoozhenko, On the number of databases and closure operations (Note), Theorehcal Computer S&ace 78 (1991) 377-381. Closure operations are considered as models of databases.  ...  * The work of these authors is supported by the Hunganan National Foundation for Scientific Research, grant number 1066.  ... 
doi:10.1016/0304-3975(91)90359-a fatcat:wkx6tgylnba7fozvsyunyg5vea

Fuzzy Vehicle Control System for Single Intersection

2019 International journal of recent technology and engineering  
Current traffic light system is not able to allot efficient traffic light cycle length to vehicles. It is because of the traffic system is based on the fixed cycle length.  ...  FVCS allots dynamic cycle length signal duration to vehicles based on the present traffic available at the intersection.  ...  The crisp value of fuzzy set is determined by the defuzzification process. The defuzzification process finalizes one value from the resultant fuzzy set.  ... 
doi:10.35940/ijrte.b1085.0782s719 fatcat:gjzh37odtjhx5ffa53txeko3ce

Erdős-Ko-Rado theorems for uniform set-partition systems

Karen Meagher, Lucia Moura
2005 Electronic Journal of Combinatorics  
We conclude with some conjectures on this and other types of intersecting partition systems.  ...  {n-tc \choose c} {n-(t+1)c \choose c} \cdots {n-(k-1)c \choose c}$$ partitions and this bound is only attained by a trivially $t$-intersecting system.  ...  When we set c = 2, our theorems determine a maximal family of 1-regular graphs that pairwise intersect on at least t edges.  ... 
doi:10.37236/1937 fatcat:sinxftgczrajzkyqvz4sjyouny


Q. Wu, H. Zeng
2007 Transactions of the Canadian Society for Mechanical Engineering  
For practical non-smooth robotic systems, due to their complexities, the determination of the intersections of these sets symbolically is extremely difficult if not impossible.  ...  In this paper, we propose a method such that the determinations of the intersections become feasible.  ...  Dans la presente, nous proposons une methode permettant de determiner les intersections.  ... 
doi:10.1139/tcsme-2007-0012 fatcat:hpp4vsaayfabzkwxnf5ab74ucm

A visualization of 3d images by back ray tracing: the geometric approach

D. P. Kucherov, K. O. Morgun, T. I. Golenkovskaya
2016 Electronics and Control Systems  
Time solving this task is determine by time of scene visualization.  ...  In this paper is considering the problem of visualization synthetic images that is one of the most widely known problem in computer graphic.  ...  A) Plane In problem ray-plane intersection (Fig. 1 ), the last subject conveniently represented by coordinate point Q 0 that remote from origin coordinates system and by normal n.  ... 
doi:10.18372/1990-5548.48.11228 fatcat:txj4fnf6tndgdmso2qen2rt3se

Detection Range Setting Methodology for Signal Priority

Peter Koonce, John Ringert, Tom Urbanik, Willie Rotich, Bill Kloos
2002 Journal of Public Transportation  
The implementation of these systems requires engineering studies that address both transit and traffic signal operations.  ...  A significant amount of delay to transit vehicles in urban areas is caused by traffic signals. Implementation of signal priority has the potential to reduce control delay caused by traffic signals.  ...  ., and Tri-Met who in working on the project have made this implementation an enjoyable undertaking.  ... 
doi:10.5038/2375-0901.5.2.6 fatcat:zmfpu2aqezgqxc6htuq6ybrwxq


Muhammad Rozi Malim, Faridah Abdul Halim, Sherey Sufreney Abd Rahman
A simple traffic lights system uses a pre-timed control setting based on the latest traffic data, and the setting could be manually changed.  ...  Traffic signal lights system is a signalling device located an intersection or pedestrian crossing to control the movement of traffic.  ...  It is possible to have more than one set of optimal values. The optimal values are determined by a search area. If the search area gets bigger, the optimal values will be dragged.  ... 
doi:10.24191/mjoc.v4i2.6104 fatcat:soqoymekq5dahd5zjlfd7qrmmu

Semiautomated X-Y-Plotter-Based Method for Measuring Root Lenghts1

W. W. Wilhelm, J. M. Norman, R. L. Newell
1983 Agronomy Journal  
Each determination of root length required 50 sec. The accuracy of the system was comparable to others that are based on the line-intersect technique.  ...  The Newman technique is based on the premise that length of a root system (any set of curved lines) is directly proportional to the number of intersections (N) between the root system and a random direction  ... 
doi:10.2134/agronj1983.00021962007500010039x fatcat:hnfjigmzbfdfxlmgonafelvgiy

Moduli of Parallelogram Tilings and Curve Systems [article]

Drew Reisinger, Matthias Weber
2012 arXiv   pre-print
We determine the topology of the moduli space of periodic tilings of the plane by parallelograms. To each such tiling, we associate combinatorial data via the zone curves of the tiling.  ...  We show that the topological curve systems that arise in this general setting are up to isotopy in one-to-one correspondence with certain simple combinatorial data that encode the intersection pattern  ...  Because the curve system is essential, every such intersection gives a determinant condition.  ... 
arXiv:1212.6535v1 fatcat:e7t5kxwi4zgplde4j7z2lw432u
« Previous Showing results 1 — 15 out of 893,576 results