Loading...

Table of Content

    01 November 2006, Volume 26 Issue 11
    Articles
    The Design And Its Implementation Of Wireless Sensor Network Gateway
    2006, 26(11):  2525-2527. 
    Asbtract ( )   PDF (896KB) ( )  
    Related Articles | Metrics
    An embedded gateway of wireless sensor network was designed, and a management and query mode was proposed. This gateway took microprocessor AT91ARM9200 as the core chip, GoAhead Web Server as the embedded Web Server, and Sqlite as the embedded database. The interaction between Web server and Web browser was implemented through Common Gateway Interface (CGI). The reception and analysis of serial data were made with C program. This gateway has many advantages such as high efficiency of datacollection, high runningspeed, and high credibility. It can manage and store the sensor network data effectively, therefore, achieving the remote query and supervision of the data in the wireless sensor network.
    Adaptive MAC protocol based on Clustering for Wireless Sensor Networks
    2006, 26(11):  2528-2530. 
    Asbtract ( )   PDF (561KB) ( )  
    Related Articles | Metrics
    This paper analyzes the drawbacks of the existing MAC protocols in Wireless Sensor Networks, and then presents an adaptive MAC protocol based on clustering (AMAC), its frame time size can be adjustable automatically according to the changing of network topology and traffic load. The simulation results show that AMAC outperforms other MAC protocols in the real-time and mobility networks.
    Technology of Mobile Querying Based on Message Prefetch for Wireless Sensor Networks
    2006, 26(11):  2531-2535. 
    Asbtract ( )   PDF (1104KB) ( )  
    Related Articles | Metrics
    The data service of information gathering and transmission to terminal user is a key problem for wireless sensor networks .A data query processing scheme called “Mobile-Query” is developed as well as its system architecture and query model. Just In Time mechanism is adopted to transmit prefetching message for initializing query tree and re-scheduling nodes’ sleep periods before user reaching. Query result can be send back to user just before the end of query period. Both theoretical analysis and simulations based on NS-2 give promising performance.
    Robustness-testing of BGP Based on Scenario Model
    2006, 26(11):  2536-2538. 
    Asbtract ( )   PDF (599KB) ( )  
    Related Articles | Metrics
    This paper proposes a systematic robustness testing approach. First the RI-Pro of BGP was analyzed. Then the Scenario Model was built to describe the applied environment and control parameters of the process of decision and route update. Based on this model, a novel generation method of robustness-testing suite is presented. Some critical techniques related to the approach are investigated, such as the relationship set and the searching spaces of the robustness testing. This approach, which combines the techniques of software testing and protocol testing, Have good applied development foreground. Robustness testing of BGP indicates that this approach can avoid the problem of combinational explosion. Compared with positive test suit, the error-detecting ability of negative test suit generated by this approach is enhanced 1.3 times.
    Research on Traffic Engineering development based on MPL
    2006, 26(11):  2539-2543. 
    Asbtract ( )   PDF (1422KB) ( )  
    Related Articles | Metrics
    MultiProtocol Label Switch (MPLS) has become key IP technology. The challenges of MPLS traffic engineering technology were analyzed. The progress of the research about MPLS traffic engineering was summarized, and classified into four kinds of methods. A functional model of MPLS traffic engineering was proposed. Finally, some personal perspectives and suggestions were proposed.
    Design of proxy based on network isolation system
    2006, 26(11):  2544-2546. 
    Asbtract ( )   PDF (776KB) ( )  
    Related Articles | Metrics
    The architecture of network isolation system based on network isolation technique was proposed. And design of its proxy part was discussed in detail. Then the difference between the proxy pattern and traditional proxy server was specified. The HTTP transparent proxy was realized in the end.
    A new distributed power control algorithm in CDMA communication system
    2006, 26(11):  2547-2549. 
    Asbtract ( )   PDF (591KB) ( )  
    Related Articles | Metrics
    Based on traditional CDMA power control balancing algorithm, a noncooperative game was introduced. An appropriate cost function was chosen and a new algorithm for distributed power control was proposed. Practical applications prove that the proposed algorithm converges at a unique fixed point. Simulation results demonstrate that the speed of the new algorithm is about two times that of the traditional one. Whats more, the substantial power declines greatly while slightly reducing the achieved SIR.
    Research of routing algorithms in structured P2P network based on super nodes
    2006, 26(11):  2550-2553. 
    Asbtract ( )   PDF (761KB) ( )  
    Related Articles | Metrics
    Based on the research of classical routing algorithms in structured P2P network, a new routing algorithm, named Based Super Node CubeConnectCycle (BSNCCC) was proposed. Based on O(d)(N=d*2d)hops per lookup request by using O(1) neighbors per node, the algorithm took advantage of the difference of nodes capabilities in the network. The algorithm guaranteed that the nodes with the best capabilities served as the primary nodes. The simulation results show that BSNCCC routing algorithm has higher location efficiency than Cycloid in large scale and dynamic P2P networks that have frequent nodes arrival and departure.
    A selective GMDH network ensemble algorithm
    2006, 26(11):  2554-2557. 
    Asbtract ( )   PDF (726KB) ( )  
    Related Articles | Metrics
    A selective GMDH network ensemble algorithm was presented. With the punitive classification of the samples for training GMDH network individuals, a group of candidate GMDH networks were developed which were different from each other. Genetic algorithm was then used to evolve the best subset of the candidates to form the ensemble. Experiments show that compared to allcandidates GMDH ensemble and GMDH network individuals as well as the traditional BP neural network ensemble, selective GMDH network ensemble improves the performance greatly.
    Three-tier K-ary tree: A new group topology architecture in instant messaging
    2006, 26(11):  2558-2560. 
    Asbtract ( )   PDF (768KB) ( )  
    Related Articles | Metrics
    As a new instant messaging (IM) technology, chat group has been developed to resolve multicommunication problems. Some popular IM applications, such as MSN and QQ, have been integrated with the latest products. However, they are so dependent on central server that their applied domain is difficult to enlarge. A new chat group topology architecture, 3tier Kary tree, was proposed. It distributed the payload of central server among some selected clients with some specific rules so as to alleviate central server payload and enhance the chat group scalability. The analysis and simulation show that 3tier Kary can achieve the expected aims above and maintain the performance of the chat group at the same time.
    Maintenance algorithm of application level multicast tree
    2006, 26(11):  2561-2663. 
    Asbtract ( )   PDF (560KB) ( )  
    Related Articles | Metrics
    The application level multicast tree is composed of the end hosts which can not ensure the stability of the multicast tree. The failure of the end host in the multicast tree may cause the split of the multicast tree. Therefore, the multicast tree needs to be rebuilt quickly to ensure that every group of clients in the multicast tree can receive the data. Analyzing the characteristics of the division and renewal of the multicast tree, the maintenance model of the application level multicast tree with the delay and degree constraints was constructed. The complicated multicast tree problem was decomposed by Lagrangian relaxation. A new maintenance algorithm of the application level multicast was advanced. The simulation results show that the algorithm is of higher converging speed, stability and easy operation.
    Congestion control mechanism of large quantity realtime video stream unicast
    2006, 26(11):  2564-2566. 
    Asbtract ( )   PDF (579KB) ( )  
    Related Articles | Metrics
    Based on the analysis of TCPfriendly congestion control mechanism, a TCPfriendly and RTCP feedbackbased congestion control mechanism was proposed. The ratio of dropped packet was analyzed by Kalman filter to forecast the status of network load. The sending rate was adjusted by setting up the buffer. The character of TCPfriendly and the quality of playback of this congestion control mechanism was tested and analyzed by network simulation.
    Research of coverage and connectivity with sensor random deployment
    2006, 26(11):  2567-2569. 
    Asbtract ( )   PDF (512KB) ( )  
    Related Articles | Metrics
    Sensor deployment is a critical issue in a wireless sensor network.Random diffusion is widely applied to sensor nodes deployment, for example Gauss diffusion and uniform diffusion. The networks coverage and connectivity were discussed on base of random placement. By analyzing full coverage and connectivity, an expression was presented which reflected the relationship among the probability of the full coverage,the range of detection and the number of sensor nodes. Furthermore, the effect of parameters on the probability of full coverage was addressed, compared with the effects of Gauss diffusion and uniform diffusion. In addition, a scheme was proposed to optimize the number of nodes, named "full coverage and radial connectivity". At the end experiment results are given to display our application.
    Information security
    Research on emergency response policy automatization
    2006, 26(11):  2570-2572. 
    Asbtract ( )   PDF (865KB) ( )  
    Related Articles | Metrics
    Based on the research of current emergency response policies, a new policy system (PS) that adapted to the emergency response automatization was proposed. The system consisted of policy object (PO) and policy pattern (PP) databases. It produced realtime policy instances and operated automatically when network abnormalities occurred; therefore it laid a sound foundation for emergency response automatization.
    Proxy auction protocol in P2P network
    2006, 26(11):  2573-2575. 
    Asbtract ( )   PDF (606KB) ( )  
    Related Articles | Metrics
    A 2ndprice proxy auction protocol in peertopeer(P2P) network was presented. Bidders could enter and leave the protocol after throwing out the bidchains, and other peers in the P2P network completed the auction instead. During the whole auction, bidchains containing lower prices would be discarded encrypted and only the one of highest price was left. Compared with other auction protocols, bidders can submit their bids asynchronously like the distributed auctions, and all the bids are kept secret before the end of the protocol like the sealedbid auctions.
    A secure twoparty bargaining protocolbased on additive homomorphic public key cryptosystem
    2006, 26(11):  2576-2577. 
    Asbtract ( )   PDF (592KB) ( )  
    Related Articles | Metrics
    Secure multiparty computation with its applications is an important direction in current cryptography research field. The research focuses on how to accomplish the secure cooperative computation among multiparty without the participation of the third party. The twoparty bargaining protocol, based on homomorphic public key cryptosystem, was an example of secure multiparty computations applications. One participant can make a bargain with the other by implementing the protocol. During the implementation of protocol, the privacy of input and the correctness of output could be preserved. The protocol can be implemented without the participation of the third party and its security was based on additive homomorphic public key cryptosystem.
    RAP2P: A resource advertising-based unstructured P2P system
    2006, 26(11):  2578-2582. 
    Asbtract ( )   PDF (1062KB) ( )  
    Related Articles | Metrics
    The data management and resource locating algorithms of unstructured P2P system were studied. The proposed system was called RAP2P. The system simulated the marketing behavior, and shared the resource of advertised information to improve the resource locating performance. A gossipingbased resource advertising algorithm was proposed to propagate the resource information. By constraining the caching of resource information, the 2hop search space stored the largest percent of all information. To exploit such resource layout, a dynamic shadow flooding search algorithm was presented. The analysis and simulation show that RAP2P requires about 25% message overhead of flooding algorithm and 30% to 50% query delay of flooding algorithm with 100% query hit rate, and its query delay is also far below that of k-random walks.
    A new algorithm for dynamic handwriting signature verification based on evolutionary computation
    [中]匡韬 [英]Tao Kuang
    2006, 26(11):  2583-2585. 
    Asbtract ( )   PDF (747KB) ( )  
    Related Articles | Metrics
    A new algorithm for dynamic handwriting signature verification was proposed based on evolutionary computation (EC). The reference signature curve was divided into segments firstly. The adaptive dynamic segmentation and match between reference signature curve and test signature curve were implemented by dynamic search on the test signature curve with a search window of certain width. The theories of classification and acceleration in the EC were adopted in the basic evolutionary approach, which improved the search efficiency and matching result to a certain extent. The validity of the algorithm is proved by the experiment results.
    Efficient identity-based proxy blind signaturee
    2006, 26(11):  2586-2588. 
    Asbtract ( )   PDF (503KB) ( )  
    Related Articles | Metrics
    With proxy signature, an original signer can entrust his signing authority to a proxy signer. In blind signature scheme, a message and the signature result was unknown to the signer. An efficient identitybased proxy blind signature scheme was proposed by using bilinear pairings and combining proxy signature with blind signature. Analysis shows that the proposed scheme can satisfy all the required properties of a proxy blind signature. Furthermore, its efficiency is also better than that of the existing ones.
    Research and design of safety sign-on middleware based on multi-certificate
    2006, 26(11):  2589-2591. 
    Asbtract ( )   PDF (746KB) ( )  
    Related Articles | Metrics
    Based on the research of the characteristics of Public Key Infrastructure (PKI) / Privilege Management Infrastructure (PMI), the formats of two certificate were designed, and a safety signon middleware based on proxy certificate was developed. It can achieve single signon (SSO) and authorization based on attributes certificate with the composed certificate in usable field. It solves the SSO problem in the multicertificate system.
    Proxy undeniable signatures
    ChenHuang Wu
    2006, 26(11):  2592-2595. 
    Asbtract ( )   PDF (683KB) ( )  
    Related Articles | Metrics
    Proxy signatures allow an original signer to entrust a proxy signer to sign messages on behalf of him. Undeniable signatures ensure that only the signer can confirm or deny the validity of a given signature to the third party. For the need of some practical applications, the proxy signature and the undeniable signature were combined together, and a new concept of proxy undeniable signature was proposed. The proxy undeniable signature schemes security could be proved under the decisional DiffieHellman assumption.
    Re-sampling detection in information forensics
    2006, 26(11):  2596-2597. 
    Asbtract ( )   PDF (799KB) ( )  
    Related Articles | Metrics
    A digital image generated by resampling is the combination of the original image signal and periodical signal. Through the analysis of the two original signals by using EM algorithm, the traces of resampling could be detected. Through the modification of the present model, the uniform distribution was supplanted by the original image distribution and a priori probability updating was added in order to approach the realistic distribution. The possible singular points during the EM iterations were avoided by adding a small threshold. Experiment results demonstrate the effectiveness of the modified model in detecting image resampling. Furthermore, it can detect resampling traces on uncompressed bmp or tiff images, and it even can detect whether an image is JPEG compressed accurately.
    Audio re-sampling detection in audio forensics based on EM algorithm
    2006, 26(11):  2598-2601. 
    Asbtract ( )   PDF (895KB) ( )  
    Related Articles | Metrics
    In audio forensics, resampling detection is an important part of signal interpolation detection, for the reason that audio interpolation is often accompanied with resampling. Resampled signals usually contain some periodic artifacts, which can be a proof of forgery. EM algorithm was applied in parameter estimation of the periodic artifacts to detect if the signal was interpolated. To work out a satisfying result in applying EM algorithm and make it more suitable to audio signal detection, audio signal histogram was introduced to describe the exact distribution, the silence and the local linear relationship was taken into account. In addition, the statistical moments in frequency domain were chosen as features to classify the original and the interpolated audio signals. The whole detection process was used on statistical classifying experiments. The result shows that it can get a high correct rate. It also took effect in local resampling detection.
    A new chaotic cryptosystem based on discrete skew tent map
    2006, 26(11):  2602-2604. 
    Asbtract ( )   PDF (651KB) ( )  
    Related Articles | Metrics
    A new chaotic cryptosystem based on discrete skew tent map was proposed by making use of the dynamic encryption parameter and fractionized subblocks of plain text block scheme, and taking into account of the chaos features of the tent map. The proposed cryptosystem inherited the advantages of the original one. Theoretic analysis and experiment results prove that it has better antichosenplaintextattack property and stable encryption/decryption speed.
    An improved confirmer digital signature scheme
    2006, 26(11):  2605-2606. 
    Asbtract ( )   PDF (369KB) ( )  
    Related Articles | Metrics
    An improved confirmer digital signature scheme was presented based on the analysis of the disadvantages of traditional confirmer signature algorithm and the introduction of zeroknowledge proof. In this scheme, signer need not directly provide his signature to the information, he just need to provide a zeroknowledge to prove that he has the information signature. This zeroknowledge proof includes the signers identity information. Compared with the traditional confirmer signature algorithms, the improved scheme is simpler and more efficient, and has higher security.
    Role-based dynamic access control model for Web Services
    2006, 26(11):  2607-2609. 
    Asbtract ( )   PDF (722KB) ( )  
    Related Articles | Metrics
    The current access control models are mostly static and coarsely grained; they are not wellsuited for the serviceoriented Web Services environments where information access is dynamic. In order to solve this problem, a rolebased dynamic access control (RBDAC) model for Web Services was proposed. The RBDAC model can activate role assignments and permission assignments based on context information, and make access control decision dynamically.
    Formal analysis technology of non-repudiation protocols
    2006, 26(11):  2610-2614. 
    Asbtract ( )   PDF (1037KB) ( )  
    Related Articles | Metrics
    Some kinds of present formal methods of nonrepudiation protocols were studied and compared. Their advantages and disadvantages were discussed. Finally, study for future development was suggested.
    Research on continuous learning of anomaly detection pattern
    2006, 26(11):  2615-2617. 
    Asbtract ( )   PDF (549KB) ( )  
    Related Articles | Metrics
    The concept of phase learning was proposed, and it could be used to determine whether a learning mode was complete or not. Then, a Phases Anomaly Detection Pattern Learning algorithm, PADPL, was put forward. Simulation shows that PADPL could meet the requirements of phases anomaly detection pattern learning which were caused by uncompleted learning mode.
    Artificial intelligence
    A new model for detector generation based on artificial immune system
    2006, 26(11):  2618-1621. 
    Asbtract ( )   PDF (877KB) ( )  
    Related Articles | Metrics
    Based on the research of clonal election algorithm of KIM and BENTLEY, a new model for detector generation, which inherited the idea from artificial immune system (AIS), was proposed. This model worked with two key newly developed algorithms. Firstly, in order to improve the diversity and adaptability of detectors, a probability selection algorithm based both on similarity and adaptability was proposed, and the common form of this kind of probability selection was given. The authority factor above in this algorithm was analyzed theoretically. Secondly, in order to pass the best gene of father detectors to the children as well as possible and prevent degradation in process of mutation and crossover, the concept of effective gene and the strategy to keep excellence were proposed. Simulation results suggest how to choose appropriate parameter α and threshold Neg of length of effective gene. The ideal choice allows the model to achieve high level of diversity and adaptability, and have good nonself detection rate with a very low rate of self detection.
    Semantic analysis and opinion mining on Chinese review sentences
    2006, 26(11):  2622-2625. 
    Asbtract ( )   PDF (794KB) ( )  
    Related Articles | Metrics
    By using natural language management technology, Chinese Web review sentences were semantic studied and opinion mined. A new algorithm for computing the contextual polarity of polar words was proposed, and a framework was introduced for topic identification and feature extraction. The framework provided an innovative solution for the association of extracted opinion to its specific topic. The experiment results show that the algorithm is both reasonable and effective compared with the results of manual annotation.
    Extended Bayesian network retrieval model based on synonyms
    2006, 26(11):  2628-2630. 
    Asbtract ( )   PDF (572KB) ( )  
    Related Articles | Metrics
    To capture relationships between terms by means of synonyms and introduce several modifications to the simple Bayesian network for information retrieval, an extended retrieval model that included direct relationships between terms was proposed. Experiment results show that good retrieval effectiveness can be achieved by adjusting the parameter of the Bayesian networks used in our model.
    Study of supply chain optimization scheduling in mass customization based on ant colony algorithm
    2006, 26(11):  2631-2634. 
    Asbtract ( )   PDF (997KB) ( )  
    Related Articles | Metrics
    To solve the problem of the dynamic supply chain optimization scheduling after customer order decoupling point in mass customization, an optimization scheduling model including supplier selection and interenterprise scheduling was proposed. Then an ant colony algorithm based solution was designed. Finally by practical manufacture data and methods comparison, the validity and stability of this algorithm were verified.
    Construction of user ontology and its application in personalized retrieval
    2006, 26(11):  2635-2638. 
    Asbtract ( )   PDF (736KB) ( )  
    Related Articles | Metrics
    To let users easily and correctly find the correct information they want from the Internet where the information is numerous and jumbled, on the basis of traditional retrieval technique, the concept of user ontology in personalized retrieval was proposed in combination with the research of ontology and personalized retrieval technique. The construction and maintenance of user profile based on behavior was introduced. And the extraction rules of semantic relations were discussed in detail. The method of constructing the user ontology was given based on the discussions. Finally,the availability of using user ontology in personalized retrieval was shown by a comparative experiment.
    Vehicle routing problem with fuzzy demands and its heuristic ant colony algorithm
    2006, 26(11):  2639-2672. 
    Asbtract ( )   PDF (906KB) ( )  
    Related Articles | Metrics
    Based on the analysis of strategy for solving vehicle routing problem with fuzzy demands (VRPFD), an improved ant colony algorithm was proposed. In this advanced algorithm, multiant colonies collaborated, the state transition rules were modified, and the parameters were adjusted according to the convergent requirements. It was applied to solve VRPFD under opportunity restriction and possibility strategy. The real demands based on statistical simulation were used to appraise the prior routing. Experimental results show that the algorithm is feasible and effective for VRPFD.
    Research of unrelated parallel scheduling based on compound policy
    2006, 26(11):  2643-2644. 
    Asbtract ( )   PDF (530KB) ( )  
    Related Articles | Metrics
    An assignment and scheduling algorithm based on compound policy was presented for multitask unrelated parallel scheduling problem with different types of independent tasks and machines. Then the illustrating examples were scheduled by it. The results show that this algorithm has certain superiority compared with other algorithms mentioned in the references.
    Application of quantumbehaved particle swarm optimization in training support vector machines
    2006, 26(11):  2645-2647. 
    Asbtract ( )   PDF (752KB) ( )  
    Related Articles | Metrics
    The key problem of training support vector machines is how to solve quadratic programming problem, but for large training examples, the problem is too difficult. The intelligent search techniques, such as genetic algorithms and particle swarm optimization algorithm, can reach a similar solution of problem in less time. Quantumbehaved particle swarm optimization (QPSO) developed on the basis of classical particle swarm optimization is a method with better convergence and stability. Simple and rapid QPSO algorithm is applied in training support vector machines to solve quadratic programming problem. It is a new way for solving quadratic programming problem with a large number of example vectors.
    Multi-agent negotiation: an approach based on fuzzy logic control
    2006, 26(11):  2648-2650. 
    Asbtract ( )   PDF (592KB) ( )  
    Related Articles | Metrics
    To overcome the disadvantages of current agent negotiation models analyzed, a general architecture of blackboard patternbased negotiation agent was proposed. Then, a generalpurpose comprehensive evaluation method of negotiation agent proposals was put forward. In addition, following standard additive model theory, strategies model based on negotiation agent was designed. As a result, a widely used automatic negotiation agent model was constructed.
    An adaptive niche genetic algorithm by evolution grads
    2006, 26(11):  2651-2653. 
    Asbtract ( )   PDF (497KB) ( )  
    Related Articles | Metrics
    To solve the problems of premature convergence and local minima in simple genetic algorithm (SGA), an evolutionary gradincluded niche genetic algorithm (GNGA) was proposed. In the GNGA, evolutionary grad was used to improve the ability of finding the local best; the crossover value and mutation value were adapted dynamically with the generation so that the precision was improved; the population diversity was guaranteed by the use of the niche algorithm based on crowding mechanism. Simulation results show that this method has its superiority in precision and convergence rate compared with SGA.
    Database Technology
    An efficient graph-based algorithm for discovering association rules
    Ming Chen
    2006, 26(11):  2654-2656. 
    Asbtract ( )   PDF (614KB) ( )  
    Related Articles | Metrics
    The algorithm for discovering association rules based on graph only scans the database once to construct an association graph and then traverses the graph to generate all frequent itemsets. It costs too much time in proving the candidate frequent itemsets to be really frequent. An improved algorithm was proposed. The improvements were renumbering the frequent 1 item in the support degree descending order and utilizing the Apriori property to prune the redundant extended items which were used to generate the candidate frequent itemsets. Experiment results show that the improved algorithm prune the redundant candidate frequent itemsets when the minimum support degree is small, and the performance is improved.
    Study on fast data stream indexing based on wavelet approximations
    2006, 26(11):  2657-2660. 
    Asbtract ( )   PDF (787KB) ( )  
    Related Articles | Metrics
    A new solution was proposed to summarize and index distributed data streams. The synopsis was abstracted by Discrete Wavelet Transform (DWT) on line and inserted to highdimension indexing structure in order to reduce the overhead of network maintenance. Simulation shows that the method improves the query precision greatly and saves response time in pattern analysis and relation detection.
    Central technology of Web service discovery based on semantics
    2006, 26(11):  2661-2663. 
    Asbtract ( )   PDF (776KB) ( )  
    Related Articles | Metrics
    Because Web Ontology Language Service (OWLS) was lack of clear depiction to Quality of Service (QoS), QoSOn was introduced to extend OWLS. Then, a matching model named "Two Phases" was proposed. In this model, the irrelevance services were eliminated by matchmaking based on classification, and similarity functions were introduced to rank semantic similarity between the candidate services and request service. Both OWLS profile functional similarity and QoS similarity based on QoSOn were evaluated to measure the similarity between the candidate services and the request. The matching algorithm is proved to be feasible and effective by comparative experiments.
    Attribute reduction way of incomplete information systembased on set covering problem
    2006, 26(11):  2664-2666. 
    Asbtract ( )   PDF (533KB) ( )  
    Related Articles | Metrics
    By analyzing the characteristics of incomplete information system and the definition of similar relation, and constructing the related matrix of incomplete information system, the minimum attribute reduction problem was related to the minimum set covering problem. The minimum attribute reduction problem could be translated to the set covering problem, and the minimum attribute reduction could be got by using the set covering problem ways. The examples prove that this method is feasible and efficient.
    Application of SOFM neural network for analyzing non-spatial attributes
    2006, 26(11):  2667-2669. 
    Asbtract ( )   PDF (779KB) ( )  
    Related Articles | Metrics
    Because of high dimension characteristic of nonspatial attributes, the difficulties in operation are how to set parameters for these attributes. When using general spatial clustering algorithm, the difficulties are how to judge which dimensions play main role and affect cluster result. Based on the research of those problems, a method for analyzing nonspatial attributes was proposed. First, SelfOrganizing Feature Map (SOFM) was adopted to choose some dimensions, and used to cluster the dense nonspatial attributes on these dimensions. Then the cluster of nonspatial attributes and that of spatial attributes were merged.
    A new algorithm for mining maximal frequent itemsets
    2006, 26(11):  2670-2673. 
    Asbtract ( )   PDF (784KB) ( )  
    Related Articles | Metrics
    Maximal frequent itemsets mining was one of the most important basic problems for itemset mining. Based on the analysis of the existing algorithms, a new algorithm for maximal frequent itemsets mining was presented. Comparative experiments show that the new algorithm outperforms the current algorithms such as MAximal Frequent Itemset Algorithm for transactional database (MAFIA).
    I-XISS:an improved index structure for XML documents
    Feng Cao
    2006, 26(11):  2674-2677. 
    Asbtract ( )   PDF (776KB) ( )  
    Related Articles | Metrics
    Node index is one of the most representative XML indexes and can support regular path expression, but for the long query path expression, especially when the intermediate results are many, the joint operation of the intermediate results is time consuming. The structure of the node index was improved by reducing the number of joint operations for intermediate results. As a result, the query time was decided only by the complication of the path expression but not the length of the path expression. An algorithm was introduced to generate the query results based on the proposed index structure.
    Research and application of dynamic audit policy for secure spatial database
    2006, 26(11):  2678-2681. 
    Asbtract ( )   PDF (1034KB) ( )  
    Related Articles | Metrics
    A dynamic audit policy model based on secure spatial DBMS was proposed. The model could fully express audit policies based on time and space constraints, and monitor users activities realtimely by using constraints mechanism. Furthermore, finegrained audit policies could be expressed by introducing coherent properties expression. Then the algorithm was presented to trigger the rules. Finally, through embedding audit policy module, constraint policy module and log module, the dynamic audit policy model based on secure spatial DBMS Sec_Vista was realized.
    Design and implementation of inquiring and retrieval component for WMMS
    XiangHao Xiang
    2006, 26(11):  2682-2684. 
    Asbtract ( )   PDF (608KB) ( )  
    Related Articles | Metrics
    Based on the introduction of metadata inquiring technology to Warehouse Metadata Management Solution (WMMS), the metadata inquiring and retrieval component of WMMS, MDRETRIEVAL, was designed and implemented. Its design and architecture, and its work process were explained in detail.
    Graphics and image processing
    Study on noisy speech endpoint detection method
    2006, 26(11):  2685-2686. 
    Asbtract ( )   PDF (528KB) ( )  
    Related Articles | Metrics
    A major factor influencing the capability of speech recognition systems is the accuracy of endpoint detection.Some good detection algorithms cannot take effect in practical use because small SNR reduces the recognition rate. An algorithm for speech endpoint detection based on timefrequencyvariancesummation was proposed. The experiments prove that it has better detection capability with low SNR compared with other three endpoint detection algorithms.
    Extension of H.264: scalable video coding research and analysis
    2006, 26(11):  2687-2690. 
    Asbtract ( )   PDF (863KB) ( )  
    Related Articles | Metrics
    The background and technique characteristics of scalable video coding (SVC) were introduced in detail. The motion compensated temporal filtering (MCTF) was compared with hierarchical B pictures by simulation experiments. The spatial interlayer prediction technique was also simulated and analyzed. The simulation results indicate that the coding efficiency of MCTF is a little superior to hierarchical B pictures. Spatial interlayer prediction improves coding efficiency while increasing computation complexity significantly so that fast decision of whether doing interlayer prediction is an effective method to decrease the computation complexity.
    A new filtering method based on spatial clustering
    2006, 26(11):  2691-2693. 
    Asbtract ( )   PDF (994KB) ( )  
    Related Articles | Metrics
    Some traditional image filters may lose detailed spatial information while controlling noise. The remote sensing image cluster algorithm was introduced and improved, and then a spatial clustering method was presented. Spatial clustering method was helpful to distinguish and protect the image spatial patterns, and was used to separate louder noise that affected the image visual effect. Based on the separation of noise points set (NPS) and signal points set (SPS), NPS was filtered and SPS was fused with weighted averaging method. The result shows that new filter based on spatial clustering technique can remove the image noise. Furthermore, it can protect unpolluted detailed spatial information as much as possible. Better filtering result is got on the case of multi-noise.
    Usage of blind source separation in single channel speech enhancement algorithm
    2006, 26(11):  2694-2695. 
    Asbtract ( )   PDF (321KB) ( )  
    Related Articles | Metrics
    A new single channel speech enhancement algorithm was put forward. A pseudo noise source was used as the input of the multiple adaptive decorrelation (MAD) algorithm to get an improved speech signal. Moreover, Daubechies wavelet was adapted to transform the signal into wavelet domain. Proper threshold function was used to select wavelet coefficients, and then the signal into time domain was synthesized. Following the scheme provided above, we can get the speech signal with higher SNR and intelligibility.
    An improved timedelay estimation algorithm for acoustic detection and location
    2006, 26(11):  2696-2697. 
    Asbtract ( )   PDF (608KB) ( )  
    Related Articles | Metrics
    The application of time delay estimation in passive acoustic detection and location was studied. An improved maximum likelihood estimator as the generalized correlation method for timedelay estimation, which adopted the methods of windowing and least mean square (LMS) filter, was proposed. The simulation results show that the proposed algorithm can reduce the complexity of computation obviously, eliminate the influence of reecho efficiently, and has better estimation accuracy and robustness.
    A fast palette searching algorithm for color quantization
    2006, 26(11):  2698-2700. 
    Asbtract ( )   PDF (855KB) ( )  
    Related Articles | Metrics
    An EqualNorm EqualSum Palette Search (ENESPS) algorithm was proposed to speed up the color mapping step in color quantization. The palette color, whose norm was most similar to that of the pixel color to be mapped, was chosen as the initial searching point. Then the norm constraint and the sum constraint were applied to limit the searching range. Experiment results show that ENESPS can obtain shorter averaged searching length in comparison with other methods and it can reduce the computational time of color quantization remarkably.
    A 3-D fractal interpolation algorithm based on iterated function system
    2006, 26(11):  2701-2703. 
    Asbtract ( )   PDF (556KB) ( )  
    Related Articles | Metrics
    A new method was proposed for constructing fractal interpolation surfaces through points sampled on rectangular lattices. The proposed algorithm guaranteed the boundary continuity and canceled symmetry restriction on the initial data set. The constructed surface inherited the main features from the original data set as a whole and kept the selfsimilar trait of fractal in part. Experiment results show that the method is useful for threedimensional (3D) fractal interpolation.
    Double-tangent arc algorithm for generation of offset parallel curve
    2006, 26(11):  2704-2706. 
    Asbtract ( )   PDF (493KB) ( )  
    Related Articles | Metrics
    Using discrete character points to generate offset parallel curve has been applied in many ways such as spatial analysis in geographic information system (GIS), computeraided design (CAD) and processing of remote sensing images information extraction. But when the turn angles are relatively smaller, the results will have diversity with the reality, which impacts the use of the algorithm. Considering the doublelines figure and characteristics, doubletangent arc algorithm assuring the curves equidistant offset and smoothness was put forward. The algorithm solves the unified expression of doublelines parallel, equidistant offset and smoothness satisfactorily, and realizes offset parallel curves autogeneration by using central sampling points.
    An image retrieval method based on multiple color space
    2006, 26(11):  2707-2709. 
    Asbtract ( )   PDF (739KB) ( )  
    Related Articles | Metrics
    The hue singularity of HSV and its influence on image retrieval under the low saturation and the low value were analyzed. In order to solve this problem, an image retrieval method based on multiple color space was presented: the pixels in the singular regions were expressed by YUV and the others by HSV. The experiments prove that this method can eliminate the influence on image retrieval caused by HSV hue singularity to a certain extent, and improve the retrieval performance.
    An optimal color space description for skin detection
    2006, 26(11):  2710-2712. 
    Asbtract ( )   PDF (941KB) ( )  
    Related Articles | Metrics
    An optimal color space description for skin detection was presented. Firstly, skin color and nonskin color were regarded as two patterns. Then, an optimal color space description for skin detection was extracted based on the Fisher criteria, meanseparability and covariance separability. In the experiments, both the subjective and objective evaluations show that the optimal color space description proposed in the paper is better than other classical color spaces, and more beneficial to the skin detection.
    Edge detection based on adaptive ridgelet transform
    2006, 26(11):  2713-1715. 
    Asbtract ( )   PDF (575KB) ( )  
    Related Articles | Metrics
    A method for edge detection based on adaptive ridgelet transform was proposed. It could present and detect edges efficiently with different directions in an image. Experimental results show that the proposed method locates edges more precisely for noised images with straight edges.
    Predictive coding based on non-singleton fuzzy regular networkk
    2006, 26(11):  2716-2718. 
    Asbtract ( )   PDF (720KB) ( )  
    Related Articles | Metrics
    A predictive coding model based on nonsingleton fuzzy regular network (NSFRN) was presented. In this model, nonsingleton fuzzier was introduced into regular neural network, so that noise could be removed from train data adaptively. After being simulated and compared with other predictive coding models, the model shows much better performance on antijamming capability, prediction precision and the quality of reconstruction pictures.
    A view-based selection method for multi-resolution texture
    2006, 26(11):  2719-2720. 
    Asbtract ( )   PDF (907KB) ( )  
    Related Articles | Metrics
    MIP Mapping technique is very efficient for antialiasing in texture mapping. But as a conventional method, MIP Mapping selects the appropriate resolution texture according to the rendered sizes only, so at the initiation all levels of textures are loaded on the memory, which can reduce the efficiency of computer. When displaying large 3D urban maps, sometimes the lowest resolution texture is enough. To solve this problem, a viewbased method of controlling texture on 3D maps was proposed. The appropriate texture level was decided mainly according to two criteria. One was rendered sizes with viewpoint. The other was the importance of the texture on view. The test results show that the developed method can improve computing efficiency.
    A method for image salient regions detectionbased on layers and dynamic threshold
    2006, 26(11):  2721-2723. 
    Asbtract ( )   PDF (588KB) ( )  
    Related Articles | Metrics
    The model for detecting salient regions based on layers was developed and consummated. Primary images were divided into layers. And then for every layer, basic characteristics were extracted, and saliency characteristics including intensity saliency, saturation saliency and color saliency were calculated. Because of the possibility characteristics of images, the planar normal distribution function was adopted to present the pertinence of pixels accurately and reasonably. The results of layers were added and the dynamic threshold was used to reach the final saliency regions. Dynamic threshold method can be influenced hardly by the primary images, so it can adapt to different situations. When the method was applied to real images, satisfying results were got.
    A moving object detection algorithm based on stereo vision
    2006, 26(11):  2724-2726. 
    Asbtract ( )   PDF (817KB) ( )  
    Related Articles | Metrics
    A stereo vision method was used for detecting moving objects. First, the disparity map was got by using the stereo matching method. Then an algorithm based on disparity background difference was employed to detect the foreground region. Finally, every moving object was located correctly according to the disparity and position of the foreground region. The stereo algorithm can solve the problems effectively which cannot be solved by the monocular method. By using the stereo algorithm, the effect on object detection caused by illumination changes and shadow can be eliminated, and the moving objects can be recognized correctly when they are occluded.
    Adaptive detection of scene change for MPEG videos based on sliding window modeling
    2006, 26(11):  2727-2729. 
    Asbtract ( )   PDF (772KB) ( )  
    Related Articles | Metrics
    A method for detecting the scene change from MPEG videos automatically was proposed. It used the macroblock type information in the B frame to detect scene changes such as abrupt scene change and gradual scene change. In this method, the sliding window mechanism was adopted to detect the precise location. MPEG2 was employed as a research platform. The experiment results on movies, news and cartoons illustrate the superiority of the proposed algorithm measured by recall and precision rates.
    Level-of-detail technology of animation and collision in virtual reality
    2006, 26(11):  2730-2732. 
    Asbtract ( )   PDF (1181KB) ( )  
    Related Articles | Metrics
    Levelofdetail (LOD) technology of animation and collision were studied. Some effective methods such as animation LOD binary tree, and collision LOD control matrix were put forward. Experiment results show that the improvement of rendering on time can be achieved by applying these techniques to threedimensional scene with numerous animation and collision operations.
    Interactive defogging method for image
    2006, 26(11):  2733-2735. 
    Asbtract ( )   PDF (991KB) ( )  
    Related Articles | Metrics
    According to the exponential relationship between the degradation of the image and the depths of the scene points, a method was proposed to estimate the scene depths from a single image using simple additional prior information provided interactively by the user with his subjective discretion. So based on the dichromatic atmospheric scattering model, chromatic image defogging was implemented effectively through contrast enhancement. As the intensity of the processing output of the image degraded by dense fog was weak, the normal clipped stretching method was deployed to enhance the image brightness, and satisfying results were got.
    Typical applications
    Research on flexible dynamic change in workflow process management system for business process
    2006, 26(11):  2736-2738. 
    Asbtract ( )   PDF (623KB) ( )  
    Related Articles | Metrics
    In order to solve the problem of workflow flexible evolution in workflow management system, a business process dynamic change model based on the characteristics of life cycle and business process change management was proposed, and an instance transfer algorithm was put forward. Region partition was introduced in the transfer algorithm. After the check of relevant data consistency and the comparison of regions, dynamic adjustment could be done. Finally a case study based on the platform of workflow management system and the algorithm showed how to migrate a case from old process model to the new one.
    Automated procurement system of automobile supply chain based on semantic Web services
    QiLiang Zhang
    2006, 26(11):  2739-2741. 
    Asbtract ( )   PDF (829KB) ( )  
    Related Articles | Metrics
    A prototype system was presented which applied semantic Web services technology to automated business integration, focusing specifically on an automobile manufacturing supply chain. The system was able to handle order interaction, selection and generation through service discovery, selection and execution. Meanwhile this system adopted semantic expansion mechanism to enhance the capability of service discovery, search potential semantic Web services satisfying users requirements, and recommend services according to matching degree and preference. Besides, the architecture of the system was given, together with the implementation of key components.
    Modeling of synchronizationnetbased printing workflow
    2006, 26(11):  2742-2744. 
    Asbtract ( )   PDF (498KB) ( )  
    Related Articles | Metrics
    Synchronization net model, a formal workflow model based on Petrinet and C_net, was introduced. It conquered the shortages of Petri netbased modeling, and became directly perceptible, and easy to be analyzed and simulated. A case study of print business process was provided to illustrate the application of this method, and to prove its correctness.
    Command & decision-making system model based on workflow
    Gao Feng
    2006, 26(11):  2745-2748. 
    Asbtract ( )   PDF (906KB) ( )  
    Related Articles | Metrics
    To solve the problems of lowautomation in traditional command & decisionmaking system, a workflow based command & decisionmaking system model was proposed. This model evolved from workflow metamodel, and divided the common flow of command & decisionmaking into several key business activities according to some rules. It also divided an activity into several subactivities. The automation of command & decisionmaking system was improved effectively by using workflow. A prototype system was developed based on the model with C/S architecture. It could dominate the activities in client automatically while scheduling missioninstructions. Compared with traditional methods, the model has advantages of generalization, reliability and intelligence.
    A collaborative editing approach based on singleuser application extending
    2006, 26(11):  2749-2752. 
    Asbtract ( )   PDF (756KB) ( )  
    Related Articles | Metrics
    An approach to extend singleuser application was proposed to support collaborative editing. The approach supported unconstrained collaboration, and used operational transformation to maintain data consistency. In order to make best use of operational transformation, a linear sequence outside singleuser application was used to index the objects in documents. David Suns extending operational transformation algorithm was improved on the control layer to support documents sharing control of complex object structure.
    Integrated Petri net and ant colony optimization algorithm for the scheduling of FMS
    2006, 26(11):  2753-2755. 
    Asbtract ( )   PDF (838KB) ( )  
    Related Articles | Metrics
    Satisfactory solution has not been obtained to the scheduling problem in flexible manufacturing system (FMS). Ant colony optimization algorithm integrated with Petri net was proposed to solve the scheduling optimization problem in FMS. A case study illustrates the effectiveness of this method.
    Design and implementation of RAID mechanism based on ReedSolomon algorithm
    2006, 26(11):  2756-2758. 
    Asbtract ( )   PDF (680KB) ( )  
    Related Articles | Metrics
    To satisfy the reliability of mass information storage, a method to apply ReedSolomon algorithm to RAID system was proposed, and a realization under Linux system named RSRAID was given. Experiment results prove that RSRAID has good I/O performance and better reliability compared with other RAID systems.
    Application and Development of TMS320LF2407A DSP Based on RTOS μC/0S-Ⅱ
    2006, 26(11):  2759-2761. 
    Asbtract ( )   PDF (665KB) ( )  
    Related Articles | Metrics
    The principle and new functions of μC/OSⅡ were introduced. The characteristics of DSP TMS320LF2407A were analyzed. Whats more, how to configure μC/OSⅡ on TMS320LF2407A was given. In the end, several tasks, such as UART communication, CAN communication, CAP, AD and BIT, were realized in this system.
    A communication mechanism between node boards in the system of ATCA 3.1
    2006, 26(11):  2762-2764. 
    Asbtract ( )   PDF (752KB) ( )  
    Related Articles | Metrics
    For the problem of data exchanging in management platform between node boards of the system of ATCA3.1, Internode communication module was developed. In this module, data were exchanged in manner of messages between different nodes. According to BSD socket interface, the communication mechanism was designed by using address listener and the bottom layer communication channel was encapsulated. The mechanism was implemented in Linux. The result proves that it can solve the communication block problem efficiently.
    Variable conjugate gradient algorithm and its application in prediction of the total yield of main agricultural products of China
    2006, 26(11):  2765-2768. 
    Asbtract ( )   PDF (984KB) ( )  
    Related Articles | Metrics
    To improve the prediction accuracy of BP network, the variable conjugate gradient (VCG) algorithm was proposed. The new approach improved BP algorithm from two aspects: activation transfer function and learning rule. Its convergence was analyzed and briefly proved. The variable conjugate gradient algorithm was applied to train a multilayer neural network to predict the total yield of main agricultural products of China, which overcame the slow rate of convergence and poor generalization capability of the traditional BP algorithm.
    Integration with J2EE framework to build reusable E-commerce system
    2006, 26(11):  2769-2772. 
    Asbtract ( )   PDF (873KB) ( )  
    Related Articles | Metrics
    Considering the disadvantages of traditional development methods for J2EE Web applications, based on the system analysis, an architecture integrating Struts, Spring and Hibernate frameworks was proposed. A multitier Ecommerce system for tourism was rapidly built and developed using the architecture. The system can greatly reduce development complexity and time while providing the system with favorable reusability, expansibility and maintainability.
    Design and implementation of collision detection during the rendering of high fidelity dynamic terrain
    2006, 26(11):  2773-2774. 
    Asbtract ( )   PDF (760KB) ( )  
    Related Articles | Metrics
    Considering the contradiction between the high fidelity and real time of terrain rendering, realtime optimally adapting meshes (ROAM) algorithm developed by Mark Duchaineau and Seamus McNallys improvement to the ROAM algorithm were introduced. Then the system framework of rendering dynamic terrain was put forward. The collision detection between the entity in the virtual environment and the surface of the terrain was designed and implemented preliminarily. The final experiment testified the validity and feasibility of the scheme.
    A multi-target recognition algorithm for motion blur image in smallsize RoboCup competition
    2006, 26(11):  2775-2777. 
    Asbtract ( )   PDF (708KB) ( )  
    Related Articles | Metrics
    It is difficult for the visual subsystem of RoboCup robot soccer competition, which is realized by an interleaved camera, to identify the motion target on the field because of the motion fuzzy phenomenon. A new multitarget recognition algorithm for vision subsystem was presented based on the principle of track forecast. First, the target location of next frame was forecasted by current location and the target pixels on odd and even scan line were found in the region of forecasted target location. Then, the horizontal and vertical velocity vectors of the motion target were computed. Finally the motion interpolation was used to get high vertical resolution progressive frames from interlaced frames. Multitarget identity was realized at the same time. The result shows that visual systems identification ability of motion target can be improved by using this method.
    Character recognition by Gaussian descriptors
    YiShu Liu
    2006, 26(11):  2778-2780. 
    Asbtract ( )   PDF (455KB) ( )  
    Related Articles | Metrics
    Gaussian descriptors are contourbased shape features. They are invariant to translation, scaling changes, rotation and reflection. Compared to the existing shape features, they are more robust against noise and slight edge variations, and have lower computation complexity and higher recognition/retrieval rate. In addition, they are applicationindependent. In this paper, Gaussian descriptors were used as features for character recognition. A comparison with another contourbased moment invariants, which is an improvement and extension of classical Hu moments, was also given. Numerical experimental results show that Gaussian descriptors are an attractive tool for character recognition.
    Optimal feature extraction and face recognition based on kernel machinebased oneparameter multiple discriminant analysis
    2006, 26(11):  2781-2783. 
    Asbtract ( )   PDF (1179KB) ( )  
    Related Articles | Metrics
    A new algorithm, namely kernel machinebased oneparameter multiple discriminant analysis (K1PMDA), to extract optimal discriminant features was proposed and applied to face recognition. There are two problems in linear face recognition: One is that the distribution of face images with different pose, illumination and face expression is complex and nonlinear. The other is the small sample size (S3) problem. This problem occurs when the number of training samples is smaller than the dimensionality of feature vectors, which results in a singular withinclass scatter matrix. For the former, kernel technique can be used to extract nonlinear feature, and for the latter, a disturbed parameter was introduced to overcome S3 problem. Three databases, namely ORL, Yale Group B, and UMIST were selected for evaluation. The results are encouraging.
    Application of the dynamic combination rule-based watershed algorithm in medical image
    2006, 26(11):  2784-2785. 
    Asbtract ( )   PDF (724KB) ( )  
    Related Articles | Metrics
    In view of the fuzziness of medical image and the requirement in practical application, a watershed segmentation method was proposed based on the dynamic combination rule. It restrained the oversegmentation occurrence effectively by combining while segmenting in accordance with the dynamic combination rule. Experiments show that the proposed algorithm can segment medical images quickly and accurately. Furthermore, it is robust under noisy background.
2024 Vol.44 No.3

Current Issue
Archive
Honorary Editor-in-Chief: ZHANG Jingzhong
Editor-in-Chief: XU Zongben
Associate Editor: SHEN Hengtao XIA Zhaohui
Domestic Post Distribution Code: 62-110
Foreign Distribution Code: M4616
Address:
No. 9, 4th Section of South Renmin Road, Chengdu 610041, China
Tel: 028-85224283-803
  028-85222239-803
Website: www.joca.cn
E-mail: bjb@joca.cn
WeChat
Join CCF