abstract in this paper we test two versions of convergence hypothesis namely deterministic or conditional convergence and stochastic or catching up hypothesis using carrion-i-silvestre et al. (2005) stationary test. the results show latin and south american countries (lsa) catching up process toward the usa failed in 1980s and somewhat in 1990s. but in 2000s most of them could lie in convergenc...

Abstract Few-shot learning (FSL) approaches, mostly neural network-based, assume that pre-trained knowledge can be obtained from base (seen) classes and transferred to novel (unseen) classes. However, the black-box nature of networks makes it difficult understand what is actually transferred, which may hamper FSL application in some risk-sensitive areas. In this paper, we reveal a new way perfo...

In Australia, the National Centre for Classification in Health (NCCH) is ultimately responsible for updating ICD-10-AM disease codes and Australian Classification of Health Interventions (ACHI) procedure codes, and the accompanying Australian Coding Standards (ACS). New editions of these publications are released every two years. This article outlines the updating procedure and lists the source...

Shape of granule is one of the important issues in granular computing classification problems and related to the classification accuracy, the number of granule, and the join process of two granules. A bottle up granular computing classification algorithm (BUGrC) is developed in the frame work of fuzzy lattices. Firstly, the granules are represented as 4 shapes, namely hyperdiamond granule, hype...

In statistical classification work, one method of speeding up the process is to use only a small percentage of the total parameter set available. In this paper, we apply this technique both to the classification of malware and the identification of malware from a set combined with cleanware. In order to demonstrate the usefulness of our method, we use the same sets of malware and cleanware as i...

A pass-move and a #-move are local moves on oriented links defined by L.H. Kauffman and H. Murakami respectively. Two links are self pass-equivalent (resp. self #-equivalent) if one can be deformed into the other by pass-moves (resp. #-moves), where non of them can occur between distinct components of the link. These relations are equivalence relations on ordered oriented links and stronger tha...