共查询到20条相似文献,搜索用时 31 毫秒
1.
1IntroductionMulticastcommunication,whichreferstothedeliveryofamessagefromasinglesourcenodetoanumberofdestinationnodes,isfrequentlyusedindistributed-memoryparallelcomputersystemsandnetworks[1].Efficientimplementationofmulticastcommunicationiscriticaltotheperformanceofmessage-basedscalableparallelcomputersandswitch-basedhighspeednetworks.Switch-basednetworksorindirectnetworks,basedonsomevariationsofmultistageiDterconnectionnetworks(MINs),haveemergedasapromisingnetworkajrchitectureforconstruct… 相似文献
2.
In today‘s Internet computing world,illegal activities by crackers pose a serious threat to computer security.It is well known that computer viruses,Trojan horses and other intrusive programs may cause sever and often catastrophic consequences. This paper proposes a novel secure computer architecture based on security-code.Every instruction/data word is added with a security-code denoting its security level.External programs and data are automatically addoed with security-code by hadware when entering a computer system.Instruction with lower security-code cannot run or process instruction/data with higher security level.Security-code cannot be modified by normal instruction.With minor hardware overhead,then new architecture can effectively protect the main computer system from destruction or theft by intrusive programs such as computer viruses.For most PC systems it includes an increase of word-length by 1 bit on register,the memory and the hard disk. 相似文献
3.
This paper presents a new method that eliminates noise in Web page classification.It first describes the presentation of a Web page based on HTML tags.Then through a novel distance formula,it eliminates the noise in similarity measure.After carefully analyzing Web pages,we design an algorithm that can distinguish related hyperlinks from noisy ones,Web can utilize non-noisy hyperlinks to improve th performance of Web page classification (The AWN algorithm).For any page.we can classify it through the text and category of neighbor pages relted to the page.The experimental results show that our approach improved classification accuracy. 相似文献
4.
Eliciting requirements for a proposed system inevitably involves the problem of handling undesirable information about customer's needs, including inconsistency, vagueness, redundancy, or incompleteness. We term the requirements statements involved in the undesirable information non-canonical software requirements. In this paper, we propose an approach to handling non-canonical software requirements based on Annotated Predicate Calculus (APC). Informally, by defining a special belief lattice appropriate for representing the stakeholder's belief in requirements statements, we construct a new form of APC to formalize requirements specifications. We then show how the APC can be employed to characterize non-canonical requirements. Finally, we show how the approach can be used to handle non-canonical requirements through a case study.
Kedian Mu received B.Sc. degree in applied mathematics from Beijing Institute of Technology, Beijing, China, in 1997, M.Sc. degree in probability and mathematical statistics from Beijing Institute of Technology, Beijing, China, in 2000, and Ph.D. in applied mathematics from Peking University, Beijing, China, in 2003. From 2003 to 2005, he was a postdoctoral researcher at Institute of Computing Technology, Chinese Academy of Sciences, China. He is currently an assistant professor at School of Mathematical Sciences, Peking University, Beijing, China. His research interests include uncertain reasoning in artificial intelligence, knowledge engineering and science, and requirements engineering.
Zhi Jin was awarded B.Sc. in computer science from Zhejiang University, Hangzhou, China, in 1984, and studied for her M.Sc. in computer science (expert system) and her Ph.D. in computer science (artificial intelligence) at National Defence University of Technology, Changsha, China. She was awarded Ph.D. in 1992. She is a senior member of China Computer Federation. She is currently a professor at Academy of Mathematics and System Sciences, Chinese Academy of Science. Her research interests include knowledge-based systems, artificial intelligence, requirements engineering, ontology engineering, etc. Her current research focuses on ontology-based requirements elicitation and analysis. She has got about 60 papers published, including co-authoring one book.
Ruqian Lu is a professor of computer science of the Institute of Mathematics, Chinese Academy of Sciences. His research interests include artificial intelligence, knowledge engineering and knowledge based software engineering. He designed the “Tian Ma” software systems that have been widely applied in more than 20 fields, including the national defense and the economy. He has won two first class awards from Chinese Academy of Sciences and a National second class prize from the Ministry of Science and Technology. He has also won the sixth Hua Lookeng Prize for Mathematics.
Yan Peng received B.Sc. degree in software from Jilin University, Changchun, China, in 1992. From June 2002 to December 2005, he studied for his M.E. in software engineering at College of Software Engineering, Graduate School of Chinese Academy of Sciences, Beijing, China. He was awarded M.E degree in 2006. He is currently responsible for CRM (customer relationship management) and BI (business intelligence) project in the BONG. His research interests include customer relationship management, business intelligence, data ming, software engineering and requirements engineering. 相似文献
5.
AbbasH.Hassin Xiang-LongTang Jia-FengLiu WeiZhao 《计算机科学技术学报》2004,19(4):0-0
The Arabic Language has a very rich vocabulary. More than 200 million people speak this language as their native speaking, and over 1 billion people use it in several religion-related activities. In this paper a new technique is presented for recognizing printed Arabic characters. After a word is segmented, each character/word is entirely transformed into a feature vector. The features of printed Arabic characters include strokes and bays in various directions, endpoints, intersection points, loops, dots and zigzags. The word skeleton is decomposed into a number of links in orthographic order, and then it is transferred into a sequence of symbols using vector quantization. Single hidden Markov model has been used for recognizing the printed Arabic characters. Experimental results show that the high recognition rate depends on the number of states in each sample. 相似文献
6.
In this paper,a computationally effective algorithm based on tabu search for solving the satisfiability problem(TSSAT)is proposed.Some novel and efficient heuristic strategies for generating candidate neighborhood of the curred assignment and selecting varibables to be flipped are presented. Especially,the aspiration criterion and tabu list tructure of TSSAT are different from those of traditional tabu search.Computational experiments on a class of problem insteances show that,TSSAT,in a reasonable amount of computer time ,yields better results than Novelty which is currently among the fastest known.Therefore TSSAT is feasible and effective. 相似文献
7.
With the growing popularity of the World Wide Web, large volume of user access data has been gathered automatically by Web servers and stored in Web logs. Discovering and understanding user behavior patterns from log files can provide Web personalized recommendation services. In this paper, a novel clustering method is presented for log files called Clustering large Weblog based on Key Path Model (CWKPM), which is based on user browsing key path model, to get user behavior profiles. Compared with the previous Boolean model, key path model considers the major features of users‘ accessing to the Web: ordinal, contiguous and duplicate. Moreover, for clustering, it has fewer dimensions. The analysis and experiments show that CWKPM is an efficient and effective approach for clustering large and high-dimension Web logs. 相似文献
8.
This paper deals with deductive databases in linear logic. The semantics of queries, views, constraints, and (view) updates
are defineddeclaratively in linear logic. In constrast to classical logic, we can formalise non-shared view, transition constraints, and (view) updates
easily. Various proof search strategies are presented along with an algorithm for query evaluation from a bottom-up direction.
An additional advantage is that the associated meaning of a given relation can be defined in terms of the validity of a legal
update in a given relation. We also defined formally the update principles and showed the correctness of the update translation
algorithms. In this approach, we provide virtual view updates along with real view updates, and view DELETIONs are special
cases of view REPLACEMENTs. This permits three transactional view update operations (INSERTION, DELETION, REPLACEMENT) in
comparison to only (INSERTION, DELETION) in most existing systems.
Dong-Tsan Lee, Ph.D.: He is a computer scientist in the Department of Computer Science at University of Western Australia, Perth, Western Australia,
Australia. He received the B.S. and M.S. degrees from the Department of Computer Science at National Chiao-Tung University,
Taiwan, in 1983 and 1985, respectively, and earned the Ph.D. degree from the Department of Computer Science at University
of Western Australia. His research interests include database and artificial intelligence, linear logic, and real-time software
engineering.
Chin-Ping Tsang, Ph.D.: He is currently an associate professor in the Department of Computer Science at University of Western Australia, Perth,
Western Australia, Australia. He received the Ph.D. degree from the University of Western Australia. He was the head of the
Department of Computer Science at the University of Western Australia from 1994 to 1997. His research interests include artificial
intelligence, non-classicial logic and neural nets. 相似文献
9.
The Application of the Commparable Corpora in Chinese—English Cross—lingual Information Retrieval
下载免费PDF全文
![点击此处可从《计算机科学技术学报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This paper proposes a novel Chinese-English Cross-Lingual Information Retrieval(CECLIR)model PME,in which bilingual dictionary and comparable corpora are used to translate the query terms.The proximity and mutual information of the term-paris in the CHinese and English comparable corpora are employed not only to resolve the translation ambiguities but also to perform the query expansion so as to deal with the out-of -vocabulary issues in the CECLIR.The evaluation results show that the query precision of PME algorithm is about 84.4% of the monolingual information retrieval. 相似文献
10.
Hidenori Kawamura Yasushi Okada Azuma Ohuchi Koichi Kurumatani 《New Generation Computing》2005,23(1):23-32
In an artificial market approach with multi-agent systems, the static equilibrium concept is often used in market systems
to approximate continuous market auctions. However, differences between the static equilibrium concept and continuous auctions
have not been discussed in the context of an artificial market study. In this paper, we construct an artificial market model
with both of them, namely, the Itayose and Zaraba method, and show simple characteristic differences between these methods
based on computer simulations. The result indicates the further need to model the market system by studying artificial markets.
Hidenori Kawamura, Ph.D.: He received Ph.D. degree from Division of Systems and Information Engineering, Graduate School of Engineering, Hokkaido
University, Japan in 2000. He is currently an instructor in Graduate School of Information Science and Technology, Hokkaido
University, Japan. His research interests include multiagent systems, mass user support, artificial intelligence, complex
systems, and tourism informatics. He is a member of IPSJ, JSAI, IEICE, ORSJ, JSTI and AAAI.
Yasushi Okada, Ph.D.: He is a master course student in Graduate School of Engineering, Hokkaido University, Japan. He studies multiagent systems.
Azuma Ohuchi, Ph.D.: He received his Ph.D. degree in 1974 from Hokkaido University. He is currently the professor in Graduate School of Information
Science and Technology, Hokkaido University Japan. His research interstes include systems information engineering, artificial
intelligence, complex systems, tourism informatics and medical systems. He is a member of the IPSJ, JSAI, IEEJ, ORSJ, Soc.
Contr. Eng., Jap. OR Soc., Soc. Med. Informatics, Hosp. Manag., JSTI and IEEE-SMC.
Koichi Kurumatani, Ph.D.: He received his Ph.D. Degree in 1989 from The University of Tokyo. He is currently a leader of Multiagent Research Team
in Cyber Assist Research Center (CARC), National Institute of Advanced Industrial Science and Technology (AIST), Japan. His
research interests include multiagent systems and mass user support. He is a member of JSAI, IPSJ, JSTI and AAAI. 相似文献
11.
12.
A humanoid robot is always flooded by sensed information when sensing the environment, and it usually needs significant time to compute and process the sensed information. In this paper, a selective attention-based contextual perception approach was proposed for humanoid robots to sense the environment with high efficiency. First, the connotation of attention window (AW) is extended to make a more general and abstract definition of AW, and its four kinds of operations and state transformations are also discussed. Second, the attention control policies are described, which integrate intensionguided perceptual objects selection and distractor inhibition, and can deal with emergent issues. Distractor inhibition is
used to filter unrelated information. Last, attention policies are viewed as the robot’s perceptual modes, which can control and adjust the perception efficiency. The experimental results show that the presented approach can promote the perceptual efficiency significantly, and the perceptual cost can be effectively controlled through adopting different attention policies. 相似文献
13.
Chunming Hu Yanmin Zhu Jinpeng Huai Yunhao Liu Lionel M. Ni 《Knowledge and Information Systems》2007,12(1):55-75
Information service plays a key role in grid system, handles resource discovery and management process. Employing existing
information service architectures suffers from poor scalability, long search response time, and large traffic overhead. In
this paper, we propose a service club mechanism, called S-Club, for efficient service discovery. In S-Club, an overlay based
on existing Grid Information Service (GIS) mesh network of CROWN is built, so that GISs are organized as service clubs. Each
club serves for a certain type of service while each GIS may join one or more clubs. S-Club is adopted in our CROWN Grid and
the performance of S-Club is evaluated by comprehensive simulations. The results show that S-Club scheme significantly improves
search performance and outperforms existing approaches.
Chunming Hu is a research staff in the Institute of Advanced Computing Technology at the School of Computer Science and Engineering,
Beihang University, Beijing, China. He received his B.E. and M.E. in Department of Computer Science and Engineering in Beihang
University. He received the Ph.D. degree in School of Computer Science and Engineering of Beihang University, Beijing, China,
2005. His research interests include peer-to-peer and grid computing; distributed systems and software architectures.
Yanmin Zhu is a Ph.D. candidate in the Department of Computer Science, Hong Kong University of Science and Technology. He received his
B.S. degree in computer science from Xi’an Jiaotong University, Xi’an, China, in 2002. His research interests include grid
computing, peer-to-peer networking, pervasive computing and sensor networks. He is a member of the IEEE and the IEEE Computer
Society.
Jinpeng Huai is a Professor and Vice President of Beihang University. He serves on the Steering Committee for Advanced Computing Technology
Subject, the National High-Tech Program (863) as Chief Scientist. He is a member of the Consulting Committee of the Central Government’s Information Office, and Chairman of the Expert Committee in both the National e-Government Engineering Taskforce and the National e-Government Standard office. Dr. Huai and his colleagues are leading the key projects in e-Science of the National Science Foundation of China (NSFC)
and Sino-UK. He has authored over 100 papers. His research interests include middleware, peer-to-peer (P2P), grid computing,
trustworthiness and security.
Yunhao Liu received his B.S. degree in Automation Department from Tsinghua University, China, in 1995, and an M.A. degree in Beijing
Foreign Studies University, China, in 1997, and an M.S. and a Ph.D. degree in computer science and engineering at Michigan
State University in 2003 and 2004, respectively. He is now an assistant professor in the Department of Computer Science and
Engineering at Hong Kong University of Science and Technology. His research interests include peer-to-peer computing, pervasive
computing, distributed systems, network security, grid computing, and high-speed networking. He is a senior member of the
IEEE Computer Society.
Lionel M. Ni is chair professor and head of the Computer Science and Engineering Department at Hong Kong University of Science and Technology.
Lionel M. Ni received the Ph.D. degree in electrical and computer engineering from Purdue University, West Lafayette, Indiana,
in 1980. He was a professor of computer science and engineering at Michigan State University from 1981 to 2003, where he received
the Distinguished Faculty Award in 1994. His research interests include parallel architectures, distributed systems, high-speed
networks, and pervasive computing. A fellow of the IEEE and the IEEE Computer Society, he has chaired many professional conferences
and has received a number of awards for authoring outstanding papers. 相似文献
14.
Reduction Algorithms Based on Discernibility Matrix:The Ordered Atributes Method 总被引:8,自引:0,他引:8
下载免费PDF全文
![点击此处可从《计算机科学技术学报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this Paper,we present reduction algorithms based on the principle of Skowron‘s discernibility matrix-the ordered attributes method.The completeness of the algorithms for Pawlak reduct and the uniqueness for a given order of the attributes are proved.Since a discernibility matrix requires the size of the memory of |U|^2,U is a universe of bojects,it would be impossible to apply these algorithms directly to a massive object set.In order to solve the problem,a so=called quasi-discernibility matrix and two reduction algorithms are prpopsed.Although the proposed algorithms are incomplete for Pawlak reduct,their optimal paradigms ensure the completeness as long as they satisfy some conditions.Finally,we consider the problem on the reduction of distributive object sets. 相似文献
15.
Privacy-preserving SVM classification 总被引:2,自引:2,他引:0
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or
in federated form. Increasingly, privacy and security concerns restrict this access, thus derailing data mining projects.
What is required is distributed knowledge discovery that is sensitive to this problem. The key is to obtain valid results,
while providing guarantees on the nondisclosure of data. Support vector machine classification is one of the most widely used
classification methodologies in data mining and machine learning. It is based on solid theoretical foundations and has wide
practical application. This paper proposes a privacy-preserving solution for support vector machine (SVM) classification,
PP-SVM for short. Our solution constructs the global SVM classification model from data distributed at multiple parties, without
disclosing the data of each party to others. Solutions are sketched out for data that is vertically, horizontally, or even
arbitrarily partitioned. We quantify the security and efficiency of the proposed method, and highlight future challenges.
Jaideep Vaidya received the Bachelor’s degree in Computer Engineering from the University of Mumbai. He received the Master’s and the Ph.D.
degrees in Computer Science from Purdue University. He is an Assistant Professor in the Management Science and Information
Systems Department at Rutgers University. His research interests include data mining and analysis, information security, and
privacy. He has received best paper awards for papers in ICDE and SIDKDD. He is a Member of the IEEE Computer Society and
the ACM.
Hwanjo Yu received the Ph.D. degree in Computer Science in 2004 from the University of Illinois at Urbana-Champaign. He is an Assistant
Professor in the Department of Computer Science at the University of Iowa. His research interests include data mining, machine
learning, database, and information systems. He is an Associate Editor of Neurocomputing and served on the NSF Panel in 2006.
He has served on the program committees of 2005 ACM SAC on Data Mining track, 2005 and 2006 IEEE ICDM, 2006 ACM CIKM, and
2006 SIAM Data Mining.
Xiaoqian Jiang received the B.S. degree in Computer Science from Shanghai Maritime University, Shanghai, 2003. He received the M.C.S. degree
in Computer Science from the University of Iowa, Iowa City, 2005. Currently, he is pursuing a Ph.D. degree from the School
of Computer Science, Carnegie Mellon University. His research interests are computer vision, machine learning, data mining,
and privacy protection technologies. 相似文献
16.
It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matching schemes (e.g., the popular voting scheme for selecting a governor in California), and that the theory can be used in pattern classification applications, such as image classification, where by its nature an object to be classified consists of elements distributed in a bounded 2D space. However, the objects of some pattern classification applications consist of features/values of elements lying on a limited 1D line segment. This paper will prove that districted matching scheme can still outperform undistricted matching scheme in these applications, and the improved performance of districted vote scheme is even more substantial for these 1D objects than for 2D objects. The theoretical result suggests the use of districted matching schemes for pattern recognition of 1D objects. We verified the theoretical analysis through artificial neural network-based approaches for the prediction of start codons of nucleotide sequences.
Liang Chen received his Doctor' degree in Computer Science from the Institute of Software, Chinese Academy of Sciences, Beijing, China, in 1994. He is currently Associate Professor and Chair of Computer Science Department, University of Northern British Columbia, Prince George, BC, Canada. His research interests include general artificial intelligence, image processing, bioinformatics, intelligent language tutoring system, computational intelligence, and fast approximate practical algorithms for solving some NP hard problems.
Ruoyu Chen is now an undergraduate student (Class 2, Grade 2002) in Computer Science and Technology College at Jilin University, China, majoring Computer Science and Technology. He started to work with Dr. L. Chen in voting theory from 2003. He holds one Chinese Patent. His main research interests include artificial intelligence, natural language tutoring systems, data mining, and networks.
Sharmin Nilufar received an MSc degree in Computer Science from Rajshahi University, Bangladesh. She is now a graduate student at University of Northern British Columbia, Prince George, BC, Canada. Her research interests include information retrieval, image retrieval, and bioinformatics. 相似文献
17.
18.
Manolis Gergatsoulis Panos Rondogiannis Themis Panayiotopoulos 《New Generation Computing》2001,19(1):87-100
In this paper we introduce the logic programming languageDisjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable
of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We
present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their
equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to
Disjunctive Chronolog programs.
Manolis Gergatsoulis, Ph.D.: He received his B.Sc. in Physics in 1983, the M.Sc. and the Ph.D. degrees in Computer Science in 1986 and 1995 respectively
all from the University of Athens, Greece. Since 1996 he is a Research Associate in the Institute of Informatics and Telecommunications,
NCSR ‘Demokritos’, Athens. His research interests include logic and temporal programming, program transformations and synthesis,
as well as theory of programming languages.
Panagiotis Rondogiannis, Ph.D.: He received his B.Sc. from the Department of Computer Engineering and Informatics, University of Patras, Greece, in 1989,
and his M.Sc. and Ph.D. from the Department of Computer Science, University of Victoria, Canada, in 1991 and 1994 respectively.
From 1995 to 1996 he served in the Greek army. From 1996 to 1997 he was a visiting professor in the Department of Computer
Science, University of Ioannina, Greece, and since 1997 he is a Lecturer in the same Department. In January 2000 he was elected
Assistant Professor in the Department of Informatics at the University of Athens. His research interests include functional,
logic and temporal programming, as well as theory of programming languages.
Themis Panayiotopoulos, Ph.D.: He received his Diploma on Electrical Engineering from the Department of Electrical Engineering, National Technical Univesity
of Athens, in 1984, and his Ph.D. on Artificial Intelligence from the above mentioned department in 1989. From 1991 to 1994
he was a visiting professor at the Department of Mathematics, University of the Aegean, Samos, Greece and a Research Associate
at the Institute of Informatics and Telecommunications of “Democritos” National Research Center. Since 1995 he is an Assistant
Prof. at the Department of Computer Science, University of Piraeus. His research interests include temporal programming, logic
programming, expert systems and intelligent agent architectures. 相似文献
19.
The simple least-significant-bit (LSB) substitution technique is the easiest way to embed secret data in the host image. To
avoid image degradation of the simple LSB substitution technique, Wang et al. proposed a method using the substitution table
to process image hiding. Later, Thien and Lin employed the modulus function to solve the same problem. In this paper, the
proposed scheme combines the modulus function and the optimal substitution table to improve the quality of the stego-image.
Experimental results show that our method can achieve better quality of the stego-image than Thien and Lin’s method does.
The text was submitted by the authors in English.
Chin-Shiang Chan received his BS degree in Computer Science in 1999 from the National Cheng Chi University, Taipei, Taiwan and the MS degree
in Computer Science and Information Engineering in 2001 from the National Chung Cheng University, ChiaYi, Taiwan. He is currently
a Ph.D. student in Computer Science and Information Engineering at the National Chung Cheng University, Chiayi, Taiwan. His
research fields are image hiding and image compression.
Chin-Chen Chang received his BS degree in applied mathematics in 1977 and his MS degree in computer and decision sciences in 1979, both from
the National Tsing Hua University, Hsinchu, Taiwan. He received his Ph.D. in computer engineering in 1982 from the National
Chiao Tung University, Hsinchu, Taiwan. During the academic years of 1980–1983, he was on the faculty of the Department of
Computer Engineering at the National Chiao Tung University. From 1983–1989, he was on the faculty of the Institute of Applied
Mathematics, National Chung Hsing University, Taichung, Taiwan. From 1989 to 2004, he has worked as a professor in the Institute
of Computer Science and Information Engineering at National Chung Cheng University, Chiayi, Taiwan. Since 2005, he has worked
as a professor in the Department of Information Engineering and Computer Science at Feng Chia University, Taichung, Taiwan.
Dr. Chang is a Fellow of IEEE, a Fellow of IEE and a member of the Chinese Language Computer Society, the Chinese Institute
of Engineers of the Republic of China, and the Phi Tau Phi Society of the Republic of China. His research interests include
computer cryptography, data engineering, and image compression.
Yu-Chen Hu received his Ph.D. degree in Computer Science and Information Engineering from the Department of Computer Science and Information
Engineering, National Chung Cheng University, Chiayi, Taiwan in 1999. Dr. Hu is currently an assistant professor in the Department
of Computer Science and Information Engineering, Providence University, Sha-Lu, Taiwan. He is a member of the SPIE society
and a member of the IEEE society. He is also a member of the Phi Tau Phi Society of the Republic of China. His research interests
include image and data compression, information hiding, and image processing. 相似文献
20.
Zuxin Li Wanliang Wang Yunliang Jiang 《International Journal of Control, Automation and Systems》2009,7(2):289-296
There is an unavoidable tradeoff between the control performance and the quality of service in networked control systems with
resource constraints. To address the impact of network resources availability on requirement of bandwidth (RoB) and quality
of control (QoC), an intelligent control approach to dynamic bandwidth management, namely fuzzy bandwidth management, is proposed
based on fuzzy logic control technique. In order to guarantee the system’s stability, the lower and upper bound of the assignable
bandwidth are evaluated in terms of linear matrix inequalities and the resource constraints, respectively. In addition, the
normalizable criterions of QoC and RoB are also defined, which can estimate the performance of the whole networked control
systems. Preliminary simulations are carried out to highlight the merits of the proposed approach. It is argued that the proposed
approach can save significant bandwidth and simultaneously improve overall control performance in comparison with the fixed
bandwidth allocation and optimal bandwidth allocation.
Recommended by Editorial Board member Young Il Lee under the direction of Editor Young-Hoon Joo. This work was supported by
the National Natural Science Foundation of China under Grants 60573123, 60872057, and by the Zhejiang Provincial Natural Science
Foundation of China under grant Y107293.
Zuxin Li received the B.Eng. degree from Zhejiang University of Technology, China, in 1995, the M.Sc. (Eng.) degree from Yunnan Univer-sity,
China, in 2002, and the Ph.D. degree from Zhejiang University of Technology, China, in 2008. He is currently an Associate
Professor in the School of Information Engineering, Huzhou Teachers College, China. His research interests include networked
control systems and intelligent control.
Wanliang Wang received the Ph.D. degree from Tongji University, China, in 2001. He is currently a Professor in Zhejiang University of Technology,
China. His research interests include computer control, computer net, CMIS, and production scheduling.
Yunliang Jiang received the B.S. degree in Mathematics from Zhejiang Normal University in 1989, and the M.E. and Ph.D. degrees in Computer
Science and Technology from Zhejiang University, Hangzhou, China. He is currently a Professor in the School of Information
Engineering, Huzhou Teachers College, China. His research interests include information fusion, artificial intelligence, and
geographic information system. 相似文献