The hidden-unit-performance-related spaces, i.e. representation space and error space, target space and expended space, are analyzed according to the model of least-squares approximation feedforward neural networks, a...
详细信息
The hidden-unit-performance-related spaces, i.e. representation space and error space, target space and expended space, are analyzed according to the model of least-squares approximation feedforward neural networks, and furthermore the criteria and the evaluation methods for the performance of hidden units are proposed. It is revealed that the efficient comp.nent of output vector of a hidden unit should be lying in error space, avoiding expended space and closing the direction of maximum energy, which are independent of the nonlinear functions used by the units, and it is permitted that different units have different activation functions. The quality factor of the hidden layer, efficient coefficient of the hidden layer, the redundancy of hidden units and the evaluation factor of the hidden layer for total evaluation are proposed for the performance evaluation of the hidden layer.
Proteases play a fundamental role in the control of intra- and extracellular processes by binding and cleaving specific amino acid sequences. Identifying these targets is extremely challenging. Current comp.tational a...
详细信息
ISBN:
(纸本)0769521940
Proteases play a fundamental role in the control of intra- and extracellular processes by binding and cleaving specific amino acid sequences. Identifying these targets is extremely challenging. Current comp.tational attempts to predict cleavage sites are limited, representing these amino acid sequences as patterns or frequency matrices. Here we present PoPS, a publicly accessible bioinformatics tool (http://***/)which provides a novel method for building comp.tational models of protease specificity that, while still being based on these amino acid sequences, can be built from any experimental data or expert knowledge available to the user. PoPS specificity models can be used to predict and rank likely cleavages within a single substrate, and within entire proteomes. Other factors, such as the secondary or tertiary structure of the substrate, can be used to screen unlikely sites. Furthermore, the tool also provides facilities to infer, comp.re and test models, and to store them in a publicly accessible database.
This paper mainly discussed the origin of the robot soccer, final goal and the trilogy of developing robot soccer in our country. To realize the final goal of the robot soccer, we should developing the low-level but e...
详细信息
This paper mainly discussed the origin of the robot soccer, final goal and the trilogy of developing robot soccer in our country. To realize the final goal of the robot soccer, we should developing the low-level but easily achieved semi-autonomous robot soccer, Secondly we should developing the autonoumous robot soccer based on Multi-Agent System, At last, we should developing the most advanced humanoid robot soccer. Finally, this paper also proposed the typical application example of the robot soccer, namely the pursuit-evasion problem of multi-robot.
We perform network inference ('reverse-engineering') on phospho-specific multi-dimensional flow cytometry measurements of signaling molecules in human T cells using Bayesian networks. Inferred networks are fou...
详细信息
ISBN:
(纸本)0769521940
We perform network inference ('reverse-engineering') on phospho-specific multi-dimensional flow cytometry measurements of signaling molecules in human T cells using Bayesian networks. Inferred networks are found to have good agreement with known pathways derived from the literature.
This paper presents a cascaded hidden Markov model (HMM), which allows states transition, skip and duration. The cascaded HMM extends the way of HMM pattern description of handwritten Chinese character (HCC) and depic...
详细信息
This paper presents a cascaded hidden Markov model (HMM), which allows states transition, skip and duration. The cascaded HMM extends the way of HMM pattern description of handwritten Chinese character (HCC) and depicts the behavior of handwritten curve more reliably in terms of the statistic probability. Hence the character segmentation and labeling are unnecessary, Viterbi algorithm is integrated with the cascaded HMM after the whole sample sequence of a HCC is input. comp.red with the segment HMMs approach, the recognition rate of this model for the first candidate is 87.89% and the error rate could be reduced by 12.4%.
Lifting factorization (LF) was one of the latest advancements of study on fast DWT implementations. Because of exponential size of the factorization set, known algorithms could not find in reasonable time all stable (...
详细信息
Lifting factorization (LF) was one of the latest advancements of study on fast DWT implementations. Because of exponential size of the factorization set, known algorithms could not find in reasonable time all stable (to say nothing of optimal) LFs of a given DWT with long filters. A so-called constant GCD (Greatest Common Divisor) factorization approach to FIR polyphase matrix was given, which contracted considerably the factorization space. Furthermore, the problem of how to evaluate a certain LF was investigated in terms of both numerical stability and comp.tation comp.exity. Consequently, an algorithm called OLFA (Optimal LF Algorithm) was readily available. All of the theoretical results were constructively proven. Experimental data show that OLFA obtains considerable improvements in solution quality, comp.tation time and application range over the existing algorithms, thus makes LF a tool of great generality and practicability for fast DWT implementations.
All faults hidden in the software can be divided into different types according to the loss it maybe make. A new software reliability growth model specific for different types of faults is proposed based on the tradit...
详细信息
All faults hidden in the software can be divided into different types according to the loss it maybe make. A new software reliability growth model specific for different types of faults is proposed based on the traditional G-O model. The wireless communication technology improves the performance of the wearable comp.ter greatly. The software faults of the wearable comp.ter can be divided into two types by their influence on communication: 1) common faults, faults which affect slightly or don't affect communication;2) communication faults, faults which affect terribly or interrupt communication. In order to evaluate the software reliability of a wearable comp.ter, an SRGM is established based on the model just built and a group of data is used on it.
Kinematics equation of six-wheel Lunar Rover are presented. Then force models of the Lunar Rover in rough terrain are described. A dynamic simulation model is developed considering the articulated body dynamics of a s...
详细信息
Kinematics equation of six-wheel Lunar Rover are presented. Then force models of the Lunar Rover in rough terrain are described. A dynamic simulation model is developed considering the articulated body dynamics of a suspension mechanism. Simulation results show that the model can successfully solve the comp.ex kinematic problem which the lunar rover traverse over rough terrain.
The paper studies the update-in-place and append-only characteristics of trading transaction updating in trading data, and brings forward a crash recovery scheme for trading-oriented main memory resident real-time dat...
详细信息
The paper studies the update-in-place and append-only characteristics of trading transaction updating in trading data, and brings forward a crash recovery scheme for trading-oriented main memory resident real-time database. The paper also presents a structure model of the failure recovery manager and discusses its working mechanisms, adopts action consistent checkpoint techniques and redo logging techniques, and implements the crashing recovery of memory resident real-time database based upon data check-pointing and recoverable transaction logging, guarantees the correctness and the consistency of the database system recovering from failures. It is indicated that the proposed crashing recovery method is suitable for trading-oriented, main memory resident databases.
The LSF (least slack first) algorithm assigns a priority to a task according to its executing urgency. The smaller the remaining slack time of a task is, the sooner it needs to be executed. However, LSF may frequently...
详细信息
The LSF (least slack first) algorithm assigns a priority to a task according to its executing urgency. The smaller the remaining slack time of a task is, the sooner it needs to be executed. However, LSF may frequently cause switching or serious thrashing among tasks, which augments the overhead of a system and restricts its application. Assigning a preemption threshold in the scheduling policy can decrease the switching among tasks, however, the existing assigning methods are limited to the fixed priority such that they are not applied to the LSF algorithm. In order to relieve the thrashing caused by LSF, some applicable assigning schemes are presented to the LSF algorithm based on the preemption threshold. Every task is dynamically assigned a preemption threshold that is dynamically changing with the executing urgency of the task and is not limited by the number of tasks. Simulations show that, by using the improved LSF policy, the switching among tasks decreases greatly while the missed deadline percentage decreases. The proposed algorithm is useful for designing and implementing a real-time operating system.
暂无评论