Search

The minimum variance controller has been extensively used as a benchmark in the performance assessment of both univariate and multivariate control loops when time delay is the fundamental performance limitation. In this paper, the spatial and temporal performance limitations in the cross-directional (CD) control of paper machines are analyzed. The idea of minimum variance benchmarking is extended to the CD process based on these performance limitations. Based on an industrial CD controller, a user-specified benchmark, which is more practical and less aggressive, is also proposed. In addition, several related performance indices are proposed for the CD process based on both the minimum variance benchmark and the user-specified benchmark. Illustrative examples from a paper machine simulator and industrial data sets are provided to show the effectiveness of the proposed performance indices. [ABSTRACT FROM AUTHOR]

Benchmarking systems is difficult. Mistakes can compromise guarantees and threaten reproducibility and comparability. We conduct a study to show that benchmarking flaws are widespread in systems security defense papers, even at tier-1 venues. We aim to raise awareness and provide recommendations for safeguarding the scientific process in our community. [ABSTRACT FROM AUTHOR]

Hidayetoğlu et al. propose a novel memory-centric algorithm to reconstruct X-ray CT images in the SC19 article entitled “MemXCT: Memory-Centric X-ray CT Reconstruction with Massive Parallelization”. They formulate the reconstruction with several SpMVs, and propose two memory-centric optimizations to improve cache locality for better memory bandwidth utilization, i.e., a two-level pseudo-Hilbert ordering and a multi-stage input buffering. In this article, we present our results on reproducing that article to show its effectiveness and generality, as part of the SC20 Student Cluster Competition Reproducibility Challenge. We reproduce the execution time and memory bandwidth tests in that article on various architectures, including Intel CPUs, AMD CPUs, and NVIDIA GPUs. We further analyze the bottleneck on different architectures by comparing the achieved memory bandwidth with the peak bandwidth on those architectures. We then reproduce the strong scaling test on CPU and GPU clusters with different scales, and use the proposed algorithm to reconstruct three new X-ray computed tomograms. [ABSTRACT FROM AUTHOR]

Video hyperlinking is a task aiming to enhance the accessibility of large archives, by establishing links between fragments of videos. The links model the aboutness between fragments for efficient traversal of video content. This paper addresses the problem of link construction from the perspective of cross-modal embedding. To this end, a generalized multi-modal auto-encoder is proposed. The encoder learns two embeddings from visual and speech modalities, respectively, whereas each of the embeddings performs self-modal and cross-modal translation of modalities. Furthermore, to preserve the neighbourhood structure of fragments, which is important for video hyperlinking, the auto-encoder is devised to model data distribution of fragments in a dataset. Experiments are conducted on Blip10000 dataset using the anchor fragments provided by TRECVid Video Hyperlinking (LNK) task over the years of 2016 and 2017. This paper shares the empirical insights on a number of issues in cross-modal learning, including the preservation of neighbourhood structure in embedding, model fine-tuning and issue of missing modality, for video hyperlinking. [ABSTRACT FROM AUTHOR]

This paper describes a test compaction procedure that combines the advantages of using multicycle tests for test compaction with the advantages of using both broadside and skewed-load tests for increasing the fault coverage and achieving test compaction. The procedure is the first to combine these two concepts in a single procedure. The combination is made possible by a definition of a multicycle skewed-load test that is suggested in this paper, and complements the definition of a multicycle broadside test. Experimental results demonstrate the effectiveness of multicycle broadside and skewed-load tests in achieving test compaction for benchmark circuits. [ABSTRACT FROM AUTHOR]

Multicycle tests achieve test compaction by increasing the number of clock cycles between scan operations and reducing the number of tests. Tests in a compact multicycle test set typically have different numbers of clock cycles between their scan operations. This creates an opportunity to improve the test set by increasing the numbers of clock cycles between the scan operations of the tests, without increasing the number of tests and without exceeding a bound $L$ on the number of clock cycles. Motivated by this observation, this paper studies the padding of multicycle broadside and skewed-load tests for transition faults. After padding, all the tests have $L$ clock cycles between their scan operations. This paper makes several observations and defines new types of multicycle tests that are supported by commercial tools to allow padding to be performed without losing fault coverage. The new types of tests can be used for achieving a higher fault coverage, further test compaction, or an improved test set quality within the bound $L$. This paper develops padding procedures and presents experimental results for benchmark circuits to demonstrate these effects. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new method for solving multiobjective optimization problems with a large number of decision variables. The proposed method called weighted optimization framework is intended to serve as a generic method that can be used with any population-based metaheuristic algorithm. After explaining some general issues of large-scale optimization, we introduce a problem transformation scheme that is used to reduce the dimensionality of the search space and search for improved solutions in the reduced subspace. This involves so-called weights that are applied to alter the decision variables and are also subject to optimization. Our method relies on grouping mechanisms and employs a population-based algorithm as an optimizer for both original variables and weight variables. Different grouping mechanisms and transformation functions within the framework are explained and their advantages and disadvantages are examined. Our experiments use test problems with 2–3 objectives 40–5000 variables. Using our approach on three well-known algorithms and comparing its performance with other large-scale optimizers, we show that our method can significantly outperform most existing methods in terms of solution quality as well as convergence rate on almost all tested problems for many-variable instances. [ABSTRACT FROM PUBLISHER]

A logic diagnosis procedure provides information about the defects that are present in a faulty unit as a set of candidate faults. To obtain smaller, and more accurate, sets of candidate faults, a diagnostic test generation procedure produces a test set that distinguishes fault pairs. This paper observes that large sets of candidate faults are obtained when multiple defects are present in a faulty unit, even if a diagnostic test set is used for logic diagnosis. This points to the possibility that fault pairs do not provide a complete set of targets for diagnostic test generation. This paper analyzes the conditions that cause a large set of candidate faults to be formed under a particular logic diagnosis procedure and suggests new targets for diagnostic test generation. The experimental results for benchmark circuits demonstrate that a diagnostic test set can be improved by adding diagnostic tests for the new targets. [ABSTRACT FROM AUTHOR]

