Analysis of the passive stabilization of the long duration exposure facility

The nominal Long Duration Exposure Facility (LDEF) configurations and the anticipated orbit parameters are presented. A linear steady state analysis was performed using these parameters. The effects of orbit eccentricity, solar pressure, aerodynamic pressure, magnetic dipole, and the magnetically anchored rate damper were evaluated to determine the configuration sensitivity to variations in these parameters. The worst case conditions for steady state errors were identified, and the performance capability calculated. Garber instability bounds were evaluated for the range of configuration and damping coefficients under consideration. The transient damping capabilities of the damper were examined, and the time constant as a function of damping coefficient and spacecraft moment of inertia determined. The capture capabilities of the damper were calculated, and the results combined with steady state, transient, and Garber instability analyses to select damper design parameters

Does certification work in emerging markets? evidence from the Indian IPO market

There is inconclusive evidence regarding the economic value of certification in the context of IPOs in developed markets. Using a natural experiment of regulator mandated IPO grading requirement, we examine the effects of third-party certification in the Indian IPO market. We summarize our empirical results below. First, underpricing is unaffected by the grading process. Second, stock price informativeness as proxied by idiosyncratic volatility increases significantly due to IPO grading process. Third, retail and institutional subscription levels are significantly positively associated with IPO grades after controlling for other certification mechanisms such as underwriter reputation, group affiliation, analyst recommendation and venture capital backing. Finally, using a pseudo grading process we conclude that IPO grades are not mechanically derivable from publicly available information. In a nutshell, we use our unique setting to examine the usefulness of certification in emerging markets with institutional voids

Locality and Availability in Distributed Storage

This paper studies the problem of code symbol availability: a code symbol is said to have $(r, t)$-availability if it can be reconstructed from $t$ disjoint groups of other symbols, each of size at most $r$. For example, $3$-replication supports $(1, 2)$-availability as each symbol can be read from its $t= 2$ other (disjoint) replicas, i.e., $r=1$. However, the rate of replication must vanish like $\frac{1}{t+1}$ as the availability increases. This paper shows that it is possible to construct codes that can support a scaling number of parallel reads while keeping the rate to be an arbitrarily high constant. It further shows that this is possible with the minimum distance arbitrarily close to the Singleton bound. This paper also presents a bound demonstrating a trade-off between minimum distance, availability and locality. Our codes match the aforementioned bound and their construction relies on combinatorial objects called resolvable designs. From a practical standpoint, our codes seem useful for distributed storage applications involving hot data, i.e., the information which is frequently accessed by multiple processes in parallel.Comment: Submitted to ISIT 201