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

IEEE International Symposium on Quality Electronic Design

作者： Garima Thakral Saraju P. Mohanty Dhruva Ghai Dhiraj K. Pradhan Department of Computer Science and Engineering University of North Texas USA Department of Computer Science University of Bristol UK

ISBN: (纸本)9781424464548

In this paper, a novel design flow is presented for simultaneous P3 (power minimization, performance maximization and process variation tolerance) optimization of nano-CMOS circuits. For demonstration of the effectiveness of the flow, a 45nm single-ended 7-transistor SRAM is used as example circuit. The SRAM cell is subjected to a dual-V Th assignment based on a novel statistical Design of Experiments-integer linear programming (DOE-ILP) approach. Experimental results show 44.2% power reduction (including leakage) and 43.9% increase in the read static noise margin compared to the baseline design. The process variation analysis of the optimized cell is carried out considering the variability effect in 12 device parameters. A 8 × 8 array is constructed to show the feasibility of the proposed SRAM cell. To the best of the authors' knowledge, this is the first study which makes use of statistical Design of Experiments and integer linear programming for optimization of conflicting targets of stability, power in the presence of process variations in an SRAM cell.

关键词： Random access memory Design optimization CMOS technology Threshold voltage DH-HEMTs Computer science Circuit noise integer linear programming Stability SRAM chips

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of modular mappings

Automatic generation of modular mappings

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： H.-J. Lee J.A.B. Fortes School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Modular mappings have been recently proposed for optimization of algorithms that cannot be efficiently mapped by affine mappings. This paper addresses the problem of generating modular mappings that satisfy conditions for validity and optimality. In general, this is a difficult problem due to the presence of non-linear constraints. Hence, a method of O(n/sup 2/) complexity is provided to assign values to some entries of a transformation matrix so that non-linear constraints are transformed into linear ones, where n is the dimension of a computation domain. The proposed heuristic attempts to reduce the number of value-assigned entries and exclude as few solutions as possible. This paper also considers the issue of deriving the inverse transformation of a given modular mapping. It identifies a class of modular functions whose inverses result directly from computing the inverse of the (coefficient) matrix used to specify a modular mapping. An efficient method of O(n/sup 2/) complexity is provided to formulate the problem of generating such modular mappings as an integer linear programming problem.

关键词： integer linear programming Design optimization Optimizing compilers Program processors Systolic arrays Vectors Processor scheduling Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Extractive Document Summarization Using a Supervised Learning Approach

Extractive Document Summarization Using a Supervised Learnin...

引用

IEEE Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER)

作者： Sangaraju Charitha Nagaratna B. Chittaragi Shashidhar G. Koolagudi Department of CSE National Institute of Technology Karnataka (NITK) Surathkal India - 575025

ISBN: (纸本)9781538653241;9781538653234

In this paper, we present a model for extractive multi-document text summarization using a supervised learning approach. The model uses a convolutional neural networks (CNN) which is capable of learning sentence features on its own for sentence ranking. This approach has been used in order to avoid the overhead of extracting features from sentences manually. integer linear programming (ILP) approach has been adopted for selecting sentences to generate the summary based on sentence ranks. This ILP model minimizes the redundancy in the generated summary. We have evaluated our proposed approach on the DUC 2007 dataset and its performance is found to be competitive or better in comparison with state-of-the-art systems.

关键词： Feature extraction Computational modeling Convolution Deep learning Markov processes Supervised learning integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Factorization in rings of integer-valued rational functions

arXiv

引用

arXiv 2023年

作者： Liu, Baian

For a domain D, the ring Int(D) of integer-valued polynomials over D is atomic if D satisfies the ascending chain condition on principal ideals. However, even for a discrete valuation domain V, the ring IntR(V) of integer-valued rational functions over V is antimatter. We introduce a family of atomic rings of integer-valued rational functions and study various factorization properties in these rings. © 2023, CC BY.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Tabu search-based fleet scheduling of air ambulances for disaster response

引用

ARRAY 2020年 8卷

作者： Tassone, Joseph Choudhury, Salimur Lakehead Univ 955 Oliver Rd Thunder Bay ON P7B 5E1 Canada

Proper scheduling of air assets can be the difference between life and death for a patient. While poor scheduling can be incredibly problematic during hospital transfers, it can be potentially catastrophic in the case of a disaster. These issues are amplified in the case of an air emergency medical service (EMS) system where populations are dispersed, and resources are limited. There are exact methodologies existing for scheduling missions, although actual calculation times can be quite significant given a large enough problem space. For this research, known coordinates of air and health facilities were used in conjunction with a formulated integer linear programming model. This was the programmed through Gurobi so that performance could be compared against custom algorithmic solutions. Two methods were developed, one based on neighbourhood search and the other on Tabu search. While both were able to achieve results quite close to the Gurobi solution, the Tabu search outperformed the former algorithm. Additionally, it was able to do so in a greatly decreased time, with Gurobi being unable to resolve to optimal in larger examples. Parallel variations were also developed with the compute unified device architecture (CUDA), though did not improve the timing given the smaller sample size.

关键词： Air transportation CUDA Fleet scheduling integer linear programming Local search Tabu search

来源：评论

学校读者我要写书评

暂无评论

SALSA II: A fast transformational scheduler for high-level synthesis

SALSA II: A fast transformational scheduler for high-level s...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： M.R. Rhinehart J. Nestor Department of Electrical and Computer Engineeing Illinois Institute of Technology Chicago IL USA

