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

Activity-Based Life-Cycle Accounting (AB-LCACC) Methodology: Calculating Finished Good's Material Cost and Material Carbon Footprint within a Hierarchical Bill-Of-Material (BOM) 26

Activity-Based Life-Cycle Accounting (AB-LCACC) Methodology:...

引用

26th International Conference on Business Informatics

作者： Alaoui, Lalla Hasnae Schwaiger, Walter S. A. Vienna Univ Technol Inst Management Sci Vienna Austria

ISBN: (纸本)9798331529109;9798331529093

The Corporate Sustainability Reporting Directive (CSRD) requires from enterprises to report their actual Greenhous Gas (GHG) emissions and their future GHG reduction targets and associated reduction strategies. ISO's Life Cycle Assessment (ISO-LCA) methodology offers a well-established approach to measure GHG emissions that is known for many years. But instead of being integrated with existing ERP systems, this methodology establishes an isolated system. The Activity-Based Life Cycle Accounting (AB-LC-ACC) methodology solves this integration problem by using the language spoken in the ERP-Control domain firstly, for the calculation of standard costs as well as standard GHG emissions with the same computational logic and secondly, for the alignment of the business domain with the IT domain. Left open is the problem of modeling the hierarchical Bill-Of-Material (BOM) within the AB-LC-ACC methodology for allowing consistent calculations of the finished good's material cost and material carbon footprint. In this article the BOM modeling problem is solved by applying a comprehensive domain engineering approach where BOM related problems are identified and addressed at the conceptual, the operational and the implementation level.

关键词： Activity-Based Life-Cycle Accounting (AB-LCACC) direct cost accounting E-Liability accounting external GHG accounting carbon footprint calculation hierarchical BOM directed acyclic graph (DAG)-BOM model tree-BOM model recursive programming

来源：评论

学校读者我要写书评

暂无评论

The Euclidean Discus Toss

引用

PRIMUS 2023年第10期33卷 1071-1090页

作者： Morena, Matthew A. Smith, Michael D. mathematics Christopher Newport University United States mathematics Lycoming College Williamsport PA United States

The Euclidean Discus Toss is an active and tactile learning activity that models the extended Euclidean algorithm with a frisbee relay. The extended Euclidean algorithm involves both iterative and recursive programming and is regularly taught throughout the mathematics and computer science curricula. The Euclidean Discus Toss invites students to toss and catch frisbees in a collaborative and hands-on effort designed to sharpen modular arithmetic skills, enhance familiarity with iterative and recursive algorithms, and strengthen classroom community. The activity is fun, low-stakes, and can be customized to meet a variety of pedagogical objectives. © 2023 Taylor & Francis Group, LLC.

关键词： Active learning Bézout's identity Euclid's algorithm extended Euclidean algorithm greatest common divisor modular arithmetic recursive programming tactile learning

来源：评论

学校读者我要写书评

暂无评论

Strassen Algorithm and Its Performance

International Core Journal of Engineering

引用

International Core Journal of Engineering 2021年第4期7卷 75-81页

作者： Ke Zhao

There are many algorithms developed over time for computation. Where some tend to be limited to some ranges, some tend to handle bigger problems. With the advancements in processing world, a lot of platforms have been created for computing, CUDA being one of them. CUDA is a well-known parallel computing platform developed by NVIDIA that enables developers to harness the power of GPU's in solving intensive problems. We are using CUDA to compute different mathematical matrices. Strassen's algorithm was used on CUDA to implement matrix multiplication. As we all know the phrase 'divide and conquer'. This is exactly what Strassen's algorithm does. Hence, it is a much better way of computing matrices than the standard method. The computation can be done on both CPU and GPU. On practical analysis, it was noticed that the computation of matrices of bigger sizes was much faster in GPU implementation than that of CPU implementation. Small matrices also came into account and it was found out that algorithms vary depending upon the size of the matrix. For example, when computing a 2*2 matrix multiplication, the classic method is a better method to implement. Because of this, recursions were put in the code that chooses which algorithm to implement depending upon the sizes of the matrices. Matrix multiplication using Strassen's algorithm on the CPU has a smaller recursion limit than doing the same matrix multiplication on a GPU.

关键词： Strassen Algorithm CPU GPU recursive programming

来源：评论

学校读者我要写书评

暂无评论

Agricultural risks and farm land consolidation process in transition countries: The case of cotton production in Uzbekistan

引用

AGRICULTURAL SYSTEMS 2018年 164卷 223-235页

作者： Djanibekov, Utkur Finger, Robert Manaaki Whenua Landcare Res 231 Morrin Rd Auckland 1072 New Zealand Swiss Fed Inst Technol Agr Econ & Policy Grp Sonneggstr 33 CH-8092 Zurich Switzerland

