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

Combinatorial algorithms for Computing Degenerations of Modules of Finite Dimension

FUNDAMENTA INFORMATICAE 2014年第4期132卷 519-532页

作者： Mroz, Andrzej Zwara, Grzegorz Nicholas Copernicus Univ Fac Math & Comp Sci PL-87100 Torun Poland

We present combinatorial algorithms for solving three problems that appear in the study of the degeneration order of a module M in the variety of Lambda-modules. In particular, we introduce algorithmic techniques for... 详细信息

We present combinatorial algorithms for solving three problems that appear in the study of the degeneration order <=(deg) for the variety of finite-dimensional modules over a k-algebra Lambda, where M <=(deg) N means that a module N belongs to an orbit closure <(O(M))over bar> of a module M in the variety of Lambda-modules. In particular, we introduce algorithmic techniques for deciding whether or not the relation M <=(deg) N holds and for determining all predecessors (resp. succesors) of a given module M with respect to <=(deg). The order <=(deg) plays an important role in modern algebraic geometry and module theory. Applications of our technique and experimental tests for particular classes of algebras are presented. The results show that a computer algebra technique and algorithmic computer calculations provide important tools in solving theoretical mathematics problems of high computational complexity. The algorithms are implemented and published as a part of an open source GAP package called QPA.

关键词： COMBINATORIAL analysis computer algorithms DIMENSIONS MODULES (Algebra) PROBLEM solving

来源：评论

学校读者我要写书评

暂无评论

JHAVE: Supporting algorithm visualization

引用

IEEE computer GRAPHICS AND APPLICATIONS 2005年第5期25卷 49-55页

作者： Naps, TL Univ Wisconsin Oshkosh WI 54901 USA

The article focuses on the Java-Hosted Algorithm Visualization Environment (JHAVÉ), which fosters the use of algorithm visualization as an effective pedagogical tool for computer science educators. Students attempting to learn the algorithm were often mystified by the high-powered display they saw unfolding in front of them. Developers of algorithm visualizations and the systems that facilitate them had too often show- cased their work to professionals who already understood the algorithm rather than the intended audience of students trying to learn it. Members of an Innovation and Technology in computer Science Education working group on improving the educational impact of algorithm visualization produced a report codifying-in an engagement taxonomy-modes that students could become active participants in exploring an algorithm with an algorithm visualization system. In the responding category, educators focus on having students answer questions concerning the visualization that the system presents. In the constructing category, students construct their own visualizations of the algorithm under consideration. This entails a larger time commitment on the part of the student. A common technique for constructing visualization is to first code it and then annotate it with calls to have graphics produced at interesting events during the algorithm's execution.

关键词： computer algorithms computer programming computerS EDUCATIONAL innovations JAVA (computer program language) computerS in education EXPERIMENTAL methods in education

来源：评论

学校读者我要写书评

暂无评论

Improved reactance domain unitary propagator algorithms for electronically steerable parasitic array radiator antennas

引用

IET MICROWAVES ANTENNAS & PROPAGATION 2013年第1期7卷 15-23页

作者： Akkar, Salem Harabi, Ferid Gharsallah, Ali Tunis El Manar Univ Fac Sci Unit Res High Frequency Elect Circuits & Syst Tunis 2092 Tunisia

In this study, the authors propose four algorithms for directions of arrival (DoAs) estimation of multiple incoming narrowband plane waves onto electronically steerable parasitic array radiator antennas. The constraints on the proposed algorithms are the same as those imposed onto the classic subspace methods allowing superior high-resolution and localisation capabilities even for correlated sources scenarios but with more reduced computations load and processing time than existing schemes. We also demonstrate that estimating the propagator operator through both introduced real-valued orthogonal decompositions techniques not only yields to a faster DoAs estimation with a reduced computational complexity, but also it improves the robustness of the developed algorithms to noise as compared with the classic propagator algorithm. The Cramer-Rao bound on the variance of the estimated DoAs by the proposed algorithms is analysed. The achieved performance by the developed methods is studied and compared with conventional antenna arrays. The simulation results confirm that high-resolution DoAs estimation can be achieved with the developed algorithms and prove the validity of the proposed approach.

关键词： computer algorithms PLANE wavefronts ANTENNAS (Electronics) -- Design & construction COMPUTATIONAL complexity ANTENNA arrays

