SoroushVahidi/scidocs huggingface dataset:
Accelerated training of conditional random fields with stochastic gradient methods
(2006)

We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several large data sets, the resulting optimizer converges to the same quality of solution over an order of magnitude faster than limited-memory BFGS, the leading method reported to date. We report results for both exact and inexact inference techniques.
HURRICANE TRAJECTORY PREDICTION VIA A SPARSE RECURRENT NEURAL NETWORK
(2015)

A proposed sparse recurrent neural network with flexible topology is used for trajectory prediction of the Atlantic hurricanes. For prediction of the future trajectories of a target hurricane, the most similar hurricanes to the target hurricane are found by comparing directions of the hurricanes. Then, the first and second differences of their positions over their life time are used for training the proposed network. Comparison of the obtained predictions with actual trajectories of Sandy and Humberto hurricanes show that our approach is quite promising for this aim.
Mindful consumption : a customer-centric approach to sustainability
(2010)

How effectively business deals with the challenges of sustainability will define its success for decades to come. Current sustainability strategies have three major deficiencies: they do not directly focus on the customer, they do not recognize the looming threats from rising global over-consumption, and they do not take a holistic approach. We present a framework for a customer-centric approach to sustainability. This approach recasts the sustainability metric to emphasize the outcomes of business actions measured holistically in term of environmental, personal and economic well-being of the consumer. We introduce the concept of mindful consumption (MC) as the guiding principle in this approach. MC is premised on a consumer mindset of caring for self, for community, and for nature, that translates behaviorally into tempering the selfdefeating excesses associated with acquisitive, repetitive and aspirational consumption. We also make the business case for fostering mindful consumption, and illustrate how the marketing function can be harnessed to successfully implement the customer-centric approach to sustainability.
Quality-biased ranking for queries with commercial intent
(2013)

Modern search engines are good enough to answer popular commercial queries with mainly highly relevant documents. However, our experiments show that users behavior on such relevant commercial sites may differ from one to another web-site with the same relevance label. Thus search engines face the challenge of ranking results that are equally relevant from the perspective of the traditional relevance grading approach. To solve this problem we propose to consider additional facets of relevance, such as trustability, usability, design quality and the quality of service. In order to let a ranking algorithm take these facets in account, we proposed a number of features, capturing the quality of a web page along the proposed dimensions. We aggregated new facets into the single label, commercial relevance, that represents cumulative quality of the site. We extrapolated commercial relevance labels for the entire learning-to-rank dataset and used weighted sum of commercial and topical relevance instead of default relevance labels. For evaluating our method we created new DCG-like metrics and conducted off-line evaluation as well as on-line interleaving experiments demonstrating that a ranking algorithm taking the proposed facets of relevance into account is better aligned with user preferences.
Scalable Graph Exploration on Multicore Processors
(2010)

Many important problems in computational sciences, social network analysis, security, and business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In this paper we investigate the challenges involved in exploring very large graphs by designing a breadth-first search (BFS) algorithm for advanced multi-core processors that are likely to become the building blocks of future exascale systems. Our new methodology for large-scale graph analytics combines a highlevel algorithmic design that captures the machine-independent aspects, to guarantee portability with performance to future processors, with an implementation that embeds processorspecific optimizations. We present an experimental study that uses state-of-the-art Intel Nehalem EP and EX processors and up to 64 threads in a single system. Our performance on several benchmark problems representative of the power-law graphs found in real-world problems reaches processing rates that are competitive with supercomputing results in the recent literature. In the experimental evaluation we prove that our graph exploration algorithm running on a 4-socket Nehalem EX is (1) 2.4 times faster than a Cray XMT with 128 processors when exploring a random graph with 64 million vertices and 512 millions edges, (2) capable of processing 550 million edges per second with an R-MAT graph with 200 million vertices and 1 billion edges, comparable to the performance of a similar graph on a Cray MTA-2 with 40 processors and (3) 5 times faster than 256 BlueGene/L processors on a graph with average degree 50.
Thirteen Ways to Look at the Correlation Coefficient
(2007)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://dv1litvip.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
Unicorn: A System for Searching the Social Graph
(2013)

Unicorn is an online, in-memory social graph-aware indexing system designed to search trillions of edges between tens of billions of users and entities on thousands of commodity servers. Unicorn is based on standard concepts in information retrieval, but it includes features to promote results with good social proximity. It also supports queries that require multiple round-trips to leaves in order to retrieve objects that are more than one edge away from source nodes. Unicorn is designed to answer billions of queries per day at latencies in the hundreds of milliseconds, and it serves as an infrastructural building block for Facebook’s Graph Search product. In this paper, we describe the data model and query language supported by Unicorn. We also describe its evolution as it became the primary backend for Facebook’s search offerings.
The anatomy of a large-scale social search engine
(2010)

