SoroushVahidi/scidocs huggingface dataset:
Classification of Brain Cancer using Artificial Neural Network
(2010)

A Brain Cancer Detection and Classification System has been designed and developed. The system uses computer based procedures to detect tumor blocks or lesions and classify the type of tumor using Artificial Neural Network in MRI images of different patients with Astrocytoma type of brain tumors. The image processing techniques such as histogram equalization, image segmentation, image enhancement, morphological operations and feature extraction have been developed for detection of the brain tumor in the MRI images of the cancer affected patients. The extraction of texture features in the detected tumor has been achieved by using Gray Level Co-occurrence Matrix (GLCM). These features are compared with the stored features in the Knowledge Base. Finally a Neuro Fuzzy Classifier has been developed to recognize different types of brain cancers. The whole system has been tested in two phases firstly Learning/Training Phase and secondly Recognition/Testing Phase. The known MRI images of affected brain cancer patients obtained from Radiology Department of Tata Memorial Hospital (TMH) were used to train the system. The unknown samples of brain cancer affected MRI images are also obtained from TMH and were used to test the system. The system was found efficient in classification of these samples and responds any abnormality.
Triple Band Annular Ring Loaded Stacked Circular Patch Microstrip Antenna
(2014)

In this paper a novel structure of annular ring loaded stacked circular patch microstrip antenna is theoretically analysed to observe various parameters such as return loss, input impedance, gain, directivity and radiation pattern. It is found that antenna possess three band of operation which signify the compactness and multiband operation of antenna. The antenna is resonating at three operating frequencies 1.720, 2.950, 3.060 GHz. The proposed theory is verified by simulation using Ansoft’s HFSS and theoretical results are in good agreement with simulated results. The antenna is useful for multi-services operations such as WLAN, GSM, UMTS, and WiMAX services.
Transfer learning for children's speech recognition
(2017)

Children's speech processing is more challenging than that of adults due to lacking of large scale children's speech corpora. With the developing of the physical speech organ, high inter speaker and intra speaker variabilities are observed in children's speech. On the other hand, data collection on children is difficult as children usually have short attention span and their language proficiency is limited. In this paper, we propose to improve children's automatic speech recognition performance with transfer learning technique. We compare two transfer learning approaches in enhancing children's speech recognition performance with adults' data. The first method is to perform acoustic model adaptation on the pre-trained adult model. The second is to train acoustic model with deep neural network based multi-task learning approach: the adults' and children's acoustic characteristics are learnt jointly in the shared hidden layers, while the output layers are optimized with different speaker groups. Our experiment results show that both transfer learning approaches are effective in transferring rich phonetic and acoustic information from adults' model to children model. The multi-task learning approach outperforms the acoustic adaptation approach. We further show that the speakers' acoustic characteristics in languages can also benefit the target language under the multi-task learning framework.
Process Mining and Security: Visualization in Database Intrusion Detection
(2012)

Nowadays, more and more organizations keep their valuable and sensitive data in Database Management Systems (DBMSs). The traditional database security mechanisms such as access control mechanisms, authentication, data encryption technologies do not offer a strong enough protection against the exploitation of vulnerabilities (e.g. intrusions) in DBMSs from insiders. Intrusion detection systems recently proposed in the literature focus on statistical approaches, which are not intuitive. Our research is the first ever effort to use process mining modeling low-level event logs for database intrusion detection. We have proposed a novel approach for visualizing database intrusion detection using process mining techniques. Our experiments showed that intrusion detection visualization will be able to help security officers who might not know deeply the complex system, identify the true positive detection and eliminate the false positive results.
Vision-based obstacle recognition system for automated lawn mower robot development
(2011)

Digital image processing techniques (DIP) have been widely used in various types of application recently. Classification and recognition of a specific object using vision system require some challenging tasks in the field of image processing and artificial intelligence. The ability and efficiency of vision system to capture and process the images is very important for any intelligent system such as autonomous robot. This paper gives attention to the development of a vision system that could contribute to the development of an automated vision based lawn mower robot. The works involve on the implementation of DIP techniques to detect and recognize three different types of obstacles that usually exist on a football field. The focus was given on the study on different types and sizes of obstacles, the development of vision based obstacle recognition system and the evaluation of the system’s performance. Image processing techniques such as image filtering, segmentation, enhancement and edge detection have been applied in the system. The results have shown that the developed system is able to detect and recognize various types of obstacles on a football field with recognition rate of more 80%.
Radio frequency identification: technologies, applications, and research issues
(2007)

