Search

Quantitative Finance is a field that replies on data analysis and big data enabling software to discover market signals. In this, a decisive factor is the speed that concerns execution speed and software development speed. So, an efficient software plays a key role in helping trading firms. Inspired by this, we present a novel software: QuantCloud to integrate a parallel Python system with a C++-coded Big Data system. C++ is used to implement this big data system and Python is used to code the user methods. The automated parallel execution of Python codes is built upon a coprocess-based parallel strategy. We test our software using two popular algorithms: moving-window and autoregressive moving-average (ARMA). We conduct an extensive comparative study between Intel Xeon E5 and Xeon Phi processors. The results show that our method achieved a nearly linear speedup for executing Python codes in parallel, prefect for today's multicore processors.

Cloud computing and big data technologies are converging to offer a cost-effective delivery model for cloud-based big data analytics. Though impacts of size and scaling of big data on cloud have been extensively studied, the effects of complexity of underlying analytic methods on cloud performance have received less attention. This paper will develop and evaluate a computationally intensive statistical methodology to perform inference in the presence of both non-Gaussian data and missing data. Two well-established statistical approaches, bootstrap and multiple imputations (MI), will be combined to form the methodology. Bootstrap is a computer-based nonparametric resampling procedure that involves randomly selecting data many thousands of times to construct an empirical distribution, which is then used to construct confidence intervals for significance tests. This statistical technique enables scientists who conduct studies on data with known non-normality to obtain higher quality significance tests than is possible with a traditional asymptotic, normal-theory based significance test. However, the bootstrapping procedure only works when no data are missing or the data are missing completely at random (MCAR). Missing data can lead to biased estimates when the MCAR assumption is violated. It is unclear how to best implement a bootstrapping procedure in the presence of missing data. The proposed methods will provide guidelines and procedures that will enable researchers to use the technique in all areas of health, behavior and developmental science in which a study has missing data and cannot rely on parametric inference. Either bootstrapping or MI can be computationally expensive, and combining these two can lead to further computation costs in the cloud. Using carefully constructed simulation examples, we demonstrate that it is feasible to implement the proposed methodology in a high performance Knights Landing platform. However, the computation costs are substantial even with small data size. Further studies are needed to study the effects of optimizing the implementation and its performance with big data.

Using genetic data to infer relatedness has been crucial for genetics studies for decades. In a previously published paper together with the KING software, we demonstrated that the kinship coefficient, a measure of relatedness between a pair of individuals, can be accurately estimated using their genome-wide SNP data, without estimating the allele frequencies at each SNP in the whole dataset. The computational efficiency of this algorithm has been substantially improved in the second generation of KING. Three levels of computational speed-up are implemented in KING 2.0, including: 1) bit-level parallelism; 2) multiple-core parallelism using OpenMP; and 3) a multi-stage procedure to eliminate unrelated or distantly related pairs of individuals. The efficient implementation in KING 2.0 allows instant relationship inference in a matter of seconds in a typical dataset (with 10,000s individuals). To demonstrate the computational performance and scalability of KING 2.0, we use the Knights Landing platform to infer relatedness in a dataset consisting of 303,750 individuals each typed at 168,749 autosome SNPs. The computational time to identify all first-degree relatives by scanning 46 billion pairs of individuals is ∼10 minutes using 256 threads, a noticeable speed-up comparing to the general-purpose CPU. Algorithm improvement in the second generation of KING and the use of the latest computing system such as the Knights Landing platform makes it feasible for researchers to infer relatedness in their genetic datasets in the largest size up-to-date on a single computer.

Finding the best model to reveal potential relationships of a given set of data is not an easy job and often requires many iterations of trial and errors for model sections, feature selections and parameters tuning. This problem is greatly complicated in the big data era where the I/O bottlenecks significantly slowed down the time needed to finding the best model. In this article, we examine the case of Box-Cox transformation when assumptions of a regression model are violated. Specifically, we construct and compute a set of summary statistics and transformed the maximum likelihood computation into a per-role operational fashion. The innovative algorithms reduced the big data machine learning problem into a stream based small data learning problem. Once the Box-Cox information array is obtained, the optimal power transformation as well as the corresponding estimates of model parameters can be quickly computed. To evaluate the performance, we implemented the proposed Box-Cox algorithms on QCT developer cloud. Our results showed that by leveraging both the algorithms and the QCT cloud technology, find the fittest model from 101 potential parameters is much faster than the conventional approach.

As IT organizations are pursuing database High Availability (HA) solutions to ensure and protest critical commercial data, the challenge is to leverage the three-fold key dimensions: cost, performance and availability. A successful solution needs to integrate Database Management System (DBMS) seamlessly with back-end storage and offer good performance and customer data protection. Through extensively investigating plenty of productions in the market, Oracle database is a leading solution for business critical application. As a cost effective solution, it could reduce business risk and achieve data availability, performance, and Return on Investment (ROI). On the other aspect, high-end storage solution, Storage Area Network (SAN) based on Fibre Channel protocol can be easy to deploy with Oracle database and match end-user's requirements. In this paper, we will present a design of high available database on a new reference architecture. The implementation of design is based on Oracle database with Dell Acceleration Appliances for Databases (DAAD), which introduces flash technology by Fusion-IO. To demonstrate practical performances, we built a proof-ofconcept platform and compared the platform with a traditional 96-SAS-drive platform. The results show that our approach can deliver more than 1-million random Input/output Operations per Second (IOPS) that is 27 times faster than the traditional platform and it can also achieve a 96% reduction in the latencies, thus showing the scalability of the approach with massive database nodes. Therefore, our approach provides not only an ultra-fast storage solution to boost database performances but it also offers a flexible and high available design to achieve zero-downtime database.

The structure of the IOT and transmission property of RFID System is discussed?Cthe reliability and safety of RFID System is particularly important?Cthe methods to solve data collision and security attack is analyzed?DMoreover?Cthe application of RFID Middleware is introduced about the the networking mode on the IoT?D