query: Multi-class active learning for image classification

positive: Probability Estimates for Multi-class Classification by Pairwise Coupling Pairwise coupling is a popular multi-class classification method that combines together all pairwise comparisons for each pair of classes. This paper presents two approaches for obtaining class probabilities. Both methods can be reduced to linear systems and are easy to implement. We show conceptually and experimentally that the proposed approaches are more stable than two existing popular methods: voting and [3].

positive: Support Vector Machine Active Learning with Applications to Text Classification Support vector machines have met with significant success in numerous real-world learning tasks. However, like most machine learning algorithms, they are generally applied using a randomly selected training set classified in advance. In many settings, we also have the option of using pool-based active learning. Instead of using a randomly selected training set, the learner has access to a pool of unlabeled instances and can request the labels for some number of them. We introduce a new algorithm for performing active learning with support vector machines, i.e., an algorithm for choosing which instances to request next. We provide a theoretical motivation for the algorithm using the notion of a version space. We present experimental results showing that employing our active learning method can significantly reduce the need for labeled training instances in both the standard inductive and transductive settings.

positive: LIBSVM: a library for support vector machines

positive: A Bayesian hierarchical model for learning natural scene categories We propose a novel approach to learn and recognize natural scene categories. Unlike previous work, it does not require experts to annotate the training set. We represent the image of a scene by a collection of local regions, denoted as codewords obtained by unsupervised learning. Each region is represented as part of a "theme". In previous work, such themes were learnt from hand-annotations of experts, while our method learns the theme distributions as well as the codewords distribution over the themes without supervision. We report satisfactory categorization performances on a large set of 13 categories of complex scenes.

positive: Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope In this paper, we propose a computational model of the recognition of real world scenes that bypasses the segmentation and the processing of individual objects or regions. The procedure is based on a very low dimensional representation of the scene, that we term the Spatial Envelope. We propose a set of perceptual dimensions (naturalness, openness, roughness, expansion, ruggedness) that represent the dominant spatial structure of a scene. Then, we show that these dimensions may be reliably estimated using spectral and coarsely localized information. The model generates a multidimensional space in which scenes sharing membership in semantic categories (e.g., streets, highways, coasts) are projected closed together. The performance of the spatial envelope model shows that specific information about object shape or identity is not a requirement for scene categorization and that modeling a holistic representation of the scene informs about its probable semantic category.

negative: When two choices are not enough: Balancing at scale in Distributed Stream Processing Carefully balancing load in distributed stream processing systems has a fundamental impact on execution latency and throughput. Load balancing is challenging because real-world workloads are skewed: some tuples in the stream are associated to keys which are significantly more frequent than others. Skew is remarkably more problematic in large deployments: having more workers implies fewer keys per worker, so it becomes harder to “average out” the cost of hot keys with cold keys. We propose a novel load balancing technique that uses a heavy hitter algorithm to efficiently identify the hottest keys in the stream. These hot keys are assigned to d ≥ 2 choices to ensure a balanced load, where d is tuned automatically to minimize the memory and computation cost of operator replication. The technique works online and does not require the use of routing tables. Our extensive evaluation shows that our technique can balance real-world workloads on large deployments, and improve throughput and latency by 150% and 60% respectively over the previous state-of-the-art when deployed on Apache Storm.

negative: Smart Configuration of Smart Environments One of the central research challenges in the Internet of Things and Ubiquitous Computing domains is how users can be enabled to “program” their personal and industrial smart environments by combining services that are provided by devices around them. We present a service composition system that enables the goal-driven configuration of smart environments for end users by combining semantic metadata and reasoning with a visual modeling tool. In contrast to process-driven approaches where service mashups are statically defined, we make use of embedded semantic API descriptions to dynamically create mashups that fulfill the user's goal. The main advantage of our system is its high degree of flexibility, as service mashups can adapt to dynamic environments and are fault-tolerant with respect to individual services becoming unavailable. To support users in expressing their goals, we integrated a visual programming tool with our system that allows to model the desired state of a smart environment graphically, thereby hiding the technicalities of the underlying semantics. Possible applications of the presented system include the management of smart homes to increase individual well-being, and reconfigurations of smart environments, for instance in the industrial automation or healthcare domains.

negative: Smart Locks: Lessons for Securing Commodity Internet of Things Devices We examine the security of home smart locks: cyber-physical devices that replace traditional door locks with deadbolts that can be electronically controlled by mobile devices or the lock manufacturer's remote servers. We present two categories of attacks against smart locks and analyze the security of five commercially-available locks with respect to these attacks. Our security analysis reveals that flaws in the design, implementation, and interaction models of existing locks can be exploited by several classes of adversaries, allowing them to learn private information about users and gain unauthorized home access. To guide future development of smart locks and similar Internet of Things devices, we propose several defenses that mitigate the attacks we present. One of these defenses is a novel approach to securely and usably communicate a user's intended actions to smart locks, which we prototype and evaluate. Ultimately, our work takes a first step towards illuminating security challenges in the system design and novel functionality introduced by emerging IoT systems.

negative: A hybrid machine learning approach to automatic plant phenotyping for smart agriculture Recently, a new ICT approach to agriculture called “Smart Agriculture” has been received great attention to support farmers' decision-making for good final yield on various kinds of field conditions. For this purpose, this paper presents two image sensing methods that enable an automatic observation to capture flowers and seedpods of soybeans in real fields. The developed image sensing methods are considered as sensors in an agricultural cyber-physical system in which big data on the growth status of agricultural plants and environmental information (e.g., weather, temperature, humidity, solar radiation, soil condition, etc.) are analyzed to mine useful rules for appropriate cultivation. The proposed image sensing methods are constructed by combining several image processing and machine learning techniques. The flower detection is realized based on a coarse-to-fine approach where candidate areas of flowers are first detected by SLIC and hue information, and the acceptance of flowers is decided by CNN. In the seedpod detection, candidates of seedpod regions are first detected by the Viola-Jones object detection method, and we also use CNN to make a final decision on the acceptance of detected seedpods. The performance of the proposed image sensing methods is evaluated for a data set of soybean images that were taken from a crowd of soybeans in real agricultural fields in Hokkaido, Japan.

negative: Low temperature Cu-Cu direct bonding for 3D-IC by using fine crystal layer In this paper, we report a method of low temperature solid diffusion bonding. To investigate bondability of solid diffusion, we examined the effect of bump metals and bump planarization methods. Cu and Au bump were used for bump metals and CMP and ultra-precision cutting were used for bump planarization methods. We found that fine crystal layer could be formed on only cut Cu and Au bumps, and especially cut Cu bumps had a thick fine crystal layer on the surface. The layer on cut Cu bump was found to be easily to recrystallize at low temperature condition of 150 degree C. Moreover, the bonding interface of cut Cu bump disappeared at 200 degree C for 30 min, which means solid diffusion across the interface was realized with the contribution of fine crystal layer. In addition, for Cu-Cu direct bonding, formic acid treatment before bonding is effective because formic acid can react at low temperature without destroying fine crystal layer. That led to achieve high bonding strength between cut Cu bumps.

negative: Hybrid excited claw pole electric machine The paper presents the concept and results of simulation and experimental research of a claw pole generator with hybrid excitation. Hybrid excitation is performed with a conventional coil located between two parts of the claw-shape rotor and additional permanent magnets which are placed on claw poles. Within the research first a simulation and next constructed experimental model has been developed on the basis of the mass-produced vehicle alternator. Experimental researches have shown that - at a suitable rotational speed - it is possible to self-excite of the generator without any additional source of electrical power.

negative: A 92GHz bandwidth SiGe BiCMOS HBT TIA with less than 6dB noise figure A low-noise, broadband amplifier with resistive degeneration and transimpedance feedback is reported with 200 mVpp input linearity and less than 6 dB noise figure up to 88 GHz. The measured gain of 13 dB, noise figure, linearity, and group delay variation of ±1.5 ps are in excellent agreement with simulation. Eye diagram measurements were conducted up to 120 Gb/s and a dynamic range larger than 36 dB was obtained from eye diagram measurements at 40 Gb/s. The chip, which includes a 50Ω output buffer, occupies 0.138 mm2 and consumes 21 mA from a 2.3V supply.

