On-Line Construction of Two-Dimensional Suffix Trees in O(n<Superscript>2</Superscript> log n) Time

The two-dimensional suffix tree of an n × n square matrix A is a compacted trie that represents all square submatrices of A[11]. For the off-line case, i.e., A is given in advance to the algorithm, it is known how to build it in optimal time, for any type of alphabet size [11],[18]. Motivated by applications in Image Compression[22[, Giancarlo and Guaiana [14] considered the on-line version of the two-dimensional suffix tree and presented an O(n² log² n)-time algorithm, which we refer to as GG. That algorithm is a nontrivial generalization of Ukkonen's on-line algorithm for standard suffix trees [23]. The main contribution in this paper is an O(log n) factor improvement in the time complexity of the GG algorithm, making it optimal for unbounded alphabets [9]. Moreover, the ideas presented here also lead to a major simplification of the GG algorithm. Technically, we are able to preserve most of the structure of the original GG algorithm, by reducing a computational bottleneck to a primitive operation, i.e., comparison of Lcharacters, which is here implemented in constant time rather than O(log n) time as in GG. However, preserving that structure comes at a price. Indeed, in order to make everything work, we need a careful reorganization of another fundamental algorithm: Weiner's algorithm for the construction of standard suffix trees [24]. Specifically, here we provide a version of that algorithm which takes linear time and works on-line and concurrently over a set of strings.     

Optimized windows for FIR filter design to perform maximally flatdecimation stages in signal conditioning

New cosine windows, the coefficients of which have been computed through a simple optimization procedure, are proposed to minimize the sidelobe ripples. This allows maximally flat low-pass finite-duration impulse-response (FIR) filter realizations in a multistage-decimation process. In digital measuring devices this strategy is performed in order to limit the amount of data to the storage capabilities of the processor, in conjunction with filtering the data set available after oversampling to remove digitally the noise power produced by quantization. The consequent increase of the number of effective bits improves the dynamic performance of digital instrumentation, especially at lower frequencies     

Carbon-13 nuclear magnetic resonance spectra of model hydroaromatic hydrocarbons and solvent

Carbon-13 chemical shifts are reported for tetralin, hydrophenanthrenes and hydropyrenes and their alkyl substituted derivatives. Mono- and di- plus tri-aromatic fractions of hydrogenated phenanthrene and pyrene were also examined by carbon-13 n.m.r. and, wherever possible, the components in them identified.     

Measurement of intrinsic properties of amyloid fibrils by the peak force QNM method

We report the investigation of the mechanical properties of different types of amyloid fibrils by the peak force quantitative nanomechanical (PF-QNM) technique. We demonstrate that this technique correctly measures the Young's modulus independent of the polymorphic state and the cross-sectional structural details of the fibrils, and we show that values for amyloid fibrils assembled from heptapeptides, α-synuclein, Aβ(1-42), insulin, β-lactoglobulin, lysozyme, ovalbumin, Tau protein and bovine serum albumin all fall in the range of 2-4 GPa.     

Design of an enhanced access point to optimize TCP performance in Wi-Fi hotspot networks

In the last years, the number of Wi-Fi hotspots at public venues has undergone a substantial growth, promoting the WLAN technologies as the ubiquitous solution to provide high-speed wireless connectivity in public areas. However, the adoption of a random access CSMA-based paradigm for the 802.11 MAC protocol makes difficult to ensure high throughput and a fair allocation of radio resources in 802.11-based WLANs. In this paper we evaluate extensively via simulations the interaction between the flow control mechanisms implemented at the TCP layer and the contention avoidance techniques used at the 802.11 MAC layer. We conducted our study considering initially M wireless stations performing downloads from the Internet. From our results, we observed that the TCP downlink throughput is not limited by the collision events, but by the inability of the MAC protocol to assign a higher chance of accessing the channel to the base station. We propose a simple and easy to implement modification of the base station’s behavior with the purpose of increasing the TCP throughput reducing useless MAC protocol overheads. With our scheme, the base station is allowed to transmit periodically bursts of data frames towards the mobile hosts. We design a resource allocation protocol aimed at maximizing the success probability of the uplink transmissions by dynamically adapting the burst length to the collision probability estimated by the base station. By its design, our scheme is also beneficial to achieve a fairer allocation of the channel bandwidth among the downlink and uplink flows, and among TCP and UDP flows. Simulation results confirm both the improvement in the TCP downlink throughput and the reduction of system unfairness.