Search

Your search keyword '"Soeanu, Andrei"' showing total 41 results
Start Over Author "Soeanu, Andrei"
41 results on '"Soeanu, Andrei"'

9. Introduction

Author

Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, Alawneh, Luay, Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, and Alawneh, Luay

Published
2010
Full Text
View/download PDF

14. Unified Modeling Language

Author

Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, Alawneh, Luay, Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, and Alawneh, Luay

Published
2010
Full Text
View/download PDF

15. Systems Modeling Language

Author

Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, Alawneh, Luay, Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, and Alawneh, Luay

Published
2010
Full Text
View/download PDF

17. Conclusion

Author

Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, Alawneh, Luay, Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, and Alawneh, Luay

Published
2010
Full Text
View/download PDF

25. Optimization of DND Multi-Depot Split-Load Pickup-Delivery Problem

Author

Boukhtouta Abdeslem, Ray Sujoy, Soeanu Andrei, Pall Raman, and Berger Jean

Subjects
Engineering (General). Civil engineering (General), TA1-2040
Abstract

This paper presents a solution approach to optimize vehicle routes for a multi-depot, multi-vehicle, pickup and delivery problem over a large ground transportation network. More precisely, we address ground transportation of orders for the Canadian Department of National Defence using heterogeneous vehicle fleets. The fleets consist of limited number of organizational vehicles hosted at pre-established depots and commercial order delivery services. The proposed approach involves leveraging an insertion cost gradient-descent heuristic followed by a greedy randomized adaptive search procedure. Experimental results generated using the historical orders of the organization indicate that the developed approach is effective in handling a wide range of scenarios and may generate near-optimal vehicle routes with an annual transportation cost reduction between 7.7% and 16.7%.

Published
2019
Full Text
View/download PDF

29. New aspect-oriented constructs for security hardening concerns

Author

Mourad, Azzam, Soeanu, Andrei, Laverdiere, Marc-Andre, and Debbabi, Mourad

Subjects
Algorithm, Algorithms -- Analysis, Algorithms -- Safety and security measures
Abstract

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cose.2009.02.003 Byline: Azzam Mourad, Andrei Soeanu, Marc-Andre Laverdiere, Mourad Debbabi Abstract: In this paper, we present new pointcuts and primitives to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. The two proposed pointcuts allow to identify particular join points in a program's control-flow graph (CFG). The first one is the GAFlow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. The two proposed primitives are called ExportParameter and ImportParameter and are used to pass parameters between two pointcuts. They allow to analyze a program's call graph in order to determine how to change function signatures for passing the parameters associated with a given security hardening. We find these pointcuts and primitives to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing ones can provide their functionalities. Moreover, we show the viability and correctness of the proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the result of explanatory case studies. Author Affiliation: Computer Security Laboratory, Concordia Institute for Information Systems Engineering, Concordia University, Montreal (QC), Canada Article History: Received 18 October 2007; Revised 21 January 2009; Accepted 23 February 2009 Article Note: (footnote) [star] This research is the result of a fruitful collaboration between CSL (Computer Security Laboratory) of Concordia University, DRDC (Defence Research and Development Canada) Valcartier and Bell Canada under the NSERC DND Research Partnership Program.

Published
2009

39. BackMatter.

Author

Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, and Alawneh, Luay

Published
2010

40. FrontMatter.

Author

Debbabi, Mourad, Hassaïne, Fawzi, Jarraya, Yosr, Soeanu, Andrei, and Alawneh, Luay

Published
2010

41. Control Flow Based Pointcuts for Security Hardening Concerns.

Author

Etalle, Sandro, Marsh, Stephen, Laverdière, Marc-André, Mourad, Azzam, Soeanu, Andrei, and Debbabi, Mourad

Abstract

In this paper, we present two new control flow based point-cuts to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. They allow to identify particular join points in a program's control flow graph (CFG). The first proposed primitive is the GAFlow, the closest guaranteed ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second proposed primitive is the GDFlow, the closest guaranteed descendant, which returns the closest child join point that can be reached by all paths starting from the pointcuts of interest. We find these pointcuts to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing pointcuts can provide their functionalities. Moreover, we show the viability and correctness of our proposed pointcuts by elaborating and implementing their algorithms and presenting the results of a testing case study. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results