A statistical model for robust integration of narrowband cues in speech

We investigate a statistical model for integrating narrowband cues in speech. The model is inspired by two ideas in human speech perception: (i) Fletcher’s hypothesis (1953) that independent detectors, working in narrow frequency bands, account for the robustness of auditory strategies, and (ii) Miller and Nicely’s analysis (1955) that perceptual confusions in noisy bandlimited speech are correlated with phonetic features. We apply the model to detecting the phonetic feature [ +  /  − sonorant] that distinguishes vowels, approximants, and nasals (sonorants) from stops, fricatives, and affricates (obstruents). The model is represented by a multilayer probabilistic network whose binary hidden variables indicate sonorant cues from different parts of the frequency spectrum. We derive the Expectation-Maximization algorithm for estimating the model’s parameters and evaluate its performance on clean and corrupted speech.     

FPGA implementation of reversible watermarking in digital images using reversible contrast mapping

Reversible contrast mapping (RCM) and its various modified versions are used extensively in reversible watermarking (RW) to embed secret information into the digital contents. RCM based RW accomplishes a simple integer transform applied on pair of pixels and their least significant bits (LSB) are used for data embedding. It is perfectly invertible even if the LSBs of the transformed pixels are lost during data embedding. RCM offers high embedding rate at relatively low visual distortion (embedding distortion). Moreover, low computation cost and ease of hardware realization make it attractive for real-time implementation. To this aim, this paper proposes a field programmable gate array (FPGA) based very large scale integration (VLSI) architecture of RCM-RW algorithm for digital images that can serve the purpose of media authentication in real-time environment. Two architectures, one for block size (8 × 8) and the other one for (32 × 32) block are developed. The proposed architecture allows a 6-stage pipelining technique to speed up the circuit operation. For a cover image of block size (32 × 32), the proposed architecture requires 9881 slices, 9347 slice flip-flops, 11291 number 4-input LUTs, 3 BRAMs and a data rate of 1.0395 Mbps at an operating frequency as high as 98.76 MHz.     

A two-dimensional optical cross-connect with integrated waveguides and surface micromachined crossbar switches

The design, fabrication and test results of an all-optical cross-connect, which uses electrostatically actuated micromechanical digital mirrors to steer optical signals in a network of planar waveguides, are presented. The substrate consists of a network of spliced planar waveguides on silica substrates. The switches, located at the waveguide intersections, are formed with an electroplated T-structure consisting of a horizontal perforated square plate suspended by four elastic beams. When operated, the horizontal plate is pulled up making the mirror move out of the optical path thus steering the beam. An 8×8 switch array has been fabricated and tested. Actuation and relaxation switching times near 3 ms have been demonstrated with an actuation voltage of 120 V. The optical insertion loss for the array typically varied from 2.3 dB for a single trench in the optical path (shortest optical path) to 8 dB for 15 trenches in the optical path (longest optical path).     

An uncooled optically readable infrared imaging detector

This paper presents a design and fabrication of bi-material micro-cantilever array (focal plane array, FPA) made of silicon nitride (SiN_x) and gold (Au) for uncooled optical readout infrared (IR) imaging system, in which silicon (Si) substrate is removed. Compared with the conventional thermal imaging detectors where the FPA must be put in high vacuum, IR thermal images can be obtained even though the cantilever array is placed in the atmosphere. The reason is the elimination of air gap (∼2 μm) between the cantilever beam and substrate, which introduces the air conduction of high temperature gradient. The preliminary experimental results with the micro-cantilever array of 140 × 98 elements and a 12-bit charge-coupled device (CCD) indicate that objects at temperature of higher than 120 °C can be detected and the noise-equivalent temperature difference (NETD) is ∼7 K. Also, the experimental results are well accordant with the thermomechanical analysis of designed micro-cantilever array.     

Loop-free traffic engineering with path protection in MPLS VPNs

