Optimal power budget in quasi-linear dispersion-managed fiber links

We develop a theory of an optimal distribution of the gain of in-line amplifiers in dispersion-managed transmission systems. As an example of the application of the general method we propose a design of the line with periodically imbalanced in-line amplification.

Crystal structure and physical properties of the new linear chain compound [Cu(1,2-bis(tetrazol-1-yl)ethane)3](ClO4)2

The synthesis and crystal structure of a novel one-dimensional Cu(II) compound [Cu(1,2-bis(tetrazol-1-yl)ethane)3](ClO4)2 are described. The single-crystal X-ray structure determination was carried out at 298 K. The molecular structure consists of a linear chain in which the Cu(II) ions are linked by three N4,N4' coordinating bis(tetrazole) ligands in syn conformation. The Cu(II) ions are in a Jahn-Teller distorted octahedral environment (Cu(1)-N(11)=2.034(2) Å, Cu(1)-N(21)=2.041(2) Å and Cu(1)-N(31)=2.391(2) Å). The Cu⋯Cu separations are 7.420(3) Å.

Travelling-wave model of semiconductor optical amplifier based non-linear loop mirror

A travelling-wave model of a semiconductor optical amplifier based non-linear loop mirror is developed to investigate the importance of travelling-wave effects and gain/phase dynamics in predicting device behaviour. A constant effective carrier recovery lifetime approximation is found to be reasonably accurate (±10%) within a wide range of control pulse energies. Based on this approximation, a heuristic model is developed for maximum computational efficiency. The models are applied to a particular configuration involving feedback.

On the Vertex Separation of Cactus Graphs

This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a \main theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.

Improving the Watermarking Process with Usage of Block Error-Correcting Codes

The emergence of digital imaging and of digital networks has made duplication of original artwork easier. Watermarking techniques, also referred to as digital signature, sign images by introducing changes that are imperceptible to the human eye but easily recoverable by a computer program. Usage of error correcting codes is one of the good choices in order to correct possible errors when extracting the signature. In this paper, we present a scheme of error correction based on a combination of Reed-Solomon codes and another optimal linear code as inner code. We have investigated the strength of the noise that this scheme is steady to for a fixed capacity of the image and various lengths of the signature. Finally, we compare our results with other error correcting techniques that are used in watermarking. We have also created a computer program for image watermarking that uses the newly presented scheme for error correction.

On the Vertex Separation of Maximal Outerplanar Graphs

We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.

Necessary and Sufficient Conditions for the Extendability of Ternary Linear Codes

We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.

Fast Linear Algorithm for Active Rules Application in Transition P Systems

Transition P systems are computational models based on basic features of biological membranes and the observation of biochemical processes. In these models, membrane contains objects multisets, which evolve according to given evolution rules. In the field of Transition P systems implementation, it has been detected the necessity to determine whichever time are going to take active evolution rules application in membranes. In addition, to have time estimations of rules application makes possible to take important decisions related to the hardware / software architectures design. In this paper we propose a new evolution rules application algorithm oriented towards the implementation of Transition P systems. The developed algorithm is sequential and, it has a linear order complexity in the number of evolution rules. Moreover, it obtains the smaller execution times, compared with the preceding algorithms. Therefore the algorithm is very appropriate for the implementation of Transition P systems in sequential devices.

Bit error rate estimation methods for QPSK CO-OFDM transmission

Coherent optical orthogonal frequency division multiplexing (CO-OFDM) is an attractive transmission technique to virtually eliminate intersymbol interference caused by chromatic dispersion and polarization-mode dispersion. Design, development, and operation of CO-OFDM systems require simple, efficient, and reliable methods of their performance evaluation. In this paper, we demonstrate an accurate bit error rate estimation method for QPSK CO-OFDM transmission based on the probability density function of the received QPSK symbols. By comparing with other known approaches, including data-aided and nondata-aided error vector magnitude, we show that the proposed method offers the most accurate estimate of the system performance for both single channel and wavelength division multiplexing QPSK CO-OFDM transmission systems. © 2014 IEEE.

