938 resultados para k-Error linear complexity
Resumo:
The present report investigates the role of formate species as potential reaction intermediates for the WGS reaction (CO + H2O -> CO2 + H-2) over a Pt-CeO2 catalyst. A combination of operando techniques, i.e., in situ diffuse reflectance FT-IR (DRIFT) spectroscopy and mass spectrometry (MS) during steady-state isotopic transient kinetic analysis (SSITKA), was used to relate the exchange of the reaction product CO2 to that of surface formate species. The data presented here suggest that a switchover from a non-formate to a formate-based mechanism could take place over a very narrow temperature range (as low as 60 K) over our Pt-CeO2 catalyst. This observation clearly stresses the need to avoid extrapolating conclusions to the case of results obtained under even slightly different experimental conditions. The occurrence of a low-temperature mechanism, possibly redox or Mars van Krevelen-like, that deactivates above 473 K because of ceria over-reduction is suggested as a possible explanation for the switchover, similarly to the case of the CO-NO reaction over Cu, I'd and Rh-CeZrOx (see Kaspar and co-workers [1-3]). (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
In this paper, a reduced-complexity soft-interference-cancellation minimum mean-square-error.(SIC-MMSE) iterative equalization method for severe time-dispersive multiple-input-multiple-output (MIMO) channels is proposed. To mitigate the severe time dispersiveness of the channel, a single carrier with cyclic prefix is employed, and the equalization is per-formed in the frequency domain. This simplifies the challenging problem of equalization in MIMO channels due to both the intersymbol interference (ISI) and the coantenna interference (CAI). The proposed iterative algorithm works in two stages. The first stage estimates the transmitted frequency-domain symbols using a low-complexity SIC-MMSE equalizer. The second stage converts the estimated frequency-domain symbols in the time domain and finds their means and variances to incorporate in the SIC-MMSE equalizer in the next iteration. Simulation results show the bit-/symbol-error-rate performance of the SIC-MMSE equalizer, with and without coding, for various modulation schemes.
Resumo:
In this paper, we propose a novel linear transmit precoding strategy for multiple-input, multiple-output (MIMO) systems employing improper signal constellations. In particular, improved zero-forcing (ZF) and minimum mean square error (MMSE) precoders are derived based on modified cost functions, and are shown to achieve a superior performance without loss of spectrum efficiency compared to the conventional linear and nonlinear precoders. The superiority of the proposed precoders over the conventional solutions are verified by both simulation and analytical results. The novel approach to precoding design is also applied to the case of an imperfect channel estimate with a known error covariance as well as to the multi-user scenario where precoding based on the nullspace of channel transmission matrix is employed to decouple multi-user channels. In both cases, the improved precoding schemes yield significant performance gain compared to the conventional counterparts.
Resumo:
This paper proposes a new hierarchical learning structure, namely the holistic triple learning (HTL), for extending the binary support vector machine (SVM) to multi-classification problems. For an N-class problem, a HTL constructs a decision tree up to a depth of A leaf node of the decision tree is allowed to be placed with a holistic triple learning unit whose generalisation abilities are assessed and approved. Meanwhile, the remaining nodes in the decision tree each accommodate a standard binary SVM classifier. The holistic triple classifier is a regression model trained on three classes, whose training algorithm is originated from a recently proposed implementation technique, namely the least-squares support vector machine (LS-SVM). A major novelty with the holistic triple classifier is the reduced number of support vectors in the solution. For the resultant HTL-SVM, an upper bound of the generalisation error can be obtained. The time complexity of training the HTL-SVM is analysed, and is shown to be comparable to that of training the one-versus-one (1-vs.-1) SVM, particularly on small-scale datasets. Empirical studies show that the proposed HTL-SVM achieves competitive classification accuracy with a reduced number of support vectors compared to the popular 1-vs-1 alternative.
Resumo:
Social identity complexity defines people's more or less complex cognitive representations of the interrelationships among their multiple ingroup identities. Being high in complexity is contingent on situational, cognitive, or motivational factors, and has positive consequences for intergroup relations. Two survey studies conducted in Northern Ireland examined the extent to which intergroup contact and distinctiveness threat act as antecedents, and outgroup attitudes as consequences, of social identity complexity. In both studies, contact was positively, and distinctiveness threat negatively, associated with complex multiple ingroup perceptions, whereas respondents with more complex identity structures also reported more favorable outgroup attitudes. Social identity complexity also mediated the effects of contact and distinctiveness threat on attitudes. This research highlights that the extent to which individuals perceive their multiple ingroups in more or less complex and differentiated ways is of central importance to understanding intergroup phenomena.
Resumo:
This paper investigates the center selection of multi-output radial basis function (RBF) networks, and a multi-output fast recursive algorithm (MFRA) is proposed. This method can not only reveal the significance of each candidate center based on the reduction in the trace of the error covariance matrix, but also can estimate the network weights simultaneously using a back substitution approach. The main contribution is that the center selection procedure and the weight estimation are performed within a well-defined regression context, leading to a significantly reduced computational complexity. The efficiency of the algorithm is confirmed by a computational complexity analysis, and simulation results demonstrate its effectiveness. (C) 2010 Elsevier B.V. All rights reserved.