In this paper we present a new approach for VPN (virtual private network) traffic engineering with path protection in Multiprotocol Label Switching networks carrying QoS and best effort traffic. Our approach eliminates the path cycles, a problem often encountered in link-based traffic engineering methods. It also allows for control of the maximum path length and the size of the label space in each label switch router. We consider off-line computation of the working and backup paths using a link-based approach. Two cases of 1 + 1 and 1:1 path protection are considered. Numerical results are presented to show the efficacy of the algorithm in calculating link-disjoint and node-disjoint primary and backup paths for the QoS traffic.     

Cluster computing and the power of edge recognition

Though complexity theory already extensively studies path-cardinality-based restrictions on the power of nondeterminism, this paper is motivated by a more recent goal: To gain insight into how much of a restriction, it is of nondeterminism to limit machines to have just one contiguous (with respect to some simple order) interval of accepting paths. In particular, we study the robustness—the invariance under definition changes—of the cluster class CL#P. This class contains each #P function that is computed by a balanced Turing machine whose accepting paths always form a cluster with respect to some length-respecting total order with efficient adjacency checks. The definition of CL#P is heavily influenced by the defining paper’s focus on (global) orders. In contrast, we define a cluster class, CLU#P, to capture what seems to us a more natural model of cluster computing. We prove that the naturalness is costless: CL#P = CLU#P. Then we exploit the more natural, flexible features of CLU#P to prove new robustness results for CL#P and to expand what is known about the closure properties of CL#P.The complexity of recognizing edges—of an ordered collection of computation paths or of a cluster of accepting computation paths—is central to this study. Most particularly, our proofs exploit the power of unique discovery of edges—the ability of nondeterministic functions to, in certain settings, discover on exactly one (in some cases, on at most one) computation path a critical piece of information regarding edges of orderings or clusters.     

A new approach of audio emotion recognition

A new architecture of intelligent audio emotion recognition is proposed in this paper. It fully utilizes both prosodic and spectral features in its design. It has two main paths in parallel and can recognize 6 emotions. Path 1 is designed based on intensive analysis of different prosodic features. Significant prosodic features are identified to differentiate emotions. Path 2 is designed based on research analysis on spectral features. Extraction of Mel-Frequency Cepstral Coefficient (MFCC) feature is then followed by Bi-directional Principle Component Analysis (BDPCA), Linear Discriminant Analysis (LDA) and Radial Basis Function (RBF) neural classification. This path has 3 parallel BDPCA + LDA + RBF sub-paths structure and each handles two emotions. Fusion modules are also proposed for weights assignment and decision making. The performance of the proposed architecture is evaluated on eNTERFACE’05 and RML databases. Simulation results and comparison have revealed good performance of the proposed recognizer.     

A survey on wireless sensor network infrastructure for agriculture

The hybrid wireless sensor network is a promising application of wireless sensor networking techniques. The main difference between a hybrid WSN and a terrestrial wireless sensor network is the wireless underground sensor network, which communicates in the soil. In this paper, a hybrid wireless sensor network architecture is introduced. The framework to deploy and operate a hybrid WSN is developed. Experiments were conducted using a soil that was 50% sand, 35% silt, and 15% clay; it had a bulk density of 1.5 g/cm³ and a specific density of 2.6 cm^? 3. The experiment was conducted for several soil moistures (5, 10, 15, 20 and 25%) and three signal frequencies (433, 868 and 915 MHz). The results show that the radio signal path loss is smallest for low frequency signals and low moisture soils. Furthermore, the node deployment depth affected signal attenuation for the 433 MHz signal. The best node deployment depth for effective transmission in a wireless underground sensor network was determined.     

Hybrid real-coded genetic algorithm for data partitioning in multi-round load distribution and scheduling in heterogeneous systems

