Algorithm for generating defective graphene sheets

An algorithm is presented for the generation of molecular models of defective graphene fragments, containing a majority of 6-membered rings with a small number of 5- and 7-membered rings as defects. The structures are generated from an initial random array of points in 2D space, which are then subject to Delaunay triangulation. The dual of the triangulation forms a Voronoi tessellation of polygons with a range of ring sizes. An iterative cycle of refinement, involving deletion and addition of points followed by further triangulation, is performed until the user-defined criteria for the number of defects are met. The array of points and connectivities are then converted to a molecular structure and subject to geometry optimization using a standard molecular modeling package to generate final atomic coordinates. On the basis of molecular mechanics with minimization, this automated method can generate structures, which conform to user-supplied criteria and avoid the potential bias associated with the manual building of structures. One application of the algorithm is the generation of structures for the evaluation of the reactivity of different defect sites. Ab initio electronic structure calculations on a representative structure indicate preferential fluorination close to 5-ring defects.

Application of complex extreme learning machine to multiclass classification problems with high dimensionality: a THz spectra classification problem

We extend extreme learning machine (ELM) classifiers to complex Reproducing Kernel Hilbert Spaces (RKHS) where the input/output variables as well as the optimization variables are complex-valued. A new family of classifiers, called complex-valued ELM (CELM) suitable for complex-valued multiple-input–multiple-output processing is introduced. In the proposed method, the associated Lagrangian is computed using induced RKHS kernels, adopting a Wirtinger calculus approach formulated as a constrained optimization problem similarly to the conventional ELM classifier formulation. When training the CELM, the Karush–Khun–Tuker (KKT) theorem is used to solve the dual optimization problem that consists of satisfying simultaneously smallest training error as well as smallest norm of output weights criteria. The proposed formulation also addresses aspects of quaternary classification within a Clifford algebra context. For 2D complex-valued inputs, user-defined complex-coupled hyper-planes divide the classifier input space into four partitions. For 3D complex-valued inputs, the formulation generates three pairs of complex-coupled hyper-planes through orthogonal projections. The six hyper-planes then divide the 3D space into eight partitions. It is shown that the CELM problem formulation is equivalent to solving six real-valued ELM tasks, which are induced by projecting the chosen complex kernel across the different user-defined coordinate planes. A classification example of powdered samples on the basis of their terahertz spectral signatures is used to demonstrate the advantages of the CELM classifiers compared to their SVM counterparts. The proposed classifiers retain the advantages of their ELM counterparts, in that they can perform multiclass classification with lower computational complexity than SVM classifiers. Furthermore, because of their ability to perform classification tasks fast, the proposed formulations are of interest to real-time applications.

Case-based analysis in user requirements modelling for knowledge construction

Context: Learning can be regarded as knowledge construction in which prior knowledge and experience serve as basis for the learners to expand their knowledge base. Such a process of knowledge construction has to take place continuously in order to enhance the learners’ competence in a competitive working environment. As the information consumers, the individual users demand personalised information provision which meets their own specific purposes, goals, and expectations. Objectives: The current methods in requirements engineering are capable of modelling the common user’s behaviour in the domain of knowledge construction. The users’ requirements can be represented as a case in the defined structure which can be reasoned to enable the requirements analysis. Such analysis needs to be enhanced so that personalised information provision can be tackled and modelled. However, there is a lack of suitable modelling methods to achieve this end. This paper presents a new ontological method for capturing individual user’s requirements and transforming the requirements onto personalised information provision specifications. Hence the right information can be provided to the right user for the right purpose. Method: An experiment was conducted based on the qualitative method. A medium size of group of users participated to validate the method and its techniques, i.e. articulates, maps, configures, and learning content. The results were used as the feedback for the improvement. Result: The research work has produced an ontology model with a set of techniques which support the functions for profiling user’s requirements, reasoning requirements patterns, generating workflow from norms, and formulating information provision specifications. Conclusion: The current requirements engineering approaches provide the methodical capability for developing solutions. Our research outcome, i.e. the ontology model with the techniques, can further enhance the RE approaches for modelling the individual user’s needs and discovering the user’s requirements.

