Detecting Curved Edges in Noisy Images in Sublinear Time

Detecting edges in noisy images is a fundamental task in image processing. Motivated, in part, by various real-time applications that involve large and noisy images, in this paper we consider the problem of detecting long curved edges under extreme computational constraints, that allow processing of only a fraction of all image pixels. We present a sublinear algorithm for this task, which runs in two stages: (1) a multiscale scheme to detect curved edges inside a few image strips; and (2) a tracking procedure to estimate their extent beyond these strips. We theoretically analyze the runtime and detection performance of our algorithm and empirically illustrate its competitive results on both simulated and real images.     

Reversible cation response with a protein-modified nanopipette

The calcium ion response of a quartz nanopipette was enhanced by immobilization of calmodulin to the nanopore surface. Binding to the analyte is rapidly reversible in neutral buffer and requires no change in media or conditions to regenerate the receptor. The signal remained reproducible over numerous measurements. The modified nanopipette was used to measure binding affinity to calcium ions, with a K(d) of 6.3 ± 0.8 × 10(-5) M. This affinity is in good agreement with reported values of the solution-state protein. The behavior of such reversible nanopore-based sensors can be used to study proteins in a confined environment and may lead to new devices for continuous monitoring.     

360° reconstruction of a 3D object using cylindrical computer generated holography

Simulated reconstruction of a three-dimensional (3D) object in 360° from cylindrical hologram is proposed. The simulation is done using a fast calculation method, where wave propagation in spectral domain and in cylindrical coordinates is used to generate the cylindrical hologram of a 3D object. The same procedure is followed to reconstruct the object back. The reconstructions resembled the original object and could be seen from all 360°. The whole simulation process is done using open-source software.     

Secure Computation Without Authentication

Research on secure multiparty computation has mainly concentrated on the case where the parties can authenticate each other and the communication between them. This work addresses the question of what security can be guaranteed when authentication is not available. We consider a completely unauthenticated setting, where all messages sent by the parties may be tampered with and modified by the adversary without the uncorrupted parties being able to detect this fact. In this model, it is not possible to achieve the same level of security as in the authenticated-channel setting. Nevertheless, we show that meaningful security guarantees can be provided: Essentially, all the adversary can do is to partition the network into disjoint sets, where in each set the computation is secure in of itself, and also independent of the computation in the other sets. In this setting we provide, for the first time, nontrivial security guarantees in a model with no setup assumptions whatsoever. We also obtain similar results while guaranteeing universal composability, in some variants of the common reference string model. Finally, our protocols can be used to provide conceptually simple and unified solutions to a number of problems that were studied separately in the past, including password-based authenticated key exchange and nonmalleable commitments. As an application of our results, we study the question of constructing secure protocols in partially authenticated networks, where some of the links are authenticated, and some are not (as is the case in most networks today).     

Knowledge-based part correspondence

This paper presents a direct method for finding corresponding pairs of parts between two shapes. Statistical knowledge about a large number of parts from many different objects is used to find a part correspondence between two previously unseen input shapes. No class membership information is required. The knowledge-based approach is shown to produce significantly better results than a classical metric distance approach. The potential role of part correspondence as a complement to geometric and structural comparisons is discussed.     

Long-range and energy-efficient optical networking for tiny sensors

Wireless Networks - Acquiring real time sensory data using remote swarms of tiny sensors depends on efficient wireless networking. Often, battery longevity of the sensors is a critical design...     

Synthesis, growth, structural, optical, photoconductivity and dielectric studies on potassium p-nitrophenolate dihydrate: A new semiorganic nonlinear optical material

Potassium p-nitrophenolate dihydrate, a potential semiorganic nonlinear optical material, has been synthesized and grown by slow evaporation technique at room temperature. Single crystal X-ray analysis presents an unprecedented bonding between ions in the crystal with acentric structure. In the new structural investigation, p-nitrophenolate instead of producing bond between phenolic O⁻ and K⁺, it seems to put nitro group in bonding with the metal ion. Optical absorption shows excellent transmission in the entire visible and near-infrared region. Room temperature photocurrent, transport properties are carried out in order to enhance the application for second harmonic generation and opto-electronic devices. Dielectric constant is found to be independent at higher frequencies. The crystal possesses prominent positive photoconduction in the presence of photoactive centers formed with trap energy level. The nonlinear optical activity is confirmed by Kurtz powder test.     

Creating a consensus ranking of proposals from reviewers’ partial ordinal rankings

Peer review of research proposals and articles is an essential element in R&D processes worldwide. In most cases, each reviewer evaluates a small subset of the candidate proposals. The review board is then faced with the challenge of creating an overall “consensus” ranking on the basis of many partial rankings. In this paper we propose a branch-and-bound model to support the construction of an aggregate ranking from the partial rankings provided by the reviewers. In a recent paper we proposed ways to allocate proposals to reviewers so as to achieve the maximum possible overlap among the subsets of proposals allocated to different reviewers. Here, we develop a special branch-and-bound algorithm that utilizes the overlap generated through our earlier methods to enable discrimination in ranking the competing proposals. The effectiveness and efficiency of the algorithm is demonstrated with small numerical examples and tested through an extensive simulation experiment.