Data partitioning and scheduling is one the important issues in minimizing the processing time for parallel and distributed computing system. We consider a single-level tree architecture of the system and the case of affine communication model, for a general m processor system with n rounds of load distribution. For this case, there exists an optimal activation order, optimal number of processors m* (m * ≤ m), and optimal rounds of load distribution n* (n * ≤ n), such that the processing time of the entire processing load is a minimum. This is a difficult optimization problem because for a given activation order, we have to first identify the processors that are participating (in the computation process) in every round of load distribution and then obtain the load fractions assigned to them, and the processing time. Hence, in this paper, we propose a real-coded genetic algorithm (RCGA) to solve the optimal activation order, optimal number of processors m* (m * ≤ m), and optimal rounds of load distribution n* (n * ≤ n), such that the processing time of the entire processing load is a minimum. RCGA employs a modified crossover and mutation operators such that the operators always produce a valid solution. Also, we propose different population initialization schemes to improve the convergence. Finally, we present a comparative study with simple real-coded genetic algorithm and particle swarm optimization to highlight the advantage of the proposed algorithm. The results clearly indicate the effectiveness of the proposed real-coded genetic algorithm.     

Early-stage atherosclerosis detection using deep learning over carotid ultrasound images

This paper proposes a computer-aided diagnosis tool for the early detection of atherosclerosis. This pathology is responsible for major cardiovascular diseases, which are the main cause of death worldwide. Among preventive measures, the intima-media thickness (IMT) of the common carotid artery stands out as early indicator of atherosclerosis and cardiovascular risk. In particular, IMT is evaluated by means of ultrasound scans. Usually, during the radiological examination, the specialist detects the optimal measurement area, identifies the layers of the arterial wall and manually marks pairs of points on the image to estimate the thickness of the artery. Therefore, this manual procedure entails subjectivity and variability in the IMT evaluation. Instead, this article suggests a fully automatic segmentation technique for ultrasound images of the common carotid artery. The proposed methodology is based on machine learning and artificial neural networks for the recognition of IMT intensity patterns in the images. For this purpose, a deep learning strategy has been developed to obtain abstract and efficient data representations by means of auto-encoders with multiple hidden layers. In particular, the considered deep architecture has been designed under the concept of extreme learning machine (ELM). The correct identification of the arterial layers is achieved in a totally user-independent and repeatable manner, which not only improves the IMT measurement in daily clinical practice but also facilitates the clinical research. A database consisting of 67 ultrasound images has been used in the validation of the suggested system, in which the resulting automatic contours for each image have been compared with the average of four manual segmentations performed by two different observers (ground-truth). Specifically, the IMT measured by the proposed algorithm is 0.625 ± 0.167 mm (mean ± standard deviation), whereas the corresponding ground-truth value is 0.619 ± 0.176 mm. Thus, our method shows a difference between automatic and manual measures of only 5.79 ± 34.42 μm. Furthermore, different quantitative evaluations reported in this paper indicate that this procedure outperforms other methods presented in the literature.     

On design and performance evaluation of an integrated SIP and HCoP-B architecture for nested network mobility

This paper proposes a fully-integrated SIP + HCoP-B architecture to provide efficient mobility management of the nested mobile network. It achieves the following merits, which are rare in the literature. First, it reduces network deployment costs by only equipping an integrated SIP mobile server. Second, it supports both SIP-based and non-SIP-based applications. Third, by adopting the analytical model proposed in Mohanty and Akyildiz (2007) [19], mathematical analyses are provided to investigate six performance metrics of SIP + HCoP-B and the other four well-known SIP's over NEMO schemes over the error-prone wireless link. Finally, it is shown that SIP + HCoP-B outperforms these four traditional schemes through intensive simulations.     

Relationships between maximum holding time and ratings of pain and exertion differ for static and dynamic tasks

Ratings of perceived discomfort (0 to 10 scale) have been used to estimate relative maximum holding times (%MHT), particularly for static tasks. A linear 1:10% ratio has been described, where a rating of 5 corresponds to 50%MHT. It is unknown whether this linear ratio is valid for dynamic tasks. Additionally, whether pain or exertion are the primary predictors of discomfort is not clear. Thus, the goal of this study was to investigate both pain and exertion ratings during static (50% maximum; N = 42) and dynamic (75% maximum; N = 34) elbow flexion tasks until failure. Gender, self-reported physical activity, and peak torque were also assessed. Pain and exertion ratings reasonably matched the 1:10% ratio during the static task but not during the dynamic task. Exertion related more strongly to MHT than pain in both tasks. Neither gender nor activity level appeared to influence perceptual ratings, but peak torque explained approximately 20% of the variance in MHT.     

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n^2ε+n^1−ε) log n) time, performing O(n^1+ε log n) work for any 0<ε<1/2. The strength of the algorithm is its simplicity, making it easy to implement and presumable quite efficient in practice. The algorithm improves upon the work of all previous parallel algorithms. Our algorithm is based on a region decomposition of the input graph and uses a well-known parallel implementation of Dijkstra's algorithm. The logarithmic factor in both the work and the time can be eliminated by plugging in a less practical, sequential planar shortest path algorithm together with an improved parallel implementation of Dijkstra's algorithm.     

