SoroushVahidi/scidocs huggingface dataset:
Artificial Neural Networks Applied to Taxi Destination Prediction
(2015)

We describe our first-place solution to the ECML/PKDD discovery challenge on taxi destination prediction. The task consisted in predicting the destination of a taxi based on the beginning of its trajectory, represented as a variable-length sequence of GPS points, and diverse associated meta-information, such as the departure time, the driver id and client information. Contrary to most published competitor approaches, we used an almost fully automated approach based on neural networks and we ranked first out of 381 teams. The architectures we tried use multi-layer perceptrons, bidirectional recurrent neural networks and models inspired from recently introduced memory networks. Our approach could easily be adapted to other applications in which the goal is to predict a fixed-length output from a variable-length sequence. Random order, this does not reflect the weights of contributions. ar X iv :1 50 8. 00 02 1v 2 [ cs .L G ] 2 1 Se p 20 15 2 Artificial Neural Networks Applied to Taxi Destination Prediction
Data Compression Techniques in Wireless Sensor Networks
(2010)

Wireless sensor networks (WSNs) open a new research field for pervasive computing and context-aware monitoring of the physical environments. Many WSN applications aim at long-term environmental monitoring. In these applications, energy consumption is a principal concern because sensor nodes have to regularly report their sensing data to the remote sink(s) for a very long time. Since data transmission is one primary factor of the energy consumption of sensor nodes, many research efforts focus on reducing the amount of data transmissions through data compression techniques. In this chapter, we discuss the data compression techniques in WSNs, which can be classified into five categories: 1) The string-based compression techniques treat sensing data as a sequence of characters and then adopt the text data compression schemes to compress them. 2) The image-based compression techniques hierarchically organize WSNs and then borrow the idea from the image compression solutions to handle sensing data. 3) The distributed source coding techniques extend the Slepian-Wolf theorem to encode multiple correlated data streams independently at sensor nodes and then jointly decode them at the sink. 4) The compressed sensing techniques adopt a small number of nonadaptive and randomized linear projection samples to compress sensing data. 5) The data aggregation techniques select a subset of sensor nodes in the network to be responsible for fusing the sensing data from other sensor nodes to reduce the amount of data transmissions. A comparison of these data compression techniques is also given in this chapter.
A meta-analysis of human-system interfaces in unmanned aerial vehicle (UAV) swarm management.
(2017)

A meta-analysis was conducted to systematically evaluate the current state of research on human-system interfaces for users controlling semi-autonomous swarms composed of groups of drones or unmanned aerial vehicles (UAVs). UAV swarms pose several human factors challenges, such as high cognitive demands, non-intuitive behavior, and serious consequences for errors. This article presents findings from a meta-analysis of 27 UAV swarm management papers focused on the human-system interface and human factors concerns, providing an overview of the advantages, challenges, and limitations of current UAV management interfaces, as well as information on how these interfaces are currently evaluated. In general allowing user and mission-specific customization to user interfaces and raising the swarm's level of autonomy to reduce operator cognitive workload are beneficial and improve situation awareness (SA). It is clear more research is needed in this rapidly evolving field.
Teaching Programming in Secondary Education Through Embodied Computing Platforms: Robotics and Wearables
(2017)

Pedagogy has emphasized that physical representations and tangible interactive objects benefit learning especially for young students. There are many tangible hardware platforms for introducing computer programming to children, but there is limited comparative evaluation of them in the context of a formal classroom. In this work, we explore the benefits of learning to code for tangible computers, such as robots and wearable computers, in comparison to programming for the desktop computer. For this purpose, 36 students participated in a within-groups study that involved three types of target computer platform tangibility: (1) desktop, (2) wearable, and (3) robotic. We employed similar blocks-based visual programming environments, and we measured emotional engagement, attitudes, and computer programming performance. We found that students were more engaged by and had a higher intention of learning programming with the robotic rather than the desktop computer. Furthermore, tangible computing platforms, either robot or wearable, did not affect the students’ performance in learning basic computational concepts (e.g., sequence, repeat, and decision). Our findings suggest that computer programming should be introduced through multiple target platforms (e.g., robots, smartphones, wearables) to engage children.
A Dynamic Programming Algorithm for Computing N-gram Posteriors from Lattices
(2015)

