The workers that constitute each military institution, during the accomplishment of their attributions, have the need to compose their headquarters' guard. Defining the guarding period for each worker is a complex...
详细信息
The workers that constitute each military institution, during the accomplishment of their attributions, have the need to compose their headquarters' guard. Defining the guarding period for each worker is a complex task, for which legal rules for breaks and the military hierarchy must be respected. The goal of this paper is to solve the work scale problem for the military service, and to develop an application in electronic spread sheets in order to favor this task's execution, currently made manually. Under the development of this paper, laws and the military hierarchy have been studied. Therefore, to solve the Binary Linear programming Problem, a mathematic model was created. The entry data such as the military's preferences, hierarchy restrictions and general rules, as for the exit data and final reports were plotted in electronic spread sheets. The mathematic model was solved through the software CPLEX, and the programming language for the generation of the model and the communication between thE electronic spread sheet and the optimization software was the Visual Basics for Applications. The results obtained were analyzed based on the attendance of the military's preferences. It is noticeable that they were answered in the majority of cases, always respecting the military hierarchy. Tests were made considering different amounts of workers and daily demands, that way the operational gain of this tool's use can be observed when comparing the obtained solution and the manually created designation in terms of quality and also in terms of time spent in getting an answer and formatting results.
This paper proposes to solve the coordination of directional overcurrent relays problem (DOCR) using Artificial Bee Colony optimization (ABC) which is robust and easily implemented. Three case studies were evaluated a...
详细信息
ISBN:
(纸本)9781849197328
This paper proposes to solve the coordination of directional overcurrent relays problem (DOCR) using Artificial Bee Colony optimization (ABC) which is robust and easily implemented. Three case studies were evaluated and implemented on looped 3-bus, 6-bus, and 8-bus systems. The obtained results from the proposed ABC algorithm is compared to those using Linear programming (LP) and Particle Swarm Optimization (PSO) techniques to demonstrate the effectiveness of the ABC in such problems that are highly constrained. Finally, conclusions are reported and discussed.
In recent years, many programming models, software libraries, and middleware have appeared for processing large graphs of various forms. However, there exists a significant usability gap between the graph analysis sci...
详细信息
ISBN:
(纸本)9781450320382
In recent years, many programming models, software libraries, and middleware have appeared for processing large graphs of various forms. However, there exists a significant usability gap between the graph analysis scientists, and High Performance Computing (HPC) application programmers due to the complexity of HPC graph analysis software. In this paper we provide a basic view of Exedra, a domain-specific language (DSL) for large graph analysis in which we aim to eliminate the aforementioned complexities. Exedra consists of high level language constructs for specifying different graph analysis tasks on distributed environments. We implemented Exedra DSL on a scalable graph analysis platform called Dipper. Dipper uses Igraph/R interface for creating graph analysis workflows which in turn gets translated to Exedra statements. Exedra statements are interpreted by Dipper interpreter, and gets mapped to user specified libraries/middleware. Exedra DSL allows for synthesize of graph algorithms that are more efficient compared to bare use of graph libraries while maintaining a standard interface that could use even future graph analysis software. We evaluated Exedra's feasibility for expressing graph analysis tasks by running Dipper on a cluster of four nodes. We observed that Dipper has the ability of reducing the time taken for graph analysis when the workflow was distributed on all four nodes despite the communication, and data format conversion overhead of the Dipper framework.
The proceedings contain 23 papers. The topics discussed include: on the duality of proofs and countermodels in labelled sequent calculi;a brief survey of verified decision procedures for equivalence of regular express...
ISBN:
(纸本)9783642405365
The proceedings contain 23 papers. The topics discussed include: on the duality of proofs and countermodels in labelled sequent calculi;a brief survey of verified decision procedures for equivalence of regular expressions;tableaux for verification of data-centric processes;a tableau system for right propositional neighborhood logic over finite linear orders: an implementation;TATL: implementation of ATL tableau-based decision procedure;psyche: a proof-search engine based on sequent calculus with an LCF-style architecture;understanding resolution proofs through Herbrand's theorem;a refined tableau calculus with controlled blocking for the description logic SHOI;correspondence between modal Hilbert axioms and sequent rules with an application to S5;a labelled sequent calculus for BBI: proof theory and proof search;TAFA - a tool for admissibility in finite algebras;and formalizing cut elimination of coalgebraic logics in Coq.
The purpose of this paper is to formulate an optimization model for the production scheduling problem at continuous production sites. The production scheduling activity should produce a monthly schedule that accounts ...
详细信息
The purpose of this paper is to formulate an optimization model for the production scheduling problem at continuous production sites. The production scheduling activity should produce a monthly schedule that accounts for orders and forecasts of all products. The plan should be updated every day, with feedback on the actual production the previous day. The actual daily production may be lower than the planned production due to disturbances, e.g. disruptions in the supply of a utility. The work is performed in collaboration with Perstorp, a world-leading company within several sectors of the specialty chemicals market. Together with Perstorp, a list of specifications for the production scheduling has been formulated. These are formulated mathematically in a mixed-integer linear program that is solved in receding horizon fashion. The formulation of the model aims to be general, such that it may be used for any process industrial site.
Since Evolution Strategies (ES) have more excellent property than the other existing metaheuristics such as GA in a sense of easiness of coding and its manageability of self-adaptive strategy, Hirabayashi et al. (2011...
详细信息
Since Evolution Strategies (ES) have more excellent property than the other existing metaheuristics such as GA in a sense of easiness of coding and its manageability of self-adaptive strategy, Hirabayashi et al. (2011) proposed a facility layout method using ES for obtaining near optimum solutions efficiently. In their layout model, the shapes of all facilities are assumed to be squares. The shapes of facilities are, however, approximated by rectangles in general layout problems. This paper proposes static and dynamic facility layout methods using ES in case of different shapes and areas of facilities. Some numerical experiments made it clear that the proposed static layout method provides layouts whose average relative error to the optimum or near-optimum layouts obtained by CPLEX are less than 2%, reducing computation time drastically and the solutions of the proposed dynamic layout method provides layouts with 1.3% better objective function value than the previous GA-based layout method on average even though the computation time is within one twentyfifth of it.
Rough inclusion functions are mappings considered in the rough set theory with which one can measure the degree of inclusion of a set in a set (and in particular, the degree of inclusion of an information granule in a...
详细信息
Rough inclusion functions are mappings considered in the rough set theory with which one can measure the degree of inclusion of a set in a set (and in particular, the degree of inclusion of an information granule in an information granule) in line with rough mereology. On the other hand, similarity indices are mappings in cluster analysis with which one can compare clusterings, and clustering methods with respect to similarity. In this article we investigate the relationships between rough inclusion functions and similarity indices.
For many Transmission and Distribution Network Operators the demand for electricity is fast approaching and in some cases exceeding their supply capability. This situation can be improved by enhancing or upgrading the...
详细信息
ISBN:
(纸本)9781849197328
For many Transmission and Distribution Network Operators the demand for electricity is fast approaching and in some cases exceeding their supply capability. This situation can be improved by enhancing or upgrading the electrical infrastructure. Unfortunately, this can have both a negative economical and environmental impact. An alternative approach is to operate the existing system smarter by monitoring power system quantities and taking automatic control decisions and action based on the state of the power system. This methodology is often referred to as System Integrity Protection Schemes (SIPS). This approach has gained momentum of late due to the enhancements in power system monitoring equipment;such as phasor measurement technology, faster communications networks and the development of decision making strategies in intelligent electronic devices (relays);such as fuzzy logic.
There exist many powerful techniques to analyze termination and complexity of term rewrite systems (TRSs). Our goal is to use these techniques for the analysis of other programming languages as well. For instance, app...
详细信息
Ordered graphs, each of whose vertices has a unique order on edges incident to the vertex, can represent graph structured data such as Web pages, T EX sources, CAD and MAP. In this paper, in order to design computatio...
详细信息
暂无评论