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

Rapid design and algorithm implementation for knitted sweater pattern

JOURNAL OF THE TEXTILE INSTITUTE 2020年第4期112卷 636-645页

作者： Lu, Lisha Jiang, Gaoming Cong, Honglian Xia, Fenglin Peng, Jiajia Jiang Nan Univ Minist Educ Engn Res Ctr Knitting Technol 1800 Lihu Ave Wuxi Jiangsu Peoples R China

Sweater pattern design plays a crucial role in practical production, determining whether the finished products can meet the requirements of customers. In addition, pattern-designing is also a vital link in the production of sweaters, affecting the development cycle and final quality of products. For this reason, this work proposed two different kinds of algorithms for sweater pattern design: synchronous filling algorithm and asynchronous filling algorithm, so as to realise the rapid design of sweater pattern in Computer-Aided Design (CAD) system by reducing the complex technique calculation. Firstly, the data structures of specifications and styles were established respectively based on the technological characteristics of sweaters, and then the algorithms for sweater pattern-generating were implemented by using C+ + programming technology. At last, the running time of each algorithm was tested to analyse the performances of the algorithms under the same filling scales and different filling scales, respectively. The results showed that the execution efficiency and stability of synchronous filling algorithm are better than that of asynchronous filling algorithm.

关键词： Rapid design sweater pattern algorithm implementation

来源：评论

学校读者我要写书评

暂无评论

An implicit difference scheme and algorithm implementation for the one-dimensional time-fractional Burgers equations

引用

MATHEMATICS AND COMPUTERS IN SIMULATION 2019年 166卷 298-314页

作者： Qiu, Wenlin Chen, Hongbin Zheng, Xuan Hunan Normal Univ Sch Math & Stat Key Lab Comp & Stochast Math Minist Educ Changsha 410081 Hunan Peoples R China Cent South Univ Forestry & Technol Coll Sci Inst Math & Phys Changsha 410004 Hunan Peoples R China Changsha Univ Sci & Technol Sch Math & Stat Changsha 410114 Hunan Peoples R China

An implicit difference scheme with the truncation of order 2 - alpha(0 < alpha < 1) for time and order 2 for space is considered for the one-dimensional time-fractional Burgers equations. The L-1-discretization formula of the fractional derivative in the Caputo sense is employed. The second-order spatial derivative is approximated by means of the three-point centered formula and the nonlinear convection term is discretized by the Galerkin method based on piecewise linear test functions. The stability and convergence in the L-infinity norm are proved by the energy method. Meanwhile, a novel iterative algorithm is proposed and implemented to solve the nonlinear systems. Numerical experiment shows that the results are consistent with our theoretical analysis, and the comparison between the proposed iterative algorithm and the existing methods shows the efficiency of our method. (C) 2019 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.

关键词： One-dimensional time-fractional Burgers equations Implicit difference scheme L-1-discretization formula Stability and convergence algorithm implementation

来源：评论

学校读者我要写书评

暂无评论

Mathematical Foundation of a Functional implementation of the CNF algorithm

引用

algorithmS 2023年第10期16卷 459-459页

作者： Garcia-Olmedo, Francisco Miguel Garcia-Miranda, Jesus Gonzalez-Rodelas, Pedro Univ Granada Dept Algebra E-18071 Granada Spain Univ Granada Dept Matemat Aplicada E-18071 Granada Spain

The conjunctive normal form (CNF) algorithm is one of the best known and most widely used algorithms in classical logic and its applications. In its algebraic approach, it makes use in a loop of a certain well-defined operation related to the "distributivity" of logical disjunction versus conjunction. For those types of implementations, the loop iteration runs a comparison between formulas to decide when to stop. In this article, we explain how to pre-calculate the exact number of loop iterations, thus avoiding the work involved in the above-mentioned comparison. After that, it is possible to concatenate another loop focused now on the "associativity" of conjunction and disjunction. Also for that loop, we explain how to calculate the optimal number of rounds, so that the decisional comparison phase for stopping can be also avoided.