This paper introduces video domain generalization where most video classification networks degenerate due to the lack of exposure to the target domains of divergent distributions. We observe that the global temporal features are less generalizable, due to the temporal domain shift that videos from other unseen domains may have an unexpected absence or misalignment of the temporal relations. This finding has motivated us to solve video domain generalization by effectively learning the local-relation features of different timescales that are more generalizable, and exploiting them along with the global-relation features to maintain the discriminability. This paper presents the VideoDG framework with two technical contributions. The first is a new deep architecture named the Adversarial Pyramid Network, which improves the generalizability of video features by capturing the local-relation, global-relation, and cross-relation features progressively. On the basis of pyramid features, the second contribution is a new and robust approach of adversarial data augmentation that can bridge different video domains by improving the diversity and quality of augmented data. We construct three video domain generalization benchmarks in which domains are divided according to different datasets, different consequences of actions, or different camera views, respectively. VideoDG consistently outperforms the combinations of previous video classification models and existing domain generalization methods on all benchmarks. [ABSTRACT FROM AUTHOR]

Cooperative co-evolution (CC) is an evolutionary algorithm that adopts the divide-and-conquer strategy to solve large-scale optimization problems. It is difficult for CC to specify a suitable subpopulation size to solve different subproblems. The population diversity may be insufficient to search for the global optimum during subpopulations' evolution. In this paper, an adaptive method for enhancing population diversity is embedded in a contribution-based CC. In CC, there are two kinds of subpopulation: the convergent or stagnant subpopulations and the non-convergent and non-stagnant subpopulations. A method is proposed in the paper to evaluate the convergent and stagnant subpopulations' contributions to improving the best overall objective value, which is different from the contribution evaluation on the non-convergent and non-stagnant subpopulations. In each co-evolutionary cycle, the new CC adaptively determines to select a subpopulation, which can make a greater contribution to improving the best overall objective value, between the above two kinds of subpopulation to undergo evolution. When a convergent or stagnant subpopulation is selected to undergo evolution, the subpopulation is re-diversified to enhance its global search capability. Our experimental results and analysis suggest that the new CC algorithm can improve the performance of CC and serves as a competitive solver for large-scale optimization problems. [ABSTRACT FROM AUTHOR]

Availability of a common, shared benchmark to provide repeatable, quantifiable, and comparable results is an added value for any scientific community. International consortia provide benchmarks in a wide range of domains, being normally used by industry, vendors, and researchers for evaluating their software products. In this regard, a benchmark of untimed Petri net models was developed to be used in a yearly software competition driven by the Petri net community. However, to the best of our knowledge there is not a similar benchmark to evaluate solution techniques for Petri nets with timing extensions. In this paper, we propose an evaluation framework for the comparative analysis of generalized stochastic Petri nets (GSPNs) simulation techniques. Although we focus on simulation techniques, our framework provides a baseline for a comparative analysis of different GSPN solvers (e.g., simulators, numerical solvers, or other techniques). The evaluation framework encompasses a set of 50 GSPN models including test cases and case studies from the literature, and a set of evaluation guidelines for the comparative analysis. In order to show the applicability of the proposed framework, we carry out a comparative analysis of steady-state simulators implemented in three academic software tools, namely, GreatSPN, PeabraiN, and TimeNET. The results allow us to validate the trustfulness of these academic software tools, as well as to point out potential problems and algorithmic optimization opportunities. [ABSTRACT FROM AUTHOR]

In this paper, an expression for the Cramér–Rao bound (CRB) on the frequency and damping of electromechanical modes is derived. This provides an invaluable tool when documenting the performance capabilities of mode meter algorithms, as the CRB is used as a benchmark to which mode meter variance may be compared. It is shown that the derived CRB expression is supported by several well-known mode estimation phenomena, and it is numerically validated using the asymptotically efficient Prediction Error Method (PEM) on Monte Carlo simulations of an autoregressive moving average (ARMA) model. Finally, a practical use case is given, in which the CRB on the frequency and damping of an inter-area mode from the miniWECC system is used to compare the performance of several well-known mode meters in a study of how sample size affects accuracy. [ABSTRACT FROM AUTHOR]

In this paper, multihop device-to-device (D2D) communications for cell coverage extension are studied. An in-band underlay D2D mode is considered, and the aim is to satisfy the signal-to-noise-ratio requirements for pre-allocated resource blocks (RBs) on the downlink connections, the signal-to-interference-plus-noise-ratio requirements on pre-allocated RBs for every D2D sidelink connection, and a maximum allowable interference at the base station receiver on all uplink RBs. Power control and routing are performed to minimize the expended user equipment energy in the system while meeting these requirements. An optimization problem is formulated that turns out to be a mixed-integer nonlinear program, which is solved using the generalized Benders decomposition (GBD). The GBD breaks down the formulation into a master sub-problem, an auxiliary sub-problem, and a feasibility sub-problem. In this paper, we focus on finding efficient solution methods for the relaxed version of the master sub-problem that is responsible for generating lower bounds on the optimal objective function. Also, an efficient solution technique for the feasibility sub-problem is proposed. Furthermore, a benchmark disjoint scheme for the same problem is proposed, which performs routing and power control separately. The simulations are conducted to compare the performance of both schemes, which show the superiority of joint routing and power control scheme. [ABSTRACT FROM AUTHOR]

The vanilla Few-shot Learning (FSL) learns to build a classifier for a new concept from one or very few target examples, with the general assumption that source and target classes are sampled from the same domain. Recently, the task of Cross-Domain Few-Shot Learning (CD-FSL) aims at tackling the FSL where there is a huge domain shift between the source and target datasets. Extensive efforts on CD-FSL have been made via either directly extending the meta-learning paradigm of vanilla FSL methods, or employing massive unlabeled target data to help learn models. In this paper, we notice that in the CD-FSL task, the few labeled target images have never been explicitly leveraged to inform the model in the training stage. However, such a labeled target example set is very important to bridge the huge domain gap. Critically, this paper advocates a more practical training scenario for CD-FSL. And our key insight is to utilize a few labeled target data to guide the learning of the CD-FSL model. Technically, we propose a novel Generalized Meta-learning based Feature-Disentangled Mixup network, namely GMeta-FDMixup. We make three key contributions of utilizing GMeta-FDMixup to address CD-FSL. Firstly, we present two mixup modules – mixup-P and mixup-M that help facilitate utilizing the unbalanced and disjoint source and target datasets. These two novel modules enable diverse image generation for training the model on the source domain. Secondly, to narrow the domain gap explicitly, we contribute a novel feature disentanglement module that learns to decouple the domain-irrelevant and domain-specific features. By stripping the domain-specific features, we alleviate the negative effects caused by the domain inductive bias. Finally, we repurpose a new contrastive learning module, dubbed ConL. ConL prevents the model from only capturing category-related features via introducing contrastive loss. Thus, the generalization ability on novel categories is improved. Extensive experimental results on two benchmarks show the superiority of our setting and the effectiveness of our method. Code and models will be released. [ABSTRACT FROM AUTHOR]