Mechanisms and function of flower and inflorescence reversion

Flower and inflorescence reversion involve a switch from floral development back to vegetative development, thus rendering flowering a phase in an ongoing growth pattern rather than a terminal act of the meristem. Although it can be considered an unusual event, reversion raises questions about the nature and function of flowering. It is linked to environmental conditions and is most often a response to conditions opposite to those that induce flowering. Research on molecular genetic mechanisms underlying plant development over the last 15 years has pinpointed some of the key genes involved in the transition to flowering and flower development. Such investigations have also uncovered mutations which reduce floral maintenance or alter the balance between vegetative and floral features of the plant. How this information contributes to an understanding of floral reversion is assessed here. One issue that arises is whether floral commitment (defined as the ability to continue flowering when inductive conditions no longer exist) is a developmental switch affecting the whole plant or is a mechanism which assigns autonomy to individual meristems. A related question is whether floral or vegetative development is the underlying default pathway of the plant. This review begins by considering how studies of flowering in Arabidopsis thaliana have aided understanding of mechanisms of floral maintenance. Arabidopsis has not been found to revert to leaf production in any of the conditions or genetic backgrounds analysed to date. A clear-cut reversion to leaf production has, however, been described in Impatiens balsamina. It is proposed that a single gene controls whether Impatiens reverts or can maintain flowering when inductive conditions are removed, and it is inferred that this gene functions to control the synthesis or transport of a leaf-generated signal. But it is also argued that the susceptibility of Impatiens to reversion is a consequence of the meristem-based mechanisms controlling development of the flower in this species. Thus, in Impatiens, a leaf-derived signal is critical for completion of flowering and can be considered to be the basis of a plant-wide floral commitment that is achieved without accompanying meristem autonomy. The evidence, derived from in vitro and other studies, that similar mechanisms operate in other species is assessed. It is concluded that most species (including Arabidopsis) are less prone to reversion because signals from the leaf are less ephemeral, and the pathways driving flower development have a high level of redundancy that generates meristem autonomy even when leaf-derived signals are weak. This gives stability to the flowering process, even where its initiation is dependent on environmental cues. On this interpretation, Impatiens reversion appears as an anomaly resulting from an unusual combination of leaf signalling and meristem regulation. Nevertheless, it is shown that the ability to revert can serve a function in the life history strategy (perenniality) or reproductive habit (pseudovivipary) of many plants. In these instances reversion has been assimilated into regular plant development and plays a crucial role there.

Structure and function analysis of the poliovirus cis-acting replication element (CRE)

The poliovirus cis-acting replication element (CRE) templates the uridylylation of VPg, the protein primer for genome replication. The CRE is a highly conserved structural RNA element in the enteroviruses and located within the polyprotein-coding region of the genome. We have determined the native structure of the CRE, defined the regions of the structure critical for activity, and investigated the influence of genomic location on function. Our results demonstrate that a 14-nucleotide unpaired terminal loop, presented on a suitably stable stem, is all that is required for function. These conclusions complement the recent analysis of the 14-nucleotide terminal loop in the CRE of human rhinovirus type 14. The CRE can be translocated to the 5' noncoding region of the genome, at least 3.7-kb distant from the native location, without adversely influencing activity, and CRE duplications do not adversely influence replication. We do not have evidence for a specific interaction between the CRE and the RNA-binding 3CD(pro) complex, an essential component of the uridylylation reaction, and the mechanism by which the CRE is coordinated and orientated during the reaction remains unclear. These studies provide a detailed overview of the structural determinants required for CRE function, and will facilitate a better understanding of the requirements for picornavirus replication.

Dissociating mere exposure and repetition priming as a function of word type

