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

7th IET Smart Cities Symposium, SCS 2023

作者： Aljanabi, Mohammad Omran, Alaa Hamza Mijwil, Maad M. Abotaleb, Mostafa El-Kenawy, El-Sayed M. Mohammed, Sahar Yousif Ibrahim, Abdelhameed Department of computer College of Education Aliarqai university Baghdad Iraq University of information technology and communications Baghdad Iraq Computer Techniques Engineering Department Baghdad College of Economic Sciences University Baghdad Iraq Department of System Programming South Ural State University Chelyabinsk Russia Department of Communications and Electronics Delta Higher Institute of Engineering and Technology Egypt Computer Science Department Computer Science &Information Technology College Anbar University Anbar Iraq Computer Engineering and Control Systems Department Faculty of Engineering Mansoura University Mansoura Egypt

ISBN: (纸本)9781839539831

Data poisoning attacks, where adversaries manipulate training data to degrade model performance, are an emerging threat as machine learning becomes widely deployed in sensitive applications. This paper provides a comprehensive overview of data poisoning including attack techniques, adversary incentives, impacts on security and reliability, detection methods, defenses, and key research gaps. We examine label flipping, instance injection, backdoors, and other attack categories that enable malicious outcomes ranging from IP theft to accidents in autonomous systems. Promising detection approaches include statistical tests, robust learning, and forensics. However, significant challenges remain in translating academic defenses like adversarial training and sanitization into practical tools ready for operational use. With safety and trustworthiness at stake, more research on benchmarking evaluations, adaptive attacks, fundamental tradeoffs, and real-world deployment of defenses is urgently needed. Understanding vulnerabilities and developing resilient machine learning pipelines will only grow in importance as data integrity is fundamental to developing safe artificial intelligence. © The Institution of Engineering & Technology 2023.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Application of Interval Type-2 Fuzzy Logic to polypropylene business policy in a petrochemical plant in India

引用

Journal of the Saudi Society of Agricultural sciences 2018年第1期17卷 24-42页

作者： Jana, Dipak Kumar Castillo, Oscar Pramanik, Sutapa Maiti, Manoranjan Department of Engineering Science Haldia Institute of Technology Haldia Purba Midnapur 721 657 West Bengal India Tijuana Institute of Technology Tijuana Mexico Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721 102 West Bengal India

This paper presents a new approach to predict the quality of polypropylene in petrochemical plants. The proposed approach constructs four different models, based on a large number of data collected from a renowned petrochemical plant in India and uses it to predict the polypropylene quality. The quality of polypropylene depends on the indices such as melt flow index and the xylene solubility of the product and the parameters controlling these two indices are hydrogen flow, donor flow, pressure and temperature of polymerization reactors. Mamdani Interval Type-2 Fuzzy Logic inference systems are formed for first time. The model outcomes are compared with the collected plant data and a sequence of sensitivity analysis elects the most suitable model from them. Some sensitivity analyses are provided using Fuzzy C-Means Clustering to the models. © 2015 The Authors

关键词： Fuzzy C-Means Clustering Fuzzy inference system Interval Type-2 Fuzzy Logic Polypropylene Product quality

来源：评论

学校读者我要写书评

暂无评论

Design and test of distributed applications

Design and test of distributed applications

引用

International Conference on Software Engineering (ICSE)

作者： J. Fagerstrom Programming Environments Laboratory Department of Computer and Information Science Linköping University Sweden

ISBN: (纸本)0897912586

The author presents a paradigm and system that will support a programmer who is designing, programming, and testing a distributed application. The main point is that the structure introduced by the paradigm must be kept and used during design, programming, and testing. One is not helped by a programming method which introduces a structure just to break it down again. A structural model has been developed which is based on common structures in distributed systems. This model is used to describe the logical relationships between components in a system. It is also integrated into the programming environment.< >

关键词： programming environments programming profession System testing Debugging Application software Timing Documentation Encapsulation Distributed computing Information science

来源：评论

