Musical note onset detection is a building component for several MIR related tasks. The ambiguity in the definition of a note onset and the lack of a standard way to annotate onsets, introduce differences in datasets ...
详细信息
Musical note onset detection is a building component for several MIR related tasks. The ambiguity in the definition of a note onset and the lack of a standard way to annotate onsets, introduce differences in datasets labeling, which in turn makes evaluations of note onset detection algorithms difficult to compare. This paper gives an overview of the parameters influencing the commonly used onset detection evaluation measure, i.e. the F1-score, pointing out a consistently missing parameter which is the overall time shift in annotations. This paper shows how crucial this parameter is in making reported F1-scores comparable among different algorithms and datasets, achieving a more reliable evaluation. As several MIR applications are concerned with the relative location of onsets to each other and not their absolute location, this paper suggests to include the overall time shift as a parameter when evaluating the algorithm performance. Experiments show a strong variability in the reported F1-score and up to 50% increase in the best-case F1-score when varying the overall time shift. Optimizing the time shift turns out to be crucial when training or testing algorithms with datasets that are annotated differently (e.g. manually, automatically, and with different annotators) and especially when using deep learning algorithms.
While extensively explored in text-based tasks, Named Entity Recognition (NER) remains largely neglected in spoken language understanding. Existing resources are limited to a single, English-only dataset. This paper a...
详细信息
The previous approaches have failed to effectually score the language proficiency of a non-native speakers especially in case of non-English languages which are complex and a slight change of pronunciation can alter t...
详细信息
The Bit coin currency is steadily growing in popularity as an alternative to physical currencies. This paper presents an approach for utilizing the Bit coin system for creating permanent messages that are located on c...
详细信息
The Bit coin currency is steadily growing in popularity as an alternative to physical currencies. This paper presents an approach for utilizing the Bit coin system for creating permanent messages that are located on computers worldwide. By manipulating the amount field of Bit coin transactions, messages can be embedded into the Bit coin block chain. This approach was implemented by extending the Bit coin-Qt v0.7.2 application and the source code is freely available.
In this paper we utilize Bayesian modeling and inference to learn a softmax classification model which performs Supervised Classification and Active Learning. For p p-priors are used to impose sparsity on the adaptive...
详细信息
With the advent and rapid spread of microblogging services, web information management finds a new research topic. Although classical information retrieval methods and techniques help search engines and services to pr...
详细信息
Recently, the Internet of Things (IoT) has gained widespread popularity, yet its security remains a critical challenge due to the massive amount of information generated by connected devices. While encryption algorith...
详细信息
ISBN:
(数字)9798350350265
ISBN:
(纸本)9798350350272
Recently, the Internet of Things (IoT) has gained widespread popularity, yet its security remains a critical challenge due to the massive amount of information generated by connected devices. While encryption algorithms are commonly employed to protect this information, they are susceptible to various attacks. This paper introduces a novel encryption method to enhance data security in the Consumer IoT domain. The proposed approach combines DNA-inspired encryption with blockchain technology. The DNA encryption algorithm is utilized for the primary encryption phase, followed by the secure handling of encrypted data using blockchain. To evaluate the proposed scheme, a comparison is made with traditional techniques such as RSA, DNA, and a hybrid of both, considering encryption and decryption times. Simulations are conducted using MATLAB software, and an analytical study is performed to assess the performance of the suggested scheme.
Cache management is an important component in any network and it has even more importance in the Future Internet Architectures (FIAs) including Named Data Networking (NDN), because the caches play the key role in redu...
Cache management is an important component in any network and it has even more importance in the Future Internet Architectures (FIAs) including Named Data Networking (NDN), because the caches play the key role in reducing the overall network latency and scalability. In this paper, we discuss the functionality of cache management in NDN, its types as well as its importance for the NDN architecture. In addition, we propose a machine learning-empowered cache management and interests predication for NDN to only preserve the cache only to the secure and really needed data. Our proposal uses Apriori algorithm which is supervised learning algorithm to find the association rules and then to recommend the next requested data. Implementation and experiments on real data traffic depicted that the network’ performance and its influence on the cache increased by 3.2% for two content store sizes of 20 and 40 MB. In addition, a larger cache size of 80 MB shows an increase of the cache hit ratio reaching 90% and hence, clearly reducing the network latency.
We study mathematical models and discuss optimization algorithms for the dimensioning of 3G multimedia networks. We propose two models which aims at dimensioning networks with both a radio and a core component. The fi...
详细信息
We study mathematical models and discuss optimization algorithms for the dimensioning of 3G multimedia networks. We propose two models which aims at dimensioning networks with both a radio and a core component. The first one is an anticipative one in which we assume that we know a priori the traffic over the planning period and the dimensioning is defined with a best possible call admission control procedure. The second one is a causal one in which we define an explicit call admission control procedure which makes the accept/reject decisions without any knowledge on the forthcoming traffic. We then compare, on an experimental basis, the dimensioning obtained by both models on some multi-service networks.
暂无评论