query: Exchange Pattern Mining in the Bitcoin Transaction Directed Hypergraph

positive: Network motifs: simple building blocks of complex networks. Complex networks are studied across many fields of science. To uncover their structural design principles, we defined "network motifs," patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks. We found such motifs in networks from biochemistry, neurobiology, ecology, and engineering. The motifs shared by ecological food webs were distinct from the motifs shared by the genetic networks of Escherichia coli and Saccharomyces cerevisiae or from those found in the World Wide Web. Similar motifs were found in networks that perform information processing, even though they describe elements as different as biomolecules within a cell and synaptic connections between neurons in Caenorhabditis elegans. Motifs may thus define universal classes of networks. This approach may uncover the basic building blocks of most networks.

positive: Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network The possibility to analyze everyday monetary transactions is limited by the scarcity of available data, as this kind of information is usually considered highly sensitive. Present econophysics models are usually employed on presumed random networks of interacting agents, and only some macroscopic properties (e.g. the resulting wealth distribution) are compared to real-world data. In this paper, we analyze Bitcoin, which is a novel digital currency system, where the complete list of transactions is publicly available. Using this dataset, we reconstruct the network of transactions and extract the time and amount of each payment. We analyze the structure of the transaction network by measuring network characteristics over time, such as the degree distribution, degree correlations and clustering. We find that linear preferential attachment drives the growth of the network. We also study the dynamics taking place on the transaction network, i.e. the flow of money. We measure temporal patterns and the wealth accumulation. Investigating the microscopic statistics of money movement, we find that sublinear preferential attachment governs the evolution of the wealth distribution. We report a scaling law between the degree and wealth associated to individual nodes.

positive: An Analysis of Anonymity in the Bitcoin System Anonymity in Bit coin, a peer-to-peer electronic currency system, is a complicated issue. Within the system, users are identified by public-keys only. An attacker wishing to de-anonymize its users will attempt to construct the one to-many mapping between users and public-keys and associate information external to the system with the users. Bitcoinfrustrates this attack by storing the mapping of a user to his or her public-keys on that user's node only and by allowing each user to generate as many public-keys as required. In this paper we consider the topological structure of two networks derived from Bitcoin's public transaction history. We show that the two networks have a non-trivial topological structure, provide complementary views of the Bit coin system and have implications for anonymity. We combine these structures with external information and techniques such as context discovery and flow analysis to investigate an alleged theft of Bit coins, which, at the time of the theft, had a market value of approximately half a million U.S. dollars.

positive: Learning from Positive and Unlabeled Examples with Different Data Distributions We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive examples in the positive set P and the positive examples in the unlabeled set U are generated from the same distribution. This assumption may be violated in practice. For example, one wants to collect all printer pages from the Web. One can use the printer pages from one site as the set P of positive pages and use product pages from another site as U. One wants to classify the pages in U into printer pages and non-printer pages. Although printer pages from the two sites have many similarities, they can also be quite different because different sites often present similar products in different styles and have different focuses. In such cases, existing methods perform poorly. This paper proposes a novel technique A-EM to deal with the problem. Experiment results with product page classification demonstrate the effectiveness of the proposed technique.

positive: BIRDS OF A FEATHER : Homophily in Social Networks ■ Abstract Similarity breeds connection. This principle—the homophily principle—structures network ties of every type, including marriage, friendship, work, advice, support, information transfer, exchange, comembership, and other types of relationship. The result is that people’s personal networks are homogeneous with regard to many sociodemographic, behavioral, and intrapersonal characteristics. Homophily limits people’s social worlds in a way that has powerful implications for the information they receive, the attitudes they form, and the interactions they experience. Homophily in race and ethnicity creates the strongest divides in our personal environments, with age, religion, education, occupation, and gender following in roughly that order. Geographic propinquity, families, organizations, and isomorphic positions in social systems all create contexts in which homophilous relations form. Ties between nonsimilar individuals also dissolve at a higher rate, which sets the stage for the formation of niches (localized positions) within social space. We argue for more research on: (a) the basic ecological processes that link organizations, associations, cultural communities, social movements, and many other social forms; (b) the impact of multiplex ties on the patterns of homophily; and (c) the dynamics of network change over time through which networks and other social entities co-evolve.

negative: House Price Prediction : Hedonic Price Model vs . Artificial Neural Network The objective of this paper is to empirically compare the predictive power of the hedonic model with an artificial neural network model on house price prediction. A sample of 200 houses in Christchurch, New Zealand is randomly selected from the Harcourt website. Factors including house size, house age, house type, number of bedrooms, number of bathrooms, number of garages, amenities around the house and geographical location are considered. Empirical results support the potential of artificial neural network on house price prediction, although previous studies have commented on its black box nature and achieved different conclusions.

negative: Ant colony optimization : Introduction and recent trends Ant colony optimization is a technique for optimization that was introduced in the early 1990’s. The inspiring source colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important pro telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optim algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowad performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how a optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent direction: The hybridization with more classical techniques from artificial intelligence and operations research.  2005 Elsevier B.V. All rights reserved.

negative: Inferring Query Performance Using Pre-retrieval Predictors The prediction of query performance is an interesting and important issue in Information Retrieval (IR). Current predictors involve the use of relevance scores, which are time-consuming to compute. Therefore, current predictors are not very suitable for practical applications. In this paper, we study a set of predictors of query performance, which can be generated prior to the retrieval process. The linear and non-parametric correlations of the predictors with query performance are thoroughly assessed on the TREC disk4 and disk5 (minus CR) collections. According to the results, some of the proposed predictors have significant correlation with query performance, showing that these predictors can be useful to infer query performance in practical applications.

negative: Curvature-based regularization for surface approximation We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noisy) data point by minimizing the squared distances to the points and the irregularity of the surface implicitly defined by the tangent planes. In order to avoid the well-known ”shrinking” bias associated with first-order surface regularization, we choose a robust smoothing term that approximates curvature of the underlying surface. In contrast to a number of recent publications estimating curvature using discrete (e.g. binary) labellings with triple-cliques we use higher-dimensional labels that allows modeling curvature with only pair-wise interactions. Hence, many standard optimization algorithms (e.g. message passing, graph cut, etc) can minimize the proposed curvature-based regularization functional. The accuracy of our approach for representing curvature is demonstrated by theoretical and empirical results on synthetic and real data sets from multiview reconstruction and stereo.

negative: A vision for personalized service level agreements in the cloud Public Clouds today provide a variety of services for data analysis such as Amazon Elastic MapReduce and Google BigQuery. Each service comes with a pricing model and service level agreement (SLA). Today's pricing models and SLAs are described at the level of compute resources (instance-hours or gigabytes processed). They are also different from one service to the next. Both conditions make it difficult for users to select a service, pick a configuration, and predict the actual analysis cost. To address this challenge, we propose a new abstraction, called a Personalized Service Level Agreement, where users are presented with what they can do with their data in terms of query capabilities, guaranteed query performance and fixed hourly prices.

negative: Types of Participant Behavior in a Massive Open Online Course In recent years there has been a proliferation of massive open online courses (MOOCs), which provide unprecedented opportunities for lifelong learning. Registrants approach these courses with a variety of motivations for participation. Characterizing the different types of participation in MOOCs is fundamental in order to be able to better evaluate the phenomenon and to support MOOCs developers and instructors in devising courses which are adapted for different learners' needs. Thus, the purpose of this study was to characterize the different types of participant behavior in a MOOC. Using a data mining methodology, 21,889 participants of a MOOC were classified into clusters, based on their activity in the main learning resources of the course: video lectures, discussion forums, and assessments. Thereafter, the participants in each cluster were characterized in regard to demographics, course participation, and course achievement characteristics. Seven types of participant behavior were identified: Tasters (64.8%), Downloaders (8.5%), Disengagers (11.5%), Offline Engagers (3.6%), Online Engagers (7.4%), Moderately Social Engagers (3.7%), and Social Engagers (0.6%). A significant number of 1,020 participants were found to be engaged in the course, but did not achieve a certificate. The types are discussed according to the established research questions. The results provide further evidence regarding the utilization of the flexibility, which is offered in MOOCs, by the participants according to their needs. Furthermore, this study supports the claim that MOOCs' impact should not be evaluated solely based on certification rates but rather based on learning behaviors.

