GPIB命令的数据结构

针对GPIB命令的结构，提出一种存储GPIB命令的数据结构。根据GPIB命令的层次关系的特点，选择数据结构中“树”的概念来存储GPIB命令结点；并考虑程序实现的效率问题以及管理维护方面的因素，对普通的树进行改造，从而形成特有的“GPIB命令树”，     

Parameterized complexity of basic decision problems for tree automata

There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of tree automata (TA). The study of their parameterized complexity allows us to find new bounds of their nonpolynomial time algorithmic behaviours. We present results of such a study for classical TA, rigid tree automata, TA with global equality and disequality and t-DAG automata. As parameters we consider the number of states, the cardinality of the signature, the size of the term or the t-dag and the size of the automaton.     

The optimal branching asymmetry of a bidirectional distribution tree

Several transportation networks in living systems are pulsatile branching trees. Due to the alternating character of the flow, these trees have to simultaneously satisfy two constraints: they have to deliver the carried products in a limited time and they must exhibit a satisfactory hydrodynamic performance in both directions of the flow. We report here that introducing a systematic branching asymmetry into a distribution tree improves performance and robustness, both at inhalation and exhalation. Moreover, optimizing the asymmetry level for both phases leads to a value very close to the one measured in the human lung.     

Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching

Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they can also reduce the amount of side computations. We introduce a new data structure, the Fixed Queries Array (FQA), whose novelties are (1) it permits sublinear extra CPU time without any extra data structure; (2) it permits trading number of pivots for their precision so as to make better use of the available memory. We show experimentally that the FQA is an efficient tool to search in metric spaces and that it compares favorably against other state of the art approaches. Its simplicity converts it into a simple yet effective tool for practitioners seeking for a black-box method to plug in their applications.     

Viral systems: A new bio-inspired optimisation approach

The paper presents a new approach to deal with combinatorial problems. It makes use of a biological analogy inspired by the performance of viruses. The replication mechanism, as well as the hosts’ infection processes is used to generate a metaheuristic that allows the obtention of valuable results. The viral system (VS) theoretical context is described and it is applied to a library of medium-to-large-sized cases of the Steiner problem for which the optimal solution is known. The method is compared with the metaheuristics that have provided the best results for the Steiner problem. The VS provides better solutions than genetic algorithms and certain tabu search approaches. For the most sophisticated tabu search approaches (the best metaheuristic approximations to the Steiner problem solution) VS provides solutions of similar quality.     

Computing on a free tree via complexity-preserving mappings

The relationship between linear lists and free trees is studied. We examine a number of well-known data structures for computing functions on linear lists and show that they can be canonically transformed into data structures for computing the same functions defined over free trees. This is used to establish new upper bounds on the complexity of several query-answering problems.This work was started when the author was at Brown University, Providence, RI. It was partly supported by NSF Grant MCS 83-03925. A preliminary version of this work has appeared in theProceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, West Palm Beach, FL, October 1984, pp. 358–368.     

Decision tree approach for classification and dimensionality reduction of electronic nose data

This paper presents a decision tree approach using two different tree models, C4.5 and CART, for use in the classification and dimensionality reduction of electronic nose (EN) data. The decision tree is a tree structure consisting of internal and terminal nodes which process the data to ultimately yield a classification. The decision tree is proficient at both maintaining the role of dimensionality reduction and at organizing optimally sized classification trees, and therefore it could be a promising approach to analyze EN data. In the experiments conducted, six sensor response parameters were extracted from the dynamic sensor responses of each of the four metal oxide gas sensors. The six parameters observed were the rising time (T_r), falling time (T_f), total response time (T_t), normalized peak voltage change (y_p,n), normalized curve integral (C_I), and triangle area (T_A). One sensor parameter from each metal oxide sensor was used for the classification trees, and the best classification accuracy of 97.78% was achieved by CART using the C_I parameter. However, the accuracy of CART was improved using all of the sensor parameters as inputs to the classification tree. The improved results of CART, having an accuracy of 98.89%, was comparable to that of two popular classifiers, the multilayer perceptron (MLP) neural network and the fuzzy ARTMAP network (accuracy of 98.89%, and 100%, respectively). Furthermore, as a dimensionality reduction method the decision tree has shown a better discrimination accuracy of 100% for the MLP classifier and 98.89% for the fuzzy ARTMAP classifier as compared to those achieved with principle component analysis (PCA) giving 81.11% and 97.78%, and a variable selection method giving 92.22% and 93.33% (for the same MLP and fuzzy ARTMAP classifiers). Therefore, a decision tree could be a promising technique for a pattern recognition system for EN data in terms of two functions; as classifier which is an optimally organized classification tree, and as dimensionality reduction method for other pattern recognition techniques.     

Mining association rules between positive word-of-mouth on social network sites and consumer acceptance: A study for derivative product of animations,comics, and games

In recent years, we can easily observe that animations, comics, and games (ACG) have great output value and market influence on the entertainment and digit media market. The ACG industry is not an industry of a single country or region but a global industry. In addition to its own revenue, the derivative products (or licensed merchandise) of ACG can extend the ACG industry to win more business opportunities. The ACG industry is mainly marketed towards younger people, who are the major users of social network sites. Hence, the electronic word-of-mouth (eWOM) on social network sites often becomes a reference basis of the young people’s attitudinal acceptance and purchase intention in purchasing ACG-related derivative product.In this paper, we analyze the influential factors of positive eWOM’s communication motivations that affect consumer acceptance on social network sites, and apply the uncomplicated decision tree data mining algorithm to compute the association rules between these influential factors and consumer acceptance, expecting to understand the relationship between eWOM on social network sites and consumer acceptance. The results of this study can help the business decision-making in CRM and marketing of the industry of ACG-related derivative product. This study found that the degree of perception of ACG product and the degree of taking pleasure in sharing ACG-related information with others have a significant correlation with consumer acceptance.     

Some reliability aspects in structural control

The reliability aspects associated with the system made of an actively controlled structure and its control devices are discussed. Standard tools of system reliability analysis turns out to be a convenient approach to the problem. The operation scenario however is preliminarily required and some redundancy solutions are discussed in this article.