WorldWideScience

Sample records for discrete berth allocation

  1. Models for the discrete berth allocation problem: A computational comparison

    DEFF Research Database (Denmark)

    Buhrkal, Katja Frederik; Zuglian, Sara; Røpke, Stefan

    2011-01-01

    In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal. We review and describe three main models of the discrete dynamic berth allocation...

  2. Models for the Discrete Berth Allocation Problem: A Computational Comparison

    DEFF Research Database (Denmark)

    Buhrkal, Katja; Zuglian, Sara; Røpke, Stefan

    In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal. We review and describe the three main models of the discrete dynamic berth allocation...

  3. Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

    Science.gov (United States)

    2014-01-01

    Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

  4. Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

    Directory of Open Access Journals (Sweden)

    Shih-Wei Lin

    2014-01-01

    Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

  5. Dynamic berth and quay crane allocation for multiple berth positions and quay cranes

    NARCIS (Netherlands)

    Tri Cahyono, Rully; Flonk, E.J.; Jayawardhana, Bayu

    2015-01-01

    We study in this paper a dynamic berth and quay cranes allocation strategy in general seaport container terminals. We develop a dynamical model that describes the operation of berthing process with multiple discrete berthing positions and multiple quay cranes. Based on the proposed model, we develop

  6. Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results

    DEFF Research Database (Denmark)

    Iris, Cagatay; Pacino, Dario; Røpke, Stefan

    2015-01-01

    Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models....... To improve the performance of the set partitioning formulations, a number of variable reduction techniques are proposed. Furthermore, we analyze the effects of different discretization schemes and the impact of using a time-variant/invariant quay crane allocation policy. Computational experiments show...

  7. A heuristics-based solution to the continuous berth allocation and crane assignment problem

    Directory of Open Access Journals (Sweden)

    Mohammad Hamdy Elwany

    2013-12-01

    Full Text Available Effective utilization plans for various resources at a container terminal are essential to reducing the turnaround time of cargo vessels. Among the scarcest resources are the berth and its associated cranes. Thus, two important optimization problems arise, which are the berth allocation and quay crane assignment problems. The berth allocation problem deals with the generation of a berth plan, which determines where and when a ship has to berth alongside the quay. The quay crane assignment problem addresses the problem of determining how many and which quay crane(s will serve each vessel. In this paper, an integrated heuristics-based solution methodology is proposed that tackles both problems simultaneously. The preliminary experimental results show that the proposed approach yields high quality solutions to such an NP-hard problem in a reasonable computational time suggesting its suitability for practical use.

  8. Research on bulk-cargo-port berth assignment based on priority of resource allocation

    Directory of Open Access Journals (Sweden)

    Chunfang Guo

    2013-03-01

    Full Text Available Purpose: The purpose of this paper is to propose a Priority of Resource Allocation model about how to utilize the resources of the port efficiently, through the improvement of traditional ant colony algorithm, the ship-berth matching relation constraint matrix formed by ontology reasoning. Design/methodology/approach: Through questionnaires?Explore factor analysis (EFA and principal component analysis, the authors extract the importance of the goods, the importance of customers, and type of trade as the main factors of the ship operating priority. Then the authors combine berth assignment problem with the improved ant colony algorithm, and use the model to improve ship scheduling quality. Finally, the authors verify the model with physical data in a bulk-cargo-port in China. Findings: Test by the real data of bulk cargo port, it show that ships’ resource using priority and the length of waiting time are consistent; it indicates that the priority of resource allocation play a prominent role in improving ship scheduling quality. Research limitations: The questionnaires is limited in only one port group, more  related Influence factors should be considered to extend the conclusion. Practical implications: The Priority of Resource Allocation model in this paper can be used to improve the efficiency of the dynamic berth assignment. Originality: This paper makes the time of ship in port minimized as the optimization of key indicators and establishes a dynamic berth assignment model based on improved ant colony algorithm and the ontology reasoning model.

  9. Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

    DEFF Research Database (Denmark)

    Iris, Cagatay; Pacino, Dario; Røpke, Stefan

    2017-01-01

    This paper focuses on the integrated berth allocation and quay crane assignment problem in container terminals. We consider the decrease in the marginal productivity of quay cranes and the increase in handling time due to deviation from the desired position. We consider a continuous berth...

  10. The multi-port berth allocation problem with speed optimization and emission considerations

    DEFF Research Database (Denmark)

    Venturini, Giada; Iris, Cagatay; Kontovas, Christos A.

    2017-01-01

    The container shipping industry faces many interrelated challenges and opportunities, as its role in the global trading system has become increasingly important over the last decades. On the one side, collaboration between port terminals and shipping liners can lead to costs savings and help...... achieve a sustainable supply chain, and on the other side, the optimization of operations and sailing times leads to reductions in bunker consumption and, thus, to fuel cost and air emissions reductions. To that effect, there is an increasing need to address the integration opportunities and environmental...... issues related to container shipping through optimization. This paper focuses on the well known Berth Allocation Problem (BAP), an optimization problem assigning berthing times and positions to vessels in container terminals. We introduce a novel mathematical formulation that extends the classical BAP...

  11. Integrated Berth Allocation-Quay Crane Assignment Problem: Reformulations, Improved Constraints and Computational Results

    DEFF Research Database (Denmark)

    Iris, Cagatay; Røpke, Stefan; Pacino, Dario

    ,74% 63,0 X 7,97% 600* 68,0 67,9 0,19% 600 8 56,1 56,1 0,00% 51,3 X 9,42% 600* 56,1 55,8 0,59% 600* 9 75,1 75,0 0,13% 74,9 X 0,33% 600* 75,1 75,0 0,15% 600* BACAP can also be formulated as Generalized Set Partitioning Problem (GSPP). The model is an extension of the BAP formulation in [2] where we add new...... problem (BAP) and the quay crane assignment problem (QCAP). Such integrated problem is known in the literature ([1]) as the Berth Allocation and Crane Assignment Problem (BACAP). The state-of-the-art [1] models this problem using two decision variables X_ij and Y_ij, representing respectively the partial...... since start-time variables S_i are integrated into objective function. Inequality (1) is based on the following two observations. First, if vessel i berths before vessel j (X_ij=1), then the start time of vessel j (Sj) should be larger than the start time of vessel i plus its minimum expected processing...

  12. A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

    DEFF Research Database (Denmark)

    Robenek, Tomáš; Umang, Nitish; Bierlaire, Michel

    2014-01-01

    In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight the diffe...

  13. Berth Allocation Problem with Quay Crane Assignment for Container Terminals Based on Rolling-Horizon Strategy

    Directory of Open Access Journals (Sweden)

    Ling Xiao

    2014-01-01

    Full Text Available In order to solve the large-scale integral dynamic scheduling of continuous berths and quay cranes problem, a method based on rolling-horizon strategy is proposed. A multiobjective optimization model that is established minimizes the total penalty costs considering vessels’ deviations to their preferred berthing positions, delayed times for berthing comparing to their estimated arrival times, and delayed times for departure comparing to their estimated departure times. Then, the scheduling process was divided into a set of continual scheduling interval according to the dynamic arrival sequences. Meanwhile, rolling-horizon strategies for setting rolling and frozen windows and the parameter updating strategy are designed. The input parameters of the model in the next rolling window are updated according to the optimal results of each time window which have been obtained. The model is solved by choosing appropriate rolling and freezing window lengths that represents the numbers of adjacent vessels in the sequence of calling vessels. The holistic optimal solution is obtained by gradually rolling and combining the results of each window. Finally, a case study indicated that the rolling schedule can solve large-scale scheduling problems, and the efficiency of the proposed approach relates to the size of rolling window, freeze ship quantity, and rolling frequency.

  14. A Simulation Based Approach to Optimize Berth Throughput Under Uncertainty at Marine Container Terminals

    Science.gov (United States)

    Golias, Mihalis M.

    2011-01-01

    Berth scheduling is a critical function at marine container terminals and determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper we formulate the berth scheduling problem as a bi-objective mixed-integer problem with the objective to maximize customer satisfaction and reliability of the berth schedule under the assumption that vessel handling times are stochastic parameters following a discrete and known probability distribution. A combination of an exact algorithm, a Genetic Algorithms based heuristic and a simulation post-Pareto analysis is proposed as the solution approach to the resulting problem. Based on a number of experiments it is concluded that the proposed berth scheduling policy outperforms the berth scheduling policy where reliability is not considered.

  15. A discrete force allocation algorithm for modelling wind turbines in computational fluid dynamics

    DEFF Research Database (Denmark)

    Réthoré, Pierre-Elouan; Sørensen, Niels N.

    2012-01-01

    at the position of the wind turbine rotor to estimate correctly the power production and the rotor loading. The method proposed in this paper solves this issue by spreading the force on the direct neighbouring cells and applying an equivalent pressure jump at the cell faces. This can potentially open......This paper describes an algorithm for allocating discrete forces in computational fluid dynamics (CFD). Discrete forces are useful in wind energy CFD. They are used as an approximation of the wind turbine blades’ action on the wind (actuator disc/line), to model forests and to model turbulent...

  16. Un autoportrait de Berthe Morisot

    OpenAIRE

    Bonnet, Marie-Jo

    2006-01-01

    À voir la détermination avec laquelle Berthe Morisot nous regarde, nous pourrions penser qu’elle a trouvé facilement sa place d’artiste. Une palette est esquissée sur la gauche de trois mouvements tournants. Elle porte une fleur bleue à la boutonnière, «  comme une décoration  », dira Mallarmé, elle se tient droite, la tête tournée vers le spectateur, et elle nous regarde de ses célèbres yeux noirs qui ont tant fasciné Manet. Paul Valéry écrira d’ailleurs au sujet de ses yeux  : «  Berthe Mor...

  17. Allocating external financing for health: a discrete choice experiment of stakeholder preferences.

    Science.gov (United States)

    Grépin, Karen A; Pinkstaff, Crossley B; Hole, Arne Risa; Henderson, Klara; Norheim, Ole Frithjof; Røttingen, John-Arne; Ottersen, Trygve

    2018-02-01

    Most donors of external financing for health use allocation policies to determine which countries are eligible to receive financial support and how much support each should receive. Currently, most of these policies place a great deal of weight on income per capita as a determinant of aid allocation but there is increasing interest in putting more weight on other country characteristics in the design of such policies. It is unclear, however, how much weight should be placed on other country characteristics. Using an online discrete choice experiment designed to elicit preferences over country characteristics to guide decisions about the allocation of external financing for health, we find that stakeholders assign a great deal of importance to health inequalities and the burden of disease but put very little weight on income per capita. We also find considerable variation in preferences across stakeholders, with people from low- and middle-income countries putting more weight on the burden of disease and people from high-income countries putting more weight on health inequalities. These findings suggest that stakeholders put more weight on burden of disease and health inequalities than on income per capita in evaluating which countries should received external financing for health and that that people living in aid recipient may have different preferences than people living in donor countries. Donors may wish to take these differences in preferences in mind if they are reconsidering their aid allocation policies. © The Author(s) 2018. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  18. Design of an adaptive backstepping controller for auto-berthing a cruise ship under wind loads

    Directory of Open Access Journals (Sweden)

    Park Jong-Yong

    2014-06-01

    Full Text Available The auto-berthing of a ship requires excellent control for safe accomplishment. Crabbing, which is the pure sway motion of a ship without surge velocity, can be used for this purpose. Crabbing is induced by a peculiar operation procedure known as the push-pull mode. When a ship is in the push-pull mode, an interacting force is induced by complex turbulent flow around the ship generated by the propellers and side thrusters. In this paper, three degrees of freedom equations of the motions of crabbing are derived. The equations are used to apply the adaptive backstepping control method to the auto-berthing controller of a cruise ship. The controller is capable of handling the system nonlinearity and uncertainty of the berthing process. A control allocation algorithm for a ship equipped with two propellers and two side thrusters is also developed, the performance of which is validated by simulation of auto-berthing.

  19. Evaluating sample allocation and effort in detecting population differentiation for discrete and continuously distributed individuals

    Science.gov (United States)

    Erin L. Landguth; Michael K. Schwartz

    2014-01-01

    One of the most pressing issues in spatial genetics concerns sampling. Traditionally, substructure and gene flow are estimated for individuals sampled within discrete populations. Because many species may be continuously distributed across a landscape without discrete boundaries, understanding sampling issues becomes paramount. Given large-scale, geographically broad...

  20. Discrete rate resource allocation for OFDMA cognitive radio systems with location information

    KAUST Repository

    Ben Ghorbel, Mahdi; Nam, Haewoon; Alouini, Mohamed-Slim

    2010-01-01

    In this paper we introduce a resource allocation algorithm based on location information for cognitive radio systems. The location information allows a practical implementation of cognitive radio systems when the channel state knowledge of the interference links with the primary users is not available. Using this information and measurements, the secondary users estimate the pathloss between the secondary and primary users to avoid interfering the primary users while sharing the frequency bands. The major improvement in this paper is low-complex algorithms for downlink and uplink resource allocations with integer bit distributions, where collocated subchannel constraint is considered in uplink case. We show, through numerical simulations, that for the downlink case, the proposed algorithm is indeed optimal while for the uplink case, it is near-optimal. ©2010 IEEE.

  1. Discrete rate resource allocation for OFDMA cognitive radio systems with location information

    KAUST Repository

    Ben Ghorbel, Mahdi

    2010-09-01

    In this paper we introduce a resource allocation algorithm based on location information for cognitive radio systems. The location information allows a practical implementation of cognitive radio systems when the channel state knowledge of the interference links with the primary users is not available. Using this information and measurements, the secondary users estimate the pathloss between the secondary and primary users to avoid interfering the primary users while sharing the frequency bands. The major improvement in this paper is low-complex algorithms for downlink and uplink resource allocations with integer bit distributions, where collocated subchannel constraint is considered in uplink case. We show, through numerical simulations, that for the downlink case, the proposed algorithm is indeed optimal while for the uplink case, it is near-optimal. ©2010 IEEE.

  2. An Evaluation of Different Training Sample Allocation Schemes for Discrete and Continuous Land Cover Classification Using Decision Tree-Based Algorithms

    Directory of Open Access Journals (Sweden)

    René Roland Colditz

    2015-07-01

    Full Text Available Land cover mapping for large regions often employs satellite images of medium to coarse spatial resolution, which complicates mapping of discrete classes. Class memberships, which estimate the proportion of each class for every pixel, have been suggested as an alternative. This paper compares different strategies of training data allocation for discrete and continuous land cover mapping using classification and regression tree algorithms. In addition to measures of discrete and continuous map accuracy the correct estimation of the area is another important criteria. A subset of the 30 m national land cover dataset of 2006 (NLCD2006 of the United States was used as reference set to classify NADIR BRDF-adjusted surface reflectance time series of MODIS at 900 m spatial resolution. Results show that sampling of heterogeneous pixels and sample allocation according to the expected area of each class is best for classification trees. Regression trees for continuous land cover mapping should be trained with random allocation, and predictions should be normalized with a linear scaling function to correctly estimate the total area. From the tested algorithms random forest classification yields lower errors than boosted trees of C5.0, and Cubist shows higher accuracies than random forest regression.

  3. The liner shipping berth scheduling problem with transit times

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Plum, Christian E.M.; Pisinger, David

    2016-01-01

    In this paper speed optimization of an existing liner shipping network is solved by adjusting the port berth times. The objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times. To avoid too many changes to the time table, changes of port...

  4. Artificial neural network controller for automatic ship berthing using head-up coordinate system

    Directory of Open Access Journals (Sweden)

    Nam-Kyun Im

    2018-05-01

    Full Text Available The Artificial Neural Network (ANN model has been known as one of the most effective theories for automatic ship berthing, as it has learning ability and mimics the actions of the human brain when performing the stages of ship berthing. However, existing ANN controllers can only bring a ship into a berth in a certain port, where the inputs of the ANN are the same as those of the teaching data. This means that those ANN controllers must be retrained when the ship arrives to a new port, which is time-consuming and costly. In this research, by using the head-up coordinate system, which includes the relative bearing and distance from the ship to the berth, a novel ANN controller is proposed to automatically control the ship into the berth in different ports without retraining the ANN structure. Numerical simulations were performed to verify the effectiveness of the proposed controller. First, teaching data were created in the original port to train the neural network; then, the controller was tested for automatic berthing in other ports, where the initial conditions of the inputs in the head-up coordinate system were similar to those of the teaching data in the original port. The results showed that the proposed controller has good performance for ship berthing in ports. Keywords: Automatic ship berthing, ANN controller, Head-up coordinate system, Low speed, Relative bearing

  5. Fuel consumption and associated emissions from seagoing ships at berth derived from an on-board survey

    NARCIS (Netherlands)

    Hulskotte, J.H.J.; Denier van der Gon, H.A.C.

    2010-01-01

    A methodology is presented to estimate the emissions of ships at berth based on their actual fuel consumption and the fuel quality. Accurate estimates of emissions from ships at berth demand reliable knowledge of the fuel consumption while at berth and associated fuel characteristics. However,

  6. Analysis of dangerous area of single berth oil tanker operations based on CFD

    Science.gov (United States)

    Shi, Lina; Zhu, Faxin; Lu, Jinshu; Wu, Wenfeng; Zhang, Min; Zheng, Hailin

    2018-04-01

    Based on the single process in the liquid cargo tanker berths in the state as the research object, we analyzed the single berth oil tanker in the process of VOCs diffusion theory, built network model of VOCs diffusion with Gambit preprocessor, set up the simulation boundary conditions and simulated the five detection point sources in specific factors under the influence of VOCs concentration change with time by using Fluent software. We analyzed the dangerous area of single berth oil tanker operations through the diffusion of VOCs, so as to ensure the safe operation of oil tanker.

  7. Analysis of Protection Measures for Naval Vessels Berthed at Harbor Against Terrorist Attacks

    Science.gov (United States)

    2016-06-01

    of discriminating neutral vessels from threats. A naval vessel berthed at harbor is more susceptible to attack than a vessel in open seas. The...discriminating neutral vessels from threats. A naval vessel berthed at harbor is more susceptible to attack than a vessel in open seas. The chances of...this thesis. He was a source of inspiration, encouragement, and reassurance. Captain Jeffery E. Kline, I am really thankful to you for your ideas

  8. Consistently Trained Artificial Neural Network for Automatic Ship Berthing Control

    Directory of Open Access Journals (Sweden)

    Y.A. Ahmed

    2015-09-01

    Full Text Available In this paper, consistently trained Artificial Neural Network controller for automatic ship berthing is discussed. Minimum time course changing manoeuvre is utilised to ensure such consistency and a new concept named ‘virtual window’ is introduced. Such consistent teaching data are then used to train two separate multi-layered feed forward neural networks for command rudder and propeller revolution output. After proper training, several known and unknown conditions are tested to judge the effectiveness of the proposed controller using Monte Carlo simulations. After getting acceptable percentages of success, the trained networks are implemented for the free running experiment system to judge the network’s real time response for Esso Osaka 3-m model ship. The network’s behaviour during such experiments is also investigated for possible effect of initial conditions as well as wind disturbances. Moreover, since the final goal point of the proposed controller is set at some distance from the actual pier to ensure safety, therefore a study on automatic tug assistance is also discussed for the final alignment of the ship with actual pier.

  9. Marine environmental radioactivity surveys at nuclear submarine berths 2001

    International Nuclear Information System (INIS)

    Cowling, E.; Ball, R.; Simpson, C.

    2002-01-01

    This report presents the results of the marine environmental radioactivity monitoring surveys of intertidal and underwater areas around nuclear submarine berths which were carried out by DRPS during 2001. Also included are results of smaller scale intertidal surveys carried out by local staff but co-ordinated by DRPS. Cobalt-60, the nuclide of major importance in naval discharges, was detected in a number of samples but in many cases was attributable to discharges by other operators. Concentrations in any case were found to be low, and at no survey location did the calculated annual radiation dose commitment to the most exposed members of the general public due to the presence of cobalt-60 exceed 1% of the ICRP principal dose limit for members of the public (1000μSv). These results are consistent with those obtained in the independent monitoring programmes as reported in the Radioactivity in Food and the Environment (RIFE) annual reports. It is concluded that existing discharge arrangements are providing effective control over environmental levels of radioactivity, and that there has been no radiological hazard to any member of the general public during 2001 from the operation of nuclear powered submarines. (author)

  10. Simulation for assessment of bulk cargo berths number

    Science.gov (United States)

    Kuznetsov, A. L.; Kirichenko, A. V.; Slitsan, A. E.

    2017-10-01

    The world trade volumes of mineral resources have been growing constantly for decades, notwithstanding any economical crises. At the same time, the proximity of the bulk materials as products to the starting point of the integrated value added or logistic supply chain makes their unit price relatively low. This fact automatically causes a strong economic sensitivity of the supply chain to the level of operational expenses in every link. The core of the integrated logistic supply chain is its maritime segment, with the fleet and terminals (i.e. the cargo transportation system) serving as the base platform for it. In its turn, the terminal berths play a role of the interface between the fleet and the land-transportation sub-system. Current development of the maritime transportation technologies, ships and terminal specialization, vessel size growth, rationalization of route patterns, regionalization of trade etc., has made conventional calculation methods inadequate. The solution of the problem is in using object oriented simulation. At the same time, this approch usually assumes only ad hoc models. Thus, it does not provide the generality of its conventional analytical predecessors. The time and labor consumpting procedure of simulation results in a very narrow application domain of the model. This article describes a new simulation instrument, combining the generality of the analytical technoques with the efficiency of the object-oriented simulation. The approach implemented as a software module, which validity and adequacy are proved. The software was tested on several sea terminal design projects and confirmed its efficiency.

  11. HERMES docking/berthing system pilot study. Quantitative assessment

    International Nuclear Information System (INIS)

    Munoz Blasco, J.; Goicoechea Sanchez, F.J.

    1993-01-01

    This study falls within the framework of the incorporation of quantitative risk assessment to the activities planned for the ESA-HERMES project (ESA/ CNES). The main objective behind the study was the analysis and evaluation of the potential contribution of so-called probabilistic or quantitative safety analysis to the optimization of the safety development process for the systems carrying out the safety functions required by the new and complex HERMES Space Vehicle. For this purpose, a pilot study was considered a good start in quantitative safety assessments (QSA), as this approach has been frequently used in the past to establish a solid base in large-scale QSA application programs while avoiding considerable economic risks. It was finally decided to select the HERMES docking/berthing system with Man Tender Free Flyer as the case-study. This report describes the different steps followed in the study, along with the main insights obtained and the general conclusions drawn from the study results. (author)

  12. 76 FR 38155 - California State Nonroad Engine Pollution Control Standards; Ocean-Going Vessels At-Berth in...

    Science.gov (United States)

    2011-06-29

    ... ENVIRONMENTAL PROTECTION AGENCY [FRL-9426-9] California State Nonroad Engine Pollution Control... toxic control measures for auxiliary diesel engines operated on ocean-going vessels at-berth in... control measures (ATCM) for auxiliary diesel engines operated on ocean-going vessels at-berth in...

  13. Partial safety factors for berthing velocity and loads on marine structures

    NARCIS (Netherlands)

    Roubos, A.A.; Peters, D.J.; Groenewegen, Leon; Steenbergen, R.

    2018-01-01

    Design methods for marine structures have evolved into load and resistance factor design, however existing partial safety factors related to berthing velocity and loads have not been verified and validated by measurement campaigns. In this study, field observations of modern seagoing vessels

  14. Fuzzy containers allocation problem in maritime terminal

    Directory of Open Access Journals (Sweden)

    Seyed-Mohammad Seyed-Hosseini

    2009-09-01

    Full Text Available Normal.dotm 0 0 1 140 799 UPC 6 1 981 12.0 0 false 18 pt 18 pt 0 0 false false false /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-ascii-font-family:Cambria; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:??; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Cambria; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Containers allocation in terminals has attracted lots of research works due to practical & theoretical importance in transportation literature. In this paper, we developed a fuzzy mathematical programming model for solving problem of allocating the containers in terminal area. The objective is minimizing the total distance traversed by the containers from the ship to the terminal area they are assigned. Fuzzy set concepts are used to treat imprecision regarding the distances between berth and terminals area, number of containers in an arrived ship and estimation of available area in each terminal at a port. We proposed two types of models for optimistic and pessimistic situations. The proposed models have been coded in LINGO8.0 solver and a numerical example has been solved for illustration purpose. The full analysis of the proposed models can cause an optimum allocation of containers of several ships to different terminals of berths in fuzzy environment.

  15. ESG Allocations

    Data.gov (United States)

    Department of Housing and Urban Development — This report displays the Emergency Solutions Grants (ESG), formerly Emergency Shelter Grants, allocation by jurisdiction. The website allows users to look at...

  16. Improved Models to Integrated Berth Allocation-Quay Crane Assignment Problem: A Computational Comparison and Novel Solution Approaches

    DEFF Research Database (Denmark)

    Iris, Cagatay; Pacino, Dario; Røpke, Stefan

    of the vessels primarily depends on the number of containers to be handled and the number of cranes deployed, it would be beneficial to consider the integration of those two problems. This work extends the state-of-the-art by strengthening the current best mathematical formulation. Computational experiments...

  17. Hydrodynamic loads of sea waves on horizontal elements of berths with wave quenching chambers

    Directory of Open Access Journals (Sweden)

    Leshchenko Sergey Vladimirovich

    2014-05-01

    Full Text Available In the process of hydraulic structures design, in particular berths with wave cancelling structures, which serve to decrease the wave impact on structures, there appears a problem of vertical wave hydrodynamic loads calculation on floor slabs. In the existing normative documents there are no requirements on calculating vertical wave loads on the horizontal floor slabs of open-type structures (enveloping, mooring, approach trestles, etc. and stairs of sloping-staired open-type structures. A mathematical model is proposed for calculation of the vertical wave loads on the floor slab through moorings. The model is based on the theory of jet impact on a solid surface. The width of the wave crest, striking in the overlap of the pier, and its vertical velocity is determined by the linear wave theory. The coefficient of transmission of waves through wave quenching chambers is calculated according to the previously developed methods. Vertical wave loading is adjusted based on the ratio of the wave length and width of the overlay. Model validation is performed according to the hydraulic modelling interaction of waves with through berths in the port of Tuapse. 7 variants of their design were considered. Data mapping mathematical and hydraulic modeling showed them a close match.

  18. Target berthing and base reorientation of free-floating space robotic system after capturing

    Science.gov (United States)

    Xu, Wenfu; Li, Cheng; Liang, Bin; Xu, Yangsheng; Liu, Yu; Qiang, Wenyi

    2009-01-01

    Space robots are playing an increasingly important role in on-orbital servicing, including repairing, refueling, or de-orbiting the satellite. The target must be captured and berthed before the servicing task starts. However, the attitude of the base may lean much and needs re-orientating after capturing. In this paper, a method is proposed to berth the target, and re-orientate the base at the same time, using manipulator motion only. Firstly, the system state is formed of the attitude quaternion and joint variables, and the joint paths are parameterized by sinusoidal functions. Then, the trajectory planning is transformed to an optimization problem. The cost function, defined according to the accuracy requirements of system variables, is the function of the parameters to be determined. Finally, we solve the parameters using the particle swarm optimization algorithm. Two typical cases of the spacecraft with a 6-DOF manipulator are dynamically simulated, one is that the variation of base attitude is limited; the other is that both the base attitude and the joint rates are constrained. The simulation results verify the presented method.

  19. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2011-01-01

    The objectives of Discrete Mathematics (IDISM2) are: The introduction of the mathematics needed for analysis, design and verification of discrete systems, including the application within programming languages for computer systems. Having passed the IDISM2 course, the student will be able...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics......; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...

  20. Maintainability allocation

    International Nuclear Information System (INIS)

    Guyot, Christian.

    1980-06-01

    The author gives the general lines of a method for the allocation and for the evaluation of maintainability of complex systems which is to be developed during the conference. The maintainability objective is supposed to be formulated under the form of a mean time to repair (M.T.T.R.) [fr

  1. A NOVEL NUMERICAL MODEL APPROACH FOR EXAMINING SHIP BERTHING IMPACT ON FLOATING PIERS

    Directory of Open Access Journals (Sweden)

    AMIN CHEGENIZADEH

    2015-08-01

    Full Text Available This paper presents the results of an investigation into the impact of ship berthing upon floating piers using highly advanced numerical software Abaqus. The ship and floating piers were modeled as solid bodies. For the first time, the effect of soil on the total energy absorption of the system was considered using both elastic and elastic-perfectly plastic soil models. First the results for the elastic soil model were compared to and verified by the existing literature using a spring soil model.Then a continuum soil model was utilized instead of a spring soil model, with the results showing 27% higher energy absorption compared to the spring model. The investigation also considered a model with soil as an elastic-perfectly plastic material, being more aligned with the soil material’s real behavior. With this model the results produced 1% more energy absorption as the soil did not reach plastic failure.

  2. Marine environmental radioactivity surveys at nuclear submarine berths in the UK 1988

    International Nuclear Information System (INIS)

    1989-10-01

    This report presents results of the marine environmental radioactivity monitoring surveys of intertidal and underwater areas around nuclear submarine berths in the UK, including the US Naval Base at Holy Loch, carried out by DRPS during 1988. Also included are results of smaller scale intertidal surveys carried out by local staff but co-ordinated by DRPS, and as an Appendix a report by the US Navy detailing results of their environmental radioactivity monitoring programme at Holy Loch. Cobalt-60, the nuclide of major importance in naval discharges, was detected in a number of samples but in most cases attributable to discharges by other operators. Concentrations in any case were found to be low, and at no survey location did the calculated annual radiation dose commitment to the most exposed members of the general public due to the presence of cobalt-60 exceed 1% of the ICRP principal dose limit for members of the public (1mSv). (author)

  3. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2011-01-01

    ; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics...... to new problems. Relations and functions: Define a product set; define and apply equivalence relations; construct and apply functions. Apply these concepts to new problems. Natural numbers and induction: Define the natural numbers; apply the principle of induction to verify a selection of properties...

  4. Digital Discretion

    DEFF Research Database (Denmark)

    Busch, Peter Andre; Zinner Henriksen, Helle

    2018-01-01

    discretion is suggested to reduce this footprint by influencing or replacing their discretionary practices using ICT. What is less researched is whether digital discretion can cause changes in public policy outcomes, and under what conditions such changes can occur. Using the concept of public service values......This study reviews 44 peer-reviewed articles on digital discretion published in the period from 1998 to January 2017. Street-level bureaucrats have traditionally had a wide ability to exercise discretion stirring debate since they can add their personal footprint on public policies. Digital......, we suggest that digital discretion can strengthen ethical and democratic values but weaken professional and relational values. Furthermore, we conclude that contextual factors such as considerations made by policy makers on the macro-level and the degree of professionalization of street...

  5. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2010-01-01

    The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18...

  6. Discrete Mathematics

    DEFF Research Database (Denmark)

    Sørensen, John Aasted

    2010-01-01

    The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15...

  7. PTM Modeling of Dredged Suspended Sediment at Proposed Polaris Point and Ship Repair Facility CVN Berthing Sites - Apra Harbor, Guam

    Science.gov (United States)

    2017-09-01

    sedimentation outside of the channel footprint. For example, dredging near the edge of the footprint can be confined to time periods when tidal currents...Cases 1 or 2 due to the lower loss rate. Sedimentation rates outside the channel prism are further reduced because all sediment is introduced in the...ER D C/ CH L TR -1 7- 16 PTM Modeling of Dredged Suspended Sediment at Proposed Polaris Point and Ship Repair Facility CVN Berthing

  8. Guidance and Control of Position and Attitude for Rendezvous and Dock/Berthing with a Noncooperative/Target Spacecraft

    Directory of Open Access Journals (Sweden)

    Gilberto Arantes

    2014-01-01

    Full Text Available Noncooperative target spacecrafts are those assets in orbit that cannot convey any information about their states (position, attitude, and velocities or facilitate rendezvous and docking/berthing (RVD/B process. Designing a guidance, navigation, and control (GNC module for the chaser in a RVD/B mission with noncooperative target should be inevitably solved for on-orbit servicing technologies. The proximity operations and the guidance for achieving rendezvous problems are addressed in this paper. The out-of-plane maneuvers of proximity operations are explored with distinct subphases, including a chaser far approach in the target’s orbit to the first hold point and a closer approach to the final berthing location. Accordingly, guidance solutions are chosen for each subphase from the standard Hill based Closhessy-Willtshire (CW solution, elliptical fly-around, and Glideslope algorithms. The control is based on a linear quadratic regulator approach (LQR. At the final berthing location, attitude tracker based on a proportional derivative (PD form is tested to synchronize the chaser and target attitudes. The paper analyzes the performance of both controllers in terms of the tracking ability and the robustness. Finally, it prescribes any restrictions that may be imposed on the guidance during any subphase which can help to improve the controllers tracking ability.

  9. Marine environmental radioactivity surveys at nuclear submarine berths in the UK, 1989

    International Nuclear Information System (INIS)

    Fuller, D.; Casey, E.

    1990-12-01

    This report presents the results of the marine environmental radioactivity monitoring surveys of intertidal and underwater areas around nuclear submarine berths in the UK, including the US Naval Base at Holy Loch, which were carried out by Defence Radiological Protection Service (DRPS) during 1989. Also included are results of smaller scale intertidal surveys carried out by local staff but co-ordinated by DRPS, and as an Appendix a report by the US Navy detailing the results of their environmental radioactivity monitoring programme at Holy Loch. Cobalt-60, the nuclide of major importance in naval discharges, was detected in a number of samples but in most cases was attributable to discharges by other operators. Concentrations in any case were found to be low, and at no survey location did the calculated annual radiation dose commitment to the most exposed members of the general public due to the presence of cobalt-60 exceed 1% of the ICRP principal dose limit for members of the public (1mSv). It is concluded that existing discharge arrangements are providing effective control over environmental levels of cobalt-60, and that there has been no radiological hazard to any member of the general public during 1989 from the operation of nuclear powered submarines. These findings have been confirmed by independent monitoring undertaken by the Ministry of Agriculture, Fisheries and Food Directorate of Fisheries Research. (author)

  10. Marine environmental radioactivity surveys at nuclear submarine berths in the UK 1991

    International Nuclear Information System (INIS)

    1992-06-01

    This report presents the results of the marine environmental radioactivity monitoring surveys of intertidal and underwater areas around nuclear submarine berths in the UK, including the US Naval Base at Holy Loch, which were carried out by DRPS during 1991. Also included are results of smaller scale intertidal surveys carried out by local staff but co-ordinated by DRPS and, as an Appendix, a report by the US Navy detailing the results of their environmental monitoring programme at Holy Loch. Cobalt-60, the nuclide of major importance in naval discharges, was detected in a number of samples but in many cases was attributable to discharges by other operators. Concentrations in any case were found to be low, and at no survey location did the calculated annual radiation dose commitment to the most exposed members of the general public due to the presence of cobalt-60 exceed 1% of the ICRP principal dose limit for members of the public (1000 μSv). These results are consistent with those obtained in the independent monitoring programme undertaken by the Ministry of Agriculture Fisheries and Food Directorate of Fisheries Research. It is concluded that existing discharge arrangements are providing effective control over environmental levels of cobalt-60, and that there has been no radiological hazard to any member of the general public during 1991 from the operation of nuclear powered submarines. (author)

  11. Marine environmental radioactivity surveys at nuclear submarine berths in the UK, 1990

    International Nuclear Information System (INIS)

    Fuller, D.; Casey, E.

    1992-02-01

    This report presents the results of the marine environmental radioactivity monitoring surveys of intertidal and underwater areas around nuclear submarine berths in the UK, including the US Naval Base at Holy Loch, which were carried out by Defence Radiological Protection Service (DRPS) during 1990. Also included are results of smaller scale intertidal surveys carried out by local staff but coordinated by DRPS and, as an Appendix, a report by the US Navy detailing the results of their environmental monitoring programme at Holy Loch. Cobalt-60, the nuclide of major importance in naval discharges, was detected in a number of samples but in most cases was attributable to discharges by other operators. Concentrations in any case were found to be low, and at no survey location did the calculated annual radiation dose commitment to the most exposed members of the general public due to the presence of cobalt-60 exceed 1% of the ICRP principal dose limit for members of the public (1000 μSv). These results are consistent with those obtained in the independent monitoring programme undertaken by the Ministry of Agriculture Fisheries and Food Directorate of Fisheries Research. It is concluded that existing discharge arrangements are providing effective control over environmental levels of cobalt-60, and that there has been no radiological hazard to any member of the general public during 1990 from the operation of nuclear powered submarines. (author)

  12. Modeling of nitrogen oxides (NO(x)) concentrations resulting from ships at berth.

    Science.gov (United States)

    Abdul-Wahab, Sabah A; Elkamel, Ali; Al Balushi, Abdullah S; Al-Damkhi, Ali M; Siddiqui, Rafiq A

    2008-12-01

    Oxides of nitrogen (NO(x)) emissions from ships (marine vessels) contribute to poor air quality that negatively impacts public health and communities in coastal areas and far inland. These emissions often excessively harm human health, environment, wildlife habituates, and quality of life of communities and indigenous of people who live near ports. This study was conducted to assess the impact of NO(x) emissions origination from ships at berth on a nearby community. It was undertaken at Said Bin Sultan Naval base in Wullayat Al-Mussana (Sultanate of Oman) during the year 2005. The Industrial Source Complex Short Term (ISCST) model was adopted to determine the dispersion of NO(x) into port and beyond into surrounding urban areas. The hourly and monthly contours (isopleths) of NO(x) concentrations in and around the port were plotted. The results were analyzed to determine the affected area and the level of NO(x) concentrations. The highest concentration points in the studied area were also identified. The isopleths of NO(x) indicated that most shipping emissions of NO(x) occur at the port can be transported over land. The output results can help to derive advice of recommendations ships operators and environmentalists to take the correct decision to prevent workers and surrounded environment from pollution.

  13. Discrete mechanics

    CERN Document Server

    Caltagirone, Jean-Paul

    2014-01-01

    This book presents the fundamental principles of mechanics to re-establish the equations of Discrete Mechanics. It introduces physics and thermodynamics associated to the physical modeling.  The development and the complementarity of sciences lead to review today the old concepts that were the basis for the development of continuum mechanics. The differential geometry is used to review the conservation laws of mechanics. For instance, this formalism requires a different location of vector and scalar quantities in space. The equations of Discrete Mechanics form a system of equations where the H

  14. Discrete mechanics

    International Nuclear Information System (INIS)

    Lee, T.D.

    1985-01-01

    This paper reviews the role of time throughout all phases of mechanics: classical mechanics, non-relativistic quantum mechanics, and relativistic quantum theory. As an example of the relativistic quantum field theory, the case of a massless scalar field interacting with an arbitrary external current is discussed. The comparison between the new discrete theory and the usual continuum formalism is presented. An example is given of a two-dimensional random lattice and its duel. The author notes that there is no evidence that the discrete mechanics is more appropriate than the usual continuum mechanics

  15. Residency Allocation Database

    Data.gov (United States)

    Department of Veterans Affairs — The Residency Allocation Database is used to determine allocation of funds for residency programs offered by Veterans Affairs Medical Centers (VAMCs). Information...

  16. Transport Infrastructure Slot Allocation

    NARCIS (Netherlands)

    Koolstra, K.

    2005-01-01

    In this thesis, transport infrastructure slot allocation has been studied, focusing on selection slot allocation, i.e. on longer-term slot allocation decisions determining the traffic patterns served by infrastructure bottlenecks, rather than timetable-related slot allocation problems. The

  17. Discrete optimization

    CERN Document Server

    Parker, R Gary

    1988-01-01

    This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.Several appendixes are included which review the fundamental ideas o

  18. Discrete gradients in discrete classical mechanics

    International Nuclear Information System (INIS)

    Renna, L.

    1987-01-01

    A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated

  19. Ship nonlinear-feedback course keeping algorithm based on MMG model driven by bipolar sigmoid function for berthing

    Directory of Open Access Journals (Sweden)

    Qiang Zhang

    2017-09-01

    Full Text Available Course keeping is hard to implement under the condition of the propeller stopping or reversing at slow speed for berthing due to the ship's dynamic motion becoming highly nonlinear. To solve this problem, a practical Maneuvering Modeling Group (MMG ship mathematic model with propeller reversing transverse forces and low speed correction is first discussed to be applied for the right-handed single-screw ship. Secondly, a novel PID-based nonlinear feedback algorithm driven by bipolar sigmoid function is proposed. The PID parameters are determined by a closed-loop gain shaping algorithm directly, while the closed-loop gain shaping theory was employed for effects analysis of this algorithm. Finally, simulation experiments were carried out on an LPG ship. It is shown that the energy consumption and the smoothness performance of the nonlinear feedback control are reduced by 4.2% and 14.6% with satisfactory control effects; the proposed algorithm has the advantages of robustness, energy saving and safety in berthing practice.

  20. Discrete transforms

    CERN Document Server

    Firth, Jean M

    1992-01-01

    The analysis of signals and systems using transform methods is a very important aspect of the examination of processes and problems in an increasingly wide range of applications. Whereas the initial impetus in the development of methods appropriate for handling discrete sets of data occurred mainly in an electrical engineering context (for example in the design of digital filters), the same techniques are in use in such disciplines as cardiology, optics, speech analysis and management, as well as in other branches of science and engineering. This text is aimed at a readership whose mathematical background includes some acquaintance with complex numbers, linear differen­ tial equations, matrix algebra, and series. Specifically, a familiarity with Fourier series (in trigonometric and exponential forms) is assumed, and an exposure to the concept of a continuous integral transform is desirable. Such a background can be expected, for example, on completion of the first year of a science or engineering degree cour...

  1. A Two-Phase Model of Resource Allocation in Visual Working Memory

    Science.gov (United States)

    Ye, Chaoxiong; Hu, Zhonghua; Li, Hong; Ristaniemi, Tapani; Liu, Qiang; Liu, Taosheng

    2017-01-01

    Two broad theories of visual working memory (VWM) storage have emerged from current research, a discrete slot-based theory and a continuous resource theory. However, neither the discrete slot-based theory or continuous resource theory clearly stipulates how the mental commodity for VWM (discrete slot or continuous resource) is allocated.…

  2. Discrete Curvatures and Discrete Minimal Surfaces

    KAUST Repository

    Sun, Xiang

    2012-01-01

    This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads

  3. Mobile Ocean Test Berth Support: Cooperative Research and Development Final Report, CRADA Number CRD-10-413

    Energy Technology Data Exchange (ETDEWEB)

    LiVecchi, Albert [National Renewable Energy Lab. (NREL), Golden, CO (United States)

    2015-12-01

    The Northwest National Marine Renewable Energy Center (NNMREC), headquartered at the Oregon State University, is establishing the capabilities to test prototype wave energy conversion devices in the ocean. This CRADA will leverage the technical expertise and resources at NREL in the wind industry and in ocean engineering to support and enhance the development of the NNMREC Mobile Ocean Test Berth (MOTB). This CRADA will provide direct support to NNMREC by providing design evaluation and review of the MOTB, developing effective protocols for testing of the MOTB and wave energy conversion devices in the ocean, assisting in the specification of appropriate instrumentation and data acquisition packages, and providing guidance on obtaining and maintaining A2LA (American Association for Laboratory Accreditation) accreditation.

  4. Discrete Curvatures and Discrete Minimal Surfaces

    KAUST Repository

    Sun, Xiang

    2012-06-01

    This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads to great interest in studying discrete surfaces. With the rich smooth surface theory in hand, one would hope that this elegant theory can still be applied to the discrete counter part. Such a generalization, however, is not always successful. While discrete surfaces have the advantage of being finite dimensional, thus easier to treat, their geometric properties such as curvatures are not well defined in the classical sense. Furthermore, the powerful calculus tool can hardly be applied. The methods in this thesis, including angular defect formula, cotangent formula, parallel meshes, relative geometry etc. are approaches based on offset meshes or generalized offset meshes. As an important application, we discuss discrete minimal surfaces and discrete Koenigs meshes.

  5. Continuous integration congestion cost allocation based on sensitivity

    International Nuclear Information System (INIS)

    Wu, Z.Q.; Wang, Y.N.

    2004-01-01

    Congestion cost allocation is a very important topic in congestion management. Allocation methods based on the Aumann-Shapley value use the discrete numerical integration method, which needs to solve the incremented OPF solution many times, and as such it is not suitable for practical application to large-scale systems. The optimal solution and its sensitivity change tendency during congestion removal using a DC optimal power flow (OPF) process is analysed. A simple continuous integration method based on the sensitivity is proposed for the congestion cost allocation. The proposed sensitivity analysis method needs a smaller computation time than the method based on using the quadratic method and inner point iteration. The proposed congestion cost allocation method uses a continuous integration method rather than discrete numerical integration. The method does not need to solve the incremented OPF solutions; which allows it use in large-scale systems. The method can also be used for AC OPF congestion management. (author)

  6. Mimetic discretization methods

    CERN Document Server

    Castillo, Jose E

    2013-01-01

    To help solve physical and engineering problems, mimetic or compatible algebraic discretization methods employ discrete constructs to mimic the continuous identities and theorems found in vector calculus. Mimetic Discretization Methods focuses on the recent mimetic discretization method co-developed by the first author. Based on the Castillo-Grone operators, this simple mimetic discretization method is invariably valid for spatial dimensions no greater than three. The book also presents a numerical method for obtaining corresponding discrete operators that mimic the continuum differential and

  7. Time Discretization Techniques

    KAUST Repository

    Gottlieb, S.; Ketcheson, David I.

    2016-01-01

    The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include

  8. Risk capital allocation

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Smilgins, Aleksandrs

    Risk capital allocation problems have been widely discussed in the academic literature. We consider a company with multiple subunits having individual portfolios. Hence, when portfolios of subunits are merged, a diversification benefit arises: the risk of the company as a whole is smaller than...... the sum of the risks of the individual sub-units. The question is how to allocate the risk capital of the company among the subunits in a fair way. In this paper we propose to use the Lorenz set as an allocation method. We show that the Lorenz set is operational and coherent. Moreover, we propose a set...... of new axioms related directly to the problem of risk capital allocation and show that the Lorenz set satisfies these new axioms in contrast to other well-known coherent methods. Finally, we discuss how to deal with non-uniqueness of the Lorenz set....

  9. CPD Allocations and Awards

    Data.gov (United States)

    Department of Housing and Urban Development — The CPD Allocation and Award database provides filterable on-screen and exportable reports on select programs, such as the Community Development Block Grant Program,...

  10. A combinatorial approximation algorithm for CDMA downlink rate allocation

    NARCIS (Netherlands)

    Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard; Raghavan, S.; Anandalingam, G.

    2006-01-01

    This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

  11. A combinatorial approximation algorithm for CDMA downlink rate allocation

    NARCIS (Netherlands)

    Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard

    2004-01-01

    This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

  12. Allocating multiple units

    DEFF Research Database (Denmark)

    Tranæs, Torben; Krishna, Kala

    2002-01-01

    This paper studies the allocation and rent distribution in multi-unit, combinatorial-bid auctions under complete information. We focus on the natural multi-unit analogue of the first-price auction, where buyers bid total payments, pay their bids, and where the seller allocates goods to maximize his...... auction, which is the multi unit analogue of a second-price auction. Furthermore, we characterize these equilibria when valuations take a number of different forms: diminishing marginal valuations, increasing average valuations, and marginal valuations with single turning points...

  13. Treatment of uncertainties in the existence of free berths with risk analysis techniques. Establishment of policies in port of Cadiz (SPAIN)

    Energy Technology Data Exchange (ETDEWEB)

    Awad Nuñez, S.; Camarero Orive, A.; Romero Sanchez-Brunete, M.; Camarero Orive, A.; Gonzalez Cancelas, N.

    2016-07-01

    This research discusses the challenges involved in the treatment of uncertainties in the existence of free berths during the arrival of cruise ships at seaports. Pursuing this goal, a three-step methodology is adopted: 1) Identifying risk sources and critical risk variables and how they are related; 2) Fitting the Probability Distribution Functions that best represent the behaviour of each critical risk variable; and 3) Simulating the probability of a ship having to wait because there are no free berths using a technique that combines statistical concepts (random sampling) with the ability of computers to generate pseudo-random numbers and automate estimations of the values of the set of critical risk variables. The innovative use of risk analysis techniques in this field allows the establishment of policies to improve the planning and management of port infrastructure, for example, deciding when it is necessary to work to increase the number of berths. As a case of study, we applied this methodology to study whether the enlargement of the wharf in the port of Cadiz (Spain) is necessary right now considering the number of cruise ships that have arrived at the port in the past three years, their date and hour of arrival, their length and draught, the duration of their stay in port and their waiting time before being able to enter the port. This action would require moving logistics activities to a new terminal, but would bring to the city the opportunity to rethink the seafront, introducing new cruiser links with the city centre and developing a better seaport-city integration. (Author)

  14. Dépôt exceptionnel d'un portrait signé Berthe Morisot: le portrait de Jeanne Pontillon dans les collections du MAH

    OpenAIRE

    2016-01-01

    Tiré du site internet du blog des Musées d'art et d'histoire (http://blog.mahgeneve.ch): "Le Musée d'art et d'histoire a le privilège de s'être vu confier par la Société des Amis du MAH (SAMAH) le Portrait de Jeanne Pontillon par Berthe Morisot (1841–1895). Donné à l'association par l'un de ses fidèles membres, ce tableau représente un enrichissement de taille pour l'institution genevoise.".

  15. Baecklund transformations for discrete Painleve equations: Discrete PII-PV

    International Nuclear Information System (INIS)

    Sakka, A.; Mugan, U.

    2006-01-01

    Transformation properties of discrete Painleve equations are investigated by using an algorithmic method. This method yields explicit transformations which relates the solutions of discrete Painleve equations, discrete P II -P V , with different values of parameters. The particular solutions which are expressible in terms of the discrete analogue of the classical special functions of discrete Painleve equations can also be obtained from these transformations

  16. Discrete Gabor transform and discrete Zak transform

    NARCIS (Netherlands)

    Bastiaans, M.J.; Namazi, N.M.; Matthews, K.

    1996-01-01

    Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e. the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of

  17. Discrete Mathematics Re "Tooled."

    Science.gov (United States)

    Grassl, Richard M.; Mingus, Tabitha T. Y.

    1999-01-01

    Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

  18. Homogenization of discrete media

    International Nuclear Information System (INIS)

    Pradel, F.; Sab, K.

    1998-01-01

    Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.)

  19. Discrete density of states

    International Nuclear Information System (INIS)

    Aydin, Alhun; Sisman, Altug

    2016-01-01

    By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

  20. Discrete density of states

    Energy Technology Data Exchange (ETDEWEB)

    Aydin, Alhun; Sisman, Altug, E-mail: sismanal@itu.edu.tr

    2016-03-22

    By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.

  1. Discrete control systems

    CERN Document Server

    Okuyama, Yoshifumi

    2014-01-01

    Discrete Control Systems establishes a basis for the analysis and design of discretized/quantized control systemsfor continuous physical systems. Beginning with the necessary mathematical foundations and system-model descriptions, the text moves on to derive a robust stability condition. To keep a practical perspective on the uncertain physical systems considered, most of the methods treated are carried out in the frequency domain. As part of the design procedure, modified Nyquist–Hall and Nichols diagrams are presented and discretized proportional–integral–derivative control schemes are reconsidered. Schemes for model-reference feedback and discrete-type observers are proposed. Although single-loop feedback systems form the core of the text, some consideration is given to multiple loops and nonlinearities. The robust control performance and stability of interval systems (with multiple uncertainties) are outlined. Finally, the monograph describes the relationship between feedback-control and discrete ev...

  2. Discrete repulsive oscillator wavefunctions

    International Nuclear Information System (INIS)

    Munoz, Carlos A; Rueda-Paz, Juvenal; Wolf, Kurt Bernardo

    2009-01-01

    For the study of infinite discrete systems on phase space, the three-dimensional Lorentz algebra and group, so(2,1) and SO(2,1), provide a discrete model of the repulsive oscillator. Its eigenfunctions are found in the principal irreducible representation series, where the compact generator-that we identify with the position operator-has the infinite discrete spectrum of the integers Z, while the spectrum of energies is a double continuum. The right- and left-moving wavefunctions are given by hypergeometric functions that form a Dirac basis for l 2 (Z). Under contraction, the discrete system limits to the well-known quantum repulsive oscillator. Numerical computations of finite approximations raise further questions on the use of Dirac bases for infinite discrete systems.

  3. Discrete Element Modeling

    Energy Technology Data Exchange (ETDEWEB)

    Morris, J; Johnson, S

    2007-12-03

    The Distinct Element Method (also frequently referred to as the Discrete Element Method) (DEM) is a Lagrangian numerical technique where the computational domain consists of discrete solid elements which interact via compliant contacts. This can be contrasted with Finite Element Methods where the computational domain is assumed to represent a continuum (although many modern implementations of the FEM can accommodate some Distinct Element capabilities). Often the terms Discrete Element Method and Distinct Element Method are used interchangeably in the literature, although Cundall and Hart (1992) suggested that Discrete Element Methods should be a more inclusive term covering Distinct Element Methods, Displacement Discontinuity Analysis and Modal Methods. In this work, DEM specifically refers to the Distinct Element Method, where the discrete elements interact via compliant contacts, in contrast with Displacement Discontinuity Analysis where the contacts are rigid and all compliance is taken up by the adjacent intact material.

  4. Applied cost allocation

    DEFF Research Database (Denmark)

    Bogetoft, Peter; Hougaard, Jens Leth; Smilgins, Aleksandrs

    2016-01-01

    This paper deals with empirical computation of Aumann–Shapley cost shares for joint production. We show that if one uses a mathematical programing approach with its non-parametric estimation of the cost function there may be observations in the data set for which we have multiple Aumann–Shapley p...... of assumptions concerning firm behavior. These assumptions enable us to connect inefficient with efficient production and thereby provide consistent ways of allocating the costs arising from inefficiency....

  5. 76 FR 77515 - California State Nonroad Engine Pollution Control Standards; Ocean-Going Vessels At-Berth in...

    Science.gov (United States)

    2011-12-13

    ... direct contributors in its assignment of costs. PMSA presented each of these comments in the California... challenges overall cost-effectiveness of the regulation, how costs are allocated, and the variability of... development of the necessary technology giving appropriate consideration to the cost of compliance within that...

  6. Emissions allocation in transportation routes

    NARCIS (Netherlands)

    Leenders, B.P.J.; Velázquez Martínez, J.; Fransoo, J.C.

    2017-01-01

    This article studies the allocation of CO2 emissions to a specific shipment in routing transportation. The authors show that this problem differs from a cost allocation problem specifically because the concavity condition does not hold necessarily in the CO2 allocation problem. This implies that a

  7. Discrete Calculus by Analogy

    CERN Document Server

    Izadi, F A; Bagirov, G

    2009-01-01

    With its origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. The topics covered here usually arise in many branches of science and technology, especially in discrete mathematics, numerical analysis, statistics and probability theory as well as in electrical engineering, but our viewpoint here is that these topics belong to a much more general realm of mathematics; namely calculus and differential equations because of the remarkable analogy of the subject to this branch of mathemati

  8. Cost allocation with limited information

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    This article investigates progressive development of Aumann-Shapley cost allocation in a multilevel organizational or production structure. In particular, we study a linear parametric programming setup utilizing the Dantzig-Wolfe decomposition procedure. Typically cost allocation takes place after...... all activities have been performed, for example by finishing all outputs. Here the allocation is made progressively with suggestions for activities. I other words cost allocation is performed in parallel for example with a production planning process. This development does not require detailed...... information about some technical constraints in order to make the cost allocation....

  9. Finite Discrete Gabor Analysis

    DEFF Research Database (Denmark)

    Søndergaard, Peter Lempel

    2007-01-01

    frequency bands at certain times. Gabor theory can be formulated for both functions on the real line and for discrete signals of finite length. The two theories are largely the same because many aspects come from the same underlying theory of locally compact Abelian groups. The two types of Gabor systems...... can also be related by sampling and periodization. This thesis extends on this theory by showing new results for window construction. It also provides a discussion of the problems associated to discrete Gabor bases. The sampling and periodization connection is handy because it allows Gabor systems...... on the real line to be well approximated by finite and discrete Gabor frames. This method of approximation is especially attractive because efficient numerical methods exists for doing computations with finite, discrete Gabor systems. This thesis presents new algorithms for the efficient computation of finite...

  10. Adaptive Discrete Hypergraph Matching.

    Science.gov (United States)

    Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

    2018-02-01

    This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

  11. Discrete fractional calculus

    CERN Document Server

    Goodrich, Christopher

    2015-01-01

    This text provides the first comprehensive treatment of the discrete fractional calculus. Experienced researchers will find the text useful as a reference for discrete fractional calculus and topics of current interest. Students who are interested in learning about discrete fractional calculus will find this text to provide a useful starting point. Several exercises are offered at the end of each chapter and select answers have been provided at the end of the book. The presentation of the content is designed to give ample flexibility for potential use in a myriad of courses and for independent study. The novel approach taken by the authors includes a simultaneous treatment of the fractional- and integer-order difference calculus (on a variety of time scales, including both the usual forward and backwards difference operators). The reader will acquire a solid foundation in the classical topics of the discrete calculus while being introduced to exciting recent developments, bringing them to the frontiers of the...

  12. Discrete quantum gravity

    International Nuclear Information System (INIS)

    Williams, Ruth M

    2006-01-01

    A review is given of a number of approaches to discrete quantum gravity, with a restriction to those likely to be relevant in four dimensions. This paper is dedicated to Rafael Sorkin on the occasion of his sixtieth birthday

  13. Discrete computational structures

    CERN Document Server

    Korfhage, Robert R

    1974-01-01

    Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasize

  14. An integrated framework for transmission cost allocation retaining efficiency concepts

    Energy Technology Data Exchange (ETDEWEB)

    Lima, J.W. Marangon [Escola Federal de Engenharia de Itajuba, MG (Brazil); Gorenstin, B G; Vieira Filho, X [Centro de Pesquisas de Energia Eletrica (CEPEL), Rio de Janeiro, RJ (Brazil); Chipp, H J; Alvarenga Filho, S [ELETROBRAS, Rio de Janeiro, RJ (Brazil); Hirota, M [Companhia Energetica de Sao Paulo (CESP), SP (Brazil); Pereira, M V.F. [Power System Research, Inc., Rio de Janeiro, RJ (Brazil)

    1994-12-31

    This paper describes a methodology for allocating transmission costs among utilities and wheeling agents. The proposed approach is based on the extension of marginal cost theory to take into account discrete component sizes and economy of scale, while retaining desirable economic properties such as revenue reconciliation and incentives for all participants to remain in the pool. The methodology is illustrated in case studies with the Brazilian system. (author) 21 refs., 1 fig., 3 tabs.

  15. A latent class multiple constraint multiple discrete-continuous extreme value model of time use and goods consumption.

    Science.gov (United States)

    2016-06-01

    This paper develops a microeconomic theory-based multiple discrete continuous choice model that considers: (a) that both goods consumption and time allocations (to work and non-work activities) enter separately as decision variables in the utility fu...

  16. Theory of stable allocations

    Directory of Open Access Journals (Sweden)

    Pantelić Svetlana

    2014-01-01

    Full Text Available The Swedish Royal Academy awarded the 2012 Nobel Prize in Economics to Lloyd Shapley and Alvin Roth, for the theory of stable allocations and the practice of market design. These two American researchers worked independently from each other, combining basic theory and empirical investigations. Through their experiments and practical design they generated a flourishing field of research and improved the performance of many markets. Born in 1923 in Cambridge, Massachusetts, Shapley defended his doctoral thesis at Princeton University in 1953. For many years he worked at RAND, and for more than thirty years he was a professor at UCLA University. He published numerous scientific papers, either by himself or in cooperation with other economists.

  17. SSC accelerator availability allocation

    International Nuclear Information System (INIS)

    Dixon, K.T.; Franciscovich, J.

    1991-03-01

    Superconducting Super Collider (SSC) operational availability is an area of major concern, judged by the Central Design Group to present such risk that use of modern engineering tools would be essential to program success. Experience has shown that as accelerator beam availability falls below about 80%, efficiency of physics experiments degrades rapidly due to inability to maintain adequate coincident accelerator and detector operation. For this reason, the SSC availability goal has been set at 80%, even though the Fermi National Accelerator Laboratory accelerator, with a fraction of the SSC's complexity, has only recently approached that level. This paper describes the allocation of the top-level goal to part-level reliability and maintainability requirements, and it gives the results of parameter sensitivity studies designed to help identify the best approach to achieve the needed system availability within funding and schedule constraints. 1 ref., 12 figs., 4 tabs

  18. Homogenization of discrete media

    Energy Technology Data Exchange (ETDEWEB)

    Pradel, F.; Sab, K. [CERAM-ENPC, Marne-la-Vallee (France)

    1998-11-01

    Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.) 7 refs.

  19. Importance measures and resource allocation

    International Nuclear Information System (INIS)

    Guey, C.N.; Morgan, T.; Hughes, E.A.

    1987-01-01

    This paper discusses various importance measures and their practical relevance to allocating resources. The characteristics of importance measures are illustrated through simple examples. Important factors associated with effectively allocating resources to improve plant system performance or to prevent system degradation are discussed. It is concluded that importance measures are only indicative of and not equal to the risk significance of a component, system, or event. A decision framework is suggested to provide a comprehensive basis for resource allocation

  20. IPO Allocations: Discriminatory or Discretionary?

    OpenAIRE

    William Wilhelm; Alexander Ljungqvist

    2001-01-01

    We estimate the structural links between IPO allocations, pre-market information production, and initial underpricing returns, within the context of theories of bookbuilding. Using a sample of both US and international IPOs we find evidence of the following: ? IPO allocation policies favour institutional investors, both in the US and worldwide. ? Increasing institutional allocations results in offer prices that deviate more from the indicative price range established prior to bankers’ efforts...

  1. DISCRETE MATHEMATICS/NUMBER THEORY

    OpenAIRE

    Mrs. Manju Devi*

    2017-01-01

    Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics such as integers, graphs, and statements do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefore excludes topics in "continuous mathematics" such as calculus and analysis. Discrete objects can often be enumerated by ...

  2. Discrete-Event Simulation

    Directory of Open Access Journals (Sweden)

    Prateek Sharma

    2015-04-01

    Full Text Available Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of events in time. So this paper aims at introducing about Discrete-Event Simulation and analyzing how it is beneficial to the real world systems.

  3. Discrete systems and integrability

    CERN Document Server

    Hietarinta, J; Nijhoff, F W

    2016-01-01

    This first introductory text to discrete integrable systems introduces key notions of integrability from the vantage point of discrete systems, also making connections with the continuous theory where relevant. While treating the material at an elementary level, the book also highlights many recent developments. Topics include: Darboux and Bäcklund transformations; difference equations and special functions; multidimensional consistency of integrable lattice equations; associated linear problems (Lax pairs); connections with Padé approximants and convergence algorithms; singularities and geometry; Hirota's bilinear formalism for lattices; intriguing properties of discrete Painlevé equations; and the novel theory of Lagrangian multiforms. The book builds the material in an organic way, emphasizing interconnections between the various approaches, while the exposition is mostly done through explicit computations on key examples. Written by respected experts in the field, the numerous exercises and the thoroug...

  4. Discrete Sparse Coding.

    Science.gov (United States)

    Exarchakis, Georgios; Lücke, Jörg

    2017-11-01

    Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.

  5. Congestion Pricing for Aircraft Pushback Slot Allocation.

    Science.gov (United States)

    Liu, Lihua; Zhang, Yaping; Liu, Lan; Xing, Zhiwei

    2017-01-01

    In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the "external cost of surface congestion" is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm.

  6. Congestion Pricing for Aircraft Pushback Slot Allocation.

    Directory of Open Access Journals (Sweden)

    Lihua Liu

    Full Text Available In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the "external cost of surface congestion" is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm.

  7. Congestion Pricing for Aircraft Pushback Slot Allocation

    Science.gov (United States)

    Zhang, Yaping

    2017-01-01

    In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the “external cost of surface congestion” is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm. PMID:28114429

  8. Introductory discrete mathematics

    CERN Document Server

    Balakrishnan, V K

    2010-01-01

    This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.Chapters 0-3 cover fundamental operations involv

  9. Discrete-Event Simulation

    OpenAIRE

    Prateek Sharma

    2015-01-01

    Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of ev...

  10. Zinc allocation and re-allocation in rice

    NARCIS (Netherlands)

    Stomph, T.J.; Jiang, W.; Putten, van der P.E.L.; Struik, P.C.

    2014-01-01

    Aims: Agronomy and breeding actively search for options to enhance cereal grain Zn density. Quantifying internal (re-)allocation of Zn as affected by soil and crop management or genotype is crucial. We present experiments supporting the development of a conceptual model of whole plant Zn allocation

  11. Research on allocation efficiency of the daisy chain allocation algorithm

    Science.gov (United States)

    Shi, Jingping; Zhang, Weiguo

    2013-03-01

    With the improvement of the aircraft performance in reliability, maneuverability and survivability, the number of the control effectors increases a lot. How to distribute the three-axis moments into the control surfaces reasonably becomes an important problem. Daisy chain method is simple and easy to be carried out in the design of the allocation system. But it can not solve the allocation problem for entire attainable moment subset. For the lateral-directional allocation problem, the allocation efficiency of the daisy chain can be directly measured by the area of its subset of attainable moments. Because of the non-linear allocation characteristic, the subset of attainable moments of daisy-chain method is a complex non-convex polygon, and it is difficult to solve directly. By analyzing the two-dimensional allocation problems with a "micro-element" idea, a numerical calculation algorithm is proposed to compute the area of the non-convex polygon. In order to improve the allocation efficiency of the algorithm, a genetic algorithm with the allocation efficiency chosen as the fitness function is proposed to find the best pseudo-inverse matrix.

  12. Efficient Metropolitan Resource Allocation

    Directory of Open Access Journals (Sweden)

    Richard Arnott

    2016-05-01

    Full Text Available Over the past 30 years Calgary has doubled in size, from a population of 640,645 in 1985 to 1,230,915 in 2015. During that time the City has had five different mayors, hosted the Winter Olympics, and expanded the C-Train from 25 platforms to 45. Calgary’s Metropolitan Area has grown too, with Airdrie, Chestermere, Okotoks and Cochrane growing into full-fledged cities, ripe with inter-urban commuters.* And with changes to provincial legislation in the mid-’90s, rural Rocky View County and the Municipal District of Foothills are now real competitors for residential, commercial and industrial development that in the past would have been considered urban. In this metropolitan system, where people live, their household structure, and their place of work informs the services they need to conduct their daily lives, and directly impacts the spatial character of the City and the broader region. In sum, Metropolitan Calgary is increasingly complex. Calgary and the broader metropolitan area will continue to grow, even with the current economic slowdown. Frictions within Calgary, between the various municipalities in the metropolitan area, and the priorities of other local authorities (such as the School Boards and Alberta Health Services will continue to impact the agendas of local politicians and their ability to answer to the needs of their residents. How resources – whether it is hard infrastructure, affordable housing, classrooms, or hospital beds – are allocated over space and how these resources are funded, directly impacts these relationships. This technical paper provides my perspective as an urban economist on the efficient allocation of resources within a metropolitan system in general, with reference to Calgary where appropriate, and serves as a companion to the previously released “Reflections on Calgary’s Spatial Structure: An Urban Economists Critique of Municipal Planning in Calgary.” It is hoped that the concepts reviewed

  13. Discrete-Time Systems

    Indian Academy of Sciences (India)

    We also describe discrete-time systems in terms of difference ... A more modern alternative, especially for larger systems, is to convert ... In other words, ..... picture?) State-variable equations are also called state-space equations because the ...

  14. Discrete Lorentzian quantum gravity

    NARCIS (Netherlands)

    Loll, R.

    2000-01-01

    Just as for non-abelian gauge theories at strong coupling, discrete lattice methods are a natural tool in the study of non-perturbative quantum gravity. They have to reflect the fact that the geometric degrees of freedom are dynamical, and that therefore also the lattice theory must be formulated

  15. What Is Discrete Mathematics?

    Science.gov (United States)

    Sharp, Karen Tobey

    This paper cites information received from a number of sources, e.g., mathematics teachers in two-year colleges, publishers, and convention speakers, about the nature of discrete mathematics and about what topics a course in this subject should contain. Note is taken of the book edited by Ralston and Young which discusses the future of college…

  16. Endogeneously arising network allocation rules

    NARCIS (Netherlands)

    Slikker, M.

    2006-01-01

    In this paper we study endogenously arising network allocation rules. We focus on three allocation rules: the Myerson value, the position value and the component-wise egalitarian solution. For any of these three rules we provide a characterization based on component efficiency and some balanced

  17. Carbon allocation in forest ecosystems

    Science.gov (United States)

    Creighton M. Litton; James W. Raich; Michael G. Ryan

    2007-01-01

    Carbon allocation plays a critical role in forest ecosystem carbon cycling. We reviewed existing literature and compiled annual carbon budgets for forest ecosystems to test a series of hypotheses addressing the patterns, plasticity, and limits of three components of allocation: biomass, the amount of material present; flux, the flow of carbon to a component per unit...

  18. Risk allocation under liquidity constraints

    NARCIS (Netherlands)

    Csóka, P.; Herings, P.J.J.

    2013-01-01

    Risk allocation games are cooperative games that are used to attribute the risk of a financial entity to its divisions. In this paper, we extend the literature on risk allocation games by incorporating liquidity considerations. A liquidity policy specifies state-dependent liquidity requirements that

  19. Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

    KAUST Repository

    Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

    2017-01-01

    A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy

  20. Discrete mKdV and discrete sine-Gordon flows on discrete space curves

    International Nuclear Information System (INIS)

    Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

    2014-01-01

    In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)

  1. Discrete mathematics with applications

    CERN Document Server

    Koshy, Thomas

    2003-01-01

    This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations* Weaves numerous applications into the text* Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects*...

  2. Discrete and computational geometry

    CERN Document Server

    Devadoss, Satyan L

    2011-01-01

    Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also fe...

  3. Lectures on discrete geometry

    CERN Document Server

    2002-01-01

    Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields such as computational geometry or combinatorial optimization. This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections and thus it can serve as a collection of surveys in several narrower subfields. The main topics include: basics on convex sets, convex polytopes, and hyperplane arrangements; combinatorial complexity of geometric configurations; intersection patterns and transversals of convex sets; geometric Ramsey-type results; polyhedral combinatorics and high-dimensional convexity; and lastly, embeddings of finite metric spaces into normed spaces. Jiri Matousek is Professor of Com...

  4. Time Discretization Techniques

    KAUST Repository

    Gottlieb, S.

    2016-10-12

    The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include multistep, multistage, or multiderivative methods, as well as a combination of these approaches. The time step constraint is mainly a result of the absolute stability requirement, as well as additional conditions that mimic physical properties of the solution, such as positivity or total variation stability. These conditions may be required for stability when the solution develops shocks or sharp gradients. This chapter contains a review of some of the methods historically used for the evolution of hyperbolic PDEs, as well as cutting edge methods that are now commonly used.

  5. Zinc allocation and re-allocation in rice

    Science.gov (United States)

    Stomph, Tjeerd Jan; Jiang, Wen; Van Der Putten, Peter E. L.; Struik, Paul C.

    2014-01-01

    Aims: Agronomy and breeding actively search for options to enhance cereal grain Zn density. Quantifying internal (re-)allocation of Zn as affected by soil and crop management or genotype is crucial. We present experiments supporting the development of a conceptual model of whole plant Zn allocation and re-allocation in rice. Methods: Two solution culture experiments using 70Zn applications at different times during crop development and an experiment on within-grain distribution of Zn are reported. In addition, results from two earlier published experiments are re-analyzed and re-interpreted. Results: A budget analysis showed that plant zinc accumulation during grain filling was larger than zinc allocation to the grains. Isotope data showed that zinc taken up during grain filling was only partly transported directly to the grains and partly allocated to the leaves. Zinc taken up during grain filling and allocated to the leaves replaced zinc re-allocated from leaves to grains. Within the grains, no major transport barrier was observed between vascular tissue and endosperm. At low tissue Zn concentrations, rice plants maintained concentrations of about 20 mg Zn kg−1 dry matter in leaf blades and reproductive tissues, but let Zn concentrations in stems, sheath, and roots drop below this level. When plant zinc concentrations increased, Zn levels in leaf blades and reproductive tissues only showed a moderate increase while Zn levels in stems, roots, and sheaths increased much more and in that order. Conclusions: In rice, the major barrier to enhanced zinc allocation towards grains is between stem and reproductive tissues. Enhancing root to shoot transfer will not contribute proportionally to grain zinc enhancement. PMID:24478788

  6. Discrete pseudo-integrals

    Czech Academy of Sciences Publication Activity Database

    Mesiar, Radko; Li, J.; Pap, E.

    2013-01-01

    Roč. 54, č. 3 (2013), s. 357-364 ISSN 0888-613X R&D Projects: GA ČR GAP402/11/0378 Institutional support: RVO:67985556 Keywords : concave integral * pseudo-addition * pseudo-multiplication Subject RIV: BA - General Mathematics Impact factor: 1.977, year: 2013 http://library.utia.cas.cz/separaty/2013/E/mesiar-discrete pseudo-integrals.pdf

  7. Discrete variational Hamiltonian mechanics

    International Nuclear Information System (INIS)

    Lall, S; West, M

    2006-01-01

    The main contribution of this paper is to present a canonical choice of a Hamiltonian theory corresponding to the theory of discrete Lagrangian mechanics. We make use of Lagrange duality and follow a path parallel to that used for construction of the Pontryagin principle in optimal control theory. We use duality results regarding sensitivity and separability to show the relationship between generating functions and symplectic integrators. We also discuss connections to optimal control theory and numerical algorithms

  8. Discrete Routh reduction

    International Nuclear Information System (INIS)

    Jalnapurkar, Sameer M; Leok, Melvin; Marsden, Jerrold E; West, Matthew

    2006-01-01

    This paper develops the theory of Abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with Abelian symmetry. The reduction of variational Runge-Kutta discretizations is considered, as well as the extent to which symmetry reduction and discretization commute. These reduced methods allow the direct simulation of dynamical features such as relative equilibria and relative periodic orbits that can be obscured or difficult to identify in the unreduced dynamics. The methods are demonstrated for the dynamics of an Earth orbiting satellite with a non-spherical J 2 correction, as well as the double spherical pendulum. The J 2 problem is interesting because in the unreduced picture, geometric phases inherent in the model and those due to numerical discretization can be hard to distinguish, but this issue does not appear in the reduced algorithm, where one can directly observe interesting dynamical structures in the reduced phase space (the cotangent bundle of shape space), in which the geometric phases have been removed. The main feature of the double spherical pendulum example is that it has a non-trivial magnetic term in its reduced symplectic form. Our method is still efficient as it can directly handle the essential non-canonical nature of the symplectic structure. In contrast, a traditional symplectic method for canonical systems could require repeated coordinate changes if one is evoking Darboux' theorem to transform the symplectic structure into canonical form, thereby incurring additional computational cost. Our method allows one to design reduced symplectic integrators in a natural way, despite the non-canonical nature of the symplectic structure

  9. Discrete port-Hamiltonian systems

    NARCIS (Netherlands)

    Talasila, V.; Clemente-Gallardo, J.; Schaft, A.J. van der

    2006-01-01

    Either from a control theoretic viewpoint or from an analysis viewpoint it is necessary to convert smooth systems to discrete systems, which can then be implemented on computers for numerical simulations. Discrete models can be obtained either by discretizing a smooth model, or by directly modeling

  10. A paradigm for discrete physics

    International Nuclear Information System (INIS)

    Noyes, H.P.; McGoveran, D.; Etter, T.; Manthey, M.J.; Gefwert, C.

    1987-01-01

    An example is outlined for constructing a discrete physics using as a starting point the insight from quantum physics that events are discrete, indivisible and non-local. Initial postulates are finiteness, discreteness, finite computability, absolute nonuniqueness (i.e., homogeneity in the absence of specific cause) and additivity

  11. International Development Aid Allocation Determinants

    OpenAIRE

    Tapas Mishra; Bazoumana Ouattara; Mamata Parhi

    2012-01-01

    This paper investigates the factors explaining aid allocation by bilateral and multilateral donors. We use data for 146 aid recipient countries over the period 1990-2007 and employ Bayesian Averaging of Classical Estimates Approach (BACE) approach and find that both the recipient need and donor interest motives are `significant' determinants of bilateral and multilateral aid allocation process. Our results also indicate that the measures for recipient need and donor interests vary from bilate...

  12. Application of an allocation methodology

    International Nuclear Information System (INIS)

    Youngblood, R.

    1989-01-01

    This paper presents a method for allocating resources to elements of a system for the purpose of achieving prescribed levels of defense-in-depth at minimal cost. The method makes extensive use of logic modelling. An analysis of a simplified high-level waste repository is used as an illustrative application of the method. It is shown that it is possible to allocate quality control costs (or demonstrate performance) in an optimal way over elements of a conceptual design

  13. Two new discrete integrable systems

    International Nuclear Information System (INIS)

    Chen Xiao-Hong; Zhang Hong-Qing

    2013-01-01

    In this paper, we focus on the construction of new (1+1)-dimensional discrete integrable systems according to a subalgebra of loop algebra à 1 . By designing two new (1+1)-dimensional discrete spectral problems, two new discrete integrable systems are obtained, namely, a 2-field lattice hierarchy and a 3-field lattice hierarchy. When deriving the two new discrete integrable systems, we find the generalized relativistic Toda lattice hierarchy and the generalized modified Toda lattice hierarchy. Moreover, we also obtain the Hamiltonian structures of the two lattice hierarchies by means of the discrete trace identity

  14. How should INGOs allocate resources?

    Directory of Open Access Journals (Sweden)

    Scott Wisor

    2012-02-01

    Full Text Available International Non-governmental Organizations (INGOs face difficult choices when choosing to allocate resources. Given that the resources made available to INGOs fall far short of what is needed to reduce massive human rights deficits, any chosen scheme of resource allocation requires failing to reach other individuals in great need. Facing these moral opportunity costs, what moral reasons should guide INGO resource allocation? Two reasons that clearly matter, and are recognized by philosophers and development practitioners, are the consequences (or benefit or harm reduction of any given resource allocation and the need (or priority of individual beneficiaries. If accepted, these reasons should lead INGOs to allocate resources to a limited number of countries where the most prioritarian weighted harm reduction will be achieved. I make three critiques against this view. First, on grounds the consequentialist accepts, I argue that INGOs ought to maintain a reasonably wide distribution of resources. Second, I argue that even if one is a consequentialist, consequentialism ought not act as an action guiding principle for INGOs. Third, I argue that additional moral reasons should influence decision making about INGO resource allocation. Namely, INGO decision making should attend to relational reasons, desert, respect for agency, concern for equity, and the importance of expressing a view of moral wrongs.

  15. Discrete dark matter

    CERN Document Server

    Hirsch, M; Peinado, E; Valle, J W F

    2010-01-01

    We propose a new motivation for the stability of dark matter (DM). We suggest that the same non-abelian discrete flavor symmetry which accounts for the observed pattern of neutrino oscillations, spontaneously breaks to a Z2 subgroup which renders DM stable. The simplest scheme leads to a scalar doublet DM potentially detectable in nuclear recoil experiments, inverse neutrino mass hierarchy, hence a neutrinoless double beta decay rate accessible to upcoming searches, while reactor angle equal to zero gives no CP violation in neutrino oscillations.

  16. Discrete Dynamics Lab

    Science.gov (United States)

    Wuensche, Andrew

    DDLab is interactive graphics software for creating, visualizing, and analyzing many aspects of Cellular Automata, Random Boolean Networks, and Discrete Dynamical Networks in general and studying their behavior, both from the time-series perspective — space-time patterns, and from the state-space perspective — attractor basins. DDLab is relevant to research, applications, and education in the fields of complexity, self-organization, emergent phenomena, chaos, collision-based computing, neural networks, content addressable memory, genetic regulatory networks, dynamical encryption, generative art and music, and the study of the abstract mathematical/physical/dynamical phenomena in their own right.

  17. A Spectrum Allocation Mechanism Based on HJ-DQPSO for Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Zhu Jiang

    2015-11-01

    Full Text Available In cognitive radio network model consisting of secondary users and primary users, in order to solve the difficult multi-objective spectrum allocation issue about maximizing network efficiency and users’ fairness to access network, this paper proposes a new discrete multi-objective combinatorial optimization mechanism—HJ-DQPSO based on Hooke Jeeves (HJ and Quantum Particle Swarm Optimization (QPSO algorithm. The mechanism adopts HJ algorithm to local search to prevent falling into the local optimum, and proposes a discrete QPSO algorithm to match the discrete spectrum assignment model. The mechanism has the advantages of approximating optimal solution, rapid convergence, less parameters, avoiding falling into local optimum. Compared with existing spectrum assignment algorithms, the simulation results show that according to different optimization objectives, the HJ-DQPSO optimization mechanism for multi-objective optimization can better approximate optimal solution and converge fast. We can obtain a reasonable spectrum allocation scheme in the case of satisfying multiple optimization objectives.

  18. Finite discrete field theory

    International Nuclear Information System (INIS)

    Souza, Manoelito M. de

    1997-01-01

    We discuss the physical meaning and the geometric interpretation of implementation in classical field theories. The origin of infinities and other inconsistencies in field theories is traced to fields defined with support on the light cone; a finite and consistent field theory requires a light-cone generator as the field support. Then, we introduce a classical field theory with support on the light cone generators. It results on a description of discrete (point-like) interactions in terms of localized particle-like fields. We find the propagators of these particle-like fields and discuss their physical meaning, properties and consequences. They are conformally invariant, singularity-free, and describing a manifestly covariant (1 + 1)-dimensional dynamics in a (3 = 1) spacetime. Remarkably this conformal symmetry remains even for the propagation of a massive field in four spacetime dimensions. We apply this formalism to Classical electrodynamics and to the General Relativity Theory. The standard formalism with its distributed fields is retrieved in terms of spacetime average of the discrete field. Singularities are the by-products of the averaging process. This new formalism enlighten the meaning and the problem of field theory, and may allow a softer transition to a quantum theory. (author)

  19. Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations

    KAUST Repository

    Mohamed, Mamdouh S.

    2017-05-23

    A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy otherwise. The mimetic character of many of the DEC operators provides exact conservation of both mass and vorticity, in addition to superior kinetic energy conservation. The employment of barycentric Hodge star allows the discretization to admit arbitrary simplicial meshes. The discretization scheme is presented along with various numerical test cases demonstrating its main characteristics.

  20. Cost allocation in distribution planning

    Energy Technology Data Exchange (ETDEWEB)

    Engevall, S

    1997-12-31

    This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the {tau}-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m{sup 3} can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs

  1. Cost allocation in distribution planning

    Energy Technology Data Exchange (ETDEWEB)

    Engevall, S.

    1996-12-31

    This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the {tau}-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m{sup 3} can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs

  2. Cost allocation in distribution planning

    International Nuclear Information System (INIS)

    Engevall, S.

    1996-01-01

    This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the τ-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m 3 can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs

  3. Advances in discrete differential geometry

    CERN Document Server

    2016-01-01

    This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, ...

  4. Poisson hierarchy of discrete strings

    International Nuclear Information System (INIS)

    Ioannidou, Theodora; Niemi, Antti J.

    2016-01-01

    The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

  5. Poisson hierarchy of discrete strings

    Energy Technology Data Exchange (ETDEWEB)

    Ioannidou, Theodora, E-mail: ti3@auth.gr [Faculty of Civil Engineering, School of Engineering, Aristotle University of Thessaloniki, 54249, Thessaloniki (Greece); Niemi, Antti J., E-mail: Antti.Niemi@physics.uu.se [Department of Physics and Astronomy, Uppsala University, P.O. Box 803, S-75108, Uppsala (Sweden); Laboratoire de Mathematiques et Physique Theorique CNRS UMR 6083, Fédération Denis Poisson, Université de Tours, Parc de Grandmont, F37200, Tours (France); Department of Physics, Beijing Institute of Technology, Haidian District, Beijing 100081 (China)

    2016-01-28

    The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.

  6. Application of an allocation methodology

    International Nuclear Information System (INIS)

    Youngblood, R.; de Oliveira, L.F.S.

    1989-01-01

    This paper presents a method for allocating resources to elements of a system for the purpose of achieving prescribed levels of defense-in-depth at minimal cost. The method makes extensive use of logic modelling. An analysis of a simplified high-level waste repository is used as an illustrative application of the method. It is shown that it is possible to allocate quality control costs (or demonstrated performance) in an optimal way over elements of a conceptual design. 6 refs., 3 figs., 2 tabs

  7. Allocation Problems and Market Design

    DEFF Research Database (Denmark)

    Smilgins, Aleksandrs

    The thesis contains six independent papers with a common theme: Allocation problems and market design. The first paper is concerned with fair allocation of risk capital where independent autonomous subunits have risky activities and together constitute the entity's total risk, whose associated risk...... at a certain point in time involves countries that have excess demand and countries that have surplus of green energy. The problem addressed here is how the gains from trade ought to influence the way that members of the grid share common costs. The fifth paper extends the classical two-sided one...

  8. Principles of discrete time mechanics

    CERN Document Server

    Jaroszkiewicz, George

    2014-01-01

    Could time be discrete on some unimaginably small scale? Exploring the idea in depth, this unique introduction to discrete time mechanics systematically builds the theory up from scratch, beginning with the historical, physical and mathematical background to the chronon hypothesis. Covering classical and quantum discrete time mechanics, this book presents all the tools needed to formulate and develop applications of discrete time mechanics in a number of areas, including spreadsheet mechanics, classical and quantum register mechanics, and classical and quantum mechanics and field theories. A consistent emphasis on contextuality and the observer-system relationship is maintained throughout.

  9. Dark discrete gauge symmetries

    International Nuclear Information System (INIS)

    Batell, Brian

    2011-01-01

    We investigate scenarios in which dark matter is stabilized by an Abelian Z N discrete gauge symmetry. Models are surveyed according to symmetries and matter content. Multicomponent dark matter arises when N is not prime and Z N contains one or more subgroups. The dark sector interacts with the visible sector through the renormalizable kinetic mixing and Higgs portal operators, and we highlight the basic phenomenology in these scenarios. In particular, multiple species of dark matter can lead to an unconventional nuclear recoil spectrum in direct detection experiments, while the presence of new light states in the dark sector can dramatically affect the decays of the Higgs at the Tevatron and LHC, thus providing a window into the gauge origin of the stability of dark matter.

  10. Discrete anti-gravity

    International Nuclear Information System (INIS)

    Noyes, H.P.; Starson, S.

    1991-03-01

    Discrete physics, because it replaces time evolution generated by the energy operator with a global bit-string generator (program universe) and replaces ''fields'' with the relativistic Wheeler-Feynman ''action at a distance,'' allows the consistent formulation of the concept of signed gravitational charge for massive particles. The resulting prediction made by this version of the theory is that free anti-particles near the surface of the earth will ''fall'' up with the same acceleration that the corresponding particles fall down. So far as we can see, no current experimental information is in conflict with this prediction of our theory. The experiment crusis will be one of the anti-proton or anti-hydrogen experiments at CERN. Our prediction should be much easier to test than the small effects which those experiments are currently designed to detect or bound. 23 refs

  11. Regulating nutrient allocation in plants

    Science.gov (United States)

    Udvardi, Michael; Yang, Jiading; Worley, Eric

    2014-12-09

    The invention provides coding and promoter sequences for a VS-1 and AP-2 gene, which affects the developmental process of senescence in plants. Vectors, transgenic plants, seeds, and host cells comprising heterologous VS-1 and AP-2 genes are also provided. Additionally provided are methods of altering nutrient allocation and composition in a plant using the VS-1 and AP-2 genes.

  12. Centralized Allocation in Multiple Markets

    DEFF Research Database (Denmark)

    Monte, Daniel; Tumennasan, Norovsambuu

    The problem of allocating indivisible objects to different agents, where each indi vidual is assigned at most one object, has been widely studied. Pápai (2000) shows that the set of strategy-proof, nonbossy, Pareto optimal and reallocation-proof rules are hierarchical exchange rules | generalizat...... and nonbossy rules are sequential dictatorships, a special case of Pápai's hierarchical exchange rules....

  13. Designing for dynamic task allocation

    NARCIS (Netherlands)

    Dongen, van K.; Maanen, van P.P.

    2005-01-01

    Future platforms are envisioned in which human-machine teams are able to share and trade tasks as demands in situations change. It seems that human-machine coordination has not received the attention it deserves by past and present approaches to task allocation. In this paper a simple way to make

  14. Planning and Resource Allocation Management.

    Science.gov (United States)

    Coleman, Jack W.

    1986-01-01

    Modern scientific management techniques provide college administrators with valuable planning and resource allocation insights and enhances the decision process. The planning model should incorporate assessment, strategic planning, dynamic and long-term budgeting, operational planning, and feedback and control for actual operations. (MSE)

  15. Draft regulatory analysis: notice of proposed rulemaking motor gasoline allocation revisions

    Energy Technology Data Exchange (ETDEWEB)

    None

    1980-06-01

    The Draft Regulatory Analysis is prepared for those proposed regulations which either may have a major impact on the general economy, individual industries, or geographic regions and levels of government, or may be significant in that they affect important DOE policy concerns and are the object of public interest. The problems and proposed solutions for the Notice of Proposed Rulemaking and Public Hearings on the Motor Gasoline Allocation Program are examined. The ERA's mandate for this program is set out in the Emergency Petroleum Allocation Act of 1973. Under this Act, the President is empowered to enforce, at his discretion, price and allocation controls on petroleum and petroleum products, including gasoline, through September 30, 1981. The Act sets the following allocation goals: protect public health; maintain public services and agricultural operations; foster competition in the petroleum industry; distribute petroleum among industry sectors and US regions equitably; and minimize economic disruption and unnecessary interference wth market mechanisms.

  16. In search of informed discretion: an experimental investigation of fairness and trust reciprocity

    NARCIS (Netherlands)

    Maas, V.S.; van Rinsum, M.; Towry, K.

    2009-01-01

    This paper investigates managerial discretion in compensation decisions in a team (i.e., joint production) setting. Specifically, we investigate the conditions under which managers tasked with allocating a discretionary bonus pool are willing to incur a personal cost to obtain ex post

  17. Control of Discrete Event Systems

    NARCIS (Netherlands)

    Smedinga, Rein

    1989-01-01

    Systemen met discrete gebeurtenissen spelen in vele gebieden een rol. In dit proefschrift staat de volgorde van gebeurtenissen centraal en worden tijdsaspecten buiten beschouwing gelaten. In dat geval kunnen systemen met discrete gebeurtenissen goed worden gemodelleerd door gebruik te maken van

  18. Discrete Mathematics and Its Applications

    Science.gov (United States)

    Oxley, Alan

    2010-01-01

    The article gives ideas that lecturers of undergraduate Discrete Mathematics courses can use in order to make the subject more interesting for students and encourage them to undertake further studies in the subject. It is possible to teach Discrete Mathematics with little or no reference to computing. However, students are more likely to be…

  19. Discrete Mathematics and Curriculum Reform.

    Science.gov (United States)

    Kenney, Margaret J.

    1996-01-01

    Defines discrete mathematics as the mathematics necessary to effect reasoned decision making in finite situations and explains how its use supports the current view of mathematics education. Discrete mathematics can be used by curriculum developers to improve the curriculum for students of all ages and abilities. (SLD)

  20. Connections on discrete fibre bundles

    International Nuclear Information System (INIS)

    Manton, N.S.; Cambridge Univ.

    1987-01-01

    A new approach to gauge fields on a discrete space-time is proposed, in which the fundamental object is a discrete version of a principal fibre bundle. If the bundle is twisted, the gauge fields are topologically non-trivial automatically. (orig.)

  1. Discrete dynamics versus analytic dynamics

    DEFF Research Database (Denmark)

    Toxværd, Søren

    2014-01-01

    For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent...... of such an analytic analogy, exists an exact hidden energy invariance E * for VA dynamics. The fact that the discrete VA dynamics has the same invariances as Newtonian dynamics raises the question, which of the formulations that are correct, or alternatively, the most appropriate formulation of classical dynamics....... In this context the relation between the discrete VA dynamics and the (general) discrete dynamics investigated by Lee [Phys. Lett. B122, 217 (1983)] is presented and discussed....

  2. Modern approaches to discrete curvature

    CERN Document Server

    Romon, Pascal

    2017-01-01

     This book provides a valuable glimpse into discrete curvature, a rich new field of research which blends discrete mathematics, differential geometry, probability and computer graphics. It includes a vast collection of ideas and tools which will offer something new to all interested readers. Discrete geometry has arisen as much as a theoretical development as in response to unforeseen challenges coming from applications. Discrete and continuous geometries have turned out to be intimately connected. Discrete curvature is the key concept connecting them through many bridges in numerous fields: metric spaces, Riemannian and Euclidean geometries, geometric measure theory, topology, partial differential equations, calculus of variations, gradient flows, asymptotic analysis, probability, harmonic analysis, graph theory, etc. In spite of its crucial importance both in theoretical mathematics and in applications, up to now, almost no books have provided a coherent outlook on this emerging field.

  3. Discretion and Disproportionality

    Directory of Open Access Journals (Sweden)

    Jason A. Grissom

    2015-12-01

    Full Text Available Students of color are underrepresented in gifted programs relative to White students, but the reasons for this underrepresentation are poorly understood. We investigate the predictors of gifted assignment using nationally representative, longitudinal data on elementary students. We document that even among students with high standardized test scores, Black students are less likely to be assigned to gifted services in both math and reading, a pattern that persists when controlling for other background factors, such as health and socioeconomic status, and characteristics of classrooms and schools. We then investigate the role of teacher discretion, leveraging research from political science suggesting that clients of government services from traditionally underrepresented groups benefit from diversity in the providers of those services, including teachers. Even after conditioning on test scores and other factors, Black students indeed are referred to gifted programs, particularly in reading, at significantly lower rates when taught by non-Black teachers, a concerning result given the relatively low incidence of assignment to own-race teachers among Black students.

  4. Discrete Planck spectra

    International Nuclear Information System (INIS)

    Vlad, Valentin I.; Ionescu-Pallas, Nicholas

    2000-10-01

    The Planck radiation spectrum of ideal cubic and spherical cavities, in the region of small adiabatic invariance, γ = TV 1/3 , is shown to be discrete and strongly dependent on the cavity geometry and temperature. This behavior is the consequence of the random distribution of the state weights in the cubic cavity and of the random overlapping of the successive multiplet components, for the spherical cavity. The total energy (obtained by summing up the exact contributions of the eigenvalues and their weights, for low values of the adiabatic invariance) does not obey any longer Stefan-Boltzmann law. The new law includes a corrective factor depending on γ and imposes a faster decrease of the total energy to zero, for γ → 0. We have defined the double quantized regime both for cubic and spherical cavities by the superior and inferior limits put on the principal quantum numbers or the adiabatic invariance. The total energy of the double quantized cavities shows large differences from the classical calculations over unexpected large intervals, which are measurable and put in evidence important macroscopic quantum effects. (author)

  5. Berthe Morisot, catalogue de l'exposition au Palais des Beaux-Arts de Lille et à la Fondation Pierre Gianadda à Martigny, éd. Fondation Pierre Gianadda, 2002, 461 p.

    OpenAIRE

    Bonnet, Marie-Jo

    2004-01-01

    L'exposition Berthe Morisot organisée conjointement par le Palais des Beaux-Arts de Lille et la fondation Pierre Gianadda, à Martigny, ainsi que son catalogue peuvent être regardés comme un véritable événement. D'abord, saluons la fondation suisse qui fait un travail de fond remarquable depuis de nombreuses années en exposant (avec catalogue) des artistes françaises comme Camille Claudel, Suzanne Valadon, Marie Laurencin, en collaboration avec des musées de province. Notons ensuite que...

  6. The development of social-realistic «tropes» in the screenwriting of the early 1960s: based on Gennady Shpalikov’s screenplay «Berth»

    Directory of Open Access Journals (Sweden)

    Artemyeva E.A.

    2017-06-01

    Full Text Available the paper focuses on the development of the social-realistic tradition in the culture of the early 1960s. Special attention is paid to the first full-length feature Gennady Shpalikov’s screenplay «Berth», which is an example of the development and the change of social-realistic «tropes» in the screenwriting of «Ottepel / the Thaw»: «a positive hero», «big family» and «war». The author concludes that these fundamental «tropes» define all Shpalikov’s work, the screenwriting and the poetry.

  7. Learning and strategic asset allocation

    OpenAIRE

    Kearns, Michael

    2016-01-01

    This thesis investigates whether or not models that portray the relationship between what an investor learns and how he allocates his portfolio can explain phenomena related to household behaviour in the stock market. Endogenous modelling of household learning is utilised, which builds on a growing literature called bounded rationality with increasing explanatory power, offering an alternative to the classical rational expectations theory. Such phenomena include firstly why households often h...

  8. Perfect discretization of path integrals

    International Nuclear Information System (INIS)

    Steinhaus, Sebastian

    2012-01-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

  9. Perfect discretization of path integrals

    Science.gov (United States)

    Steinhaus, Sebastian

    2012-05-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

  10. The origin of discrete particles

    CERN Document Server

    Bastin, T

    2009-01-01

    This book is a unique summary of the results of a long research project undertaken by the authors on discreteness in modern physics. In contrast with the usual expectation that discreteness is the result of mathematical tools for insertion into a continuous theory, this more basic treatment builds up the world from the discrimination of discrete entities. This gives an algebraic structure in which certain fixed numbers arise. As such, one agrees with the measured value of the fine-structure constant to one part in 10,000,000 (10 7 ). Sample Chapter(s). Foreword (56 KB). Chapter 1: Introduction

  11. Resource allocation in networks via coalitional games

    NARCIS (Netherlands)

    Shams, F.

    2016-01-01

    The main goal of this dissertation is to manage resource allocation in network engineering problems and to introduce efficient cooperative algorithms to obtain high performance, ensuring fairness and stability. Specifically, this dissertation introduces new approaches for resource allocation in

  12. Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem

    Directory of Open Access Journals (Sweden)

    Jin Qin

    2012-01-01

    Full Text Available The combined simulated annealing (CSA algorithm was developed for the discrete facility location problem (DFLP in the paper. The method is a two-layer algorithm, in which the external subalgorithm optimizes the decision of the facility location decision while the internal subalgorithm optimizes the decision of the allocation of customer's demand under the determined location decision. The performance of the CSA is tested by 30 instances with different sizes. The computational results show that CSA works much better than the previous algorithm on DFLP and offers a new reasonable alternative solution method to it.

  13. Synchronization Techniques in Parallel Discrete Event Simulation

    OpenAIRE

    Lindén, Jonatan

    2018-01-01

    Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed. In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent ...

  14. 3-D Discrete Analytical Ridgelet Transform

    OpenAIRE

    Helbert , David; Carré , Philippe; Andrès , Éric

    2006-01-01

    International audience; In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines:...

  15. Asset Allocation of Mutual Fund Investors

    OpenAIRE

    Dengpan Luo

    2003-01-01

    This paper studies mutual fund investors' asset allocation decisions using monthly flow data of U.S mutual fund industry from 1984 to 1998. We find that mutual fund investors change their asset allocations between stocks and bonds in reaction to business conditions tracked by changes in expected stock market returns. They tend to allocate less into stock funds during the trough of a business cycle when expected stock market returns are higher and to allocate more into stock funds during the p...

  16. Optimal resource allocation for distributed video communication

    CERN Document Server

    He, Yifeng

    2013-01-01

    While most books on the subject focus on resource allocation in just one type of network, this book is the first to examine the common characteristics of multiple distributed video communication systems. Comprehensive and systematic, Optimal Resource Allocation for Distributed Video Communication presents a unified optimization framework for resource allocation across these systems. The book examines the techniques required for optimal resource allocation over Internet, wireless cellular networks, wireless ad hoc networks, and wireless sensor networks. It provides you with the required foundat

  17. Intelligent tactical asset allocation support system

    NARCIS (Netherlands)

    Hiemstra, Y.

    1995-01-01

    This paper presents an advanced support system for Tactical Asset Allocation. Asset allocation explains over 90% of portfolio performance (Brinson, Hood and Beebower, 1988). Tactical asset allocation adjusts a strategic portfolio on the basis of short term market outlooks. The system includes

  18. Exact analysis of discrete data

    CERN Document Server

    Hirji, Karim F

    2005-01-01

    Researchers in fields ranging from biology and medicine to the social sciences, law, and economics regularly encounter variables that are discrete or categorical in nature. While there is no dearth of books on the analysis and interpretation of such data, these generally focus on large sample methods. When sample sizes are not large or the data are otherwise sparse, exact methods--methods not based on asymptotic theory--are more accurate and therefore preferable.This book introduces the statistical theory, analysis methods, and computation techniques for exact analysis of discrete data. After reviewing the relevant discrete distributions, the author develops the exact methods from the ground up in a conceptually integrated manner. The topics covered range from univariate discrete data analysis, a single and several 2 x 2 tables, a single and several 2 x K tables, incidence density and inverse sampling designs, unmatched and matched case -control studies, paired binary and trinomial response models, and Markov...

  19. Discrete geometric structures for architecture

    KAUST Repository

    Pottmann, Helmut

    2010-01-01

    . The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization

  20. Causal Dynamics of Discrete Surfaces

    Directory of Open Access Journals (Sweden)

    Pablo Arrighi

    2014-03-01

    Full Text Available We formalize the intuitive idea of a labelled discrete surface which evolves in time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same.

  1. Perfect discretization of path integrals

    OpenAIRE

    Steinhaus, Sebastian

    2011-01-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discu...

  2. Applied discrete-time queues

    CERN Document Server

    Alfa, Attahiru S

    2016-01-01

    This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

  3. Tradable permit allocations and sequential choice

    Energy Technology Data Exchange (ETDEWEB)

    MacKenzie, Ian A. [Centre for Economic Research, ETH Zuerich, Zurichbergstrasse 18, 8092 Zuerich (Switzerland)

    2011-01-15

    This paper investigates initial allocation choices in an international tradable pollution permit market. For two sovereign governments, we compare allocation choices that are either simultaneously or sequentially announced. We show sequential allocation announcements result in higher (lower) aggregate emissions when announcements are strategic substitutes (complements). Whether allocation announcements are strategic substitutes or complements depends on the relationship between the follower's damage function and governments' abatement costs. When the marginal damage function is relatively steep (flat), allocation announcements are strategic substitutes (complements). For quadratic abatement costs and damages, sequential announcements provide a higher level of aggregate emissions. (author)

  4. Dynamic versus static allocation policies in multipurpose multireservoir systems

    Science.gov (United States)

    Tilmant, A.; Goor, Q.; Pinte, D.; van der Zaag, P.

    2007-12-01

    As the competition for water is likely to increase in the near future due to socioeconomic development and population growth, water resources managers will face hard choices when allocating water between competing users. Because water is a vital resource used in multiple sectors, including the environment, the allocation is inherently a political and social process, which is likely to become increasingly scrutinized as the competition grows between the different sectors. Since markets are usually absent or ineffective, the allocation of water between competing demands is achieved administratively taking into account key objectives such as economic efficiency, equity and maintaining the ecological integrity. When crop irrigation is involved, water is usually allocated by a system of annual rights to use a fixed, static, volume of water. In a fully-allocated basin, moving from a static to a dynamic allocation process, whereby the policies are regularly updated according to the hydrologic status of the river basin, is the first step towards the development of river basin management strategies that increase the productivity of water. More specifically, in a multipurpose multireservoir system, continuously adjusting release and withdrawal decisions based on the latest hydrologic information will increase the benefits derived from the system. However, the extent to which such an adjustment can be achieved results from complex spatial and temporal interactions between the physical characteristics of the water resources system (storage, natural flows), the economic and social consequences of rationing and the impacts on natural ecosystems. The complexity of the decision-making process, which requires the continuous evaluation of numerous trade-offs, calls for the use of integrated hydrologic-economic models. This paper compares static and dynamic management approaches for a cascade of hydropower-irrigation reservoirs using stochastic dual dynamic programming (SDDP

  5. Stochastic resource allocation in emergency departments with a multi-objective simulation optimization algorithm.

    Science.gov (United States)

    Feng, Yen-Yi; Wu, I-Chin; Chen, Tzu-Li

    2017-03-01

    The number of emergency cases or emergency room visits rapidly increases annually, thus leading to an imbalance in supply and demand and to the long-term overcrowding of hospital emergency departments (EDs). However, current solutions to increase medical resources and improve the handling of patient needs are either impractical or infeasible in the Taiwanese environment. Therefore, EDs must optimize resource allocation given limited medical resources to minimize the average length of stay of patients and medical resource waste costs. This study constructs a multi-objective mathematical model for medical resource allocation in EDs in accordance with emergency flow or procedure. The proposed mathematical model is complex and difficult to solve because its performance value is stochastic; furthermore, the model considers both objectives simultaneously. Thus, this study develops a multi-objective simulation optimization algorithm by integrating a non-dominated sorting genetic algorithm II (NSGA II) with multi-objective computing budget allocation (MOCBA) to address the challenges of multi-objective medical resource allocation. NSGA II is used to investigate plausible solutions for medical resource allocation, and MOCBA identifies effective sets of feasible Pareto (non-dominated) medical resource allocation solutions in addition to effectively allocating simulation or computation budgets. The discrete event simulation model of ED flow is inspired by a Taiwan hospital case and is constructed to estimate the expected performance values of each medical allocation solution as obtained through NSGA II. Finally, computational experiments are performed to verify the effectiveness and performance of the integrated NSGA II and MOCBA method, as well as to derive non-dominated medical resource allocation solutions from the algorithms.

  6. Cost allocation review : staff discussion paper

    International Nuclear Information System (INIS)

    2005-09-01

    This report addressed the need for updated cost allocation studies filed by local electricity distribution companies because they ensure that distribution rates for each customer class remain just and reasonable. According to the 2001 Electricity Distribution Rate Handbook, the Ontario Energy Board requires new cost allocation studies before implementing any future incentive regulation plans. A review of cost allocations allows the Board to consider the need for adjustments to the current share of distribution costs paid by different classes of ratepayers. This report included 14 sections to facilitate consultations with stakeholders on financial information requirements for cost allocation; directly assignable costs; functionalization; categorization; allocation methods; allocation of other costs; load data requirements; cost allocation implementation issues; addition of new rate class and rate design for scattered unmetered loads; addition of new rate class for larger users; rates to charge embedded distributors; treatment of the rate sub-classification identified as time-of-use; and, rate design implementation issues. 1 fig., 7 appendices

  7. Optimal Control of Micro Grid Operation Mode Seamless Switching Based on Radau Allocation Method

    Science.gov (United States)

    Chen, Xiaomin; Wang, Gang

    2017-05-01

    The seamless switching process of micro grid operation mode directly affects the safety and stability of its operation. According to the switching process from island mode to grid-connected mode of micro grid, we establish a dynamic optimization model based on two grid-connected inverters. We use Radau allocation method to discretize the model, and use Newton iteration method to obtain the optimal solution. Finally, we implement the optimization mode in MATLAB and get the optimal control trajectory of the inverters.

  8. Discrete Curvature Theories and Applications

    KAUST Repository

    Sun, Xiang

    2016-08-25

    Discrete Di erential Geometry (DDG) concerns discrete counterparts of notions and methods in di erential geometry. This thesis deals with a core subject in DDG, discrete curvature theories on various types of polyhedral surfaces that are practically important for free-form architecture, sunlight-redirecting shading systems, and face recognition. Modeled as polyhedral surfaces, the shapes of free-form structures may have to satisfy di erent geometric or physical constraints. We study a combination of geometry and physics { the discrete surfaces that can stand on their own, as well as having proper shapes for the manufacture. These proper shapes, known as circular and conical meshes, are closely related to discrete principal curvatures. We study curvature theories that make such surfaces possible. Shading systems of freeform building skins are new types of energy-saving structures that can re-direct the sunlight. From these systems, discrete line congruences across polyhedral surfaces can be abstracted. We develop a new curvature theory for polyhedral surfaces equipped with normal congruences { a particular type of congruences de ned by linear interpolation of vertex normals. The main results are a discussion of various de nitions of normality, a detailed study of the geometry of such congruences, and a concept of curvatures and shape operators associated with the faces of a triangle mesh. These curvatures are compatible with both normal congruences and the Steiner formula. In addition to architecture, we consider the role of discrete curvatures in face recognition. We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold, which is an extension of the classical notion of asymptotic directions. We get a simple expression of these cones for polyhedral surfaces, as well as convergence and approximation theorems. We use the asymptotic cones as facial descriptors and demonstrate the

  9. Allocation decisions in network industries

    Energy Technology Data Exchange (ETDEWEB)

    Bolle, Friedel [Europa-Universitaet Viadrina Frankfurt, Lehrstuhl Volkswirtschaftslehre, insbesondere Wirtschaftstheorie (Mikrooekonomie), Postfach 1786 15207 Frankfurt (Germany)

    2008-01-15

    In this paper, I want to propagate a new analytical tool: The usage of Menu Auctions for modelling complicated auctions, negotiations, rent seeking, etc. is advocated, because, contrary to 'normal' auctions and bargaining models, an arbitrary number of additional aspects can be taken into account. After concentrating on 'Truthful Equilibria' [Bernheim, B.D., Whinston, M.D., 1986. Menu auctions, resource allocation, and economic influence, Quarterly Journal of Economics, 1-31.] a certain broad class of Menu Auctions show unique and efficient allocations. Under an additional concavity condition even the equilibrium bids are unique. Two examples are discussed: the privatisation of a state-owned industry and the buying of wholesale electricity (concluding contracts with a number of producers) by a utility. These examples also serve to trace the sources of 'non-concavities' which can prevent the uniqueness of bids and can provide the auctioneer with incentives to exclude bidders from the competition. (author)

  10. Allocation - the Howe measurement challenges

    Energy Technology Data Exchange (ETDEWEB)

    Tierney, Jim; Moksnes, Paul Ove

    2005-07-01

    The Howe Field is located in the Central North Sea Block 22/12a approximately 160 km east of Aberdeen in a water depth of 85 m. The reservoir lies some 12 km east of the Shell operated Nelson Platform, which is situated in adjacent Block 22/11. The Howe project was initiated by Shell Exploration and Production to augment the operating life and production capacity of the Nelson platform, involving the development of an additional subset infrastructure and the installation of topside facilities. The owners of the Howe Field are Enterprise Oil PLC , Intrepid Energy and OMV. The Howe well fluids are commingled with Nelson fluids. Therefore, it is required to measure the Howe well fluids to differentiate between the fields and to determine how much money each partner is allocated. The commercial agreements have stipulated that the measurements of Howe fluids are required to be measured within an accuracy of +- 5% of reading. In addition to accuracy constraints, it was important to minimise capex to ensure the development was economically viable. Given this, multiphase metering was considered to be a solution for allocation between the different ownerships, as opposed to traditional separator metering. This paper will present the journey of the project activity through the selection criteria, flow loop test, installation, commissioning and the first 3 months of operation of the MPFM including verification with the Nelson test separator. Detailing with careful management and engineering support how to succeed with this type of application. (author) (tk)

  11. Analysis of Discrete Mittag - Leffler Functions

    Directory of Open Access Journals (Sweden)

    N. Shobanadevi

    2015-03-01

    Full Text Available Discrete Mittag - Leffler functions play a major role in the development of the theory of discrete fractional calculus. In the present article, we analyze qualitative properties of discrete Mittag - Leffler functions and establish sufficient conditions for convergence, oscillation and summability of the infinite series associated with discrete Mittag - Leffler functions.

  12. Foundations of a discrete physics

    International Nuclear Information System (INIS)

    McGoveran, D.; Noyes, P.

    1988-01-01

    Starting from the principles of finiteness, discreteness, finite computability and absolute nonuniqueness, we develop the ordering operator calculus, a strictly constructive mathematical system having the empirical properties required by quantum mechanical and special relativistic phenomena. We show how to construct discrete distance functions, and both rectangular and spherical coordinate systems(with a discrete version of ''π''). The richest discrete space constructible without a preferred axis and preserving translational and rotational invariance is shown to be a discrete 3-space with the usual symmetries. We introduce a local ordering parameter with local (proper) time-like properties and universal ordering parameters with global (cosmological) time-like properties. Constructed ''attribute velocities'' connect ensembles with attributes that are invariant as the appropriate time-like parameter increases. For each such attribute, we show how to construct attribute velocities which must satisfy the '' relativistic Doppler shift'' and the ''relativistic velocity composition law,'' as well as the Lorentz transformations. By construction, these velocities have finite maximum and minimum values. In the space of all attributes, the minimum of these maximum velocities will predominate in all multiple attribute computations, and hence can be identified as a fundamental limiting velocity, General commutation relations are constructed which under the physical interpretation are shown to reduce to the usual quantum mechanical commutation relations. 50 refs., 18 figs

  13. Discrete differential geometry. Consistency as integrability

    OpenAIRE

    Bobenko, Alexander I.; Suris, Yuri B.

    2005-01-01

    A new field of discrete differential geometry is presently emerging on the border between differential and discrete geometry. Whereas classical differential geometry investigates smooth geometric shapes (such as surfaces), and discrete geometry studies geometric shapes with finite number of elements (such as polyhedra), the discrete differential geometry aims at the development of discrete equivalents of notions and methods of smooth surface theory. Current interest in this field derives not ...

  14. Integrable structure in discrete shell membrane theory.

    Science.gov (United States)

    Schief, W K

    2014-05-08

    We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory.

  15. Degree distribution in discrete case

    International Nuclear Information System (INIS)

    Wang, Li-Na; Chen, Bin; Yan, Zai-Zai

    2011-01-01

    Vertex degree of many network models and real-life networks is limited to non-negative integer. By means of measure and integral, the relation of the degree distribution and the cumulative degree distribution in discrete case is analyzed. The degree distribution, obtained by the differential of its cumulative, is only suitable for continuous case or discrete case with constant degree change. When degree change is not a constant but proportional to degree itself, power-law degree distribution and its cumulative have the same exponent and the mean value is finite for power-law exponent greater than 1. -- Highlights: → Degree change is the crux for using the cumulative degree distribution method. → It suits for discrete case with constant degree change. → If degree change is proportional to degree, power-law degree distribution and its cumulative have the same exponent. → In addition, the mean value is finite for power-law exponent greater than 1.

  16. On the discrete Gabor transform and the discrete Zak transform

    NARCIS (Netherlands)

    Bastiaans, M.J.; Geilen, M.C.W.

    1996-01-01

    Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal (or synthesis window) and the inverse operation -- the Gabor transform -- with which Gabor's expansion coefficients can be determined, are introduced. It is shown how, in the case of a

  17. Discrete Choice and Rational Inattention

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Melo, Emerson; de Palma, André

    2017-01-01

    This paper establishes a general equivalence between discrete choice and rational inattention models. Matejka and McKay (2015, AER) showed that when information costs are modelled using the Shannon entropy, the result- ing choice probabilities in the rational inattention model take the multinomial...... logit form. We show that when information costs are modelled using a class of generalized entropies, then the choice probabilities in any rational inattention model are observationally equivalent to some additive random utility discrete choice model and vice versa. This equivalence arises from convex...

  18. Transmission usage cost allocation schemes

    International Nuclear Information System (INIS)

    Abou El Ela, A.A.; El-Sehiemy, R.A.

    2009-01-01

    This paper presents different suggested transmission usage cost allocation (TCA) schemes to the system individuals. Different independent system operator (ISO) visions are presented using the proportional rata and flow-based TCA methods. There are two proposed flow-based TCA schemes (FTCA). The first FTCA scheme generalizes the equivalent bilateral exchanges (EBE) concepts for lossy networks through two-stage procedure. The second FTCA scheme is based on the modified sensitivity factors (MSF). These factors are developed from the actual measurements of power flows in transmission lines and the power injections at different buses. The proposed schemes exhibit desirable apportioning properties and are easy to implement and understand. Case studies for different loading conditions are carried out to show the capability of the proposed schemes for solving the TCA problem. (author)

  19. Intelligent tactical asset allocation support system

    OpenAIRE

    Hiemstra, Y.

    1995-01-01

    This paper presents an advanced support system for Tactical Asset Allocation. Asset allocation explains over 90% of portfolio performance (Brinson, Hood and Beebower, 1988). Tactical asset allocation adjusts a strategic portfolio on the basis of short term market outlooks. The system includes aprediction model that forecasts quarterly excess returns on the S and PSOO, an optimization model that adjusts a user-specified strategic portfolio on thebasis of the excess return forecast, and a compo...

  20. An intelligent allocation algorithm for parallel processing

    Science.gov (United States)

    Carroll, Chester C.; Homaifar, Abdollah; Ananthram, Kishan G.

    1988-01-01

    The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

  1. Cognitive radio networks dynamic resource allocation schemes

    CERN Document Server

    Wang, Shaowei

    2014-01-01

    This SpringerBrief presents a survey of dynamic resource allocation schemes in Cognitive Radio (CR) Systems, focusing on the spectral-efficiency and energy-efficiency in wireless networks. It also introduces a variety of dynamic resource allocation schemes for CR networks and provides a concise introduction of the landscape of CR technology. The author covers in detail the dynamic resource allocation problem for the motivations and challenges in CR systems. The Spectral- and Energy-Efficient resource allocation schemes are comprehensively investigated, including new insights into the trade-off

  2. Discrete Hamiltonian evolution and quantum gravity

    International Nuclear Information System (INIS)

    Husain, Viqar; Winkler, Oliver

    2004-01-01

    We study constrained Hamiltonian systems by utilizing general forms of time discretization. We show that for explicit discretizations, the requirement of preserving the canonical Poisson bracket under discrete evolution imposes strong conditions on both allowable discretizations and Hamiltonians. These conditions permit time discretizations for a limited class of Hamiltonians, which does not include homogeneous cosmological models. We also present two general classes of implicit discretizations which preserve Poisson brackets for any Hamiltonian. Both types of discretizations generically do not preserve first class constraint algebras. Using this observation, we show that time discretization provides a complicated time gauge fixing for quantum gravity models, which may be compared with the alternative procedure of gauge fixing before discretization

  3. Attention mediates the flexible allocation of visual working memory resources.

    Science.gov (United States)

    Emrich, Stephen M; Lockhart, Holly A; Al-Aidroos, Naseem

    2017-07-01

    Though it is clear that it is impossible to store an unlimited amount of information in visual working memory (VWM), the limiting mechanisms remain elusive. While several models of VWM limitations exist, these typically characterize changes in performance as a function of the number of to-be-remembered items. Here, we examine whether changes in spatial attention could better account for VWM performance, independent of load. Across 2 experiments, performance was better predicted by the prioritization of memory items (i.e., attention) than by the number of items to be remembered (i.e., memory load). This relationship followed a power law, and held regardless of whether performance was assessed based on overall precision or any of 3 measures in a mixture model. Moreover, at large set sizes, even minimally attended items could receive a small proportion of resources, without any evidence for a discrete-capacity on the number of items that could be maintained in VWM. Finally, the observed data were best fit by a variable-precision model in which response error was related to the proportion of resources allocated to each item, consistent with a model of VWM in which performance is determined by the continuous allocation of attentional resources during encoding. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

  4. Long-term allocation of power from the Snettisham Project

    International Nuclear Information System (INIS)

    1993-01-01

    The Alaska Power Administration (APA) has prepared an Environmental Assessment (EA) (DOE/EA-0839) evaluating the Final Marketing Plan for the Snettisham Project that establishes long-term allocation and sales of power. The proposed long-term sales contract will replace a 20-year sales agreement that expires at the end of December, 1993. The EA evaluates the proposed alternative and the no action alternative. The proposed alternative replaces the expiring contract with a new 20-year contract with the same terms, conditions and allocation as the previous long-term contract. No other alternatives were developed, as there is only one utility in the Juneau area. The divestiture of this Federal project is expected to be approved by Congress; the present contractor would then assume the ownership and operation of the Snettisham Project. The EA identified no actions associated with the proposal that will cause significant environmental or socioeconomic impacts. The Final Marketing Plan for the Snettisham Project deals with the replacement of an expiring contract. The Final Marketing Plan does not include the addition of any major new resources, service to discrete major new loads, or major changes in operating parameters. No changes in rates are proposed in the Final Marketing Plan

  5. Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

    KAUST Repository

    Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

    2016-01-01

    A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a

  6. Solving discrete zero point problems

    NARCIS (Netherlands)

    van der Laan, G.; Talman, A.J.J.; Yang, Z.F.

    2004-01-01

    In this paper an algorithm is proposed to .nd a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space IRn.Starting with a given integral point, the algorithm generates a .nite sequence of adjacent integral simplices of varying dimension and

  7. Succinct Sampling from Discrete Distributions

    DEFF Research Database (Denmark)

    Bringmann, Karl; Larsen, Kasper Green

    2013-01-01

    We revisit the classic problem of sampling from a discrete distribution: Given n non-negative w-bit integers x_1,...,x_n, the task is to build a data structure that allows sampling i with probability proportional to x_i. The classic solution is Walker's alias method that takes, when implemented...

  8. Symplectomorphisms and discrete braid invariants

    NARCIS (Netherlands)

    Czechowski, Aleksander; Vandervorst, Robert

    2017-01-01

    Area and orientation preserving diffeomorphisms of the standard 2-disc, referred to as symplectomorphisms of D2, allow decompositions in terms of positive twist diffeomorphisms. Using the latter decomposition, we utilize the Conley index theory of discrete braid classes as introduced in Ghrist et

  9. The remarkable discreteness of being

    Indian Academy of Sciences (India)

    Life is a discrete, stochastic phenomenon: for a biological organism, the time of the two most important events of its life (reproduction and death) is random and these events change the number of individuals of the species by single units. These facts can have surprising, counterintuitive consequences. I review here three ...

  10. Discrete tomography in neutron radiography

    International Nuclear Information System (INIS)

    Kuba, Attila; Rodek, Lajos; Kiss, Zoltan; Rusko, Laszlo; Nagy, Antal; Balasko, Marton

    2005-01-01

    Discrete tomography (DT) is an imaging technique for reconstructing discrete images from their projections using the knowledge that the object to be reconstructed contains only a few homogeneous materials characterized by known discrete absorption values. One of the main reasons for applying DT is that we will hopefully require relatively few projections. Using discreteness and some a priori information (such as an approximate shape of the object) we can apply two DT methods in neutron imaging by reducing the problem to an optimization task. The first method is a special one because it is only suitable if the object is composed of cylinders and sphere shapes. The second method is a general one in the sense that it can be used for reconstructing objects of any shape. Software was developed and physical experiments performed in order to investigate the effects of several reconstruction parameters: the number of projections, noise levels, and complexity of the object to be reconstructed. We give a summary of the experimental results and make a comparison of the results obtained using a classical reconstruction technique (FBP). The programs we developed are available in our DT reconstruction program package DIRECT

  11. Peer-Allocated Instant Response (PAIR): Computional allocation of peer tutors in learning communities

    NARCIS (Netherlands)

    Westera, Wim

    2009-01-01

    Westera, W. (2007). Peer-Allocated Instant Response (PAIR): Computational allocation of peer tutors in learning communities. Journal of Artificial Societies and Social Simulation, http://jasss.soc.surrey.ac.uk/10/2/5.html

  12. Discrete elements method of neutron transport

    International Nuclear Information System (INIS)

    Mathews, K.A.

    1988-01-01

    In this paper a new neutron transport method, called discrete elements (L N ) is derived and compared to discrete ordinates methods, theoretically and by numerical experimentation. The discrete elements method is based on discretizing the Boltzmann equation over a set of elements of angle. The discrete elements method is shown to be more cost-effective than discrete ordinates, in terms of accuracy versus execution time and storage, for the cases tested. In a two-dimensional test case, a vacuum duct in a shield, the L N method is more consistently convergent toward a Monte Carlo benchmark solution

  13. Time allocation of disabled individuals.

    Science.gov (United States)

    Pagán, Ricardo

    2013-05-01

    Although some studies have analysed the disability phenomenon and its effect on, for example, labour force participation, wages, job satisfaction, or the use of disability pension, the empirical evidence on how disability steals time (e.g. hours of work) from individuals is very scarce. This article examines how disabled individuals allocate their time to daily activities as compared to their non-disabled counterparts. Using time diary information from the Spanish Time Use Survey (last quarter of 2002 and the first three quarters of 2003), we estimate the determinants of time (minutes per day) spent on four aggregate categories (market work, household production, tertiary activities and leisure) for a sample of 27,687 non-disabled and 5250 disabled individuals and decompose the observed time differential by using the Oaxaca-Blinder methodology. The results show that disabled individuals devote less time to market work (especially females), and more time to household production (e.g. cooking, cleaning, child care), tertiary activities (e.g., sleeping, personal care, medical treatment) and leisure activities. We also find a significant effect of age on the time spent on daily activities and important differences by gender and disability status. The results are consistent with the hypothesis that disability steals time, and reiterate the fact that more public policies are needed to balance working life and health concerns among disabled individuals. Copyright © 2013 Elsevier Ltd. All rights reserved.

  14. Multiobjective optimal allocation problem with probabilistic non ...

    African Journals Online (AJOL)

    user

    In multivariate stratified sampling where more than one characteristic are to be estimated, an allocation which is optimum for one characteristic may not be optimum for other characteristics also. In such situations a compromise criterion is needed to work out a usable allocation which is optimum for all characteristics in some ...

  15. Bounds in the location-allocation problem

    DEFF Research Database (Denmark)

    Juel, Henrik

    1981-01-01

    Develops a family of stronger lower bounds on the objective function value of the location-allocation problem. Solution methods proposed to solve problems in location-allocation; Efforts to develop a more efficient bound solution procedure; Determination of the locations of the sources....

  16. A Time Allocation Study of University Faculty

    Science.gov (United States)

    Link, Albert N.; Swann, Christopher A.; Bozeman, Barry

    2008-01-01

    Many previous time allocation studies treat work as a single activity and examine trade-offs between work and other activities. This paper investigates the at-work allocation of time among teaching, research, grant writing and service by science and engineering faculty at top US research universities. We focus on the relationship between tenure…

  17. Obtaining a Proportional Allocation by Deleting Items

    NARCIS (Netherlands)

    Dorn, B.; de Haan, R.; Schlotter, I.; Röthe, J.

    2017-01-01

    We consider the following control problem on fair allocation of indivisible goods. Given a set I of items and a set of agents, each having strict linear preference over the items, we ask for a minimum subset of the items whose deletion guarantees the existence of a proportional allocation in the

  18. Directed networks, allocation properties and hierarchy formation

    NARCIS (Netherlands)

    Slikker, M.; Gilles, R.P.; Norde, H.W.; Tijs, S.H.

    2005-01-01

    We investigate properties for allocation rules on directed communication networks and the formation of such networks under these payoff properties. We study allocation rules satisfying two appealing properties, Component Efficiency (CE) and the Hierarchical Payoff Property (HPP). We show that such

  19. Nash social welfare in multiagent resource allocation

    NARCIS (Netherlands)

    Ramezani, S.; Endriss, U.; David, E.; Gerding, E.; Sarne, D.; Shehory, O.

    2010-01-01

    We study different aspects of the multiagent resource allocation problem when the objective is to find an allocation that maximizes Nash social welfare, the product of the utilities of the individual agents. The Nash solution is an important welfare criterion that combines efficiency and fairness

  20. Risk and reliability allocation to risk control

    International Nuclear Information System (INIS)

    Vojnovic, D.; Kozuh, M.

    1992-01-01

    The risk allocation procedure is used as an analytical model to support the optimal decision making for reliability/availability improvement planning. Both levels of decision criteria, the plant risk measures and plant performance indices, are used in risk allocation procedure. Decision support system uses the multi objective decision making concept. (author) [sl

  1. Bidding for surplus in network allocation problems

    NARCIS (Netherlands)

    Slikker, M.

    2007-01-01

    In this paper we study non-cooperative foundations of network allocation rules. We focus on three allocation rules: the Myerson value, the position value and the component-wise egalitarian solution. For any of these three rules we provide a characterization based on component efficiency and some

  2. Cost Allocation and Convex Data Envelopment

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Tind, Jørgen

    such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...

  3. Discrete gauge symmetries in discrete MSSM-like orientifolds

    International Nuclear Information System (INIS)

    Ibáñez, L.E.; Schellekens, A.N.; Uranga, A.M.

    2012-01-01

    Motivated by the necessity of discrete Z N symmetries in the MSSM to insure baryon stability, we study the origin of discrete gauge symmetries from open string sector U(1)'s in orientifolds based on rational conformal field theory. By means of an explicit construction, we find an integral basis for the couplings of axions and U(1) factors for all simple current MIPFs and orientifolds of all 168 Gepner models, a total of 32 990 distinct cases. We discuss how the presence of discrete symmetries surviving as a subgroup of broken U(1)'s can be derived using this basis. We apply this procedure to models with MSSM chiral spectrum, concretely to all known U(3)×U(2)×U(1)×U(1) and U(3)×Sp(2)×U(1)×U(1) configurations with chiral bi-fundamentals, but no chiral tensors, as well as some SU(5) GUT models. We find examples of models with Z 2 (R-parity) and Z 3 symmetries that forbid certain B and/or L violating MSSM couplings. Their presence is however relatively rare, at the level of a few percent of all cases.

  4. Optimal allocation of resources in systems

    International Nuclear Information System (INIS)

    Derman, C.; Lieberman, G.J.; Ross, S.M.

    1975-01-01

    In the design of a new system, or the maintenance of an old system, allocation of resources is of prime consideration. In allocating resources it is often beneficial to develop a solution that yields an optimal value of the system measure of desirability. In the context of the problems considered in this paper the resources to be allocated are components already produced (assembly problems) and money (allocation in the construction or repair of systems). The measure of desirability for system assembly will usually be maximizing the expected number of systems that perform satisfactorily and the measure in the allocation context will be maximizing the system reliability. Results are presented for these two types of general problems in both a sequential (when appropriate) and non-sequential context

  5. On System Engineering a Barter-Based Re-allocation of Space System Key Development Resources

    Science.gov (United States)

    Kosmann, William J.

    NASA has had a decades-long problem with cost growth during the development of space science missions. Numerous agency-sponsored studies have produced average mission level development cost growths ranging from 23 to 77%. A new study of 26 historical NASA science instrument set developments using expert judgment to re-allocate key development resources has an average cost growth of 73.77%. Twice in history, during the Cassini and EOS-Terra science instrument developments, a barter-based mechanism has been used to re-allocate key development resources. The mean instrument set development cost growth was -1.55%. Performing a bivariate inference on the means of these two distributions, there is statistical evidence to support the claim that using a barter-based mechanism to re-allocate key instrument development resources will result in a lower expected cost growth than using the expert judgment approach. Agent-based discrete event simulation is the natural way to model a trade environment. A NetLogo agent-based barter-based simulation of science instrument development was created. The agent-based model was validated against the Cassini historical example, as the starting and ending instrument development conditions are available. The resulting validated agent-based barter-based science instrument resource re-allocation simulation was used to perform 300 instrument development simulations, using barter to re-allocate development resources. The mean cost growth was -3.365%. A bivariate inference on the means was performed to determine that additional significant statistical evidence exists to support a claim that using barter-based resource re-allocation will result in lower expected cost growth, with respect to the historical expert judgment approach. Barter-based key development resource re-allocation should work on science spacecraft development as well as it has worked on science instrument development. A new study of 28 historical NASA science spacecraft

  6. Positivity for Convective Semi-discretizations

    KAUST Repository

    Fekete, Imre; Ketcheson, David I.; Loczi, Lajos

    2017-01-01

    We propose a technique for investigating stability properties like positivity and forward invariance of an interval for method-of-lines discretizations, and apply the technique to study positivity preservation for a class of TVD semi-discretizations

  7. Quantum chaos on discrete graphs

    International Nuclear Information System (INIS)

    Smilansky, Uzy

    2007-01-01

    Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

  8. Dark energy from discrete spacetime.

    Directory of Open Access Journals (Sweden)

    Aaron D Trout

    Full Text Available Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, [Formula: see text] in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies.

  9. Applied geometry and discrete mathematics

    CERN Document Server

    Sturm; Gritzmann, Peter; Sturmfels, Bernd

    1991-01-01

    This volume, published jointly with the Association for Computing Machinery, comprises a collection of research articles celebrating the occasion of Victor Klee's sixty-fifth birthday in September 1990. During his long career, Klee has made contributions to a wide variety of areas, such as discrete and computational geometry, convexity, combinatorics, graph theory, functional analysis, mathematical programming and optimization, and theoretical computer science. In addition, Klee made important contributions to mathematics education, mathematical methods in economics and the decision sciences, applications of discrete mathematics in the biological and social sciences, and the transfer of knowledge from applied mathematics to industry. In honor of Klee's achievements, this volume presents more than forty papers on topics related to Klee's research. While the majority of the papers are research articles, a number of survey articles are also included. Mirroring the breadth of Klee's mathematical contributions, th...

  10. Emissivity of discretized diffusion problems

    International Nuclear Information System (INIS)

    Densmore, Jeffery D.; Davidson, Gregory; Carrington, David B.

    2006-01-01

    The numerical modeling of radiative transfer by the diffusion approximation can produce artificially damped radiation propagation if spatial cells are too optically thick. In this paper, we investigate this nonphysical behavior at external problem boundaries by examining the emissivity of the discretized diffusion approximation. We demonstrate that the standard cell-centered discretization produces an emissivity that is too low for optically thick cells, a situation that leads to the lack of radiation propagation. We then present a modified boundary condition that yields an accurate emissivity regardless of cell size. This modified boundary condition can be used with a deterministic calculation or as part of a hybrid transport-diffusion method for increasing the efficiency of Monte Carlo simulations. We also discuss the range of applicability, as a function of cell size and material properties, when this modified boundary condition is employed in a hybrid technique. With a set of numerical calculations, we demonstrate the accuracy and usefulness of this modified boundary condition

  11. Discrete symmetries in the MSSM

    Energy Technology Data Exchange (ETDEWEB)

    Schieren, Roland

    2010-12-02

    The use of discrete symmetries, especially abelian ones, in physics beyond the standard model of particle physics is discussed. A method is developed how a general, abelian, discrete symmetry can be obtained via spontaneous symmetry breaking. In addition, anomalies are treated in the path integral approach with special attention to anomaly cancellation via the Green-Schwarz mechanism. All this is applied to the minimal supersymmetric standard model. A unique Z{sup R}{sub 4} symmetry is discovered which solves the {mu}-problem as well as problems with proton decay and allows to embed the standard model gauge group into a simple group, i.e. the Z{sup R}{sub 4} is compatible with grand unification. Also the flavor problem in the context of minimal flavor violation is addressed. Finally, a string theory model is presented which exhibits the mentioned Z{sup R}{sub 4} symmetry and other desirable features. (orig.)

  12. Domain Discretization and Circle Packings

    DEFF Research Database (Denmark)

    Dias, Kealey

    A circle packing is a configuration of circles which are tangent with one another in a prescribed pattern determined by a combinatorial triangulation, where the configuration fills a planar domain or a two-dimensional surface. The vertices in the triangulation correspond to centers of circles...... to domain discretization problems such as triangulation and unstructured mesh generation techniques. We wish to ask ourselves the question: given a cloud of points in the plane (we restrict ourselves to planar domains), is it possible to construct a circle packing preserving the positions of the vertices...... and constrained meshes having predefined vertices as constraints. A standard method of two-dimensional mesh generation involves conformal mapping of the surface or domain to standardized shapes, such as a disk. Since circle packing is a new technique for constructing discrete conformal mappings, it is possible...

  13. Discrete Bose-Einstein spectra

    International Nuclear Information System (INIS)

    Vlad, Valentin I.; Ionescu-Pallas, Nicholas

    2001-03-01

    The Bose-Einstein energy spectrum of a quantum gas, confined in a rigid cubic box, is shown to become discrete and strongly dependent on the box geometry (size L), temperature, T and atomic mass number, A at , in the region of small γ=A at TV 1/3 . This behavior is the consequence of the random state degeneracy in the box. Furthermore, we demonstrate that the total energy does not obey the conventional law any longer, but a new law, which depends on γ and on the quantum gas fugacity. This energy law imposes a faster decrease to zero than it is classically expected, for γ→0. The lighter the gas atoms, the higher the temperatures or the box size, for the same effects in the discrete Bose-Einstein regime. (author)

  14. Discrete symmetries in the MSSM

    International Nuclear Information System (INIS)

    Schieren, Roland

    2010-01-01

    The use of discrete symmetries, especially abelian ones, in physics beyond the standard model of particle physics is discussed. A method is developed how a general, abelian, discrete symmetry can be obtained via spontaneous symmetry breaking. In addition, anomalies are treated in the path integral approach with special attention to anomaly cancellation via the Green-Schwarz mechanism. All this is applied to the minimal supersymmetric standard model. A unique Z R 4 symmetry is discovered which solves the μ-problem as well as problems with proton decay and allows to embed the standard model gauge group into a simple group, i.e. the Z R 4 is compatible with grand unification. Also the flavor problem in the context of minimal flavor violation is addressed. Finally, a string theory model is presented which exhibits the mentioned Z R 4 symmetry and other desirable features. (orig.)

  15. Dark energy from discrete spacetime.

    Science.gov (United States)

    Trout, Aaron D

    2013-01-01

    Dark energy accounts for most of the matter-energy content of our universe, yet current theories of its origin rely on radical physical assumptions such as the holographic principle or controversial anthropic arguments. We give a better motivated explanation for dark energy, claiming that it arises from a small negative scalar-curvature present even in empty spacetime. The vacuum has this curvature because spacetime is fundamentally discrete and there are more ways for a discrete geometry to have negative curvature than positive. We explicitly compute this effect using a variant of the well known dynamical-triangulations (DT) model for quantum gravity. Our model predicts a time-varying non-zero cosmological constant with a current value, [Formula: see text] in natural units, in agreement with observation. This calculation is made possible by a novel characterization of the possible DT action values combined with numerical evidence concerning their degeneracies.

  16. Discrete mathematics using a computer

    CERN Document Server

    Hall, Cordelia

    2000-01-01

    Several areas of mathematics find application throughout computer science, and all students of computer science need a practical working understanding of them. These core subjects are centred on logic, sets, recursion, induction, relations and functions. The material is often called discrete mathematics, to distinguish it from the traditional topics of continuous mathematics such as integration and differential equations. The central theme of this book is the connection between computing and discrete mathematics. This connection is useful in both directions: • Mathematics is used in many branches of computer science, in applica­ tions including program specification, datastructures,design and analysis of algorithms, database systems, hardware design, reasoning about the correctness of implementations, and much more; • Computers can help to make the mathematics easier to learn and use, by making mathematical terms executable, making abstract concepts more concrete, and through the use of software tools su...

  17. Duality for discrete integrable systems

    International Nuclear Information System (INIS)

    Quispel, G R W; Capel, H W; Roberts, J A G

    2005-01-01

    A new class of discrete dynamical systems is introduced via a duality relation for discrete dynamical systems with a number of explicitly known integrals. The dual equation can be defined via the difference of an arbitrary linear combination of integrals and its upshifted version. We give an example of an integrable mapping with two parameters and four integrals leading to a (four-dimensional) dual mapping with four parameters and two integrals. We also consider a more general class of higher-dimensional mappings arising via a travelling-wave reduction from the (integrable) MKdV partial-difference equation. By differencing the trace of the monodromy matrix we obtain a class of novel dual mappings which is shown to be integrable as level-set-dependent versions of the original ones

  18. Observability of discretized partial differential equations

    Science.gov (United States)

    Cohn, Stephen E.; Dee, Dick P.

    1988-01-01

    It is shown that complete observability of the discrete model used to assimilate data from a linear partial differential equation (PDE) system is necessary and sufficient for asymptotic stability of the data assimilation process. The observability theory for discrete systems is reviewed and applied to obtain simple observability tests for discretized constant-coefficient PDEs. Examples are used to show how numerical dispersion can result in discrete dynamics with multiple eigenvalues, thereby detracting from observability.

  19. Effective lagrangian description on discrete gauge symmetries

    International Nuclear Information System (INIS)

    Banks, T.

    1989-01-01

    We exhibit a simple low-energy lagrangian which describes a system with a discrete remnant of a spontaneously broken continuous gauge symmetry. The lagrangian gives a simple description of the effects ascribed to such systems by Krauss and Wilczek: black holes carry discrete hair and interact with cosmic strings, and wormholes cannot lead to violation of discrete gauge symmetries. (orig.)

  20. Discrete port-Hamiltonian systems : mixed interconnections

    NARCIS (Netherlands)

    Talasila, Viswanath; Clemente-Gallardo, J.; Schaft, A.J. van der

    2005-01-01

    Either from a control theoretic viewpoint or from an analysis viewpoint it is necessary to convert smooth systems to discrete systems, which can then be implemented on computers for numerical simulations. Discrete models can be obtained either by discretizing a smooth model, or by directly modeling

  1. Discrete fractional solutions of a Legendre equation

    Science.gov (United States)

    Yılmazer, Resat

    2018-01-01

    One of the most popular research interests of science and engineering is the fractional calculus theory in recent times. Discrete fractional calculus has also an important position in fractional calculus. In this work, we acquire new discrete fractional solutions of the homogeneous and non homogeneous Legendre differential equation by using discrete fractional nabla operator.

  2. Identifying Memory Allocation Patterns in HEP Software

    Science.gov (United States)

    Kama, S.; Rauschmayr, N.

    2017-10-01

    HEP applications perform an excessive amount of allocations/deallocations within short time intervals which results in memory churn, poor locality and performance degradation. These issues are already known for a decade, but due to the complexity of software frameworks and billions of allocations for a single job, up until recently no efficient mechanism has been available to correlate these issues with source code lines. However, with the advent of the Big Data era, many tools and platforms are now available to do large scale memory profiling. This paper presents, a prototype program developed to track and identify each single (de-)allocation. The CERN IT Hadoop cluster is used to compute memory key metrics, like locality, variation, lifetime and density of allocations. The prototype further provides a web based visualization back-end that allows the user to explore the results generated on the Hadoop cluster. Plotting these metrics for every single allocation over time gives a new insight into application’s memory handling. For instance, it shows which algorithms cause which kind of memory allocation patterns, which function flow causes how many short-lived objects, what are the most commonly allocated sizes etc. The paper will give an insight into the prototype and will show profiling examples for the LHC reconstruction, digitization and simulation jobs.

  3. Continuous versus discrete structures II -- Discrete Hamiltonian systems and Helmholtz conditions

    OpenAIRE

    Cresson, Jacky; Pierret, Frédéric

    2015-01-01

    We define discrete Hamiltonian systems in the framework of discrete embeddings. An explicit comparison with previous attempts is given. We then solve the discrete Helmholtz's inverse problem for the discrete calculus of variation in the Hamiltonian setting. Several applications are discussed.

  4. Asymptotic behavior of discrete holomorphic maps z^c, log(z) and discrete Painleve transcedents

    OpenAIRE

    Agafonov, S. I.

    2005-01-01

    It is shown that discrete analogs of z^c and log(z) have the same asymptotic behavior as their smooth counterparts. These discrete maps are described in terms of special solutions of discrete Painleve-II equations, asymptotics of these solutions providing the behaviour of discrete z^c and log(z) at infinity.

  5. Discrete integrable couplings associated with Toda-type lattice and two hierarchies of discrete soliton equations

    International Nuclear Information System (INIS)

    Zhang Yufeng; Fan Engui; Zhang Yongqing

    2006-01-01

    With the help of two semi-direct sum Lie algebras, an efficient way to construct discrete integrable couplings is proposed. As its applications, the discrete integrable couplings of the Toda-type lattice equations are obtained. The approach can be devoted to establishing other discrete integrable couplings of the discrete lattice integrable hierarchies of evolution equations

  6. Worst-case analysis of heap allocations

    DEFF Research Database (Denmark)

    Puffitsch, Wolfgang; Huber, Benedikt; Schoeberl, Martin

    2010-01-01

    the worst-case heap allocations of tasks. The analysis builds upon techniques that are well established for worst-case execution time analysis. The difference is that the cost function is not the execution time of instructions in clock cycles, but the allocation in bytes. In contrast to worst-case execution...... time analysis, worst-case heap allocation analysis is not processor dependent. However, the cost function depends on the object layout of the runtime system. The analysis is evaluated with several real-time benchmarks to establish the usefulness of the analysis, and to compare the memory consumption...

  7. Dynamic Allocation of Sugars in Barley

    Science.gov (United States)

    Cumberbatch, L. C.; Crowell, A. S.; Fallin, B. A.; Howell, C. R.; Reid, C. D.; Weisenberger, A. G.; Lee, S. J.; McKisson, J. E.

    2014-03-01

    Allocation of carbon and nitrogen is a key factor for plant productivity. Measurements are carried out by tracing 11C-tagged sugars using positron emission tomography and coincidence counting. We study the mechanisms of carbon allocation and transport from carbohydrate sources (leaves) to sinks (stem, shoot, roots) under various environmental conditions such as soil nutrient levels and atmospheric CO2 concentration. The data are analyzed using a transfer function analysis technique to model transport and allocation in barley plants. The experimental technique will be described and preliminary results presented. This work was supported in part by USDOE Grant No. DE-FG02-97-ER41033 and DE-SC0005057.

  8. Dynamic detection-rate-based bit allocation with genuine interval concealment for binary biometric representation.

    Science.gov (United States)

    Lim, Meng-Hui; Teoh, Andrew Beng Jin; Toh, Kar-Ann

    2013-06-01

    Biometric discretization is a key component in biometric cryptographic key generation. It converts an extracted biometric feature vector into a binary string via typical steps such as segmentation of each feature element into a number of labeled intervals, mapping of each interval-captured feature element onto a binary space, and concatenation of the resulted binary output of all feature elements into a binary string. Currently, the detection rate optimized bit allocation (DROBA) scheme is one of the most effective biometric discretization schemes in terms of its capability to assign binary bits dynamically to user-specific features with respect to their discriminability. However, we learn that DROBA suffers from potential discriminative feature misdetection and underdiscretization in its bit allocation process. This paper highlights such drawbacks and improves upon DROBA based on a novel two-stage algorithm: 1) a dynamic search method to efficiently recapture such misdetected features and to optimize the bit allocation of underdiscretized features and 2) a genuine interval concealment technique to alleviate crucial information leakage resulted from the dynamic search. Improvements in classification accuracy on two popular face data sets vindicate the feasibility of our approach compared with DROBA.

  9. Cuspidal discrete series for projective hyperbolic spaces

    DEFF Research Database (Denmark)

    Andersen, Nils Byrial; Flensted-Jensen, Mogens

    2013-01-01

    Abstract. We have in [1] proposed a definition of cusp forms on semisimple symmetric spaces G/H, involving the notion of a Radon transform and a related Abel transform. For the real non-Riemannian hyperbolic spaces, we showed that there exists an infinite number of cuspidal discrete series......, and at most finitely many non-cuspidal discrete series, including in particular the spherical discrete series. For the projective spaces, the spherical discrete series are the only non-cuspidal discrete series. Below, we extend these results to the other hyperbolic spaces, and we also study the question...

  10. Space-Time Discrete KPZ Equation

    Science.gov (United States)

    Cannizzaro, G.; Matetski, K.

    2018-03-01

    We study a general family of space-time discretizations of the KPZ equation and show that they converge to its solution. The approach we follow makes use of basic elements of the theory of regularity structures (Hairer in Invent Math 198(2):269-504, 2014) as well as its discrete counterpart (Hairer and Matetski in Discretizations of rough stochastic PDEs, 2015. arXiv:1511.06937). Since the discretization is in both space and time and we allow non-standard discretization for the product, the methods mentioned above have to be suitably modified in order to accommodate the structure of the models under study.

  11. Integrable discretizations of the short pulse equation

    International Nuclear Information System (INIS)

    Feng Baofeng; Maruno, Ken-ichi; Ohta, Yasuhiro

    2010-01-01

    In this paper, we propose integrable semi-discrete and full-discrete analogues of the short pulse (SP) equation. The key construction is the bilinear form and determinant structure of solutions of the SP equation. We also give the determinant formulas of N-soliton solutions of the semi-discrete and full-discrete analogues of the SP equations, from which the multi-loop and multi-breather solutions can be generated. In the continuous limit, the full-discrete SP equation converges to the semi-discrete SP equation, and then to the continuous SP equation. Based on the semi-discrete SP equation, an integrable numerical scheme, i.e. a self-adaptive moving mesh scheme, is proposed and used for the numerical computation of the short pulse equation.

  12. Performance Analysis of Cloud Computing Architectures Using Discrete Event Simulation

    Science.gov (United States)

    Stocker, John C.; Golomb, Andrew M.

    2011-01-01

    Cloud computing offers the economic benefit of on-demand resource allocation to meet changing enterprise computing needs. However, the flexibility of cloud computing is disadvantaged when compared to traditional hosting in providing predictable application and service performance. Cloud computing relies on resource scheduling in a virtualized network-centric server environment, which makes static performance analysis infeasible. We developed a discrete event simulation model to evaluate the overall effectiveness of organizations in executing their workflow in traditional and cloud computing architectures. The two part model framework characterizes both the demand using a probability distribution for each type of service request as well as enterprise computing resource constraints. Our simulations provide quantitative analysis to design and provision computing architectures that maximize overall mission effectiveness. We share our analysis of key resource constraints in cloud computing architectures and findings on the appropriateness of cloud computing in various applications.

  13. ALLOCATION OF FINANCIAL RESOURCE TO ENHANCE ...

    African Journals Online (AJOL)

    GRACE

    This study examines the allocation of financial resource to the education industry and ..... This should check all books of account at least once a month to reconcile ... All cash advance request must be supported with relevant documents vii.

  14. Fund allocation using capacitated vehicle routing problem

    Science.gov (United States)

    Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Darus, Maslina

    2014-09-01

    In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

  15. U.S. Army Recruiter Allocation Model

    National Research Council Canada - National Science Library

    Brence, John

    2004-01-01

    .... Our methodology will build on both the new and old schools of recruiting by conducting stakeholder interviews that will lead us to a model that is an efficient starting point for the Recruiter Mission Allocation (RMA...

  16. Optimal Resource Allocation in Library Systems

    Science.gov (United States)

    Rouse, William B.

    1975-01-01

    Queueing theory is used to model processes as either waiting or balking processes. The optimal allocation of resources to these processes is defined as that which maximizes the expected value of the decision-maker's utility function. (Author)

  17. Resource allocation based on cost efficiency

    DEFF Research Database (Denmark)

    Dehnokhalaji, Akram; Ghiyasi, Mojtaba; Korhonen, Pekka

    2017-01-01

    -objective linear programming problem using two different strategies. First, we propose an RA model which keeps the cost efficiencies of units unchanged. This is done assuming fixed technical and allocative efficiencies. The approach is based on the assumption that the decision maker (DM) may not have big changes......In this paper, we consider a resource allocation (RA) problem and develop an approach based on cost (overall) efficiency. The aim is to allocate some inputs among decision making units (DMUs) in such way that their cost efficiencies improve or stay unchanged after RA. We formulate a multi...... in the structure of DMUs within a short term. The second strategy does not impose any restrictions on technical and allocative efficiencies. It guarantees that none of the cost efficiencies of DMUs get worse after RA, and the improvement for units is possible if it is feasible and beneficial. Two numerical...

  18. regional grain allocation and transportation in China

    African Journals Online (AJOL)

    use

    2011-12-14

    Dec 14, 2011 ... China was partitioned into eight regions, and the virtual water flow due to regional grain allocation and ... strategy can be choices which can realize Chinese food security and ..... Globalization of water: Sharing the planet's ...

  19. Telecommunications Circuit Allocation Programs - Kansas City Area

    National Research Council Canada - National Science Library

    Thomas, William

    1994-01-01

    The overall objective of the audit was to determine whether DoD circuit allocation programs identified and used the most effective configurations for leased long-haul, special-purpose telecommunications circuits...

  20. Macroeconomic influences on optimal asset allocation

    OpenAIRE

    Flavin, Thomas; Wickens, M.R.

    2003-01-01

    We develop a tactical asset allocation strategy that incorporates the effects of macroeconomic variables. The joint distribution of financial asset returns and the macroeconomic variables is modelled using a VAR with a multivariate GARCH (M-GARCH) error structure. As a result, the portfolio frontier is time varying and subject to contagion from the macroeconomic variable. Optimal asset allocation requires that this be taken into account. We illustrate how to do this using three ri...

  1. Human Capital and Risky Asset Allocation

    OpenAIRE

    Lu, Wenjie; Yu, Qun

    2011-01-01

    Much research has been done to examine the relation between investors' human capital and their financial asset allocation. While some showed that the value of human capital should be taken into consideration to make financial asset allocation decisions on the composition of investing portfolios, most argued not. In this paper, we selected the monthly return of 9 industrial ETFs from June of 2007 to July 2011, used the present value of total future income as estimate of human capital, and reli...

  2. Cost Allocation and Overpricing of Spare Parts.

    Science.gov (United States)

    1986-09-01

    traditional cost allocation process as reported in accounting literature. Horngren reported there are essen- tially three facets of cost allocation as...is for more than one unit of a product. Horngren reports cost accounting systems commonly have two major cost objectives: departments and products (8...Standards Board: Standards, Rules, and Regulations. Washington: Government Printing Office, 1985. 8. Horngren , Charles T. Cost Accounting : A Managerial

  3. Cost allocation. Combined heat and power production

    International Nuclear Information System (INIS)

    Sidzikauskas, V.

    2002-01-01

    The benefits of Combined Heat and Power (CHP) generation are discussed. The include improvement in energy intensity of 1% by 2010, 85-90% efficiency versus 40-50% of condensation power and others. Share of CHP electricity production in ERRA countries is presented.Solutions for a development CHP cost allocation are considered. Conclusion are presented for CHP production cost allocation. (R.P.)

  4. Discrete geometric structures for architecture

    KAUST Repository

    Pottmann, Helmut

    2010-06-13

    The emergence of freeform structures in contemporary architecture raises numerous challenging research problems, most of which are related to the actual fabrication and are a rich source of research topics in geometry and geometric computing. The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization of supporting beams and nodes. A study of quadrilateral meshes with planar faces reveals beautiful relations to discrete differential geometry. In particular, we discuss meshes which discretize the network of principal curvature lines. Conical meshes are among these meshes; they possess conical offset meshes at a constant face/face distance, which in turn leads to a supporting beam layout with so-called torsion free nodes. This work can be generalized to a variety of multilayer structures and laid the ground for an adapted curvature theory for these meshes. There are also efforts on segmenting surfaces into planar hexagonal panels. Though these are less constrained than planar quadrilateral panels, this problem is still waiting for an elegant solution. Inspired by freeform designs in architecture which involve circles and spheres, we present a new kind of triangle mesh whose faces\\' in-circles form a packing, i.e., the in-circles of two triangles with a common edge have the same contact point on that edge. These "circle packing (CP) meshes" exhibit an aesthetic balance of shape and size of their faces. They are closely tied to sphere packings on surfaces and to various remarkable structures and patterns which are of interest in art, architecture, and design. CP meshes constitute a new link between architectural freeform design and computational conformal geometry. Recently, certain timber structures motivated us to study discrete patterns of geodesics on surfaces. This

  5. Radiative transfer on discrete spaces

    CERN Document Server

    Preisendorfer, Rudolph W; Stark, M; Ulam, S

    1965-01-01

    Pure and Applied Mathematics, Volume 74: Radiative Transfer on Discrete Spaces presents the geometrical structure of natural light fields. This book describes in detail with mathematical precision the radiometric interactions of light-scattering media in terms of a few well established principles.Organized into four parts encompassing 15 chapters, this volume begins with an overview of the derivations of the practical formulas and the arrangement of formulas leading to numerical solution procedures of radiative transfer problems in plane-parallel media. This text then constructs radiative tran

  6. Allocation of authority in European health policy.

    Science.gov (United States)

    Adolph, Christopher; Greer, Scott L; Massard da Fonseca, Elize

    2012-11-01

    Although many study the effects of different allocations of health policy authority, few ask why countries assign responsibility over different policies as they do. We test two broad theories: fiscal federalism, which predicts rational governments will concentrate information-intensive operations at lower levels, and redistributive and regulatory functions at higher levels; and "politicized federalism", which suggests a combination of systematic and historically idiosyncratic political variables interfere with efficient allocation of authority. Drawing on the WHO Health in Transition country profiles, we present new data on the allocation of responsibility for key health care policy tasks (implementation, provision, finance, regulation, and framework legislation) and policy areas (primary, secondary and tertiary care, public health and pharmaceuticals) in the 27 EU member states and Switzerland. We use a Bayesian multinomial mixed logit model to analyze how different countries arrive at different allocations of authority over each task and area of health policy, and find the allocation of powers broadly follows fiscal federalism. Responsibility for pharmaceuticals, framework legislation, and most finance lodges at the highest levels of government, acute and primary care in the regions, and provision at the local and regional levels. Where allocation does not follow fiscal federalism, it appears to reflect ethnic divisions, the population of states and regions, the presence of mountainous terrain, and the timing of region creation. Copyright © 2012 Elsevier Ltd. All rights reserved.

  7. Online Job Allocation with Hard Allocation Ratio Requirement (Author’s Manuscript)

    Science.gov (United States)

    2016-04-14

    server divided by its capacity. Specifically , let nj be the number of jobs that have already been allocated to server j. When job i arrives, it is...decisions solely based on current system state is needed. The problem of online job allocation has attracted much attention . Most current studies study...closed-form expressions for their performance. Specifically , we prove that, in order to allocate at least 1− 1θ of jobs , the two policies only need to

  8. 3-D discrete analytical ridgelet transform.

    Science.gov (United States)

    Helbert, David; Carré, Philippe; Andres, Eric

    2006-12-01

    In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines: 3-D discrete radial lines going through the origin defined from their orthogonal projections and 3-D planes covered with 2-D discrete line segments. These discrete analytical lines have a parameter called arithmetical thickness, allowing us to define a 3-D DART adapted to a specific application. Indeed, the 3-D DART representation is not orthogonal, It is associated with a flexible redundancy factor. The 3-D DART has a very simple forward/inverse algorithm that provides an exact reconstruction without any iterative method. In order to illustrate the potentiality of this new discrete transform, we apply the 3-D DART and its extension to the Local-DART (with smooth windowing) to the denoising of 3-D image and color video. These experimental results show that the simple thresholding of the 3-D DART coefficients is efficient.

  9. The Ordered Capacitated Multi-Objective Location-Allocation Problem for Fire Stations Using Spatial Optimization

    Directory of Open Access Journals (Sweden)

    Samira Bolouri

    2018-01-01

    Full Text Available Determining the positions of facilities, and allocating demands to them, is a vitally important problem. Location-allocation problems are optimization NP-hard procedures. This article evaluates the ordered capacitated multi-objective location-allocation problem for fire stations, using simulated annealing and a genetic algorithm, with goals such as minimizing the distance and time as well as maximizing the coverage. After tuning the parameters of the algorithms using sensitivity analysis, they were used separately to process data for Region 11, Tehran. The results showed that the genetic algorithm was more efficient than simulated annealing, and therefore, the genetic algorithm was used in later steps. Next, we increased the number of stations. Results showed that the model can successfully provide seven optimal locations and allocate high demands (280,000 to stations in a discrete space in a GIS, assuming that the stations’ capacities are known. Following this, we used a weighting program so that in each repetition, we could allot weights to each target randomly. Finally, by repeating the model over 10 independent executions, a set of solutions with the least sum and the highest number of non-dominated solutions was selected from among many non-dominated solutions as the best set of optimal solutions.

  10. Fermion systems in discrete space-time

    International Nuclear Information System (INIS)

    Finster, Felix

    2007-01-01

    Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure

  11. Fermion systems in discrete space-time

    Energy Technology Data Exchange (ETDEWEB)

    Finster, Felix [NWF I - Mathematik, Universitaet Regensburg, 93040 Regensburg (Germany)

    2007-05-15

    Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

  12. Fermion Systems in Discrete Space-Time

    OpenAIRE

    Finster, Felix

    2006-01-01

    Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

  13. Fermion systems in discrete space-time

    Science.gov (United States)

    Finster, Felix

    2007-05-01

    Fermion systems in discrete space-time are introduced as a model for physics on the Planck scale. We set up a variational principle which describes a non-local interaction of all fermions. This variational principle is symmetric under permutations of the discrete space-time points. We explain how for minimizers of the variational principle, the fermions spontaneously break this permutation symmetry and induce on space-time a discrete causal structure.

  14. SOME NOTES ON COST ALLOCATION IN MULTICASTING

    Directory of Open Access Journals (Sweden)

    Darko Skorin-Kapov

    2012-12-01

    Full Text Available We analyze the cost allocation strategies with the problef of broadcasting information from some source to a number of communication network users. A multicast routing chooses a minimum cost tree network that spans the source and all the receivers. The cost of such a network is distributed among its receivers who may be individuals or organizations with possibly conflicting interests. Providing network developers, users and owners with practical computable 'fair' cost allocation solution procedures is of great importance for network mamagement. Consequently, this multidisciplinary problem was extensively studied by Operational Researchers, Economists, Mathematicians and Computer Scientists. The fairness of various proposed solutions was even argued in US courts. This presentation overviews some previously published, as well as some recent results, in the development of algorithmic mechanisms to efficiently compute 'attractive' cost allocation solutions for multicast networks. Specifically, we will analyze cooperative game theory based cost allocation models that avoid cross subsidies and/or are distance and population monotonic. We will also present some related open cost allocation problems and the potential contribution that such models might make to this problem in the future.

  15. Cognitive allocation and the control room

    International Nuclear Information System (INIS)

    Paradies, M.W.

    1985-01-01

    One of the weakest links in the design of nuclear power plants is the inattention to the needs and capabilities of the operators. This flaw causes decreased plant reliability and reduced plant safety. To solve this problem the designer must, in the earliest stages of the design process, consider the operator's abilities. After the system requirements have been established, the designer must consider what functions to allocate to each part of the system. The human must be considered as part of this system. The allocation of functions needs to consider not only the mechanical tasks to be performed, but also the control requirements and the overall control philosophy. In order for the designers to consider the control philosophy, they need to know what control decisions should be automated and what decisions should be made by an operator. They also need to know how these decisions will be implemented: by an operator or by automation. ''Cognitive Allocation'' is the allocation of the decision making process between operators and machines. It defines the operator's role in the system. When designing a power plant, a cognitive allocation starts the process of considering the operator's abilities. This is the first step to correcting the weakest link in the current plant design

  16. Methodology for allocating reliability and risk

    International Nuclear Information System (INIS)

    Cho, N.Z.; Papazoglou, I.A.; Bari, R.A.

    1986-05-01

    This report describes a methodology for reliability and risk allocation in nuclear power plants. The work investigates the technical feasibility of allocating reliability and risk, which are expressed in a set of global safety criteria and which may not necessarily be rigid, to various reactor systems, subsystems, components, operations, and structures in a consistent manner. The report also provides general discussions on the problem of reliability and risk allocation. The problem is formulated as a multiattribute decision analysis paradigm. The work mainly addresses the first two steps of a typical decision analysis, i.e., (1) identifying alternatives, and (2) generating information on outcomes of the alternatives, by performing a multiobjective optimization on a PRA model and reliability cost functions. The multiobjective optimization serves as the guiding principle to reliability and risk allocation. The concept of ''noninferiority'' is used in the multiobjective optimization problem. Finding the noninferior solution set is the main theme of the current approach. The final step of decision analysis, i.e., assessment of the decision maker's preferences could then be performed more easily on the noninferior solution set. Some results of the methodology applications to a nontrivial risk model are provided, and several outstanding issues such as generic allocation, preference assessment, and uncertainty are discussed. 29 refs., 44 figs., 39 tabs

  17. Inevitable randomness in discrete mathematics

    CERN Document Server

    Beck, Jozsef

    2009-01-01

    Mathematics has been called the science of order. The subject is remarkably good for generalizing specific cases to create abstract theories. However, mathematics has little to say when faced with highly complex systems, where disorder reigns. This disorder can be found in pure mathematical arenas, such as the distribution of primes, the 3n+1 conjecture, and class field theory. The purpose of this book is to provide examples--and rigorous proofs--of the complexity law: (1) discrete systems are either simple or they exhibit advanced pseudorandomness; (2) a priori probabilities often exist even when there is no intrinsic symmetry. Part of the difficulty in achieving this purpose is in trying to clarify these vague statements. The examples turn out to be fascinating instances of deep or mysterious results in number theory and combinatorics. This book considers randomness and complexity. The traditional approach to complexity--computational complexity theory--is to study very general complexity classes, such as P...

  18. Quantum evolution by discrete measurements

    International Nuclear Information System (INIS)

    Roa, L; Guevara, M L Ladron de; Delgado, A; Olivares-RenterIa, G; Klimov, A B

    2007-01-01

    In this article we review two ways of driving a quantum system to a known pure state via a sequence discrete of von Neumann measurements. The first of them assumes that the initial state of the system is unknown, and the evolution is attained only with the help of two non-commuting observables. For this method, the overall success probability is maximized when the eigentstates of the involved observables constitute mutually unbiased bases. The second method assumes the initial state is known and it uses N observables which are consecutively measured to make the state of the system approach the target state. The probability of success of this procedure converges to 1 as the number of observables increases

  19. Quantum evolution by discrete measurements

    Energy Technology Data Exchange (ETDEWEB)

    Roa, L [Center for Quantum Optics and Quantum Information, Departamento de Fisica, Universidad de Concepcion, Casilla 160-C, Concepcion (Chile); Guevara, M L Ladron de [Departamento de Fisica, Universidad Catolica del Norte, Casilla 1280, Antofagasta (Chile); Delgado, A [Center for Quantum Optics and Quantum Information, Departamento de Fisica, Universidad de Concepcion, Casilla 160-C, Concepcion (Chile); Olivares-RenterIa, G [Center for Quantum Optics and Quantum Information, Departamento de Fisica, Universidad de Concepcion, Casilla 160-C, Concepcion (Chile); Klimov, A B [Departamento de Fisica, Universidad de Guadalajara, Revolucion 1500, 44420 Guadalajara, Jalisco (Mexico)

    2007-10-15

    In this article we review two ways of driving a quantum system to a known pure state via a sequence discrete of von Neumann measurements. The first of them assumes that the initial state of the system is unknown, and the evolution is attained only with the help of two non-commuting observables. For this method, the overall success probability is maximized when the eigentstates of the involved observables constitute mutually unbiased bases. The second method assumes the initial state is known and it uses N observables which are consecutively measured to make the state of the system approach the target state. The probability of success of this procedure converges to 1 as the number of observables increases.

  20. Discrete stochastic processes and applications

    CERN Document Server

    Collet, Jean-François

    2018-01-01

    This unique text for beginning graduate students gives a self-contained introduction to the mathematical properties of stochastics and presents their applications to Markov processes, coding theory, population dynamics, and search engine design. The book is ideal for a newly designed course in an introduction to probability and information theory. Prerequisites include working knowledge of linear algebra, calculus, and probability theory. The first part of the text focuses on the rigorous theory of Markov processes on countable spaces (Markov chains) and provides the basis to developing solid probabilistic intuition without the need for a course in measure theory. The approach taken is gradual beginning with the case of discrete time and moving on to that of continuous time. The second part of this text is more applied; its core introduces various uses of convexity in probability and presents a nice treatment of entropy.

  1. Discrete calculus methods for counting

    CERN Document Server

    Mariconda, Carlo

    2016-01-01

    This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii’s theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications. Although several books touch on one or more of these aspects, precious few cover all of them. The authors, both pure mathematicians, have attempted to develop methods that will allow the student to formulate a given problem in a precise mathematical framework. The aim is to equip readers with a sound strategy for classifying and solving problems by pursuing a mathematically rigorous yet ...

  2. Modeling discrete competitive facility location

    CERN Document Server

    Karakitsiou, Athanasia

    2015-01-01

    This book presents an up-to-date review of modeling and optimization approaches for location problems along with a new bi-level programming methodology which captures the effect of competition of both producers and customers on facility location decisions. While many optimization approaches simplify location problems by assuming decision making in isolation, this monograph focuses on models which take into account the competitive environment in which such decisions are made. New insights in modeling, algorithmic and theoretical possibilities are opened by this approach and new applications are possible. Competition on equal term plus competition between market leader and followers are considered in this study, consequently bi-level optimization methodology is emphasized and further developed. This book provides insights regarding modeling complexity and algorithmic approaches to discrete competitive location problems. In traditional location modeling, assignment of customer demands to supply sources are made ...

  3. Discrete modelling of drapery systems

    Science.gov (United States)

    Thoeni, Klaus; Giacomini, Anna

    2016-04-01

    Drapery systems are an efficient and cost-effective measure in preventing and controlling rockfall hazards on rock slopes. The simplest form consists of a row of ground anchors along the top of the slope connected to a horizontal support cable from which a wire mesh is suspended down the face of the slope. Such systems are generally referred to as simple or unsecured draperies (Badger and Duffy 2012). Variations such as secured draperies, where a pattern of ground anchors is incorporated within the field of the mesh, and hybrid systems, where the upper part of an unsecured drapery is elevated to intercept rockfalls originating upslope of the installation, are becoming more and more popular. This work presents a discrete element framework for simulation of unsecured drapery systems and its variations. The numerical model is based on the classical discrete element method (DEM) and implemented into the open-source framework YADE (Šmilauer et al., 2010). The model takes all relevant interactions between block, drapery and slope into account (Thoeni et al., 2014) and was calibrated and validated based on full-scale experiments (Giacomini et al., 2012).The block is modelled as a rigid clump made of spherical particles which allows any shape to be approximated. The drapery is represented by a set of spherical particle with remote interactions. The behaviour of the remote interactions is governed by the constitutive behaviour of the wire and generally corresponds to a piecewise linear stress-strain relation (Thoeni et al., 2013). The same concept is used to model wire ropes. The rock slope is represented by rigid triangular elements where material properties (e.g., normal coefficient of restitution, friction angle) are assigned to each triangle. The capabilities of the developed model to simulate drapery systems and estimate the residual hazard involved with such systems is shown. References Badger, T.C., Duffy, J.D. (2012) Drapery systems. In: Turner, A.K., Schuster R

  4. An Analysis and Allocation System for Library Collections Budgets: The Comprehensive Allocation Process (CAP)

    Science.gov (United States)

    Lyons, Lucy Eleonore; Blosser, John

    2012-01-01

    The "Comprehensive Allocation Process" (CAP) is a reproducible decision-making structure for the allocation of new collections funds, for the reallocation of funds within stagnant budgets, and for budget cuts in the face of reduced funding levels. This system was designed to overcome common shortcomings of current methods. Its philosophical…

  5. 24 CFR 791.404 - Field Office allocation planning.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 4 2010-04-01 2010-04-01 false Field Office allocation planning... Allocation of Budget Authority for Housing Assistance § 791.404 Field Office allocation planning. (a) General objective. The allocation planning process should provide for the equitable distribution of available budget...

  6. 18 CFR 367.28 - Methods of allocation.

    Science.gov (United States)

    2010-04-01

    ... 18 Conservation of Power and Water Resources 1 2010-04-01 2010-04-01 false Methods of allocation... Instructions § 367.28 Methods of allocation. Indirect costs and compensation for use of capital must be... allocation. Both direct and allocated indirect costs on projects must be assigned among those companies in...

  7. 17 CFR 256.01-11 - Methods of allocation.

    Science.gov (United States)

    2010-04-01

    ... applicable and currently effective methods of allocation filed with the Commission. Both direct and allocated... 17 Commodity and Securities Exchanges 3 2010-04-01 2010-04-01 false Methods of allocation. 256.01... HOLDING COMPANY ACT OF 1935 General Instructions § 256.01-11 Methods of allocation. Indirect costs and...

  8. 40 CFR 60.4142 - Hg allowance allocations.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 6 2010-07-01 2010-07-01 false Hg allowance allocations. 60.4142... Coal-Fired Electric Steam Generating Units Hg Allowance Allocations § 60.4142 Hg allowance allocations. (a)(1) The baseline heat input (in MMBtu) used with respect to Hg allowance allocations under...

  9. Participation behavior and social welfare in repeated task allocations

    NARCIS (Netherlands)

    Ye, Q.C.; Zhang, Y.

    2016-01-01

    Task allocation problems have focused on achieving one-shot optimality. In practice, many task allocation problems are of repeated nature, where the allocation outcome of previous rounds may influence the participation of agents in subsequent rounds, and consequently, the quality of the allocations

  10. Railway Track Allocation: Models and Methods

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    2011-01-01

    Efficiently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in finding train routes. Since the problem of routing trains......, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level....... on a railway network entails allocating the track capacity of the network (or part thereof) over time in a conflict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming...

  11. Railway Track Allocation: Models and Methods

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Larsen, Jesper; Ehrgott, Matthias

    Eciently coordinating the movement of trains on a railway network is a central part of the planning process for a railway company. This paper reviews models and methods that have been proposed in the literature to assist planners in nding train routes. Since the problem of routing trains......, and train routing problems, group them by railway network type, and discuss track allocation from a strategic, tactical, and operational level....... on a railway network entails allocating the track capacity of the network (or part thereof) over time in a con ict-free manner, all studies that model railway track allocation in some capacity are considered relevant. We hence survey work on the train timetabling, train dispatching, train platforming...

  12. Task mapping for non-contiguous allocations.

    Energy Technology Data Exchange (ETDEWEB)

    Leung, Vitus Joseph; Bunde, David P.; Ebbers, Johnathan; Price, Nicholas W.; Swank, Matthew.; Feer, Stefan P.; Rhodes, Zachary D.

    2013-02-01

    This paper examines task mapping algorithms for non-contiguously allocated parallel jobs. Several studies have shown that task placement affects job running time for both contiguously and non-contiguously allocated jobs. Traditionally, work on task mapping either uses a very general model where the job has an arbitrary communication pattern or assumes that jobs are allocated contiguously, making them completely isolated from each other. A middle ground between these two cases is the mapping problem for non-contiguous jobs having a specific communication pattern. We propose several task mapping algorithms for jobs with a stencil communication pattern and evaluate them using experiments and simulations. Our strategies improve the running time of a MiniApp by as much as 30% over a baseline strategy. Furthermore, this improvement increases markedly with the job size, demonstrating the importance of task mapping as systems grow toward exascale.

  13. Optimal allocation of reviewers for peer feedback

    DEFF Research Database (Denmark)

    Wind, David Kofoed; Jensen, Ulf Aslak; Jørgensen, Rasmus Malthe

    2017-01-01

    feedback to be effective students should give and receive useful feedback. A key challenge in peer feedback is allocating the feedback givers in a good way. It is important that reviewers are allocated to submissions such that the feedback distribution is fair - meaning that all students receive good......Peer feedback is the act of letting students give feedback to each other on submitted work. There are multiple reasons to use peer feedback, including students getting more feedback, time saving for teachers and increased learning by letting students reflect on work by others. In order for peer...... indicated the quality of the feedback. Using this model together with historical data we calculate the feedback-giving skill of each student and uses that as input to an allocation algorithm that assigns submissions to reviewers, in order to optimize the feedback quality for all students. We test...

  14. Prospect theory reflects selective allocation of attention.

    Science.gov (United States)

    Pachur, Thorsten; Schulte-Mecklenbeck, Michael; Murphy, Ryan O; Hertwig, Ralph

    2018-02-01

    There is a disconnect in the literature between analyses of risky choice based on cumulative prospect theory (CPT) and work on predecisional information processing. One likely reason is that for expectation models (e.g., CPT), it is often assumed that people behaved only as if they conducted the computations leading to the predicted choice and that the models are thus mute regarding information processing. We suggest that key psychological constructs in CPT, such as loss aversion and outcome and probability sensitivity, can be interpreted in terms of attention allocation. In two experiments, we tested hypotheses about specific links between CPT parameters and attentional regularities. Experiment 1 used process tracing to monitor participants' predecisional attention allocation to outcome and probability information. As hypothesized, individual differences in CPT's loss-aversion, outcome-sensitivity, and probability-sensitivity parameters (estimated from participants' choices) were systematically associated with individual differences in attention allocation to outcome and probability information. For instance, loss aversion was associated with the relative attention allocated to loss and gain outcomes, and a more strongly curved weighting function was associated with less attention allocated to probabilities. Experiment 2 manipulated participants' attention to losses or gains, causing systematic differences in CPT's loss-aversion parameter. This result indicates that attention allocation can to some extent cause choice regularities that are captured by CPT. Our findings demonstrate an as-if model's capacity to reflect characteristics of information processing. We suggest that the observed CPT-attention links can be harnessed to inform the development of process models of risky choice. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

  15. A Decentralized Heuristic Approach towards Resource Allocation in Femtocell Networks

    Directory of Open Access Journals (Sweden)

    Kyung-Geun Lee

    2013-06-01

    Full Text Available Femtocells represent a novel configuration for existing cellular communication, contributing towards the improvement of coverage and throughput. The dense deployment of these femtocells causes significant femto-macro and femto-femto interference, consequently deteriorating the throughput of femtocells. In this study, we compare two heuristic approaches, i.e., particle swarm optimization (PSO and genetic algorithm (GA, for joint power assignment and resource allocation, within the context of the femtocell environment. The supposition made in this joint optimization is that the discrete power levels are available for the assignment. Furthermore, we have employed two variants of each PSO and GA: inertia weight and constriction factor model for PSO, and twopoint and uniform crossover for GA. The two proposed algorithms are in a decentralized manner, with no involvement of any centralized entity. The comparison is carried out between the two proposed algorithms for the aforementioned joint optimization problem. The contrast includes the performance metrics: including average objective function, min–max throughput of the femtocells, average throughput of the femto users, outage rate and time complexity. The results demonstrate that the decentralized PSO constriction factor outperforms the others in terms of the aforementioned performance metrics.

  16. Allocation of Decommissioning and Waste Liabilities

    International Nuclear Information System (INIS)

    Varley, Geoff

    2011-11-01

    The work demonstrates that there are a number of methods available for cost allocation, the pros and cons of which are examined. The study investigates potential proportional and incremental methods in some depth. A recommendation in principle to use the latter methodology is given. It is concluded that a 'fair assumption' is that the potential allocation of costs for 'the RMA Leaching Hall' probably is small, in relation to the total costs, and estimated to be not more than about 175 kSEK, plus any costs associated with decommissioning/ disposal of a number of small pieces of equipment added by the current operator

  17. Vascularized Composite Allografts: Procurement, Allocation, and Implementation.

    Science.gov (United States)

    Rahmel, Axel

    Vascularized composite allotransplantation is a continuously evolving area of modern transplant medicine. Recently, vascularized composite allografts (VCAs) have been formally classified as 'organs'. In this review, key aspects of VCA procurement are discussed, with a special focus on interaction with the procurement of classical solid organs. In addition, options for a matching and allocation system that ensures VCA donor organs are allocated to the best-suited recipients are looked at. Finally, the different steps needed to promote VCA transplantation in society in general and in the medical community in particular are highlighted.

  18. Resource allocation using ANN in LTE

    Science.gov (United States)

    Yigit, Tuncay; Ersoy, Mevlut

    2017-07-01

    LTE is the 4th generation wireless network technology, which provides flexible bandwidth, higher data speeds and lower delay. Difficulties may be experienced upon an increase in the number of users in LTE. The objective of this study is to ensure a faster solution to any such resource allocation problems which might arise upon an increase in the number of users. A fast and effective solution has been obtained by making use of Artificial Neural Network. As a result, fast working artificial intelligence methods may be used in resource allocation problems during operation.

  19. A Discrete Spectral Problem and Related Hierarchy of Discrete Hamiltonian Lattice Equations

    International Nuclear Information System (INIS)

    Xu Xixiang; Cao Weili

    2007-01-01

    Staring from a discrete matrix spectral problem, a hierarchy of lattice soliton equations is presented though discrete zero curvature representation. The resulting lattice soliton equations possess non-local Lax pairs. The Hamiltonian structures are established for the resulting hierarchy by the discrete trace identity. Liouville integrability of resulting hierarchy is demonstrated.

  20. Type monotonic allocation schemes for multi-glove games

    OpenAIRE

    Brânzei, R.; Solymosi, T.; Tijs, S.H.

    2007-01-01

    Multiglove markets and corresponding games are considered.For this class of games we introduce the notion of type monotonic allocation scheme.Allocation rules for multiglove markets based on weight systems are introduced and characterized.These allocation rules generate type monotonic allocation schemes for multiglove games and are also helpful in proving that each core element of the corresponding game is extendable to a type monotonic allocation scheme.The T-value turns out to generate a ty...

  1. Geometry and Hamiltonian mechanics on discrete spaces

    International Nuclear Information System (INIS)

    Talasila, V; Clemente-Gallardo, J; Schaft, A J van der

    2004-01-01

    Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to provide a discrete analogue of differential geometry, and to define on these discrete models a formal discrete Hamiltonian structure-in doing so we try to bring together various fundamental concepts from numerical analysis, differential geometry, algebraic geometry, simplicial homology and classical Hamiltonian mechanics. For example, the concept of a twisted derivation is borrowed from algebraic geometry for developing a discrete calculus. The theory is applied to a nonlinear pendulum and we compare the dynamics obtained through a discrete modelling approach with the dynamics obtained via the usual discretization procedures. Also an example of an energy-conserving algorithm on a simple harmonic oscillator is presented, and its effect on the Poisson structure is discussed

  2. Cuspidal discrete series for semisimple symmetric spaces

    DEFF Research Database (Denmark)

    Andersen, Nils Byrial; Flensted-Jensen, Mogens; Schlichtkrull, Henrik

    2012-01-01

    We propose a notion of cusp forms on semisimple symmetric spaces. We then study the real hyperbolic spaces in detail, and show that there exists both cuspidal and non-cuspidal discrete series. In particular, we show that all the spherical discrete series are non-cuspidal. (C) 2012 Elsevier Inc. All...

  3. Discrete Riccati equation solutions: Distributed algorithms

    Directory of Open Access Journals (Sweden)

    D. G. Lainiotis

    1996-01-01

    Full Text Available In this paper new distributed algorithms for the solution of the discrete Riccati equation are introduced. The algorithms are used to provide robust and computational efficient solutions to the discrete Riccati equation. The proposed distributed algorithms are theoretically interesting and computationally attractive.

  4. Painleve test and discrete Boltzmann equations

    International Nuclear Information System (INIS)

    Euler, N.; Steeb, W.H.

    1989-01-01

    The Painleve test for various discrete Boltzmann equations is performed. The connection with integrability is discussed. Furthermore the Lie symmetry vector fields are derived and group-theoretical reduction of the discrete Boltzmann equations to ordinary differentiable equations is performed. Lie Backlund transformations are gained by performing the Painleve analysis for the ordinary differential equations. 16 refs

  5. Variance Swap Replication: Discrete or Continuous?

    Directory of Open Access Journals (Sweden)

    Fabien Le Floc’h

    2018-02-01

    Full Text Available The popular replication formula to price variance swaps assumes continuity of traded option strikes. In practice, however, there is only a discrete set of option strikes traded on the market. We present here different discrete replication strategies and explain why the continuous replication price is more relevant.

  6. Discretization vs. Rounding Error in Euler's Method

    Science.gov (United States)

    Borges, Carlos F.

    2011-01-01

    Euler's method for solving initial value problems is an excellent vehicle for observing the relationship between discretization error and rounding error in numerical computation. Reductions in stepsize, in order to decrease discretization error, necessarily increase the number of steps and so introduce additional rounding error. The problem is…

  7. Discrete/PWM Ballast-Resistor Controller

    Science.gov (United States)

    King, Roger J.

    1994-01-01

    Circuit offers low switching loss and automatic compensation for failure of ballast resistor. Discrete/PWM ballast-resistor controller improved shunt voltage-regulator circuit designed to supply power from high-resistance source to low-impedance bus. Provides both coarse discrete voltage levels (by switching of ballast resistors) and continuous fine control of voltage via pulse-width modulation.

  8. Current Density and Continuity in Discretized Models

    Science.gov (United States)

    Boykin, Timothy B.; Luisier, Mathieu; Klimeck, Gerhard

    2010-01-01

    Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schrodinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying…

  9. Geometry and Hamiltonian mechanics on discrete spaces

    NARCIS (Netherlands)

    Talasila, V.; Clemente-Gallardo, J.; Schaft, A.J. van der

    2004-01-01

    Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a ‘smooth’ model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to

  10. Geometry and Hamiltonian mechanics on discrete spaces

    NARCIS (Netherlands)

    Talasila, V.; Clemente Gallardo, J.J.; Clemente-Gallardo, J.; van der Schaft, Arjan

    2004-01-01

    Numerical simulation is often crucial for analysing the behaviour of many complex systems which do not admit analytic solutions. To this end, one either converts a 'smooth' model into a discrete (in space and time) model, or models systems directly at a discrete level. The goal of this paper is to

  11. Discrete mathematics in the high school curriculum

    NARCIS (Netherlands)

    Anderson, I.; Asch, van A.G.; van Lint, J.H.

    2004-01-01

    In this paper we present some topics from the field of discrete mathematics which might be suitable for the high school curriculum. These topics yield both easy to understand challenging problems and important applications of discrete mathematics. We choose elements from number theory and various

  12. Discrete Fourier analysis of multigrid algorithms

    NARCIS (Netherlands)

    van der Vegt, Jacobus J.W.; Rhebergen, Sander

    2011-01-01

    The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential equations. Special attention is given to the

  13. Handbook on modelling for discrete optimization

    CERN Document Server

    Pitsoulis, Leonidas; Williams, H

    2006-01-01

    The primary objective underlying the Handbook on Modelling for Discrete Optimization is to demonstrate and detail the pervasive nature of Discrete Optimization. While its applications cut across an incredibly wide range of activities, many of the applications are only known to specialists. It is the aim of this handbook to correct this. It has long been recognized that "modelling" is a critically important mathematical activity in designing algorithms for solving these discrete optimization problems. Nevertheless solving the resultant models is also often far from straightforward. In recent years it has become possible to solve many large-scale discrete optimization problems. However, some problems remain a challenge, even though advances in mathematical methods, hardware, and software technology have pushed the frontiers forward. This handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It will be done in an academic handbook treatment...

  14. Discrete elements method of neutral particle transport

    International Nuclear Information System (INIS)

    Mathews, K.A.

    1983-01-01

    A new discrete elements (L/sub N/) transport method is derived and compared to the discrete ordinates S/sub N/ method, theoretically and by numerical experimentation. The discrete elements method is more accurate than discrete ordinates and strongly ameliorates ray effects for the practical problems studied. The discrete elements method is shown to be more cost effective, in terms of execution time with comparable storage to attain the same accuracy, for a one-dimensional test case using linear characteristic spatial quadrature. In a two-dimensional test case, a vacuum duct in a shield, L/sub N/ is more consistently convergent toward a Monte Carlo benchmark solution than S/sub N/, using step characteristic spatial quadrature. An analysis of the interaction of angular and spatial quadrature in xy-geometry indicates the desirability of using linear characteristic spatial quadrature with the L/sub N/ method

  15. Spatially localized, temporally quasiperiodic, discrete nonlinear excitations

    International Nuclear Information System (INIS)

    Cai, D.; Bishop, A.R.; Gronbech-Jensen, N.

    1995-01-01

    In contrast to the commonly discussed discrete breather, which is a spatially localized, time-periodic solution, we present an exact solution of a discrete nonlinear Schroedinger breather which is a spatially localized, temporally quasiperiodic nonlinear coherent excitation. This breather is a multiple-soliton solution in the sense of the inverse scattering transform. A discrete breather of multiple frequencies is conceptually important in studies of nonlinear lattice systems. We point out that, for this breather, the incommensurability of its frequencies is a discrete lattice effect and these frequencies become commensurate in the continuum limit. To understand the dynamical properties of the breather, we also discuss its stability and its behavior in the presence of an external potential. Finally, we indicate how to obtain an exact N-soliton breather as a discrete generalization of the continuum multiple-soliton solution

  16. Laplacians on discrete and quantum geometries

    International Nuclear Information System (INIS)

    Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes

    2013-01-01

    We extend discrete calculus for arbitrary (p-form) fields on embedded lattices to abstract discrete geometries based on combinatorial complexes. We then provide a general definition of discrete Laplacian using both the primal cellular complex and its combinatorial dual. The precise implementation of geometric volume factors is not unique and, comparing the definition with a circumcentric and a barycentric dual, we argue that the latter is, in general, more appropriate because it induces a Laplacian with more desirable properties. We give the expression of the discrete Laplacian in several different sets of geometric variables, suitable for computations in different quantum gravity formalisms. Furthermore, we investigate the possibility of transforming from position to momentum space for scalar fields, thus setting the stage for the calculation of heat kernel and spectral dimension in discrete quantum geometries. (paper)

  17. Discrete breathers in graphane: Effect of temperature

    Energy Technology Data Exchange (ETDEWEB)

    Baimova, J. A., E-mail: julia.a.baimova@gmail.com [Russian Academy of Sciences, Institute of Metal Physics, Ural Branch (Russian Federation); Murzaev, R. T.; Lobzenko, I. P.; Dmitriev, S. V. [Russian Academy of Sciences, Institute for Metals Superplasticity Problems (Russian Federation); Zhou, Kun [Nanyang Technological University, School of Mechanical and Aerospace Engineering (Singapore)

    2016-05-15

    The discrete breathers in graphane in thermodynamic equilibrium in the temperature range 50–600 K are studied by molecular dynamics simulation. A discrete breather is a hydrogen atom vibrating along the normal to a sheet of graphane at a high amplitude. As was found earlier, the lifetime of a discrete breather at zero temperature corresponds to several tens of thousands of vibrations. The effect of temperature on the decay time of discrete breathers and the probability of their detachment from a sheet of graphane are studied in this work. It is shown that closely spaced breathers can exchange energy with each other at zero temperature. The data obtained suggest that thermally activated discrete breathers can be involved in the dehydrogenation of graphane, which is important for hydrogen energetics.

  18. Chaotic properties between the nonintegrable discrete nonlinear Schroedinger equation and a nonintegrable discrete Heisenberg model

    International Nuclear Information System (INIS)

    Ding Qing

    2007-01-01

    We prove that the integrable-nonintegrable discrete nonlinear Schroedinger equation (AL-DNLS) introduced by Cai, Bishop and Gronbech-Jensen (Phys. Rev. Lett. 72 591(1994)) is the discrete gauge equivalent to an integrable-nonintegrable discrete Heisenberg model from the geometric point of view. Then we study whether the transmission and bifurcation properties of the AL-DNLS equation are preserved under the action of discrete gauge transformations. Our results reveal that the transmission property of the AL-DNLS equation is completely preserved and the bifurcation property is conditionally preserved to those of the integrable-nonintegrable discrete Heisenberg model

  19. Trajectories of goods in distributed allocation

    NARCIS (Netherlands)

    Chevaleyre, Y.; Endriss, U.; Maudet, N.; Padgham, L.; Parkes, D.; Müller, J.; Parsons, S.

    2008-01-01

    Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging resources. It is no surprise that restrictions on potential deals also restrict the reachability of some desirable states, for

  20. Multiobjective optimal allocation problem with probabilistic non ...

    African Journals Online (AJOL)

    This paper considers the optimum compromise allocation in multivariate stratified sampling with non-linear objective function and probabilistic non-linear cost constraint. The probabilistic non-linear cost constraint is converted into equivalent deterministic one by using Chance Constrained programming. A numerical ...

  1. Human Resource Subjects Allocation and Students' Academic ...

    African Journals Online (AJOL)

    This study investigated human resource subjects' allocation and students' academic performance in Secondary Schools in Obudu, Nigeria. The relevant variables of teachers subject was used as independent variable while the dependent variables were students' academic performance. Six hundred teachers from 20 ...

  2. FARM RESOURCE ALLOCATION AND PROFITABILITY OF ...

    African Journals Online (AJOL)

    Unique cropping systems have emerged in Nigeria to suit limited farmer resources and production objectives in humid forest inland valley ecosystems. But the basis for farm resource allocation and profitability of different crop enterprises are not properly understood. This study is based on a survey of 48 randomly selected ...

  3. Administrative Decision Making and Resource Allocation.

    Science.gov (United States)

    Sardy, Susan; Sardy, Hyman

    This paper considers selected aspects of the systems analysis of administrative decisionmaking regarding resource allocations in an educational system. A model of the instructional materials purchase system is presented. The major components of this model are: environment, input, decision process, conversion structure, conversion process, output,…

  4. Dynamic resource allocation using performance forecasting

    NARCIS (Netherlands)

    Moura, Paulo; Kon, Fabio; Voulgaris, Spyros; Van Steen, Maarten

    2016-01-01

    To benefit from the performance gains and cost savings enabled by elasticity in cloud IaaS environments, effective automated mechanisms for scaling are essential. This automation requires monitoring system status and defining criteria to trigger allocation and deallocation of resources. While these

  5. Resource Allocation Patterns and Student Achievement

    Science.gov (United States)

    James, Lori; Pate, James; Leech, Donald; Martin, Ellice; Brockmeier, Lantry; Dees, Elizabeth

    2011-01-01

    This quantitative research study was designed to examine the relationship between system resource allocation patterns and student achievement, as measured by eighth grade Criterion-Referenced Competency Test (CRCT) mathematics, eighth grade CRCT reading, eleventh grade Georgia High School Graduation Test (GHSGT) mathematics, eleventh grade and…

  6. 42 CFR 24.2 - Allocation.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 1 2010-10-01 2010-10-01 false Allocation. 24.2 Section 24.2 Public Health PUBLIC HEALTH SERVICE, DEPARTMENT OF HEALTH AND HUMAN SERVICES PERSONNEL SENIOR BIOMEDICAL RESEARCH SERVICE § 24... talent. (e) The Secretary will ensure that SBRS slots are used in support of high priority programs...

  7. Biased Allocation of Faces to Social Categories

    NARCIS (Netherlands)

    Dotsch, R.; Wigboldus, D.H.J.; Knippenberg, A.F.M. van

    2011-01-01

    Three studies show that social categorization is biased at the level of category allocation. In all studies, participants categorized faces. In Studies 1 and 2, participants overallocated faces with criminal features-a stereotypical negative trait-to the stigmatized Moroccan category, especially if

  8. Cooperation and profit allocation in distribution chains

    NARCIS (Netherlands)

    Guardiola, L.A.; Meca, A.; Timmer, Judith B.

    2005-01-01

    We study the coordination of actions and the allocation of profit in distribution chains under decentralized control. We consider distribution chains in which a single supplier supplies goods for replenishment of stocks of several retailers who, in turn, sell these goods to their own separate

  9. Cooperation and profit allocation in distribution chains

    NARCIS (Netherlands)

    Guardiola, Luis A.; Meca, Ana; Timmer, Judith B.

    2007-01-01

    We study the coordination of actions and the allocation of profit in supply chains under decentralized control in which a single supplier supplies several retailers with goods for replenishment of stocks. The goal of the supplier and the retailers is to maximize their individual profits. Since the

  10. Analysts' earnings forecasts and international asset allocation

    NARCIS (Netherlands)

    Huijgen, Carel; Plantinga, Auke

    1999-01-01

    The aim of this paper is to investigate whether financial analysts’ earnings forecasts are informative from the viewpoint of allocating investments across different stock markets. Therefore we develop a country forecast indicator reflecting the analysts’ prospects for specific stock markets. The

  11. Adaptive resource allocation for efficient patient scheduling

    NARCIS (Netherlands)

    Vermeulen, Ivan B.; Bohte, Sander M.; Elkhuizen, Sylvia G.; Lameris, Han; Bakker, Piet J. M.; La Poutré, Han

    2009-01-01

    Efficient scheduling of patient appointments on expensive resources is a complex and dynamic task. A resource is typically used by several patient groups. To service these groups, resource capacity is often allocated per group, explicitly or implicitly. Importantly, due to fluctuations in demand,

  12. Patient flow based allocation of hospital resources.

    Science.gov (United States)

    Vissers, J M

    1995-01-01

    The current practice of allocating resources within a hospital introduces peaks and troughs in the workloads of departments and leads therefore to loss of capacity. This happens when requirements for capacity coordination are not adequately taken into account in the decision making process of allocating resources to specialties. The first part of this research involved an analysis of the hospital's production system on dependencies between resources, resulting in a number of capacity coordination requirements that need to be fulfilled for optimized resource utilization. The second, modelling, part of the study involved the development of a framework for resource management decision making, of a set of computer models to support hospital managerial decision making on resource allocation issues in various parts of the hospital, and of an implementation strategy for the application of the models to concrete hospital settings. The third part of the study was devoted to a number of case-studies, illustrating the use of the models when applied in various resource management projects, such as a reorganization of an operating theatre timetable, or the development of a master plan for activities of a group of general surgeons serving two locations of a merged hospital system. The paper summarizes the main findings of the study and concludes with a discussion of results obtained with the new allocation procedure and with recommendations for future research.

  13. Issues in organ procurement, allocation, and transplantation.

    Science.gov (United States)

    Nierste, Deborah

    2013-01-01

    Organ transplantation extends lives and improves health but presents complex ethical dilemmas for nurses caring for donors, recipients, and their families. This article overviews organ procurement and allocation, discusses ethical dilemmas in transplantation, and offers strategies from professional and biblical perspectives for coping with moral distress and maintaining compassionate care.

  14. 15 CFR 923.110 - Allocation formula.

    Science.gov (United States)

    2010-01-01

    ... and comment. (f) Calculation of financial assistance award levels. Actual financial assistance award... matches any such grant according to the following ratios of Federal-to-state contributions for the...) Allocation formula factors and weighting. Each State eligible to receive a financial assistance award shall...

  15. Allocation of Cognitive Resources in Translation

    DEFF Research Database (Denmark)

    Hvelplund, Kristian Tangsgaard

    The present study is an empirical investigation of translators' allocation of cognitive resources during the translation process, and it aims at investigating how translators' mental processing resources are put to use during translation. The study bases ts analyses on quantitative eye...

  16. Axioms for health care resource allocation

    DEFF Research Database (Denmark)

    Østerdal, Lars Peter

    2005-01-01

    This paper examines principles of health care resource allocation based on axioms for individual preferences and distributive justice. We establish axioms for representing individual preferences by quality-adjusted life years (QALYs), as well as axioms for existence of a social welfare function...

  17. Financial Resource Allocation in Higher Education

    Science.gov (United States)

    Ušpuriene, Ana; Sakalauskas, Leonidas; Dumskis, Valerijonas

    2017-01-01

    The paper considers a problem of financial resource allocation in a higher education institution. The basic financial management instruments and the multi-stage cost minimization model created are described involving financial instruments to constraints. Both societal and institutional factors that determine the costs of educating students are…

  18. Spatial allocation of forest recreation value

    Science.gov (United States)

    Kenneth A. Baerenklau; Armando Gonzalez-Caban; Catrina Paez; Edgard Chavez

    2009-01-01

    Non-market valuation methods and geographic information systems are useful planning and management tools for public land managers. Recent attention has been given to investigation and demonstration of methods for combining these tools to provide spatially-explicit representations of non-market value. Most of these efforts have focused on spatial allocation of...

  19. Capital Allocation Effects of Financial Reporting Regulation

    NARCIS (Netherlands)

    Koenigsgruber, R.

    2012-01-01

    This paper analyses the effects of stricter financial reporting enforcement on capital allocation and reporting quality in a game-theoretic model and derives conclusions about optimal enforcement strictness. Analysis of the model shows that reporting quality strictly increases with tighter

  20. Compatible Spatial Discretizations for Partial Differential Equations

    Energy Technology Data Exchange (ETDEWEB)

    Arnold, Douglas, N, ed.

    2004-11-25

    From May 11--15, 2004, the Institute for Mathematics and its Applications held a hot topics workshop on Compatible Spatial Discretizations for Partial Differential Equations. The numerical solution of partial differential equations (PDE) is a fundamental task in science and engineering. The goal of the workshop was to bring together a spectrum of scientists at the forefront of the research in the numerical solution of PDEs to discuss compatible spatial discretizations. We define compatible spatial discretizations as those that inherit or mimic fundamental properties of the PDE such as topology, conservation, symmetries, and positivity structures and maximum principles. A wide variety of discretization methods applied across a wide range of scientific and engineering applications have been designed to or found to inherit or mimic intrinsic spatial structure and reproduce fundamental properties of the solution of the continuous PDE model at the finite dimensional level. A profusion of such methods and concepts relevant to understanding them have been developed and explored: mixed finite element methods, mimetic finite differences, support operator methods, control volume methods, discrete differential forms, Whitney forms, conservative differencing, discrete Hodge operators, discrete Helmholtz decomposition, finite integration techniques, staggered grid and dual grid methods, etc. This workshop seeks to foster communication among the diverse groups of researchers designing, applying, and studying such methods as well as researchers involved in practical solution of large scale problems that may benefit from advancements in such discretizations; to help elucidate the relations between the different methods and concepts; and to generally advance our understanding in the area of compatible spatial discretization methods for PDE. Particular points of emphasis included: + Identification of intrinsic properties of PDE models that are critical for the fidelity of numerical

  1. Perfect discretization of reparametrization invariant path integrals

    International Nuclear Information System (INIS)

    Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

    2011-01-01

    To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

  2. Perfect discretization of reparametrization invariant path integrals

    Science.gov (United States)

    Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

    2011-05-01

    To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

  3. Higher dimensional discrete Cheeger inequalities

    Directory of Open Access Journals (Sweden)

    Anna Gundert

    2015-01-01

    Full Text Available For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of which states that $\\lambda(G \\leq h(G$, where $\\lambda(G$ is the second smallest eigenvalue of the Laplacian of a graph $G$ and $h(G$ is the Cheeger constant measuring the edge expansion of $G$. We are interested in generalizations of expansion properties to finite simplicial complexes of higher dimension (or uniform hypergraphs. Whereas higher dimensional Laplacians were introduced already in 1945 by Eckmann, the generalization of edge expansion to simplicial complexes is not straightforward. Recently, a topologically motivated notion analogous to edge expansion that is based on $\\mathbb{Z}_2$-cohomology was introduced by Gromov and independently by Linial, Meshulam and Wallach. It is known that for this generalization there is no direct higher dimensional analogue of the lower bound of the Cheeger inequality. A different, combinatorially motivated generalization of the Cheeger constant, denoted by $h(X$, was studied by Parzanchevski, Rosenthal and Tessler. They showed that indeed $\\lambda(X \\leq h(X$, where $\\lambda(X$ is the smallest non-trivial eigenvalue of the ($(k-1$-dimensional upper Laplacian, for the case of $k$-dimensional simplicial complexes $X$ with complete $(k-1$-skeleton. Whether this inequality also holds for $k$-dimensional complexes with non-com\\-plete$(k-1$-skeleton has been an open question.We give two proofs of the inequality for arbitrary complexes. The proofs differ strongly in the methods and structures employed,and each allows for a different kind of additional strengthening of the original result.

  4. Resonance and web structure in discrete soliton systems: the two-dimensional Toda lattice and its fully discrete and ultra-discrete analogues

    International Nuclear Information System (INIS)

    Maruno, Ken-ichi; Biondini, Gino

    2004-01-01

    We present a class of solutions of the two-dimensional Toda lattice equation, its fully discrete analogue and its ultra-discrete limit. These solutions demonstrate the existence of soliton resonance and web-like structure in discrete integrable systems such as differential-difference equations, difference equations and cellular automata (ultra-discrete equations)

  5. Hairs of discrete symmetries and gravity

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Kang Sin [Scranton Honors Program, Ewha Womans University, Seodaemun-Gu, Seoul 03760 (Korea, Republic of); Center for Fields, Gravity and Strings, CTPU, Institute for Basic Sciences, Yuseong-Gu, Daejeon 34047 (Korea, Republic of); Kim, Jihn E., E-mail: jihnekim@gmail.com [Department of Physics, Kyung Hee University, 26 Gyungheedaero, Dongdaemun-Gu, Seoul 02447 (Korea, Republic of); Center for Axion and Precision Physics Research (IBS), 291 Daehakro, Yuseong-Gu, Daejeon 34141 (Korea, Republic of); Kyae, Bumseok [Department of Physics, Pusan National University, 2 Busandaehakro-63-Gil, Geumjeong-Gu, Busan 46241 (Korea, Republic of); Nam, Soonkeon [Department of Physics, Kyung Hee University, 26 Gyungheedaero, Dongdaemun-Gu, Seoul 02447 (Korea, Republic of)

    2017-06-10

    Gauge symmetries are known to be respected by gravity because gauge charges carry flux lines, but global charges do not carry flux lines and are not conserved by gravitational interaction. For discrete symmetries, they are spontaneously broken in the Universe, forming domain walls. Since the realization of discrete symmetries in the Universe must involve the vacuum expectation values of Higgs fields, a string-like configuration (hair) at the intersection of domain walls in the Higgs vacua can be realized. Therefore, we argue that discrete charges are also respected by gravity.

  6. Hairs of discrete symmetries and gravity

    Directory of Open Access Journals (Sweden)

    Kang Sin Choi

    2017-06-01

    Full Text Available Gauge symmetries are known to be respected by gravity because gauge charges carry flux lines, but global charges do not carry flux lines and are not conserved by gravitational interaction. For discrete symmetries, they are spontaneously broken in the Universe, forming domain walls. Since the realization of discrete symmetries in the Universe must involve the vacuum expectation values of Higgs fields, a string-like configuration (hair at the intersection of domain walls in the Higgs vacua can be realized. Therefore, we argue that discrete charges are also respected by gravity.

  7. Discrete Morse functions for graph configuration spaces

    International Nuclear Information System (INIS)

    Sawicki, A

    2012-01-01

    We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions, which have a nice physical interpretation as two-body potentials constructed from one-body potentials. We also give a brief introduction to discrete Morse theory. Our motivation comes from the problem of quantum statistics for particles on networks, for which generalized versions of anyon statistics can appear. (paper)

  8. Discrete Tomography and Imaging of Polycrystalline Structures

    DEFF Research Database (Denmark)

    Alpers, Andreas

    High resolution transmission electron microscopy is commonly considered as the standard application for discrete tomography. While this has yet to be technically realized, new applications with a similar flavor have emerged in materials science. In our group at Ris� DTU (Denmark's National...... Laboratory for Sustainable Energy), for instance, we study polycrystalline materials via synchrotron X-ray diffraction. Several reconstruction problems arise, most of them exhibit inherently discrete aspects. In this talk I want to give a concise mathematical introduction to some of these reconstruction...... problems. Special focus is on their relationship to classical discrete tomography. Several open mathematical questions will be mentioned along the way....

  9. Ensemble simulations with discrete classical dynamics

    DEFF Research Database (Denmark)

    Toxværd, Søren

    2013-01-01

    For discrete classical Molecular dynamics (MD) obtained by the "Verlet" algorithm (VA) with the time increment $h$ there exist a shadow Hamiltonian $\\tilde{H}$ with energy $\\tilde{E}(h)$, for which the discrete particle positions lie on the analytic trajectories for $\\tilde{H}$. $\\tilde......{E}(h)$ is employed to determine the relation with the corresponding energy, $E$ for the analytic dynamics with $h=0$ and the zero-order estimate $E_0(h)$ of the energy for discrete dynamics, appearing in the literature for MD with VA. We derive a corresponding time reversible VA algorithm for canonical dynamics...

  10. Stochastic Kuramoto oscillators with discrete phase states

    Science.gov (United States)

    Jörg, David J.

    2017-09-01

    We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

  11. Stochastic Kuramoto oscillators with discrete phase states.

    Science.gov (United States)

    Jörg, David J

    2017-09-01

    We present a generalization of the Kuramoto phase oscillator model in which phases advance in discrete phase increments through Poisson processes, rendering both intrinsic oscillations and coupling inherently stochastic. We study the effects of phase discretization on the synchronization and precision properties of the coupled system both analytically and numerically. Remarkably, many key observables such as the steady-state synchrony and the quality of oscillations show distinct extrema while converging to the classical Kuramoto model in the limit of a continuous phase. The phase-discretized model provides a general framework for coupled oscillations in a Markov chain setting.

  12. Discrete-Time Biomedical Signal Encryption

    Directory of Open Access Journals (Sweden)

    Victor Grigoraş

    2017-12-01

    Full Text Available Chaotic modulation is a strong method of improving communication security. Analog and discrete chaotic systems are presented in actual literature. Due to the expansion of digital communication, discrete-time systems become more efficient and closer to actual technology. The present contribution offers an in-depth analysis of the effects chaos encryption produce on 1D and 2D biomedical signals. The performed simulations show that modulating signals are precisely recovered by the synchronizing receiver if discrete systems are digitally implemented and the coefficients precisely correspond. Channel noise is also applied and its effects on biomedical signal demodulation are highlighted.

  13. Discrete symmetries and de Sitter spacetime

    Energy Technology Data Exchange (ETDEWEB)

    Cotăescu, Ion I., E-mail: gpascu@physics.uvt.ro; Pascu, Gabriel, E-mail: gpascu@physics.uvt.ro [West University of Timişoara, V. Pârvan Ave. 4, RO-300223 Timişoara (Romania)

    2014-11-24

    Aspects of the ambiguity in defining quantum modes on de Sitter spacetime using a commuting system composed only of differential operators are discussed. Discrete symmetries and their actions on the wavefunction in commonly used coordinate charts are reviewed. It is argued that the system of commuting operators can be supplemented by requiring the invariance of the wavefunction to combined discrete symmetries- a criterion which selects a single state out of the α-vacuum family. Two such members of this family are singled out by particular combined discrete symmetries- states between which exists a well-known thermality relation.

  14. Relay Selection and Resource Allocation in One-Way and Two-Way Cognitive Relay Networks

    KAUST Repository

    Alsharoa, Ahmad M.

    2013-05-08

    In this work, the problem of relay selection and resource power allocation in one- way and two-way cognitive relay networks using half duplex channels with different relaying protocols is investigated. Optimization problems for both single and multiple relay selection that maximize the sum rate of the secondary network without degrading the quality of service of the primary network by respecting a tolerated interference threshold were formulated. Single relay selection and optimal power allocation for two-way relaying cognitive radio networks using decode-and-forward and amplify-and-forward protocols were studied. Dual decomposition and subgradient methods were used to find the optimal power allocation. The transmission process to exchange two different messages between two transceivers for two-way relaying technique takes place in two time slots. In the first slot, the transceivers transmit their signals simultaneously to the relay. Then, during the second slot the relay broadcasts its signal to the terminals. Moreover, improvement of both spectral and energy efficiency can be achieved compared with the one-way relaying technique. As an extension, a multiple relay selection for both one-way and two-way relaying under cognitive radio scenario using amplify-and-forward were discussed. A strong optimization tool based on genetic and iterative algorithms was employed to solve the 
formulated optimization problems for both single and multiple relay selection, where discrete relay power levels were considered. Simulation results show that the practical and low-complexity heuristic approaches achieve almost the same performance of the optimal relay selection schemes either with discrete or continuous power distributions while providing a considerable saving in terms of computational complexity.

  15. Exterior difference systems and invariance properties of discrete mechanics

    International Nuclear Information System (INIS)

    Xie Zheng; Xie Duanqiang; Li Hongbo

    2008-01-01

    Invariance properties describe the fundamental physical laws in discrete mechanics. Can those properties be described in a geometric way? We investigate an exterior difference system called the discrete Euler-Lagrange system, whose solution has one-to-one correspondence with solutions of discrete Euler-Lagrange equations, and use it to define the first integrals. The preservation of the discrete symplectic form along the discrete Hamilton phase flows and the discrete Noether's theorem is also described in the language of difference forms

  16. Community Preferences for the Allocation & Donation of Organs--the PAraDOx Study.

    Science.gov (United States)

    Howard, Kirsten; Jan, Stephen; Rose, John; Chadban, Steven; Allen, Richard D M; Irving, Michelle; Tong, Allison; Wong, Germaine; Craig, Jonathan C; Cass, Alan

    2011-05-25

    Transplantation is the treatment of choice for people with severe organ failure. However, demand substantially exceeds supply of suitable organs; consequently many people wait months, or years to receive an organ. Reasons for the chronic shortage of deceased organ donations are unclear; there appears to be no lack of 'in principle' public support for organ donation. The PAraDOx Study examines community preferences for organ donation policy in Australia. The aims are to 1) determine which factors influence decisions by individuals to offer their organs for donation and 2) determine the criteria by which the community deems the allocation of donor organs to be fair and equitable. Qualitative and quantitative methods will be used to assess community preferences for organ donation and allocation.Focus group participants from the general community, aged between 18-80, will be purposively sampled to ensure a variety of cultural backgrounds and views on organ donation. Each focus group will include a ranking exercise using a modified nominal group technique. Focus groups of organ recipients, their families, and individuals on a transplant waiting list will also be conducted.Using the qualitative work, a discrete choice study will be designed to quantitatively assess community preferences. Discrete choice methods are based on the premise that goods and services can be described in terms of a number of separate attributes. Respondents are presented with a series of choices where levels of attributes are varied, and a mathematical function is estimated to describe numerically the value respondents attach to different options. Two community surveys will be conducted in approximately 1000 respondents each to assess community preferences for organ donation and allocation. A mixed logit model will be used; model results will be expressed as parameter estimates (β) and the odds of choosing one option over an alternative. Trade-offs between attributes will also be calculated. By

  17. Community Preferences for the Allocation &Donation of Organs - The PAraDOx Study

    Directory of Open Access Journals (Sweden)

    Irving Michelle

    2011-05-01

    Full Text Available Abstract Background Transplantation is the treatment of choice for people with severe organ failure. However, demand substantially exceeds supply of suitable organs; consequently many people wait months, or years to receive an organ. Reasons for the chronic shortage of deceased organ donations are unclear; there appears to be no lack of 'in principle' public support for organ donation. Methods/Design The PAraDOx Study examines community preferences for organ donation policy in Australia. The aims are to 1 determine which factors influence decisions by individuals to offer their organs for donation and 2 determine the criteria by which the community deems the allocation of donor organs to be fair and equitable. Qualitative and quantitative methods will be used to assess community preferences for organ donation and allocation. Focus group participants from the general community, aged between 18-80, will be purposively sampled to ensure a variety of cultural backgrounds and views on organ donation. Each focus group will include a ranking exercise using a modified nominal group technique. Focus groups of organ recipients, their families, and individuals on a transplant waiting list will also be conducted. Using the qualitative work, a discrete choice study will be designed to quantitatively assess community preferences. Discrete choice methods are based on the premise that goods and services can be described in terms of a number of separate attributes. Respondents are presented with a series of choices where levels of attributes are varied, and a mathematical function is estimated to describe numerically the value respondents attach to different options. Two community surveys will be conducted in approximately 1000 respondents each to assess community preferences for organ donation and allocation. A mixed logit model will be used; model results will be expressed as parameter estimates (β and the odds of choosing one option over an alternative

  18. Spectrum and power allocation in cognitive multi-beam satellite communications with flexible satellite payloads

    Science.gov (United States)

    Liu, Zhihui; Wang, Haitao; Dong, Tao; Yin, Jie; Zhang, Tingting; Guo, Hui; Li, Dequan

    2018-02-01

    In this paper, the cognitive multi-beam satellite system, i.e., two satellite networks coexist through underlay spectrum sharing, is studied, and the power and spectrum allocation method is employed for interference control and throughput maximization. Specifically, the multi-beam satellite with flexible payload reuses the authorized spectrum of the primary satellite, adjusting its transmission band as well as power for each beam to limit its interference on the primary satellite below the prescribed threshold and maximize its own achievable rate. This power and spectrum allocation problem is formulated as a mixed nonconvex programming. For effective solving, we first introduce the concept of signal to leakage plus noise ratio (SLNR) to decouple multiple transmit power variables in the both objective and constraint, and then propose a heuristic algorithm to assign spectrum sub-bands. After that, a stepwise plus slice-wise algorithm is proposed to implement the discrete power allocation. Finally, simulation results show that adopting cognitive technology can improve spectrum efficiency of the satellite communication.

  19. Interactive Land-Use Optimization Using Laguerre Voronoi Diagram with Dynamic Generating Point Allocation

    Science.gov (United States)

    Chaidee, S.; Pakawanwong, P.; Suppakitpaisarn, V.; Teerasawat, P.

    2017-09-01

    In this work, we devise an efficient method for the land-use optimization problem based on Laguerre Voronoi diagram. Previous Voronoi diagram-based methods are more efficient and more suitable for interactive design than discrete optimization-based method, but, in many cases, their outputs do not satisfy area constraints. To cope with the problem, we propose a force-directed graph drawing algorithm, which automatically allocates generating points of Voronoi diagram to appropriate positions. Then, we construct a Laguerre Voronoi diagram based on these generating points, use linear programs to adjust each cell, and reconstruct the diagram based on the adjustment. We adopt the proposed method to the practical case study of Chiang Mai University's allocated land for a mixed-use complex. For this case study, compared to other Voronoi diagram-based method, we decrease the land allocation error by 62.557 %. Although our computation time is larger than the previous Voronoi-diagram-based method, it is still suitable for interactive design.

  20. Risk allocation in independent power supply contracts

    International Nuclear Information System (INIS)

    Willrich, M.; Campbell, W.L.

    1992-01-01

    Congress has made significant progress in recent months toward amending the Public Utility Holding Company Act of 1935 (PUHCA). The purposes of such amendment are to broaden power supply options for electric utilities and expand competition in whole-sale power generation markets. PUHCA reform is an integral part of President Bush's National Energy Strategy and has been included in legislation pending in both Houses of Congress. Congress will, hopefully, approve energy legislation that includes PUHCA reform before it adjourns this year. PUHCA reform has, however, stimulated heated debate within the power industry itself as well as among various consumer interest groups. One important issue in the public debate concerns risk allocation. If PUHCA is reformed, will risk be allocated efficiently and equitably between independent power producers and electric utility buyers? This article addresses that important question

  1. Using contests to allocate pollution rights

    International Nuclear Information System (INIS)

    MacKenzie, Ian A.; Hanley, Nick; Kornienko, Tatiana

    2009-01-01

    In this paper we advocate a new initial allocation mechanism for a tradable pollution permit market. We outline a Permit Allocation Contest (PAC) that distributes permits to firms based on their rank relative to other firms. This ranking is achieved by ordering firms based on an observable 'external action' where the external action is an activity or characteristic of the firm that is independent of their choice of emissions in the tradable permit market. We argue that this mechanism has a number of benefits over auctioning and grandfathering. Using this mechanism efficiently distributes permits, allows for the attainment of a secondary policy objective and has the potential to be more politically appealing than existing alternatives.

  2. The dynamics of farm land allocation

    DEFF Research Database (Denmark)

    Arnberg, Søren; Hansen, Lars Gårn

    This study develops a dynamic multi-output model of farmers’ crop allocation decisions that allows estimation of both short-run and long-run adjustments to a wide array of economic incentives. The method can be used to inform decision-makers about a number of issues including agricultural policy...... reform and environmental regulation. The model allows estimation of dynamic effects relating to price expectations adjustment, investment lags and crop rotation constraints. Estimation is based on micro-panel data from Danish farmers that includes acreage, output and variable input utilisation...... at the crop level. Results indicate that there are substantial differences between the shortrun and long-run land allocation behaviour of Danish farmers and that there are substantial differences in the time lags associated with different crops. Since similar farming conditions are found in northern Europe...

  3. Fund Allocation in Complex Rehabilitation Programs

    Directory of Open Access Journals (Sweden)

    Tarek Hegazy

    2013-12-01

    Full Text Available Civil Infrastructure assets require continuous renewal actions to sustain their operability and safety. Allocating limited renewal funds amongst numerous building components, however, represents a large-scale optimization problem and earlier efforts utilized genetic algorithms (GAs to optimize medium size problems yet exhibit steep performance degradation as problem size increases. In this research, after experimenting with various approaches of segmenting a large problem into multiple smaller sub-problems, clustered segmentation proved to be the most promising. The paper discusses the underlying life cycle analysis model, the various segmentation methods, and the optimization results using the improved GAs + clustered segmentation, which proved to be able to optimize asset renewals for 50,000 components with no noticeable performance degradation. The proposed method is simple and logical, and can be used on variety of asset types to improve infrastructure fund allocation. Future extension of this research is then highlighted.

  4. On organizing principles of discrete differential geometry. Geometry of spheres

    International Nuclear Information System (INIS)

    Bobenko, Alexander I; Suris, Yury B

    2007-01-01

    Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. This survey contains a discussion of the following two fundamental discretization principles: the transformation group principle (smooth geometric objects and their discretizations are invariant with respect to the same transformation group) and the consistency principle (discretizations of smooth parametrized geometries can be extended to multidimensional consistent nets). The main concrete geometric problem treated here is discretization of curvature-line parametrized surfaces in Lie geometry. Systematic use of the discretization principles leads to a discretization of curvature-line parametrization which unifies circular and conical nets.

  5. Adolescence, Attention Allocation, and Driving Safety

    OpenAIRE

    Romer, Daniel; Lee, Yi-Ching; McDonald, Catherine C.; Winston, Flaura K.

    2014-01-01

    Motor vehicle crashes are the leading source of morbidity and mortality in adolescents in the United States and the developed world. Inadequate allocation of attention to the driving task and to driving hazards are important sources of adolescent crashes. We review major explanations for these attention failures with particular focus on the roles that brain immaturity and lack of driving experience play in causing attention problems. The review suggests that the potential for overcoming inexp...

  6. Nonparametric correlation models for portfolio allocation

    DEFF Research Database (Denmark)

    Aslanidis, Nektarios; Casas, Isabel

    2013-01-01

    This article proposes time-varying nonparametric and semiparametric estimators of the conditional cross-correlation matrix in the context of portfolio allocation. Simulations results show that the nonparametric and semiparametric models are best in DGPs with substantial variability or structural ...... currencies. Results show the nonparametric model generally dominates the others when evaluating in-sample. However, the semiparametric model is best for out-of-sample analysis....

  7. Rethinking Reinforcement: Allocation, Induction, and Contingency

    Science.gov (United States)

    Baum, William M

    2012-01-01

    The concept of reinforcement is at least incomplete and almost certainly incorrect. An alternative way of organizing our understanding of behavior may be built around three concepts: allocation, induction, and correlation. Allocation is the measure of behavior and captures the centrality of choice: All behavior entails choice and consists of choice. Allocation changes as a result of induction and correlation. The term induction covers phenomena such as adjunctive, interim, and terminal behavior—behavior induced in a situation by occurrence of food or another Phylogenetically Important Event (PIE) in that situation. Induction resembles stimulus control in that no one-to-one relation exists between induced behavior and the inducing event. If one allowed that some stimulus control were the result of phylogeny, then induction and stimulus control would be identical, and a PIE would resemble a discriminative stimulus. Much evidence supports the idea that a PIE induces all PIE-related activities. Research also supports the idea that stimuli correlated with PIEs become PIE-related conditional inducers. Contingencies create correlations between “operant” activity (e.g., lever pressing) and PIEs (e.g., food). Once an activity has become PIE-related, the PIE induces it along with other PIE-related activities. Contingencies also constrain possible performances. These constraints specify feedback functions, which explain phenomena such as the higher response rates on ratio schedules in comparison with interval schedules. Allocations that include a lot of operant activity are “selected” only in the sense that they generate more frequent occurrence of the PIE within the constraints of the situation; contingency and induction do the “selecting.” PMID:22287807

  8. Allocating nuclear power plant costs: an extension

    International Nuclear Information System (INIS)

    Bierman, H. Jr.

    1984-01-01

    The author modifies and extends the argument presented in the September 22, 1983 issue by Richard E. Nellis for using economic depreciation to allocate nuclear power plant costs. The two goals of his model are to charge constant real costs to consumers and to provide a fair return of .125 to investors in each period. The addition of other objectives requires further modification of the model since the schedule of revenues that are deemed to be optimum defines the depreciation schedule. 1 table

  9. Can time be a discrete dynamical variable

    International Nuclear Information System (INIS)

    Lee, T.D.

    1983-01-01

    The possibility that time can be regarded as a discrete dynamical variable is examined through all phases of mechanics: from classical mechanics to nonrelativistic quantum mechanics, and to relativistic quantum field theories. (orig.)

  10. Local discrete symmetries from superstring derived models

    International Nuclear Information System (INIS)

    Faraggi, A.E.

    1996-10-01

    Discrete and global symmetries play an essential role in many extensions of the Standard Model, for example, to preserve the proton lifetime, to prevent flavor changing neutral currents, etc. An important question is how can such symmetries survive in a theory of quantum gravity, like superstring theory. In a specific string model the author illustrates how local discrete symmetries may arise in string models and play an important role in preventing fast proton decay and flavor changing neutral currents. The local discrete symmetry arises due to the breaking of the non-Abelian gauge symmetries by Wilson lines in the superstring models and forbids, for example dimension five operators which mediate rapid proton decay, to all orders of nonrenormalizable terms. In the context of models of unification of the gauge and gravitational interactions, it is precisely this type of local discrete symmetries that must be found in order to insure that a given model is not in conflict with experimental observations

  11. Breatherlike impurity modes in discrete nonlinear lattices

    DEFF Research Database (Denmark)

    Hennig, D.; Rasmussen, Kim; Tsironis, G. P.

    1995-01-01

    We investigate the properties of a disordered generalized discrete nonlinear Schrodinger equation, containing both diagonal and nondiagonal nonlinear terms. The equation models a Linear host lattice doped with nonlinear impurities. We find different types of impurity states that form itinerant...

  12. Inferring gene networks from discrete expression data

    KAUST Repository

    Zhang, L.; Mallick, B. K.

    2013-01-01

    graphical models applied to continuous data, which give a closedformmarginal likelihood. In this paper,we extend network modeling to discrete data, specifically data from serial analysis of gene expression, and RNA-sequencing experiments, both of which

  13. A discrete control model of PLANT

    Science.gov (United States)

    Mitchell, C. M.

    1985-01-01

    A model of the PLANT system using the discrete control modeling techniques developed by Miller is described. Discrete control models attempt to represent in a mathematical form how a human operator might decompose a complex system into simpler parts and how the control actions and system configuration are coordinated so that acceptable overall system performance is achieved. Basic questions include knowledge representation, information flow, and decision making in complex systems. The structure of the model is a general hierarchical/heterarchical scheme which structurally accounts for coordination and dynamic focus of attention. Mathematically, the discrete control model is defined in terms of a network of finite state systems. Specifically, the discrete control model accounts for how specific control actions are selected from information about the controlled system, the environment, and the context of the situation. The objective is to provide a plausible and empirically testable accounting and, if possible, explanation of control behavior.

  14. Running Parallel Discrete Event Simulators on Sierra

    Energy Technology Data Exchange (ETDEWEB)

    Barnes, P. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Jefferson, D. R. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2015-12-03

    In this proposal we consider porting the ROSS/Charm++ simulator and the discrete event models that run under its control so that they run on the Sierra architecture and make efficient use of the Volta GPUs.

  15. Effective Hamiltonian for travelling discrete breathers

    Science.gov (United States)

    MacKay, Robert S.; Sepulchre, Jacques-Alexandre

    2002-05-01

    Hamiltonian chains of oscillators in general probably do not sustain exact travelling discrete breathers. However solutions which look like moving discrete breathers for some time are not difficult to observe in numerics. In this paper we propose an abstract framework for the description of approximate travelling discrete breathers in Hamiltonian chains of oscillators. The method is based on the construction of an effective Hamiltonian enabling one to describe the dynamics of the translation degree of freedom of moving breathers. Error estimate on the approximate dynamics is also studied. The concept of the Peierls-Nabarro barrier can be made clear in this framework. We illustrate the method with two simple examples, namely the Salerno model which interpolates between the Ablowitz-Ladik lattice and the discrete nonlinear Schrödinger system, and the Fermi-Pasta-Ulam chain.

  16. Comparing the Discrete and Continuous Logistic Models

    Science.gov (United States)

    Gordon, Sheldon P.

    2008-01-01

    The solutions of the discrete logistic growth model based on a difference equation and the continuous logistic growth model based on a differential equation are compared and contrasted. The investigation is conducted using a dynamic interactive spreadsheet. (Contains 5 figures.)

  17. Discrete-time nonlinear sliding mode controller

    African Journals Online (AJOL)

    user

    Keywords: Discrete-time delay system, Sliding mode control, nonlinear sliding ... of engineering systems such as chemical process control, delay in the actuator ...... instrumentation from Motilal Nehru National Institute of Technology (MNNIT),.

  18. Rich dynamics of discrete delay ecological models

    International Nuclear Information System (INIS)

    Peng Mingshu

    2005-01-01

    We study multiple bifurcations and chaotic behavior of a discrete delay ecological model. New form of chaos for the 2-D map is observed: the combination of potential period doubling and reverse period-doubling leads to cascading bubbles

  19. Discrete and Continuous Models for Partitioning Problems

    KAUST Repository

    Lellmann, Jan; Lellmann, Bjö rn; Widmann, Florian; Schnö rr, Christoph

    2013-01-01

    -based techniques. This work is concerned with the sources of such artifacts. We discuss the importance of differentiating between artifacts caused by discretization and those caused by relaxation and provide supporting numerical examples. Moreover, we consider

  20. Memorized discrete systems and time-delay

    CERN Document Server

    Luo, Albert C J

    2017-01-01

    This book examines discrete dynamical systems with memory—nonlinear systems that exist extensively in biological organisms and financial and economic organizations, and time-delay systems that can be discretized into the memorized, discrete dynamical systems. It book further discusses stability and bifurcations of time-delay dynamical systems that can be investigated through memorized dynamical systems as well as bifurcations of memorized nonlinear dynamical systems, discretization methods of time-delay systems, and periodic motions to chaos in nonlinear time-delay systems. The book helps readers find analytical solutions of MDS, change traditional perturbation analysis in time-delay systems, detect motion complexity and singularity in MDS; and determine stability, bifurcation, and chaos in any time-delay system.

  1. A Channel Allocation Mechanism for Cellular Networks

    Directory of Open Access Journals (Sweden)

    Chi-Hua Chen

    2017-04-01

    Full Text Available In cellular networks, call blocking causes lower customer satisfaction and economic loss. Therefore, the channel allocation for call block avoidance is an important issue. This study proposes a mechanism that considers the real-time traffic information (e.g., traffic flow and vehicle speed and the user behavior (e.g., call inter-arrival time and call holding time to analyze the adaptable number of communication calls in the specific cell for channel allocation. In experiments about call block probabilities (CBP, this study simulated two cases that are the situations of the whole day and traffic accident. The simulation results show that all CBPs in the scenario of whole day are less than 21.5% by using the proposed mechanism, which is better than using the static channel allocation (SCA mechanism. Moreover, all CBPs in the scenario of traffic accidents are less than 16.5% by using the proposed mechanism, which is better than using the SCA mechanism. Therefore, the proposed mechanism can decrease the number of CBPs effectively.

  2. Irrational time allocation in decision-making.

    Science.gov (United States)

    Oud, Bastiaan; Krajbich, Ian; Miller, Kevin; Cheong, Jin Hyun; Botvinick, Matthew; Fehr, Ernst

    2016-01-13

    Time is an extremely valuable resource but little is known about the efficiency of time allocation in decision-making. Empirical evidence suggests that in many ecologically relevant situations, decision difficulty and the relative reward from making a correct choice, compared to an incorrect one, are inversely linked, implying that it is optimal to use relatively less time for difficult choice problems. This applies, in particular, to value-based choices, in which the relative reward from choosing the higher valued item shrinks as the values of the other options get closer to the best option and are thus more difficult to discriminate. Here, we experimentally show that people behave sub-optimally in such contexts. They do not respond to incentives that favour the allocation of time to choice problems in which the relative reward for choosing the best option is high; instead they spend too much time on problems in which the reward difference between the options is low. We demonstrate this by showing that it is possible to improve subjects' time allocation with a simple intervention that cuts them off when their decisions take too long. Thus, we provide a novel form of evidence that organisms systematically spend their valuable time in an inefficient way, and simultaneously offer a potential solution to the problem. © 2016 The Author(s).

  3. Optimal allocation of trend following strategies

    Science.gov (United States)

    Grebenkov, Denis S.; Serror, Jeremy

    2015-09-01

    We consider a portfolio allocation problem for trend following (TF) strategies on multiple correlated assets. Under simplifying assumptions of a Gaussian market and linear TF strategies, we derive analytical formulas for the mean and variance of the portfolio return. We construct then the optimal portfolio that maximizes risk-adjusted return by accounting for inter-asset correlations. The dynamic allocation problem for n assets is shown to be equivalent to the classical static allocation problem for n2 virtual assets that include lead-lag corrections in positions of TF strategies. The respective roles of asset auto-correlations and inter-asset correlations are investigated in depth for the two-asset case and a sector model. In contrast to the principle of diversification suggesting to treat uncorrelated assets, we show that inter-asset correlations allow one to estimate apparent trends more reliably and to adjust the TF positions more efficiently. If properly accounted for, inter-asset correlations are not deteriorative but beneficial for portfolio management that can open new profit opportunities for trend followers. These concepts are illustrated using daily returns of three highly correlated futures markets: the E-mini S&P 500, Euro Stoxx 50 index, and the US 10-year T-note futures.

  4. Biomass Resource Allocation among Competing End Uses

    Energy Technology Data Exchange (ETDEWEB)

    Newes, E.; Bush, B.; Inman, D.; Lin, Y.; Mai, T.; Martinez, A.; Mulcahy, D.; Short, W.; Simpkins, T.; Uriarte, C.; Peck, C.

    2012-05-01

    The Biomass Scenario Model (BSM) is a system dynamics model developed by the U.S. Department of Energy as a tool to better understand the interaction of complex policies and their potential effects on the biofuels industry in the United States. However, it does not currently have the capability to account for allocation of biomass resources among the various end uses, which limits its utilization in analysis of policies that target biomass uses outside the biofuels industry. This report provides a more holistic understanding of the dynamics surrounding the allocation of biomass among uses that include traditional use, wood pellet exports, bio-based products and bioproducts, biopower, and biofuels by (1) highlighting the methods used in existing models' treatments of competition for biomass resources; (2) identifying coverage and gaps in industry data regarding the competing end uses; and (3) exploring options for developing models of biomass allocation that could be integrated with the BSM to actively exchange and incorporate relevant information.

  5. Resource allocation models of auditory working memory.

    Science.gov (United States)

    Joseph, Sabine; Teki, Sundeep; Kumar, Sukhbinder; Husain, Masud; Griffiths, Timothy D

    2016-06-01

    Auditory working memory (WM) is the cognitive faculty that allows us to actively hold and manipulate sounds in mind over short periods of time. We develop here a particular perspective on WM for non-verbal, auditory objects as well as for time based on the consideration of possible parallels to visual WM. In vision, there has been a vigorous debate on whether WM capacity is limited to a fixed number of items or whether it represents a limited resource that can be allocated flexibly across items. Resource allocation models predict that the precision with which an item is represented decreases as a function of total number of items maintained in WM because a limited resource is shared among stored objects. We consider here auditory work on sequentially presented objects of different pitch as well as time intervals from the perspective of dynamic resource allocation. We consider whether the working memory resource might be determined by perceptual features such as pitch or timbre, or bound objects comprising multiple features, and we speculate on brain substrates for these behavioural models. This article is part of a Special Issue entitled SI: Auditory working memory. Copyright © 2016 Elsevier B.V. All rights reserved.

  6. Transnational Energy Companies' Investment Allocation Decisions

    International Nuclear Information System (INIS)

    Osmundsen, Petter; Emhjellen, Magne; Halleraker, Morten

    2001-10-01

    When making international capital budgeting decisions, energy companies are often faced with capital and organisational constraints. The constraints may be real or management imposed. In addition, when entering into a new country or region the companies will incur fixed new area costs that must be considered before investment approval. The decision problem is therefore not a linear problem where the standard net present value rule applies, but a non-linear problem of selecting the combination of projects with the maximum aggregate net present value. New project investments will therefore be selected based on the size of the net present value (often referred to as financial volume or materiality) compared to the projects' use of capital and scarce personnel and organisational capacity. Consequently, projects with a positive net present value, but with low materiality, may not be approved. The portfolio choice has a parallel to the company's choice of core areas. Instead of complex portfolio models, the companies often apply simpler allocation mechanisms, e.g., combinations of fixed investment budgets and materiality requirements. Analysing petroleum cases, we compare the allocations decisions generated by portfolio models and simpler mechanisms. We also discuss the implications of this capital allocation pattern for governments' design of tax systems and license conditions. (author)

  7. Adapting water allocation management to drought scenarios

    Directory of Open Access Journals (Sweden)

    P. Giacomelli

    2008-04-01

    Full Text Available Climate change dynamics have significant consequences on water resources on a watershed scale. With water becoming scarcer and susceptible to variation, the planning and reallocation decisions in watershed management need to be reviewed. This research focuses on an in-depth understanding of the current allocation balance of water resources among competitors, placed along the course of the Adda River. In particular, during the summer period, the demand for water dramatically increases. This is due to the increase in irrigation activities in the lower part of the basin and to the highest peaks of tourist inflow, in the Como Lake and Valtellina areas. Moreover, during these months, the hydroelectric reservoirs in the upper part of the Adda River basin (the Valtellina retain most of the volume of water coming from the snow and glacier melt. The existing allocation problem among these different competing users is exacerbated by the decreasing water supplies. The summer of 2003 testified the rise in a number of allocation problems and situations of water scarcity that brought about environmental and economical consequences. The RICLIC project is committed to the understanding of water dynamics on a regional scale, to quantify the volumes involved and offer local communities an instrument to improve a sustainable water management system, within uncertain climate change scenarios.

  8. Return models and dynamic asset allocation strategies

    OpenAIRE

    Shi, Wyanet Wen

    2017-01-01

    This thesis studies the design of optimal investment strategies. A strategy is considered optimal when it minimizes the variance of terminal portfolio wealth for a given level of expected terminal portfolio wealth, or equivalently, maximizes an investor's utility. We study this issue in two particular situations: when asset returns follow a continuous-time path-independent process, and when they follow a discrete-time path-dependent process. Continuous-time path-independent return mode...

  9. Testing Preference Axioms in Discrete Choice experiments

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth; Østerdal, Lars Peter; Tjur, Tue

    Recent studies have tested the preference axioms of completeness and transitivity, and have detected other preference phenomena such as unstability, learning- and tiredness effects, ordering effects and dominance, in stated preference discrete choice experiments. However, it has not been explicitly...... of the preference axioms and other preference phenomena in the context of stated preference discrete choice experiments, and examine whether or how these can be subject to meaningful (statistical) tests...

  10. Quadratic Term Structure Models in Discrete Time

    OpenAIRE

    Marco Realdon

    2006-01-01

    This paper extends the results on quadratic term structure models in continuos time to the discrete time setting. The continuos time setting can be seen as a special case of the discrete time one. Recursive closed form solutions for zero coupon bonds are provided even in the presence of multiple correlated underlying factors. Pricing bond options requires simple integration. Model parameters may well be time dependent without scuppering such tractability. Model estimation does not require a r...

  11. Symmetries in discrete-time mechanics

    International Nuclear Information System (INIS)

    Khorrami, M.

    1996-01-01

    Based on a general formulation for discrete-time quantum mechanics, introduced by M. Khorrami (Annals Phys. 224 (1995), 101), symmetries in discrete-time quantum mechanics are investigated. It is shown that any classical continuous symmetry leads to a conserved quantity in classical mechanics, as well as quantum mechanics. The transformed wave function, however, has the correct evolution if and only if the symmetry is nonanomalous. Copyright copyright 1996 Academic Press, Inc

  12. Nonlinear integrodifferential equations as discrete systems

    Science.gov (United States)

    Tamizhmani, K. M.; Satsuma, J.; Grammaticos, B.; Ramani, A.

    1999-06-01

    We analyse a class of integrodifferential equations of the `intermediate long wave' (ILW) type. We show that these equations can be formally interpreted as discrete, differential-difference systems. This allows us to link equations of this type with previous results of ours involving differential-delay equations and, on the basis of this, propose new integrable equations of ILW type. Finally, we extend this approach to pure difference equations and propose ILW forms for the discrete lattice KdV equation.

  13. Definable maximal discrete sets in forcing extensions

    DEFF Research Database (Denmark)

    Törnquist, Asger Dag; Schrittesser, David

    2018-01-01

    Let  be a Σ11 binary relation, and recall that a set A is -discrete if no two elements of A are related by . We show that in the Sacks and Miller forcing extensions of L there is a Δ12 maximal -discrete set. We use this to answer in the negative the main question posed in [5] by showing...

  14. Application of multivariate splines to discrete mathematics

    OpenAIRE

    Xu, Zhiqiang

    2005-01-01

    Using methods developed in multivariate splines, we present an explicit formula for discrete truncated powers, which are defined as the number of non-negative integer solutions of linear Diophantine equations. We further use the formula to study some classical problems in discrete mathematics as follows. First, we extend the partition function of integers in number theory. Second, we exploit the relation between the relative volume of convex polytopes and multivariate truncated powers and giv...

  15. Discrete symmetries and solar neutrino mixing

    Energy Technology Data Exchange (ETDEWEB)

    Kapetanakis, D.; Mayr, P.; Nilles, H.P. (Physik Dept., Technische Univ. Muenchen, Garching (Germany) Max-Planck-Inst. fuer Physik, Werner-Heisenberg-Inst., Muenchen (Germany))

    1992-05-21

    We study the question of resonant solar neutrino mixing in the framework of the supersymmetric extension of the standard model. Discrete symmetries that are consistent with solar neutrino mixing and proton stability are classified. In the minimal model they are shown to lead to two distinct patterns of allowed dimension-four operators. Imposing anomaly freedom, only three different discrete Z{sub N}-symmetries (with N=2, 3, 6) are found to be phenomenologically acceptable. (orig.).

  16. Discrete symmetries and solar neutrino mixing

    International Nuclear Information System (INIS)

    Kapetanakis, D.; Mayr, P.; Nilles, H.P.

    1992-01-01

    We study the question of resonant solar neutrino mixing in the framework of the supersymmetric extension of the standard model. Discrete symmetries that are consistent with solar neutrino mixing and proton stability are classified. In the minimal model they are shown to lead to two distinct patterns of allowed dimension-four operators. Imposing anomaly freedom, only three different discrete Z N -symmetries (with N=2, 3, 6) are found to be phenomenologically acceptable. (orig.)

  17. Discrete symmetries and coset space dimensional reduction

    International Nuclear Information System (INIS)

    Kapetanakis, D.; Zoupanos, G.

    1989-01-01

    We consider the discrete symmetries of all the six-dimensional coset spaces and we apply them in gauge theories defined in ten dimensions which are dimensionally reduced over these homogeneous spaces. Particular emphasis is given in the consequences of the discrete symmetries on the particle content as well as on the symmetry breaking a la Hosotani of the resulting four-dimensional theory. (orig.)

  18. On discrete models of space-time

    International Nuclear Information System (INIS)

    Horzela, A.; Kempczynski, J.; Kapuscik, E.; Georgia Univ., Athens, GA; Uzes, Ch.

    1992-02-01

    Analyzing the Einstein radiolocation method we come to the conclusion that results of any measurement of space-time coordinates should be expressed in terms of rational numbers. We show that this property is Lorentz invariant and may be used in the construction of discrete models of space-time different from the models of the lattice type constructed in the process of discretization of continuous models. (author)

  19. Discrete approximations to vector spin models

    Energy Technology Data Exchange (ETDEWEB)

    Van Enter, Aernout C D [University of Groningen, Johann Bernoulli Institute of Mathematics and Computing Science, Postbus 407, 9700 AK Groningen (Netherlands); Kuelske, Christof [Ruhr-Universitaet Bochum, Fakultaet fuer Mathematik, D44801 Bochum (Germany); Opoku, Alex A, E-mail: A.C.D.v.Enter@math.rug.nl, E-mail: Christof.Kuelske@ruhr-uni-bochum.de, E-mail: opoku@math.leidenuniv.nl [Mathematisch Instituut, Universiteit Leiden, Postbus 9512, 2300 RA, Leiden (Netherlands)

    2011-11-25

    We strengthen a result from Kuelske and Opoku (2008 Electron. J. Probab. 13 1307-44) on the existence of effective interactions for discretized continuous-spin models. We also point out that such an interaction cannot exist at very low temperatures. Moreover, we compare two ways of discretizing continuous-spin models, and show that except for very low temperatures, they behave similarly in two dimensions. We also discuss some possibilities in higher dimensions. (paper)

  20. Discrete approximations to vector spin models

    International Nuclear Information System (INIS)

    Van Enter, Aernout C D; Külske, Christof; Opoku, Alex A

    2011-01-01

    We strengthen a result from Külske and Opoku (2008 Electron. J. Probab. 13 1307–44) on the existence of effective interactions for discretized continuous-spin models. We also point out that such an interaction cannot exist at very low temperatures. Moreover, we compare two ways of discretizing continuous-spin models, and show that except for very low temperatures, they behave similarly in two dimensions. We also discuss some possibilities in higher dimensions. (paper)

  1. A study of discrete nonlinear systems

    International Nuclear Information System (INIS)

    Dhillon, H.S.

    2001-04-01

    An investigation of various spatially discrete time-independent nonlinear models was undertaken. These models are generically applicable to many different physical systems including electron-phonon interactions in solids, magnetic multilayers, layered superconductors and classical lattice systems. To characterise the possible magnetic structures created on magnetic multilayers a model has been formulated and studied. The Euler-Lagrange equation for this model is a discrete version of the Sine-Gordon equation. Solutions of this equation are generated by applying the methods of Chaotic Dynamics - treating the space variable associated with the layer number as a discrete time variable. The states found indicate periodic, quasiperiodic and chaotic structures. Analytic solutions to the discrete nonlinear Schroedinger Equation (DNSE) with cubic nonlinearity are presented in the strong coupling limit. Using these as a starting point, a procedure is developed to determine the wave function and the energy eigenvalue for moderate coupling. The energy eigenvalues of the different structures of the wave function are found to be in excellent agreement with the exact strong coupling result. The solutions to the DNSE indicate commensurate and incommensurate spatial structures associated with different localisation patterns of the wave function. The states which arise may be fractal, periodic, quasiperiodic or chaotic. This work is then extended to solve a first order discrete nonlinear equation. The exact solutions for both the first and second order discrete nonlinear equations with cubic nonlinearity suggests that this method of studying discrete nonlinear equations may be applied to solve discrete equations with any order difference and cubic nonlinearity. (author)

  2. Discrete exterior calculus discretization of incompressible Navier–Stokes equations over surface simplicial meshes

    KAUST Repository

    Mohamed, Mamdouh S.

    2016-02-11

    A conservative discretization of incompressible Navier–Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

  3. Discrete exterior calculus discretization of incompressible Navier-Stokes equations over surface simplicial meshes

    Science.gov (United States)

    Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

    2016-05-01

    A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

  4. Explicit solutions to the semi-discrete modified KdV equation and motion of discrete plane curves

    International Nuclear Information System (INIS)

    Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

    2012-01-01

    We construct explicit solutions to continuous motion of discrete plane curves described by a semi-discrete potential modified KdV equation. Explicit formulas in terms of the τ function are presented. Bäcklund transformations of the discrete curves are also discussed. We finally consider the continuous limit of discrete motion of discrete plane curves described by the discrete potential modified KdV equation to motion of smooth plane curves characterized by the potential modified KdV equation. (paper)

  5. Efficient Power Allocation for Video over Superposition Coding

    KAUST Repository

    Lau, Chun Pong; Jamshaid, K.; Shihada, Basem

    2013-01-01

    are conducted to gain a better understanding of its efficiency, specifically, the impact of the received signal due to different power allocation ratios. Our experimental results show that to maintain high video quality, the power allocated to the base layer

  6. Discrete modeling considerations in multiphase fluid dynamics

    International Nuclear Information System (INIS)

    Ransom, V.H.; Ramshaw, J.D.

    1988-01-01

    The modeling of multiphase flows play a fundamental role in light water reactor safety. The main ingredients in our discrete modeling Weltanschauung are the following considerations: (1) Any physical model must be cast into discrete form for a digital computer. (2) The usual approach of formulating models in differential form and then discretizing them is potentially hazardous. It may be preferable to formulate the model in discrete terms from the outset. (3) Computer time and storage constraints limit the resolution that can be employed in practical calculations. These limits effectively define the physical phenomena, length scales, and time scales which cannot be directly represented in the calculation and therefore must be modeled. This information should be injected into the model formulation process at an early stage. (4) Practical resolution limits are generally so coarse that traditional convergence and truncation-error analyses become irrelevant. (5) A discrete model constitutes a reduced description of a physical system, from which fine-scale details are eliminated. This elimination creates a statistical closure problem. Methods from statistical physics may therefore be useful in the formulation of discrete models. In the present paper we elaborate on these themes and illustrate them with simple examples. 48 refs

  7. Theoretical Basics of Teaching Discrete Mathematics

    Directory of Open Access Journals (Sweden)

    Y. A. Perminov

    2012-01-01

    Full Text Available  The paper deals with the research findings concerning the process of mastering the theoretical basics of discrete mathematics by the students of vocational pedagogic profile. The methodological analysis is based on the subject and functions of the modern discrete mathematics and its role in mathematical modeling and computing. The modern discrete mathematics (i.e. mathematics of the finite type structures plays the important role in modernization of vocational training. It is especially rele- vant to training students for vocational pedagogic qualifications, as in the future they will be responsible for training the middle and the senior level specialists in engineer- ing and technical spheres. Nowadays in different industries, there arise the problems which require for their solving both continual – based on the classical mathematical methods – and discrete modeling. The teaching course of discrete mathematics for the future vocational teachers should be relevant to the target qualification and aimed at mastering the mathematical modeling, systems of computer mathematics and computer technologies. The author emphasizes the fundamental role of mastering the language of algebraic and serial structures, as well as the logical, algorithmic, combinatory schemes dominating in dis- crete mathematics. The guidelines for selecting the content of the course in discrete mathematics are specified. The theoretical findings of the research can be put into practice whilst developing curricula and working programs for bachelors and masters’ training. 

  8. Current density and continuity in discretized models

    International Nuclear Information System (INIS)

    Boykin, Timothy B; Luisier, Mathieu; Klimeck, Gerhard

    2010-01-01

    Discrete approaches have long been used in numerical modelling of physical systems in both research and teaching. Discrete versions of the Schroedinger equation employing either one or several basis functions per mesh point are often used by senior undergraduates and beginning graduate students in computational physics projects. In studying discrete models, students can encounter conceptual difficulties with the representation of the current and its divergence because different finite-difference expressions, all of which reduce to the current density in the continuous limit, measure different physical quantities. Understanding these different discrete currents is essential and requires a careful analysis of the current operator, the divergence of the current and the continuity equation. Here we develop point forms of the current and its divergence valid for an arbitrary mesh and basis. We show that in discrete models currents exist only along lines joining atomic sites (or mesh points). Using these results, we derive a discrete analogue of the divergence theorem and demonstrate probability conservation in a purely localized-basis approach.

  9. Discrete Calculus as a Bridge between Scales

    Science.gov (United States)

    Degiuli, Eric; McElwaine, Jim

    2012-02-01

    Understanding how continuum descriptions of disordered media emerge from the microscopic scale is a fundamental challenge in condensed matter physics. In many systems, it is necessary to coarse-grain balance equations at the microscopic scale to obtain macroscopic equations. We report development of an exact, discrete calculus, which allows identification of discrete microscopic equations with their continuum equivalent [1]. This allows the application of powerful techniques of calculus, such as the Helmholtz decomposition, the Divergence Theorem, and Stokes' Theorem. We illustrate our results with granular materials. In particular, we show how Newton's laws for a single grain reproduce their continuum equivalent in the calculus. This allows introduction of a discrete Airy stress function, exactly as in the continuum. As an application of the formalism, we show how these results give the natural mean-field variation of discrete quantities, in agreement with numerical simulations. The discrete calculus thus acts as a bridge between discrete microscale quantities and continuous macroscale quantities. [4pt] [1] E. DeGiuli & J. McElwaine, PRE 2011. doi: 10.1103/PhysRevE.84.041310

  10. Recent developments in discrete ordinates electron transport

    International Nuclear Information System (INIS)

    Morel, J.E.; Lorence, L.J. Jr.

    1986-01-01

    The discrete ordinates method is a deterministic method for numerically solving the Boltzmann equation. It was originally developed for neutron transport calculations, but is routinely used for photon and coupled neutron-photon transport calculations as well. The computational state of the art for coupled electron-photon transport (CEPT) calculations is not as developed as that for neutron transport calculations. The only production codes currently available for CEPT calculations are condensed-history Monte Carlo codes such as the ETRAN and ITS codes. A deterministic capability for production calculations is clearly needed. In response to this need, we have begun the development of a production discrete ordinates code for CEPT calculations. The purpose of this paper is to describe the basic approach we are taking, discuss the current status of the project, and present some new computational results. Although further characterization of the coupled electron-photon discrete ordinates method remains to be done, the results to date indicate that the discrete ordinates method can be just as accurate and from 10 to 100 times faster than the Monte Carlo method for a wide variety of problems. We stress that these results are obtained with standard discrete ordinates codes such as ONETRAN. It is clear that even greater efficiency can be obtained by developing a new generation of production discrete ordinates codes specifically designed to solve the Boltzmann-Fokker-Planck equation. However, the prospects for such development in the near future appear to be remote

  11. Discrete symmetries and their stringy origin

    International Nuclear Information System (INIS)

    Mayorga Pena, Damian Kaloni

    2014-05-01

    Discrete symmetries have proven to be very useful in controlling the phenomenology of theories beyond the standard model. In this work we explore how these symmetries emerge from string compactifications. Our approach is twofold: On the one hand, we consider the heterotic string on orbifold backgrounds. In this case the discrete symmetries can be derived from the orbifold conformal field theory, and it can be shown that they are in close relation with the orbifold geometry. We devote special attention to R-symmetries, which arise from discrete remnants of the Lorentz group in compact space. Further we discuss the physical implications of these symmetries both in the heterotic mini-landscape and in newly constructed models based on the Z 2 x Z 4 orbifold. In both cases we observe that the discrete symmetries favor particular locations in the orbifold where the particles of standard model should live. On the other hand we consider a class of F-theory models exhibiting an SU(5) gauge group, times additional U(1) symmetries. In this case, the smooth compactification background does not permit us to track the discrete symmetries as transparently as in orbifold models. Hence, we follow a different approach and search for discrete subgroups emerging after the U(1)s are broken. We observe that in this approach it is possible to obtain the standard Z 2 matter parity of the MSSM.

  12. Dynamic Asset Allocation and the Informational Efficiency of Markets.

    OpenAIRE

    Grossman, Sanford J

    1995-01-01

    Markets have an allocational role; even in the absence of news about payoffs, prices change to facilitate trade and allocate resources to their best use. Allocational price changes create noise in the signal extraction process, and markets where such trading is important are markets in which we may expect to find a failure of informational efficiency. An important source of allocational trading is the use of dynamic trading strategies caused by the incomplete equitization of risks. Incomplete...

  13. Constrained control allocation for systems with redundant control effectors

    OpenAIRE

    Bordignon, Kenneth A

    1996-01-01

    Control allocation is examined for linear time-invariant problems that have more controls than degrees of freedom. The controls are part of a physical system and are subject to limits on their maximum positions. A control allocation scheme commands control deflections in response to some desired output. The ability of a control allocation scheme to produce the desired output without violating the physical position constraints is used to compare allocation schemes. Methods are develop...

  14. Fundamental-driven and Tactical Asset Allocation: what really matters?

    OpenAIRE

    Hartpence, Maria; Boulier, Jean-François

    2004-01-01

    Asset allocation contribution to ex-post performance is of primary importance. Nobody denies its role, yet the subject of allocating assets remains controversial. To some contenders, the added value stems only from strategic asset allocation which aims at providing the long-term average exposure to the selected asset classes. On the other hand, proponents of active management have introduced several forms of tactical asset allocation. In this paper, we will go a step further by distinguishing...

  15. Discrete integrable systems and deformations of associative algebras

    International Nuclear Information System (INIS)

    Konopelchenko, B G

    2009-01-01

    Interrelations between discrete deformations of the structure constants for associative algebras and discrete integrable systems are reviewed. Theory of deformations for associative algebras is presented. Closed left ideal generated by the elements representing the multiplication table plays a central role in this theory. Deformations of the structure constants are generated by the deformation driving algebra and governed by the central system of equations. It is demonstrated that many discrete equations such as discrete Boussinesq equation, discrete WDVV equation, discrete Schwarzian KP and BKP equations, discrete Hirota-Miwa equations for KP and BKP hierarchies are particular realizations of the central system. An interaction between the theories of discrete integrable systems and discrete deformations of associative algebras is reciprocal and fruitful. An interpretation of the Menelaus relation (discrete Schwarzian KP equation), discrete Hirota-Miwa equation for KP hierarchy, consistency around the cube as the associativity conditions and the concept of gauge equivalence, for instance, between the Menelaus and KP configurations are particular examples.

  16. Darboux and binary Darboux transformations for discrete integrable systems I. Discrete potential KdV equation

    International Nuclear Information System (INIS)

    Shi, Ying; Zhang, Da-jun; Nimmo, Jonathan J C

    2014-01-01

    The Hirota–Miwa equation can be written in ‘nonlinear’ form in two ways: the discrete KP equation and, by using a compatible continuous variable, the discrete potential KP equation. For both systems, we consider the Darboux and binary Darboux transformations, expressed in terms of the continuous variable, and obtain exact solutions in Wronskian and Grammian form. We discuss reductions of both systems to the discrete KdV and discrete potential KdV equation, respectively, and exploit this connection to find the Darboux and binary Darboux transformations and exact solutions of these equations. (paper)

  17. Matching today's allocation of LDC expenses with cost causation

    International Nuclear Information System (INIS)

    Yankel, A.J.

    1990-01-01

    This article discusses the costs of natural gas distribution and how to integrate these costs into the allocation of local distribution companies expenses for the purpose of establishing rate structures. The author's contention is that costs related to throughput are a larger share than historically used allocation factors suggest. Topics include the historical allocation factors, a case study and the conclusions drawn from it

  18. Resource Allocation for A Mobile Application Oriented Architecture

    NARCIS (Netherlands)

    Guo, Y.; Smit, Gerardus Johannes Maria; Lu, W.W.; Xie, X.

    2005-01-01

    A Montium is a coarse-grained reconfigurable architecture designed by the CADTES group of the University of Twente for mobile applications. This paper presents a resource allocation method to allocate variables to storage places and to schedule data movements for the Montium. The resource allocation

  19. Reward-allocation judgments in Romania : A factorial survey approach

    NARCIS (Netherlands)

    Buzea, C.; Meseşan-Schmitz, L.; van de Vijver, F.J.R.

    2013-01-01

    We investigated reward-allocation judgments when positive outcomes (monetary rewards) were distributed and the allocator was not a co-recipient, in a sample of 200 Romanian students. Within a full factorial survey design, seven factors, selected to affect the allocation decision, were orthogonally

  20. Risk allocation approach to reactor safety design and evaluation

    International Nuclear Information System (INIS)

    Gokcek, O.; Temme, M.I.; Derby, S.L.

    1978-01-01

    This paper describes a risk allocation technique used for determining nuclear power plant design reliability requirements. The concept of risk allocation-optimum choice of safety function reliabilities under a maximum risk constraint - is described. An example of risk allocation is presented to demonstrate the application of the methodology

  1. 30 CFR 206.459 - Allocation of washed coal.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Allocation of washed coal. 206.459 Section 206... MANAGEMENT PRODUCT VALUATION Indian Coal § 206.459 Allocation of washed coal. (a) When coal is subjected to washing, the washed coal must be allocated to the leases from which it was extracted. (b) When the net...

  2. 30 CFR 206.260 - Allocation of washed coal.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Allocation of washed coal. 206.260 Section 206... MANAGEMENT PRODUCT VALUATION Federal Coal § 206.260 Allocation of washed coal. (a) When coal is subjected to washing, the washed coal must be allocated to the leases from which it was extracted. (b) When the net...

  3. Pollution permits allocation and imperfect competition; Allocation de permis de pollution et concurrence imparfaite

    Energy Technology Data Exchange (ETDEWEB)

    Schwartz, S.

    2004-12-15

    The aim of this thesis is to highlight the imperfections on the permits markets and to analyze their consequences on markets' efficiency. More precisely, we try to identify the implications of the initial allocation of permits when such imperfections are present. We try to draw some conclusions for the regulator concerning the different forms of the permits' allocation. After having described and compared these forms, we define in which circumstances the initial allocation matters in terms of efficiency. Then, we study different forms of imperfections. First, we take into account the information asymmetry between firms and the regulator and we define an optimal mechanism to sell pollution permits. Then, we analyze a market power on a differentiated pollution permits market. At last, we study the exclusionary manipulation of pollution permits market. (author)

  4. Cognitive radio resource allocation based on coupled chaotic genetic algorithm

    International Nuclear Information System (INIS)

    Zu Yun-Xiao; Zhou Jie; Zeng Chang-Chang

    2010-01-01

    A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed

  5. Prey risk allocation in a grazing ecosystem.

    Science.gov (United States)

    Gude, Justin A; Garrott, Robert A; Borkowski, John J; King, Fred

    2006-02-01

    Understanding the behaviorally mediated indirect effects of predators in ecosystems requires knowledge of predator-prey behavioral interactions. In predator-ungulate-plant systems, empirical research quantifying how predators affect ungulate group sizes and distribution, in the context of other influential variables, is particularly needed. The risk allocation hypothesis proposes that prey behavioral responses to predation risk depend on background frequencies of exposure to risk, and it can be used to make predictions about predator-ungulate-plant interactions. We determined non-predation variables that affect elk (Cervus elaphus) group sizes and distribution on a winter range in the Greater Yellowstone Ecosystem (GYE) using logistic and log-linear regression on surveys of 513 1-km2 areas conducted over two years. Employing model selection techniques, we evaluated risk allocation and other a priori hypotheses of elk group size and distributional responses to wolf (Canis lupus) predation risk while accounting for influential non-wolf-predation variables. We found little evidence that wolves affect elk group sizes, which were strongly influenced by habitat type and hunting by humans. Following predictions from the risk allocation hypothesis, wolves likely created a more dynamic elk distribution in areas that they frequently hunted, as elk tended to move following wolf encounters in those areas. This response should dilute elk foraging pressure on plant communities in areas where they are frequently hunted by wolves. We predict that this should decrease the spatial heterogeneity of elk impacts on grasslands in areas that wolves frequently hunt. We also predict that this should decrease browsing pressure on heavily browsed woody plant stands in certain areas, which is supported by recent research in the GYE.

  6. Convergence of posteriors for discretized log Gaussian Cox processes

    DEFF Research Database (Denmark)

    Waagepetersen, Rasmus Plenge

    2004-01-01

    In Markov chain Monte Carlo posterior computation for log Gaussian Cox processes (LGCPs) a discretization of the continuously indexed Gaussian field is required. It is demonstrated that approximate posterior expectations computed from discretized LGCPs converge to the exact posterior expectations...... when the cell sizes of the discretization tends to zero. The effect of discretization is studied in a data example....

  7. Optimal load allocation of multiple fuel boilers.

    Science.gov (United States)

    Dunn, Alex C; Du, Yan Yi

    2009-04-01

    This paper presents a new methodology for optimally allocating a set of multiple industrial boilers that each simultaneously consumes multiple fuel types. Unlike recent similar approaches in the utility industry that use soft computing techniques, this approach is based on a second-order gradient search method that is easy to implement without any specialized optimization software. The algorithm converges rapidly and the application yields significant savings benefits, up to 3% of the overall operating cost of industrial boiler systems in the examples given and potentially higher in other cases, depending on the plant circumstances. Given today's energy prices, this can yield significant savings benefits to manufacturers that raise steam for plant operations.

  8. A unified transmission loss allocation method

    International Nuclear Information System (INIS)

    Ding, Qifeng; Abur, Ali

    2007-01-01

    A new unified method which allocates transmission losses either to buses in a pool market or to individual transactions in a bilateral contract market is presented in this paper. A detailed derivation of the method is given. A bus-loss matrix and a transaction-loss matrix are developed to show the interactions between bus injections and transactions. It is further demonstrated that the ''Physical-power-flow-based'' method can be obtained as an approximation of this unified approach under certain simplifying assumptions. Test systems are used to illustrate how the proposed method behaves under different possible scenarios. (author)

  9. Radio resource allocation and dynamic spectrum access

    CERN Document Server

    Benmammar , Badr

    2013-01-01

    We are currently witnessing an increase in telecommunications norms and standards given the recent advances in this field. The increasing number of normalized standards paves the way for an increase in the range of services available for each consumer. Moreover, the majority of available radio frequencies have already been allocated. This explains the emergence of cognitive radio (CR) - the sharing of the spectrum between a primary user and a secondary user.In this book, we will present the state of the art of the different techniques for spectrum access using cooperation and competit

  10. Asset allocation using option-implied moments

    Science.gov (United States)

    Bahaludin, H.; Abdullah, M. H.; Tolos, S. M.

    2017-09-01

    This study uses an option-implied distribution as the input in asset allocation. The computation of risk-neutral densities (RND) are based on the Dow Jones Industrial Average (DJIA) index option and its constituents. Since the RNDs estimation does not incorporate risk premium, the conversion of RND into risk-world density (RWD) is required. The RWD is obtained through parametric calibration using the beta distributions. The mean, volatility, and covariance are then calculated to construct the portfolio. The performance of the portfolio is evaluated by using portfolio volatility and Sharpe ratio.

  11. Reliability allocation in nuclear power plants

    International Nuclear Information System (INIS)

    Bari, R.A.; Cho, N.Z.; Papazoglou, I.A.

    1985-01-01

    The technical feasibility of allocating reliability and risk to reactor systems, subsystems, components, operations, and structures is investigated. A methodology is discussed which identifies top level risk indices as objective functions and plant-specific performance variables as decision variables. These are related by a risk model which includes cost as a top level risk index. A multiobjective optimization procedure is used to find non-inferior solutions in terms of the objective functions and the decision variables. The approach is illustrated for a boiling water reactor plant. The use of the methodology for both operating reactors and for advanced designs is briefly discussed. 16 refs., 1 fig

  12. Tactical Asset Allocation mit Genetischen Algorithmen

    OpenAIRE

    Manuel Ammann; Christian Zenkner

    2003-01-01

    In this study of tactical asset allocation, we use a genetic algorithm to implement a market timing strategy. The algorithm makes a daily decision whether to invest in the market index or in a riskless asset. The market index is represented by the S&P500 Composite Index, the riskless asset by a 3-month T-Bill. The decision of the genetic algorithm is based on fundamental macroeconomic variables. The association of fundamental variables with a set of operators creates a space of possible strat...

  13. Discrete Feature Model (DFM) User Documentation

    International Nuclear Information System (INIS)

    Geier, Joel

    2008-06-01

    This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this software, the

  14. Discrete Feature Model (DFM) User Documentation

    Energy Technology Data Exchange (ETDEWEB)

    Geier, Joel (Clearwater Hardrock Consulting, Corvallis, OR (United States))

    2008-06-15

    This manual describes the Discrete-Feature Model (DFM) software package for modelling groundwater flow and solute transport in networks of discrete features. A discrete-feature conceptual model represents fractures and other water-conducting features around a repository as discrete conductors surrounded by a rock matrix which is usually treated as impermeable. This approximation may be valid for crystalline rocks such as granite or basalt, which have very low permeability if macroscopic fractures are excluded. A discrete feature is any entity that can conduct water and permit solute transport through bedrock, and can be reasonably represented as a piecewise-planar conductor. Examples of such entities may include individual natural fractures (joints or faults), fracture zones, and disturbed-zone features around tunnels (e.g. blasting-induced fractures or stress-concentration induced 'onion skin' fractures around underground openings). In a more abstract sense, the effectively discontinuous nature of pathways through fractured crystalline bedrock may be idealized as discrete, equivalent transmissive features that reproduce large-scale observations, even if the details of connective paths (and unconnected domains) are not precisely known. A discrete-feature model explicitly represents the fundamentally discontinuous and irregularly connected nature of systems of such systems, by constraining flow and transport to occur only within such features and their intersections. Pathways for flow and solute transport in this conceptualization are a consequence not just of the boundary conditions and hydrologic properties (as with continuum models), but also the irregularity of connections between conductive/transmissive features. The DFM software package described here is an extensible code for investigating problems of flow and transport in geological (natural or human-altered) systems that can be characterized effectively in terms of discrete features. With this

  15. Discrete stochastic analogs of Erlang epidemic models.

    Science.gov (United States)

    Getz, Wayne M; Dougherty, Eric R

    2018-12-01

    Erlang differential equation models of epidemic processes provide more realistic disease-class transition dynamics from susceptible (S) to exposed (E) to infectious (I) and removed (R) categories than the ubiquitous SEIR model. The latter is itself is at one end of the spectrum of Erlang SE[Formula: see text]I[Formula: see text]R models with [Formula: see text] concatenated E compartments and [Formula: see text] concatenated I compartments. Discrete-time models, however, are computationally much simpler to simulate and fit to epidemic outbreak data than continuous-time differential equations, and are also much more readily extended to include demographic and other types of stochasticity. Here we formulate discrete-time deterministic analogs of the Erlang models, and their stochastic extension, based on a time-to-go distributional principle. Depending on which distributions are used (e.g. discretized Erlang, Gamma, Beta, or Uniform distributions), we demonstrate that our formulation represents both a discretization of Erlang epidemic models and generalizations thereof. We consider the challenges of fitting SE[Formula: see text]I[Formula: see text]R models and our discrete-time analog to data (the recent outbreak of Ebola in Liberia). We demonstrate that the latter performs much better than the former; although confining fits to strict SEIR formulations reduces the numerical challenges, but sacrifices best-fit likelihood scores by at least 7%.

  16. Positivity for Convective Semi-discretizations

    KAUST Repository

    Fekete, Imre

    2017-04-19

    We propose a technique for investigating stability properties like positivity and forward invariance of an interval for method-of-lines discretizations, and apply the technique to study positivity preservation for a class of TVD semi-discretizations of 1D scalar hyperbolic conservation laws. This technique is a generalization of the approach suggested in Khalsaraei (J Comput Appl Math 235(1): 137–143, 2010). We give more relaxed conditions on the time-step for positivity preservation for slope-limited semi-discretizations integrated in time with explicit Runge–Kutta methods. We show that the step-size restrictions derived are sharp in a certain sense, and that many higher-order explicit Runge–Kutta methods, including the classical 4th-order method and all non-confluent methods with a negative Butcher coefficient, cannot generally maintain positivity for these semi-discretizations under any positive step size. We also apply the proposed technique to centered finite difference discretizations of scalar hyperbolic and parabolic problems.

  17. Noether symmetries of discrete mechanico–electrical systems

    International Nuclear Information System (INIS)

    Fu Jingli; Xie Fengping; Chen Benyong

    2008-01-01

    This paper focuses on studying Noether symmetries and conservation laws of the discrete mechanico-electrical systems with the nonconservative and the dissipative forces. Based on the invariance of discrete Hamilton action of the systems under the infinitesimal transformation with respect to the generalized coordinates, the generalized electrical quantities and time, it presents the discrete analogue of variational principle, the discrete analogue of Lagrange–Maxwell equations, the discrete analogue of Noether theorems for Lagrange–Maxwell and Lagrange mechanico-electrical systems. Also, the discrete Noether operator identity and the discrete Noether-type conservation laws are obtained for these systems. An actual example is given to illustrate these results. (general)

  18. Discrete breathers for a discrete nonlinear Schrödinger ring coupled to a central site.

    Science.gov (United States)

    Jason, Peter; Johansson, Magnus

    2016-01-01

    We examine the existence and properties of certain discrete breathers for a discrete nonlinear Schrödinger model where all but one site are placed in a ring and coupled to the additional central site. The discrete breathers we focus on are stationary solutions mainly localized on one or a few of the ring sites and possibly also the central site. By numerical methods, we trace out and study the continuous families the discrete breathers belong to. Our main result is the discovery of a split bifurcation at a critical value of the coupling between neighboring ring sites. Below this critical value, families form closed loops in a certain parameter space, implying that discrete breathers with and without central-site occupation belong to the same family. Above the split bifurcation the families split up into several separate ones, which bifurcate with solutions with constant ring amplitudes. For symmetry reasons, the families have different properties below the split bifurcation for even and odd numbers of sites. It is also determined under which conditions the discrete breathers are linearly stable. The dynamics of some simpler initial conditions that approximate the discrete breathers are also studied and the parameter regimes where the dynamics remain localized close to the initially excited ring site are related to the linear stability of the exact discrete breathers.

  19. Discrete Localized States and Localization Dynamics in Discrete Nonlinear Schrödinger Equations

    DEFF Research Database (Denmark)

    Christiansen, Peter Leth; Gaididei, Yu.B.; Mezentsev, V.K.

    1996-01-01

    Dynamics of two-dimensional discrete structures is studied in the framework of the generalized two-dimensional discrete nonlinear Schrodinger equation. The nonlinear coupling in the form of the Ablowitz-Ladik nonlinearity is taken into account. Stability properties of the stationary solutions...

  20. Discrete Mathematics in the Schools. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 36.

    Science.gov (United States)

    Rosenstein, Joseph G., Ed.; Franzblau, Deborah S., Ed.; Roberts, Fred S., Ed.

    This book is a collection of articles by experienced educators and explains why and how discrete mathematics should be taught in K-12 classrooms. It includes evidence for "why" and practical guidance for "how" and also discusses how discrete mathematics can be used as a vehicle for achieving the broader goals of the major…

  1. Limit sets for the discrete spectrum of complex Jacobi matrices

    International Nuclear Information System (INIS)

    Golinskii, L B; Egorova, I E

    2005-01-01

    The discrete spectrum of complex Jacobi matrices that are compact perturbations of the discrete Laplacian is studied. The precise stabilization rate (in the sense of order) of the matrix elements ensuring the finiteness of the discrete spectrum is found. An example of a Jacobi matrix with discrete spectrum having a unique limit point is constructed. These results are discrete analogues of Pavlov's well-known results on Schroedinger operators with complex potential on a half-axis.

  2. Euler-Poincare reduction for discrete field theories

    International Nuclear Information System (INIS)

    Vankerschaver, Joris

    2007-01-01

    In this note, we develop a theory of Euler-Poincare reduction for discrete Lagrangian field theories. We introduce the concept of Euler-Poincare equations for discrete field theories, as well as a natural extension of the Moser-Veselov scheme, and show that both are equivalent. The resulting discrete field equations are interpreted in terms of discrete differential geometry. An application to the theory of discrete harmonic mappings is also briefly discussed

  3. Integrals of Motion for Discrete-Time Optimal Control Problems

    OpenAIRE

    Torres, Delfim F. M.

    2003-01-01

    We obtain a discrete time analog of E. Noether's theorem in Optimal Control, asserting that integrals of motion associated to the discrete time Pontryagin Maximum Principle can be computed from the quasi-invariance properties of the discrete time Lagrangian and discrete time control system. As corollaries, results for first-order and higher-order discrete problems of the calculus of variations are obtained.

  4. Resource Allocation for OFDMA-Based Cognitive Radio Networks with Application to H.264 Scalable Video Transmission

    Directory of Open Access Journals (Sweden)

    Coon JustinP

    2011-01-01

    Full Text Available Resource allocation schemes for orthogonal frequency division multiple access- (OFDMA- based cognitive radio (CR networks that impose minimum and maximum rate constraints are considered. To demonstrate the practical application of such systems, we consider the transmission of scalable video sequences. An integer programming (IP formulation of the problem is presented, which provides the optimal solution when solved using common discrete programming methods. Due to the computational complexity involved in such an approach and its unsuitability for dynamic cognitive radio environments, we propose to use the method of lift-and-project to obtain a stronger formulation for the resource allocation problem such that the integrality gap between the integer program and its linear relaxation is reduced. A simple branching operation is then performed that eliminates any noninteger values at the output of the linear program solvers. Simulation results demonstrate that this simple technique results in solutions very close to the optimum.

  5. The ultimatum game: Discrete vs. continuous offers

    Science.gov (United States)

    Dishon-Berkovits, Miriam; Berkovits, Richard

    2014-09-01

    In many experimental setups in social-sciences, psychology and economy the subjects are requested to accept or dispense monetary compensation which is usually given in discrete units. Using computer and mathematical modeling we show that in the framework of studying the dynamics of acceptance of proposals in the ultimatum game, the long time dynamics of acceptance of offers in the game are completely different for discrete vs. continuous offers. For discrete values the dynamics follow an exponential behavior. However, for continuous offers the dynamics are described by a power-law. This is shown using an agent based computer simulation as well as by utilizing an analytical solution of a mean-field equation describing the model. These findings have implications to the design and interpretation of socio-economical experiments beyond the ultimatum game.

  6. Symmetric, discrete fractional splines and Gabor systems

    DEFF Research Database (Denmark)

    Søndergaard, Peter Lempel

    2006-01-01

    In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing the continu......In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing...... the continuous splines, and one is a truly finite, discrete construction. We discuss the properties of these splines and their usefulness as windows for Gabor frames and Wilson bases....

  7. Sputtering calculations with the discrete ordinated method

    International Nuclear Information System (INIS)

    Hoffman, T.J.; Dodds, H.L. Jr.; Robinson, M.T.; Holmes, D.K.

    1977-01-01

    The purpose of this work is to investigate the applicability of the discrete ordinates (S/sub N/) method to light ion sputtering problems. In particular, the neutral particle discrete ordinates computer code, ANISN, was used to calculate sputtering yields. No modifications to this code were necessary to treat charged particle transport. However, a cross section processing code was written for the generation of multigroup cross sections; these cross sections include a modification to the total macroscopic cross section to account for electronic interactions and small-scattering-angle elastic interactions. The discrete ordinates approach enables calculation of the sputtering yield as functions of incident energy and angle and of many related quantities such as ion reflection coefficients, angular and energy distributions of sputtering particles, the behavior of beams penetrating thin foils, etc. The results of several sputtering problems as calculated with ANISN are presented

  8. Modeling discrete time-to-event data

    CERN Document Server

    Tutz, Gerhard

    2016-01-01

    This book focuses on statistical methods for the analysis of discrete failure times. Failure time analysis is one of the most important fields in statistical research, with applications affecting a wide range of disciplines, in particular, demography, econometrics, epidemiology and clinical research. Although there are a large variety of statistical methods for failure time analysis, many techniques are designed for failure times that are measured on a continuous scale. In empirical studies, however, failure times are often discrete, either because they have been measured in intervals (e.g., quarterly or yearly) or because they have been rounded or grouped. The book covers well-established methods like life-table analysis and discrete hazard regression models, but also introduces state-of-the art techniques for model evaluation, nonparametric estimation and variable selection. Throughout, the methods are illustrated by real life applications, and relationships to survival analysis in continuous time are expla...

  9. Direct Discrete Method for Neutronic Calculations

    International Nuclear Information System (INIS)

    Vosoughi, Naser; Akbar Salehi, Ali; Shahriari, Majid

    2002-01-01

    The objective of this paper is to introduce a new direct method for neutronic calculations. This method which is named Direct Discrete Method, is simpler than the neutron Transport equation and also more compatible with physical meaning of problems. This method is based on physic of problem and with meshing of the desired geometry, writing the balance equation for each mesh intervals and with notice to the conjunction between these mesh intervals, produce the final discrete equations series without production of neutron transport differential equation and mandatory passing from differential equation bridge. We have produced neutron discrete equations for a cylindrical shape with two boundary conditions in one group energy. The correction of the results from this method are tested with MCNP-4B code execution. (authors)

  10. An algebra of discrete event processes

    Science.gov (United States)

    Heymann, Michael; Meyer, George

    1991-01-01

    This report deals with an algebraic framework for modeling and control of discrete event processes. The report consists of two parts. The first part is introductory, and consists of a tutorial survey of the theory of concurrency in the spirit of Hoare's CSP, and an examination of the suitability of such an algebraic framework for dealing with various aspects of discrete event control. To this end a new concurrency operator is introduced and it is shown how the resulting framework can be applied. It is further shown that a suitable theory that deals with the new concurrency operator must be developed. In the second part of the report the formal algebra of discrete event control is developed. At the present time the second part of the report is still an incomplete and occasionally tentative working paper.

  11. Is Fitts' law continuous in discrete aiming?

    Directory of Open Access Journals (Sweden)

    Rita Sleimen-Malkoun

    Full Text Available The lawful continuous linear relation between movement time and task difficulty (i.e., index of difficulty; ID in a goal-directed rapid aiming task (Fitts' law has been recently challenged in reciprocal performance. Specifically, a discontinuity was observed at critical ID and was attributed to a transition between two distinct dynamic regimes that occurs with increasing difficulty. In the present paper, we show that such a discontinuity is also present in discrete aiming when ID is manipulated via target width (experiment 1 but not via target distance (experiment 2. Fitts' law's discontinuity appears, therefore, to be a suitable indicator of the underlying functional adaptations of the neuro-muscular-skeletal system to task properties/requirements, independently of reciprocal or discrete nature of the task. These findings open new perspectives to the study of dynamic regimes involved in discrete aiming and sensori-motor mechanisms underlying the speed-accuracy trade-off.

  12. Acceleration techniques for the discrete ordinate method

    International Nuclear Information System (INIS)

    Efremenko, Dmitry; Doicu, Adrian; Loyola, Diego; Trautmann, Thomas

    2013-01-01

    In this paper we analyze several acceleration techniques for the discrete ordinate method with matrix exponential and the small-angle modification of the radiative transfer equation. These techniques include the left eigenvectors matrix approach for computing the inverse of the right eigenvectors matrix, the telescoping technique, and the method of false discrete ordinate. The numerical simulations have shown that on average, the relative speedup of the left eigenvector matrix approach and the telescoping technique are of about 15% and 30%, respectively. -- Highlights: ► We presented the left eigenvector matrix approach. ► We analyzed the method of false discrete ordinate. ► The telescoping technique is applied for matrix operator method. ► Considered techniques accelerate the computations by 20% in average.

  13. Resource allocation to reproduction in animals.

    Science.gov (United States)

    Kooijman, Sebastiaan A L M; Lika, Konstadia

    2014-11-01

    The standard Dynamic Energy Budget (DEB) model assumes that a fraction κ of mobilised reserve is allocated to somatic maintenance plus growth, while the rest is allocated to maturity maintenance plus maturation (in embryos and juveniles) or reproduction (in adults). All DEB parameters have been estimated for 276 animal species from most large phyla and all chordate classes. The goodness of fit is generally excellent. We compared the estimated values of κ with those that would maximise reproduction in fully grown adults with abundant food. Only 13% of these species show a reproduction rate close to the maximum possible (assuming that κ can be controlled), another 4% have κ lower than the optimal value, and 83% have κ higher than the optimal value. Strong empirical support hence exists for the conclusion that reproduction is generally not maximised. We also compared the parameters of the wild chicken with those of races selected for meat and egg production and found that the latter indeed maximise reproduction in terms of κ, while surface-specific assimilation was not affected by selection. We suggest that small values of κ relate to the down-regulation of maximum body size, and large values to the down-regulation of reproduction. We briefly discuss the ecological context for these findings. © 2014 The Authors. Biological Reviews © 2014 Cambridge Philosophical Society.

  14. The symbiotic lifestyle and its evolutionary consequences: social monogamy and sex allocation in the hermaphroditic shrimp Lysmata pederseni

    Science.gov (United States)

    Baeza, J. Antonio

    2010-08-01

    Sex allocation theory predicts female-biased sex allocation for simultaneous hermaphrodites with a monogamous mating system. Mating systems theory predicts that monogamy is advantageous in environments where refuges are discrete, scarce, relatively small, and when predation risk is high outside of these refuges. These predictions were tested with the Caribbean shrimp Lysmata pederseni, a simultaneous hermaphrodite which has an early male phase and lives inside tubes of the sponge Callyspongia vaginalis. This host sponge is a scarce resource that, together with the high predation risk typical of tropical environments, should favor monogamy in the shrimp. Field observations demonstrated that shrimps were frequently encountered as pairs within these tube sponges. Pairs were equally likely to comprise two hermaphrodites or one hermaphrodite and one male. Several of these pairs were observed for long periods of time in the field. Experiments demonstrated that hermaphrodites tolerated other hermaphrodites but not males in their host sponge. These results suggest that pairs of hermaphroditic L. pederseni are socially monogamous; they share the same host individual and might reproduce exclusively with their host partners for long periods of time. Nevertheless, males appeared less likely to establish long-term associations with hermaphrodites as indicated by the rate of their disappearance from their hosts (greater than that of hermaphrodites). Sex allocation was female biased in monogamous hermaphrodites. On average, hermaphrodites invested 34 times more to female than to male reproductive structures. Monogamy and female-biased sex allocation seem to be evolutionary consequences of adopting a symbiotic lifestyle in simultaneous hermaphrodites.

  15. Discrete quantum geometries and their effective dimension

    International Nuclear Information System (INIS)

    Thuerigen, Johannes

    2015-01-01

    In several approaches towards a quantum theory of gravity, such as group field theory and loop quantum gravity, quantum states and histories of the geometric degrees of freedom turn out to be based on discrete spacetime. The most pressing issue is then how the smooth geometries of general relativity, expressed in terms of suitable geometric observables, arise from such discrete quantum geometries in some semiclassical and continuum limit. In this thesis I tackle the question of suitable observables focusing on the effective dimension of discrete quantum geometries. For this purpose I give a purely combinatorial description of the discrete structures which these geometries have support on. As a side topic, this allows to present an extension of group field theory to cover the combinatorially larger kinematical state space of loop quantum gravity. Moreover, I introduce a discrete calculus for fields on such fundamentally discrete geometries with a particular focus on the Laplacian. This permits to define the effective-dimension observables for quantum geometries. Analysing various classes of quantum geometries, I find as a general result that the spectral dimension is more sensitive to the underlying combinatorial structure than to the details of the additional geometric data thereon. Semiclassical states in loop quantum gravity approximate the classical geometries they are peaking on rather well and there are no indications for stronger quantum effects. On the other hand, in the context of a more general model of states which are superposition over a large number of complexes, based on analytic solutions, there is a flow of the spectral dimension from the topological dimension d on low energy scales to a real number between 0 and d on high energy scales. In the particular case of 1 these results allow to understand the quantum geometry as effectively fractal.

  16. Synchronization Of Parallel Discrete Event Simulations

    Science.gov (United States)

    Steinman, Jeffrey S.

    1992-01-01

    Adaptive, parallel, discrete-event-simulation-synchronization algorithm, Breathing Time Buckets, developed in Synchronous Parallel Environment for Emulation and Discrete Event Simulation (SPEEDES) operating system. Algorithm allows parallel simulations to process events optimistically in fluctuating time cycles that naturally adapt while simulation in progress. Combines best of optimistic and conservative synchronization strategies while avoiding major disadvantages. Algorithm processes events optimistically in time cycles adapting while simulation in progress. Well suited for modeling communication networks, for large-scale war games, for simulated flights of aircraft, for simulations of computer equipment, for mathematical modeling, for interactive engineering simulations, and for depictions of flows of information.

  17. Speeding Up Network Simulations Using Discrete Time

    OpenAIRE

    Lucas, Aaron; Armbruster, Benjamin

    2013-01-01

    We develop a way of simulating disease spread in networks faster at the cost of some accuracy. Instead of a discrete event simulation (DES) we use a discrete time simulation. This aggregates events into time periods. We prove a bound on the accuracy attained. We also discuss the choice of step size and do an analytical comparison of the computational costs. Our error bound concept comes from the theory of numerical methods for SDEs and the basic proof structure comes from the theory of numeri...

  18. PHASE CHAOS IN THE DISCRETE KURAMOTO MODEL

    DEFF Research Database (Denmark)

    Maistrenko, V.; Vasylenko, A.; Maistrenko, Y.

    2010-01-01

    The paper describes the appearance of a novel, high-dimensional chaotic regime, called phase chaos, in a time-discrete Kuramoto model of globally coupled phase oscillators. This type of chaos is observed at small and intermediate values of the coupling strength. It arises from the nonlinear...... interaction among the oscillators, while the individual oscillators behave periodically when left uncoupled. For the four-dimensional time-discrete Kuramoto model, we outline the region of phase chaos in the parameter plane and determine the regions where phase chaos coexists with different periodic...

  19. Digital and discrete geometry theory and algorithms

    CERN Document Server

    Chen, Li

    2014-01-01

    This book provides comprehensive coverage of the modern methods for geometric problems in the computing sciences. It also covers concurrent topics in data sciences including geometric processing, manifold learning, Google search, cloud data, and R-tree for wireless networks and BigData.The author investigates digital geometry and its related constructive methods in discrete geometry, offering detailed methods and algorithms. The book is divided into five sections: basic geometry; digital curves, surfaces and manifolds; discretely represented objects; geometric computation and processing; and a

  20. A Low Complexity Discrete Radiosity Method

    OpenAIRE

    Chatelier , Pierre Yves; Malgouyres , Rémy

    2006-01-01

    International audience; Rather than using Monte Carlo sampling techniques or patch projections to compute radiosity, it is possible to use a discretization of a scene into voxels and perform some discrete geometry calculus to quickly compute visibility information. In such a framework , the radiosity method may be as precise as a patch-based radiosity using hemicube computation for form-factors, but it lowers the overall theoretical complexity to an O(N log N) + O(N), where the O(N) is largel...

  1. Modeling and simulation of discrete event systems

    CERN Document Server

    Choi, Byoung Kyu

    2013-01-01

    Computer modeling and simulation (M&S) allows engineers to study and analyze complex systems. Discrete-event system (DES)-M&S is used in modern management, industrial engineering, computer science, and the military. As computer speeds and memory capacity increase, so DES-M&S tools become more powerful and more widely used in solving real-life problems. Based on over 20 years of evolution within a classroom environment, as well as on decades-long experience in developing simulation-based solutions for high-tech industries, Modeling and Simulation of Discrete-Event Systems is the only book on

  2. Logic and discrete mathematics a concise introduction

    CERN Document Server

    Conradie, Willem

    2015-01-01

    A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade.  The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy

  3. Semiclassical expanding discrete space-times

    International Nuclear Information System (INIS)

    Cobb, W.K.; Smalley, L.L.

    1981-01-01

    Given the close ties between general relativity and geometry one might reasonably expect that quantum effects associated with gravitation might also be tied to the geometry of space-time, namely, to some sort of discreteness in space-time itself. In particular it is supposed that space-time consists of a discrete lattice of points rather than the usual continuum. Since astronomical evidence seems to suggest that the universe is expanding, the lattice must also expand. Some of the implications of such a model are that the proton should presently be stable, and the universe should be closed although the mechanism for closure is quantum mechanical. (author)

  4. Systematization of Accurate Discrete Optimization Methods

    Directory of Open Access Journals (Sweden)

    V. A. Ovchinnikov

    2015-01-01

    Full Text Available The object of study of this paper is to define accurate methods for solving combinatorial optimization problems of structural synthesis. The aim of the work is to systemize the exact methods of discrete optimization and define their applicability to solve practical problems.The article presents the analysis, generalization and systematization of classical methods and algorithms described in the educational and scientific literature.As a result of research a systematic presentation of combinatorial methods for discrete optimization described in various sources is given, their capabilities are described and properties of the tasks to be solved using the appropriate methods are specified.

  5. Multiband discrete ordinates method: formalism and results

    International Nuclear Information System (INIS)

    Luneville, L.

    1998-06-01

    The multigroup discrete ordinates method is a classical way to solve transport equation (Boltzmann) for neutral particles. Self-shielding effects are not correctly treated due to large variations of cross sections in a group (in the resonance range). To treat the resonance domain, the multiband method is introduced. The main idea is to divide the cross section domain into bands. We obtain the multiband parameters using the moment method; the code CALENDF provides probability tables for these parameters. We present our implementation in an existing discrete ordinates code: SN1D. We study deep penetration benchmarks and show the improvement of the method in the treatment of self-shielding effects. (author)

  6. Financial Resources Allocation of Tabriz University of Medical Sciences

    Directory of Open Access Journals (Sweden)

    Esmaeil Afiyan

    2015-08-01

    Full Text Available ​ Background and Objectives : According to complexity of resource allocation, issue about how to allocate health care resources in an accurate and fair manner has become the subject of discussions and decisions of related groups. Therefore, in this research we aim to study the methods of financial resource allocation of Tabriz University of Medical Sciences in order to identify its strengths and weaknesses for its promotion. Material and Methods : This study is a descriptive, qualitative sectional research and all comments have been collected by focus group discussions with experts and managers involved in the allocation of financial resources of Tabriz University of Medical Sciences. All factors affecting the process of allocation have been reviewd carefully. Results : Results suggested that except the health sector, none of the other sectors use the formulated  and scientific methods for allocating financial resources and despite the emphasize in the 4th development plan for operating funding, the final cost of the services, has no role in allocating financial resources. Conclusion : Regarding to judgmental and subjective method of financial resources allocation of Tabriz University of Medical Sciences and lack of documented and formulated methods, there is an essential need for developing an appropriate and formulated model for scientific allocation of financial resources in order to improve the efficiency and fairness of the allocation.

  7. Site Selection and Resource Allocation of Oil Spill Emergency Base for Offshore Oil Facilities

    Science.gov (United States)

    Li, Yunbin; Liu, Jingxian; Wei, Lei; Wu, Weihuang

    2018-02-01

    Based on the analysis of the historical data about oil spill accidents in the Bohai Sea, this paper discretizes oil spilled source into a limited number of spill points. According to the probability of oil spill risk, the demand for salvage forces at each oil spill point is evaluated. Aiming at the specific location of the rescue base around the Bohai Sea, a cost-benefit analysis is conducted to determine the total cost of disasters for each rescue base. Based on the relationship between the oil spill point and the rescue site, a multi-objective optimization location model for the oil spill rescue base in the Bohai Sea region is established. And the genetic algorithm is used to solve the optimization problem, and determine the emergency rescue base optimization program and emergency resources allocation ratio.

  8. Energy-Aware Sensor Networks via Sensor Selection and Power Allocation

    KAUST Repository

    Niyazi, Lama B.

    2018-02-12

    Finite energy reserves and the irreplaceable nature of nodes in battery-driven wireless sensor networks (WSNs) motivate energy-aware network operation. This paper considers energy-efficiency in a WSN by investigating the problem of minimizing the power consumption consisting of both radiated and circuit power of sensor nodes, so as to determine an optimal set of active sensors and corresponding transmit powers. To solve such a mixed discrete and continuous problem, the paper proposes various sensor selection and power allocation algorithms of low complexity. Simulation results show an appreciable improvement in their performance over a system in which no selection strategy is applied, with a slight gap from derived lower bounds. The results further yield insights into the relationship between the number of activated sensors and its effect on total power in different regimes of operation, based on which recommendations are made for which strategies to use in the different regimes.

  9. Discrete energy formulation of neutron transport theory applied to solving the discrete ordinates equations

    International Nuclear Information System (INIS)

    Ching, J.; Oblow, E.M.; Goldstein, H.

    1976-01-01

    An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated that allows the development of a discrete energy, discrete ordinates method for the solution of radiation transport problems. In the discrete energy method, the group averaging required in the cross-section processing for multigroup calculations is replaced by a faster numerical quadrature scheme capable of generating transfer cross sections describing all the physical processes of interest on a fine point-energy grid. Test calculations in which the discrete energy method is compared with the multigroup method show that, for the same energy grid, the discrete energy method is much faster, although somewhat less accurate, than the multigroup method. However, the accuracy of the discrete energy method increases rapidly as the spacing between energy grid points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum, the discrete energy method is therefore expected to be far more economical than the multigroup technique for equivalent accuracy solutions. This advantage of the point method is demonstrated by application to the study of neutron transport in a thick iron slab

  10. Scheduling Cranes at an Indented Berth

    NARCIS (Netherlands)

    Beens, Marie-Anne; Ursavas, Evrim

    2016-01-01

    Container terminals are facing great challenges in order to meet the shipping industry’s requirements. An important fact within the industry is the increasing vessel sizes. Actually, within the last decade the ship size in the Asia-Europe trade has effectively doubled. However, port productivity has

  11. Discrete integrable systems and hodograph transformations arising from motions of discrete plane curves

    International Nuclear Information System (INIS)

    Feng Baofeng; Maruno, Ken-ichi; Inoguchi, Jun-ichi; Kajiwara, Kenji; Ohta, Yasuhiro

    2011-01-01

    We consider integrable discretizations of some soliton equations associated with the motions of plane curves: the Wadati-Konno-Ichikawa elastic beam equation, the complex Dym equation and the short pulse equation. They are related to the modified KdV or the sine-Gordon equations by the hodograph transformations. Based on the observation that the hodograph transformations are regarded as the Euler-Lagrange transformations of the curve motions, we construct the discrete analogues of the hodograph transformations, which yield integrable discretizations of those soliton equations. (paper)

  12. An innovative discrete multilevel sampler design

    International Nuclear Information System (INIS)

    Marvin, B.K.; De Clercq, P.J.; Taylor, B.B.; Mauro, D.M.

    1995-01-01

    An innovative, small-diameter PVC discrete multilevel sampler (DMLS) was designed for the Electric Power Research Institute (EPRI) to provide low-cost, discrete groundwater samples from shallow aquifers. When combined with appropriately-sized direct push soil sampling technologies, high resolution aquifer characterization can be achieved during initial site assessment or remediation monitoring activities. The sampler is constructed from 1-inch diameter PVC well materials, containing polyethylene tubing threaded through PVC disks. Self-expanding annular and internal bentonite seals were developed which isolate discrete sampling zones. The DMLS design allows customization of sampling and isolation zone lengths to suit site-specific goals. Installation of the DMLS is achieved using a temporary, expendable-tipped casting driven by direct push methods. This technique minimizes mobilization costs, site and soil column disturbances, and allows rapid installation in areas of limited overhead clearance. Successful pilot installations of the DMLS prototype have been made at a former manufactured gas plant (MGP) site and a diesel fuel spill site. Analysis of groundwater samples from these sites, using relative compound distributions and contaminant concentration profiling, confirmed that representative discrete samples were collected. This design provides both economical and versatile groundwater monitoring during all phases of site assessment and remediation

  13. Integrated two-section discrete mode laser

    NARCIS (Netherlands)

    Anandarajah, P.M.; Latkowski, S.; Browning, C.; Zhou, R.; O'Carroll, J.; Phelan, R.; Kelly, B.; O'Gorman, J.; Barry, L.P.

    2012-01-01

    The authors present the design and characterization of a novel integrated two-section discrete mode index patterned diode laser source. The two slotted regions etched into the laser ridge waveguide are formed in the same fabrication step as the ridge, thus avoiding the requirement for complex

  14. About Multi-Heston SDE Discretization

    Directory of Open Access Journals (Sweden)

    Tiberiu Socaciu

    2013-07-01

    Full Text Available Abstract: in this paper we show how can estimate a financial derivative based on a support if assume for the support a Multi-Heston model.Keywords: Euler Maruyama discretization method, Monte Carlo simulation, Heston model, Double-Heston model, Multi-Heston model.

  15. Transversals in non-discrete groups

    Indian Academy of Sciences (India)

    Transversals in non-discrete groups. RAMJI LAL and R P SHUKLA. Department of Mathematics, University of Allahabad, Allahabad 211 002, India. E-mail: ramjilal@mri.ernet.in; rps@mri.ernet.in. MS received 2 August 2004; revised 4 August 2005. Abstract. The concept of 'topological right transversal' is introduced to study ...

  16. Attractors for discrete periodic dynamical systems

    Science.gov (United States)

    John E. Franke; James F. Selgrade

    2003-01-01

    A mathematical framework is introduced to study attractors of discrete, nonautonomous dynamical systems which depend periodically on time. A structure theorem for such attractors is established which says that the attractor of a time-periodic dynamical system is the unin of attractors of appropriate autonomous maps. If the nonautonomous system is a perturbation of an...

  17. Model-Checking Discrete Duration Calculus

    DEFF Research Database (Denmark)

    Hansen, Michael Reichhardt

    1994-01-01

    can do model-checking. The subset we consider is expressive enough to formalize the requirements to the gas burner system given by A.P. Ravn (1993); but only for a discrete time domain. Model-checking is done by reducing the correctness problem ℳ|=𝒟 to the inclusion problem of regular...

  18. Discrete Events as Units of Perceived Time

    Science.gov (United States)

    Liverence, Brandon M.; Scholl, Brian J.

    2012-01-01

    In visual images, we perceive both space (as a continuous visual medium) and objects (that inhabit space). Similarly, in dynamic visual experience, we perceive both continuous time and discrete events. What is the relationship between these units of experience? The most intuitive answer may be similar to the spatial case: time is perceived as an…

  19. Discrete dispersion models and their Tweedie asymptotics

    DEFF Research Database (Denmark)

    Jørgensen, Bent; Kokonendji, Célestin C.

    2016-01-01

    The paper introduce a class of two-parameter discrete dispersion models, obtained by combining convolution with a factorial tilting operation, similar to exponential dispersion models which combine convolution and exponential tilting. The equidispersed Poisson model has a special place in this ap......The paper introduce a class of two-parameter discrete dispersion models, obtained by combining convolution with a factorial tilting operation, similar to exponential dispersion models which combine convolution and exponential tilting. The equidispersed Poisson model has a special place...... in this approach, whereas several overdispersed discrete distributions, such as the Neyman Type A, Pólya-Aeppli, negative binomial and Poisson-inverse Gaussian, turn out to be Poisson-Tweedie factorial dispersion models with power dispersion functions, analogous to ordinary Tweedie exponential dispersion models...... with power variance functions. Using the factorial cumulant generating function as tool, we introduce a dilation operation as a discrete analogue of scaling, generalizing binomial thinning. The Poisson-Tweedie factorial dispersion models are closed under dilation, which in turn leads to a Poisson...

  20. Multivariate Discrete First Order Stochastic Dominance

    DEFF Research Database (Denmark)

    Tarp, Finn; Østerdal, Lars Peter

    This paper characterizes the principle of first order stochastic dominance in a multivariate discrete setting. We show that a distribution  f first order stochastic dominates distribution g if and only if  f can be obtained from g by iteratively shifting density from one outcome to another...

  1. Discrete element modeling of subglacial sediment deformation

    DEFF Research Database (Denmark)

    Damsgaard, Anders; Egholm, David L.; Piotrowski, Jan A.

    2013-01-01

    The Discrete Element Method (DEM) is used in this study to explore the highly nonlinear dynamics of a granular bed when exposed to stress conditions comparable to those at the bed of warm-based glaciers. Complementary to analog experiments, the numerical approach allows a detailed analysis...

  2. Discrete variable representation for singular Hamiltonians

    DEFF Research Database (Denmark)

    Schneider, B. I.; Nygaard, Nicolai

    2004-01-01

    We discuss the application of the discrete variable representation (DVR) to Schrodinger problems which involve singular Hamiltonians. Unlike recent authors who invoke transformations to rid the eigenvalue equation of singularities at the cost of added complexity, we show that an approach based...

  3. Discrete choice models with multiplicative error terms

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Bierlaire, Michel

    2009-01-01

    The conditional indirect utility of many random utility maximization (RUM) discrete choice models is specified as a sum of an index V depending on observables and an independent random term ε. In general, the universe of RUM consistent models is much larger, even fixing some specification of V due...

  4. Choice certainty in Discrete Choice Experiments

    DEFF Research Database (Denmark)

    Uggeldahl, Kennet Christian; Jacobsen, Catrine; Lundhede, Thomas

    2016-01-01

    In this study, we conduct a Discrete Choice Experiment (DCE) using eye tracking technology to investigate if eye movements during the completion of choice sets reveal information about respondents’ choice certainty. We hypothesise that the number of times that respondents shift their visual...

  5. Ordinal Welfare Comparisons with Multiple Discrete Indicators

    DEFF Research Database (Denmark)

    Arndt, Channing; Distante, Roberta; Hussain, M. Azhar

    We develop an ordinal method for making welfare comparisons between populations with multidimensional discrete well-being indicators observed at the micro level. The approach assumes that, for each well-being indicator, the levels can be ranked from worse to better; however, no assumptions are made...

  6. Discrete element modeling of subglacial sediment deformation

    DEFF Research Database (Denmark)

    Damsgaard, Anders; Egholm, David L.; Piotrowski, Jan A.

    The Discrete Element Method (DEM) is used to explore the highly nonlinear dynamics of a granular bed when exposed to stress conditions comparable to those at the bed of warm-based glaciers. In the DEM, the material is simulated on a grain-by-grain basis, and defining the micromechanical properties...

  7. Discrete breathers in Bose–Einstein condensates

    International Nuclear Information System (INIS)

    Franzosi, Roberto; Politi, Antonio; Livi, Roberto; Oppo, Gian-Luca

    2011-01-01

    Discrete breathers, originally introduced in the context of biopolymers and coupled nonlinear oscillators, are also localized modes of excitation of Bose–Einstein condensates (BEC) in periodic potentials such as those generated by counter-propagating laser beams in an optical lattice. Static and dynamical properties of breather states are analysed in the discrete nonlinear Schrödinger equation that is derived in the limit of deep potential wells, tight-binding and the superfluid regime of the condensate. Static and mobile breathers can be formed by progressive re-shaping of initial Gaussian wave-packets or by transporting atomic density towards dissipative boundaries of the lattice. Static breathers generated via boundary dissipations are determined via a transfer-matrix approach and discussed in the two analytic limits of highly localized and very broad profiles. Mobile breathers that move across the lattice are well approximated by modified analytical expressions derived from integrable models with two independent parameters: the core-phase gradient and the peak amplitude. Finally, possible experimental realizations of discrete breathers in BEC in optical lattices are discussed in the presence of residual harmonic trapping and in interferometry configurations suitable to investigate discrete breathers' interactions. (invited article)

  8. Discrete Event Simulation of Distributed Team Communication

    Science.gov (United States)

    2012-03-22

    performs, and auditory information that is provided through multiple audio devices with speech response. This paper extends previous discrete event workload...2008, pg. 1) notes that “Architecture modeling furnishes abstrac- tions for use in managing complexities, allowing engineers to visualise the proposed

  9. Discrete expansions of continuum wave functions

    International Nuclear Information System (INIS)

    Bang, J.; Ershov, S.N.; Gareev, F.A.; Kazacha, G.S.

    1980-01-01

    Different methods of expanding continuum wave functions in terms of discrete basis sets are discussed. The convergence properties of these expansions are investigated, both from a mathematical and a numerical point of view, for the case of potentials of Woods-Saxon and square well type. (orig.)

  10. Failure diagnosis using discrete event models

    International Nuclear Information System (INIS)

    Sampath, M.; Sengupta, R.; Lafortune, S.; Teneketzis, D.; Sinnamohideen, K.

    1994-01-01

    We propose a Discrete Event Systems (DES) approach to the failure diagnosis problem. We present a methodology for modeling physical systems in a DES framework. We discuss the notion of diagnosability and present the construction procedure of the diagnoser. Finally, we illustrate our approach using a Heating, Ventilation and Air Conditioning (HVAC) system

  11. A Discrete Dynamical Model of Signed Partitions

    Directory of Open Access Journals (Sweden)

    G. Chiaselotti

    2013-01-01

    Full Text Available We use a discrete dynamical model with three evolution rules in order to analyze the structure of a partially ordered set of signed integer partitions whose main properties are actually not known. This model is related to the study of some extremal combinatorial sum problems.

  12. A Note on Discrete Mathematics and Calculus.

    Science.gov (United States)

    O'Reilly, Thomas J.

    1987-01-01

    Much of the current literature on the topic of discrete mathematics and calculus during the first two years of an undergraduate mathematics curriculum is cited. A relationship between the recursive integration formulas and recursively defined polynomials is described. A Pascal program is included. (Author/RH)

  13. Analysis hierarchical model for discrete event systems

    Science.gov (United States)

    Ciortea, E. M.

    2015-11-01

    The This paper presents the hierarchical model based on discrete event network for robotic systems. Based on the hierarchical approach, Petri network is analysed as a network of the highest conceptual level and the lowest level of local control. For modelling and control of complex robotic systems using extended Petri nets. Such a system is structured, controlled and analysed in this paper by using Visual Object Net ++ package that is relatively simple and easy to use, and the results are shown as representations easy to interpret. The hierarchical structure of the robotic system is implemented on computers analysed using specialized programs. Implementation of hierarchical model discrete event systems, as a real-time operating system on a computer network connected via a serial bus is possible, where each computer is dedicated to local and Petri model of a subsystem global robotic system. Since Petri models are simplified to apply general computers, analysis, modelling, complex manufacturing systems control can be achieved using Petri nets. Discrete event systems is a pragmatic tool for modelling industrial systems. For system modelling using Petri nets because we have our system where discrete event. To highlight the auxiliary time Petri model using transport stream divided into hierarchical levels and sections are analysed successively. Proposed robotic system simulation using timed Petri, offers the opportunity to view the robotic time. Application of goods or robotic and transmission times obtained by measuring spot is obtained graphics showing the average time for transport activity, using the parameters sets of finished products. individually.

  14. Fair value accounting and managerial discretion

    NARCIS (Netherlands)

    Byrne, A.; Clacher, I.; Hillier, D.; Hodgson, A.

    2008-01-01

    We analyse the extent to which managers exercise discretion under fair value accounting and the value relevance of these disclosures. Utilising a sample of firms that apply the UK fair value pension accounting standard, (FRS-17), we examine the main determinants of the assumptions managers use to

  15. Electroless plating apparatus for discrete microsized particles

    International Nuclear Information System (INIS)

    Mayer, A.

    1978-01-01

    Method and apparatus are disclosed for producing very uniform coatings of a desired material on discrete microsized particles by electroless techniques. Agglomeration or bridging of the particles during the deposition process is prevented by imparting a sufficiently random motion to the particles that they are not in contact with each other for a time sufficient for such to occur

  16. Discrete structures in F-theory compactifications

    Energy Technology Data Exchange (ETDEWEB)

    Till, Oskar

    2016-05-04

    In this thesis we study global properties of F-theory compactifications on elliptically and genus-one fibered Calabi-Yau varieties. This is motivated by phenomenological considerations as well as by the need for a deeper understanding of the set of consistent F-theory vacua. The global geometric features arise from discrete and arithmetic structures in the torus fiber and can be studied in detail for fibrations over generic bases. In the case of elliptic fibrations we study the role of the torsion subgroup of the Mordell-Weil group of sections in four dimensional compactifications. We show how the existence of a torsional section restricts the admissible matter representations in the theory. This is shown to be equivalent to inducing a non-trivial fundamental group of the gauge group. Compactifying F-theory on genus-one fibrations with multisections gives rise to discrete selection rules. In field theory the discrete symmetry is a broken U(1) symmetry. In the geometry the higgsing corresponds to a conifold transition. We explain in detail the origin of the discrete symmetry from two different M-theory phases and put the result into the context of torsion homology. Finally we systematically construct consistent gauge fluxes on genus-one fibrations and show that these induce an anomaly free chiral spectrum.

  17. Geometric phases in discrete dynamical systems

    Energy Technology Data Exchange (ETDEWEB)

    Cartwright, Julyan H.E., E-mail: julyan.cartwright@csic.es [Instituto Andaluz de Ciencias de la Tierra, CSIC–Universidad de Granada, E-18100 Armilla, Granada (Spain); Instituto Carlos I de Física Teórica y Computacional, Universidad de Granada, E-18071 Granada (Spain); Piro, Nicolas, E-mail: nicolas.piro@epfl.ch [École Polytechnique Fédérale de Lausanne (EPFL), 1015 Lausanne (Switzerland); Piro, Oreste, E-mail: piro@imedea.uib-csic.es [Departamento de Física, Universitat de les Illes Balears, E-07122 Palma de Mallorca (Spain); Tuval, Idan, E-mail: ituval@imedea.uib-csic.es [Mediterranean Institute for Advanced Studies, CSIC–Universitat de les Illes Balears, E-07190 Mallorca (Spain)

    2016-10-14

    In order to study the behaviour of discrete dynamical systems under adiabatic cyclic variations of their parameters, we consider discrete versions of adiabatically-rotated rotators. Parallelling the studies in continuous systems, we generalize the concept of geometric phase to discrete dynamics and investigate its presence in these rotators. For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number of the system. For the discrete version of the rotated rotator considered by Berry, the rotated standard map, we further explore this connection as well as the role of the geometric phase at the onset of chaos. Further into the chaotic regime, we show that the geometric phase is also related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent. - Highlights: • We extend the concept of geometric phase to maps. • For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number. • For the rotated standard map, we explore the role of the geometric phase at the onset of chaos. • We show that the geometric phase is related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent.

  18. Geometric Representations for Discrete Fourier Transforms

    Science.gov (United States)

    Cambell, C. W.

    1986-01-01

    Simple geometric representations show symmetry and periodicity of discrete Fourier transforms (DFT's). Help in visualizing requirements for storing and manipulating transform value in computations. Representations useful in any number of dimensions, but particularly in one-, two-, and three-dimensional cases often encountered in practice.

  19. Discrete-time rewards model-checked

    NARCIS (Netherlands)

    Larsen, K.G.; Andova, S.; Niebert, Peter; Hermanns, H.; Katoen, Joost P.

    2003-01-01

    This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with reward constraints. This allows to formulate complex measures – involving expected as well as accumulated rewards – in a precise and

  20. Discrete Mathematics Course Supported by CAS MATHEMATICA

    Science.gov (United States)

    Ivanov, O. A.; Ivanova, V. V.; Saltan, A. A.

    2017-01-01

    In this paper, we discuss examples of assignments for a course in discrete mathematics for undergraduate students majoring in business informatics. We consider several problems with computer-based solutions and discuss general strategies for using computers in teaching mathematics and its applications. In order to evaluate the effectiveness of our…