Jörg Denzinger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jörg Denzinger has a total of 115 co-authors. Here are the top co-authors by number of shared publications:
Bernhard Bauer
8 shared publicationsHolger Kasinger
8 shared publications- Robert J. Walker
University of Calgary
6 shared publications Rylan Cottrell
Dept. of Computer Science, University of Calgary, AB, Canada
5 shared publicationsChristian Jacob
Dept. of Computer Science, University of Calgary, Alberta, Canada T2N 1N4
4 shared publications- Frank Maurer
Department of Computer Science, University of Calgary, Calgary, Alberta, Canada
4 shared publications
Latest Publications
- Open Access
- 24 January 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 210
API usage templates via structural generalization
- 24 January 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 210
Open AccessAPI usage templates via structural generalization
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 9-16
Extending the learning shout-ahead architecture with user-defined exception rules – a case study for traffic light controls
We present an extension of the shout-ahead agent architecture that allows for adding human user-defined exception rules to the rules created by the hybrid learning approach for this architecture. The user-defined rules can be added after learning as reaction to weaknesses of the learned rules or learning can be performed with the user-defined rules already in place. We applied the extended shout-ahead architecture and the associated learning to a new application area, cooperating controllers for the traffic lights of intersections. In our experimental evaluations, adding user-defined exception rules to the learned rules for several traffic flow instances increased the efficiency of the resulting controllers substantially compared to just using the learned rules. Performing learning with user-defined exception rules already in place decreased the learning time substantially for all flows, but had mixed results with respect to efficiency. But both variants of adding user-defined exception rules create controllers that are much more flexible than what using the original shout-ahead architecture with its learning is able to create as experiments with variations of flows show.
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 9-16
Extending the learning shout-ahead architecture with user-defined exception rules – a case study for traffic light controls
We present an extension of the shout-ahead agent architecture that allows for adding human user-defined exception rules to the rules created by the hybrid learning approach for this architecture. The user-defined rules can be added after learning as reaction to weaknesses of the learned rules or learning can be performed with the user-defined rules already in place. We applied the extended shout-ahead architecture and the associated learning to a new application area, cooperating controllers for the traffic lights of intersections. In our experimental evaluations, adding user-defined exception rules to the learned rules for several traffic flow instances increased the efficiency of the resulting controllers substantially compared to just using the learned rules. Performing learning with user-defined exception rules already in place decreased the learning time substantially for all flows, but had mixed results with respect to efficiency. But both variants of adding user-defined exception rules create controllers that are much more flexible than what using the original shout-ahead architecture with its learning is able to create as experiments with variations of flows show.
- 17 October 2018
- Published by Springer Nature
- p. 27-39
Extending the Advisor Concept to Deal with Known-Ahead Transportation Tasks
- 17 October 2018
- Published by Springer Nature
- p. 27-39
Extending the Advisor Concept to Deal with Known-Ahead Transportation Tasks
- 25 March 2017
- Published by Springer Nature
- p. 49-65
Focusing Learning-Based Testing Away from Known Weaknesses
- 25 March 2017
- Published by Springer Nature
- p. 49-65
Focusing Learning-Based Testing Away from Known Weaknesses
- 3 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 243-250
Lung nodule detection in CT images using deep convolutional neural networks
Early detection of lung nodules in thoracic Computed Tomography (CT) scans is of great importance for the successful diagnosis and treatment of lung cancer. Due to improvements in screening technologies, and an increased demand for their use, radiologists are required to analyze an ever increasing amount of image data, which can affect the quality of their diagnoses. Computer-Aided Detection (CADe) systems are designed to assist radiologists in this endeavor. Here, we present a CADe system for the detection of lung nodules in thoracic CT images. Our system is based on (1) the publicly available Lung Image Database Consortium (LIDC) and Image Database Resource Initiative (IDRI) database, which contains 1018 thoracic CT scans with nodules of different shape and size, and (2) a deep Convolutional Neural Network (CNN), which is trained, using the back-propagation algorithm, to extract valuable volumetric features from the input data and detect lung nodules in sub-volumes of CT images. Considering only those test nodules that have been annotated by four radiologists, our CADe system achieves a sensitivity (true positive rate) of 78.9% with 20 false positives (FPs) per scan, or a sensitivity of 71.2% with 10 FPs per scan. This is achieved without using any segmentation or additional FP reduction procedures, both of which are commonly used in other CADe systems. Furthermore, our CADe system is validated on a larger number of lung nodules compared to other studies, which increases the variation in their appearance, and therefore, makes their detection by a CADe system more challenging.
- 3 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 243-250
Lung nodule detection in CT images using deep convolutional neural networks
Early detection of lung nodules in thoracic Computed Tomography (CT) scans is of great importance for the successful diagnosis and treatment of lung cancer. Due to improvements in screening technologies, and an increased demand for their use, radiologists are required to analyze an ever increasing amount of image data, which can affect the quality of their diagnoses. Computer-Aided Detection (CADe) systems are designed to assist radiologists in this endeavor. Here, we present a CADe system for the detection of lung nodules in thoracic CT images. Our system is based on (1) the publicly available Lung Image Database Consortium (LIDC) and Image Database Resource Initiative (IDRI) database, which contains 1018 thoracic CT scans with nodules of different shape and size, and (2) a deep Convolutional Neural Network (CNN), which is trained, using the back-propagation algorithm, to extract valuable volumetric features from the input data and detect lung nodules in sub-volumes of CT images. Considering only those test nodules that have been annotated by four radiologists, our CADe system achieves a sensitivity (true positive rate) of 78.9% with 20 false positives (FPs) per scan, or a sensitivity of 71.2% with 10 FPs per scan. This is achieved without using any segmentation or additional FP reduction procedures, both of which are commonly used in other CADe systems. Furthermore, our CADe system is validated on a larger number of lung nodules compared to other studies, which increases the variation in their appearance, and therefore, makes their detection by a CADe system more challenging.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 391-398
Mining game logs to create a playbook for unit AIs
We present a method for mining game logs for plays, sequences of actions for a group of units achieving an objective with a high likelihood and in many logs. The mining moves through a log backwards, identifying states that achieve the objective and taking this state and certain surrounding ones as a play candidate. After filtering out irrelevant information and too costly candidates, we cluster similar candidates and abstract the candidates in large enough clusters into a play. We applied these general ideas to the game Battle for Wesnoth and our evaluation showed that we are able to consistently mine successful plays, some of which are also often applied in logs that were not used for the mining.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 391-398
Mining game logs to create a playbook for unit AIs
We present a method for mining game logs for plays, sequences of actions for a group of units achieving an objective with a high likelihood and in many logs. The mining moves through a log backwards, identifying states that achieve the objective and taking this state and certain surrounding ones as a play candidate. After filtering out irrelevant information and too costly candidates, we cluster similar candidates and abstract the candidates in large enough clusters into a play. We applied these general ideas to the game Battle for Wesnoth and our evaluation showed that we are able to consistently mine successful plays, some of which are also often applied in logs that were not used for the mining.
- 20 June 2015
- Published by Springer Nature
- p. 197-208
GPS Data Interpolation: Bezier Vs. Biarcs for Tracing Vehicle Trajectory
- 20 June 2015
- Published by Springer Nature
- p. 197-208
GPS Data Interpolation: Bezier Vs. Biarcs for Tracing Vehicle Trajectory
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Automated testing for cyber threats to ad-hoc wireless networks
Incremental Adaptive Corrective Learning is a method for testing ad-hoc wireless networks for vulnerabilities that adversaries can exploit. It is based on an evolutionary search for tests that define behaviors for adversary-controlled network nodes. The search incrementally increases the number of such nodes and first adapts each new node to the behaviors of the already existing attackers before improving the behavior of all attackers. Tests are evaluated in simulations and behaviors are corrected to fulfill all protocol induced obligations that are not explicitly targeted for an exploit. In this paper, we substantiate the claim that this is a general method by instantiating it for different vulnerability goals and by presenting an application for cooperative collision avoidance using VANETs. In all those instantiations, the method is able to produce concrete tests that demonstrate vulnerabilities.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Automated testing for cyber threats to ad-hoc wireless networks
Incremental Adaptive Corrective Learning is a method for testing ad-hoc wireless networks for vulnerabilities that adversaries can exploit. It is based on an evolutionary search for tests that define behaviors for adversary-controlled network nodes. The search incrementally increases the number of such nodes and first adapts each new node to the behaviors of the already existing attackers before improving the behavior of all attackers. Tests are evaluated in simulations and behaviors are corrected to fulfill all protocol induced obligations that are not explicitly targeted for an exploit. In this paper, we substantiate the claim that this is a general method by instantiating it for different vulnerability goals and by presenting an application for cooperative collision avoidance using VANETs. In all those instantiations, the method is able to produce concrete tests that demonstrate vulnerabilities.
- 14 September 2014
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 29 (5) , 973-1022
Risk management for self-adapting self-organizing emergent multi-agent systems performing dynamic task fulfillment
- 14 September 2014
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 29 (5) , 973-1022
Risk management for self-adapting self-organizing emergent multi-agent systems performing dynamic task fulfillment
- Open Access
- 12 July 2014
- Published by Association for Computing Machinery (ACM)
- p. 1135-1142
Dynamic multi-dimensional PSO with indirect encoding for proportional fair constrained resource allocation
- 12 July 2014
- Published by Association for Computing Machinery (ACM)
- p. 1135-1142
Open AccessDynamic multi-dimensional PSO with indirect encoding for proportional fair constrained resource allocation