关键词： CNF SAT problem classical logic Boolean algebra Horn clauses reverse engineering automatic theorems proving algorithm implementation functional programming Haskell

来源：评论

学校读者我要写书评

暂无评论

A derivative-free root-finding algorithm using exponential method and its implementation

引用

BMC RESEARCH NOTES 2023年第1期16卷 276-276页

作者： Thota, Srinivasarao Awad, Mohamed M. Shanmugasundaram, P. Rathour, Laxmi Amrita Vishwa Vidyapeetham Amrita Sch Phys Sci Dept Math Amaravati 522503 Andhra Pradesh India Mansoura Univ Fac Engn Mech Power Engn Dept Mansoura 35516 Egypt Mizan Tepi Univ Coll Nat & Computat Sci Dept Math Mizan Teferi Ethiopia Natl Inst Technol Dept Math Aizawl 796012 Mizoram India

Objective In this paper, we develop a new root-finding algorithm to solve the given non-linear equations. The proposed root-finding algorithm is based on the exponential method. This algorithm is derivative-free and converges *** Several numerical examples are presented to illustrate and validation of the proposed methods. Microsoft Excel and Maple implementation of the proposed algorithm is presented with sample computations.

关键词： Iterative algorithms Nonlinear equations Exponential method algorithm implementation Root-finding algorithms 65Hxx

来源：评论

学校读者我要写书评

暂无评论

Physics-informed neural networks for parameter estimation and simulation of a two-group epidemiological model

引用

INTERNATIONAL JOURNAL OF MODELING SIMULATION AND SCIENTIFIC COMPUTING 2024年第3期15卷

作者： Ouyoussef, Kawtar Idhammou El Karkri, Jaafar Tine, Leon Matar Aboulaich, Rajae Mohammed V Univ Rabat Mohammadia Sch Engn LERMA Lab Rabat Morocco Univ Lyon Inria F-69100 Villeurbanne France Univ Claude Bernard Lyon 1 Inst Camille Jordan CNRS UMR5208 F-69603 Villeurbanne France

This paper provides a comprehensive exploration of physics-informed neural networks and their core features. It delves into their role in tackling inverse problems inherent in ordinary differential equation-based models. Within this context, we introduce a two-group epidemiological model, elucidating its fundamental attributes. The central objective of this research is to accurately estimate the model parameters for both groups in the epidemiological model. We offer a detailed exposition of the adopted methodology, providing insights into the algorithm and the techniques employed for its implementation. Through this analysis, we illuminate the complexities of our study, contributing to the growing body of knowledge in this field, which intersects epidemiology and neural network-based parameter estimation for an enriched understanding of infectious disease dynamics.

关键词： Epidemiological model physics-informed neural networks ordinary differential equations parameters estimation algorithm implementation infectious disease dynamics

来源：评论

学校读者我要写书评

暂无评论

Real-Time Prediction of Acute Kidney Injury in Hospitalized Adults: implementation and Proof of Concept

引用

AMERICAN JOURNAL OF KIDNEY DISEASES 2020年第6期76卷 806-+页

作者： Ugwuowo, Ugochukwu Yamamoto, Yu Arora, Tanima Saran, Ishan Partridge, Caitlin Biswas, Aditya Martin, Melissa Moledina, Dennis G. Greenberg, Jason H. Simonov, Michael Mansour, Sherry G. Testani, Jeffrey M. Rao, Veena Rentfro, Keith Obeid, Wassim Parikh, Chirag R. Wilson, F. Perry Yale Univ Sch Med Dept Med Sect Nephrol New Haven CT 06510 USA Yale Univ Sch Med Clin & Translat Res Accelerator New Haven CT USA Emory Univ Dept Phys Atlanta GA 30322 USA Yale Univ Sch Med Joint Data Analyt Team New Haven CT USA Yale Univ Sch Med Dept Pediat New Haven CT 06510 USA Univ Texas El Paso Dept Mech Engn El Paso TX 79968 USA Yale Univ Sch Med Dept Internal Med Sect Cardiol New Haven CT 06510 USA Johns Hopkins Univ Sch Med Baltimore MD USA Johns Hopkins Med Dept Med Div Nephrol Baltimore MD USA

