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

8th IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Al-Tirawi, Arias Reynolds, Robert G. Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

ISBN: (纸本)9781538692769

In Cultural Systems there are many ways to collect and distribute problem solving knowledge within social networks. Such mechanisms include games, auctions, and various voting mechanisms. Here, a new auction mechanism, Common Value Auctions, is presented. In this paper Common Value Auctions are used to distribute problem solving knowledge within a given model of social systems. These mechanisms are compared with the other distribution mechanisms in the solution of dynamic real-valued optimization problems. Specifically, their relative abilities to support the robustness and resilience of Cultural Systems in environments that vary in their dynamic complexity from static to chaotic are assessed. The Cultural Algorithms Toolkit (CAT) is used as a vehicle to generate real-valued dynamic problem landscapes of varying complexities. The results show that using the Common Value Auction in CAT4 has significant improvements over Weighted Voting methods (CAT2) in terms of both robustness and resilience across complexities that range from static to chaotic.

关键词： cultural algorithms evolutionary algorithms common value auction problem complexity socially motivated robustness resilience problem-solving algorithms

来源：评论

学校读者我要写书评

暂无评论

Relationship of study approach and exam performance

引用

Journal of Accounting Education 2002年第1期20卷 29-44页

作者： Davidson, Ronald A School of Management Arizona State University West Phoenix AZ 85069-7100 PO Box 37100 United States

This study considers the relationship between study approach and examination performance. The data show a significant relationship between performance on complex examination questions and the use of a deep study approach, ceteris paribus. No significant relationships occur between the use of a deep study approach and performance on questions that are less complex or between the use of a surface study approach and any examination results. The findings also show that prior academic achievement, as indicated by cumulative GPA, and motivation for taking the course, as indicated by students' plans to seek an accounting job, are the best predictors of examination performance. These findings imply that accounting educators should encourage students to develop and use a deep study approach to become more proficient with complex material. Examples of how this may be done are provided. © 2002 Elsevier Science Ltd. All rights reserved.

关键词： Deep study approach Exam performance Learning process questionnaire problem complexity Study approach Study process questionnaire Surface study approach

来源：评论

学校读者我要写书评

暂无评论

problem Solving Using Social Networks in Cultural Algorithms with Auctions

Problem Solving Using Social Networks in Cultural Algorithms...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Reynolds, Robert G. Kinnaird-Heether, Leonard Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

ISBN: (纸本)9781509046010

Cultural Algorithms provide a meta-heuristic framework for the application of various solution mechanism represented by Knowledge Sources in the Belief Space to the evolution of complex social networks in the population space. One of the key components in the configuration of a Cultural Algorithm is the knowledge distribution mechanism, how the influence of a solution approach is spread out among individuals in individual subnetworks. In this paper a specific set of Knowledge distribution mechanisms based upon various Auction models are introduced and their performance compared in complex real-valued functional landscapes. While capable of generating solutions to the entire range of problem, from fixed to chaotic, they are best utilized for fixed problems containing of low to high variability but begin to lose their edge with increasing periodicity. It is proposed that auction mechanisms will be most likely found in subcultures where problems associated with that culture have reasonably strong signals that can afford the opportunity to make quick and precise decisions.

关键词： Cultural Algorithms Metaheuristics auction mechanisms evolutionary computation problem complexity social networks and optimization problem solving

来源：评论

学校读者我要写书评

暂无评论

problems, Models and complexity. Part I: Theory

引用

Journal of Mathematical Modelling and Algorithms 2003年第2期2卷 121-151页

作者： Brüggemann, W. Fischer, K. Jahnke, H. Management Mathematics Group School of Mathematics and Statistics The University of Birmingham Edgbaston Birmingham B15 2TT United Kingdom Aston Business School Aston University Birmingham B4 7ET United Kingdom Fakultät für Wirtschaftswissenschaften Universität Bielefeld Bielefeld Germany