An improved transformational approach to the scheduling problem in high-level synthesis is described. Based on an existing approach called SALSA, it uses an extended move set and lower bounds on resource costs to quickly find high-quality schedules of data-oriented control-data flow graphs. Results show the ability to find high-quality schedules for difficult scheduling problems in small amounts of CPU time. Results show that in contrast to other approaches, execution times can actually decrease as schedule length increases.< >

关键词： High level synthesis Processor scheduling Flow graphs Parallel processing Cost function integer linear programming Simulated annealing Search methods Timing

来源：评论

学校读者我要写书评

暂无评论

An ultra-fast shared path protection scheme - distributed partial information management, part II

An ultra-fast shared path protection scheme - distributed pa...

引用

International Conference on Network Protocols

作者： Dahai Xu Chunming Qiao Yizhi Xiong Department of Computer Science and Engineering State University of New York Buffalo NY USA

ISBN: (纸本)0769518567

For pt.I see Chunming Qiao and Dahai Xu, INFOCOM'02, p.302-11, (2002). This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, it is shown that a heuristic algorithm can also have better overall performance than its time-consuming, integer linear programming (ILP) based counterparts in the online case, which is non-intuitive. The proposed heuristic algorithm is useful for developing effective shared path (mesh) protection schemes that establish survivable connections in modern networks. The advantage of our heuristic algorithm over existing algorithms for finding a pair of link (or node) disjoint paths, active path (AP) and backup path (BP), comes from the following salient feature. It uses a so-called potential backup cost (PBC) function when selecting an AP in the first phase, in order to take into consideration the backup bandwidth needed by the corresponding BP yet to be chosen in the second phase. The PBC function is derived mathematically based on a rigorous statistical analysis of experimental data. While the use of PBC only requires partial aggregate information on existing connections and distributed control, it can also be applied even more effectively when complete information is available.

关键词： Protection Information management Bandwidth Heuristic algorithms Distributed control Computer science integer linear programming Cost function Statistical analysis Aggregates

来源：评论

学校读者我要写书评

暂无评论

An optimization model for risk management in natural gas supply and energy portfolio of a generation company

An optimization model for risk management in natural gas sup...

引用

IEEE Region 10 International Conference TENCON

作者： Usama Asif Panida Jirutitijaroen Department of Electrical & Computer Engineering National University of Singapore Singapore

This paper proposes a mathematical model to manage natural gas supply and energy portfolio of a generation company. The model incorporates financial risks associated with the decision-making process of buying and selling both natural gas and electricity while keeping the interaction between the two markets. Using stochastic programming framework, the problem formulation considers uncertainties associated with electricity prices and natural gas consumption, which results in a large scale mixed integer linear programming problem. The financial risks are measured by the conditional-value-at-risk (CVaR) index. A simplified test system is presented and later solved using Xpress-IVE student edition. Value of stochastic solution is calculated, which provides the value of the stochastic model.

关键词： Risk management Natural gas Portfolios Stochastic processes integer linear programming Mathematical model Energy management Load management Decision making Energy consumption

来源：评论

学校读者我要写书评

暂无评论

New results on array contraction [memory optimization]

New results on array contraction [memory optimization]

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： A. Darte G. Huard Laboratoire de lE28099Informatique du Parallélisme Lyon France

Array contraction is an optimization that transforms array variables into scalar variables within a loop. While the opposite transformation, scalar expansion, is used for enabling parallelism (with a penalty in memory size), array contraction is used to save memory by removing temporary arrays and to increase locality. Several heuristics have already been proposed to perform array contraction through loop fusion and/or loop shifting, but thus far, the complexity of the problem was unknown, and no exact approach was available. In this paper, we prove two NP-complete results that characterize precisely the problem and we give a practical integer linear programming formulation to solve the problem exactly.

关键词： Optimizing compilers Circuits integer linear programming Prefetching Energy consumption Design optimization Registers Hardware

来源：评论

学校读者我要写书评

暂无评论

Set cover problem of coverage planning in LTE-Advanced relay networks

引用

International Journal of Electronic Commerce Studies 2014年第2期5卷 181-198页

作者： Tseng, Fan-Hsun Chou, Li-Der Chao, Han-Chieh Yu, Wei-Jen National Central University No. 300 Jhongda Rd. Jhongli City Taoyuan County 32001 Taiwan National I-Lan University National Dong Hwa University Sec. 1 No. 1 Shen-Lung Rd. I-Lan 26047 Taiwan Sec. 2 No. 1 Da Hsueh Rd. Shoufeng Hualien 97401 Taiwan National I-Lan University Sec. 1 No. 1 Shen-Lung Road I-Lan 26047 Taiwan

Various mobile devices are developing rapidly in contemporary society, such as smart phones and tablet PCs. Users are able to acquire different multimedia services through wireless communication anytime and anywhere. However, the increased demand also gives rise to a problem of insufficient bandwidth. Therefore, a fourth generation mobile telecommunications (4G) technology was proposed and widely investigated. One of the popular technologies is Long Term Evolution Advanced (LTE-Advanced), which was proposed by the Third Generation Project Partnership (3GPP). The Evolved Node B (eNB) and Relay Node (RN) are the major components in an LTE-Advanced network. How best to deploy these two components to extend network coverage and expand performance is a vital issue. In this paper, we utilize an integer linear programming model (ILP) to formulate the coverage problem, and refer to a well-known problem called the Set Cover problem. Then we propose a heuristic algorithm named as the Set Covering algorithm to solve it. The ultimate object is achieving the highest network coverage and capacity with the least uncovered mobile user. In the simulation result, we use MATLAB to simulate a network deployment, and evaluate the planning results. According to the simulation results, we accomplished better network capacity and a higher number of covered users.

关键词： integer linear programming LTE-Advanced Network planning Relay technology Set cover problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：