“自动控制系统工程设计”课程思政教学实践

学习不仅仅是自然科学知识的学习，更是社会科学、民族文化、正确人生观和价值观的形成过程，“课程思政”无疑正是实现该目标的捷径，它是当前高等院校思想政治教育的新模式。如何提升学生解决“复杂工程问题”的能力成为高校开展工程教育和“新工科”的难点和重点，而课程思政正是培养学生解决“复杂工程问题”中所需要的非技术因素的重要途径。“自动控制系统工程设计”是自动化专业高年级学生的一门专业课，当前关于“课程思政”的论述是指导思想居多、实施经验以及案例设计较少，针对该问题以“自动控制系统工程设计”为例，详细给出了“课程思政”教学案例的具体实施过程，对同类课程提供参考。     

25%小偏置碰撞策略及测试评估研究

随着汽车事故的增加,且小重叠碰撞事故死亡率居高不下,小偏置碰撞试验逐渐成为焦点。基于IIHS公布的最新车辆碰撞试验结果,统计超过100余款不同类型的25%小偏置碰撞车辆,建立碰撞转角与碰撞区域的数学模型,将25%小偏置碰撞归结为三种不同的碰撞策略,分别是吸能策略、掠过策略和掠过与吸能策略;并进行试验验证,对三种策略的优缺点进行分析。结果表明,小偏置碰撞试验可运用合理的碰撞策略达到法规要求,对25%小偏置碰撞试验具有一定的参考价值。     

Ecological Planting Imperative: Functional Systems,Not Stylized Ecologies

The ability of landscape architectural projects to mitigate the worst effects of climate change will depend upon designed ecological systems. These systems will be built with plants. Despite the recognition of ecology as an essential driver of landscapes, the professionals of landscape architecture too often lack the knowledge and practical skills to create robust vegetative systems. New approaches and tools are required. This article outlines principles and methods for designing biodiverse plant systems for urban sites. Planting methods that increase species richness, functional diversity, and spatial complexity are emphasized as a way of developing more resilient plantings. Selecting species with similar evolutionary adaptions to stress, disturbance, and competition—as well as creating multi-layered compositions of diverse plant morphologies—allows designers to create compatible, long-lived plant mixes. To balance the increased visual complexity of diverse plant mixes, the article explores design techniques to make plantings more appealing to the public. The strategies explored here are based on the projects, experience, and research of Phyto Studio, a Washington, D.C. based studio. The methods build on work described in the author’s book, Planting in a Post-Wild World, an exploration of how to create designed plant communities.     

Exploring design trade-offs for achieving social inclusion in multi-tiered design problems

ABSTRACT

The digital age of the future is ‘not out there to be discovered’, but it needs to be ‘designed’. The design challenge has to address questions about how we want to live, work, and learn (as individuals and as communities) and what we value and appreciate, e.g.: reflecting on quality of life and creating inclusive societies. An overriding design trade-off for the digital age is whether new developments will increase the digital divide or will create more inclusive societies. Sustaining inclusive societies means allowing people of all ages and all abilities to exploit information technologies for personally meaningful activities. Meta-design fosters the design of socio-technical environments that end-user developers can modify and evolve at use time to improve their quality of life and favour their inclusion in the society. This paper describes three case studies in the domain of assistive technologies in which end users themselves cannot act as end-user developers, but someone else (e.g.: a caregiver or a clinician) must accept this role requiring multi-tiered architectures. The design trade-offs and requirements for meta-design identified in the context of the case studies and other researchers’ projects are described to inform the development of future socio-technical environments focused on social inclusion.     

An experimental study of adaptive control for evolutionary algorithms

In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm.     

Interactive design exploration for constrained meshes

In architectural design, surface shapes are commonly subject to geometric constraints imposed by material, fabrication or assembly. Rationalization algorithms can convert a freeform design into a form feasible for production, but often require design modifications that might not comply with the design intent. In addition, they only offer limited support for exploring alternative feasible shapes, due to the high complexity of the optimization algorithm.We address these shortcomings and present a computational framework for interactive shape exploration of discrete geometric structures in the context of freeform architectural design. Our method is formulated as a mesh optimization subject to shape constraints. Our formulation can enforce soft constraints and hard constraints at the same time, and handles equality constraints and inequality constraints in a unified way. We propose a novel numerical solver that splits the optimization into a sequence of simple subproblems that can be solved efficiently and accurately.Based on this algorithm, we develop a system that allows the user to explore designs satisfying geometric constraints. Our system offers full control over the exploration process, by providing direct access to the specification of the design space. At the same time, the complexity of the underlying optimization is hidden from the user, who communicates with the system through intuitive interfaces.     

An industrial case study on variability handling in large enterprise software systems

ContextEnterprise software systems (e.g., enterprise resource planning software) are often deployed in different contexts (e.g., different organizations or different business units or branches of one organization). However, even though organizations, business units or branches have the same or similar business goals, they may differ in how they achieve these goals. Thus, many enterprise software systems are subject to variability and adapted depending on the context in which they are used.ObjectiveOur goal is to provide a snapshot of variability in large scale enterprise software systems. We aim at understanding the types of variability that occur in large industrial enterprise software systems. Furthermore, we aim at identifying how variability is handled in such systems.MethodWe performed an exploratory case study in two large software organizations, involving two large enterprise software systems. Data were collected through interviews and document analysis. Data were analyzed following a grounded theory approach.ResultsWe identified seven types of variability (e.g., functionality, infrastructure) and eight mechanisms to handle variability (e.g., add-ons, code switches).ConclusionsWe provide generic types for classifying variability in enterprise software systems, and reusable mechanisms for handling such variability. Some variability types and handling mechanisms for enterprise software systems found in the real world extend existing concepts and theories. Others confirm findings from previous research literature on variability in software in general and are therefore not specific to enterprise software systems. Our findings also offer a theoretical foundation for describing variability handling in practice. Future work needs to provide more evaluations of the theoretical foundations, and refine variability handling mechanisms into more detailed practices.     

Reliability of complex chemical engineering processes

This paper presents a stochastic performance modelling approach that can be used to optimise design and operational reliability of complex chemical engineering processes. The framework can be applied to processes comprising multiple units, including the cases where closed form process performance functions are unavailable or difficult to derive from first principles, which is often the case in practice. An interface that facilitates automated two-way communication between Matlab^® and process simulation environment is used to generate large process responses. The resulting constrained optimisation problem is solved using both Monte Carlo Simulation (MCS) and First Order Reliability Method (FORM); providing a wide range of stochastic process performance measures. Adding such capabilities to traditional deterministic process simulators provides a more informed basis for selecting optimum design factors; giving a simple way of enhancing overall process reliability and cost-efficiency. Two case study systems are considered to highlight the applicability and benefits of the approach.     

TCBR-HMM: An HMM-based text classifier with a CBR system

This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.