SoroushVahidi/scidocs huggingface dataset:
Competing Memes Propagation on Networks: A Network Science Perspective
(2013)

In this paper, we study the intertwined propagation of two competing "memes" (or data, rumors, etc.) in a composite network. Within the constraints of this scenario, we ask two key questions: (a) which meme will prevail? and (b) can one influence the outcome of the propagations? Our model is underpinned by two key concepts, a structural graph model (composite network) and a viral propagation model (SI1I2S). Using this framework, we formulate a non-linear dynamic system and perform an eigenvalue analysis to identify the tipping point of the epidemic behavior. Based on insights gained from this analysis, we demonstrate an effective and accurate prediction method to determine viral dominance, which we call the EigenPredictor. Next, using a combination of synthetic and real composite networks, we evaluate the effectiveness of various viral suppression techniques by either a) concurrently suppressing both memes or b) unilaterally suppressing a single meme while leaving the other relatively unaffected.
The dynamics of viral marketing
(2006)

We present an analysis of a person-to-person recommendation network, consisting of 4 million people who made 16 million recommendations on half a million products. We observe the propagation of recommendations and the cascade sizes, which we explain by a simple stochastic model. We analyze how user behavior varies within user communities defined by a recommendation network. Product purchases follow a ‘long tail’ where a significant share of purchases belongs to rarely sold items. We establish how the recommendation network grows over time and how effective it is from the viewpoint of the sender and receiver of the recommendations. While on average recommendations are not very effective at inducing purchases and do not spread very far, we present a model that successfully identifies communities, product, and pricing categories for which viral marketing seems to be very effective.
Comparing and managing multiple versions of slide presentations
(2006)

Despite the ubiquity of slide presentations, managing multiple presentations remains a challenge. Understanding how multiple versions of a presentation are related to one another, assembling new presentations from existing presentations, and collaborating to create and edit presentations are difficult tasks. In this paper, we explore techniques for comparing and managing multiple slide presentations. We propose a general comparison framework for computing similarities and differences between slides. Based on this framework we develop an interactive tool for visually comparing multiple presentations. The interactive visualization facilitates understanding how presentations have evolved over time. We show how the interactive tool can be used to assemble new presentations from a collection of older ones and to merge changes from multiple presentation authors.
Visual pattern discovery for architecture image classification and product image search
(2012)

Many objects have repetitive elements, and finding repetitive patterns facilitates object recognition and numerous applications. We devise a representation to describe configurations of repetitive elements. By modeling spatial configurations, visual patterns are more discriminative than local features, and are able to tackle with object scaling, rotation, and deformation. We transfer the pattern discovery problem into finding frequent subgraphs from a graph, and exploit a graph mining algorithm to solve this problem. Visual patterns are then exploited in architecture image classification and product image retrieval, based on the idea that visual pattern can describe elements conveying architecture styles and emblematic motifs of brands. Experimental results show that our pattern discovery approach has promising performance and is superior to the conventional bag-of-words approach.
Autonomous decision-making: a data mining approach
(2000)

The researchers and practitioners of today create models, algorithms, functions, and other constructs defined in abstract spaces. The research of the future will likely be data driven. Symbolic and numeric data that are becoming available in large volumes will define the need for new data analysis techniques and tools. Data mining is an emerging area of computational intelligence that offers new theories, techniques, and tools for analysis of large data sets. In this paper, a novel approach for autonomous decision-making is developed based on the rough set theory of data mining. The approach has been tested on a medical data set for patients with lung abnormalities referred to as solitary pulmonary nodules (SPNs). The two independent algorithms developed in this paper either generate an accurate diagnosis or make no decision. The methodology discussed in the paper depart from the developments in data mining as well as current medical literature, thus creating a variable approach for autonomous decision-making.
Modeling Propagation Dynamics and Developing Optimized Countermeasures for Rumor Spreading in Online Social Networks
(2015)