Transforming a teacher education method course through technology: effects on preservice teachers’ technology competency

In this study, an instructional design model was employed for restructuring a teacher education course with technology. The model was applied in a science education method course, which was offered in two different but consecutive semesters with a total enrollment of 111 students in the fall semester and 116 students in the spring semester. Using tools, such as multimedia authoring tools in the fall semester and modeling software in the spring semester, teacher educators designed high quality technology-infused lessons for science and, thereafter, modeled them in classroom for preservice teachers. An assessment instrument was constructed to assess preservice teachers’ technology competency, which was measured in terms of four aspects, namely, (a) selection of appropriate science topics to be taught with technology, (b) use of appropriate technology-supported representations and transformations for science content, (c) use of technology to support teaching strategies, and (d) integration of computer activities with appropriate inquiry-based pedagogy in the science classroom. The results of a MANOVA showed that preservice teachers in the Modeling group outperformed preservice teachers’ overall performance in the Multimedia group, F = 21.534, p = 0.000. More specifically, the Modeling group outperformed the Multimedia group on only two of the four aspects of technology competency, namely, use of technology to support teaching strategies and integration of computer activities with appropriate pedagogy in the classroom, F = 59.893, p = 0.000, and F = 10.943, p = 0.001 respectively. The results indicate that the task of preparing preservice teachers to become technology competent is difficult and requires many efforts for providing them with ample of opportunities during their education to develop the competencies needed to be able to teach with technology.     

Realization strategies of dedicated path protection: A bandwidth cost perspective

Communication networks have to provide a high level of availability and instantaneous recovery after failures in order to ensure sufficient survivability for mission-critical services. Currently, dedicated path protection (or 1 + 1) is implemented in backbone networks to provide the necessary resilience and instantaneous recovery against single link failures with remarkable simplicity. However, in order to satisfy strict availability requirements, connections also have to be resilient against Shared Risk Link Group (SRLG) failures. In addition, switching matrix reconfigurations have to be avoided after a failure in order to guarantee instantaneous recovery. For this purpose, there are several possible realization strategies improving the characteristics of traditional 1 + 1 path protection by lowering reserved bandwidth while conserving all its favorable properties. These methods either utilize diversity coding, network coding, or generalize the disjoint-path constraint of 1 + 1.In this paper, we consider the cost aspect of the traditional and the alternative 1 + 1 realization strategies. We evaluate the bandwidth cost of different schemes both analytically and empirically in realistic network topologies. As the more complex realizations lead to NP-complete problems even in the single link failure case, we propose both Integer Linear Programming (ILP) based optimal methods, as well as heuristic and meta-heuristic approaches to solve them. Our findings provide a tool and guidelines for service providers for selecting the path protection method with the lowest bandwidth cost for their network corresponding to a given level of reliability.     

Ultra high performance planar InGaAs PIN photodiodes for high speed optical fiber communication

This paper reports a front-illuminated planar InGaAs PIN photodiode with very low dark current, very low capacitance and very high responsivity on S-doped InP substrate. The presented device which has a thick absorption layer of 2.92 μm and a photosensitive area 73 μm in diameter exhibited the high performance of a very low capacitance of 0.47 pF, a very low dark current of 0.041 nA, a very high responsivity of 0.99 A/W (79% quantum efficiency) at λ = 1.55 μm, the 3 dB bandwidths of 6.89 GHz (−5 V), 7.48 GHz (−12 V) for bare chips and 4.48 GHz (−5 V), 5.02 GHz (−12 V) for the devices packaged in TO can, respectively. Furthermore, the developed PIN photodiodes possess high breakdown voltage of less than −25 V.     