Efficient computation of n-gram posterior probabilities from lattices has applications in lattice-based minimum Bayes-risk decoding in statistical machine translation and the estimation of expected document frequencies from spoken corpora. In this paper, we present an algorithm for computing the posterior probabilities of all ngrams in a lattice and constructing a minimal deterministic weighted finite-state automaton associating each n-gram with its posterior for efficient storage and retrieval. Our algorithm builds upon the best known algorithm in literature for computing ngram posteriors from lattices and leverages the following observations to significantly improve the time and space requirements: i) the n-grams for which the posteriors will be computed typically comprises all n-grams in the lattice up to a certain length, ii) posterior is equivalent to expected count for an n-gram that do not repeat on any path, iii) there are efficient algorithms for computing n-gram expected counts from lattices. We present experimental results comparing our algorithm with the best known algorithm in literature as well as a baseline algorithm based on weighted finite-state automata operations.
Magnet design based on transient behavior of an IPMSM in event of malfunction
(2014)

This paper deals with the approach of analyzing the magnet design based on transient behavior of an IPMSM during switching processes in the event of malfunction for automotive applications. Depending on the maximal current increase during the transient process the needed percentage of Dysprosium for the magnet design is conducted. Switching off strategy is introduced for both Voltage-Source- and Current-Source-Inverter for automotive application. Both inverters are compared concerning the transient current increase and respectively the Dy-content for the magnet design.
NAIDS design using ChiMIC-KGS
(2017)

The tasks of IDS is to detect activities in the form of intrusion by unauthorized parties which attempt to gain access to information unlawfully in a network environment. Changes in intrusion strategies affect the behavior of networks where the representation of network traffic data changes over time. The nature of the network data has high volume and dimension and contains redundancy. This study proposes the use of ChiMIC as a method to reduce redundancy features and select the relevant features to be used in detecting anomalies on the network, where KGS is used as an anomaly detection engine. Both approach are used to build NAIDS that has capabilities to detect the emergence of new attacks over time.
Supply Chain Management ( SCM ) and Organizational Key Factors for Successful Implementation of Enterprise Resource Planning ( ERP ) Systems
(1999)

This paper reports some findings of an on-going research into ERP implementation issues. A part of the research, which this paper reports, consists of reviewing several cases of successful implementations of ERP systems. The analysis of all these cases revealed that the critical factors for successful implementation of ERP systems fall into two main categories: technological and organizational factors. However, the organizational factors seem to be more important than the technological ones as far as the successful implementation of ERP systems under SCM is concerned.
Semantically Smooth Knowledge Graph Embedding
(2015)

This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric structure of the embedding space, we propose Semantically Smooth Embedding (SSE). The key idea of SSE is to take full advantage of additional semantic information and enforce the embedding space to be semantically smooth, i.e., entities belonging to the same semantic category will lie close to each other in the embedding space. Two manifold learning algorithms Laplacian Eigenmaps and Locally Linear Embedding are used to model the smoothness assumption. Both are formulated as geometrically based regularization terms to constrain the embedding task. We empirically evaluate SSE in two benchmark tasks of link prediction and triple classification, and achieve significant and consistent improvements over state-of-the-art methods. Furthermore, SSE is a general framework. The smoothness assumption can be imposed to a wide variety of embedding models, and it can also be constructed using other information besides entities’ semantic categories.
Automatic Chinese food identification and quantity estimation
(2012)

Computer-aided food identification and quantity estimation have caught more attention in recent years because of the growing concern of our health. The identification problem is usually defined as an image categorization or classification problem and several researches have been proposed. In this paper, we address the issues of feature descriptors in the food identification problem and introduce a preliminary approach for the quantity estimation using depth information. Sparse coding is utilized in the SIFT and Local binary pattern feature descriptors, and these features combined with gabor and color features are used to represent food items. A multi-label SVM classifier is trained for each feature, and these classifiers are combined with multi-class Adaboost algorithm. For evaluation, 50 categories of worldwide food are used, and each category contains 100 photographs from different sources, such as manually taken or from Internet web albums. An overall accuracy of 68.3% is achieved, and success at top-N candidates achieved 80.6%, 84.8%, and 90.9% accuracy accordingly when N equals 2, 3, and 5, thus making mobile application practical. The experimental results show that the proposed methods greatly improve the performance of original SIFT and LBP feature descriptors. On the other hand, for quantity estimation using depth information, a straight forward method is proposed for certain food, while transparent food ingredients such as pure water and cooked rice are temporarily excluded.
Implementation and Performance Analysis of Firewall on Open vSwitch
(2015)