The spread of rumors in Online Social Networks (OSNs) poses great challenges to the social peace and public order. It is imperative to model propagation dynamics of rumors and develop corresponding countermeasures. Most of the existing works either overlook the heterogeneity of social networks or do not consider the cost of countermeasures. Motivated by these issues, this paper proposes a heterogeneous network based epidemic model that incorporates both the network heterogeneity and various countermeasures. Through analyzing the existence and stability of equilibrium solutions of the proposed ODE (Ordinary Differential Equation) system, the critical conditions that determine whether a rumor continuously propagates or becomes extinct are derived. Moreover, we concern about the cost of the main two types of countermeasures, i.e., Blocking rumors at influential users and spreading truth to clarify rumors. Employing the Pontryagin's maximum principle, we obtain the optimized countermeasures that ensures a rumor can become extinct at the end of an expected time period with lowest cost. Both the critical conditions and the optimized countermeasures provide a real-time decision reference to restrain the rumor spreading. Experiments based on Digg2009 dataset are conducted to evaluate the effectiveness of the proposed dynamic model and the efficiency of the optimized countermeasures.
Bus tracking and monitoring using RFID
(2017)

The rapid growth in population in India causes more crowding at public bus stops. People long wait for arriving of buses and suddenly gather near bus when it arrives and travel in overcrowded buses on footboards which leads to accidents. Theft is another risk of overcrowding. All this happens due to lack of proper information of arriving of buses at many of the bus stops. To solve this problem in a cost effective way, we have developed an IoT based bus tracking system to show the current location of the bus and seat availability in the arriving buses. We have used RFID technology for tracking the bus and Thingspeak web server for displaying location of the bus and seat availability in android application in a smart phone. This system enables the commuters to know the exact location of the bus, and occupancy level in the bus, which enable the commuters to take decision, whether to board this bus or next. This reduces the waiting time and overcrowding at bus stops. It also reduces the risk of accidents and thefts.
On path planning methods for automotive collision avoidance
(2013)

There is a strong trend for increasingly sophisticated Advanced Driver Assistance Systems (ADAS) such as Autonomous Emergency Braking (AEB) systems, Lane Keeping Aid (LKA) systems, and indeed autonomous driving. This trend generates a need for online maneuver generation, for which numerous approaches can be found in the large body of work related to path planning and obstacle avoidance. In order to ease the challenge of choosing a method, this paper reports quantitative and qualitative insights about three different path planning methods: a state lattice planner, predictive constraint-based planning, and spline-based search tree. Each method is described, implemented and compared on two specific traffic situations. The paper will not provide a final answer about which method is best. This depends on several factors such as computational constraints and the formulation of maneuver optimality that is appropriate for a given assistance or safety function. Instead, the conclusions will highlight qualitative merits and drawbacks for each method, in order to provide guidance for choosing a method for a specific application.
Edge detection using constrained discrete particle swarm optimisation in noisy images
(2011)

Edge detection algorithms often produce broken edges, especially in noisy images. We propose an algorithm based on discrete particle swarm optimisation (PSO) to detect continuous edges in noisy images. A constrained PSO-based algorithm with a new objective function is proposed to address noise and reduce broken edges. The localisation accuracy of the new algorithm is compared with that of a modified version of the Canny algorithm as a Gaussian-based edge detector, the robust rank order (RRO)-based algorithm as a statistical based edge detector, and our previously developed PSO-based algorithm. Pratt's figure of merit is used as a measure of localisation accuracy for these edge detection algorithms. Experimental results show that the performance of the new algorithm is higher than the Canny and RRO algorithms in the images corrupted by two different types of noise (impulsive and Gaussian noise). The new algorithm also detects edges more accurately and smoothly than our previously developed algorithm in noisy images.
Geo-parsing Messages from Microtext
(2011)

Widespread use of social media during crises has become commonplace, as shown by the volume of messages during the Haiti earthquake of 2010 and Japan tsunami of 2011. Location mentions are particularly important in disaster messages as they can show emergency responders where problems have occurred. This article explores the sorts of locations that occur in disaster-related social messages, how well off-theshelf software identifies those locations, and what is needed to improve automated location identification, called geo-parsing. To do this, we have sampled Twitter messages from the February 2011 earthquake in Christchurch, Canterbury, New Zealand. We annotated locations in messages manually to make a gold standard by which to measure locations identified by a Named Entity Recognition software. The Stanford NER software found some locations that were proper nouns, but did not identify locations that were not capitalized, local streets and buildings, or nonstandard place abbreviations and mis-spellings that are plentiful in microtext. We review how these problems might be solved in software research, and model a readable crisis map that shows crisis location clusters via enlarged place labels.
Combining virtual reality enabled simulation with 3D scanning technologies towards smart manufacturing
(2016)

