Beyond the formal/informal economy binary hierarchy

Purpose – This paper aims to evaluate critically the conventional binary hierarchical representation of the formal/informal economy dualism which reads informal employment as a residual and marginal sphere that has largely negative consequences for economic development and needs to be deterred. Design/methodology/approach – To contest this depiction, the results of 600 household interviews conducted in Ukraine during 2005/2006 on the extent and nature of their informal employment are reported. Findings – Informal employment is revealed to be an extensively used form of work and, through a richer and more textured understanding of the multiple roles that different forms of informal employment play, a form of work that positively contributes to economic and social development, acting both as an important seedbed for enterprise creation and development and as a primary vehicle through which community self-help is delivered in contemporary Ukraine. Research limitations/implications – This survey reveals that depicting informal employment as a hindrance to development and deterring engagement in this sphere results in state authorities destroying the entrepreneurial endeavour and active citizenship that other public policies are seeking to nurture. The paper concludes by addressing how this public policy paradox might start to be resolved. Originality/value – This paper is one of the first to document the role of informal employment in nurturing enterprise creation and development as well as community exchange.

Binary sparse nonnegative matrix factorization

This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing process of B-SNMF are much faster than those of binary principal component analysis (B-PCA). Besides, B-SNMF is more robust to occlusions in images. Experimental results on face images demonstrate the effectiveness and the efficiency of the proposed B-SNMF.

40-Gbaud 16-QAM transmitter using tandem IQ modulators with binary driving electronic signals

We propose a novel 16-quadrature amplitude modulation (QAM) transmitter based on two cascaded IQ modulators driven by four separate binary electrical signals. The proposed 16-QAM transmitter features scalable configuration and stable performance with simple bias-control. Generation of 16-QAM signals at 40 Gbaud is experimentally demonstrated for the first time and visualized with a high speed constellation analyzer. The proposed modulator is also compared to two other schemes. We investigate the modulator bandwidth requirements and tolerance to accumulated chromatic dispersion through numerical simulations, and the minimum theoretical insertion attenuation is calculated analytically.

Cues to deception in a textual narrative context:lying in written witness statements

Little research has been undertaken into high stakes deception, and even less into high stakes deception in written text. This study addresses that gap. In this thesis, I present a new approach to detecting deception in written narratives based on the definition of deception as a progression and focusing on identifying deceptive linguistic strategy rather than individual cues. I propose a new approach for subdividing whole narratives into their constituent episodes, each of which is linguistically profiled and their progression mapped to identify authors’ deceptive strategies based on cue interaction. I conduct a double blind study using qualitative and quantitative analysis in which linguistic strategy (cue interaction and progression) and overall cue presence are used to predict deception in witness statements. This results in linguistic strategy analysis correctly predicting 85% of deceptive statements (92% overall) compared to 54% (64% overall) with cues identified on a whole statement basis. These results suggest that deception cues are not static, and that the value of individual cues as deception predictors is linked to their interaction with other cues. Results also indicate that in certain cue combinations, individual self-references (I, Me and My), previously believed to be indicators of truthfulness, are effective predictors of deceptive linguistic strategy at work

All-optical binary counter

We experimentally demonstrate an all-optical binary counter composed of four semiconductor optical amplifier based all-optical switching gates. The time-of-flight optical circuit operates with bit-differential delays between the exclusive-OR gate used for modulo-2 binary addition and the AND gate used for binary carry detection. A movie of the counter operating in real time is presented.

A non-linear encoder using a binary counterfor pulse-code modulation

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

A hierarchy of phase transitions in optimal neuronal coding:from binary to M-ary discrete optimal codes

We have investigated how optimal coding for neural systems changes with the time available for decoding. Optimization was in terms of maximizing information transmission. We have estimated the parameters for Poisson neurons that optimize Shannon transinformation with the assumption of rate coding. We observed a hierarchy of phase transitions from binary coding, for small decoding times, toward discrete (M-ary) coding with two, three and more quantization levels for larger decoding times. We postulate that the presence of subpopulations with specific neural characteristics could be a signiture of an optimal population coding scheme and we use the mammalian auditory system as an example.

Interval Prediction Based on Experts’ Statements

In the work [1] we proposed an approach of forming a consensus of experts’ statements in pattern recognition. In this paper, we present a method of aggregating sets of individual statements into a collective one for the case of forecasting of quantitative variable.

On the Error-Correcting Performance of some Binary and Ternary Linear Codes

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear time. We have used a programm written in Maple to check the monotony of P(t)ue (C,p) for the investigated codes for a finite set of points of p € [0, p/(q-1)] and in this way to determine which of them are not proper.

Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code

* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.

Hausdorff Distances for Searching in Binary Text Images

This work has been partially supported by Grant No. DO 02-275, 16.12.2008, Bulgarian NSF, Ministry of Education and Science.