学校读者我要写书评

暂无评论

A generative approach for user-centered, collaborative, domain-specific modeling environments

arXiv

引用

arXiv 2021年

作者： Zweiho, Philip Steffen, Bernhard Programming Systems Department of Computer Science Tu Dortmund University Dortmund44227 Germany

The use of low- and no-code modeling tools is today an established way in practice to give non- programmers an opportunity to master their digital challenges independently, using the means of model- driven software development. However, the existing tools are limited to a very small number of different domains such as mobile app development, which can be attributed to the enormous demands that a user has on such a tool today. These demands exceed the mere use of a modeling environment as such and require crosscutting concerns such as: easy access, direct usability and simultaneous collaboration, which result in additional effort in the realization of such tools. Our solution is based on the idea to support and simplify the creation of new domain-specific holistic tools by generating it entirely based on a declarative specification with a domain-specific meta-tool. The meta-tool Pyro demonstrated and analyzed here focuses on graph-based graphical languages to fully generate a complete, directly executable tool starting from a meta-model in order to meet all cross-cutting requirements. Copyright © 2021, The Authors. All rights reserved.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

MAPA: An Automatic Memory Access Pattern Analyzer for GPU Applications

引用

ACM SIGPLAN Notices 2017年第8期52卷 443-444页

作者： Jo, Gangwon Jung, Jaehoon Park, Jiyoung Lee, Jaejin Center for Manycore Programming Department of Computer Science and Engineering Seoul National University Seoul08826 Korea Republic of

Various existing optimization and memory consistency management techniques for GPU applications rely on memory access patterns of kernels. However, they suffer from poor practicality because they require explicit user interventions to extract kernel memory access patterns. This paper proposes an automatic memory-access-pattern analysis framework called MAPA. MAPA is based on a source-level analysis technique derived from traditional symbolic analyses and a run-time pattern selection technique. The experimental results show that MAPA properly analyzes 116 real-world OpenCL kernels from Rodinia and Parboil. © 2017 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

CHIP in plain logic

CHIP in plain logic

引用

IEEE Pacific Rim Conference on Communications, computers and Signal Processing

作者： M.R. Levy M.H. van Emden Logic Programming Laboratory Department of Computer Science University of Victoria Victoria BC Canada

The programming language Prolog allows succinct representation of a wide variety of scheduling problems. To speed up execution, a new version called CHIP (Constraint Handling In Prolog) was introduced that maintains the programming advantages of Prolog. CHIP achieves its speed by keeping track of the sets of possible values for each variable. In this way, a search can be abandoned as soon as any such set becomes empty. This mechanism is made part of the unification algorithm. CHIP maintains the conventional orientation of logic towards single values. Thus, an awkward theoretical structure results from interfacing with set orientation in unification. This problem is solved by using a set-orientation for the entire logic.< >

关键词： Logic programming computer languages Job shop scheduling Laboratories computer science Processor scheduling Assembly Hospitals Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Annotation support for generic patches

Annotation support for generic patches

引用

International Workshop on Recommendation Systems for Software Engineering (RSSE)

作者： Georg Dotzler Ronald Veldema Michael Philippsen Computer Science Department Programming Systems Group University of Erlangen-Nuremberg Erlangen Germany

In large projects parallelization of existing programs or refactoring of source code is time consuming as well as error-prone and would benefit from tool support. However, existing automatic transformation systems are not extensively used because they either require tedious definitions of source code transformations or they lack general adaptability. In our approach, a programmer changes code inside a project, resulting in before and after source code versions. The difference (the generated transformation) is stored in a database. When presented with some arbitrary code, our tool mines the database to determine which of the generalized transformations possibly apply. Our system is different from a pure compiler based (semantics preserving) approach as we only suggest code modifications. Our contribution is a set of generalizing annotations that we have found by analyzing recurring patterns in open source projects. We show the usability of our system and the annotations by finding matches and applying generated transformations in real-world applications.

关键词： Benchmark testing Pattern matching Databases Generators Java Semantics

