Nowadays, the location technology in the field of the Intelligent Transformation System (ITS) is used generally. Most of location devices on the cars are low-cost GPS, however, it¡¦s not enough if we want to combine with the safe algorithm. Hence, we present a suit of vehicle collision-avoidance system which combined location technology with Intersection-agent in this thesis. The system uses vehicle sensors and GPS information to calculate in Extend Kalman Filter, in order to get the optimal location information. Furthermore, Map-Matching algorithm is used to match the vehicle location on the right road. As to the driver¡¦s safety, laser range scanner¡¦s data are used in fuzzy algorithm and calculate the safe distance between cars. In the intersection area where accident happened most, we also combine with Intersection-agent system to enhance safety. When moving objects cross through the intersection area, Intersection-agent system would use laser range scanner to find the moving objects¡¦ position and velocity, judging whether they can pass the intersection safely or not. Once it¡¦s not safe, system would send out warning signal to the drivers to brake cars, also, passing the position information to car location system by wireless RS-232 transceiver, to decrease location error and let vehicle¡¦s location precision more accurate. In brief, this thesis combines with vehicle location, wireless transmission, car following warning system and Intersection-agent. And make sure this system we developed can fit in with traffic requirement in many experiments.

In this thesis, we introduce a new class of problems, which we call Optimal Areal Positioning (OAP), and study a special form of these problems. OAPs have important applications in earth observation satellite management, tele-robotics, multi-camera control, and surveillance. In OAP, we would like to find the optimal position of a set of floating geometric objects (targets) on a two-dimensional plane to (partially) cover another set of fixed geometric objects (requests) in order to maximize the total reward obtained from covered parts of requests. In this thesis, we consider the special form of OAP in which targets and requests are parallel axes rectangles and targets are of equal size. A predetermined reward is associated with covering an area unit of each request. Based on the number of target rectangles, we classify rectangular OAP into two categories: Single Target Problem (STP) and Multi-Target Problem (MTP). The structure of MTP can be compared to the planar p-center which is NP-complete, if p is part of the input. In fact, we conjecture that MTP is NP-complete. The existing literature does not contain any work on MTP. The research contributions of this thesis are as follows: We develop new theoretical properties for the solution of STP and devised a new solution approach for it. This approach is based on a novel branch-and-bound (BB) algorithm devised over a reduced solution space. Branching is done using a clustering scheme. Our computational results show that in many cases our approach significantly outperforms the existing Plateau Vertex Traversal and brute force algorithms, especially for problems with many requests appearing in clusters over a large region. We perform a theoretical study of MTP for the first time and prove several theoretical properties for its solution. We have introduced a reduced solution space using these properties. We present the first exact algorithm to solve MTP. This algorithm has a branch-and-bound framework. The reduced solution space calls for a novel branching strategy for MTP. The algorithm has a main branch-and-bound tree with a special structure along with two trees (one for each axis) to store the information required for branching in the main tree in an efficient format. Branching is done using a clustering scheme. We perform computational experiments to evaluate the performance of our algorithm. Our algorithm solves relatively large instances of MTP in a short time.

The problem of dilemma zone protection and red-light-running is especially important in certain rural intersections due to the higher speeds at these intersections and their isolated nature. In addition, the presence of a larger percentage of trucks mean that adequate warning and help need to be given to these truck drivers in order to enable them to stop safely, or proceed through the intersection before the onset of red. To curb any potential danger at such intersections, a Texas Department of Transportation (TxDOT) research project on Advanced Warning for End of Green Phase (AWEGS) at high speed intersections deployed AWEGS at two rural intersection sites ?? Tx 6 @ FM 185 near Waco and US 290 @ FM 577 in Brenham. The deployment of AWEGS involved a Level 1 and a later upgrade to a more efficient Level 2 in Waco. Initial results on red-light-running, even though promising, were expressed as observed red-light-running events per day. These resulting rates did not reflect exposure, and the results also raised some concerns with regards to some increase in red-light-running from Level 1 to Level 2. A more detailed analysis of the red-light-running issue at these two sites is provided in this thesis. The main areas of red-light-running analyses presented here are with respect to the reductions in red-light-running rates for the exposure factors of number of cycles and vehicular volumes, the comparison of day and night RLR rates and the nature of speeds of vehicles running the red light at the intersection in Waco. AWEGS was found to reduce the total red-light-running per exposure factor after its deployment. Both Level 1 and Level 2 AWEGS operations were found to reduce red-light-running by up to 60%. Generally, total red-light-running per exposure factor between Level 1 and Level 2 was found to be about the same. Level 2 had lower daytime red-light-running rates and higher nighttime rates than Level 1. Generally, day rates were found to be higher than night rates for all levels of AWEGS deployment. It is recommended that, to better understand the operational aspects of AWEGS and to improve its operations, more implementation of AWEGS and further tests be done. An automated method to collect and analyze data needs to be developed as well as a means of automatically recording video data for calibration and verification It is also recommended that Level 1 technology be implemented in areas where the Level 2 technology may be either too complex or too expensive.

