Search results for: Riad Saraiji

Authors: Riad Saraiji, Scott Sizer, Emily Yance-Houser, Felix Bermejo

Abstract:

The use of a Geographic Information System (GIS) in roadway lighting to show the state of street-lighting and nighttime accident is demonstrated. Geographical maps were generated showing colored streets based on how much of the street's length is illuminated. The night to daytime accidents ratio at intersections were found along with the state of lighting at those intersections. The result is a method to show the state of street-lighting at roads and intersections and a quick guide for decision makers to implement strategies for better street-lighting to reduce night time traffic accidents in a particular district.

Keywords: GIS. Roadway lighting, Traffic Accidents

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2916

Authors: Riad S. Jabri

Abstract:

Pattern matching based on regular tree grammars have been widely used in many areas of computer science. In this paper, we propose a pattern matcher within the framework of code generation, based on a generic and a formalized approach. According to this approach, parsers for regular tree grammars are adapted to a general pattern matching solution, rather than adapting the pattern matching according to their parsing behavior. Hence, we first formalize the construction of the pattern matches respective to input trees drawn from a regular tree grammar in a form of the so-called match trees. Then, we adopt a recently developed generic parser and tightly couple its parsing behavior with such construction. In addition to its generality, the resulting pattern matcher is characterized by its soundness and efficient implementation. This is demonstrated by the proposed theory and by the derived algorithms for its implementation. A comparison with similar and well-known approaches, such as the ones based on tree automata and LR parsers, has shown that our pattern matcher can be applied to a broader class of grammars, and achieves better approximation of pattern matches in one pass. Furthermore, its use as a machine code selector is characterized by a minimized overhead, due to the balanced distribution of the cost computations into static ones, during parser generation time, and into dynamic ones, during parsing time.

Keywords: Bottom-up automata, Code selection, Pattern matching, Regular tree grammars, Match trees.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1268