The mere exposure effect is defined as enhanced attitude toward a stimulus that has been repeatedly exposed. Repetition priming is defined as facilitated processing of a previously exposed stimulus. We conducted a direct comparison between the two phenomena to test the assumption that the mere exposure effect represents an example of repetition priming. In two experiments, having studied a set of words or nonwords, participants were given a repetition priming task (perceptual identification) or one of two mere exposure (affective liking or preference judgment) tasks. Repetition printing was obtained for both words and nonwords, but only nonwords produced a mere exposure effect. This demonstrates a key boundary for observing the mere exposure effect, one not readily accommodated by a perceptual representation systems (Tulving & Schacter, 1990) account, which assumes that both phenomena should show some sensitivity to nonwords and words.

Performance of GPRS coding scheme detection under severe multipath and co-channel interference as a function of soft-bit width

The General Packet Radio Service (GPRS) has been developed for the mobile radio environment to allow the migration from the traditional circuit switched connection to a more efficient packet based communication link particularly for data transfer. GPRS requires the addition of not only the GPRS software protocol stack, but also more baseband functionality for the mobile as new coding schemes have be en defined, uplink status flag detection, multislot operation and dynamic coding scheme detect. This paper concentrates on evaluating the performance of the GPRS coding scheme detection methods in the presence of a multipath fading channel with a single co-channel interferer as a function of various soft-bit data widths. It has been found that compressing the soft-bit data widths from the output of the equalizer to save memory can influence the likelihood decision of the coding scheme detect function and hence contribute to the overall performance loss of the system. Coding scheme detection errors can therefore force the channel decoder to either select the incorrect decoding scheme or have no clear decision which coding scheme to use resulting in the decoded radio block failing the block check sequence and contribute to the block error rate. For correct performance simulation, the performance of the full coding scheme detection must be taken into account.

Probability density function estimation using orthogonal forward regression

Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression technique is adopted to construct sparse kernel density estimates. The proposed algorithm incrementally minimises a leave-one-out test error score to select a sparse kernel model, and a local regularisation method is incorporated into the density construction process to further enforce sparsity. The kernel weights are finally updated using the multiplicative nonnegative quadratic programming algorithm, which has the ability to reduce the model size further. Except for the kernel width, the proposed algorithm has no other parameters that need tuning, and the user is not required to specify any additional criterion to terminate the density construction procedure. Two examples are used to demonstrate the ability of this regression-based approach to effectively construct a sparse kernel density estimate with comparable accuracy to that of the full-sample optimised Parzen window density estimate.

Sparse multioutput radial basis function network construction using combined locally regularised orthogonal least square and D-optimality experimental design

A construction algorithm for multioutput radial basis function (RBF) network modelling is introduced by combining a locally regularised orthogonal least squares (LROLS) model selection with a D-optimality experimental design. The proposed algorithm aims to achieve maximised model robustness and sparsity via two effective and complementary approaches. The LROLS method alone is capable of producing a very parsimonious RBF network model with excellent generalisation performance. The D-optimality design criterion enhances the model efficiency and robustness. A further advantage of the combined approach is that the user only needs to specify a weighting for the D-optimality cost in the combined RBF model selecting criterion and the entire model construction procedure becomes automatic. The value of this weighting does not influence the model selection procedure critically and it can be chosen with ease from a wide range of values.

Orthogonal forward selection for constructing the radial basis function network with tunable nodes

An orthogonal forward selection (OFS) algorithm based on the leave-one-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tunable nodes. This OFS-LOO algorithm is computationally efficient and is capable of identifying parsimonious RBF networks that generalise well. Moreover, the proposed algorithm is fully automatic and the user does not need to specify a termination criterion for the construction process.

Construction of tunable radial basis function networks using orthogonal forward selection

An orthogonal forward selection (OFS) algorithm based on leave-one-out (LOO) criteria is proposed for the construction of radial basis function (RBF) networks with tunable nodes. Each stage of the construction process determines an RBF node, namely, its center vector and diagonal covariance matrix, by minimizing the LOO statistics. For regression application, the LOO criterion is chosen to be the LOO mean-square error, while the LOO misclassification rate is adopted in two-class classification application. This OFS-LOO algorithm is computationally efficient, and it is capable of constructing parsimonious RBF networks that generalize well. Moreover, the proposed algorithm is fully automatic, and the user does not need to specify a termination criterion for the construction process. The effectiveness of the proposed RBF network construction procedure is demonstrated using examples taken from both regression and classification applications.

