query: Bat Algorithm and Cuckoo Search: A Tutorial

positive: Lévy flights, non-local search and simulated annealing We solve a problem of non-convex stochastic optimisation with help of simulated annealing of Lévy flights of a variable stability index. The search of the ground state of an unknown potential is non-local due to big jumps of the Levy flights process. The convergence to the ground state is fast due to a polynomial decrease rate of the temperature.

positive: Cuckoo Search via Lévy flights In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Lévy flight behaviour of some birds and fruit flies. We validate the proposed algorithm against test functions and then compare its performance with those of genetic algorithms and particle swarm optimization. Finally, we discuss the implication of the results and suggestion for further research.

positive: Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems In this study, a new metaheuristic optimization algorithm, called cuckoo search (CS), is introduced for solving structural optimization tasks. The new CS algorithm in combination with Lévy flights is first verified using a benchmark nonlinear constrained optimization problem. For the validation against structural engineering optimization problems, CS is subsequently applied to 13 design problems reported in the specialized literature. The performance of the CS algorithm is further compared with various algorithms representative of the state of the art in the area. The optimal solutions obtained by CS are mostly far better than the best solutions obtained by the existing methods. The unique search features used in CS and the implications for future research are finally discussed in detail.

positive: Survey of multi-objective optimization methods for engineering Asurveyofcurrentcontinuousnonlinearmultiobjective optimization (MOO) concepts and methods is presented. It consolidates and relates seemingly different terminology and methods. The methods are divided into three major categories: methods with a priori articulation of preferences, methods with a posteriori articulation of preferences, and methods with no articulation of preferences. Genetic algorithms are surveyed as well. Commentary is provided on three fronts, concerning the advantages and pitfalls of individual methods, the different classes of methods, and the field of MOO as a whole. The Characteristics of the most significant methods are summarized. Conclusions are drawn that reflect often-neglected ideas and applicability to engineering problems. It is found that no single approach is superior. Rather, the selection of a specific method depends on the type of information that is provided in the problem, the user’s preferences, the solution requirements, and the availability of software.

positive: Genetic Algorithms in Search Optimization and Machine Learning This book brings together-in an informal and tutorial fashion-the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems...

negative: Visual Concepts and Compositional Voting It is very attractive to formulate vision in terms of pattern theory [26], where patterns are defined hierarchically by compositions of elementary building blocks. But applying pattern theory to real world images is currently less successful than discriminative methods such as deep networks. Deep networks, however, are black-boxes which are hard to interpret and can easily be fooled by adding occluding objects. It is natural to wonder whether by better understanding deep networks we can extract building blocks which can be used to develop pattern theoretic models. This motivates us to study the internal representations of a deep network using vehicle images from the PASCAL3D+ dataset. We use clustering algorithms to study the population activities of the features and extract a set of visual concepts which we show are visually tight and correspond to semantic parts of vehicles. To analyze this we annotate these vehicles by their semantic parts to create a new dataset, VehicleSemanticParts, and evaluate visual concepts as unsupervised part detectors. We show that visual concepts perform fairly well but are outperformed by supervised discriminative methods such as Support Vector Machines (SVM). We next give a more detailed analysis of visual concepts and how they relate to semantic parts. Following this, we use the visual concepts as building blocks for a simple pattern theoretical model, which we call compositional voting. In this model several visual concepts combine to detect semantic parts. We show that this approach is significantly better than discriminative methods like SVM and deep networks trained specifically for semantic part detection. Finally, we return to studying occlusion by creating an annotated dataset with occlusion, called VehicleOcclusion, and show that compositional voting outperforms even deep networks when the amount of occlusion becomes large.

negative: Universal coding, information, prediction, and estimation A connection between universal codes and the problems of prediction and statistical estimation is established. A‘known lower bound for the mean length of universal codes is sharpened and generalized, and optimum universal codes constructed. The bound is defined to give the information in strings relative to the considered class of processes. The earlier derived minimum description length criterion for estimation of parameters, including their number, is given a fundamental information, theoretic justification by showing that its estimators achieve the information in the strings. It is also shown that one cannot do prediction in Manuscript received July 13,1983; revised January 16,1984. This work was presented in part at the IEEE International Symposium on Information Theory, St. Jovite, Canada, September 26-30, 1983. This work was done while the author was Visiting Professor at the Department of System Science, University of California, Los Angeles, while on leave from the IBM Research Laboratory, San Jose, CA 95193. Gaussian autoregressive moving average (ARMA) processes below a bound, which is determined by the information in the data.

negative:
Social Collaborative Viewpoint Regression with Explainable Recommendations A recommendation is called explainable if it not only predicts a numerical rating for an item, but also generates explanations for users' preferences. Most existing methods for explainable recommendation apply topic models to analyze user reviews to provide descriptions along with the recommendations they produce. So far, such methods have neglected user opinions and influences from social relations as a source of information for recommendations, even though these are known to improve the rating prediction.
 In this paper, we propose a latent variable model, called social collaborative viewpoint regression (sCVR), for predicting item ratings based on user opinions and social relations. To this end, we use so-called viewpoints, represented as tuples of a concept, topic, and a sentiment label from both user reviews and trusted social relations. In addition, such viewpoints can be used as explanations. We apply a Gibbs EM sampler to infer posterior distributions of sCVR. Experiments conducted on three large benchmark datasets show the effectiveness of our proposed method for predicting item ratings and for generating explanations.

negative: Continuous Queries over Append-Only Databases In a database to which data is continually added, users may wish to issue a permanent query and be notified whenever data matches the query. If such continuous queries examine only single records, this can be implemented by examining each record as it arrives. This is very efficient because only the incoming record needs to be scanned. This simple approach does not work for queries involving joins or time. The Tapestry system allows users to issue such queries over a database of mail and bulletin board messages. The user issues a static query, such as “show me all messages that have been replied to by Jones,” as though the database were fixed and unchanging. Tapestry converts the query into an incremental query that efficiently finds new matches to the original query as new messages are added to the database. This paper describes the techniques used in Tapestry, which do not depend on triggers and thus be implemented on any commercial database that supports SQL. Although Tapestry is designed for filtering mail and news messages, its techniques are applicable to any append-only database.

negative: Data Governance Maturity Model for Micro Financial Organizations in Peru Micro finance organizations play an important role since they facilitate integration of all social classes to sustained economic growth. Against this background, exponential growth of data, resulting from transactions and operations carried out with these companies on a daily basis, becomes imminent. Appropriate management of this data is therefore necessary because, otherwise, it will result in a competitive disadvantage due to the lack of valuable and quality information for decision-making and process improvement. Data Governance provides a different approach to data management, as seen from the perspective of business assets. In this regard, it is necessary that the organization have the ability to assess the extent to which that management is correct or is generating expected results. This paper proposes a data governance maturity model for micro finance organizations, which frames a series of formal requirements and criteria providing an objective diagnosis. This model was implemented based on the information of a Peruvian micro finance organization. Four domains, out of the seven listed in the model, were evaluated. Finally, after validation of the proposed model, it was evidenced that it serves as a means for identifying the gap between data management and objectives set.

negative: The Use of Case-Based Reasoning for the Monitoring of Financial Fraud Transactions Financial transaction fraud constitutes an acute problem domain for detection and early warning systems. Despite that different branches of AI have been addressing the problem since the late 90s, CBR approaches have seldom been applied. This paper provides a proof of concept approach and experimental investigation for the use of a CBR Intelligent Monitoring System for detecting abnormal patterns in financial transaction flows. The representation of workflow related knowledge in this research using graphs is explained. The workflow process is orchestrated by a software system using BPEL technologies within a service-oriented architecture. Workflow cases are represented in terms of events and their corresponding temporal relationships. The matching and CBR retrieval mechanisms used in this research are explained and a simple evaluation of the approach is provided using simulation data. Further work on the system and the extension to a full intelligent monitoring and process optimisation system is finally presented.

