SoroushVahidi/scidocs huggingface dataset:
Applications of Data Mining Techniques in TelecomChurn Prediction
(2012)

In this competitive world, business becomes highly saturated. Especially, the field of telecommunication faces complex challenges due to a number of vibrant competitive service providers. Therefore it has become very difficult for them to retain existing customers. Since the cost of acquiring new customers is much higher than the cost of retaining the existing customers, it is the time for the telecom industries to take necessary steps to retain the customers to stabilize their market value. This paper explores the application of data mining techniques in predicting likely churners and the impact of attribute selection on identifying the churn. It also compares the efficiency of Decision tree and Neural Network classifiers and lists their performances.
Intelligent criminal identification system
(2013)

In many countries the amount of crime incidents that is reported per day is increasing dramatically. Concerning about Sri Lanka, The department of Police is the major organization of preventing crimes. In general, Sri Lankan police stations utilize paper-based information storing systems and they don't employ computer based applications up to a great extent. Due to this utilization of paper-based systems police officers have to spend a lot of time as well as man power to analyze existing crime information and to identify suspects for crime incidents. So the requirement of an efficient way for crime investigation has arisen. Data mining practices is one aspect of crime investigation, for which numerous technique are available. This paper highlights the use of data mining techniques, clustering and classification for effective investigation of crimes. Further the paper aims to identify suspects by analyzing existing evidences in situations where any witness or forensic clues are not present.
Intelligent Tutoring Systems and Learning Outcomes : A Meta-Analysis
(2015)

Intelligent Tutoring Systems (ITS) are computer programs that model learners’ psychological states to provide individualized instruction. They have been developed for diverse subject areas (e.g., algebra, medicine, law, reading) to help learners acquire domain-specific, cognitive and metacognitive knowledge. A meta-analysis was conducted on research that compared the outcomes from students learning from ITS to those learning from non-ITS learning environments. The meta-analysis examined how effect sizes varied with type of ITS, type of comparison treatment received by learners, type of learning outcome, whether knowledge to be learned was procedural or declarative, and other factors. After a search of major bibliographic databases, 107 effect sizes involving 14,321 participants were extracted and analyzed. The use of ITS was associated with greater achievement in comparison with teacher-led, large-group instruction (g .42), non-ITS computer-based instruction (g .57), and textbooks or workbooks (g .35). There was no significant difference between learning from ITS and learning from individualized human tutoring (g –.11) or small-group instruction (g .05). Significant, positive mean effect sizes were found regardless of whether the ITS was used as the principal means of instruction, a supplement to teacher-led instruction, an integral component of teacher-led instruction, or an aid to homework. Significant, positive effect sizes were found at all levels of education, in almost all subject domains evaluated, and whether or not the ITS provided feedback or modeled student misconceptions. The claim that ITS are relatively effective tools for learning is consistent with our analysis of potential publication bias.
Kalman filtering over a packet-delaying network: A probabilistic approach
(2009)

In this paper, we consider Kalman filtering over a packet-delaying network. Given the probability distribution of the delay, we can characterize the filter performance via a probabilistic approach. We assume that the estimator maintains a buffer of length D so that at each time k, the estimator is able to retrieve all available data packets up to time k−D+1. Both the cases of sensorwith andwithout necessary computation capability for filter updates are considered. When the sensor has no computation capability, for a givenD, we give lower and upper bounds on the probability forwhich the estimation error covariance is within a prescribed bound. When the sensor has computation capability, we show that the previously derived lower and upper bounds are equal to each other. An approach for determining the minimum buffer length for a required performance in probability is given and an evaluation on the number of expected filter updates is provided. Examples are provided to demonstrate the theory developed in the paper. © 2009 Elsevier Ltd. All rights reserved.
SCNN: An accelerator for compressed-sparse convolutional neural networks
(2017)

Convolutional Neural Networks (CNNs) have emerged as a fundamental technology for machine learning. High performance and extreme energy efficiency are critical for deployments of CNNs, especially in mobile platforms such as autonomous vehicles, cameras, and electronic personal assistants. This paper introduces the Sparse CNN (SCNN) accelerator architecture, which improves performance and energy efficiency by exploiting the zero-valued weights that stem from network pruning during training and zero-valued activations that arise from the common ReLU operator. Specifically, SCNN employs a novel dataflow that enables maintaining the sparse weights and activations in a compressed encoding, which eliminates unnecessary data transfers and reduces storage requirements. Furthermore, the SCNN dataflow facilitates efficient delivery of those weights and activations to a multiplier array, where they are extensively reused; product accumulation is performed in a novel accumulator array. On contemporary neural networks, SCNN can improve both performance and energy by a factor of 2.7x and 2.3x, respectively, over a comparably provisioned dense CNN accelerator.
Hidden Community Detection in Social Networks
(2018)

