05 September 2006, Volume 32 Issue 17
-
Select all|
-
Computer Engineering. 2006, 32(17): 1-3. https://doi.org/10.3969/j.issn.1000-3428.2006.17.001The background of the network security information correlation technique is introduced, and the problem that it supposed to solve is clarified. And according to the different methods used in the technique, this paper classifies the methods into four categories: similarity-based analysis, attack-scenario based analysis, causality knowledge based analysis and statical causality based anaylsis. For each category, the basic idea and the existing techniques are introduced and analyzed, and the unsolved problems are pointed out. The development direction and future works are analyzed.
-
Computer Engineering. 2006, 32(17): 4-6,9. https://doi.org/10.3969/j.issn.1000-3428.2006.17.002Cryptography is the core of information security technology. This paper outlines the status of public key cipher, and the primary theory foundation of public key cryptography is formulated, especialy, the ECC & its characteristics are introduced in detail. Finally, this paper indicates the development trend for public key cryptography.
-
Computer Engineering. 2006, 32(17): 7-9. https://doi.org/10.3969/j.issn.1000-3428.2006.17.003Gene is the genetic information carrier of life in its evolution. This paper presents a simple data gene model to describe the lifecycle of data according to the gene of life. The concepts of data gene, data gene sequence and data genomes are presented firstly. Then the paper gives the application areas and the application techniques of Data Gene Model. The future works are given finally.
-
Computer Engineering. 2006, 32(17): 10-11,1. https://doi.org/10.3969/j.issn.1000-3428.2006.17.004A large amount of similar Chinese characters is one of the main reasons to cause the high reject rate and substitution rate. This paper proposes an innovative similar character recognition method based on dynamical feature selection. The process includes originally abstracting global feature vectors, progressively, dynamically and recursively adding more accurate local feature vectors to improve the ability of recognition and finally achieving the result that satisfies the conditions. In this way, it is not necessary to decide similar characters group manually since it can automatically choose the largest space in the difference of similar characters to construct new feature vectors. The efficiency of this method is proved by the experiments that effectively improved the recognition rate of similar characters.
-
Computer Engineering. 2006, 32(17): 12-14. https://doi.org/10.3969/j.issn.1000-3428.2006.17.005Representing the shortest path problem as a combinational optimization problem, this paper presents a shortest path routing algorithm based on CNN. The expressions of network cost and shortest path are given. The motion equations of neurons are obtained by means of the model of CNN. An energy function is constructed which takes into account all objectives and constraints. It applies the CNN algorithm to 9-node and 15-node network model, respectively. The shortest path could be found for single and multiple packets request. Simulation results show it validating that using chaotic noise neural network to solve the shortest path problem in a communication network.
-
Computer Engineering. 2006, 32(17): 15-18. https://doi.org/10.3969/j.issn.1000-3428.2006.17.006Super-resolution image reconstruction is a technique to estimate a high-resolution (HR) image from several low-resolution (LR) images, providing that the LR images are sub-sampled and displaced by different amounts of sub-pixel shifts. The maximum a posteriori (MAP) formulation has become one of the most popular approaches. However, the model-solved methods such as steepest decent (SD) and conjugate gradient (CG) have slowed convergent speed; much process time is still in need. To solve this problem, a preconditioned conjugate gradient method is given in this paper. This method uses incomplete Cholesky decomposition to get the preconditioner and to lower the condition number of the coefficient matrix. The proposed method is tested on aerial images and fruit images. The results indicate that it has quick convergent speed and process speed than SD method and CG method does.
-
Computer Engineering. 2006, 32(17): 19-21,2. https://doi.org/10.3969/j.issn.1000-3428.2006.17.007To monitor process industry’s production, the large history data is analyzed by clustering algorithm. The equipment’s parameters clustering models are built by Feature Weight’s K-means algorithm. The proportion between quantity under different similarity factor and the whole cluster is calculated by different similarity methods, and then a new factor of scatter is defined. Based on the conception of CBLOF(t), a new definition of outlier is brought forward to study the real-time outlier when the equipments circulate. Based on the models, equipments process and monitor faults can be optimized.
-
Computer Engineering. 2006, 32(17): 22-24. https://doi.org/10.3969/j.issn.1000-3428.2006.17.008The registration between MRA and DSA of a same patient is studied in this paper. The registration algorithm based on near projection invariance is presented, i.e. the projection of 3D MRA skeleton should accord with the 2D DSA skeleton under the same perspective view. After the cost function between the projections is defined, the view angle can then be obtained through maximizing the cost function using Newton iteration method. Satisfactory results are obtained in the clinical MRA and DSA data of the same patient.
-
Computer Engineering. 2006, 32(17): 25-27. https://doi.org/10.3969/j.issn.1000-3428.2006.17.009Support vector machine (SVM) is used to deal with alerts produced by intrusion detection system to reduce false positive alerts. A similar radial basis function, which is based on heterogeneous value difference metric and can exactly measure the distance of heterogeneous value, is applied due to the heterogeneous alert data. The experimental data is the alerts produced by Snort, a kind of network intrusion detection system, with the attack and normal data in testing environment. Six background attributes are added to the experimental data to enhance the accuracy of classification. The testing results confirm the good performance of this method: at the cost of false negative alerts not increased, true positive ratio is 100%, reduced false positive ratio is 99.729 1%, and the processing time of each data is 0.38ms.
-
Computer Engineering. 2006, 32(17): 28-29,4. https://doi.org/10.3969/j.issn.1000-3428.2006.17.010
This paper presents a new fast scalar multiplication algorithm on elliptic curve cryptography. This algorithm greatly reduces times of addition operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods. By theoretic analysis and experiment, signed sliding window coding method is better than NAF algorithm and unsigned sliding window coding method, and it is also able to improve the efficiency of scalar multiplication algorithm compared with accustomed algorithm. And the optimal sliding window width is given.
-
Computer Engineering. 2006, 32(17): 30-31.3. https://doi.org/10.3969/j.issn.1000-3428.2006.17.011Based on analysis of atomicity and fair anonymity of electronic payment, an protocol of electronic payment is proposed to enable not only anonymity but also own-trace and money-trace, which are realized fair anonymity and involvement of the TTP only for conflict resolution. Six sub-protocols are presented, the processes of which are elaborated. Atomicity and fair anonymity of the protocol are validated with non-formalization. The protocol can guarantee the fair electronic transaction and the privacy of the customer.
-
Computer Engineering. 2006, 32(17): 32-34. https://doi.org/10.3969/j.issn.1000-3428.2006.17.012
This paper researches on Needham-Schroeder protocol with shared keys. It points out bugs and leaks that the protocol exists, and provids a kind of method to attack the protocol. Needham and Schroeder have revised the primitive protocol, but the amended protocol still has a leak. Some other scholars have revised this protocol too, but the amended protocol still is unsatisfactory. In allusion to bugs and leaks existing to the primitive protocol, the paper carries on corresponding modification, and analyses the amended protocol with BAN logic. It indicates that the amended protocol can reach the goal of the protocol.
-
Computer Engineering. 2006, 32(17): 35-37,4. https://doi.org/10.3969/j.issn.1000-3428.2006.17.013To support QoS in Web server cluster, dispatcher is equipped with some QoS mechanisms, including admission control, service differentiation, server repartition, performance isolation, and content adaptation. System satisfies the service level agreement targets for high priority request classes, and supply best-effort service for low priority request classes. The percentage of dropped requests of the system is very low, which mainly benefits from the content adaptation mechanism. Realistic experiments show that the system works as expected.
-
Computer Engineering. 2006, 32(17): 38-40. https://doi.org/10.3969/j.issn.1000-3428.2006.17.014According to characters of mobility models, this article gives a classification of mobility models, such as random mobility model, mobility model with temporal dependency, mobility model with spatial dependency and mobility model with geographic restriction. There are three situations used to compare applicability of these mobility models including battlefield, event hall and art gallery. A simulation tool called ANSIM is applied to test several mobility models. Average number of neighbors, average number of hops and probability of connection are compared under RW/RD/GM mobility models. At last there is a simulation scenario of obstacle mobility model in the campus.
-
Computer Engineering. 2006, 32(17): 41-43. https://doi.org/10.3969/j.issn.1000-3428.2006.17.015In online classification system, such as credit evaluation, spam detection and intrusion detection, it is an important problem to detect the new pattern, and make the classifier to adapt for emerging pattern. Aiming at this problem, this paper proposes an incremental algorithm to train decision tree based on original computation and samples with new class. The result of experiment shows that the proposed algorithm can deal with incremental class and suit online classification system because of its little time cost.
-
Computer Engineering. 2006, 32(17): 44-47. https://doi.org/10.3969/j.issn.1000-3428.2006.17.016A classifier ensemble method with fuzzy integral for fuzzy classifier is proposed. The object of this method is to reduce subjective factor during constructing a fuzzy classifier, and to improve the classification recognition rate and stability for classification system. For this object, a method of determining fuzzy integral density with membership matrix is proposed, and the classifier ensemble algorithm based on fuzzy integral is introduced. The proposed method is evaluated by the comparison of experiments with standard data sets and the existed classifier ensemble methods.
-
Computer Engineering. 2006, 32(17): 48-51. https://doi.org/10.3969/j.issn.1000-3428.2006.17.017This paper analyzes features of urban traffic flow, tries to develope kernel machine method in this domain to forecast flow value of future. Artificial neural network and some kinds of kernels are addopted to numerical experiment. Experiment results show that, kernel machine method is better than artificial neural network, and compound kernel functions is better than common single kernel functions. Sigmoid and Gaussian kernel function also show their good performance when contrasted to linear kernel and polynomial kernel function. Kernel machine method finds its applied value in urban traffic real-time control.
-
Computer Engineering. 2006, 32(17): 52-54,7. https://doi.org/10.3969/j.issn.1000-3428.2006.17.018Feature selection is NP-Hard problem. In order to get a minimal feature subset of an information system, so-called Similar Extension Matrix(SEM) is defined to discriminate all objects by its elements, and then condensed to Condensed SEM(CSEM) by the included relation in logic. At Last, by means of the statistical values as heuristic information, a minimal feature subset is efficiently obtained in CSEM. The heuristic algorithm of minimal feature subset selection is proved very efficient by theoretical analysis and experiment.
-
Computer Engineering. 2006, 32(17): 55-56,8. https://doi.org/10.3969/j.issn.1000-3428.2006.17.019With the advantage of distributed information retrieval, such as availability, reliability, and efficiency and less cost, it is the key technology for digital library and network information retrieval. Analyzing the distribution and heterogeneity of the network information, it is proposed that Agent-based distributed information retrieval system. The formal model based on π-calculus is created to describe the service and request for distributed information retrieval system. It is proved the correction, availability, reliability and rationality of the Agent-based distributed information retrieval system in theory.
-
Computer Engineering. 2006, 32(17): 57-59. https://doi.org/10.3969/j.issn.1000-3428.2006.17.020A discrete particle swarm algorithm based on value ordering of min-conflict heuristic is proposed. It uses the min-conflict heuristic to select values from domains instead of random selection. This strategy searches the promising solution space for global solution when the particles exploit the search space. It tests the hybrid algorithm with random constraint satisfaction problems. The experimental results show that the hybrid particle swarm algorithm can converge the global solution faster and improve the performance either on the iterations or runtime several-fold.
-
Computer Engineering. 2006, 32(17): 60-62,6. https://doi.org/10.3969/j.issn.1000-3428.2006.17.021The E-mail filtering based on text classification has become the main method to solve spam crisis at present, but it is still short of standardized pattern and filtering mechanism with high retrieval performance. This paper settles these problems in virtue of E-mail character field. It introduces the concepts of character term and character field, and constructs character lexicon by analyzing training materials using class correlation evaluation function. This paper presents the weight calculation based on term frequency by analyzing the important effects of E-mail character field in topic expression, and improves the traditional probabilistic model of resemblance calculation. Experiments show that this method plays better performance than Rocchio in terms of recall, precision and so on.
-
Computer Engineering. 2006, 32(17): 63-65. https://doi.org/10.3969/j.issn.1000-3428.2006.17.022Bayesian classification model is common, powerful for text categorization task. It is based on probability and is of religious theoretic basis. The paper makes analysis to the simple and common naive Bayesian categorization model, and presents an approach to improve performance of Bayesian classification model using weight adjustment and an approach to make non-tutor Bayesian categorization using EM algorithm when lacking mass training texts, and discusses how to fix the framework of Bayesian network using heuristic methods so as to make text classification in real circumstance.
-
Computer Engineering. 2006, 32(17): 66-68. https://doi.org/10.3969/j.issn.1000-3428.2006.17.023This paper proposes a new LPN path planning method based on dynamic information model. The purpose integrates obstacle dynamic information in planning method to have better performances in dynamic environments. Through analyzing the defects of original dynamic information model, the paper modifies and proposes a new dynamic information model and integrates it into LPN-method to make path planning. Simulation experiments and tests in RoboCup middle-size robots show the effectiveness of the method.
-
Computer Engineering. 2006, 32(17): 69-70,8. https://doi.org/10.3969/j.issn.1000-3428.2006.17.024Clustering algorithm is a very important research direction in data mining. So far, lots of clustering algorithms adapted to the large-scale and high-dimension data base have been proposed. The density-based algorithm is one of the typical researching directions. On the basis of CABDET algorithm, this paper presents a new algorithm called GFCABD. The new algorithm puts the theory of grid into the density-tree based clustering algorithm, thus improves the efficiency of clustering effectively and reduces the cost of I/O.
-
Computer Engineering. 2006, 32(17): 71-73,8. https://doi.org/10.3969/j.issn.1000-3428.2006.17.025This paper presents a novel method, which is called two-step enhancement method to enhance the singular point area in the fingerprint image. First of all, a filter, based Rayleigh function, is applied to the area for band filtering, and next, it uses eight direction Gabor filters with interval 22.5 degree to enhance this area respectively. The optimum sixteen directional subdomains images, which come from the eight filtered images, can be obtained by using quality index. Finally, it gets the fingerprint enhancement image of the singular point area through synthesizing these subdomains images. Experimental results show an effective enhancement in the singular point area.
-
Computer Engineering. 2006, 32(17): 74-76. https://doi.org/10.3969/j.issn.1000-3428.2006.17.026The concept of relative word frequency (RWF) is proposed. A context calculation model is set up, which makes use of contextual information to resolute covering ambiguity in Chinese word segmentation. This paper selects 5 frequently used covering ambiguous words as examples, and the results show that the average accuracy is over 95%.
-
Computer Engineering. 2006, 32(17): 77-79. https://doi.org/10.3969/j.issn.1000-3428.2006.17.027Support vector machines are successfully applied to solve a large number of classification and regression problems. But it may sometimes be preferable to learn incrementally from previous SVM results, as SVMs which involve the solution of a quadratic programming problem suffer from the problem of large memory requirement and CPU time when they are trained in batch mode on large data sets, especially on multi-class problem. An approach for incremental learning based on support vector machines is presented, and is used to solve multi-class real-world problem.
-
Computer Engineering. 2006, 32(17): 80-82,1. https://doi.org/10.3969/j.issn.1000-3428.2006.17.028Several session mining on sequential time intervals achieve a rule measure sequence. The estimation of the measure sequence acquires some statistical parameters, which are used to evaluate the interestingness and discover evolutional regularity about the rule. The diffusion estimation method applicable to the sequence with small samples is proposed, based on the principle of information diffusion. The algorithms of parameter estimation are discussed for the sequence in fluctuant or ascend/descend trend, using the measure sequence regarded as incomplete sample. Experiments show the validity, robustness and simplicity for application.
-
Computer Engineering. 2006, 32(17): 83-85. https://doi.org/10.3969/j.issn.1000-3428.2006.17.029The difference between the semantic meanings of Part-Whole(PW)relations often determines if the ontologies can be merged or reused. Wiston taxonomy is employed to partition the PW relations in medical ontologies into sub-relations, such that, each sub-relation has special meaning and satisfies the transitivity. Mereology theory is used to analyze the properties of the sub-relations, the similarity between the sub-relations and the correctness of the reasoning based on PW relations. The research results provide new methodology for the study of PW relations.
-
Computer Engineering. 2006, 32(17): 86-88. https://doi.org/10.3969/j.issn.1000-3428.2006.17.030Bayes networks, as directed acyclic graphs of causal structure of attributes, have become the efficient method for processing incomplete data. However, most Bayesian network classifiers are learned from complete data and the world is rarely fully observable and data is often incomplete. So constructing Bayesian network classifiers from incomplete data is an important and challenging problem. An efficient method for constructing Bayesian network classifiers from incomplete data based on BC method and EM algorithm is presented. Experimental results show its validity.
-
Computer Engineering. 2006, 32(17): 89-91. https://doi.org/10.3969/j.issn.1000-3428.2006.17.031This paper analyzes the objectivity of appraisal of content in Webpages and feasibility of appraisable classification, and introduces theory and implement method of Web text appraisable classification. Combined existing technique of feature selecting with the method of appraisable feature extracting, the thesis implementes appraisable classification in some celebrities’ Webpages by several classification algorithm, and achieved preferable effects.
-
Computer Engineering. 2006, 32(17): 92-94. https://doi.org/10.3969/j.issn.1000-3428.2006.17.032Migration strategy is responsible for planning out an optimal migration path, which ensures that mobile agent can complete its task correctly and efficiently. After analyzing current models and criterions, this paper presents migration strategies based on support vector machine and designs the model. Simulation experiments show that, compared with other migration strategies, it can get the optimal result with high probability, thus to verify this algorithm is effective and available.
-
Computer Engineering. 2006, 32(17): 95-96. https://doi.org/10.3969/j.issn.1000-3428.2006.17.033In this paper, the learning principle of qualitative mapping model is given, orthogonality space of qualitative mapping is put forward. Fourier transformation is induced by orthogonality space. After that, the real meaning of property calculation is discussed, and the pattern recognition method based on the orthogonality space of qualitative mapping is bring forward. Some actual applications using such method are given in the end.
-
Computer Engineering. 2006, 32(17): 97-99,1. https://doi.org/10.3969/j.issn.1000-3428.2006.17.034
Sequential algorithm is a straightforward cluster algorithm, and people do not have to provide the number of clusters in advance. However, when faced with large-scale data, the efficiency of the algorithm has need to be improved. Based on two-threshold sequential algorithm scheme(TTSAS), this article presents a new sequential algorithm TI_TTSAS, which avoids unnecessary distance calculations by applying the triangle inequality. Experiments show that the new algorithm is more effective for datasets of more dimensions, and becomes more and more effective as the number of clusters increases. The results keeps the accuracy of TTSAS algorithm.
-
Computer Engineering. 2006, 32(17): 100-102,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.035Ensemble of complete random trees, i.e. decision trees without any split selection, has high performance. This paper investigates whether the complete random learning scheme can by applied to other types of base learners. It realizes complete random decision stump and complete random rule algorithms, analyzes why complete scheme work. Experiments show that complete random scheme works for different types of base learners.
-
Computer Engineering. 2006, 32(17): 103-104，. https://doi.org/10.3969/j.issn.1000-3428.2006.17.036The performance of a data fusion system must be better than that of single sensor system when the information of multisensor is effectively used. According to information theory, this paper discusses the classifying performance for a pattern recognition system based on multisensor neural network data fusion and proves the correctness. The conclusion is proved theoretically.
-
Computer Engineering. 2006, 32(17): 105-107,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.037Qualitative mapping based on the conversion of quantity-quality features of attributes in philosophy and perceptive feature extracting is a mathematic model of thinking. This paper discusses a model of diagnosis system based on the qualitative mapping: the attribute petri nets model. It provides its formally definition, basic running mechanism, reasoning algorithm of diagnosis and instance based on attribute petri net. It is proved that this model is useful in the diagnosis system characterized with the qualitative judge.
-
Computer Engineering. 2006, 32(17): 108-111,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.038Based on a modal default logic, a multi-agent system is built to describe knowledge update. Some concepts such as new knowledge and knowledge conflict are defined for the modal default theory . In a multi-agent system based on the modal default logic, the knowledge of an agent can be shared with others. The aim of this paper is focused on the properties and acquisition of the extension in the modal default theory, when its background Wi is changing. The related theorems about the extension are proved. Further, dynamic characteristics about the knowledge update for multi-agent system are built to describe its non-monotonicity.
-
Computer Engineering. 2006, 32(17): 112-114. https://doi.org/10.3969/j.issn.1000-3428.2006.17.039Linux is increasingly stepping into desktop field from server. With the architecture and algorithm designed based on traditional Unix it is important to investigate whether Linux can provide efficient interactive performance for desktop application. Some disadvantages of page swapout mechanism are analyzed in Linux memory management for interactive application. A new algorithm of active page swapout suitable for the characteristics of interactive application is presented. The algorithm optimizes the state machine based on equivalence relation of page state, and it allows the application itself to swap out memory if necessary. It improves the interactive performance by reclaiming abundant memory to satisfy application under memory pressure.
-
Computer Engineering. 2006, 32(17): 115-117. https://doi.org/10.3969/j.issn.1000-3428.2006.17.040Algorithms for integer aggregation and for the operation of compressing are presented. Consequently a fast efficient parallel algorithm for Hough transform on RAPWBN is given. Suppose the number of θ values to be considered is p, for an image with n×n pixels, the algorithm can complete Hough transform in O(1) time using pn2 processors and get the optimal speed and efficiency.
-
Computer Engineering. 2006, 32(17): 118-120. https://doi.org/10.3969/j.issn.1000-3428.2006.17.041A testing tool that allows component developer to validate component interfaces, functions and behaviors in the simulated or real operation environments is introduced which also leads testers to create, manage and execute test case. The generation of test script is one of the most tough problem of the tool, and according to specification of JUnit, Mock object and In Container, testscript template & field mechanism is proposed for Java component to semiautomatically generate test script. The tool’s validity is proved via practical test routines for Java component.
-
Computer Engineering. 2006, 32(17): 121-122,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.042Based on the analysis of Apriori algorithm, this paper points to the defects of its design thought. After adopting the concept of interest measure and new definition of association rules, it defines the more reasonable interest measure that bases on the difference between the square of confidence and the square of support, also = *( + ). Therefore, with the new definition of interest and association rules, it designs a new association rules mining algorithm and also gives some analysis on it.
-
Computer Engineering. 2006, 32(17): 123-125. https://doi.org/10.3969/j.issn.1000-3428.2006.17.043Web application has its own characteristics compared with traditional computer application, and puts forwards new problems for software testing. This paper brings forward a framework of testing Web application towards its own characteristics, and the testing flows generated from the framework are standardized, easy operated and extendable. Based on the framework, this paper well researches an implementation technique, and develops an application of function test automation for Web applications. This application is efficient and correct in practice, it can find the fault in the Web application that is tested in time, and it makes regress testing simpler and more convenient.
-
Computer Engineering. 2006, 32(17): 126-128,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.044Parallel task scheduling is one of the key factors influencing the efficiency of clusters, and it is also a well-known strong NP-hard problem. Zhou and Zheng have proposed a task duplication based algorithm, which adopts recursion to implement DAG partition and sub-graph reconfiguration, then builds task clusters to carry out scheduling. This paper further exploits their method and proposes a task duplication strategy emphasizing the increment of scheduling length. Using this strategy, the restriction problem between clusters is effectively solved by adjusting the predecessors of the restricted task in the same cluster; besides, appropriate task clusters are selected and merged, leading to coarse-grained clusters and better processor utilization. Furthermore, a DAG scheduling algorithm based on task clustering and duplication is presented in this paper, which is characterized by expanding and merging clusters, and has advantages in both scheduling length and processor utilization over the original algorithm. Experiment results show that the algorithm has the same complexity with TDS (task duplication scheduling) and achieves better performance.
-
Computer Engineering. 2006, 32(17): 129-131. https://doi.org/10.3969/j.issn.1000-3428.2006.17.045Framework is an important approach to large-grained software reuse. People can develop application system through extension and instantiation of framework. The methods of the present framework extension only solve the problems of partial extension owing to lack of technical support. This paper proposes the extension method of application framework based on component which uses the principle of domain-oriented feature model, identifies the logic relations of components among component model, classifies hot spots by function, and describes the extension measures using the UniCon language. The method simplifies the process of framework extension, and provides the good document support.
-
Computer Engineering. 2006, 32(17): 132-134. https://doi.org/10.3969/j.issn.1000-3428.2006.17.046With the rapid growth of data available from all kinds of sources, temporal information mining in business data has been a hot area attracting more and more attention. An approach to discover temporal association rules within valid time intervals is investigated. An algorithm based on FP-tree is devised. In this approach, by means of partition mining, each itemset is associated with a valid time interval presented by units of partitions. For each partition, a FP-tree is constructed to help the calculation of the count of an itemset within its valid time interval, which can smooth the calculation of temporal confidence. At last, an example is given to demonstrate the mining process.
-
Computer Engineering. 2006, 32(17): 135-137. https://doi.org/10.3969/j.issn.1000-3428.2006.17.047With the development of enterprise, workflow and workflow management systems must provide much higher level of reliability, interoperability and flexibility. Integrated with mobile agent, workflow management systems will attain these goals. But there are some problems that can simply be solved in centralized workflow systems are harder in MA-based systems. This paper presents one of those problems, task scheduling, and provides a method for this.
-
Computer Engineering. 2006, 32(17): 138-140. https://doi.org/10.3969/j.issn.1000-3428.2006.17.048A large amount of lowclass granularity data is existed in data warehouse, and the storage strategies of them are closely related to the performance and efficiency of on line analytical processing and data mining. After analyzing the types and characteristics of lowclass granularity dada in data warehouse, this paper discusses various static data division strategies, and studies some dynamic data division strategies caused by the variety from structure to content in detail, then a dynamic data division technique based on attributes compatibility and semantic equivalency is proposed.
-
Computer Engineering. 2006, 32(17): 141-143. https://doi.org/10.3969/j.issn.1000-3428.2006.17.049On the basis of analyzing the research and application of adaptive software, this paper points out that adaptive component should have the characteristic of data self-sensing and attribute self-defining, and the interface of component is the key of designing and developing the adaptive component. The paper studies the adaptive interface, and presents an adaptive component model based on XML. At last it gives the example of application in statistical component.
-
Computer Engineering. 2006, 32(17): 144-146. https://doi.org/10.3969/j.issn.1000-3428.2006.17.050This paper discusses how to extend the Struts framework and integrate primary Hibernate to form a new framework aiming at a kind of middle-small applications, which mostly deal with persistent data, have clear module partitions and simple JSP interfaces. With an example OME, the paper analyzes its realization process and technique keys including creating model components, simplifying configuration, extending basic components of struts, integrating persistent framework Hibernate. OME not only keeps MVC advantages of Struts but also supports a new developing manner, that is, every team member plays three roles in an individual module. The paper gives an application sample, further improving scheme and risk.
-
Computer Engineering. 2006, 32(17): 147-149. https://doi.org/10.3969/j.issn.1000-3428.2006.17.051To satisfy the multi-level requirements of information process and supply the up to the second and exact global data view for decision-maker and analyzer in enterprise, the three-leveled architecture DB-ODS-DW in which ODS takes a connecting link functions between the preceding and the following is come forth. The data update strategy, an essential technique of ODS is studied in this paper. Contrasting with the traditional ODS data update strategies, a new strategy based on WAN and heterogeneous environment is proposed, in which the XML is used to implement the delta data updating in heterogeneous databases and to transmit the delta data file efficiently. This kind of strategy has been applied in practice and perfect effect has been obtained.
-
Computer Engineering. 2006, 32(17): 150-152. https://doi.org/10.3969/j.issn.1000-3428.2006.17.052Based on the basic concept of requirements volatility(RV) risk, the causes and impact of RV on software project performance are summarized. Some representative RV risk analysis and assessment methods are enumerated. Some current issues of RV and corresponding solutions are also discussed.
-
Computer Engineering. 2006, 32(17): 153-155. https://doi.org/10.3969/j.issn.1000-3428.2006.17.053In service-oriented architecture, in order to composite a new service on-demand by existing service components, this paper puts forward service customization framework based on mobile agent and active network, the core of the approach is encapsulating elementary service into active packet(called Service Agent,SA) using mobile agent, and composing the service of user required by the different SA combining. Then it researches on key technologies such as service description, service publishing, service discovery and service composition, it can realize service customizing which traditional network can’t.
-
Computer Engineering. 2006, 32(17): 156-158，. https://doi.org/10.3969/j.issn.1000-3428.2006.17.054To effectively organize and schedule resources in the Internet is a critical problem in grid computing. An effective organizing mechanism based on the spaces model is proposed. The novel mechanism divides resources into different area autonomy systems that can collaborate with each other. Multiple distributed space services can availably aggregate neighboring resources in an area autonomy system. Common interfaces are offered to operate information in spaces. The mechanism has been applied to build up an enterprise grid computing platform in a group company and it is found that the mechanism can work well.
-
Computer Engineering. 2006, 32(17): 159-161，. https://doi.org/10.3969/j.issn.1000-3428.2006.17.055This paper investigates RED algorithms’ elements and limitation and introduces a new nonlinear high order RED algorithm which employs a high-order function to mark or discard fragments with lower and higher probability near low and high threshold respectively. The enhanced RED algorithm is also implemented in the network simulator NS2, the results of series simulation experiments show that the algorithm improves performance, stableness and reliability of network.
-
Computer Engineering. 2006, 32(17): 162-164. https://doi.org/10.3969/j.issn.1000-3428.2006.17.056This paper proposes a C/S and P2P hybrid resource discovery framework, VIRD. It adopts a request description approach based on attribute-value pairs. VIRD adopts the three-layer architecture. Resource information is propagated within a domain periodically. User requests are handled in domains first. If there are no satisfactory resources, the request will be forwarded to the backbone. According to the simulations, even when the resource density is low and the max TTL is small, VIRD can still achieve high success rate. Compared with flooding and random walk, with the same search success rate, the network traffic and request response time of VIRD are much less than them.
-
Computer Engineering. 2006, 32(17): 165-166，. https://doi.org/10.3969/j.issn.1000-3428.2006.17.057A novel of integrated automatic switching optical network management system and a simple frame structure for control protocol based on dynamic router with QoS, virtual optical link with wavelength converters and SNMP network protocol are designed and realized in this paper. The efficiency of the management system is tested in a real optical wavelength router.
-
Computer Engineering. 2006, 32(17): 167-169. https://doi.org/10.3969/j.issn.1000-3428.2006.17.058Cooperation of streaming media cache servers sited between the Internet backbone and an access network can increase the hit rate and keep load balancing. This paper presents a close coupling cooperation scheme, that the cache servers shared their individual caches, puts forward a cooperative cache replacement algorithm and a dynamic load balancing method. The experiments with NS2 simulation indicate that these mechanisms can make the cache system maintain better performance.
-
Computer Engineering. 2006, 32(17): 170-171，. https://doi.org/10.3969/j.issn.1000-3428.2006.17.059This paper studies on software communication architecture, an open system architecture used for SDR. It realizes an application-specific FM3TR waveform based on the open environment of SCA3.0. From the point of real-time performance of SDR and software implementation, tests are made on FM3TR waveform under the environment of data and voice communication. As a result, the SCA-compliant SDR has favorable interoperability and software portability and can meet the real-time performance requirements such as voice communication.
-
Computer Engineering. 2006, 32(17): 172-174. https://doi.org/10.3969/j.issn.1000-3428.2006.17.060Characteristics of softsiwtch which supports network convergence and network openness are discussed, and a layered architecture of softswitch is proposed, which includes protocol adaptation subsystem, call control subsystem, service adaptation subsystem and OAM subsystem. Some implementation mechanisms are analyzed, including a layered call control model, a method for protocol adaptation based on unified messages and an extensible scenario for implementing Parlay API. Testing results show this system is satisfied to national standard in performance requirements.
-
Computer Engineering. 2006, 32(17): 175-177. https://doi.org/10.3969/j.issn.1000-3428.2006.17.061Resource management is the prime concern of Grid computing system. Aiming at the economic models in the gird resource management, this paper proposes a credit evaluating algorithm and a resource selecting algorithm based on the concept of credit. At last, the paper implements it in scalable environment and the experiments show that the resource selecting algorithm based on the credit is efficient and valuable within grid computing economy environments.
-
Computer Engineering. 2006, 32(17): 178-180，. https://doi.org/10.3969/j.issn.1000-3428.2006.17.062This paper optimizes the conventional Viterbi algorithm’s storage structure such that it can be used for decoding the convolutional codes with big constraint length and very small code rate. Furthermore, the algorithm constructs a Hamming distance table to improve the original Viterbi algorithm’s performance. Simulation results indicates that the optimized algorithm id successfully applied in attacking on the stream cipher whose LFSR (Linear Feedback Shift Register) sequence has 37% error rate and feedback polynomial degree is under 60, and the decode efficiency of this approach is about 10 times than that of the conventional Viterbi algorithm.
-
Computer Engineering. 2006, 32(17): 181-183. https://doi.org/10.3969/j.issn.1000-3428.2006.17.063The network simulation is necessary for studying the complex network such as Internet, www etc.. Based on BA model, an evolving model is proposed to construct scale-free network with given mean connected degree. At every step, k edges are added according to probability . It is proved that the degree distribution of the network obeys power-law form with the exponent -3, and the mean connected degree is given value. Further more, the simulation results are presented, which are in agreement with the theoretic calculation.
-
Computer Engineering. 2006, 32(17): 184-185，. https://doi.org/10.3969/j.issn.1000-3428.2006.17.064Principles for design practical self-routing 3-Omega multicast connection networks which can realize arbitrary multicast assignments between its inputs and outputs without any blocking are described. The overall principles behind the architecture can be described as “permutation-copy-permutation”. It is constructed by “Omega-1+Omega+Omega-1”. It has an optimal O(nlogn) bits of memory and routing time, O(logn) connection time and O(logn) logic gates delay which meets Shannon’s lower bound on memory requirements established in the 1950s.
-
Computer Engineering. 2006, 32(17): 186-188. https://doi.org/10.3969/j.issn.1000-3428.2006.17.065This paper begins with analyzing the shortcoming of the current network measurement system which is not suitable for measuring differentiated services performance. The key technology on DS domain performance measurement is studied. According to the feature of DS domain ,the technology about measurement package constructing and transmitting rule adapt to all kinds of services is improved. It gives the method of communication path measurement for different PHBs and analyzes the measurement scheme strategy.
-
Computer Engineering. 2006, 32(17): 189-191. https://doi.org/10.3969/j.issn.1000-3428.2006.17.066To address the problem of TCP end to end congestion control, IETF advocates deploying active queue management mechanisms in the TCP/IP networks. This paper introduces the widely used network simulator NS-2, several popular AQM algorithms, such as Drop Tail, random early detection(RED) and ARED (adaptive RED) ,are compared based on simulations. The performance metrics used in the study are queue size, TCP global synchronization problem, stability and robustness on different connections. The simulation results indicate that the performance of ARED is better than that of Drop Tail and RED.
-
Computer Engineering. 2006, 32(17): 192-193,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.067The identity authentication mechanism based on password protection is widely used in distributed environments. However, the traditional authentication scheme using passwords is vulnerable to attacks like dictionary attack, replay attack and denial of service attack. Based on the SAS protocol proposed by Sandirigara et al, this paper presents a simple and efficient password authentication scheme that can resist dictionary, replay, denial of service attacks, and minimize the computation and communication overheads.
-
Computer Engineering. 2006, 32(17): 194-196,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.068There are two classes of security problems in distributed computing system, security of hosts and security of distributed applications. This paper analyzes the problem of malicious hosts with formalized method, and proposes a trust domain based terminal model (TDBTM). The model which has distributed applications participate in establishing local system’s access control policies should solve the requirement for guaranteeing integrity and confidentiality of distributed applications. Also, it proposes a trust domain based terminal architecture (TDBTA) to meet the remote attestation of terminal systems. With these two propositions, this solution can deracinate the malicious host problem fundamentally.
-
Computer Engineering. 2006, 32(17): 197-199. https://doi.org/10.3969/j.issn.1000-3428.2006.17.069Along with the increasing attention to the security of information systems, various methods of assessment and evaluation, including the “weighted average assessment”, which is a common method of synthetic assessment, start to play role in the field of information security. This paper studies the application of the “weighted average assessment” within the field of information security assessment and finds out that it is not compatible with the “cask theory” which is universally obeyed in the field of information security. Therefore, this paper improves the “weighted average assessment” with cask theory, so as to make it agree more with the matter of fact and to fit better for the application.
-
Computer Engineering. 2006, 32(17): 200-202,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.070A computer network vulnerability evaluation system is designed based on attack graph modeling method. The computer network security evaluation tools and model check tools are integrated in the system. The block scheme of the computer network vulnerability evaluation system is proposed. The function and structure of all modules are analyzed in detail. The vulnerability evaluation system is able to analyze the weakest node, the most covert attack path, the most possible attack path, and the most frequent attack path. The vulnerability evaluation system can be used to establish and improve security measures of computer network systems effectively.
-
Computer Engineering. 2006, 32(17): 203-204,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.071Proxy signature and blind signature are useful tools in cryptography. They both have wide applications in real life. In a proxy signature, an original signer can delegate his signing power to a proxy signer who signs a message on behalf of the original signer. A blind signature has a salient feature that the signer can not make a linkage between the blind signature and the identity of the requester. Based on bilinear paring and an ID-based signature scheme, an ID-based proxy blind signature scheme is presented, which satisfies the security properties of both proxy signature schemes and blind signature schemes. A simple security analysis of the newly proposed scheme is also given.
-
Computer Engineering. 2006, 32(17): 205-206,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.072With the rapid development of computer technology, Internet applications are used more and more widely, computer networks are exposed to various threats, especially network worms. This paper introduces the definition and principle of network worms, and based on the mechanism of network worms, it proposes and implements a network worm detection system for Internal network, which is proved to be able to detect the network worm accurately.
-
Computer Engineering. 2006, 32(17): 210-212. https://doi.org/10.3969/j.issn.1000-3428.2006.17.074This paper proposes an improved multi-proxy signature scheme. The improved scheme is constructed from bilinear pairings using BLS short signatures. Due to the use of short signatures, the scheme is not only efficient, but also satisfies all the security requirements of the strong proxy signature. It is proved that the design is available and feasible. It reduces the influence of attack.
-
Computer Engineering. 2006, 32(17): 216-218,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.076In the scheme, the authenticity of the original and proxy signer signers’public keys, the validity of the proxy signature and the message recovery can be simultaneously performed in a single step. In the proxy share generation stage, due to the revocation of Shamir’s threshold secret sharing scheme, each proxy signer in the proxy group owns the common proxy share, this can not only efficiently withstand the coalition attack, but also reduce the computational complexities. Furthermore, the proxy warrant created in the proxy share generation stage is integrated with the proxy signature generation, this can overcome the forgery attack. Meanwhile, the actual proxy signers cannot deny the proxy signature they have signed.
-
Computer Engineering. 2006, 32(17): 219-221. https://doi.org/10.3969/j.issn.1000-3428.2006.17.077This paper designs a certificate storage system using P2P technology. Comparing to traditional certificate storage system which designed with directory service system, the certificate storage system is scalability, robust, load balance, fault tolerance. And it solves some problem of traditional directory services such as hard to configure, accessing bottleneck and so on.
-
Computer Engineering. 2006, 32(17): 222-224. https://doi.org/10.3969/j.issn.1000-3428.2006.17.078This paper discusses the advantages and disadvantages of model checking technology and theory generation technology, and gives a specification of the new mixed technology of the two technologies which can provide a more complete formal analysis of security protocols. The technology is more efficient than former technology and can be easily realized in practices.
-
Computer Engineering. 2006, 32(17): 227-229. https://doi.org/10.3969/j.issn.1000-3428.2006.17.080To give the solution of the Web Service security and performance, this paper issues a trustworthy and high efficiency Web Service processing model by integrating the technology of PKI, data compressing and Web Service. And it provides a platform independency, application transparent realization.
-
Computer Engineering. 2006, 32(17): 230-232. https://doi.org/10.3969/j.issn.1000-3428.2006.17.081After analyzing the data structures of PDF file, a novel information-hiding method based on the structures of PDF file is proposed. First, the secret data is camouflaged to form the legal PDF object, and then the data will be embedded in the carrier PDF file by operating the document flows. The embedding won’t affect the output of the readers, the editors and the printers. The information hiding and detecting of linearized PDF documents have been implemented. Theoretical analysis and experimental results show that the algorithm can achieve large capability, high speed of hiding and detecting, and security which depends on the encrypted algorithm and the key.
-
Computer Engineering. 2006, 32(17): 233-235,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.082The paper introduces a pure software implementation to transfer the real-time multi-media information in IP network, in which error control is implemented by software, and data reliability is guaranteed in the application layer. This implementation provides self-defined communication frames, encapsulated in datagram, to strengthen system flexibility and reliability. It also provides the complete solution of the remote control of equipment, and the acquisition, process, transmission of data and image. This solution, in which all the information is compressed, encapsulated, real-time transmitted and stored in SQL Server7.0 by ADO, is transparent and easy to maintain.
-
Computer Engineering. 2006, 32(17): 236-238. https://doi.org/10.3969/j.issn.1000-3428.2006.17.083H.264 is the latest under development video coding standard. It uses variable-size block to improve the motion estimation accuracy of inter-coding blocks. But it is extremely computational intensive. Though JVT adopts a proposal about fast motion estimation(FME) which shows very good capability in keeping the rate distortion performance and a great computation reduction can be achieved, still computes complex. This paper proposes and investigates fast variable block-size motion estimation algorithms based on merge and split procedures for H.264 video encoding. Experiments results show that the proposed method can save about 24.7% to 29.7% computations while keeping similar picture quality.
-
Computer Engineering. 2006, 32(17): 239-241,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.084This paper introduces the development of virtual Geology museum, describes some of the techniques in its implementation, such as geometry model, texture mapping and behavior model, and discusses the method how to optimize VRML file and reduce romance of the system VRML file. At last, a vivid virtual three-dimension museum is constructed on Web.
-
Computer Engineering. 2006, 32(17): 242-243. https://doi.org/10.3969/j.issn.1000-3428.2006.17.085A fast two-step search algorithm for half-pixel motion estimation is proposed based on the fact that the SAD distortion function increases monotonously as the search location moves away from the sub-pixel minimum within 1 pixel neighborhood of the result of integer-pixel search. Experimental results show that significant reduction in computation is achieved by using the propose method, without visible loss in video fidelity.
-
Computer Engineering. 2006, 32(17): 244-245. https://doi.org/10.3969/j.issn.1000-3428.2006.17.086Compared with the traditional desktop GIS, the embedded GIS is portable and shockproof. It can provide real time geographic information under the mobile environment and has comprehensive application in the field of vehicle positioning and navigation. Integrated with the technology of middleware and the algorithm of map matching, the embedded GIS presented is composed of the GPS/INS positioning module and the GPRS module, which can provide basic geographic service, positioning and navigation service and wireless communication service.
-
Computer Engineering. 2006, 32(17): 246-248. https://doi.org/10.3969/j.issn.1000-3428.2006.17.087Power management plays an important role in embedded systems. Because of the lack of standard for embedded systems’ power management interface, the portability of embedded operating systems is limited. A unified hardware abstract layer for power management is presented in this paper. In the model, real power manageable components can be organized in virtual power manageable components. Through the unified power status transfer functions; embedded operating systems can manage the power of real or abstract power manageable component without taking care of the details of power management in different hardware platforms. So, the portability of the embedded operating systems is improved.
-
Computer Engineering. 2006, 32(17): 249-251. https://doi.org/10.3969/j.issn.1000-3428.2006.17.088EPA communication protocol model and EPA communication schedule rule are presented. According to the principle and requirement of communication schedule, the principle of EPA protocol deterministic schedule is researched. The testing method and testing system structure of EPA deterministic schedule test are put forward. The test flow of schedule precision and schedule order are respectively presented. The practical application of deterministic schedule test system indicates the validity of this test method.
-
Computer Engineering. 2006, 32(17): 252-253,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.089This paper presents the design and implementation of an Internet video phone system based on ITU-T H.323. It is a USB-based low-cost Internet communication terminal system. Its QoS guarantee mechanism is also presented. By filling the ToS field of each data packet with different code, it classifies different services’ priorities. The paper designs a doubly linked list jitter buffer to smooth the delay variation. The nodes in the list are data frames and free frames that can dynamically transform each other. An input and a play thread access the list exclusively. A series of tests show that the average delay is less than 30ms and the loss rate is below 10%.
-
Computer Engineering. 2006, 32(17): 254-256,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.090A novel method is proposes to design a configurable, mixed-Radix8/4/2 and floating-point high-speed FFT processor. The improved mixed-Radix8/4/2 algorithm, ping-pong RAM architecture, data address generator and pipelining floating-point process unit which enhance the processor’s performance to read, write, compute 16 data simultaneously and process unfixed point with high-precision are discussed in detail. The design has been verified on the FPGA platform and synthesized in 0.18μm CMOS technology. It is showed that the IO rate is 250MSPS at 4k point and will reach to 800MSPS after its migration to ASIC.
-
Computer Engineering. 2006, 32(17): 257-258,. https://doi.org/10.3969/j.issn.1000-3428.2006.17.091This paper introduces the structure of mould liquid steel level control system in continuous casting and uses the fuzzy dual-mode control algorithm to control the liquid steel level. Prepared with the traditional method, the advanced control system is more efficiently to smooth away the change and disturbance during the producing. The experiment result shows that the method is valid.
-
Computer Engineering. 2006, 32(17): 259-261. https://doi.org/10.3969/j.issn.1000-3428.2006.17.092Based on the sufficient analysis and study of Rational unified process(RUP) method and project characteristics of large and medium construction enterprise, a RUP cutting model which is oriented the information system in construction enterprise. And then the model is applied to a concrete example of information system in construction enterprise. The good effect is finally achieved and proves the model is practicable and beneficial to develop information system in construction enterprise.
-
Computer Engineering. 2006, 32(17): 262-264. https://doi.org/10.3969/j.issn.1000-3428.2006.17.093The thesis sets up the system of SRM that based on the frame of Struts. And it gives a system construction and the total design project, processes the demarcation of the system function, gives the total system process and the total frame designs. It analyzes the system realization and the demarcation between data and presentation, performances the legal power management of SRM system Web layer, client system design of SRM system based on J2EE.
-
Computer Engineering. 2006, 32(17): 265-267. https://doi.org/10.3969/j.issn.1000-3428.2006.17.094Embedded system based on ARM7 MCU S3C44B0X and network interface chip RTL8019AS is developed, on which uClinux operation system is ported. Serial port/Ethernet data transfer device through TCP/IP protocol is developed under RH Linux 9.0 and uClinux cross development tools for ARM. Server and client mode are supported. It provides a low-cost solution for traditional serial-interfaced equipment to connect with the Internet. This device has been put into use in a mechanical manufacturing company.
-
Computer Engineering. 2006, 32(17): 268-270. https://doi.org/10.3969/j.issn.1000-3428.2006.17.095This paper classifies a digital home network and analyzes its research status. About home control networks, it presents a scheme of distributed digital home control networks. It introduces its structure, proposes network protocol stack model, the composing of a home gateway and the application design of remote control. Finally, it points out the next step work.
-
Computer Engineering. 2006, 32(17): 271-273. https://doi.org/10.3969/j.issn.1000-3428.2006.17.096This paper presents a software design processing for bioinformatics based on Java. In this paper, system structure, function for each model and key technologies are introduced. This software system can accomplish sequence analysis in bioinformatics stream, and provide availability for data analysis and processing.
-
Computer Engineering. 2006, 32(17): 274-276. https://doi.org/10.3969/j.issn.1000-3428.2006.17.097This paper uses eclipse as development tool and does some work and gets some results in the aspect of managing test tools and test cases in the areas of embedded software test. The reason why it uses eclipse to construct test tools management platform is presented, as well as the platform framework and technical realization.
-
Computer Engineering. 2006, 32(17): 277-279. https://doi.org/10.3969/j.issn.1000-3428.2006.17.098On the basis of analyzing the limitation which information publishing system and tourism E-commerce exist, this paper presents a new platform architecture of tourism E-commerce based on information publishing system. The general model, key technologies, and implementing process of the platform architecture are given, the XSLT template parsing and transformation technology of StrutsCX framework and XML document tree based on J2EE platform is adopted. As a automatic building platform aim at customizing and constructing respective characteristic site for clients is provided, many tourism application components may be built on the platform architecture by way of plug-in.
-
Computer Engineering. 2006, 32(17): 280-282. https://doi.org/10.3969/j.issn.1000-3428.2006.17.099In a specific application domain, the grid data management needs to integrate and access existing information resource by publishing domain-specific metadata. In this paper, the information resource in the field of oil & gas exploration and development is regarded as main study object. Based on its multi-dimensional, multi-tiered and structured characteristic, a grid component is designed to integrate and access existing databases. It also depicts the metadata schema that describes the database contents and mapping schema and discusses the component’s role in application grid architecture.
-
Computer Engineering. 2006, 32(17): 283-284. https://doi.org/10.3969/j.issn.1000-3428.2006.17.100The paper proposes an architecture model for design system management software. The model consists of a management platform and one or more management applications that run upon the platform. The management platform is actually a policy-based, three-tiers, center-oriented, multi-tiered framework. Management application is a software module that performs concrete management functions. The most important advantage of the model is that it has good extensibility. It lays emphasis on the design of the management platform.
2024
Volume 50 No 4
Volume 50 No 4
(Started in 1975, Monthly)
Sponsored by：
East-China Institute of Computer Technology Shanghai Computer Society
Edited & Published by：
Editorial Board of Computer Engineering
Chief Editor：Jiang Bo
Executive Chief Editor:
Hu Bing
Tel：021-67092217
E-mail: ecice06@ecict.com.cn
CN: 31-1289/TP
ISSN: 1000-3428
Sponsored by：
East-China Institute of Computer Technology Shanghai Computer Society
Edited & Published by：
Editorial Board of Computer Engineering
Chief Editor：Jiang Bo
Executive Chief Editor:
Hu Bing
Tel：021-67092217
E-mail: ecice06@ecict.com.cn
CN: 31-1289/TP
ISSN: 1000-3428