Search

A recent hierarchical model of numerical processing, initiated by Fischer and Brugger (2011) and Fisher (2012), suggested that situated factors, such as different body postures and body movements, can influence the magnitude representation and bias numerical processing. Indeed, Loetscher and colleagues (2008) found that participants’ behavior in a random number generation (RNG) task was biased by head rotations. More small numbers were reported after leftward than rightward head turns, i.e. a motion–numerical compatibility effect. Here, by carrying out two experiments, we explored whether similar motion–numerical compatibility effects exist for movements of other important body components, e.g. arms, and for composite body movements as well, which are basis for complex human activities in many ecologically meaningful situations. In Experiment 1, a motion-numerical compatibility effect was observed for lateral rotations of two body components, i.e., the head and arms. Relatively large numbers were reported after making rightward compared to leftward movements for both lateral head and arm turns. The motion-numerical compatibility effect was observed again in Experiment 2 when participants were asked to perform composite body movements of congruent movement directions, e.g., simultaneous head left turns and arm left turns. However, it disappeared when the movement directions were incongruent, e.g., simultaneous head left turns and arm right turns. Taken together, our results extended Loetscher et al.'s (2008) finding by demonstrating that their effect is effector-general and exists for arm movements. Moreover, our study reveals for the first time that the impact of spatial information on numerical processing induced by each of the two sensorimotor-based situated factors, e.g., a lateral head turn and a lateral arm turn, can cancel each other out.

A growing body of evidence has suggested that time, from early to late, or from past to future, was represented in a spatially oriented mental time line. However, little is known about its characteristics. The present study provided the first empirical evidence to explore the symmetry of spatial representations of past and future in the mental time line. Specifically, we compared the Spatial-Temporal Association Response Codes (STARC) effects and distance effects of past and future in four experiments. Results showed that for near past and near future, STARC effects were similar (Experiment 1). For distant past, the STARC effect was significant, but not for distant future (Experiment 2). Furthermore, the distance effect in the past was significantly stronger than in the future (Experiment 3 and 4). These findings supported the idea that time points are not evenly distributed in mental time line. Spatial representations of the past and the future are asymmetric, and the spatial representation of past seems stronger than future. The logarithmic pattern of internal spatial representation of past or future is also discussed.

Pb(Zr(0.2)Ti(0.8))O3 wrapped CaFe2O4 particles were constructed on ITO coated quartz as a photocathode for efficient water splitting. A photocurrent of 152 μA cm(-2) was obtained under zero bias vs. Ag/AgCl and 100 mW cm(-2) with the assistance of positive poling and Ag decoration.

To evaluate the risk system of power communication transmission network (PCTN) scientifically, this paper puts forward an improved k-means clustering algorithm in allusion to the issue of the power device risk value in the PCNT. Both the rating of the device status and the importance of the device determine the power device risk value, among which the importance of device is decided by the number and type of tasks it bears. Since generated randomly, traditional initial clustering centers is easy to lead the result to a partial best instead of global. Therefore, this text uses an improved Huffman tree method based on adjusted cosine similarity to make sure the initial centre. It is verified that the improved k-means clustering algorithm can do better in clustering data, dividing the risk rank scientifically, which provides a reference frame for risk evaluation.

A growing body of evidence suggested that elapsing time is tightly associated with space in a specific way (e.g., Spatial Temporal Association of Response Codes or STARC effect). However, existing findings cannot justify a hypothesis that elapsing time is recoded directly into a spatial linear representation in working memory. The present study addresses this fundamental question by using three modified STARC-related working memory paradigms. In different experiments, participants were asked to give order judgment, order-irrelevant STM recognition judgment, or motor-related free-choice judgment, immediately after successive presentation of a set of disparate stimuli. Results show that responses to early stimuli were faster or more often with the left key and responses to late stimuli were faster or more often with the right key. These findings clearly support the hypothesis that elapsing time is directly and automatically recoded into a spatial linear representation in working memory.

Pb(Zr0.2Ti0.8)O3 wrapped CaFe2O4 particles on indium-tin oxide (ITO) coated quartz is tested as a photocathode for efficient water splitting.