来源：评论

学校读者我要写书评

暂无评论

Exploiting SIMD parallelism on dynamically partitioned parallel network coding for P2P systems

引用

computerS & ELECTRICAL ENGINEERING 2013年第1期39卷 55-66页

作者： Kim, Deokho Park, Karam Ro, Won W. Yonsei Univ Sch Elect & Elect Engn Dept Seoul 120749 South Korea Samsung Elect Mobile Commun Suwon South Korea

Due to the decoding complexity of network coding, there have been concerns on adopting network coding in the practical P2P systems. To provide rapid decoding speed in practical network coding systems, various multi-threaded approaches which successfully exploit hardware supported TLP have been proposed. Among those parallel approaches, a dynamic partitioning method is known to be the best solution so far. However, the algorithm dynamically changes workload distribution and inherently contains some limits to utilize the SIMD instruction set which are designed to work on a fixed size of data. In this paper, we present a new data manipulation method to utilize SIMD instruction sets, which can be successfully integrated into the dynamic partitioning of thread-level workload distribution. With exploiting both SIMD and thread-level parallelism, we achieve the speed-up of 10.86 using eight running threads compared to the serial algorithm. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： SIMD (computer architecture) PARALLEL computers PEER-to-peer architecture (computer networks) computer algorithms computer networks INFORMATION technology THREADS (computer programs) computer systems

来源：评论

学校读者我要写书评

暂无评论

Developing Playability Heuristics Based on Nouns and Adjectives from Online Game Reviews

引用

INTERNATIONAL JOURNAL OF HUMAN-computer INTERACTION 2017年第3期33卷 241-253页

作者： Zhu, Miaoqi Zhao, Fan Fang, Xiaowen Moser, Christopher Depaul Univ Coll Comp & Digital Media Chicago IL 60604 USA Depaul Univ Coll Comp & Digital Media Sch Comp Chicago IL 60604 USA Florida Gulf Coast Univ Lutgert Coll Business Ft Myers FL USA

The objective of this study is to develop playability heuristics based on a lexical analysis of nouns and adjectives frequently used in online game reviews. Built on a previous lexical analysis of adjectives in online game reviews, it is argued that nouns together with adjectives will likely provide more contextual information than adjectives alone, and therefore the patterns among these words can be used to develop playability heuristics. A revised lexical approach is adopted to analyze nouns and adjectives from 821,122 online reviews. Ninety seven factors emerge from this analysis. Based on the nouns and adjectives highly loaded on these factors, a new process is introduced and 90 playability heuristics are derived. This study significantly expands the current pool of playability heuristics that facilitate the computer game design process. The lexical method adopted in this study demonstrates its effectiveness in developing interface design guidelines based on a large number of online reviews on a system or product. It can be extended to other fields that are human-behavior centered.

关键词： LEXICOLOGY NOUNS (Grammar) ADJECTIVES (Grammar) HEURISTIC algorithms computer algorithms INTERNET games computer games

来源：评论

学校读者我要写书评

暂无评论

Hybrid Method to Predict Melting Points of Organic Compounds Using Group Contribution plus Neural Network plus Particle Swarm Algorithm

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2009年第18期48卷 8760-8766页

作者： Lazzus, Juan A. Univ La Serena Dept Fis La Serena Chile

The melting points of organic compounds were estimated using a hybrid method that includes a simple group contribution method (GCM) implemented in an artificial neural network (ANN) replacing standart backpropagation with particle swarm optimization (PSO). A total of 439 compounds have been used to train the network developed using MatLab. Then, the melting points of 100 other Compounds have been predicted and results compared to experimental data and other models availables in the literature. The study shows that the proposed GCM + ANN + PSO model represents an excellent alternative for the estimation of melting points of organic compounds (average absolute relative deviation (AARD) = 7%) from the knowledge of the molecular structure.

关键词： MELTING points ORGANIC compounds NEURAL networks (computer science) PARTICLE swarm optimization MATHEMATICAL models MOLECULAR structure computer algorithms SCIENTIFIC experimentation PREDICTION models

来源：评论

学校读者我要写书评

暂无评论

An Improved Particle Swarm Optimization for the Automobile Spare Part Warehouse Location Problem

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2013年第1期2013卷 1-6页