Extracting robust and discriminative local features from images plays a vital role for long term visual localization, whose challenges are mainly caused by the severe appearance differences between matching images due to the day-night illuminations, seasonal changes, and human activities. Existing solutions resort to jointly learning both keypoints and their descriptors in an end-to-end manner, leveraged on large number of annotations of point correspondence which are harvested from the structure from motion and depth estimation algorithms. While these methods show improved performance over non-deep methods or those two-stage deep methods, i.e., detection and then description, they are still struggled to conquer the problems encountered in long term visual localization. Since the intrinsic semantics are invariant to the local appearance changes, this paper proposes to learn semantic-aware local features in order to improve robustness of local feature matching for long term localization. Based on a state of the art CNN architecture for local feature learning, i.e., ASLFeat, this paper leverages on the semantic information from an off-the-shelf semantic segmentation network to learn semantic-aware feature maps. The learned correspondence-aware feature descriptors and semantic features are then merged to form the final feature descriptors, for which the improved feature matching ability has been observed in experiments. In addition, the learned semantics embedded in the features can be further used to filter out noisy keypoints, leading to additional accuracy improvement and faster matching speed. Experiments on two popular long term visual localization benchmarks (Aachen Day and Night v1.1, Robotcar Seasons) and one challenging indoor benchmark (InLoc) demonstrate encouraging improvements of the localization accuracy over its counterpart and other competitive methods. [ABSTRACT FROM AUTHOR]

Localization performance in wireless networks has traditionally been benchmarked using the Cramér–Rao lower bound (CRLB), given a fixed geometry of anchor nodes and a target. However, by endowing the target and anchor locations with distributions, this paper recasts this traditional scalar benchmark as a random variable. The goal of this paper is to derive an analytical expression for the distribution of this now random CRLB, in the context of Time-of-Arrival-based positioning. To derive this distribution, this paper first analyzes how the CRLB is affected by the order statistics of the angles between consecutive participating anchors (i.e., internodal angles). This analysis reveals an intimate connection between the second largest internodal angle and the CRLB, which leads to an accurate approximation of the CRLB. Using this approximation, a closed-form expression for the distribution of the CRLB, conditioned on the number of participating anchors, is obtained. Next, this conditioning is eliminated to derive an analytical expression for the marginal CRLB distribution. Since this marginal distribution accounts for all target and anchor positions, across all numbers of participating anchors, it therefore statistically characterizes localization error throughout an entire wireless network. This paper concludes with a comprehensive analysis of this new network-wide-CRLB paradigm. [ABSTRACT FROM AUTHOR]

As the rate at which scientific work is published continues to increase, so does the need to discern high-impact publications. In recent years, there have been several approaches that seek to rank publications based on their expected citation-based impact. Despite this level of attention, this research area has not been systematically studied. Past literature often fails to distinguish between short-term impact, the current popularity of an article, and long-term impact, the overall influence of an article. Moreover, the evaluation methodologies applied vary widely and are inconsistent. In this work, we aim to fill these gaps, studying impact-based ranking theoretically and experimentally. First, we provide explicit definitions for short-term and long-term impact, and introduce the associated ranking problems. Then, we identify and classify the most important ideas employed by state-of-the-art methods. After studying various evaluation methodologies of the literature, we propose a specific benchmark framework that can help us better differentiate effectiveness across impact aspects. Using this framework we investigate: (1) the practical difference between ranking by short- and long-term impact, and (2) the effectiveness and efficiency of ranking methods in different settings. To avoid reporting results that are discipline-dependent, we perform our experiments using four datasets from different scientific disciplines. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) has two salient components: 1) a dynamical rule governing particle motion and 2) an interparticle communication topology. Recent practice has focused on the fully connected topology (Gbest) despite earlier indications on the superiority of local particle neighborhoods. This paper seeks to address the controversy with empirical trials with canonical PSO on a large benchmark of functions, categorized into 14 properties. This paper confirms the early lore that Gbest is the overall better algorithm for unimodal and separable problems and that a ring neighborhood of connectivity two (Lbest) is the preferred choice for multimodal, nonseparable and composition functions. Topologies of intermediate particle connectivity were also tested and the difference in global/local performance was found to be even more marked. A measure of significant improvement is introduced in order to distinguish major improvements from refinements. Lbest, according to the experiments on the 84 test functions and a bi-modal problem of adjustable severity, is found to have significant improvements later in the run, and to be more diverse at termination. A mobility study shows that Lbest is better able to jump between optimum basins. Indeed Gbest was unable to switch basins in the bi-modal trial. The implication is that Lbest’s larger terminal diversity, its better ability to basin hop and its later significant improvement account for the performance enhancement. In several cases where Lbest was not the better algorithm, the trials show that Lbest was not stuck but would have continued to improve with an extended evaluation budget. Canonical PSO is a baseline algorithm and the ancestor of all contemporary PSO variants. These variants build on the basic structure of baseline PSO and the broad conclusions of this paper are expected to follow through. In particular, research that fails to consider local topologies risks underplaying the success of the promoted algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a compact log-periodic dipole array (LPDA) antenna is developed at 0.5–10 GHz. This LPDA structure constitutes fewer dipole elements than a conventional LPDA antenna that exhibits similar resonant frequencies. In the design of a miniaturized LPDA antenna, various size-reduction techniques have been proposed in the open literature to decrease the lateral size of a conventional LPDA. However, little or no attention has been focused on reducing the size of the LPDA antenna by shortening the boom or axial length. In pursuit of reducing the total length of a conventional LPDA, a dual-band dipole antenna is proposed as the radiating elements for the LPDA antenna in this paper. The proposed dipole structure is a printed half-wave principal dipole loaded with a pair of resistive structures via subfeeding lines. A pair of resistive loads forms the auxiliary (secondary) dipole of the proposed dipole antenna. The structure of the proposed dual-band dipole is achieved without a ground plane as opposed to many existing dual-band antenna types. As a result, the dipole antenna has a simple geometry with omnidirectional characteristics. Also, the feeding structure of this dipole can provide an extra degree of freedom to tune the antenna for matching purposes. A 25-element LPDA antenna is designed with a much reduced boom length compared with existing LPDA structures. To confirm the feasibility of the technique, the experimental results of the proposed LPDA prototype were analyzed and juxtaposed with a benchmark LPDA. [ABSTRACT FROM AUTHOR]

