Alexander Borgida
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
Alexander Borgida has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- John Mylopoulos
University of Ottawa, Ottawa, Canada
5 shared publications Amélie Marian
Rutgers University
2 shared publications- Amélie Marian
Rutgers University
2 shared publications - Daniela Vianna
Dept. of Computer Science Rutgers University New Jersey USA
2 shared publications - Jennifer Horkoff
University of Gothenburg, Gothenburg, Sweden
2 shared publications - John Mylopoulos
Department of Information Engineering and Computer Science University of Trento Italy
2 shared publications
Latest Publications
- 21 October 2024
- Published by Springer Nature
- p. 215-234
Modeling and Reasoning About Explanation Requirements Using Goal Models
- 21 October 2024
- Published by Springer Nature
- p. 215-234
Modeling and Reasoning About Explanation Requirements Using Goal Models
- Open Access
- 19 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 187-196
One of Us: a Multiplayer Web-based Game for Digital Evidence Acquisition of Scripts through Crowdsourcing
- 19 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 187-196
Open AccessOne of Us: a Multiplayer Web-based Game for Digital Evidence Acquisition of Scripts through Crowdsourcing
- 29 October 2020
- Published by Springer Nature
- p. 3-18
A Refinement Calculus for Requirements Engineering Based on Argumentation Theory
- 29 October 2020
- Published by Springer Nature
- p. 3-18
A Refinement Calculus for Requirements Engineering Based on Argumentation Theory
- 12 March 2020
- Published by Springer Nature in Requirements Engineering
- Vol. 26 (1) , 1-23
A retrospective on Telos as a metamodeling language for requirements engineering
- 12 March 2020
- Published by Springer Nature in Requirements Engineering
- Vol. 26 (1) , 1-23
A retrospective on Telos as a metamodeling language for requirements engineering
- 1 June 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 90-109
Initial Steps Towards a Family of Regular-Like Plan Description Logics
- 1 June 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 90-109
Initial Steps Towards a Family of Regular-Like Plan Description Logics
- Open Access
Searching Heterogeneous Personal Digital Traces
Digital traces of our lives are now constantly produced by various connected devices, internet services and interactions. Our actions result in a multitude of heterogeneous data objects, or traces, kept in various locations in the cloud or on local devices. Users have very few tools to organize, understand, and search the digital traces they produce. We propose a simple but flexible data model to aggregate, organize, and find personal information within a collection of a user's personal digital traces. Our model uses as basic dimensions the six questions: what, when, where, who, why, and how. These natural questions model universal aspects of a personal data collection and serve as unifying features of each personal data object, regardless of its source. We propose indexing and search techniques to aid users in searching for their past information in their unified personal digital data sets using our model. Experiments performed over real user data from a variety of data sources such as Facebook, Dropbox, and Gmail show that our approach significantly improves search accuracy when compared with traditional search tools.
Open AccessSearching Heterogeneous Personal Digital Traces
Digital traces of our lives are now constantly produced by various connected devices, internet services and interactions. Our actions result in a multitude of heterogeneous data objects, or traces, kept in various locations in the cloud or on local devices. Users have very few tools to organize, understand, and search the digital traces they produce. We propose a simple but flexible data model to aggregate, organize, and find personal information within a collection of a user's personal digital traces. Our model uses as basic dimensions the six questions: what, when, where, who, why, and how. These natural questions model universal aspects of a personal data collection and serve as unifying features of each personal data object, regardless of its source. We propose indexing and search techniques to aid users in searching for their past information in their unified personal digital data sets using our model. Experiments performed over real user data from a variety of data sources such as Facebook, Dropbox, and Gmail show that our approach significantly improves search accuracy when compared with traditional search tools.
- 1 January 2019
- Published by Springer Nature
- p. 19-31
Description Logics and Specialization for Structured BPMN
- 1 January 2019
- Published by Springer Nature
- p. 19-31
Description Logics and Specialization for Structured BPMN
- 1 January 2019
- Published by Wiley in Proceedings of the Association for Information Science and Technology
- Vol. 56 (1) , 276-285
Searching heterogeneous personal digital traces
Digital traces of our lives are now constantly produced by various connected devices, internet services and interactions. Our actions result in a multitude of heterogeneous data objects, or traces, kept in various locations in the cloud or on local devices. Users have very few tools to organize, understand, and search the digital traces they produce. We propose a simple but flexible data model to aggregate, organize, and find personal information within a collection of a user's personal digital traces. Our model uses as basic dimensions the six questions: what, when, where, who, why, and how. These natural questions model universal aspects of a personal data collection and serve as unifying features of each personal data object, regardless of its source. We propose indexing and search techniques to aid users in searching for their past information in their unified personal digital data sets using our model. Experiments performed over real user data from a variety of data sources such as Facebook, Dropbox, and Gmail show that our approach significantly improves search accuracy when compared with traditional search tools.
- 1 January 2019
- Published by Wiley in Proceedings of the Association for Information Science and Technology
- Vol. 56 (1) , 276-285
Searching heterogeneous personal digital traces
Digital traces of our lives are now constantly produced by various connected devices, internet services and interactions. Our actions result in a multitude of heterogeneous data objects, or traces, kept in various locations in the cloud or on local devices. Users have very few tools to organize, understand, and search the digital traces they produce. We propose a simple but flexible data model to aggregate, organize, and find personal information within a collection of a user's personal digital traces. Our model uses as basic dimensions the six questions: what, when, where, who, why, and how. These natural questions model universal aspects of a personal data collection and serve as unifying features of each personal data object, regardless of its source. We propose indexing and search techniques to aid users in searching for their past information in their unified personal digital data sets using our model. Experiments performed over real user data from a variety of data sources such as Facebook, Dropbox, and Gmail show that our approach significantly improves search accuracy when compared with traditional search tools.
- 21 October 2017
- Published by Springer Nature
- p. 273-280
Semantic Modeling and Inference with Episodic Organization for Managing Personal Digital Traces
- 21 October 2017
- Published by Springer Nature
- p. 273-280
Semantic Modeling and Inference with Episodic Organization for Managing Personal Digital Traces
- Open Access
Desiree: a Refinement Calculus for Requirements Problems
The requirements elicited from stakeholders are typically informal, incomplete, ambiguous, and inconsistent. It is the task of Requirements Engineering to transform them into an eligible (formal, sufficiently complete, unambiguous, consistent, modifiable and traceable) requirements specification of functions and qualities that the system-to-be needs to operationalize. To address this requirements problem, we have proposed Desiree, a requirements calculus for systematically transforming stakeholder requirements into an eligible specification. In this paper, we define the semantics of the concepts used to model requirements, and that of the operators used to refine and operationalize requirements. We present a graphical modeling tool that supports the entire framework, including the nine concepts, eight operators and the transformation methodology. We use a Meeting Scheduler example to illustrate the kinds of reasoning tasks that we can perform based on the given semantics.
Open AccessDesiree: a Refinement Calculus for Requirements Problems
The requirements elicited from stakeholders are typically informal, incomplete, ambiguous, and inconsistent. It is the task of Requirements Engineering to transform them into an eligible (formal, sufficiently complete, unambiguous, consistent, modifiable and traceable) requirements specification of functions and qualities that the system-to-be needs to operationalize. To address this requirements problem, we have proposed Desiree, a requirements calculus for systematically transforming stakeholder requirements into an eligible specification. In this paper, we define the semantics of the concepts used to model requirements, and that of the operators used to refine and operationalize requirements. We present a graphical modeling tool that supports the entire framework, including the nine concepts, eight operators and the transformation methodology. We use a Meeting Scheduler example to illustrate the kinds of reasoning tasks that we can perform based on the given semantics.