SoroushVahidi/scidocs huggingface dataset:
Popularity prediction of images and videos on Instagram
(2018)

We live in a world surrounded by numerous social media platforms, applications and websites which produce various texts, images and videos (posts) daily. People share their moments with their friends and families via these tools to keep in touch. This extensiveness of social media has led to an expansion of information in various forms. It is difficult to imagine someone totally unfamiliar with these concepts and not having posted any content on a platform. All users, ranging from individuals to large companies, want to get the most of their audiences' attention. Nevertheless, the problem is that not all these posts are admired and noticed by their audience. Therefore, it would be important to know what characteristics a post should have to become the most popular. Studying this enormous data will develop a knowledge from which we can understand the best way to publish our posts. To this end, we gathered images and videos from Instagram accounts and we used some image/video context features to predict the number of likes a post obtains as a meaning of popularity through some regression and classification methods. By the experiments with 10-fold cross-validation, we get the results of Popularity Score prediction with 0.002 in RMSE and Popularity Class prediction with 90.77% accuracy. As we know, this study is the first exploring of Iranian Instagram users for popularity prediction.
Optimization Using Simulation of Traffic Light Signal Timings
(2013)

Traffic congestion has become a great challenge and a large burden on both the governments and the citizens in vastly populated cities. The main problem, originally initiated by several factors, continues to threaten the stability of modern cities and the livelihood of its habitants. Hence, improving the control strategies that govern the traffic operations is a powerful solution that can solve the congestion problem. These improvements can be achieved by enhancing the traffic control performance through adjusting the traffic signal timings. This paper focuses on finding various solutions for the addressed problem through the optimization using simulation of traffic signal timings under oversaturated conditions. The system under study is an actual road network in Alexandria, Egypt; where, numerous data have been collected in different time intervals. A series of computer simulation models to represent the actual system as well as proposed solutions have been developed using the ExtendSim simulation environment. Furthermore, an evolutionary optimizer is utilized to attain a set of optimum/near-optimum signal timings to minimize the total time in system of the vehicles, resulting in an improved performance of the road network. Analysis of experimentation results shows that the adopted methodology optimizes the vehicular flow in a multiple-junction urban traffic network.
Emergence of neural encoding of auditory objects while listening to competing speakers.
(2012)

A visual scene is perceived in terms of visual objects. Similar ideas have been proposed for the analogous case of auditory scene analysis, although their hypothesized neural underpinnings have not yet been established. Here, we address this question by recording from subjects selectively listening to one of two competing speakers, either of different or the same sex, using magnetoencephalography. Individual neural representations are seen for the speech of the two speakers, with each being selectively phase locked to the rhythm of the corresponding speech stream and from which can be exclusively reconstructed the temporal envelope of that speech stream. The neural representation of the attended speech dominates responses (with latency near 100 ms) in posterior auditory cortex. Furthermore, when the intensity of the attended and background speakers is separately varied over an 8-dB range, the neural representation of the attended speech adapts only to the intensity of that speaker but not to the intensity of the background speaker, suggesting an object-level intensity gain control. In summary, these results indicate that concurrent auditory objects, even if spectrotemporally overlapping and not resolvable at the auditory periphery, are neurally encoded individually in auditory cortex and emerge as fundamental representational units for top-down attentional modulation and bottom-up neural adaptation.
The NASD Securities Observation , News Analysis & Regulation System ( SONAR )
(2003)

The Securities Observation, News Analysis, and Regulation (SONAR) system was developed by NASD to monitor the Nasdaq, Over the Counter (OTC), and Nasdaq-Liffe (futures) stock markets for potential insider trading and fraud through misrepresentation. SONAR has been in operational use at NASD since December 2001, processing approximately 10,000 news wires stories and SEC filings, evaluating price/volume models for 25,000 securities, and generating 50-60 alerts (or “breaks”) per day for review by several groups of regulatory analysts and investigators. In addition, SONAR has greatly expanded surveillance coverage to new areas of the market and increased accuracy significantly over an earlier break detection system. SONAR makes use of several AI and statistical techniques, including NLP text mining, statistical regression, rule-based inference, uncertainty, and fuzzy matching. Sonar combines these enabling technologies in a system designed to deliver a steady stream of high-quality breaks to the analysts for further investigation. Additional components including visualization, text search agents, and flexible displays add to the system’s utility. Finally, SONAR is designed as a knowledge-based system. Domain knowledge is maintained by knowledge engineers working closely with the regulatory analysts. In this way, SONAR is adaptable to new market conditions, data sources, and regulatory concerns.
In Defense of Single-column Networks for Crowd Counting
(2018)