RDF is being increasingly considered in a broad range of information management scenarios. Governments, large corporations, startups, and other organizations around the world are using RDF as a data model to represent and share knowledge. However, there is still a long evolutionary track with multiple challenges for RDF reaching the scale of the most recent Big Data intensive applications (e.g., Smart Cities, Sensor Networks, eHealth, Internet of Things). In this survey, we review the usage of NoSQL databases to the storage of large RDF graphs by rehearsing the latest surveys and expanding their findings by updating proposals and bringing light to aspects such as model mapping between RDF and NoSQL, triple indexing and partitioning, graph fragmentation and data caching. Moreover, we explain how the surveyed works extended the RDF capabilities so the datasets can benefit of the characteristics of scalability, schemaless data, and better overall performance of NoSQL databases. The survey summarizes the current state of art, discusses open problems, and proposes a Reference Architecture (RA). For the best of our knowledge, this is the first survey where the focus is solely on papers that use one or more NoSQL systems for the RDF persistence. [ABSTRACT FROM AUTHOR]

Electrical incidents provide valuable learning opportunities if root causes are identified. Incident investigations which are unable to identify all root causes and address the shortcomings in the safety management system may result in recurring incidents. It is important that the entire incident investigation programme be guided by proven techniques and executed in a well-established manner. In a white paper titled “The Development of Questions to Determine the Effectiveness of the Incident Investigation Process for Electrical Incidents,” the authors analyzed commonly applied incident investigation techniques and suggested six salient incident investigation process requirements irrespective of the techniques used. This paper also suggested eight constructs, which could be used to determine the effectiveness of the incident investigation process. This paper utilizes the established learning and applies it to a large steel plant. A number of serious electrical incidents spanning many years at different operating units were analytically reviewed. A study of the organizational policy and one completed incident investigation report is analyzed to determine the effectiveness of the incident investigation process. Shortcomings in the process are discussed and possible salient practices that derogate from effective investigations are proposed. This paper forms part of a larger research project to determine the effectiveness of the application of the incident investigation process. The results and recommendations from the study aim to provide generic benchmarking of the incident investigation process, which could be used by organizations to improve its electrical safety performance. [ABSTRACT FROM AUTHOR]

The hardness of fitness functions is an important research topic in the field of evolutionary computation. In theory, this paper can help with understanding the ability of evolutionary algorithms (EAs). In practice, this paper may provide a guideline to the design of benchmarks. The aim of this paper is to answer the following research questions. Given a fitness function class, which functions are the easiest with respect to an EA? Which are the hardest? How are these functions constructed? This paper provides theoretical answers to these questions. The easiest and hardest fitness functions are constructed for an elitist (1 + 1) EA to maximize a class of fitness functions with the same optima. It is demonstrated that the unimodal functions are the easiest and deceptive functions are the hardest in terms of the time-based fitness landscape. This paper also reveals that in a fitness function class, the easiest function to one algorithm may become the hardest to another algorithm, and vice versa. [ABSTRACT FROM AUTHOR]

In modern industries, data-driven fault detection and classification (FDC) systems can efficiently maintain industrial security and stability, while the security of the data-driven FDC system itself is rarely or even never considered. The security problem named adversarial vulnerability is the intrinsic of data-driven machine learning models, which will give incorrect predictions under the maliciously perturbed input data. This paper presents a work on this new security topic of the data-driven FDC systems, by 1) summarizing and comparing various recent and typical adversarial attack and defense methods for fault classifiers; 2) proposing novel attack and defense techniques for unsupervised fault detectors; 3) constructing a novel industrial adversarial security benchmark on FDC systems in the Tennessee-Eastman process (TEP) dataset; 4) exploring and discussing which attack is most potentially threatening for FDC systems and which defense technique is most applicable to mitigate attacks. The results reveal unique security properties of FDC systems, mainly including 1) for fault classifiers, black-box attack is close to the attack strength of white-box FGSM and the universal transferable attack is not significantly stronger than random noise; 2) weak adversarial training is excellent with high adversarial accuracy improvement and negligible clean accuracy decrease; 3) fault detectors are intrinsically more robust, and can be well protected by strong adversarial training. More intriguing properties and profound insights are demonstrated in the paper. This pioneering work could guide researchers and practitioners in discovering and navigating the field of FDC system adversarial robustness, outlining the research directions and open problems. [ABSTRACT FROM AUTHOR]

As our field matures, evaluation of visualization techniques has extended from reporting runtime performance to studying user behavior. Consequently, many methodologies and best practices for user studies have evolved. While maintaining interactivity continues to be crucial for the exploration of large data sets, no similar methodological foundation for evaluating runtime performance has been developed. Our analysis of 50 recent visualization papers on new or improved techniques for rendering volumes or particles indicates that only a very limited set of parameters like different data sets, camera paths, viewport sizes, and GPUs are investigated, which make comparison with other techniques or generalization to other parameter ranges at least questionable. To derive a deeper understanding of qualitative runtime behavior and quantitative parameter dependencies, we developed a framework for the most exhaustive performance evaluation of volume and particle visualization techniques that we are aware of, including millions of measurements on ten different GPUs. This paper reports on our insights from statistical analysis of this data, discussing independent and linear parameter behavior and non-obvious effects. We give recommendations for best practices when evaluating runtime performance of scientific visualization applications, which can serve as a starting point for more elaborate models of performance quantification. [ABSTRACT FROM AUTHOR]

Excessive switching activity in the fault-free circuit can cause a fault-free circuit to fail because of increased delays. For the same reason, excessive switching activity in a faulty circuit can cause a delay fault to escape detection. This paper observes that the switching activity is higher in the presence of multiple delay faults with higher multiplicities (larger numbers of single faults that are present in the circuit together). The challenge in addressing multiple faults is related to their large number. This paper addresses this challenge by an iterative procedure that is applied to transition faults under a low-power broadside test set, and has two subprocedures: 1) the first subprocedure finds multiple transition faults with excessive faulty switching activity and 2) the second subprocedure modifies the test set so as to avoid excessive faulty switching activity for the faults found by the first subprocedure. With every additional iteration there are fewer multiple transition faults that exhibit excessive faulty switching activity. The experimental results for benchmark circuits demonstrate the levels of excessive faulty switching activity in the presence of multiple transition faults, and the possibility of reducing or even eliminating it after a small number of iterations. [ABSTRACT FROM AUTHOR]