A radio frequency identification (RFID) system is a special kind of sensor network to identify an object or a person using radio frequency transmission. A typical RFID system includes transponders (tags) and interrogators (readers): tags are attached to objects/persons, and readers communicate with the tags in their transmission ranges via radio signals. RFID systems have been gaining more and more popularity in areas such as supply chain management, automated identification systems, and any place requiring identifications of products or people. RFID technology is better than barcode in many ways, and may totally replace barcode in the future if certain technologies can be achieved such as low cost and protection of personal privacy. This paper provides a technology survey of RFID systems and various RFID applications. We also discuss five critical research issues: cost control, energy efficiency, privacy issue, multiple readers’ interference, and security issue. Copyright # 2006 John Wiley & Sons, Ltd.
Binarized Genetic Algorithm with Neural Network for Stock Market Prediction
(2018)

Stock market prediction is a challenging task to predict the upcoming stock values. It is very difficult to predict because of unstable nature of stock. This stock market prices are continuously changing day by day. Many Business Analysts spends more money on this stock market. Some of the persons may lose the money on this stock market because they don't have clear idea about the stock market. Estimate and analyse the stock market accurately then only get more profit. Artificial neural network is a very popular technique for forecast the stock market price, but using this technique to forecast the stock market price up to some extent. So there is a need to improve the accuracy of the system. In this paper, propose a novel system called Binarized Genetic Algorithm with Artificial Neural Network (BGANN) technique to predict and forecast future behavior of individual stocks or the upcoming stock. Binarized Genetic Algorithm is used for optimizing Neural Network weights while training. Comparative analysis shows that BGANN method performance is better compared to the Support Vector Machine (SVM), Neural Network (NN), and Auto Regressive Integrated Moving Average (ARIMA) models.
Modeling visual problem solving as analogical reasoning.
(2017)

We present a computational model of visual problem solving, designed to solve problems from the Raven's Progressive Matrices intelligence test. The model builds on the claim that analogical reasoning lies at the heart of visual problem solving, and intelligence more broadly. Images are compared via structure mapping, aligning the common relational structure in 2 images to identify commonalities and differences. These commonalities or differences can themselves be reified and used as the input for future comparisons. When images fail to align, the model dynamically rerepresents them to facilitate the comparison. In our analysis, we find that the model matches adult human performance on the Standard Progressive Matrices test, and that problems which are difficult for the model are also difficult for people. Furthermore, we show that model operations involving abstraction and rerepresentation are particularly difficult for people, suggesting that these operations may be critical for performing visual problem solving, and reasoning more generally, at the highest level. (PsycINFO Database Record
A 71-Gb/s NRZ Modulated 850-nm VCSEL-Based Optical Link
(2015)

We report error free (BER <; 10-12) operation of a directly non-return-to-zero modulated 850-nm vertical cavity surface-emitting laser (VCSEL) link operating to 71 Gb/s. This is the highest error free modulation rate for a directly modulated laser of any type. The optical link consists of a 130-nm BiCMOS driver IC with two-tap feed-forward equalization, a wide bandwidth 850-nm VCSEL, a surface illuminated GaAs PIN photodiode, and a 130-nm BiCMOS receiver IC.
Minimizing Faulty Executions of Distributed Systems
(2016)

When troubleshooting buggy executions of distributed systems, developers typically start by manually separating out events that are responsible for triggering the bug (signal) from those that are extraneous (noise). In this paper we present DEMi, a tool for automatically performing this minimization. We apply DEMi to buggy executions of two very different distributed systems, Raft and Spark, and find that it achieves up to 97% reduction of execution length within a small time budget.
Stationary Frame Induction Motor Feed Forward Current Controller With Back EMF Compensation
(2015)

In this paper, a novel induction motor (IM) stator current controller is proposed based on the stationary frame feed forward controlling structure. The proposed regulator represents an improved variant of the existing stationary and rotational frame IM stator current regulators based on the back EMF compensation. The paper novelty consists of the stationary frame controlling structure based on two feed forward actions that enable asymptotic reference tracking. Namely, the novel stationary frame regulator includes a proportional integral (PI) regulation term combined with a stator resistance voltage drop and back EMF feed forward compensations, with the back EMF compensation based on the stator flux value estimated by means of a programmable low-pass filter. The feedback term is based on a PI controller, with the corresponding parameter tuning procedure outlined in the paper. The simulation runs are included in the paper in order to examine the regulator performance in relation to the factors critical to the IM stator current regulation: variable IM model parameter values, transport delay introduced in the control loop, variable stator frequency, and rotor speed values. Also, the experimental tests are presented and carried out on an experimental setup for different operating conditions typical for an IM drive.
Coping with stress during childhood and adolescence: problems, progress, and potential in theory and research.
(2001)