Cotton production substantially contributes to the GDP of Uzbekistan. It is produced under a state procurement policy, according to which farmers have to allocate half of their land for cotton, fulfill cotton output levels and sell the entire harvest of cotton to the state. Land is state owned and a land consolidation process is in place, where land allocated to a farm can be reduced if cotton production targets are not met. However, low production levels may not only arise due to bad management practices but also due to production risks, e.g., due to climatic variability or limited access to inputs such as irrigation water. In this study, we aim to assess policies that can improve cotton production levels and farm profits under land consolidation and agricultural risks. We use a recursive programming model, which considers risk-averse farmers and their farm size adjustments, together with irrigation water-crop yield response functions on different land productivity classes. We consider production, market and institutional risks and find that such risks affect resource allocation, production levels and thus also farm size developments. The farm land consolidation improves overall cotton output, yet, it reduces farm incomes as the state cotton procurement price is low. Under conditions of the state cotton procurement and land consolidation, increasing the cotton price can improve cotton production and farm profits and reduce farm size changes, but farm size changes still occur among farmers. Having secure land tenure together with land use flexibility and higher cotton prices allows farmers to improve incomes, reduce income disparity, diversify land uses, but results in lower cotton output than under the state cotton procurement policy.

关键词： State target policies Institutional, production and market risks Farm heterogeneity recursive programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic Mental Model Construction: A Knowledge in Pieces-Based Explanation for Computing Students' Erratic Performance on Recursion

引用

JOURNAL OF THE LEARNING SCIENCES 2018年第3期27卷 431-473页

作者： Chao, Jie Feldon, David F. Cohoon, James P. Concord Consortium 25 Love Lane Concord MA 01742 USA Utah State Univ Dept Instruct Technol & Learning Sci Logan UT 84322 USA Univ Virginia Dept Comp Sci Charlottesville VA 22903 USA

The Knowledge in Pieces (KiP) framework offers a powerful perspective to understand the dynamic nature of knowledge and knowledge development. However, there is still much we do not know about the mechanisms underlying the moment-to-moment knowledge construction process. The purpose of this study was to explore the ways in which contextual knowledge elements support that process. According to KiP, a knowledge element, once activated, becomes part of the context that shapes the activation, configuration, and operation of other elements. Based on this assumption, we hypothesized that when the structural and operational characteristics of these contextual knowledge elements are compatible with those of the target concept, the contextual knowledge elements can support the knowledge construction process. This hypothesis was investigated in the domain of recursion, a fundamental but challenging programming concept. Sixty undergraduate computer science students completed four recursion evaluation tasks with varying likelihood to induce compatible contextual elements. Results showed that students performed better on high-compatibility tasks than on low-compatibility tasks at both the group level and individual level. Further qualitative analysis identified the knowledge elements involved and elaborated and refined the explanatory model for the contextual support effect.

关键词： COMPUTER science students recursive programming MENTAL models theory (Communication)

来源：评论

学校读者我要写书评

暂无评论

Optimal investment pathways for split-pond and intensively aerated catfish pond technologies

引用

AQUACULTURE ECONOMICS & MANAGEMENT 2017年第1期21卷 144-162页

作者： Kumar, Ganesh Engle, Carole Thad Cochran Natl Warmwater Aquaculture Ctr Delta Res & Extens Ctr 127 Expt Stn RdPOB 197 Stoneville MS 38776 USA Engle Stone Aquat LLC Strasburg VA USA

The growing interest in intensive production practices makes it essential for catfish farmers to understand the best investment plan to transition an entire farm to new technologies. The 6-year mixed-integer-recursive programming model developed included traditional ponds, re-working existing ponds to make them more productive, converting traditional ponds to split ponds or adding additional aeration. Farm scenarios were developed that differed in the percentages of ponds that required reworking. The model selected primarily adoption of split ponds as the profit-maximizing strategy under current prices and unlimited availability of investment capital. Restricted availability of investment capital had a strong negative effect on those farms with greater percentages of older ponds that required re-working. Farmers that had reworked ponds more recently were able to invest the greater profits from the higher yields to transition more rapidly to new technologies. Larger farms could transition greater proportions of the farm to new technologies than could smaller farms. Higher feed prices and lower fish prices shifted the profit-maximization strategies from split ponds to intensively aerated systems and traditional single-batch systems. Results provide guidance to farms to make decisions related to the optimal investment pathway to transition farms to more productive and profitable technologies.

关键词： Intensive aeration mixed integer programming optimal catfish production technologies pond renovation recursive programming split ponds

来源：评论

学校读者我要写书评

暂无评论

Well-Founded Orderings for Proving Termination of Systems of Rewrite Rules

引用

2017年

作者： david a plaisted