In high-throughput drug screening applications, as manual drug sample delivery is time-consuming and error-prone, there is an urgent need for accurate and efficient drug sample delivery biochip for large-scale microwell arrays. This paper proposes a new microfluidic biochip architecture, where drugs are automatically prepared with different concentration values, and then delivered into multiple microwells. For large-scale drug sample delivery biochips, the routing of drug sample delivery channels is a very challenging task without effective routing solutions. This paper proposes an ultrafast rule-based escape routing method, called URBER, to address the large-scale routing of drug sample delivery channels, which scales well in both runtime and memory even for a very large problem size. URBER runs very fast because it routes channels based on a set of predefined rules, which avoids runtime consumed in solution space exploration. All benchmarks for 30 ${\le }~{N}$ , ${M} {\le }~100$ have been tested, where ${N}$ and ${M}$ are the number of columns and rows of the terminal array. Among these benchmarks, about ~91.9% are routed with optimal solutions, and the runtime is order of magnitudes faster than optimal min-cost flow-based methods (speedup is from ~600 to ~340 k). Specifically, for all benchmarks with (${M}/{N}$) ${\in }$ ((3/4), (4/3)), optimal routing solutions are always obtained. URBER also shows promise of routing large-scale designs with up to 500 k terminals efficiently. [ABSTRACT FROM AUTHOR]

Network slicing enables an infrastructure provider (InP) to support heterogeneous 5G services over a common platform (i.e., by creating a customized slice for each service). Once in operation, slices can be dynamically scaled up/down to match the variation of their service requirements. An InP generates revenue by accepting a slice request. If a slice cannot be scaled up when required, an InP has to also pay a penalty (proportional to the level of service degradation). It becomes then crucial for an InP to decide which slice requests should be accepted/rejected in order to increase its net profit. This paper presents a slice admission strategy based on reinforcement learning (RL) in the presence of services with different priorities. The use case considered is a 5G flexible radio access network (RAN), where slices of different mobile service providers are virtualized over the same RAN infrastructure. The proposed policy learns which are the services with the potential to bring high profit (i.e., high revenue with low degradation penalty), and hence should be accepted. The performance of the RL-based admission policy is compared against two deterministic heuristics. Results show that in the considered scenario, the proposed strategy outperforms the benchmark heuristics by at least 23%. Moreover, this paper shows how the policy is able to adapt to different conditions in terms of 1) slice degradation penalty versus slice revenue factors, and 2) proportion of high versus low priority services. [ABSTRACT FROM AUTHOR]

This paper presents an approach to obtain high torque density in induction motor (IM) design by optimizing the search algorithms and processes. Optimal design of electrical machines has many sub-optimal peaks and requires significant computation time. To solve this problem, this paper proposes a new cost pattern value method (CPVM) for local search algorithms employed in optimal design. The CPVM concept is an intelligent strategy that digitizes the gradient over the searching region by sharing information between neighboring points. When the algorithm converges quickly to local optimum by a normalized weight method, it provides a mechanism to escape from that region. The validity of the proposed approach was evaluated using a benchmark function, and it was applied to optimal design of a 260 kW IM to maximize torque production based on a finite-element analysis. For better accuracy, we employ slip-frequency analysis compatible with vector control for an IM numerical analysis. [ABSTRACT FROM AUTHOR]

In this paper, we present positionable photonic waveguide arrays that are developed for optical chip-to-chip alignment. Partly suspended photonic structures, based on the Si3N4/SiO2 material platform, are equipped with thermal actuators enabling the free end of the structures to be positioned with submicrometer accuracy. A finite-element model is developed to provide insight in the way the design of the system affects the performance. The modeling results show that the expected vertical deflection and rotation are highly dependent on the array design. Measurements of fabricated devices confirm the trends that follow from the model and are used to assess the positioning performance. Moreover, the finite-element analysis gives guidelines for the design parameters of an optimal positionable photonic waveguide array. By following these guidelines, all the requirements for the intended photonic alignment can be fulfilled, which is validated by measurements. The stability over time of the positioning system is experimentally determined and is also sufficient. Measured mode field profiles of partly suspended waveguide beams with 1 \mu \textm \,\, \times 220 nm (width $\times $ thickness) sized waveguide cores show correct waveguiding functionality. Finally, an alignment experiment demonstrates how three adjacent waveguide beams within a positionable waveguide array can be actively aligned with the channels of another photonic chip. [2017-0046] [ABSTRACT FROM PUBLISHER]

This paper investigates the design of non-binary protograph low-density parity-check codes for the Poisson channel with $m$ -ary pulse position modulation. The field order over which the code is constructed is matched to the pulse position modulation order yielding a coded modulation scheme. The optimization of the low-density parity-check code structure is performed via protograph density evolution on a surrogate $m$ -ary erasure channel. The surrogate design is illustrated to be not only accurate, but also robust for a range of practical values of channel background noise and various modulation orders. As a result the proposed codes show excellent performance over the Poisson channel with pulse position modulation outperforming competing schemes. As a side-product of this paper, finite-length benchmarks on the block error probability are provided, together with a union bound to characterize the code performance in the error floor region. [ABSTRACT FROM AUTHOR]

While early AutoML frameworks focused on optimizing traditional ML pipelines and their hyperparameters, a recent trend in AutoML is to focus on neural architecture search. In this paper, we introduce Auto-PyTorch, which brings together the best of these two worlds by jointly and robustly optimizing the network architecture and the training hyperparameters to enable fully automated deep learning (AutoDL). Auto-PyTorch achieves state-of-the-art performance on several tabular benchmarks by combining multi-fidelity optimization with portfolio construction for warmstarting and ensembling of deep neural networks (DNNs) and common baselines for tabular data. To thoroughly study our assumptions on how to design such an AutoDL system, we additionally introduce a new benchmark on learning curves for DNNs, dubbed LCBench, and run extensive ablation studies of the full Auto-PyTorch on typical AutoML benchmarks, eventually showing that Auto-PyTorch performs better than several state-of-the-art competitors. [ABSTRACT FROM AUTHOR]

Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the input and those close to the output. In this paper, we embrace this observation and introduce the Dense Convolutional Network (DenseNet), which connects each layer to every other layer in a feed-forward fashion. Whereas traditional convolutional networks with $L$ L layers have $L$ L connections—one between each layer and its subsequent layer—our network has $\frac{L(L+1)}{2}$ L (L + 1) 2 direct connections. For each layer, the feature-maps of all preceding layers are used as inputs, and its own feature-maps are used as inputs into all subsequent layers. DenseNets have several compelling advantages: they alleviate the vanishing-gradient problem, encourage feature reuse and substantially improve parameter efficiency. We evaluate our proposed architecture on four highly competitive object recognition benchmark tasks (CIFAR-10, CIFAR-100, SVHN, and ImageNet). DenseNets obtain significant improvements over the state-of-the-art on most of them, whilst requiring less parameters and computation to achieve high performance. [ABSTRACT FROM AUTHOR]