negative:
Reporting and Methods in Clinical Prediction Research: A Systematic Review BACKGROUND
We investigated the reporting and methods of prediction studies, focusing on aims, designs, participant selection, outcomes, predictors, statistical power, statistical methods, and predictive performance measures.

METHODS AND FINDINGS
We used a full hand search to identify all prediction studies published in 2008 in six high impact general medical journals. We developed a comprehensive item list to systematically score conduct and reporting of the studies, based on recent recommendations for prediction research. Two reviewers independently scored the studies. We retrieved 71 papers for full text review: 51 were predictor finding studies, 14 were prediction model development studies, three addressed an external validation of a previously developed model, and three reported on a model's impact on participant outcome. Study design was unclear in 15% of studies, and a prospective cohort was used in most studies (60%). Descriptions of the participants and definitions of predictor and outcome were generally good. Despite many recommendations against doing so, continuous predictors were often dichotomized (32% of studies). The number of events per predictor as a measure of statistical power could not be determined in 67% of the studies; of the remainder, 53% had fewer than the commonly recommended value of ten events per predictor. Methods for a priori selection of candidate predictors were described in most studies (68%). A substantial number of studies relied on a p-value cut-off of p<0.05 to select predictors in the multivariable analyses (29%). Predictive model performance measures, i.e., calibration and discrimination, were reported in 12% and 27% of studies, respectively.

CONCLUSIONS
The majority of prediction studies in high impact journals do not follow current methodological recommendations, limiting their reliability and applicability.

negative: Combinatorial codes in ventral temporal lobe for object recognition: Haxby (2001) revisited: is there a “face” area? Haxby et al. [Science 293 (2001) 2425] recently argued that category-related responses in the ventral temporal (VT) lobe during visual object identification were overlapping and distributed in topography. This observation contrasts with prevailing views that object codes are focal and localized to specific areas such as the fusiform and parahippocampal gyri. We provide a critical test of Haxby's hypothesis using a neural network (NN) classifier that can detect more general topographic representations and achieves 83% correct generalization performance on patterns of voxel responses in out-of-sample tests. Using voxel-wise sensitivity analysis we show that substantially the same VT lobe voxels contribute to the classification of all object categories, suggesting the code is combinatorial. Moreover, we found no evidence for local single category representations. The neural network representations of the voxel codes were sensitive to both category and superordinate level features that were only available implicitly in the object categories.

negative: Reinforcement Learning for Automatic Test Case Prioritization and Selection in Continuous Integration Testing in Continuous Integration (CI) involves test case prioritization, selection, and execution at each cycle. Selecting the most promising test cases to detect bugs is hard if there are uncertainties on the impact of committed code changes or, if traceability links between code and tests are not available. This paper introduces Retecs, a new method for automatically learning test case selection and prioritization in CI with the goal to minimize the round-trip time between code commits and developer feedback on failed test cases. The Retecs method uses reinforcement learning to select and prioritize test cases according to their duration, previous last execution and failure history. In a constantly changing environment, where new test cases are created and obsolete test cases are deleted, the Retecs method learns to prioritize error-prone test cases higher under guidance of a reward function and by observing previous CI cycles. By applying Retecs on data extracted from three industrial case studies, we show for the first time that reinforcement learning enables fruitful automatic adaptive test case selection and prioritization in CI and regression testing.

negative: Cannabidiol--recent advances. The aim of this review is to present some of the recent publications on cannabidiol (CBD; 2), a major non-psychoactive constituent of Cannabis, and to give a general overview. Special emphasis is laid on biochemical and pharmacological advances, and on novel mechanisms recently put forward, to shed light on some of the pharmacological effects that can possibly be rationalized through these mechanisms. The plethora of positive pharmacological effects observed with CBD make this compound a highly attractive therapeutic entity.

negative: When saliency meets sentiment: Understanding how image content invokes emotion and sentiment Sentiment analysis is crucial for extracting social signals from social media content. Due to the prevalence of images in social media, image sentiment analysis is receiving increasing attention in recent years. However, most existing systems are black-boxes that do not provide insight on how image content invokes sentiment and emotion in the viewers. On the other hand, psychological studies have confirmed that salient objects in an image often invoke emotions. In this work, we investigate more fine-grained and more comprehensive interaction between visual saliency and visual sentiment. In particular, we partition images in several meta-level scene-type dimensions that are relevant to most images, including: open-closed, natural-manmade, indoor-outdoor, and face-noface. Facilitated by state of the art saliency detection algorithm and sentiment classification algorithm, we examine how the sentiment of the salient region(s) in an image relates to the overall sentiment of the image. The experiments on a representative image emotion dataset have shown interesting correlation between saliency and sentiment in different scene types and shed light on the mechanism of visual sentiment evocation.

negative: The role of physical embodiment in human-robot interaction Autonomous robots are agents with physical bodies that share our environment. In this work, we test the hypothesis that physical embodiment has a measurable effect on performance and perception of social interactions. Support of this hypothesis would suggest fundamental differences between virtual agents and robots from a social standpoint and have significant implications for human-robot interaction. We measure task performance and perception of a robot's social abilities in a structured but open-ended task based on the Towers of Hanoi puzzle. Our experiment compares aspects of embodiment by evaluating: (1) the difference between a physical robot and a simulated one; (2) the effect of physical presence through a co-located robot versus a remote tele-present robot. We present data from a pilot study with 12 subjects showing interesting differences in perception of remote physical robot's and simulated agent's attention to the task, and task enjoyment

negative: Cross-layer secure cyber-physical control system design for networked 3D printers Due to the high costs of 3D-printing infrastructure, outsourcing the production to third parties specializing in 3D-printing process becomes necessary. The integration of a 3D-printing system with networked communications constitutes a cyber-physical system, bringing new security challenges. Adversaries can explore the vulnerabilities of networks to damage the physical parts of the system. In this paper, we explore the vulnerabilities of 3D-printing systems, and design a cross-layer approach for the system. At the physical layer, we use a Markov jump system to model the system and develop a robust control policy to deal with uncertainties. At the cyber-layer, we apply FlipIt game to model the contention between the defender and attacker for the control of the 3D-printing system. To connect these two layers, we develop a Stackelberg framework to capture the interactions between cyber-layer attacker and defender game and the physical-layer controller and disturbance game, and define a new equilibrium concept that captures interdependence of the zero-sum and FlipIt games. We present numerical examples to better understand the equilibria and design defense strategies for 3D printers as a tradeoff between security and robustness.

negative: Waste Management as an IoT-Enabled Service in Smart Cities Intelligent Transportation Systems (ITS) enable new services within Smart Cities. Efficient Waste Collection is considered a fundamental service for Smart Cities. Internet of Things (IoT) can be applied both in ITS and Smart cities forming an advanced platform for novel applications. Surveillance systems can be used as an assistive technology for high Quality of Service (QoS) in waste collection. Specifically, IoT components: (i) RFIDs, (ii) sensors, (iii) cameras, and (iv) actuators are incorporated into ITS and surveillance systems for efficient waste collection. In this paper we propose an advanced Decision Support System (DSS) for efficient waste collection in Smart Cities. The system incorporates a model for data sharing between truck drivers on real time in order to perform waste collection and dynamic route optimization. The system handles the case of ineffective waste collection in inaccessible areas within the Smart City. Surveillance cameras are incorporated for capturing the problematic areas and provide evidence to the authorities. The waste collection system aims to provide high quality of service to the citizens of a Smart City.

negative: Internet of Things Approach for Automation of the Complex Industrial Systems This paper presents the analysis of the Internet of Things (IoT) approach and its application for the development of embedded monitoring and automatic control systems (EMACS) for technological objects and processes that are included in complex industrial systems. The functional structure and main components of EMACS based on IoT approach are given. The examples of IoT applications in design of specialized EMACS for such complex technical objects as gas turbine engines and floating docks are presented. Considerable attention is given to particular qualities of the functional structures, software and hardware implementation as well as multi-level human-machine interfaces of the EMACS for main process parameters. The developed EMACS provide: (a) high precision control of real-time operating processes of gas turbine engines and floating docks, (b) monitoring and automatic control of current technological parameters with high quality indicators, that leads to significant increasing of energy and economic efficiency of both industrial objects.

