SoroushVahidi/scidocs huggingface dataset:
Simulating Urban Growth Using the SLEUTH Model in a Coastal Peri-Urban District in China
(2014)

China’s southeast coastal areas have witnessed rapid growth in the last two decades, owing mostly to their economic and social attractions. In this paper, we chose Jimei, a coastal peri-urban district of Xiamen city on the southeast coast of China, as a study area to explore the district’s growth dynamics, to predict future sprawl during the next decade and to provide a basis for urban planning. The SLEUTH urban growth model was calibrated against historical data derived from a series of Landsat TM 5 satellite images taken between 1992 and 2007. A Lee-Sallee value of 0.48 was calculated for the district, which is a satisfactory result compared with related studies. Five coefficients of urban growth, diffusion, spread, breed, slope resistance and road gravity had values of 25, 68, 86, 24 and 23, respectively, in 2007. The growth coefficients (i.e., urban character) can capture urban growth characteristics in Jimei district. The urban DNA revealed that, over the study period, urban growth in the district was dominated both by urbanization through establishment of new urban centers, and by expansion outward from existing urban centers. In contrast to interior cities, in which expansions are dramatically shaped by actual road patterns, urban expansion in the district was likely constrained by the nearby coastline. Future urban growth patterns were predicted to 2020 assuming three different development scenarios. The first scenario simulated a continuation of historical urban growth without changing current conditions. The second scenario projected managed growth in which OPEN ACCESS Sustainability 2014, 6 3900 urban growth is limited by a layer with areas excluded from urbanization, which is the future development plan for Jimei district and Xiamen city. The third scenario depicted a growth with maximum protection in which growth was allowed to continue, similar to the second scenario, but with lower diffusion and spread coefficients applied to the growth pattern. The third scenario demonstrated that valuable land could be saved, which is the most desirable outcome for Jimei urban development. The study showed that SLEUTH can be an extremely useful tool for coastal city managers to explore the likely outcomes of their city development plans.
Reuters Tracer: A Large Scale System of Detecting & Verifying Real-Time News Events from Twitter
(2016)

News professionals are facing the challenge of discovering news from more diverse and unreliable information in the age of social media. More and more news events break on social media first and are picked up by news media subsequently. The recent Brussels attack is such an example. At Reuters, a global news agency, we have observed the necessity of providing a more effective tool that can help our journalists to quickly discover news on social media, verify them and then inform the public.
 In this paper, we describe Reuters Tracer, a system for sifting through all noise to detect news events on Twitter and assessing their veracity. We disclose the architecture of our system and discuss the various design strategies that facilitate the implementation of machine learning models for noise filtering and event detection. These techniques have been implemented at large scale and successfully discovered breaking news faster than traditional journalism
Facial Landmark Tracking and Facial Expression Recognition
(2013)

In this paper, we address the challenging computer vision problem of obtaining a reliable facial expression analysis from a naturally interacting person. We propose a system that combines a 3D generic face model, 3D head tracking, and 2D tracker to track facial landmarks and recognize expressions. First, we extract facial landmarks from a neutral frontal face, and then we deform a 3D generic face to fit the input face. Next, we use our real-time 3D head tracking module to track a person’s head in 3D and predict facial landmark positions in 2D using the projection from the updated 3D face model. Finally, we use tracked 2D landmarks to update the 3D landmarks. This integrated tracking loop enables efficient tracking of the non-rigid parts of a face in the presence of large 3D head motion. We conducted experiments for facial expression recognition using both framebased and sequence-based approaches. Our method provides a 75.9% recognition rate in 8 subjects with 7 key expressions. Our approach provides a considerable step forward toward new applications including human-computer interactions, behavioral science, robotics, and game applications.
Increasing the breakdown capability of superjunction power MOSFETs at the edge of the active region
(2009)

When superjunction power MOSFETs operate near the rim of the safe operating area, avalanche breakdown can occur in the transition region between the active cell array and the edge termination. Numerical device simulations confirmed this and revealed local charge imbalances, created by irregularities in the superjunction doping pattern, as major cause. Based on the simulation results, we proposed optimized transitions of the superjunction doping pattern from the active cell array to the edge termination. Numerical device simulations as well as experiments demonstrated the enhanced breakdown capability of these transition regions.
Implementation of virtual fitting room using image processing
(2017)

There has been a great increase in interests towards online shopping. In case of purchase of products like apparels which always require a sense of knowledge on how cloths would fit upon a person. This is the major reason why less number of apparels are being shopped online. Hence, a virtual dressing room which would make people know how cloths personally fits in would be a great luxury for the online sellers which could give a wide choice for customers. For online marketers, this would be a great tool for enhancing its market.
Multiple hypothesis tracking for multiple target tracking
(2004)