Crowd counting usually addressed by density estimation becomes an increasingly important topic in computer vision due to its widespread applications in video surveillance, urban planning, and intelligence gathering. However, it is essentially a challenging task because of the greatly varied sizes of objects, coupled with severe occlusions and vague appearance of extremely small individuals. Existing methods heavily rely on multi-column learning architectures to extract multi-scale features, which however suffer from heavy computational cost, especially undesired for crowd counting. In this paper, we propose the single-column counting network (SCNet) for efficient crowd counting without relying on multi-column networks. SCNet consists of residual fusion modules (RFMs) for multi-scale feature extraction, a pyramid pooling module (PPM) for information fusion, and a sub-pixel convolutional module (SPCM) followed by a bilinear upsampling layer for resolution recovery. Those proposed modules enable our SCNet to fully capture multi-scale features in a compact single-column architecture and estimate high-resolution density map in an efficient way. In addition, we provide a principled paradigm for density map generation and data augmentation for training, which shows further improved performance. Extensive experiments on three benchmark datasets show that our SCNet delivers new state-of-the-art performance and surpasses previous methods by large margins, which demonstrates the great effectiveness of SCNet as a singlecolumn network for crowd counting. c © 2018. The copyright of this document resides with its authors. It may be distributed unchanged freely in print or electronic forms. *Equal contribution 2 WANG et al.: IN DEFENSE OF SINGLE-COLUMN NETWORKS FOR CROWD COUNTING
What Users Ask a Search Engine: Analyzing One Billion Russian Question Queries
(2015)

We analyze the question queries submitted to a large commercial web search engine to get insights about what people ask, and to better tailor the search results to the users' needs. Based on a dataset of about one billion question queries submitted during the year 2012, we investigate askers' querying behavior with the support of automatic query categorization. While the importance of question queries is likely to increase, at present they only make up 3-4% of the total search traffic.
 Since questions are such a small part of the query stream, and are more likely to be unique than shorter queries, click-through information is typically rather sparse. Thus, query categorization methods based on the categories of clicked web documents do not work well for questions. As an alternative, we propose a robust question query classification method that uses the labeled questions from a large community question answering platform (CQA) as a training set. The resulting classifier is then transferred to the web search questions. Even though questions on CQA platforms tend to be different to web search questions, our categorization method proves competitive with strong baselines with respect to classification accuracy.
 To show the scalability of our proposed method we apply the classifiers to about one billion question queries and discuss the trade-offs between performance and accuracy that different classification models offer.
Cache-Conscious Data Placement
(1998)

As the gap between memory and processor speeds continues to widen, cache eficiency is an increasingly important component of processor performance. Compiler techniques have been used to improve instruction cache pet$ormance by mapping code with temporal locality to different cache blocks in the virtual address space eliminating cache conflicts. These code placement techniques can be applied directly to the problem of placing data for improved data cache pedormance.In this paper we present a general framework for Cache Conscious Data Placement. This is a compiler directed approach that creates an address placement for the stack (local variables), global variables, heap objects, and constants in order to reduce data cache misses. The placement of data objects is guided by a temporal relationship graph between objects generated via profiling. Our results show that profile driven data placement significantly reduces the data miss rate by 24% on average.
Approaches to Interpreter Composition
(2015)

In this paper, we compose six different Python and Prolog VMs into 4 pairwise compositions: one using C interpreters; one running on the JVM; one using meta-tracing interpreters; and one using a C interpreter and a meta-tracing interpreter. We show that programs that cross the language barrier frequently execute faster in a meta-tracing composition, and that meta-tracing imposes a significantly lower overhead on composed programs relative to mono-language programs.
A framework for efficient network anomaly intrusion detection with features selection
(2018)

An intrusion Detection System (IDS) provides alarts against intrusion attacks where a traditional firewall fails. Machine learning algorithms aim to detect anomalies using supervised and unsupervised approaches. Features selection techniques identify important features and remove irrelevant and redundant attributes to reduce the dimensionality of feature space. This paper presents a features selection framework for efficient network anomaly detection using different machine learning classifiers. The framework applies different strategies by using filter and wrapper features selection methodologies. The aim of this framework is to select the minimum number of features that achieve the highest accuracy. UNSW-NB15 dataset is used in the experimental results to evaluate the proposed framework. The results show that by using 18 features from one of the filter ranking methods and applying J48 as a classifier, an accuracy of 88% is achieved.
Application-specific resource provisioning for wide-area distributed computing
(2010)