Recent introduction of low-cost 3D sensing and affordable immersive virtual reality have lowered the barriers for creating and maintaining 3D virtual worlds. In this paper, we propose a way to combine these technologies with discrete-event simulation to improve the use of simulation in decision making in manufacturing. This work will describe how feedback is possible from real world systems directly into a simulation model to guide smart behaviors. Technologies included in the research include feedback from RGBD images of shop floor motion and human interaction within full immersive virtual reality that includes the latest headset technologies.
Hybrid PWM Strategy of SVPWM and VSVPWM for NPC Three-Level Voltage-Source Inverter
(2010)

Neutral-point (NP) voltage drift is the main technical drawback of NP-clamped (NPC) three-level inverters. Traditional space vector pulsewidth modulation (SVPWM) is incapable of controlling the NP voltage for high modulation indexes and low power factors. Virtual SVPWM (VSVPWM) is capable of controlling the NP voltage under full modulation indexes and full power factors. However, this modulation strategy is more complex than SVPWM, increases the switching frequency, and deteriorates the output waveforms of the inverter. A novel PWM concept that includes NP voltage-balancing conditions is proposed. Based on this concept, a hybrid modulation scheme that uses both SVPWM and VSVPWM is presented for complete control of the NP voltage in NPC three-level inverters. The performance of this new modulation approach and its benefits over SVPWM and VSVPWM are verified by simulation and experiments.
Why-type Question Classification in Question Answering System
(2017)

The fundamental requisite to acquire information on any topic has become increasingly important. The need for Question Answering Systems (QAS) prevalent nowadays, replacing the traditional search engines stems from the user requirement for the most accurate answer to any question or query. Thus, interpreting the information need of the users is quite crucial for designing and developing a question answering system. Question classification is an important component in question answering systems that helps to determine the type of question and its corresponding type of answer. In this paper, we present a new way of classifying Why-type questions, aimed at understanding a questioner’s intent. Our taxonomy classifies Why-type questions into four separate categories. In addition, to automatically detect the categories of these questions by a parser, we differentiate them at lexical level.
Circular Quadruple-Ridged Flared Horn Achieving Near-Constant Beamwidth Over Multioctave Bandwidth: Design and Measurements
(2013)

A circular quadruple-ridged flared horn achieving almost-constant beamwidth over 6:1 bandwidth is presented. This horn is the first demonstration of a wideband feed for radio telescopes which is capable of accommodating different reflector antenna optics, maintains almost constant gain and has excellent match. Measurements of stand-alone horn performance reveal excellent return loss performance as well as stable radiation patterns over 6:1 frequency range. Physical optics calculations predict an average of 69% aperture efficiency and 13 K antenna noise temperature with the horn installed on a radio telescope.
Automatic Classification of Power Quality Events Using Balanced Neural Tree
(2014)

This paper proposes an empirical-mode decomposition (EMD) and Hilbert transform (HT)-based method for the classification of power quality (PQ) events. Nonstationary power signal disturbance waveforms are considered as the superimposition of various undulating modes, and EMD is used to separate out these intrinsic modes known as intrinsic mode functions (IMFs). The HT is applied on all the IMFs to extract instantaneous amplitude and frequency components. This time-frequency analysis results in the clear visual detection, localization, and classification of the different power signal disturbances. The required feature vectors are extracted from the time-frequency distribution to perform the classification. A balanced neural tree is constructed to classify the power signal patterns. Finally, the proposed method is compared with an S-transform-based classifier to show the efficacy of the proposed technique in classifying the PQ disturbances.
Research on nursing handoffs for medical and surgical settings: an integrative review.
(2013)

AIMS
To synthesize outcomes from research on handoffs to guide future computerization of the process on medical and surgical units.


BACKGROUND
Handoffs can create important information gaps, omissions and errors in patient care. Authors call for the computerization of handoffs; however, a synthesis of the literature is not yet available that might guide computerization.


DATA SOURCES
PubMed, CINAHL, Cochrane, PsycINFO, Scopus and a handoff database from Cohen and Hilligoss.


DESIGN
Integrative literature review.


REVIEW METHODS
This integrative review included studies from 1980-March 2011 in peer-reviewed journals. Exclusions were studies outside medical and surgical units, handoff education and nurses' perceptions.


RESULTS
The search strategy yielded a total of 247 references; 81 were retrieved, read and rated for relevance and research quality. A set of 30 articles met relevance criteria.