negative: Human Motion Reconstruction from Action Video Data Using a 3-Layer-LSTM Data driven motion generation is a challenging problem. Typically the model is trained using motion capture (MOCAP) data, which is limited in scope and diversity. Solving this problem using motion data extracted from Youtube videos would enable motion generation pipelines to feed from a wider range of action data, allowing for greater variability in the actions generated. Human action is expressed through a sequence of bodily movements. Hence, in this work we explore three stages for the motion synthesis pipeline: first by extracting human pose from video data with Part Affinity Fields method by [1], and then by training a 3-Layer Recurrent Neural Network (RNN) that learns to generate human-like motion for a given class from annotated video data, and finally we explore a simple synthesis of motion from multiple classes. Ultimately, this approach could enable robust generation of a wide range of motions, capturing the the subtle and fine variations of human movement expressed in videos that populate the Internet to artificially produce life like motion.

negative: EVE: explainable vector based embedding technique using Wikipedia We present an unsupervised explainable vector embedding technique, called EVE, which is built upon the structure of Wikipedia. The proposed model defines the dimensions of a semantic vector representing a concept using human-readable labels, thereby it is readily interpretable. Specifically, each vector is constructed using the Wikipedia category graph structure together with the Wikipedia article link structure. To test the effectiveness of the proposed model, we consider its usefulness in three fundamental tasks: 1) intruder detection—to evaluate its ability to identify a non-coherent vector from a list of coherent vectors, 2) ability to cluster—to evaluate its tendency to group related vectors together while keeping unrelated vectors in separate clusters, and 3) sorting relevant items first—to evaluate its ability to rank vectors (items) relevant to the query in the top order of the result. For each task, we also propose a strategy to generate a task-specific human-interpretable explanation from the model. These demonstrate the overall effectiveness of the explainable embeddings generated by EVE. Finally, we compare EVE with the Word2Vec, FastText, and GloVe embedding techniques across the three tasks, and report improvements over the state-of-the-art.

negative: Utility max-min fair resource allocation for communication networks with multipath routing This paper considers the flow control and resource allocation problem as applied to the generic multipath communication networks with heterogeneous applications. We propose a novel distributed algorithm, show and prove that among all the sources with positive increasing and bounded utilities (no need to be concave) in steady state, the utility max-min fairness is achieved, which is essential for balancing QoS (Quality of Service) for different applications. By combining the first order Lagrangian method and filtering mechanism, the adopted approach eliminates typical oscillation behavior in multipath networks and possesses a rapid convergence property. In addition, the algorithm is capable of deciding the optimal routing strategy and distributing the total traffic evenly out of the available paths. The performance of our utility max-min fair flow control algorithm is evaluated through simulations under two representative case studies, as well as the real implementation issues are addressed deliberately for the practical purpose.

negative: 3D High-Efficiency Video Coding for Multi-View Video and Depth Data This paper describes an extension of the high efficiency video coding (HEVC) standard for coding of multi-view video and depth data. In addition to the known concept of disparity-compensated prediction, inter-view motion parameter, and inter-view residual prediction for coding of the dependent video views are developed and integrated. Furthermore, for depth coding, new intra coding modes, a modified motion compensation and motion vector coding as well as the concept of motion parameter inheritance are part of the HEVC extension. A novel encoder control uses view synthesis optimization, which guarantees that high quality intermediate views can be generated based on the decoded data. The bitstream format supports the extraction of partial bitstreams, so that conventional 2D video, stereo video, and the full multi-view video plus depth format can be decoded from a single bitstream. Objective and subjective results are presented, demonstrating that the proposed approach provides 50% bit rate savings in comparison with HEVC simulcast and 20% in comparison with a straightforward multi-view extension of HEVC without the newly developed coding tools.

negative: Fuzzy logic controller for an inverted pendulum system using quantum genetic optimization In this paper, we propose a new generalized design methodology of intelligent robust fuzzy control systems based on quantum genetic algorithm (QGA) called quantum fuzzy model that enhance robustness of fuzzy logic controllers. The QGA is adopted because of their capabilities of directed random search for global optimization to find the parameters of the shape and width of membership functions and rule set of the FLC to obtain the optimal fuzzy controller simultaneously. We test the optimal FLC obtained by the quantum computing applied on the control of dynamic balance and motion of cart-pole balancing system. We compare the proposed technique with existing mamdani fuzzy logic controller which is designed through conventional genetic algorithm. Simulation results reveal that QGA performs better than conventional GA in terms of running speed and optimizing capability.

negative: Sparse Recovery of Hyperspectral Signal from Natural RGB Images Hyperspectral imaging is an important visual modality with growing interest and range of applications. The latter, however, is hindered by the fact that existing devices are limited in either spatial, spectral, and/or temporal resolution, while yet being both complicated and expensive. We present a low cost and fast method to recover high quality hyperspectral images directly from RGB. Our approach first leverages hyperspectral prior in order to create a sparse dictionary of hyperspectral signatures and their corresponding RGB projections. Describing novel RGB images via the latter then facilitates reconstruction of the hyperspectral image via the former. A novel, larger-than-ever database of hyperspectral images serves as a hyperspectral prior. This database further allows for evaluation of our methodology at an unprecedented scale, and is provided for the benefit of the research community. Our approach is fast, accurate, and provides high resolution hyperspectral cubes despite using RGB-only input.

negative: Supervised Learning Based Algorithm Selection for Deep Neural Networks Many recent deep learning platforms rely on thirdparty libraries (such as cuBLAS) to utilize the computing power of modern hardware accelerators (such as GPUs). However, we observe that they may achieve suboptimal performance because the library functions are not used appropriately. In this paper, we target at optimizing the operations of multiplying a matrix with the transpose of another matrix (referred to as NT operation hereafter), which contribute half of the training time of fully connected deep neural networks. Rather than directly calling the library function, we propose a supervised learning based algorithm selection approach named MTNN, which uses a gradient boosted decision tree to select one from two alternative NT implementations intelligently: (1) calling the cuBLAS library function; (2) calling our proposed algorithm TNN that uses an efficient out-of-place matrix transpose. We evaluate the performance of MTNN on two modern GPUs: NVIDIA GTX 1080 and NVIDIA Titan X Pascal. MTNN can achieve 96% of prediction accuracy with very low computational overhead, which results in an average of 54% performance improvement on a range of NT operations. To further evaluate the impact of MTNN on the training process of deep neural networks, we have integrated MTNN into a popular deep learning platform Caffe. Our experimental results show that the revised Caffe can outperform the original one by an average of 28%. Both MTNN and the revised Caffe are open-source.

negative: Fractional Order Fuzzy Control of Hybrid Power System with Renewable Generation Using Chaotic PSO This paper investigates the operation of a hybrid power system through a novel fuzzy control scheme. The hybrid power system employs various autonomous generation systems like wind turbine, solar photovoltaic, diesel engine, fuel-cell, aqua electrolyzer etc. Other energy storage devices like the battery, flywheel and ultra-capacitor are also present in the network. A novel fractional order (FO) fuzzy control scheme is employed and its parameters are tuned with a particle swarm optimization (PSO) algorithm augmented with two chaotic maps for achieving an improved performance. This FO fuzzy controller shows better performance over the classical PID, and the integer order fuzzy PID controller in both linear and nonlinear operating regimes. The FO fuzzy controller also shows stronger robustness properties against system parameter variation and rate constraint nonlinearity, than that with the other controller structures. The robustness is a highly desirable property in such a scenario since many components of the hybrid power system may be switched on/off or may run at lower/higher power output, at different time instants.

negative: Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey This paper represents energy efficient routing protocols in WSN. It is a collection of sensor nodes with a set of limited Processor and limited memory unit embedded in it. Reliable routing of packets from the sensor node to its base station is the most important task for the networks. The routing protocols applied for the other networks cannot be used here due to its battery powered nodes This paper gives an overview of the different routing strategies used in wireless sensor networks and gives a brief working model of energy efficient routing protocols in WSN. It also shows the comparison of these different routing protocols based on metrics such as mobility support, stability, issues and latency.