We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, they are extremely hard to be uncovered. We call the weak communities the hidden community structure. We present a novel approach called HICODE (HIdden COmmunity DEtection) that identies the hidden community structure as well as the dominant community structure. By weakening the strength of the dominant structure, one can uncover the hidden structure beneath. Likewise, by reducing the strength of the hidden structure, one can more accurately identify the dominant structure. In this way, HICODE tackles both tasks simultaneously. Extensive experiments on real-world networks demonstrate that HICODE outperforms several state-of-the-art community detection methods in uncovering both the dominant and the hidden structure. For example in the Facebook university social networks, we nd multiple non-redundant sets of communities that are strongly associated with residential hall, year of registration or career position of the faculties or students, while the state-of-the-art algorithms mainly locate the dominant ground truth category. Due to the diculty of labeling all ground truth communities in real-world datasets, HICODE provides a promising approach to pinpoint the existing latent communities and uncover communities for which there is no ground truth. Finding this unknown structure is an extremely important community detection problem.
HiStory: a hierarchical storyboard interface design for video browsing on mobile devices
(2012)

This paper presents an interactive thumbnail-based video browser for mobile devices such as smartphones featuring a touch screen. Developed as part of on-going research and supported by user studies, it introduces HiStory, a hierarchical storyboard design offering an interface metaphor that is familiar and intuitive yet supports fast and effective completion of Known-Item-Search tasks by rapidly providing an overview of a video's content with varying degrees of granularity.
Idiopathic isolated clitoromegaly: A report of two cases
(2004)

BACKGROUND: Clitoromegaly is a frequent congenital malformation, but acquired clitoral enlargement is relatively rare. METHODS: Two acquired clitoromegaly cases treated in Ataturk Training Hospital, Izmir, Turkey are presented. RESULTS: History from both patients revealed clitoromegaly over the last three years. Neither gynecological nor systemic abnormalities were detected in either patient. Karyotype analyses and hormonal tests were normal. Abdominal and gynaecological ultrasound did not show any cystic lesion or other abnormal finding. Computerized tomography scan of the adrenal glands was normal. Clitoroplasty with preservation of neurovascular pedicles was performed for the treatment of clitoromegaly. CONCLUSION: The patients were diagnosed as "idiopathic isolated" clitoromegaly. To the best of our knowledge, there has been no detailed report about idiopathic clitoromegaly in the literature.
On the design and implementation of linear differential microphone arrays.
(2014)

Differential microphone array (DMA), a particular kind of sensor array that is responsive to the differential sound pressure field, has a broad range of applications in sound recording, noise reduction, signal separation, dereverberation, etc. Traditionally, an Nth-order DMA is formed by combining, in a linear manner, the outputs of a number of DMAs up to (including) the order of N - 1. This method, though simple and easy to implement, suffers from a number of drawbacks and practical limitations. This paper presents an approach to the design of linear DMAs. The proposed technique first transforms the microphone array signals into the short-time Fourier transform (STFT) domain and then converts the DMA beamforming design to simple linear systems to solve. It is shown that this approach is much more flexible as compared to the traditional methods in the design of different directivity patterns. Methods are also presented to deal with the white noise amplification problem that is considered to be the biggest hurdle for DMAs, particularly higher-order implementations.
Data-free parameter pruning for Deep Neural Networks
(2015)

Deep Neural nets (NNs) with millions of parameters are at the heart of many stateof-the-art computer vision systems today. However, recent works have shown that much smaller models can achieve similar levels of performance. In this work, we address the problem of pruning parameters in a trained NN model. Instead of removing individual weights one at a time as done in previous works, we remove one neuron at a time. We show how similar neurons are redundant, and propose a systematic way to remove them. Our experiments in pruning the densely connected layers show that we can remove upto 85% of the total parameters in an MNIST-trained network, and about 35% for AlexNet without significantly affecting performance. Our method can be applied on top of most networks with a fully connected layer to give a smaller network.
An 82.4% efficiency package-bondwire-based four-phase fully integrated buck converter with flying capacitor for area reduction
(2013)

Multi-phase converters have become a topic of great interest due to the high output power capacity and output ripple cancellation effect. They are even more beneficial to nowadays high-frequency fully integrated converters with output capacitor integrated on-chip. As one of the dominant chip area consumers, reducing the size of the on-chip decoupling capacitors directly leads to cost down. It is reported that a 5× capacitor area reduction can be achieved with a four-phase converter compared to a single-phase one [1]. However, the penalty is obvious. Every extra phase comes with an inductor, which is also counted as cost and becomes more dominant with increase in the number of phases.
Object Detection in High-Resolution Remote Sensing Images Using Rotation Invariant Parts Based Model
(2014)