negative: Video Question Answering via Hierarchical Spatio-Temporal Attention Networks Open-ended video question answering is a challenging problem in visual information retrieval, which automatically generates the natural language answer from the referenced video content according to the question. However, the existing visual question answering works only focus on the static image, which may be ineffectively applied to video question answering due to the lack of modeling the temporal dynamics of video contents. In this paper, we consider the problem of open-ended video question answering from the viewpoint of spatio-temporal attentional encoderdecoder learning framework. We propose the hierarchical spatio-temporal attention network for learning the joint representation of the dynamic video contents according to the given question. We then develop the spatio-temporal attentional encoder-decoder learning method with multi-step reasoning process for open-ended video question answering. We construct a large-scale video question answering dataset. The extensive experiments show the effectiveness of our method.

negative: Persistence Diagrams with Linear Machine Learning Models Persistence diagrams have been widely recognized as a compact descriptor for characterizing multiscale topological features in data. When many datasets are available, statistical features embedded in those persistence diagrams can be extracted by applying machine learnings. In particular, the ability for explicitly analyzing the inverse in the original data space from those statistical features of persistence diagrams is significantly important for practical applications. In this paper, we propose a unified method for the inverse analysis by combining linear machine learning models with persistence images. The method is applied to point clouds and cubical sets, showing the ability of the statistical inverse analysis and its advantages. This work is partially supported by JSPS KAKENHI Grant Number JP 16K17638, JST CREST Mathematics15656429, JST “Materials research by Information Integration” Initiative (MI2I) project of the Support Program for Starting Up Innovation Hub, Structural Materials for Innovation Strategic Innovation Promotion Program D72, and New Energy and Industrial Technology Development Organization (NEDO). Ippei Obayashi Advanced Institute for Materials Research (WPI-AIMR), Tohoku University. 2-1-1 Katahira, Aoba-ku, Sendai, 980-8577 Japan Tel.: +81-22-217-6320 Fax: +81-22-217-5129 E-mail: ippei.obayashi.d8@tohoku.ac.jp Y. Hiraoka Advanced Institute for Materials Research (WPI-AIMR), Tohoku University. Center for Materials research by Information Integration (CMI2), Research and Services Division of Materials Data and Integrated System (MaDIS), National Institute for Materials Science (NIMS). E-mail: hiraoka@tohoku.ac.jp

negative: The neural correlates of trustworthiness evaluations of faces and brands: Implications for behavioral and consumer neuroscience. When we buy a product of a brand, we trust the brand to provide good quality and reliability. Therefore, trust plays a major role in consumer behavior. It is unclear, however, how trust in brands is processed in the brain and whether it is processed differently from interpersonal trust. In this study, we used fMRI to investigate the neural correlates of interpersonal and brand trust by comparing the brain activation patterns during explicit trustworthiness judgments of faces and brands. Our results showed that while there were several brain areas known to be linked to trustworthiness evaluations, such as the amygdalae, more active in trustworthiness judgments when compared to a control task (familiarity judgment) for faces, no such difference was found for brands. Complementary ROI analysis revealed that the activation of both amygdalae was strongest for faces in the trustworthiness judgments. The direct comparison of the brain activation patterns during the trustworthiness evaluations between faces and brands in this analysis showed that trustworthiness judgments of faces activated the orbitofrontal cortex, another region that was previously linked to interpersonal trust, more strongly than trustworthiness judgments of brands. Further, trustworthiness ratings of faces, but not brands, correlated with activation in the orbitofrontal cortex. Our results indicate that the amygdalae, as well as the orbitofrontal cortex, play a prominent role in interpersonal trust (faces), but not in trust for brands. It is possible that this difference is due to brands being processed as cultural objects rather than as having human-like personality characteristics.

negative: SeVR+: Secure and privacy-aware cloud-assisted video reporting service for 5G vehicular networks Recently, Eiza et al. proposed a secure and privacy-aware scheme for video reporting service in 5G enabled Vehicular Ad hoc Networks (VANET). They employ heterogeneous network and cloud platform to obtain more availability with low latency platform for an urgent accident video reporting service. In their study, for the first time the security issues of 5G enabled vehicular networks have been addressed. Eiza et al. claimed that their scheme guarantees user's privacy, confidentiality, non-repudiation, message integrity and availability for participant vehicles. In this paper, we show that Eiza et al. scheme is vulnerable to replay, message fabrication and DoS attacks. Regarding the sensibility of video reporting services in VANET, then, we propose an efficient protocol to overcome security weaknesses of Eiza et.al. scheme and show that the proposed protocol resists against commonplace attacks in VANET with acceptable communication and computation overhead.