Rationale & Objective: Acute kidney injury (AKI) is diagnosed based on changes in serum creatinine concentration, a late marker of this syndrome. algorithms that predict elevated risk for AKI are of great interest, but no studies have incorporated such an algorithm into the electronic health record to assist with clinical care. We describe the experience of implementing such an algorithm. Study Design: Prospective observational cohort study. Setting & Participants: 2,856 hospitalized adults in a single urban tertiary-care hospital with an algorithm-predicted risk for AKI in the next 24 hours >15%. Alerts were also used to target a convenience sample of 100 patients for measurement of 16 urine and 6 blood biomarkers. Exposure: Clinical characteristics at the time of pre-AK I alert. Outcome: AKI within 24 hours of pre-AK I alert (AKI(24)). Analytical Approach: Descriptive statistics and univariable associations. Results: At enrollment, mean predicted probability of AKI(24) was 19.1%;18.9% of patients went on to develop AKI(24). Outcomes were generally poor among this population, with 29% inpatient mortality among those who developed AKI(24) and 14% among those who did not (P < 0.001). Systolic blood pressure 100 mm Hg (28% of patients with AKI(24) vs 18% without), heart rate 100 beats/min (32% of patients with AKI(24) vs 24% without), and oxygen saturation < 92% (15% of patients with AKI(24) vs 6% without) were all more common among those who developed AKI(24). Of all biomarkers measured, only hyaline casts on urine microscopy (72% of patients with AKI(24) vs 25% without) and fractional excretion of urea nitrogen (20% [IQR, 12%-36%] among patients with AKI(24) vs 34% [IQR, 25%-44%] without) differed between those who did and did not develop AKI(24). Limitations: Single-center study, reliance on serum creatinine level for AKI diagnosis, small number of patients undergoing biomarker evaluation. Conclusions: A real-time AKI risk model was successfully integrated into the

关键词： Acute kidney injury (AKI) prediction prospective biomarker assessment algorithm implementation AKI risk hospitalized patients electronic health record (EHR) prognostic model serum creatinine (Scr) inpatient mortality renal function trajectory kidney injury marker [TIMP-2] × [IGFBP-7] NGAL KIM-1 IL-18 MCP-1

来源：评论

学校读者我要写书评

暂无评论

Simplifying Signaling Pathway Reconstruction with Containerized Random Walk algorithms 2024

Simplifying Signaling Pathway Reconstruction with Containeri...

引用

Proceedings of the 55th ACM Technical Symposium on Computer Science Education V. 2

作者： Yancheng Liu Anna Ritz Reed College Portland OR USA

ISBN: (纸本)9798400704246

Protein interactions and cellular responses are fundamental pillars of molecular systems biology. Decoding these complex signaling pathways requires advanced computational methods. One promising direction of algorithm development is using graph algorithms to identify proteins involved in signaling pathways. Despite the availability of tools, many researchers grapple with software and user experience constraints. In response, we have developed the Signaling Pathway Reconstruction Analysis Streamliner (SPRAS), a robust containerized framework that enables users to easily reconstruct signaling pathways by connecting proteins of interest within molecular interaction networks. It seamlessly integrates graph algorithms designed for pathway reconstruction with downstream visualization and clustering analysis. We contribute and integrate three random-walk-based algorithms to SPRAS, including one algorithm we developed for large networks and two other algorithms that appear in the literature. Random walk approaches have been highly successful in predicting candidate proteins involved in a signaling pathway, and integrating them into SPRAS will greatly expand the framework's ability for pathway reconstruction. We illustrate their importance by using the random walk algorithms now available in SPRAS to explore potential proteins involved in cell-cell fusion in flies. In our computational experiments, five fly proteins appeared in multiple reconstructed pathways, suggesting a potential role for them in cell-cell fusion. With the addition of these new algorithms, SPRAS will become an essential tool for unraveling the mysteries of biological interactions.

