共查询到20条相似文献,搜索用时 31 毫秒
1.
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. 相似文献
2.
Leakage current of CMOS circuit increases dramatically with the technology scaling down and has become a critical issue of high performance system. Subthreshold, gate and reverse biased junction band-to-band tunneling (BTBT) leakages are considered three main determinants of total leakage current. Up to now, how to accurately estimate leakage current of large-scale circuits within endurable time remains unsolved, even though accurate leakage models have been widely discussed. In this paper, the authors first dip into the stack effect of CMOS technology and propose a new simple gate-level leakage current model. Then, a table-lookup based total leakage current simulator is built up according to the model. To validate the simulator, accurate leakage current is simulated at circuit level using popular simulator HSPICE for comparison. Some further studies such as maximum leakage current estimation, minimum leakage current generation and a high-level average leakage current macromodel are introduced in detail. Experiments on ISCAS85 and ISCAS89 benchmarks demonstrate that the two proposed leakage current estimation methods are very accurate and efficient. 相似文献
3.
In this pager,we report our success in building efficient scalable classifiers by exploring the capabilities of modern relational database management systems (RDBMS).In addition to high classification accuracy,the unique features of the approach include its high training speed ,linear scalability,and simplicity in implementation.More importantly,the major computation required in the approach can be implemented using standard functions provided by the modern realtional DBMS.Besides,with the effective rule pruning strategy,the algorithm proposed in this paper can produce a compact set of classification rules,The results of experiments conducted for performance evaluation an analysis are presented. 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
Summary A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency.
Anne Kaldewaij received an M.Sc. degree in Mathematics from the University of Utrecht (The Netherlands) and a Ph.D. degree in Computing Science from the Eindhoven University of Technology. Currently, he is associate professor in Computing Science at Eindhoven University. His research includes parallel programming and the design of algorithms and data structures. He enjoys teaching and he has written a number of textbooks on mathematics and programming.
Jan Tijmen Udding received an M.Sc. degree in Mathematics in 1980 and a Ph.D. degree in Computing Science in 1984 from Eindhoven University of Technology. Currently, he is associate professor at Groningen University. His main research interests are mathematical aspects of VLSI, program derivation and correctness, and functional programming. 相似文献
9.
The problem of scheduling weakly hard real-time tasks is addressed in this paper.The paper first analyzes the characters of μ-pattern and weakly hard real-time constraints,then,presents two scheduling algorithms,Meet Any Algorithm and Meet Row Algorithm,for weakly hard real-time systems.Different from traditional algorithms used to guarantee deadlines,MeetAny Algorithm and Meet Row Algorithm can guarantee both deadlines and constraints.Meet Any Algorithm and Meet Row Algorithm try to find out the probabilities of tasks breaking constraints and increase task‘s priority in advance,but not till the last moment.Simulation results show that these two algorithms are better than other scheduling algorithms dealing with constraints and can largely decrease worst-case computation time of real-time tasks. 相似文献
10.
QiangWang Hai-ZhouAi Guang-YouXu 《计算机科学技术学报》2004,19(4):0-0
This paper describes a novel method for tracking complex non-rigid motions by learning the intrinsic object structure. The approach builds on and extends the studies on non-linear dimensionality reduction for object representation, object dynamics modeling and particle filter style tracking. First, the dimensionality reduction and density estimation algorithm is derived for unsupervised learning of object intrinsic representation, and the obtained non-rigid part of object state reduces even to 2-3 dimensions. Secondly the dynamical model is derived and trained based on this intrinsic representation. Thirdly the learned intrinsic object structure is integrated into a particle filter style tracker. It is shown that this intrinsic object representation has some interesting properties and based on which the newly derived dynamical model makes particle filter style tracker more robust and reliable.Extensive experiments are done on the tracking of challenging non-rigid motions such as fish twisting with selfocclusion, large inter-frame lip motion and facial expressions with global head rotation. Quantitative results are given to make comparisons between the newly proposed tracker and the existing tracker. The proposed method also has the potential to solve other type of tracking problems. 相似文献
11.
This paper introduces a new algorithm of mining association rules.The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database into m partitions.The total number of pa sses over the database is only(k 2m-2)/m,where k is the longest size in the itemsets.It is much less than k . 相似文献
12.
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. 相似文献
13.
1 IntroductionLet G = (V, E) be a connected, undirected graph with a weight function W on the set Eof edges to the set of reals. A spanning tree is a subgraph T = (V, ET), ET G E, of C suchthat T is a tree. The weight W(T) of a spanning tree T is the sum of the weights of its edges.A spanning tree with the smallest possible'weight is called a minimum spanning tree (MST)of G. Computing an MST of a given weighted graph is an important problem that arisesin many applications. For this … 相似文献
14.
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. 相似文献
15.
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. 相似文献
16.
17.
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. 相似文献
18.
Given an m×n mesh-connected VLSI array with some faulty elements, the reconfiguration problem is to find a maximum-sized fault-free sub-array under the row and column rerouting scheme. This problem has already been shown to be NP-complete. In this paper, new techniques are proposed, based on heuristic strategy, to minimize the number of switches required for the power efficient sub-array. Our algorithm shows that notable improvements in the reduction of the number of long interconnects could be realized in linear time and without sacrificing on the size of the sub-array. Simulations based on several random and clustered fault scenarios clearly reveal the superiority of the proposed techniques. 相似文献
19.
BIST design for detecting multiple stuck-open faults in CMOS circuits using transition count
下载免费PDF全文
![点击此处可从《计算机科学技术学报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This paper presents a built-in self-test(BIST) scheme for detecting all robustly testable multiple stuck-open faults confined to any single complex cell of a CMOS circuit.The test pattern generator(TPG) generates all n.2^n single-input-change(SIC) orderd test pairs design is universal,i.e.,independent of the structure and functionality of the CUT.A counter that counts the number of alternate transitions at the output of the CUT,is used as a signature analyzer(SA).The design of TPG and SA is simple and no special design-or synthesis-for-testability techniques and /or additional control lines are needed. 相似文献
20.
Bi-XinLi Xiao-CongFan JunPang Jian-JunZhao 《计算机科学技术学报》2004,19(6):848-858
Program slicing can be effectively used to debug, test, analyze, understand and maintain objectoriented software. In this paper, a new slicing model is proposed to slice Java programs based on their inherent hierarchical feature. The main idea of hierarchical slicing is to slice programs in a stepwise way, from package level, to class level, method level, and finally up to statement level. The stepwise slicing algorithm and the related graph reachability algorithms are presented, the architecture of the Java program Analyzing TOol (JATO) based on hierarchical slicing model is provided, the applications and a small case study are also discussed. 相似文献