Some modern distributed applications require cooperation among multiple geographically separated computing facilities to perform intensive computing at the end sites and large-scale data transfers in the wide area network. It has been widely recognized that WDM networks are cost-effective means to support data transfers in this type of data-intensive applications. However, neither the traditional approaches to establishing lightpaths between given source destination pairs nor the existing application-level approaches that only consider computing resources but take the underlying connectivity for granted are sufficient. In this article we identify key limitations and issues in existing systems, and focus on joint resource allocation of both computing resources and network resources in federated computing and network systems. A variety of resource allocation schemes that provide modern distributed computing applications with performance and reliability guarantees are presented.
The Multidimensional Work Motivation Scale : Validation evidence in seven languages and nine countries
(2014)

The Multidimensional Work Motivation Scale: Validation evidence in seven languages and nine countries Marylène Gagné, Jacques Forest, Maarten Vansteenkiste, Laurence Crevier-Braud, Anja Van den Broeck, Ann Kristin Aspeli, Jenny Bellerose, Charles Benabou, Emanuela Chemolli, Stefan Tomas Güntert, Hallgeir Halvari, Devani Laksmi Indiyastuti, Peter A. Johnson, Marianne Hauan Molstad, Mathias Naudin, Assane Ndao, Anja Hagen Olafsen, Patrice Roussel, Zheni Wang & Cathrine Westbye a School of Psychology, University of Western Australia, Perth, Australia b Department of Organization and Human Resource Management, UQAM School of Management Sciences, Université du Québec à Montréal, Montréal, Canada c Department of Developmental, Personality and Social Psychology, University of Gent, Gent, Belgium d Department of Psychology, Université du Québec à Montréal, Montréal, Canada e Department of Economy and Management, Hogeschool Universiteit Brussel, Brussels, and KU Leuven, Leuven, Belgium f Faculty of Economics and Social Science, Høgskolen i Buskerud og Vestfold, Kongsberg, Norway g Department of Psychology, Université de Montréal, Montréal, Canada h Psychology of Work in Organization and Society Research Group, Swiss Federal Institute of Technology, Zurich, Switzerland i Faculty of Economics and Business, Universitas Gadjah Mada, Yogyakarta, Indonesia j Institute of Work Psychology, University of Sheffield, Sheffield, United Kingdom k International Institute of Commerce and Development, Université Panthéon Assas — Paris II, Paris, France l Faculty of Economics and Management Sciences, Université Cheikh Anta DIOP, Dakkar, Sénégal m Department of Management and Human Resources, Université Toulouse 1, Toulouse, France Published online: 05 Feb 2014.
Beyond budgeting and Agile Software Development: a Conceptual Framework for the Performance Management of Agile Software Development Teams
(2010)

Around the same time as the emergence of agile methods as a formalized concept, the management accounting literature introduced the concept of Beyond Budgeting as a performance management model for changing business environments. Both concepts share many similarities with both having a distinctly agile or adaptive perspective. The Beyond Budgeting model promises to enable companies to keep pace with changing business environments, quickly create and adapt strategy and empower people throughout the organization to make effective changes. This research in progress paper attempts to develop the Beyond Budgeting model within the context of agile software development teams. The twelve Beyond Budgeting principles are discussed and a research framework is presented. This framework is being used in two case studies to investigate the organizational issues and challenges that affect the performance of agile software
Using Recurrent Neural Networks for Slot Filling in Spoken Language Understanding
(2015)

Semantic slot filling is one of the most challenging problems in spoken language understanding (SLU). In this paper, we propose to use recurrent neural networks (RNNs) for this task, and present several novel architectures designed to efficiently model past and future temporal dependencies. Specifically, we implemented and compared several important RNN architectures, including Elman, Jordan, and hybrid variants. To facilitate reproducibility, we implemented these networks with the publicly available Theano neural network toolkit and completed experiments on the well-known airline travel information system (ATIS) benchmark. In addition, we compared the approaches on two custom SLU data sets from the entertainment and movies domains. Our results show that the RNN-based models outperform the conditional random field (CRF) baseline by 2% in absolute error reduction on the ATIS benchmark. We improve the state-of-the-art by 0.5% in the Entertainment domain, and 6.7% for the movies domain.
MPNET: An End-to-End Deep Neural Network for Object Detection in Surveillance Video
(2018)

Object detection is one of the most important topics in computer vision task and has obtained impressive performance thanks to the use of deep convolutional neural network. For object detection, especially in still image, it has achieved excellent performance during past two years, such as the series of R-CNN which plays a vital role in improving performance. However, with the number of surveillance videos increasing, the current methods may not meet the growing demand. In this paper, we propose a new framework named moving-object proposals generation and prediction framework (MPGP) to reduce the searching space and generate some accurate proposals which can reduce computational cost. In addition, we explore the relation of moving regions in feature map of different layers and predict candidates according to the results of previous frames. Last but not least, we utilize spatial-temporal information to strengthen the detection score and further adjust the location of the bounding boxes. Our MPGP framework can be applied to different region-based networks. Experiments on CUHK data set, XJTU data set, and AVSS data set, show that our approach outperforms the state-of-the-art approaches.
Lifetime Portfolio Selection By Dynamic Stochastic Programming
(2008)

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.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.
Advocating an ethical memory model for artificial companions from a human-centred perspective
(2010)