In this letter, we propose a rotation invariant parts-based model to detect objects with complex shape in high-resolution remote sensing images. Specifically, the geospatial objects with complex shape are firstly divided into several main parts, and the structure information among parts is described and regulated in polar coordinates to achieve the rotation invariance on configuration. Meanwhile, the pose variance of each part relative to the object is also defined in our model. In encoding the features of the rotated parts and objects, a new rotation invariant feature is proposed by extending histogram oriented gradients. During the final detection step, a clustering method is introduced to locate the parts in objects, and that method can also be used to fuse the detection results. By this way, an efficient detection model is constructed and the experimental results demonstrate the robustness and precision of our proposed detection model.
Multi-scale Patch Aggregation (MPA) for Simultaneous Detection and Segmentation
(2016)

Aiming at simultaneous detection and segmentation (SD-S), we propose a proposal-free framework, which detect and segment object instances via mid-level patches. We design a unified trainable network on patches, which is followed by a fast and effective patch aggregation algorithm to infer object instances. Our method benefits from end-to-end training. Without object proposal generation, computation time can also be reduced. In experiments, our method yields results 62.1% and 61.8% in terms of mAPr on VOC2012 segmentation val and VOC2012 SDS val, which are state-of-the-art at the time of submission. We also report results on Microsoft COCO test-std/test-dev dataset in this paper.
Learning to simplify: fully convolutional networks for rough sketch cleanup
(2016)

In this paper, we present a novel technique to simplify sketch drawings based on learning a series of convolution operators. In contrast to existing approaches that require vector images as input, we allow the more general and challenging input of rough raster sketches such as those obtained from scanning pencil sketches. We convert the rough sketch into a simplified version which is then amendable for vectorization. This is all done in a fully automatic way without user intervention. Our model consists of a fully convolutional neural network which, unlike most existing convolutional neural networks, is able to process images of any dimensions and aspect ratio as input, and outputs a simplified sketch which has the same dimensions as the input image. In order to teach our model to simplify, we present a new dataset of pairs of rough and simplified sketch drawings. By leveraging convolution operators in combination with efficient use of our proposed dataset, we are able to train our sketch simplification model. Our approach naturally overcomes the limitations of existing methods, e.g., vector images as input and long computation time; and we show that meaningful simplifications can be obtained for many different test cases. Finally, we validate our results with a user study in which we greatly outperform similar approaches and establish the state of the art in sketch simplification of raster images.
Perceptual Losses for Real-Time Style Transfer and Super-Resolution
(2016)

We consider image transformation problems, where an input image is transformed into an output image. Recent methods for such problems typically train feed-forward convolutional neural networks using a per-pixel loss between the output and ground-truth images. Parallel work has shown that high-quality images can be generated by defining and optimizing perceptual loss functions based on high-level features extracted from pretrained networks. We combine the benefits of both approaches, and propose the use of perceptual loss functions for training feed-forward networks for image transformation tasks. We show results on image style transfer, where a feed-forward network is trained to solve the optimization problem proposed by Gatys et al in real-time. Compared to the optimization-based method, our network gives similar qualitative results but is three orders of magnitude faster. We also experiment with single-image super-resolution, where replacing a per-pixel loss with a perceptual loss gives visually pleasing results.
Scientific Table Search Using Keyword Queries
(2017)

Tables are common and important in scientific documents, yet most text-based document search systems do not capture structures and semantics specific to tables. How to bridge different types of mismatch between keywords queries and scientific tables and what influences ranking quality needs to be carefully investigated. This paper considers the structure of tables and gives different emphasis to table components. On the query side, thanks to external knowledge such as knowledge bases and ontologies, key concepts are extracted and used to build structured queries, and target quantity types are identified and used to expand original queries. A probabilistic framework is proposed to incorporate structural and semantic information from both query and table sides. We also construct and release TableArXiv, a high quality dataset with 105 queries and corresponding relevance judgements for scientific table search. Experiments demonstrate significantly higher accuracy overall and at the top of the rankings than several baseline methods.
Decision support for Cybersecurity risk planning
(2011)

