Alexandru Bobe

Dr. Alexandru Bobe

Mathematics and Computer Science, Ovidius University of Constanta, Constanţa, Romania
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2009 in Historia Mathematica
Verified
Journal Article
Closed access
AAAlfonso F. Agnew
Alfonso F. Agnew
Alexandru BobeAlexandru Bobe
Alexandru Bobe
WBWladimir G. Boskoff
Wladimir G. Boskoff
BSBogdan D. Suceavă
Bogdan D. Suceavă

30 March 2021 in Continuum Mechanics and Thermodynamics
Verified
Journal Article
Closed access
PDF file
ANAdrian Eracle Nicolescu
Adrian Eracle Nicolescu
Alexandru BobeAlexandru Bobe
Alexandru Bobe

1 January 2010 in The Mathematica Journal
Verified
Journal Article
Open access
AAAlfonso Agnew
Alfonso Agnew
Alexandru BobeAlexandru Bobe
Alexandru Bobe
WBWladimir Boskoff
Wladimir Boskoff
BSBogdan Suceava
Bogdan Suceava

1 November 2015 in Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Verified
Journal Article
Open access
PDF file
Alexandru BobeAlexandru Bobe
Alexandru Bobe
ANAurelian Nicola
Aurelian Nicola
CPConstantin Popa
Constantin Popa
In an earlier paper [J. of Appl. Math. and Informatics, 29(3-4)(2011), 697-712] we proposed a general projection-type algorithm with corrections and proved its convergence under a set of special assumptions. In this paper we prove convergence of this algorithm under a much weaker set of assumptions. This new framework gives us the possibility to obtain as a particular case of our method the two-step algorithm analysed in [B I T, 38(2)(1998), 275-282].

28 May 2025 in Electronics
Verified
Journal Article
Open access
PDF file
Dragoş Florin SburlanDragoş Florin Sburlan
Dragoş Florin Sburlan
Cristina SburlanCristina Sburlan
Cristina Sburlan
Alexandru BobeAlexandru Bobe
Alexandru Bobe
In today’s fast-paced technological environment, spotting emerging trends and anticipating future developments are important tasks in strategic planning and business decision-making. However, the volume and complexity of unstructured data containing relevant information make it very difficult for humans to effectively monitor, analyze, and identify inflection points by themselves. In this paper, we aim to prove the potential of integrating large language models (LLMs) with a novel finite state chain machine (FSCM) with output and graph databases to extract insights from unstructured data, specifically from earnings call transcripts of 40 top Technology Sector companies. The FSCM provides a modular, state-based approach for processing texts, enabling entity and relationship recognition. The extracted information is stored in a knowledge graph, further enabling semantic search and entity clustering. By leveraging this approach, we identified over 20,000 hidden (overlapping) trends and topics across various types. Our experiment on real-world datasets confirms the scalability and effectiveness of the method in extracting valuable knowledge from large datasets. The present work contributes to the field of Natural Language Processing (NLP) by showcasing the proposed method in addressing real-world business problems. The findings shed new light on current trends and challenges faced by tech companies, highlighting the potential for further integration with other NLP methods, leading to more robust and effective outcomes.

1 June 2012 in Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Verified
Journal Article
Open access
PDF file
WBWladimir G. Boskoff
Wladimir G. Boskoff
ŞBŞerban Bărcănescu
Şerban Bărcănescu
Alexandru BobeAlexandru Bobe
Alexandru Bobe
Working in the context of Hilbert's axiomatic system, we prove that the Tzitzeica-Johnson configuration has sense in neutral geometry. The elements of a Tzitzeica-Johnson configuration allow us to analyse the Euclidean or the non-Euclidean character of the metric of the plane