Works Published in 2011
Displaying works 1 - 20 of 194 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2011 chapter
Android’s Security Framework--Understanding the Security of Mobile Phone Platforms
In Encyclopedia of Cryptography and Security (pp. 34–37). Springer US.
Source: ORCID
Added: January 2, 2024
2011 thesis
Analysis Techniques for Mobile Operating System Security
The Pennsylvania State University.
Source: ORCID
Added: January 2, 2024
2011 report
Seeding a Security-Enhancing Infrastructure for Multi-market Application Ecosystems
Technical report, School of Computer Science, Carleton University, http ….
Source: ORCID
Added: January 2, 2024
2011 chapter
ARP Spoofing
In Encyclopedia of Cryptography and Security (pp. 48–49). Springer US.
Source: ORCID
Added: January 2, 2024
2011 conference paper
A Study of Android Application Security.
USENIX Security Symposium.
Source: ORCID
Added: January 2, 2024
2011 article proceedings
Individual identification based on facial dynamics during expressions using active-appearance-based Hidden Markov Models
Presented at the Gesture Recognition (FG 2011).
Event: Gesture Recognition (FG 2011)
TL;DR:
The hypothesis is that facial dynamics of an individual face could be used as an effective biometric for person identification and the method described here applies Stacked Active Shape Models for automated face detection and labeling, Active Appearance Models for feature extraction, and Hidden Markov Models for data analysis.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: August 13, 2023
2011 journal article
A systematic literature review of actionable alert identification techniques for automated static code analysis
Information and Software Technology, 53(4), 363–387.
Source: ORCID
Added: July 18, 2023
2011 conference paper
Tainted Flow Analysis on e-SSA-Form Programs
Compiler Construction - 20th International Conference, CC 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings, 124–143.
TL;DR:
This paper gives an O(V2) solution to the problem of detecting tainted flow attacks by using Bodik et al.'s extended Static Single Assignment (e-SSA) program representation and shows that this approach tends to outperform the data-flow algorithm for bigger inputs.
(via Semantic Scholar)
link.springer.com (publisher PDF)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(OpenAlex)
Source: ORCID
Added: June 21, 2023
2011 conference paper
NASA Formal Methods - Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings
Ed(s): M. Bobaru, K. Havelund, G. Holzmann & R. Joshi
Source: ORCID
Added: June 21, 2023
2011 conference paper
Fault-localization using dynamic slicing and change impact analysis
26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011), Lawrence, KS, USA, November 6-10, 2011, 520–523.
TL;DR:
The impact of several approaches to ignoring unrelated statements in order to improve the effectiveness of fault-localization tools is evaluated.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2011 conference paper
Compiler Construction - 20th International Conference, CC 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings
Ed(s): J. Knoop
Source: ORCID
Added: June 21, 2023
2011 conference paper
26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011), Lawrence, KS, USA, November 6-10, 2011
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6093623
Ed(s): P. Alexander, C. Pasareanu & J. Hosking
Source: ORCID
Added: June 21, 2023
2011 conference paper
CORAL: Solving Complex Constraints for Symbolic PathFinder
NASA Formal Methods - Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings, 359–374.
TL;DR:
CorAL's heuristic solvers have been designed to deal with mathematical constraints and their heuristics have been improved based on examples from the aerospace domain and this integration significantly broadens the application of Symbolic PathFinder at NASA and in industry.
(via Semantic Scholar)
Source: ORCID
Added: June 21, 2023
2011 journal article
Worst-Case Fair Bin Sort Queuing (WBSQ): An O(1) Worst-Case Fair Scheduler
2011 Ieee International Conference on Communications (Icc).
Contributors: Z. Dwekat, Ieee & G. Rouskas
Source: ORCID
Added: June 21, 2023
2011 journal article
On Optimal Tiered Structures for Network Service Bundles
2011 Ieee Global Telecommunications Conference (Globecom 2011).
Contributors: Ieee, Q. Lv & G. Rouskas
Source: ORCID
Added: June 21, 2023
2011 journal article
Hybrid FRR/p-Cycle MPLS Link Protection Design
2011 Ieee Global Telecommunications Conference (Globecom 2011).
Contributors: C. Cao, Ieee & G. Rouskas
Source: ORCID
Added: June 21, 2023
2011 journal article
Flow Isolation in Optical Networks
2011 18th Ieee Workshop on Local and Metropolitan Area Networks (Lanman).
Contributors: Ieee, G. Rouskas & H. Wang
Source: ORCID
Added: June 21, 2023
2011 journal article
Demonstration of QoS-Aware Video Streaming over a Metro-Scale Optical Network Using a Cross-Layer Architectural Design
2011 Optical Fiber Communication Conference and Exposition (Ofc/Nfoec) and the National Fiber Optic Engineers Conference.
Contributors: I. Baldine, B. Bathula, K. Bergman, C. Chen, R. Dutta, D. Gurkan, C. Lai, D. Majumder
Source: ORCID
Added: June 21, 2023
2011 journal article
A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Subject to Linear Equality Constraints
IEEE Transactions on Neural Networks, 22(12), 1892–1900.
MeSH headings : Algorithms; Computer Simulation; Linear Models; Neural Networks, Computer
TL;DR:
The global convergence of the neural network can be guaranteed even though the objective function is pseudoconvex, and the finite-time state convergence to the feasible region defined by the equality constraints is proved.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: April 1, 2023
2011 article proceedings
Information retrieval from large data sets via multiple-winners-take-all
Presented at the 2011 IEEE International Symposium on Circuits and Systems (ISCAS).
Event: 2011 IEEE International Symposium on Circuits and Systems (ISCAS)
TL;DR:
The results show that the kWTA networks converge faster as the size of the problem grows, which renders them as a promising approach to large-scale data set information retrieval problems.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: April 1, 2023
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