CONCLUSION
Studies about handoff functions and rituals are saturated topics. Verbal handoffs serve important functions beyond information transfer and should be retained. Greater consideration is needed on analysing handoffs from a patient-centred perspective. Handoff methods should be highly tailored to nurses and their contextual needs. The current preference for bedside handoffs is not supported by available evidence. The specific handoff structure for all units may be less important than having a structure for contextually based handoffs. Research on pertinent information content for contextually based handoffs is an urgent need. Without it, handoff computerization is not likely to be successful. Researchers need to use more sophisticated experimental research designs, control for individual and unit differences and improve sampling frames.
Towards The Deep Model: Understanding Visual Recognition Through Computational Models
(2017)

Introduction Vision, due to its significance in surviving and socializing, is one of the most important and  extensively studied sensory functions in the human brain. In order to fully understand visual  information processing, or more specifically, visual recognition, David Marr proposed the  Tri-level Hypothesis [29], in that three levels of the system should be studied: the computational  goal of the system, the internal representation or the algorithm the system uses to achieve the  goal, and the neural substrates that implement the system. It is well-known that visual  recognition in the human brain is implemented by the ventral visual pathway [32], which  receives visual information from the retina and goes through a layered structure including V1  (also known as the primary visual cortex), V2, V4, before reaching the inferior temporal cortex  (IT). The topographic mapping between the retina and the human visual cortex follows a  log-polar transformation, in which the Cartesian coordinates of the retina are transformed to  polar coordinates (polar angle and eccentricity) in the human visual cortex. From V1 to V4, each  of the visual areas contains a complete polar angle and eccentricity map, and have a increasing  receptive field (RF) size and respond to increasing complex visual features [12,22]. In higher  level visual areas such as the ventral temporal cortex (VTC), studies using functional magnetic  resonance imaging (fMRI) and diffusion tensor imaging (DTI) have found there exists visual  category-selective regions, such as the Fusiform Face Area (FFA, [26]) for face processing, the  Parahippocampal Place Area (PPA, [13]) for scene perception, and the Lateral Occipital  Complex (LOC, [19]) for general object recognition. Grill-Spector and Malach [20] proposed that  layer-based hierarchical processing, together with the functional specialization, are the two  organizing principles of the human visual cortex. More recent studies have shown that the  central-biased face recognition pathway (FFA) and the peripheral-biased scene recognition  pathway (PPA) are both functionally and anatomically segregated by mid-fusiform sulcus (MFS),  which enables parallel fast processing of visual recognition tasks in the ventral pathway [18, 43,  21, 44].
UniqueID: Decentralized Proof-of-Unique-Human
(2018)

Bitcoin and Ethereum are novel mechanisms for decentralizing the concept of money and computation. Extending decentralization to the human identity concept, we can think of using blockchain for creating a list of verified human identities with a one-person-one-ID property. UniqueID is a Decentralized Autonomous Organization(DAO) for maintaining human identities such that every physical human entity can have no more that one account. One part of this identity is simply the user’s claim on one of his unique, permanent, and measurable characteristics -biometrics. Blockchain has proved its integrity as a platform for storing and performing computations on such claims. The biggest challenge here is to ensure that the user has submitted his own valid biometric data. Human verifiers can check if there is any inconsistency in other users’ data, by peer-to-peer checks. For preventing bad behavior and centralization in the verification process, UniqueID benefits from novel governance mechanisms to choose verifiers and punish unjust ones. Also, there are incentives for honest verifiers and users by newly generated tokens. We show how the users’ privacy can be preserved by using stateof-the-art cryptographic techniques, and so they can use their identity without any concerns for votings, financial and banking purposes, social media accounts, reputation systems etc.
On the multi-stage influence maximization problem
(2016)

The influence maximization problem turns up in many online social networks (OSN) in which each participant can potentially influence the decisions made by others in the network. Relationships can be friendships, family relationships or even professional relationships. Such influences can be used to achieve some objective and the influence maximization problem attempts to make decisions so as to maximize the effect of these influences. Past work focused on a static problem whereby one tries to identify the participants who are the most influential. Recently, a multi-stage version of the problem was proposed in which outcomes of influence attempts are observed before additional participants are chosen. For example, in online advertising, one can provide an impression to a particular subject and if that subject clicks on the impression, then their friends are informed in the hope that this information will increase the chances that they also click on the impression and eventually purchase the product. This problem is computationally intensive; in this paper we investigate various optimization methods for finding its solution that yield close to optimal results while taking less computation time. These include greedy and particle swarm optimization algorithms.