We consider the problem of recovering l-adic representations from a knowledge of the character values at the Frobenius elements associated to l-adic representations constructed algebraically out of the original representations. These results generalize earlier results in [Ra] concerning refinements of strong multiplicity one for l-adic represntations, and a result of Ramakrishnan [DR] recoverin...

Designing and maintaining a software system’s architecture typically involve making numerous design decisions, each potentially affecting the system’s functional and nonfunctional properties. Understanding these design decisions can help inform future decisions and implementation choices and can avoid introducing regressions and architectural inefficiencies later. Unfortunately, design decision...

S ince 2000, the worldwide market for carbon-fiber-reinforced composite materials (CFRP) has grown from 30,500 to 43,500 tons per year. According to the latest estimates, the demand for carbon fibers will rise to some 1,300,000 tons by 2020 [1]. When preforms are used for manufacturing CFRP parts by the Liquid Composite Molding (LCM) process, up to 40 % waste accrues, resulting in a considerabl...

In this article, we address the issue of recovering latent transparent layers from superimposition images. Here, we assume we have the estimated transformations and extracted gradients of latent layers. To rapidly recover high-quality image layers, we propose an Efficient Superimposition Recovering Algorithm (ESRA) by extending the framework of accelerated gradient method. In addition, a key bu...

The work proposed here will develop experimental methods and tools for the analysis of behavior under uncertainty in economically important settings. The research is motivated by types of questions commonly asked in demand analysis: (i) Consistency. Is behavior under conditions of uncertainty consistent with a model of utility maximization? (ii) Structure. Is the observed data consistent with a...

We consider the problem of accurately recovering a matrix B of size M ×M , which represents a probability distribution over M2 outcomes, given access to an observed matrix of “counts” generated by taking independent samples from the distribution B. How can structural properties of the underlying matrix B be leveraged to yield computationally efficient and information theoretically optimal recon...

A fast fault-tolerant controller structure is presented, which is capable of recovering from transient faults by performing a rollback operation in hardware. The proposed fault-tolerant controller structure utilizes the rollback hardware also for system mode and this way achieves performance improvements of more than 50% compared to controller structures made fault tolerant by conventional tech...

When a group of aligned sequences shows significant similarity to each other, as described in Chapters 4 to 6, this can usually be taken as evidence that they are the result of divergent evolution from a common ancestral sequence. In this case, the sequence alignment will contain traces of the evolutionary history of these sequences. It is possible to infer this history by complex analysis of a...

We examine the problem of computing shape descriptions from stereo, where by shape descriptions we mean 3-D volumetric descriptions of objects rather than a 2 2 -D depth map of the scene. We argue that intermediate 2 2 -D depth measurements may not be always directly available from stereo, especially when there are curved surfaces in the scene, and that 3-D volumetric descriptions of objects ma...