Nonlinear communication channels with capacity above the linear Shannon limit

We prove that, under certain conditions, the capacity of an optical communication channel with in-line, nonlinear filtering (regeneration) elements can be higher than the Shannon capacity for the corresponding linear Gaussian white noise channel. © 2012 Optical Society of America.

The influence on unaided vision of age, pupil diameter and spherocylindrical refractive error

Background - The aim was to derive equations for the relationship between unaided vision and age, pupil diameter, iris colour and sphero-cylindrical refractive error. Methods - Data were collected from 663 healthy right eyes of white subjects aged 20 to 70 years. Subjective sphero-cylindrical refractive errors ranged from -6.8 to +9.4 D (mean spherical equivalent), -1.5 to +1.9 D (orthogonal component, J0) and -0.8 to 1.0 D (oblique component, J45). Cylinder axis orientation was orthogonal in 46 per cent of the eyes and oblique in 18 per cent. Unaided vision (-0.3 to +1.3 logMAR), pupil diameter (2.3 to 7.5 mm) and iris colour (67 per cent light/blue irides) was recorded. The sample included mostly females (60 per cent) and many contact lens wearers (42 per cent) and so the influences of these parameters were also investigated. Results - Decision tree analysis showed that sex, iris colour, contact lens wear and cylinder axis orientation did not influence the relationship between unaided vision and refractive error. New equations for the dependence of the minimum angle of resolution on age and pupil diameter arose from step backwards multiple linear regressions carried out separately on the myopes (2.91.scalar vector +0.51.pupil diameter -3.14 ) and hyperopes (1.55.scalar vector + 0.06.age – 3.45 ). Conclusion - The new equations may be useful in simulators designed for teaching purposes as they accounted for 81 per cent (for myopes) and 53 per cent (for hyperopes) of the variance in measured data. In comparison, previously published equations accounted for not more than 76 per cent (for myopes) and 24 per cent (for hyperopes) of the variance depending on whether they included pupil size. The new equations are, as far as is known to the authors, the first to include age. The age-related decline in accommodation is reflected in the equation for hyperopes.

Note on an Improvement of the Griesmer Bound for q-ary Linear Codes

Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k and d with k ≥ 3, 1 ≤ d ≤ q^(k−1) and a prime or a prime power q. The purpose of this note is to show that there exists a series of the functions h3,q, h4,q, ..., hk,q such that nq(k, d) can be expressed.

A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs

ACM Computing Classification System (1998): G.2.2.

Linear Fresnel mirror solar concentrator with tracking

Solar energy is the most abundant, widely distributed and clean renewable energy resource. Since the insolation intensity is only in the range of 0.5 - 1.0 kW/m2, solar concentrators are required for attaining temperatures appropriate for medium and high temperature applications. The concentrated energy is transferred through an absorber to a thermal fluid such as air, water or other fluids for various uses. This paper describes design and development of a 'Linear Fresnel Mirror Solar Concentrator' (LFMSC) using long thin strips of mirrors to focus sunlight on to a fixed receiver located at a common focal line. Our LFMSC system comprises a reflector (concentrator), receiver (target) and an innovative solar tracking mechanism. Reflectors are mirror strips, mounted on tubes which are fixed to a base frame. The tubes can be rotated to align the strips to focus solar radiation on the receiver (target). The latter comprises a coated tube carrying water and covered by a glass plate. This is mounted at an elevation of few meters above the horizontal, parallel to the plane of the mirrors. The reflector is oriented along north-south axis. The most difficult task is tracking. This is achieved by single axis tracking using a four bar link mechanism. Thus tracking has been made simple and easy to operate. The LFMSC setup is used for generating steam for a variety of applications. © 2013 The Authors. Published by Elsevier Ltd.

On the k-anonymization of time-varying and multi-layer social graphs

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users’ privacy. In order to deal with malicious attacks, k -anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes’ identity. In this paper, we study the problem of ensuring k anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.