Drexel University

Vettd, Inc.

Traffic.com, Inc.

Ali Shokoufandeh

Michael F Buhrmann

William C Regli

Dmitriy Bespalov

Andrew Buhrmann

Jesse Smith

Yakov Keselman

Kurtis Peter Dane

Evan A Sultanik

Scott Haag

The constrained watershed boundary (CWB), defined as a polygon containing all the flow direction grid cells with a surface flow distance less than a user prescribed threshold uses an algorithm that builds upon the HSM algorithm proposed and augments the data structure with a flow distance grid calculated directly from the original flow direction grid.

Watershed marching-delineation algorithm

A microprocessor executable method and system for determining the semantic relatedness and meaning between at least two natural language sources is described in a prescribed context. Portions of natural languages are vectorized and mathematically processed to express relatedness as a calculated metric. The metric is associable to the natural language sources to graphically present the level of relatedness between at least two natural language sources. The metric may be re-determined with algorithms designed to compare the natural language sources with a knowledge data bank so the calculated metric can be ascertained with a higher level of certainty.

Systems and methods to determine and utilize conceptual relatedness between natural language sources

A microprocessor executable method transforms unstructured natural language texts by way of a preprocessing pipeline into a structured data representation of the entities described in the original text. The structured data representation is conducive to further processing by machine methods. The transformation process is learned by a machine learned model trained to identify relevant text segments and disregard irrelevant text segments The resulting structured data representation is refined to more accurately represent the respective entities.

Systems and methods to determine and utilize semantic relatedness between multiple natural language sources to determine strengths and weaknesses

The Location Design and Routing problem asks to find a subset of 'depot' nodes and a spanning forest of a graph such that every connected component in the forest contains at least one depot. This problem arises in a number of both logistical and computer networking problems, for example, in selecting the number and location of distribution centers in vehicle routing networks. This problem is functionally equivalent to that of supernode selection in peer-to-peer networks. A distributed algorithm approximates a solution to this problem that runs in a logarithmic number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, whose solutions are within a factor of 2 of optimal.

Efficient distributed algorithm for the location design and routing problem

A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.

Multi-scale segmentation and partial matching 3D models

Actual traffic conditions of a roadway segment are predicted by providing a plurality of historical roadway condition patterns of the roadway segment in a database, obtaining an electronic representation of a current roadway condition pattern of the roadway segment, identifying one or more of the historical roadway condition patterns that closely matches the current roadway condition pattern, and predicting the future actual traffic conditions of the roadway segment by using the conditions associated with the one or more identified historical patterns.

Growing community of inventors

New Hope, PA, United States of America

Ali Shokoufandeh