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

IEEE International Symposium on Information Theory

作者： Francis N. Castro Ivelisse Rubio Hugues Randriam Oscar Moreno H. F. Mattson Department of Mathematics University of Puerto Rico Río Piedras Puerto Rico Department of Mathematics University of Puerto Rico Humacao Puerto Rico Ecole nationale supérieure des télécommunications Paris France Electrical Engineering and Computer Science Syracuse University CST 2-179 Syracuse New York

ISBN: (纸本)142440505X

In this paper we present an algorithmic approach to the problem of the divisibility of the number of solutions to a system of polynomial equations. Using this method we prove that all binary cyclic codes with two zeros over F 2f and minimum distance 5 are quasi-perfect for f les 10. We also present elementary proofs of divisibility results that, in some cases, improve previous results

关键词： Equations Mathematics Computer science Polynomials Galois fields Cryptography integer linear programming Error correction codes

来源：评论

学校读者我要写书评

暂无评论

A Computation of Time Management System in FTC System and Creating Strategy

A Computation of Time Management System in FTC System and Cr...

引用

Advance Computing and Innovative Technologies in Engineering (ICACITE), International Conference on

作者： M. Vikram S. Kaliappan A. Sasireka B. Prasad Baydaa Sh. Z. Abood Ban Sefeer Department of CSE Sri Venkateswara College of Engineering Tirupati Andhra Pradesh Department of Electrical and Electronics Engineering Kumaraguru College of Technology Saravanampatti Coimbatore Department of Mathematics PSNA College of Engineering and Technology (Autonomous) Dindigul Tamil Nadu India Dept of Electronics and Communication Engineering Sona College of Technology Salem College of Health and Medical Technology National University of Science and Technology Dhi Qar Iraq Al-Farahidi university Baghdad Iraq

ISBN: (数字)9798350360165

ISBN: (纸本)9798350360172

Using a use-case approach, we go into the specific ontology development, adding semantic rules to enhance its formulation and resolution. Our methodology seeks to capture the heterogeneity, variety, and complexity of data, as data itself provides these attributes. This explains why the different Big Data analytics difficulties are adaptable and scalable in a wide range of scenarios. By implementing this approach, we pave the way for the healthcare sector and beyond to use big data more effectively, improving patient outcomes through informed decision-making. This paper introduces a novel method for solving these problems: dynamics-based integer linear programming. By effectively allocating resources from dark computing to IoT devices, this method seeks to optimise workflow. It also aims to reduce stress associated with limited stealth resource containment by accelerating time-sensitive workflows and solving the termination problem as an integer linear programming (ILP) problem. Suggested With its task-first structure, the theory lowers fog node power consumption and delays in the environment by taking into account dynamic activities of greater quality. The trials’ findings demonstrate that, in terms of energy usage and service latency, the suggested strategy performs better than the experimental approaches.

关键词： Power demand Semantics Medical services integer linear programming Big Data Ontologies Delays

来源：评论

学校读者我要写书评

暂无评论

Modeling of Multimolecular Complexes

Modeling of Multimolecular Complexes

引用

作者： Dina Schneidman-Duhovny Haim J. Wolfson

Macromolecular complexes play a key role in cellular function. Predicting the structure and dynamics of these complexes is one of the key challenges in structural biology. Docking applications have traditionally been used to predict pairwise interactions between proteins. However, few methods exist for modeling multi-protein assemblies. Here we present two methods, CombDock and DockStar, that can predict multi-protein assemblies starting from subunit structural models. CombDock can assemble subunits without any assumptions about the pairwise interactions between subunits, while DockStar relies on the interaction graph or, alternatively, a homology model or a cryo-electron microscopy (EM) density map of the entire complex. We demonstrate the two methods using RNA polymerase II with 12 subunits and TRiC/CCT chaperonin with 16 subunits. less

关键词： Cross-linking Mass Spectrometry Cryo-EM Cross-linking Mass Spectrometry DNA Transcription Macromolecular assembly Subunit assembly Protein complexes Protein-protein docking integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Compact formulations and valid inequalities for parallel machine scheduling with conflicts

arXiv

引用

arXiv 2023年

作者： Moura, Phablo F.S. Leus, Roel Yaman, Hande Research Center for Operations Research & Statistics KU Leuven Belgium