Multiple hypothesis tracking (MHT) is generally accepted as the preferred method for solving the data association problem in modern multiple target tracking (MTT) systems. This paper summarizes the motivations for MHT, the basic principles behind MHT and the alternative implementations in common use. It discusses the manner in which the multiple data association hypotheses formed by MHT can be combined with multiple filter models, such as used by the interacting multiple model (IMM) method. An overview of the studies that show the advantages of MHT over the conventional single hypothesis approach is given. Important current applications and areas of future research and development for MHT are discussed.
A Metric for Performance Evaluation of Multi-Target Tracking Algorithms
(2011)

Performance evaluation of multi-target tracking algorithms is of great practical importance in the design, parameter optimization and comparison of tracking systems. The goal of performance evaluation is to measure the distance between two sets of tracks: the ground truth tracks and the set of estimated tracks. This paper proposes a mathematically rigorous metric for this purpose. The basis of the proposed distance measure is the recently formulated consistent metric for performance evaluation of multi-target filters, referred to as the OSPA metric. Multi-target filters sequentially estimate the number of targets and their position in the state space. The OSPA metric is therefore defined on the space of finite sets of vectors. The distinction between filtering and tracking is that tracking algorithms output tracks and a track represents a labeled temporal sequence of state estimates, associated with the same target. The metric proposed in this paper is therefore defined on the space of finite sets of tracks and incorporates the labeling error. Numerical examples demonstrate that the proposed metric behaves in a manner consistent with our expectations.
A Consistent Metric for Performance Evaluation of Multi-Object Filters
(2008)

The concept of a miss-distance, or error, between a reference quantity and its estimated/controlled value, plays a fundamental role in any filtering/control problem. Yet there is no satisfactory notion of a miss-distance in the well-established field of multi-object filtering. In this paper, we outline the inconsistencies of existing metrics in the context of multi-object miss-distances for performance evaluation. We then propose a new mathematically and intuitively consistent metric that addresses the drawbacks of current multi-object performance evaluation metrics.
Performance evaluation of multi-target tracking using the OSPA metric
(2010)

Performance evaluation of multi-target tracking algorithms is of great practical importance in the design and comparison of tracking systems. Recently a consistent metric for performance evaluation of multi-object filters (referred to as OSPA metric) has been proposed. In this paper we describe how the OSPA metric can be adapted to evaluate the performance of multi-target tracking algorithms. The main idea is to introduce the track label error into consideration in order to capture the data association performance, in addition to the existing cardinality and localisation errors. The paper demonstrates the proposed method by assessing and comparing the performance of two particle filters for multi-target tracking.
Multitarget miss distance via optimal assignment
(2004)

The concept of miss distance-Euclidean, Mahalanobis, etc.-is a fundamental, far-reaching, and taken-for-granted element of the engineering theory and practice of single-target systems. In this paper we introduce a comprehensive L/sub p/-type theory of distance metrics for multitarget (and, more generally, multiobject) systems. We show that this theory extends, and provides a rigorous theoretical basis for, an intuitively appealing optimal-assignment approach proposed by Drummond for evaluating the performance of multitarget tracking algorithms. We describe tractable computational approaches for computing such metrics based on standard optimal assignment or convex optimization techniques. We describe the potentially far-reaching implications of these metrics for applications such as performance evaluation and sensor management. In the former case, we demonstrate the application of multitarget miss-distance metrics as measures of effectiveness (MoEs) for multitarget tracking algorithms.
Solving dynamic vehicle routing problem via evolutionary search with learning capability
(2017)

To date, dynamic vehicle routing problem (DVRP) has attracted great research attentions due to its wide range of real world applications. In contrast to traditional static vehicle routing problem, the whole routing information in DVRP is usually unknown and obtained dynamically during the routing execution process. To solve DVRP, many heuristic and metaheuristic methods have been proposed in the literature. In this paper, we present a novel evolutionary search paradigm with learning capability for solving DVRP. In particular, we propose to capture the structured knowledge from optimized routing solution in early time slot, which can be further reused to bias the customer-vehicle assignment when dynamic occurs. By extending our previous research work, the learning of useful knowledge, and the scheduling of dynamic customer requests are detailed here. Further, to evaluate the efficacy of the proposed search paradigm, comprehensive empirical studies on 21 commonly used DVRP instances with diverse properties are also reported.
Rank Correlation for Low-Rate DDoS Attack Detection: An Empirical Evaluation
(2016)