negative: All-Digital Background Calibration of a Successive Approximation ADC Using the “Split ADC” Architecture The “split ADC” architecture enables fully digital calibration and correction of nonlinearity errors due to capacitor mismatch in a successive approximation (SAR) ADC. The die area of a single ADC design is split into two independent halves, each converting the same input signal. Total area and power is unchanged, resulting in minimal increase in analog complexity. For each conversion, the half-sized ADCs generate two independent outputs which are digitally corrected using estimates of capacitor mismatch errors for each ADC. The ADC outputs are averaged to produce the ADC output code. The difference of the two outputs is used in a background calibration algorithm which estimates the error in the correction parameters. Any nonzero difference drives an LMS feedback loop toward zero difference which can only occur when the average error in each correction parameter is zero. A novel segmentation and shuffling scheme in the SAR capacitive DAC enables background calibration for a wide range of input signals including dc. Simulation of a 16 bit 1 Msps SAR ADC in 180 nm CMOS shows calibration convergence within 200 000 samples.

negative: Towards Risk Scoring of Bitcoin Transactions If Bitcoin becomes the prevalent payment system on the Internet, crime fighters will join forces with regulators and enforce blacklisting of transaction prefixes at the parties who offer real products and services in exchange for bitcoin. Blacklisted bitcoins will be hard to spend and therefore less liquid and less valuable. This requires every recipient of Bitcoin payments not only to check all incoming transactions for possible blacklistings, but also to assess the risk of a transaction being blacklisted in the future. We elaborate this scenario, specify a risk model, devise a prediction approach using public knowledge, and present preliminary results using data from selected known thefts. We discuss the implications on markets where bitcoins are traded and critically revisit Bitcoin’s ability to serve as a unit of account.

negative: Empirical Analysis of Denial-of-Service Attacks in the Bitcoin Ecosystem We present an empirical investigation into the prevalence and impact of distributed denial-of-service (DDoS) attacks on operators in the Bitcoin economy. To that end, we gather and analyze posts mentioning “DDoS” on the popular Bitcoin forum bitcointalk.org. Starting from around 3 000 different posts made between May 2011 and October 2013, we document 142 unique DDoS attacks on 40 Bitcoin services. We find that 7% of all known operators have been attacked, but that currency exchanges, mining pools, gambling operators, eWallets, and financial services are much more likely to be attacked than other services. Not coincidentally, we find currency exchanges and mining pools are much more likely to have DDoS protection such as CloudFlare, Incapsula, or Amazon Cloud. We show that those services that have been attacked are more than three times as likely to buy anti-DDoS services than operators who have not been attacked. We find that big mining pools (those with historical hashrate shares of at least 5%) are much more likely to be DDoSed than small pools. We investigate Mt. Gox as a case study for DDoS attacks on currency exchanges and find a disproportionate amount of DDoS reports made during the large spike in trading volume and exchange rates in spring 2013. We conclude by outlining future opportunities for researching DDoS attacks on Bitcoin.

negative: Beware the Middleman: Empirical Analysis of Bitcoin-Exchange Risk Bitcoin has enjoyed wider adoption than any previous crypto-currency; yet its success has also attracted the attention of fraudsters who have taken advantage of operational insecurity and transaction irreversibility. We study the risk investors face from Bitcoin exchanges, which convert between Bitcoins and hard currency. We examine the track record of 40 Bitcoin exchanges established over the past three years, and find that 18 have since closed, with customer account balances often wiped out. Fraudsters are sometimes to blame, but not always. Using a proportional hazards model, we find that an exchange’s transaction volume indicates whether or not it is likely to close. Less popular exchanges are more likely to be shut than popular ones. We also present a logistic regression showing that popular exchanges are more likely to suffer a security breach.

negative: Information propagation in the Bitcoin network Bitcoin is a digital currency that unlike traditional currencies does not rely on a centralized authority. Instead Bitcoin relies on a network of volunteers that collectively implement a replicated ledger and verify transactions. In this paper we analyze how Bitcoin uses a multi-hop broadcast to propagate transactions and blocks through the network to update the ledger replicas. We then use the gathered information to verify the conjecture that the propagation delay in the network is the primary cause for blockchain forks. Blockchain forks should be avoided as they are symptomatic for inconsistencies among the replicas in the network. We then show what can be achieved by pushing the current protocol to its limit with unilateral changes to the client's behavior.

negative: Two Bitcoins at the Price of One? Double-Spending Attacks on Fast Payments in Bitcoin Bitcoin is a decentralized payment system that is based on Proof-of-Work. Bitcoin is currently gaining popularity as a digital currency; several businesses are starting to accept Bitcoin transactions. An example case of the growing use of Bitcoin was recently reported in the media; here, Bitcoins were used as a form of fast payment in a local fast-food restaurant. In this paper, we analyze the security of using Bitcoin for fast payments, where the time between the exchange of currency and goods is short (i.e., in the order of few seconds). We focus on doublespending attacks on fast payments and demonstrate that these attacks can be mounted at low cost on currently deployed versions of Bitcoin. We further show that the measures recommended by Bitcoin developers for the use of Bitcoin in fast transactions are not always effective in resisting double-spending; we show that if those recommendations are integrated in future Bitcoin implementations, double-spending attacks on Bitcoin will still be possible. Finally, we leverage on our findings and propose a lightweight countermeasure that enables the detection of doublespending attacks in fast transactions.

negative: FraudMiner: A Novel Credit Card Fraud Detection Model Based on Frequent Itemset Mining This paper proposes an intelligent credit card fraud detection model for detecting fraud from highly imbalanced and anonymous credit card transaction datasets. The class imbalance problem is handled by finding legal as well as fraud transaction patterns for each customer by using frequent itemset mining. A matching algorithm is also proposed to find to which pattern (legal or fraud) the incoming transaction of a particular customer is closer and a decision is made accordingly. In order to handle the anonymous nature of the data, no preference is given to any of the attributes and each attribute is considered equally for finding the patterns. The performance evaluation of the proposed model is done on UCSD Data Mining Contest 2009 Dataset (anonymous and imbalanced) and it is found that the proposed model has very high fraud detection rate, balanced classification rate, Matthews correlation coefficient, and very less false alarm rate than other state-of-the-art classifiers.

negative: Anonymous CoinJoin Transactions with Arbitrary Values Bitcoin, the arguably most popular cryptocurrency to date, allows users to perform transactions using freely chosen pseudonymous addresses. Previous research, however, suggests that these pseudonyms can easily be linked, implying a lower level of privacy than originally expected. To obfuscate the links between pseudonyms, different mixing methods have been proposed. One of the first approaches is the CoinJoin concept, where multiple users merge their transactions into one larger transaction. In theory, CoinJoin can be used to mix and transact bitcoins simultaneously, in one step. Yet, it is expected that differing bitcoin amounts would allow an attacker to derive the original single transactions. Solutions based on CoinJoin therefore prescribe the use of fixed bitcoin amounts and cannot be used to perform arbitrary transactions.In this paper, we define a model for CoinJoin transactions and metrics that allow conclusions about the provided anonymity. We generate and analyze CoinJoin transactions and show that with differing, representative amounts they generally do not provide any significant anonymity gains. As a solution to this problem, we present an output splitting approach that introduces sufficient ambiguity to effectively prevent linking in CoinJoin transactions. Furthermore, we discuss how this approach could be used in Bitcoin today.


query: Euclidean and Hamming Embedding for Image Patch Description with Convolutional Networks

positive: Dimensionality Reduction by Learning an Invariant Mapping Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that 'similar" points in input space are mapped to nearby points on the manifold. We present a method - called Dimensionality Reduction by Learning an Invariant Mapping (DrLIM) - for learning a globally coherent nonlinear function that maps the data evenly to the output manifold. The learning relies solely on neighborhood relationships and does not require any distancemeasure in the input space. The method can learn mappings that are invariant to certain transformations of the inputs, as is demonstrated with a number of experiments. Comparisons are made to other techniques, in particular LLE.

positive: A Performance Evaluation of Local Descriptors

