2024 article

Taming Smart Contracts With Blockchain Transaction Primitives: A Possibility?

2024 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN, BLOCKCHAIN 2024, pp. 575–582.

By: S. Mansouri n, H. Mohammed n, N. Korchiev n & K. Anyanwu n

author keywords: Smart Contracts; Blockchain Transactions; Analysis
Sources: Web Of Science, NC State University Libraries
Added: November 4, 2024

2023 article

DeMaTO: An Ontology for Modeling Transactional Behavior in Decentralized Marketplaces

2023 IEEE INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WI-IAT, pp. 171–180.

By: S. Mansouri n, V. Samatova n, N. Korchiev n & K. Anyanwu n

author keywords: Blockchain Transactions; Marketplaces; Ontology
TL;DR: This paper proposes an ontology DeMaTO for modeling transactional behavior on blockchains as a foundation for extending blockchain transaction primitives and illustrates how DeMaTO can be used in blockchain transaction modeling and its value with respect to blockchain queryability and transaction validation. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: March 4, 2024

2021 article

Predictive models with end user preference

Zhao, Y., Yang, X., Bolnykh, C., Harenberg, S., Korchiev, N., Yerramsetty, S. R., … Samatova, N. F. (2021, August 26). STATISTICAL ANALYSIS AND DATA MINING, Vol. 8.

By: Y. Zhao n, X. Yang n, C. Bolnykh n, S. Harenberg*, N. Korchiev n, S. Yerramsetty*, B. Vellanki, R. Kodumagulla, N. Samatova n

author keywords: child support; decision tree; predictive model; regularization; relative ranking; user preference
TL;DR: A generic modeling method that respects end user preferences via a relative ranking system to express multi‐criteria preferences and a regularization term in the model's objective function to incorporate the ranked preferences is proposed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Web Of Science, NC State University Libraries
Added: September 7, 2021

2020 article

Efficient Constrained Subgraph Extraction for Exploratory Discovery in Large Knowledge Graphs

2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), pp. 623–630.

By: S. Gao, N. Korchiev n, V. Samatova n & K. Anyanwu n

author keywords: Exploratory Querying; RDF; Knowledge Graphs; Set Constrained Path Queries
TL;DR: This paper proposes a class of constrained subgraph connection structure discovery queries whose specification is only partially structured, which allows more effective querying than using the traditional graph traversal style algorithms, demonstrated by a comparative evaluation. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: July 26, 2021

Employment

Updated: January 19th, 2022 14:46

2022 - 2022

North Carolina State University Raleigh, North Carolina, US
Research Assistant Computer Science

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.