Pb(Zr(0.2)Ti(0.8))O3 wrapped CaFe2O4 particles were constructed on ITO coated quartz as a photocathode for efficient water splitting. A photocurrent of 152 μA cm(-2) was obtained under zero bias vs. Ag/AgCl and 100 mW cm(-2) with the assistance of positive poling and Ag decoration.

A fundamental ability for humans is to monitor and process multiple temporal events that occur at different spatial locations simultaneously. A great number of studies have demonstrated simultaneous temporal processing (STP) in human and animal participants, i.e., multiple ‘clocks’ rather than a single ‘clock’. However, to date, we still have no knowledge about the exact limitation of the STP in vision. Here we provide the first experimental measurement to this critical parameter in human vision by using two novel and complementary paradigms. The first paradigm combines merits of a temporal oddball-detection task and a capacity measurement widely used in the studies of visual working memory to quantify the capacity of STP (CSTP). The second paradigm uses a two-interval temporal comparison task with various encoded spatial locations involved in the standard temporal intervals to rule out an alternative, ‘object individuation’-based, account of CSTP, which is measured by the first paradigm. Our results of both paradigms indicate consistently that the capacity limit of simultaneous temporal processing in vision is around 3 to 4 spatial locations. Moreover, the binding of the ‘local clock’ and its specific location is undermined by bottom-up competition of spatial attention, indicating that the time-space binding is resource-consuming. Our finding that the capacity of STP is not constrained by the capacity of visual working memory (VWM) supports the idea that the representations of STP are likely stored and operated in units different from those of VWM. A second paradigm confirms further that the limited number of location-bound ‘local clocks’ are activated and maintained during a time window of several hundreds milliseconds.

ERPs were elicited to (1) words, (2) pseudowords derived from these words, and (3) nonwords with no lexical neighbors, in a task involving listening to immediately repeated auditory stimuli. There was a significant early (P200) effect of phonotactic probability in the first auditory presentation, which discriminated words and pseudowords from nonwords; and a significant somewhat later (N400) effect of lexicality, which discriminated words from pseudowords and nonwords. There was no reliable effect of lexicality in the ERPs to the second auditory presentation. We conclude that early sublexical phonological processing differed according to phonotactic probability of the stimuli, and that lexically-based redintegration occurred for words but did not occur for pseudowords or nonwords. Thus, in online word recognition and immediate retrieval, phonological and/or sublexical processing plays a more important role than lexical level redintegration.

Data preprocessing plays an essential role in the process of safety equipment linkage system, directly influenced the quality and the results of the later analysis and decision-making. This paper describes the process of data preprocessing in detail, and according to the characteristics of the linkage system data, proposes an improved data cleaning method in order to improve the efficiency of data preprocessing. For each log data format is different, using XML language to describe of the log data, which provides a unified interface for safety equipment linkage system data access, and then solve the problem of heterogeneous data.

Association rules are an important branch of data mining. Aiming at the update maintenance problem of association rules when increase the database data while keep the minimum support unchanged, on the basis of FUP algorithm, this paper proposes a matrix-based incremental association rules mining algorithm, namely MBFUP algorithm. The algorithm just scans the database once, and doesn't produce candidate item sets, greatly reduces the space complexity and time complexity of the algorithm.

The original mode becomes hard to meet the requirement of power communication resource management for the network environment with complex topology structure, with multi-vendor resource in it. Since management of power communication resource is faced with a variety of challenges, it is very meaningful to set up a suitable topology for the connection of power communication resource and visualize this topology in an optimized way. This paper firstly analyzes several classic layout algorithms for topology visualization and makes a comparison among these algorithms, and then selects a modified tree layout algorithm based on a spanning tree frame to visualize the network topology according to the characteristics of power communication resource management's network topology.

WAMS (Wide Area Measurement System) is an important part of smart grid, it is the basic effective methods to realize power system dynamic security monitoring, safety and reliability of its communication network become increasingly prominent. In this paper through the identification of risk analysis and risk factors of WAMS communication network, Established the WAMS communications network risk assessment index system. The integrated use of fuzzy analytic hierarchy process and the D-S evidence theory realized quantification of all levels of the index factors in the evaluation index system, And then could determine the risk value and risk level of the WAMS communication network, Realized the quantitative risk assessment of the WAMS communications network.