negative: Source Code Analysis: A Road Map The automated and semi-automated analysis of source code has remained a topic of intense research for more than thirty years. During this period, algorithms and techniques for source-code analysis have changed, sometimes dramatically. The abilities of the tools that implement them have also expanded to meet new and diverse challenges. This paper surveys current work on source-code analysis. It also provides a road map for future work over the next five-year period and speculates on the development of source-code analysis applications, techniques, and challenges over the next 10, 20, and 50 years.

negative: Light at the End of the Tunnel: High-Speed LiDAR-Based Train Localization in Challenging Underground Environments In this paper, we present an infrastructure-free mapping and localization framework for rail vehicles using only a lidar sensor. Our method is designed to handle the pathological environment found in modern underground tunnels: narrow, parallel, and relatively smooth concrete walls with very little infrastructure to break up the empty spaces in the tunnel. By using an RQE-based, point-cloud alignment approach, we are able to implement a sliding-window algorithm, used for both mapping and localization. We demonstrate the proposed method with datasets gathered on a subway train travelling at high speeds (up to 70 km/h) in an underground tunnel for a total of 20 km across 6 runs. Our method is capable of mapping the tunnel with less than 0.6% error over the total length of the generated map. It is capable of continuously localizing, relative to the generated map, to within 10 cm in stations and at crossovers, and 1.8 m in pathological sections of tunnel. This method improves rail-based localization in a tunnel, which can be used to increase capacity on existing railways and for automated trains.

negative: TaxoFinder: A Graph-Based Approach for Taxonomy Learning Taxonomy learning is an important task for knowledge acquisition, sharing, and classification as well as application development and utilization in various domains. To reduce human effort to build a taxonomy from scratch and improve the quality of the learned taxonomy, we propose a new taxonomy learning approach, named TaxoFinder. TaxoFinder takes three steps to automatically build a taxonomy. First, it identifies domain-specific concepts from a domain text corpus. Second, it builds a graph representing how such concepts are associated together based on their co-occurrences. As the key method in TaxoFinder, we propose a method for measuring associative strengths among the concepts, which quantify how strongly they are associated in the graph, using similarities between sentences and spatial distances between sentences. Lastly, TaxoFinder induces a taxonomy from the graph using a graph analytic algorithm. TaxoFinder aims to build a taxonomy in such a way that it maximizes the overall associative strengths among the concepts in the graph to build a taxonomy. We evaluate TaxoFinder using gold-standard evaluation on three different domains: emergency management for mass gatherings, autism research, and disease domains. In our evaluation, we compare TaxoFinder with a state-of-the-art subsumption method and show that TaxoFinder is an effective approach significantly outperforming the subsumption method.

negative: A Survey of Caching Mechanisms in Information-Centric Networking Information-Centric Networking (ICN) is a novel networking paradigm that attracts increasing research interests in recent years. In-network caching has been viewed as an attractive feature of ICN because it can reduce network traffic, alleviate server bottleneck, and reduce the user access latencies. Because of this, the network community has proposed many in-network caching mechanisms that aim at optimizing various performance metrics such as cache hit ratio and cache hit distance. In this survey, we present a comprehensive overview of the recently proposed in-network caching mechanisms for ICN. For each caching mechanism, we describe it in detail, present examples to illustrate how it works, and analyze its possible benefits and drawbacks. We also compare some typical in-network caching mechanisms through extensive simulations and discuss the remaining research challenges.

negative: Convolutional Self Organizing Map Recently, deep learning became very popular, and was applied to many fields. The convolutional neural networks are often used for representing the layers for deep learning. In this paper, we propose Convolutional Self Organizing Map, which can be applicable to deep learning. Conventional Self Organizing Map uses single layered architecture, and can visualizes and classifies the input data on 2 dimensional map. SOMs which uses multiple layers are already proposed. In this paper, we propose Self Organizing Map algorithms which include convolutional layers. 2 types of convolution methods, which are based on conventional method and inspired from Self Organizing Map algorithm are proposed, and the performance of both method is examined in the experiments of clustering image data.

negative: Probabilistic neural network and its application Nuclear marine apparatus is a huge complicated system, most of which equipments are of nonlin-earity, time varying, coupling and inexactness. Neuralnet is widely applied in nuclear fault diagnosis for its approaching any kinds of nonlinearity mapping. At present, BP neural net is used more widely, but the layers of the net and the neurones on each layer can not be delimited easily; such net may fall into the minimum point in the course of training. In this essay, PNN proves effective in diagnosing faults on nuclearmarine apparatus.

negative: A novel topology design approach using an integrated deep learning network architecture Topology design optimization offers tremendous oppo rtunity in design and manufacturing freedoms by designing and producing a part from the ground-up without a meaningful initial design as required by conventional shape design opt imization approaches. Ideally, with adequate problem statements, to formulate and solve the topo logy design problem using a standard topology optimization process, such as SIMP (Simpli fied Isotropic Material with Penalization) is possible. In reality, an estimated over thousands o f design iterations is often required for just a few design variables, the conventional optimization approach is in general impractical or computationally unachievable for real world applica tions significantly diluting the development of the topology optimization technology. There is, therefore, a need for a different approach that will be able to optimize the initial design topolog y effectively and rapidly. Therefore, this work presents a new topology design procedure to generat e optimal structures using an integrated Generative Adversarial Networks (GANs) and convolut i nal neural network architecture. The discriminator in the GANs as well as the convolutio nal network are initially trained through the dataset of 3024 true optimized planner structure im ages generated from a conventional topology design approach (SIMP). The convolutional network m aps the optimized structure to the volume fraction, penalty and radius of the smoothening fil ter. Once the GAN is trained, the generator produced a large number of new unseen structures sa ti fying the design requirements. The corresponding input variables of these new structur es can be evaluated using the trained convolutional network. The structures generated by the GANs are also minutely post-processed to aberrations. Validation of the results is made b y generating the images with same conditions using existing topology optimization algorithms. T his paper presents a proof of concept which 1 Corresponding Author, email: shen.1@osu.edu

negative: Cardboard semiotics: reconfigurable symbols as a means for narrative prototyping in game design In this paper, we propose the technique of cardboard semiotics. We explain the importance of symbolic analysis as a tool for building narrative prototypes in videogames. Borrowing from the participatory design work in the early 1990s, we suggest a means for adapting and extending this work based on the implicit participation of gamers' immediate-level stories (i.e., the gameplay with narrative implications). Our paper first introduces the concept of semiotics and explains how cardboard semiotics can function as an applied technique within the domain of videogame design and development. Next, we propose a theoretical basis for our work using a simple three act narrative structure and explore some basic concepts from narrative game design. Finally, we conclude with some simple examples of how cardboard semiotics might function in a design environment.

negative: Role of the amygdala in decision-making. The somatic marker hypothesis proposes that both the amygdala and the orbitofrontal cortex are parts of a neural circuit critical for judgment and decision-making. Although both structures couple exteroceptive sensory information with interoceptive information concerning somatic/emotional states, they do so at different levels, thus making different contributions to the process. We define "primary inducers" as stimuli that unconditionally, or through learning (e.g., conditioning and semantic knowledge), can (perceptually or subliminally) produce states that are pleasurable or aversive. Encountering a fear object (e.g., a snake), a stimulus predictive of a snake, or semantic information such as winning or losing a large sum of money are all examples of primary inducers. "Secondary inducers" are entities generated by the recall of a personal or hypothetical emotional event or perceiving a primary inducer that generates "thoughts" and "memories" about the inducer, all of which, when they are brought to memory, elicit a somatic state. The episodic memory of encountering a snake, losing a large sum of money, imagining the gain of a large sum of money, or hearing or looking at primary inducers that bring to memory "thoughts" pertaining to an emotional event are all examples of secondary inducers. We present evidence in support of the hypothesis that the amygdala is a critical substrate in the neural system necessary for triggering somatic states from primary inducers. The ventromedial cortex is a critical substrate in the neural system necessary for the triggering of somatic states from secondary inducers. The amygdala system is a priori a necessary step for the normal development of the orbitofrontal system for triggering somatic states from secondary inducers. However, once this orbitofrontal system is developed, the induction of somatic states by secondary inducers via the orbitofrontal system is less dependent on the amygdala system. Perhaps the amygdala is equivalent to the hippocampus with regard to emotions, that is, necessary for acquiring new emotional attributes (anterograde emotions), but not for retrieving old emotional attributes (retrograde emotions). Given the numerous lesion and functional neuroimaging studies illustrating the involvement of the amygdala in complex cognitive and behavioral functions, including "social cognition," we suggest that this involvement is a manifestation of a more fundamental function mediated by the amygdala, which is to couple stimuli/entities with their emotional attributes, that is, the processing of somatic states from primary inducers.