positive: Vlfeat: an open and portable library of computer vision algorithms VLFeat is an open and portable library of computer vision algorithms. It aims at facilitating fast prototyping and reproducible research for computer vision scientists and students. It includes rigorous implementations of common building blocks such as feature detectors, feature extractors, (hierarchical) k-means clustering, randomized kd-tree matching, and super-pixelization. The source code and interfaces are fully documented. The library integrates directly with MATLAB, a popular language for computer vision research.

positive: BRIEF: Computing a Local Binary Descriptor Very Fast Binary descriptors are becoming increasingly popular as a means to compare feature points very fast while requiring comparatively small amounts of memory. The typical approach to creating them is to first compute floating-point ones, using an algorithm such as SIFT, and then to binarize them. In this paper, we show that we can directly compute a binary descriptor, which we call BRIEF, on the basis of simple intensity difference tests. As a result, BRIEF is very fast both to build and to match. We compare it against SURF and SIFT on standard benchmarks and show that it yields comparable recognition accuracy, while running in an almost vanishing fraction of the time required by either.

positive: Learning Local Feature Descriptors Using Convex Optimisation The objective of this work is to learn descriptors suitable for the sparse feature detectors used in viewpoint invariant matching. We make a number of novel contributions towards this goal. First, it is shown that learning the pooling regions for the descriptor can be formulated as a convex optimisation problem selecting the regions using sparsity. Second, it is shown that descriptor dimensionality reduction can also be formulated as a convex optimisation problem, using Mahalanobis matrix nuclear norm regularisation. Both formulations are based on discriminative large margin learning constraints. As the third contribution, we evaluate the performance of the compressed descriptors, obtained from the learnt real-valued descriptors by binarisation. Finally, we propose an extension of our learning formulations to a weakly supervised case, which allows us to learn the descriptors from unannotated image collections. It is demonstrated that the new learning methods improve over the state of the art in descriptor learning on the annotated local patches data set of Brown et al. and unannotated photo collections of Philbin et al. .

negative: Quantitative Evaluation of DC Microgrids Availability: Effects of System Architecture and Converter Topology Design Choices This paper presents a quantitative method to evaluate dc microgrids availability by identifying and calculating minimum cut sets occurrence probability for different microgrid architectures and converter topologies. Hence, it provides planners with an essential tool to evaluate downtime costs and decide technology deployments based on quantitative risk assessments by allowing to compare the effect that converter topologies and microgrid architecture choices have on availability. Conventional architectures with single-input converters and alternative configurations with multiple-input converters (MICs) are considered. Calculations yield that all microgrid configurations except those utilizing center converters achieve similar availability of 6-nines. Three converter topologies are used as representatives of many other circuits. These three benchmark circuits are the boost, the isolated SEPIC (ISEPIC), and the current-source half-bridge. Marginal availability differences are observed for different circuit topology choices, although architectures with MICs are more sensitive to this choice. MICs and, in particular, the ISEPIC, are identified as good compromise options for dc microgrids source interfaces. The analysis also models availability influence of local energy storage, both in batteries and generators' fuel. These models provide a quantitative way of comparing dc microgrids with conventional backup energy systems. Calculations based on widely accepted data in industry supports the analysis.

negative: VM Placement Strategies for Cloud Scenarios The problem of Virtual Machine (VM) placement in a compute cloud infrastructure is well-studied in the literature. However, the majority of the existing works ignore the dynamic nature of the incoming stream of VM deployment requests that continuously arrive to the cloud provider infrastructure. In this paper we provide a practical model of cloud placement management under a stream of requests and present a novel technique called Backward Speculative Placement (BSP) that projects the past demand behavior of a VM to a candidate target host. We exploit the BSP technique in two algorithms, first for handling the stream of deployment requests, second in a periodic optimization, to handle the dynamic aspects of the demands. We show the benefits of our BSP technique by comparing the results on a simulation period with a strategy of choosing an optimal placement at each time instant, produced by a generic MIP solver.

negative: Cachexia: a new definition. On December 13th and 14th a group of scientists and clinicians met in Washington, DC, for the cachexia consensus conference. At the present time, there is no widely agreed upon operational definition of cachexia. The lack of a definition accepted by clinician and researchers has limited identification and treatment of cachectic patient as well as the development and approval of potential therapeutic agents. The definition that emerged is: "cachexia, is a complex metabolic syndrome associated with underlying illness and characterized by loss of muscle with or without loss of fat mass. The prominent clinical feature of cachexia is weight loss in adults (corrected for fluid retention) or growth failure in children (excluding endocrine disorders). Anorexia, inflammation, insulin resistance and increased muscle protein breakdown are frequently associated with cachexia. Cachexia is distinct from starvation, age-related loss of muscle mass, primary depression, malabsorption and hyperthyroidism and is associated with increased morbidity. While this definition has not been tested in epidemiological or intervention studies, a consensus operational definition provides an opportunity for increased research.

negative: Deep Neural Network Capacity In recent years, deep neural network exhibits its powerful superiority on information discrimination in many computer vision applications. However, the capacity of deep neural network architecture is still a mystery to the researchers. Intuitively, larger capacity of neural network can always deposit more information to improve the discrimination ability of the model. But, the learnable parameter scale is not feasible to estimate the capacity of deep neural network. Due to the overfitting, directly increasing hidden nodes number and hidden layer number are already demonstrated not necessary to effectively increase the network discrimination ability. In this paper, we propose a novel measurement, named “total valid bits”, to evaluate the capacity of deep neural networks for exploring how to quantitatively understand the deep learning and the insights behind its super performance. Specifically, our scheme to retrieve the total valid bits incorporates the skilled techniques in both training phase and inference phase. In the network training, we design decimal weight regularization and 8-bit forward quantization to obtain the integer-oriented network representations. Moreover, we develop adaptive-bitwidth and non-uniform quantization strategy in the inference phase to find the neural network capacity, total valid bits. By allowing zero bitwidth, our adaptive-bitwidth quantization can execute the model reduction and valid bits finding simultaneously. In our extensive experiments, we first demonstrate that our total valid bits is a good indicator of neural network capacity. We also analyze the impact on network capacity from the network architecture and advanced training

negative: The effectiveness of the combined use of VIX and Support Vector Machines on the prediction of S&P 500 The aim of this research is to analyse the effectiveness of the Chicago Board Options Exchange Market Volatility Index (VIX) when used with Support Vector Machines (SVMs) in order to forecast the weekly change in the S&P 500 index. The data provided cover the period between 3 January 2000 and 30 December 2011. A trading simulation is implemented so that statistical efficiency is complemented by measures of economic performance. The inputs retained are traditional technical trading rules commonly used in the analysis of equity markets such as Relative Strength Index, Moving Average Convergence Divergence, VIX and the daily return of the S&P 500. The SVM identifies the best situations in which to buy or sell in the market. The two outputs of the SVM are the movement of the market and the degree of set membership. The obtained results show that SVM using VIX produce better results than the Buy and Hold strategy or SVM without VIX. The influence of VIX in the trading system is particularly significant when bearish periods appear. Moreover, the SVM allows the reduction in the Maximum Drawdown and the annualised standard deviation.

negative: A tourism destination recommender system using users’ sentiment and temporal dynamics With the development and popularity of social networks, an increasing number of consumers prefer to order tourism products online, and like to share their experiences on social networks. Searching for tourism destinations online is a difficult task on account of its more restrictive factors. Recommender system can help these users to dispose information overload. However, such a system is affected by the issue of low recommendation accuracy and the cold-start problem. In this paper, we propose a tourism destination recommender system that employs opinion-mining technology to refine user sentiment, and make use of temporal dynamics to represent user preference and destination popularity drifting over time. These elements are then fused with the SVD+ + method by combining user sentiment and temporal influence. Compared with several well-known recommendation approaches, our method achieves improved recommendation accuracy and quality. A series of experimental evaluations, using a publicly available dataset, demonstrates that the proposed recommender system outperforms the existing recommender systems.