A low-rate distributed denial of service (DDoS) attack has the ability to obscure its traffic because it is very similar to legitimate traffic. It can easily evade current detection mechanisms. Rank correlation measures can quantify significant differences between attack traffic and legitimate traffic based on their rank values. In this paper, we use two rank correlation measures, namely, Spearmen Rank Correlation (SRC) and Partial Rank Correlation (PRC) to detect low-rate DDoS attacks. These measures are empirically evaluated using three real-life datasets. Experimental results show that both measures can effectively discriminate legitimate traffic from attack traffic. We find that PRC performs better than SRC in detection of lowrate DDoS attacks in terms of spacing between malicious and legitimate traffic.
Nutritional support for wound healing.
(2003)

Healing of wounds, whether from accidental injury or surgical intervention, involves the activity of an intricate network of blood cells, tissue types, cytokines, and growth factors. This results in increased cellular activity, which causes an intensified metabolic demand for nutrients. Nutritional deficiencies can impede wound healing, and several nutritional factors required for wound repair may improve healing time and wound outcome. Vitamin A is required for epithelial and bone formation, cellular differentiation, and immune function. Vitamin C is necessary for collagen formation, proper immune function, and as a tissue antioxidant. Vitamin E is the major lipid-soluble antioxidant in the skin; however, the effect of vitamin E on surgical wounds is inconclusive. Bromelain reduces edema, bruising, pain, and healing time following trauma and surgical procedures. Glucosamine appears to be the rate-limiting substrate for hyaluronic acid production in the wound. Adequate dietary protein is absolutely essential for proper wound healing, and tissue levels of the amino acids arginine and glutamine may influence wound repair and immune function. The botanical medicines Centella asiatica and Aloe vera have been used for decades, both topically and internally, to enhance wound repair, and scientific studies are now beginning to validate efficacy and explore mechanisms of action for these botanicals. To promote wound healing in the shortest time possible, with minimal pain, discomfort, and scarring to the patient, it is important to explore nutritional and botanical influences on wound outcome.
Semantic Object Segmentation in Tagged Videos via Detection
(2018)

Semantic object segmentation (SOS) is a challenging task in computer vision that aims to detect and segment all pixels of the objects within predefined semantic categories. In image-based SOS, many supervised models have been proposed and achieved impressive performances due to the rapid advances of well-annotated training images and machine learning theories. However, in video-based SOS it is often difficult to directly train a supervised model since most videos are weakly annotated by tags. To handle such tagged videos, this paper proposes a novel approach that adopts a segmentation-by-detection framework. In this framework, object detection and segment proposals are first generated using the models pre-trained on still images, which provide useful cues to roughly localize the semantic objects. Based on these proposals, we propose an efficient algorithm to initialize object tracks by solving a joint assignment problem. As such tracks provide rough spatiotemporal configurations of the semantic objects, a voting-based refinement algorithm is further proposed to improve their spatiotemporal consistency. Extensive experiments demonstrate that the proposed framework can robustly and effectively segment semantic objects in tagged videos, even when the image-based object detectors provide inaccurate proposals. On various public benchmarks, the proposed approach obtains substantial improvements over the state-of-the-arts.
EmailProfiler: Spearphishing Filtering with Header and Stylometric Features of Emails
(2016)

Spearphishing is a prominent targeted attack vector in today's Internet. By impersonating trusted email senders through carefully crafted messages and spoofed metadata, adversaries can trick victims into launching attachments containing malicious code or into clicking on malicious links that grant attackers a foothold into otherwise well-protected networks. Spearphishing is effective because it is fundamentally difficult for users to distinguish legitimate emails from spearphishing emails without additional defensive mechanisms. However, such mechanisms, such as cryptographic signatures, have found limited use in practice due to their perceived difficulty of use for normal users. In this paper, we present a novel automated approach to defending users against spearphishing attacks. The approach first builds probabilistic models of both email metadata and stylometric features of email content. Then, subsequent emails are compared to these models to detect characteristic indicators of spearphishing attacks. Several instantiations of this approach are possible, including performing model learning and evaluation solely on the receiving side, or senders publishing models that can be checked remotely by the receiver. Our evaluation of a real data set drawn from 20 email users demonstrates that the approach effectively discriminates spearphishing attacks from legitimate email while providing significant ease-of-use benefits over traditional defenses.
Distributed Incremental Pattern Matching on Streaming Graphs
(2016)

Big data has shifted the computing paradigm of data analysis. While some of the data can be treated as simple texts or independent data records, many other applications have data with structural patterns which are modeled as a graph, such as social media, road network traffic and smart grid, etc. However, there is still limited amount of work has been done to address the velocity problem of graph processing. In this work, we aim to develop a distributed processing system for solving pattern matching queries on streaming graphs where graphs evolve over time upon the arrives of streaming graph update events. To achieve the goal, we proposed an incremental pattern matching algorithm and implemented it on GPS, a vertex centric distributed graph computing framework. We also extended the GPS framework to support streaming graph, and adapted a subgraphcentric data model to further reduce communication overhead and system performance. Our evaluation using real wiki trace shows that our approach achieves a 3x -- 10x speedup over the batch algorithm, and significantly reduces network and memory usage.
Design of Kernels in Convolutional Neural Networks for Image Classification
(2016)