关键词： algorithm implementation algorithm integration benchmarking computational methods docker downstream analysis pathway reconstruction protein-protein interactions systems biology

来源：评论

学校读者我要写书评

暂无评论

A method for improving the efficiency of FIR filter operation 22

A method for improving the efficiency of FIR filter operatio...

引用

Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering

作者： Yunhui Wang Li Zhou Yu Sun Yi Feng 8 Department Xi45an Aerospace Precision Electromechanical Institute China

ISBN: (纸本)9781450397148

When the software realizes the FIR filter, it usually carries on the cyclic shift to the multiple input data according to the FIR filtering formula. After the completion of the shift, it can get the filtering result by multiplying with the FIR parameters. The higher the filtering order, the more the filtering channels, the longer the software running time will be consumed. In order to save software running time, this paper proposes a software implementation method which called copying the filter parameters. The FIR parameters are copied once, and only the latest input data is assigned in the operation process. It can directly multiply the data and parameters to get the filtering result, so as to save the software running time.

关键词： FIR (Finite Impulse Response) filter high efficiency algorithm implementation

来源：评论

学校读者我要写书评

暂无评论

Autonomous Data-Driven Integration into ERP Systems 4th

Autonomous Data-Driven Integration into ERP Systems

引用

4th International Conference on Design, Simulation, Manufacturing: The Innovation Exchange, DSMIE 2021

作者： Peksa, Janis Riga Technical University 1 Kalku Street Riga1658 Latvia

ISBN: (纸本)9783030777180

The following article makes a case study with an SAP ERP system, which integrates with an external Web Service using API access. algorithm implementation is demonstrated with all transactions used in SAP ERP. However, it should be noted that a limited version of SAP ERP S/4HANA version release 2.00.044. It was pointing to the capabilities test between the external system and the ERP system. During the experiment, the ABAP programming language and the built-in SAP ERP background job are used and configured as needed. The received data is stored in the SAP ERP data warehouse, modified to save the new data. The main result is to provide integration capabilities. Utility to use the Web Service and the ERP system’s integration technique to enable the capability’s regular use. The experiment shows that the SAP ERP system can be integrated from an external source and store data to improve future business processes and increase its business values. The approach allows for the development of future frameworks and the expansion of ERP systems between external systems. © 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： algorithm implementation Enterprise resource planning systems

来源：评论

学校读者我要写书评

暂无评论

Compressed Principal Component Regression (C-PCR) algorithm and FPGA Validation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2020年第12期67卷 3512-3516页

作者： Zamani, Hossein Bahrami, Hamid Reza Garris, Paul A. Mohseni, Pedram Case Western Reserve Univ Elect Comp & Syst Engn Dept Cleveland OH 44106 USA Univ Akron Elect & Comp Engn Dept Akron OH 44325 USA Illinois State Univ Sch Biol Sci Normal IL 61790 USA

To address the hardware and/or software implementation issues of principal component regression (PCR), we propose a novel algorithm called compressed PCR (C-PCR). C-PCR projects the input data to a lower dimensional space first, and then applies the compressed data to a significantly smaller PCR engine. We show that C-PCR can lower the computational complexity of PCR with a factor of compression ratio (CR) squared, i.e., CR2. Moreover, the output signal of C-PCR follows that of PCR with a small error, which increases with CR, when the projections are random. Using datasets of prerecorded brain neurochemicals, we experimentally show that C-PCR can achieve CRs as high as similar to 10. As far as hardware implementation is concerned, the experimental results show that reduction rates of 32% to 45% in different FPGA resources can be achieved using C-PCR.

关键词： Manganese Training Computational complexity Image coding Hardware Circuits and systems Signal processing algorithms algorithm implementation compressed learning compressive sensing principal component regression

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：