We present Aardvark, a social search engine. With Aardvark, users ask a question, either by instant message, email, web input, text message, or voice. Aardvark then routes the question to the person in the user's extended social network most likely to be able to answer that question. As compared to a traditional web search engine, where the challenge lies in finding the right document to satisfy a user's information need, the challenge in a social search engine like Aardvark lies in finding the right person to satisfy a user's information need. Further, while trust in a traditional search engine is based on authority, in a social search engine like Aardvark, trust is based on intimacy. We describe how these considerations inform the architecture, algorithms, and user interface of Aardvark, and how they are reflected in the behavior of Aardvark users.
Bidirectional Expansion For Keyword Search on Graph Databases
(2005)

Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on such graphs has received much attention lately. A central problem in this scenario is to efficiently extract from the data graph a small number of the “best” answer trees. A Backward Expanding search, starting at nodes matching keywords and working up toward confluent roots, is commonly used for predominantly text-driven queries. But it can perform poorly if some keywords match many nodes, or some node has very large degree. In this paper we propose a new search algorithm, Bidirectional Search, which improves on Backward Expanding search by allowing forward search from potential roots towards leaves. To exploit this flexibility, we devise a novel search frontier prioritization technique based on spreading activation. We present a performance study on real data, establishing that Bidirectional Search significantly outperforms Backward Expanding search.
A comparative study of game mechanics and control laws for an adaptive physiological game
(2014)

We present an adaptive biofeedback game that aims to maintain the player’s arousal by modifying game difficulty in response to the player’s physiological state, as measured with wearable sensors. Our approach models the interaction between human physiology and game difficulty during gameplay as a control problem, where game difficulty is the system input and player arousal its output. We validate the approach on a car-racing game with real-time adaptive game mechanics. Specifically, we use (1) car speed, road visibility, and steering jitter as three mechanisms to manipulate game difficulty, (2) electrodermal activity as physiological correlate of arousal, and (3) two types of control law: proportional (P) control, and proportional-integral-derivative (PID) control. We also propose quantitative measures to characterize the effectiveness of these game adaptations and controllers in manipulating the player’s arousal. Experimental trials with 25 subjects in both open-loop (no feedback) and closed-loop (negative feedback) conditions show statistically significant differences in effectiveness among the three game mechanics and also between the two control laws. Specifically, manipulating car speed provides higher control of arousal levels than changing road visibility or vehicle steering. Our results also confirm that PID control leads to lower error and reduced oscillations in the closed-loop response compared to proportional-only control. Finally, we discuss the theoretical and practical implications of our approach.
A summary-statistic representation in peripheral vision explains visual crowding.
(2009)

Peripheral vision provides a less faithful representation of the visual input than foveal vision. Nonetheless, we can gain a lot of information about the world from our peripheral vision, for example in order to plan eye movements. The phenomenon of crowding shows that the reduction of information available in the periphery is not merely the result of reduced resolution. Crowding refers to visual phenomena in which identification of a target stimulus is significantly impaired by the presence of nearby stimuli, or flankers. What information is available in the periphery? We propose that the visual system locally represents peripheral stimuli by the joint statistics of responses of cells sensitive to different position, phase, orientation, and scale. This "textural" representation by summary statistics predicts the subjective "jumble" of features often associated with crowding. We show that the difficulty of performing an identification task within a single pooling region using this representation of the stimuli is correlated with peripheral identification performance under conditions of crowding. Furthermore, for a simple stimulus with no flankers, this representation can be adequate to specify the stimulus with some position invariance. This provides evidence that a unified neuronal mechanism may underlie peripheral vision, ordinary pattern recognition in central vision, and texture perception. A key component of our methodology involves creating visualizations of the information available in the summary statistics of a stimulus. We call these visualizations "mongrels" and show that they are highly useful in examining how the early visual system represents the visual input. Mongrels enable one to study the "equivalence classes" of our model, i.e., the sets of stimuli that map to the same representation according to the model.
Enhancing SDN security for IoT-related deployments through blockchain
(2017)