Despite the effectiveness of convolutional neural networks (CNNs) for image classification, our understanding of the effect of shape of convolution kernels on learned representations is limited. In this work, we explore and employ the relationship between shape of kernels which define receptive fields (RFs) in CNNs for learning of feature representations and image classification. For this purpose, we present a feature visualization method for visualization of pixel-wise classification score maps of learned features. Motivated by our experimental results, and observations reported in the literature for modeling of visual systems, we propose a novel design of shape of kernels for learning of representations in CNNs. In the experimental results, the proposed models achieved an outstanding performance in the classification task, comparing to a base CNN models that introduces more parameters and computational time. Additionally, we examined the region of interest (ROI) of different models in the classification task and analyzed the robustness of the proposed method to occluded images. Our results indicate the effectiveness of the proposed approach.
Efficient Edge Detection on Low-Cost FPGAs
(2015)

Improving the efficiency of edge detection in embedded applications, such as UAV control, is critical for reducing system cost and power dissipation. Field programmable gate arrays (FPGA) are a good platform for making improvements because of their specialised internal structure. However, current FPGA edge detectors do not exploit this structure well. A new edge detection architecture is proposed that is better optimised for FPGAs. The basis of the architecture is the Sobel edge kernels that are shown to be the most suitable because of their separability and absence of multiplications. Edge intensities are calculated with a new 4:2 compressor that consists of two custom-designed 3:2 compressors. Addition speed is increased by breaking carry propagation chains with look-ahead logic. Testing of the design showed it gives a 28% increase in speed and 4.4% reduction in area over previous equivalent designs, which demonstrated that it will lower the cost of edge detection systems, dissipate less power and still maintain highspeed control. Keywords—edge detection; FPGA; compressor; low-cost; UAV
CSI-MIMO: Indoor Wi-Fi fingerprinting system
(2014)

Wi-Fi based fingerprinting systems, mostly utilize the Received Signal Strength Indicator (RSSI), which is known to be unreliable due to environmental and hardware effects. In this paper, we present a novel Wi-Fi fingerprinting system, exploiting the fine-grained information known as Channel State Information (CSI). The frequency diversity of CSI can be effectively utilized to represent a location in both frequency and spatial domain resulting in more accurate indoor localization. We propose a novel location signature CSI-MIMO that incorporates Multiple Input Multiple Output (MIMO) information and use both the magnitude and the phase of CSI of each sub-carrier. We experimentally evaluate the performance of CSI-MIMO fingerprinting using the k-nearest neighbor and the Bayes algorithm. The accuracy of the proposed CSI-MIMO is compared with Finegrained Indoor Fingerprinting System (FIFS) and a simple CSI-based system. The experimental result shows an accuracy improvement of 57% over FIFS with an accuracy of 0.95 meters.
Structured Perceptron with Inexact Search
(2012)

Structured learning with inexact inference is a fundamental problem. We propose variants of the structured perceptron algorithm under a general “violation-fixing” framework that guarantees convergence. This framework subsumes previous remedies including “early update” as special cases, and also explains why standard perceptron may fail with inexact search. We also propose new update methods within this framework which learn better models with dramatically reduced training times on state-of-the-art part-of-speech tagging and incremental parsing systems.
ON RANDOM DEEP AUTOENCODERS: EXACT ASYMP-
(2018)

We study the behavior of weight-tied multilayer vanilla autoencoders under the assumption of random weights. Via an exact characterization in the limit of large dimensions, our analysis reveals interesting phase transition phenomena when the depth becomes large. This, in particular, provides quantitative answers and insights to three questions that were yet fully understood in the literature. Firstly, we provide a precise answer on how the random deep weight-tied autoencoder model performs “approximate inference” as posed by Scellier et al. (2018), and its connection to reversibility considered by several theoretical studies. Secondly, we show that deep autoencoders display a higher degree of sensitivity to perturbations in the parameters, distinct from the shallow counterparts. Thirdly, we obtain insights on pitfalls in training initialization practice, and demonstrate experimentally that it is possible to train a deep autoencoder, even with the tanh activation and a depth as large as 200 layers, without resorting to techniques such as layer-wise pre-training or batch normalization. Our analysis is not specific to any depths or any Lipschitz activations, and our analytical techniques may have broader applicability.