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

Evidential Reasoning-Based Nonlinear programming model for MCDA Under Fuzzy Weights and Utilities

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2010年第1期25卷 31-58页

作者： Zhou, Mi Liu, Xin-Bao Yang, Jian-Bo Hefei Univ Technol Sch Management Inst Decis Sci & Informat Syst Technol Hefei 230009 Anhui Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England

in a multiple-criteria decision analysis (MCDA) problem, qualitative information with subjective judgments of ambiguity is often provided by people, together with quantitative data that may also be imprecise or incomplete. There are several uncertainties that may be considered in an MCDA problem, such as fuzziness and ambiguity. The evidential reasoning (ER) approach is well suited for dealing with such MCDA problems and can generate comprehensive distributed assessments for different alternatives. Many researches in dealing with imprecise or uncertain belief structures have been conducted on the ER approach. In this paper, both triangular fuzzy weights of criteria and fuzzy utilities assigned to evaluation grades are introduced to the ER approach, which may be incurred in several circumstances such as group decision-making situation. The Hadamard multiplicative combination of judgment matrix is extended for the aggregation of triangular fuzzy judgment matrices, the result of which is applied as the fuzzy weights used in the fuzzy ER approach. The consistency of the aggregated triangular fuzzy judgment matrix is also proved. Several pairs of ER-based programming models are designed to generate the total fuzzy belief degrees and the overall expected fuzzy utilities for the comparison of alternatives. A numerical example is conducted to show the effectiveness of the proposed approach. (C) 2009 Wiley Periodicals, Inc.

关键词： Evidential Reasoning-Based programming model subjective judgments Erbium Judgment Public utilities Triangular Fuzzy

来源：评论

学校读者我要写书评

暂无评论

An analytical programming model for the drain-coupling source-side injection split gate flash EEPROM

引用

IEEE TRANSACTIONS ON ELECTRON DEVICES 2005年第3期52卷 385-391页

作者： Wang, YH Wu, MC Lin, CJ Chu, WT Lin, YT Wang, CS Cheng, KY Natl Tsing Hua Univ Dept Elect Engn Hsinchu 300 Taiwan Taiwan Semicond Mfg Co Nonvolatile Memory Div Hsinchu 300 Taiwan Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA Univ Illinois Micro & Nanotechnol Lab Urbana IL 61801 USA

This paper presents a compact and accurate analytical model for evaluating the programming behaviors of the drain-coupling source-side injection (SSI) split-gate Flash memory. Starting with the bias-dependent and time-varying drain coupling ratio, a programming model is developed on the basis of the constant barrier height approximation and Lucky-electron model to express the full transient injection current, peak lateral electric field, and storage charge as functions of technological, physical, and electrical parameters. The extracted re-direction mean-free path of the SSI device is smaller than that of the channel hot-electron counterpart by one order of magnitude, which provides the physical intuition for the derived high injection efficiency of around 2/1000. The intrinsic coupling ratio depends only on technological parameters and is presented as the design index of the device. The usefulness of this model is its ability of constructing the complete operation plot of the time-to-program versus the programming voltage for various reliability windows and tunable technological parameters. Besides, the variance of the read current distribution of a memory array is also analytically predicted.

关键词： flash memories hot carriers programming model source-side injection (SSI) programming

来源：评论

学校读者我要写书评

暂无评论

FOOD AND ENERGY CHOICES FOR INDIA - A programming-model WITH PARTIAL ENDOGENOUS ENERGY-REQUIREMENTS

引用

BEHAVIORAL SCIENCE 1980年第5期25卷 367-386页

作者： PARIKH, KS SRINIVASAN, TN International Instit Applied Systems Analysis Laxenburg A-2361 Austria

A mathematical model for all matter-energy processing subsystems at the level of the society, specifically India, is presented. India''s choices in the food and energy sectors over the coming decades are explored. Alternative land intensive, irrigation energy intensive and fertilizer intensive techniques of food production are identified using a nonlinear programming model. The land saved is devoted to growing firewood. The optimum combination of railway (steam, diesel and electric traction) and road (automobiles, diesel trucks and diesel and gasoline buses) transport is determined. For the oil sector, 2 alternative sources of supply of crude oil and petroleum products are included, namely, domestic production and imports. The optimum choice is determined through a linear programming model. While the model is basically a static one, designed to determine the optimal choice for the target year of 2000-2001, certain intertemporal detail is incorporated for electricity generation. The model minimizes the costs of meeting the needs for food, transport in terms of passenger km and goods/ton per k, energy needs for domestic cooking and lighting and the energy needs of the rest of the economy.

