{"title":"On the minimum second Zagreb index of trees with small parameters","authors":"B. Borovićanin, E. Zogic","doi":"10.5937/spsunp2101009b","DOIUrl":"https://doi.org/10.5937/spsunp2101009b","url":null,"abstract":"The second Zagreb index M 2 is one of the oldest vertex-degree-based molecular structure descriptors, introduced in the 1970s. Recently, there has been a great interest in studying extremal graphs that minimize (or maximize) second Zagreb index in different classes of graphs. In this paper, lower bounds on the second Zagreb index of trees with given small parameters such as diameter, matching number and domination number are determined and the extremal trees are characterized, as well.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129785285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A survey on Randić (normalized) incidence energy of graphs","authors":"Altındağ Bozkurt","doi":"10.5937/spsunp2102071b","DOIUrl":"https://doi.org/10.5937/spsunp2102071b","url":null,"abstract":"For a graph G of order n with normalized signless Laplacian eigenvalues g + 1 ≥ g + 2 ≥ ··· ≥ g + n ≥ 0, the Randić (normalized) incidence energy is defined as ' IRE(G) = ∑ n i=1 q g + i . In this paper, we present a survey on the results of IRE (G), especially with emphasis on the properties, bounds and Coulson integral formula of IRE (G).","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123086518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some generalizations of the total irregularity of graphs","authors":"Tamils Reti, Akbar Ali","doi":"10.5937/SPSUNP1901001R","DOIUrl":"https://doi.org/10.5937/SPSUNP1901001R","url":null,"abstract":"A novel concept is outlined by which the total irregularity irrt(G), introduced recently by Abdo and Dimitrov, can be extended. It is demonstrated on examples that starting with this concept several generalized versions of the total irregularity can be established.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133320145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Complex exponential signal angle estimation based on angle invariant combiner","authors":"V. Stankovic","doi":"10.5937/spsunp1902107s","DOIUrl":"https://doi.org/10.5937/spsunp1902107s","url":null,"abstract":"In order to achieve estimation performance limits, we often need to use computationally demanding estimation algorithms and/or signal information of higher order such as cumulants. Our goal is to reduce the computational complexity of angle estimation, and to achieve the Cramer-Rao estimation bound, and the maximum-likelihood signal-to-noise ratio threshold by using iterative estimation where the most computationally demanding processing is done as much as possible in the initialisation step, while in each iteration we require less complex processing. This is achieved by using the angle invariant combinations of signal autocorrelation samples for estimation.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131395178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Earth's shadowing effects by computer algebra","authors":"S. Segan","doi":"10.5937/SPSUNP2001013Q","DOIUrl":"https://doi.org/10.5937/SPSUNP2001013Q","url":null,"abstract":"The short-periodic perturbations of orbits of an artificial satellite due to the radiation pressure during one orbital period are influenced by Earth's shadow. For the semi-analytical theories it is necessary to calculate great number of coefficients. Using computer algebra we have computed them for some of applicable semi-analytical theories.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132730329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Creating a stop word dictionary in Serbian","authors":"U. Marovac, A. Avdić, A. Ljajić","doi":"10.5937/spsunp2101017m","DOIUrl":"https://doi.org/10.5937/spsunp2101017m","url":null,"abstract":"By using natural language processing techniques, it is possible to get a lot of information from the extraction of document topics through mapping of document key words or content-based classification of documents, etc. To get this information, an important step is to separate words that carries informative value in a sentence from those words that do not affect its meaning. By using dictionaries of stop words specific to each natural language, the marking of words that do not carry meaning in the sentence is achieved. This paper presents creating a stop word dictionary in Serbian. The influence of stop words to the text processing is presented on three different data set. It is shown that by using proposed dictionary of Serbian stop words the data set dimension is reduced from 15% to 39%, while the quality of the obtained n-gram language models is improved.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131836450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Machine learning techniques for stock market trends identification","authors":"E. Zolotareva","doi":"10.5937/spsunp1901047z","DOIUrl":"https://doi.org/10.5937/spsunp1901047z","url":null,"abstract":"The research concentrates on recognizing stock markets long-term upward and downward trends. The key results are obtained with the use of gradient boosting algorithms, XGBoost in particular. The raw data is represented by time series with basic stock market quotes with periods labelled by experts as Trend or Flat. The features are then obtained via various data transformations, aiming to catch implicit factors resulting in change of stock direction. Modelling is done in two stages: stage one aims to detect endpoints of tendencies (i.e. \"sliding windows\"), stage two recognizes the tendency itself inside the window. The research addresses such issues as imbalanced datasets and contradicting labels, as well as the need of specific quality metrics to keep up with practical applicability. The model can be used to design an investment strategy though further research in feature engineering and fine calibration is required.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131910769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Recognition and detection with deep learning methods","authors":"Ö. Eskicioğlu, E. Dolicanin, A. Işık, Kuçi Rifai","doi":"10.5937/spsunp2102105e","DOIUrl":"https://doi.org/10.5937/spsunp2102105e","url":null,"abstract":"The method of recognizing traffic signs through image processing has increased in popularity along with advanced driver assistance systems. Drivers may have difficulty reading and detecting traffic signs due to fatigue, weather conditions and speed while driving. In our study, traffic signs rectangular, square, circle and so on. Regardless of the type of different plates seen in the country, even if the correct detection is aimed. By sending the model as a parameter while training, the only thing that needs to be done within the scope of adding a new plate is to retrain our model. Before starting learning, the image was enhanced to improve the performance of the algorithm by using the Contrast Restricted Adaptive Histogram Equation (CLAHE) method in data processing. In our study, results were obtained with 2 deep learning models unlike classical CNN architecture. VGG-16 and Xception deep learning models were compared with each other. SGD and Adam optimization methods were tried for both models and the optimum method was found for our study. Our study has reached an accuracy value of up to 98.38%. The speed performance of our method is sufficient to enable a real-time system implementation in the future. In order to understand the results of our experimental tests in the system to be used, it has been turned into a return parameter and the driver can be integrated with the vehicle regardless of the screen and used with voice assistant or small structures to be added independently of the vehicle.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129992907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Altındağ Bozkurt, I. Milovanovic, M. Matejic, E. Milovanovic
{"title":"On the degree Kirchhoff index of bipartite graphs","authors":"Altındağ Bozkurt, I. Milovanovic, M. Matejic, E. Milovanovic","doi":"10.5937/spsunp2101001b","DOIUrl":"https://doi.org/10.5937/spsunp2101001b","url":null,"abstract":"Let G = (V,E), V = {v1, v2,..., vn}, be a connected graph of order n and size m. Denote by g1 ≥ g2 ≥ ··· ≥ gn-1 > gn = 0 the normalized Laplacian eigenvalues of G. The degree Kirchhoff index is defined as K f * (G) = 2m∑ n-1 i=1 1 gi . In this paper, we obtain some improved lower bounds on the degree Kirchhoff index of bipartite graphs.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122554015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}