Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lisa M. Jackson

dblp:185/6204 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-7463-2989ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 since 2021Theory of computation · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal language classes
bounded languages
0.412019
Freeness properties of weighted and probabilistic automata over bounded languages · Inf. Comput. 2019
Automata and formal languages
probabilistic automata
0.412019
Freeness properties of weighted and probabilistic automata over bounded languages · Inf. Comput. 2019
Automata and formal languages
weighted automata
0.412019
Freeness properties of weighted and probabilistic automata over bounded languages · Inf. Comput. 2019
YearPublicationVenuePosition
2021 Enhancing polymer electrolyte membrane fuel cell system diagnostics through semantic modelling
Eleni Tsalapati, Thomas W. Jackson, Lisa M. Jackson, Derek Low, Ben Davies, Andrew A. West
Expert Syst. Appl.4
2019 Freeness properties of weighted and probabilistic automata over bounded languages
Paul Bell, Shang Chen, Lisa M. Jackson
Inf. Comput.3
2016 Police Officer Dynamic Positioning for Incident Response and Community Presence - Using Maximum Demand Coverage and Kernel Density Estimation to Plan Patrols
abstract
Police Forces are under a constant struggle to provide the best service possible with limited and decreasing resources. One area where service cannot be compromised is incident response. Resources which are \nassigned to incident response must provide attendance to the scene of an incident in a timely manner to protect the public . To ensure the possible demand is met maximum coverage location planning can be used so response officers are located in the most effective position for incident response. This is not the only concern of response officer \npositioning. Location planning must also consider targeting high crime areas, \nhotspots, as an officer presence in these areas can reduce crime levels and hence reduce future demand on the response officers. In this work hotspots are found using quadratic kernel density estimation with historical crime data. These are then used to produce optimal dynamic patrol routes for response \nofficers to follow. Dynamic patrol routes result in reduced response times and reduced crime levels in hotspot areas resulting in a lower demand on response officers.
Johanna Leigh, Lisa M. Jackson, Sarah Dunnett
ICORES2
2016 Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
Paul Bell, Shang Chen, Lisa M. Jackson
LATA3
2016 On the decidability and complexity of problems for restricted hierarchical hybrid systems
Paul Bell, Shang Chen, Lisa M. Jackson
Theor. Comput. Sci.3
2015 Police Response Officer Selection - Development of Tool to Aid the Dispatch of Police Response Officers
Johanna Leigh, Sarah Dunnett, Lisa M. Jackson
ICORES3