Institution
Stevens Institute of Technology
Education•Hoboken, New Jersey, United States•
About: Stevens Institute of Technology is a education organization based out in Hoboken, New Jersey, United States. It is known for research contribution in the topics: Cognitive radio & Wireless network. The organization has 5440 authors who have published 12684 publications receiving 296875 citations. The organization is also known as: Stevens & Stevens Tech.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This study reveals that the proposed semantic model vectors representation outperforms-and is complementary to-other low-level visual descriptors for video event modeling, and validates it not only as the best individual descriptor, outperforming state-of-the-art global and local static features as well as spatio-temporal HOG and HOF descriptors, but also as the most compact.
Abstract: We propose semantic model vectors, an intermediate level semantic representation, as a basis for modeling and detecting complex events in unconstrained real-world videos, such as those from YouTube. The semantic model vectors are extracted using a set of discriminative semantic classifiers, each being an ensemble of SVM models trained from thousands of labeled web images, for a total of 280 generic concepts. Our study reveals that the proposed semantic model vectors representation outperforms-and is complementary to-other low-level visual descriptors for video event modeling. We hence present an end-to-end video event detection system, which combines semantic model vectors with other static or dynamic visual descriptors, extracted at the frame, segment, or full clip level. We perform a comprehensive empirical study on the 2010 TRECVID Multimedia Event Detection task (http://www.nist.gov/itl/iad/mig/med10.cfm), which validates the semantic model vectors representation not only as the best individual descriptor, outperforming state-of-the-art global and local static features as well as spatio-temporal HOG and HOF descriptors, but also as the most compact. We also study early and late feature fusion across the various approaches, leading to a 15% performance boost and an overall system performance of 0.46 mean average precision. In order to promote further research in this direction, we made our semantic model vectors for the TRECVID MED 2010 set publicly available for the community to use (http://www1.cs.columbia.edu/~mmerler/SMV.html).
159 citations
••
TL;DR: The authors examine persistence in the conditional variance of U.S. stock returns indexes and show evidence of long memory in high-frequency data, suggesting that models of conditional heteroskedasticity should be made flexible enough to accommodate these empirical findings.
159 citations
••
TL;DR: Some upper bounds on the size of a minimum set of lines which when removed from G increases the domination number and if T is a tree with at least three points then @a(T - v) > @a (T) if and only if @n is in every minimum dominating set of T.
158 citations
••
28 Mar 2005TL;DR: This paper presents an approach to use Bayesian network to model potential attack paths, and calls such graph as "Bayesian attack graph", which provides a more compact representation of attack paths than conventional methods.
Abstract: While computer vulnerabilities have been continually reported in laundry-list format by most commercial scanners, a comprehensive network vulnerability assessment has been an increasing challenge to security analysts Researchers have proposed a variety of methods to build attack trees with chains of exploits, based on which
post-graph vulnerability analysis can be performed The most recent approaches attempt to build attack trees by enumerating all potential attack paths, which are space consuming and result in poor scalability This paper presents an approach to use Bayesian network to model potential attack paths We call such graph as "Bayesian
attack graph" It provides a more compact representation of attack paths than conventional methods Bayesian inference methods can be conveniently used for probabilistic analysis In particular, we use the Bucket Elimination algorithm for belief updating, and we use Maximum Probability Explanation algorithm to compute an optimal subset of attack paths relative to prior knowledge on attackers and attack mechanisms We tested our model on an experimental network Test results demonstrate the effectiveness of our approach
158 citations
••
TL;DR: In this paper, the authors compare the representation capabilities of four rule modeling languages: Simple Rule Markup Language (SRML), the Semantic Web Rules Language (SWRL), the Production Rule Representation (PRR), and the Semantics of Business Vocabulary and Business Rules (SBVR) specification.
157 citations
Authors
Showing all 5536 results
Name | H-index | Papers | Citations |
---|---|---|---|
Paul M. Thompson | 183 | 2271 | 146736 |
Roger Jones | 138 | 998 | 114061 |
Georgios B. Giannakis | 137 | 1321 | 73517 |
Li-Jun Wan | 113 | 639 | 52128 |
Joel L. Lebowitz | 101 | 754 | 39713 |
David Smith | 100 | 994 | 42271 |
Derong Liu | 77 | 608 | 19399 |
Robert R. Clancy | 77 | 293 | 18882 |
Karl H. Schoenbach | 75 | 494 | 19923 |
Robert M. Gray | 75 | 371 | 39221 |
Jin Yu | 74 | 480 | 32123 |
Sheng Chen | 71 | 688 | 27847 |
Hui Wu | 71 | 347 | 19666 |
Amir H. Gandomi | 67 | 375 | 22192 |
Haibo He | 66 | 482 | 22370 |