negative: Bazaar-Extension: A CloudSim Extension for Simulating Negotiation Based Resource Allocations Negotiation processes taking place between two or more parties need to agree on a viable execution mechanism. Auctioning protocols have proven useful as electronic negotiation mechanisms in the past. Auctions are a way of determining the price of a resource in a dynamic way. Additionally, auctions have well defined rules such as winner and loser determination, time restrictions or minimum price increment. These restrictions are necessary to ensure fair and transparent resource allocation. However, these rules are limiting flexibility of consumers and providers. In this paper we introduce a novel negotiation based resource allocation mechanisms using the offer-counteroffer negotiation protocol paradigm. This allocation mechanism shows similarities to the supermarket approach as consumer and provider are able to communicate directly. Further, the price is determined in a dynamic way similar to auctioning. We developed a Bazaar-Extension for CloudSim which simulates negotiation processes with different strategies. In this paper we introduce and analyze a specific Genetic Algorithm based negotiation strategy. For the comparison of the efficiency of resource allocations a novel Bazaar-Score was used.

negative: Training neural nets with the reactive tabu search In this paper the task of training subsymbolic systems is considered as a combinatorial optimization problem and solved with the heuristic scheme of the reactive tabu search (RTS). An iterative optimization process based on a "modified local search" component is complemented with a meta-strategy to realize a discrete dynamical system that discourages limit cycles and the confinement of the search trajectory in a limited portion of the search space. The possible cycles are discouraged by prohibiting (i.e., making tabu) the execution of moves that reverse the ones applied in the most recent part of the search. The prohibition period is adapted in an automated way. The confinement is avoided and a proper exploration is obtained by activating a diversification strategy when too many configurations are repeated excessively often. The RTS method is applicable to nondifferentiable functions, is robust with respect to the random initialization, and effective in continuing the search after local minima. Three tests of the technique on feedforward and feedback systems are presented.

negative: SDN for network security Software Defined Networking, SDN, is the programmable separation of control and forwarding elements of networking that enables software control of network forwarding that can be logically and/or physically separated from physical switches and routers. The following important question is considered in this paper: to what extent can SDN-based networks address network security management problems? The new opportunities for enhancing network security brought by this separation are considered in the paper.

negative: Reduce The Wastage of Data During Movement in Data Warehouse In this research paper so as to handle Data in warehousing as well as reduce the wastage of data and provide a better results which takes more and more turn into a focal point of the data source business. Data warehousing and on-line analytical processing (OLAP) are vital fundamentals of resolution hold, which has more and more become a focal point of the database manufacturing. Lots of marketable yield and services be at the present accessible, and the entire primary database management organization vendor nowadays have contributions in the area assessment hold up spaces some quite dissimilar necessities on record technology compare to conventional on-line transaction giving out application. This article gives a general idea of data warehousing and OLAP technologies, with the highlighting on top of their latest necessities. So tools which is used for extract, clean-up and load information into back end of a information warehouse; multidimensional data model usual of OLAP; front end client tools for querying and data analysis; server extension for proficient query processing; and tools for data managing and for administration the warehouse. In adding to survey the circumstances of the art, this article also identify a number of capable research issue, a few which are interrelated to

negative: Computerized classification of intraductal breast lesions using histopathological images In the diagnosis of preinvasive breast cancer, some of the intraductal proliferations pose a special challenge. The continuum of intraductal breast lesions includes the usual ductal hyperplasia (UDH), atypical ductal hyperplasia (ADH), and ductal carcinoma in situ (DCIS). The current standard of care is to perform percutaneous needle biopsies for diagnosis of palpable and image-detected breast abnormalities. UDH is considered benign and patients diagnosed UDH undergo routine follow-up, whereas ADH and DCIS are considered actionable and patients diagnosed with these two subtypes get additional surgical procedures. About 250 000 new cases of intraductal breast lesions are diagnosed every year. A conservative estimate would suggest that at least 50% of these patients are needlessly undergoing unnecessary surgeries. Thus, improvement in the diagnostic reproducibility and accuracy is critically important for effective clinical management of these patients. In this study, a prototype system for automatically classifying breast microscopic tissues to distinguish between UDH and actionable subtypes (ADH and DCIS) is introduced. This system automatically evaluates digitized slides of tissues for certain cytological criteria and classifies the tissues based on the quantitative features derived from the images. The system is trained using a total of 327 regions of interest (ROIs) collected across 62 patient cases and tested with a sequestered set of 149 ROIs collected across 33 patient cases. An overall accuracy of 87.9% is achieved on the entire test data. The test accuracy of 84.6% is obtained with borderline cases (26 of the 33 test cases) only, when compared against the diagnostic accuracies of nine pathologists on the same set (81.2% average), indicates that the system is highly competitive with the expert pathologists as a stand-alone diagnostic tool and has a great potential in improving diagnostic accuracy and reproducibility when used as a “second reader” in conjunction with the pathologists.

negative: Action recognition with trajectory-pooled deep-convolutional descriptors Visual features are of vital importance for human action understanding in videos. This paper presents a new video representation, called trajectory-pooled deep-convolutional descriptor (TDD), which shares the merits of both hand-crafted features [31] and deep-learned features [24]. Specifically, we utilize deep architectures to learn discriminative convolutional feature maps, and conduct trajectory-constrained pooling to aggregate these convolutional features into effective descriptors. To enhance the robustness of TDDs, we design two normalization methods to transform convolutional feature maps, namely spatiotemporal normalization and channel normalization. The advantages of our features come from (i) TDDs are automatically learned and contain high discriminative capacity compared with those hand-crafted features; (ii) TDDs take account of the intrinsic characteristics of temporal dimension and introduce the strategies of trajectory-constrained sampling and pooling for aggregating deep-learned features. We conduct experiments on two challenging datasets: HMD-B51 and UCF101. Experimental results show that TDDs outperform previous hand-crafted features [31] and deep-learned features [24]. Our method also achieves superior performance to the state of the art on these datasets.

negative: Paving green passage for emergency vehicle in heavy traffic: Real-time motion planning under the connected and automated vehicles environment This paper describes a real-time multi-vehicle motion planning (MVMP) algorithm for the emergency vehicle clearance task. To address the inherent limitations of human drivers in perception, communication, and cooperation, we require that the emergency vehicle and the surrounding normal vehicles are connected and automated vehicles (CAVs). The concerned MVMP task is to find cooperative trajectories such that the emergency vehicle can efficiently pass through the normal vehicles ahead. We use an optimal-control based formulation to describe the MVMP problem, which is centralized, straightforward, and complete. For the online solutions, the centralized MVMP formulation is converted into a multi-period and multi-stage version. Concretely, each period consists of two stages: the emergency vehicle and several normal CAVs ahead try to form a regularized platoon via acceleration or deceleration (stage 1); when a regularized platoon is formed, these vehicles act cooperatively to make way for the emergency vehicle until the emergency vehicle becomes the leader in this local platoon (stage 2). When one period finishes, the subsequent period begins immediately. This sequential process continues until the emergency vehicle finally passes through all the normal CAVs. The subproblem at stage 1 is extremely easy because nearly all the challenging nonlinearity gathers only in stage 2; typical solutions to the subproblem at stage 2 can be prepared offline, and then implemented online directly. Through this, our proposed MVMP algorithm avoids heavy online computations and thus runs in real time.

