Putting Queens in Carry Chains,N<Superscript><Emphasis Type="Italic">o</Emphasis>̱</Superscript>27

The N-Queens Puzzle is a fascinating combinatorial problem. Up to now, the number of distinct valid placements of N non-attacking queens on a generalized N × N chessboard cannot be computed by a formula. The computation of these numbers is instead based on an exhaustive search whose complexity grows dramatically with the problem size N. Solutions counts are currently known for all N up to 26. The parallelization of the search for solutions is embarrassingly simple. It is achieved by pre-placing the queens within a certain board region. These pre-placements partition the search space. The chosen extent of the pre-placement allows for a wide range of the partitioning granularity. This ease of partitioning makes the N-Queens Puzzle a great show-off case for tremendously parallel computation approaches and a flexible benchmark for parallel compute resources. This article presents the Q27 Project, an open-source effort targeting the computation of the solution count of the 27-Queens Puzzle. It is the first undertaking pushing the frontier of the N-Queens Puzzle that exploits the complete symmetry group D ₄ of the square. This reduces the overall computational complexity already to an eighth in comparison to a naive exploration of the whole search space. This article details the coronal pre-placement that enables the partitioning of the overall search under this approach. With respect to the physical implementation of the computation, it describes the hardware structure that explores the resulting subproblems efficiently by exploiting bit-level operations and their mapping to FPGA devices as well as the infrastructure that organizes the contributing devices in a distributed computation. The performance of several FPGA platforms is evaluated using the Q27 computation as a benchmark, and some intriguing observations obtained from the available partial solutions are presented. Finally, an estimate on the remaining run time and on the expected magnitude of the final result is dared.     

Effect of Bismuth Nanotubes on the Thermoelectric Properties of BiSb Alloy Nanocomposites

Bismuth nanotubes have been synthesized and successfully included in Bi_1?x Sb _x nanoalloys to form composite structures. The nanotubes were synthesized by transformation of a β-BiI precursor with n-BuLi solution leading to tubular bismuth structures. The Bi_1?x Sb _x nanoalloys were produced by ball milling. Three series of composite structures were synthesized by including different fractions (0 wt.%, 3 wt.%, 5 wt.%) of nanotubes in nanoalloys of different composition x. Investigation of thermoelectric and structural properties revealed a decrease of the thermal conductivity of up to 40% for the composites in comparison with alloys without nanotube inclusions. This effect can be attributed to enhanced phonon scattering. Seebeck coefficients and electrical conductivities were both slightly enhanced in the composite series with 3 wt.% nanotube inclusions, leading to enhancement of $$ ZT \ \left(ZT=\frac {(S^2 \sigma)}{\kappa}\,{ {T}}\right) $$ throughout the series compared with the nanoalloy series without nanotube inclusions.     

Low overhead assignment of symbolic coordinates in sensor networks

Approximate information on the location of nodes in a sensor network is essential to many types of sensor network applications and algorithms. In many cases, using symbolic coordinates is an attractive alternative to the use of geographic coordinates due to lower costs and lower requirements on the available location information during coordinate assignment. In this paper, we investigate different possible methods of assigning symbolic coordinates to sensor nodes. We present a method based on broadcasting coordinate messages and filtering using sensor events. We show in the evaluation that this method allows a reliable assignment of symbolic coordinates while only generating a low overhead.     

Diketopyrrolopyrrole Organic Thin‐Film Transistors: Impact of Alkyl Substituents and Tolerance of Ethylhexyl Stereoisomers

