检索结果-内蒙古大学图书馆

An implicit control-volume finite element method and its time step strategies for injection molding simulation

COMPUTERS & CHEMICAL ENGINEERING 2007年第11期31卷 1407-1418页

作者： Jiang, Shunliang Wang, Zhiguo Zhou, Goufa Yang, Weimin Nanchang Univ Dept Comp Sci & Technol Nanchang 330029 Jiangxi Peoples R China Nanchang Univ Dept Chem Engn Nanchang 330029 Jiangxi Peoples R China Beijing Univ Chem Technol Sch Mech & Elect Engn Beijing 100029 Peoples R China

An implicit control-volume finite element method was proposed for simulation of injection molding, the time steps were controlled for both flow and thermal simulation by local flow information, and then the computing complexity analysis was conducted. The implicit scheme was based on updating the melt-air inter-face. The time steps of implicit algorithm were controlled by injection ratio and local mesh information of flow front to achieve "one time step, one element-layer" for filling simulation;the sub-time steps of computing temperatures were calculated for each node according to local courant number, and the thermal simulation was conducted by the filled order of nodes. Both analysis and case studies showed that the computing complexity of flow simulation was second-order of mesh size (nodal number) and one of thermal simulation was 1.5-order. As a result, the computing times and complexity of solving temperature were less than those of solving pressure. (c) 2006 Elsevier Ltd. All rights reserved.

关键词： control-volume finite element method injection molding time step computing complexity

来源：评论

学校读者我要写书评

暂无评论

Verifiable secret sharing scheme without dealer based on vector space access structures over bilinear groups

引用

ELECTRONICS LETTERS 2018年第2期54卷 77-79页

作者： Wang, Na Fu, Junsong Zeng, Jiwen Xiamen Univ Sch Math Sci Xiamen Peoples R China Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing Peoples R China

In general, most of the previous secret sharing schemes involve a secret dealer and a number of participants. The dealer generates a secret and then distributes the secret shares to the participants in a centralised manner, which may lead to the data tamper problem. A verifiable secret sharing scheme without dealer on vector space access structures over bilinear groups is presented. In particular, each participant can act as a dealer' and the secret in the proposed scheme is a random element generated by all the participants from a bilinear group. In addition, the performance of the proposed scheme in terms of security and computing complexity is analysed in detail and compared it with that of the scheme by Zhang and Zhang. The results show that the proposed scheme performs better in terms of computational cost.

关键词： cryptography computational complexity verifiable secret sharing scheme vector space access structures bilinear groups random element security computing complexity

来源：评论

学校读者我要写书评

暂无评论

A NEW HEURISTIC-SEARCH TECHNIQUE - ALGORITHM SA

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1985年第1期7卷 103-107页

作者： ZHANG, B ZHANG, L ANQING TEACHERS COLL DEPT MATHANQINGPEOPLES R CHINA

In this paper, we present a new heuristic searching algorithm by introducing the statistical inference method on the basis of algorithm A (or A*). It is called algorithm SA. In a simplified search space, a uniform m-ary tree, we obtain the following result. Using algorithm SA, a goal node can be found with probability one, and its mean complexity is O(N·ln N) where N is the depth at which the goal is located.

关键词： Inference algorithms Tin Random variables Distribution functions Sequential analysis Sampling methods Strontium Error probability Heuristic algorithms Explosions Author Keywords statistical inference computing complexity heuristic search

来源：评论

学校读者我要写书评

暂无评论

INFORMATION-PROCESSING AND ARTIFICIAL-INTELLIGENCE

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1987年第7-8期42卷 470-489页

作者： SIMON, JC UNIV PARIS 06 INST PROGRAMMAT4 PL JUSSIEUF-75230 PARIS 05FRANCE

Les systèmes informatiques sont les machines les plus générales, propres au traitement de l’information. Leur emploi, de plus en plus courant, conduit à ne considérer que des modèles constructifs, par opposition à certaines modélisations formelles ou mathématiques. La calculabilité et la programmabilité deviennent ainsi des facteurs essentiels au succès d’un modèle informatique. La nécessité d’échapper aux contraintes imposees par la complexité de calcul conduit à dégager des idées et des méthodes nouvelles, particulièrement mises en évidence dans les domaines de l’intelligence artificielle et de la reconnaissance des formes.

关键词： Traitement information Intelligence artificielle Traitement informatique Algorithmique Arbre recherche Complexité calcul Reconnaissance forme Information processing Artificial intelligence Computerized processing Algorithmics Research tree computing complexity Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a high-throughput fully parallel complex-valued QR factorisation chips

引用

IET CIRCUITS DEVICES & SYSTEMS 2011年第5期5卷 424-432页

作者： Hwang, Y. -T. Chen, W. -D. Natl Chung Hsing Univ Dept Elect Engn Taichung 40227 Taiwan

Complex QR factorisation is a fundamental operation used in various applications such as adaptive beamforming and MIMO signal detection. In this paper, based on Givens rotation scheme, a high-throughput, fully parallel complex-valued QR factorisation (CQRF) design is presented. It features the lowest computing complexity in various factorising schemes and indicates no BER performance loss when applied to a MIMO signal detection system. Via carefully plotted scheduling, one CQRF computation can be completed in eight clock cycles. In hardware design, a low complexity and look-up-table-free CORDIC algorithm is employed to implement the rotation operations. Further design optimisations, such as hardware sharing of common modules and reduction of register usage by shortening the variable's life span, are also applied. Sized 2 x 2 and 4 x 4 chip designs largely following the IEEE 802.11n standard are developed. The implementation results in TSMC 0.18 um process technology show that the proposed 4 x 4 design, with a gate count of only 134.6 K, is capable of performing 15 M CQRFs per second. The measured power consumption is 196.3 mW at 120 MHz. Compound performance indexes such as area-time product and energy consumption per CQRF also indicate significant performance edges of the proposed designs.

