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.

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.

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.

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

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...

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...

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

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)

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.

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.

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.…

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.

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.

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)

Practical Solutions for Reducing Container Ships’ Waiting Times at Ports Using Simulation Model

Institute of Scientific and Technical Information of China (English)

Abdorreza Sheikholeslami; Gholamreza Ilati; Yones Eftekhari Yeganeh

2013-01-01

The main challenge for container ports is the planning required for berthing container ships while docked in port. Growth of containerization is creating problems for ports and container terminals as they reach their capacity limits of various resources which increasingly leads to traffic and port congestion. Good planning and management of container terminal operations reduces waiting time for liner ships. Reducing the waiting time improves the terminal’s productivity and decreases the port difficulties. Two important keys to reducing waiting time with berth allocation are determining suitable access channel depths and increasing the number of berths which in this paper are studied and analyzed as practical solutions. Simulation based analysis is the only way to understand how various resources interact with each other and how they are affected in the berthing time of ships. We used the Enterprise Dynamics software to produce simulation models due to the complexity and nature of the problems. We further present case study for berth allocation simulation of the biggest container terminal in Iran and the optimum access channel depth and the number of berths are obtained from simulation results. The results show a significant reduction in the waiting time for container ships and can be useful for major functions in operations and development of container ship terminals.

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

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

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.

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)

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.

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.

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...

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)

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.

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.

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

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.

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)

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

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.

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.

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.

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.

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...

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

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.

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.

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.

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

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

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

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)

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.

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.

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.".

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.

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

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.

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)

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)

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)

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.

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.

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...

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

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.

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

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.

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

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.

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.

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

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

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

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.

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

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...

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...

Two-Stage Multiobjective Optimization for Emergency Supplies Allocation Problem under Integrated Uncertainty

Directory of Open Access Journals (Sweden)

Xuejie Bai

2016-01-01

Full Text Available This paper proposes a new two-stage optimization method for emergency supplies allocation problem with multisupplier, multiaffected area, multirelief, and multivehicle. The triplet of supply, demand, and the availability of path is unknown prior to the extraordinary event and is descriptive with fuzzy random variable. Considering the fairness, timeliness, and economical efficiency, a multiobjective expected value model is built for facility location, vehicle routing, and supply allocation decisions. The goals of proposed model aim to minimize the proportion of demand nonsatisfied and response time of emergency reliefs and the total cost of the whole process. When the demand and the availability of path are discrete, the expected values in the objective functions are converted into their equivalent forms. When the supply amount is continuous, the equilibrium chance in the constraint is transformed to its equivalent one. To overcome the computational difficulty caused by multiple objectives, a goal programming model is formulated to obtain a compromise solution. Finally, an example is presented to illustrate the validity of the proposed model and the effectiveness of the solution method.

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.

Performance of discrete heat engines and heat pumps in finite time

Science.gov (United States)

Feldmann; Kosloff

2000-05-01

The performance in finite time of a discrete heat engine with internal friction is analyzed. The working fluid of the engine is composed of an ensemble of noninteracting two level systems. External work is applied by changing the external field and thus the internal energy levels. The friction induces a minimal cycle time. The power output of the engine is optimized with respect to time allocation between the contact time with the hot and cold baths as well as the adiabats. The engine's performance is also optimized with respect to the external fields. By reversing the cycle of operation a heat pump is constructed. The performance of the engine as a heat pump is also optimized. By varying the time allocation between the adiabats and the contact time with the reservoir a universal behavior can be identified. The optimal performance of the engine when the cold bath is approaching absolute zero is studied. It is found that the optimal cooling rate converges linearly to zero when the temperature approaches absolute zero.

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...

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).

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

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

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 ...

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)

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...

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....

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....

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...

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.

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

Eliciting preferences for priority setting in genetic testing: a pilot study comparing best-worst scaling and discrete-choice experiments

OpenAIRE

Severin, Franziska; Schmidtke, Jörg; Mühlbacher, Axel; Rogowski, Wolf H

2013-01-01

Given the increasing number of genetic tests available, decisions have to be made on how to allocate limited health-care resources to them. Different criteria have been proposed to guide priority setting. However, their relative importance is unclear. Discrete-choice experiments (DCEs) and best-worst scaling experiments (BWSs) are methods used to identify and weight various criteria that influence orders of priority. This study tests whether these preference eliciting techniques can be used f...

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.

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.

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

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

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.

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

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...

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

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

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.

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

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.

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.

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.

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)

Estimation of average hazardous-event-frequency for allocation of safety-integrity levels

International Nuclear Information System (INIS)

Misumi, Y.; Sato, Y.

1999-01-01

One of the fundamental concepts of the draft international standard, IEC 61508, is target failure measures to be allocated to Electric/Electronic/Programmable Electronic Safety-Related Systems, i.e. Safety Integrity Levels. The Safety Integrity Levels consist of four discrete probabilistic levels for specifying the safety integrity requirements or the safety functions to be allocated to Electric/Electronic/Programmable Electronic Safety-Related Systems. In order to select the Safety Integrity Levels the draft standard classifies Electric/Electronic/Programmable Electronic Safety-Related Systems into two modes of operation using demand frequencies only. It is not clear which modes of operation should be applied to Electric/Electronic/Programmable Electronic Safety-Related Systems taking into account the demand-state probability and the spurious demand frequency. It is essential for the allocation of Safety Integrity Levels that generic algorithms be derived by involving possible parameters, which make it possible to model the actuality of real systems. The present paper addresses this issue. First of all, the overall system including Electric/Electronic/programmable Electronic Safety-Related Systems is described using a simplified fault-tree. Then, the relationships among demands, demand-states and proof-tests are studied. Overall systems are classified into two groups: a non-demand-state-at-proof-test system which includes both repairable and non-repairable demand states and a constant-demand-frequency system. The new ideas such as a demand-state, spurious demand-state, mean time between detections, rates of d-failure and h-failure, and an h/d ratio are introduced in order to make the Safety Integrity Levels and modes of operation generic and comprehensive. Finally, the overall system is simplified and modeled by fault-trees using Priority-AND gates. At the same time the assumptions for modeling are described. Generic algorithms to estimate hazardous

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

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)

A discrete exterior approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

NARCIS (Netherlands)

Seslija, Marko; Scherpen, Jacquelien M.A.; van der Schaft, Arjan

2011-01-01

This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce simplicial Dirac structures as discrete analogues of the Stokes-Dirac structure and demonstrate

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

Discrete exterior geometry approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems

NARCIS (Netherlands)

Seslija, Marko; van der Schaft, Arjan; Scherpen, Jacquelien M.A.

This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce a simplicial Dirac structure as a discrete analogue of the Stokes-Dirac structure and demonstrate

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...

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...

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

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.

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.

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...

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.

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.

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

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:...

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...

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

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.

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

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.

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.)

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.

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...

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...

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.

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...

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

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 ...

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

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, ...

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

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.

Focused attention improves working memory: implications for flexible-resource and discrete-capacity models.

Science.gov (United States)

Souza, Alessandra S; Rerko, Laura; Lin, Hsuan-Yu; Oberauer, Klaus

2014-10-01

Performance in working memory (WM) tasks depends on the capacity for storing objects and on the allocation of attention to these objects. Here, we explored how capacity models need to be augmented to account for the benefit of focusing attention on the target of recall. Participants encoded six colored disks (Experiment 1) or a set of one to eight colored disks (Experiment 2) and were cued to recall the color of a target on a color wheel. In the no-delay condition, the recall-cue was presented after a 1,000-ms retention interval, and participants could report the retrieved color immediately. In the delay condition, the recall-cue was presented at the same time as in the no-delay condition, but the opportunity to report the color was delayed. During this delay, participants could focus attention exclusively on the target. Responses deviated less from the target's color in the delay than in the no-delay condition. Mixture modeling assigned this benefit to a reduction in guessing (Experiments 1 and 2) and transposition errors (Experiment 2). We tested several computational models implementing flexible or discrete capacity allocation, aiming to explain both the effect of set size, reflecting the limited capacity of WM, and the effect of delay, reflecting the role of attention to WM representations. Both models fit the data better when a spatially graded source of transposition error is added to its assumptions. The benefits of focusing attention could be explained by allocating to this object a higher proportion of the capacity to represent color.

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.

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.

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

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...

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...

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.

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.

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....

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.

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.

Difference Discrete Variational Principles, Euler-Lagrange Cohomology and Symplectic, Multisymplectic Structures I: Difference Discrete Variational Principle

Institute of Scientific and Technical Information of China (English)

GUO Han-Ying,; LI Yu-Qi; WU Ke1; WANG Shi-Kun

2002-01-01

In this first paper of a series, we study the difference discrete variational principle in the framework of multi-parameter differential approach by regarding the forward difference as an entire geometric object in view of noncommutative differential geometry. Regarding the difference as an entire geometric object, the difference discrete version of Legendre transformation can be introduced. By virtue of this variational principle, we can discretely deal with the variation problems in both the Lagrangian and Hamiltonian formalisms to get difference discrete Euler-Lagrange equations and canonical ones for the difference discrete versions of the classical mechanics and classical field theory.

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

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

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 ...

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.

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)

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...

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.

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…

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.

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

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)

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.

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.

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

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

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)

Exact discretization of Schrödinger equation

Energy Technology Data Exchange (ETDEWEB)

Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru

2016-01-08

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

Exact discretization of Schrödinger equation

International Nuclear Information System (INIS)

Tarasov, Vasily E.

2016-01-01

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

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...

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...

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...

A Discrete Heterogeneous-Group Economic Growth Model with Endogenous Leisure Time

Directory of Open Access Journals (Sweden)

Wei-Bin Zhang

2009-01-01

Full Text Available This paper proposes a one-sector multigroup growth model with endogenous labor supply in discrete time. Proposing an alternative approach to behavior of households, we examine the dynamics of wealth and income distribution in a competitive economy with capital accumulation as the main engine of economic growth. We show how human capital levels, preferences, and labor force of heterogeneous households determine the national economic growth, wealth, and income distribution and time allocation of the groups. By simulation we demonstrate, for instance, that in the three-group economy when the rich group's human capital is improved, all the groups will economically benefit, and the leisure times of all the groups are reduced but when any other group's human capital is improved, the group will economically benefit, the other two groups economically lose, and the leisure times of all the groups are increased.

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 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...

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...

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.

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)

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

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.

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.

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

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

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.

Risk-based design of process systems using discrete-time Bayesian networks

International Nuclear Information System (INIS)

Khakzad, Nima; Khan, Faisal; Amyotte, Paul

2013-01-01

Temporal Bayesian networks have gained popularity as a robust technique to model dynamic systems in which the components' sequential dependency, as well as their functional dependency, cannot be ignored. In this regard, discrete-time Bayesian networks have been proposed as a viable alternative to solve dynamic fault trees without resort to Markov chains. This approach overcomes the drawbacks of Markov chains such as the state-space explosion and the error-prone conversion procedure from dynamic fault tree. It also benefits from the inherent advantages of Bayesian networks such as probability updating. However, effective mapping of the dynamic gates of dynamic fault trees into Bayesian networks while avoiding the consequent huge multi-dimensional probability tables has always been a matter of concern. In this paper, a new general formalism has been developed to model two important elements of dynamic fault tree, i.e., cold spare gate and sequential enforcing gate, with any arbitrary probability distribution functions. Also, an innovative Neutral Dependency algorithm has been introduced to model dynamic gates such as priority-AND gate, thus reducing the dimension of conditional probability tables by an order of magnitude. The second part of the paper is devoted to the application of discrete-time Bayesian networks in the risk assessment and safety analysis of complex process systems. It has been shown how dynamic techniques can effectively be applied for optimal allocation of safety systems to obtain maximum risk reduction.

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

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.

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.

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

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...

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)

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

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

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

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

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)

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...

Discrete event simulation for petroleum transfers involving harbors, refineries and pipelines

Energy Technology Data Exchange (ETDEWEB)

Martins, Marcella S.R.; Lueders, Ricardo; Delgado, Myriam R.B.S. [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

2009-07-01

Nowadays a great effort has been spent by companies to improve their logistics in terms of programming of events that affect production and distribution of products. In this case, simulation can be a valuable tool for evaluating different behaviors. The objective of this work is to build a discrete event simulation model for scheduling of operational activities in complexes containing one harbor and two refineries interconnected by a pipeline infrastructure. The model was developed in Arena package, based on three sub-models that control pier allocation, loading of tanks, and transfers to refineries through pipelines. Preliminary results obtained for a given control policy, show that profit can be calculated by taking into account many parameters such as oil costs on ships, pier using, over-stay of ships and interface costs. Such problem has already been considered in the literature but using different strategies. All these factors should be considered in a real-world operation where decision making tools are necessary to obtain high returns. (author)

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

Characterizing contract-based multiagent resource allocation in networks.

Science.gov (United States)

An, Bo; Lesser, Victor

2010-06-01

We consider a multiagent resource allocation problem where individual users intend to route traffic by requesting the help of entities across a network, and a cost is incurred at each network node that depends on the amount of traffic to be routed. We propose to study contract-based network resource allocation. In our model, users and nodes in the network make contracts before nodes route traffic for the users. The problem is an interesting self-interested negotiation problem because it requires the complete assembly of a set of distinct resources, and there are multiple combinations of distinct resources that could satisfy the goal of negotiation. First, we characterize the network allocation problem and show that finding optimal allocations is NP-complete and is inapproximable. We take both Nash equilibrium and pairwise Nash equilibrium as the solution concepts to characterize the equilibrium allocations. We find that, for any resource allocation game, Nash equilibrium and pairwise Nash equilibrium always exist. In addition, socially optimal allocations are always supported by Nash equilibrium and pairwise Nash equilibrium. We introduce best-response dynamics in which each agent takes a myopic best-response strategy and interacts with each other to dynamically form contracts. We analyze the convergence of the dynamics in some special cases. We also experimentally study the convergence rate of the dynamics and how efficient the evolved allocation is as compared with the optimal allocation in a variety of environments.

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...

Optimal defense resource allocation in scale-free networks

Science.gov (United States)

Zhang, Xuejun; Xu, Guoqiang; Xia, Yongxiang

2018-02-01

The robustness research of networked systems has drawn widespread attention in the past decade, and one of the central topics is to protect the network from external attacks through allocating appropriate defense resource to different nodes. In this paper, we apply a specific particle swarm optimization (PSO) algorithm to optimize the defense resource allocation in scale-free networks. Results reveal that PSO based resource allocation shows a higher robustness than other resource allocation strategies such as uniform, degree-proportional, and betweenness-proportional allocation strategies. Furthermore, we find that assigning less resource to middle-degree nodes under small-scale attack while more resource to low-degree nodes under large-scale attack is conductive to improving the network robustness. Our work provides an insight into the optimal defense resource allocation pattern in scale-free networks and is helpful for designing a more robust network.

Supervisor localization a top-down approach to distributed control of discrete-event systems

CERN Document Server

Cai, Kai

2016-01-01

This monograph presents a systematic top-down approach to distributed control synthesis of discrete-event systems (DES). The approach is called supervisor localization; its essence is the allocation of external supervisory control action to individual component agents as their internal control strategies. The procedure is: first synthesize a monolithic supervisor, to achieve globally optimal and nonblocking controlled behavior, then decompose the monolithic supervisor into local controllers, one for each agent. The collective behavior of the resulting local controllers is identical to that achieved by the monolithic supervisor. The basic localization theory is first presented in the Ramadge–Wonham language-based supervisory control framework, then demonstrated with distributed control examples of multi-robot formations, manufacturing systems, and distributed algorithms. An architectural approach is adopted to apply localization to large-scale DES; this yields a heterarchical localization procedure, which is...

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

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.

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.

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)

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

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....

Application of a discrete-energy, discrete-ordinates technique to the study of neutron transport in iron

International Nuclear Information System (INIS)

Ching, J.T.

1975-01-01