It is known that the ring of invariants of any two-row group is Cohen-Macaulay. This result inspired the conjecture that the ring of invariants of any two-row group is a complete intersection. In this thesis, we study this conjecture in the case where the ground field is the prime field $\mathbb{F}_p$. We prove that all Abelian reflection two-row $p$-groups have complete intersection invariant rings. We show that all two-row groups with \textit{non-normal} Sylow $p$-subgroups have polynomial invariant rings. We also show that reflection two-row groups with \textit{normal} reflection Sylow $p$-subgroups have polynomial invariant rings. As an interesting application of a theorem of Nakajima about hypersurface invariant rings, we rework a classical result which says that the invariant rings of subgroups of $\text{SL}(2,\,p)$ are all hypersurfaces. In addition, we obtain a result that characterizes Nakajima $p$-groups in characteristic $p$, namely, if the invariant ring is generated by norms, then the group is a Nakajima $p$-group. / Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2009-09-29 15:08:40.705

The logical framework LF and its metalogic Twelf can be used to encode and reason about a wide variety of logics, languages, and other deductive systems in a formal, machine-checkable way. Recent studies have shown that ML-like languages can profitably be extended with a notion of subtyping called refinement types. A refinement type discipline uses an extra layer of term classification above the usual type system to more accurately capture certain properties of terms. I propose that adding refinement types to LF is both useful and practical. To support the claim, I exhibit an extension of LF with refinement types called LFR,work out important details of itsmetatheory, delineate a practical algorithmfor refinement type reconstruction, andpresent several case studies that highlight the utility of refinement types for formalized mathematics. In the end I find that refinement types and LF are a match made in heaven: refinements enable many rich new modes of expression, and the simplicity of LF ensures that they come at a modest cost.

Intersection crashes accounted for 47 percent of the total number of crashes in the State of Georgia from 2000-2005, and as a location where crashes occur, represent the largest number of crash locations in the state. Federal legislation requires states to implement statewide safety plans to reduce fatalities, crashes, and improve safety. Intersections vary in different ways and there are individual factors that can cause an intersection to be safer or more dangerous than another. Acquiring better, uniform, and more updated information with regard to intersection crashes will enable transportation officials to prescribe policies for improving safety in an easier and more expedited manner. This thesis recommends a five-part program for intersection safety that will enable Georgia transportation officials to better analyze, identify, and implement countermeasures at intersections that are determined to be the most hazardous. The plan consists of: 1. Standardized Hazardous Intersection Identification Method 2. Statewide Public Involvement task force 3. Automated Police Crash Reporting Through Improved Technologies 4. Strategic Highway Safety Plan (SHSP) Intersection Safety Strategies (8 State Comparison) 5. Statewide Minimal Intersection Safety Equipment The five parts of this plan lead to a statewide standard method of analyzing intersections based on uniform collection methods and uniform equipment statewide.

Thesis (Ph. D.)--University of Washington, 2006. / Vita. Includes bibliographical references (p. 54-56).

x, 110 p. : ill. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number. / This dissertation examines the existence of the self-intersection local time for a superprocess over a stochastic flow in dimensions d ≤ 3, which through constructive methods, gives a Tanaka like representation. The superprocess over a stochastic flow is a superprocess with dependent spatial motion, and thus Dynkin's proof of existence, which requires multiplicity of the log-Laplace functional, no longer applies. Skoulakis and Adler's method of calculating moments is extended to higher moments, from which existence follows. / Committee in charge: Hao Wang, Co-Chairperson, Mathematics; David Levin, Co-Chairperson, Mathematics; Christopher Sinclair, Member, Mathematics; Huaxin Lin, Member, Mathematics; Van Kolpin, Outside Member, Economics

The aim of this thesis "Directions accounting, their content, intersection and use" is to become familiar with the different directions of accounting, to define their content, to evaluate their intersection and possible use in practice. The theoretical part is devoted to the characterization of twelve accounting directions, which are: financial, managerial, cost, tax, creative, pental, multidimensional, environmental, social, behavioral, fraud and forensic accounting.The practical part deals with relations of accounting directions, their intersections and use of individual directions in practice.

abstract: For autonomous vehicles, intelligent autonomous intersection management will be required for safe and efficient operation. In order to achieve safe operation despite uncertainties in vehicle trajectory, intersection management techniques must consider a safety buffer around the vehicles. For truly safe operation, an extra buffer space should be added to account for the network and computational delay caused by communication with the Intersection Manager (IM). However, modeling the worst-case computation and network delay as additional buffer around the vehicle degrades the throughput of the intersection. To avoid this problem, AIM, a popular state-of-the-art IM, adopts a query-based approach in which the vehicle requests to enter at a certain arrival time dictated by its current velocity and distance to the intersection, and the IM replies yes/no. Although this solution does not degrade the position uncertainty, it ultimately results in poor intersection throughput. We present Crossroads, a time-sensitive programming method to program the interface of a vehicle and the IM. Without requiring additional buffer to account for the effect of network and computational delay, Crossroads enables efficient intersection management. Test results on a 1/10 scale model of intersection using TRAXXAS RC cars demonstrates that our Crossroads approach obviates the need for large buffers to accommodate for the network and computation delay, and can reduce the average wait time for the vehicles at a single-lane intersection by 24%. To compare Crossroads with previous approaches, we perform extensive Matlab simulations, and find that Crossroads achieves on average 1.62X higher throughput than a simple VT-IM with extra safety buffer, and 1.36X better than AIM. / Dissertation/Thesis / Masters Thesis Engineering 2017