检索结果-南通市图书馆

A QUANTIFIER-ELIMINATION BASED HEURISTIC FOR AUTOMATICALLY GENERATING INDUCTIVE ASSERTIONS FOR PROGRAMS

Journal of Systems science & Complexity 2006年第3期19卷 307-330页

作者： Deepak KAPUR department of computer science University of New MexicoAlbuquerqueUSA

A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserved by all execution paths leading to the associated location of the program. The method can be used to discover loop invariants-properties of variables that remain invariant at the entry of a loop. The parameterized formula can be successively refined by considering execution paths one by one; heuristics can be developed for determining the order in which the paths are considered. Initialization of program variables as well as the precondition and postcondition, if available, can also be used to further refine the hypothesized invariant. The method does not depend on the availability of the precondition and postcondition of a program. Constraints on parameters generated in this way are solved for possible values of parameters. If no solution is possible, this means that an invariant of the hypothesized form is not likely to exist for the loop under the assumptions/approximations made to generate the associated verification condition. Otherwise, if the parametric constraints are solvable, then under certain conditions on methods for generating these constraints, the strongest possible invariant of the hypothesized form can be generated from most general solutions of the parametric constraints. The approach is illustrated using the logical languages of conjunction of polynomial equations as well as Presburger arithmetic for expressing assertions.

关键词： Automated software analysis and verification inductive assertion loop invariant quantifier elimination.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A secure multi-party computation solution to intersection problems of sets and rectangles

引用

Progress in Natural science:Materials International 2006年第5期16卷 538-545页

作者： LI Shundong, DAI Yiqi, WANG Daoshun and LUO Ping (department of computer science and Technology, Beijing Normal univer.ity, Beijing 100875, China department of computer science and Technology, Tsinghua univer.ity, Beijing 100084, China) [a]department of computer science and Technology Beijing Normal University Beijing China [b]department of computer science and Technology Tsinghua University Beijing China

Secure multi-party computation (SMC) is a research focus in international cryptographic community. At present, there is no SMC solution to the intersection problem of sets. In this paper, we first propose a SMC solution to this problem. Applying Cantor encoding method to computational geometry problems, and based on the solution to set-intersection problem, we further propose solutions to points inclusion problem and intersection problem of rectangles and further prove their privacy-preserving property with widely accepted simulation paradigm. Compared with the known solutions, these new solutions are of less computational complexity and less communication complexity, and have obvious superiority in computational and communication complexity.

关键词： Cantor encoding secure multi-party computation set-intersection rectangle-intersection computational complexity.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Tissue P systems with parallel rules on channels

引用

Progress in Natural science:Materials International 2007年第4期17卷 486-491页

作者： Xu Xian (department of computer science and Technology, Shanghai Jiao Tong univer.ity, Shanghai 200240, China) [a]department of computer science and Technology Shanghai Jiao Tong University Shanghai China

A new variant of P systems as an improvement of the original design is introduced. The P systems here allow parallelism in rules application on synapses (or links, channels), rendering the systems more efficient. We describe the execution mechanism of our P systems, make analysis on its computation power, and illustrate the running by an example.

关键词： tissue P systems parallel rules.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Two Aspects of Evolutionary Algorithms

引用

Wuhan univer.ity Journal of Natural sciences 2000年第4期5卷 413-424页

作者： Zbigniew Michalewicz department of computer science, univer.ity of North Carolina, Charlotte, NC 28223, usa, and Institute of computer science, Polish Academy of sciences, ul. Ordona 21, 01-237 Warsaw, Poland univer.ity of North Carolina Department of Computer Science Charlotte USA (GRID:grid.266859.6) (ISNI:***) Polish Academy of sciences Institute of Computer Science Warsaw Poland (GRID:grid.413454.3) (ISNI:***)

In this paper we discuss the paradigm of evolutionary algorithms (EAs). We argue about the need for new heuristics in real-world problem solving, discussing reasons why some problems are difficult to solve. After introducing the main concepts of evolutionary algorithms, we concentrate on two issues: (1) self-adaptation of the parameters of EA, and (2) handling constraints.