Search space reduction in QoS routing

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given quality-of-service constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a near-optimal solution. However, these heuristics either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we focus on solving the delay-constrained minimum-cost path problem, and present a fast algorithm to find a near-optimal solution. This algorithm, called delay-cost-constrained routing (DCCR), is a variant of the k-shortest-path algorithm. DCCR uses a new adaptive path weight function together with an additional constraint imposed on the path cost, to restrict the search space. Thus, DCCR can return a near-optimal solution in a very short time. Furthermore, we use a variant of the Lagrangian relaxation method proposed by Handler and Zang [Networks 10 (1980) 293] to further reduce the search space by using a tighter bound on path cost. This makes our algorithm more accurate and even faster. We call this improved algorithm search space reduction + DCCR (SSR + DCCR). Through extensive simulations, we confirm that SSR + DCCR performs very well compared to the optimal but very expensive solution.     

Evaluation of a non-point source pollution model,AnnAGNPS, in a tropical watershed

Impaired water quality caused by human activity and the spread of invasive plant and animal species has been identified as a major factor of degradation of coastal ecosystems in the tropics. The main goal of this study was to evaluate the performance of AnnAGNPS (Annualized Non-Point Source Pollution Model), in simulating runoff and soil erosion in a 48 km² watershed located on the Island of Kauai, Hawaii. The model was calibrated and validated using 2 years of observed stream flow and sediment load data. Alternative scenarios of spatial rainfall distribution and canopy interception were evaluated. Monthly runoff volumes predicted by AnnAGNPS compared well with the measured data (R² = 0.90, P < 0.05); however, up to 60% difference between the actual and simulated runoff were observed during the driest months (May and July). Prediction of daily runoff was less accurate (R² = 0.55, P < 0.05). Predicted and observed sediment yield on a daily basis was poorly correlated (R² = 0.5, P < 0.05). For the events of small magnitude, the model generally overestimated sediment yield, while the opposite was true for larger events. Total monthly sediment yield varied within 50% of the observed values, except for May 2004. Among the input parameters the model was most sensitive to the values of ground residue cover and canopy cover. It was found that approximately one third of the watershed area had low sediment yield (0–1 t ha⁻¹ y⁻¹), and presented limited erosion threat. However, 5% of the area had sediment yields in excess of 5 t ha⁻¹ y⁻¹. Overall, the model performed reasonably well, and it can be used as a management tool on tropical watersheds to estimate and compare sediment loads, and identify “hot spots” on the landscape.     

Facebook use and academic performance among college students: A mixed-methods study with a multi-ethnic sample

This paper uses a mixed-methods approach to examine the relation between online academic disclosure and academic performance. A multi-ethnic sample of college students (N = 261; male = 66; female = 195; M age ≈ 22 years) responded to open-ended questions about their Facebook use. Thematic analysis revealed that over 14% of the Facebook wall posts/status updates (N = 714) contained academic themes; positive states were more frequent than negative and neutral states and students with lower GPAs expressed negative states more often. A path analysis suggested that academic performance may determine college students’ Facebook use, rather than the reverse. Implications for student support services are discussed.     

Moisture sensor at glass/polymer interface for monitoring of photovoltaic module encapsulants

A sensor developed for measurement of water concentration inside glass/polymer encapsulation structures with a particular application area in accelerated aging of photovoltaic module encapsulants is described. An approximately 5 μm thick porous TiO₂ film applied to a glass substrate with a conductive coating acts as the moisture-sensitive component. The response is calibrated with weather chamber experiments for sensors open to the environment and with diffusion experiments for sensors laminated under an encapsulant. For the interpretation of diffusion experiment results, a transport model describing the diffusion of water across the polymer/TiO₂ interface is developed. The logarithm of AC resistance shows a linear dependence on water concentration in both open and encapsulated calibration. The first measurable response from an encapsulated 3.5 mm × 8 mm size sensor is obtained when approximately 10 μg of water has entered the film. Implications of the calibration results for sensor usage in accelerated aging tests are discussed.