This paper considers the ethical implications of applying three major ethical theories to the memory structure of an artificial companion that might have different embodiments such as a physical robot or a graphical character on a hand-held device. We start by proposing an ethical memory model and then make use of an action-centric framework to evaluate its ethical implications. The case that we discuss is that of digital artefacts that autonomously record and store user data, where this data are used as a resource for future interaction with users.
Efficiently exploring architectural design spaces via predictive modeling
(2006)

Architects use cycle-by-cycle simulation to evaluate design choices and understand tradeoffs and interactions among design parameters. Efficiently exploring exponential-size design spaces with many interacting parameters remains an open problem: the sheer number of experiments renders detailed simulation intractable. We attack this problem via an automated approach that builds accurate, confident predictive design-space models. We simulate sampled points, using the results to teach our models the function describing relationships among design parameters. The models produce highly accurate performance estimates for other points in the space, can be queried to predict performance impacts of architectural changes, and are very fast compared to simulation, enabling efficient discovery of tradeoffs among parameters in different regions. We validate our approach via sensitivity studies on memory hierarchy and CPU design spaces: our models generally predict IPC with only 1-2% error and reduce required simulation by two orders of magnitude. We also show the efficacy of our technique for exploring chip multiprocessor (CMP) design spaces: when trained on a 1% sample drawn from a CMP design space with 250K points and up to 55x performance swings among different system configurations, our models predict performance with only 4-5% error on average. Our approach combines with techniques to reduce time per simulation, achieving net time savings of three-four orders of magnitude.
Adaptive Neuro-Fuzzy Inference System based speed controller for brushless DC motor
(2014)

In this paper, a novel controller for brushless DC (BLDC) motor has been presented. The proposed controller is based on Adaptive Neuro-Fuzzy Inference System (ANFIS) and the rigorous analysis through simulation is performed using simulink tool box in MATLAB environment. The performance of the motor with proposed ANFIS controller is analyzed and compared with classical Proportional Integral (PI) controller, Fuzzy Tuned PID controller and Fuzzy Variable Structure controller. The dynamic characteristics of the brushless DC motor is observed and analyzed using the developed MATLAB/simulink model. Control system response parameters such as overshoot, undershoot, rise time, recovery time and steady state error are measured and compared for the above controllers. In order to validate the performance of the proposed controller under realistic working environment, simulation result has been obtained and analyzed for varying load and varying set speed conditions. & 2014 Elsevier B.V. All rights reserved.
A preamplifier-latch comparator for high accuracy high speed switched-capacitors pipelined ADC
(2014)

In this paper, a gain-boosting preamplifier-latch comparator with minimum input referred offset voltage is proposed. The preamplifier utilizes telescope structure with cross-coupled active loading, which enhances the gain of preamplifier. In order to minimize the delay time of comparator, the input DC range and the ratio of PMOS/NMOS are selected carefully. The circuit is fabricated in TSMC 0.18um with 1.8V power supply.
Least-Squares Fitting of Two 3-D Point Sets
(1987)

Two point sets {pi} and {p'i}; i = 1, 2,..., N are related by p'i = Rpi + T + Ni, where R is a rotation matrix, T a translation vector, and Ni a noise vector. Given {pi} and {p'i}, we present an algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 × 3 matrix. This new algorithm is compared to two earlier algorithms with respect to computer time requirements.
Area-Preservation Mapping using Optimal Mass Transport
(2013)

We present a novel area-preservation mapping/flattening method using the optimal mass transport technique, based on the Monge-Brenier theory. Our optimal transport map approach is rigorous and solid in theory, efficient and parallel in computation, yet general for various applications. By comparison with the conventional Monge-Kantorovich approach, our method reduces the number of variables from O(n2) to O(n), and converts the optimal mass transport problem to a convex optimization problem, which can now be efficiently carried out by Newton's method. Furthermore, our framework includes the area weighting strategy that enables users to completely control and adjust the size of areas everywhere in an accurate and quantitative way. Our method significantly reduces the complexity of the problem, and improves the efficiency, flexibility and scalability during visualization. Our framework, by combining conformal mapping and optimal mass transport mapping, serves as a powerful tool for a broad range of applications in visualization and graphics, especially for medical imaging. We provide a variety of experimental results to demonstrate the efficiency, robustness and efficacy of our novel framework.