关键词： society matter-energy processing food energy choice programming model India

来源：评论

学校读者我要写书评

暂无评论

A QUADRATIC-programming model FOR OPTIMAL DATA DISTRIBUTION

引用

BIT 1981年第3期21卷 294-304页

作者： LAM, CM FUNG, KT School of Computer Science University of Windsor N9B 3P4 Windsor Ontario Canada

In this paper, a quadratic programming model is developed to take into consideration a number of factors that can influence the process of optimal allocation of data among the nodes in a distributed database. The factors include communication costs, translation costs, congestion costs and storage costs. Beale's method is used to solve the resulting quadratic program. Some numerical examples are presented and the potentials of such an approach in the design and analysis of distributed databases are discussed.

关键词： Computational Mathematic programming model Data Distribution Quadratic programming Communication Cost

来源：评论

学校读者我要写书评

暂无评论

BSPCloud: A Hybrid Distributed-memory and Shared-memory programming model

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2013年第1期6卷 87-97页

作者： Liu, Xiaodong Tong, Weiqin ZhiRen, Fu WenZhao, Liao Shanghai Univ Sch Comp Engn & Sci Shanghai 200072 Peoples R China China Telecom Corp Ltd Shanghai 200085 Peoples R China

ISBN: (纸本)3642128130

programming models for cloud computing has been a research focus recently. Current programming models for cloud computing mainly focus on improving the efficiency of the cloud computing platforms but little has been done on the performance predictability of models. This paper presents a cloud computing programming model, called BSPCloud. The BSPCloud has the advantages of predictable performance. BSPCloud uses a hybrid of distributed-memory and shared-memory bulk synchronous parallel (BSP) programming model. Computing tasks are first divided into a set of coarse granularity bulks which are computed by the distributed-memory BSP model, and each coarse granularity bulk is further divided into a set of bulk threads which are computed by the shared-memory BSP model. BSPCloud makes full use of the multi-core architecture, and more importantly, the performance of the BSPCloud is predictable. We have implemented a proof-of-concept BSPCloud parallel programming library in java. We give the implementation of BSPCloud parallel programming library and show how the library implements hybrid programming. We detail applying the BSPCloud library on matrix multiplication. The performance predictability and speedup are evaluated in the cloud platform. We give the results of experiments.

关键词： Cloud programming programming model BSPCloud Bulk synchronous parallel

来源：评论

学校读者我要写书评

暂无评论

A Dynamic programming model of the Coordination between Forest and Socio-economy

A Dynamic Programming Model of the Coordination between Fore...

引用

International Conference on Applied Mechanics and Mechanical Engineering

作者： Ye, Tao Hangzhou Dianzi Univ Sch Management Hangzhou 310037 Zhejiang Peoples R China

ISBN: (纸本)9780878492459

Based on the illustration of the importance of the coordination between forest and socio-economy, a dynamic programming model aimed at the coordination is created and the basic characters of the functions in the model are discussed. A solution under a simple and ideal situation is studied, which results in the equation of the economic yield when forest coordinates with socio-economy and several other conclusions.

关键词： Dynamic programming model Forest Socio-economy

来源：评论

学校读者我要写书评

暂无评论

ConMR: Concurrent MapReduce programming model for Large Scale Shared-Data Applications

ConMR: Concurrent MapReduce Programming Model for Large Scal...

引用

42nd Annual International Conference on Parallel Processing (ICPP)

作者： Zhang, Fan Malluhi, Qutaibah M. Elsyed, Tamer M. Carnegie Mellon Univ Qatar Dept Comp Sci Doha Qatar Qatar Univ Dept Comp Sci & Engn Doha Qatar

ISBN: (纸本)9780769551173

