共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper,an effective and robust active speech detection method is proposed based on the 1/f process technique for signals under non-stationary noisy environments.The Gaussian 1/f process ,a mathematical model for statistically self-similar radom processes based on fractals,is selected to model the speech and the background noise.An optimal Bayesian two-class classifier is developed to discriminate them by their 1/f wavelet coefficients with Karhunen-Loeve-type properties.Multiple templates are trained for the speech signal,and the parameters of the background noise can be dynamically adapted in runtime to model the variation of both the speech and the noise.In our experiments,a 10-minute long speech with different types of noises ranging from 20dB to 5dB is tested using this new detection method.A high performance with over 90% detection accuracy is achieved when average SNR is about 10dB. 相似文献
2.
3.
HarkMan—A Vocabulary-Independent Keyword Spotter for Spontaneons Chinese Speech 总被引:2,自引:0,他引:2
下载免费PDF全文
![点击此处可从《计算机科学技术学报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this paper,a noverl technique adopted in HarkMan is introduced.HarkMan is a keywore-spotter designed to automatically spot the given words of a vocabulary-independent task in unconstrained Chinese telephone speech.The speaking manner and the number of keywords are not limited.This paper focuses on the novel technique which addresses acoustic modeling,keyword spotting network,search strategies,robustness,and rejection.The underlying technologies used in HarkMan given in this paper are useful not only for keyword spotting but also for continuous speech recognition.The system has achieved a figure-of-merit value over 90%. 相似文献
4.
Bounded Slice-line Grid (BSG) is an elegant representation of block placement, because it is very intuitionistic and has the advantage of handling various placement constraints. However, BSG has attracted little attention because its evaluation is very time-consuming. This paper proposes a simple algorithm independent of the BSG size to evaluate the BSG representation in O(nloglogn) time, where n is the number of blocks. In the algorithm, the BSG-rooms are assigned with integral coordinates firstly, and then a linear sorting algorithm is applied on the BSG-rooms where blocks are assigned to compute two block sequences, from which the block placement can be obtained in O(n log logn) time. As a consequence, the evaluation of the BSG is completed in O(nloglogn) time, where n is the number of blocks. The proposed algorithm is much faster than the previous graph-based O(n^2) algorithm. The experimental results demonstrate the efficiency of the algorithm. 相似文献
5.
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. 相似文献
6.
A motion compensated lifting (MCLIFT) ramework for the 3D wavelet video coding is proposed in this paper,By using bi-directional motion compensation in each lifting step of the temporal direction,the video frames are effectively de-correlated,With the proper entropy coding and bit-stream packaging schemes,the MCLIFT wavelet video coder is scalable at frame rate and quality level .Experimental results show that the MCLIFT video coder outperforms the 3D wavelet video coder without motion by an average of 0.9-1.3dB,and outperforms MPEG-4 coder by an average of 0.2-0.6dB. 相似文献
7.
This paper proposes a new, efficient algorithm for extracting similar sections between two time sequence data sets. The algorithm,
called Relay Continuous Dynamic Programming (Relay CDP), realizes fast matching between arbitrary sections in the reference
pattern and the input pattern and enables the extraction of similar sections in a frame synchronous manner. In addition, Relay
CDP is extended to two types of applications that handle spoken documents. The first application is the extraction of repeated
utterances in a presentation or a news speech because repeated utterances are assumed to be important parts of the speech.
These repeated utterances can be regarded as labels for information retrieval. The second application is flexible spoken document
retrieval. A phonetic model is introduced to cope with the speech of different speakers. The new algorithm allows a user to
query by natural utterance and searches spoken documents for any partial matches to the query utterance. We present herein
a detailed explanation of Relay CDP and the experimental results for the extraction of similar sections and report results
for two applications using Relay CDP.
Yoshiaki Itoh has been an associate professor in the Faculty of Software and Information Science at Iwate Prefectural University, Iwate,
Japan, since 2001. He received the B.E. degree, M.E. degree, and Dr. Eng. from Tokyo University, Tokyo, in 1987, 1989, and
1999, respectively. From 1989 to 2001 he was a researcher and a staff member of Kawasaki Steel Corporation, Tokyo and Okayama.
From 1992 to 1994 he transferred as a researcher to Real World Computing Partnership, Tsukuba, Japan. Dr. Itoh's research
interests include spoken document processing without recognition, audio and video retrieval, and real-time human communication
systems. He is a member of ISCA, Acoustical Society of Japan, Institute of Electronics, Information and Communication Engineers,
Information Processing Society of Japan, and Japan Society of Artificial Intelligence.
Kazuyo Tanaka has been a professor at the University of Tsukuba, Tsukuba, Japan, since 2002. He received the B.E. degree from Yokohama
National University, Yokohama, Japan, in 1970, and the Dr. Eng. degree from Tohoku University, Sendai, Japan, in 1984. From
1971 to 2002 he was research officer of Electrotechnical Laboratory (ETL), Tsukuba, Japan, and the National Institute of Advanced
Science and Technology (AIST), Tsukuba, Japan, where he was working on speech analysis, synthesis, recognition, and understanding,
and also served as chief of the speech processing section. His current interests include digital signal processing, spoken
document processing, and human information processing. He is a member of IEEE, ISCA, Acoustical Society of Japan, Institute
of Electronics, Information and Communication Engineers, and Japan Society of Artificial Intelligence.
Shi-Wook Lee received the B.E. degree and M.E. degree from Yeungnam University, Korea and Ph.D. degree from the University of Tokyo in
1995, 1997, and 2001, respectively. Since 2001 he has been working in the Research Group of Speech and Auditory Signal Processing,
the National Institute of Advanced Science and Technology (AIST), Tsukuba, Japan, as a postdoctoral fellow. His research interests
include spoken document processing, speech recognition, and understanding. 相似文献
8.
Badong Chen Yu Zhu Jinchun Hu Zengqi Sun 《International Journal of Control, Automation and Systems》2009,7(2):157-164
Traditional filtering theory is always based on optimization of the expected value of a suitably chosen function of error,
such as the minimum mean-square error (MMSE) criterion, the minimum error entropy (MEE) criterion, and so on. None of those
criteria could capture all the probabilistic information about the error distribution. In this work, we propose a novel approach
to shape the probability density function (PDF) of the errors in adaptive filtering. As the PDF contains all the probabilistic
information, the proposed approach can be used to obtain the desired variance or entropy, and is expected to be useful in
the complex signal processing and learning systems. In our method, the information divergence between the actual errors and
the desired errors is chosen as the cost function, which is estimated by kernel approach. Some important properties of the
estimated divergence are presented. Also, for the finite impulse response (FIR) filter, a stochastic gradient algorithm is
derived. Finally, simulation examples illustrate the effectiveness of this algorithm in adaptive system training.
Recommended by Editorial Board member Naira Hovakimyan under the direction of Editor Jae Weon Choi. This work was supported
in part by the National Natural Science Foundation of China under grants 50577037 and 60604010.
Badong Chen received the B.S. and M.S. degrees in Control Theory and Engineering from Chongqing University, Chongqing, China, in 1997
and 2003, respectively, and the Ph.D. degree in Computer Science and Technology from Tsinghua University, Beijing China, in
2008. He is currently a Postdoctor of the Institute of Manufacturing Engineering, Department of Precision Instruments and
Mechanology, Tsinghua University, Beijing, China. His research interests are in signal processing, adaptive control, and information
theoretic aspects of control systems.
Yu Zhu received the B.S. of Radio Electronics in 1983 at Beijing Normal University, and the M.S. of Computer Applications in 1993,
and the Ph.D. of Mechanical Design and Theory in 2001 at China University of Mining & Technology. He is now a Professor of
the Institute of Manufacturing Engineering of Department of Precision and Mechanology of Tsinghua University. His current
research interests are parallel machanism and theory, two photon micro-fabrication, ultra-precision motion system and motion
control.
Jinchun Hu received the Ph.D. in Control Science and Engineering from Nanjing University of Science and Technology, Nanjing, China,
in 1998. Since then, he has been a postdoctoral researcher in Nanjing University of Aeronautics and Astronautics in 1999 and
Tsinghua University in 2002 respectively. His research interests are in flight control, aerial Robot and intelligent control.
Dr. Hu is currently an Associate Professor of the Department of Computer Science and Technology of Tsinghua University, Beijing,
China.
Zengqi Sun received the B.S. degree from the Department of Automatic Control, Tsinghua University, Beijing, China, in 1966 and the Ph.D.
degree in Control Engineering from the Chalmas University of Technology, Sweden, in 1981. He is currently a Professor of the
Department of Computer Science and Technology, Tsinghua University, Beijing, China. He is the author or coauthor of more than
100 paper and eight books on control and robotics. His research interests include robotics, intelligent control, fuzzy system,
neural networks, and evolutionary computation. 相似文献
9.
Many of today’s complex computer applications are being modeled and constructed using the principles inherent to real-time
distributed object systems. In response to this demand, the Object Management Group’s (OMG) Real-Time Special Interest Group
(RT SIG) has worked to extend the Common Object Request Broker Architecture (CORBA) standard to include real-time specifications.
This group’s most recent efforts focus on the requirements of dynamic distributed real-time systems. One open problem in this
area is resource access synchronization for tasks employing dynamic priority scheduling.
This paper presents two resource synchronization protocols that meet the requirements of dynamic distributed real-time systems
as specified by Dynamic Scheduling Real-Time CORBA 2.0 (DSRT CORBA). The proposed protocols can be applied to both Earliest
Deadline First (EDF) and Least Laxity First (LLF) dynamic scheduling algorithms, allow distributed nested critical sections,
and avoid unnecessary runtime overhead. These protocols are based on (i) distributed resource preclaiming that allocates resources
in the message-based distributed system for deadlock prevention, (ii) distributed priority inheritance that bounds local and
remote priority inversion, and (iii) distributed preemption ceilings that delimit the priority inversion time further.
Chen Zhang is an Assistant Professor of Computer Information Systems at Bryant University. He received his M.S. and Ph.D. in Computer
Science from the University of Alabama in 2000 and 2002, a B.S. from Tsinghua University, Beijing, China. Dr. Zhang’s primary
research interests fall into the areas of distributed systems and telecommunications. He is a member of ACM, IEEE and DSI.
David Cordes is a Professor of Computer Science at the University of Alabama; he has also served as Department Head since 1997. He received
his Ph.D. in Computer Science from Louisiana State University in 1988, an M.S. in Computer Science from Purdue University
in 1984, and a B.S. in Computer Science from the University of Arkansas in 1982. Dr. Cordes’s primary research interests fall
into the areas of software engineering and systems. He is a member of ACM and a Senior Member of IEEE. 相似文献
10.
Katsumi Tanaka Keishi Tajima Takashi Sogo Sujeet Pradhan 《New Generation Computing》2000,18(4):359-374
When dealing with long video data, the task of identifying and indexing all meaningful subintervals that become answers to
some queries is infeasible. It is infeasible not only when done by hand but even when done by using latest automatic video
indexing techniques. Whether manually or automatically, it is only fragmentary video intervals that we can identify in advance
of any database usage. Our goal is to develop a framework for retrieving meaningful intervals from such fragmentarily indexed
video data. We propose a set of algebraic operations that includes ourglue join operations, with which we can dynamically synthesize all the intervals that are conceivably relevant to a given query. In
most cases, since these operations also produce irrelevant intervals, we also define variousselection operations that are useful in excluding them from the answer set. We also show the algebraic properties possessed by those
operations, which establish the basis of an algebraic query optimization.
Katsumi Tanaka, D. Eng.: He received his B.E., M.E., and D.Eng. degrees in information science from Kyoto University, in 1974, 1976, and 1981, respectively.
Since 1994, he is a professor of the Department of Computer and Systems Engineering and since 1997, he is a professor of the
Division of Information and Media Sciences, Graduate School of Science and Technology, Kobe University. His research interests
include object-oriented, multimedia and historical databases abd multimedia information systems. He is a member of the ACM,
IEEE Computer Society and the Information Processing Society of Japan.
Keishi Tajima, D.Sci.: He received his B.S, M.S., and D.S. from the department of information science of University of Tokyo in 1991, 1993, and
1996 respectively. Since 1996, he is a Research Associate in the Department of Computer and Systems Engineering at Kobe University.
His research interests include data models for non-traditional database systems and their query languages. He is a member
of ACM, ACM SIGMOD, Information Processing Society of Japan (IPSJ), and Japan Society for Software Science and Technology
(JSSST).
Takashi Sogo, M.Eng.: He received B.E. and M.E. from the Department of Computer and Systems Engineering, Kobe University in 1998 and 2000, respectively.
Currently, he is with USAC Systems Co. His research interests include video database systems.
Sujeet Pradhan, D.Eng.: He received his BE in Mechanical Engineering from the University of Rajasthan, India in 1988, MS in Instrumentation Engineering
in 1995 and Ph.D. in Intelligence Science in 1999 from Kobe University, Japan. Since 1999 May, he is a lecturer of the Department
of Computer Science and Mathematics at Kurashiki University of Science and the Arts, Japan. A JSPS (Japan Society for the
Promotion of Science) Research Fellow during the period between 1997 and 1999, his research interests include video databases,
multimedia authoring, prototypebased languages and semi-structured databases. Dr. Pradhan is a member of Information Processing
Society of Japan. 相似文献
11.
On-demand broadcast is an attractive data dissemination method for mobile and wireless computing. In this paper, we propose
a new online preemptive scheduling algorithm, called PRDS that incorporates urgency, data size and number of pending requests
for real-time on-demand broadcast system. Furthermore, we use pyramid preemption to optimize performance and reduce overhead.
A series of simulation experiments have been performed to evaluate the real-time performance of our algorithm as compared
with other previously proposed methods. The experimental results show that our algorithm substantially outperforms other algorithms
over a wide range of workloads and parameter settings.
The work described in this paper was partially supported by grants from CityU (Project No. 7001841) and RGC CERG Grant No.
HKBU 2174/03E.
This paper is an extended version of the paper “A preemptive scheduling algorithm for wireless real-time on-demand data broadcast”
that appeared in the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.
Victor C. S. Lee received his Ph.D. degree in Computer Science from the City University of Hong Kong in 1997. He is now an Assistant Professor
in the Department of Computer Science of the City University of Hong Kong. Dr. Lee is a member of the ACM, the IEEE and the
IEEE Computer Society. He is currently the Chairman of the IEEE, Hong Kong Section, Computer Chapter. His research interests
include real-time data management, mobile computing, and transaction processing.
Xiao Wu received the B.Eng. and M.S. degrees in computer science from Yunnan University, Kunming, China, in 1999 and 2002, respectively.
He is currently a Ph.D. candidate in the Department of Computer Science at the City University of Hong Kong. He was with the
Institute of Software, Chinese Academy of Sciences, Beijing, China, between January 2001 and July 2002. From 2003 to 2004,
he was with the Department of Computer Science of the City University of Hong Kong, Hong Kong, as a Research Assistant. His
research interests include multimedia information retrieval, video computing and mobile computing.
Joseph Kee-Yin NG received a B.Sc. in Mathematics and Computer Science, a M.Sc. in Computer Science, and a Ph.D. in Computer Science from the
University of Illinois at Urbana-Champaign in the years 1986, 1988, and 1993, respectively. Prof. Ng is currently a professor
in the Department of Computer Science at Hong Kong Baptist University.
His current research interests include Real-Time Networks, Multimedia Communications, Ubiquitous/Pervasive Computing, Mobile
and Location- aware Computing, Performance Evaluation, Parallel and Distributed Computing. Prof. Ng is the Technical Program
Chair for TENCON 2006, General Co-Chair for The 11th International Conference on Embedded and Real-Time Computing Systems
and Applications (RTCSA 2005), Program Vice Chair for The 11th International Conference on Parallel and Distributed Systems
(ICPADS 2005), Program Area-Chair for The 18th & 19th International Conference on Advanced Information Networking and Applications
(AINA 2004 & AINA 2005), General Co-Chair for The International Computer Congress 1999 & 2001 (ICC’99 & ICC’01), Program Co-Chair
for The Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA’99) and General Co-Chair for
The 1999 and 2001 International Computer Science Conference (ICSC’99 & ICSC’01).
Prof. Ng is a member of the Editorial Board of Journal of Pervasive Computing and Communications, Journal of Ubiquitous Computing
and Intelligence, Journal of Embedded Computing, and Journal of Microprocessors and Microsystems. He is the Associate Editor
of Real-Time Systems Journal and Journal of Mobile Multimedia. He is also a guest editor of International Journal of Wireless
and Mobile Computing for a special issue on Applications, Services, and Infrastructures for Wireless and Mobile Computing.
Prof. Ng is currently the Region 10 Coordinator for the Chapter Activities Board of the IEEE Computer Society, and is the
Coordinator of the IEEE Computer Society Distinguished Visitors Program (Asia/Pacific). He is a senior member of the IEEE
and has been a member of the IEEE Computer Society since 1991. Prof. Ng has been an Exco-member (1993–95), General Secretary
(1995–1997), Vice-Chair (1997–1999), Chair (1999–2001) and the Past Chair of the IEEE, Hong Kong Section, Computer Chapter.
Prof. Ng received the Certificate of Appreciation for Services and Contribution (2004) from IEEE Hong Kong Section, the Certificate
of Appreciation for Leadership and Service (2000–2001) from IEEE Region 10 and the IEEE Meritorious Service Award from IEEE
Computer Society at 2004. He is also a member of the IEEE Communication Society, ACM and the Founding Member for the Internet
Society (ISOC)-Hong Kong Chapter. 相似文献
12.
A non-slicing approach,Corner Block List(CBL),has been presented recently.Since CBL only can represent floorplans without empty rooms,the algorithm based on CBL cannot get the optimum placement.In this paper,an extended corner block list,ECBLλ,is proposed.It can represent non-slicing floorplan including empty rooms.Based on the optimum solution theorem of BSG(bounded-sliceline grid),it is proved that the solution space of ECBLn,where n is the number of blocks,contains the optimum block placement with the minimum area.A placement algorithm based on ECBLλ,whose solution space can be controlled by setting λ,the extending ratio,is completed.Whenλ is set as n,the algorithm based on ECBLn is the optimum placement search algorithm.Experiments show that λ has a reasonable constant range for building block layout problem,so the algorithm can translate an ECBLλ representation to its corresponding placement in O(n) time,Experimental results on MCNC benchmarks show promising performance with 7% improvement in wire length and 2% decrease in dead space over algorthms based on CBL.Meanwhile,compared with other algorithms,the proposed algorithm can get better results with less runtime. 相似文献
13.
A new stick text segmentation method based on the sub connected area analysis is introduced in this paper.The foundation of this method is the sub connected area representation of text image that can represent all connected areas in an image efficiently.This method consists mainly of four steps:sub connected area classification,finding initial boundary following point,finding optimal segmentation point by boundary tracing,and text segmentaton.This method is similar to boundary analysis method but is more efficient than boundary analysis. 相似文献
14.
TaoWang YongRui Jia-GuangSun 《计算机科学技术学报》2004,19(3):0-0
In this paper, region features and relevance feedback are used to improve the performance of CBIR. Unlike existing region-based approaches where either individual regions are used or only simple spatial layout is modeled, the proposed approach simultaneously models both region properties and their spatial relationships in a probabilistic framework. Furthermore, the retrieval performance is improved by an adaptive filter based relevance feedback. To illustrate the performance of the proposed approach, extensive experiments have been carried out on a large heterogeneous image collection with 17,000 images, which render promising results on a wide variety of queries. 相似文献
15.
It is likely that customers issue requests based on out-of-date information in e-commerce application systems. Hence, the
transaction failure rates would increase greatly. In this paper, we present a preference update model to address this problem.
A preference update is an extended SQL update statement where a user can request the desired number of target data items by
specifying multiple preferences. Moreover, the preference update allows easy extraction of criteria from a set of concurrent
requests and, hence, optimal decisions for the data assignments can be made. We propose a group evaluation strategy for preference
update processing in a multidatabase environment. The experimental results show that the group evaluation can effectively
increase the customer satisfaction level with acceptable cost.
Peng Li is the Chief Software Architect of didiom LLC. Before that, he was a visiting assistant professor of computer science department
in Western Kentucky University. He received his Ph.D. degree of computer science from the University of Texas at Dallas. He
also holds a B.Sc. and M.S. in Computer Science from the Renmin University of China. His research interests include database
systems, database security, transaction processing, distributed and Internet computer and E-commerce.
Manghui Tu received a Bachelor degree of Science from Wuhan University, P.R. China in 1996, and a Master Degree in Computer Science
from the University of Texas at Dallas 2001. He is currently working toward the PhD degree in the Department of Computer Science
at the University of Texas at Dallas. Mr. Tu’s research interests include distributed systems, grid computing, information
security, mobile computing, and scientific computing.
His PhD research work focus on the data management in secure and high performance data grid. He is a student member of the
IEEE.
I-Ling Yen received her BS degree from Tsing-Hua University, Taiwan, and her MS and PhD degrees in Computer Science from the University
of Houston. She is currently an Associate Professor of Computer Science at the University of Texas at Dallas.
Dr. Yen’s research interests include fault-tolerant computing, security systems and algorithms, distributed systems, Internet
technologies, E-commerce, and self-stabilizing systems. She had published over 100 technical papers in these research areas
and received many research awards from NSF, DOD, NASA, and several industry companies. She has served as Program Committee
member for many conferences and Program Chair/Co-Chair for the IEEE Symposium on Application-Specific Software and System
Engineering & Technology, IEEE High Assurance Systems Engineering Symposium, IEEE International Computer Software and Applications
Conference, and IEEE International Symposium on Autonomous Decentralized Systems. She is a member of the IEEE.
Zhonghang Xia received the B.S. degree in applied mathematics from Dalian University of Technology in 1990, the M.S. degree in Operations
Research from Qufu Normal University in 1993, and the Ph.D. degree in computer science from the University of Texas at Dallas
in 2004. He is now an assistant professor in the Department of Computer Science, Western Kentucky University, Bowling Green,
KY. His research interests are in the area of multimedia computing and networking, distributed systems, and data mining. 相似文献
16.
Xiong Luo Zengqi Sun Fuchun Sun 《International Journal of Control, Automation and Systems》2009,7(1):123-132
The study on nonlinear control system has received great interest from the international research field of automatic engineering.
There are currently some alternative and complementary methods used to predict the behavior of nonlinear systems and design
nonlinear control systems. Among them, characteristic modeling (CM) and fuzzy dynamic modeling are two effective methods.
However, there are also some deficiencies in dealing with complex nonlinear system. In order to overcome the deficiencies,
a novel intelligent modeling method is proposed by combining fuzzy dynamic modeling and characteristic modeling methods. Meanwhile,
the proposed method also introduces the low-level learning power of neural network into the fuzzy logic system to implement
parameters identification. This novel method is called neuro-fuzzy dynamic characteristic modeling (NFDCM). The neuro-fuzzy
dynamic characteristic model based overall fuzzy control law is also discussed. Meanwhile the local adaptive controller is
designed through the golden section adaptive control law and feedforward control law. In addition, the stability condition
for the proposed closed-loop control system is briefly analyzed. The proposed approach has been shown to be effective via
an example.
Recommended by Editor Young-Hoon Joo. This work was jointly supported by National Natural Science Foundation of China under
Grant 60604010, 90716021, and 90405017 and Foundation of National Laboratory of Space Intelligent Control of China under Grant
SIC07010202.
Xiong Luo received the Ph.D. degree from Central South University, Changsha, China, in 2004. From 2005 to 2006, he was a Postdoctoral
Fellow in the Department of Computer Science and Technology at Tsinghua University. He currently works as an Associate Professor
in the Department of Computer Science and Technology, University of Science and Technology Beijing. His research interests
include intelligent control for spacecraft, intelligent optimization algorithms, and intelligent robot system.
Zengqi Sun received the bachelor degree from Tsinghua University, Beijing, China, in 1966, and the Ph.D. degree from Chalmers University
of the Technology, Gothenburg, Sweden, in 1981. He currently works as a Professor in the Department of Computer Science and
Technology, Tsinghua University. His research interests include intelligent control of robotics, fuzzy neural networks, and
intelligent flight control.
Fuchun Sun received the Ph.D. degree from Tsinghua University, Beijing, China, in 1998. From 1998 to 2000, he was a Postdoctoral Fellow
in the Department of Automation at Tsinghua University, where he is currently a Professor in the Department of Computer Science
and Technology. His research interests include neural-fuzzy systems, variable structure control, networked control systems,
and robotics. 相似文献
17.
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with
respect to the Hindley/Milner let-polymorphic type system, and find a condition on two instance algorithms so that one algorithm
should find type errors earlier than the other.
By instantiating the generalized algorithm with different parameters, we can obtain not only the two opposite algorithms (the
bottom-up standard algorithmW and the top-down algorithmM) but also other hybrid algorithms which are used in real compilers. Such instances’ soudness and completeness follow automatically,
and their relative earliness in detecting type-errors is determined by checking a simple condition. The set of instances of
the generalized algorithm is a superset of those used in the two most popular ML compilers: SML/NJ and OCaml.
This work is supported by Creative Research Initiatives of the Korean Ministry of Science and Technology
National Creative Research Initiative Center, http://ropas.kaist.ac.kr
Work done while the third author was associated with Korea Advanced Institute of Science and Technology
Hyunjun Eo: He is a Ph.D. candidate in the Department of Computer Science at KAIST (Korea Advanced Institute of Science and Technology).
He recieved his bachelor’s degree and master’s degree in Computer Science from KAIST in 1996 and 1998, respectively. His research
interest has been on static program analysis, fixpoint iteration algorithm and higher-order and typed languages. From fall
1998, he has been a research assistant of the National Creative Research Initiative Center for Research on Program Analysis
System. He is currently working on developing a tool for automatic generation of program analyzer.
Oukseh Lee: He is a Ph.D. candidate in the Department of Computer Science at KAIST (Korea Advanced Institute of Science and Technology).
He received his bachelor’s and master’s degree in Computer Science from KAIST in 1995 and 1997, respectively. His research
interest has been on static program analysis, type system, program language implementation, higher-order and typed languages,
and program verification. From 1998, he has been a research assistant of the National Creative Research Initiative Center
for Research on Program Analysis System. He is currently working on compile-time analyses and verification for the memory
behavior of programs.
Kwangkeun Yi, Ph.D.: His research interest has been on semanticbased program analysis and systems application of language technologies. After
his Ph.D. from University of Illinois at Urbana-Champaign he joined the Software Principles Research Department at Bell Laboratories,
where he worked on various static analysis approaches for higher-order and typed programming languages. For 1995 to 2003 he
was a faculty member in the Department of Computer Science, Korea Advanced Institute of Science and Technology. Since fall
2003, he has been a faculty member in the School of Computer Science and Engineering, Seoul National University. 相似文献
18.
Chuanjun Li Latifur Khan Balakrishnan Prabhakaran 《Knowledge and Information Systems》2006,10(2):163-183
Multi-attribute motion data can be generated in many applications/ devices, such as motion capture devices and animations. It can have dozens of attributes, thousands of rows, and even similar motions can have different durations and different speeds at corresponding parts. There are no row-to-row correspondences between data matrices of two motions. To be classified and recognized, multi-attribute motion data of different lengths are reduced to feature vectors by using the properties of singular value decomposition (SVD) of motion data. The reduced feature vectors of similar motions are close to each other, while reduced feature vectors are different from each other if their motions are different. By applying support vector machines (SVM) to the feature vectors, we efficiently classify and recognize real-world multi-attribute motion data. With our data set of more than 300 motions with different lengths and variations, SVM outperforms classification by related similarity measures, in terms of accuracy and CPU time. The performance of our approach shows its feasibility of real-time applications to real-world data.
Chuanjun Li is a Ph.D. candidate in Computer Science at the University of Texas at Dallas. His Ph.D. research works primarily on efficient segmentation and recognition of human motion streams, and development of indexing and clustering techniques for the multi-attribute motion data as well as classification of motion data.
Dr. Latifur R. Khan has been an Assistant Professor of Computer Science Department at University of Texas at Dallas since September, 2000. He received his Ph.D. and M.S. degree in Computer Science from University of Southern California (USC) in August 2000 and December 1996, respectively. He obtained his B.Sc. degree in Computer Science and Engineering from Bangladesh University of Engineering and Technology, Dhaka, Bangladesh in November 1993. Professor Khan is currently supported by grants from the National Science Foundation (NSF), Texas Instruments, NOKIA, Alcatel, USA and has been awarded the Sun Equipment Grant. Dr. Khan has more than 50 articles, book chapters, and conference papers focusing in the areas of: database systems, multimedia information management, and data mining in bio-informatics and intrusion detection. Professor Khan has also served as a referee for database journals, conferences (e.g., IEEE TKDE, KAIS, ADL, VLDB) and he is currently serving as a program committee member for Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD2005), ACM Fourteenth Conference on Information and Knowledge Management (CIKM 2005), International Conference on Database and Expert Systems Applications DEXA 2005, and International Conference on Cooperative Information Systems (CoopIS 2005), and program chair of ACM SIGKDD International Workshop on Multimedia Data Mining, 2004.
Dr. Balakrishnan Prabhakaran is currently with the Department of Computer Science, University of Texas at Dallas. Dr. B. Prabhakaran has been working in the area of multimedia systems: multimedia databases, authoring & presentation, resource management, and scalable web-based multimedia presentation servers. He has published several research papers in prestigious conferences and journals in this area.Dr. Prabhakaran received the NSF CAREER Award FY 2003 for his proposal on Animation Databases. Dr. Prabhakaran has served as an Associate Chair of the ACM Multimedia’2003 (November 2003, California), ACM MM 2000 (November 2000, Los Angeles), and ACM Multimedia’99 conference (Florida, November 1999). He has served as guest-editor (special issue on Multimedia Authoring and Presentation) for ACM Multimedia Systems journal. He is also serving on the editorial board of Multimedia Tools and Applications Journal, Kluwer Academic Publishers. He has also served as program committee member on several multimedia conferences and workshops. Dr. Prabhakaran has presented tutorials in several conferences on topics such as network resource management, adaptive multimedia presentations, and scalable multimedia servers.B. Prabhakaran has served as a visiting research faculty with the Department of Computer Science, University of Maryland, College Park. He also served as a faculty in the Department of Computer Science, National University of Singapore as well as in the Indian Institute of Technology, Madras, India 相似文献
19.
In this paper, we discuss quantum algorithms that, for a given plaintextm
o and a given ciphertextc
o, will find a secret key,k
o, satisfyingc
o=E(k
o,m
o), where an encryption algorithm,E, is publicly available. We propose a new algorithm suitable for an NMR (Nuclear Magnetic Resonance) computer based on the
technique used to solve the counting problem. The complexity of, our algorithm decreases as the measurement accuracy of the
NMR computer increases. We discuss the possibility that the proposed algorithm is superior to Grover’s algorithm based on
initial experimental results.
Kazuo Ohta, Dr.S.: He is Professor of Faculty of Electro-Communications at the University of Electro-Communications, Japan. He received B.S.,
M.S., and Dr. S. degrees from Waseda University, Japan, in 1977, 1979, and 1990, respectively. He was researcher of NTT (Nippon
Telegraph and Telephone Corporation) from 1979 to 2001, and was visiting scientist of Laboratory for Computer Science e of
MIT (Massachusetts Institute of Technology) in 1991–1992 and visiting Professor of Applied Mathematics of MIT in 2000. He
is presently engaged in research on Information Security, and theoretical computer science. Dr. Ohta is a member of IEEE,
the International Association for Cryptologic Research, the Institute of Electronics, Information and Communication Engineers
and the Information Processing Society of Japan.
Tetsuro Nishino,: He received the B.S., M.S. and, D.Sc. degrees in mathematics from Waseda University, in 1982, 1984, and 1991 respectively.
From 1984 to 1987, he joined Tokyo Research Laboratory, IBM Japan. From 1987 to 1992, he was a Research Associate of Tokyo
Denki University, and from 1992 to 1994, he was an Associate Professor of Japan Advanced Institute of Science and Technology,
Hokuriku. He is presently an Associate Professor in the Department of Communications and Systems Engineering, the University
of Electro-Communications. His main interests are circuit complexity theory, computational learning theory and quantum complexity
theory.
Seiya Okubo,: He received the B.Eng. and M.Eng. degrees from the University of Electro-Communications in 2000 and 2002, respectively.
He is a student in Graduate School of Electro-Communications, the University of Electro-Communications. His research interests
include quantum complexity theory and cryptography.
Noboru Kunihiro, Ph.D.: He is Assistant Professor of the University of Electro-Communications. He received his B. E., M. E. and Ph. D. in mathematical
engineering and information physics from the University of Tokyo in 1994, 1996 and 2001, respectively. He had been engaged
in the research on cryptography and information security at NTT Communication Science Laboratories from 1996 to 2002. Since
2002, he has been working for Department of Information and Communication Engineering of the University of Elector-Communications.
His research interests include cryptography, information security and quantum computations. He was awarded the SCIS’97 paper
prize. 相似文献
20.
Test Resource Partitioning Based on Efficient Response Compaction for Test Time and Tester Channels Reduction
下载免费PDF全文
![点击此处可从《计算机科学技术学报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Yin-HeHan Xiao-WeiLi Hua-WeiLi AnshumanChandra 《计算机科学技术学报》2005,20(2):201-209
This paper presents a test resource partitioning technique based on an efficient response compaction design called quotient compactor(q-Compactor). Because q-Compactor is a single-output compactor, high compaction ratios can be obtained even for chips with a small number of outputs. Some theorems for the design of q-Compactor are presented to achieve full diagnostic ability, minimize error cancellation and handle unknown bits in the outputs of the circuit under test (CUT). The q-Compactor can also be moved to the load-board, so as to compact the output response of the CUT even during functional testing. Therefore, the number of tester channels required to test the chip is significantly reduced. The experimental results on the ISCAS ‘89 benchmark circuits and an MPEG 2 decoder SoC show that the proposed compactionscheme is very efficient. 相似文献