935 research outputs found
Jeeva: Enterprise Grid-enabled Web Portal for Protein Secondary Structure Prediction
This paper presents a Grid portal for protein secondary structure prediction
developed by using services of Aneka, a .NET-based enterprise Grid technology.
The portal is used by research scientists to discover new prediction structures
in a parallel manner. An SVM (Support Vector Machine)-based prediction
algorithm is used with 64 sample protein sequences as a case study to
demonstrate the potential of enterprise Grids.Comment: 7 page
Recommended from our members
Accelerated Iterative Algorithms with Asynchronous Accumulative Updates on a Heterogeneous Cluster
In recent years with the exponential growth in web-based applications the amount of data generated has increased tremendously. Quick and accurate analysis of this \u27big data\u27 is indispensable to make better business decisions and reduce operational cost. The challenges faced by modern day data centers to process big data are multi fold: to keep up the pace of processing with increased data volume and increased data velocity, deal with system scalability and reduce energy costs. Today\u27s data centers employ a variety of distributed computing frameworks running on a cluster of commodity hardware which include general purpose processors to process big data. Though better performance in terms of big data processing speed has been achieved with existing distributed computing frameworks, there is still an opportunity to increase processing speed further. FPGAs, which are designed for computationally intensive tasks, are promising processing elements that can increase processing speed. In this thesis, we discuss how FPGAs can be integrated into a cluster of general purpose processors running iterative algorithms and obtain high performance.
In this thesis, we designed a heterogeneous cluster comprised of FPGAs and CPUs and ran various benchmarks such as PageRank, Katz and Connected Components to measure the performance of the cluster. Performance improvement in terms of execution time was evaluated against a homogeneous cluster of general purpose processors and a homogeneous cluster of FPGAs. We built multiple four-node heterogeneous clusters with different configurations by varying the number of CPUs and FPGAs.
We studied the effects of load balancing between CPUs and FPGAs. We obtained a speedup of 20X, 11.5X and 2X for PageRank, Katz and Connected Components benchmarks on a cluster cluster configuration of 2 CPU + 2 FPGA for an unbalancing ratio against a 4-node homogeneous CPU cluster. We studied the effect of input graph partitioning, and showed that when the input is a Multilevel-KL partitioned graph we obtain an improvement of 11%, 26% and 9% over randomly partitioned graph for Katz, PageRank and Connected Components benchmarks on a 2 CPU + 2 FPGA cluster
Click Fraud Detection in Online and In-app Advertisements: A Learning Based Approach
Click Fraud is the fraudulent act of clicking on pay-per-click advertisements to increase a site’s revenue, to drain revenue from the advertiser, or to inflate the popularity of content on social media platforms. In-app advertisements on mobile platforms are among the most common targets for click fraud, which makes companies hesitant to advertise their products. Fraudulent clicks are supposed to be caught by ad providers as part of their service to advertisers, which is commonly done using machine learning methods. However: (1) there is a lack of research in current literature addressing and evaluating the different techniques of click fraud detection and prevention, (2) threat models composed of active learning systems (smart attackers) can mislead the training process of the fraud detection model by polluting the training data, (3) current deep learning models have significant computational overhead, (4) training data is often in an imbalanced state, and balancing it still results in noisy data that can train the classifier incorrectly, and (5) datasets with high dimensionality cause increased computational overhead and decreased classifier correctness -- while existing feature selection techniques address this issue, they have their own performance limitations. By extending the state-of-the-art techniques in the field of machine learning, this dissertation provides the following solutions: (i) To address (1) and (2), we propose a hybrid deep-learning-based model which consists of an artificial neural network, auto-encoder and semi-supervised generative adversarial network. (ii) As a solution for (3), we present Cascaded Forest and Extreme Gradient Boosting with less hyperparameter tuning. (iii) To overcome (4), we propose a row-wise data reduction method, KSMOTE, which filters out noisy data samples both in the raw data and the synthetically generated samples. (iv) For (5), we propose different column-reduction methods such as multi-time-scale Time Series analysis for fraud forecasting, using binary labeled imbalanced datasets and hybrid filter-wrapper feature selection approaches
One-Shot Object Localization Using Learnt Visual Cues via Siamese Networks
A robot that can operate in novel and unstructured environments must be
capable of recognizing new, previously unseen, objects. In this work, a visual
cue is used to specify a novel object of interest which must be localized in
new environments. An end-to-end neural network equipped with a Siamese network
is used to learn the cue, infer the object of interest, and then to localize it
in new environments. We show that a simulated robot can pick-and-place novel
objects pointed to by a laser pointer. We also evaluate the performance of the
proposed approach on a dataset derived from the Omniglot handwritten character
dataset and on a small dataset of toys
Conventional Entropy Quantifier and Modified Entropy Quantifiers for Face Recognition
AbstractThis paper presents theoretically simple, yet computationally efficient approach for face recognition. There are many transforms and entropy measures used in face recognition technology. Recognition rate is poor with binary and edge based recognition techniques. We employ the entropy concept to binary and edge images. We use Conventional Entropy Quantifier (CEQ) which counts only the transitions, and Modified Entropy Quantifier (MEQ) which considers the positions with transitions for measuring the entropy. The proposed entropy features possess good texture discriminative property. The experiments are conducted on benchmark databases using SVM and K-NN classifiers. Experimental results show the effectiveness of our system
International search behavior of Business Group affiliated firms: Scope of institutional changes and intragroup heterogeniety
This paper investigates whether and when affiliation to business groups enables or constrains firms’ international search behavior during institutional transitions. We theorize that given the unique structure and complex form of business group organizations, the search behavior of affiliated firms is influenced by the degree of (mis)alignment in outlook at the group and affiliate levels of management. We identify the scope of institutional changes, business group attributes, and affiliate characteristics as sources of such (mis)alignment. The results from panel data on 298 firms from the Indian pharmaceutical industry for the 1992–2007 period show that the constraining effects of business group affiliation are observed only when institutional changes are specific to the affiliates’ industry and not when broad institutional changes affect the business group as a whole. Moreover, we observe heterogeneity in the search behavior of group affiliated firms. First, the degree of misalignment is greater in the case of affiliates belonging to older business groups and those that are more distant in terms of age and industry since the group’s founding. Second, by contrast and suggesting an alignment in outlook, we find that affiliated firms that occupy a prominent position within a group or industry are able to bargain for and receive attention and support from the business group to undertake international search. Our findings have implications for research on the role of business groups in a changing institutional context and for the strategic adaptation of firms embedded in complex organizational and institutional settings
- …