In the field of telecommunications and cloud communications, accurately and in real-time detecting whether a human or an answering machine has answered an outbound call is of paramount importance. This problem is of particular significance during campaigns as it enhances service quality, efficiency and cost reduction through precise caller identification. Despite the significance of the field, it remains inadequately explored in the existing literature. This paper presents an innovative approach to answering machine detection that leverages transfer learning through the YAMNet model for feature extraction. The YAMNet architecture facilitates the training of a recurrent-based classifier, enabling real-time processing of audio streams, as opposed to fixed-length recordings. The results demonstrate an accuracy of over 96% on the test set. Furthermore, we conduct an in-depth analysis of misclassified samples and reveal that an accuracy exceeding 98% can be achieved with the integration of a silence detection algorithm, such as the one provided by FFmpeg.

Audio fingerprinting techniques have seen great advances in recent years, enabling accurate and fast audio retrieval even in conditions when the queried audio sample has been highly deteriorated or recorded in noisy conditions. Expectedly, most of the existing work is centered around music, with popular music identification services such as Apple’s Shazam or Google’s Now Playing designed for individual audio recognition on mobile devices. However, the spectral content of speech differs from that of music, necessitating modifications to current audio fingerprinting approaches. This paper offers fresh insights into adapting existing techniques to address the specialized challenge of speech retrieval in telecommunications and cloud communications platforms. The focus is on achieving rapid and accurate audio retrieval in batch processing instead of facilitating single requests, typically on a centralized server. Moreover, the paper demonstrates how this approach can be utilized to support audio clustering based on speech transcripts without undergoing actual speech-to-text conversion. This optimization enables significantly faster processing without the need for GPU computing, a requirement for real-time operation that is typically associated with state-of-the-art speech-to-text tools.

Understanding the concepts related to real function is essential in learning mathematics. To determine how students understand these concepts, it is necessary to have an appropriate measurement tool. In this paper, we have created a web application using 32 items from conceptual understanding of real functions (CURF) item bank. We conducted a psychometric analysis using Rasch model on 207 first-year students. The analysis showed that CURF is a dependable and valid instrument for measuring students’ CURF. The test is uni-dimensional; all items are consistent with the construct and have excellent item fit statistics. The results indicate that the items are independent of each other and unbiased towards the gender and high school background of the students.

Triangulation is a vital concern in computational geometry, and it presents the base in work with complex geometric objects. This issue is utilized in diverse fields, such as terrain modelling, finite element mesh generation, image processing, and computer vision. Constructing triangulated random network models of land contours is a well-known NP-hard problem called Minimum Weight Triangulation (MWT). As it is an NP-hard problem, the time required for an exhaustive search technique proliferates as soon as the number of points on a plane increases. In order to solve this problem, nature-inspired swarm intelligence algorithms are being exploited as efficient optimization techniques. In this paper, we have adapted the recently devised Harris Hawks Optimization (HHO) approach for seeking the minimum-weight triangulation of a planar point set. We have experimented with our adjusted HHO approach on various randomly generated instances of 2D points, and the outcomes indicate that our method is robust. Our approach performs better in almost all cases than other nature-inspired algorithms.

The parameters selection process is a global combinatorial optimization problem which positively affects classification accuracy in many areas of science, especially in artificial intelligence and machine learning. In this paper, we propose a two-stage BA-SVM method, where the recent Bat Algorithm (BA) has been exploited to seek optimal parameters of Support Vector Machines (SVMs) in the first phase of BA-SVM, while the One-Versus-One method has been utilized in the second phase to generate acceptable classification outcomes. The presented method is spread on standard benchmarks and compared with three techniques from the literature. Experiments show that the BA-SVM approach was superior in all cases compared to the classification methods from the literature.

ABSTRACT

Classification problems have been part of numerous real-life applications in fields of security, medicine, agriculture, and more. Due to the wide range of applications, there is a constant need for more accurate and efficient methods. Besides more efficient and better classification algorithms, the optimal feature set is a significant factor for better classification accuracy. In general, more features can better describe instances, but besides showing differences between instances of different classes, it can also capture many similarities that lead to wrong classification. Determining the optimal feature set can be considered a hard optimization problem for which different metaheuristics, like swarm intelligence algorithms can be used. In this paper, we propose an adaptation of hybridized swarm intelligence (SI) algorithm for feature selection problem. To test the quality of the proposed method, classification was done by k-means algorithm and it was tested on 17 benchmark datasets from the UCI repository. The results are compared to similar approaches from the literature where SI algorithms were used for feature selection, which proves the quality of the proposed hybridized SI method. The proposed method achieved better classification accuracy for 16 datasets. Higher classification accuracy was achieved while simultaneously reducing the number of used features.

The vehicle routing problem is one of the most complex problems in the field of combinatorial optimization. Creating optimal routes leads to timely delivery of orders to end customers, which increases the efficiency of the company and enables maximum earnings. The problem of vehicle routing with a series of real-world constraints is called the rich vehicle routing problem (RVRP). The paper presents an approach to solving RVRP, where the asymmetric routing problem with a heterogeneous vehicle fleet, time windows, customer-vehicle constraints and a number of others is observed. The approach solves the problem in two phases, by dividing customers into clusters using a discrete metaheuristic Bat algorithm, and by solving the routing problem for each obtained cluster. The proposed approach has been tested for 26 days of delivery from large warehouses in Bosnia and Herzegovina. Significant savings were achieved compared to previously implemented approaches. All created routes were feasible. The approach automatically creates routes, and gives results in a shorter time than previously used approaches. Time does not increase significantly with the increase in the number of customers, which is a great advantage of the proposed approach.

In this paper we apply the h-generated fuzzy implications to prove a number of results which are of fundamental importance to the theory of fuzzy and vague functional and multivalued dependencies defined on given scheme. Our research is motivated by the fact that some analogous results already hold true for the families of f- and g-generated fuzzy implications, and the fact that these three collections of implications share many similar mutual properties. While some of the aforementioned implications are introduced in order to be applied in approximate reasoning, the results derived in this paper represent the main tool in the process of automation and are also used to complement the resolution principle. More precisely, the main result of this research states that the fact that some fuzzy (vague) relation instance r, |r| = 2, satisfies some fuzzy (vague) functional or fuzzy (vague) multivalued dependency c /∈ C (under assumption that r satisfies some set C of fuzzy (vague) functional and fuzzy (vague) multivalued dependencies), yields that the fuzzy formula attached to c is valid whenever all of the fuzzy formulas attached to the elements of C are valid. What is more important is that the opposite claim is also proven. Its importance stems from the fact that the verification by hand, which means purely theoretical verification, that C implies c is not required anymore. Now, in order to prove that some C yields some c, it is enough to make the use of the resolution principle, and automatically verify whether or not the set of the attached fuzzy formulas yields the fuzzy formula attached to c. In the case of affirmative answer, the desired dependency follows. The research conducted in this paper represent a natural generalization of our previous research since it includes and considers both, fuzzy and vague theories.