negative: Designing A Virtual Empowerment Mobile App for the Blinds The Virtual Empowerment App for the Blinds is an empowerment mobile application for the blind. It is developed based on the modules of the existing Latihan Maya Kejayaan Orang Kurang Upaya app, which was intended to empower persons with physical disabilities. As the requirements of persons with physical disabilities greatly differ from that of vision disabilities, this study aims to develop an app that would help blind users to navigate the module of Latihan Maya Kejayaan OKU by themselves based on the requirements observed from the blind users. An interface design to develop a functional and practical app for the blinds is proposed. A comparison between different gesture platforms was also compared. Three tests were conducted, namely the preliminary testing, pilot testing and final testing to analyze the interaction of users when using the app. Results suggested that the extended app developed based on the design proposed in this study were easily navigated and adapted by persons with vision disabilities.

negative: Is face recognition really a Compressive Sensing problem? Compressive Sensing has become one of the standard methods of face recognition within the literature. We show, however, that the sparsity assumption which underpins much of this work is not supported by the data. This lack of sparsity in the data means that compressive sensing approach cannot be guaranteed to recover the exact signal, and therefore that sparse approximations may not deliver the robustness or performance desired. In this vein we show that a simple £2 approach to the face recognition problem is not only significantly more accurate than the state-of-the-art approach, it is also more robust, and much faster. These results are demonstrated on the publicly available YaleB and AR face datasets but have implications for the application of Compressive Sensing more broadly.

negative: Fully Statistical Neural Belief Tracking This paper proposes an improvement to the existing data-driven Neural Belief Tracking (NBT) framework for Dialogue State Tracking (DST). The existing NBT model uses a hand-crafted belief state update mechanism which involves an expensive manual retuning step whenever the model is deployed to a new dialogue domain. We show that this update mechanism can be learned jointly with the semantic decoding and context modelling parts of the NBT model, eliminating the last rule-based module from this DST framework. We propose two different statistical update mechanisms and show that dialogue dynamics can be modelled with a very small number of additional model parameters. In our DST evaluation over three languages, we show that this model achieves competitive performance and provides a robust framework for building resource-light DST models.

negative: A novel bat algorithm with habitat selection and Doppler effect in echoes for optimization A novel bat algorithm (NBA) is proposed for optimization in this paper, which focuses on further mimicking the bats’ behaviors and improving bat algorithm (BA) in view of biology. The proposed algorithm incorporates the bats’ habitat selection and their self-adaptive compensation for Doppler effect in echoes into the basic BA. The bats’ habitat selection is modeled as the selection between their quantum behaviors and mechanical behaviors. Having considered the bats’ self-adaptive compensation for Doppler effect in echoes and the individual’s difference in the compensation rate, the echolocation characteristics of bats can be further simulated in NBA. A self-adaptive local search strategy is also embedded into NBA. Simulations and comparisons based on twenty benchmark problems and four real-world engineering designs demonstrate the effectiveness, efficiency and stability of NBA compared with the basic BA and some well-known algorithms, and suggest that to improve algorithm based on biological basis should be very efficient. Further research topics are also discussed. 2015 Elsevier Ltd. All rights reserved.

negative: Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur's entropy The objective of image segmentation is to extract meaningful objects. A meaningful segmentation selects the proper threshold values to optimize a criterion using entropy. The conventional multilevel thresholding methods are efficient for bi-level thresholding. However, they are computationally expensive when extended to multilevel thresholding since they exhaustively search the optimal thresholds to optimize the objective functions. To overcome this problem, two successful swarm-intelligence-based global optimization algorithms, cuckoo search (CS) algorithm and wind driven optimization (WDO) for multilevel thresholding using Kapur’s entropy has been employed. For this purpose, best solution as fitness function is achieved through CS and WDO algorithm using Kapur’s entropy for optimal multilevel thresholding. A new approach of CS andWDO algorithm is used for selection of optimal threshold value. This algorithm is used to obtain the best solution or best fitness value from the initial random threshold values, and to evaluate the quality of a solution, correlation function is used. Experimental results have been examined on standard set of satellite images using various numbers of thresholds. The results based on Kapur’s entropy reveal that CS, ELR-CS and WDO method can be accurately and efficiently used in multilevel thresholding problem. 2013 Elsevier Ltd. All rights reserved.

negative: Computationally efficient low-pass FIR filter design using Cuckoo Search with adaptive Levy step size This paper looks into efficient implementation of one dimensional low pass Finite Impulse Response filters using certain commonly used and state-of-the-art optimization techniques. Methods like Parks-McClellan (PM) equiripple design, Quantum-behaved Particle Swarm Optimization (QPSO) and Cuckoo Search Algorithm (CSA) with Levy Flight are employed and overall performance is further improved by hybridization and adaptive step size update. Various performance metrics are analyzed with a focus on increasing convergence speed to reach global optima faster. It is seen that the improved search methods used in this work, i.e., Simulated Annealing based Weighted Mean Best QPSO (SAWQPSO) and Adaptive CSA (ACSA) effect significant reductions in convergence time with ACSA proving to be the faster one. The designed filter is used in the receiver stage of a Frequency Modulated Radio Transmission model using a Quadrature-Phase Shift Keyed (QPSK) Modulator and Demodulator. Its efficiency is validated by obtaining near perfect correlation between the message and recovered signals.

negative: Bat-Inspired Optimization Approach for the Brushless DC Wheel Motor Problem This paper presents a metaheuristic algorithm inspired in evolutionary computation and swarm intelligence concepts and fundamentals of echolocation of micro bats. The aim is to optimize the mono and multiobjective optimization problems related to the brushless DC wheel motor problems, which has 5 design parameters and 6 constraints for the mono-objective problem and 2 objectives, 5 design parameters, and 5 constraints for multiobjective version. Furthermore, results are compared with other optimization approaches proposed in the recent literature, showing the feasibility of this newly introduced technique to high nonlinear problems in electromagnetics.

negative:
Algorithmic improvements for fast concurrent Cuckoo hashing Fast concurrent hash tables are an increasingly important building block as we scale systems to greater numbers of cores and threads. This paper presents the design, implementation, and evaluation of a high-throughput and memory-efficient concurrent hash table that supports multiple readers and writers. The design arises from careful attention to systems-level optimizations such as minimizing critical section length and reducing interprocessor coherence traffic through algorithm re-engineering. As part of the architectural basis for this engineering, we include a discussion of our experience and results adopting Intel's recent hardware transactional memory (HTM) support to this critical building block. We find that naively allowing concurrent access using a coarse-grained lock on existing data structures reduces overall performance with more threads. While HTM mitigates this slowdown somewhat, it does not eliminate it. Algorithmic optimizations that benefit both HTM and designs for fine-grained locking are needed to achieve high performance.
 Our performance results demonstrate that our new hash table design---based around optimistic cuckoo hashing---outperforms other optimized concurrent hash tables by up to 2.5x for write-heavy workloads, even while using substantially less memory for small key-value items. On a 16-core machine, our hash table executes almost 40 million insert and more than 70 million lookup operations per second.

negative: The raven roosting optimisation algorithm A significant stream of literature which draws inspiration from the foraging activities of various organisms to design optimisation algorithms has emerged over the past decade. The success of these algorithms across a wide variety of application domains has spurred interest in the examination of the foraging behaviours of other organisms to develop novel and powerful, optimisation algorithms. A variety of animals, including some species of birds and bats, engage in social roosting whereby large numbers of conspecifics gather together to roost, either overnight or for longer periods. It has been claimed that these roosts can serve as information centres to spread knowledge concerning the location of food resources in the environment. In this paper we look at the social roosting and foraging behaviour of one species of bird, the common raven, and take inspiration from this to design a novel optimisation algorithm which we call the raven roosting optimisation algorithm. The utility of the algorithm is assessed on a series of benchmark problems and the results are found to be competitive. We also provide a novel taxonomy which classifies foraging-inspired optimisation algorithms based on the underlying social communication mechanism embedded in the algorithms.