Software Defined Networking (SDN) is a current research trend that follows the ideology of physical separation of the control and data plane of the forwarding devices. SDN mainly advocates with two types of devices: (1) Controllers, that implement the control plane and (2) Switches, that perform the data plane operations. OpenFlow protocol (OFP) is the current standard through which controllers and switches can communicate with each other. Using OpenFlow, SDN controllers can manage forwarding behaviors of SDN switches by managing Flow Table entries. Switches use these low-level Flow Table entries to forward packets to appropriate hosts. Firewalls are integral part of today’s networks. We can’t imagine our network without a Firewall which protects our network from potential threats. As SDN is getting pace in replacing traditional architecture, it would be very interesting to see how much security features can be provided by OpenFlow-enabled switches. Hence, it will be very important to see if SDN, on the top of OpenFlow, can efficiently implement Firewalls and provides support for an advanced feature like connection tracking. The task is straightforward: Controller will add Flow Table entries on switches based upon Firewall rules. Such way, we can enhance packet-processing by providing security. In this Document, one strategy for implementing Firewall on SDN is presented. We can write some controller applications that work as Firewall and inspect incoming packets against the Firewall rules. These applications are also able to implement connection tracking mechanism. As SDN devices for the experiments, we selected Ryu controller and Open vSwitch. Initially, such applications are tested on local machine with small Firewall ruleset. Later, they are tested with real-world traffic and comparatively large Firewall ruleset. The testing results present that such strategy can be used as a first step in implementing security features (including connection tracking) in SDN environment.
Predicting and analyzing secondary education placement-test scores: A data mining approach
(2012)

Understanding the factors that lead to success (or failure) of students at placement tests is an interesting and challenging problem. Since the centralized placement tests and future academic achievements are considered to be related concepts, analysis of the success factors behind placement tests may help understand and potentially improve academic achievement. In this study using a large and feature rich dataset from Secondary Education Transition System in Turkey we developed models to predict secondary education placement test results, and using sensitivity analysis on those prediction models we identified the most important predictors. The results showed that C5 decision tree algorithm is the best predictor with 95% accuracy on hold-out sample, followed by support vector machines (with an accuracy of 91%) and artificial neural networks (with an accuracy of 89%). Logistic regression models came out to be the least accurate of the four with and overall accuracy of 82%. The sensitivity analysis revealed that previous test experience, whether a student has a scholarship, student’s number of siblings, previous years’ grade point average are among the most important predictors of the placement test scores. 2012 Elsevier Ltd. All rights reserved.
A Data Mining view on Class Room Teaching Language
(2011)

From ancient period in India, educational institution embarked to use class room teaching. Where a teacher explains the material and students understand and learn the lesson. There is no absolute scale for measuring knowledge but examination score is one scale which shows the performance indicator of students. So it is important that appropriate material is taught but it is vital that while teaching which language is chosen, class notes must be prepared and attendance. This study analyses the impact of language on the presence of students in class room. The main idea is to find out the support, confidence and interestingness level for appropriate language and attendance in the classroom. For this purpose association rule is used.
Gray level image processing using contrast enhancement and watershed segmentation with quantitative evaluation
(2008)

Both image enhancement and image segmentation are most practical approaches among virtually all automated image recognition systems. Feature extraction and recognition have numerous applications on telecommunication, weather forecasting, environment exploration and medical diagnosis. The adaptive image contrast stretching is a typical image enhancement approach and watershed segmentation is a typical image segmentation approach. Under conditions of an improper or disturbed illumination, the adaptive contrast stretching should be conducted, which adapts to intensity distributions. Watershed segmentation is a feasible approach to separate different objects automatically, where watershed lines separate the catchment basins. The erosion and dilation operations are essential procedures involved in watershed segmentation. To avoid over-segmentation, the markers for foreground and background can be selected accordingly. Quantitative measures (gray level energy, discrete entropy, relative entropy and mutual information) are proposed to evaluate the actual improvement via two techniques. These methodologies can be easily expanded to many other image processing approaches.
Grassmannian beamforming for multiple-input multiple-output wireless systems
(2003)

Transmit and receive beamforming is an attractive, low-complexity technique for exploiting the significant diversity that is available in multiple-input and multiple-output (MIMO) wireless systems. Unfortunately, optimal performance requires either complete channel knowledge or knowledge of the optimal beamforming vector which is difficult to realize in practice. In this paper, we propose a quantized maximum signal-to-noise ratio beamforming technique where the receiver only sends the label of the best weight vector in a predetermined codebook to the transmitter. We develop optimal codebooks for i.i.d. Rayleigh fading matrix channels. We derive the distribution of the optimal transmit weight vector and use this result to bound the SNR degradation as a function of the quantization. A codebook design criterion is proposed by exploiting the connections between the quantization problem and Grassmannian line packing. The design criterion is flexible enough to allow for side constraints on the codebook vectors. Bounds on the maximum distortion with the resulting Grassmannian codebooks follow naturally from the nature of the code. A proof is given that any system using an overcomplete codebook for transmit diversity and maximum ratio combining obtains a diversity on the order of the product of the number of transmit and receive antennas. Bounds on the loss in capacity due to quantization are derived. Monte Carlo simulations are presented that compare the symbol error probability for different quantization strategies.
Efficient Memory Disaggregation with Infiniswap
(2017)

