955 resultados para FEC using Reed-Solomon-like codes
Resumo:
In this paper we propose a new method for face recognition using fractal codes. Fractal codes represent local contractive, affine transformations which when iteratively applied to range-domain pairs in an arbitrary initial image result in a fixed point close to a given image. The transformation parameters such as brightness offset, contrast factor, orientation and the address of the corresponding domain for each range are used directly as features in our method. Features of an unknown face image are compared with those pre-computed for images in a database. There is no need to iterate, use fractal neighbor distances or fractal dimensions for comparison in the proposed method. This method is robust to scale change, frame size change and rotations as well as to some noise, facial expressions and blur distortion in the image
Resumo:
Facebook is approaching ubiquity in the social habits and practice of many students. However, its use in higher education has been criticised (Maranto & Barton, 2010) because it can remove or blur academic boundaries. Despite these concerns, there is strong potential to use Facebook to support new students to communicate and interact with each other (Cheung, Chiu, & Lee, 2010). This paper shows how Facebook can be used by teaching staff to communicate more effectively with students. Further, it shows how it can provide a way to represent and include beginning students’ thoughts, opinions and feedback as an element of the learning design and responsive feed-forward into lectures and tutorial activities. We demonstrate how an embedded social media strategy can be used to complement and enhance the first year curriculum experience by functioning as a transition device for student support and activating Kift’s (2009) organising principles for first year curriculum design.
Resumo:
Mycobacterium bovis BCG is considered an attractive live bacterial vaccine vector. In this study, we investigated the immune response of baboons to a primary vaccination with recombinant BCG (rBCG) constructs expressing the gag gene from a South African HIV-1 subtype C isolate, and a boost with HIV-1 subtype C Pr55 gag virus-like particles (Gag VLPs). Using an interferon enzyme-linked immunospot assay, we show that although these rBCG induced only a weak or an undetectable HIV-1 Gag-specific response on their own, they efficiently primed for a Gag VLP boost, which strengthened and broadened the immune responses. These responses were predominantly CD8+ T cell-mediated and recognised similar epitopes as those targeted by humans with early HIV-1 subtype C infection. In addition, a Gag-specific humoral response was elicited. These data support the development of HIV-1 vaccines based on rBCG and Pr55 gag VLPs. © 2009 Elsevier Ltd. All rights reserved.
Resumo:
Many educators are currently interested in using computer-mediated communications (CMCs) to support learning and creative practice. In my work I have been looking at how we might create drama through using cyberspaces, working with teachers and students in secondary school contexts. In trying to understand issues that have arisen and ways of working with the data I have found a number of frameworks helpful for analysing the online interactions. These frameworks draw from O'Toole's work on contexts negotiated in the creation of drama and other frameworks drawn from Wertsch, Bakhtin and Vygotsky's work on speech utterances, dialogic processes and internalisation of learning. The contexts and factors which must be negotiated in online communications within learning contexts are quite complex and educators may need to provide parameters and protocols to ensure appropriate languages, genres and utterances are utilised. The paper explores some of the types of languages, genres and utterances that emerged from a co-curricula drama project and issues that arose, including the importance of establishing processes for giving and receiving critical feedback This paper is of relevance to those whose research strategies may involve the use of computer-mediated communications as well as those utilising cyberspaces in educational contexts.
Resumo:
We present an approach for the inspection of vertical pole-like infrastructure using a vertical take-off and landing (VTOL) unmanned aerial vehicle and shared autonomy. Inspecting vertical structures, such as light and power distribution poles, is a time consuming, dangerous and expensive task with high operator workload. To address these issues, we propose a VTOL platform that can operate at close-quarters, whilst maintaining a safe stand-off distance and rejecting environmental disturbances. We adopt an Image based Visual Servoing (IBVS) technique using only two line features to stabilise the vehicle with respect to a pole. Visual, inertial and sonar data are used, making the approach suitable for indoor or GPS-denied environments. Results from simulation and outdoor flight experiments demonstrate the system is able to successfully inspect and circumnavigate a pole.
Thinking like Disney: Supporting the Disney method using ambient feedback based on group performance
Resumo:
The Disney method is a collaborative creativity technique that uses three roles - dreamer, realist and critic - to facilitate the consideration of different perspectives on a topic. Especially for novices it is important to obtain guidance in applying this method. One way is providing groups with a trained moderator. However, feedback about the group’s behavior might interrupt the flow of the idea finding process. We built and evaluated a system that provides ambient feedback to a group about the distribution of their statements among the three roles. Our preliminary field study indicates that groups supported by the system contribute more and roles are used in a more balanced way while the visualization does not disrupt the group work.
Resumo:
Biomethanation of herbaceous biomass feedstock has the potential to provide clean energy source for cooking and other activities in areas where such biomass availability predominates. A biomethanation concept that involves fermentation of biomass residues in three steps, occurring in three zones of the fermentor is described. This approach while attempting take advantage of multistage reactors simplifies the reactor operation and obviates the need for a high degree of process control or complex reactor design. Typical herbaceous biomass decompose with a rapid VFA flux initially (with a tendency to float) followed by a slower decomposition showing balanced process of VFA generation and its utilization by methanogens that colonize biomass slowly. The tendency to float at the initial stages is suppressed by allowing previous days feed to hold it below digester liquid which permits VFA to disperse into the digester liquid without causing process inhibition. This approach has been used to build and operate simple biomass digesters to provide cooking gas in rural areas with weed and agro-residues. With appropriate modifications, the same concept has been used for digesting municipal solid wastes in small towns where large fermentors are not viable. With further modifications this concept has been used for solid-liquid feed fermentors. Methanogen colonized leaf biomass has been used as biofilm support to treat coffee processing wastewater as well as crop litter alternately in a year. During summer it functions as a biomass based biogas plants operating in the three-zone mode while in winter, feeding biomass is suspended and high strength coffee processing wastewater is let into the fermentor achieving over 90% BOD reduction. The early field experience of these fermentors is presented.
Resumo:
A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.
Resumo:
The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.
Resumo:
An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.
Resumo:
In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source coding paradigm. Our analysis reveals that several capacity approaching LDPC codes indeed do approach the Slepian-Wolf bound for nonuniform sources as well. The Monte Carlo simulation results show that highly biased sources can be compressed to 0.049 bits/sample away from Slepian-Wolf bound for moderate block lengths.