Progress and issues in the study of coping with stress during childhood and adolescence are reviewed. Definitions of coping are considered, and the relationship between coping and other aspects of responses to stress (e.g., temperament and stress reactivity) is described. Questionnaire, interview, and observation measures of child and adolescent coping are evaluated with regard to reliability and validity. Studies of the association of coping with symptoms of psychopathology and social and academic competence are reviewed. Initial progress has been made in the conceptualization and measurement of coping, and substantial evidence has accumulated on the association between coping and adjustment. Problems still remain in the conceptualization and measurement of coping in young people, however, and aspects of the development and correlates of coping remain to be identified. An agenda for future research on child-adolescent coping is outlined.
An Efficient & Secure Content Contribution and Retrieval content in Online Social Networks using Level-level Security Optimization & Content Visualization Algorithm
(2018)

Received Nov 14, 2017 Revised Jan 26, 2018 Accepted Feb 11, 2018 Online Social Networks (OSNs) is currently popular interactive media to establish the communication, share and disseminate a considerable amount of human life data. Daily and continuous communications imply the exchange of several types of content, including free text, image, audio, and video data. Security is one of the friction points that emerge when communications get mediated in Online Social Networks (OSNs). However, there are no contentbased preferences supported, and therefore it is not possible to prevent undesired messages. Providing the service is not only a matter of using previously defined web content mining and security techniques. To overcome the issues, Level-level Security Optimization & Content Visualization Algorithm is proposed to avoid the privacy issues during content sharing and data visualization. It adopts level by level privacy based on user requirement in the social network. It evaluates the privacy compatibility in the online social network environment to avoid security complexities. The mechanism divided into three parts namely like online social network platform creation, social network privacy, social network within organizational privacy and network controlling and authentication. Based on the experimental evaluation, a proposed method improves the privacy retrieval accuracy (PRA) 9.13% and reduces content retrieval time (CRT) 7 milliseconds and information loss (IL) 5.33%.
Probability of Random Correspondence for Fingerprints
(2009)

Individuality of fingerprints can be quantified by computing the probabilistic metrics for measuring the degree of fingerprint individuality. In this paper, we present a novel individuality evaluation approach to estimate the probability of random correspondence (PRC). Three generative models are developed respectively to represent the distribution of fingerprint features: ridge flow, minutiae and minutiae together with ridge points. A mathematical model that computes the PRCs are derived based on the generative models. Three metrics are discussed in this paper: (i) PRC of two samples, (ii) PRC among a random set of n samples (nPRC) and (iii) PRC between a specific sample among n others (specific nPRC). Experimental results show that the theoretical estimates of fingerprint individuality using our model consistently follow the empirical values based on the NIST4 database.
Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing
(2012)

We present Resilient Distributed Datasets (RDDs), a distributed memory abstraction that allows programmers to perform in-memory computations on large clusters while retaining the fault tolerance of data flow models like MapReduce. RDDs are motivated by two types of applications that current data flow systems handle inefficiently: iterative algorithms, which are common in graph applications and machine learning, and interactive data mining tools. In both cases, keeping data in memory can improve performance by an order of magnitude. To achieve fault tolerance efficiently, RDDs provide a highly restricted form of shared memory: they are read-only datasets that can only be constructed through bulk operations on other RDDs. However, we show that RDDs are expressive enough to capture a wide class of computations, including MapReduce and specialized programming models for iterative jobs such as Pregel. Our implementation of RDDs can outperform Hadoop by 20× for iterative jobs and can be used interactively to search a 1 TB dataset with latencies of 5–7 seconds.
Applying Model Management to Classical Meta Data Problems
(2003)

Model management is a new approach to meta data management that offers a higher level programming interface than current techniques. The main abstractions are models (e.g., schemas, interface definitions) and mappings between models. It treats these abstractions as bulk objects and offers such operators as Match, Merge, Diff, Compose, Apply, and ModelGen. This paper extends earlier treatments of these operators and applies them to three classical meta data management problems: schema integration, schema evolution, and round-trip engineering.
Towards a unified architecture for in-RDBMS analytics
(2012)

