Cloud computing advocates a promising paradigm that facilitates the access within heterogeneous services, platforms, and end users. However, platforms (or host servers) have confined to devices which require a conside...
详细信息
Cloud computing advocates a promising paradigm that facilitates the access within heterogeneous services, platforms, and end users. However, platforms (or host servers) have confined to devices which require a considerable computing resources. In this case, solutions concerning the efficient use of pervasive devices with constrained resources become an open issue. This study investigates the seamless connection between embedded devices and cloud resources to enhance the capability of computing and furthermore provide context-aware services. A method for wireless program dissemination and boot loading is proposed to transfer necessary information and resources between service and target device(s). The experiment results on time delay and energy cost demonstrate the feasibility and performance. (C) 2013 Elsevier B.V. All rights reserved.
A list of similar items of different sizes are required on a regular basis, but it is impractical to stock each of the different sizes. Demands for any size that is not stocked must be met by supplying the nearest acc...
详细信息
A list of similar items of different sizes are required on a regular basis, but it is impractical to stock each of the different sizes. Demands for any size that is not stocked must be met by supplying the nearest acceptable size that is stocked, resulting in increased cost or trim wastage for example. The problem of determining which sizes should be stocked to minimise or maximise an appropriate objective function is formulated as a shortest or longest path problem on a directed acyclic network. A spreadsheet model is used to solve the problem, in such a way that showing precedents on the spreadsheet results in the basis tree for the shortest or longest path solution being drawn without the need for special software. The basis tree produced by this method is shown to be planar for practical applications, enabling improved efficiency of the algorithm used. Examples are given to illustrate the application of this approach. (C) 1999 Elsevier Science B.V. All rights reserved.
Software-defined networking (SDN) has been recognized for its potential in network programming and centralized control. However, this advancement brings forth critical security vulnerabilities. It is essential to unde...
详细信息
Software-defined networking (SDN) has been recognized for its potential in network programming and centralized control. However, this advancement brings forth critical security vulnerabilities. It is essential to understand that vulnerabilities, by their inherent nature, may lead to potential attacks if not addressed timely and appropriately. In this paper, we introduce a novel multi-modal deep transfer learning (MMDTL) framework tailored for effective attack detection in SDN environments that helps us to investigate a diverse spectrum of attack types. MMDTL framework comprehensively incorporates diverse data modalities - encompassing network traffic patterns, system logs, and user behavior analytic. A pivotal feature of this framework is its transfer learning approach, which enables the assimilation of insights from pre-trained models that subsequently increases the detection performance of attacks. We rigorously analyze the proposed framework with experiments on the intrusion detection evaluation dataset (CIC-IDS2017). Analyses results show the superiority of our framework with a detection accuracy 99.97%.Thus, MMDTL framework has a significant potential to support security in SDNs.
We address an important problem in telecommunications planning: the multiperiod network expansion problem. Our aim is to show that it can be efficiently solved using a new local search approach. To achieve our goal, w...
详细信息
We address an important problem in telecommunications planning: the multiperiod network expansion problem. Our aim is to show that it can be efficiently solved using a new local search approach. To achieve our goal, we first show how to adapt the problem's formulation to meet our local search program's requirements. We then describe GLIT (Generic Local Improvement Template), a new, generic auto-calibrating local search algorithm;the different neighbouring strategies that we designed specifically for this problem;as well as a Genetic algorithm for this problem. We compare and discuss the performance of these algorithms using extensive computational tests on a large range of instances with up to 7500 arcs. These experiments show that GLIT clearly outperforms competitive approaches, especially when it is coupled with Genetic algorithms. We also show that the hybrid algorithms Genetic/Tabu, Genetic/Simulated Annealing, and finally Genetic/GLIT all outperform both purl Genetic and pure local search algorithms. (C) 1998 Elsevier Science B.V. All rights reserved.
In this layer we consider the problem of constructing a network over which a number of commodities are to be transported. Fixed costs are associated to the construction of network arcs and variable costs are associate...
详细信息
In this layer we consider the problem of constructing a network over which a number of commodities are to be transported. Fixed costs are associated to the construction of network arcs and variable costs are associated to routing of commodities. In addition, one capacity constraint is related to each arc. The problem is to determine a network design that minimizes the total cost;i.e., it balances the construction and operating costs. A dual ascent procedure for finding improved lower bounds and near-optimal solutions for the fixed-charge capacitated network design problem is proposed. The method is shown to generate tighter lower bounds than the linear programming relaxation of the problem.
In 1965 Helmut Lerchs and Ingo Grossmann presented to the mining community an algorithm to find the optimum design for an open pit mine. In their words, "the objective is to design the contour of a pit so as to m...
详细信息
In 1965 Helmut Lerchs and Ingo Grossmann presented to the mining community an algorithm to find the optimum design for an open pit mine. In their words, "the objective is to design the contour of a pit so as to maximize the difference between total mine value of the ore extracted and the total extraction cost of ore and waste". They modeled the problem in graph theoretic terms and showed that an optimal solution of the ultimate pit problem is equivalent to finding the maximum closure of their graph based model. In this paper, we develop a network flow algorithm based on the dual to solve the same problem. We show how this algorithm is closely related to Lerchs and Grossmann's and how the steps in their algorithm can be viewed in mathematical programming terms. This analysis adds insight to the algorithm of Lerchs and Grossmann and shows where it can be made more efficient. As in the case Lerchs and Grossmann, our algorithm allows us to use very efficient data structures based on graphs that represent the data and constraints. (C) 1998 Elsevier Science B.V.
We describe the Dynamic Unit Commitment and Loading (DUCL) Model that has been developed for use in real-time system operations at BC Hydro (BCH) to determine the optimal hydroelectric unit generation schedules for pl...
详细信息
We describe the Dynamic Unit Commitment and Loading (DUCL) Model that has been developed for use in real-time system operations at BC Hydro (BCH) to determine the optimal hydroelectric unit generation schedules for plants with multiple units and complex hydraulic configurations. The problem is formulated and solved with a novel procedure that incorporates three algorithms. First, an expert system is used to eliminate infeasible and undesirable solutions. Second, dynamic programming is used to solve the optimal static unit commitment problem for a given plant loading, feasible unit combinations, and current hydraulic conditions. Third, the DUCL problem is formulated and solved as a large-scale network problem with side constraints. Output from the model includes DUCL schedules, spinning and operating reserve, and trades curves such as that between water usage and the number of unit switches. The innovative use of the procedure allows the model to effectively schedule hydro units for the energy and capacity markets in real-time. Application of the method is demonstrated by determining the 24-time-step DUCL schedule for a 2700 MW plant with ten units of four different unit types.
A primal-dual approach is proposed to solve capacity-constrained production planning problems with variable and fixed costs. Fixed costs are modelled by an assignment sub-problem, variable costs lead to a transportati...
详细信息
A primal-dual approach is proposed to solve capacity-constrained production planning problems with variable and fixed costs. Fixed costs are modelled by an assignment sub-problem, variable costs lead to a transportation sub-problem. The principle of resource employments allows us to link the assignment sub-problem with the transportation sub-problem. A primal-dual method is defined to solve these two linked problems which are unified by a transhipment model. The heuristic is specified and its main characteristics are justified. Some experiments allow the reader to judge our approach quality. (C) 1999 Elsevier Science Ltd. All rights reserved.
network programming is very important for nest generation of distributed DAQ system. Java has powerful functionality not only in GUI hut also in network programming. But, execution speed of Java program is slow on Jav...
详细信息
network programming is very important for nest generation of distributed DAQ system. Java has powerful functionality not only in GUI hut also in network programming. But, execution speed of Java program is slow on Java interpreter. For evaluating the DAQ parameters, we have investigated various benchmark programs on Java interpreter, Java Just-In-Time compiler and Java native code compiler which generates native codes, and evaluated the performance of them in comparison with that of the C: native codes. We found that the performance of the Java native code compiler was nearly as good as that of the C native codes. Bence, a prototype of Java-based DAQ has been developed and evaluated. The result showed that the prototype was fast enough as first stage of the development. Our goal is to establish 3-tier (DAQ client, DAQ server and DAQ database) model for the DAQ.
作者：
Gendron, BUniv Montreal
Ctr Rech Transports Dept Informat & Rech Operat Montreal PQ H3C 3J7 Canada
We show by a counterexample that the dual-ascent procedure proposed by Herrmann, Ioannou, Minis and Proth in a 1996 issue of the European Journal of Operational Research is incorrect in the sense that it does not gene...
详细信息
We show by a counterexample that the dual-ascent procedure proposed by Herrmann, Ioannou, Minis and Proth in a 1996 issue of the European Journal of Operational Research is incorrect in the sense that it does not generate a valid lower bound to the optimal value of fixed-charge capacitated network design problems. We provide a correct dual-ascent procedure based on the same ideas and we give an interpretation of it in terms of a simple Lagrangean relaxation. Although correct, this procedure is not effective, as in general, it provides a less tighter bound than the linear programming relaxation. (C) 2002 Elsevier Science B.V. All rights reserved.
暂无评论