negative: Hybrid supervised clustering based ensemble scheme for text classification PurposeThe immense quantity of available unstructured text documents serve as one of the largest source of information. Text classification can be an essential task for many purposes in information retrieval, such as document organization, text filtering and sentiment analysis. Ensemble learning has been extensively studied to construct efficient text classification schemes with higher predictive performance and generalization ability. Providing diversity among the classification algorithms is a key issue in the ensemble design. Design/methodology/approachAn ensemble scheme based on hybrid supervised clustering is presented for text classification. In the presented scheme, supervised hybrid clustering, which is based on cuckoo search algorithm and k-means, is introduced to partition the data samples of each class into clusters so that training subsets with higher diversities can be provided. Each classifier is trained on the diversified training subsets and the predictions of individual classifiers are combined by the majority voting rule. The predictive performance of the proposed classifier ensemble is compared to conventional classification algorithms (such as Naïve Bayes, logistic regression, support vector machines and C4.5 algorithm) and ensemble learning methods (such as AdaBoost, Bagging and Random Subspace) using eleven text benchmarks. FindingThe experimental results indicate that the presented classifier ensemble outperforms the conventional classification algorithms and ensemble learning methods for text classification. Originality/valueThe presented ensemble scheme is the first to use supervised clustering to obtain diverse ensemble for text classification


query: Landslide susceptibility assessment and factor effect analysis: backpropagation artificial neural networks and their comparison with frequency ratio and bivariate logistic regression modelling

positive: Artificial neural networks: fundamentals, computing, design, and application. Artificial neural networks (ANNs) are relatively new computational tools that have found extensive utilization in solving many complex real-world problems. The attractiveness of ANNs comes from their remarkable information processing characteristics pertinent mainly to nonlinearity, high parallelism, fault and noise tolerance, and learning and generalization capabilities. This paper aims to familiarize the reader with ANN-based computing (neurocomputing) and to serve as a useful companion practical guide and toolkit for the ANNs modeler along the course of ANN project development. The history of the evolution of neurocomputing and its relation to the field of neurobiology is briefly discussed. ANNs are compared to both expert systems and statistical regression and their advantages and limitations are outlined. A bird's eye review of the various types of ANNs and the related learning rules is presented, with special emphasis on backpropagation (BP) ANNs theory and design. A generalized methodology for developing successful ANNs projects from conceptualization, to design, to implementation, is described. The most common problems that BPANNs developers face during training are summarized in conjunction with possible causes and remedies. Finally, as a practical application, BPANNs were used to model the microbial growth curves of S. flexneri. The developed model was reasonably accurate in simulating both training and test time-dependent growth curves as affected by temperature and pH.

positive: What Size Net Gives Valid Generalization? We address the question of when a network can be expected to generalize from m random training examples chosen from some arbitrary probability distribution, assuming that future test examples are drawn from the same distribution. Among our results are the following bounds on appropriate sample vs. network size. Assume 0 < ∊ 1/8. We show that if m O(W/∊ log N/∊) random examples can be loaded on a feedforward network of linear threshold functions with N nodes and W weights, so that at least a fraction 1 ∊/2 of the examples are correctly classified, then one has confidence approaching certainty that the network will correctly classify a fraction 1 ∊ of future test examples drawn from the same distribution. Conversely, for fully-connected feedforward nets with one hidden layer, any learning algorithm using fewer than (W/∊) random training examples will, for some distributions of examples consistent with an appropriate weight choice, fail at least some fixed fraction of the time to find a weight choice that will correctly classify more than a 1 ∊ fraction of the future test examples.

positive: Learning in Artificial Neural Networks: A Statistical Perspective The premise of this article is that learning procedures used to train artificial neural networks are inherently statistical techniques. It follows that statistical theory can provide considerable insight into the properties, advantages, and disadvantages of different network learning methods. We review concepts and analytical results from the literatures of mathematical statistics, econometrics, systems identification, and optimization theory relevant to the analysis of learning in artificial neural networks. Because of the considerable variety of available learning procedures and necessary limitations of space, we cannot provide a comprehensive treatment. Our focus is primarily on learning procedures for feedforward networks. However, many of the concepts and issues arising in this framework are also quite broadly relevant to other network learning paradigms. In addition to providing useful insights, the material reviewed here suggests some potentially useful new training methods for artificial neural networks.

positive: Improving the learning speed of 2-layer neural networks by choosing initial values of the adaptive weights A two-layer neural network can be used to approximate any nonlinear function. T h e behavior of the hidden nodes tha t allows the network to do this is described. Networks w i th one input are analyzed first, and the analysis is then extended to networks w i t h mult iple inputs. T h e result of th is analysis is used to formulate a method for ini t ial izat ion o f the weights o f neural networks to reduce t ra in ing t ime. Training examples are given and the learning curve for these examples are shown to illustrate the decrease in necessary training t ime. Introduction Two-layer feed forward neural networks have been proven capable of approximating any arbitrary functions [l], given that they have sufficient numbers of nodes in their hidden layers. We offer a description of how this works, along with a method of speeding up the training process by choosing the networks’ initial weights. The relationship between the inputs and the output of a two-layer neural network may be described by Equation (1) H l y = wi . sigmoid(LqX + W b i ) (1) i=O where y is the network’s output, X is the input vector, H is the number of hidden nodes, Wi is the weight vector of the i th node of the hidden layer, Wbi is the bias weight of the ith hidden node, w i is the weight of the output layer which connects the i th hidden unit to the output. The behavior of hidden nodes in two-layer networks with one input To illustrate the behavior of the hidden nodes, a two-layer network with one input is trained to approximate a function of one variable d(z) . That is, the network is trained to produce d(z) given z as input using the back-propagation algorithm [2]. The output of the network is given as

negative: Large Margin Metric Learning for Multi-Label Prediction Canonical correlation analysis (CCA) and maximum margin output coding (MMOC) methods have shown promising results for multi-label prediction, where each instance is associated with multiple labels. However, these methods require an expensive decoding procedure to recover the multiple labels of each testing instance. The testing complexity becomes unacceptable when there are many labels. To avoid decoding completely, we present a novel large margin metric learning paradigm for multi-label prediction. In particular, the proposed method learns a distance metric to discover label dependency such that instances with very different multiple labels will be moved far away. To handle many labels, we present an accelerated proximal gradient procedure to speed up the learning process. Comprehensive experiments demonstrate that our proposed method is significantly faster than CCA and MMOC in terms of both training and testing complexities. Moreover, our method achieves superior prediction performance compared with state-of-the-art methods.

negative: Optimal Design of Energy-Efficient Multi-User MIMO Systems: Is Massive MIMO the Answer? Assume that a multi-user multiple-input multiple-output (MIMO) system is designed from scratch to uniformly cover a given area with maximal energy efficiency (EE). What are the optimal number of antennas, active users, and transmit power? The aim of this paper is to answer this fundamental question. We consider jointly the uplink and downlink with different processing schemes at the base station and propose a new realistic power consumption model that reveals how the above parameters affect the EE. Closed-form expressions for the EE-optimal value of each parameter, when the other two are fixed, are provided for zero-forcing (ZF) processing in single-cell scenarios. These expressions prove how the parameters interact. For example, in sharp contrast to common belief, the transmit power is found to increase (not to decrease) with the number of antennas. This implies that energy-efficient systems can operate in high signal-to-noise ratio regimes in which interference-suppressing signal processing is mandatory. Numerical and analytical results show that the maximal EE is achieved by a massive MIMO setup wherein hundreds of antennas are deployed to serve a relatively large number of users using ZF processing. The numerical results show the same behavior under imperfect channel state information and in symmetric multi-cell scenarios.

negative:
A systematic analysis of textual variability modeling languages Industrial variability models tend to grow in size and complexity due to ever-increasing functionality and complexity of software systems. Some authors report on variability models specifying several thousands of variabilities. However, traditional variability modeling approaches do not seem to scale adequately to cope with size and complexity of such models. Recently, textual variability modeling languages have been advocated as one scalable solution.
 In this paper, we provide a systematic analysis of the capabilities of current textual variability modeling languages, in particular regarding variability management in the large. Towards this aim, we define a classification schema consisting of five dimensions, classify ten different textual variability modeling languages using the classification schema and provide an analysis. In summary, some textual variability modeling languages go beyond textual representations of traditional variability modeling approaches and provide sophisticated modeling concepts and constraint languages. Three textual variability modeling approaches already support mechanisms for large-scale variability modeling such as model composition, modularization, or evolution support.

