In this paper, we deal with multiobjective linear programming problems with fuzzy random variable coefficients. Since the problem is ill-defined due to both fuzziness and randomness, we propose a decision making model...
详细信息
ISBN:
(纸本)0780370783
In this paper, we deal with multiobjective linear programming problems with fuzzy random variable coefficients. Since the problem is ill-defined due to both fuzziness and randomness, we propose a decision making model based on E-model, which is one of useful models in a stochastic programming, and possibility measure. At first, we show that the formulated problem is reduced to a multiobjective linear fractional programming problem. After defining a Pareto optimal solution based on expected value of possibility measure, we construct a solution algorithm for solving a minimax problem. Further we consider an interactive decision making using reference points and give numerical examples.
Occasionally a game or visual programming language tool designed for programming education is used to teach programming. In general, these tools have various attributes, which inhibit a great learning effect if the to...
详细信息
ISBN:
(纸本)9781467369565
Occasionally a game or visual programming language tool designed for programming education is used to teach programming. In general, these tools have various attributes, which inhibit a great learning effect if the tool and learning objectives are not aligned. However, which tool is most appropriate for a given objective remains unknown. In this research, we propose a taxonomy table to evaluate program learning tools and demonstrate its usefulness by researching and comparing 43 kinds of program learning tools in the taxonomy table. this research should contribute to the selection of suitable tools for program learning.
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the resources of a Desktop Grid, it is necess...
详细信息
ISBN:
(纸本)9781424425785
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the resources of a Desktop Grid, it is necessary to use scheduling policies suitable for such systems. A scheduling policy must be applicable to large-scale systems involving large numbers of machines. Also, the policy must be fault-aware in the sense that it copes with resource volatility. Further adding to the complexity of scheduling for Desktop Grids is the inherent heterogeneity of such systems. Suboptimal performance would result if the scheduling policy does not take into account information on heterogeneity. In this paper, we suggest and develop several scheduling policies for Desktop Grid systems involving different levels of heterogeneity. In particular, we propose a policy which utilizes the solution to a linear programming problem which maximizes system capacity. We consider parallel applications that consist of independent tasks.
In this paper, the defuzzification of a primal Fuzzy Geometric programming (FGP) model and its dual model by using t-norm and t-conorm fuzzy relations is proposed. Since a lot of problems in different fields can be re...
详细信息
ISBN:
(纸本)9789814324694
In this paper, the defuzzification of a primal Fuzzy Geometric programming (FGP) model and its dual model by using t-norm and t-conorm fuzzy relations is proposed. Since a lot of problems in different fields can be represented as FGP models, the consideration of uncertainty in a geometric programming model can allow the decision maker to define a lot of problems as an FGP model more realistically.
Type providers [16], pioneered in the F# programming language, are a practical and powerful means of gaining the benefits of a modern static type system when working with data schemas that are defined outside of the p...
详细信息
ISBN:
(纸本)9781450323895
Type providers [16], pioneered in the F# programming language, are a practical and powerful means of gaining the benefits of a modern static type system when working with data schemas that are defined outside of the programming language, such as relational databases. F# type providers are implemented using a form of compile-time code generation, which requires the compiler to expose an internal API and can undermine type safety. We show that with dependent types it is possible to define a type provider mechanism that does not rely on code generation. Using this mechanism, a type provider becomes a kind of generic program that is instantiated for a particular external schema, which can be represented using an ordinary datatype. Because these dependent type providers use the ordinary abstraction mechanisms of the type system, they preserve its safety properties. We evaluate the practicality of this technique and explore future extensions.
Grid computing enables the aggregation of a large number of computational resources for solving complex scientific and engineering problems. However, writing, deploying, and testing grid applications over highly heter...
详细信息
ISBN:
(纸本)9781424425785
Grid computing enables the aggregation of a large number of computational resources for solving complex scientific and engineering problems. However, writing, deploying, and testing grid applications over highly heterogeneous and distributed infrastructure are complex and error prone. A number of grid integrated development environments (IDEs) have been proposed and implemented to simplify grid application development. this paper presents an extension to our previous work on a grid IDE in the form of a software framework with a well-defined API and an event mechanism. It provides novel tools to automate routine grid programming tasks and allow programmable actions to be invoked based on certain events. Its system model regards resources as first-class objects in the IDE and allows tight integration between the execution platforms and the code development process. We discuss how the framework improves the process of grid application development.
Plug-in components are a means for making feature-rich applications customizable. Combined with plug-and-play composition, end users can assemble customized applications without programming. If plug-and-play compositi...
详细信息
ISBN:
(纸本)9781450301541
Plug-in components are a means for making feature-rich applications customizable. Combined with plug-and-play composition, end users can assemble customized applications without programming. If plug-and-play composition is also dynamic, applications can be reconfigured on the fly to load only components the user needs for his current work. We have created ***, a plug-in framework that supports dynamic plug-and-play composition. the basis for plug-and-play in Plux is the composer which replaces programmatic composition by automatic composition. Components just specify their requirements and provisions using metadata. the composer then assembles the components based on that metadata by matching requirements and provisions. When the composer needs to reuse general-purpose components in different parts of an application, the component model requires genericity. the composer depends on metadata that specify which components should be connected and for general-purpose components those metadata need to be different on each reuse. We present an approach for generic plug-ins with component templates and an implementation for Plux. the general-purpose components become templates and the templates get parameterized when they are composed.
In this formulation, the objective function and operating constraints include the corona power-loss term. the objective function consists of three terms: cost of investment of new transmission lines, ohmic power loss ...
详细信息
In this formulation, the objective function and operating constraints include the corona power-loss term. the objective function consists of three terms: cost of investment of new transmission lines, ohmic power loss of new and existing lines, and corona-power loss of new lines. this combination of terms results in a non-linear objective function. the non-linear programming or the non-convex optimization technique is used to solve such large-scale practical problem. the new formulation has been applied to the 28-bus Jordanian high-voltage transmission network in order to test and justify its applicability. (C) 2003 Elsevier Ltd. All rights reserved.
While dynamic code evolution in object-oriented systems is an important feature supported by dynamic languages, there is currently only limited support for dynamic code evolution in high-performance, state-of-the-art ...
详细信息
ISBN:
(纸本)9781450301541
While dynamic code evolution in object-oriented systems is an important feature supported by dynamic languages, there is currently only limited support for dynamic code evolution in high-performance, state-of-the-art runtime systems for statically typed languages, such as the Java Virtual Machine. In this tool demonstration, we present the Dynamic Code Evolution VM, which is based on a recent version of Oracle's state-of-the-art Java HotSpot (TM) VM and allows unlimited changes to loaded classes at runtime. Based on the Dynamic Code Evolution VM, we developed an enhanced version of the Mantisse GUI builder (which is part of the NetBeans IDE) that allows adding GUI components without restarting the application under development. Furthermore, we redesigned the dynamic AOP framework HotWave to take advantage of the enhanced dynamic code evolution capabilities. the new version, HotWave2, now supports most AspectJ constructs, including around() advice and static cross-cutting. We will demonstrate boththe enhanced Mantisse GUI builder as well as HotWave2, weaving several aspects for dynamic analysis in sizable applications at runtime.
A single echelon supply chain model problem, consisting of a store with known inventory and shipping capacities, a known delivery delay or lead time and a random demand for a product at the store is formulated as an o...
详细信息
ISBN:
(纸本)9789897583964
A single echelon supply chain model problem, consisting of a store with known inventory and shipping capacities, a known delivery delay or lead time and a random demand for a product at the store is formulated as an optimal control problem. In the practical case when only current and past demands are known, using the concept of one step ahead optimal control, the problem is reformulated as the mathematical programming problem of maximizing economic value added (EVA), subject to the dynamics and constraints, such as inventory size. Illustrative examples are given and performance indices are proposed to evaluate the performance of the proposed controller, which exhibits good efficiency and no bullwhip effect.
暂无评论