The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same machine, and the maximum processing time among all machines is minimized. We propose a new compact mixed integer linear formulation based on the representatives model for the vertex coloring problem, which overcomes a number of issues inherent in the natural assignment model. We present a polyhedral study of the associated polytope, and describe classes of valid inequalities inherited from the stable set polytope. We describe branch-and-cut algorithms for the problem, and report on computational experiments with benchmark instances. Our computational results on the hardest instances of the benchmark set show that the proposed algorithms are superior (either in running time or quality of the solutions) to the current state-of-the-art methods. We find that our new method performs better than the existing ones especially when the gap between the optimal value and the trivial lower bound (i.e., the sum of all processing times divided by the number of machines) *** Codes 90Cxx © 2023, CC BY.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Data Compression for Multi-Level Cell (MLC) Flash Memory 07

Energy-Aware Data Compression for Multi-Level Cell (MLC) Fla...

引用

Design Automation Conference

作者： Yongsoo Joo Youngjin Cho Donghwa Shin Naehyuck Chang Seoul National University South Korea

ISBN: (纸本)9781595936271

We discover significant value-dependent programming energy variations in multi-level cell (MLC) flash memories, and introduce an energy-aware data compression method that minimizes the flash programming energy rather than the size of the compressed data. We express energy-aware data compression as an entropy coding with unequal bit-pattern costs. Deploying a probabilistic approach, we derive the energy-optimal bit-pattern probabilities and the expected values of the bit-pattern costs for the large amounts of compressed data which are typical in multimedia applications. Then we develop an energy-optimal prefix coding that uses integer linear programming, and construct a prefix code table. From a consideration of Pareto-optimal energy consumption, we make tradeoffs between data size and programming energy, such as a 35% energy saving for a 50% area overhead.

关键词： Data compression Flash memory Permission Energy consumption Cost function Entropy coding integer linear programming Energy measurement Nonvolatile memory Threshold voltage

来源：评论

学校读者我要写书评

暂无评论

Multi-Target Tracking with Dependent Likelihood Structures in Labeled Random Finite Set Filters

Multi-Target Tracking with Dependent Likelihood Structures i...

引用

International Conference on Information Fusion

作者： Lingji Chen Motional Boston USA

ISBN: (纸本)9781665414272

In multi-target tracking, a data association hypothesis assigns measurements to tracks, and the hypothesis likelihood (of the joint target-measurement associations) is used to compare among all hypotheses for truncation under a finite compute budget. It is often assumed however that an individual target-measurement association likelihood is independent of others, i.e., it remains the same in whichever hypothesis it belongs to. In the case of Track Oriented Multiple Hypothesis Tracking (TO-MHT), this leads to a parsimonious representation of the hypothesis space, with a maximum a posteriori solution obtained through solving an integer linear programming problem. In Labeled Random Finite Set (Labeled RFS) filters, this leads to an efficient way of obtaining the top ranked hypotheses through solving a ranked assignment problem using Murty’s algorithm. In this paper we present a Propose and Verify approach for certain Dependent Likelihood Structures, such that the true hypothesis likelihood is evaluated jointly for the constituent track-measurement associations to account for dependence among them, but at the same time that ranking is still obtained efficiently. This is achieved by proposing a candidate ranking under an assumption of independence, and then evaluating the true likelihood one by one, which is guaranteed, for certain Dependent Likelihood Structures, to not increase from its candidate value, until the desired number of top ranked hypotheses are obtained. Examples of such Dependent Likelihood Structures include the Collision Likelihood Structure and the Occlusion Likelihood Structure, both encountered frequently in applications.

关键词： Weight measurement Radio frequency Target tracking Conferences integer linear programming Filtering algorithms Tools

来源：评论

学校读者我要写书评

暂无评论

An efficient placement and routing technique for fault-tolerant distributed embedded computing

An efficient placement and routing technique for fault-toler...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： R. Jafari F. Dabiri M. Sarrafzadeh Computer Science Department University of California Los Angeles CA USA