negative: Cracking the Code of Biodiversity Responses to Past Climate Change. How individual species and entire ecosystems will respond to future climate change are among the most pressing questions facing ecologists. Past biodiversity dynamics recorded in the paleoecological archives show a broad array of responses, yet significant knowledge gaps remain. In particular, the relative roles of evolutionary adaptation, phenotypic plasticity, and dispersal in promoting survival during times of climate change have yet to be clarified. Investigating the paleo-archives offers great opportunities to understand biodiversity responses to future climate change. In this review we discuss the mechanisms by which biodiversity responds to environmental change, and identify gaps of knowledge on the role of range shifts and tolerance. We also outline approaches at the intersection of paleoecology, genomics, experiments, and predictive models that will elucidate the processes by which species have survived past climatic changes and enhance predictions of future changes in biological diversity.

negative: Application of Artificial Intelligence to Real-Time Fault Detection in Permanent-Magnet Synchronous Machines This paper discusses faults in rotating electrical machines in general and describes a fault detection technique using artificial neural network (ANN) which is an expert system to detect short-circuit fault currents in the stator windings of a permanent-magnet synchronous machine (PMSM). The experimental setup consists of PMSM coupled mechanically to a dc motor configured to run in torque mode. Particle swarm optimization is used to adjust the weights of the ANN. All simulations are carried out in MATLAB/SIMULINK environment. The technique is shown to be effective and can be applied to real-time fault detection.

negative: Language Models with Pre-Trained (GloVe) Word Embeddings In this work we present a step-by-step implementation of training a Language Model (LM) , using Recurrent Neural Network (RNN) and pre-trained GloVe word embeddings, introduced by Pennigton et al. in [1]. The implementation is following the general idea of training RNNs for LM tasks presented in [2] , but is rather using Gated Recurrent Unit (GRU) [3] for a memory cell, and not the more commonly used LSTM [4]. The implementation presented is based on using keras1 [5].

negative: Comparison study of non-orthogonal multiple access schemes for 5G With the development of mobile Internet and Internet of things (IoT), the 5th generation (5G) wireless communications will foresee explosive increase in mobile traffic. To address challenges in 5G such as higher spectral efficiency, massive connectivity, and lower latency, some non-orthogonal multiple access (NOMA) schemes have been recently actively investigated, including power-domain NOMA, multiple access with low-density spreading (LDS), sparse code multiple access (SCMA), multiuser shared access (MUSA), pattern division multiple access (PDMA), etc. Different from conventional orthogonal multiple access (OMA) schemes, NOMA can realize overloading by introducing some controllable interferences at the cost of slightly increased receiver complexity, which can achieve significant gains in spectral efficiency and accommodate much more users. In this paper, we will discuss basic principles and key features of three typical NOMA schemes, i.e., SCMA, MUSA, and PDMA. What's more, their performance in terms of uplink bit error rate (BER) will be compared. Simulation results show that in typical Rayleigh fading channels, SCMA has the best performance, while the BER performance of MUSA and PDMA are very close to each other. In addition, we also analyze the performance of PDMA using the same factor graph as SCMA, which indicates that the performance gain of SCMA over PDMA comes from both the difference of factor graph and the codebook optimization.

negative: RPL-based multipath Routing Protocols for Internet of Things on Wireless Sensor Networks In the last few years, Wireless Sensor Network (WSN) emerges and appears as an essential platform for prominent concept of Internet of Things (IoT). Their application ranges from so-called “smart cities”, “smart homes” over environmental monitoring. The connectivity in IoT mainly relies on RPL (IPv6 Routing Protocol for Low Power and Lossy Network) - a routing algorithm that constructs and maintains DODAGs (Destination Oriented Directed Acyclic Graph) to transmit data from sensors to root over a single path. However, due to the resource constraints of sensor nodes and the unreliability of wireless links, single-path routing approaches cannot be considered effective techniques to meet the performance demands of various applications. In order to overcome these problems, many individuals and group research focuses on multi-path solutions for RPL routing protocol. In this paper, we propose three multipath schemes based on RPL (Energy Load Balancing-ELB, Fast Local Repair-FLR and theirs combination-ELB-FLR) and integrate them in a modified IPv6 communication stack for IoT. These schemes are implemented in OMNET++ simulator and the experiment outcomes show that our approaches have achieved better energy efficiency, better end-to-end delay, packet delivery rate and network load balance compared to traditional solution of RPL.

negative: Cognitive architectures: Research issues and challenges In this paper, we examine the motivations for research on cognitive architectures and review some candidates that have been explored in the literature. After this, we consider the capabilities that a cognitive architecture should support, some properties that it should exhibit related to representation, organization, performance, and learning, and some criteria for evaluating such architectures at the systems level. In closing, we discuss some open issues that should drive future research in this important area. 2008 Published by Elsevier B.V.

negative: GRS: The green, reliability, and security of emerging machine to machine communications Machine-to-machine communications is characterized by involving a large number of intelligent machines sharing information and making collaborative decisions without direct human intervention. Due to its potential to support a large number of ubiquitous characteristics and achieving better cost efficiency, M2M communications has quickly become a market-changing force for a wide variety of real-time monitoring applications, such as remote e-healthcare, smart homes, environmental monitoring, and industrial automation. However, the flourishing of M2M communications still hinges on fully understanding and managing the existing challenges: energy efficiency (green), reliability, and security (GRS). Without guaranteed GRS, M2M communications cannot be widely accepted as a promising communication paradigm. In this article, we explore the emerging M2M communications in terms of the potential GRS issues, and aim to promote an energy-efficient, reliable, and secure M2M communications environment. Specifically, we first formalize M2M communications architecture to incorporate three domains - the M2M, network, and application domains - and accordingly define GRS requirements in a systematic manner. We then introduce a number of GRS enabling techniques by exploring activity scheduling, redundancy utilization, and cooperative security mechanisms. These techniques hold promise in propelling the development and deployment of M2M communications applications.

negative:
Adverse drug reactions as cause of admission to hospital: prospective analysis of 18 820 patients. OBJECTIVE
To ascertain the current burden of adverse drug reactions (ADRs) through a prospective analysis of all admissions to hospital.

DESIGN
Prospective observational study.

SETTING
Two large general hospitals in Merseyside, England.

PARTICIPANTS
18 820 patients aged > 16 years admitted over six months and assessed for cause of admission.

MAIN OUTCOME MEASURES
Prevalence of admissions due to an ADR, length of stay, avoidability, and outcome.

RESULTS
There were 1225 admissions related to an ADR, giving a prevalence of 6.5%, with the ADR directly leading to the admission in 80% of cases. The median bed stay was eight days, accounting for 4% of the hospital bed capacity. The projected annual cost of such admissions to the NHS is 466m pounds sterling (706m Euros, 847m dollars). The overall fatality was 0.15%. Most reactions were either definitely or possibly avoidable. Drugs most commonly implicated in causing these admissions included low dose aspirin, diuretics, warfarin, and non-steroidal anti-inflammatory drugs other than aspirin, the most common reaction being gastrointestinal bleeding.

CONCLUSION
The burden of ADRs on the NHS is high, accounting for considerable morbidity, mortality, and extra costs. Although many of the implicated drugs have proved benefit, measures need to be put into place to reduce the burden of ADRs and thereby further improve the benefit:harm ratio of the drugs.

negative: Health-related rumour detection on Twitter In the last years social networks have emerged as a critical mean for information spreading. In spite of all the positive consequences this phenomenon brings, unverified and instrumentally relevant information statements in circulation, named as rumours, are becoming a potential threat to the society. Recently, there have been several studies on topic-independent rumour detection on Twitter. In this paper we present a novel rumour detection system which focuses on a specific topic, that is health-related rumours on Twitter. To this aim, we constructed a new subset of features including influence potential and network characteristics features. We tested our approach on a real dataset observing promising results, as it is able to correctly detect about 89% of rumours, with acceptable levels of precision.

negative: Full bridge phase-shifted soft switching high-frequency inverter with boost PFC function for induction heating system This paper is mainly concerned with a high frequency soft-switching PWM inverter suitable for consumer induction heating system. Proposed system is composed of soft switching chopper based voltage boost PFC input stage and phase shifted PWM controlled full bridge ZCZVS high frequency inverter stage. Its fundamentals of operating performances are illustrated and evaluated on the experimental results. Its effectiveness is substantially proved on the basis of the experimental results from a practical point of view.