The meaning of the term 'problem' in operations research (OR) deviates from the understanding in the theoretical computer sciences: While an OR problem is often conceived to be stated or represented by model formulations, a computer-science problem can be viewed as a mapping from encoded instances to solutions. Such a computer-science problem turns out to be rather similar to an OR model formulation. This ambiguity may cause difficulties if the computer-science theory of computational complexity is applied in the OR context. In OR, a specific model formulation is commonly used in the analysis of the underlying problem and the results obtained for this model are simply lifted to the problem level. But this may lead to erroneous results, if the model used is not appropriate for such an analysis of the problem. To resolve this issue, we first suggest a new precise formal definition of the term problem which is identified with an equivalence class of models describing it. Afterwards, a new definition is suggested for the size of a model which depends on the assumed encoding scheme. Only models which exhibit a minimal size with respect to a 'reasonable' encoding scheme finally turn out to be suitable for the model-based complexity analysis of an OR problem. Therefore, the appropriate choice (or if necessary the construction) of a suitable representative of an OR problem becomes an important theoretical aspect of the modelling process. © 2003 Kluwer Academic Publishers.

关键词： philosophy of modelling problem complexity terminology

来源：评论

学校读者我要写书评

暂无评论

Exemplar longest common subsequence

Exemplar longest common subsequence

引用

2nd International Workshop on Bioinformatics Research and Applications

作者： Bonizzoni, Paola Della Vedova, Gianluca Dondi, Riccardo Fertin, Guillaume Rizzi, Raffaella Vialette, Stephane Univ Milano Bicocca Dipartimento Informat Sistemist & Comun I-20126 Milan Italy Univ Milano Bicocca Dipartimento Stat I-20126 Milan Italy Univ Bergamo Dipartimento Sci Linguaggi Comun & Culturali I-24129 Bergamo Italy Univ Nantes CNRS LINA FRE 2729 F-44322 Nantes 3 France Univ Paris 11 CNRS UMR 8623 LRI F-91405 Orsay France

In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence (ELCS) of a set of sequences (ELCS problem), a generalization of the Longest Common Subsequence problem, where the input sequences are over the union of two disjoint sets of symbols, a set of mandatory symbols and a set of optional symbols. We show that different versions of the problem are APX-hard even for instances with two sequences. Moreover, we show that the related problem of determining the existence of a feasible solution of the ELCS of two sequences is NP-hard. On the positive side, we first present an efficient algorithm for the ELCS problem over instances of two sequences where each mandatory symbol can appear in total at most three times in the sequences. Furthermore, we present two fixed-parameter algorithms for the ELCS problem over instances of two sequences where the parameter is the number of mandatory symbols.

关键词： longest common subsequence comparative genomics algorithm design and analysis combinatorial algorithms analysis of algorithms problem complexity

来源：评论

学校读者我要写书评

暂无评论

A puzzle-based seminar for computer engineering freshmen

引用

COMPUTER SCIENCE EDUCATION 2008年第4期18卷 261-277页

作者： Parhami, Behrooz Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

We observe that recruitment efforts aimed at alleviating the shortage of skilled workforce in computer engineering must be augmented with strategies for retaining and motivating the students after they have enrolled in our educational programmes. At the University of California, Santa Barbara, we have taken a first step in this direction by offering a required freshman seminar entitled "Ten Puzzling problems in Computer Engineering''. This one-unit pass/not-pass gateway course, which is graded based solely on attendance, introduces our students to some of the most challenging problems faced by computer engineers in their daily professional endeavors and at the frontiers of research. To accomplish this feat in a manner that is both understandable and appealing to freshmen, the problems are related to popular mathematical and logical puzzles. Each 1-hour class session begins by introducing the students to puzzles of a particular kind and letting them participate in formulating solutions. Historical context, background, and general solution methods for the puzzles are then discussed by the instructor, who finally proceeds to demonstrate how the puzzles and their solution strategies are related to real technical challenges in computer engineering. The new course, which has been offered twice already, is supported by a website containing complete lecture slides, class handouts, and reference information.

关键词： computer science and engineering education freshman seminar problem complexity problem-solving method puzzle puzzling problem

来源：评论

学校读者我要写书评

暂无评论

Optimization-based procedure to support Sensor Network co-design: an application to dynamic consensus problem 22

Optimization-based procedure to support Sensor Network co-de...

引用

22nd Mediterranean Conference on Control and Automation (MED)

作者： Manfredi, Sabato Suardi, Andrea Univ Naples Federico II Dept Elect & Informat Technol Naples Italy Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

ISBN: (纸本)9781479959013