关键词： TSMC BER performance loss eight clock cycles computing complexity hardware sharing Givens rotation scheme digital arithmetic computational complexity size 0.18 mum digital integrated circuits area time product signal detection error statistics design optimisations temperature 134.6 K energy consumption frequency 120 MHz high throughput fully parallel complex valued QR factorisation chips power 196.3 mW integrated circuit design MIMO signal detection system power consumption MIMO communication rotation operations look up table free CORDIC algorithm compound performance indexes

来源：评论

学校读者我要写书评

暂无评论

A perfectly matched layer for free-space simulation in finite-difference computer codes

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1996年第1-2期51卷 39-46页

作者： Berenger, JP Centre d’Analyse de Défense Arcueil Cédex France

Some results of FDTD computations are presented to illustrate the actual possibilities of a new technique of free-space simulation. It is shown that this technique improves the absorption of the outgoing waves and all... 详细信息

关键词： electromagnetism numerical simulation finite difference method absorbing medium wave reflection wave diffraction airplane dipole calculating time computing complexity

来源：评论

学校读者我要写书评

暂无评论

OFF-LINE CURSIVE WORD RECOGNITION

引用

PROCEEDINGS OF THE IEEE 1992年第7期80卷 1150-1161页

作者： SIMON, JC ENPC F-75007 PARISFRANCE

After surveying the state of the art in handwriting recognition, especially in cursive word recognition, some basic notions are reviewed in the field of picture recognition, particularly of line image recognition, stating the usefulness of "regular" versus "singular" classes of features. These notions are applied to obtain a graph, G, representing a line image, by a new technique, and also to find an "axis" as the regular part of G. The complements to G of the axis are the "tarsi," singular parts of G. A segmentation of the graph is obtained, giving a symbolic description chain (SDC) A "tarsus" (singularity) is an informative feature of a cursive word, often a letter of the word. Using one or more as robust anchors, possible words are selected in a list of words. Candidate words are examined to see if the other letters fit to the remains of the SDC Good results are obtained for clean images of words written by several persons. But the problem of recognition of a word on a busy or noisy background is still an open one.

关键词： REPRESENTATION INTERPRETATION PATTERN RECOGNITION OPERATOR computing complexity FEATURES REGULARITIES SINGULARITIES SEGMENTATION SYMBOLIC DESCRIPTION ROBUST ANCHORS CHAIN GRAPH LINE IMAGE CURSIVE WORDS HANDWRITING OFF-LINE RECOGNITION

来源：评论

学校读者我要写书评

暂无评论

Some Capabilities of Enumeration Control in the DSM Method. Part One

引用

SCIENTIFIC AND TECHNICAL INFORMATION PROCESSING 2014年第6期41卷 335-347页

作者： Zabezhailo, M. I. Appl Res Ctr Comp Networks Bus Pk Rumyantsevo 1 Moscow 142784 Russia

The capabilities of enumeration optimization in intelligent data analysis by the DSM method of automated hypothesis formation are discussed. Options for enumeration control are considered, as well as options for enumeration reduction by decomposing the entire multitude of DSM hypotheses into independently formed fragments. The concept of the approximate DSM method is formulated.

关键词： DSM method of automated hypothesis generation computing complexity enumeration optimization methods of decomposition in enumeration reduction

来源：评论

学校读者我要写书评

暂无评论

High-Order Integer Cosine Transform: Construction Method and Fast Algorithms for High-Resolution Image and Video Coding

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2017年第4期53卷 615-626页

作者： Hnativ, L. O. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine

Matrix method of constructing one-norm high-order integer cosine transform is proposed. The one-norm order-32 integer transform is constructed and its fast algorithms of low computing complexity are developed. Its computing complexity is 3.24 times less than that in the well-known algorithms and 15.6 times less than in standard H.265 and requires integer operations only. This transform is not only very close to the discrete cosine transform but also has excellent coding performance.

关键词： discrete cosine transform integer cosine transform scaled transform factorization fast transform coding gain computing complexity compression ratio video coding H. 264 H. 265 AVS

来源：评论

学校读者我要写书评

暂无评论

Some Capabilities of Enumeration Control in the DSM Method. Part Two

引用

SCIENTIFIC AND TECHNICAL INFORMATION PROCESSING 2014年第6期41卷 348-361页

作者： Zabezhailo, M. I. Appl Res Ctr Comp Networks Bus Pk Rumyantsevo 1 Moscow 142784 Russia

Capabilities of enumeration optimization in the intelligent data analysis by the DSM method of automated hypothesis formation are discussed. Some options for enumeration control by using specifically generated combinatory objects called pseudo-trees are considered. Algorithms for targeted restoration of pseudo-trees according to their pseudomodels are proposed. The concept of the approximate DSM method is developed. The capabilities of additional acceleration of DSM data processing by using parallel algorithms, specialized cloud computing, and some problem-oriented hardware-circuit solutions are described.

关键词： DSM method of automated hypothesis generation computing complexity enumeration optimization methods of decomposition in reduction of enumeration approximate computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：