For efficient utilization of solar light during photoelectrochemical (PEC) water splitting, tandem photoelectrodes comprising a wider bandgap top semiconductor stacked above a smaller bandgap one have been proposed in the previous studies. However, the photocurrent is usually limited due to the blocked transfer of photogenerated carriers on the interface between the semiconductors. Here, this study constructs an Si-pnn+/ITO/Au/BiFeO3 (BFO) hybrid photocathode catalyzed by MoS2/Pt with an intension to fulfill the efficient transfer of photogenerated electrons from Si to electrode surface. This study reveals how the local surface plasmonic resonance effect of Au nanoparticles and the depolarization electric field of BFO enhance the PEC reactivity of the photocathode, and also the catalytic effect of the combined MoS2/Pt catalyst. Remarkably, the photocathode exhibits an onset potential of 1.3 V versus reversible hydrogen electrode (RHE), and the photocurrent at 0 V versus RHE can be up to –9.1 mA cm−2 under 100 mW cm−2 Xe-lamp illuminations. Such a unique design represents a general strategy to enhance the PEC performance of a tandem photoelectrode where the energy bands are not so matched on the interfaces, and therefore extends the scope of the tandem architectures.

The overall objective of the network security situation assessment is to establish security situation assessment system. This system can unify the large-scale network. First, it provides a security policy unified the whole network. It also provides the techniques for wide-area situation assessment. At the same time this system provides situational awareness and decision support tools for the implementation of network security command. Firstly, the information model of security situation was studied based on XML. Then the security situation value of system including three levels: service, host and network was analyzed and calculated. The-support vector regression machine was chosen for predicting the network security situation and determined the parameter values. Finally, the effectiveness of the method was verified through experimental analysis.

In order to effectively finish the dynamic risk assessment of the electricity system, this paper will divide each attack into three distinct phases, The difficulty of attack is assessed by percent of each attack time of distinct stages take up in the total attack time to describe the attack difficulty in order to determine the status of the assets transition matrix, realising the dynamic nature of risk assessment. The real-time dynamic risk assessment methods based on Hidden Markov Model HMM has a strong adaptability and scalability, it can be effectively applied on the network, host, system, service level of risk assessment. This paper designs and implements the dynamic risk assessment examples power system, and then demonstrateds the dynamic assessment model.

This paper introduces an improved PSO algorithm for power communication network routing, which minimizes the cost of communication and improves the Quality of Service (QoS). In this paper, PSO algorithm is improved in two parts of the parameter inertia weight and the discrete idea is added to, so that it can easily run out the local optimum and provide high speed of convergence as well as for the proposed application. An example shows the feasibleness and effectiveness of the algorithm. And it is easier to get an optimal or nearly optimal solution in power communication network routing by using the presented algorithm.

In order to improve the accuracy of risk assessment of corporate networks, the paper introduces the concept of network shell into the field of security risk assessment. After analyzing the actual needs of corporate networks, we give the risk assessment model of network shell, then based on this model we analyze the application of network shell and give the algorithm to repair the network shell through the attack graph. After that, a calculation method of the integrated value of network shell is given. Finally, an example is given to verify the validity of assessment model.

Name agreement is the extent to which different people agree on a name for a particular picture. Previous studies have found that it takes longer to name low name agreement pictures than high name agreement pictures. To examine the effect of name agreement in the online process of picture naming, we compared event-related potentials (ERPs) recorded whilst 19 healthy, native English speakers silently named pictures which had either high or low name agreement. A series of ERP components was examined: P1 approximately 120 ms from picture onset, N1 around 170 ms, P2 around 220 ms, N2 around 290 ms, and P3 around 400 ms. Additionally, a late time window from 800 to 900 ms was considered. Name agreement had an early effect, starting at P1 and possibly resulting from uncertainty of picture identity, and continuing into N2, possibly resulting from alternative names for pictures. These results support the idea that name agreement affects two consecutive processes: first, object recognition, and second, lexical selection and/or phonological encoding. (C) 2010 Elsevier B.V. All rights reserved.