关键词： Key words problem solving evolutionary algorithms heuristics constraint handling adaptation

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

引用

science China Mathematics 2007年第7期50卷 1055-1064页

作者： Bao-xing CHEN~(1+) Xie-bin CHEN~2 Ji-xiang MENG~3 Wen-jun XIAO~4 1 department of computer science,Zhangzhou Teachers College,Zhangzhou 363000,China 2 department of Mathematics and Information science,Zhangzhou Teachers College,Zhangzhou 363000,China 3 College of Mathematics & System science,Xinjiang univer.ity,Urumqi 830046,China 4 department of computer science,South China univer.ity of Technology,Guangzhou 510641,China 1. department of computer science Zhangzhou Teachers College Zhangzhou 363000 China 2. department of Mathematics and Information science Zhangzhou Teachers College Zhangzhou 363000 China 3. College of Mathematics & System science Xinjiang University Urumqi 830046 China 4. department of computer science South China University of Technology Guangzhou 510641 China

The double loop network(DLN)is a circulant digraph with n nodes and outdegree *** is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed *** the number n of nodes,how to construct a DLN which has minimum diameter?This problem has attracted great attention.A related and longtime unsolved problem is:for any given non-negative integer k,is there an infinite family of k-tight optimal DLN?In this paper,two main results are obtained:(1)for any k≥0,the infinite families of k-tight optimal DLN can be constructed,where the number n(k,e,c)of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c.(2)for any k≥0, an infinite family of singular k-tight optimal DLN can be constructed.

关键词： double loop network diameter k-tight optimal singular k-tight optimal 05C12 05C20 05C85

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Compactness in fuzzy logic

引用

Chinese science Bulletin 1998年第14期43卷 1166-1171页

作者： YING Mingsheng department of computer science and Technology, Tsinghua univer.ity, Beijing 100084, China department of computer science and Technology Tsinghua University Beijing China

Compactness in Pavelka’s fuzzy logic for some compact lattices of truth values is shown, and the concept of gradual compactness is introduced to establish some corresponding results in a more general setting.

关键词： fuzzy logic compactness gradual compactness.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Magnetostratigraphy of Late Cenozoic fossil mammals in the northeastern margin of the Tibetan Plateau

引用

science Bulletin 2003年第2期48卷 188-193页

作者： SONG Chunhui1,2,FANG Xiaomin 1,2,GAO Junping1, NIE Junsheng1,YAN Maodu1,3,XU Xianhai1 & SUN Dong1 1. MOE National Laboratory of western China抯 Environmental Systems & College of Resource and Environment,Lanzhou univer.ity,Lanzhou 730000,China 2. State Key Laboratory of Loess and Quaternary Geology ,Institute of Earth Environment,Chinese Academy of sciences,Xi抋n 710075, China 3. department of Geological sciences,univer.ity of michigan,AnnArbor,MI 48109,usa Univ Arizona Steward Observ Tucson AZ 85721 USA MOE National Laboratory of western China\'s Environmental Systems & College of Resource and Environment Lanzhou University Lanzhou 730000 China

A number of fossil mammals have been found in the very thick Cenozoic stratigraphy of the Guide Basin in the northeastern margin of the Tibetan *** of these are of great significance in mammal evolution and stratigraphic correla-tion on and around the Tibetan Plateau and North ***,the chronology of these mamals is poorly *** of the mammals will not only place precise age constraints on the mammals,but also provide much inlormation on the related stratigraphy that records the uplift process of the Tibetan *** paleomagnetism of the upper part of the Cenozoic stratigraphy at He'erjia and Lajigai north of Guide County has revealed magnetic chrons that can be correlated to Ganss and 3An *** the section spanning about 3.16.5 Ma and the *** and third layers of fossil mammals at about 5.25,5.1 and 4.4 Ma,*** of the significant genus Gazella kueitensis and the Chinese elephant Anancus sinensis are firstly constrained at about 5.25 MaBP and 4.4 Ma,*** mammalian evolution and the associated increase in coarse sediments and sedimentation rate may suggest that the northeastern Tibetan Plateau was uplifted rapidly at that time,and the eastern Tibetan Plateau with its neighboring regions was not high enough to stop mammal exchange between the northern and southern sides of the Tibetan Piateau.