Weight sharing promises to make neural architecture search (NAS) tractable even on commodity hardware. Existing methods in this space rely on a diverse set of heuristics to design and train the shared-weight backbone network, a.k.a. the super-net. Since heuristics substantially vary across different methods and have not been carefully studied, it is unclear to which extent they impact super-net training and hence the weight-sharing NAS algorithms. In this paper, we disentangle super-net training from the search algorithm, isolate 14 frequently-used training heuristics, and evaluate them over three benchmark search spaces. Our analysis uncovers that several commonly-used heuristics negatively impact the correlation between super-net and stand-alone performance, whereas simple, but often overlooked factors, such as proper hyper-parameter settings, are key to achieve strong performance. Equipped with this knowledge, we show that simple random search achieves competitive performance to complex state-of-the-art NAS algorithms when the super-net is properly trained. [ABSTRACT FROM AUTHOR]

The empirical nature of Information Retrieval (IR) mandates strong experimental practices. A keystone of such experimental practices is the Cranfield evaluation paradigm. Within this paradigm, the collection of relevance judgments has been the subject of intense scientific investigation. This is because, on one hand, consistent, precise, and numerous judgements are keys to reducing evaluation uncertainty and test collection bias; on the other hand, however, relevance judgements are costly to collect. The selection of which documents to judge for relevance, known as pooling method, has therefore a great impact on IR evaluation. In this paper we focus on the bias introduced by the pooling method, known as pool bias, which affects the reusability of test collections, in particular when building test collections with a limited budget. In this paper we formalize and evaluate a set of 22 pooling strategies based on: traditional strategies, voting systems, retrieval fusion methods, evaluation measures, and multi-armed bandit models. To do this we run a large-scale evaluation by considering a set of 9 standard TREC test collections, in which we show that the choice of the pooling strategy has significant effects on the cost needed to obtain an unbiased test collection. We also identify the least biased pooling strategy in terms of pool bias according to three IR evaluation measures: AP, NDCG, and P@10. [ABSTRACT FROM AUTHOR]

Timing-based side and covert channels in processor caches continue to be a threat to modern computers. This work shows for the first time, a systematic, large-scale analysis of Arm devices and the detailed results of attacks the processors are vulnerable to. Compared to x86, Arm uses different architectures, microarchitectural implementations, cache replacement policies, etc., which affects how attacks can be launched, and how security testing for the vulnerabilities should be done. To evaluate security, this paper presents security benchmarks specifically developed for testing Arm processors and their caches. The benchmarks are evaluated with sensitivity tests, which examine how sensitive the benchmarks are to having a correct configuration in the testing phase. Further, to evaluate a large number of devices, this work leverages a novel approach of using a cloud-based Arm device testbed for architectural and security research on timing channels and runs the benchmarks on 34 different physical devices. In parallel, there has been much interest in secure caches to defend the various attacks. Consequently, this paper also investigates secure cache architectures using proposed benchmarks. Especially, this paper implements and evaluates secure PL and RF caches, showing the security of PL and RF caches, but also uncovers new weaknesses. [ABSTRACT FROM AUTHOR]

In this paper, we make the first benchmark effort to elaborate on the superiority of using RAW images in the low light enhancement and develop a novel alternative route to utilize RAW images in a more flexible and practical way. Inspired by a full consideration on the typical image processing pipeline, we are inspired to develop a new evaluation framework, Factorized Enhancement Model (FEM), which decomposes the properties of RAW images into measurable factors and provides a tool for exploring how properties of RAW images affect the enhancement performance empirically. The empirical benchmark results show that the Linearity of data and Exposure Time recorded in meta-data play the most critical role, which brings distinct performance gains in various measures over the approaches taking the sRGB images as input. With the insights obtained from the benchmark results in mind, a RAW-guiding Exposure Enhancement Network (REENet) is developed, which makes trade-offs between the advantages and inaccessibility of RAW images in real applications in a way of using RAW images only in the training phase. REENet projects sRGB images into linear RAW domains to apply constraints with corresponding RAW images to reduce the difficulty of modeling training. After that, in the testing phase, our REENet does not rely on RAW images. Experimental results demonstrate not only the superiority of REENet to state-of-the-art sRGB-based methods and but also the effectiveness of the RAW guidance and all components. [ABSTRACT FROM AUTHOR]

Single-guide RNA is a guide RNA (gRNA), which guides the insertion or deletion of uridine residues into kinetoplastid during RNA editing. It is a small non-coding RNA that can be combined with pre -mRNA pairing. SgRNA is a critical component of the CRISPR/Cas9 gene knockout system and play an important role in gene editing and gene regulation. It is important to accurately and quickly identify highly on-target activity sgRNAs. Due to its importance, several computational predictors have been proposed to predict sgRNAs on-target activity. All these methods have clearly contributed to the development of this very important field. However, they also have certain limitations. In the paper, we developed a new classifier SgRNA-RF, which extracts the features of nucleic acid composition and structure of on-target activity sgRNA sequence and identified by random forest algorithm. In addition to solving an imbalanced dataset, this paper proposed a new method called CS-Smote. We compared sgRNA-RF with state-of-the-art predictors on the five datasets, and found SgRNA-RF significantly improved the identification accuracy, with accuracies of 0.8636,0.9161,0.894,0.938,0.965,0.77,0.979,0.973, respectively. The user-friendly web server that implements sgRNA-RF is freely available at http://server.malab.cn/sgRNA-RF/. [ABSTRACT FROM AUTHOR]