This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. The driver application that we present is a medical jacket which requires an extremely high level of robustness and fault tolerance. The power consumption of such jacket is another key technological constraint. Our proposed interconnection network is a mesh of wires. A jacket made of fabric and wires would be susceptible to accidental damage via tears. By modeling the tears, we evaluate the probability of having failures on every segment of wires in our mesh interconnection network. Then we study two problems of placement and routing in the sensor networks such that the fault tolerance is maximized while the power consumption is minimized. We develop efficient integer linear programming (ILP) formulations to address these problems and perform both placement and routing simultaneously. This ensures that the solution is a lower bound for both problems. We evaluate the effectiveness of our proposed techniques on a variety of benchmarks.

关键词： Routing Fault tolerance Embedded computing Wires Energy consumption Multiprocessor interconnection networks Actuators Robustness Fabrics integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Integrating Random Forest Prediction for Energy Optimization in Solar-Powered Environmental Monitoring

Integrating Random Forest Prediction for Energy Optimization...

引用

International Symposium on Object-Oriented Real-Time Distributed Computing

作者： Ahmed Bali Pierre-Emmanuel Hladik Horace Gandji Abdelouahed Gherbi Mohamed Cheriet École de Technologie Supérieure Montreal Canada Nantes Université École Centrale Nantes CNRS LS2N UMR 6004 Nantes France

ISBN: (数字)9798350371284

ISBN: (纸本)9798350371291

In light of the essential need for persistent, real-time monitoring of natural environments, our research introduces an innovative approach that integrates a predictive solar energy model in optimizing solar-powered environmental monitoring efficiency with energy constraints. We address the challenge of solar energy variability by forecasting solar energy availability based on the Random Forest model. Then, we integrate the prediction ability into the integer linear Program optimization framework of the monitoring efficiency subjected to energy constraints. Experimental results demonstrate our approach’s effectiveness compared to traditional methods, underscoring its potential for enhancing sensor networks’ sustainability and operational efficiency in natural environments.

关键词： Learning systems Radio frequency Metaheuristics Solar energy Predictive models integer linear programming Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Modeling out-of-order processors for software timing analysis

Modeling out-of-order processors for software timing analysi...

引用

Real-Time Systems Symposium (RTSS)

作者： Xianfeng Li A. Roychoudhury T. Mitra School of Computing National University of Singapore Singapore

Estimating the worst case execution time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typically model the timing effects of microarchitectural features in modern processors (such as the pipeline, caches, branch prediction, etc.) to obtain safe but tight estimates. In this paper, we model out-of-order processor pipelines for WCET analysis. This analysis is, in general, difficult even for a basic block (a sequence of instructions with single-entry and single-exit points) if some of the instructions have variable latencies. This is because the WCET of a basic block on out-of-order pipelines cannot be obtained by assuming maximum latencies of the individual instructions. Our timing estimation technique for a basic block is inspired by an existing performance analysis technique for tasks with data dependencies and resource contentions in real-time distributed systems. We extend our analysis by modeling the interaction among consecutive basic blocks as well as the effect of instruction cache. Finally, we employ integer linear programming (ILP) to compute the WCET of an entire program. The accuracy of our analysis is demonstrated via tight estimates obtained for several benchmarks.

关键词： Out of order Timing Pipelines Real time systems Delay Processor scheduling Predictive models Microarchitecture Performance analysis integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Accurate timing analysis by modeling caches, speculation and their interaction 03

Accurate timing analysis by modeling caches, speculation and...

引用

Design Automation Conference

作者： Xianfeng Li T. Mitra A. Roychoudhury School of Computing National University of Singapore Singapore

ISBN: (纸本)9781581136883

Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysis, but also modeling the effects of complex micro-architectural features in modern processors. Speculative execution and caching are very common in current processors. Hence one needs to model the effects of these features on the Worst Case Execution (WCET) of a program. Even though the individual effects of these features have been studied recently, their combined effects have not been investigated. We do so in this paper. This is a non-trivial task because speculative execution can indirectly affect cache performance (e.g., speculatively executed blocks can cause additional cache misses). Our technique starts from the control flow graph of the embedded program, and uses integer linear programming to estimate the program's WCET. The accuracy of our modeling is illustrated by tight estimates obtained on realistic benchmarks.

关键词： Timing Prefetching Embedded system Embedded computing Embedded software integer linear programming Permission Predictive models Pipelines Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：