negative: Dynamic MRI reconstruction using low rank plus sparse tensor decomposition In this paper, we introduce a multi-dimensional approach to the problem of reconstruction of MR image sequences that are highly undersampled in k-space. By formulating the reconstruction as a high-order low-rank plus sparse tensor decomposition problem, we propose an efficient numerical algorithm based on the alternating direction method of multipliers (ADMM) to solve the optimization. Through extensive experimental results we show that our proposed method achieves superior reconstruction quality, compared to the state-of-the-art reconstruction methods.

negative: Strategy and architecture of a safety concept for fully automatic and autonomous driving assistance systems As drivers back out of the driving task, when transported automatically by an intelligent car for a longer time, they are not always able to react properly, if a driver take over request occurs. This paper presents two ways, how to deal with this problem within the scope of a functional safety concept. Thereto, the difference between fully automatic and autonomous driving assistance systems is explained. Afterwards two different strategies to reach a safe state in consequence of a system boundary crossing are proposed. In the first case the fall back state is reached by a driver take over, in the second case by an automatic, active fail-safe mechanism. Subsequently the necessary components for monitoring and reaching a safe state and their embedment in a basic, functional architecture of a driving assistance system are described. In this context, special regard is paid to aspects of redundancy as well. In the end it is concluded, that the safety concept proposed here is crucial for guaranteeing enduring safety in an automatically driving car and in consequence for making automatic driving functions commercially ready for serial production.

negative: Open innovation : State of the art and future perspectives Open innovation has become one of the hottest topics in innovation management. This article intends to explore the limits in our understanding of the open innovation concept. In doing so, I address the questions of what (the content of open innovation), when (the context dependency) and how (the process). Open innovation is a rich concept, that can be implemented in many different ways. The context dependency of open innovation is one of the least understood topics; more research is needed on the internal and external environment characteristics affecting performance. The open innovation process relates to both the transition towards open innovation, and the various open innovation practices. As with any new concept, initial studies focus on successful and early adopters, are based on case studies, and descriptive. However, not all lessons learned from the early adopters may be applicable to following firms. Case study research increases our understanding of how things work and enables us to identify important phenomena. They should be followed by quantitative studies involving large samples to determine the relative importance of factors, to build path models to understand chains of effects, and to formally test for context dependencies. However, the evidence shows that open innovation has been a valuable concept for so many firms and in so many contexts, that it is on its way to find its final place in innovation management. & 2010 Elsevier Ltd. All rights reserved.

negative: LINE-mediated retrotransposition of marked Alu sequences Alu elements are the most successful transposons in humans. They are 300-bp non-coding sequences transcribed by RNA polymerase III (Pol III) and are expected to retrotranspose with the aid of reverse transcriptases of cellular origin. We previously showed that human LINEs can generate cDNA copies of any mRNA transcript by means of a retroposition process involving reverse transcription and integration by the LINE-encoded endonuclease and reverse transcriptase. Here we show mobility of marked Alu sequences in human HeLa cells with the canonical features of a retrotransposition process, including splicing out of an autocatalytic intron introduced into the marked sequence, target site duplications of varying lengths and integrations into consensus A-rich sequences. We further show that the poly-A stretch at the Alu 3′ end is essential for mobility, that LINEs are required for transposition and that the rate of retroposition is 100–1,000 times higher for Alu transcripts than for control mRNAs, thus accounting for the high mutational activity of these elements observed in humans.

negative: Adaptive Image Registration via Hierarchical Voronoi Subdivision Advances in image acquisition systems have made it possible to capture high-resolution images of a scene, recording considerable scene details. With increased resolution comes increased image size and geometric difference between multiview images, complicating image registration. Through Voronoi subdivision, we subdivide large images into small corresponding regions, and by registering small regions, we register the images in a piecewise manner. Image subdivision reduces the geometric difference between regions that are registered and simplifies the correspondence process. The proposed method is a hierarchical one. While previous methods use the same block size and shape at a hierarchy, the proposed method adapts the block size and shape to the local image details and geometric difference between the images. This adaptation makes it possible to keep geometric difference between corresponding regions small and simplifies the correspondence process. Implementational details of the proposed image registration method are provided, and experimental results on various types of images are presented and analyzed.

negative: Security Strategies for SCADA Networks SCADA systems have historically been isolated from other computing resources. However, the use of TCP/IP as a carrier protocol and the trend to interconnect SCADA systems with enterprise networks introduce serious security threats. This paper describes two strategies for securing SCADA networks, both of which have been implemented in a laboratory-scale Modbus network. The first utilizes a security services suite that minimizes the impact on time-critical industrial process systems while adhering to industry standards. The second engages a sophisticated forensic system for SCADA network traffic collection and analysis. The forensic system supports the post mortem analysis of security breaches and the monitoring of process behavior to optimize plant

negative: BSSync: Processing Near Memory for Machine Learning Workloads with Bounded Staleness Consistency Models Parallel machine learning workloads have become prevalent in numerous application domains. Many of these workloads are iterative convergent, allowing different threads to compute in an asynchronous manner, relaxing certain read-after-write data dependencies to use stale values. While considerable effort has been devoted to reducing the communication latency between nodes by utilizing asynchronous parallelism, inefficient utilization of relaxed consistency models within a single node have caused parallel implementations to have low execution efficiency. The long latency and serialization caused by atomic operations have a significant impact on performance. The data communication is not overlapped with the main computation, which reduces execution efficiency. The inefficiency comes from the data movement between where they are stored and where they are processed. In this work, we propose Bounded Staled Sync (BSSync), a hardware support for the bounded staleness consistency model, which accompanies simple logic layers in the memory hierarchy. BSSync overlaps the long latency atomic operation with the main computation, targeting iterative convergent machine learning workloads. Compared to previous work that allows staleness for read operations, BSSync utilizes staleness for write operations, allowing stale-writes. We demonstrate the benefit of the proposed scheme for representative machine learning workloads. On average, our approach outperforms the baseline asynchronous parallel implementation by 1.33x times.

negative: Potential Bacillus probiotics enhance bacterial numbers, water quality and growth during early development of white shrimp (Litopenaeus vannamei). Epidemics of epizootics and occurrence of multiresistant antibiotics of pathogenic bacteria in aquaculture have put forward a development of effective probiotics for the sustainable culture. This study examined the effectiveness of forms of mixed Bacillus probiotics (probiotic A and probiotic B) and mode of probiotic administration on growth, bacterial numbers and water quality during rearing of white shrimp (Litopenaeus vannamei) in two separated experiments: (1) larval stages and (2) postlarval (PL) stages. Forms of Bacillus probiotics and modes of probiotic administration did not affect growth and survival of larval to PL shrimp. The compositions of Bacillus species in probiotic A and probiotic B did not affect growth and survival of larvae. However, postlarvae treated with probiotic B exhibited higher (P<0.05) growth than probiotic A and controls, indicating Bacillus probiotic composition affects the growth of PL shrimp. Total heterotrophic bacteria and Bacillus numbers in larval and PL shrimp or culture water of the treated groups were higher (P<0.05) than in controls. Levels of pH, ammonia and nitrite of the treated shrimp were significantly decreased, compared to the controls. Microencapsulated Bacillus probiotic was effective for rearing of PL L. vannamei. This investigation showed that administration of mixed Bacillus probiotics significantly improved growth and survival of PL shrimp, increased beneficial bacteria in shrimp and culture water and enhanced water quality for the levels of pH, ammonia and nitrite of culture water.

negative: A Piezoelectric Energy Harvester for Rotary Motion Applications: Design and Experiments This paper investigates the analysis and design of a vibration-based energy harvester for rotary motion applications. The energy harvester consists of a cantilever beam with a tip mass and a piezoelectric ceramic attached along the beam that is mounted on a rotating shaft. Using this system, mechanical vibration energy is induced in the flexible beam due to the gravitational force applied to the tip mass while the hub is rotating. The piezoelectric transducer is used to convert the induced mechanical vibration energy into electricity. The equations of motion of the flexible structure are utilized along with the physical characteristics of the piezoelectric transducer to derive expressions for the electrical power. Furthermore, expressions for the optimum load resistance and maximum output power are obtained and validated experimentally using PVDF and PZT transducers. The results indicate that a maximum power of 6.4 mW at a shaft speed of 138 rad/s can be extracted by using a PZT transducer with dimensions 50.8 mm × 38.1 mm × 0.13 mm. This amount of power is sufficient to provide power for typical wireless sensors such as accelerometers and strain gauges.

