Constructive quantum scaling of unitary matrices

In this work, we present a method of decomposition of arbitrary unitary matrix \(U\in \mathbf {U}(2^k)\) into a product of single-qubit negator and controlled-\(\sqrt{\text{ NOT }}\) gates. Since the product results with negator matrix, which can be treated as complex analogue of bistochastic matrix, our method can be seen as complex analogue of Sinkhorn–Knopp algorithm, where diagonal matrices are replaced by adding and removing an one-qubit ancilla. The decomposition can be found constructively, and resulting circuit consists of \(O(4^k)\) entangling gates, which is proved to be optimal. An example of such transformation is presented.     

In Face on Facebook: Brooklyn's Drag Community and Sociotechnical Practices of Online Communication

Recently, Brooklyn has seen an explosion of drag culture, with dozens of performers taking the stage in any given week. Social media plays a vital role for members of this community, simultaneously allowing self‐promotion and community solidarity. Drawing on focus group interviews, we analyze the communication practices of Brooklyn's drag performers, examining both the advantages and drawbacks of social media platforms. Using conceptual frameworks of faceted identity and relational labor, our discussion focuses on affordances and constraints of multifaceted identity in online contexts and theories of seamful design. We contend that by analyzing online communication practices of drag performers, it becomes possible to identify gaps between embedded ideologies of mainstream social media technologies and the localized values of outsider communities.     

Numerical Modelling of Natural Draft Wet-Cooling Towers

Numerical modelling of natural draft wet-cooling towers is considered in this paper. Development of a complete CFD model capable of predicting cooling tower performance under various operating conditions is presented. A step-by-step approach is employed, thus one-dimensional numerical modelling of counterflow heat and mass exchangers is extensively presented first. This is followed by reduced order modelling of heat and mass transfer in cooling tower fills by means of proper orthogonal decomposition radial basis function networks. Then the approaches in modelling of droplet zones (rain and spray zones) are discussed. Finally the two and three-dimensional CFD models are discussed.     

Fabrication of sealed nanofluidic channels using site-selective direct write (maskless) X-ray lithography

Sealed nanofluidic channels with cross-sections as small as 60 nm × 60 nm were created in polymer bilayers using the focused X-rays of a scanning transmission X-ray microscope. These structures were then characterized by near-edge X-ray absorption fine structure spectromicroscopy, atomic force microscopy and scanning electron microscopy. The cross-sectional area of the nanochannels could be tuned by adjusting the area patterned in x and y and/or manipulating the bottom layer thickness. The maximum length was found to be limited by the efficiency of excavation of patterned material out of the channel, and the stability of the polymer overlayer which seals the channel. Schemes toward interfacing these nanochannels with conventional microfluidics are discussed.     

Robust real-time unusual event detection using multiple fixed-location monitors

We present a novel algorithm for detection of certain types of unusual events. The algorithm is based on multiple local monitors which collect low-level statistics. Each local monitor produces an alert if its current measurement is unusual, and these alerts are integrated to a final decision regarding the existence of an unusual event. Our algorithm satisfies a set of requirements that are critical for successful deployment of any large-scale surveillance system. In particular it requires a minimal setup (taking only a few minutes) and is fully automatic afterwards. Since it is not based on objects' tracks, it is robust and works well in crowded scenes where tracking-based algorithms are likely to fail. The algorithm is effective as soon as sufficient low-level observations representing the routine activity have been collected, which usually happens after a few minutes. Our algorithm runs in realtime. It was tested on a variety of real-life crowded scenes. A ground-truth was extracted for these scenes, with respect to which detection and false-alarm rates are reported.     

What if computers could think?

The question whether or not computers can think was first asked in print by Alan Turing in his seminal 1950 article. In order to avoid defining what a computer is or what thinking is, Turing resorts to the imitation game which is a test that allows us to determine whether or not a machine can think. That is, if an interrogator is unable to tell whether responses to his questions come from a human being or from a machine, the machine is imitating a human being so well that it has to be acknowledged that these responses result from its thinking. However, then as now, it is not an indisputable claim that machines could think, and an unceasing stream of papers discussing the validity of the test proves this point. There are many arguments in favour of, as well as against, the claims borne by the test, and Turing himself discusses some of them. In his view, there are mice possible objections to the concept of a thinking machine, which he eventually dismisses as weak, irrelevant, or plain false. However, as he admits, he can present no very convincing arguments of a positive nature to support my views. If I had I should not have taken such pains to point out the fallacies in contrary views.     

Hybrid image steganography method using Lempel Ziv Welch and genetic algorithms for hiding confidential data

Multidimensional Systems and Signal Processing - Digital images are commonly used in steganography due to the popularity of digital image transfer and exchange through the Internet. However, the...