Well-Founded Orderings for Proving Termination of Systems of Rewrite Rules by Plaisted, David A; published by Urbana : Dept. of Computer Science, University of Illinois at Urbana-Champaign

关键词： computer programs orderings proving recursive programming rewrite rules systems

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for least-squares based image prediction

引用

IET IMAGE PROCESSING 2016年第8期10卷 582-589页

作者： Martchenko, Andrew Deng, Guang La Trobe Univ Dept Engn Bundoora Vic 3086 Australia

A new computationally efficient algorithm for two-dimensional sliding-window least-squares prediction is presented in this study. The fast algorithm is based on a recursive update of the Cholesky decomposition. Compared with the state-of-the-art algorithm, the proposed algorithm reduces the computational complexity from O(D-3) to O(D(2)h), where D is the predictor order and h is the height of the prediction patch. The computational improvement is made at the stage of solving the normal equations for which an update algorithm for the Cholesky decomposition of the covariance matrix is proposed. It is shown that a large part of the Cholesky decomposition at location n can be efficiently calculated by performing orthonormal updates on the Cholesky decomposition at n - 1. The computational improvement is made without requiring additional storage space. Extensive experiments using causal and non-causal predictors of varying shapes and sizes have confirmed that the proposed algorithm is consistently faster than the state-of-the-art algorithm and produces identical prediction images. The efficiency of the proposed algorithm is shown to be affected by the order in which pixels are sampled, thus an ordering procedure is proposed to minimise the number of numerical operations.

关键词： LEAST squares software SLIDING glass doors recursive programming COMPUTATIONAL complexity COVARIANCE matrices IMAGE registration

来源：评论

学校读者我要写书评

暂无评论

RLT Code Based Handshake-Free Reliable MAC Protocol for Underwater Sensor Networks

引用

JOURNAL OF SENSORS 2016年第2-25期2016卷 3184642-3184642页

作者： Du, Xiujuan Li, Keqin Liu, Xiuxiu Su, Yishan Qinghai Normal Univ Sch Comp Sci Xining 810008 Qinghai Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA Tianjin Univ Sch Elect Informat Engn Tianjin 300072 Peoples R China

The characteristics of underwater acoustic channels such as long propagation delay and low bit rate cause the medium access control (MAC) protocols designed for radio channels to either be inapplicable or have low efficiency for underwater sensor networks (UWSNs). Meanwhile, due to high bit error, conventional end-to-end reliable transfer solutions bring about too many retransmissions and are inefficient in UWSN. In this paper, we present a recursive LT (RLT) code. With small degree distribution and recursive encoding, RLT achieves reliable transmission hop-by-hop while reducing the complexity of encoding and decoding in UWSN. We further propose an RLT code based handshake-free (RCHF) reliable MAC protocol. In RCHF protocol, each node maintains a neighbor table including the field of state, and packages are forwarded according to the state of a receiver, which can avoid collisions of sending-receiving and overhearing. The transmission-avoidance time in RCHF decreases data-ACK collision dramatically. Without RTS/CTS handshaking, the RCHF protocol improves channel utilization while achieving reliable transmission. Simulation results show that, compared with the existing reliable data transport approaches for underwater networks, RCHF can improve network throughput while decreasing end-to-end overhead.

关键词： Sensor networks Access control Bit rate (Telecommunication) recursive programming Simulation methods & models

来源：评论

学校读者我要写书评

暂无评论

A General, recursive, and Open-Ended Response Code

引用

JOURNAL OF COMPUTATIONAL CHEMISTRY 2014年第8期35卷 622-633页

作者： Ringholm, Magnus Jonsson, Dan Ruud, Kenneth Univ Tromso Dept Chem CTCC N-9037 Tromso Norway Univ Tromso High Performance Comp Grp N-9037 Tromso Norway

We present a new implementation of a recent open-ended response theory formulation for time- and perturbation-dependent basis sets (Thorvaldsen et al., J. Chem. Phys. 2008, 129, 214108) at the Hartree–Fock and density functional levels of theory. A novel feature of the new implementation is the use of recursive programming techniques, making it possible to write highly compact code for the analytic calculation of any response property at any valid choice of rule for the order of perturbation at which to include perturbed density matrices. The formalism is expressed in terms of the density matrix in the atomic orbital basis, allowing the recursive scheme presented here to be used in linear-scaling formulations of response theory as well as with two- and four-component relativistic wave functions. To demonstrate the new code, we present calculations of the third geometrical derivatives of the frequency-dependent second hyperpolarizability for HSOH at the Hartree–Fock level of theory, a seventh-order energy derivative involving basis sets that are both time and perturbation dependent. ? 2014 Wiley Periodicals, Inc.

关键词： recursive programming response theory density-functional theory molecular properties energy-derivative theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：