The majority of business activity of our integrated and connected world takes place in networks based on cloud computing infrastructure that cross national, geographic and jurisdictional boundaries. Such an efficient entity interconnection is made possible through an emerging networking paradigm, Software Defined Networking (SDN) that intends to vastly simplify policy enforcement and network reconfiguration in a dynamic manner. However, despite the obvious advantages this novel networking paradigm introduces, its increased attack surface compared to traditional networking deployments proved to be a thorny issue that creates skepticism when safety-critical applications are considered. Especially when SDN is used to support Internet-of-Things (IoT)-related networking elements, additional security concerns rise, due to the elevated vulnerability of such deployments to specific types of attacks and the necessity of inter-cloud communication any IoT application would require. The overall number of connected nodes makes the efficient monitoring of all entities a real challenge, that must be tackled to prevent system degradation and service outage. This position paper provides an overview of common security issues of SDN when linked to IoT clouds, describes the design principals of the recently introduced Blockchain paradigm and advocates the reasons that render Blockchain as a significant security factor for solutions where SDN and IoT are involved.
Measuring Negative and Positive Thoughts in Children: An Adaptation of the Children’s Automatic Thoughts Scale (CATS)
(2010)

The aim of this study is to describe the factor structure and psychometric properties of an extended version of the Children’s Automatic Thoughts Scale (CATS), the CATS-Negative/Positive (CATS-N/P). The CATS was originally designed to assess negative self-statements in children and adolescents. However, positive thoughts also play a major role in childhood disorders such as anxiety and depression. Therefore, positive self-statements were added to the CATS. The CATS-N/P was administered to a community sample of 554 children aged 8–18 years. The results of a confirmatory factor analysis revealed that the positive self-statements formed a separate and psychometrically sound factor. Internal and short-term test–retest reliability was good. Boys reported more hostile and positive thoughts than girls; and younger children reported more negative thoughts concerning physical threat, social threat, and failure than older children. In conclusion, the results of the current study support the use of the CATS-N/P for the measurement of positive and negative thoughts in children. The application of the CATS-N/P can facilitate further research on cognitive factors in different childhood disorders.
MODIFIED MULTILOOK CROSS CORRELATION ( MLCC ) ALGORITHM FOR DOPPLER CENTROID ESTIMATION IN SYNTHETIC APERTURE RADAR SIGNAL PROCESS -
(2011)

The Multilook Cross Correlation (MLCC) is one of the most reliable algorithms used for Doppler ambiguity number estimation of the Doppler centroid parameter. However, the existing MLCC algorithm is only suitable for low contrast scenes. In high contrast scenes, the estimated result is not reliable, and the error is unacceptable. Besides, the Doppler centroid estimation processing time is long and can only be used in offline processing. In this paper, we introduce a modified MLCC algorithm that has better sensitivity which is suitable not only for low contrast scenes, but also for high contrast scenes. In addition, the modified MLCC algorithm can be implemented on parallel signal processing units for better time efficiency. Experiments with RADARSAT-1 data show that the modified algorithm works well in both high and low contrast scenes.
Author ' s personal copy A new hybrid arti fi cial neural networks for rainfall – runoff process modeling
(2013)

This paper proposes a hybrid intelligent model for runoff prediction. The proposed model is a combination of data preprocessing methods, genetic algorithms and levenberg–marquardt (LM) algorithm for learning feed forward neural networks. Actually it evolves neural network initial weights for tuning with LM algorithm by using genetic algorithm. We also use data pre-processing methods such as data transformation, input variables selection and data clustering for improving the accuracy of the model. The capability of the proposed method is tested by applying it to predict runoff at the Aghchai watershed. The results show that this approach is able to predict runoff more accurately than Artificial Neural Network (ANN) and Adaptive Neuro Fuzzy Inference System (ANFIS) models. & 2013 Elsevier B.V. All rights reserved.
Evaluating the Effect of Total Quality Management Practices on Business Performance : A Study of Manufacturing Firms of Pakistan
(2011)

The present study has evaluated the effect of TQM practices on business performance of manufacturing firms in Pakistan. A sample of 65 managers working in the quality assurance department was taken from these manufacturing firms and their responses were collected using a structured questionnaire. Descriptive statistics were used to demonstrate the effect of different levels of TQM practices on business performance in terms of financial performance, product quality performance, customer satisfaction. The study had also considered organizational level variables like size of firm, year of existence, top management commitment as moderating variables, the results have shown that TQM was implemented only at the first three levels i.e. quality control ,quality assurance and continuous improvement in the selected firms and that top management commitment is the most important variable effecting on TQM implementation which then directly effect on business performance in these manufacturing firms.
Food Balance Estimation by Using Personal Dietary Tendencies in a Multimedia Food Log
(2013)