A block coprocessor for user data rate improvements to GPRS coding scheme 4

The general packet radio service (GPRS) has been developed to allow packet data to be transported efficiently over an existing circuit-switched radio network, such as GSM. The main application of GPRS are in transporting Internet protocol (IP) datagrams from web servers (for telemetry or for mobile Internet browsers). Four GPRS baseband coding schemes are defined to offer a trade-off in requested data rates versus propagation channel conditions. However, data rates in the order of > 100 kbits/s are only achievable if the simplest coding scheme is used (CS-4) which offers little error detection and correction (EDC) (requiring excellent SNR) and the receiver hardware is capable of full duplex which is not currently available in the consumer market. A simple EDC scheme to improve the GPRS block error rate (BLER) performance is presented, particularly for CS-4, however gains in other coding schemes are seen. For every GPRS radio block that is corrected by the EDC scheme, the block does not need to be retransmitted releasing bandwidth in the channel and improving the user's application data rate. As GPRS requires intensive processing in the baseband, a viable field programmable gate array (FPGA) solution is presented in this paper.

Sector, region or function? A MAD reassessment of real estate diversification in Great Britain

This paper re-examines whether it is more advantageous in terms of risk reduction to diversify by sector or region by comparing the performance of the ‘conventional’ regional classification of the UK with one based on modern socio-economic criteria using a much larger real estate data set than any previous study and the MAD portfolio approach. The general conclusion of this analysis is that property market sectors still dominate regions, however defined and so should be the first level of analysis when developing a portfolio diversification strategy. This is in line with previous research. When the performance of Functional groups is compared with the ‘conventional’ administrative regions the results here show that, when functionally based, groupings can in some cases provide greater risk reduction. In addition the underlying characteristics of these functional groups may be much more insightful and acceptable to real estate portfolio managers in considering the assets that a portfolio might contain.

The sample autocorrelation function and the detection of long-memory processes

The detection of long-range dependence in time series analysis is an important task to which this paper contributes by showing that whilst the theoretical definition of a long-memory (or long-range dependent) process is based on the autocorrelation function, it is not possible for long memory to be identified using the sum of the sample autocorrelations, as usually defined. The reason for this is that the sample sum is a predetermined constant for any stationary time series; a result that is independent of the sample size. Diagnostic or estimation procedures, such as those in the frequency domain, that embed this sum are equally open to this criticism. We develop this result in the context of long memory, extending it to the implications for the spectral density function and the variance of partial sums of a stationary stochastic process. The results are further extended to higher order sample autocorrelations and the bispectral density. The corresponding result is that the sum of the third order sample (auto) bicorrelations at lags h,k≥1, is also a predetermined constant, different from that in the second order case, for any stationary time series of arbitrary length.

Endocannabinoids in neuroendopsychology: multiphasic control of mitochondrial function

The endocannabinoid system (ECS) is a construct based on the discovery of receptors that are modulated by the plant compound tetrahydrocannabinol and the subsequent identification of a family of nascent ligands, the 'endocannabinoids'. The function of the ECS is thus defined by modulation of these receptors-in particular, by two of the best-described ligands (2-arachidonyl glycerol and anandamide), and by their metabolic pathways. Endocannabinoids are released by cell stress, and promote both cell survival and death according to concentration. The ECS appears to shift the immune system towards a type 2 response, while maintaining a positive energy balance and reducing anxiety. It may therefore be important in resolution of injury and inflammation. Data suggest that the ECS could potentially modulate mitochondrial function by several different pathways; this may help explain its actions in the central nervous system. Dose-related control of mitochondrial function could therefore provide an insight into its role in health and disease, and why it might have its own pathology, and possibly, new therapeutic directions.