作者： Yao, Baozhen Hu Ping Yang Shu Dalian Univ Technol Sch Mech Engn Dalian 116024 Peoples R China Dalian Univ Technol Sch Automot Engn Dalian 116024 Peoples R China

This paper deals with a real-life warehouse location problem, which is an automobile spare part warehouse location problem. Since the automobile spare part warehouse location problem is a very complex problem, particle swarm optimization is used and some improved strategies are proposed to improve the performance of this algorithm. At last, the computational results of the benchmark problems about warehouse location problems are used to examine the effectiveness of particle swarm optimization. Then the results of the real-life automobile spare part warehouse location problem also indicate that the improved particle swarm optimization is a feasible method to solve the warehouse location problem.

关键词： PARTICLE swarm optimization DATA warehousing PROBLEM solving PERFORMANCE evaluation computer algorithms SPARE parts

来源：评论

学校读者我要写书评

暂无评论

A Local and Global Search Combined Particle Swarm Optimization Algorithm and Its Convergence Analysis

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-11页

作者： Lin, Weitian Lian, Zhigang Gu, Xingsheng Jiao, Bin Minist Educ Key Lab Adv Control & Optimizat Chem Proc Shanghai 200237 Peoples R China Shanghai Dianji Univ Shanghai 201306 Peoples R China

Particle swarm optimization algorithm (PSOA) is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA), and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA). Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.

关键词： PARTICLE swarm optimization STOCHASTIC convergence computer algorithms BENCHMARKING (Management) MATHEMATICAL analysis MATHEMATICAL optimization

来源：评论

学校读者我要写书评

暂无评论

A CURRENT-FREE AND PARAMETER-FREE CONTROL ALGORITHM

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 1994年第2期30卷 324-332页

作者： LOSIC, NA VARGA, LD INST MIHAJLO PUPIN BELGRADE YUGOSLAVIA

A method of synthesizing a control system comprising a most inner positive voltage feedback loop and an inner negative voltage feedback loop and an outer negative voltage feedback loop is presented. The control system error is forced to zero in steady state and minimized in transient in response to either input command change or external disturbance. No current through the plant under the control is sensed and no parameters of the plant are required to be known implying minimization of measurement noise and adaptive/self-tuning operation, respectively. The method is used to synthesize load-independent and input-voltage-independent switch-mode power converters as well as electric motor drive systems, incorporating any kind of electric motor, of maximized disturbance rejection ratio and minimized dynamics.

关键词： Feedback loop control systems voltage feedback Zero external disturbance Noise measurement power conversion unit Loops plants drive train computer algorithms switching pattern Electric motors Contraceptive Coil

来源：评论

学校读者我要写书评

暂无评论

A type safe state abstraction for coordination in J-like languages

引用

ACTA INFORMATICA 2008年第7-8期45卷 479-536页

作者： Damiani, Ferruccio Giachino, Elena Giannini, Paola Drossopoulou, Sophia Univ Torino Dipartimento Informat I-10149 Turin Italy Univ Paris 07 PPS F-75013 Paris France Univ Piemonte Orientale Dipartimento Informat I-15100 Alessandria Italy Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England

The state of a concurrent object, intended as some abstraction over the values of the fields of the object, usually determines its coordination behavior. Therefore, state is always in the programmer's mind, even though implicitly. We suggest a feature for J ava-like languages, which makes the state of a concurrent object explicit and supports the expression of the object's behavior depending on the state it is currently in. Namely, an object will be in one of the states declared in its class. The state determines the presence of fields and methods. State transition statements explicitly change the state of an object, and thus change the availability of fields and methods. When a thread calls a method which is declared in the object's class but absent from its current state, it waits, until the state of the object changes to a state which does contain that method. This directly expresses coordination. We claim that this feature makes it easier to understand and develop concurrent programs, and substantiate our claim through the discussion of some popular examples of concurrent programs written using this *** develop a type and effect system, which guarantees that, during execution of a method invoked on a concurrent object. No attempt will be made to access fields not available in the current state of and (2) No method invoked on a receiver (syntactically) different from may cause the invocation of a method on the latter guarantee helps to enforce the former and prevents a family of accidental violations of the intended coordination protocol.

关键词： computer programming computer programmers ELECTRONIC data processing computer algorithms computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：