a r t i c l e i n f o Security countermeasures help ensure the confidentiality, availability, and integrity of information systems by preventing or mitigating asset losses from Cybersecurity attacks. Due to uncertainty, the financial impact of threats attacking assets is often difficult to measure quantitatively, and thus it is difficult to prescribe which countermeasures to employ. In this research, we describe a decision support system for calculating the uncertain risk faced by an organization under cyber attack as a function of uncertain threat rates, countermeasure costs, and impacts on its assets. The system uses a genetic algorithm to search for the best combination of countermeasures, allowing the user to determine the preferred tradeoff between the cost of the portfolio and resulting risk. Data collected from manufacturing firms provide an example of results under realistic input conditions. Assuring a secure information technology (IT) environment for the transaction of commerce is a major concern. The magnitude of the task is growing yearly, as attackers become more knowledgeable, more determined, and bolder in their efforts. According to a lead security expert at International Data Corporation, a global provider of market intelligence and advisory services for the IT community, " Emerging new attack vectors, more targeted campaigns, compliance, and the layering of new technologies on the corporate infrastructure are all factors having a tremendous impact on the overall risk to an organization " [21]. Given that corporate expenditures are usually a good indicator of the level of concern about an issue, security is obviously near the top of many IT executives' lists. According to IDC, the global market for providers of information security services is projected to exceed $32.5 billion in 2010 [21]. The New York Times recently noted that " the intrusion into Google's computers and related attacks from within China on some thirty other companies point to the rising sophistication of such assaults and the vulnerability of even the best defenses " [25]. The Times further states that, according to the Computer Security Institute, malware infections are up from one-half to almost two-thirds of companies surveyed last year, at an average cost of $235,000 for each organization. Finally, the newspaper observes, malware is being exploited in new terrains with malicious code that turns on cellphone microphones and cameras for the purpose of industrial spying [25]. Because of the variety of methods attackers use to try to infiltrate and disrupt …
Memory reduction method for deep neural network training
(2016)

Training deep neural networks requires a large amount of memory, making very deep neural networks difficult to fit on accelerator memories. In order to overcome this limitation, we present a method to reduce the amount of memory for training a deep neural network. The method enables to suppress memory increase during the backward pass, by reusing the memory regions allocated for the forward pass. Experimental results exhibit our method reduced the occupied memory size in training by 44.7% on VGGNet with no accuracy affection. Our method also enabled training speedup by increasing the mini batch size up to double.
MATLAB based code for 3 D joint inversion of Magnetotelluric and Direct Current resistivity imaging data
(2018)

24 th EM Induction Workshop, Helsingør, Denmark, August 12-19, 2018 1 /4 MATLAB based code for 3D joint inversion of Magnetotelluric and Direct Current resistivity imaging data M. Israil 1 , A. Singh 1 Anita Devi 1 , and Pravin K.Gupta 1 1 Indian Institute of Technology, Roorkee, 247667, India, mohammad.israil@gmail.com
An Efficient Privacy-Preserving Ranked Keyword Search Method
(2016)

Cloud data owners prefer to outsource documents in an encrypted form for the purpose of privacy preserving. Therefore it is essential to develop efficient and reliable ciphertext search techniques. One challenge is that the relationship between documents will be normally concealed in the process of encryption, which will lead to significant search accuracy performance degradation. Also the volume of data in data centers has experienced a dramatic growth. This will make it even more challenging to design ciphertext search schemes that can provide efficient and reliable online information retrieval on large volume of encrypted data. In this paper, a hierarchical clustering method is proposed to support more search semantics and also to meet the demand for fast ciphertext search within a big data environment. The proposed hierarchical approach clusters the documents based on the minimum relevance threshold, and then partitions the resulting clusters into sub-clusters until the constraint on the maximum size of cluster is reached. In the search phase, this approach can reach a linear computational complexity against an exponential size increase of document collection. In order to verify the authenticity of search results, a structure called minimum hash sub-tree is designed in this paper. Experiments have been conducted using the collection set built from the IEEE Xplore. The results show that with a sharp increase of documents in the dataset the search time of the proposed method increases linearly whereas the search time of the traditional method increases exponentially. Furthermore, the proposed method has an advantage over the traditional method in the rank privacy and relevance of retrieved documents.
Distributed Denial of Service: Taxonomies of Attacks, Tools, and Countermeasures
(2004)

Distributed Denial of Service (DDoS) attacks have become a large problem for users of computer systems connected to the Internet. DDoS attackers hijack secondary victim systems using them to wage a coordinated large-scale attack against primary victim systems. As new countermeasures are developed to prevent or mitigate DDoS attacks, attackers are constantly developing new methods to circumvent these new countermeasures. In this paper, we describe DDoS attack models and propose taxonomies to characterize the scope of DDoS attacks, the characteristics of the software attack tools used, and the countermeasures available. These taxonomies illustrate similarities and patterns in different DDoS attacks and tools, to assist in the development of more generalized solutions to countering DDoS attacks, including new derivative attacks.