This paper provides a benchmark of the performance of 23 classical and state-of-the-art background subtraction (BS) algorithms on visible range and near infrared range videos in the Singapore Maritime dataset. Importantly, our study indicates the limitations of the conventional performance evaluation criteria for maritime vision and proposes new performance evaluation criteria that is better suited to this problem. This paper provides insight into the specific challenges of BS in maritime vision. We identify four open challenges that plague BS methods in maritime scenario. These include spurious dynamics of water, wakes, ghost effect, and multiple detections. Poor recall and extremely poor precision of all the 23 methods, which have been otherwise successful for other challenging BS situations, allude to the need for new BS methods custom designed for maritime vision. [ABSTRACT FROM AUTHOR]

Over the last few decades, pattern classification has become one of the most important fields of artificial intelligence because it constitutes an essential component in many different real-world applications. Artificial neural networks and fuzzy logic are two most widely used models in pattern classification. To build an efficient and powerful model, researchers have introduced hybrid models that combine both fuzzy logic and artificial neural networks. Among the hybrid models, the fuzzy min–max (FMM) neural network has been proven to be a premier model for undertaking pattern classification problems. While FMM is useful in terms of its capability of online learning, it suffers from several limitations in the learning procedure. Therefore, over the past years, researchers have proposed numerous improvements to overcome the limitations of the original FMM model. This paper carries out a comprehensive survey of the developments conducted on the FMM model for pattern classification. In order to assist recent researchers in selecting the most suitable FMM variant and to provide proper guidance for future developments, this study divides the variants of FMM into two main board categories, namely FMM variants with and without contraction. This division facilitates understanding of the developments conducted by researchers on the original FMM neural network, as well as provides the scope to identify the limitations that still exist in the FMM models. This paper also summarizes the use of FMM and its variants in solving different benchmark and real-world problems. Finally, the possible future trends are highlighted. [ABSTRACT FROM AUTHOR]

RNA inverse folding problem is a bioinformatics problem where the objective is to find an RNA sequence that folds into a given target secondary structure. In this paper, we use evolutionary computation to solve a new and innovative multiobjective definition of this problem. In this new multiobjective definition of the problem, we have considered the similarity between target and predicted structures as a constraint, and three objective functions: 1) partition function (free energy of the ensemble); 2) ensemble diversity; and 3) nucleotides composition. The multiobjective metaheuristic to design RNA sequences (m2dRNAs) proposed in this paper is compared against other RNA inverse folding methods published in the literature, such as RNAinverse, RNA secondary structure designer, inverse folding of RNA, MODENA, NUPACK, fRNAkenstein, dynamics in sequence space optimization, RNAiFOLD, antaRNA, evolutionary RNA design, and Eterna players. After a comprehensive comparative study on two well-known benchmarks (Rfam and Eterna100), we conclude that m2dRNAs is capable of obtaining very promising results in terms of both quality of RNA designs and required runtime. The source code of m2dRNAs is available at http://arco.unex.es/arl/m2dRNAs-source_code.zip. [ABSTRACT FROM AUTHOR]

Timing analysis and timing closure are critical steps in digital circuit design. To ensure an error-free design, timing constraints are usually set-based upon the longest path delay from static timing analysis. However, a circuit could have dramatically different internal activity because of the variation of input workload. The path with the longest delay may not be active for certain input workloads, which would enable timing speculation for increased performance. This paper describes an approach to identify the greatest contributors of timing errors and mitigate those errors by replacing certain standard cells in the design. We evaluated our mitigation for several benchmark designs and demonstrated an error-free performance gain up to 37%. The entire design flow uses Synopsys electronic design automation tools and customized scripts, which can be adapted for other designs. [ABSTRACT FROM AUTHOR]

The killer features of the next-generation 5G mobile standard, including mobile edge computing and network slicing, will be very difficult to support with traditional fixed-function network appliances. Rather, the 5G core will depend on programmable switches, which allow packet processing functionality to be reconfigured on the fly in order to deploy virtualized network functions and service chains instantaneously. With 5G on the close horizon, it has become crucial to identify the price for programmability in the software data plane, considering the expected complexity and scale of the next-generation mobile core. In this paper, we report on a multi-year data-plane scalability study we have conducted for a large mobile vendor. Our results paint a rather pessimistic picture on the current landscape of the programmable software data plane. We find that the prominent programmable switches either do not provide all the features necessary to implement 5G telco pipelines efficiently or struggle to meet the scale, and the performance operators have come to expect from conventional fixed-function appliances. The only exception, ESwitch, remains proprietary. We call for further work on data-plane scalability and sketch some directions for future research. [ABSTRACT FROM AUTHOR]

Smartphones dominate the consumer electronics market. Heterogeneous multicore processors are nowadays often integrated into smartphones. The power and performance evaluation of mobile multicore processors is a key issue in their design. This paper is the first to address the issue of improving the power and performance in modern, multicore smartphones by revisiting existing benchmarks used for evaluating these devices. Unlike earlier computers, modern consumer devices execute workloads that are characterized by heterogeneous concurrently running processes, which are launched at different times. Yet, modern smartphones architecture designs are still being evaluated using representative benchmark suites comprised of individual programs. This method of evaluation can be very misleading, as it does not represent the way these devices are actually being used. This paper first proposes a novel learning framework that identifies representative usage patterns of various real workloads, where each representative pattern represents a single class in a heterogeneous collection of actual usage patterns. We then use these representative patterns to optimize the power and performance of common multicore computer architectures integrated into smartphones. Our experiments show that using our representative patterns for optimization results in,on average, 11.5% and 16.7% power and performance improvements, respectively, compared to the state-of-art optimization methods. [ABSTRACT FROM AUTHOR]

Cooperative co-evolution (CC) is an evolutionary computation framework that can be used to solve high-dimensional optimization problems via a “divide-and-conquer” mechanism. However, the main challenge when using this framework lies in problem decomposition. That is, deciding how to allocate decision variables to a particular subproblem, especially interacting decision variables. Existing decomposition methods are typically computationally expensive. In this paper, we propose a new decomposition method, which we call recursive differential grouping (RDG), by considering the interaction between decision variables based on nonlinearity detection. RDG recursively examines the interaction between a selected decision variable and the remaining variables, placing all interacting decision variables into the same subproblem. We use analytical methods to show that RDG can be used to efficiently decompose a problem, without explicitly examining all pairwise variable interactions. We evaluated the efficacy of the RDG method using large scale benchmark optimization problems. Numerical simulation experiments showed that RDG greatly improved the efficiency of problem decomposition in terms of time complexity. Significantly, when RDG was embedded in a CC framework, the optimization results were better than results from seven other decomposition methods. [ABSTRACT FROM AUTHOR]