来源：评论

学校读者我要写书评

暂无评论

The use of a Reasoning process to solve the almost SLAM Challenge at the Robocup legged league

The use of a Reasoning process to solve the almost SLAM Chal...

引用

8th Catalan Conference on Artificial Intelligence, CCIA 2005

作者： Monferrer, M. Teresa Escrig Broch, Juan Carlos Peris Jaume I University Engineering and Computer Science Department Campus Riu Sec CastellónE-12071 Spain Jaume I University Programming Languages and Computer Systems Department Campus Riu Sec CastellónE-12071 Spain

ISBN: (纸本)1586035606

The problem that a robot navigates autonomously through its environment, builds its own map and localizes itself in the map (known a the SLAM problem), is still an open problem. Most of the approaches to solve the SLAM problem divide the space into regions and compute the probability that the robot is in each region. We propose in this paper a different solution based on the use of a reasoning process to build the map, which will provide the following advantages: (1) we will store in the map hybrid (qualitative + quantitative) information from landmarks. Qualitative representation will allow us the management of the uncertainty information provided by the robot sensors;and (2) we will store in the map relative information of the landmarks which appear in the environment, therefore the map will be independent of the point of view of the robot. Moreover, we are going to use a reasoning process which will allow us to solve three very important problems in robotics: (a) where the robot is;(b) which is the orientation of the map where the robot is;and (c) towards where the robot should go according to the map to follow a plan. © 2005 The authors. All rights reserved.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Object Support for OpenMP-style programming of GPU Clusters in Java

Object Support for OpenMP-style Programming of GPU Clusters ...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Carolin Wolf Georg Dotzler Ronald Veldema Michael Philippsen Computer Science Department Programming Systems Group University of Erlangen-Nuremberg Erlangen Germany

ISBN: (纸本)9781467362399

For scientists, it is advantageous to use a high level of abstraction for programming their simulations, so that they can focus on the problem at hand instead of struggling with low-level details. However, current HPC clusters with multiple GPUs per node only offer explicit communication to and from the GPUs, require manual work to keep the data consistent, and often need explicit kernel programming. Moreover, known GPU programming frameworks are limited to a single GPU or a single machine and also rarely support objects. Our system removes the above restrictions. With a slight but necessary change in Java's semantics, we achieve automatic distribution and efficient use of objects and arrays of objects on multiple GPUs in a cluster. On benchmarks that distribute arrays of objects over five machines with 10 GPUs, we achieve speedups of up to 4.9 compared to one node.

关键词： Arrays Java Graphics processing units Kernel programming Vectors Middleware

来源：评论

学校读者我要写书评

暂无评论

Synchronous composition of quasi-complete and quasi-deterministic FSMs

Synchronous composition of quasi-complete and quasi-determin...

引用

International Conference on Actual Problems of Systems and Software Engineering

作者： Igor Burdonov Alexandr Kossachev Nina Yevtushenko Tiziano Villa Software Engineering department Ivannikov Institute for System Programming of RAS Software engineering deparment Ivannikov Institute for System Programming Computer Science Department University of Verona

ISBN: (纸本)9781728160627

In this paper, we consider the synchronous composition of Finite State Machines (FSMs) that corresponds to instantaneous communication of hardware components. Such FSMs can be deterministic or nondeterministic, partial or complete. We first extend the existing synchronous composition operator from a pair of components to a collection of components with multiple input and output ports, and provide a procedure to compute the composition working directly on the collection of transition tables of the component FSMs. Then, based on the notion of input-output Moore pair (the output is not sensitive to the input), we prove the following sufficient condition: if the composition has the property that every cycle of ports has a component with a Moore pair, then the class of quasi-complete and quasi-deterministic FSMs is closed under the proposed synchronous composition.

关键词： Finite state machine (FSM) Quasi-deterministic FSM Quasi-complete FSM Moore pair Synchronous composition Pairing multi-input output ports harbors finite state machines deterministic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：