65 research outputs found

    Chinese literary works translated into Baba Malay: a bibliographical study

    No full text
    Analyses 68 unique titles of Baba translated works published between 1889 and 1950. The titles are held in the libraries of the University of Malaya (UM), Science University Malaysia (USM), National University of Malaysia (UKM), the Dewan Bahasa dan Pustaka (DBP), National University of Singapore (NUS), National Library of Singapore (NLS) and the British Library (BL). The results reveal three periods of active publication of Baba translated works. A total of 18 works were translated before World War I, followed by 10 just after the war, 39 titles were published before the break of the World War II and 1 was identified in 1950. There were 103 persons involved in the 68 translated works, some of whom are responsible for more than one title. The most prominent translators were Chan Kim Boon, Wan Boon Seng, Seow Chin San and Lee Seng Poh. Some of the translators were also be editors, illustrators or editors. There were 31 publishers and 21 printing presses involved, all were located in Singapore. The most active publishers were Wan Boon Seng, Kim Seck Chy Press and Nanyang Romanised Malay Book Co. The translated works mainly cover historical classical Chinese stories, chivalrous stories, romances, folklore and legends. The titles were priced between 10 cents to 2 dollars in Straits currency. The University of Malaya Library held the largest number of unique title (62) out of which 15 were unique titles

    Design of switched reluctance motor for EV traction drive

    No full text
    Design of switched reluctance motor for EV traction driv

    Learning HMM State Sequences from Phonemes for Speech Synthesis

    No full text
    AbstractThis paper presents a technique for learning hidden Markov model (HMM) state sequences from phonemes, that combined with modified discrete cosine transform (MDCT), is useful for speech synthesis. Mel-cepstral spectral parameters, currently adopted in the conventional methods as features for HMM acoustic modeling, do not ensure direct speech waveforms reconstruction. In contrast to these approaches, we use an analysis/synthesis technique based on MDCT that guarantees a perfect reconstruction of the signal frame feature vectors and allows for a 50% overlap between frames without increasing the data rate. Experimental results show that the spectrograms achieved with the suggested technique behave very closely to the original spectrograms, and the quality of synthesized speech is conveniently evaluated using the well known Itakura-Saito measure

    A bibliometric analysis of the last ten years of fuzzy min-max neural networks

    No full text
    Neural networks have been widely used in many application areas such as power systems, weather forecasting, face recognition, behaviour analysis, fingerprint identification, healthcare, fault detection, flood monitoring system, and surveillance system, and navigation. However, classic neural network methods are insufficient for real-life applications. To tackle with this problem, using the learning capability of neural networks and deduction capability of fuzzy systems, neural networks and fuzzy sets are incorporated called as NeuroFuzzy. The Fuzzy min-max neural network (FMNN) is a special type of NeuroFuzzy. In this paper, a bibliometric analysis is conducted on FMNN literature. We consider the studies that are published in the last decade due to there is a jump in this field in the last 10 years. Social network analysis results show that Chee Peng Lim, is the most influential researcher in the network. The Neurocomputing is found to be the most influential journal, publishing 12% of all publications in this field. In addition, the International Conference on Computing, Communication, and Networking Technologies is the most influential conference on FMNN. The findings of this paper can draw a road map for researchers in the FMNNs. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023

    Video clip retrieval by maximal matching and optimal matching in graph theory

    No full text
    In this paper, a novel approach for automatic matching, ranking and retrieval of video clips is proposed. Motivated by the maximal and optimal matching theories in graph analysis, a new similarity measure of video clips is defined based on the representation and modeling of bipartite graph. Four different factors: visual similarity, granularity, interference and. temporal order of shots are taken into consideration for similarity ranking. These factors are progressively analyzed in the proposed approach. Maximal matching utilizes the granularity factor to efficiently filter false matches, while optimal matching takes into account the visual, granularity and interference factors for similarity measure. Dynamic programming is also formulated to quantitatively evaluate the temporal order of shots. The final similarity measure. is based on the results of optimal matching and dynamic programming. Experimental results indicate that the proposed approach is effective and efficient in retrieving and ranking similar video clips.Computer Science, Artificial IntelligenceEngineering, Electrical & ElectronicImaging Science & Photographic TechnologyCPCI-S(ISTP)

    General practitioners' attitudes and preparedness towards Clinical Decision Support in e-Prescribing (CDS-eP) adoption in the West of Ireland: a cross sectional study

    No full text
    Background: Electronic clinical decision support (CDS) is increasingly establishing its role in evidence-based clinical practice. Considerable evidence supports its enhancement of efficiency in e-Prescribing, but some controversy remains. This study evaluated the practicality and identified the perceived benefits of, and barriers to, its future adoption in the West of Ireland. Methods: This cross sectional study was carried out by means of a 27-part questionnaire sent to 262 registered general practitioners in Counties Galway, Mayo and Roscommon. The survey domains encompassed general information of individual's practice, current use of CDS and the practitioner's attitudes towards adoption of CDS-eP. Descriptive and inferential analyses were performed to analyse the data collected. Results: The overall response rate was 37%. Nearly 92% of respondents employed electronic medical records in their practice. The majority acknowledged the value of electronic CDS in improving prescribing quality (71%) and reducing prescribing errors (84%). Despite a high degree of unfamiliarity (73%), the practitioners were open to the use of CDS-eP (94%) and willing to invest greater resources for its implementation (62%). Lack of a strategic implementation plan (78%) is the main perceived barrier to the incorporation of CDS-eP into clinical practice, followed by i) lack of financial incentives (70%), ii) lack of standardized product software (61%), iii) high sensitivity of drug-drug interaction or medication allergy markers (46%), iv) concern about overriding physicians' prescribing decisions(44%) and v) lack of convincing evidence on the systems' effectiveness (22%). Conclusions: Despite favourable attitudes towards the adoption of CDS-eP, multiple perceived barriers impede its incorporation into clinical practice. These merit further exploration, taking into consideration the structure of the Irish primary health care system, before CDS-eP can be recommended for routine clinical use in the West of Ireland.Healthcare Informatics Society of Ireland (HISI) research bursary 2007-2009Deposited by bulk impor

    Interconnection networks for parallel and distributed computing

    No full text
    Parallel computers are generally either shared-memory machines or distributed- memory machines. There are currently technological limitations on shared-memory architectures and so parallel computers utilizing a large number of processors tend tube distributed-memory machines. We are concerned solely with distributed-memory multiprocessors. In such machines, the dominant factor inhibiting faster global computations is inter-processor communication. Communication is dependent upon the topology of the interconnection network, the routing mechanism, the flow control policy, and the method of switching. We are concerned with issues relating to the topology of the interconnection network. The choice of how we connect processors in a distributed-memory multiprocessor is a fundamental design decision. There are numerous, often conflicting, considerations to bear in mind. However, there does not exist an interconnection network that is optimal on all counts and trade-offs have to be made. A multitude of interconnection networks have been proposed with each of these networks having some good (topological) properties and some not so good. Existing noteworthy networks include trees, fat-trees, meshes, cube-connected cycles, butterflies, Möbius cubes, hypercubes, augmented cubes, k-ary n-cubes, twisted cubes, n-star graphs, (n, k)-star graphs, alternating group graphs, de Bruijn networks, and bubble-sort graphs, to name but a few. We will mainly focus on k-ary n-cubes and (n, k)-star graphs in this thesis. Meanwhile, we propose a new interconnection network called augmented k-ary n- cubes. The following results are given in the thesis.1. Let k ≥ 4 be even and let n ≥ 2. Consider a faulty k-ary n-cube Q(^k_n) in which the number of node faults f(_n) and the number of link faults f(_e) are such that f(_n) + f(_e) ≤ 2n - 2. We prove that given any two healthy nodes s and e of Q(^k_n), there is a path from s to e of length at least k(^n) - 2f(_n) - 1 (resp. k(^n) - 2f(_n) - 2) if the nodes s and e have different (resp. the same) parities (the parity of a node Q(^k_n) in is the sum modulo 2 of the elements in the n-tuple over 0, 1, ∙∙∙ , k - 1 representing the node). Our result is optimal in the sense that there are pairs of nodes and fault configurations for which these bounds cannot be improved, and it answers questions recently posed by Yang, Tan and Hsu, and by Fu. Furthermore, we extend known results, obtained by Kim and Park, for the case when n = 2.2. We give precise solutions to problems posed by Wang, An, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Q(^k_n) is bi-panconnected and edge-bipancyclic, when k ≥ 3 and n ≥ 2, and we also show that when k is odd, Q(^k_n) is m-panconnected, for m = (^n(k - 1) + 2k - 6’ / ‘_2), and (k -1) pancyclic (these bounds are optimal). We introduce a path-shortening technique, called progressive shortening, and strengthen existing results, showing that when paths are formed using progressive shortening then these paths can be efficiently constructed and used to solve a problem relating to the distributed simulation of linear arrays and cycles in a parallel machine whose interconnection network is Q(^k_n) even in the presence of a faulty processor.3. We define an interconnection network AQ(^k_n) which we call the augmented k-ary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube Q(^k_n) has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n-cube Q(^k_n) - is a Cayley graph (and so is vertex-symmetric); has connectivity 4n - 2, and is such that we can build a set of 4n - 2 mutually disjoint paths joining any two distinct vertices so that the path of maximal length has length at most max{{n- l)k- (n-2), k + 7}; has diameter [(^k) / (_3)] + [(^k - 1) /( _3)], when n = 2; and has diameter at most (^k) / (_4) (n+ 1), for n ≥ 3 and k even, and at most [(^k)/ (_4) (n + 1) + (^n) / (_4), for n ^, for n ≥ 3 and k odd.4. We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph S(_n,k) where all nodes are distinct, builds a collection of n - 1 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most 6k - 7, and the algorithm has time complexity O(k(^3)n(^4))

    A study on the Brushless DC Motor Control System of an electric vehicle using MATLAB/SIMULINK

    No full text
    A study on the Brushless DC Motor Control System of an electric vehicle using MATLAB/SIMULIN

    General practitioners' attitudes and preparedness towards clinical decision support in e-prescribing (cds-ep) adoption in the west of ireland: a cross sectional study

    No full text
    Background: Electronic clinical decision support (CDS) is increasingly establishing its role in evidence-based clinical practice. Considerable evidence supports its enhancement of efficiency in e-Prescribing, but some controversy remains. This study evaluated the practicality and identified the perceived benefits of, and barriers to, its future adoption in the West of Ireland. Methods: This cross sectional study was carried out by means of a 27-part questionnaire sent to 262 registered general practitioners in Counties Galway, Mayo and Roscommon. The survey domains encompassed general information of individual's practice, current use of CDS and the practitioner's attitudes towards adoption of CDS-eP. Descriptive and inferential analyses were performed to analyse the data collected. Results: The overall response rate was 37%. Nearly 92% of respondents employed electronic medical records in their practice. The majority acknowledged the value of electronic CDS in improving prescribing quality (71%) and reducing prescribing errors (84%). Despite a high degree of unfamiliarity (73%), the practitioners were open to the use of CDS-eP (94%) and willing to invest greater resources for its implementation (62%). Lack of a strategic implementation plan (78%) is the main perceived barrier to the incorporation of CDS-eP into clinical practice, followed by i) lack of financial incentives (70%), ii) lack of standardized product software (61%), iii) high sensitivity of drug-drug interaction or medication allergy markers (46%), iv) concern about overriding physicians' prescribing decisions(44%) and v) lack of convincing evidence on the systems' effectiveness (22%). Conclusions: Despite favourable attitudes towards the adoption of CDS-eP, multiple perceived barriers impede its incorporation into clinical practice. These merit further exploration, taking into consideration the structure of the Irish primary health care system, before CDS-eP can be recommended for routine clinical use in the West of Ireland.peer-reviewe

    Challenges in the classification and management of Asian youth-onset diabetes mellitus- lessons learned from a single centre study.

    No full text
    It remains widely perceived that early-onset Type 2 Diabetes (T2D) in children and adolescents is rare and clinically distinct from Type 1 Diabetes (T1D). We studied the challenges of classifying subtypes of early-onset diabetes using clinical features and biomarkers, and management of these patients. We reviewed retrospectively the record of patients 250 pmol/L. HbA1C of ≤ 8.0% (64 mmol/mol) was achieved in 30.3% of T1D, 58.3% of T2D on OAD and 16.7% of T2D on insulin. The T2D had greater cardiovascular risk with higher body mass index, more dyslipidaemia, higher blood pressure and earlier onset of nephropathy. The overlapping clinical features, variable autoimmunity, and beta-cell loss complicate classification of young diabetes. Pancreatic autoantibodies and C-peptide did not always predict diabetes subtypes nor respond to insulin. The poor metabolic control and high cardiovascular risk burden among the T2D highlight the need for population-based study and focused intervention
    corecore