The increasing use of statistical data analysis in enterprise applications has created an arms race among database vendors to offer ever more sophisticated in-database analytics. One challenge in this race is that each new statistical technique must be implemented from scratch in the RDBMS, which leads to a lengthy and complex development process. We argue that the root cause for this overhead is the lack of a unified architecture for in-database analytics. Our main contribution in this work is to take a step towards such a unified architecture. A key benefit of our unified architecture is that performance optimizations for analytics techniques can be studied generically instead of an ad hoc, per-technique fashion. In particular, our technical contributions are theoretical and empirical studies of two key factors that we found impact performance: the order data is stored, and parallelization of computations on a single-node multicore RDBMS. We demonstrate the feasibility of our architecture by integrating several popular analytics techniques into two commercial and one open-source RDBMS. Our architecture requires changes to only a few dozen lines of code to integrate a new statistical technique. We then compare our approach with the native analytics tools offered by the commercial RDBMSes on various analytics tasks, and validate that our approach achieves competitive or higher performance, while still achieving the same quality.
Sketch of Big Data Real-Time Analytics Model
(2015)

Big Data has drawn huge attention from researchers in information sciences, decision makers in governments and enterprises. However, there is a lot of potential and highly useful value hidden in the huge volume of data. Data is the new oil, but unlike oil data can be refined further to create even more value. Therefore, a new scientific paradigm is born as data-intensive scientific discovery, also known as Big Data. The growth volume of real-time data requires new techniques and technologies to discover insight value. In this paper we introduce the Big Data real-time analytics model as a new technique. We discuss and compare several Big Data technologies for real-time processing along with various challenges and issues in adapting Big Data. Realtime Big Data analysis based on cloud computing approach is our future research direction.
Turning the Page : The Impact of Choice Closure on Satisfaction
(2012)

This paper introduces the concept of choice closure, defined as the psychological process by which consumers come to perceive a decision to be resolved and complete, and focus on the decision outcome. Choice closure inhibits consumers who have already made a choice from reverting to the decision process and engaging in potentially unfavorable comparisons between the chosen and the forgone options. In four studies, we show that physical acts of closure—such as turning one’s back on, covering, and turning the page on the rejected alternatives—facilitate choice closure in the context of difficult decisions involving large choice sets, and that choice closure results in greater satisfaction.
Evolutionary Synthesis of Deep Neural Networks via Synaptic Cluster-driven Genetic Encoding
(2016)

There has been significant recent interest towards achievin g highly efficient deep neural network architectures. A promising paradigm for ach ieving this is the concept ofevolutionary deep intelligence , which attempts to mimic biological evolution processes to synthesize highly-efficient deep neural n etworks over successive generations. An important aspect of evolutionary deep inte lligence is the genetic encoding scheme used to mimic heredity, which can have a sign ificant impact on the quality of offspring deep neural networks. Motivated by the neurobiological phenomenon of synaptic clustering, we introduce a new genet ic encoding scheme where synaptic probability is driven towards the formation of a highly sparse set of synaptic clusters. Experimental results for the task of ima ge classification demonstrated that the synthesized offspring networks using this synaptic cluster-driven genetic encoding scheme can achieve state-of-the-art perf ormance while having network architectures that are not only significantly more e ffici nt (with a∼125fold decrease in synapses for MNIST) compared to the origina l a cestor network, but also tailored for GPU-accelerated machine learning app lications.
Understanding and Predicting Graded Search Satisfaction
(2015)

Understanding and estimating satisfaction with search engines is an important aspect of evaluating retrieval performance. Research to date has modeled and predicted search satisfaction on a binary scale, i.e., the searchers are either satisfied or dissatisfied with their search outcome. However, users' search experience is a complex construct and there are different degrees of satisfaction. As such, binary classification of satisfaction may be limiting. To the best of our knowledge, we are the first to study the problem of understanding and predicting graded (multi-level) search satisfaction. We ex-amine sessions mined from search engine logs, where searcher satisfaction was also assessed on multi-point scale by human annotators. Leveraging these search log data, we observe rich and non-monotonous changes in search behavior in sessions with different degrees of satisfaction. The findings suggest that we should predict finer-grained satisfaction levels. To address this issue, we model search satisfaction using features indicating search outcome, search effort, and changes in both outcome and effort during a session. We show that our approach can predict subtle changes in search satisfaction more accurately than state-of-the-art methods, affording greater insight into search satisfaction. The strong performance of our models has implications for search providers seeking to accu-rately measure satisfaction with their services.
AR typing interface for mobile devices
(2013)

We propose a new user interface system for mobile devices. By using augmented reality (AR) technology, the system overlays virtual objects on real images captured by a camera attached to the back of a mobile device, and the user can operate the mobile device by manipulating the virtual objects with his/her hand in the space behind the mobile device. This system allows the user to operate the device in a wide three-dimensional space and to select small objects easily. Also, the AR technology provides the user with a sense of reality in operating the device. We developed a typing application using our system and verified the effectiveness by user studies. The results showed that more than half of the subjects felt that the operation area of the proposed system is larger than that of a smartphone and that both AR and unfixed key-plane are effective for improving typing speed.