Wireless Sensor Network (WSN) provides reduced costs, better power management, easier maintenance and effortless deployment in remote and hard-to-reach areas. As the field slowly matured and technology rapidly advanced, it has been extended to many civilian applications such as environment and habitat monitoring, home automation, and more recently health care applications. Despite of their applicability, a systematic approach to design of the sensor network architecture according to the requirements of the specific application remains a challenging problem. Many papers in the literature provides algorithm or hardware design for network-type requirements (i. e. coverage) or energy-type requirement (power consumption) or application-type requirement (estimation, set point regulation). Despite the problem complexity, herein we make a first step forward in defining a co-design procedure to optimally design sensor network architecture for simultaneously coping with network, application and energy type requirements. A co-design tool is built to support the designer. An application of the proposed approach and tool to the case of well known dynamic consensus problem is shown.

关键词： optimisation telecommunication power management wireless sensor networks WSN application-type requirement dynamic consensus problem energy-type requirement hardware design network-type requirements optimization-based procedure power management problem complexity reduced costs sensor network architecture systematic approach wireless sensor network co-design tool Cost function Estimation Heuristic algorithms Power demand Steady-state Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Population Mechanics and Cultural Algorithms in the Development of a Cultural Engine

Population Mechanics and Cultural Algorithms in the Developm...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Reynolds, Robert G. Kinnaird-Heether, Leonard Wayne State Univ Dept Comp Sci Detroit MI 48202 USA

ISBN: (纸本)9781538627266

Cultural Algorithms provide a meta-heuristic framework for the application of various solution mechanism represented by Knowledge Sources in the Belief Space to the evolution of complex social networks in the population space. One of the key components in the configuration of a Cultural Algorithm is the knowledge distribution mechanism, the means with which the influence of a solution approach is spread out among individuals in individual subnetworks. In this paper a new method of Knowledge distribution called the population mechanism is introduced and its performance compared in complex real-valued functional landscapes. While capable of generating solutions to the entire range of problem, from fixed to chaotic, they are best utilized for fixed problems containing of low to high variability but begin to lose their edge with increasing periodicity. It is proposed that the population mechanism when paired with other previous forms of knowledge distribution will be able to provide focus in specific areas of search and provide a framework with which to provide metrics to build a Cultural Engine.

关键词： Cultural Algorithms Metaheuristics population mechanism evolutionary computation problem complexity social networks optimization problem solving

来源：评论

学校读者我要写书评

暂无评论

Field dependence/independence cognitive style and problem posing: an investigation with sixth grade students

引用

EDUCATIONAL PSYCHOLOGY 2011年第5期31卷 611-627页

作者： Nicolaou, Aristoklis Andreas Xistouri, Xenia Univ Cyprus Dept Educ Nicosia Cyprus

Field dependence/independence cognitive style was found to relate to general academic achievement and specific areas of mathematics;in the majority of studies, field-independent students were found to be superior to field-dependent students. The present study investigated the relationship between field dependence/independence cognitive style and problem-posing ability among sixth grade students. The 94 students' sample was clustered into three groups, according to the cognitive-style field dependence/independence (field dependents, field mixed and field independents). The results suggest that field-independent participants outperformed field-mixed and field-dependent ones in both problem-posing ability and the complexity of the problems posed. It was also found that the content of the task influenced the differences between the three groups of students as regards the ability in problem posing and the complexity of the problems posed;while in the first (informal context), second and fourth task differences were found between the groups, in the third task (formal context), no differences were evident. The results are interpreted in consideration to the relevant literature findings. Some educational implications are discussed and directions for future research are drawn.

关键词： cognitive style field dependence/independence problem posing problem complexity formal/informal context

来源：评论

学校读者我要写书评

暂无评论

Software metrics from the algorithmic perspective 18

Software metrics from the algorithmic perspective

引用

18th International Conference on Computers and Their Applications

作者： Debnath, N Burgin, M Winona State Univ Dept Comp Sci Winona MN 55987 USA

ISBN: (纸本)1880843463

In this paper, software metrics and processes of program development, verification and maintenance are analyzed in the context of the theory of algorithms. This study is aimed to support the development of high quality production-grade software. The process of program design as a transition from a problem to a program is studied. Analysis of the situation shows that there are different meanings of a problem solution. We formalize these meanings with the aim of better structuring and optimization of the program design process. On the base of algorithmic complexity and of the theory of programs in the sense of Halstead, we analyze qualities of programs represented by software metrics. A classification of software metrics is developed.

关键词： problem program software problem complexity program complexity software metrics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：