In this paper, 2.5-D integrated circuits (ICs) using bridge-chip technology are thermally evaluated to investigate thermal challenges and opportunities for such multi-die packages. To this end, the objectives of this paper are twofold. First, thermal benchmarking of a number of 2.5-D integration approaches is performed and compared to 3-D ICs for completeness. Thermal modeling shows that the evaluated 2.5-D integration approaches exhibit similar thermal characteristics, but show significant improvements compared to 3-D IC solutions with the same power consumption. Second, this paper explores bridge-chip-based 2.5-D integrated systems as a function of bridge-chip thickness, thermal interface material properties, microbump properties, die thickness, die thickness mismatch, and die-to-die spacing along with transient analysis to investigate time-domain thermal coupling. Results suggest that a die thickness mismatch of 100 \mu \textm can increase the maximum temperature by 25.8% Therefore, the die thickness mismatch should be kept as small as possible, and the hottest die should be the thickest. Moreover, reducing die-to-die space from 1 to 0 mm increases thermal coupling, and the low-power dice, such as DRAM, can have a temperature increase of 6.1%. [ABSTRACT FROM PUBLISHER]

For many real-world optimization problems, evaluating a solution involves running a computationally expensive simulation model. This makes it challenging to use evolutionary algorithms that usually have to evaluate thousands of solutions before converging. On the other hand, in many cases, even a prematurely stopped run of the simulation may serve as a cheaper, albeit less accurate (low fidelity), estimate of the true fitness value. For evolutionary optimization, this opens up the opportunity to decide about the simulation run length for each individual. In this paper, we propose a mechanism that is capable of learning the appropriate simulation run length for each solution. To test our approach, we propose two new benchmark problems, one simple artificial benchmark function and one benchmark based on a computational fluid dynamics (CFDs) simulation scenario to design a toy submarine. As we demonstrate, our proposed algorithm finds good solutions much more quickly than always using the full CFDs simulation and provides much better solution quality than a strategy of progressively increasing the fidelity level over the course of optimization. [ABSTRACT FROM PUBLISHER]

It was shown earlier that certain primary input values have a negative effect on the fault coverage of a functional test sequence when they appear repeatedly in the sequence. A gate-level sequential test generation procedure based on this observation computed a primary input cube c with preferred values, and generated random functional test sequences that conformed to c with a high probability 0.5 \leq p < 1 . This procedure selected values for p out of a set of possible values, and assigned the same value of p to all the primary inputs. Motivated by the low computational complexity of this procedure, this paper addresses the selection of p and the possibility of using different values of p for different primary inputs. The goal is to increase the fault coverage and reduce the number of functional test sequences. The procedure described in this paper adjusts a functional test sequence to a circuit by complementing values that conflict with c . The procedure requires fewer functional test sequences to reach or exceed the fault coverage of the earlier procedure for benchmark circuits. The procedure can be applied to any functional test sequence or set of functional test sequences. [ABSTRACT FROM AUTHOR]

Low-power is one of the key driving forces in modern very large scale integration systems. Recent studies show that 3-D integrated circuits (ICs) offer a significant power saving over 2-D ICs. However, these studies are mainly limited to two-tier (2-tier) designs. Thus, in this paper, we extend our target to three-tier (3-tier) 3-D ICs. This paper first shows that the one additional tier available in 3-tier 3-D ICs does offer more power saving compared with their 2-tier 3-D IC counterparts, but more careful floorplanning, through-silicon via management, and block folding considerations are required. Second, we find that the 3-tiers can be bonded in several different ways: 1) face-to-back only; 2) face-to-face and face-to-back combined; and 3) back-to-back and face-to-face combined. This paper shows that these choices pose additional challenges in design optimizations for more power saving. Lastly, we develop effective computer-aided-design solutions that are seamlessly integrated into commercial 2-D IC tools to handle 3-tier 3-D IC power optimization under various bonding style options. With our low-power design methods combined, our 3-tier 3-D ICs provide −14.8% more power reduction over 2-tier 3-D ICs, and −36.0% over 2-D ICs in microprocessor cores under the same performance. In full-chip microprocessors, our 3-tier 3-D ICs provide −27.2% more power reduction over 2-D ICs. [ABSTRACT FROM PUBLISHER]

The papers in this special section focus on human face and body image analysis, one of the most researched objects. One of the main reasons behind this popularity lies in the numerous applications of automatic face and body gesture analysis algorithms, that span several fields such as Human-Computer and Human-Robot Interaction (facial expression/body gesture recognition for automatic analysis of affect), medicine and healthcare (detection of emotional and cognitive disorders), as well as biometrics (face recognition, gait recognition). The papers in this section focus on recent efforts towards catalysing progress in automatic analysis of human behaviour in uncontrolled, "in-the-wild" conditions. We summarize research efforts towards the development of research methodologies, database collections and benchmarks, as well as algorithms and systems for machine analysis of human behaviour, focusing on facial expressions, body gestures, speech, as well as various other sensors. We are delighted that the special issue includes authors both from academia as well as the industry. [ABSTRACT FROM AUTHOR]

Discovering patterns in biological sequences is a crucial step to extract useful information from them. Motifs can be viewed as patterns that occur exactly or with minor changes across some or all of the biological sequences. Motif search has numerous applications including the identification of transcription factors and their binding sites, composite regulatory patterns, similarity among families of proteins, etc. The general problem of motif search is intractable. One of the most studied models of motif search proposed in literature is Edit-distance based Motif Search (EMS). In EMS, the goal is to find all the patterns of length l that occur with an edit-distance of at most d in each of the input sequences. EMS algorithms existing in the literature do not scale well on challenging instances and large datasets. In this paper, the current state-of-the-art EMS solver is advanced by exploiting the idea of dimension reduction. A novel idea to reduce the cardinality of the alphabet is proposed. The algorithm we propose, EMS3, is an exact algorithm. I.e., it finds all the motifs present in the input sequences. EMS3 can be also viewed as a divide and conquer algorithm. In this paper, we provide theoretical analyses to establish the efficiency of EMS3. Extensive experiments on standard benchmark datasets (synthetic and real-world) show that the proposed algorithm outperforms the existing state-of-the-art algorithm (EMS2). [ABSTRACT FROM AUTHOR]