UML is a universal, standard modeling language. It can be applied to the modeling of any system with static framework and dynamic action. However, UML lacks precise semantics which might lead to problems, such as inconsistencies, redundancies and so on. In order to detect the UML behavior diagrams, a dynamic description logic and a sound and complete tableau-based satisfiability-checking decidable algorithm for UML are presented in this paper. This logic is a combination of a typical action theory and the description logic ALCQI, with the feature that actions are treated as citizens. Actions can be expressed in the construction of concepts and formulas. Reasoning tasks on concepts and actions can be realized with the help of the tableau-based satisfiability-checking decidable algorithm, which makes this logic more capable for the UML behavior diagrams.
{"title":"A Dynamic Description Logic for UML","authors":"Ming Li, Fengkui Zang","doi":"10.1109/JCAI.2009.123","DOIUrl":"https://doi.org/10.1109/JCAI.2009.123","url":null,"abstract":"UML is a universal, standard modeling language. It can be applied to the modeling of any system with static framework and dynamic action. However, UML lacks precise semantics which might lead to problems, such as inconsistencies, redundancies and so on. In order to detect the UML behavior diagrams, a dynamic description logic and a sound and complete tableau-based satisfiability-checking decidable algorithm for UML are presented in this paper. This logic is a combination of a typical action theory and the description logic ALCQI, with the feature that actions are treated as citizens. Actions can be expressed in the construction of concepts and formulas. Reasoning tasks on concepts and actions can be realized with the help of the tableau-based satisfiability-checking decidable algorithm, which makes this logic more capable for the UML behavior diagrams.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122363800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The measurement system of diameters of ultra fine particles was developed with virtual instrument. Instead of the much expensive correlator, the photon counting technology was applied: H6240-01, the photon multiplier tube (PMT), was used as a detector; and M8784, the high speed photon counter, was used to count the pulses signals of PMT output, the real-time data of dynamic light scattering were analyzed in the mixed program of MATLAB and LabVIEW. We experimented respectively with the standard polystyrene latex particles: mean diameters of 100 and 600nm monodisperse and mean diameters of 90 and 450nm polydisperse, got the autocorrelation function curves of light scattering signals, and the exact information of particle size distributions could be deduced from the inversion results of the autocorrelation function of monodisperse and polydisperse with CONTIN arithmetic.
{"title":"Measurement System of Diameters of Ultrafine Particles Based on Virtual Instrument","authors":"Zhenmei Li, Wenge Li, Boxue Tan, Jin Shen","doi":"10.1109/JCAI.2009.51","DOIUrl":"https://doi.org/10.1109/JCAI.2009.51","url":null,"abstract":"The measurement system of diameters of ultra fine particles was developed with virtual instrument. Instead of the much expensive correlator, the photon counting technology was applied: H6240-01, the photon multiplier tube (PMT), was used as a detector; and M8784, the high speed photon counter, was used to count the pulses signals of PMT output, the real-time data of dynamic light scattering were analyzed in the mixed program of MATLAB and LabVIEW. We experimented respectively with the standard polystyrene latex particles: mean diameters of 100 and 600nm monodisperse and mean diameters of 90 and 450nm polydisperse, got the autocorrelation function curves of light scattering signals, and the exact information of particle size distributions could be deduced from the inversion results of the autocorrelation function of monodisperse and polydisperse with CONTIN arithmetic.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126941782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Aiming at the shortcomings of the BP neural network, this paper presents a method for grain condition information fusion based on BP neural networks and D-S evidential theory. This method firstly employs many BP neural network outputs as the inputs of D-S evidence theory. After that, D-S evidence theory is used to fuse with results from all the neural networks, resulting in the grain quality evaluation. Numerical example shows that proposed method improves the various mathematical and computational techniques have been developed and adapted to manipulate and interpret motion data, exactitude and decreases the recognition uncertainty.
{"title":"Grain Quality Evaluation Method Based on Combination of BP Neural Networks with D-S Evidence Theory","authors":"Tong Zhen, Zhi Ma, Yuhua Zhu, Qiuwen Zhang","doi":"10.1109/JCAI.2009.164","DOIUrl":"https://doi.org/10.1109/JCAI.2009.164","url":null,"abstract":"Aiming at the shortcomings of the BP neural network, this paper presents a method for grain condition information fusion based on BP neural networks and D-S evidential theory. This method firstly employs many BP neural network outputs as the inputs of D-S evidence theory. After that, D-S evidence theory is used to fuse with results from all the neural networks, resulting in the grain quality evaluation. Numerical example shows that proposed method improves the various mathematical and computational techniques have been developed and adapted to manipulate and interpret motion data, exactitude and decreases the recognition uncertainty.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131648288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The implications of semantic configurations have been far-reaching and pervasive. On the basis of analyzing related works, the current status of symmetries, researchers dubiously desire the visualization of consistent hashing are given. Using constant time technology (CTT), the existing encryption and scalable algorithms (EESA) is described and motivated for pervasive information. From designed experiments, the lossless hash tables is made and argued. Furthermore, one potentially tremendous drawback of EESA is managed virtual archetypes. It is concluded that EESA can be made pervasive, peer-to-peer and interactive during treating construction and congestion control.
{"title":"Construction and Congestion Control in Computer Components Based on CTT and EESA","authors":"Zhiming Qu","doi":"10.1109/JCAI.2009.8","DOIUrl":"https://doi.org/10.1109/JCAI.2009.8","url":null,"abstract":"The implications of semantic configurations have been far-reaching and pervasive. On the basis of analyzing related works, the current status of symmetries, researchers dubiously desire the visualization of consistent hashing are given. Using constant time technology (CTT), the existing encryption and scalable algorithms (EESA) is described and motivated for pervasive information. From designed experiments, the lossless hash tables is made and argued. Furthermore, one potentially tremendous drawback of EESA is managed virtual archetypes. It is concluded that EESA can be made pervasive, peer-to-peer and interactive during treating construction and congestion control.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129018296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A novel framework referred to as visual vocabulary labeling is proposed for 3d object retrieval. It aims at localizing the visual semantics to 3d object with textual modalities. Two main processes are included in the presented framework. One is automatic labeling from 3dobject to visual vocabulary. The other is visual vocabulary based retrieval with relevance feedback. The probabilistic model and similarity measurement is proposed to bias the mapping from the low-level 3dobject shape descriptor to the high-level visual vocabularies defined in the visual vocabulary database.The probabilistic model is represented as a cooccurrence matrix of the visual vocabularies. A similarity mapping scheme is devised using statistical methods as Gaussian distribution and Euclidean distance together with probability conditions of visual vocabularies. The proposed 3d object shape descriptor is a 64-dimension vector composed of two kinds of 3dobject features. They are the 19-dimension feature vector from 20 geometry projection images and 45-dimension feature vector from 45 grid region of 3dobject. The technique of relevance feedback has been introduced to the framework both of the labeling process and retrieval process. During the two processes, the proposed method takes the user’s feedback details as the relevant information, and then dynamically updates visual vocabulary database. The experimental results indicate that the proposed semantic-based visual vocabulary descriptors outperform the traditional content-based 3d object retrieval model.
{"title":"Semantic-oriented 3D Model Retrieval Using Visual Vocabulary Labelling","authors":"Yachun Fan, Mingquan Zhou, Guohua Geng","doi":"10.1109/JCAI.2009.221","DOIUrl":"https://doi.org/10.1109/JCAI.2009.221","url":null,"abstract":"A novel framework referred to as visual vocabulary labeling is proposed for 3d object retrieval. It aims at localizing the visual semantics to 3d object with textual modalities. Two main processes are included in the presented framework. One is automatic labeling from 3dobject to visual vocabulary. The other is visual vocabulary based retrieval with relevance feedback. The probabilistic model and similarity measurement is proposed to bias the mapping from the low-level 3dobject shape descriptor to the high-level visual vocabularies defined in the visual vocabulary database.The probabilistic model is represented as a cooccurrence matrix of the visual vocabularies. A similarity mapping scheme is devised using statistical methods as Gaussian distribution and Euclidean distance together with probability conditions of visual vocabularies. The proposed 3d object shape descriptor is a 64-dimension vector composed of two kinds of 3dobject features. They are the 19-dimension feature vector from 20 geometry projection images and 45-dimension feature vector from 45 grid region of 3dobject. The technique of relevance feedback has been introduced to the framework both of the labeling process and retrieval process. During the two processes, the proposed method takes the user’s feedback details as the relevant information, and then dynamically updates visual vocabulary database. The experimental results indicate that the proposed semantic-based visual vocabulary descriptors outperform the traditional content-based 3d object retrieval model.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125472417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Considering servers being the core position in network, this paper introduces how to monitor servers through simple network management protocol (SNMP). We expand MIB resources by defining MIB objects to monitor the resources of sever, and use multi-threading technology to collect data and process them, which can improve the collection efficiency. The experimental results prove that it is a successful way of integrated monitor and control for servers based on SNMP.
{"title":"Design and Implementation of Server Monitoring System Based on SNMP","authors":"W. Zeng, Yue Wang","doi":"10.1109/JCAI.2009.34","DOIUrl":"https://doi.org/10.1109/JCAI.2009.34","url":null,"abstract":"Considering servers being the core position in network, this paper introduces how to monitor servers through simple network management protocol (SNMP). We expand MIB resources by defining MIB objects to monitor the resources of sever, and use multi-threading technology to collect data and process them, which can improve the collection efficiency. The experimental results prove that it is a successful way of integrated monitor and control for servers based on SNMP.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The aim of this paper is to solve the portfolio problem when security returns are bifuzzy variables. Two types of portfolio selections based on chance measure are provided according to bifuzzy theory. Since the proposed optimization problems are difficult to solve by traditional methods, A hybrid intelligent algorithm by integrating bifuzzy simulation and genetic algorithm is designed. Finally, one numerical experiment is provided to illustrate the effectiveness of the algorithm.
{"title":"Bifuzzy Chance-constrained Portfolio Selection","authors":"Li-mei Yan","doi":"10.1109/JCAI.2009.133","DOIUrl":"https://doi.org/10.1109/JCAI.2009.133","url":null,"abstract":"The aim of this paper is to solve the portfolio problem when security returns are bifuzzy variables. Two types of portfolio selections based on chance measure are provided according to bifuzzy theory. Since the proposed optimization problems are difficult to solve by traditional methods, A hybrid intelligent algorithm by integrating bifuzzy simulation and genetic algorithm is designed. Finally, one numerical experiment is provided to illustrate the effectiveness of the algorithm.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126334535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the severer and severer market competition, more and more enterprises pay attention to informationization construction, and even some domestic small and middle enterprises (SME) also take the management of suppliers and customers into their informationization construction system. However, when enhancing exterior informationization construction, enterprises always ignore their inventory management and optimization measure. Therefore, the paper analyzed in detail inventory management of SME, and put forward five kinds of optimization schemes of value-added network based on internet, which will be helpful for enterprises to participate in international competition.
{"title":"Study on the System Optimization of Inventory Management of SME","authors":"Liping Wang","doi":"10.1109/JCAI.2009.49","DOIUrl":"https://doi.org/10.1109/JCAI.2009.49","url":null,"abstract":"With the severer and severer market competition, more and more enterprises pay attention to informationization construction, and even some domestic small and middle enterprises (SME) also take the management of suppliers and customers into their informationization construction system. However, when enhancing exterior informationization construction, enterprises always ignore their inventory management and optimization measure. Therefore, the paper analyzed in detail inventory management of SME, and put forward five kinds of optimization schemes of value-added network based on internet, which will be helpful for enterprises to participate in international competition.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126475512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new design method of the repetitive control system for linear systems with time-varying norm-bounded uncertainties is presented, which can design a low-pass filter of the repetitive controller and a stabilizing controller simultaneously in the repetitive control system. Using a Lyapunov functional for the repetitive control system, sufficient conditions are derived in terms of a linear matrix inequality (LMI), which ensure robust stability of the repetitive control system and achieve the prescribed H∞ performance. Based on derived conditions, the problem of designing a stabilizing controller and finding the cut-off frequency of a low-pass filter is reformulated as an optimization problem with an LMI constraint of the free parameter. Then, an iterative algorithm is presented to calculate the largest cut-off frequency of a low-pass filter and design the corresponding state-feedback controller simultaneously. A numerical example is presented to illustrate the validity of the proposed method.
{"title":"Robust Repetitive Control Design for a Class of Linear Systems with Time-varying Uncertainties","authors":"Fu Zhao, Xiu-ming Yao, Yu Liu, Bao-ku Su","doi":"10.1109/JCAI.2009.213","DOIUrl":"https://doi.org/10.1109/JCAI.2009.213","url":null,"abstract":"A new design method of the repetitive control system for linear systems with time-varying norm-bounded uncertainties is presented, which can design a low-pass filter of the repetitive controller and a stabilizing controller simultaneously in the repetitive control system. Using a Lyapunov functional for the repetitive control system, sufficient conditions are derived in terms of a linear matrix inequality (LMI), which ensure robust stability of the repetitive control system and achieve the prescribed H∞ performance. Based on derived conditions, the problem of designing a stabilizing controller and finding the cut-off frequency of a low-pass filter is reformulated as an optimization problem with an LMI constraint of the free parameter. Then, an iterative algorithm is presented to calculate the largest cut-off frequency of a low-pass filter and design the corresponding state-feedback controller simultaneously. A numerical example is presented to illustrate the validity of the proposed method.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121726692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a set of semantic cohesion metrics for ontology measurement, which can be used to assess the quality of evolving ontologies in the context of dynamic and changing Web. We argue that these metrics are stable and can be used to measure ontology semantics rather than ontology structures. Measuring ontology quality with semantic inconsistencies caused by ontology evolutions, is mainly considered in this paper. The proposed semantic cohesion metrics are theoretically and empirically validated.
{"title":"A Proposal for Stable Semantic Metrics Based on Evolving Ontologies","authors":"Yinglong Ma, X. Ma, Shaohua Liu, Beihong Jin","doi":"10.1109/JCAI.2009.42","DOIUrl":"https://doi.org/10.1109/JCAI.2009.42","url":null,"abstract":"In this paper, we propose a set of semantic cohesion metrics for ontology measurement, which can be used to assess the quality of evolving ontologies in the context of dynamic and changing Web. We argue that these metrics are stable and can be used to measure ontology semantics rather than ontology structures. Measuring ontology quality with semantic inconsistencies caused by ontology evolutions, is mainly considered in this paper. The proposed semantic cohesion metrics are theoretically and empirically validated.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123026046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：