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

CompEuro

作者： J.T. Alander Laboratory of Information Processing Science Department of Computer Science Helsinki University of Technology Espoo Finland

A description is given of the results of experiments to find the optimum population size for genetic algorithms as a function of problem complexity. It seems that for moderate problem complexity the optimal population size for problems coded as bitstrings is approximately the length of the string in bits for sequential machines. This result is also consistent with earlier experimentation. In parallel architectures the optimal population size is larger than in the corresponding sequential cases, but the exact figures seem to be sensitive to implementation details.< >

关键词： Genetic algorithms Robot control Laboratories information processing computer science Parallel architectures Robustness Parallel processing Problem-solving Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Convergence behavior and convergence rates of stack filters

Convergence behavior and convergence rates of stack filters

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： M. Gabbouj P.-T. Yu E.J. Coyle Signal Processing Laboratory Tampere University of Technology Tampere Finland Institute of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan School of Electrical Engineering Purdue University West Lafayette IN USA

The convergence behavior of type-0 through type-3 stack filters is investigated. It is shown that stack filters of type-0 through type-2 all possess the convergence property; that is, they filter any input signal to a root after consecutive passes of the filter under any appending strategy. A counterexample is given to show that not all type-3 stack filters have this convergence property. The rate of convergence for convergent stack filters is also shown. It is shown that stack filters of type-0 will take at most a single pass to filter any input signal to a root. The rate of convergence of type-1 and type-2 stack filters is shown to be linear in the length of the input signal.< >

关键词： Convergence Filters Boolean functions Signal processing Laboratories computer science Shape Filtering theory Design methodology Signal design

来源：评论

学校读者我要写书评

暂无评论

ON THE COMPLEXITY OF HYPERELLIPTIC DISCRETE LOGARITHM PROBLEM

ON THE COMPLEXITY OF HYPERELLIPTIC DISCRETE LOGARITHM PROBLE...

引用

WORKSHOP ON THE THEORY AND APPLICATION OF CRYPTOGRAPHIC TECHNIQUES

作者： SHIZUYA, H ITOH, T SAKURAI, K Department of Electrical Communications Faculity of Engineering Tohoku University Aramaki-Aza-Aoba Aoba-ku Sendai 980 Japan Département d’I.R.O. Université de Montréal C.P.6128 Succ.A Montréal H3C 3J7 QC Canada Department of Information Processing The Graduate School at Nagatsuta Tokyo Institute of Technology 4259 Nagatsuta Midori-ku Yokohama 227 Japan Computer & Information Systems Laboratory Mitsubishi Electric Corporation 5-1-1 Ofuna Kamakura 247 Japan

ISBN: (纸本)3540546200

We give a characterization for the intractability of hyperelliptic discrete logarithm problem from a viewpoint of computational complexity theory. It is shown that the language of which complexity is equivalent to that of the hyperelliptic discrete logarithm problem is in NP ∩ co-AM, and that especially for elliptic curves, the corresponding language is in NP ∩ co-NP. It should be noted here that the language of which complexity is equivalent to that of the discrete logarithm problem defined over the multiplicative group of a finite field is also characterized as in NP ∩ co-NP. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

End-to-end performance modeling for layered communication protocol

End-to-end performance modeling for layered communication pr...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： H. Inai T. Nishida T. Yokohira H. Miyahara Information Processing Center Kobe University Kobe Japan Communication Research Department C & C Systems Research Laboratory NEC Corporation Limited Kawasaki Japan Department of Information Technology Okayama University Naka Okayama Japan Department of Information and Computer Sciences Osaka University Toyonaka Japan

ISBN: (纸本)0818620498

An analytical model for predicting the performance of protocol software implementation in a layered communication architecture is proposed. Each layer is modeled by a queuing network. The model is constructed by focusing the behavior of the protocol entity in a layer. A first come, first served (FCFS) server queue with preemptive priority is employed for an entity and an infinite-server queue for response time of acknowledge packets. Respective layer models are piled up by embedding the lower services in the infinite-server queue. From the perspective of end-to-end performance, the model provides a solution for the following problems, which arise in implementing a layered communication protocol: assigning each layer's process to a processor; giving priority to respective processes in each processor; and providing an error recovery service. The authors present an approximate analysis to obtain an average end-to-end transmission delay and discuss the possible solutions for the problems mentioned.< >

关键词： Protocols Network servers Software performance Analytical models computer architecture computer errors Size measurement Delay systems Throughput information processing

来源：评论