The rapid growth of large-data processing has brought in the MapReduce programming model as a widely accepted solution. However, MapReduce limits itself to a one-map-to-one-reduce framework. Meanwhile, it lacks built-in support and optimization when the input datasets are shared among concurrent applications and/or jobs. The performance might be improved when the shared and frequently accessed data is read from local instead of distributed file system. To enhance the performance of big data applications, this paper presents Concurrent MapReduce, a new programming model built on top of MapReduce that deals with large amount of shared data items. Concurrent MapReduce provides support for processing heterogeneous sources of input datasets and offers optimization when the datasets are partially or fully shared. Experimental evaluation has shown an execution runtime speedup of 4X compared to traditional non-concurrent MapReduce implementation with a manageable time overhead.

关键词： Concurrency MapReduce programming model Shared Input Data

来源：评论

学校读者我要写书评

暂无评论

Web-based programming model 6

Web-based programming model

引用

6th International Conference on modeling, Simulation, and Applied Optimization (ICMSAO)

作者： Anastasiu, Doru Popescu Boroghina, Gabriel Univ Pitesti Fac Math & Comp Sci Pitesti Romania Natl Coll Radu Greceanu Dept Comp Sci Slatina Romania

ISBN: (纸本)9781467366014

In order to use a program written in C++ or in another programming language, a compiler and an development environment are necessary. In this paper we will present a method of using a C++ program from a web page and one of showing the results by using HTML, the ASP. NET framework and the Windows version of GNU GCC compiler -MinGW. The programming model presented in this paper can also be used for other compilers. The described application allows the implementation, test and usage of some algorithms without installing a development environment, using only a browser to connect to the Internet.

关键词： programming model C plus plus program *** HTML compiling interface connection web pages

来源：评论

学校读者我要写书评

暂无评论

An enhanced programming model for internet based cycle stealing

An enhanced programming model for internet based cycle steal...

引用

International Conference on Parallel and Distributed Processing Techniques and Applications

作者： Kelly, W Roe, P Sumitomo, J Queensland Univ Technol Ctr Informat Technol Innovat St Lucia Qld Australia

ISBN: (纸本)1892512459

Most current cycle stealing systems, especially those designed for the Internet require programmers to adopt the master-worker parallel programming paradigm. The master-worker paradigm is extremely limiting from an abstraction point of view as it requires a single master thread to expose all of the parallelism that the application hopes to exploit. In this paper we describe how we have extended our Internet cycle stealing system G2, to support more general parallel programming paradigms in which any task can create subtasks and in which tasks become self contained units of abstraction. The major problem addressed is how to allow tasks to wait for the results of their subtasks without tying up the resources of volunteer machines. By drawing a programming analogy with the asynchronous implementation of web services in *** we create a familiar yet powerful programming model for creating parallel programs using a variety of paradigms.

关键词： parallel programming programming model cycle stealing NET web services

来源：评论

学校读者我要写书评

暂无评论

CharmPy: A Python Parallel programming model

CharmPy: A Python Parallel Programming Model

引用

IEEE International Conference on Cluster Computing (CLUSTER)

作者： Galvez, Juan J. Senthil, Karthik Kale, Laxmikant V. Univ Illinois Dept Comp Sci Champaign IL 61820 USA

ISBN: (纸本)9781538683194

Parallel programming can be extremely challenging. programming models have been proposed to simplify this task, but wide acceptance of these remains elusive for many reasons, including the demand for greater accessibility and productivity. In this paper, we introduce a parallel programming model and framework called CharmPy, based on the Python language. CharmPy builds on Charm++, and runs on top of its C++ runtime. It presents several unique features in the form of a simplified model and API, increased flexibility, and the ability to write everything in Python. CharmPy is a high-level model based on the paradigm of distributed migratable objects. It retains the benefits of the Charm++ runtime, including dynamic load balancing, asynchronous execution model with automatic overlap of communication and computation, high performance, and scalability from laptops to supercomputers. By being Python-based, CharmPy also benefits from modern language features, access to popular scientific computing and data science software, and interoperability with existing technologies like C, Fortran and OpenMP. To illustrate the simplicity of the model, we will show how to implement a distributed parallel map function based on the Master-Worker pattern using CharmPy, with support for asynchronous concurrent jobs. We also present performance results running stencil code and molecular dynamics mini-apps fully written in Python, on Blue Waters and Cori supercomputers. For stencil3d, we show performance similar to an equivalent MPI-based program, and significantly improved performance for imbalanced computations. Using Numba to JIT-compile the critical parts of the code, we show performance for both mini-apps similar to the equivalent C++ code.

关键词： programming model parallel programming distributed computing multiprocessing Python HPC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：