Domain Adaptation for POS Tagging with Contrastive Monotonic Chunk-wise Attention

Neural Processing Letters - Part of Speech (POS) tagging is a sequential labelling task and one of the core applications of Natural Language Processing. It has been a challenging problem for the...     

Studies on miscibility of blends of ethylene methyl acrylate and polydimethyl siloxane rubber

Blends of ethylene methyl acrylate (EMA) and poly(dimethylsiloxane) rubber (PDMS) are demonstrated to be miscible. The miscibility results in a single and composition-dependent glass transition temperature. IR spectra of the blends provide direct evidence of chemical reaction between EMA and PDMS rubber.     

Algorithms and complexity concerning the preemptive scheduling of periodic,real-time tasks on one processor

We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all parameters to the system are integers, we may assume without loss of generality that all preemptions occur at integer time values. We then assume, for the remainder of the paper, that all parameters are indeed integers. We then give, as our main lemma, both necessary and sufficient conditions for a task system to be feasible on one processor. Although these conditions cannot, in general, be tested efficiently (unless P=NP), they do allow us to give efficient algorithms for deciding feasibility on one processor for certain types of periodic task systems. For example, we give a pseudo-polynomial-time algorithm for synchronous systems whose densities are bounded by a fixed constant less than 1. This algorithm represents an exponential improvement over the previous best algorithm. We also give a polynomial-time algorithm for systems having a fixed number of distinct types of tasks. Furthermore, we are able to use our main lemma to show that the feasibility problem for task systems on one processor is co-NP-complete in the strong sence. In order to show this last result, we first show the Simultaneous Congruences Problem to be NP-complete in the strong sense. Both of these last two results answer questions that have been open for ten years. We conclude by showing that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is ₂ ^p -complete.This work was supported in part by National Science Foundation Grant No. CCR-8711579. Some of these results were presented at the 15th Symposium on Mathematical Foundations of Computer Science, 1990.     

Studies on cocurrent gas-liquid flow in helically coiled tubes. II. Theory and experiments on turbulent mass transfer with and without chemical reaction

Pure carbon dioxide was absorbed into distilled water and sodium hydroxide solution, in cocurrent two phase annular flow in helically coiled tubes in order to measure physical and chemical mass transfer coefficients and interfacial areas. (k*_La) was correlated by the pressure drop in the test sections and interfacial areas were found to vary with the liquid phase energy dissipation. According to a new theory, (k*_L) has been shown to be a function of the root mean square vorticity near the interface. The root mean square vorticity has been related to the pressure drop, gas density, liquid flow rate and liquid velocity. The physical mass transfer coefficients theoretically predicted are in good agreement with experimental results.     

HSWOA: An ensemble of hunger games search and whale optimization algorithm for global optimization

The search for food stimulated by hunger is a common phenomenon in the animal world. Mimicking the concept, recently, an optimization algorithm Hunger Games Search (HGS) has been proposed for global optimization. On the other side, the Whale Optimization Algorithm (WOA) is a commonly utilized nature-inspired algorithm portrayed by a straightforward construction with easy parameters imitating the hunting behavior of humpback whales. However, due to minimum exploration of the search space, WOA has a high chance of trapping into local solutions, and more exploitation leads it towards premature convergence. The concept of hunger from HGS is merged with the food searching techniques of the whale to lessen the inherent drawbacks of WOA. Two weights of HGS are adaptively designed for every whale using the respective hunger level for balancing search strategies. Performance verification of the proposed hunger search-based whale optimization algorithm (HSWOA) is done by comparing it with 10 state-of-the-art algorithms, including three very recently developed algorithms on 30 classical benchmark functions. Comparison with some basic algorithms, recently modified algorithms, and WOA variants is performed using IEEE CEC 2019 function set. Statistical performance of the proposed algorithm is verified with Friedman's test, boxplot analysis, and Nemenyi multiple comparison test. The operating speed of the algorithm is determined and tested with complexity analysis and convergence analysis. Finally, seven real-world engineering problems are solved and compared with a list of metaheuristic algorithms. Numerical and statistical performance comparison with state-of-the-art algorithms confirms the efficacy of the newly designed algorithm.     

Multilevel segmentation of Hippocampus images using global steered quantum inspired firefly algorithm

Applied Intelligence - Microscopic Image segmentation has a crucial role in detecting and diagnosing numerous critical diseases like Alzheimer’s disease, Kidney disease, Cancer, many...     

The feasibility of general task systems with precedence constraints on multiprocessor platforms

Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. The collection of jobs may contain precedence constraints upon the order of execution of these jobs. The derived tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.

A dynamic model for short-term prediction of stream attributes

Multiple data streams coming out of a complex system form the observable state of the system. The streams may correspond to various sensors attached with the system or outcome of internal processes. Such stream data may consist of multiple attributes and may differ in terms of their frequency of generation and observation. The streams may have dependency among themselves. One will have to rely on such data streams for monitoring the health of the system or to take any corrective measure. Predicting the value of certain stream data is an important task that can help one to take decision and act accordingly. In this work, a simple but generic visualization of a complex system is presented and thereafter a linear regression-based dynamic model for short-term prediction is proposed. The model is based on the past history of the attributes of multiple streams as suggested by the domain experts. But, it automatically determines the meaningful attributes and reformulates the model. The model is also re-computed if the prediction error exceeds the allowable tolerance. All these make the model dynamic. Experiment is carried out with stock market data streams to predict the close value well in advance. It is observed that in terms of quality of prediction and performance metric, the proposed model is quite effective.