An algebraic equivalence between the point-energy and multigroup forms of the Boltzmann transport equation is demonstrated which allows the development of a discrete-energy, discrete-ordinates method for the solution of radiation transport problems. The method utilizes a modified version of a cross section processing scheme devised for the moments method code BMT and the transport equation solution algorithm from the one-dimensional discrete-ordinates transport code ANISN. The combined system, identified as MOMANS, computes fluxes directly from point cross sections in a single operation. In the cross-section processing, the group averaging required for multigroup calculations is replaced by a fast numerical scheme capable of generating a set of transfer cross sections containing all the physical features of interest, thereby increasing the detail in the calculated results. Test calculations in which the discrete-energy method was compared with the multigroup method have shown that for the same energy grid (number of points = number of groups), the discrete-energy method is faster but somewhat less accurate than the multigroup method. However, the accuracy of the discrete-energy method increases rapidly as the spacing between energy points is decreased, approaching that of multigroup calculations. For problems requiring great detail in the energy spectrum the discrete-energy method has therefore proven to be as accurate as, and more economical than, the multigroup technique. This was demonstrated by the application of the method to the study of the transport of neutrons in an iron sphere. Using the capability of the discrete-energy method for rapidly treating changes in cross-section sets, the propagation of neutrons from a 14 MeV source in a 22 cm radius sphere of iron was analyzed for sensitivity to changes in the microscopic scattering mechanisms

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

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...

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.

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.

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

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

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.)

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...

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

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

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

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.

Rational solutions of the discrete time Toda lattice and the alternate discrete Painleve II equation

International Nuclear Information System (INIS)

Common, Alan K; Hone, Andrew N W

2008-01-01

The Yablonskii-Vorob'ev polynomials y n (t), which are defined by a second-order bilinear differential-difference equation, provide rational solutions of the Toda lattice. They are also polynomial tau-functions for the rational solutions of the second Painleve equation (P II ). Here we define two-variable polynomials Y n (t, h) on a lattice with spacing h, by considering rational solutions of the discrete time Toda lattice as introduced by Suris. These polynomials are shown to have many properties that are analogous to those of the Yablonskii-Vorob'ev polynomials, to which they reduce when h = 0. They also provide rational solutions for a particular discretization of P II , namely the so-called alternate discrete P II , and this connection leads to an expression in terms of the Umemura polynomials for the third Painleve equation (P III ). It is shown that the Baecklund transformation for the alternate discrete Painleve equation is a symplectic map, and the shift in time is also symplectic. Finally we present a Lax pair for the alternate discrete P II , which recovers Jimbo and Miwa's Lax pair for P II in the continuum limit h → 0

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...

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

Mum, why do you keep on growing? Impacts of environmental variability on optimal growth and reproduction allocation strategies of annual plants.

Science.gov (United States)

De Lara, Michel

2006-05-01

In their 1990 paper Optimal reproductive efforts and the timing of reproduction of annual plants in randomly varying environments, Amir and Cohen considered stochastic environments consisting of i.i.d. sequences in an optimal allocation discrete-time model. We suppose here that the sequence of environmental factors is more generally described by a Markov chain. Moreover, we discuss the connection between the time interval of the discrete-time dynamic model and the ability of the plant to rebuild completely its vegetative body (from reserves). We formulate a stochastic optimization problem covering the so-called linear and logarithmic fitness (corresponding to variation within and between years), which yields optimal strategies. For "linear maximizers'', we analyse how optimal strategies depend upon the environmental variability type: constant, random stationary, random i.i.d., random monotonous. We provide general patterns in terms of targets and thresholds, including both determinate and indeterminate growth. We also provide a partial result on the comparison between ;"linear maximizers'' and "log maximizers''. Numerical simulations are provided, allowing to give a hint at the effect of different mathematical assumptions.

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

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

Accounting of allocation of production enterprises’ overhead costs

Directory of Open Access Journals (Sweden)

О.V. Ivaniuta

2016-12-01

Full Text Available Taking into account the complexity of engineering technological cycles, the use of traditional approaches to the allocation of overhead costs at the researching enterprises is inexpedient and inefficient. The authors find out that to solve this problem it is not enough to choose only one base of allocation because the formed prime cost with such an approach will not meet the reality. That is why it is suggested to use a multilevel allocation of overhead costs. The proposed approach involves the allocation of overhead costs at the following levels: fixed and variable, with shops of main and auxiliary production, calculation stations, some orders. Each level involves the selection of individual allocation bases that are grouped on economic, technological and integrated ones.

S4HARA: System for HIV/AIDS resource allocation.

Science.gov (United States)

Lasry, Arielle; Carter, Michael W; Zaric, Gregory S

2008-03-26

HIV/AIDS resource allocation decisions are influenced by political, social, ethical and other factors that are difficult to quantify. Consequently, quantitative models of HIV/AIDS resource allocation have had limited impact on actual spending decisions. We propose a decision-support System for HIV/AIDS Resource Allocation (S4HARA) that takes into consideration both principles of efficient resource allocation and the role of non-quantifiable influences on the decision-making process for resource allocation. S4HARA is a four-step spreadsheet-based model. The first step serves to identify the factors currently influencing HIV/AIDS allocation decisions. The second step consists of prioritizing HIV/AIDS interventions. The third step involves allocating the budget to the HIV/AIDS interventions using a rational approach. Decision-makers can select from several rational models of resource allocation depending on availability of data and level of complexity. The last step combines the results of the first and third steps to highlight the influencing factors that act as barriers or facilitators to the results suggested by the rational resource allocation approach. Actionable recommendations are then made to improve the allocation. We illustrate S4HARA in the context of a primary healthcare clinic in South Africa. The clinic offers six types of HIV/AIDS interventions and spends US$750,000 annually on these programs. Current allocation decisions are influenced by donors, NGOs and the government as well as by ethical and religious factors. Without additional funding, an optimal allocation of the total budget suggests that the portion allotted to condom distribution be increased from 1% to 15% and the portion allotted to prevention and treatment of opportunistic infections be increased from 43% to 71%, while allocation to other interventions should decrease. Condom uptake at the clinic should be increased by changing the condom distribution policy from a pull system to a push

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.

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

Time-Discrete Higher-Order ALE Formulations: Stability

KAUST Repository

Bonito, Andrea; Kyza, Irene; Nochetto, Ricardo H.

2013-01-01

on the stability of the PDE but may influence that of a discrete scheme. We examine this critical issue for higher-order time stepping without space discretization. We propose time-discrete discontinuous Galerkin (dG) numerical schemes of any order for a time

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

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.

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.

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.

Discrete ellipsoidal statistical BGK model and Burnett equations

Science.gov (United States)

Zhang, Yu-Dong; Xu, Ai-Guo; Zhang, Guang-Cai; Chen, Zhi-Hua; Wang, Pei

2018-06-01

A new discrete Boltzmann model, the discrete ellipsoidal statistical Bhatnagar-Gross-Krook (ESBGK) model, is proposed to simulate nonequilibrium compressible flows. Compared with the original discrete BGK model, the discrete ES-BGK has a flexible Prandtl number. For the discrete ES-BGK model in the Burnett level, two kinds of discrete velocity model are introduced and the relations between nonequilibrium quantities and the viscous stress and heat flux in the Burnett level are established. The model is verified via four benchmark tests. In addition, a new idea is introduced to recover the actual distribution function through the macroscopic quantities and their space derivatives. The recovery scheme works not only for discrete Boltzmann simulation but also for hydrodynamic ones, for example, those based on the Navier-Stokes or the Burnett equations.

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.

Quayside Operations Planning Under Uncertainty

DEFF Research Database (Denmark)

Iris, Cagatay; Jin, Jian Gang; Lee, Der-Hong

The quayside operation problem is one of the key components in the management system for a container terminal. This work focuses on three important problems that represent a bottleneck on terminal operations: Berth Allocation Problem (BAP), Quay Crane Assignment and Scheduling Problems (QCASP......).The state-of-art models mostly rely on forecasted, deterministic vessel arrivals, and they mostly assume that uniform QC operations is maintained. However, in reality, these parameters are mostly random. In this study, we present a stochastic programming approach based on a decomposition algorithm to solve...

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...

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.

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)

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...

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.

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.

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...

Optimized maritime emergency resource allocation under dynamic demand.

Directory of Open Access Journals (Sweden)

Wenfen Zhang

Full Text Available Emergency resource is important for people evacuation and property rescue when accident occurs. The relief efforts could be promoted by a reasonable emergency resource allocation schedule in advance. As the marine environment is complicated and changeful, the place, type, severity of maritime accident is uncertain and stochastic, bringing about dynamic demand of emergency resource. Considering dynamic demand, how to make a reasonable emergency resource allocation schedule is challenging. The key problem is to determine the optimal stock of emergency resource for supplier centers to improve relief efforts. This paper studies the dynamic demand, and which is defined as a set. Then a maritime emergency resource allocation model with uncertain data is presented. Afterwards, a robust approach is developed and used to make sure that the resource allocation schedule performs well with dynamic demand. Finally, a case study shows that the proposed methodology is feasible in maritime emergency resource allocation. The findings could help emergency manager to schedule the emergency resource allocation more flexibly in terms of dynamic demand.

Resource allocation on the frontlines of public health preparedness and response: report of a summit on legal and ethical issues.

Science.gov (United States)

Barnett, Daniel J; Taylor, Holly A; Hodge, James G; Links, Jonathan M

2009-01-01

In the face of all-hazards preparedness challenges, local and state health department personnel have to date lacked a discrete set of legally and ethically informed public health principles to guide the distribution of scarce resources in crisis settings. To help address this gap, we convened a Summit of academic and practice experts to develop a set of principles for legally and ethically sound public health resource triage decision-making in emergencies. The invitation-only Summit, held in Washington, D.C., on June 29, 2006, assembled 20 experts from a combination of academic institutions and nonacademic leadership, policy, and practice settings. The Summit featured a tabletop exercise designed to highlight resource scarcity challenges in a public health infectious disease emergency. This exercise served as a springboard for Summit participants' subsequent identification of 10 public health emergency resource allocation principles through an iterative process. The final product of the Summit was a set of 10 principles to guide allocation decisions involving scarce resources in public health emergencies. The principles are grouped into three categories: obligations to community; balancing personal autonomy and community well-being/benefit; and good preparedness practice. The 10 Summit-derived principles represent an attempt to link law, ethics, and real-world public health emergency resource allocation practices, and can serve as a useful starting framework to guide further systematic approaches and future research on addressing public health resource scarcity in an all-hazards context.

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

S4HARA: System for HIV/AIDS resource allocation

Directory of Open Access Journals (Sweden)

Carter Michael W

2008-03-01