negative: Automatic Modulation Classification of Overlapped Sources Using Multi-Gene Genetic Programming With Structural Risk Minimization Principle As the spectrum environment becomes increasingly crowded and complicated, primary users may be interfered by secondary users and other illegal users. Automatic modulation classification (AMC) of a single source cannot recognize the overlapped sources. Consequently, the AMC of overlapped sources attracts much attention. In this paper, we propose a genetic programming-based modulation classification method for overlapped sources (GPOS). The proposed GPOS consists of two stages, the training stage, and the classification stage. In the training stage, multi-gene genetic programming (MGP)-based feature engineering transforms sample estimates of cumulants into highly discriminative MGP-features iteratively, until optimal MGP-features (OMGP-features) are obtained, where the structural risk minimization principle (SRMP) is employed to evaluate the classification performance of MGP-features and train the classifier. Moreover, a self-adaptive genetic operation is designed to accelerate the feature engineering process. In the classification stage, the classification decision is made by the trained classifier using the OMGP-features. Through simulation results, we demonstrate that the proposed scheme outperforms other existing methods in terms of classification performance and robustness in case of varying power ratios and fading channel.

negative: Measuring geographical regularities of crowd behaviors for Twitter-based geo-social event detection Recently, microblogging sites such as Twitter have garnered a great deal of attention as an advanced form of location-aware social network services, whereby individuals can easily and instantly share their most recent updates from any place. In this study, we aim to develop a geo-social event detection system by monitoring crowd behaviors indirectly via Twitter. In particular, we attempt to find out the occurrence of local events such as local festivals; a considerable number of Twitter users probably write many posts about these events. To detect such unusual geo-social events, we depend on geographical regularities deduced from the usual behavior patterns of crowds with geo-tagged microblogs. By comparing these regularities with the estimated ones, we decide whether there are any unusual events happening in the monitored geographical area. Finally, we describe the experimental results to evaluate the proposed unusuality detection method on the basis of geographical regularities obtained from a large number of geo-tagged tweets around Japan via Twitter.

negative: Classic Hallucinogens and Mystical Experiences: Phenomenology and Neural Correlates. This chapter begins with a brief review of descriptions and definitions of mystical-type experiences and the historical connection between classic hallucinogens and mystical experiences. The chapter then explores the empirical literature on experiences with classic hallucinogens in which claims about mystical or religious experiences have been made. A psychometrically validated questionnaire is described for the reliable measurement of mystical-type experiences occasioned by classic hallucinogens. Controlled laboratory studies show that under double-blind conditions that provide significant controls for expectancy bias, psilocybin can occasion complete mystical experiences in the majority of people studied. These effects are dose-dependent, specific to psilocybin compared to placebo or a psychoactive control substance, and have enduring impact on the moods, attitudes, and behaviors of participants as assessed by self-report of participants and ratings by community observers. Other studies suggest that enduring personal meaning in healthy volunteers and therapeutic outcomes in patients, including reduction and cessation of substance abuse behaviors and reduction of anxiety and depression in patients with a life-threatening cancer diagnosis, are related to the occurrence of mystical experiences during drug sessions. The final sections of the chapter draw parallels in human neuroscience research between the neural bases of experiences with classic hallucinogens and the neural bases of meditative practices for which claims of mystical-type experience are sometimes made. From these parallels, a functional neural model of mystical experience is proposed, based on changes in the default mode network of the brain that have been observed after the administration of classic hallucinogens and during meditation practices for which mystical-type claims have been made.

negative: Sparsely sampled Fourier ptychography. Fourier ptychography (FP) is an imaging technique that applies angular diversity functions for high-resolution complex image recovery. The FP recovery routine switches between two working domains: the spectral and spatial domains. In this paper, we investigate the spectral-spatial data redundancy requirement of the FP recovery process. We report a sparsely sampled FP scheme by exploring the sampling interplay between these two domains. We demonstrate the use of the reported scheme for bypassing the high-dynamic-range combination step in the original FP recovery routine. As such, it is able to shorten the acquisition time of the FP platform by ~50%. As a special case of the sparsely sample FP, we also discuss a sub-sampled scheme and demonstrate its application in solving the pixel aliasing problem plagued in the original FP algorithm. We validate the reported schemes with both simulations and experiments. This paper provides insights for the development of the FP approach.

negative: Threats to Feminist Identity and Reactions to Gender Discrimination The aim of this research was to examine conditions that modify feminists' support for women as targets of gender discrimination. In an experimental study we tested a hypothesis that threatened feminist identity will lead to greater differentiation between feminists and conservative women as victims of discrimination and, in turn, a decrease in support for non-feminist victims. The study was conducted among 96 young Polish female professionals and graduate students from Gender Studies programs in Warsaw who self-identified as feminists (Mage  = 22.23). Participants were presented with a case of workplace gender discrimination. Threat to feminist identity and worldview of the discrimination victim (feminist vs. conservative) were varied between research conditions. Results indicate that identity threat caused feminists to show conditional reactions to discrimination. Under identity threat, feminists perceived the situation as less discriminatory when the target held conservative views on gender relations than when the target was presented as feminist. This effect was not observed under conditions of no threat. Moreover, feminists showed an increase in compassion for the victim when she was portrayed as a feminist compared to when she was portrayed as conservative. Implications for the feminist movement are discussed.

negative: Dynamic Filters in Graph Convolutional Networks Convolutional neural networks (CNNs) have massively impacted visual recognition in 2D images, and are now ubiquitous in state-of-the-art approaches. While CNNs naturally extend to other domains, such as audio and video, where data is also organized in rectangular grids, they do not easily generalize to other types of data such as 3D shape meshes, social network graphs or molecular graphs. To handle such data, we propose a novel graph-convolutional network architecture that builds on a generic formulation that relaxes the 1-to-1 correspondence between filter weights and data elements around the center of the convolution. The main novelty of our architecture is that the shape of the filter is a function of the features in the previous network layer, which is learned as an integral part of the neural network. Experimental evaluations on digit recognition, semi-supervised document classification, and 3D shape correspondence yield state-of-the-art results, significantly improving over previous work for shape correspondence.

negative: BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis When it comes to software analysis, several approaches exist from heuristic techniques to formal methods, which are helpful at solving different kinds ofproblems. Unfortunately very few initiative seek to aggregate this techniques in the same platform. BINSEC intend to fulfill this lack of binary analysis platform by allowing to perform modular analysis. This work focusses on BINSEC/SE, the new dynamic symbolic execution engine (DSE) implemented in BINSEC. We will highlight the novelties of the engine, especially in terms of interactions between concrete and symbolic execution or optimization of formula generation. Finally, two reverse engineering applications are shown in order to emphasize the tool effectiveness.

negative: Artificial intelligent firewall Firewalls are now an integral part of network security. An intelligent firewall that prevents unauthorized access to a system has been developed. Artificial intelligence applications are uniquely suited for the ever-changing, ever-evolving world of network security. Typical firewalls are only as good as the information provided by the Network Administrator. A new type of attack creates vulnerabilities, which a static firewall does not have the ability to avoid without human direction. An AI-managed firewall service, however, can protect a computer network from known and future threats. We report in this paper on research in progress concerning the integration of different security techniques. A main purpose of the project is to integrate a smart detection engine into a firewall. The smart detection engine will aim at not only detecting anomalous network traffic as in classical IDSs, but also detecting unusual structures data packets that suggest the presence of virus data. We will report in this paper on the concept of an intelligent firewall that contains a smart detection engine for potentially malicious data packets.

negative: Tracking the Trackers: An Analysis of the State of the Art in Multiple Object Tracking Standardized benchmarks are crucial for the majority of computer vision applications. Although leaderboards and ranking tables should not be over-claimed, benchmarks often provide the most objective measure of performance and are therefore important guides for research. We present a benchmark for Multiple Object Tracking launched in the late 2014, with the goal of creating a framework for the standardized evaluation of multiple object tracking methods. This paper collects the two releases of the benchmark made so far, and provides an in-depth analysis of almost 50 state-of-the-art trackers that were tested on over 11000 frames. We show the current trends and weaknesses of multiple people tracking methods, and provide pointers of what researchers should be focusing on to push the field forward.

