Objective evaluation of speech dysfluencies using wavelet packet transform with sample entropy

Dysfluency and stuttering are a break or interruption of normal speech such as repetition, prolongation, interjection of syllables, sounds, words or phrases and involuntary silent pauses or blocks in communication. Stuttering assessment through manual classification of speech dysfluencies is subjective, inconsistent, time consuming and prone to error. This paper proposes an objective evaluation of speech dysfluencies based on the wavelet packet transform with sample entropy features. Dysfluent speech signals are decomposed into six levels by using wavelet packet transform. Sample entropy (SampEn) features are extracted at every level of decomposition and they are used as features to characterize the speech dysfluencies (stuttered events). Three different classifiers such as k-nearest neighbor (kNN), linear discriminant analysis (LDA) based classifier and support vector machine (SVM) are used to investigate the performance of the sample entropy features for the classification of speech dysfluencies. 10-fold cross validation method is used for testing the reliability of the classifier results. The effect of different wavelet families on the classification performance is also performed. Experimental results demonstrate that the proposed features and classification algorithms give very promising classification accuracy of 96.67% with the standard deviation of 0.37 and also that the proposed method can be used to help speech language pathologist in classifying speech dysfluencies.     

Sound source localization using compressive sensing-based feature extraction and spatial sparsity

In this paper, we propose a source localization algorithm based on a sparse Fast Fourier Transform (FFT)-based feature extraction method and spatial sparsity. We represent the sound source positions as a sparse vector by discretely segmenting the space with a circular grid. The location vector is related to microphone measurements through a linear equation, which can be estimated at each microphone. For this linear dimensionality reduction, we have utilized a Compressive Sensing (CS) and two-level FFT-based feature extraction method which combines two sets of audio signal features and covers both short-time and long-time properties of the signal. The proposed feature extraction method leads to a sparse representation of audio signals. As a result, a significant reduction in the dimensionality of the signals is achieved. In comparison to the state-of-the-art methods, the proposed method improves the accuracy while the complexity is reduced in some cases.     

Parallel Lagrange interpolation on <Emphasis Type="Italic">k</Emphasis>-ary <Emphasis Type="Italic">n</Emphasis>-cubes with maximum channel utilization

This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters used in current state-of-the-art implementations.

An architecture framework for an adaptive extensible processor

To improve the performance of embedded processors, an effective technique is collapsing critical computation subgraphs as application-specific instruction set extensions and executing them on custom functional units. The problem with this approach is the immense cost and the long times required to design a new processor for each application. As a solution to this issue, we propose an adaptive extensible processor in which custom instructions (CIs) are generated and added after chip-fabrication. To support this feature, custom functional units are replaced by a reconfigurable matrix of functional units (FUs). A systematic quantitative approach is used for determining the appropriate structure of the reconfigurable functional unit (RFU). We also introduce an integrated framework for generating mappable CIs on the RFU. Using this architecture, performance is improved by up to 1.33, with an average improvement of 1.16, compared to a 4-issue in-order RISC processor. By partitioning the configuration memory, detecting similar/subset CIs and merging small CIs, the size of the configuration memory is reduced by 40%.     

Re-examining the causal structure of information technology impact research

About 20 years ago, Markus and Robey noted that most research on IT impacts had been guided by deterministic perspectives and had neglected to use an emergent perspective, which could account for contradictory findings. They further observed that most research in this area had been carried out using variance theories at the expense of process theories. Finally, they suggested that more emphasis on multilevel theory building would likely improve empirical reliability. In this paper, we reiterate the observations and suggestions made by Markus and Robey on the causal structure of IT impact theories and carry out an analysis of empirical research published in four major IS journals, Management Information Systems Quarterly (MISQ), Information Systems Research (ISR), the European Journal of Information Systems (EJIS), and Information and Organization (I&O), to assess compliance with those recommendations. Our final sample consisted of 161 theory-driven articles, accounting for approximately 21% of all the empirical articles published in these journals. Our results first reveal that 91% of the studies in MISQ, ISR, and EJIS focused on deterministic theories, while 63% of those in I&O adopted an emergent perspective. Furthermore, 91% of the articles in MISQ, ISR, and EJIS adopted a variance model; this compares with 71% from I&O that applied a process model. Lastly, mixed levels of analysis were found in 14% of all the surveyed articles. Implications of these findings for future research are discussed.     

A Randomized Algorithm for Online Unit Clustering

In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used. In the one-dimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm. We also provide some lower bounds and an extension to higher dimensions.     

Weak and strong stabilization of linear systems

We study the problem of stabilizing a distributed linear system on a subregion of its geometrical domain. We are concerned with two methods： the first approach enables us to characterize a stabilizing control via the steady state Riccati equation, and the second one is based on decomposing the state space into two suitable subspaces and studying the projections of the initial system onto such subspaces. The obtained results are performed through various examples.     

Agent-based time delay margin in consensus of multi-agent systems by an event-triggered control method: Concept and computation

This paper deals with defining the concept of agent-based time delay margin and computing its value in multi-agent systems controlled by event-triggered based controllers. The agent-based time delay margin specifying the time delay tolerance of each agent for ensuring consensus in event-triggered controlled multi-agent systems can be considered as complementary for the concept of (network) time delay margin, which has been previously introduced in some literature. In this paper, an event-triggered control method for achieving consensus in multi-agent systems with time delay is considered. It is shown that the Zeno behavior is excluded by applying this method. Then, in a multi-agent system controlled by the considered event-triggered method, the concept of agent-based time delay margin in the presence of a fixed network delay is defined. Moreover, an algorithm for computing the value of the time delay margin for each agent is proposed. Numerical simulation results are also provided to verify the obtained theoretical results.     

Modulation Based Combination of High Level Features Generated from SCCF & Contourlet Transforms for CBIR Applications

The need for suitable and cost-effective technologies rise with the growth of the internet of things (IoT) applications. These aim at handling voluminous data transmission in addition to minimum energy and latency cost constraints. LoRa networks are recommended for applications in confined spaces, long ranges, and less battery consumption requirements. However, the end devices in these networks communicate to all gateways in their ranges, thereby expediting energy unproductively in redundant transmissions. In our article, we explore the possibilities of whether LoRa networks could employ the advantages of clustering and propose two algorithms, path-based and data-centric, for such networks. We suggest that LoRaWAN technology with clustering can be apt for long-range, low power consumption IoT applications in the future. We study the impact of network density, node range, and cluster range on the energy consumption in data transmissions. The algorithms are compared with the inherent star-based communication of LoRa networks based on energy consumed, and our results show that, for dense deployments, clustering becomes advantageous.

     

An Improvement Energy Consumption Policy Using Communication Reduction in Wireless Body Sensor Network

Dedicated short-range communications (DSRC) is an important wireless technology for current and future automotive safety and mitigation of traffic jams. In this work, we have designed a Coplanar waveguide microstrip patch antenna with linear, upper and bottom and side slots for application in DSRC. The patch antenna was designed using glass epoxy substrate (FR4). Various parametric analyses such as the current distribution, reflection coefficient, radiation pattern on E- and H-plane as well as the realized gain (dB) were performed. The results were obtained by simulation using high-frequency structure simulator tool. The proposed antenna covers a frequency band of 5.8–5.9 GHz which is highly dedicated to the DSRC wireless communication technology for enhancement of safety of the automotive transport system. The designed antenna shows a good return loss of ??19 dB at 5.9 GHz.The designed antenna shows a promising gain, return loss and radiation pattern for use in DSRC for automotive transport systems.