学校读者我要写书评

暂无评论

FAST ALGORITHM FOR COMPUTING FRACTAL DIMENSIONS OF IMAGE SEGMENTS

FAST ALGORITHM FOR COMPUTING FRACTAL DIMENSIONS OF IMAGE SEG...

引用

SATELLITE CONF AT THE 1988 BIANNUAL INTERNATIONAL CONF ON PATTERN RECOGNITION : RECENT ISSUES IN PATTERN ANALYSIS AND RECOGNITION

作者： CREUTZBURG, R IVANOV, E Central Institute of Cybernetics and Information Processes International Basic Laboratory for Image Processing and Computer Graphics Academy of Sciences of the G.D.R. Kurstr. 33 P. O. Box 1298 Berlin DDR - 1086 Germany Department of Information Techniques University of Technology Mommsenstr. 13 Dresden DDR - 8027 Germany

来源：评论

学校读者我要写书评

暂无评论

A design data manager 88

A design data manager

引用

Proceedings of the 1988 ACM SIGMOD international conference on Management of data

作者： Kari Alho Hannu Peltonen Martti Mäntylä Rejio Sulonen Helsinki University of Technology Department of Computer Science Laboratory of Information Processing Science Otakaari 1 SF-02150 Espoo Finland

ISBN: (纸本)9780897912686

HutBase is a visual design data manager that can be used to store and manipulate data objects created and processed by a variety of design applications. In particular, HutBase allows the user to manipulate the data and start applications, and provides a access mechanism for the *** consists of three software layers. The lowest layer, the Object Management System (OMS), is based on the Entity-Relationship model and includes those basic operations related to the storage and access of design data objects that are common to all applications. The database is divided into workspaces, which are collections of OMS objects and relationships organized according to an application-dependent schema and forming a significant whole (e.g., a design project) from the user's point of view Workspace is also the unit for locking and access *** object is a collection of attributes. Each attribute has a name and value. The name is a string and the value is an arbitrary sequence of bytes. The value of an attribute can be of any length, from a single integer to an external representation of a complicated geometric model. A relationship is a named directed connection between two objects. Relationships have attributes like *** OMS library contains functions for creating, opening and removing workspaces, objects, relationships and attributes. All operations are carried out within transactions. The functions do not change the permanent data on the disk until the user calls the save_changes function, which saves the current state of all workspaces opened in a given *** next layer is a prototype data model built on top of OMS, which stores the objects in each workspace as a hierarchical tree by means of relationships. The leaves of the hierarchy are called representations and contain the actual data manipulated by the applications. Each representation is associated with a representation type, which in turn are linked to the application programs, or too

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance and architectural evaluation of the PSI machine

引用

Operating Systems Review (ACM) 1987年第4期21卷 128-135页

作者： Taki, Kazuo Nakajima, Katzuto Nakashima, Hiroshi Ikeda, Morihiro Fourth Research Laboratory Institute for New Generation Computer Technology 4-28 Mita 1-Chome Minato-ku Tokyo108 Japan Information Processing Dept. Information Systems and Electronics Development Laboratory Mitsubishi Electric Corporation Japan New Product Development Dept. Computer Works Mitsubishi Electric Corporation 325 Kaminmchiya Kamakura city Kanagawa247 Japan

We evaluated a Prolog machine PSI (Personal Sequential Inference machine) for the purpose of improving and redesigning it. In this evaluation, we measured the execution speed and the dynamic characteristics of cache memory, register file, and branching hardware introduced for high-speed execution of Prolog *** speed of the PSI firmware interpreter was found to be comparable to that of the DEC-10 Prolog compiled code on the DEC-2060. It was also found that PSI was faster than DEC for executing programs containing much unification and backtracking that require runtime *** the cache memory, the hit ratio for application programs was found higher than 96%;this demonstrates that the Prolog execution has much memory access locality. The memory access frequency and the appearance ratio between Read and Write command were also *** the register file, use rate of each dedicated access mode was measured and effect of each mode was discussed. In the branching function we confirmed a high appearance rate of conditional branches and multi-way branches based on tag values. © 1987 Copyright is held by the owner/author(s).

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Bintrees, CSG trees, and time 85

Bintrees, CSG trees, and time

引用

Proceedings of the 12th annual conference on computer graphics and interactive techniques

作者： Hanan Samet Markku Tamminen Computer Science Department University of Maryland College Park MD Laboratory for Information Processing Science Helsinki University of Technology 02150 Espoo 15 Finland