We have investigated the “FoodLog” multimedia food-recording tool, whereby users upload photographs of their meals and a food diary is constructed using image-processing functions such as food-image detection and food-balance estimation. In this paper, following a brief introduction to FoodLog, we propose a Bayesian framework that makes use of personal dietary tendencies to improve both food-image detection and food-balance estimation. The Bayesian framework facilitates incremental learning. It incorporates three personal dietary tendencies that influence food analysis: likelihood, prior distribution, and mealtime category. In the evaluation of the proposed method using images uploaded to FoodLog, both food-image detection and food-balance estimation are improved. In particular, in the food-balance estimation, the mean absolute error is significantly reduced from 0.69 servings to 0.28 servings on average for two persons using more than 200 personal images, and 0.59 servings to 0.48 servings on average for four persons using 100 personal images. Among the works analyzing food images, this is the first to make use of statistical personal bias to improve the performance of the analysis.
IoT in Agriculture: Designing a Europe-Wide Large-Scale Pilot
(2017)

The technologies associated with the Internet of Things have great potential for application in the domain of food and agriculture, especially in view of the societal and environmental challenges faced by this sector. From farm to fork, IoT technologies could transform the sector, contributing to food safety, and the reduction of agricultural inputs and food waste. A major step toward greater uptake of these technologies will be the execution of IoT-based large-scale pilots (LSPs) in the entire supply chain. This article outlines the challenges and constraints that an LSP deployment of IoT in this domain must consider. Sectoral and technological challenges are described in order to identify a set of technological and agrifood requirements. An architecture based on a system of systems approach is briefly presented, the importance of addressing the interoperability challenges faced by this sector is highlighted, and we elaborate on requirements for new business models, security, privacy, and data governance. A description of the technologies and solutions involved in designing pilots for four agrifood domains (dairy, fruit, arable, meat and vegetable supply chain) is eventually provided. In conclusion, it is noted that for IoT to be successful in this domain, a significant change of culture is needed.
Designed Interdependence, Growing Social Capital and Knowledge Sharing in IS Project Teams
(2015)

This study brings in the task interdependence as the antecedent for growing team social capital and increasing knowledge sharing among team members in IS project context in which heterogeneous members need to interact very closely. Data collected from 203 IS projects largely confirm the proposed research model. Between the task interdependence and team performance, the team social capital as well as the knowledge sharing among members fully mediates the relationship. Interestingly, direct path from task interdependence onto performance is found to be insignificant, rebutting the suggestions of the work design theory which says well designed interdependence directly increase performance in heterogeneous teams. Findings of our study signify the criticality of the mediating roles of social capital and knowledge sharing. Additionally, it is also confirmed that the social capital grows with time. Also, longer term projects revealed a bit different mechanism than shorter ones. Implications are discussed with limitations and further studies.
BAG: Managing GPU as Buffer Cache in Operating Systems
(2014)

This paper presents the design, implementation and evaluation of BAG, a system that manages GPU as the buffer cache in operating systems. Unlike previous uses of GPUs, which have focused on the computational capabilities of GPUs, BAG is designed to explore a new dimension in managing GPUs in heterogeneous systems where the GPU memory is an exploitable but always ignored resource. With the carefully designed data structures and algorithms, such as concurrent hashtable, log-structured data store for the management of GPU memory, and highly-parallel GPU kernels for garbage collection, BAG achieves good performance under various workloads. In addition, leveraging the existing abstraction of the operating system not only makes the implementation of BAG non-intrusive, but also facilitates the system deployment.
Packaging a $W$ -Band Integrated Module With an Optimized Flip-Chip Interconnect on an Organic Substrate
(2014)

This paper, for the first time, presents successful integration of a W-band antenna with an organically flip-chip packaged silicon-germanium (SiGe) low-noise amplifier (LNA). The successful integration requires an optimized flip-chip interconnect. The interconnect performance was optimized by modeling and characterizing the flip-chip transition on a low-loss liquid crystal polymer organic substrate. When the loss of coplanar waveguide (CPW) lines is included, an insertion loss of 0.6 dB per flip-chip-interconnect is measured. If the loss of CPW lines is de-embedded, 0.25 dB of insertion loss is observed. This kind of low-loss flip-chip interconnect is essential for good performance of W-band modules. The module, which we present in this paper, consists of an end-fire Yagi-Uda antenna integrated with an SiGe BiCMOS LNA. The module is 3 mm × 1.9 mm and consumes only 19.2 mW of dc power. We present passive and active E- and H-plane radiation pattern measurements at 87, 90, and 94 GHz. Passive and active antennas both showed a 10-dB bandwidth of 10 GHz. The peak gain of passive and active antennas was 5.2 dBi at 90 GHz and 21.2 dBi at 93 GHz, respectively. The measurements match well with the simulated results.