Central bank – the root cause of poverty, tax, and deficit

In each country the central bank is a privately owned bank with no transparency and accountability to the government of that country. It is also the only bank that can print the money for that country and does it so out of thin air. At the same time this bank wants that the government returns the money with interest. We show that this structure creates deficit, introduces tax, and causes poverty around the globe. This paper shows how central banks control the economy by manipulating the financial system it has designed. The paper explains how easily the central banks can control the unemployment, create recessions, and transfer wealth from the lower economic group to higher economic group and perpetuate the poverty. The paper also proposes three methods of eliminating central banks.central banks, Federal Funds Rate, Recessions

Rates for Color Shifted Microlensing Events

If the objects responsible for gravitational microlensing (ML) of Galactic-bulge stars are faint dwarfs, then blended light from the lens will distort the shape of the ML light curve and shift the color of the observed star during the event. The resolution in current surveys is not accurate enough to observe this effect, but it should be detected with frequent and precise followup observations. We calculate the expected rates for ML events where the shape distortions will be observable by such followup observations, assuming that the lenses are ordinary main-sequence stars in a bar and in the disk. We study the dependence of the rates for color-shifted (CS) events on the frequency of followup observations and on the precision of the photometry for a variety of waveband pairings. We find that for hourly observations in $B$ and $K$ with typical photometric errors of 0.01 mag, 28\% of the events where a main-sequence bulge star is lensed, and 7\% of the events where the source is a bulge giant, will give rise to a measurable CS at the 95\% confidence level. For observations in $V$ and $I$, the fractions become 18\% and 5\%, respectively, but may be increased to 40\% and 13\% by improved photometric accuracy and increased sampling frequency. We outline how the mass, distance, and transverse speed of the lens can be obtained, giving examples of typical errors. We discuss how CS events can be distinguished from events where the source is blended with a binary companion.Comment: 36 pages, uuencoded postscript fil

A Range-Based Multivariate Model for Exchange Rate Volatility

In this paper we present a parsimonious multivariate model forexchange rate volatilities based on logarithmic high-low ranges ofdaily exchange rates. The multivariate stochastic volatility modeldivides the log range of each exchange rate into two independentlatent factors, which are interpreted as the underlying currencyspecific components. Due to the normality of logarithmic volatilitiesthe model can be estimated conveniently with standard Kalman filtertechniques. Our results show that our model fits the exchange ratedata quite well. Exchange rate news seems to be very currency-specificand allows us to identify which currency contributes most to bothexchange rate levels and exchange rate volatilities.exchange rates;multivariate stochastic volatility models;range-based volatility

When a Dollar Makes a BWT

TheBurrows-Wheeler-Transform(BWT)isareversiblestring transformation which plays a central role in text compression and is fun- damental in many modern bioinformatics applications. The BWT is a permutation of the characters, which is in general better compressible and allows to answer several different query types more efficiently than the original string. It is easy to see that not every string is a BWT image, and exact charac- terizations of BWT images are known. We investigate a related combi- natorial question. In many applications, a sentinel character $is added to mark the end of the string, and thus the BWT of a string ending with$ contains exactly one $character. We ask, given a string w, in which positions, if any, can the$-character be inserted to turn w into the BWT image of a word ending with the sentinel character. We show that this depends only on the standard permutation of w and give a combinatorial characterization of such positions via this permutation. We then develop an O(n log n)-time algorithm for identifying all such positions, improving on the naive quadratic time algorithm

CryptGraph: Privacy Preserving Graph Analytics on Encrypted Graph

Many graph mining and analysis services have been deployed on the cloud, which can alleviate users from the burden of implementing and maintaining graph algorithms. However, putting graph analytics on the cloud can invade users' privacy. To solve this problem, we propose CryptGraph, which runs graph analytics on encrypted graph to preserve the privacy of both users' graph data and the analytic results. In CryptGraph, users encrypt their graphs before uploading them to the cloud. The cloud runs graph analysis on the encrypted graphs and obtains results which are also in encrypted form that the cloud cannot decipher. During the process of computing, the encrypted graphs are never decrypted on the cloud side. The encrypted results are sent back to users and users perform the decryption to obtain the plaintext results. In this process, users' graphs and the analytics results are both encrypted and the cloud knows neither of them. Thereby, users' privacy can be strongly protected. Meanwhile, with the help of homomorphic encryption, the results analyzed from the encrypted graphs are guaranteed to be correct. In this paper, we present how to encrypt a graph using homomorphic encryption and how to query the structure of an encrypted graph by computing polynomials. To solve the problem that certain operations are not executable on encrypted graphs, we propose hard computation outsourcing to seek help from users. Using two graph algorithms as examples, we show how to apply our methods to perform analytics on encrypted graphs. Experiments on two datasets demonstrate the correctness and feasibility of our methods