Full Text Available Abstract Background HIV/AIDS resource allocation decisions are influenced by political, social, ethical and other factors that are difficult to quantify. Consequently, quantitative models of HIV/AIDS resource allocation have had limited impact on actual spending decisions. We propose a decision-support System for HIV/AIDS Resource Allocation (S4HARA that takes into consideration both principles of efficient resource allocation and the role of non-quantifiable influences on the decision-making process for resource allocation. Methods S4HARA is a four-step spreadsheet-based model. The first step serves to identify the factors currently influencing HIV/AIDS allocation decisions. The second step consists of prioritizing HIV/AIDS interventions. The third step involves allocating the budget to the HIV/AIDS interventions using a rational approach. Decision-makers can select from several rational models of resource allocation depending on availability of data and level of complexity. The last step combines the results of the first and third steps to highlight the influencing factors that act as barriers or facilitators to the results suggested by the rational resource allocation approach. Actionable recommendations are then made to improve the allocation. We illustrate S4HARA in the context of a primary healthcare clinic in South Africa. Results The clinic offers six types of HIV/AIDS interventions and spends US$750,000 annually on these programs. Current allocation decisions are influenced by donors, NGOs and the government as well as by ethical and religious factors. Without additional funding, an optimal allocation of the total budget suggests that the portion allotted to condom distribution be increased from 1% to 15% and the portion allotted to prevention and treatment of opportunistic infections be increased from 43% to 71%, while allocation to other interventions should decrease. Conclusion Condom uptake at the clinic should be increased by

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...

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...

Discrete Painlevé equations: an integrability paradigm

International Nuclear Information System (INIS)

Grammaticos, B; Ramani, A

2014-01-01

In this paper we present a review of results on discrete Painlevé equations. We begin with an introduction which serves as a refresher on the continuous Painlevé equations. Next, in the first, main part of the paper, we introduce the discrete Painlevé equations, the various methods for their derivation, and their properties as well as their classification scheme. Along the way we present a brief summary of the two major discrete integrability detectors and of Quispel–Roberts–Thompson mapping, which plays a primordial role in the derivation of discrete Painlevé equations. The second part of the paper is more technical and focuses on the presentation of new results on what are called asymmetric discrete Painlevé equations. (comment)

Analysis of national allocation plans for the EU ETS

Energy Technology Data Exchange (ETDEWEB)

Zetterberg, Lars; Nilsson, Kristina; Aahman, Markus; Kumlin, Anna-Sofia; Birgersdotter, Lena

2004-08-01

The EU ETS is a Community-wide scheme established by Directive 2003/87/EC for trading allowances to cover the emissions of greenhouse gases from permitted installations. The first phase of the EU ETS runs from 1 January 2005 to 31 December 2007. Each Member State must develop a National Allocation Plan for the first phase stating: the total quantity of allowances that the Member State intends to issue during that phase; and how it proposes to distribute those allowances among the installations which are subject to the scheme In this paper twelve of the national allocation plans have been analysed and compared to the criteria stated in the EU Directive. The twelve allocation plans analysed are: the Austrian, the Danish, the Finnish, the German, the Irish, the Lithuanian, the Luxembourg, the Dutch, the Swedish, the British and the draft Flemish (Belgium) and Portuguese. Generally most countries have allocated generously to the trading sector. The allocation has often been based on future needs. For most sectors the allocation is higher than current emissions. Many countries will have to make large reductions in the non-trading sector and/or buy credits through JI- and CDM-projects in order to fulfil their commitment according to the EU burden sharing agreement of the Kyoto Protocol. In many of the allocation plans the emission reducing measures in the non-trading sector is poorly described and the credibility of the measures are hard to determine. Two sectors have been analysed in more detail, the energy and the mineral oil refining sectors. Figures presenting allocation vs. current emissions for those sectors are given for those countries where data was available in the allocation plan. The energy sector has been considered to have the best possibilities to pass on costs for the allowances to the consumers and hence the allocation to this sector is often more restricted than the allocation to other sectors. The mineral oil refining sector is more exposed to

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...

Discrete non-parametric kernel estimation for global sensitivity analysis

International Nuclear Information System (INIS)

Senga Kiessé, Tristan; Ventura, Anne

2016-01-01

This work investigates the discrete kernel approach for evaluating the contribution of the variance of discrete input variables to the variance of model output, via analysis of variance (ANOVA) decomposition. Until recently only the continuous kernel approach has been applied as a metamodeling approach within sensitivity analysis framework, for both discrete and continuous input variables. Now the discrete kernel estimation is known to be suitable for smoothing discrete functions. We present a discrete non-parametric kernel estimator of ANOVA decomposition of a given model. An estimator of sensitivity indices is also presented with its asymtotic convergence rate. Some simulations on a test function analysis and a real case study from agricultural have shown that the discrete kernel approach outperforms the continuous kernel one for evaluating the contribution of moderate or most influential discrete parameters to the model output. - Highlights: • We study a discrete kernel estimation for sensitivity analysis of a model. • A discrete kernel estimator of ANOVA decomposition of the model is presented. • Sensitivity indices are calculated for discrete input parameters. • An estimator of sensitivity indices is also presented with its convergence rate. • An application is realized for improving the reliability of environmental models.

From the continuous PV to discrete Painleve equations

International Nuclear Information System (INIS)

Tokihiro, T.; Grammaticos, B.; Ramani, A.

2002-01-01

We study the discrete transformations that are associated with the auto-Baecklund of the (continuous) P V equation. We show that several two-parameter discrete Painleve equations can be obtained as contiguity relations of P V . Among them we find the asymmetric d-P II equation which is a well-known form of discrete P III . The relation between the ternary P I (previously obtained through the discrete dressing approach) and P V is also established. A new discrete Painleve equation is also derived. (author)

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...

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...

Output-based allocation and investment in clean technologies

Energy Technology Data Exchange (ETDEWEB)

Rosendahl, Knut Einar; Storroesten, Halvor Briseid

2011-07-01

Allocation of emission allowances may affect firms' incentives to invest in clean technologies. In this paper we show that so-called output-based allocation tends to stimulate such investments as long as individual firms do not assume the regulator to tighten the allocation rule as a consequence of their investments. The explanation is that output-based allocation creates an implicit subsidy to the firms' output, which increases production, leads to a higher price of allowances, and thus increases the incentives to invest in clean technologies. On the other hand, if the firms expect the regulator to tighten the allocation rule after observing their clean technology investment, the firms' incentives to invest are moderated. If strong, this last effect may outweigh the enhanced investment incentives induced by increased output and higher allowance price. (Author)

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

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

Equitable fund allocation, an economical approach for sustainable waste load allocation.

Science.gov (United States)

Ashtiani, Elham Feizi; Niksokhan, Mohammad Hossein; Jamshidi, Shervin

2015-08-01

This research aims to study a novel approach for waste load allocation (WLA) to meet environmental, economical, and equity objectives, simultaneously. For this purpose, based on a simulation-optimization model developed for Haraz River in north of Iran, the waste loads are allocated according to discharge permit market. The non-dominated solutions are initially achieved through multiobjective particle swarm optimization (MOPSO). Here, the violation of environmental standards based on dissolved oxygen (DO) versus biochemical oxidation demand (BOD) removal costs is minimized to find economical total maximum daily loads (TMDLs). This can save 41% in total abatement costs in comparison with the conventional command and control policy. The BOD discharge permit market then increases the revenues to 45%. This framework ensures that the environmental limits are fulfilled but the inequity index is rather high (about 4.65). For instance, the discharge permit buyer may not be satisfied about the equity of WLA. Consequently, it is recommended that a third party or institution should be in charge of reallocating the funds. It means that the polluters which gain benefits by unfair discharges should pay taxes (or funds) to compensate the losses of other polluters. This intends to reduce the costs below the required values of the lowest inequity index condition. These compensations of equitable fund allocation (EFA) may help to reduce the dissatisfactions and develop WLA policies. It is concluded that EFA in integration with water quality trading (WQT) is a promising approach to meet the objectives.

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. 

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.

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

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.

Comparison of systems for memory allocation in the C programming language

OpenAIRE

Zavrtanik, Matej

2016-01-01

The bachelor thesis describes memory allocation. Work begins with description of mechanism, system calls and data structures used in memory allocators. Goals of memory allocation ares listed along with problems which must be avoided. Afterwards construction and allocating of popular memory allocators is described. Work ends with comparison of memory allocators based on time of execution of programs and memory usage, on which conclusion is based.

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.

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...

An integrable semi-discretization of the Boussinesq equation

International Nuclear Information System (INIS)

Zhang, Yingnan; Tian, Lixin

2016-01-01

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Discretization of 3d gravity in different polarizations

Science.gov (United States)

Dupuis, Maïté; Freidel, Laurent; Girelli, Florian

2017-10-01

We study the discretization of three-dimensional gravity with Λ =0 following the loop quantum gravity framework. In the process, we realize that different choices of polarization are possible. This allows us to introduce a new discretization based on the triad as opposed to the connection as in the standard loop quantum gravity framework. We also identify the classical nontrivial symmetries of discrete gravity, namely the Drinfeld double, given in terms of momentum maps. Another choice of polarization is given by the Chern-Simons formulation of gravity. Our framework also provides a new discretization scheme of Chern-Simons, which keeps track of the link between the continuum variables and the discrete ones. We show how the Poisson bracket we recover between the Chern-Simons holonomies allows us to recover the Goldman bracket. There is also a transparent link between the discrete Chern-Simons formulation and the discretization of gravity based on the connection (loop gravity) or triad variables (dual loop gravity).

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.

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.

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

Science.gov (United States)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2018-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

International Nuclear Information System (INIS)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2016-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

Energy Technology Data Exchange (ETDEWEB)

Mishchenko, Michael I., E-mail: michael.i.mishchenko@nasa.gov [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Dlugach, Janna M. [Main Astronomical Observatory of the National Academy of Sciences of Ukraine, 27 Zabolotny Str., 03680, Kyiv (Ukraine); Yurkin, Maxim A. [Voevodsky Institute of Chemical Kinetics and Combustion, SB RAS, Institutskaya str. 3, 630090 Novosibirsk (Russian Federation); Novosibirsk State University, Pirogova 2, 630090 Novosibirsk (Russian Federation); Bi, Lei [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Cairns, Brian [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Liu, Li [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Columbia University, 2880 Broadway, New York, NY 10025 (United States); Panetta, R. Lee [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Travis, Larry D. [NASA Goddard Institute for Space Studies, 2880 Broadway, New York, NY 10025 (United States); Yang, Ping [Department of Atmospheric Sciences, Texas A& M University, College Station, TX 77843 (United States); Zakharova, Nadezhda T. [Trinnovim LLC, 2880 Broadway, New York, NY 10025 (United States)

2016-05-16

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

First-Principles Modeling Of Electromagnetic Scattering By Discrete and Discretely Heterogeneous Random Media

Science.gov (United States)

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2016-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell's equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell- Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell-Lorentz equations, we trace the development of

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…

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.

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

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.

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

4G femtocells resource allocation and interference management

CERN Document Server

Zhang, Haijun; Wen, Xiangming

2014-01-01

This brief examines resource allocation and interference management for 4G femtocells. It introduces 4G femtocells in the context of 4G mobile networks and discusses related technical challenges in resource allocation and interference management. Topics include ant colony algorithm based downlink resource allocation, intelligent scheduling and power control, uplink and downlink for two-tier networks, quality of service (QoS) constraints and the cross-tier interference constraint. The authors present algorithms to alleviate common femtocell-related problems such as subchannel power allocation. The complexity of the proposed resource allocation algorithms is analyzed, and the effectiveness of the proposed algorithms is verified by simulations. This concise and practical book directly addresses common problems relating to femtocells and resource management. It serves as a useful tool for researchers in the field. Advanced-level students or professionals interested in femtocells and networks will also find the co...

Function allocation in distributed safeguards and security systems

International Nuclear Information System (INIS)

Barlich, G.L.

1991-01-01

Computerized distributed systems are being used to collect and manage data for activities such as nuclear materials accounting, process control, laboratory coordination, and security. Poor choices made in allocating functions to individual processors can make a system unusable by burdening machines with excessive network retrievals and updates. During system design phases, data allocation algorithms based on operation frequencies, field sizes, security information, and reliability requirements can be applied in sensitivity studies to mathematically ensure processor efficiency. The Los Alamos Network Design System (NDS) implements such an allocation algorithm. The authors analyzed a large, existing distributed system to test the cost functions and to compare actual network problems with NDS results. Several common configurations were also designed and studied using the software. From these studies, some basic principles for allocating functions emerged. In this paper recommendations for function allocation in generic systems and related design options are discussed

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.

Mittag-Leffler function for discrete fractional modelling

Directory of Open Access Journals (Sweden)

Guo-Cheng Wu

2016-01-01

Full Text Available From the difference equations on discrete time scales, this paper numerically investigates one discrete fractional difference equation in the Caputo delta’s sense which has an explicit solution in form of the discrete Mittag-Leffler function. The exact numerical values of the solutions are given in comparison with the truncated Mittag-Leffler function.

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

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

Markov modeling and discrete event simulation in health care: a systematic comparison.

Science.gov (United States)

Standfield, Lachlan; Comans, Tracy; Scuffham, Paul

2014-04-01

The aim of this study was to assess if the use of Markov modeling (MM) or discrete event simulation (DES) for cost-effectiveness analysis (CEA) may alter healthcare resource allocation decisions. A systematic literature search and review of empirical and non-empirical studies comparing MM and DES techniques used in the CEA of healthcare technologies was conducted. Twenty-two pertinent publications were identified. Two publications compared MM and DES models empirically, one presented a conceptual DES and MM, two described a DES consensus guideline, and seventeen drew comparisons between MM and DES through the authors' experience. The primary advantages described for DES over MM were the ability to model queuing for limited resources, capture individual patient histories, accommodate complexity and uncertainty, represent time flexibly, model competing risks, and accommodate multiple events simultaneously. The disadvantages of DES over MM were the potential for model overspecification, increased data requirements, specialized expensive software, and increased model development, validation, and computational time. Where individual patient history is an important driver of future events an individual patient simulation technique like DES may be preferred over MM. Where supply shortages, subsequent queuing, and diversion of patients through other pathways in the healthcare system are likely to be drivers of cost-effectiveness, DES modeling methods may provide decision makers with more accurate information on which to base resource allocation decisions. Where these are not major features of the cost-effectiveness question, MM remains an efficient, easily validated, parsimonious, and accurate method of determining the cost-effectiveness of new healthcare interventions.

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...

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...

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...

On the allocation of functions between human and machine

International Nuclear Information System (INIS)

Wirstad, J.

1979-09-01

The idea of allocating functions between human and machine was proceduralized early through aids like Fitts' List which describes the relative advantages of men and machines. Although the principle is clear, function allocation has never worked in practice. Some conditions for function allocations are discussed; adequate logic, a common man-machine system language, usable human engineering guides and data and professional habits and attitudes. Trends which will influence ergonomics procedures are described; influence from technology, increasing work environment requirements and user participation requirements. A procedural structure for human engineering or ergonomics in control system design is suggested. This does not include a separate function allocation activity but a number of activities, the result of which will be a systematic function allocation. A case study on ergonomics techniques for systematic function allocation in a control system is described in an appendix to the report. (author)

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.

Discretization of four types of Weyl group orbit functions

International Nuclear Information System (INIS)

Hrivnák, Jiří

2013-01-01

The discrete Fourier calculus of the four families of special functions, called C–, S–, S s – and S l -functions, is summarized. Functions from each of the four families of special functions are discretely orthogonal over a certain finite set of points. The generalizations of discrete cosine and sine transforms of one variable — the discrete S s – and S l -transforms of the group F 4 — are considered in detail required for their exploitation in discrete Fourier spectral methods. The continuous interpolations, induced by the discrete expansions, are presented

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

Human-Automation Allocations for Current Robotic Space Operations

Science.gov (United States)

Marquez, Jessica J.; Chang, Mai L.; Beard, Bettina L.; Kim, Yun Kyung; Karasinski, John A.

2018-01-01

Within the Human Research Program, one risk delineates the uncertainty surrounding crew working with automation and robotics in spaceflight. The Risk of Inadequate Design of Human and Automation/Robotic Integration (HARI) is concerned with the detrimental effects on crew performance due to ineffective user interfaces, system designs and/or functional task allocation, potentially compromising mission success and safety. Risk arises because we have limited experience with complex automation and robotics. One key gap within HARI, is the gap related to functional allocation. The gap states: We need to evaluate, develop, and validate methods and guidelines for identifying human-automation/robot task information needs, function allocation, and team composition for future long duration, long distance space missions. Allocations determine the human-system performance as it identifies the functions and performance levels required by the automation/robotic system, and in turn, what work the crew is expected to perform and the necessary human performance requirements. Allocations must take into account each of the human, automation, and robotic systems capabilities and limitations. Some functions may be intuitively assigned to the human versus the robot, but to optimize efficiency and effectiveness, purposeful role assignments will be required. The role of automation and robotics will significantly change in future exploration missions, particularly as crew becomes more autonomous from ground controllers. Thus, we must understand the suitability of existing function allocation methods within NASA as well as the existing allocations established by the few robotic systems that are operational in spaceflight. In order to evaluate future methods of robotic allocations, we must first benchmark the allocations and allocation methods that have been used. We will present 1) documentation of human-automation-robotic allocations in existing, operational spaceflight systems; and 2) To

Detecting non-binomial sex allocation when developmental mortality operates.

Science.gov (United States)

Wilkinson, Richard D; Kapranas, Apostolos; Hardy, Ian C W

2016-11-07

Optimal sex allocation theory is one of the most intricately developed areas of evolutionary ecology. Under a range of conditions, particularly under population sub-division, selection favours sex being allocated to offspring non-randomly, generating non-binomial variances of offspring group sex ratios. Detecting non-binomial sex allocation is complicated by stochastic developmental mortality, as offspring sex can often only be identified on maturity with the sex of non-maturing offspring remaining unknown. We show that current approaches for detecting non-binomiality have limited ability to detect non-binomial sex allocation when developmental mortality has occurred. We present a new procedure using an explicit model of sex allocation and mortality and develop a Bayesian model selection approach (available as an R package). We use the double and multiplicative binomial distributions to model over- and under-dispersed sex allocation and show how to calculate Bayes factors for comparing these alternative models to the null hypothesis of binomial sex allocation. The ability to detect non-binomial sex allocation is greatly increased, particularly in cases where mortality is common. The use of Bayesian methods allows for the quantification of the evidence in favour of each hypothesis, and our modelling approach provides an improved descriptive capability over existing approaches. We use a simulation study to demonstrate substantial improvements in power for detecting non-binomial sex allocation in situations where current methods fail, and we illustrate the approach in real scenarios using empirically obtained datasets on the sexual composition of groups of gregarious parasitoid wasps. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

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

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.

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.)

Cost allocation policy review: options and preferred alternatives

Energy Technology Data Exchange (ETDEWEB)

NONE

2010-10-15

This policy review of the consultation process on the electricity cost allocation issue is presented with specific cost allocation policy issues addressed herein, such as: the new microFIT rate, accounting changes and the transition to IFRS, and review of allocating costs to load displacement generation. This report gave the current situation for all these issues, previous work, issues, viable options for dealing with these issues and the preferred alternatives.

30 CFR 220.014 - Allocation of joint costs and credits.

Science.gov (United States)

2010-07-01

... allocation principles apply in allocating joint costs: (1) G & G. G & G shall be allocated on a line mile per... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Allocation of joint costs and credits. 220.014... MANAGEMENT ACCOUNTING PROCEDURES FOR DETERMINING NET PROFIT SHARE PAYMENT FOR OUTER CONTINENTAL SHELF OIL AND...

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).

An integrable semi-discretization of the Boussinesq equation

Energy Technology Data Exchange (ETDEWEB)

Zhang, Yingnan, E-mail: ynzhang@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Tian, Lixin, E-mail: tianlixin@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Nonlinear Scientific Research Center, Jiangsu University, Zhenjiang, Jiangsu (China)

2016-10-23

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

A 2+1 non-isospectral discrete integrable system and its discrete integrable coupling system

International Nuclear Information System (INIS)

Yu Fajun; Zhang Hongqing

2006-01-01

In this Letter by considering a (2+1)-dimensional discrete non-isospectral linear problem, a new (2+1)-dimensional integrable lattice hierarchy is constructed. It shows that generalization of the Blaszak-Marciniak lattice hierarchy can be obtained as a reduction. Then an extended algebraic system X-bar of X is presented, from which the integrable coupling system of the (2+1)-dimensional discrete non-isospectral Blaszak-Marciniak lattice equations are obtained

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.

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.

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

Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks

Science.gov (United States)

Pandremmenou, Katerina; Kondi, Lisimachos P.; Parsopoulos, Konstantinos E.

2011-01-01

In this paper, we propose a scheme for the optimal allocation of power, source coding rate, and channel coding rate for each of the nodes of a wireless Direct Sequence Code Division Multiple Access (DS-CDMA) visual sensor network. The optimization is quality-driven, i.e. the received quality of the video that is transmitted by the nodes is optimized. The scheme takes into account the fact that the sensor nodes may be imaging scenes with varying levels of motion. Nodes that image low-motion scenes will require a lower source coding rate, so they will be able to allocate a greater portion of the total available bit rate to channel coding. Stronger channel coding will mean that such nodes will be able to transmit at lower power. This will both increase battery life and reduce interference to other nodes. Two optimization criteria are considered. One that minimizes the average video distortion of the nodes and one that minimizes the maximum distortion among the nodes. The transmission powers are allowed to take continuous values, whereas the source and channel coding rates can assume only discrete values. Thus, the resulting optimization problem lies in the field of mixed-integer optimization tasks and is solved using Particle Swarm Optimization. Our experimental results show the importance of considering the characteristics of the video sequences when determining the transmission power, source coding rate and channel coding rate for the nodes of the visual sensor network.

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...

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

Designing equitable antiretroviral allocation strategies in resource-constrained countries.

Directory of Open Access Journals (Sweden)

David P Wilson

2005-02-01

Full Text Available Recently, a global commitment has been made to expand access to antiretrovirals (ARVs in the developing world. However, in many resource-constrained countries the number of individuals infected with HIV in need of treatment will far exceed the supply of ARVs, and only a limited number of health-care facilities (HCFs will be available for ARV distribution. Deciding how to allocate the limited supply of ARVs among HCFs will be extremely difficult. Resource allocation decisions can be made on the basis of many epidemiological, ethical, or preferential treatment priority criteria.Here we use operations research techniques, and we show how to determine the optimal strategy for allocating ARVs among HCFs in order to satisfy the equitable criterion that each individual infected with HIV has an equal chance of receiving ARVs. We present a novel spatial mathematical model that includes heterogeneity in treatment accessibility. We show how to use our theoretical framework, in conjunction with an equity objective function, to determine an optimal equitable allocation strategy (OEAS for ARVs in resource-constrained regions. Our equity objective function enables us to apply the egalitarian principle of equity with respect to access to health care. We use data from the detailed ARV rollout plan designed by the government of South Africa to determine an OEAS for the province of KwaZulu-Natal. We determine the OEAS for KwaZulu-Natal, and we then compare this OEAS with two other ARV allocation strategies: (i allocating ARVs only to Durban (the largest urban city in KwaZulu-Natal province and (ii allocating ARVs equally to all available HCFs. In addition, we compare the OEAS to the current allocation plan of the South African government (which is based upon allocating ARVs to 17 HCFs. We show that our OEAS significantly improves equity in treatment accessibility in comparison with these three ARV allocation strategies. We also quantify how the size of the

Integrable lattices and their sublattices: From the discrete Moutard (discrete Cauchy-Riemann) 4-point equation to the self-adjoint 5-point scheme

International Nuclear Information System (INIS)

Doliwa, A.; Grinevich, P.; Nieszporski, M.; Santini, P. M.

2007-01-01

We present the sublattice approach, a procedure to generate, from a given integrable lattice, a sublattice which inherits its integrability features. We consider, as illustrative example of this approach, the discrete Moutard 4-point equation and its sublattice, the self-adjoint 5-point scheme on the star of the square lattice, which are relevant in the theory of the integrable discrete geometries and in the theory of discrete holomorphic and harmonic functions (in this last context, the discrete Moutard equation is called discrete Cauchy-Riemann equation). Therefore an integrable, at one energy, discretization of elliptic two-dimensional operators is considered. We use the sublattice point of view to derive, from the Darboux transformations and superposition formulas of the discrete Moutard equation, the Darboux transformations and superposition formulas of the self-adjoint 5-point scheme. We also construct, from algebro-geometric solutions of the discrete Moutard equation, algebro-geometric solutions of the self-adjoint 5-point scheme. In particular, we show that the corresponding restrictions on the finite-gap data are of the same type as those for the fixed energy problem for the two-dimensional Schroedinger operator. We finally use these solutions to construct explicit examples of discrete holomorphic and harmonic functions, as well as examples of quadrilateral surfaces in R 3

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

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

48 CFR 1631.203-70 - Allocation techniques.

Science.gov (United States)

2010-10-01

... shall consistently apply the methods and techniques established to classify direct and indirect costs... meant to be exhaustive, but rather are examples of allocation methods that may be acceptable under... 48 Federal Acquisition Regulations System 6 2010-10-01 2010-10-01 true Allocation techniques. 1631...

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

Mechanisms and direction of allocation bias in randomised clinical trials

DEFF Research Database (Denmark)

Paludan-Müller, Asger; Teindl Laursen, David Ruben; Hróbjartsson, A.

2016-01-01

clinical trials. Methods: Two systematic reviews and a theoretical analysis. We conducted one systematic review of empirical studies of motives/methods for deciphering patient allocation sequences; and another review of methods publications commenting on allocation bias. We theoretically analysed...... the mechanisms of allocation bias and hypothesised which main factors predicts its direction. Results: Three empirical studies addressed motives/methods for deciphering allocation sequences. Main motives included ensuring best care for patients and ensuring best outcome for the trial. Main methods included...... various manipulations with randomisation envelopes. Out of 57 methods publications 11 (19 %) mentioned explicitly that allocation bias can go in either direction. We hypothesised that the direction of allocation bias is mainly decided by the interaction between the patient allocators’ motives...

How Triage Nurses Use Discretion: a Literature Review

Directory of Open Access Journals (Sweden)

Lars Emil Fagernes Johannessen

2016-02-01

Full Text Available Discretion is quintessential for professional work. This review aims to understand how nurses use discretion when they perform urgency assessments in emergency departments with formalised triage systems—systems that are intended to reduce nurses’ use of discretion. Because little research has dealt explicitly with this topic, this review addresses the discretionary aspects of triage by reinterpreting qualitative studies of how triage nurses perform urgency assessments. The review shows (a how inexhaustive guidelines and a hectic work environment are factors that necessitate nurses’ use of discretion and (b how nurses reason within this discretionary space by relying on their experience and intuition, judging patients according to criteria such as appropriateness and believability, and creating urgency ratings together with their patients. The review also offers a synthesis of the findings’ discretionary aspects and suggests a new interactionist dimension of discretion.Keywords: Triage, discretion, emergency department, meta-ethnography, review, decision-making

Application of an efficient Bayesian discretization method to biomedical data

Directory of Open Access Journals (Sweden)

Gopalakrishnan Vanathi

2011-07-01

Full Text Available Abstract Background Several data mining methods require data that are discrete, and other methods often perform better with discrete data. We introduce an efficient Bayesian discretization (EBD method for optimal discretization of variables that runs efficiently on high-dimensional biomedical datasets. The EBD method consists of two components, namely, a Bayesian score to evaluate discretizations and a dynamic programming search procedure to efficiently search the space of possible discretizations. We compared the performance of EBD to Fayyad and Irani's (FI discretization method, which is commonly used for discretization. Results On 24 biomedical datasets obtained from high-throughput transcriptomic and proteomic studies, the classification performances of the C4.5 classifier and the naïve Bayes classifier were statistically significantly better when the predictor variables were discretized using EBD over FI. EBD was statistically significantly more stable to the variability of the datasets than FI. However, EBD was less robust, though not statistically significantly so, than FI and produced slightly more complex discretizations than FI. Conclusions On a range of biomedical datasets, a Bayesian discretization method (EBD yielded better classification performance and stability but was less robust than the widely used FI discretization method. The EBD discretization method is easy to implement, permits the incorporation of prior knowledge and belief, and is sufficiently fast for application to high-dimensional data.

14 CFR 1214.113 - Allocation of risk.

Science.gov (United States)

2010-01-01

... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Allocation of risk. 1214.113 Section 1214.113 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION SPACE FLIGHT General....113 Allocation of risk. The U.S. Government will assume no risk for damages to the customer resulting...

48 CFR 8.705-3 - Allocation process.

Science.gov (United States)

2010-10-01

... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Allocation process. 8.705-3 Section 8.705-3 Federal Acquisition Regulations System FEDERAL ACQUISITION REGULATION ACQUISITION... Are Blind or Severely Disabled 8.705-3 Allocation process. (a) When the direct order process has not...

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,...

Work-family conflict and self-discrepant time allocation at work.

Science.gov (United States)

Dahm, Patricia C; Glomb, Theresa M; Manchester, Colleen Flaherty; Leroy, Sophie

2015-05-01

We examine the relationships between work-to-family conflict, time allocation across work activities, and the outcomes of work satisfaction, well-being, and salary in the context of self-regulation and self-discrepancy theories. We posit work-to-family conflict is associated with self-discrepant time allocation such that employees with higher levels of work-to-family conflict are likely to allocate less time than preferred to work activities that require greater self-regulatory resources (e.g., tasks that are complex, or those with longer term goals that delay rewards and closure) and allocate more time than preferred to activities that demand fewer self-regulatory resources or are replenishing (e.g., those that provide closure or are prosocial). We suggest this self-discrepant time allocation (actual vs. preferred time allocation) is one mechanism by which work-to-family conflict leads to negative employee consequences (Allen, Herst, Bruck, & Sutton, 2000; Mesmer-Magnus & Viswesvaran, 2005). Using polynomial regression and response surface methodology, we find that discrepancies between actual and preferred time allocations to work activities negatively relate to work satisfaction, psychological well-being, and physical well-being. Self-discrepant time allocation mediates the relationship between work-to-family conflict and work satisfaction and well-being, while actual time allocation (rather than the discrepancy) mediates the relationship between work-to-family conflict and salary. We find that women are more likely than men to report self-discrepant time allocations as work-to-family conflict increases. (c) 2015 APA, all rights reserved.

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.

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

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.

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...

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.

Discrete convolution-operators and radioactive disintegration. [Numerical solution

Energy Technology Data Exchange (ETDEWEB)

Kalla, S L; VALENTINUZZI, M E [UNIVERSIDAD NACIONAL DE TUCUMAN (ARGENTINA). FACULTAD DE CIENCIAS EXACTAS Y TECNOLOGIA

1975-08-01

The basic concepts of discrete convolution and discrete convolution-operators are briefly described. Then, using the discrete convolution - operators, the differential equations associated with the process of radioactive disintegration are numerically solved. The importance of the method is emphasized to solve numerically, differential and integral equations.

Periodic, quasiperiodic and chaotic discrete breathers in a parametrical driven two-dimensional discrete diatomic Klein–Gordon lattice

International Nuclear Information System (INIS)

Quan, Xu; Qiang, Tian

2009-01-01

We study a two-dimensional (2D) diatomic lattice of anharmonic oscillators with only quartic nearest-neighbor interactions, in which discrete breathers (DBs) can be explicitly constructed by an exact separation of their time and space dependence. DBs can stably exist in the 2D discrete diatomic Klein–Gordon lattice with hard and soft on-site potentials. When a parametric driving term is introduced in the factor multiplying the harmonic part of the on-site potential of the system, we can obtain the stable quasiperiodic discrete breathers (QDBs) and chaotic discrete breathers (CDBs) by changing the amplitude of the driver. But the DBs and QDBs with symmetric and anti-symmetric profiles that are centered at a heavy atom are more stable than at a light atom, because the frequencies of the DBs and QDBs centered at a heavy atom are lower than those centered at a light atom

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

47 CFR 69.502 - Base factor allocation.

Science.gov (United States)

2010-10-01

... 47 Telecommunication 3 2010-10-01 2010-10-01 false Base factor allocation. 69.502 Section 69.502... Segregation of Common Line Element Revenue Requirement § 69.502 Base factor allocation. Projected revenues from the following shall be deducted from the base factor portion to determine the amount that is...

Discrete-Time Nonlinear Control of VSC-HVDC System

Directory of Open Access Journals (Sweden)

TianTian Qian

2015-01-01

Full Text Available Because VSC-HVDC is a kind of strong nonlinear, coupling, and multi-input multioutput (MIMO system, its control problem is always attracting much attention from scholars. And a lot of papers have done research on its control strategy in the continuous-time domain. But the control system is implemented through the computer discrete sampling in practical engineering. It is necessary to study the mathematical model and control algorithm in the discrete-time domain. The discrete mathematical model based on output feedback linearization and discrete sliding mode control algorithm is proposed in this paper. And to ensure the effectiveness of the control system in the quasi sliding mode state, the fast output sampling method is used in the output feedback. The results from simulation experiment in MATLAB/SIMULINK prove that the proposed discrete control algorithm can make the VSC-HVDC system have good static, dynamic, and robust characteristics in discrete-time domain.

Twelve fundamental life histories evolving through allocation-dependent fecundity and survival.

Science.gov (United States)

Johansson, Jacob; Brännström, Åke; Metz, Johan A J; Dieckmann, Ulf

2018-03-01

An organism's life history is closely interlinked with its allocation of energy between growth and reproduction at different life stages. Theoretical models have established that diminishing returns from reproductive investment promote strategies with simultaneous investment into growth and reproduction (indeterminate growth) over strategies with distinct phases of growth and reproduction (determinate growth). We extend this traditional, binary classification by showing that allocation-dependent fecundity and mortality rates allow for a large diversity of optimal allocation schedules. By analyzing a model of organisms that allocate energy between growth and reproduction, we find twelve types of optimal allocation schedules, differing qualitatively in how reproductive allocation increases with body mass. These twelve optimal allocation schedules include types with different combinations of continuous and discontinuous increase in reproduction allocation, in which phases of continuous increase can be decelerating or accelerating. We furthermore investigate how this variation influences growth curves and the expected maximum life span and body size. Our study thus reveals new links between eco-physiological constraints and life-history evolution and underscores how allocation-dependent fitness components may underlie biological diversity.

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.

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

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...

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.

Identification of parameters of discrete-continuous models

International Nuclear Information System (INIS)

Cekus, Dawid; Warys, Pawel

2015-01-01

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible

Identification of parameters of discrete-continuous models

Energy Technology Data Exchange (ETDEWEB)

Cekus, Dawid, E-mail: cekus@imipkm.pcz.pl; Warys, Pawel, E-mail: warys@imipkm.pcz.pl [Institute of Mechanics and Machine Design Foundations, Czestochowa University of Technology, Dabrowskiego 73, 42-201 Czestochowa (Poland)

2015-03-10

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible.

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…

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

A discrete transition zone organizes the topological and regulatory autonomy of the adjacent tfap2c and bmp7 genes.

Directory of Open Access Journals (Sweden)

Taro Tsujimura

2015-01-01

Full Text Available Despite the well-documented role of remote enhancers in controlling developmental gene expression, the mechanisms that allocate enhancers to genes are poorly characterized. Here, we investigate the cis-regulatory organization of the locus containing the Tfap2c and Bmp7 genes in vivo, using a series of engineered chromosomal rearrangements. While these genes lie adjacent to one another, we demonstrate that they are independently regulated by distinct sets of enhancers, which in turn define non-overlapping regulatory domains. Chromosome conformation capture experiments reveal a corresponding partition of the locus in two distinct structural entities, demarcated by a discrete transition zone. The impact of engineered chromosomal rearrangements on the topology of the locus and the resultant gene expression changes indicate that this transition zone functionally organizes the structural partition of the locus, thereby defining enhancer-target gene allocation. This partition is, however, not absolute: we show that it allows competing interactions across it that may be non-productive for the competing gene, but modulate expression of the competed one. Altogether, these data highlight the prime role of the topological organization of the genome in long-distance regulation of gene expression.

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 ...

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…

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

DETERMININGS OF FARM WORK ALLOCATION IN BRAZILIAN REGIONS

Directory of Open Access Journals (Sweden)

Filipe de Morais Cangussu Pessoa

2013-03-01

Full Text Available The aim of this paper was to analyze the determinings of farm work allocation in Brazilian regions, based on micro data of National Household Sample Survey 2009. For that, the empirical procedure consisted in the use of two models: Confirmatory Factor Analysis and the Logit Model. The model Confirmatory Factor Analysis showed good fit and defined two latent variables: qualification and income. As to the Logit Model, the results showed that the fact of a man living in rural areas increases the likelihood of being allocated in farm work, however if he is white this probability decrease. Besides, the variables qualification and income have a negative relation with farm work allocation, being the Midwest region that contributed most for people being allocated in farm work.

Downlink resource allocation for multichannel TDMA visible light communications

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz; Amin, Osama; Chaaban, Anas; Alouini, Mohamed-Slim

2017-01-01

Optical wireless communications (OWC) in general and resource allocation in OWC networks particularly have gained lots of attention recently. In this work, we consider the resource allocation problem of a visible light communication downlink transmission system based on time division multiple access with the objective of maximizing spectral efficiency (SE). As for the operational conditions, we impose constraints on the average optical intensity, the energy consumption and the quality-of-service. To solve the non-convex problem, we transform the objective function into a difference of concave functions by solving a second order differential inequality. Then, we propose a low-complexity algorithm to solve the resource allocation problem. Finally, we show by simulations the SE performance gains achieved by optimizing the power allocation over equal power allocation in the considered system. Numerical results show the SE gains achieved by using this solution.

Downlink resource allocation for multichannel TDMA visible light communications

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz

2017-05-12

Optical wireless communications (OWC) in general and resource allocation in OWC networks particularly have gained lots of attention recently. In this work, we consider the resource allocation problem of a visible light communication downlink transmission system based on time division multiple access with the objective of maximizing spectral efficiency (SE). As for the operational conditions, we impose constraints on the average optical intensity, the energy consumption and the quality-of-service. To solve the non-convex problem, we transform the objective function into a difference of concave functions by solving a second order differential inequality. Then, we propose a low-complexity algorithm to solve the resource allocation problem. Finally, we show by simulations the SE performance gains achieved by optimizing the power allocation over equal power allocation in the considered system. Numerical results show the SE gains achieved by using this solution.

Finite-dimensional reductions of the discrete Toda chain

International Nuclear Information System (INIS)

Kazakova, T G

2004-01-01

The problem of construction of integrable boundary conditions for the discrete Toda chain is considered. The restricted chains for properly chosen closure conditions are reduced to the well-known discrete Painleve equations dP III , dP V , dP VI . Lax representations for these discrete Painleve equations are found

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....

Numerical Simulation of Antennae by Discrete Exterior Calculus

International Nuclear Information System (INIS)

Xie Zheng; Ye Zheng; Ma Yujie

2009-01-01

Numerical simulation of antennae is a topic in computational electromagnetism, which is concerned with the numerical study of Maxwell equations. By discrete exterior calculus and the lattice gauge theory with coefficient R, we obtain the Bianchi identity on prism lattice. By defining an inner product of discrete differential forms, we derive the source equation and continuity equation. Those equations compose the discrete Maxwell equations in vacuum case on discrete manifold, which are implemented on Java development platform to simulate the Gaussian pulse radiation on antennaes. (electromagnetism, optics, acoustics, heat transfer, classical mechanics, and fluid dynamics)

Adaptive Control Allocation for Fault Tolerant Overactuated Autonomous Vehicles

Science.gov (United States)

2007-11-01

Tolerant Overactuated Autonomous Vehicles Casavola, A.; Garone, E. (2007) Adaptive Control Allocation for Fault Tolerant Overactuated Autonomous ...Adaptive Control Allocation for Fault Tolerant Overactuated Autonomous Vehicles 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6...Tolerant Overactuated Autonomous Vehicles 3.2 - 2 RTO-MP-AVT-145 UNCLASSIFIED/UNLIMITED Control allocation problem (CAP) - Given a virtual input v(t

Stochastic Resource Allocation for Energy-Constrained Systems

Directory of Open Access Journals (Sweden)

Sachs DanielGrobe

2009-01-01

Full Text Available Battery-powered wireless systems running media applications have tight constraints on energy, CPU, and network capacity, and therefore require the careful allocation of these limited resources to maximize the system's performance while avoiding resource overruns. Usually, resource-allocation problems are solved using standard knapsack-solving techniques. However, when allocating conservable resources like energy (which unlike CPU and network remain available for later use if they are not used immediately knapsack solutions suffer from excessive computational complexity, leading to the use of suboptimal heuristics. We show that use of Lagrangian optimization provides a fast, elegant, and, for convex problems, optimal solution to the allocation of energy across applications as they enter and leave the system, even if the exact sequence and timing of their entrances and exits is not known. This permits significant increases in achieved utility compared to heuristics in common use. As our framework requires only a stochastic description of future workloads, and not a full schedule, we also significantly expand the scope of systems that can be optimized.

A Variational Approach to Perturbed Discrete Anisotropic Equations

Directory of Open Access Journals (Sweden)

Amjad Salari

2016-01-01

Full Text Available We continue the study of discrete anisotropic equations and we will provide new multiplicity results of the solutions for a discrete anisotropic equation. We investigate the existence of infinitely many solutions for a perturbed discrete anisotropic boundary value problem. The approach is based on variational methods and critical point theory.

Availability Allocation of Networked Systems Using Markov Model and Heuristics Algorithm

Directory of Open Access Journals (Sweden)

Ruiying Li

2014-01-01

Full Text Available It is a common practice to allocate the system availability goal to reliability and maintainability goals of components in the early design phase. However, the networked system availability is difficult to be allocated due to its complex topology and multiple down states. To solve these problems, a practical availability allocation method is proposed. Network reliability algebraic methods are used to derive the availability expression of the networked topology on the system level, and Markov model is introduced to determine that on the component level. A heuristic algorithm is proposed to obtain the reliability and maintainability allocation values of components. The principles applied in the AGREE reliability allocation method, proposed by the Advisory Group on Reliability of Electronic Equipment, and failure rate-based maintainability allocation method persist in our allocation method. A series system is used to verify the new algorithm, and the result shows that the allocation based on the heuristic algorithm is quite accurate compared to the traditional one. Moreover, our case study of a signaling system number 7 shows that the proposed allocation method is quite efficient for networked systems.

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.

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...

Port entry arrangements

International Nuclear Information System (INIS)

Chicken, J.C.; King, M.A.

1978-01-01

The objective of the paper is to describe the safety scheme port authorities should establish to deal with any contingency that may result from the visit of a nuclear powered ship. The safety scheme should be devised to cover both normal operation and any accident conditions that could arise while the ship is in port. The paper is divided into three parts. The three parts being: background information, general instructions, and emergency procedures. The background information will describe the nature of the hazards a port authority has to be prepared to deal with, and the philosophical basis for a berthing policy. In the part dealing with general instructions the objective of the safety scheme will be described. Also this part will describe the composition of the Port Safety Panel, allocation of responsibilities, passage and berthing arrangements, general safety precautions, records required, and rescue arrangements. In the part dealing with emergency procedures the role of: the Ship's Master, Harbour Authorities, Local Police, and local Health Services are discussed. As an Appendix to the paper a copy of the safety scheme that has been devised for visits of nuclear merchant ships to Southampton is given

Lax Pairs for Discrete Integrable Equations via Darboux Transformations

International Nuclear Information System (INIS)

Cao Ce-Wen; Zhang Guang-Yao

2012-01-01

A method is developed to construct discrete Lax pairs using Darboux transformations. More kinds of Lax pairs are found for some newly appeared discrete integrable equations, including the H1, the special H3 and the Q1 models in the Adler—Bobenko—Suris list and the closely related discrete and semi-discrete pKdV, pMKdV, SG and Liouville equations. (general)

Graph-cut based discrete-valued image reconstruction.

Science.gov (United States)

Tuysuzoglu, Ahmet; Karl, W Clem; Stojanovic, Ivana; Castañòn, David; Ünlü, M Selim

2015-05-01

Efficient graph-cut methods have been used with great success for labeling and denoising problems occurring in computer vision. Unfortunately, the presence of linear image mappings has prevented the use of these techniques in most discrete-amplitude image reconstruction problems. In this paper, we develop a graph-cut based framework for the direct solution of discrete amplitude linear image reconstruction problems cast as regularized energy function minimizations. We first analyze the structure of discrete linear inverse problem cost functions to show that the obstacle to the application of graph-cut methods to their solution is the variable mixing caused by the presence of the linear sensing operator. We then propose to use a surrogate energy functional that overcomes the challenges imposed by the sensing operator yet can be utilized efficiently in existing graph-cut frameworks. We use this surrogate energy functional to devise a monotonic iterative algorithm for the solution of discrete valued inverse problems. We first provide experiments using local convolutional operators and show the robustness of the proposed technique to noise and stability to changes in regularization parameter. Then we focus on nonlocal, tomographic examples where we consider limited-angle data problems. We compare our technique with state-of-the-art discrete and continuous image reconstruction techniques. Experiments show that the proposed method outperforms state-of-the-art techniques in challenging scenarios involving discrete valued unknowns.

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis

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

Efficient Power Allocation for Video over Superposition Coding

KAUST Repository

Lau, Chun Pong

2013-03-01

In this paper we consider a wireless multimedia system by mapping scalable video coded (SVC) bit stream upon superposition coded (SPC) signals, referred to as (SVC-SPC) architecture. Empirical experiments using a software-defined radio(SDR) emulator 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 should be approximately four times higher than the power allocated to the enhancement layer.

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)

Modelling information exchange in worker-queen conflict over sex allocation

NARCIS (Netherlands)

Pen, I.R.; Taylor, P.D.

2005-01-01

We investigate the conflict between queen and worker over sex allocation, specifically the allocation of the queen's eggs between workers and reproductives and the allocation of the reproductive eggs between male and female. In contrast to previous models, we allow workers to observe and use

7 CFR 761.204 - Methods of allocating funds to State Offices.

Science.gov (United States)

2010-01-01

... 7 Agriculture 7 2010-01-01 2010-01-01 false Methods of allocating funds to State Offices. 761.204... Funds to State Offices § 761.204 Methods of allocating funds to State Offices. FO and OL loan funds are... allocation, if the Agency cannot adequately meet program objectives with a formula allocation. The National...

Manifestly gauge invariant discretizations of the Schrödinger equation

International Nuclear Information System (INIS)

Halvorsen, Tore Gunnar; Kvaal, Simen

2012-01-01

Grid-based discretizations of the time dependent Schrödinger equation coupled to an external magnetic field are converted to manifest gauge invariant discretizations. This is done using generalizations of ideas used in classical lattice gauge theory, and the process defined is applicable to a large class of discretized differential operators. In particular, popular discretizations such as pseudospectral discretizations using the fast Fourier transform can be transformed to gauge invariant schemes. Also generic gauge invariant versions of generic time integration methods are considered, enabling completely gauge invariant calculations of the time dependent Schrödinger equation. Numerical examples illuminating the differences between a gauge invariant discretization and conventional discretization procedures are also presented. -- Highlights: ► We investigate the Schrödinger equation coupled to an external magnetic field. ► Any grid-based discretization is made trivially gauge invariant. ► An extension of classical lattice gauge theory.

Energy-Efficient Power Allocation for MIMO-SVD Systems

KAUST Repository

Sboui, Lokman; Rezki, Zouheir; Alouini, Mohamed-Slim

2017-01-01

In this paper, we address the problem of energyefficient power allocation in MIMO systems. In fact, the widely adopted water-filling power allocation does not ensure the maximization of the energy efficiency (EE). Since the EE maximization is a non

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

Mathematical aspects of the discrete space-time hypothesis

International Nuclear Information System (INIS)

Sardanashvili, G.A.

1979-01-01

A hypothesis of a microcosm space discreteness is considered from the theoretical-mathematical point of view. The type of topological spaces, which formalizes representations on the discrete space-time, is determined. It is explained, how these spaces arise in physical models. The physical task, in which the discrete space could arise as a version of its solution, is considered. It is shown that the discrete structure of space can arise with a certain interaction type in the system, for example, with its considerable self-shielding, which can take place, in particular, in the particles or in the cosmological and astrophysical singularities

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...

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 ...

Children's self-allocation and use of classroom curricular time.

Science.gov (United States)

Ingram, J; Worrall, N

1992-02-01

A class of 9-10 year-olds (N = 12) in a British primary school were observed as it moved over a one-year period through three types of classroom environment, traditional directive, transitional negotiative and established negotiative. Each environment offered the children a differing relationship with curricular time, its control and allocation, moving from teacher-allocated time to child allocation. Pupil self-report and classroom observation indicated differences in the balance of curricular spread and allocated time on curricular subject in relation to the type of classroom organisation and who controlled classroom time. These differences were at both class and individual child level. The established negotiative environment recorded the most equitable curricular balance, traditional directive the least. While individual children responded differently within and across the three classroom environments, the established negotiative where time was under child control recorded preference for longer activity periods compared to where the teacher controlled time allocations.

Comparing methodologies for the allocation of overhead and capital costs to hospital services.

Science.gov (United States)

Tan, Siok Swan; van Ineveld, Bastianus Martinus; Redekop, William Ken; Hakkaart-van Roijen, Leona

2009-06-01

Typically, little consideration is given to the allocation of indirect costs (overheads and capital) to hospital services, compared to the allocation of direct costs. Weighted service allocation is believed to provide the most accurate indirect cost estimation, but the method is time consuming. To determine whether hourly rate, inpatient day, and marginal mark-up allocation are reliable alternatives for weighted service allocation. The cost approaches were compared independently for appendectomy, hip replacement, cataract, and stroke in representative general hospitals in The Netherlands for 2005. Hourly rate allocation and inpatient day allocation produce estimates that are not significantly different from weighted service allocation. Hourly rate allocation may be a strong alternative to weighted service allocation for hospital services with a relatively short inpatient stay. The use of inpatient day allocation would likely most closely reflect the indirect cost estimates obtained by the weighted service method.

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.)

Modeling the multi-scale mechanisms of macromolecular resource allocation

DEFF Research Database (Denmark)

Yang, Laurence; Yurkovich, James T; King, Zachary A

2018-01-01

As microbes face changing environments, they dynamically allocate macromolecular resources to produce a particular phenotypic state. Broad 'omics' data sets have revealed several interesting phenomena regarding how the proteome is allocated under differing conditions, but the functional consequen...... and detail how mathematical models have aided in our understanding of these processes. Ultimately, such modeling efforts have helped elucidate the principles of proteome allocation and hold promise for further discovery....

The weak-scale hierarchy and discrete symmetries

International Nuclear Information System (INIS)

Haba, Naoyuki; Matsuoka, Takeo; Hattori, Chuichiro; Matsuda, Masahisa; Mochinaga, Daizo.

1996-01-01

In the underlying Planck scale theory, we introduce a certain type of discrete symmetry, which potentially brings the stability of the weak-scale hierarchy under control. Under the discrete symmetry the μ-problem and the tadpole problem can be solved simultaneously without relying on some fine-tuning of parameters. Instead, it is required that doublet Higgs and color-triplet Higgs fields reside in different irreducible representations of the gauge symmetry group at the Planck scale and that they have distinct charges of the discrete symmetry group. (author)

77 FR 26698 - Allocation of Mortgage Insurance Premiums

Science.gov (United States)

2012-05-07

... Allocation of Mortgage Insurance Premiums AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Final... explain how to allocate prepaid qualified mortgage insurance premiums to determine the amount of the... Act of 2010. The regulations affect taxpayers who pay prepaid qualified mortgage insurance premiums...

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.

Network Science Research Laboratory (NSRL) Discrete Event Toolkit

Science.gov (United States)

2016-01-01

ARL-TR-7579 ● JAN 2016 US Army Research Laboratory Network Science Research Laboratory (NSRL) Discrete Event Toolkit by...Laboratory (NSRL) Discrete Event Toolkit by Theron Trout and Andrew J Toth Computational and Information Sciences Directorate, ARL...Research Laboratory (NSRL) Discrete Event Toolkit 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Theron Trout

Lax pairs for ultra-discrete Painleve cellular automata

International Nuclear Information System (INIS)

Joshi, N; Nijhoff, F W; Ormerod, C

2004-01-01

Ultra-discrete versions of the discrete Painleve equations are well known. However, evidence for their integrability has so far been restricted. In this letter, we show that their Lax pairs can be constructed and, furthermore, that compatibility conditions of the result yield the ultra-discrete Painleve equation. For conciseness, we restrict our attention to a new d-P III . (letter to the editor)

Constitutive equations for discrete electromagnetic problems over polyhedral grids

International Nuclear Information System (INIS)

Codecasa, Lorenzo; Trevisan, Francesco

2007-01-01

In this paper a novel approach is proposed for constructing discrete counterparts of constitutive equations over polyhedral grids which ensure both consistency and stability of the algebraic equations discretizing an electromagnetic field problem. The idea is to construct discrete constitutive equations preserving the thermodynamic relations for constitutive equations. In this way, consistency and stability of the discrete equations are ensured. At the base, a purely geometric condition between the primal and the dual grids has to be satisfied for a given primal polyhedral grid, by properly choosing the dual grid. Numerical experiments demonstrate that the proposed discrete constitutive equations lead to accurate approximations of the electromagnetic field

Hardware Resource Allocation for Hardware/Software Partitioning in the LYCOS System

DEFF Research Database (Denmark)

Grode, Jesper Nicolai Riis; Knudsen, Peter Voigt; Madsen, Jan

1998-01-01

as a designer's/design tool's aid to generate good hardware allocations for use in hardware/software partitioning. The algorithm has been implemented in a tool under the LYCOS system. The results show that the allocations produced by the algorithm come close to the best allocations obtained by exhaustive search.......This paper presents a novel hardware resource allocation technique for hardware/software partitioning. It allocates hardware resources to the hardware data-path using information such as data-dependencies between operations in the application, and profiling information. The algorithm is useful...

Optimal treatment cost allocation methods in pollution control

International Nuclear Information System (INIS)

Chen Wenying; Fang Dong; Xue Dazhi

1999-01-01

Total emission control is an effective pollution control strategy. However, Chinese application of total emission control lacks reasonable and fair methods for optimal treatment cost allocation, a critical issue in total emission control. The author considers four approaches to allocate treatment costs. The first approach is to set up a multiple-objective planning model and to solve the model using the shortest distance ideal point method. The second approach is to define degree of satisfaction for cost allocation results for each polluter and to establish a method based on this concept. The third is to apply bargaining and arbitration theory to develop a model. The fourth is to establish a cooperative N-person game model which can be solved using the Shapley value method, the core method, the Cost Gap Allocation method or the Minimum Costs-Remaining Savings method. These approaches are compared using a practicable case study

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

Cost-allocation principles for pipeline capacity and usage

International Nuclear Information System (INIS)

Salant, D.J.; Watkins, G.C.

1996-01-01

The issue of cost sharing among multiple users of transmission facilities, such as pipelines, was discussed. The various ways in which a fair and reasonable pipeline cost-allocation scheme can be implemented were examined. It was suggested that no method exists for allocating costs that will achieve all major policy goals. The advantages and disadvantages of a system of uniform rates, such as postage stamp tolls, was discussed in the context of a natural gas pipeline system. A postage stamp system is one in which all users pay the same amount per unit of capacity, regardless of transport distances. This rate structure, while sometimes appropriate, is inefficient if total costs are distance-sensitive or if there is a significant variation in the sources of demand. Two commonly accepted minimal principles that a cost allocation should satisfy include: (1) the stand-alone cost test, and (2) the incremental cost test. This means that no one should pay costs in excess of their stand-alone costs and no one should pay less than their incremental costs. Postage stamp tolls were found to fail the minimal set of commonly applied principles. More optimal ways in which to allocate pipeline network costs among users were presented. The nucleolus is a unique cost allocation that is consistent, symmetric and homogeneous. The nucleolus is calculated by splitting the costs equally among users of a common facility. Another effective cost allocation system is the Shapley value which can be derived from a set of axioms which differ slightly from those that identify the nucleolus. 2 refs., 1 tab

Cost-allocation principles for pipeline capacity and usage

Energy Technology Data Exchange (ETDEWEB)

Salant, D.J.; Watkins, G.C. [Law and Economics Consulting Group, Emeryville, CA (United States)

1996-12-31

The issue of cost sharing among multiple users of transmission facilities, such as pipelines, was discussed. The various ways in which a fair and reasonable pipeline cost-allocation scheme can be implemented were examined. It was suggested that no method exists for allocating costs that will achieve all major policy goals. The advantages and disadvantages of a system of uniform rates, such as postage stamp tolls, was discussed in the context of a natural gas pipeline system. A postage stamp system is one in which all users pay the same amount per unit of capacity, regardless of transport distances. This rate structure, while sometimes appropriate, is inefficient if total costs are distance-sensitive or if there is a significant variation in the sources of demand. Two commonly accepted minimal principles that a cost allocation should satisfy include: (1) the stand-alone cost test, and (2) the incremental cost test. This means that no one should pay costs in excess of their stand-alone costs and no one should pay less than their incremental costs. Postage stamp tolls were found to fail the minimal set of commonly applied principles. More optimal ways in which to allocate pipeline network costs among users were presented. The nucleolus is a unique cost allocation that is consistent, symmetric and homogeneous. The nucleolus is calculated by splitting the costs equally among users of a common facility. Another effective cost allocation system is the Shapley value which can be derived from a set of axioms which differ slightly from those that identify the nucleolus. 2 refs., 1 tab.

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

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

Integrable discretizations of the (2+1)-dimensional sinh-Gordon equation

International Nuclear Information System (INIS)

Hu, Xing-Biao; Yu, Guo-Fu

2007-01-01

In this paper, we propose two semi-discrete equations and one fully discrete equation and study them by Hirota's bilinear method. These equations have continuum limits into a system which admits the (2+1)-dimensional generalization of the sinh-Gordon equation. As a result, two integrable semi-discrete versions and one fully discrete version for the sinh-Gordon equation are found. Baecklund transformations, nonlinear superposition formulae, determinant solution and Lax pairs for these discrete versions are presented

26 CFR 1.42-6 - Buildings qualifying for carryover allocations.

Science.gov (United States)

2010-04-01

... 26 Internal Revenue 1 2010-04-01 2010-04-01 true Buildings qualifying for carryover allocations. 1... INCOME TAXES Credits Against Tax § 1.42-6 Buildings qualifying for carryover allocations. (a) Carryover... carryover allocation may only be made with respect to a qualified building. A qualified building is any...

Integrable discretization s of derivative nonlinear Schroedinger equations

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2002-01-01

We propose integrable discretizations of derivative nonlinear Schroedinger (DNLS) equations such as the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation by constructing Lax pairs. The discrete DNLS systems admit the reduction of complex conjugation between two dependent variables and possess bi-Hamiltonian structure. Through transformations of variables and reductions, we obtain novel integrable discretizations of the nonlinear Schroedinger (NLS), modified KdV (mKdV), mixed NLS, matrix NLS, matrix KdV, matrix mKdV, coupled NLS, coupled Hirota, coupled Sasa-Satsuma and Burgers equations. We also discuss integrable discretizations of the sine-Gordon equation, the massive Thirring model and their generalizations. (author)

Resource Allocation in a Repetitive Project Scheduling Using Genetic Algorithm

Science.gov (United States)

Samuel, Biju; Mathew, Jeeno

2018-03-01

Resource Allocation is procedure of doling out or allocating the accessible assets in a monetary way and productive way. Resource allocation is the scheduling of the accessible assets and accessible exercises or activities required while thinking about both the asset accessibility and the total project completion time. Asset provisioning and allocation takes care of that issue by permitting the specialist co-ops to deal with the assets for every individual demand of asset. A probabilistic selection procedure has been developed in order to ensure various selections of chromosomes

Optimal Register Allocation by Augmented Left-Edge Algorithm on Arbitrary Control-Flow Structures

DEFF Research Database (Denmark)

Ruvald Pedersen, Mark; Madsen, Jan

2012-01-01

for allocation to be done using only quasi-local and local allocation - avoiding the complexity of true global allocation. As local allocation is much simpler than global allocation, this approach emphasizes efficiency and ease of implementation - at a cost of an increased number of register transfers compared...... to other allocators. Experiments show that runtime is linear for all practical purposes....

Multivariable biorthogonal continuous--discrete Wilson and Racah polynomials

International Nuclear Information System (INIS)

Tratnik, M.V.

1990-01-01

Several families of multivariable, biorthogonal, partly continuous and partly discrete, Wilson polynomials are presented. These yield limit cases that are purely continuous in some of the variables and purely discrete in the others, or purely discrete in all the variables. The latter are referred to as the multivariable biorthogonal Racah polynomials. Interesting further limit cases include the multivariable biorthogonal Hahn and dual Hahn polynomials

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

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.

Towards an understanding of the molecular regulation of carbon allocation in diatoms: the interaction of energy and carbon allocation.

Science.gov (United States)

Wagner, Heiko; Jakob, Torsten; Fanesi, Andrea; Wilhelm, Christian

2017-09-05

In microalgae, the photosynthesis-driven CO 2 assimilation delivers cell building blocks that are used in different biosynthetic pathways. Little is known about how the cell regulates the subsequent carbon allocation to, for example, cell growth or for storage. However, knowledge about these regulatory mechanisms is of high biotechnological and ecological importance. In diatoms, the situation becomes even more complex because, as a consequence of their secondary endosymbiotic origin, the compartmentation of the pathways for the primary metabolic routes is different from green algae. Therefore, the mechanisms to manipulate the carbon allocation pattern cannot be adopted from the green lineage. This review describes the general pathways of cellular energy distribution from light absorption towards the final allocation of carbon into macromolecules and summarizes the current knowledge of diatom-specific allocation patterns. We further describe the (limited) knowledge of regulatory mechanisms of carbon partitioning between lipids, carbohydrates and proteins in diatoms. We present solutions to overcome the problems that hinder the identification of regulatory elements of carbon metabolism.This article is part of the themed issue 'The peculiar carbon metabolism in diatoms'. © 2017 The Author(s).

Energy-Efficient Power Allocation for Cognitive MIMO Channels

KAUST Repository

Sboui, Lokman

2017-03-20

Due to the massive data traffic in wireless networks, energy consumption has become a crucial concern, especially with the limited power supply of the mobile terminals and the increasing CO2 emission of the cellular industry. In this context, we study the energy efficiency (EE) of MIMO spectrum sharing cognitive radio (CR) systems under power and interference constraints. We present an energy-efficient power allocation framework based on maximizing the average EE per parallel channel resulting from the singular value decomposition (SVD) eigenmode transmission. We also present a sub-optimal low-complexity power allocation scheme based on the water-filling power allocation. In the numerical results, we show that the sub-optimal power allocation achieves at least 95% of the optimal performance. In addition, we show that adopting more antennas is more energy efficient for a given power budget. Finally, we show that the interference threshold has a significant effect on both the EE and the spectral efficiency at high-power regime.

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)

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

Prediction of Commuter’s Daily Time Allocation

Directory of Open Access Journals (Sweden)

Fang Zong

2013-10-01

Full Text Available This paper presents a model system to predict the time allocation in commuters’ daily activity-travel pattern. The departure time and the arrival time are estimated with Ordered Probit model and Support Vector Regression is introduced for travel time and activity duration prediction. Applied in a real-world time allocation prediction experiment, the model system shows a satisfactory level of prediction accuracy. This study provides useful insights into commuters’ activity-travel time allocation decision by identifying the important influences, and the results are readily applied to a wide range of transportation practice, such as travel information system, by providing reliable forecast for variations in travel demand over time. By introducing the Support Vector Regression, it also makes a methodological contribution in enhancing prediction accuracy of travel time and activity duration prediction.

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.

Research advances on thereasonable water resources allocation in irrigation district

DEFF Research Database (Denmark)

Xuebin, Qi; Zhongdong, Huang; Dongmei, Qiao

2015-01-01

The rational allocation of water resources for irrigation is important to improve the efficiency in utilization of water resources and ensuring food security, but also effective control measures need to be in place for the sustainable utilization of water resources in an irrigation area. The prog......The rational allocation of water resources for irrigation is important to improve the efficiency in utilization of water resources and ensuring food security, but also effective control measures need to be in place for the sustainable utilization of water resources in an irrigation area...... mechanism of water resources is not perfect, the model for optimal water resources allocation is not practical, and the basic conditions for optimal allocation of water resources is relatively weak. In order to solve those problems in water resources allocation practice, six important as?pects must...... in irrigation districts, studying the water resources control technology in irrigation districts by hydrology ecological system, studying the technologies of real?time risk dispatching and intelligent management in irrigation districts, and finally studying the technology of cou?pling optimal allocation...

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...

Modeling Budget Optimum Allocation of Khorasan Razavi Province Agriculture Sector

Directory of Open Access Journals (Sweden)

Seyed Mohammad Fahimifard

2016-09-01

Full Text Available Introduction: Stock shortage is one of the development impasses in developing countries and trough it the agriculture sector has faced with the most limitation. The share of Iran’s agricultural sector from total investments after the Islamic revolution (1979 has been just 5.5 percent. This fact causes low efficiency in Iran’s agriculture sector. For instance per each 1 cubic meter of water in Iran’s agriculture sector, less that 1 kilogram dry food produced and each Iranian farmer achieves less annual income and has less mechanization in comparison with similar countries in Iran’s 1404 perspective document. Therefore, it is clear that increasing investment in agriculture sector, optimize the budget allocation for this sector is mandatory however has not been adequately and scientifically revised until now. Thus, in this research optimum budget allocation of Iran- Khorasan Razavi province agriculture sector was modeled. Materials and Methods: In order to model the optimum budget allocation of Khorasan Razavi province’s agriculture sector at first optimum budget allocation between agriculture programs was modeled with compounding three indexes: 1. Analyzing the priorities of Khorasan Razavi province’s agriculture sector experts with the application of Analytical Hierarchy Process (AHP, 2. The average share of agriculture sector programs from 4th country’s development program for Khorasan Razavi province’s agriculture sector, and 3.The average share of agriculture sector programs from 5th country’s development program for Khorasan Razavi province’s agriculture sector. Then, using Delphi technique potential indexes of each program was determined. After that, determined potential indexes were weighted using Analytical Hierarchy Process (AHP and finally, using numerical taxonomy model to optimize allocation of the program’s budget between cities based on two scenarios. Required data, also was gathered from the budget and planning

Process algebra with timing : real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.; Bergstra, J.A.; Ponse, A.J.; Smolka, S.A.

2001-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The starting-point is a new real time version with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

Process algebra with timing: Real time and discrete time

NARCIS (Netherlands)

Baeten, J.C.M.; Middelburg, C.A.

1999-01-01

We present real time and discrete time versions of ACP with absolute timing and relative timing. The startingpoint is a new real time version with absolute timing, called ACPsat , featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete

A hierarchy of Liouville integrable discrete Hamiltonian equations

Energy Technology Data Exchange (ETDEWEB)

Xu Xixiang [College of Science, Shandong University of Science and Technology, Qingdao 266510 (China)], E-mail: xixiang_xu@yahoo.com.cn

2008-05-12

Based on a discrete four-by-four matrix spectral problem, a hierarchy of Lax integrable lattice equations with two potentials is derived. Two Hamiltonian forms are constructed for each lattice equation in the resulting hierarchy by means of the discrete variational identity. A strong symmetry operator of the resulting hierarchy is given. Finally, it is shown that the resulting lattice equations are all Liouville integrable discrete Hamiltonian systems.

12 CFR 615.5208 - Allotment of allocated investments.

Science.gov (United States)

2010-01-01

... 12 Banks and Banking 6 2010-01-01 2010-01-01 false Allotment of allocated investments. 615.5208... allocated investments. (a) The following conditions apply to agreements that a Farm Credit Bank or... investments held by those associations with which there is no agreement (nonagreeing associations), and does...

Security cost allocation under combined bilateral-pool market dispatch

International Nuclear Information System (INIS)

Abdullah, M.P.; Hassan, M.Y.; Hussin, F.

2008-01-01

Most electricity markets around the world are a combination of bilateral and pool markets, such as NordPool and NYPOOL. In these models, market participants bid into the pool and also make bilateral contracts with each other. This paper addressed the issue of congestion management and security cost allocation in a power pool market model. The basic idea of security cost allocation is to divide the incurred security cost due to congestion relief into pool and bilateral market based on their flow contribution to the congested line. A newly proposed security cost allocation strategy of the combined bilateral-pool market was also presented along with case studies using IEEE-14 bus system that tested the proposed method. Using the proposed method, it was shown that security costs are allocated to market participants at different prices which reflect the load contribution to the security problem. This solves the problem of the uniform security cost allocation in a pure pool market system having uniform pricing, and provides a proper security signal to market participants. 11 refs., 3 tabs., 4 figs

Variational discretization of the nonequilibrium thermodynamics of simple systems

Science.gov (United States)

Gay-Balmaz, François; Yoshimura, Hiroaki

2018-04-01

In this paper, we develop variational integrators for the nonequilibrium thermodynamics of simple closed systems. These integrators are obtained by a discretization of the Lagrangian variational formulation of nonequilibrium thermodynamics developed in (Gay-Balmaz and Yoshimura 2017a J. Geom. Phys. part I 111 169–93 Gay-Balmaz and Yoshimura 2017b J. Geom. Phys. part II 111 194–212) and thus extend the variational integrators of Lagrangian mechanics, to include irreversible processes. In the continuous setting, we derive the structure preserving property of the flow of such systems. This property is an extension of the symplectic property of the flow of the Euler–Lagrange equations. In the discrete setting, we show that the discrete flow solution of our numerical scheme verifies a discrete version of this property. We also present the regularity conditions which ensure the existence of the discrete flow. We finally illustrate our discrete variational schemes with the implementation of an example of a simple and closed system.

A Generalization of the Aumann-Shapley Value for Risk Capital Allocation Problems

NARCIS (Netherlands)

Boonen, T.J.; De Waegenaere, A.M.B.; Norde, H.W.

2012-01-01

Abstract: This paper analyzes risk capital allocation problems. For risk capital allocation problems, the aim is to allocate the risk capital of a firm to its divisions. Risk capital allocation is of central importance in risk-based performance measurement. We consider a case in which the aggregate

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)

Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System

Directory of Open Access Journals (Sweden)

Jie Ran

2015-01-01

Full Text Available The dynamics of a discrete-time hyperchaotic system and the amplitude control of Hopf bifurcation for a stochastic discrete-time hyperchaotic system are investigated in this paper. Numerical simulations are presented to exhibit the complex dynamical behaviors in the discrete-time hyperchaotic system. Furthermore, the stochastic discrete-time hyperchaotic system with random parameters is transformed into its equivalent deterministic system with the orthogonal polynomial theory of discrete random function. In addition, the dynamical features of the discrete-time hyperchaotic system with random disturbances are obtained through its equivalent deterministic system. By using the Hopf bifurcation conditions of the deterministic discrete-time system, the specific conditions for the existence of Hopf bifurcation in the equivalent deterministic system are derived. And the amplitude control with random intensity is discussed in detail. Finally, the feasibility of the control method is demonstrated by numerical simulations.

Winter wheat optimizes allocation in response to carbon limitation

Science.gov (United States)

Huang, Jianbei; Hammerbacher, Almuth; Trumbore, Susan; Hartmann, Henrik

2016-04-01

• Plant photosynthesis is not carbon-saturated at current atmospheric CO2 concentration ([CO2]) thus carbon allocation priority is of critical importance in determining plant response to environmental changes, including increasing [CO2]. • We quantified the percentage of daytime net assimilation (A) allocated to whole-plant nighttime respiration (R) and structural growth (SG), nonstructural carbohydrates (NSC) and secondary metabolites (SMs) during winter wheat (Triticum aestivum) vegetative growth (over 4 weeks) at glacial, ambient, and elevated [CO2] (170, 390 and 680 ppm). • We found that R/A remained relatively constant (11-14%) across [CO2] treatments, whereas plants allocated less C to growth and more C to export at low [CO2] than elevated [CO2]; low [CO2] grown plants tended to invest overall less C into NSC and SMs than to SG due to reduced NSC availability; while leaf SMs/NSC was greater at 170 ppm than at 680 ppm [CO2] this was the opposite for root SMs/NSC; biomass, especially NSC, were preferentially allocated to leaves instead of stems and roots, likely to relieve C limitation induced by low [CO2]. • We conclude that C limitation may force plants to reduce C allocation to long-term survival in order to secure short-term survival. Furthermore, they optimized allocation of the available resource by concentrating biomass and storage to those tissues responsible for assimilation.

Smart LED allocation scheme for efficient multiuser visible light communication networks.

Science.gov (United States)

Sewaiwar, Atul; Tiwari, Samrat Vikramaditya; Chung, Yeon Ho

2015-05-18

In a multiuser bidirectional visible light communication (VLC), a large number of LEDs or an LED array needs to be allocated in an efficient manner to ensure sustainable data rate and link quality. Moreover, in order to support an increasing or decreasing number of users in the network, the LED allocation is required to be performed dynamically. In this paper, a novel smart LED allocation scheme for efficient multiuser VLC networks is presented. The proposed scheme allocates RGB LEDs to multiple users in a dynamic and efficient fashion, while satisfying illumination requirements in an indoor environment. The smart LED array comprised of RGB LEDs is divided into sectors according to the location of the users. The allocated sectors then provide optical power concentration toward the users for efficient and reliable data transmission. An algorithm for the dynamic allocation of the LEDs is also presented. To verify its effective resource allocation feature of the proposed scheme, simulations were performed. It is found that the proposed smart LED allocation scheme provides the effect of optical beamforming toward individual users, thereby increasing the collective power concentration of the optical signals on the desirable users and resulting in significantly increased data rate, while ensuring sufficient illumination in a multiuser VLC environment.

Discretization-induced delays and their role in the dynamics

International Nuclear Information System (INIS)

Ramani, A; Grammaticos, B; Satsuma, J; Willox, R

2008-01-01

We show that a discretization of a continuous system may entail 'hidden' delays and thus introduce instabilities. In this case, while the continuous system has an attractive fixed point, the instabilities present in the equivalent discrete one may lead to the appearance of a limit cycle. We explain that it is possible, thanks to the proper staggering of the discrete variables, to eliminate the hidden delay. However, in general, other instabilities may appear in the discrete system which can even lead to chaotic behaviour

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

A transaction assessment method for allocation of transmission services

Science.gov (United States)

Banunarayanan, Venkatasubramaniam

The purpose of this research is to develop transaction assessment methods for allocating transmission services that are provided by an area/utility to power transactions. Transmission services are the services needed to deliver, or provide the capacity to deliver, real and reactive power from one or more supply points to one or more delivery points. As the number of transactions increase rapidly in the emerging deregulated environment, accurate quantification of the transmission services an area/utility provides to accommodate a transaction is becoming important, because then appropriate pricing schemes can be developed to compensate for the parties that provide these services. The Allocation methods developed are based on the "Fair Resource Allocation Principle" and they determine for each transaction the following: the flowpath of the transaction (both real and reactive power components), generator reactive power support from each area/utility, real power loss support from each area/utility. Further, allocation methods for distributing the cost of relieving congestion on transmission lines caused by transactions are also developed. The main feature of the proposed methods is representation of actual usage of the transmission services by the transactions. The proposed method is tested extensively on a variety of systems. The allocation methods developed in this thesis for allocation of transmission services to transactions is not only useful in studying the impact of transactions on a transmission system in a multi-transaction case, but they are indeed necessary to meet the criteria set forth by FERC with regard to pricing based on actual usage. The "consistency" of the proposed allocation methods has also been investigated and tested.

Hybrid discrete-time neural networks.

Science.gov (United States)

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

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.

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.

Cone-beam tomography with discrete data sets

International Nuclear Information System (INIS)

Barrett, H.H.

1994-01-01

Sufficiently conditions for cone-beam data are well known for the case of continuous data collection along a cone-vortex curve with continuous detectors. These continuous conditions are inadequate for real-world data where discrete vertex geometries and discrete detector arrays are used. In this paper we present a theoretical formulation of cone-beam tomography with arbitrary discrete arrays of detectors and vertices. The theory models the imaging system as a linear continuous-to-discrete mapping and represents the continuous object exactly as a Fourier series. The reconstruction problem is posed as the estimation of some subset of the Fourier coefficients. The main goal of the theory is to determine which Fourier coefficients can be reliably determined from the data delivered by a specific discrete design. A fourier component will be well determined by the data if it satisfies two conditions: it makes a strong contribution to the data, and this contribution is relatively independent of the contribution of other Fourier components. To make these considerations precise, we introduce a concept called the cross-talk matrix. A diagonal element of this matrix measures the strength of a Fourier component in the data, while an off-diagonal element quantifies the dependence or aliasing of two different components. (Author)

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)

Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization.

Science.gov (United States)

Huang, Song; Tian, Na; Wang, Yan; Ji, Zhicheng

2016-01-01

Taking resource allocation into account, flexible job shop problem (FJSP) is a class of complex scheduling problem in manufacturing system. In order to utilize the machine resources rationally, multi-objective particle swarm optimization (MOPSO) integrating with variable neighborhood search is introduced to address FJSP efficiently. Firstly, the assignment rules (AL) and dispatching rules (DR) are provided to initialize the population. And then special discrete operators are designed to produce new individuals and earliest completion machine (ECM) is adopted in the disturbance operator to escape the optima. Secondly, personal-best archives (cognitive memories) and global-best archive (social memory), which are updated by the predefined non-dominated archive update strategy, are simultaneously designed to preserve non-dominated individuals and select personal-best positions and the global-best position. Finally, three neighborhoods are provided to search the neighborhoods of global-best archive for enhancing local search ability. The proposed algorithm is evaluated by using Kacem instances and Brdata instances, and a comparison with other approaches shows the effectiveness of the proposed algorithm for FJSP.

Reflectionless discrete Schr\\"odinger operators are spectrally atypical

OpenAIRE

VandenBoom, Tom

2017-01-01

We prove that, if an isospectral torus contains a discrete Schr\\"odinger operator with nonconstant potential, the shift dynamics on that torus cannot be minimal. Consequently, we specify a generic sense in which finite unions of nondegenerate closed intervals having capacity one are not the spectrum of any reflectionless discrete Schr\\"odinger operator. We also show that the only reflectionless discrete Schr\\"odinger operators having zero, one, or two spectral gaps are periodic.

A Baecklund transformation between two integrable discrete hungry systems

International Nuclear Information System (INIS)

Fukuda, Akiko; Yamamoto, Yusaku; Iwasaki, Masashi; Ishiwata, Emiko; Nakamura, Yoshimasa

2011-01-01

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

A Baecklund transformation between two integrable discrete hungry systems

Energy Technology Data Exchange (ETDEWEB)

Fukuda, Akiko, E-mail: j1409704@ed.kagu.tus.ac.j [Department of Mathematical Information Science, Graduate School of Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Yamamoto, Yusaku [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 (Japan); Iwasaki, Masashi [Department of Informatics and Environmental Science, Kyoto Prefectural University, 1-5, Nakaragi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522 (Japan); Ishiwata, Emiko [Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Nakamura, Yoshimasa [Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)

2011-01-17

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

Evolving Reliability and Maintainability Allocations for NASA Ground Systems

Science.gov (United States)

Munoz, Gisela; Toon, T.; Toon, J.; Conner, A.; Adams, T.; Miranda, D.

2016-01-01

This paper describes the methodology and value of modifying allocations to reliability and maintainability requirements for the NASA Ground Systems Development and Operations (GSDO) programs subsystems. As systems progressed through their design life cycle and hardware data became available, it became necessary to reexamine the previously derived allocations. This iterative process provided an opportunity for the reliability engineering team to reevaluate allocations as systems moved beyond their conceptual and preliminary design phases. These new allocations are based on updated designs and maintainability characteristics of the components. It was found that trade-offs in reliability and maintainability were essential to ensuring the integrity of the reliability and maintainability analysis. This paper discusses the results of reliability and maintainability reallocations made for the GSDO subsystems as the program nears the end of its design phase.

An introduction to non-Abelian discrete symmetries for particle physicists

CERN Document Server

Ishimori, Hajime; Ohki, Hiroshi; Okada, Hiroshi; Shimizu, Yusuke; Tanimoto, Morimitsu

2012-01-01

These lecture notes provide a tutorial review of non-Abelian discrete groups and show some applications to issues in physics where discrete symmetries constitute an important principle for model building in particle physics. While Abelian discrete symmetries are often imposed in order to control couplings for particle physics - in particular model building beyond the standard model - non-Abelian discrete symmetries have been applied to understand the three-generation flavor structure in particular. Indeed, non-Abelian discrete symmetries are considered to be the most attractive choice for the flavor sector: model builders have tried to derive experimental values of quark and lepton masses, and mixing angles by assuming non-Abelian discrete flavor symmetries of quarks and leptons, yet, lepton mixing has already been intensively discussed in this context, as well. The possible origins of the non-Abelian discrete symmetry for flavors is another topic of interest, as they can arise from an underlying theory -...

Partition-based discrete-time quantum walks

Science.gov (United States)

Konno, Norio; Portugal, Renato; Sato, Iwao; Segawa, Etsuo

2018-04-01

We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.

Stabilizing the discrete vortex of topological charge S=2

International Nuclear Information System (INIS)

Kevrekidis, P.G.; Frantzeskakis, D.J.

2005-01-01

We study the instability of the discrete vortex with topological charge S=2 in a prototypical lattice model and observe its mediation through the central lattice site. Motivated by this finding, we analyze the model with the central site being inert. We identify analytically and observe numerically the existence of a range of linearly stable discrete vortices with S=2 in the latter model. The range of stability is comparable to that of the recently observed experimentally S=1 discrete vortex, suggesting the potential for observation of such higher charge discrete vortices

Group-theoretical aspects of the discrete sine-Gordon equation

International Nuclear Information System (INIS)

Orfanidis, S.J.

1980-01-01

The group-theoretical interpretation of the sine-Gordon equation in terms of connection forms on fiber bundles is extended to the discrete case. Solutions of the discrete sine-Gordon equation induce surfaces on a lattice in the SU(2) group space. The inverse scattering representation, expressing the parallel transport of fibers, is implemented by means of finite rotations. Discrete Baecklund transformations are realized as gauge transformations. The three-dimensional inverse scattering representation is used to derive a discrete nonlinear sigma model, and the corresponding Baecklund transformation and Pohlmeyer's R transformation are constructed

Solitonlike solutions of the generalized discrete nonlinear Schrödinger equation

DEFF Research Database (Denmark)

Rasmussen, Kim; Henning, D.; Gabriel, H.

1996-01-01

We investigate the solution properties oi. a generalized discrete nonlinear Schrodinger equation describing a nonlinear lattice chain. The generalized equation interpolates between the integrable discrete Ablowitz-Ladik equation and the nonintegrable discrete Schrodinger equation. Special interes...... nonlinear Schrodinger equation. In this way eve are able to construct coherent solitonlike structures of profile determined by the map parameters.......We investigate the solution properties oi. a generalized discrete nonlinear Schrodinger equation describing a nonlinear lattice chain. The generalized equation interpolates between the integrable discrete Ablowitz-Ladik equation and the nonintegrable discrete Schrodinger equation. Special interest...

40 CFR 96.142 - CAIR NOX allowance allocations.

Science.gov (United States)

2010-07-01

... the 3 highest amounts of the unit's adjusted control period heat input for 2000 through 2004, with the adjusted control period heat input for each year calculated as follows: (A) If the unit is coal-fired... CAIR NOX Allowance Allocations § 96.142 CAIR NOX allowance allocations. (a)(1) The baseline heat input...

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

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...

Use cases of discrete event simulation. Appliance and research

Energy Technology Data Exchange (ETDEWEB)

Bangsow, Steffen (ed.)

2012-11-01

Use Cases of Discrete Event Simulation. Includes case studies from various important industries such as automotive, aerospace, robotics, production industry. Written by leading experts in the field. Over the last decades Discrete Event Simulation has conquered many different application areas. This trend is, on the one hand, driven by an ever wider use of this technology in different fields of science and on the other hand by an incredibly creative use of available software programs through dedicated experts. This book contains articles from scientists and experts from 10 countries. They illuminate the width of application of this technology and the quality of problems solved using Discrete Event Simulation. Practical applications of simulation dominate in the present book. The book is aimed to researchers and students who deal in their work with Discrete Event Simulation and which want to inform them about current applications. By focusing on discrete event simulation, this book can also serve as an inspiration source for practitioners for solving specific problems during their work. Decision makers who deal with the question of the introduction of discrete event simulation for planning support and optimization this book provides a contribution to the orientation, what specific problems could be solved with the help of Discrete Event Simulation within the organization.

Discrete bacteria foraging optimization algorithm for graph based problems - a transition from continuous to discrete

Science.gov (United States)

Sur, Chiranjib; Shukla, Anupam

2018-03-01

Bacteria Foraging Optimisation Algorithm is a collective behaviour-based meta-heuristics searching depending on the social influence of the bacteria co-agents in the search space of the problem. The algorithm faces tremendous hindrance in terms of its application for discrete problems and graph-based problems due to biased mathematical modelling and dynamic structure of the algorithm. This had been the key factor to revive and introduce the discrete form called Discrete Bacteria Foraging Optimisation (DBFO) Algorithm for discrete problems which exceeds the number of continuous domain problems represented by mathematical and numerical equations in real life. In this work, we have mainly simulated a graph-based road multi-objective optimisation problem and have discussed the prospect of its utilisation in other similar optimisation problems and graph-based problems. The various solution representations that can be handled by this DBFO has also been discussed. The implications and dynamics of the various parameters used in the DBFO are illustrated from the point view of the problems and has been a combination of both exploration and exploitation. The result of DBFO has been compared with Ant Colony Optimisation and Intelligent Water Drops Algorithms. Important features of DBFO are that the bacteria agents do not depend on the local heuristic information but estimates new exploration schemes depending upon the previous experience and covered path analysis. This makes the algorithm better in combination generation for graph-based problems and combination generation for NP hard problems.

Discrete Pathophysiology is Uncommon in Patients with Nonspecific Arm Pain.

Science.gov (United States)

Kortlever, Joost T P; Janssen, Stein J; Molleman, Jeroen; Hageman, Michiel G J S; Ring, David

2016-06-01

Nonspecific symptoms are common in all areas of medicine. Patients and caregivers can be frustrated when an illness cannot be reduced to a discrete pathophysiological process that corresponds with the symptoms. We therefore asked the following questions: 1) Which demographic factors and psychological comorbidities are associated with change from an initial diagnosis of nonspecific arm pain to eventual identification of discrete pathophysiology that corresponds with symptoms? 2) What is the percentage of patients eventually diagnosed with discrete pathophysiology, what are those pathologies, and do they account for the symptoms? We evaluated 634 patients with an isolated diagnosis of nonspecific upper extremity pain to see if discrete pathophysiology was diagnosed on subsequent visits to the same hand surgeon, a different hand surgeon, or any physician within our health system for the same pain. There were too few patients with discrete pathophysiology at follow-up to address the primary study question. Definite discrete pathophysiology that corresponded with the symptoms was identified in subsequent evaluations by the index surgeon in one patient (0.16% of all patients) and cured with surgery (nodular fasciitis). Subsequent doctors identified possible discrete pathophysiology in one patient and speculative pathophysiology in four patients and the index surgeon identified possible discrete pathophysiology in four patients, but the five discrete diagnoses accounted for only a fraction of the symptoms. Nonspecific diagnoses are not harmful. Prospective randomized research is merited to determine if nonspecific, descriptive diagnoses are better for patients than specific diagnoses that imply pathophysiology in the absence of discrete verifiable pathophysiology.

Implementing the Standards. Teaching Discrete Mathematics in Grades 7-12.

Science.gov (United States)

Hart, Eric W.; And Others

1990-01-01

Discrete mathematics are defined briefly. A course in discrete mathematics for high school students and teaching discrete mathematics in grades 7 and 8 including finite differences, recursion, and graph theory are discussed. (CW)

Discretized representations of harmonic variables by bilateral Jacobi operators

Directory of Open Access Journals (Sweden)

Andreas Ruffing

2000-01-01

Full Text Available Starting from a discrete Heisenberg algebra we solve several representation problems for a discretized quantum oscillator in a weighted sequence space. The Schrödinger operator for a discrete harmonic oscillator is derived. The representation problem for a q-oscillator algebra is studied in detail. The main result of the article is the fact that the energy representation for the discretized momentum operator can be interpreted as follows: It allows to calculate quantum properties of a large number of non-interacting harmonic oscillators at the same time. The results can be directly related to current research on squeezed laser states in quantum optics. They reveal and confirm the observation that discrete versions of continuum Schrodinger operators allow more structural freedom than their continuum analogs do.

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…

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…

Decentralization in Zambia: resource allocation and district performance.

Science.gov (United States)

Bossert, Thomas; Chitah, Mukosha Bona; Bowser, Diana

2003-12-01

Zambia implemented an ambitious process of health sector decentralization in the mid 1990s. This article presents an assessment of the degree of decentralization, called 'decision space', that was allowed to districts in Zambia, and an analysis of data on districts available at the national level to assess allocation choices made by local authorities and some indicators of the performance of the health systems under decentralization. The Zambian officials in health districts had a moderate range of choice over expenditures, user fees, contracting, targeting and governance. Their choices were quite limited over salaries and allowances and they did not have control over additional major sources of revenue, like local taxes. The study found that the formula for allocation of government funding which was based on population size and hospital beds resulted in relatively equal per capita expenditures among districts. Decentralization allowed the districts to make decisions on internal allocation of resources and on user fee levels and expenditures. General guidelines for the allocation of resources established a maximum and minimum percentage to be allocated to district offices, hospitals, health centres and communities. Districts tended to exceed the maximum for district offices, but the large urban districts and those without public district hospitals were not even reaching the minimum for hospital allocations. Wealthier and urban districts were more successful in raising revenue through user fees, although the proportion of total expenditures that came from user fees was low. An analysis of available indicators of performance, such as the utilization of health services, immunization coverage and family planning activities, found little variation during the period 1995-98 except for a decline in immunization coverage, which may have also been affected by changes in donor funding. These findings suggest that decentralization may not have had either a positive or

Funding Allocation and Staff Management. A Portuguese Example

Science.gov (United States)

Rosa, Maria Joao; Amado, Diana; Amaral, Alberto

2009-01-01

For many years the Portuguese Ministry of Education used a funding formula to allocate the State budget to public higher education institutions. Some of its major objectives were higher enrolments and allocation equity. As the expenditure on salaries was a major component of the budget, the formula was supposed to force convergence to established…

Joint overbooking and seat allocation for fare families

DEFF Research Database (Denmark)

Hjorth, Robert; Fiig, Thomas; Bondoux, Nicolas

2016-01-01

Revenue Management Systems (RMS) traditionally solve the seat allocation problem separately from the overbooking problem. Overbooking is managed by inflating the authorization levels obtained from seat allocation by various heuristics. This approach although suboptimal, is necessitated because...... independent demand model, which is readily solved. The resulting availability control can easily by implemented in existing RMS...

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

On the Importance of Both Dimensional and Discrete Models of Emotion.

Science.gov (United States)

Harmon-Jones, Eddie; Harmon-Jones, Cindy; Summerell, Elizabeth

2017-09-29

We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1) how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2) that anger (and other emotional states) should be considered as a discrete emotion but there are dimensions around and within anger; (3) that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4) that discrete emotions and broad dimensions of emotions both have unique functions; and (5) evidence that a "new" discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions.

On the Importance of Both Dimensional and Discrete Models of Emotion

Science.gov (United States)

Harmon-Jones, Eddie

2017-01-01

We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1) how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2) that anger (and other emotional states) should be considered as a discrete emotion but there are dimensions around and within anger; (3) that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4) that discrete emotions and broad dimensions of emotions both have unique functions; and (5) evidence that a “new” discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions. PMID:28961185

Discretization-dependent model for weakly connected excitable media

Science.gov (United States)

Arroyo, Pedro André; Alonso, Sergio; Weber dos Santos, Rodrigo

2018-03-01

Pattern formation has been widely observed in extended chemical and biological processes. Although the biochemical systems are highly heterogeneous, homogenized continuum approaches formed by partial differential equations have been employed frequently. Such approaches are usually justified by the difference of scales between the heterogeneities and the characteristic spatial size of the patterns. Under different conditions, for example, under weak coupling, discrete models are more adequate. However, discrete models may be less manageable, for instance, in terms of numerical implementation and mesh generation, than the associated continuum models. Here we study a model to approach discreteness which permits the computer implementation on general unstructured meshes. The model is cast as a partial differential equation but with a parameter that depends not only on heterogeneities sizes, as in the case of quasicontinuum models, but also on the discretization mesh. Therefore, we refer to it as a discretization-dependent model. We validate the approach in a generic excitable media that simulates three different phenomena: the propagation of action membrane potential in cardiac tissue, in myelinated axons of neurons, and concentration waves in chemical microemulsions.

Discrete Variational Approach for Modeling Laser-Plasma Interactions

Science.gov (United States)

Reyes, J. Paxon; Shadwick, B. A.

2014-10-01

The traditional approach for fluid models of laser-plasma interactions begins by approximating fields and derivatives on a grid in space and time, leading to difference equations that are manipulated to create a time-advance algorithm. In contrast, by introducing the spatial discretization at the level of the action, the resulting Euler-Lagrange equations have particular differencing approximations that will exactly satisfy discrete versions of the relevant conservation laws. For example, applying a spatial discretization in the Lagrangian density leads to continuous-time, discrete-space equations and exact energy conservation regardless of the spatial grid resolution. We compare the results of two discrete variational methods using the variational principles from Chen and Sudan and Brizard. Since the fluid system conserves energy and momentum, the relative errors in these conserved quantities are well-motivated physically as figures of merit for a particular method. This work was supported by the U. S. Department of Energy under Contract No. DE-SC0008382 and by the National Science Foundation under Contract No. PHY-1104683.

Development of sample size allocation program using hypergeometric distribution

International Nuclear Information System (INIS)

Kim, Hyun Tae; Kwack, Eun Ho; Park, Wan Soo; Min, Kyung Soo; Park, Chan Sik

1996-01-01

The objective of this research is the development of sample allocation program using hypergeometric distribution with objected-oriented method. When IAEA(International Atomic Energy Agency) performs inspection, it simply applies a standard binomial distribution which describes sampling with replacement instead of a hypergeometric distribution which describes sampling without replacement in sample allocation to up to three verification methods. The objective of the IAEA inspection is the timely detection of diversion of significant quantities of nuclear material, therefore game theory is applied to its sampling plan. It is necessary to use hypergeometric distribution directly or approximate distribution to secure statistical accuracy. Improved binomial approximation developed by Mr. J. L. Jaech and correctly applied binomial approximation are more closer to hypergeometric distribution in sample size calculation than the simply applied binomial approximation of the IAEA. Object-oriented programs of 1. sample approximate-allocation with correctly applied standard binomial approximation, 2. sample approximate-allocation with improved binomial approximation, and 3. sample approximate-allocation with hypergeometric distribution were developed with Visual C ++ and corresponding programs were developed with EXCEL(using Visual Basic for Application). 8 tabs., 15 refs. (Author)

Application of genetic algorithm for reliability allocation in nuclear power plants

International Nuclear Information System (INIS)

Yang, Joon-Eon; Hwang, Mee-Jung; Sung, Tae-Yong; Jin, Youngho

1999-01-01

Reliability allocation is an optimization process of minimizing the total plant costs subject to the overall plant safety goal constraints. Reliability allocation was applied to determine the reliability characteristics of reactor systems, subsystems, major components and plant procedures that are consistent with a set of top-level performance goals; the core melt frequency, acute fatalities and latent fatalities. Reliability allocation can be performed to improve the design, operation and safety of new and/or existing nuclear power plants. Reliability allocation is a kind of a difficult multi-objective optimization problem as well as a global optimization problem. The genetic algorithm, known as one of the most powerful tools for most optimization problems, is applied to the reliability allocation problem of a typical pressurized water reactor in this article. One of the main problems of reliability allocation is defining realistic objective functions. Hence, in order to optimize the reliability of the system, the cost for improving and/or degrading the reliability of the system should be included in the reliability allocation process. We used techniques derived from the value impact analysis to define the realistic objective function in this article

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....

Allocation of Load-Loss Cost Caused by Voltage Sag

Science.gov (United States)

Gao, X.

2017-10-01

This paper focuses on the allocation of load-loss cost caused by voltage sag in the environment of electricity market. To compensate the loss of loads due to voltage sags, the load-loss cost is allocated to both sources and power consumers. On the basis of Load Drop Cost (LDC), a quantitative evaluation index of load-loss cost caused by voltage sag is identified. The load-loss cost to be allocated to power consumers themselves is calculated according to load classification. Based on the theory of power component the quantitative relation between sources and loads is established, thereby a quantitative calculation method for load-loss cost allocated to each source is deduced and the quantitative compensation from individual source to load is proposed. A simple five-bus system illustrates the main features of the proposed method.

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...

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

34 CFR 200.70 - Allocation of funds to LEAs in general.

Science.gov (United States)

2010-07-01

... Improving Basic Programs Operated by Local Educational Agencies Allocations to Leas § 200.70 Allocation of funds to LEAs in general. (a) The Secretary allocates basic grants, concentration grants, targeted grants, and education finance incentive grants, through SEAs, to each eligible LEA for which the Bureau...

40 CFR 97.142 - CAIR NOX allowance allocations.

Science.gov (United States)

2010-07-01

... heat input for each year calculated as follows: (A) If the unit is coal-fired during the year, the unit... the first such 5 years. (2)(i) A unit's control period heat input, and a unit's status as coal-fired... Allocations § 97.142 CAIR NOX allowance allocations. (a)(1) The baseline heat input (in mmBtu) used with...

Characterizing a discrete-to-discrete X-ray transform for iterative image reconstruction with limited angular-range scanning in CT

DEFF Research Database (Denmark)

Sidky, Emil; Jørgensen, Jakob Heide; Pan, Xiaochuan

2012-01-01

Iterative image reconstruction in computed tomography often employs a discrete-to-discrete (DD) linear data model, and many of the aspects of the image recovery relate directly to the properties of this linear model. While much is known about the properties of the continuous X-ray, the correspond...

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

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.

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.

Mapping of uncertainty relations between continuous and discrete time.

Science.gov (United States)

Chiuchiù, Davide; Pigolotti, Simone

2018-03-01

Lower bounds on fluctuations of thermodynamic currents depend on the nature of time, discrete or continuous. To understand the physical reason, we compare current fluctuations in discrete-time Markov chains and continuous-time master equations. We prove that current fluctuations in the master equations are always more likely, due to random timings of transitions. This comparison leads to a mapping of the moments of a current between discrete and continuous time. We exploit this mapping to obtain uncertainty bounds. Our results reduce the quests for uncertainty bounds in discrete and continuous time to a single problem.

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%.

Integrable semi-discretizations of the reduced Ostrovsky equation

International Nuclear Information System (INIS)

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

2015-01-01

Based on our previous work on the reduced Ostrovsky equation (J. Phys. A: Math. Theor. 45 355203), we construct its integrable semi-discretizations. Since the reduced Ostrovsky equation admits two alternative representations, one being its original form, the other the differentiated form (the short wave limit of the Degasperis–Procesi equation) two semi-discrete analogues of the reduced Ostrovsky equation are constructed possessing the same N-loop soliton solution. The relationship between these two versions of semi-discretizations is also clarified. (paper)

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...

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.

The discretized Schroedinger equation and simple models for semiconductor quantum wells

International Nuclear Information System (INIS)

Boykin, Timothy B; Klimeck, Gerhard

2004-01-01

The discretized Schroedinger equation is one of the most commonly employed methods for solving one-dimensional quantum mechanics problems on the computer, yet many of its characteristics remain poorly understood. The differences with the continuous Schroedinger equation are generally viewed as shortcomings of the discrete model and are typically described in purely mathematical terms. This is unfortunate since the discretized equation is more productively viewed from the perspective of solid-state physics, which naturally links the discrete model to realistic semiconductor quantum wells and nanoelectronic devices. While the relationship between the discrete model and a one-dimensional tight-binding model has been known for some time, the fact that the discrete Schroedinger equation admits analytic solutions for quantum wells has gone unnoted. Here we present a solution to this new analytically solvable problem. We show that the differences between the discrete and continuous models are due to their fundamentally different bandstructures, and present evidence for our belief that the discrete model is the more physically reasonable one

On the Importance of Both Dimensional and Discrete Models of Emotion

Directory of Open Access Journals (Sweden)

Eddie Harmon-Jones

2017-09-01

Full Text Available We review research on the structure and functions of emotions that has benefitted from a serious consideration of both discrete and dimensional perspectives on emotion. To illustrate this point, we review research that demonstrates: (1 how affective valence within discrete emotions differs as a function of individuals and situations, and how these differences relate to various functions; (2 that anger (and other emotional states should be considered as a discrete emotion but there are dimensions around and within anger; (3 that similarities exist between approach-related positive and negative discrete emotions and they have unique motivational functions; (4 that discrete emotions and broad dimensions of emotions both have unique functions; and (5 evidence that a “new” discrete emotion with discrete functions exists within a broader emotion family. We hope that this consideration of both discrete and dimensional perspectives on emotion will assist in understanding the functions of emotions.

Comparison of discrete Hodge star operators for surfaces

KAUST Repository

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

2016-01-01

We investigate the performance of various discrete Hodge star operators for discrete exterior calculus (DEC) using circumcentric and barycentric dual meshes. The performance is evaluated through the DEC solution of Darcy and incompressible Navier

Properties of wavelet discretization of Black-Scholes equation

Science.gov (United States)