negative: Corrosion Study and Intermetallics Formation in Gold and Copper Wire Bonding in Microelectronics Packaging A comparison study on the reliability of gold (Au) and copper (Cu) wire bonding is conducted to determine their corrosion and oxidation behavior in different environmental conditions. The corrosion and oxidation behaviors of Au and Cu wire bonding are determined through soaking in sodium chloride (NaCl) solution and high temperature storage (HTS) at 175 °C, 200 °C and 225 °C. Galvanic corrosion is more intense in Cu wire bonding as compared to Au wire bonding in NaCl solution due to the minimal formation of intermetallics in the former. At all three HTS annealing temperatures, the rate of Cu-Al intermetallic formation is found to be three to five times slower than Au-Al intermetallics. The faster intermetallic growth rate and lower activation energy found in this work for both Au/Al and Cu/Al as compared to literature could be due to the thicker Al pad metallization which removed the rate-determining step in previous studies due to deficit in Al material.

negative: POMDP-based dialogue manager adaptation to extended domains Existing spoken dialogue systems are typically designed to operate in a static and well-defined domain, and are not well suited to tasks in which the concepts and values change dynamically. To handle dynamically changing domains, techniques will be needed to transfer and reuse existing dialogue policies and rapidly adapt them using a small number of dialogues in the new domain. As a first step in this direction, this paper addresses the problem of automatically extending a dialogue system to include a new previously unseen concept (or slot) which can be then used as a search constraint in an information query. The paper shows that in the context of Gaussian process POMDP optimisation, a domain can be extended through a simple expansion of the kernel and then rapidly adapted. As well as being much quicker, adaptation rather than retraining from scratch is shown to avoid subjecting users to unacceptably poor performance during the learning stage.

negative: Towards Automated Cost-Efficient Data Management for Federated Cloud Services Cloud computing has transformed the accessibility and usage of information technology resources, by offering them as services via the Internet. Cloud service provisioning spans across infrastructure, platform and software levels. The management of the services at these levels is based on monitoring. The analysis of monitoring data provides insight into Cloud operations in order to make informed decisions. Due to the emergence of numerous heterogenous Cloud platforms with proprietary APIs, service and monitoring data are being formatted using diverse and mostly incompatible data interchange formats. This results to interoperability issues and makes the analysis of monitoring data from multi-Cloud service deployments difficult to handle. The existing research efforts on data interchange formats have been mainly focused on general performance analyses. Little or no effort has been channelled towards a combination of multiple data interchange formats based on data type to achieve efficient serialisation that can facilitate interoperability in federated Clouds, and also reduce the size of data and bandwidth utilisation cost. This paper addresses these issues by presenting automated framework that is capable of automatically selecting the most suitable data interchange formats for achieving an efficient formatting and serialisation outcome. The goal of the framework is to enable robust and transparent communication within and between multiple Cloud deployments. Based on three use case scenarios, we evaluate the proposed framework to demonstrate its efficacy in formatting and serialising data.

negative: Crowd Sourcing, with a Few Answers: Recommending Commuters for Traffic Updates Real-time traffic awareness applications are playing an ever increasing role understanding and tackling traffic congestion in cities. First-hand accounts from drivers witnessing an incident is an invaluable source of information for traffic managers. Nowadays, drivers increasingly contact control rooms through social media to report on journey times, accidents or road weather conditions. These new interactions allow traffic controllers to engage users, and in particular to query them for information rather than passively collecting it. Querying participants presents the challenge of which users to probe for updates about a specific situation. In order to maximise the probability of a user responding and the accuracy of the information, we propose a strategy which takes into account the engagement levels of the user, the mobility profile and the reputation of the user. We provide an analysis of a real-world user corpus of Twitter users contributing updates to LiveDrive, a Dublin based traffic radio station.

negative: Psychophysical magic: rendering the visible ‘invisible’ What are the neural correlates of conscious visual awareness? Tackling this question requires contrasting neural correlates of stimulus processing culminating in visual awareness with neural correlates of stimulus processing unaccompanied by awareness. To produce these two neural states, one must be able to erase an otherwise visible stimulus from awareness. This article describes and assesses visual phenomena involving dissociation of physical stimulation and conscious awareness: degraded stimulation, visual masking, visual crowding, bistable figures, binocular rivalry, motion-induced blindness, inattentional blindness, change blindness and attentional blink. No single approach stands above the others, but those producing changing visual awareness despite invariant physical stimulation are clearly preferable. Such phenomena can help lead us ultimately to a comprehensive account of the neural correlates of conscious awareness.

negative: A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs Sorting is at the core of many database operations, such as index creation, sort-merge joins, and user-requested output sorting. As GPUs are emerging as a promising platform to accelerate various operations, sorting on GPUs becomes a viable endeavour. Over the past few years, several improvements have been proposed for sorting on GPUs, leading to the first radix sort implementations that achieve a sorting rate of over one billion 32-bit keys per second. Yet, state-of-the-art approaches are heavily memory bandwidth-bound, as they require substantially more memory transfers than their CPU-based counterparts. Our work proposes a novel approach that almost halves the amount of memory transfers and, therefore, considerably lifts the memory bandwidth limitation. Being able to sort two gigabytes of eight-byte records in as little as 50 milliseconds, our approach achieves a 2.32-fold improvement over the state-of-the-art GPU-based radix sort for uniform distributions, sustaining a minimum speed-up of no less than a factor of 1.66 for skewed distributions. To address inputs that either do not reside on the GPU or exceed the available device memory, we build on our efficient GPU sorting approach with a pipelined heterogeneous sorting algorithm that mitigates the overhead associated with PCIe data transfers. Comparing the end-to-end sorting performance to the state-of-the-art CPU-based radix sort running 16 threads, our heterogeneous approach achieves a 2.06-fold and a 1.53-fold improvement for sorting 64 GB key-value pairs with a skewed and a uniform distribution, respectively.

negative: Context-Aware Filtering and Visualization of Web Service Clusters Web service filtering is an efficient approach to address some big challenges in service computing, such as discovery, clustering and recommendation. The key operation of the filtering process is measuring the similarity of services. Several methods are used in current similarity calculation approaches such as string-based, corpus-based, knowledge-based and hybrid methods. These approaches do not consider domain-specific contexts in measuring similarity because they have failed to capture the semantic similarity of Web services in a given domain and this has affected their filtering performance. In this paper, we propose a context-aware similarity method that uses a support vector machine and a domain dataset from a context-specific search engine query. Our filtering approach uses a spherical associated keyword space algorithm that projects filtering results from a three-dimensional sphere to a two-dimensional (2D) spherical surface for 2D visualization. Experimental results show that our filtering approach works efficiently.

negative: Long-Span Program Behavior Modeling and Attack Detection Intertwined developments between program attacks and defenses witness the evolution of program anomaly detection methods. Emerging categories of program attacks, e.g., non-control data attacks and data-oriented programming, are able to comply with normal trace patterns at local views. This article points out the deficiency of existing program anomaly detection models against new attacks and presents long-span behavior anomaly detection (LAD), a model based on mildly context-sensitive grammar verification. The key feature of LAD is its reasoning of correlations among arbitrary events that occurred in long program traces. It extends existing correlation analysis between events at a stack snapshot, e.g., paired call and ret, to correlation analysis among events that historically occurred during the execution. The proposed method leverages specialized machine learning techniques to probe normal program behavior boundaries in vast high-dimensional detection space. Its two-stage modeling/detection design analyzes event correlation at both binary and quantitative levels. Our prototype successfully detects all reproduced real-world attacks against sshd, libpcre, and sendmail. The detection procedure incurs 0.1 ms to 1.3 ms overhead to profile and analyze a single behavior instance that consists of tens of thousands of function call or system call events.

negative: Electrically programmable fuse (eFUSE) using electromigration in silicides For the first time we describe a positive application of electromigration, as an electrically programmable fuse device (eFUSE). Upon programming, eFUSE's show a large increase in resistance that enable easy sensing. The transient device characteristics show that the eFUSE stays in a low resistance state during programming due to the local heating of the fuse link. The programming is enhanced by a device design that uses a large cathode which increases the temperature gradient and minimizes the effect of microstructural variations.