Bis(thiophen‐2‐yl)‐diketopyrrolopyrrole (DPP) dyes bearing various alkyl substituents at the amide positions (n‐butyl, n‐pentyl, n‐hexyl, n‐heptyl, n‐octyl, 2‐ethylhexyl) and chlorine (Cl), bromine (Br), or cyano (CN) substituents at the thiophene positions have been synthesized and investigated with regard to their molecular and semiconducting properties. Intense absorption, strong fluorescence, and reversible oxidation and reduction processes are common to all of these dyes. Their characterization as organic semiconductors in vacuum‐processed thin‐film transistors reveals p‐channel operation with field‐effect mobilities ranging from 0.01 to 0.7 cm² V^?1 s^?1. The highest mobility is found for the DPP dyes bearing the 2‐ethylhexyl substituents, which is surprising, considering that as a result of the chiral substituents, this material is a mixture of (R,R), (S,S), and (R,S) stereoisomers. The high carrier mobility in the films of the DPPs bearing stereoisomerically inhomogeneous ethylhexyl groups is rationalized here by single‐crystal X‐ray diffraction (XRD) analysis in combination with XRD and atomic force microscopy studies on thin films, which reveal the presence of slightly different 2D layer arrangements for the n‐alkyl and the 2‐ethylhexyl derivatives. For the cyano‐substituted DPPs possessing the lowest LUMO levels, ambipolar transport characteristics are observed.     

Efficient implementation of a frame aggregation unit for optical frame-based switching

Aggregating Ethernet frame or IP packet in large fixed-size frames allows for building scalable core network architectures. Classifying the arriving traffic based on destination core node information and quality of service parameters alleviates the need of performing table look-ups on packet basis. These advantages come at the cost of extra logic at the network egress, as regards implementation, and additional jitter due to the frame assembly process. This paper describes the efficient implementation of a frame aggregation unit that gathers Ethernet packets in G.709 containers, handles 10 Gb/s links, performs classification based on 24-byte headers, and includes a highly pipelined Queue Manager to cope with the considered rates while a specific scheduler controls the quality of service per core network flow. Based on the developed demonstrator, we provide results both as regards area and performance for an FPGA (field programmable gate array) Virtex-4 implementation as well as regarding the introduced jitter.     

Carbon hard masks for etching sub-90 nm structures

Carbon hard mask structures have been used to etch a variety of materials typically used in sub 90 nm DRAM manufacture. The results indicate that carbon hard masks can be used very effectively to structure oxide, nitride and metal films giving the CD performance required for the technologies being investigated.     

The Impact of Shadowing and the Severity of Fading on the First and Second Order Statistics of the Capacity of OSTBC MIMO Nakagami-Lognormal Channels

This article presents a thorough statistical analysis of the capacity of orthogonal space-time block coded (OSTBC) multiple-input multiple-output (MIMO) Nakagami- lognormal (NLN) channels. The NLN channel model allows to study the joint effects of fast fading and shadowing on the statistical properties of the channel capacity. We have derived exact analytical expressions for the probability density function (PDF), cumulative distribution function (CDF), level-crossing rate (LCR), and average duration of fades (ADF) of the capacity of MIMO NLN channels. It is observed that an increase in the MIMO dimension or a decrease in the severity of fading results in an increase in the mean channel capacity, while the variance of the channel capacity decreases. On the other hand, an increase in the shadowing standard deviation increases the spread of the channel capacity, however the shadowing effect has no influence on the mean channel capacity. We have also presented approximation results for the statistical properties of the channel capacity, obtained using the Gauss-Hermite integration method. It is observed that approximation results not only reduce the complexity, but also have a very good fitting with the exact results. The presented results are very useful and general because they provide the flexibility to study the impact of shadowing on the channel capacity under different fading conditions. Moreover, the effects of severity of fading on the channel capacity can also be studied. The correctness of theoretical results is confirmed by simulations.     

BCI Competition 2003--Data set IIb: support vector machines for the P300 speller paradigm

We propose an approach to analyze data from the P300 speller paradigm using the machine-learning technique support vector machines. In a conservative classification scheme, we found the correct solution after five repetitions. While the classification within the competition is designed for offline analysis, our approach is also well-suited for a real-world online solution: It is fast, requires only 10 electrode positions and demands only a small amount of preprocessing.