Memory-intensive applications suffer large performance loss when their working sets do not fully fit in memory. Yet, they cannot leverage otherwise unused remote memory when paging out to disks even in the presence of large imbalance in memory utilizations across a cluster. Existing proposals for memory disaggregation call for new architectures, new hardware designs, and/or new programming models, making them infeasible. This paper describes the design and implementation of INFINISWAP, a remote memory paging system designed specifically for an RDMA network. INFINISWAP opportunistically harvests and transparently exposes unused memory to unmodified applications by dividing the swap space of each machine into many slabs and distributing them across many machines’ remote memory. Because one-sided RDMA operations bypass remote CPUs, INFINISWAP leverages the power of many choices to perform decentralized slab placements and evictions. We have implemented and deployed INFINISWAP on an RDMA cluster without any modifications to user applications or the OS and evaluated its effectiveness using multiple workloads running on unmodified VoltDB, Memcached, PowerGraph, GraphX, and Apache Spark. Using INFINISWAP, throughputs of these applications improve between 4× (0.94×) to 15.4× (7.8×) over disk (Mellanox nbdX), and median and tail latencies between 5.4× (2×) and 61× (2.3×). INFINISWAP achieves these with negligible remote CPU usage, whereas nbdX becomes CPU-bound. INFINISWAP increases the overall memory utilization of a cluster and works well at scale.
Hate Source : White Supremacist Hate Groups and Hate Crime
(2011)

The relationship between hate group activity and hate crime is theoretically ambiguous. Hate groups may incite criminal behavior in support of their beliefs. On the other hand, hate groups may reduce hate crime by serving as a forum for members to verbally vent their frustrations or as protection from future biased violence. I nd that the presence of an active white supremacist hate group chapter is associated with an 18.7 percent higher hate crime rate. White supremacist groups are not associated with the level of anti-white hate crimes committed by non-whites, nor do they form in expectation of future hate crimes by non-whites. JEL Codes: K14, J15, D71
Relating Newcomer Personality to Survival and Activity in Recommender Systems
(2016)

In this work, we explore the degree to which personality information can be used to model newcomer retention, investment, intensity of engagement, and distribution of activity in a recommender community. Prior work shows that Big-Five Personality traits can explain variation in user behavior in other contexts. Building on this, we carry out and report on an analysis of 1008 MovieLens users with identified personality profiles. We find that Introverts and low Agreeableness users are more likely to survive into the second and subsequent sessions compared to their respective counterparts; Introverts and low Conscientiousness users are a significantly more active population compared to their respective counterparts; High Openness and High Neuroticism users contribute (tag) significantly more compared to their counterparts, but their counterparts consume (browse and bookmark) more; and low Agreeableness users are more likely to rate whereas high Agreeableness users are more likely to tag. These results show how modeling newcomer behavior from user personality can be useful for recommender systems designers as they customize the system to guide people towards tasks that need to be done or tasks the users will find rewarding and also decide which users to invest retention efforts in.
Stealthy Denial of Service Strategy in Cloud Computing
(2015)

The success of the cloud computing paradigm is due to its on-demand, self-service, and pay-by-use nature. According to this paradigm, the effects of Denial of Service (DoS) attacks involve not only the quality of the delivered service, but also the service maintenance costs in terms of resource consumption. Specifically, the longer the detection delay is, the higher the costs to be incurred. Therefore, a particular attention has to be paid for stealthy DoS attacks. They aim at minimizing their visibility, and at the same time, they can be as harmful as the brute-force attacks. They are sophisticated attacks tailored to leverage the worst-case performance of the target system through specific periodic, pulsing, and low-rate traffic patterns. In this paper, we propose a strategy to orchestrate stealthy attack patterns, which exhibit a slowly-increasing-intensity trend designed to inflict the maximum financial cost to the cloud customer, while respecting the job size and the service arrival rate imposed by the detection mechanisms. We describe both how to apply the proposed strategy, and its effects on the target system deployed in the cloud.