ISBN: (纸本)9780897911665

A discussion is presented of the relationship between two solid representation schemes: constructive solid geometry (CSG trees) and recursive spatial subdivision exemplified by the bintree, a generalization of the quadtree and octree. Detailed algorithms are developed and analyzed for evaluating CSG trees by bintree conversion, i.e., by determining explicitly which parts of space are solid and which empty. These techniques enable the addition of the time dimension and motion to the approximate analysis of CSG trees in a simple manner to solve problems such as dynamic interference detection. For "well-behaved" CSG trees, the execution time of the conversion algorithm is directly related to the spatial complexity of the object represented by the CSG tree (i.e., asymptotically it is proportional to the number of bintree nodes as the resolution increases). The set of well-behaved CSG trees includes all trees that define multidimensional polyhedra in a manner that does not give rise to tangential intersections at CSG tree nodes.

关键词： constructive solid geometry (CSG) octrees image processing hierarchical data structures motion bintrees time interference detection solid modeling quadtrees conversion

来源：评论

学校读者我要写书评

暂无评论

Efficient octree conversion by connectivity labeling 84

Efficient octree conversion by connectivity labeling

引用

Proceedings of the 11th annual conference on computer graphics and interactive techniques

作者： Markku Tamminen Hanan Samet Laboratory of Information Processing Science Helsinki University of Technology 02150 Espoo 15 Finland Computer Science Department University of Maryland College Park MD

ISBN: (纸本)9780897911382

We present an algorithm for converting from the boundary representation of a solid to the corresponding octree model. The algorithm utilizes an efficient new connected components labeling technique. A novelty of the method is the demonstration that all processing can be performed directly on linear quad and octree encodings. We illustrate the use of the algorithm by an application to geometric mine modeling and verify its performance by analysis and practical experiments.

关键词： Image processing Conversion Octree

来源：评论

学校读者我要写书评

暂无评论

Collaborative Fuzzy Linguistic Learning to Low-Resource and Robust Decision System Based on Bounded Rationality

引用

ACM Transactions on Asian and Low-Resource Language information processing 1000年

作者： Chao Zhang Xiaochuan Li Arun Kumar Sangaiah Wentao Li Baoli Wang Feng Cao Xuekui Shangguan School of Computer and Information Technology Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University China International Graduate Institute of Artificial Intelligence National Yunlin University of Science and Technology Taiwan and Department of Electrical and Computer Engineering Lebanese American University Lebanon College of Artificial Intelligence Southwest University China and School of Computer and Information Technology Shanxi University China School of Mathematics and Information Technology Yuncheng University China Shanxi Information Industry Technology Research Institute Co. Ltd China

Low-resource languages are challenging to process intelligent decision systems due to limited data and resources. As an effective way of processing low-resource languages in intelligent decision systems, fuzzy linguistic approaches excel in transforming original uncertain linguistic information into highly structured data and learning valid decision rules between complex data structures. However, existing fuzzy linguistic methods may not fully capture realistic features of multi-attribute group decision-making (MAGDM), such as incomplete and hesitant linguistic expressions, stable information fusion, and bounded rationality of decision-makers (DMs). Therefore, it is necessary to develop a collaborative fuzzy language learning system based on bounded rationality, low-resource and robust decision-making. Specifically, we present a new multi-granularity (MG) group decision-making (GDM) scheme by using MULTIMOORA (Multi-Objective Optimization by Ratio Analysis plus the full MULTIplicative form) and PT (Prospect Theory) for incomplete hesitant fuzzy linguistic information systems (I-HFL-ISs), where MG GDM aims to discover knowledge from complex MAGDM problems with MG features. To achieve the above goal, we first introduce the concept of MG-I-HFL-ISs to represent incomplete, hesitant and imprecise linguistic evaluation information offered by multiple decision-makers (DMs). Then, we apply a valid transformation scheme to convert MG-I-HFL-ISs into MG-HFL-ISs, and use the MG probability rough set (PRS) to develop a series of MG-HFL-PRSs with the support of MULTIMOORA. Afterwards, an HFL MG GDM method is designed by integrating MULTIMOORA and PT for solving MAGDM problems with MG-I-HFL-ISs. The proposed method can effectively synthesize low-resource languages and mine useful decision-making knowledge. At last, a drug selection case and a simulated case are performed for showing the rationality of the designed HFL MG GDM scheme.

关键词： Fuzzy linguistic approach collaborative multiple feature fusion low-resource languages granular computing decision system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：