negative: `Putting the Face to the Voice' Matching Identity across Modality Speech perception provides compelling examples of a strong link between auditory and visual modalities. This link originates in the mechanics of speech production, which, in shaping the vocal tract, determine the movement of the face as well as the sound of the voice. In this paper, we present evidence that equivalent information about identity is available cross-modally from both the face and voice. Using a delayed matching to sample task, XAB, we show that people can match the video of an unfamiliar face, X, to an unfamiliar voice, A or B, and vice versa, but only when stimuli are moving and are played forward. The critical role of time-varying information is underlined by the ability to match faces to voices containing only the coarse spatial and temporal information provided by sine wave speech [5]. The effect of varying sentence content across modalities was small, showing that identity-specific information is not closely tied to particular utterances. We conclude that the physical constraints linking faces to voices result in bimodally available dynamic information, not only about what is being said, but also about who is saying it.

negative: Control and path planning of a walk-assist robot using differential flatness With the growth of elderly population in our society, technology will play an important role in providing functional mobility to humans. In this paper, we propose a robot walking helper with both passive and active control modes of guidance. From the perspective of human safety, the passive mode adopts the braking control law on the wheels to differentially steer the vehicle. The active mode can guide the user efficiently when the passive control with user-applied force is not adequate for guidance. The theory of differential flatness is used to plan the trajectory of control gains within the proposed scheme of the controller. Since the user input force is not known a-priori, the theory of model predictive control is used to periodically compute the trajectory of these control gains. The simulation results show that the walking assist robot, along with the structure of this proposed control scheme, can guide the user to a goal effectively.

negative: Electrically Large Zero-Phase-Shift Line Grid-Array UHF Near-Field RFID Reader Antenna A grid-array antenna using a zero-phase-shift (ZPS) line is proposed to enlarge the interrogation zone of a reader antenna for near-field ultra-high-frequency (UHF) radio frequency identification (RFID) system. The proposed grid-array antenna is composed of a number of grid cells and a double-sided parallel-strip line feeding network. Each grid cell, namely segmented loop constructed by the ZPS line, has uniform and single-direction flowing current along the line. By configuration of the cells sharing a common side with its adjacent grid cells which carry reverse-direction flowing current, a grid-array antenna is formed to generate a strong and uniform magnetic-field distribution over a large interrogation zone even when the perimeter of the interrogation zone reaches up to 3λ (where λ is the operating wavelength in free space) or larger. As an example, a grid-array antenna with 1 × 2 segmented ZPS line loop cells implemented onto a piece of FR4 printed board (PCB) is designed and prototyped. The results show that the grid-array antenna achieves the impedance matching over the frequency range from 790 to 1040 MHz and produces strong and uniform magnetic-field distribution over an interrogation zone of 308 mm × 150 mm.

negative: 101companies: A Community Project on Software Technologies and Software Languages 101companies is a community project in computer science (or software science) with the objective of developing a free, structured, wiki-accessible knowledge resource including an open-source repository for different stakeholders with interests in software technologies, software languages, and technological spaces; notably: teachers and learners in software engineering or software languages as well as software developers, software technologists, and ontologists. The present paper introduces the 101companies Project. In fact, the present paper is effectively a call for contributions to the project and a call for applications of the project in research and education.

negative: An approach to Korean license plate recognition based on vertical edge matching License plate recognition (LPR) has many applications in traffic monitoring systems. In this paper, a vertical edge matching based algorithm to recognize Korean license plate from input gray-scale image is proposed. The algorithm is able to recognize license plates in normal shape, as well as plates that are out of shape due to the angle of view. The proposed algorithm is fast enough, the recognition unit of a LPR system can be implemented only in software so that the cost of the system is reduced.

negative: Electromagnetic simulation of 3D stacked ICs: Full model vs. S-parameter cascaded based model Three-dimensional electromagnetic simulation models are often simplified and/or segmented in order to reduce the simulation time and memory requirements without sacrificing the accuracy of the results. This paper investigates the difference between full model and S-parameter cascaded based model of 3D stacked ICs with the presence of Through Silicon Vias. It is found that the simulation of the full model is required for accurate results, however, a divide and conquers (segmentation) approach can be used for preliminary post layout analysis. Modeling guidelines are discussed and details on the proper choice of ports, boundary conditions, and solver technology are highlighted. A de-embedding methodology is finally explored to improve the accuracy of the cascaded/segmented results.

negative: Solving a Huge Number of Similar Tasks: A Combination of Multi-Task Learning and a Hierarchical Bayesian Approach In this paper, we propose a machine-learning solution to problems consisting of many similar prediction tasks. Each of the individual tasks has a high risk of overrtting. We combine two types of knowledge transfer between tasks to reduce this risk: multi-task learning and hierarchical Bayesian modeling. Multi-task learning is based on the assumption that there exist features typical to the task at hand. To nd these features, we train a huge two-layered neural network. Each task has its own output, but shares the weights from the input to the hidden units with all other tasks. In this way a relatively large set of possible explanatory variables (the network inputs) is reduced to a smaller and easier to handle set of features (the hidden units). Given this set of features and after an appropriate scale transformation, we assume that the tasks are exchangeable. This assumption allows for a hierarchical Bayesian analysis in which the hyperparameters can be estimated from the data. EEectively, these hyperpa-rameters act as regularizers and prevent over-tting. We describe how to make the system robust against nonstationarities in the time series and give directions for further improvement. We illustrate our ideas on a database regarding the prediction of newspaper sales.

negative: True Random Number Generator Embedded in Reconfigurable Hardware This paper presents a new True Random Number Generator (TRNG) based on an analog Phase-Locked Loop (PLL) implemented in a digital Altera Field Programmable Logic Device (FPLD). Starting with an analysis of the one available on chip source of randomness the PLL synthesized low jitter clock signal, a new simple and reliable method of true randomness extraction is proposed. Basic assumptions about statistical properties of jitter signal are confirmed by testing of mean value of the TRNG output signal. The quality of generated true random numbers is confirmed by passing standard NIST statistical tests. The described TRNG is tailored for embedded System-On-a-ProgrammableChip (SOPC) cryptographic applications and can provide a good quality true random bit-stream with throughput of several tens of kilobits per second. The possibility of including the proposed TRNG into a SOPC design significantly increases the system security of embedded cryptographic hardware.

negative:
Reliability-aware design to suppress aging Due to aging, circuit reliability has become extraordinary challenging. Reliability-aware circuit design flows do virtually not exist and even research is in its infancy. In this paper, we propose to bring aging awareness to EDA tool flows based on so-called degradation-aware cell libraries. These libraries include detailed delay information of gates/cells under the impact that aging has on both threshold voltage (Vth) and carrier mobility (μ) of transistors. This is unlike state of the art which considers Vth only. We show how ignoring μ degradation leads to underestimating guard-bands by 19% on average. Our investigation revealed that the impact of aging is strongly dependent on the operating conditions of gates (i.e. input signal slew and output load capacitance), and not solely on the duty cycle of transistors. Neglecting this fact results in employing insufficient guard-bands and thus not sustaining reliability during lifetime.
 We demonstrate that degradation-aware libraries and tool flows are indispensable for not only accurately estimating guardbands, but also efficiently containing them. By considering aging degradations during logic synthesis, significantly more resilient circuits can be obtained. We further quantify the impact of aging on the degradation of image processing circuits. This goes far beyond investigating aging with respect to path delays solely. We show that in a standard design without any guardbanding, aging leads to unacceptable image quality after just one year. By contrast, if the synthesis tool is provided with the degradation-aware cell library, high image quality is sustained for 10 years (even under worst-case aging and without a guard-band). Hence, using our approach, aging can be effectively suppressed.

negative: Hexahedral Meshing With Varying Element Sizes Hexahedral (or Hex-) meshes are preferred in a number of scientific and engineering simulations and analyses due to their desired numerical properties. Recent state-of-the-art techniques can generate high quality hex-meshes. However, they typically produce hex-meshes with uniform element sizes and thus may fail to preserve small scale features on the boundary surface. In this work, we present a new framework that enables users to generate hex-meshes with varying element sizes so that small features will be filled with smaller and denser elements, while the transition from smaller elements to larger ones is smooth, compared to the octree-based approach. This is achieved by first detecting regions of interest (ROI) of small scale features. These ROIs are then magnified using the as-rigid-as-possible (ARAP) deformation with either an automatically determined or a user-specified scale factor. A hex-mesh is then generated from the deformed mesh using existing approaches that produce hex-meshes with uniform-sized elements. This initial hex-mesh is then mapped back to the original volume before magnification to adjust the element sizes in those ROIs. We have applied this framework to a variety of man-made and natural models to demonstrate its effectiveness.

negative: An Efficient Participant’s Selection Algorithm for Crowdsensing With the advancement of mobile technology the use of Smartphone is greatly increased. Everyone has the mobile phones and it becomes the necessity of life. Today, smart devices are flooding the internet data at every time and in any form that cause the mobile crowdsensing (MCS). One of the key challenges in mobile crowd sensing system is how to effectively identify and select the well-suited participants in recruitments from a large user pool. This research work presents the concept of crowdsensing along with the selection process of participants from a large user pool. MCS provides the efficient selection process for participants that how well suited participant’s selects/recruit from a large user pool. For this, the proposed selection algorithm plays our role in which the recruitment of participants takes place with the availability status from the large user pool. At the end, the graphical result presented with the suitable location of the participants and their time slot. Keywords—Mobile crowdsensing (MCS); Mobile Sensing Platform (MSP]); crowd sensing; participant; user pool; crowdsourcing

negative: Active-feedback frequency-compensation technique for low-power multistage amplifiers An active-feedback frequency-compensation (AFFC) technique for low-power operational amplifiers is presented in this paper. With an active-feedback mechanism, a high-speed block separates the low-frequency high-gain path and high-frequency signal path such that high gain and wide bandwidth can be achieved simultaneously in the AFFC amplifier. The gain stage in the active-feedback network also reduces the size of the compensation capacitors such that the overall chip area of the amplifier becomes smaller and the slew rate is improved. Furthermore, the presence of a left-half-plane zero in the proposed AFFC topology improves the stability and settling behavior of the amplifier. Three-stage amplifiers based on AFFC and nested-Miller compensation (NMC) techniques have been implemented by a commercial 0.8m CMOS process. When driving a 120-pF capacitive load, the AFFC amplifier achieves over 100-dB dc gain, 4.5-MHz gain-bandwidth product (GBW) , 65 phase margin, and 1.5-V/ s average slew rate, while only dissipating 400W power at a 2-V supply. Compared to a three-stage NMC amplifier, the proposed AFFC amplifier provides improvement in both the GBW and slew rate by 11 times and reduces the chip area by 2.3 times without significant increase in the power consumption.

negative: Effective Question Answering Techniques and their Evaluation Metrics Question Answering (QA) is a focused way of information retrieval. Question Answering system tries to get back the accurate answers to questions posed in natural language provided a set of documents. Basically question answering system (QA) has three elements i. e. question classification, information retrieval (IR), and answer extraction. These elements play a major role in Question Answering. In Question classification, the questions are classified depending upon the type of its entity. Information retrieval component is used to determine success by retrieving relevant answer for different questions posted by the intelligent question answering system. Answer extraction module is growing topics in the QA in which ranking and validating a candidate's answer is the major job. This paper offers a concise discussion regarding different Question Answering types. In addition we describe different evaluation metrics used to evaluate the performance of different question answering systems. We also discuss the recent question answering systems developed and their corresponding techniques.

negative: A 500mA analog-assisted digital-LDO-based on-chip distributed power delivery grid with cooperative regulation and IR-drop reduction in 65nm CMOS With the die area of modern processors growing larger and larger, the IR drop across the power supply rail due to its parasitic resistance becomes considerable. There is an urgent demand for local power regulation to reduce the IR drop and to enhance transient response. A distributed power-delivery grid (DPDG) is an attractive solution for large area power-supply applications. The dual-loop distributed micro-regulator in [1] achieves a tight regulation and fast response, but suffers from large ripple and high power consumption due to the comparator-based regulator. Digital low-dropout regulators (DLDOs) [2] can be used as local micro-regulators to implement a DPDG, due to their low-voltage operation and process scalability. Adaptive control [3], asynchronous 3D pipeline control [4], analog-assisted tri-loop control [5], and event-driven PI control [6] are proposed to enhance the transient response speed. However, digital LDOs suffer from the intrinsic limitations of large output ripple and narrow current range. This paper presents an on-chip DPDg with cooperative regulation based on an analog-assisted digital LDO (AADLDO), which inherits the merits of low output ripple and sub-LSB current supply ability from the analog control, and the advantage of low supply voltage operation and adaptive fast response from the digital control.

negative: Breast Cancer Multi-classification from Histopathological Images with Structured Deep Learning Model Automated breast cancer multi-classification from histopathological images plays a key role in computer-aided breast cancer diagnosis or prognosis. Breast cancer multi-classification is to identify subordinate classes of breast cancer (Ductal carcinoma, Fibroadenoma, Lobular carcinoma, etc.). However, breast cancer multi-classification from histopathological images faces two main challenges from: (1) the great difficulties in breast cancer multi-classification methods contrasting with the classification of binary classes (benign and malignant), and (2) the subtle differences in multiple classes due to the broad variability of high-resolution image appearances, high coherency of cancerous cells, and extensive inhomogeneity of color distribution. Therefore, automated breast cancer multi-classification from histopathological images is of great clinical significance yet has never been explored. Existing works in literature only focus on the binary classification but do not support further breast cancer quantitative assessment. In this study, we propose a breast cancer multi-classification method using a newly proposed deep learning model. The structured deep learning model has achieved remarkable performance (average 93.2% accuracy) on a large-scale dataset, which demonstrates the strength of our method in providing an efficient tool for breast cancer multi-classification in clinical settings.

negative: An integrated framework for human activity recognition This poster presents an integrated framework to enable using standard non-sequential machine learning tools for accurate multi-modal activity recognition. Our framework contains simple pre- and post-classification strategies such as class-imbalance correction on the learning data using structure preserving oversampling, leveraging the sequential nature of sensory data using smoothing of the predicted label sequence and classifier fusion, respectively, for improved performance. Through evaluation on recent publicly-available OPPORTUNITY activity datasets comprising of a large amount of multi-dimensional, continuous-valued sensory data, we show that our proposed strategies are effective in improving the performance over common techniques such as One Nearest Neighbor (1NN) and Support Vector Machines (SVM). Our framework also shows better performance over sequential probabilistic models, such as Conditional Random Field (CRF) and Hidden Markov Models (HMM) and when these models are used as meta-learners.

negative: Information-theoretical label embeddings for large-scale image classification We present a method for training multi-label, massively multi-class image classification models, that is faster and more accurate than supervision via a sigmoid cross-entropy loss (logistic regression). Our method consists in embedding high-dimensional sparse labels onto a lower-dimensional dense sphere of unit-normed vectors, and treating the classification problem as a cosine proximity regression problem on this sphere. We test our method on a dataset of 300 million high-resolution images with 17,000 labels, where it yields considerably faster convergence, as well as a 7% higher mean average precision compared to logistic regression.

negative: Food vs Non-Food Classification Automatic understanding of food is an important research challenge. Food recognition engines can provide a valid aid for automatically monitoring the patient's diet and food-intake habits directly from images acquired using mobile or wearable cameras. One of the first challenges in the field is the discrimination between images containing food versus the others. Existing approaches for food vs non-food classification have used both shallow and deep representations, in combination with multi-class or one-class classification approaches. However, they have been generally evaluated using different methodologies and data, making a real comparison of the performances of existing methods unfeasible. In this paper, we consider the most recent classification approaches employed for food vs non-food classification, and compare them on a publicly available dataset. Different deep-learning based representations and classification methods are considered and evaluated.

negative: A Feature Learning Based Approach for Automated Fruit Yield Estimation This paper demonstrates a generalised multi-scale feature learning approach to multi-class segmentation, applied to the estimation of fruit yield on treecrops. The learning approach makes the algorithm flexible and adaptable to different classification problems, and hence applicable to a wide variety of tree-crop applications. Extensive experiments were performed on a dataset consisting of 8000 colour images collected in an apple orchard. This paper shows that the algorithm was able to segment apples with different sizes and colours in an outdoor environment with natural lighting conditions, with a single model obtained from images captured using a monocular colour camera. The segmentation results are applied to the problem of fruit counting and the results are compared against manual counting. The results show a squared correlation coefficient of R2 = 0.81.

negative: The German Traffic Sign Recognition Benchmark: A multi-class classification competition The “German Traffic Sign Recognition Benchmark” is a multi-category classification competition held at IJCNN 2011. Automatic recognition of traffic signs is required in advanced driver assistance systems and constitutes a challenging real-world computer vision and pattern recognition problem. A comprehensive, lifelike dataset of more than 50,000 traffic sign images has been collected. It reflects the strong variations in visual appearance of signs due to distance, illumination, weather conditions, partial occlusions, and rotations. The images are complemented by several precomputed feature sets to allow for applying machine learning algorithms without background knowledge in image processing. The dataset comprises 43 classes with unbalanced class frequencies. Participants have to classify two test sets of more than 12,500 images each. Here, the results on the first of these sets, which was used in the first evaluation stage of the two-fold challenge, are reported. The methods employed by the participants who achieved the best results are briefly described and compared to human traffic sign recognition performance and baseline results.

negative: Deep Learning Human Mind for Automated Visual Classification What if we could effectively read the mind and transfer human visual capabilities to computer vision methods? In this paper, we aim at addressing this question by developing the first visual object classifier driven by human brain signals. In particular, we employ EEG data evoked by visual object stimuli combined with Recurrent Neural Networks (RNN) to learn a discriminative brain activity manifold of visual categories in a reading the mind effort. Afterward, we transfer the learned capabilities to machines by training a Convolutional Neural Network (CNN)–based regressor to project images onto the learned manifold, thus allowing machines to employ human brain–based features for automated visual classification. We use a 128-channel EEG with active electrodes to record brain activity of several subjects while looking at images of 40 ImageNet object classes. The proposed RNN-based approach for discriminating object classes using brain signals reaches an average accuracy of about 83%, which greatly outperforms existing methods attempting to learn EEG visual object representations. As for automated object categorization, our human brain–driven approach obtains competitive performance, comparable to those achieved by powerful CNN models and it is also able to generalize over different visual datasets.


query: DCAN: Dual Channel-Wise Alignment Networks for Unsupervised Scene Adaptation

positive: Full-Resolution Residual Networks for Semantic Segmentation in Street Scenes Semantic image segmentation is an essential component of modern autonomous driving systems, as an accurate understanding of the surrounding scene is crucial to navigation and action planning. Current state-of-the-art approaches in semantic image segmentation rely on pre-trained networks that were initially developed for classifying images as a whole. While these networks exhibit outstanding recognition performance (i.e., what is visible?), they lack localization accuracy (i.e., where precisely is something located?). Therefore, additional processing steps have to be performed in order to obtain pixel-accurate segmentation masks at the full image resolution. To alleviate this problem we propose a novel ResNet-like architecture that exhibits strong localization and recognition performance. We combine multi-scale context with pixel-level accuracy by using two processing streams within our network: One stream carries information at the full image resolution, enabling precise adherence to segment boundaries. The other stream undergoes a sequence of pooling operations to obtain robust features for recognition. The two streams are coupled at the full image resolution using residuals. Without additional processing steps and without pre-training, our approach achieves an intersection-over-union score of 71.8% on the Cityscapes dataset.

positive: Return of Frustratingly Easy Domain Adaptation Unlike human learning, machine learning often fails to handle changes between training (source) and test (target) input distributions. Such domain shifts, common in practical scenarios, severely damage the performance of conventional machine learning methods. Supervised domain adaptation methods have been proposed for the case when the target data have labels, including some that perform very well despite being “frustratingly easy” to implement. However, in practice, the target domain is often unlabeled, requiring unsupervised adaptation. We propose a simple, effective, and efficient method for unsupervised domain adaptation called CORrelation ALignment (CORAL). CORAL minimizes domain shift by aligning the second-order statistics of source and target distributions, without requiring any target labels. Even though it is extraordinarily simple–it can be implemented in four lines of Matlab code–CORAL performs remarkably well in extensive evaluations on standard benchmark datasets. “Everything should be made as simple as possible, but not simpler.”

positive: Unsupervised Domain Adaptation by Backpropagation Top-performing deep architectures are trained on massive amounts of labeled data. In the absence of labeled data for a certain task, domain adaptation often provides an attractive option given that labeled data of similar nature but from a different domain (e.g. synthetic images) are available. Here, we propose a new approach to domain adaptation in deep architectures that can be trained on large amount of labeled data from the source domain and large amount of unlabeled data from the target domain (no labeled targetdomain data is necessary). As the training progresses, the approach promotes the emergence of “deep” features that are (i) discriminative for the main learning task on the source domain and (ii) invariant with respect to the shift between the domains. We show that this adaptation behaviour can be achieved in almost any feed-forward model by augmenting it with few standard layers and a simple new gradient reversal layer. The resulting augmented architecture can be trained using standard backpropagation. Overall, the approach can be implemented with little effort using any of the deep-learning packages. The method performs very well in a series of image classification experiments, achieving adaptation effect in the presence of big domain shifts and outperforming previous state-ofthe-art on Office datasets.

positive: Adversarial Discriminative Domain Adaptation Adversarial learning methods are a promising approach to training robust deep networks, and can generate complex samples across diverse domains. They can also improve recognition despite the presence of domain shift or dataset bias: recent adversarial approaches to unsupervised domain adaptation reduce the difference between the training and test domain distributions and thus improve generalization performance. However, while generative adversarial networks (GANs) show compelling visualizations, they are not optimal on discriminative tasks and can be limited to smaller shifts. On the other hand, discriminative approaches can handle larger domain shifts, but impose tied weights on the model and do not exploit a GAN-based loss. In this work, we first outline a novel generalized framework for adversarial adaptation, which subsumes recent state-of-the-art approaches as special cases, and use this generalized view to better relate prior approaches. We then propose a previously unexplored instance of our general framework which combines discriminative modeling, untied weight sharing, and a GAN loss, which we call Adversarial Discriminative Domain Adaptation (ADDA). We show that ADDA is more effective yet considerably simpler than competing domain-adversarial methods, and demonstrate the promise of our approach by exceeding state-of-the-art unsupervised adaptation results on standard domain adaptation tasks as well as a difficult cross-modality object classification task.

positive: Regularization of Neural Networks using DropConnect We introduce DropConnect, a generalization of Dropout (Hinton et al., 2012), for regularizing large fully-connected layers within neural networks. When training with Dropout, a randomly selected subset of activations are set to zero within each layer. DropConnect instead sets a randomly selected subset of weights within the network to zero. Each unit thus receives input from a random subset of units in the previous layer. We derive a bound on the generalization performance of both Dropout and DropConnect. We then evaluate DropConnect on a range of datasets, comparing to Dropout, and show state-of-the-art results on several image recognition benchmarks by aggregating multiple DropConnect-trained models.

negative: Implications of integrating test-driven development into CS1/CS2 curricula Many academic and industry professionals have called for more testing in computer science curricula. Test-driven development (TDD) has been proposed as a solution to improve testing in academia. This paper demonstrates how TDD can be integrated into existing course materials without reducing topic coverage. Two controlled experiments were conducted in a CS1/CS2 course in Winter 2008. Following a test-driven learning approach, unit testing was introduced at the beginning of the course and reinforced through example. Results indicate that while student work loads may increase with the incorporation of TDD, students are able to successfully develop unit tests while learning to program.

negative: Quaternion-Based Unscented Kalman Filter for Accurate Indoor Heading Estimation Using Wearable Multi-Sensor System Inertial navigation based on micro-electromechanical system (MEMS) inertial measurement units (IMUs) has attracted numerous researchers due to its high reliability and independence. The heading estimation, as one of the most important parts of inertial navigation, has been a research focus in this field. Heading estimation using magnetometers is perturbed by magnetic disturbances, such as indoor concrete structures and electronic equipment. The MEMS gyroscope is also used for heading estimation. However, the accuracy of gyroscope is unreliable with time. In this paper, a wearable multi-sensor system has been designed to obtain the high-accuracy indoor heading estimation, according to a quaternion-based unscented Kalman filter (UKF) algorithm. The proposed multi-sensor system including one three-axis accelerometer, three single-axis gyroscopes, one three-axis magnetometer and one microprocessor minimizes the size and cost. The wearable multi-sensor system was fixed on waist of pedestrian and the quadrotor unmanned aerial vehicle (UAV) for heading estimation experiments in our college building. The results show that the mean heading estimation errors are less 10° and 5° to multi-sensor system fixed on waist of pedestrian and the quadrotor UAV, respectively, compared to the reference path.

negative: Mechanical recycling of waste electric and electronic equipment: a review. The production of electric and electronic equipment (EEE) is one of the fastest growing areas. This development has resulted in an increase of waste electric and electronic equipment (WEEE). In view of the environmental problems involved in the management of WEEE, many counties and organizations have drafted national legislation to improve the reuse, recycling and other forms of recovery of such wastes so as to reduce disposal. Recycling of WEEE is an important subject not only from the point of waste treatment but also from the recovery of valuable materials.WEEE is diverse and complex, in terms of materials and components makeup as well as the original equipment's manufacturing processes. Characterization of this waste stream is of paramount importance for developing a cost-effective and environmentally friendly recycling system. In this paper, the physical and particle properties of WEEE are presented. Selective disassembly, targeting on singling out hazardous and/or valuable components, is an indispensable process in the practice of recycling of WEEE. Disassembly process planning and innovation of disassembly facilities are most active research areas. Mechanical/physical processing, based on the characterization of WEEE, provides an alternative means of recovering valuable materials. Mechanical processes, such as screening, shape separation, magnetic separation, Eddy current separation, electrostatic separation, and jigging have been widely utilized in recycling industry. However, recycling of WEEE is only beginning. For maximum separation of materials, WEEE should be shredded to small, even fine particles, generally below 5 or 10mm. Therefore, a discussion of mechanical separation processes for fine particles is highlighted in this paper. Consumer electronic equipment (brown goods), such as television sets, video recorders, are most common. It is very costly to perform manual dismantling of those products, due to the fact that brown goods contain very low-grade precious metals and copper. It is expected that a mechanical recycling process will be developed for the upgrading of low metal content scraps.

negative: Query Term Suggestion in Academic Search In this paper, we evaluate query term suggestion in the context of academic professional search. Our overall goal is to support scientists in their information seeking tasks. We set up an interactive search system in which terms are extracted from clicked documents and suggested to the user before every query specification step. We evaluated our method with the iSearch collection of academic information seeking behaviour and crowdsourced term relevance judgements. We found that query term suggestion can significantly improve recall in academic search.

negative: Red Opal: product-feature scoring from reviews Online shoppers are generally highly task-driven: they have a certain goal in mind, and they are looking for a product with features that are consistent with that goal. Unfortunately, finding a product with specific features is extremely time-consuming using the search functionality provided by existing web sites.In this paper, we present a new search system called Red Opal that enables users to locate products rapidly based on features. Our fully automatic system examines prior customer reviews, identifies product features, and scores each product on each feature. Red Opal uses these scores to determine which products to show when a user specifies a desired product feature. We evaluate our system on four dimensions: precision of feature extraction, efficiency of feature extraction, precision of product scores, and estimated time savings to customers. On each dimension, Red Opal performs better than a comparison system.

negative: Online, interactive learning of gestures for human/robot interfaces We have developed a gesture recognition system, based on Hidden Markov Models, which can interactively recognize gestures and perform online learning of new gestures. In addition, it is able to update its model of a gesture iteratively with each example it recognizes. This system has demonstrated reliable recognition of 14 di erent gestures after only one or two examples of each. The system is currently interfaced to a Cyberglove for use in recognition of gestures from the sign language alphabet. The system is being implemented as part of an interactive interface for robot teleoperation and programming by example.

negative: Enterprise Architecture: Enabling Integration, Agility And Change Three core imperatives are essential for modern businesses and organizations: seamless integration of customer and operational processes, agility, and the ability to change. These imperatives are thus relevant in view of successfully executing strategic choices, but all too often not satisfied. Businesses and organizations can be viewed as complex adaptive socio-technical systems. Two fundamentally different perspectives on systems play a role: the functional (black-box) perspective and the constructional (white-box) perspective. Management and governance of businesses and organizations regard the functional, black-box perspective, which is inherently ill-suited for addressing the imperatives mentioned. Rather, establishing system integration, agility and change requires a focus on the system’s design, hence entails the constructional perspective. Both perspectives are relevant. The concept of architecture plays a fundamental role for operationalizing the constructional perspective. Next to the more familiar notion of technology architecture, the concepts of business and organizational architecture are formally introduced and elucidated. In view of the important role of information in customer and operational processes, the notion of information architecture will be additionally discussed, specifically the relationships with other architectures. Various domains within these architectures will be highlighted, whereby the importance of coherence and consistency is stressed, especially in view of the ability to change. Collectively, the four architectures are labeled Enterprise Architecture. Finally, enterprise architecture will be positioned as a crucial means for linking strategy development and execution. The functional and constructional perspective Function and construction A system may be defined as an identifiable bounded set of functionally and/or methodically related elements or principles with a certain operational purpose. Within this definition, a plethora of systems can be mentioned: a payment system, an accounting system, a transport

negative: Compact substrate integrated waveguide based active and passive circularly polarized composite right/left handed leaky wave antennas Two compact substrate integrated waveguide (SIW) based circularly polarized (CP) composite right/left handed (CRLH) leaky wave antennas (LWAs) are designed and presented. Besides wide-band matching enhancement, the proposed antennas are shortened by 39.8 % along the scanning plane compared to the previous work [1]. Additionally, the current amplitude distribution of the proposed antenna can be controlled by using negative resistance based reflection type amplifiers (RTAs). The compensated uniform distribution yields an enhanced directivity without compromising full space frequency scanning capability.

negative: Crowd Geofencing Geofencing mechanisms allow for timely message delivery to the visitors of predefined target areas. However, conventional geofencing approaches poorly support mobile data collection scenarios in which experts need in situ assistance. In this paper, we propose crowd geofencing environments, in which a large number of crowdworkers generate geofences to support mobile experts. As a first step to open up the possibilities of crowd geofencing, we have tested its feasibility by collecting more than one thousand geofences in an unfamiliar city prior to the visit to look into urban water and air quality issues. Our experience has revealed the strengths and weaknesses of crowd geofencing in terms of geofence quality and crowd-powered situated actions.

negative: A theorem on polygon cutting with applications Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight of all vertices. We prove that it is possible, in O(N) time, to find two vertices a,b in P, such that the segment ab lies entirely inside the polygon P and partitions it into two polygons, each with a weight not exceeding 2C/3. This computation assumes that all the vertices have been sorted along some axis, which can be done in O(Nlog N) time. We use this result to derive a number of efficient divide-and-conquer algorithms for: 1. Triangulating an N-gon in O(Nlog N) time. 2. Decomposing an N-gon into (few) convex pieces in O(Nlog N) time. 3. Given an O(Nlog N) preprocessing, computing the shortest distance between two arbitrary points inside an N-gon (i.e., the internal distance), in O(N) time. 4. Computing the longest internal path in an N-gon in O(N2) time. In all cases, the algorithms achieve significant improvements over previously known methods, either by displaying better performance or by gaining in simplicity. In particular, the best algorithms for Problems 2,3,4, known so far, performed respectively in O(N2), O(N2), and O(N4) time.

negative: Analysis and design of block cipher constructions This thesis is dedicated to symmetric cryptographic algorithms. The major focus of the work is on block ciphers themselves as well as on hash functions and message authentication codes based on block ciphers. Three main approaches to the cryptanalysis of symmetric cryptographic algorithms are pursued. First, several block cipher constructions are analyzed mathematically using statistical cryptanalysis. Second, practical attacks on real-world symmetric cryptosystems are considered. Finally, novel cryptanalytic techniques using side-channel leakage are studied with applications to block ciphers and message authentication codes. Differential and linear cryptanalyses are well-known statistical attacks on block ciphers. This thesis studies the security of unbalanced Feistel networks with contracting MDS diffusion with respect to differential and linear cryptanalysis. Upper bounds on the differential trail probabilities and linear probabilities of linear trails in such constructions are proven. It is shown that such unbalanced Feistel networks can be highly efficient and are comparable to many known balanced Feistel network constructions with respect to differential and linear cryptanalysis. Ultra-lightweight substitution-permutation networks with diffusion layers based on the co-design of S-boxes and bit permutations are proposed. This results in lightweight block ciphers and block cipher based compression functions for hash functions designed and analyzed. These constructions have very small footprint and can be efficiently implemented on the majority of RFID tags This work also studies practical attacks on real-world symmetric cryptographic systems. Attacks are proposed on the KeeLoq block cipher and authentication systems widely used for automotive access control and component identification. Cryptanalysis of the A5/2 stream cipher used for protecting GSM connections worldwide is performed. Linear slide attacks on KeeLoq are proposed resulting in the fastest known attack on the KeeLoq block cipher working for all keys. Severe weaknesses of the KeeLoq key management are identified. The KeeLoq real-world authentication protocols for access control and component identification are also analyzed. A special-purpose hardware architecture for attacking A5/2 is developed that allows for real-time key recovery within one second for different GSM channels. This engine is based on an optimized hardware algorithm for fast Gaussian elimination over binary finite fields.

negative: Does Music Predictability Improve Spatial-Temporal Reasoning ? In 1993, it was found that Mozart’s music temporarily enhanced performance on spatialtemporal reasoning tasks. This effect later became termed the Mozart Effect. Since then, the mechanisms of the Mozart Effect have been hotly debated among the scientific community. Recent research has called for studying the Mozart Effect by analyzing music as a series of components. The present study took the components of music into account by testing if predictable music could enhance spatial-temporal reasoning compared to non-predictable music. Participants were administered a task designed to test spatial-temporal reasoning after listening to either predictable or non-predictable music. Additionally, as a control condition, they performed the same task after listening to a short story. Listening to music did not affect reasoning performance, regardless of the predictability of the music. The results indicate that predictability in music alone may not be a major element of the Mozart Effect.

negative: Wireless Hand Gesture Recognition Based on Continuous-Wave Doppler Radar Sensors Short-range continuous-wave Doppler radar sensors have been mainly used for noncontact detection of various motions. In this paper, we investigate the feasibility to implement the function of a remote mouse, an input device of a computer, by recognizing human gestures based on a dual-channel Doppler radar sensor. Direct conversion architecture, symmetric subcarrier modulation, and bandpass sampling techniques are used to obtain a cost-effective solution. An arcsine algorithm and a motion imaging algorithm are proposed to linearly reconstruct the hand and finger motions in a 2-D plane from the demodulated Doppler phase shifts. Experimental results verified the effectiveness of the proposed architecture and algorithms. Different from the frequency-domain “micro-Doppler” approach, the proposed remote gesture recognition based on linear motion reconstruction is able to recognize definitive signatures for the corresponding motions, exhibiting promising potential in practical applications of human-computer interaction.

negative: Design Optimization of Transverse Flux Linear Motor for Weight Reduction and Performance Improvement Using Response Surface Methodology and Genetic Algorithms Permanent magnet (PM) type transverse flux linear motors (TFLMs) are electromagnetic devices, which can develop directly powerful linear motion. These motors have been developed to apply to high power system, such as railway traction, electrodynamics vibrator, free-piston generator, etc. This paper presents an optimum design of a PM-type TFLM to reduce the weight of motor with constraints of thrust and detent force using response surface methodology (RSM) and genetic algorithms (GAs). RSM is well adapted to make analytical model of motor weight with constraints of thrust and detent forces, and enable objective function to be easily created and a great computational time to be saved. Finite element computations have been used for numerical experiments on geometrical design variables in order to determine the coefficients of a second-order analytical model for the RSM. GAs are used as a searching tool for design optimization of TFLM to reduce the weight of motor and improve the motor performance.

negative: Glioblastoma multiforme tissue histopathology images based disease stage classification with deep CNN Recently, many feature extraction methods for histopathology images have been reported for automatic quantitative analysis. One of the severe brain tumors is the Glioblastoma multiforme (GBM) and histopathology tissue images can provide unique insights into identifying and grading disease stages. However, the number of tissue samples to be examined is enormous, and is a burden to pathologists because of tedious manual evaluation traditionally required for efficient evaluation. In this study, we consider feature extraction and disease stage classification for brain tumor histopathology images using automatic image analysis methods. In particular, we utilized an automatic feature extraction and labeling for histopathology imagery data given by The Cancer Genome Atlas (TCGA) and checked the classification accuracy of disease stages in GBM tissue images using deep Convolutional Neural Network (CNN). Experimental results indicate promise in automatic disease stage classification and high level of accuracy were obtained for tested image data.

negative: Template Deformation for Point Cloud Fitting The reconstruction of high-quality surface meshes from measured data is a vital stage in digital shape processing. We present a new approach to this problem that deforms a template surface to fit a given point cloud. Our method takes a template mesh and a point cloud as input, the latter typically shows missing parts and measurement noise. The deformation process is initially guided by user specified correspondences between template and data, then during iterative fitting new correspondences are established. This approach is based on a Laplacian setting for the template without need of any additional meshing of the data or cross-parameterization. The reconstructed surface fits to the point cloud while it inherits shape properties and topology of the template. We demonstrate the effectiveness of the approach for several point data sets from different sources.

negative: Bystander Responses to a Violent Incident in an Immersive Virtual Environment Under what conditions will a bystander intervene to try to stop a violent attack by one person on another? It is generally believed that the greater the size of the crowd of bystanders, the less the chance that any of them will intervene. A complementary model is that social identity is critical as an explanatory variable. For example, when the bystander shares common social identity with the victim the probability of intervention is enhanced, other things being equal. However, it is generally not possible to study such hypotheses experimentally for practical and ethical reasons. Here we show that an experiment that depicts a violent incident at life-size in immersive virtual reality lends support to the social identity explanation. 40 male supporters of Arsenal Football Club in England were recruited for a two-factor between-groups experiment: the victim was either an Arsenal supporter or not (in-group/out-group), and looked towards the participant for help or not during the confrontation. The response variables were the numbers of verbal and physical interventions by the participant during the violent argument. The number of physical interventions had a significantly greater mean in the in-group condition compared to the out-group. The more that participants perceived that the Victim was looking to them for help the greater the number of interventions in the in-group but not in the out-group. These results are supported by standard statistical analysis of variance, with more detailed findings obtained by a symbolic regression procedure based on genetic programming. Verbal interventions made during their experience, and analysis of post-experiment interview data suggest that in-group members were more prone to confrontational intervention compared to the out-group who were more prone to make statements to try to diffuse the situation.

negative: Point cloud compression based on hierarchical point clustering In this work we propose an algorithm for compressing the geometry of a 3D point cloud (3D point-based model). The proposed algorithm is based on the hierarchical clustering of the points. Starting from the input model, it performs clustering to the points to generate a coarser approximation, or a coarser level of detail (LOD). Iterating this clustering process, a sequence of LODs are generated, forming an LOD hierarchy. Then, the LOD hierarchy is traversed top down in a width-first order. For each node encountered during the traversal, the corresponding geometric updates associated with its children are encoded, leading to a progressive encoding of the original model. Special efforts are made in the clustering to maintain high quality of the intermediate LODs. As a result, the proposed algorithm achieves both generic topology applicability and good ratedistortion performance at low bitrates, facilitating its applications for low-end bandwidth and/or platform configurations.

negative: INTERNAL COMPACT PRINTED LOOP ANTENNA WITH MATCHING ELEMENT FOR LAPTOP APPLICATIONS An internal compact printed loop antenna with matching element is presented for laptop applications. Bending to the printed loop structure is employed to reduce the size of antenna. A matching element is used at backside of the substrate to enhance the bandwidth of the antenna. The matching element is of rectangular shape with inverted U shape slot in it. The proposed antenna with wideband characteristics covers GSM900, GSM1900, UMTS, LTE2300, WLAN, WiMAX 3.3/3.5/3.7 bands and is suitable for laptop applications. The antenna structure is simulated using IE3D software. Keywordsbended; multiband antenna; printed loop antenna; tablet; wideband antenna.

negative: Anti-phishing detection of phishing attacks using genetic algorithm An approach to detection of phishing hyperlinks using the rule based system formed by genetic algorithm is proposed, which can be utilized as a part of an enterprise solution to anti-phishing. A legitimate webpage owner can use this approach to search the web for suspicious hyperlinks. In this approach, genetic algorithm is used to evolve rules that are used to differentiate phishing link from legitimate link. Evaluating the parameters like evaluation function, crossover and mutation, GA generates a ruleset that matches only the phishing links. This ruleset is stored in a database and a link is reported as a phishing link if it matches any of the rules in the rule based system and thus it keeps safe from fake hackers. Preliminary experiments show that this approach is effective to detect phishing hyperlink with minimal false negatives at a speed adequate for online application.

negative: SDN and OpenFlow for Dynamic Flex-Grid Optical Access and Aggregation Networks We propose and discuss the extension of software-defined networking (SDN) and OpenFlow principles to optical access/aggregation networks for dynamic flex-grid wavelength circuit creation. The first experimental demonstration of an OpenFlow1.0-based flex-grid λ-flow architecture for dynamic 150 Mb/s per-cell 4 G Orthogonal Frequency Division Multiple Access (OFDMA) mobile backhaul (MBH) overlays onto 10 Gb/s passive optical networks (PON) without optical network unit (ONU)-side optical filtering, amplification, or coherent detection, over 20 km standard single mode fiber (SSMF) with a 1:64 passive split is also detailed. The proposed approach can be attractive for monetizing optical access/aggregation networks via on-demand support for high-speed, low latency, high quality of service (QoS) applications over legacy fiber infrastructure.

negative: Physics Informed Deep Learning (Part I): Data-driven Solutions of Nonlinear Partial Differential Equations We introduce physics informed neural networks – neural networks that are trained to solve supervised learning tasks while respecting any given law of physics described by general nonlinear partial differential equations. In this two part treatise, we present our developments in the context of solving two main classes of problems: data-driven solution and data-driven discovery of partial differential equations. Depending on the nature and arrangement of the available data, we devise two distinct classes of algorithms, namely continuous time and discrete time models. The resulting neural networks form a new class of data-efficient universal function approximators that naturally encode any underlying physical laws as prior information. In this first part, we demonstrate how these networks can be used to infer solutions to partial differential equations, and obtain physics-informed surrogate models that are fully differentiable with respect to all input coordinates and free parameters.

negative: Children's moral motivation, sympathy, and prosocial behavior. Two studies investigated the role of children's moral motivation and sympathy in prosocial behavior. Study 1 measured other-reported prosocial behavior and self- and other-reported sympathy. Moral motivation was assessed by emotion attributions and moral reasoning following hypothetical transgressions in a representative longitudinal sample of Swiss 6-year-old children (N = 1,273). Prosocial behavior increased with increasing sympathy, especially if children displayed low moral motivation. Moral motivation and sympathy were also independently related to prosocial behavior. Study 2 extended the findings of Study 1 with a second longitudinal sample of Swiss 6-year-old children (N = 175) using supplementary measures of prosocial behavior, sympathy, and moral motivation. The results are discussed in regard to the precursors of the moral self in childhood.

negative: Earliest Deadline Scheduling for Real-Time Database Systems Earlier studies have observed that in moderately-loaded real-time database systems, using an Earliest Deadline policy to schedule tasks results in the fewest missed deadlines. When the real-time system is overloaded, however, an Earliest Deadline schedule performs worse than most other policies. This is due to Earliest Deadline giving the highest priority to transactions that are close to missing their deadlines. In this paper, we present a new priority assignment algorithm called Adaptive Earliest Deadline (AED), which features a feedback control mechanism that detects overload conditions and modifies transaction priority assignments accordingly. Using a detailed simulation model, we compare the performance of AED with respect to Earliest Deadline and other fixed priority schemes. We also present and evaluate an extension of the AED algorithm called Hierarchical Earliest Deadline (HED), which is designed to handle applications that assign different values to transactions and where the goal is to maximize the total value of the in-time transactions.

negative: Reinforcement Learning for Spoken Dialogue Systems Recently, a number of authors have proposed treating dialog ue systems as Markov decision processes (MDPs). However, the practical applica tion of MDP algorithms to dialogue systems faces a number of severe technical chall enges. We have built a general software tool (RLDS, for Reinforcement Learning fo r Dialogue Systems) based on the MDP framework, and have applied it to dialogue co rpora gathered from two dialogue systems built at AT&T Labs. Our experiment s demonstrate that RLDS holds promise as a tool for “browsing” and understandin g correlations in complex, temporally dependent dialogue corpora.

negative: Primal-Dual Group Convolutions for Deep Neural Networks In this paper, we present a simple and modularized neural network architecture, named primal-dual group convolutional neural networks (PDGCNets). The main point lies in a novel building block, a pair of two successive group convolutions: primal group convolution and dual group convolution. The two group convolutions are complementary: (i) the convolution on each primal partition in primal group convolution is a spatial convolution, while on each dual partition in dual group convolution, the convolution is a point-wise convolution; (ii) the channels in the same dual partition come from different primal partitions. We discuss one representative advantage: Wider than a regular convolution with the number of parameters and the computation complexity preserved. We also show that regular convolutions, group convolution with summation fusion (as used in ResNeXt), and the Xception block are special cases of primal-dual group convolutions. Empirical results over standard benchmarks, CIFAR-10, CIFAR-100, SVHN and ImageNet demonstrate that our networks are more efficient in using parameters and computation complexity with similar or higher accuracy.

negative: A Low-Cost High-Performance Digital Radar Test Bed This paper describes the design of a dual-channel S-band digital radar test bed. The test bed combines stretch processing with a novel and cost-effective hardware architecture that enables it to achieve an in-band dynamic range of 60 dB over 600 MHz of instantaneous bandwidth. The dual digital receiver channels allow for adaptive digital beamforming which can be used to mitigate a directional source of interference. Experimental test and verification results are presented to demonstrate system performance.

negative: Unsupervised Footwear Impression Analysis and Retrieval from Crime Scene Data Footwear impressions are one of the most frequently secured types of evidence at crime scenes. For the investigation of crime series they are among the major investigative notes. In this paper, we introduce an unsupervised footwear retrieval algorithm that is able to cope with unconstrained noise conditions and is invariant to rigid transformations. A main challenge for the automated impression analysis is the separation of the actual shoe sole information from the structured background noise. We approach this issue by the analysis of periodic patterns. Given unconstrained noise conditions, the redundancy within periodic patterns makes them the most reliable information source in the image. In this work, we present four main contributions: First, we robustly measure local periodicity by fitting a periodic pattern model to the image. Second, based on the model, we normalize the orientation of the image and compute the window size for a local Fourier transformation. In this way, we avoid distortions of the frequency spectrum through other structures or boundary artefacts. Third, we segment the pattern through robust point-wise classification, making use of the property that the amplitudes of the frequency spectrum are constant for each position in a periodic pattern. Finally, the similarity between footwear impressions is measured by comparing the Fourier representations of the periodic patterns. We demonstrate robustness against severe noise distortions as well as rigid transformations on a database with real crime scene impressions. Moreover, we make our database available to the public, thus enabling standardized benchmarking for the first time.

negative: Stacked Convolutional Denoising Auto-Encoders for Feature Representation Deep networks have achieved excellent performance in learning representation from visual data. However, the supervised deep models like convolutional neural network require large quantities of labeled data, which are very expensive to obtain. To solve this problem, this paper proposes an unsupervised deep network, called the stacked convolutional denoising auto-encoders, which can map images to hierarchical representations without any label information. The network, optimized by layer-wise training, is constructed by stacking layers of denoising auto-encoders in a convolutional way. In each layer, high dimensional feature maps are generated by convolving features of the lower layer with kernels learned by a denoising auto-encoder. The auto-encoder is trained on patches extracted from feature maps in the lower layer to learn robust feature detectors. To better train the large network, a layer-wise whitening technique is introduced into the model. Before each convolutional layer, a whitening layer is embedded to sphere the input data. By layers of mapping, raw images are transformed into high-level feature representations which would boost the performance of the subsequent support vector machine classifier. The proposed algorithm is evaluated by extensive experimentations and demonstrates superior classification performance to state-of-the-art unsupervised networks.

negative: WeedMap: A Large-Scale Semantic Weed Mapping Framework Using Aerial Multispectral Imaging and Deep Neural Network for Precision Farming The ability to automatically monitor agricultural fields is an important capability in precision farming, enabling steps towards more sustainable agriculture. Precise, high-resolution monitoring is a key prerequisite for targeted intervention and the selective application of agro-chemicals. In this paper, we present a novel weed segmentation and mapping framework that processes multispectral images obtained from an unmanned aerial vehicle (UAV) using a deep neural network (DNN). Most studies on crop/weed semantic segmentation only consider single images for processing and classification. Images taken by UAVs often cover only a few hundred square meters with either color only or color and near-infrared (NIR) channels. Although a map can be generated by processing single segmented images incrementally, this requires additional complex information fusion techniques which struggle to handle high fidelity maps due to their computational costs and problems in ensuring global consistency. Moreover, computing a single large and accurate vegetation map (e.g., crop/weed) using a DNN is non-trivial due to difficulties arising from: (1) limited ground sample distances (GSDs) in high-altitude datasets, (2) sacrificed resolution resulting from downsampling high-fidelity images, and (3) multispectral image alignment. To address these issues, we adopt a stand sliding window approach that operates on only small portions of multispectral orthomosaic maps (tiles), which are channel-wise aligned and calibrated radiometrically across the entire map. We define the tile size to be the same as that of the DNN input to avoid resolution loss. Compared to our baseline model (i.e., SegNet with 3 channel RGB inputs) yielding an area under the curve (AUC) of [background=0.607, crop=0.681, weed=0.576], our proposed model with 9 input channels achieves [0.839, 0.863, 0.782]. Additionally, we provide an extensive analysis of 20 trained models, both qualitatively and quantitatively, in order to evaluate the effects of varying input channels and tunable network hyperparameters. Furthermore, we release a large sugar beet/weed aerial dataset with expertly guided annotations for further research in the fields of remote sensing, precision agriculture, and agricultural robotics.

negative: Network-Based Intrusion Detection Using Unsupervised Adaptive Resonance Theory ( ART ) This paper introduces the Unsupervised Neural Net based Intrusion Detector (UNNID) system, which detects network-based intrusions and attacks using unsupervised neural networks. The system has facilities for training, testing, and tunning of unsupervised nets to be used in intrusion detection. Using the system, we tested two types of unsupervised Adaptive Resonance Theory (ART) nets (ART-1 and ART-2). Based on the results, such nets can efficiently classify network traffic into normal and intrusive. The system uses a hybrid of misuse and anomaly detection approaches, so is capable of detecting known attack types as well as new attack types as anomalies.

negative: Accelerator-Aware Pruning for Convolutional Neural Networks Convolutional neural networks have shown tremendous performance in computer vision tasks, but their excessive amount of weights and operations prevent them from being adopted in embedded environments. One of the solutions involves pruning, where some unimportant weights are forced to be zero. Many pruning schemes have been proposed, but have focused mainly on the number of pruned weights. The previous pruning schemes hardly considered ASIC or FPGA accelerator architectures. When the pruned networks are run on the accelerators, the lack of architecture consideration casues some inefficiency problems including internal buffer mis-alignment and load imbalance. This paper proposes a new pruning scheme that reflects accelerator architectures. In the proposed scheme, pruning is performed so that the same number of weights remain for each weight group corresponding to activations fetched simultaneously. In this way, the pruning scheme resolves the inefficiency problems. Even with the constraint, the proposed pruning scheme reached a pruning ratio similar to that of the previous unconstrained pruning schemes not only in AlexNet and VGG16 but also in the state-of-the-art very-deep networks like ResNet. Furthermore, the proposed scheme demonstrated a comparable pruning ratio in slimmed networks that were already pruned channel-wisely. In addition to improving the efficiency of previous sparse accelerators, it will be also shown that the proposed pruning scheme can be used to reduce the logic complexity of sparse accelerators.