Slow convergence speed and premature are two key problems existing in the regression analysis techniques based on genetic algorithm. To overcome the shortcomings,this paper proposes an improved regression analysis based on the genetic particle swarm algorithm. The basic principle is that a new operator is constructed to use PSO. This algorithm has the choice of genetic algorithms and genetic features, and drawing on the searching capabilities of particle towards the optimal forward. Finance analysis evaluates the efficiency of the algorithm. The experimental results show,the improved regression analysis is steady and greatly improve the convergent speed.

It has been demonstrated that both wide and local area network traffic are statistically self-similar. The Hurst index is the only parameter to characterize the self-similarity. The real-time normal network data stream should accord with network traffic's statistical self-similarity and its long-range dependence (LRD) features correspondingly, which can be judged by the value of Hurst parameter. Wavelet transform is a common method used to estimate self-similar parameter. However, the wavelet analyses can not eliminate the influence of non-stationary signal's periodicity and trend term. In view of the fact that Hilbert-Huang Transform (HHT) has unique advantage on non-stationary signal treatment, a refined self-similar parameter estimation algorithm is designed in this paper through the combination of wavelet analysis and Hilbert-Huang Transform and a set of experiments are run to verify the improvement in the accuracy of parameter estimation.

With the development of information technology and the popularization of the Internet, the amount of information based on the network has raised rapidly, and the emergence and development of network information filtering provide a better choice for people to access to the information quickly, accurately and completely. In this paper, the introduction of PSO uses its simple and efficient to establish accurate user model. It takes the access and update of profile as a process of learning, adjusted, learning again. Model is updated under considering inertia weight, parameters and other factors. Then doing some experiments test it.

In view of the characteristics and the special demands of the electric power information system, this paper designs an assessment model based on variable precision rough set. Then, it uses group decision-making theory, which could make the results of the assessment more accurate and more objective, to calculate the risk value of the target system risk. And then VPRS and AHP are used to determine the index weight involved in the process of the electric power information risk assessment. Finally, it verifies the correctness of the algorithm by analyzing results of the examples of the electric power information system security assessment. We can see that the model could not only find the weakness of the system by analyzing the results got by calculating the current risk value of the electric power system, but also reduce the influence of the subjective factors in some degree.

With the rapid development of computer network, the network is confronting a growing number of threats. Therefore, it is very important to assess the risks for the network information system. This paper draws data mining technology based on association rules into the field of risk assessment, demonstrating a network security risk assessment model based on association rules. The model mines data from history vulnerability database to discover association rules of vulnerabilities, and it is applied on risk assessment of vulnerabilities. In addition, the paper shows a multidimensional association rule mining algorithm based on improved Apriori, and it is proved that it is available by the experimental results.

For evaluation of the risk in information system, variable precision rough set (VPRS) theory is emerging as a powerful tool for reasoning about data. The method for risk rules mining in information system based on VPRS is designed on the basis of related concepts of VPRS. Through the example of the assessment, it is considered that the method can not only reduce greatly the data, but also increase the validity of risk regulations.

This paper use the source of web log data and through AprioriAll algorithm among sequential pattern mining to identify the user pattern in the data pre-processing stage and based on pattern to cluster users’ path pattern and make the similarity users cluster one group in order to reduce pattern. Through testing, the method has been proven to be effective for users in personalized service.

In this article, introduced particle swarm optimization and multiply particle swarm optimization firstly, then modified BP neural network model through using multiply particle swarm optimization. According to above processes, the modified BP arithmetic was used in the Chinese word segmentation field. Applying BP network had achieved the prototype system of Chinese word segmentation. Based on PSO arithmetic, the prototype system made the network study training and used some samples of studying training to do some simulation experiments. The result of experiments expresses that the model of Chinese word segmentation’s ability obviously increased with the increasing training samples. So, the word segmentation that is proposed in this article is effective and has actual application value.

With the increasingly rich of Web resources, people need to cross-language information and knowledge sharing, cross-language information retrieval (CLIR) research on such problems. This paper brings forward a Web cross language information retrieval model based on the domain ontology. The model basing on the technologies of traditional information retrieval, use domain ontology to describe the relevant domain knowledge in different kinds of languages, comprehend and extend query terms, lead the retrieval rise to semantic level. The main ideal and methods of the model are described in detail, and through experiment to validate our approach. The experiment are designed to retrieval travel news in Chinese from Sina website with query in English, its results prove that this model can improved the average precision/recall of retrieval to certain extent.