negative: Personality Analysis Through Handwriting

negative: Search Based Software Engineering The use of evolutionary algorithms for solving multi-objective optimization problems has become increasingly popular, mainly within the last 15 years. From among the several research trends that have originated in recent years, one of the most promising is the use of hybrid approaches that allow to improve the performance of multi-objective evolutionary algorithms (MOEAs). In this talk, some of the most representative research on the use of hybrid approaches in evolutionary multi-objective optimization will be discussed. The topics discussed will include multi-objective memetic algorithms, hybridization of MOEAs with gradient-based methods and with direct search methods, as well as multi-objective hyperheuristics. Some applications of these approaches as well as some potential paths for future research in this area will also be briefly discussed. Towards Evolutionary Multitasking: A New Paradigm

negative: Real-time 3D eyelids tracking from semantic edges State-of-the-art real-time face tracking systems still lack the ability to realistically portray subtle details of various aspects of the face, particularly the region surrounding the eyes. To improve this situation, we propose a technique to reconstruct the 3D shape and motion of eyelids in real time. By combining these results with the full facial expression and gaze direction, our system generates complete face tracking sequences with more detailed eye regions than existing solutions in real-time. To achieve this goal, we propose a generative eyelid model which decomposes eyelid variation into two low-dimensional linear spaces which efficiently represent the shape and motion of eyelids. Then, we modify a holistically-nested DNN model to jointly perform semantic eyelid edge detection and identification on images. Next, we correspond vertices of the eyelid model to 2D image edges, and employ polynomial curve fitting and a search scheme to handle incorrect and partial edge detections. Finally, we use the correspondences in a 3D-to-2D edge fitting scheme to reconstruct eyelid shape and pose. By integrating our fast fitting method into a face tracking system, the estimated eyelid results are seamlessly fused with the face and eyeball results in real time. Experiments show that our technique applies to different human races, eyelid shapes, and eyelid motions, and is robust to changes in head pose, expression and gaze direction.

negative: A Better Comparison Summary of Credit Scoring Classification The credit scoring aim is to classify the customer credit as defaulter or non-defaulter. The credit risk analysis is more effective with further boosting and smoothing of the parameters of models. The objective of this paper is to explore the credit score classification models with an imputation technique and without imputation technique. However, data availability is low in case of without imputation because of missing values depletion from the large dataset. On the other hand, imputation based dataset classification accuracy with linear method of ANN is better than other models. The comparison of models with boosting and smoothing shows that error rate is better metric than area under curve (AUC) ratio. It is concluded that artificial neural network (ANN) is better alternative than decision tree and logistic regression when data availability is high in dataset. Keywords—Credit score data mining; classification; artifical neural network; imputation

negative: An Introduction to Logistic Regression Analysis and Reporting The purpose of this article is to provide researchers, editors, and readers with a set of guidelines for what to expect in an article using logistic regression techniques. Tables, figures, and charts that should be included to comprehensively assess the results and assumptions to be verified are discussed. This article demonstrates the preferred pattern for the application of logistic methods with an illustration of logistic regression applied to a data set in testing a research hypothesis. Recommendations are also offered for appropriate reporting formats of logistic regression results and the minimum observation-to-predictor ratio. The authors evaluated the use and interpretation of logistic regression presented in 8 articles published in The Journal of Educational Research between 1990 and 2000. They found that all 8 studies met or exceeded recommended criteria.

negative: The Prediction of Earnings Using Financial Statement Information: Empirical Evidence With Logit Models and Artificial Neural Networks In the past three decades, earnings have been one of the most researched variables in accounting. Empirical research provided substantial evidence on its usefulness in the capital markets but evidence in predicting earnings has been limited, yielding inconclusive results. The purpose of this study is to validate and extend prior research in predicting earnings by examining aggregate and industry-specific data. A sample of 10,509 firm-year observations included in the Compustat database for the period 1982-91 is used in the study. The stepwise logistic regression results of the present study indicated that nine earnings and non-earnings variables can be used to predict earnings. These predictor variables are not identical to those reported in prior studies. These results are also extended to the manufacturing industry. Two new variables are identified to be significant in this industry. Moreover, an Artificial Neural Network (ANN) approach is employed to complement the logistic regression results. The ANN model's performance is at least as high as the logistic regression model's predictive ability.

negative: Measuring retail company performance using credit scoring techniques This paper proposes a theoretical framework for predicting financial distress based on Hunt’s (2000) ‘Resource-Advantage (R-A) Theory of Competition’. The study focuses on the US retail market. Five credit scoring methodologies –Naïve Bayes, Logistic Regression, Recursive Partition, Artificial Neural Network, and Sequential Minimal Optimization— are used on a sample of 195 healthy companies and 51 distressed firms over different time periods from 1994 to 2002. Analyses provide sufficient evidence that the five credit scoring methodologies have sound classification ability. In the time period of one year before financial distress, logistic regression model shows identical performance with neural network model based on the accuracy rate and shows the best performance in terms of AUROC value. Other models are slightly worse for predicting financial distress, but still present high accuracy rate and AUROC value. Moreover, the methodologies remain sound even five years prior to financial distress with classification accuracy rates above 85% and AUROC values above 0.85 for all five methodologies. This paper also shows external environment influences exist based on the naïve bayes, logistic, recursive partition and SMO models, but these influences are weak. With regards to the model applicability, a subset of the different models is compared with Moody’s rankings. It is found that both SMO and Logistic models are better than the Neural Network model in terms of similarity with Moody’s ranking, with SMO being slightly better than the Logistic Model.

negative: Bank Customer Churn Prediction Based on Support Vector Machine: Taking a Commercial Bank's VIP Customer Churn as the Example Customer churn analysis and prediction play an important role in customer relationship management and improve benefit of enterprise. According to the bank's customer churn data which is large scale and imbalance, this paper presented a support vector machine model to predict customer churn. The method was compared with artificial neural network, decision tree, logistic regression and naive Bayesian classifier regarding customer churn prediction for a commercial bank's VIP customers. It is found that the method has the best accuracy rate, hit rate, covering rate and lift coefficient, and provides an effective measurement for bank's customer churn prediction.

negative: Predicting and analyzing secondary education placement-test scores: A data mining approach Understanding the factors that lead to success (or failure) of students at placement tests is an interesting and challenging problem. Since the centralized placement tests and future academic achievements are considered to be related concepts, analysis of the success factors behind placement tests may help understand and potentially improve academic achievement. In this study using a large and feature rich dataset from Secondary Education Transition System in Turkey we developed models to predict secondary education placement test results, and using sensitivity analysis on those prediction models we identified the most important predictors. The results showed that C5 decision tree algorithm is the best predictor with 95% accuracy on hold-out sample, followed by support vector machines (with an accuracy of 91%) and artificial neural networks (with an accuracy of 89%). Logistic regression models came out to be the least accurate of the four with and overall accuracy of 82%. The sensitivity analysis revealed that previous test experience, whether a student has a scholarship, student’s number of siblings, previous years’ grade point average are among the most important predictors of the placement test scores. 2012 Elsevier Ltd. All rights reserved.

negative: An ANN-Based Synthesis Model for the Single-Feed Circularly-Polarized Square Microstrip Antenna With Truncated Corners An artificial neural network-based synthesis model is proposed for the design of single-feed circularly-polarized square microstrip antenna (CPSMA) with truncated corners. To obtain the training data sets, the resonant frequency and Q-factor of square microstrip antennas are calculated by empirical formulae. Then the size of the truncated corners and the operation frequency with the best axial ratio are obtained. Using the Levenberg-Marquardt (LM) algorithm, a three hidden layered network is trained to achieve an accurate synthesis model. At last, the model is validated by comparing its results with the electromagnetic simulation and measurement. It is extremely useful to antenna engineers for directly obtaining patch physical dimensions of the single-feed CPSMA with truncated corners.