negative: Deformation Constraints in a Mass-Spring Model to Describe Rigid Cloth Behavior This paper describes a physically-based model for animating cloth objects, derived from elastically deformable models, and improved in order to take into account the non-elastic properties of woven fabrics . A cloth object is first approximated to a deformable surface composed of a network of masses and springs, the movement of which is evaluated using the numerical integration of the fundamental law of dynamics. We show that when a concentration of high stresses occurs in a small region of the surface, the local deformation becomes unrealistic compared to real deformations of textiles . With such an elastic model , the only solution to decrease these deformations has been so far to increase the stiffness of the deformed springs, but we show that it dramatically increases the cost of the algorithm. We present therefore a new method to adapt our model to the particularly stiff properties of textiles, inspired from dynamic inverse procedures. R esume Cet article decrit un modele physique d'animation des tissus, variante des modeles elastiques deformables, et ameliore de fa<;on a prendre en compte les proprietes non elastiques des textiles . Nous modelisons tout d 'abord une piece de tissu par une surface deformable, constituee d 'un reseau de masses et de ressorts. Son mouvement est evalue grace a I'integration numerique de la loi fondamentale de la dynamique. Nous montrons que lorsqu'une forte concentration de contraintes apparait a certains endroits de la surface, la deformation locale y devient irrealiste comparee aux deformations rencontrees dans les tissus reels . A vec un tel modele elastique, la seule solution permettant d'attenuer cette deformation etait jusqu'a present d 'augmenter la raideur des ressorts deformes, mais nous montrons que ceci faisait croitre dramatiquement le cout de I'algorithme. Nous presentons donc ici une nouvelle methode permettant d 'adapter notre mode le aux proprietes particulierement rigides des textiles, inspiree des procedures de dynamique inverse.

negative: Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph structure parameters (like variable degrees, check node degrees, girth) of the Tanner graph and of the underlying proto-graph. Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close to) the respective minimum Hamming distance upper bounds. Because of the tight algebraic connection between QC codes and convolutional codes, we can state similar results for the free Hamming distance of convolutional codes. In fact, some QC code statements are established by first proving the corresponding convolutional code statements and then using a result by Tanner that says that the minimum Hamming distance of a QC code is upper bounded by the free Hamming distance of the convolutional code that is obtained by “unwrapping” the QC code.

negative: Segmentation of Glioma Tumors in Brain Using Deep Convolutional Neural Network Detection of brain tumor using a segmentation based approach is critical in cases, where survival of a subject depends on an accurate and timely clinical diagnosis. Gliomas are the most commonly found tumors having irregular shape and ambiguous boundaries, making them one of the hardest tumors to detect. The automation of brain tumor segmentation remains a challenging problem mainly due to significant variations in its structure. An automated brain tumor segmentation algorithm using deep convolutional neural network (DCNN) is presented in this paper. A patch based approach along with an inception module is used for training the deep network by extracting two co-centric patches of different sizes from the input images. Recent developments in deep neural networks such as drop-out, batch normalization, non-linear activation and inception module are used to build a new ILinear nexus architecture. The module overcomes the over-fitting problem arising due to scarcity of data using drop-out regularizer. Images are normalized and bias field corrected in the pre-processing step and then extracted patches are passed through a DCNN, which assigns an output label to the central pixel of each patch. Morphological operators are used for post-processing to remove small false positives around the edges. A two-phase weighted training method is introduced and evaluated using BRATS 2013 and BRATS 2015 datasets, where it improves the performance parameters of state-of-the-art techniques under similar settings.

negative: Breast Cancer Classification from Histopathological Images with Inception Recurrent Residual Convolutional Neural Network The Deep Convolutional Neural Network (DCNN) is one of the most powerful and successful deep learning approaches. DCNNs have already provided superior performance in different modalities of medical imaging including breast cancer classification, segmentation, and detection. Breast cancer is one of the most common and dangerous cancers impacting women worldwide. In this paper, we have proposed a method for breast cancer classification with the Inception Recurrent Residual Convolutional Neural Network (IRRCNN) model. The IRRCNN is a powerful DCNN model that combines the strength of the Inception Network (Inception-v4), the Residual Network (ResNet), and the Recurrent Convolutional Neural Network (RCNN). The IRRCNN shows superior performance against equivalent Inception Networks, Residual Networks, and RCNNs for object recognition tasks. In this paper, the IRRCNN approach is applied for breast cancer classification on two publicly available datasets including BreakHis and Breast Cancer (BC) classification challenge 2015. The experimental results are compared against the existing machine learning and deep learning–based approaches with respect to image-based, patch-based, image-level, and patient-level classification. The IRRCNN model provides superior classification performance in terms of sensitivity, area under the curve (AUC), the ROC curve, and global accuracy compared to existing approaches for both datasets.

negative: A convolutional neural networks denoising approach for salt and pepper noise The salt and pepper noise, especially the one with extremely high percentage of impulses, brings a significant challenge to image denoising. In this paper, we propose a non-local switching filter convolutional neural network denoising algorithm, named NLSF-CNN, for salt and pepper noise. As its name suggested, our NLSF-CNN consists of two steps, i.e., a NLSF processing step and a CNN training step. First, we develop a NLSF pre-processing step for noisy images using non-local information. Then, the pre-processed images are divided into patches and used for CNN training, leading to a CNN denoising model for future noisy images. We conduct a number of experiments to evaluate the effectiveness of NLSF-CNN. Experimental results show that NLSF-CNN outperforms the state-of-the-art denoising algorithms with a few training images.

negative: A Multi-Scale CNN and Curriculum Learning Strategy for Mammogram Classification Screening mammography is an important front-line tool for the early detection of breast cancer, and some 39 million exams are conducted each year in the United States alone. Here, we describe a multi-scale convolutional neural network (CNN) trained with a curriculum learning strategy that achieves high levels of accuracy in classifying mammograms. Specifically, we first train CNN-based patch classifiers on segmentation masks of lesions in mammograms, and then use the learned features to initialize a scanning-based model that renders a decision on the whole image, trained end-to-end on outcome data. We demonstrate that our approach effectively handles the “needle in a haystack” nature of full-image mammogram classification, achieving 0.92 AUROC on the DDSM dataset.

negative: Eye detection by using deep learning In recent years, deep learning algorithm has been one of the most used method in machine learning. Success rate of the most popular machine learning problems has been increased by using it. In this work, we develop an eye detection method by using a deep neural network. The designed network, which is accepted as an input by Caffe, has 3 convolution layers and 3 max pooling layers. This model has been trained with 16K positive and 52K negative image patches. The last layer of the network is the classification layer which operates a softmax algorithm. The trained model has been tested with images, which were provided on FDDB and CACD datasets, and also compared with Haar eye detection algorithm. Recall value of the method is higher than the Haar algorithm on the two datasets. However, according to the precision rate, the Haar algorithm is successful on FDDB dataset.

negative: Soft Biometrics in Online Social Networks: A Case Study on Twitter User Gender Recognition The proliferate unstructured data generated in online social networks leads to significant research advances in the recognition of user profiles (e.g., age, gender, ethnicity, etc.), but meanwhile brings new challenges. These attributes are referred to as soft biometrics and provide a semantic description of users. Identifying users' soft biometric traits in online social networks is crucial for a variety of applications such as customized marketing, personalized recommendation, and urban planning. Compared to conventional studies, we address the importance and challenges of identifying soft biometrics in online social networks and provide a case study on gender recognition of Twitter users based on their tweets texts and profile images. We first apply an efficient approach to label the soft biometric attributes of users using their self-reported names, instead of labor-forced methodology such as manually labeling and crowdsourcing. Then we investigate the approaches using texts and profile images, respectively, including Hashtag-based TF-IDF, LDA Topic Distribution, SIFT-based TF-IDF and Convolutional Neural Networks (CNN). Finally, we propose an ensemble method by combining models learned from both texts and images to enhance gender identification. The performance in our extensive experiments is demonstrated to be comparative with state-of the-art work.