关键词： Tibetan Plateau Guide Basin Late Cenozoic stratigra-phy fossil mammals paleomagnetism.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A conceptual evolutionary aseismic decision support framework for hospitals

引用

Earthquake Engineering and Engineering Vibration 2012年第4期11卷 499-512页

作者： Yufeng Hu Gary F. Dargush Xiaoyun Shao department of Civil and Construction Engineering Western Michigan UniversityKalamazoo department of Mechanical and Aerospace Engineering University at BuffaloState University of New YorkBuffalo

In this paper, aconceptual evolutionary framework for aseismic decision support for hospitalsthat attempts to integrate a range of engineering and sociotechnical models is presented. Genetic algorithms are applied to find the optimal decision sets. A case study is completed to demonstrate how the frameworkmay applytoa specific *** simulations show that the proposed evolutionary decision support framework is able to discover robust policy sets in either uncertain or fixed environments. The framework also qualitatively identifies some of the characteristicbehavior of the critical care organization. Thus, by utilizing the proposedframework, the decision makers are able to make more informed decisions, especially toenhance the seismic safety of the hospitals.

关键词： decision making seismic engineering hospital genetic algorithms

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Seamlet carving for shape-aware image resizing

引用

science China(Information sciences) 2012年第5期55卷 1073-1081页

作者： LIN Xiao 1,2,SHENG Bin 1,MA LiZhuang 1,SHEN Yang 1 & CHEN ZhiHua 3 1 department of computer science and Engineering,Shanghai Jiao Tong univer.ity,Shanghai 200240,China 2 Academy of Information Technology,Luoyang Normal univer.ity,Luoyang 471022,China 3 department of computer science and Engineering,East China univer.ity of science and Technology,Shanghai 200237,China 1. department of computer science and Engineering Shanghai Jiao Tong University Shanghai 200240 China2. Academy of Information Technology Luoyang Normal University Luoyang 471022 China3. Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China

In this paper we propose an optimized seam-carving approach for anti-shearing image *** image/video seam-carving strategy only focuses on deleting the pixels along 8-connected seams,which may lead to the obvious information loss during *** the traditional seam-carving methods,our approach can construct a seamlet to handle the discontinuous pixels and further achieve an optimized image resizing results with *** particular,to suppress zigzag artifacts,we introduce the anti-shearing energy into the seamlet generation,which includes two steps:1) the energy map is formalized by using Gabor filtering and the saliency map;2) The energy computation is optimized in Gabor feature space to obtain the resizing results without the connectivity *** experimental results and comparisons show the effectiveness of our method.

关键词： image resizing seamlet carving saliency map

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Building a next generation Internet with source address validation architecture

引用

science in China(Series F) 2008年第11期51卷 1681-1691页

作者： WU JianPing1,3,REN Gang1,3 & LI Xing2,3 1 department of computer science,Tsinghua univer.ity,Beijing 100084,China 2 department of Electronic Engineering,Tsinghua univer.ity,Beijing 100084,China 3 Tsinghua National Laboratory for Information science and Technology(TNList) ,Beijing 100084,China department of computer science Tsinghua University Beijing 100084 China department of Electronic Engineering Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information science and Technology (TNList) Beijing 100084 China

The IP packet forwarding of current Internet is mainly destination based. In the forwarding process, the source IP address is not checked in most *** causes serious security, management and accounting problems. Based on the drastically increased IPv6 address space, a ＂source address validation architecture＂（SAVA） is proposed in this paper, which can guarantee that every packet received and forwarded holds an authenticated source IP address. The design goals of the architecture are lightweight, loose coupling, ＂multi-fence support＂ and incremental deployment. This paper discusses the design and implementation for the architecture, including inter-AS, intra-AS and local subnet. The performance and scalability of SAVA are described. This architecture is deployed into the CNGI-CERNET2 infrastructure a large-scale native IPv6 backbone network of the China Next Generation Internet project. We believe that the SAVA will help the transition to a new, more secure and dependable Internet.

关键词： IP source address validation network architecture network security

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：