Science.gov

Sample records for frequency assignment problem

  1. Achieving spectrum conservation for the minimum-span and minimum-order frequency assignment problems

    NASA Technical Reports Server (NTRS)

    Heyward, Ann O.

    1992-01-01

    Effective and efficient solutions of frequency assignment problems assumes increasing importance as the radiofrequency spectrum experiences ever increasing utilization by diverse communications services, requiring that the most efficient use of this resource be achieved. The research presented explores a general approach to the frequency assignment problem, in which such problems are categorized by the appropriate spectrum conserving objective function, and are each treated as an N-job, M-machine scheduling problem appropriate for the objective. Results obtained and presented illustrate that such an approach presents an effective means of achieving spectrum conserving frequency assignments for communications systems in a variety of environments.

  2. On scheduling models for the frequency interval assignment problem with cumulative interferences

    NASA Astrophysics Data System (ADS)

    Kiatmanaroj, Kata; Artigues, Christian; Houssin, Laurent

    2016-05-01

    In this article, models and methods for solving a real-life frequency assignment problem based on scheduling theory are investigated. A realistic frequency assignment problem involving cumulative interference constraints in which the aim is to maximize the number of assigned users is considered. If interferences are assumed to be binary, a multiple carrier frequency assignment problem can be treated as a disjunctive scheduling problem since a user requesting a number of contiguous frequencies can be considered as a non-preemptive task with a processing time, and two interfering users can be modelled through a disjunctive constraint on the corresponding tasks. A binary interference version of the problem is constructed and a disjunctive scheduling model is derived. Based on the binary representation, two models are proposed. The first one relies on an interference matrix and the second one considers maximal cliques. A third, cumulative, model that yields a new class of scheduling problems is also proposed. Computational experiments show that the case-study frequency assignment problem can be solved efficiently with disjunctive scheduling techniques.

  3. Optimizing a realistic large-scale frequency assignment problem using a new parallel evolutionary approach

    NASA Astrophysics Data System (ADS)

    Chaves-González, José M.; Vega-Rodríguez, Miguel A.; Gómez-Pulido, Juan A.; Sánchez-Pérez, Juan M.

    2011-08-01

    This article analyses the use of a novel parallel evolutionary strategy to solve complex optimization problems. The work developed here has been focused on a relevant real-world problem from the telecommunication domain to verify the effectiveness of the approach. The problem, known as frequency assignment problem (FAP), basically consists of assigning a very small number of frequencies to a very large set of transceivers used in a cellular phone network. Real data FAP instances are very difficult to solve due to the NP-hard nature of the problem, therefore using an efficient parallel approach which makes the most of different evolutionary strategies can be considered as a good way to obtain high-quality solutions in short periods of time. Specifically, a parallel hyper-heuristic based on several meta-heuristics has been developed. After a complete experimental evaluation, results prove that the proposed approach obtains very high-quality solutions for the FAP and beats any other result published.

  4. Group assignment problem

    NASA Astrophysics Data System (ADS)

    Poore, Aubrey B.; Gadaleta, Sabino

    2003-12-01

    Multiple frame data association, whether it is based on multiple hypothesis tracking or multi-dimensional assignment problems, has established itself as the method of choice for difficult tracking problems, principally due to the ability to hold difficult data association decisions in abeyance until additional information is available. Over the last twenty years, these methods have focused on one-to-one assignments, many-to-one, and many-to-many assignments. Group tracking, on the other hand, introduces new complexity into the association process, especially if some soft decision making capability is desired. Thus, the goal of this work is to combine multiple grouping hypotheses for each frame of data (tracks or measurements) with matching these hypotheses across multiple frames of data using one-to-one, many-to-one, or many-to-many assignments to determine the correct hypothesis on each frame of data and connectivity across the frames. The resulting formulation is sufficiently general to cover four broad classes of problems in multiple target tracking, namely (a) group cluster tracking, (b) pixel (clump) IR cluster tracking, (c) the merged measurement problem, and (d) MHT for track-to-track fusion. What is more, the cluster assignment problem for either two or multiple dimensions represents a generalized data association problem in the sense that it reduces to the classical assignment problems when there are no overlapping groups or clusters. The formulation of the assignment problem for resolved object tracking and candidate group methods for use in multiple frame group tracking are briefly reviewed. Then, three different formulations of the group assignment problem are developed.

  5. Group assignment problem

    NASA Astrophysics Data System (ADS)

    Poore, Aubrey B.; Gadaleta, Sabino

    2004-01-01

    Multiple frame data association, whether it is based on multiple hypothesis tracking or multi-dimensional assignment problems, has established itself as the method of choice for difficult tracking problems, principally due to the ability to hold difficult data association decisions in abeyance until additional information is available. Over the last twenty years, these methods have focused on one-to-one assignments, many-to-one, and many-to-many assignments. Group tracking, on the other hand, introduces new complexity into the association process, especially if some soft decision making capability is desired. Thus, the goal of this work is to combine multiple grouping hypotheses for each frame of data (tracks or measurements) with matching these hypotheses across multiple frames of data using one-to-one, many-to-one, or many-to-many assignments to determine the correct hypothesis on each frame of data and connectivity across the frames. The resulting formulation is sufficiently general to cover four broad classes of problems in multiple target tracking, namely (a) group cluster tracking, (b) pixel (clump) IR cluster tracking, (c) the merged measurement problem, and (d) MHT for track-to-track fusion. What is more, the cluster assignment problem for either two or multiple dimensions represents a generalized data association problem in the sense that it reduces to the classical assignment problems when there are no overlapping groups or clusters. The formulation of the assignment problem for resolved object tracking and candidate group methods for use in multiple frame group tracking are briefly reviewed. Then, three different formulations of the group assignment problem are developed.

  6. Frequency Assignment Subcommittee (FAS)

    DTIC Science & Technology

    2010-03-01

    4 • 4 GHz • 14 – 15 GHz • 7/8 GHz when IRAC approved 4 Frequency Application P ( t)rocess con  C l ith Ch l Pl C tomp y w anne ans on • Military...EXD • Change 141 date • Submit Renewals at least 60 days prior to expiration date  Can’t serial replace FRRS only record 6  IRAC docs listed...in NTIA Manual • One site, Poseidon Park, approved at IRAC but not signed by Chair – awaiting outcome of change to 7.11 paper b itt d b FASsu m e y

  7. 47 CFR 74.602 - Frequency assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency assignment. 74.602 Section 74.602... Stations § 74.602 Frequency assignment. (a) The following frequencies are available for assignment to... to GSO FSS operations in the 12.75-13.25 GHz band. (1) Frequencies shown above between 2450 and 2500...

  8. 47 CFR 74.103 - Frequency assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency assignment. 74.103 Section 74.103....103 Frequency assignment. (a) Frequencies allocated to broadcasting and the various categories of auxiliary stations, in the FCC's Table of Frequency Allocations (Part 2 of this chapter), may be assigned...

  9. 47 CFR 74.602 - Frequency assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency assignment. 74.602 Section 74.602... Stations § 74.602 Frequency assignment. (a) The following frequencies are available for assignment to... to GSO FSS operations in the 12.75-13.25 GHz band. (1) Frequencies shown above between 2450 and 2500...

  10. 47 CFR 74.802 - Frequency assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency assignment. 74.802 Section 74.802... Frequency assignment. (a) Frequencies within the following bands may be assigned for use by low power... MHz. All zones 113 km (70 miles) (c) Specific frequency operation is required when operating within...

  11. 47 CFR 74.802 - Frequency assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency assignment. 74.802 Section 74.802... Frequency assignment. (a) Frequencies within the following bands may be assigned for use by low power... MHz. All zones 113 km (70 miles) (c) Specific frequency operation is required when operating within...

  12. 47 CFR 74.802 - Frequency assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency assignment. 74.802 Section 74.802... Frequency assignment. (a) Frequencies within the following bands may be assigned for use by low power... MHz. All zones 113 km (70 miles) (c) Specific frequency operation is required when operating within...

  13. 47 CFR 74.802 - Frequency assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency assignment. 74.802 Section 74.802... Frequency assignment. (a) Frequencies within the following bands may be assigned for use by low power... MHz. All zones 113 km (70 miles) (c) Specific frequency operation is required when operating within...

  14. 47 CFR 74.103 - Frequency assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency assignment. 74.103 Section 74.103....103 Frequency assignment. (a) Frequencies allocated to broadcasting and the various categories of auxiliary stations, in the FCC's Table of Frequency Allocations (Part 2 of this chapter), may be assigned...

  15. 47 CFR 74.602 - Frequency assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency assignment. 74.602 Section 74.602... Stations § 74.602 Frequency assignment. (a) The following frequencies are available for assignment to... to GSO FSS operations in the 12.75-13.25 GHz band. (1) Frequencies shown above between 2450 and...

  16. 47 CFR 80.509 - Frequency assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... MARITIME SERVICES Private Coast Stations and Marine Utility Stations § 80.509 Frequency assignment. Frequencies assignable to private coast stations and marine utility stations are listed in subpart H....

  17. 47 CFR 80.509 - Frequency assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Frequency assignment. 80.509 Section 80.509... MARITIME SERVICES Private Coast Stations and Marine Utility Stations § 80.509 Frequency assignment. Frequencies assignable to private coast stations and marine utility stations are listed in subpart H. ...

  18. 47 CFR 80.509 - Frequency assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 5 2014-10-01 2014-10-01 false Frequency assignment. 80.509 Section 80.509... MARITIME SERVICES Private Coast Stations and Marine Utility Stations § 80.509 Frequency assignment. Frequencies assignable to private coast stations and marine utility stations are listed in subpart H. ...

  19. 47 CFR 80.509 - Frequency assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Frequency assignment. 80.509 Section 80.509... MARITIME SERVICES Private Coast Stations and Marine Utility Stations § 80.509 Frequency assignment. Frequencies assignable to private coast stations and marine utility stations are listed in subpart H. ...

  20. 47 CFR 74.502 - Frequency assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.502 Section 74.502... § 74.502 Frequency assignment. (a) Except as provided in NG30, broadcast auxiliary stations licensed as... Allocations. (b) The frequency band 944-952 MHz is available for assignment to aural STL and ICR stations. One...

  1. 47 CFR 74.402 - Frequency assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.402 Section 74.402....402 Frequency assignment. Operation on all channels listed in this section (except: frequencies 26.07... channels are stacked in those sections stacking is permitted, channel assignments may be made for the...

  2. 47 CFR 74.402 - Frequency assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency assignment. 74.402 Section 74.402....402 Frequency assignment. Operation on all channels listed in this section (except: frequencies 26.07 MHz, 26.11 MHz, and 26.45 MHz, and frequencies listed in paragraphs (a)(4) and (c)(1) of this section...

  3. 47 CFR 74.402 - Frequency assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency assignment. 74.402 Section 74.402....402 Frequency assignment. Operation on all channels listed in this section (except: frequencies 26.07 MHz, 26.11 MHz, and 26.45 MHz, and frequencies listed in paragraphs (a)(4) and (c)(1) of this section...

  4. 47 CFR 74.402 - Frequency assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency assignment. 74.402 Section 74.402....402 Frequency assignment. Operation on all channels listed in this section (except: frequencies 26.07 MHz, 26.11 MHz, and 26.45 MHz, and frequencies listed in paragraphs (a)(4) and (c)(1) of this section...

  5. 47 CFR 74.402 - Frequency assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency assignment. 74.402 Section 74.402....402 Frequency assignment. Operation on all channels listed in this section (except: frequencies 26.07 MHz, 26.11 MHz, and 26.45 MHz, and frequencies listed in paragraphs (a)(4) and (c)(1) of this section...

  6. The Random Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Paul, Gerald; Shao, Jia; Stanley, H. Eugene

    2011-11-01

    The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P. Surprisingly, the QAP has not been studied before using the replica method despite the fact that the QAP was first proposed over 50 years ago and the replica method was developed over 30 years ago. We find simple forms for C min and C max , the costs of the minimal and maximum solutions respectively. Notable features of our results are the symmetry of the results for C min and C max and their dependence on P only through its mean and standard deviation, independent of the details of P.

  7. 33 CFR 401.61 - Assigned frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 33 Navigation and Navigable Waters 3 2014-07-01 2014-07-01 false Assigned frequencies. 401.61 Section 401.61 Navigation and Navigable Waters SAINT LAWRENCE SEAWAY DEVELOPMENT CORPORATION, DEPARTMENT... frequencies. The Seaway stations operate on the following assigned VHF frequencies: 156.8 MHz—(channel 16...

  8. 47 CFR 74.1202 - Frequency assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency assignment. 74.1202 Section 74.1202... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... stations. The application must be specific with regard to the frequency requested. Only one output channel...

  9. 33 CFR 401.61 - Assigned frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Assigned frequencies. 401.61 Section 401.61 Navigation and Navigable Waters SAINT LAWRENCE SEAWAY DEVELOPMENT CORPORATION, DEPARTMENT... frequencies. The Seaway stations operate on the following assigned VHF frequencies: 156.8 MHz—(channel 16...

  10. 33 CFR 401.61 - Assigned frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 33 Navigation and Navigable Waters 3 2012-07-01 2012-07-01 false Assigned frequencies. 401.61 Section 401.61 Navigation and Navigable Waters SAINT LAWRENCE SEAWAY DEVELOPMENT CORPORATION, DEPARTMENT... frequencies. The Seaway stations operate on the following assigned VHF frequencies: 156.8 MHz—(channel 16...

  11. 47 CFR 74.502 - Frequency assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency assignment. 74.502 Section 74.502... § 74.502 Frequency assignment. (a) Except as provided in NG30, broadcast auxiliary stations licensed as... Frequency Allocations. These stations will be protected from possible interference caused by new users of...

  12. 47 CFR 74.1202 - Frequency assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency assignment. 74.1202 Section 74.1202... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... stations. The application must be specific with regard to the frequency requested. Only one output channel...

  13. 47 CFR 74.502 - Frequency assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency assignment. 74.502 Section 74.502... § 74.502 Frequency assignment. (a) Except as provided in NG30, broadcast auxiliary stations licensed as... Frequency Allocations. These stations will be protected from possible interference caused by new users of...

  14. 47 CFR 74.1202 - Frequency assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency assignment. 74.1202 Section 74.1202... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... stations. The application must be specific with regard to the frequency requested. Only one output channel...

  15. 33 CFR 401.61 - Assigned frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 33 Navigation and Navigable Waters 3 2013-07-01 2013-07-01 false Assigned frequencies. 401.61 Section 401.61 Navigation and Navigable Waters SAINT LAWRENCE SEAWAY DEVELOPMENT CORPORATION, DEPARTMENT... frequencies. The Seaway stations operate on the following assigned VHF frequencies: 156.8 MHz—(channel 16...

  16. 47 CFR 74.502 - Frequency assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency assignment. 74.502 Section 74.502... § 74.502 Frequency assignment. (a) Except as provided in NG30, broadcast auxiliary stations licensed as... Frequency Allocations. These stations will be protected from possible interference caused by new users of...

  17. 33 CFR 401.61 - Assigned frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 33 Navigation and Navigable Waters 3 2011-07-01 2011-07-01 false Assigned frequencies. 401.61 Section 401.61 Navigation and Navigable Waters SAINT LAWRENCE SEAWAY DEVELOPMENT CORPORATION, DEPARTMENT... frequencies. The Seaway stations operate on the following assigned VHF frequencies: 156.8 MHz—(channel 16...

  18. 47 CFR 74.502 - Frequency assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency assignment. 74.502 Section 74.502... § 74.502 Frequency assignment. (a) Except as provided in NG30, broadcast auxiliary stations licensed as... Frequency Allocations. These stations will be protected from possible interference caused by new users of...

  19. 47 CFR 74.1202 - Frequency assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency assignment. 74.1202 Section 74.1202... FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM broadcast... stations. The application must be specific with regard to the frequency requested. Only one output channel...

  20. 47 CFR 74.103 - Frequency assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency assignment. 74.103 Section 74.103 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO....103 Frequency assignment. (a) Frequencies allocated to broadcasting and the various categories of...

  1. 47 CFR 80.509 - Frequency assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Frequency assignment. 80.509 Section 80.509 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Private Coast Stations and Marine Utility Stations § 80.509 Frequency assignment...

  2. 47 CFR 74.1202 - Frequency assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO, AUXILIARY, SPECIAL BROADCAST AND OTHER PROGRAM DISTRIBUTIONAL SERVICES FM Broadcast Translator Stations and FM Broadcast Booster Stations § 74.1202 Frequency assignment. (a) An applicant for a new FM...

  3. THE WEAPONS-ASSIGNMENT PROBLEM

    DTIC Science & Technology

    sub i 1 = or i = or m . The probability that the (ith) target will not be hit if attacked by the (jth) missile is a known quantity P sub ij, 1 = or i... or m , 1 = or j = or n. It is assumed that a hit results in total destruction of the target. The report considers the assignment of missiles to targets to effect the maximum expected return.

  4. 47 CFR 74.602 - Frequency assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... as described in paragraph (i) of this section. Broadcast network-entities may also use the 1990-2110... Remote Pickup Service, and Local Television Transmission Service licensees will be required to use the... existing users in the area. The Commission reserves the right to assign frequencies other than...

  5. 47 CFR 74.802 - Frequency assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... locations removed from existing co-channel TV broadcast stations by not less than the following distances... within the assignable frequencies may be combined to form a channel whose maximum bandwidth shall not... safety wireless licensees in the 700 MHz band. (2) Any low power auxiliary station that operates...

  6. 47 CFR 78.18 - Frequency assignments.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... following GROUP A CHANNELS. 2 See paragraph (l) of this section. (4) The Cable Television Relay Service...

  7. 47 CFR 78.18 - Frequency assignments.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... following GROUP A CHANNELS. 2 See paragraph (l) of this section. (4) The Cable Television Relay Service...

  8. 47 CFR 78.18 - Frequency assignments.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... following GROUP A CHANNELS. 2 See paragraph (l) of this section. (4) The Cable Television Relay Service...

  9. 47 CFR 78.18 - Frequency assignments.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES CABLE TELEVISION RELAY SERVICE Applications and Licenses § 78.18 Frequency assignments. (a) The Cable Television Relay Service is... following GROUP A CHANNELS. 2 See paragraph (l) of this section. (4) The Cable Television Relay Service...

  10. The airport gate assignment problem: a survey.

    PubMed

    Bouras, Abdelghani; Ghaleb, Mageed A; Suryahatmaja, Umar S; Salem, Ahmed M

    2014-01-01

    The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area.

  11. The Airport Gate Assignment Problem: A Survey

    PubMed Central

    Ghaleb, Mageed A.; Salem, Ahmed M.

    2014-01-01

    The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area. PMID:25506074

  12. Unifying Temporal and Structural Credit Assignment Problems

    NASA Technical Reports Server (NTRS)

    Agogino, Adrian K.; Tumer, Kagan

    2004-01-01

    Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the structural credit assignment problem of determining the contributions of a particular agent to a common task. Instead, time-extended single-agent systems have the temporal credit assignment problem of determining the contribution of a particular action to the quality of the full sequence of actions. Traditionally these two problems are considered different and are handled in separate ways. In this article we show how these two forms of the credit assignment problem are equivalent. In this unified frame-work, a single-agent Markov decision process can be broken down into a single-time-step multi-agent process. Furthermore we show that Monte-Carlo estimation or Q-learning (depending on whether the values of resulting actions in the episode are known at the time of learning) are equivalent to different agent utility functions in a multi-agent system. This equivalence shows how an often neglected issue in multi-agent systems is equivalent to a well-known deficiency in multi-time-step learning and lays the basis for solving time-extended multi-agent problems, where both credit assignment problems are present.

  13. A multistage linear array assignment problem

    NASA Technical Reports Server (NTRS)

    Nicol, David M.; Shier, D. R.; Kincaid, R. K.; Richards, D. S.

    1988-01-01

    The implementation of certain algorithms on parallel processing computing architectures can involve partitioning contiguous elements into a fixed number of groups, each of which is to be handled by a single processor. It is desired to find an assignment of elements to processors that minimizes the sum of the maximum workloads experienced at each stage. This problem can be viewed as a multi-objective network optimization problem. Polynomially-bounded algorithms are developed for the case of two stages, whereas the associated decision problem (for an arbitrary number of stages) is shown to be NP-complete. Heuristic procedures are therefore proposed and analyzed for the general problem. Computational experience with one of the exact problems, incorporating certain pruning rules, is presented with one of the exact problems. Empirical results also demonstrate that one of the heuristic procedures is especially effective in practice.

  14. 47 CFR 2.102 - Assignment of frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 1 2011-10-01 2011-10-01 false Assignment of frequencies. 2.102 Section 2.102 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.102 Assignment...

  15. 47 CFR 2.102 - Assignment of frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 1 2014-10-01 2014-10-01 false Assignment of frequencies. 2.102 Section 2.102 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.102 Assignment...

  16. 47 CFR 2.102 - Assignment of frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 1 2013-10-01 2013-10-01 false Assignment of frequencies. 2.102 Section 2.102 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.102 Assignment...

  17. 47 CFR 2.102 - Assignment of frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Assignment of frequencies. 2.102 Section 2.102 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.102 Assignment...

  18. 47 CFR 2.102 - Assignment of frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 1 2012-10-01 2012-10-01 false Assignment of frequencies. 2.102 Section 2.102 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL FREQUENCY ALLOCATIONS AND RADIO TREATY MATTERS; GENERAL RULES AND REGULATIONS Allocation, Assignment, and Use of Radio Frequencies § 2.102 Assignment...

  19. Constrained neural approaches to quadratic assignment problems.

    PubMed

    Ishii, S; Sato, M

    1998-08-01

    In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good solutions in a short period of time. Some of them can also be applied to large-scale problems, say of size N>/=300.

  20. 47 CFR 90.723 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Selection and assignment of frequencies. 90.723... SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the 220-222 MHz Band § 90.723 Selection and assignment of frequencies. (a) Phase II applications for...

  1. Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications

    DTIC Science & Technology

    2015-06-24

    AFRL-AFOSR-VA-TR-2015-0281 Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications Hans Mittelmann...2012 - March 2015 4. TITLE AND SUBTITLE Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications 5a...problems. The size 16 three-dimensional quadratic assignment problem Q3AP from wireless communications was solved using a sophisticated approach

  2. 47 CFR 101.147 - Frequency assignments.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ...) Frequencies in this band are shared with stations in the earth exploration satellite service (space to earth...-case basis to Government or non-Government space research earth stations for telecommand purposes in connection with deep space research. (8) This frequency band is shared with station(s) in the...

  3. 47 CFR 101.147 - Frequency assignments.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... exploration satellite service (space to earth). (14) Frequencies in this band are shared with stations in the... MHz may be authorized on a case-by-case basis to Government or non-Government space research earth stations for telecommand purposes in connection with deep space research. (8) This frequency band is...

  4. 47 CFR 101.147 - Frequency assignments.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ...) Frequencies in this band are shared with stations in the earth exploration satellite service (space to earth...-case basis to Government or non-Government space research earth stations for telecommand purposes in connection with deep space research. (8) This frequency band is shared with station(s) in the...

  5. 47 CFR 101.147 - Frequency assignments.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... exploration satellite service (space to earth). (14) Frequencies in this band are shared with stations in the... MHz may be authorized on a case-by-case basis to Government or non-Government space research earth stations for telecommand purposes in connection with deep space research. (8) This frequency band is...

  6. The generalized pole assignment problem. [dynamic output feedback problems

    NASA Technical Reports Server (NTRS)

    Djaferis, T. E.; Mitter, S. K.

    1979-01-01

    Two dynamic output feedback problems for a linear, strictly proper system are considered, along with their interrelationships. The problems are formulated in the frequency domain and investigated in terms of linear equations over rings of polynomials. Necessary and sufficient conditions are expressed using genericity.

  7. 47 CFR 90.621 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... application the frequencies on which the proposed system will operate pursuant to a recommendation by the... frequencies by including in their applications the frequencies requested. (1) For trunked systems, the... the frequencies listed in §§ 90.615, 90.617, and 90.619. (2) For conventional systems the assignment...

  8. 47 CFR 101.147 - Frequency assignments.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... stations in the earth exploration satellite service (space to earth). (14) Frequencies in this band are...-Government space research earth stations for telecommand purposes in connection with deep space research. (8... Radiocommunications Services. (9) The band segments 10.95-11.2 and 11.45-11.7 GHz are shared with space...

  9. Real life working shift assignment problem

    NASA Astrophysics Data System (ADS)

    Sze, San-Nah; Kwek, Yeek-Ling; Tiong, Wei-King; Chiew, Kang-Leng

    2017-07-01

    This study concerns about the working shift assignment in an outlet of Supermarket X in Eastern Mall, Kuching. The working shift assignment needs to be solved at least once in every month. Current approval process of working shifts is too troublesome and time-consuming. Furthermore, the management staff cannot have an overview of manpower and working shift schedule. Thus, the aim of this study is to develop working shift assignment simulation and propose a working shift assignment solution. The main objective for this study is to fulfill manpower demand at minimum operation cost. Besides, the day off and meal break policy should be fulfilled accordingly. Demand based heuristic is proposed to assign working shift and the quality of the solution is evaluated by using the real data.

  10. Behavior of 1 Ω resistors at frequencies below 1 Hz and the problem of assigning a dc value

    NASA Astrophysics Data System (ADS)

    Fletcher, Nick; Götz, Martin; Rolland, Benjamin; Pesel, Eckart

    2015-08-01

    This paper presents a systematic study of the effects of reversals of current polarity on 1 Ω standard resistors. A selection of 1 Ω standards were measured on a dc cryogenic current comparator bridge and also on an ac current comparator bridge operating at 1 Hz. We find that the apparent 4 terminal resistance depends strongly on the dc reversal rate, in one case showing a variation of more than 0.1 μΩ/Ω for cycle times between 10 s and 1000 s. Even in the best cases, effects of at least 0.01 μΩ/Ω are present. Furthermore, the assumption that the apparent resistance value converges to a limiting value for long waiting times after reversal is not always upheld, making it difficult to quote a simple dc value. Existing models of Peltier heating at wire junctions do not completely explain our observations. The problems presented have been the limiting factor for 1 Ω measurements as part of a recent on-site comparison of quantum Hall effect resistance standards.

  11. DNA-based computing of strategic assignment problems.

    PubMed

    Shu, Jian-Jun; Wang, Qi-Wen; Yong, Kian-Yan

    2011-05-06

    DNA-based computing is a novel technique to tackle computationally difficult problems, in which computing time grows exponentially corresponding to problematic size. A strategic assignment problem is a typical nondeterministic polynomial problem, which is often associated with strategy applications. In this Letter, a new approach dealing with strategic assignment problems is proposed based on manipulating DNA strands, which is believed to be better than the conventional silicon-based computing in solving the same problem.

  12. Linear Optimization of Frequency Spectrum Assignments Across System

    DTIC Science & Technology

    2016-03-01

    selection tools, frequency allocation, transmission optimization, electromagnetic maneuver warfare, electronic protection, assignment model 15. NUMBER... ELECTROMAGNETIC MANEUVER WARFARE .............................5  B.  THE SPECTRUM AS THE NEWEST DOMAIN ..................................6  C.  A FULL...concept AW air warfare CM communications CNO Chief of Naval Operations DT data transmission EA electronic attack EME electromagnetic

  13. 47 CFR 73.702 - Assignment and use of frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... allocations. Where practical, assigned frequencies shall be within the following bands, which are allocated to... Regulations, the following bands are allocated to the broadcasting service on a primary and exclusive basis... allocation. The band 7200-7300 kHz is allocated to the broadcasting service on a primary and exclusive...

  14. 47 CFR 73.702 - Assignment and use of frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ...,800 kHz; 17,480-17,900 kHz; 18,900-19,020 kHz; 21,450-21,850 kHz; and 25,670-26,100 kHz. (ii) Co... requested for assignment must be as near as practicable to the optimum working frequency (unless otherwise...

  15. Solution of the determinantal assignment problem using the Grassmann matrices

    NASA Astrophysics Data System (ADS)

    Karcanias, Nicos; Leventides, John

    2016-02-01

    The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation ? where ? is an n -dimensional vector space over ? which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of ?, and it is in turn characterised by the set of quadratic Plücker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector ? are given in terms of the rank properties of the Grassmann matrix, ? of the vector ?, which is constructed by the coordinates of ?. It is shown that the exterior equation is solvable (? is decomposable), if and only if ? where ?; the solution space for a decomposable ?, is the space ?. This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the Hodge-Grassmann matrix as the dual of the Grassmann matrix. The connections of the Hodge-Grassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist.

  16. Clustered Self Organising Migrating Algorithm for the Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman

    2009-08-01

    An approach of population dynamics and clustering for permutative problems is presented in this paper. Diversity indicators are created from solution ordering and its mapping is shown as an advantage for population control in metaheuristics. Self Organising Migrating Algorithm (SOMA) is modified using this approach and vetted with the Quadratic Assignment Problem (QAP). Extensive experimentation is conducted on benchmark problems in this area.

  17. The double-assignment method for the exponential chaotic tabu search in quadratic assignment problems

    NASA Astrophysics Data System (ADS)

    Shibata, Kazuaki; Horio, Yoshihiko; Aihara, Kazuyuki

    The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems. An exponential chaotic tabu search using a 2-opt algorithm driven by chaotic neuro-dynamics has been proposed as one heuristic method for solving QAPs. In this paper we first propose a new local search, the double-assignment method, suitable for the exponential chaotic tabu search, which adopts features of the Lin-Kernighan algorithm. We then introduce chaotic neuro-dynamics into the double-assignment method to propose a novel exponential chaotic tabu search. We further improve the proposed exponential chaotic tabu search with the double-assignment method by enhancing the effect of chaotic neuro-dynamics.

  18. A hybrid hopfield network-simulated annealing approach for frequency assignment in satellite communications systems.

    PubMed

    Salcedo-Sanz, Sancho; Santiago-Mozos, Ricardo; Bousoño-Calzón, Carlos

    2004-04-01

    A hybrid Hopfield network-simulated annealing algorithm (HopSA) is presented for the frequency assignment problem (FAP) in satellite communications. The goal of this NP-complete problem is minimizing the cochannel interference between satellite communication systems by rearranging the frequency assignment, for the systems can accommodate the increasing demands. The HopSA algorithm consists of a fast digital Hopfield neural network which manages the problem constraints hybridized with a simulated annealing which improves the quality of the solutions obtained. We analyze the problem and its formulation, describing and discussing the HopSA algorithm and solving a set of benchmark problems. The results obtained are compared with other existing approaches in order to show the performance of the HopSA approach.

  19. A Circuit Simulation Technique for Congested Network Traffic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Cho, Hsun-Jung; Huang, Heng

    2007-12-01

    The relation between electrical circuit and traffic network has been proposed by Sasaki and Inouye, but they proposed link cost function is a linear function which cannot present the congestion situation. Cho and Huang extended the link cost function to a nonlinear function which can explain the congested network. In this paper, we proposed a foremost and novel approach to solve the traffic assignment problem (TAP) by simulating the electrical circuit network which consists of nonlinear link cost function models. Comparing with the solutions of Frank-Wolfe algorithm, the simulation results are nearly identical. Thus, the simulation of a network circuit model can be applied to solve network traffic assignment problems. Finally, two examples are proposed, and the results confirmed that electrical circuit simulation is workable in solving congested network traffic assignment problems.

  20. Locomotive assignment problem with train precedence using genetic algorithm

    NASA Astrophysics Data System (ADS)

    Noori, Siamak; Ghannadpour, Seyed Farid

    2012-07-01

    This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should be serviced earlier than others. This problem is modeled using vehicle routing and scheduling problem where trains representing the customers are supposed to be serviced in pre-specified hard/soft fuzzy time windows. A two-phase approach is used which, in the first phase, the multi-depot locomotive assignment is converted to a set of single depot problems, and after that, each single depot problem is solved heuristically by a hybrid genetic algorithm. In the genetic algorithm, various heuristics and efficient operators are used in the evolutionary search. The suggested algorithm is applied to solve the medium sized numerical example to check capabilities of the model and algorithm. Moreover, some of the results are compared with those solutions produced by branch-and-bound technique to determine validity and quality of the model. Results show that suggested approach is rather effective in respect of quality and time.

  1. Web-Based Problem-Solving Assignment and Grading System

    NASA Astrophysics Data System (ADS)

    Brereton, Giles; Rosenberg, Ronald

    2014-11-01

    In engineering courses with very specific learning objectives, such as fluid mechanics and thermodynamics, it is conventional to reinforce concepts and principles with problem-solving assignments and to measure success in problem solving as an indicator of student achievement. While the modern-day ease of copying and searching for online solutions can undermine the value of traditional assignments, web-based technologies also provide opportunities to generate individualized well-posed problems with an infinite number of different combinations of initial/final/boundary conditions, so that the probability of any two students being assigned identical problems in a course is vanishingly small. Such problems can be designed and programmed to be: single or multiple-step, self-grading, allow students single or multiple attempts; provide feedback when incorrect; selectable according to difficulty; incorporated within gaming packages; etc. In this talk, we discuss the use of a homework/exam generating program of this kind in a single-semester course, within a web-based client-server system that ensures secure operation.

  2. 47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Maritime frequencies assignable to aircraft... SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Frequencies Aircraft Stations § 80.379 Maritime frequencies assignable to aircraft stations. This section describes the maritime frequencies assignable...

  3. 47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Maritime frequencies assignable to aircraft... SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Frequencies Aircraft Stations § 80.379 Maritime frequencies assignable to aircraft stations. This section describes the maritime frequencies assignable...

  4. 47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 5 2014-10-01 2014-10-01 false Maritime frequencies assignable to aircraft... SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Frequencies Aircraft Stations § 80.379 Maritime frequencies assignable to aircraft stations. This section describes the maritime frequencies assignable...

  5. 47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Maritime frequencies assignable to aircraft... SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Frequencies Aircraft Stations § 80.379 Maritime frequencies assignable to aircraft stations. This section describes the maritime frequencies assignable...

  6. 47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Maritime frequencies assignable to aircraft... SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Frequencies Aircraft Stations § 80.379 Maritime frequencies assignable to aircraft stations. This section describes the maritime frequencies assignable...

  7. Solving the quadratic assignment problem with clues from nature.

    PubMed

    Nissen, V

    1994-01-01

    This paper describes a new evolutionary approach to solving quadratic assignment problems. The proposed technique is based loosely on a class of search and optimization algorithms known as evolution strategies (ES). These methods are inspired by the mechanics of biological evolution and have been applied successfully to a variety of difficult problems, particularly in continuous optimization. The combinatorial variant of ES presented here performs very well on the given test problems as compared with the standard 2-Opt heuristic and results with simulated annealing and tabu search. Extensions for practical applications in factory layout are described.

  8. A polyhedral approach to a constrained assignment problem

    SciTech Connect

    Hefner, A.; Kleinschmidt, P.

    1994-12-31

    We consider the following problem (called the Master/Slave-Matching Problem): Given an undirected bipartite graph G(V, E) with bipartition V = W {union} U and a digraph D = (U, A). A Master/Slave-matching in G is a matching in G such that for every arc (u, v) {element_of} A the node v is matched whenever the node u is matched. The problem is, to find a Master/Slave-matching of maximum cardinality. The motivation for the study of this problem arises from the area of manpower scheduling where one tries to assign workers to jobs such that the assigned jobs satisfy certain dependence constraints. Let k be the maximum size of a (weakly) connected component of D. First we show that the problem is NP-hard and remains NP-hard even if k = 3. Second we focus on the case k = 2: We use polyhedral combinatorics to establish a min-max equation which well-characterizes the cardinality of a maximum Master/Slave-matching. This equation can be viewed as a generalization of Konig`s min-max theorem. Finally, we show (for k = 2) how the weighted Master/Slave-Matching Problem (where every edge e {element_of} E has a nonnegative weight) can be transformed to the (non-bipartite) weighted Matching Problem.

  9. Consultant-Guided Search Algorithms for the Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Iordache, Serban

    Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a large variety of problems, it is important to see how CGS behaves when applied to other classes of problems. In this paper, we propose an algorithm for the Quadratic Assignment Problem (QAP), which hybridizes CGS with a local search procedure. Our experimental results show that CGS is able to compete in terms of solution quality with one of the best Ant Colony Optimization algorithms, the MAX-MIN Ant System.

  10. Restart-Based Genetic Algorithm for the Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Misevicius, Alfonsas

    The power of genetic algorithms (GAs) has been demonstrated for various domains of the computer science, including combinatorial optimization. In this paper, we propose a new conceptual modification of the genetic algorithm entitled a "restart-based genetic algorithm" (RGA). An effective implementation of RGA for a well-known combinatorial optimization problem, the quadratic assignment problem (QAP), is discussed. The results obtained from the computational experiments on the QAP instances from the publicly available library QAPLIB show excellent performance of RGA. This is especially true for the real-life like QAPs.

  11. A combined strategy for solving quadratic assignment problem

    NASA Astrophysics Data System (ADS)

    Ahyaningsih, Faiz

    2017-08-01

    The quadratic assignment problem is a combinatorial problem of deciding the placement of facilities in specified locations in such a way as to minimize a nonconvex objective function expressed in terms of flow between facilities, and distance between location. Due to the non-convexity nature of the problem, therefore to get a `good' starting point is necessary in order to obtain a better optimal solution. In this paper we propose a combined strategy (random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get `optimal' solution). As a computational experience we've solved the problem of Esc 16b, Esc 16c and Esc 16h from QAPLIB. Finally, we present a comparative study between Combined Strategy and Data -Guided Lexisearch Algorithm. The computational study shows the effectiveness of our proposed combined strategy.

  12. 47 CFR 80.479 - Assignment and use of frequencies for AMTS.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Assignment and use of frequencies for AMTS. 80... Assignment and use of frequencies for AMTS. (a) The frequencies assignable to AMTS stations are listed in... is calculated using the F(50, 50) field strength chart for Channels 7 through 13 in § 73.699 (Fig. 10...

  13. 47 CFR 80.479 - Assignment and use of frequencies for AMTS.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Assignment and use of frequencies for AMTS. 80... Assignment and use of frequencies for AMTS. (a) The frequencies assignable to AMTS stations are listed in subpart H of this subpart. (b) The transmissions from a station of an AMTS geographic area licensee...

  14. 47 CFR 80.479 - Assignment and use of frequencies for AMTS.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 5 2014-10-01 2014-10-01 false Assignment and use of frequencies for AMTS. 80... Assignment and use of frequencies for AMTS. (a) The frequencies assignable to AMTS stations are listed in subpart H of this subpart. (b) The transmissions from a station of an AMTS geographic area licensee...

  15. 47 CFR 80.479 - Assignment and use of frequencies for AMTS.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Assignment and use of frequencies for AMTS. 80... Assignment and use of frequencies for AMTS. (a) The frequencies assignable to AMTS stations are listed in subpart H of this subpart. (b) The transmissions from a station of an AMTS geographic area licensee...

  16. 47 CFR 80.479 - Assignment and use of frequencies for AMTS.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Assignment and use of frequencies for AMTS. 80... Assignment and use of frequencies for AMTS. (a) The frequencies assignable to AMTS stations are listed in subpart H of this subpart. (b) The transmissions from a station of an AMTS geographic area licensee...

  17. Principles for problem aggregation and assignment in medium scale multiprocessors

    NASA Technical Reports Server (NTRS)

    Nicol, David M.; Saltz, Joel H.

    1987-01-01

    One of the most important issues in parallel processing is the mapping of workload to processors. This paper considers a large class of problems having a high degree of potential fine grained parallelism, and execution requirements that are either not predictable, or are too costly to predict. The main issues in mapping such a problem onto medium scale multiprocessors are those of aggregation and assignment. We study a method of parameterized aggregation that makes few assumptions about the workload. The mapping of aggregate units of work onto processors is uniform, and exploits locality of workload intensity to balance the unknown workload. In general, a finer aggregate granularity leads to a better balance at the price of increased communication/synchronization costs; the aggregation parameters can be adjusted to find a reasonable granularity. The effectiveness of this scheme is demonstrated on three model problems: an adaptive one-dimensional fluid dynamics problem with message passing, a sparse triangular linear system solver on both a shared memory and a message-passing machine, and a two-dimensional time-driven battlefield simulation employing message passing. Using the model problems, the tradeoffs are studied between balanced workload and the communication/synchronization costs. Finally, an analytical model is used to explain why the method balances workload and minimizes the variance in system behavior.

  18. Neural-network dedicated processor for solving competitive assignment problems

    NASA Technical Reports Server (NTRS)

    Eberhardt, Silvio P. (Inventor)

    1993-01-01

    A neural-network processor for solving first-order competitive assignment problems consists of a matrix of N x M processing units, each of which corresponds to the pairing of a first number of elements of (R sub i) with a second number of elements (C sub j), wherein limits of the first number are programmed in row control superneurons, and limits of the second number are programmed in column superneurons as MIN and MAX values. The cost (weight) W sub ij of the pairings is programmed separately into each PU. For each row and column of PU's, a dedicated constraint superneuron insures that the number of active neurons within the associated row or column fall within a specified range. Annealing is provided by gradually increasing the PU gain for each row and column or increasing positive feedback to each PU, the latter being effective to increase hysteresis of each PU or by combining both of these techniques.

  19. Planning Nurses in Maternity Care: a Stochastic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Phillipson, Frank

    2015-05-01

    With 23 percent of all births taking place at home, The Netherlands have the highest rate of home births in the world. Also if the birth did not take place at home, it is not unusual for the mother and child to be out of hospital in a few hours after the baby was born. The explanation for both is the very well organised maternity care system. However, getting the right maternity care nurse available on time introduces a complex planning issue that can be recognized as a Stochastic Assignment Problem. In this paper an expert rule based approach is combined with scenario analysis to support the planner of the maternity care agency in his work.

  20. 47 CFR 80.455 - Assignment and use of frequencies for manual Morse code telegraphy.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Assignment and use of frequencies for manual Morse code telegraphy. 80.455 Section 80.455 Telecommunication FEDERAL COMMUNICATIONS COMMISSION... Telegraphy § 80.455 Assignment and use of frequencies for manual Morse code telegraphy. (a) The frequencies...

  1. 47 CFR 80.455 - Assignment and use of frequencies for manual Morse code telegraphy.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Assignment and use of frequencies for manual Morse code telegraphy. 80.455 Section 80.455 Telecommunication FEDERAL COMMUNICATIONS COMMISSION... Telegraphy § 80.455 Assignment and use of frequencies for manual Morse code telegraphy. (a) The frequencies...

  2. Cerebellar Synaptic Plasticity and the Credit Assignment Problem.

    PubMed

    Jörntell, Henrik

    2016-04-01

    The mechanism by which a learnt synaptic weight change can contribute to learning or adaptation of brain function is a type of credit assignment problem, which is a key issue for many parts of the brain. In the cerebellum, detailed knowledge not only of the local circuitry connectivity but also of the topography of different sources of afferent/external information makes this problem particularly tractable. In addition, multiple forms of synaptic plasticity and their general rules of induction have been identified. In this review, we will discuss the possible roles of synaptic and cellular plasticity at specific locations in contributing to behavioral changes. Focus will be on the parts of the cerebellum that are devoted to limb control, which constitute a large proportion of the cortex and where the knowledge of the external connectivity is particularly well known. From this perspective, a number of sites of synaptic plasticity appear to primarily have the function of balancing the overall level of activity in the cerebellar circuitry, whereas the locations at which synaptic plasticity leads to functional changes in terms of limb control are more limited. Specifically, the postsynaptic forms of long-term potentiation (LTP) and long-term depression (LTD) at the parallel fiber synapses made on interneurons and Purkinje cells, respectively, are the types of plasticity that mediate the widest associative capacity and the tightest link between the synaptic change and the external functions that are to be controlled.

  3. Co-Assignment of the Molecular Vibrational Frequencies in Different Electronic States

    NASA Astrophysics Data System (ADS)

    Panchenko, Yurii; Abramenkov, Alexander

    2016-06-01

    Ultrafast electron diffraction experimental data for the structural parameters of molecules in excited electronic states are comparatively uncommon, hence these parameters are largely unknown. However, because differences between the molecular geometries of excited and ground electronic states cause differences in their experimental vibrational spectra it is important to establish a correspondence between the molecular vibrational frequencies in the ground state and those of the excited state of interest. The correct co-assignment of the experimental vibrational frequencies between two different electronic states of a molecule may be determined by the analog of the Duschinsky matrix D. This matrix D is defined as D = (LI)-1LII where LI and LII are the matrices of the vibrational modes of the two states of the molecule under investigation. They are obtained by solving the vibrational problems in the I and II electronic states, respectively. Choosing the dominant elements in columns of the D matrix and permuting these columns to arrange these elements along the diagonal of the transformed matrix Dast makes it possible to establish the correct co-assignment of the calculated frequencies in the two electronic states. The rows of Dast are for the vibrations in the I electronic state, whereas the columns are for vibrations in the II electronic state. The results obtained may be tested by analogous calculations of Dast for isotopologues. The feasibility of co-assignments of the vibrational frequencies in the ground and T_1 and S_1 excited electronic states are demonstrated for trans-C_2O_2F_2. The analogs of the Duschinsky matrix Dast were used to juxtapose the vibrational frequencies of this molecule calculated at the CASPT2/cc-pVTZ level in the S_0, T_1 and S_1 states. F. Duschinsky, Acta Physicochim. URSS, 7(4), 551-566 (1937). Yu. N. Panchenko, Vibrational spectroscopy, 68, 236-240 (2013).

  4. Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube

    NASA Astrophysics Data System (ADS)

    Mittelmann, Hans; Peng, Jiming; Wu, Xiaolin

    2009-07-01

    In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associated hypercube allow us to obtain partial information regarding the optimal solutions and thus shrink the search space and improve all the existing QAP solvers for the underlying QAPs. Secondly, we use graph modeling technique to derive a new integer linear program (ILP) models for the underlying QAPs. The new ILP model has n(n-1) binary variables and O(n3 log(n)) linear constraints. This yields the smallest known number of binary variables for the ILP reformulation of QAPs. Various relaxations of the new ILP model are obtained based on the graphical characterization of the hypercube, and the lower bounds provided by the LP relaxations of the new model are analyzed and compared with what provided by several classical LP relaxations of QAPs in the literature.

  5. 47 CFR 90.621 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the 806-824, 851-869, 896-901, and 935-940 MHz Bands Policies Governing the Processing of Applications...

  6. 47 CFR 90.621 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the 806-824, 851-869, 896-901, and 935-940 MHz Bands Policies Governing the Processing of Applications...

  7. 47 CFR 73.702 - Assignment and use of frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... Section 73.702 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES... technical data with reference to the frequencies and hours of operation, including calculated field strengths delivered to the zones or areas of reception. Note 2: It is preferable that calculated...

  8. 47 CFR 73.702 - Assignment and use of frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... Section 73.702 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES... technical data with reference to the frequencies and hours of operation, including calculated field strengths delivered to the zones or areas of reception. Note 2: It is preferable that calculated...

  9. 47 CFR 73.702 - Assignment and use of frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ..., new requests for frequencies and hours must be submitted at least 30 days before it is desired to... divided the world into three Regions, which are defined in 47 CFR 2.104(b). The bands 7,200-7,300 kHz and.... Technical Standards, Series A (and supplements thereto), in order for the I.F.R.B. to afford the notified...

  10. Lexical stress assignment as a problem of probabilistic inference.

    PubMed

    Jouravlev, Olessia; Lupker, Stephen J

    2015-10-01

    A new conceptualization of the process of stress assignment, couched in the principles of (Bayesian) probabilistic inference, is introduced in this paper. According to this approach, in deciding where to place stress in a polysyllabic word, a reader estimates the posterior probabilities of alternative stress patterns. This estimation is accomplished by adjusting a prior belief about the likelihoods of alternative stress patterns (derived from experience with the distribution of stress patterns in the language) by using lexical and non-lexical sources of evidence for stress derived from the orthographic input. The proposed theoretical framework was used to compute probabilities of stress patterns for Russian disyllabic words and nonwords which were then compared with the performance of readers. The results showed that the estimated probabilities of stress patterns were reflective of actual stress assignment performance and of naming latencies, suggesting that the mechanisms that are involved in the process of stress assignment might indeed be inferentially-based.

  11. The role of service areas in the optimization of FSS orbital and frequency assignments

    NASA Technical Reports Server (NTRS)

    Levis, C. A.; Wang, C. W.; Yamamura, Y.; Reilly, C. H.; Gonsalvez, D. J.

    1985-01-01

    A relationship is derived, on a single-entry interference basis, for the minimum allowable spacing between two satellites as a function of electrical parameters and service-area geometries. For circular beams, universal curves relate the topocentric satellite spacing angle to the service-area separation angle measured at the satellite. The corresponding geocentric spacing depends only weakly on the mean longitude of the two satellites, and this is true also for alliptical antenna beams. As a consequence, if frequency channels are preassigned, the orbital assignment synthesis of a satellite system can be formulated as a mixed-integer programming (MIP) problem or approximated by a linear programming (LP) problem, with the interference protection requirements enforced by constraints while some linear function is optimized. Possible objective-function choices are discussed and explicit formulations are presented for the choice of the sum of the absolute deviations of the orbital locations from some prescribed ideal location set. A test problem is posed consisting of six service areas, each served by one satellite, all using elliptical antenna beams and the same frequency channels. Numerical results are given for the three ideal location prescriptions for both the MIP and LP formulations. The resulting scenarios also satisfy reasonable aggregate interference protection requirements.

  12. A United Framework for Solving Multiagent Task Assignment Problems

    DTIC Science & Technology

    2007-12-01

    combination function . . . . . . . . . . . . . . . . . 22 S CMTS solution . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 U ( S ) solution...utility value . . . . . . . . . . . . . . . . . . . . . . . . 22 FU assignment utility combination function . . . . . . . . . . . . . 22 E[ U ( S )] expected...SR Class (d) MT-MR Class Figure 2.1: MRTA Class Examples. objective is to construct a solution S that optimizes the utility value U , where U ( S ) = ∑ (i

  13. On the Massively Parallel Solution of the Assignment Problem

    DTIC Science & Technology

    1990-12-01

    advantage of the updated price information of all the previous bids, it usually takes fewer total bids to produce an optimal assignment. The Jacobi method , however...the information at time t, whereas a "Gauss-Seidel" iteration updates a dual variable with respect to the most recent information. Thus a Jacobi method allows

  14. 47 CFR 101.805 - Assignment of frequencies to mobile stations.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Assignment of frequencies to mobile stations. 101.805 Section 101.805 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Local Television Transmission Service § 101.805 Assignment...

  15. A New Approach for Assigning Individually Prescribed Problems.

    ERIC Educational Resources Information Center

    Kawasaki, Zenshiro

    1979-01-01

    Describes an automatic exercise-problem selection method which is based on the theory of Learning Diagnosis and Treatment (LDT). An optimum problem for each learner is identified by comparing the required readiness for the problem and the learner's mastery level. (Author/CMV)

  16. Competitive neural architecture for hardware solution to the assignment problem

    NASA Technical Reports Server (NTRS)

    Eberhardt, S. P.; Daud, T.; Kerns, D. A.; Brown, T. X.; Thakoor, A. P.

    1991-01-01

    The architecture for competitive assignment is described with attention given to the VLSI design and critical circuits fabricated in complementary metal-oxide semiconductor. The local application of association costs to processing units reduces the connectivity to the number of VLSI-compatible processing units. 'Hysteretic annealing' is discussed and when compared to mean-field annealing is found to enhance processing-unit gain and provide near-optimal solutions in about 150 microsec.

  17. Effects of Problem Order on Accuracy, Preference, and Choice of Multiplication Assignments

    ERIC Educational Resources Information Center

    Jaspers, Kathryn E.; Skinner, Christopher H.; Williams, Robert L.; Saecker, Lee B.

    2007-01-01

    College students (N = 151) completed three in-class mathematics assignments that varied with respect to the order of short, medium, and long multiplication problems, including a short-to-long order, a long-to-short order, and a random order. Problem order within assignments did not significantly affect work accuracy, completion time, or assignment…

  18. Reducing Perceptions of Time Required to Complete Math Assignments by Adding Problems to Assignments: A Synthesis of the Additive Interspersal Research

    ERIC Educational Resources Information Center

    Billington, Eric J.; Skinner, Christopher H.

    2006-01-01

    Results from nine experiments were analyzed to evaluate the relationship between relative problem completion rates (RPCR) and judgments of time involving mathematics assignments. For each experiment, control assignments contained only target mathematics computation or word problems. Matched experimental assignments contained similar target…

  19. Reducing Perceptions of Time Required to Complete Math Assignments by Adding Problems to Assignments: A Synthesis of the Additive Interspersal Research

    ERIC Educational Resources Information Center

    Billington, Eric J.; Skinner, Christopher H.

    2006-01-01

    Results from nine experiments were analyzed to evaluate the relationship between relative problem completion rates (RPCR) and judgments of time involving mathematics assignments. For each experiment, control assignments contained only target mathematics computation or word problems. Matched experimental assignments contained similar target…

  20. Simulated annealing algorithm for solving chambering student-case assignment problem

    NASA Astrophysics Data System (ADS)

    Ghazali, Saadiah; Abdul-Rahman, Syariza

    2015-12-01

    The problem related to project assignment problem is one of popular practical problem that appear nowadays. The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased. This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem. The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. The problem of assigning chambering students to cases has never been addressed in the literature before. For the proposed problem, it is essential for law graduates to peruse in chambers before they are qualified to become legal counselor. Thus, assigning the chambering students to cases is a critically needed especially when involving many preferences. Hence, this study presents a preliminary study of the proposed project assignment problem. The objective of the study is to minimize the total completion time for all students in solving the given cases. This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution. The search then is preceded with a simulated annealing algorithm for further improvement of solution quality. The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. Hence, this research has demonstrated the advantages of solving project assignment problem by using metaheuristic techniques.

  1. Fixed satellite service frequency allocations and orbit assignment procedures for commercial satellite systems

    NASA Astrophysics Data System (ADS)

    Tycz, Thomas S.

    1990-07-01

    The international regulatory framework which resulted from the 1988 International Telecommunication Union (ITU) Conference on Space Services (ORB-88) and its potential effect on the implementation of US satellite systems are discussed. The impact of several significant results of ORB-88 on the ability of the FCC to assign geostationary satellite orbital positions within the US and to secure international protection for these assignments is reviewed. A table of fixed satellite service frequency allocations in North, Central, and South America is given.

  2. A Method of Optimal Radio Frequency Assignment for Deep Space Missions

    NASA Technical Reports Server (NTRS)

    Ruggier, C. J.; Gevargiz, J. M.; Truong, L. H.; Suwitra, K. S.

    1992-01-01

    A method for determining optimal radio frequency channels for the Deep Space Network is described. Computer automated routines calculate interference-to-signal ratios over a given mission period and provide a quantitative assessment of the channels which could then be assigned to a new mission. This automated procedure reduces the analysis time considerably and effectively improves upon the accuracy of existing channel assignment techniques.

  3. 47 CFR 5.85 - Frequencies and policy governing frequency assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... (including the radio astronomy service). Stations authorized under subparts E and F are subject to additional... assignment. 5.85 Section 5.85 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL EXPERIMENTAL RADIO...) Stations operating in the Experimental Radio Service may be authorized to use any Federal or non-Federal...

  4. 47 CFR 5.85 - Frequencies and policy governing frequency assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... (including the radio astronomy service). Stations authorized under subparts E and F are subject to additional... assignment. 5.85 Section 5.85 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL EXPERIMENTAL RADIO...) Stations operating in the Experimental Radio Service may be authorized to use any Federal or non-Federal...

  5. Evaluation of a Brief Homework Assignment Designed to Reduce Citation Problems

    ERIC Educational Resources Information Center

    Schuetze, Pamela

    2004-01-01

    I evaluated a brief homework assignment designed to reduce citation problems in research-based term papers. Students in 2 developmental psychology classes received a brief presentation and handout defining plagiarism with tips on how to cite sources to avoid plagiarizing. In addition, students in 1 class completed 2 brief homework assignments in…

  6. Mutual Co-Assignment of the Calculated Vibrational Frequencies in the Ground and Lowest Excited Electronic States

    NASA Astrophysics Data System (ADS)

    Panchenko, Yurii N.

    2013-06-01

    The shifts of the molecular vibrational frequencies when going from the ground electronic state to the lowest excited electronic states pose some problems for the mutual co-assignment of the calculated vibrational frequencies in the different excited states. The trans-{C_2 O_2 F_2} shift of the frequency of the symmetrical ν(C=O) stretching vibration between the S_0 and T_1 is 373 wn. The feasibility of mutual co-assignments of the vibrational frequencies in these electronic states has been demonstrated for trans-{C_2 O_2 F_2}. Matrices analogous to the Duschinsky matrix were used to juxtapose the a_g vibrational frequencies of this molecule calculated at the CASPT2/cc-pVTZ level in the ground S_0 and excited triplet T_1 and singlet S_1 electronic states. The analog of the Duschinsky matrix D was obtained for this molecule using the equation D = (L_{I})^{-1} L_{II} where L_{I} and L_{II} are the matrices of the vibrational modes (normalized atomic displacements) obtained by solving the vibrational problems for the S_0 and T_1 electronic states, respectively. Choosing the dominant elements in columns of the D matrix and permuting these columns to arrange these elements along the diagonal of the transformed matrix D^* makes it possible to establish the correct mutual co-assignments of the calculated a_g vibrational frequencies of the trans-{C_2 O_2 F_2} molecule in the S_0 and T_1 electronic states. The analogous procedure was performed for the trans-{C_2 O_2 F_2} molecule in the T_1 and S_1 excited electronic states. The recent reassignments of the νb{2} and νb{3} calculated vibrational frequencies in the trans-{C_2 O_2 F_2} molecule in the ground state were also obtained for the triplet T_1 and singlet S_1 excited electronic states. The approach set forth in this text makes it possible to juxtapose the calculated vibrational frequencies of the same molecule in the different electronic states and to refine the assignments of these frequencies. This is essential

  7. 47 CFR 101.805 - Assignment of frequencies to mobile stations.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Assignment of frequencies to mobile stations. 101.805 Section 101.805 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Local Television Transmission Service § 101.805...

  8. 47 CFR 90.623 - Limitations on the number of frequencies assignable for conventional systems.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations... Governing the Processing of Applications and the Selection and Assignment of Frequencies for Use in the 806... application pending for a trunked system to serve multiple subscribers within 64 km (40 miles) of...

  9. 47 CFR 101.805 - Assignment of frequencies to mobile stations.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Assignment of frequencies to mobile stations. 101.805 Section 101.805 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Local Television Transmission Service § 101.805...

  10. 47 CFR 101.805 - Assignment of frequencies to mobile stations.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 5 2014-10-01 2014-10-01 false Assignment of frequencies to mobile stations. 101.805 Section 101.805 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Local Television Transmission Service § 101.805...

  11. 47 CFR 101.805 - Assignment of frequencies to mobile stations.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Assignment of frequencies to mobile stations. 101.805 Section 101.805 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Local Television Transmission Service § 101.805...

  12. 47 CFR 90.623 - Limitations on the number of frequencies assignable for conventional systems.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations... Governing the Processing of Applications and the Selection and Assignment of Frequencies for Use in the 806... application pending for a trunked system to serve multiple subscribers within 64 km (40 miles) of the...

  13. A Multiple Ant Colony Metahuristic for the Air Refueling Tanker Assignment Problem

    DTIC Science & Technology

    2002-03-01

    allocation for AMC in 1999. Written in Visual Basic for Applications ( VBA ) macros, the Quick Look Tool’s goal was to determine the number of tankers needed...4 `` A MULTIPLE ANT COLONY METAHEURISTIC FOR THE AIR REFUELING TANKER ASSIGNMENT PROBLEM THESIS RonJon Annaballi...to) July 2001 - March 2002 Title and Subtitle A Multiple Ant Colony Optimization Metahuristic for the Air Refueling Tanker Assignment Problem

  14. Decision Making In Assignment Problem With Multiple Attributes Under Intuitionistic Fuzzy Environment

    NASA Astrophysics Data System (ADS)

    Mukherjee, Sathi; Basu, Kajla

    2010-10-01

    In this paper we develop a methodology to solve the multiple attribute assignment problems where the attributes are considered to be Intuitionistic Fuzzy Sets (IFS). We apply the concept of similarity measures of IFS to solve the Intuitionistic Fuzzy Multi-Attribute Assignment Problem (IFMAAP). The weights of the attributes are determined from expert opinion. An illustrative example is solved to verify the developed approach and to demonstrate its practicality.

  15. Problem-Based Assignments as a Trigger for Developing Ethical and Reflective Competencies

    ERIC Educational Resources Information Center

    Euler, Dieter; Kühner, Patrizia

    2017-01-01

    The following research question serves as the starting point of this research and development project: How, in the context of a didactic design, can problem-based assignments trigger learning activities for the development of ethical and reflective competencies in students in economics courses? This paper focuses on the design of problem-based…

  16. On the problem of vehicles assignment in the conditions of open-cast mining

    NASA Astrophysics Data System (ADS)

    Davkaev, K. S.; Lyakhovets, M. V.

    2016-10-01

    The problem of optimal truck-excavators assignment is considered. A new objective function is offered, which takes into account the performance of a given amount of work and the capacity of each truck and excavator. Different solutions are offered and an example of a problem solution is provided.

  17. Assessment Guidelines for Ant Colony Algorithms when Solving Quadratic Assignment Problems

    NASA Astrophysics Data System (ADS)

    See, Phen Chiak; Yew Wong, Kuan; Komarudin, Komarudin

    2009-08-01

    To date, no consensus exists on how to evaluate the performance of a new Ant Colony Optimization (ACO) algorithm when solving Quadratic Assignment Problems (QAPs). Different performance measures and problems sets are used by researchers to evaluate their algorithms. This paper is aimed to provide a recapitulation of the relevant issues and suggest some guidelines for assessing the performance of new ACO algorithms.

  18. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

    PubMed Central

    Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian

    2015-01-01

    The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation. PMID:26512650

  19. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing.

    PubMed

    Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian

    2015-10-23

    The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

  20. A multi-step method for partial eigenvalue assignment problem of high order control systems

    NASA Astrophysics Data System (ADS)

    Liu, Hao; Xu, Jiajia

    2017-09-01

    In this paper, we consider the partial eigenvalue assignment problem of high order control systems. Based on the orthogonality relations, we propose a new method for solving this problem by which the undesired eigenvalues are moved to desired values and keep the remaining eigenvalues unchanged. Using the inverse of Cauchy matrix, we give the solvable condition and the explicit solutions to this problem. Numerical examples show that our method is effective.

  1. Scalable Effective Approaches for Quadratic Assignment Problems Based on Conic Optimization and Applications

    DTIC Science & Technology

    2012-02-09

    For this, we consider the splitting B=B1-B2, where both B1 and B2 are positive semi - definite . We then introduced a new notion called non-redundant...Volume 20(6), pp. 3408-3426, 2010. [3] J. Peng, T. Zhu, H.Zh. Luo and K.Ch. Toh. Semi - definite Relaxation of Quadratic Assignment Problems based on...Government position , policy or decision, unless so designated by other documentation. 14. ABSTRACT This project deals with quadratic assignment problems

  2. Ontological Problem-Solving Framework for Assigning Sensor Systems and Algorithms to High-Level Missions

    PubMed Central

    Qualls, Joseph; Russomanno, David J.

    2011-01-01

    The lack of knowledge models to represent sensor systems, algorithms, and missions makes opportunistically discovering a synthesis of systems and algorithms that can satisfy high-level mission specifications impractical. A novel ontological problem-solving framework has been designed that leverages knowledge models describing sensors, algorithms, and high-level missions to facilitate automated inference of assigning systems to subtasks that may satisfy a given mission specification. To demonstrate the efficacy of the ontological problem-solving architecture, a family of persistence surveillance sensor systems and algorithms has been instantiated in a prototype environment to demonstrate the assignment of systems to subtasks of high-level missions. PMID:22164081

  3. A Branch and Bound Based Heuristic for Solving the Quadratic Assignment Problem,

    DTIC Science & Technology

    1981-10-01

    the Quadratic Assignment Problem M. S. Bazaraa and 0. Kirca FDRC-81-13 V Contract N~o. N00014-8O-k-0709 A Branch and Bound Based Heuristic for...Solving the Quadratic Assignment Problem M. S. Bazaraa and 0. Kirca Abstract I\\ .... In this paper a branch and bound algorithm is proposed for solving the...concept of branch and bound or im- plicit enumeration, as in the works of Gilmore (1962), Lawler (1963), Craves and Whinston (1970), Bazaraa and Elshafei

  4. Using the Same Problem with Different Techniques in Programming Assignments: An Empirical Study of Its Effectiveness

    ERIC Educational Resources Information Center

    Newby, Michael; Nguyen, ThuyUyen H.

    2010-01-01

    This paper examines the effectiveness of a technique that first appeared as a Teaching Tip in the Journal of Information Systems Education. In this approach the same problem is used in every programming assignment within a course, but the students are required to use different programming techniques. This approach was used in an intermediate C++…

  5. Quadratic partial eigenvalue assignment problem with time delay for active vibration control

    NASA Astrophysics Data System (ADS)

    Pratt, J. M.; Singh, K. V.; Datta, B. N.

    2009-08-01

    Partial pole assignment in active vibration control refers to reassigning a small set of unwanted eigenvalues of the quadratic eigenvalue problem (QEP) associated with the second order system of a vibrating structure, by using feedback control force, to suitably chosen location without altering the remaining large number of eigenvalues and eigenvectors. There are several challenges of solving this quadratic partial eigenvalue assignment problem (QPEVAP) in a computational setting which the traditional pole-placement problems for first-order control systems do not have to deal with. In order to these challenges, there has been some work in recent years to solve QPEVAP in a computationally viable way. However, these works do not take into account of the practical phenomenon of the time-delay effect in the system. In this paper, a new "direct and partial modal" approach of the quadratic partial eigenvalue assignment problem with time-delay is proposed. The approach works directly in the quadratic system without requiring transformation to a standard state-space system and requires the knowledge of only a small number of eigenvalues and eigenvectors that can be computed or measured in practice. Two illustrative examples are presented in the context of active vibration control with constant time-delay to illustrate the success of our proposed approach. Future work includes generalization of this approach to a more practical complex time-delay system and extension of this work to the multi-input problem.

  6. Effect of frequency boundary assignment on vowel recognition with the Nucleus 24 ACE speech coding strategy.

    PubMed

    Fourakis, Marios S; Hawks, John W; Holden, Laura K; Skinner, Margaret W; Holden, Timothy A

    2004-04-01

    Two speech processor programs (MAPs) differing only in electrode frequency boundary assignments were created for each of eight Nucleus 24 Cochlear Implant recipients. The default MAPs used typical frequency boundaries, and the experimental MAPs reassigned one additional electrode to vowel formant regions. Four objective speech tests and a questionnaire were used to evaluate speech recognition with the two MAPs. Results for the closed-set vowel test and the formant discrimination test showed small but significant improvement in scores with the experimental MAP. Differences for the Consonant-Vowel Nucleus-Consonant word test and closed-set consonant test were nonsignificant. Feature analysis revealed no significant differences in information transmission. Seven of the eight subjects preferred the experimental MAP, reporting louder, crisper, and clearer sound. The results suggest that Nucleus 24 recipients should be given an opportunity to compare a MAP that assigns more electrodes in vowel formant regions with the default MAP to determine which provides the most benefit in everyday life.

  7. Prefrontal Neurons Encode a Solution to the Credit-Assignment Problem.

    PubMed

    Asaad, Wael F; Lauro, Peter M; Perge, János A; Eskandar, Emad N

    2017-07-19

    To adapt successfully to our environments, we must use the outcomes of our choices to guide future behavior. Critically, we must be able to correctly assign credit for any particular outcome to the causal features which preceded it. In some cases, the causal features may be immediately evident, whereas in others they may be separated in time or intermingled with irrelevant environmental stimuli, creating a potentially nontrivial credit-assignment problem. We examined the neuronal representation of information relevant for credit assignment in the dorsolateral prefrontal cortex (dlPFC) of two male rhesus macaques performing a task that elicited key aspects of this problem. We found that neurons conveyed the information necessary for credit assignment. Specifically, neuronal activity reflected both the relevant cues and outcomes at the time of feedback and did so in a manner that was stable over time, in contrast to prior reports of representational instability in the dlPFC. Furthermore, these representations were most stable early in learning, when credit assignment was most needed. When the same features were not needed for credit assignment, these neuronal representations were much weaker or absent. These results demonstrate that the activity of dlPFC neurons conforms to the basic requirements of a system that performs credit assignment, and that spiking activity can serve as a stable mechanism that links causes and effects.SIGNIFICANCE STATEMENT Credit assignment is the process by which we infer the causes of our successes and failures. We found that neuronal activity in the dorsolateral prefrontal cortex conveyed the necessary information for performing credit assignment. Importantly, while there are various potential mechanisms to retain a "trace" of the causal events over time, we observed that spiking activity was sufficiently stable to act as the link between causes and effects, in contrast to prior reports that suggested spiking representations were

  8. A tabu search approach for the NMR protein structure-based assignment problem.

    PubMed

    Cavuşlar, Gizem; Çatay, Bülent; Apaydın, Mehmet Serkan

    2012-01-01

    Spectroscopy is an experimental technique which exploits the magnetic properties of specific nuclei and enables the study of proteins in solution. The key bottleneck of NMR studies is to map the NMR peaks to corresponding nuclei, also known as the assignment problem. Structure-Based Assignment (SBA) is an approach to solve this computationally challenging problem by using prior information about the protein obtained from a homologous structure. NVR-BIP used the Nuclear Vector Replacement (NVR) framework to model SBA as a binary integer programming problem. In this paper, we prove that this problem is NP-hard and propose a tabu search (TS) algorithm (NVR-TS) equipped with a guided perturbation mechanism to efficiently solve it. NVR-TS uses a quadratic penalty relaxation of NVR-BIP where the violations in the Nuclear Overhauser Effect constraints are penalized in the objective function. Experimental results indicate that our algorithm finds the optimal solution on NVRBIP’s data set which consists of seven proteins with 25 templates (31 to 126 residues). Furthermore, it achieves relatively high assignment accuracies on two additional large proteins, MBP and EIN (348 and 243 residues, respectively), which NVR-BIP failed to solve. The executable and the input files are available for download at http://people.sabanciuniv.edu/catay/NVR-TS/NVR-TS.html.

  9. An assignment based algorithm for multiple target localization problems using widely-separated MIMO radars

    NASA Astrophysics Data System (ADS)

    Gorji, A. A.; Tharmarasa, R.; Kirubarajan, T.

    2010-04-01

    Multiple-Input Multiple-Output (MIMO) radars with widely-separated antennas have attracted much attention in recent literature. The highly efficient performance of widely-separated MIMO radars in target detection compared to multistatic radars have been widely studied by researchers. However, multiple target localization by the enlightened structure has not been sufficiently explored. While Multiple Hypothesis Tracking (MHT) based methods have been previously applied for target localization, in this paper, the well-known 2-D assignment method is used instead in order to handle the computational cost of MHT. The assignment based algorithm works in a signal-level mode. That is, signals in receivers are first matched to different transmitters and, then, outputs of matched filters are used to find the cost of each combination in the 2-D assignment method. The main benefit of 2-D assignment is to easily incorporate new targets that are suitable for targets with multiple scatters where a target may be otherwise unobservable in some pairs. Simulation results justify the capability of 2-D assignment method in tackling multiple target localization problems, even in relatively low SNRs.

  10. Solving the Quadratic Assignment Problems using Parallel ACO with Symmetric Multi Processing

    NASA Astrophysics Data System (ADS)

    Tsutsui, Shigeyoshi

    In this paper, we propose several types of parallel ant colony optimization algorithms with symmetric multi processing for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. As a base ant colony optimization algorithm, we used the cunning Ant System (cAS) which showed promising performance our in previous studies. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ant colony optimization algorithms is promising in solving quadratic assignment problems for real or real-like instances.

  11. The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope.

    DTIC Science & Technology

    1987-05-01

    vAD-A±6L2 365 THE ASYMMETRIC ASSIGNMENT PROBLEM AND SOME NEW FACETS 1.11 OF THE TRAVELING SR..(U) CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT...FACETS OF THE TRAVELING SALESMAN POLYTOPE by Egon Balas Graduate School of Industrial Administration William Larimer Mellon, Founder Pittsburgh, PA...SOME NEW FACETS OF THE TRAVELING SALESMAN POLYTOPE by Eson Balas May 1987 The research underlying this report was supported by Grant ECS 8601660 of the

  12. A matrix method for finding last common nodes in an origin-based traffic assignment problem

    NASA Astrophysics Data System (ADS)

    Gao, Liang; Si, Bingfeng; Yang, Xiaobao; Sun, Huijun; Gao, Ziyou

    2012-01-01

    Many algorithms have been presented to solve the traffic assignment problem. Recently, Bar-Gera introduced the concept of “last common node” into an origin-based algorithm to solve the traffic assignment problem. However, how to find the last common nodes has not been investigated in detail. In this paper, we present a matrix method for finding the last common nodes in an origin-based traffic assignment problem. In an acyclic network, the power of binary adjacency matrix (A) will record the number of directed simple routes of length k. Taking this feature into consideration, Sp, the total number of the simple routes related to an origin node p in the subnetwork Gp, is counted by Sp=∑kApk=(. Then, every common node for OD pair pq is picked out by comparing (mathvariant="bold">Sp)pr×(mathvariant="bold">Sp)rq and (mathvariant="bold">Sp)pq, and the last common node for OD pair pq is filtered out according to the topological order l(r). Our method is implemented to find out all LCNs for all n∗(n-1) OD pairs, then tested on three kinds of model networks and four urban transportation networks. We find that the overall computing time T and the size of network n, has a relation like T∼O(n3), which is better than the theoretical estimation O(n4).

  13. An analysis of spectral envelope-reduction via quadratic assignment problems

    NASA Technical Reports Server (NTRS)

    George, Alan; Pothen, Alex

    1994-01-01

    A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

  14. An optimization approach for minimum norm and robust partial quadratic eigenvalue assignment problems for vibrating structures

    NASA Astrophysics Data System (ADS)

    Brahma, Sanjoy; Datta, Biswa

    2009-07-01

    The partial quadratic eigenvalue assignment problem (PQEVAP) concerns the reassignment of a small number of undesirable eigenvalues of a quadratic matrix pencil, while leaving the remaining large number of eigenvalues and the corresponding eigenvectors unchanged. The problem arises in controlling undesirable resonance in vibrating structures and in stabilizing control systems. The solution of this problem requires computations of a pair of feedback matrices. For practical effectiveness, these feedback matrices must be computed in such a way that their norms and the condition number of the closed-loop eigenvector matrix are as small as possible. These considerations give rise to the minimum norm partial quadratic eigenvalue assignment problem (MNPQEVAP) and the robust partial quadratic eigenvalue assignment problem (RPQEVAP), respectively. In this paper we propose new optimization based algorithms for solving these problems. The problems are solved directly in a second-order setting without resorting to a standard first-order formulation so as to avoid the inversion of a possibly ill-conditioned matrix and the loss of exploitable structures of the original model. The algorithms require the knowledge of only the open-loop eigenvalues to be replaced and their corresponding eigenvectors. The remaining open-loop eigenvalues and their corresponding eigenvectors are kept unchanged. The invariance of the large number of eigenvalues and eigenvectors under feedback is guaranteed by a proven mathematical result. Furthermore, the gradient formulas needed to solve the problems by using the quasi-Newton optimization technique employed are computed in terms of the known quantities only. Above all, the proposed methods do not require the reduction of the model order or the order of the controller, even when the underlying finite element model has a very large degree of freedom. These attractive features, coupled with minimal computational requirements, such as solutions of small

  15. Knowledge-based design of generate-and-patch problem solvers that solve global resource assignment problems

    NASA Technical Reports Server (NTRS)

    Voigt, Kerstin

    1992-01-01

    We present MENDER, a knowledge based system that implements software design techniques that are specialized to automatically compile generate-and-patch problem solvers that satisfy global resource assignments problems. We provide empirical evidence of the superior performance of generate-and-patch over generate-and-test: even with constrained generation, for a global constraint in the domain of '2D-floorplanning'. For a second constraint in '2D-floorplanning' we show that even when it is possible to incorporate the constraint into a constrained generator, a generate-and-patch problem solver may satisfy the constraint more rapidly. We also briefly summarize how an extended version of our system applies to a constraint in the domain of 'multiprocessor scheduling'.

  16. Frequency, Quantity, and Quantity X Frequency as Indicators of College Student Drinking Problems.

    ERIC Educational Resources Information Center

    Johnson, Patrick B.

    1991-01-01

    Compared relative efficacy of three drinking indices (quantity, frequency, quantity x frequency) in predicting presence of drinking problems in college students (n=55 males; 64 females). Although drinking frequency was as good a predictor as quantity x frequency for predicting such problems in males, it was best predictor of female drinking…

  17. Probabilistic Cross-identification in Crowded Fields as an Assignment Problem

    NASA Astrophysics Data System (ADS)

    Budavári, Tamás; Basu, Amitabh

    2016-10-01

    One of the outstanding challenges of cross-identification is multiplicity: detections in crowded regions of the sky are often linked to more than one candidate associations of similar likelihoods. We map the resulting maximum likelihood partitioning to the fundamental assignment problem of discrete mathematics and efficiently solve the two-way catalog-level matching in the realm of combinatorial optimization using the so-called Hungarian algorithm. We introduce the method, demonstrate its performance in a mock universe where the true associations are known, and discuss the applicability of the new procedure to large surveys.

  18. A two-stage approach to the depot shunting driver assignment problem with workload balance considerations

    PubMed Central

    Gronalt, Manfred; Sun, Yan

    2017-01-01

    Due to its environmentally sustainable and energy-saving characteristics, railway transportation nowadays plays a fundamental role in delivering passengers and goods. Emerged in the area of transportation planning, the crew (workforce) sizing problem and the crew scheduling problem have been attached great importance by the railway industry and the scientific community. In this paper, we aim to solve the two problems by proposing a novel two-stage optimization approach in the context of the electric multiple units (EMU) depot shunting driver assignment problem. Given a predefined depot shunting schedule, the first stage of the approach focuses on determining an optimal size of shunting drivers. While the second stage is formulated as a bi-objective optimization model, in which we comprehensively consider the objectives of minimizing the total walking distance and maximizing the workload balance. Then we combine the normalized normal constraint method with a modified Pareto filter algorithm to obtain Pareto solutions for the bi-objective optimization problem. Furthermore, we conduct a series of numerical experiments to demonstrate the proposed approach. Based on the computational results, the regression analysis yield a driver size predictor and the sensitivity analysis give some interesting insights that are useful for decision makers. PMID:28704489

  19. Using ant colony optimization on the quadratic assignment problem to achieve low energy cost in geo-distributed data centers

    NASA Astrophysics Data System (ADS)

    Osei, Richard

    There are many problems associated with operating a data center. Some of these problems include data security, system performance, increasing infrastructure complexity, increasing storage utilization, keeping up with data growth, and increasing energy costs. Energy cost differs by location, and at most locations fluctuates over time. The rising cost of energy makes it harder for data centers to function properly and provide a good quality of service. With reduced energy cost, data centers will have longer lasting servers/equipment, higher availability of resources, better quality of service, a greener environment, and reduced service and software costs for consumers. Some of the ways that data centers have tried to using to reduce energy costs include dynamically switching on and off servers based on the number of users and some predefined conditions, the use of environmental monitoring sensors, and the use of dynamic voltage and frequency scaling (DVFS), which enables processors to run at different combinations of frequencies with voltages to reduce energy cost. This thesis presents another method by which energy cost at data centers could be reduced. This method involves the use of Ant Colony Optimization (ACO) on a Quadratic Assignment Problem (QAP) in assigning user request to servers in geo-distributed data centers. In this paper, an effort to reduce data center energy cost involves the use of front portals, which handle users' requests, were used as ants to find cost effective ways to assign users requests to a server in heterogeneous geo-distributed data centers. The simulation results indicate that the ACO for Optimal Server Activation and Task Placement algorithm reduces energy cost on a small and large number of users' requests in a geo-distributed data center and its performance increases as the input data grows. In a simulation with 3 geo-distributed data centers, and user's resource request ranging from 25,000 to 25,000,000, the ACO algorithm was able

  20. A Genetic Algorithm Approach for the TV Self-Promotion Assignment Problem

    NASA Astrophysics Data System (ADS)

    Pereira, Paulo A.; Fontes, Fernando A. C. C.; Fontes, Dalila B. M. M.

    2009-09-01

    We report on the development of a Genetic Algorithm (GA), which has been integrated into a Decision Support System to plan the best assignment of the weekly self-promotion space for a TV station. The problem addressed consists on deciding which shows to advertise and when such that the number of viewers, of an intended group or target, is maximized. The GA proposed incorporates a greedy heuristic to find good initial solutions. These solutions, as well as the solutions later obtained through the use of the GA, go then through a repair procedure. This is used with two objectives, which are addressed in turn. Firstly, it checks the solution feasibility and if unfeasible it is fixed by removing some shows. Secondly, it tries to improve the solution by adding some extra shows. Since the problem faced by the commercial TV station is too big and has too many features it cannot be solved exactly. Therefore, in order to test the quality of the solutions provided by the proposed GA we have randomly generated some smaller problem instances. For these problems we have obtained solutions on average within 1% of the optimal solution value.

  1. A multi-period capacitated school location problem with modular equipment and closest assignment considerations

    NASA Astrophysics Data System (ADS)

    Delmelle, Eric M.; Thill, Jean-Claude; Peeters, Dominique; Thomas, Isabelle

    2014-07-01

    In rapidly growing urban areas, it is deemed vital to expand (or contract) an existing network of public facilities to meet anticipated changes in the level of demand. We present a multi-period capacitated median model for school network facility location planning that minimizes transportation costs, while functional costs are subject to a budget constraint. The proposed Vintage Flexible Capacitated Location Problem (ViFCLP) has the flexibility to account for a minimum school-age closing requirement, while the maximum capacity of each school can be adjusted by the addition of modular units. Non-closest assignments are controlled by the introduction of a parameter penalizing excess travel. The applicability of the ViFCLP is illustrated on a large US school system (Charlotte-Mecklenburg, North Carolina) where high school demand is expected to grow faster with distance to the city center. Higher school capacities and greater penalty on travel impedance parameter reduce the number of non-closest assignments. The proposed model is beneficial to policy makers seeking to improve the provision and efficiency of public services over a multi-period planning horizon.

  2. 47 CFR 90.265 - Assignment and use of frequencies in the bands allocated for Federal use.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... MHz, 172.225 MHz, and 172.375 MHz will be assigned for use only in areas west of the Mississippi River... only in areas east of the Mississippi River. (6) All applications for use of these frequencies must be...

  3. 47 CFR 90.265 - Assignment and use of frequencies in the bands allocated for Federal use.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... MHz, 172.225 MHz, and 172.375 MHz will be assigned for use only in areas west of the Mississippi River... only in areas east of the Mississippi River. (6) All applications for use of these frequencies must be...

  4. 47 CFR 90.265 - Assignment and use of frequencies in the bands allocated for Federal use.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... MHz, 172.225 MHz, and 172.375 MHz will be assigned for use only in areas west of the Mississippi River... only in areas east of the Mississippi River. (6) All applications for use of these frequencies must be...

  5. 47 CFR 90.265 - Assignment and use of frequencies in the bands allocated for Federal use.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... MHz, 172.225 MHz, and 172.375 MHz will be assigned for use only in areas west of the Mississippi River... only in areas east of the Mississippi River. (6) All applications for use of these frequencies must be...

  6. Study on MAX-MIN Ant System with Random Selection in Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Iimura, Ichiro; Yoshida, Kenji; Ishibashi, Ken; Nakayama, Shigeru

    Ant Colony Optimization (ACO), which is a type of swarm intelligence inspired by ants' foraging behavior, has been studied extensively and its effectiveness has been shown by many researchers. The previous studies have reported that MAX-MIN Ant System (MMAS) is one of effective ACO algorithms. The MMAS maintains the balance of intensification and diversification concerning pheromone by limiting the quantity of pheromone to the range of minimum and maximum values. In this paper, we propose MAX-MIN Ant System with Random Selection (MMASRS) for improving the search performance even further. The MMASRS is a new ACO algorithm that is MMAS into which random selection was newly introduced. The random selection is one of the edgechoosing methods by agents (ants). In our experimental evaluation using ten quadratic assignment problems, we have proved that the proposed MMASRS with the random selection is superior to the conventional MMAS without the random selection in the viewpoint of the search performance.

  7. Heuristic algorithms for a storage location assignment problem in a chaotic warehouse

    NASA Astrophysics Data System (ADS)

    Quintanilla, Sacramento; Pérez, Ángeles; Ballestín, Francisco; Lino, Pilar

    2015-10-01

    The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorithms can also be used for other purposes such as to assess when and how it is convenient to perform relocation of stored items to improve the current level of storage space availability. Computational tests performed on a set of randomly generated and real warehouse instances show the effectiveness of the proposed methods.

  8. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

    PubMed Central

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

  9. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.

    PubMed

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

  10. A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems.

    PubMed

    Horio, Yoshihiko; Ikeguchi, Tohru; Aihara, Kazuyuki

    2005-01-01

    We construct a mixed analog/digital chaotic neuro-computer prototype system for quadratic assignment problems (QAPs). The QAP is one of the difficult NP-hard problems, and includes several real-world applications. Chaotic neural networks have been used to solve combinatorial optimization problems through chaotic search dynamics, which efficiently searches optimal or near optimal solutions. However, preliminary experiments have shown that, although it obtained good feasible solutions, the Hopfield-type chaotic neuro-computer hardware system could not obtain the optimal solution of the QAP. Therefore, in the present study, we improve the system performance by adopting a solution construction method, which constructs a feasible solution using the analog internal state values of the chaotic neurons at each iteration. In order to include the construction method into our hardware, we install a multi-channel analog-to-digital conversion system to observe the internal states of the chaotic neurons. We show experimentally that a great improvement in the system performance over the original Hopfield-type chaotic neuro-computer is obtained. That is, we obtain the optimal solution for the size-10 QAP in less than 1000 iterations. In addition, we propose a guideline for parameter tuning of the chaotic neuro-computer system according to the observation of the internal states of several chaotic neurons in the network.

  11. The Measurand: The Problem of Frequency

    SciTech Connect

    Kirkham, Harold

    2016-07-25

    The conceptual entity that metrologists term the measurand is a model selected to represent the physical entity being measured. In a world of digital measurements, it should be defined first mathematically, and only then put into words. Human linguistic processes lack the precision required when all we do is use labels. In this paper, reactive power and frequency are used as examples. The act of measurement finds the values of the coef-ficients of the model. In other words, it solves an equation. In a digital instrument, information about the quality of the fit between the physical entity being measured and the conceptual model is often available. In essence the instrument can comment on the selection of the model. This comment should be reported as part of the statement of the result of the measurement, along with the declared value and the uncertainty.

  12. 47 CFR 5.85 - Frequencies and policy governing their assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... or non-government frequency designated in the Table of Frequency Allocations set forth in part 2 of... of Frequency Allocation of part 2 of this chapter. (d) Use of Public Safety Frequencies. Applicants... interference as a result of the new licensee's operations. (f) Protection of FCC monitoring stations....

  13. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.

    PubMed

    Sun, Jianyong; Zhang, Qingfu; Yao, Xin

    2014-03-01

    The construction of promising solutions for NP-hard combinatorial optimization problems (COPs) in meta-heuristics is usually based on three types of information, namely a priori information, a posteriori information learned from visited solutions during the search procedure, and online information collected in the solution construction process. Prior information reflects our domain knowledge about the COPs. Extensive domain knowledge can surely make the search effective, yet it is not always available. Posterior information could guide the meta-heuristics to globally explore promising search areas, but it lacks local guidance capability. On the contrary, online information can capture local structures, and its application can help exploit the search space. In this paper, we studied the effects of using this information on metaheuristic's algorithmic performances for the COPs. The study was illustrated by a set of heuristic algorithms developed for the quadratic assignment problem. We first proposed an improved scheme to extract online local information, then developed a unified framework under which all types of information can be combined readily. Finally, we studied the benefits of the three types of information to meta-heuristics. Conclusions were drawn from the comprehensive study, which can be used as principles to guide the design of effective meta-heuristic in the future.

  14. A Genetic Algorithm with the Improved 2-opt Method for Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Matayoshi, Mitsukuni; Nakamura, Morikazu; Miyagi, Hayao

    We propose a new 2-opt base method as a local search approach used with Genetic Algorithms (GAs) in Memetic Algorithm. We got a hint from the fast 2-opt method and devised the new 2-opt method. The main different point is such that our method exchanges genes by using histories of contributions to fitness value improvement. The contribution level is represented by the value `Priority’. In computer experiment, Quadratic Assignment Problem (QAP) instances are solved by GA with the 2-opt method(First Admissible Move Strategy, the Best Admissible Move Strategy), the fast 2-opt, and our proposed method for comparative evaluation. The results showed that our improved method obtained better solutions at ealier generation of the GA and our method required less computation time than the others at some upper bound value of appropriate `Priority’ setting values. Specially, at the average elapsed time of the fast 2-opt method’s 1000th generation, the exact solution findings of ours is more than the others. In further experiment, we observe that the searching capability depends on the number of levels of `Priority’. The ratio between two different Priority level sets becomes 1.59 in computation time in solving problem instance “char25a". This characteristic is shown to be statistically significant in ten instances among eleven.

  15. A new approach on auxiliary vehicle assignment in capacitated location routing problem

    NASA Astrophysics Data System (ADS)

    Bashiri, Mahdi; Rasoulinejad, Zeinab; Fallahzade, Ehsan

    2016-03-01

    The location routing problem (LRP) considers locating depots and vehicle routing decisions simultaneously. In classic LRP the number of customers in each route depends on the capacity of the vehicle. In this paper a capacitated LRP model with auxiliary vehicle assignment is presented in which the length of each route is not restricted by main vehicle capacity. Two kinds of vehicles are considered: main vehicles with higher capacity and fixed cost and auxiliary vehicles with lower capacity and fixed cost. The auxiliary vehicles can be added to the transportation system as an alternative strategy to cover the capacity limitations and they are just used to transfer goods from depots to vehicles and cannot serve the customers by themselves. To show the applicability of the proposed model, some numerical examples derived from the well-known instances are used. Moreover the model has been solved by some meta-heuristics for large sized instances. The results show the efficiency of the proposed model and the solution approach, considering the classic model and the exact solution approach, respectively.

  16. Frequency-Weighting Filter Selection, for H2 Control of Microgravity Isolation Systems: A Consideration of the "Implicit Frequency Weighting" Problem

    NASA Technical Reports Server (NTRS)

    Hampton, Roy David; Whorton, Mark S.

    1999-01-01

    Many space-science experiments need an active isolation system to provide them with the requisite microgravity environment. The isolation systems planned for use with the International Space Station (ISS) have been appropriately modeled using relative position, relative velocity, and acceleration states. In theory, frequency-weighting design filters can be applied to these state-space models, in order to develop optimal H2 or mixed-norm controllers with desired stability and performance characteristics. In practice, however, since there is a kinematic relationship among the various states, any frequency weighting applied to one state will implicitly weight other states. These implicit frequency-weighting effects must be considered, for intelligent frequency-weighting filter assignment. This paper suggests a rational approach to the assignment of frequency-weighting design filters, in the presence of the kinematic coupling among states that exists in the microgravity vibration isolation problem.

  17. Congenital adrenal hyperplasia: problems with developmental anomalies of the external genitalia and sex assignment.

    PubMed

    Al-Maghribi, Hussein

    2007-09-01

    A retrospective study was performed on all patients with congenital adrenal hyperplasia (CAH) who were followed up at the King Hussein Medical Center (KHMC), Amman, Jordan, during the period from January 1996 to June 2006. The aim was to evaluate the clinical features, special problems, and corrective interventions for these patients. The records of 73 children (39 were genetic females and 34 were genetic males) with CAH were reviewed in the study. The age of the patients at last follow-up was between five months and 18 years. Diagnostic criteria for CAH were typical clinical features of the illness (salt loss, dehydration, virilization, macrogenitosomia, ambiguous genitalia, and accelerated growth) and typical hormonal abnormalities (decreased serum cortisol and elevated serum 17-hydroxyprogesterone). There were 62 patients with classical presentation; among them, salt-wasting (SW) form was seen in 41 patients (66%). There were 5 patients with the nonclassic form, while 6 others had cryptic presentation. Seven patients (9%) had hypertension, mostly due to salt-retaining CAH. Among the 39 females with CAH, 27 had developed mental anomalies of the external genitalia; 20 of them underwent surgical interventions of their external genitalia. Fourteen genetically female patients were wrongly diagnosed as 'male sex' at birth due to severe virilization. Seven of them were reassigned 'female sex' socially, legally, and surgically; the parents of one of them (a four-year-old girl) wanted the surgical intervention postponed for two to three years. Hysterectomy and gonadectomy were carried out for 6 of the other 7 patients who chose to keep the male gender. Our study indicates that newborns with developmental anomalies of the external genitalia should be diagnosed as early as possible so that medical, psychological, and social complications are minimized. A neonatal screening program for such a disorder can identify infants at risk for the development of life

  18. 47 CFR 5.85 - Frequencies and policy governing their assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... frequency a direct wave fundamental field strength of greater than 10 mV/m in the authorized bandwidth of... threshold value, advance consultation with the FCC to discuss any protection necessary should be considered..., telephone (202) 418-1210, Federal Communications Commission, Washington, DC 20554. (3) Advance consultation...

  19. Developing Problem Solving and Communication Skills through Memo Assignments in a Management Science Course

    ERIC Educational Resources Information Center

    Williams, Julie Ann Stuart; Reid, Randall C.

    2010-01-01

    The authors describe how to structure a memo format for homework assignments in which a manager requests analysis of a particular issue from the student. The student must respond with a memo stating a recommendation and describing the solution approach. The results from using the memo format include improved student performance and professional…

  20. Process-based Assignment-Setting Change for Support of Overcoming Bottlenecks in Learning by Problem-Posing in Arithmetic Word Problems

    NASA Astrophysics Data System (ADS)

    Supianto, A. A.; Hayashi, Y.; Hirashima, T.

    2017-02-01

    Problem-posing is well known as an effective activity to learn problem-solving methods. Monsakun is an interactive problem-posing learning environment to facilitate arithmetic word problems learning for one operation of addition and subtraction. The characteristic of Monsakun is problem-posing as sentence-integration that lets learners make a problem of three sentences. Monsakun provides learners with five or six sentences including dummies, which are designed through careful considerations by an expert teacher as a meaningful distraction to the learners in order to learn the structure of arithmetic word problems. The results of the practical use of Monsakun in elementary schools show that many learners have difficulties in arranging the proper answer at the high level of assignments. The analysis of the problem-posing process of such learners found that their misconception of arithmetic word problems causes impasses in their thinking and mislead them to use dummies. This study proposes a method of changing assignments as a support for overcoming bottlenecks of thinking. In Monsakun, the bottlenecks are often detected as a frequently repeated use of a specific dummy. If such dummy can be detected, it is the key factor to support learners to overcome their difficulty. This paper discusses how to detect the bottlenecks and to realize such support in learning by problem-posing.

  1. 47 CFR 90.259 - Assignment and use of frequencies in the bands 216-220 MHz and 1427-1432 MHz.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... will be assigned with a 6.25 kHz, 12.5 kHz, 25 kHz or 50 kHz channel bandwidth. Frequencies may be assigned with a channel bandwidth exceeding 50 kHz only upon a showing of adequate justification. (8) Assignable 6.25 kHz channels will occur in increments of 6.25 kHz from 217.00625 MHz to 219.99375...

  2. Assignment of an essential role for the Neurospora frequency gene in circadian entrainment to temperature cycles.

    PubMed

    Pregueiro, Antonio M; Price-Lloyd, Nathan; Bell-Pedersen, Deborah; Heintzen, Christian; Loros, Jennifer J; Dunlap, Jay C

    2005-02-08

    Circadian systems include slave oscillators and central pacemakers, and the cores of eukaryotic circadian clocks described to date are composed of transcription and translation feedback loops (TTFLs). In the model system Neurospora, normal circadian rhythmicity requires a TTFL in which a White Collar complex (WCC) activates expression of the frequency (frq) gene, and the FRQ protein feeds back to attenuate that activation. To further test the centrality of this TTFL to the circadian mechanism in Neurospora, we used low-amplitude temperature cycles to compare WT and frq-null strains under conditions in which a banding rhythm was elicited. WT cultures were entrained to these temperature cycles. Unlike those normal strains, however, frq-null mutants did not truly entrain to the same cycles. Their peaks and troughs always occurred in the cold and warm periods, respectively, strongly suggesting that the rhythm in Neurospora lacking frq function simply is driven by the temperature cycles. Previous reports suggested that a FRQ-less oscillator (FLO) could be entrained to temperature cycles, rather than being driven, and speculated that the FLO was the underlying circadian-rhythm generator. These inferences appear to derive from the use of a phase reference point affected by both the changing waveform and the phase of the oscillation. Examination of several other phase markers as well as results of additional experimental tests indicate that the FLO is, at best, a slave oscillator to the TTFL, which underlies circadian rhythm generation in Neurospora.

  3. A two-stage approach for a multi-objective component assignment problem for a stochastic-flow network

    NASA Astrophysics Data System (ADS)

    Lin, Yi-Kuei; Yeh, Cheng-Ta

    2013-03-01

    Many real-life systems, such as computer systems, manufacturing systems and logistics systems, are modelled as stochastic-flow networks (SFNs) to evaluate network reliability. Here, network reliability, defined as the probability that the network successfully transmits d units of data/commodity from an origin to a destination, is a performance indicator of the systems. Network reliability maximization is a particular objective, but is costly for many system supervisors. This article solves the multi-objective problem of reliability maximization and cost minimization by finding the optimal component assignment for SFN, in which a set of multi-state components is ready to be assigned to the network. A two-stage approach integrating Non-dominated Sorting Genetic Algorithm II and simple additive weighting are proposed to solve this problem, where network reliability is evaluated in terms of minimal paths and recursive sum of disjoint products. Several practical examples related to computer networks are utilized to demonstrate the proposed approach.

  4. A Conceptual Framework and a Heuristic Program for the Credit Assignment Problem.

    DTIC Science & Technology

    1983-02-01

    f-R127 367 R CONCEPTUAL FRAMEWORK AND A HEURISTIC PROGRAM FOR THE i/1 CREDIT ASSIGNMENT..(U) ARIZONA STATE UNIV TEMPE GROUP FOR COMPUTER STUDIES OF...ARIZONA 85287 ,.:" luioltt ulnI 1wt ea. s 04 g o71 I - -I * I . . .,° -4 A CONCEPTUAL FRAMEWORK AND A HEURISTIC PROGRAM POR THE CREDWT A=EGNMENT...Itos ’me 8 -0 8 3 l"’ 4. TITLE (and Subtitle) S. TYPE OF REPORT A CONCEPTUAL FRAMEWORK AND A HEURISTIC PROGRAM INTERIM*, 1 JUL 30 JUN 83 FOR THE CREDIT

  5. Solving Multiactivity Multifacility Capacity-Constrained 0-1 Assignment Problems.

    DTIC Science & Technology

    1981-05-12

    other factors. -Mra -5- i’le :mil t iactiv ity mulIt if ac it L ty ass ignment problIem seeks mnfimizat oa oi some measure of total system cost such as...areas as public health care systems and private multi-echulon inventory/distribution systems . Such systems involve the assignment of activities or tasks...to groups of facilities in such a way that total system cost is minimized. The total system cost haa components (fixed costs) that depend on the

  6. The problem of frequency weighting functions and standards for birds

    NASA Astrophysics Data System (ADS)

    Dooling, Robert; Brittan-Powell, Elizabeth; Lauer, Amanda; Dent, Micheal; Noirot, Isabelle

    2005-09-01

    Frequency weighting functions in humans are widely used as a single-figure guess to assess noise problems and aid in making decisions with regard to noise limitations when no other data exist. However, this use of frequency weightings invariably results in a loss of precision in assessing the likelihood of a sound to produce hearing damage or sound annoyance. There is a growing interest in developing frequency weighting functions in animals presumably to assist in judging the risk of hearing damage, interference with acoustic communication, or habitat suitability. Laboratory studies reveal many parallels between humans and animals on a variety of psychoacoustic measures, such as equal loudness contours. However, differences between humans and animals on specific tests argue against using standards developed for humans to gauge the effect of noise on animals. Here we review data which show this same problem exists among birds. That is, the differences in the effects of noise among bird species can be as large as the differences between humans and birds. These results suggest that whereas frequency weighting functions and acoustic standards for a specific species might be useful, generalizing across species is likely not practical.

  7. Dynamic Weapon-Target Assignment Problems with Vulnerable C2 Nodes

    DTIC Science & Technology

    1988-06-01

    Approved for public release; distribution. U.4 unlimited 4. P5RrORMING ORGANIZATION REPORT NUM&ER( M 5 5 S . MONITORING ORGANIZATION REPORT NUMBE!SS) LIDS-P...WTA Problem Maino ioM with the cornespondin stadtc problem. Swc l s C a nod m ncded Mn e f a Te above resoue allocation problem will ypicaly be In the...the M4aximum Margina Return ri~ithm. works byasiinth phaos e of the Sfe Dfns Syspem. 1a this - m vrwuaip~ s quendialy ’With Z weapom beingasne to the fth

  8. Examining a Subproblem of the Frequency Assignment Problem Using a Conflict Graph

    DTIC Science & Technology

    1990-03-01

    the middle of the 18th century. In 1736, the famous Swiss mathematician, Leonhard Euler (1707-1783), used graph theory to solve the Konigsberg Bridge...at one point, cross each of the seven bridges exactly once, and return to the starting point. Euler showed that it was not possible, and his methods

  9. A Simple Assignment that Enhances Students' Ability to Solve Organic Chemistry Synthesis Problems and Understand Mechanisms

    ERIC Educational Resources Information Center

    Teixeira, Jennifer; Holman, R. W.

    2008-01-01

    Organic chemistry students typically struggle with the retrosynthetic approach to solving synthesis problems because most textbooks present the chemistry grouped by "reactions of the functional group". In contrast, the retrosynthetic approach requires the student to envision "reactions that yield the functional group". A second challenge is the…

  10. Assignment Problem for the U.S. Marine Corps: Regional, Culture, and Language Familiarization Program

    DTIC Science & Technology

    2013-12-01

    allocation problems. Econometrica, 66(3), 689–701 Retrieved from http://www.jstor.org/stable/2998580?origin= JSTOR -pdf. Abraham, D., Chen, N., Kumar, V...Law & Policy Review, 10(2), 302–315. Retrieved from http://www.jstor.org/stable/40239382?origin= JSTOR -pdf. Ross, G. T., & Soland, R. M. (1975). A

  11. A decomposition approach for the combined master surgical schedule and surgical case assignment problems.

    PubMed

    Agnetis, Alessandro; Coppi, Alberto; Corsini, Matteo; Dellino, Gabriella; Meloni, Carlo; Pranzo, Marco

    2014-03-01

    This research aims at supporting hospital management in making prompt Operating Room (OR) planning decisions, when either unpredicted events occur or alternative scenarios or configurations need to be rapidly evaluated. We design and test a planning tool enabling managers to efficiently analyse several alternatives to the current OR planning and scheduling. To this aim, we propose a decomposition approach. More specifically, we first focus on determining the Master Surgical Schedule (MSS) on a weekly basis, by assigning the different surgical disciplines to the available sessions. Next, we allocate surgeries to each session, focusing on elective patients only. Patients are selected from the waiting lists according to several parameters, including surgery duration, waiting time and priority class of the operations. We performed computational experiments to compare the performance of our decomposition approach with an (exact) integrated approach. The case study selected for our simulations is based on the characteristics of the operating theatre (OT) of a medium-size public Italian hospital. Scalability of the method is tested for different OT sizes. A pilot example is also proposed to highlight the usefulness of our approach for decision support. The proposed decomposition approach finds satisfactory solutions with significant savings in computation time.

  12. Authors are also reviewers: problems in assigning cause for missing negative studies.

    PubMed

    Senn, Stephen

    2013-01-01

    I COMPARE TWO POSSIBLE EXTREME HYPOTHESES REGARDING SUBMISSION OF PAPERS TO JOURNALS: the Q hypothesis, whereby the decision to submit is based on quality of research; and the P hypothesis, whereby it is based on probability of acceptance. I give five reasons as to why the P hypothesis is more plausible and suggest that problems of missing data may previously have caused researchers to misinterpret the evidence on editorial bias.

  13. Optimization of Heterogeneous UAV Communications Using the Multiobjective Quadratic Assignment Problem

    DTIC Science & Technology

    2004-03-01

    5-15 5.9.4 main pareto.c . . . . . . . . . . . . . . . . . . . . . . 5-15 5.9.5 MATLAB ...D-2 D.3 Algorithm Domain Pseudo Code to Implementation in chosen Language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . D-5 Appendix E...size k in strings of length l′ is plotted against l′. The problem size is assumed to be l = 20 [48] . . . . . . . . . . . . . . . 4-3 4.2. Pseudo -code

  14. A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise

    NASA Astrophysics Data System (ADS)

    Said, Tkatek; Otman, Abdoun; Jaafar, Abouchabaka; Najat, Rafalia

    2013-09-01

    The aim of this work is to present a meta-heuristically approach of the spatial assignment problem of human resources in multi-sites enterprise. Usually, this problem consists to move employees from one site to another based on one or more criteria. Our goal in this new approach is to improve the quality of service and performance of all sites with maximizing an objective function under some managers imposed constraints. The formulation presented here of this problem coincides perfectly with a Combinatorial Optimization Problem (COP) which is in the most cases NP-hard to solve optimally. To avoid this difficulty, we have opted to use a meta-heuristic popular method, which is the genetic algorithm, to solve this problem in concrete cases. The results obtained have shown the effectiveness of our approach, which remains until now very costly in time. But the reduction of the time can be obtained by different ways that we plan to do in the next work.

  15. Binary Bees Algorithm - bioinspiration from the foraging mechanism of honeybees to optimize a multiobjective multidimensional assignment problem

    NASA Astrophysics Data System (ADS)

    Xu, Shuo; Ji, Ze; Truong Pham, Duc; Yu, Fan

    2011-11-01

    The simultaneous mission assignment and home allocation for hospital service robots studied is a Multidimensional Assignment Problem (MAP) with multiobjectives and multiconstraints. A population-based metaheuristic, the Binary Bees Algorithm (BBA), is proposed to optimize this NP-hard problem. Inspired by the foraging mechanism of honeybees, the BBA's most important feature is an explicit functional partitioning between global search and local search for exploration and exploitation, respectively. Its key parts consist of adaptive global search, three-step elitism selection (constraint handling, non-dominated solutions selection, and diversity preservation), and elites-centred local search within a Hamming neighbourhood. Two comparative experiments were conducted to investigate its single objective optimization, optimization effectiveness (indexed by the S-metric and C-metric) and optimization efficiency (indexed by computational burden and CPU time) in detail. The BBA outperformed its competitors in almost all the quantitative indices. Hence, the above overall scheme, and particularly the searching history-adapted global search strategy was validated.

  16. A Hybrid Evolutionary Algorithm to Quadratic Three-Dimensional Assignment Problem with Local Search for Many-Core Graphics Processors

    NASA Astrophysics Data System (ADS)

    Lipinski, Piotr

    This paper concerns the quadratic three-dimensional assignment problem (Q3AP), an extension of the quadratic assignment problem (QAP), and proposes an efficient hybrid evolutionary algorithm combining stochastic optimization and local search with a number of crossover operators, a number of mutation operators and an auto-adaptation mechanism. Auto-adaptation manages the pool of evolutionary operators applying different operators in different computation phases to better explore the search space and to avoid premature convergence. Local search additionally optimizes populations of candidate solutions and accelerates evolutionary search. It uses a many-core graphics processor to optimize a number of solutions in parallel, which enables its incorporation into the evolutionary algorithm without excessive increases in the computation time. Experiments performed on benchmark Q3AP instances derived from the classic QAP instances proposed by Nugent et al. confirmed that the proposed algorithm is able to find optimal solutions to Q3AP in a reasonable time and outperforms best known results found in the literature.

  17. [Frequency of Trichomonas vaginalis infection in couples with fertility problems].

    PubMed

    Rivero, Lázara Rojas; Peña, Martha Rodríguez; Pérez, Carlos Sarría; Monroy, Sara Palma; Sariego Ramos, Idalia; Nodarse, Jorge Fraga

    2002-01-01

    One-hundred and seventy two couples which went for the first time to the Infertility Service of the National Institute of Endocrinology from June 1999 to June 2000, were studied to find out the frequency of Trichomonas vaginalis infection in this group, and determine its interaction with a number of clinical and risk variables. The results yielded that 10.5% were positive to the parasite, the prevailing symptom was leukorrea in women and 96.6% of men showed no symptoms. It was highly significant the fact of having a previous pathological history that might be related to infertility and current T. vaginalis infection. This protozoon was frequently associated with Candida sp. and causative agents of bacterial vaginosis in women and Haemophilus influenzae in men. This parasite seems to play an important role as a likely causative agent to be considered in fertility problems.

  18. Genetic algorithm based hybrid approach to solve fuzzy multi-objective assignment problem using exponential membership function.

    PubMed

    Dhodiya, Jayesh M; Tailor, Anita Ravi

    2016-01-01

    This paper presents a genetic algorithm based hybrid approach for solving a fuzzy multi-objective assignment problem (FMOAP) by using an exponential membership function in which the coefficient of the objective function is described by a triangular possibility distribution. Moreover, in this study, fuzzy judgment was classified using α-level sets for the decision maker (DM) to simultaneously optimize the optimistic, most likely, and pessimistic scenarios of fuzzy objective functions. To demonstrate the effectiveness of the proposed approach, a numerical example is provided with a data set from a realistic situation. This paper concludes that the developed hybrid approach can manage FMOAP efficiently and effectively with an effective output to enable the DM to take a decision.

  19. Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

    NASA Astrophysics Data System (ADS)

    Bashiri, Mahdi; Karimi, Hossein

    2012-07-01

    Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optimization as meta-heuristic methods for the QAP. This research is dedicated to compare the relative percentage deviation of these solution qualities from the best known solution which is introduced in QAPLIB. Furthermore, a tuning method is applied for meta-heuristic parameters. Results indicate that TS is the best in 31%of QAPs, and the IFLS method, which is in the literature, is the best in 58 % of QAPs; these two methods are the same in 11 % of test problems. Also, TS has a better computational time among heuristic and meta-heuristic methods.

  20. Phase-lock loop frequency control and the dropout problem

    NASA Technical Reports Server (NTRS)

    Attwood, S.; Kline, A. J.

    1968-01-01

    Technique automatically sets the frequency of narrow band phase-lock loops within automatic lock-in-range. It presets a phase-lock loop to a desired center frequency with a closed loop electronic frequency discriminator and holds the phase-lock loop to that center frequency until lock is achieved.

  1. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.

    PubMed

    Karapetyan, Daniel; Gutin, Gregory

    2011-01-01

    Memetic algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm, one needs to make a host of decisions. Selecting the population size is one of the most important among them. Most of the algorithms in the literature fix the population size to a certain constant value. This reduces the algorithm's quality since the optimal population size varies for different instances, local search procedures, and runtimes. In this paper we propose an adjustable population size. It is calculated as a function of the runtime of the whole algorithm and the average runtime of the local search for the given instance. Note that in many applications the runtime of a heuristic should be limited and, therefore, we use this bound as a parameter of the algorithm. The average runtime of the local search procedure is measured during the algorithm's run. Some coefficients which are independent of the instance and the local search are to be tuned at the design time; we provide a procedure to find these coefficients. The proposed approach was used to develop a memetic algorithm for the multidimensional assignment problem (MAP). We show that our adjustable population size makes the algorithm flexible to perform efficiently for a wide range of running times and local searches and this does not require any additional tuning of the algorithm.

  2. Mutual Information Analyses of Neuron Selection Techniques in Synchronous Exponential Chaotic Tabu Search for Quadratic Assignment Problems

    NASA Astrophysics Data System (ADS)

    Kawamura, Tetsuo; Horio, Yoshihiko; Hasegawa, Mikio

    The tabu search was implemented on a neural network with chaotic neuro-dynamics. This chaotic exponential tabu search shows great performance in solving quadratic assignment problems (QAPs). To exploit inherent parallel processing abilities of analog hardware systems, a synchronous updating scheme, where all the neurons in the network are updated at the same time, was proposed. However, several neurons may fire simultaneously with the synchronous updating. As a result, we cannot determine only one candidate for the 2-opt exchange from the many fired neurons. To solve this problem, several neuron selection methods, which select one specific neuron among the fired neurons, were proposed. These neuron selection methods improved the performance of the synchronous updating scheme. In this paper, we analyze the dynamics of the chaotic neural network with the neuron selection methods by means of the spatial and temporal mutual information. Through the analyses, the network solution search dynamics of the exponential chaotic tabu search with different neuron selection methods are evaluated.

  3. Protein resonance assignment at MAS frequencies approaching 100 kHz: a quantitative comparison of J-coupling and dipolar-coupling-based transfer methods.

    PubMed

    Penzel, Susanne; Smith, Albert A; Agarwal, Vipin; Hunkeler, Andreas; Org, Mai-Liis; Samoson, Ago; Böckmann, Anja; Ernst, Matthias; Meier, Beat H

    2015-10-01

    We discuss the optimum experimental conditions to obtain assignment spectra for solid proteins at magic-angle spinning (MAS) frequencies around 100 kHz. We present a systematic examination of the MAS dependence of the amide proton T 2' times and a site-specific comparison of T 2' at 93 kHz versus 60 kHz MAS frequency. A quantitative analysis of transfer efficiencies of building blocks, as they are used for typical 3D experiments, was performed. To do this, we compared dipolar-coupling and J-coupling based transfer steps. The building blocks were then combined into 3D experiments for sequential resonance assignment, where we evaluated signal-to-noise ratio and information content of the different 3D spectra in order to identify the best assignment strategy. Based on this comparison, six experiments were selected to optimally assign the model protein ubiquitin, solely using spectra acquired at 93 kHz MAS. Within 3 days of instrument time, the required spectra were recorded from which the backbone resonances have been assigned to over 96%.

  4. IR vibrational assignments for 1,3,5-triamine-2,4,6-trinitrobenzene (TATB) based on the temperature-dependent frequency shifts.

    PubMed

    Sui, Heliang; Zhong, Fachun; Cheng, Kemei; Liu, Xueyong; Ju, Xin

    2013-10-01

    IR spectra of TATB at different temperature were investigated for vibrational assignments. The results showed that the hydrogen bonding interaction of TATB was significantly weakened with increasing the temperature. Based on the frequency shifts of the hydrogen bonding interaction to several vibrational modes, 12 absorbance bands in the region 600-1700 cm(-1) were assigned to corresponding vibrational modes. In addition, Fermi resonance effect between NO2 and NH2 scissors was observed, and the enhancement of Fermi resonance effect caused the intensity of v3 (at 1545 cm(-1)) to grow during heating. Copyright © 2013 Elsevier B.V. All rights reserved.

  5. IR vibrational assignments for 1,3,5-triamine-2,4,6-trinitrobenzene (TATB) based on the temperature-dependent frequency shifts

    NASA Astrophysics Data System (ADS)

    Sui, Heliang; Zhong, Fachun; Cheng, Kemei; Liu, Xueyong; Ju, Xin

    2013-10-01

    IR spectra of TATB at different temperature were investigated for vibrational assignments. The results showed that the hydrogen bonding interaction of TATB was significantly weakened with increasing the temperature. Based on the frequency shifts of the hydrogen bonding interaction to several vibrational modes, 12 absorbance bands in the region 600-1700 cm-1 were assigned to corresponding vibrational modes. In addition, Fermi resonance effect between NO2 and NH2 scissors was observed, and the enhancement of Fermi resonance effect caused the intensity of v3 (at 1545 cm-1) to grow during heating.

  6. Assessment of adolescents' victimization, aggression, and problem behaviors: Evaluation of the Problem Behavior Frequency Scale.

    PubMed

    Farrell, Albert D; Sullivan, Terri N; Goncy, Elizabeth A; Le, Anh-Thuy H

    2016-06-01

    This study evaluated the Problem Behavior Frequency Scale (PBFS), a self-report measure designed to assess adolescents' frequency of victimization, aggression, and other problem behaviors. Analyses were conducted on a sample of 5,532 adolescents from 37 schools at 4 sites. About half (49%) of participants were male; 48% self-identified as Black non-Hispanic; 21% as Hispanic, 18% as White non-Hispanic. Adolescents completed the PBFS and measures of beliefs and values related to aggression, and delinquent peer associations at the start of the 6th grade and over 2 years later. Ratings of participants' behavior were also obtained from teachers on the Behavioral Assessment System for Children. Confirmatory factor analyses supported a 7-factor model that differentiated among 3 forms of aggression (physical, verbal, and relational), 2 forms of victimization (overt and relational), drug use, and other delinquent behavior. Support was found for strong measurement invariance across gender, sites, and time. The PBFS factors generally showed the expected pattern of correlations with teacher ratings of adolescents' behavior and self-report measures of relevant constructs. (PsycINFO Database Record

  7. Theoretical Investigation of C-H Vibrational Spectroscopy. 2. Unified Assignment Method of IR, Raman, and Sum Frequency Generation Spectra of Ethanol.

    PubMed

    Wang, Lin; Ishiyama, Tatsuya; Morita, Akihiro

    2017-09-14

    Using the flexible and polarizable model in the preceding paper, we performed comprehensive analysis of C-H stretching vibrations of ethanol and partially deuterated ones by molecular dynamics (MD) simulation. The overlapping band structures of the C-H stretching region including (i) methyl and methylene, (ii) the number of modes with Fermi resonances, and (iii) different trans/gauche conformers are disentangled by various analysis methods, such as isotope exchange, empirical potential parameter shift analysis, and separate calculations of conformers. The present analysis with MD simulation revealed unified assignment of infrared, Raman, and sum frequency generation (SFG) spectra. The analysis confirmed that the different conformers have significant influence on the assignment of CH2 vibrations. Band components and their signs in the imaginary χ((2)) spectra of SFG under various polarizations are also understood from the common assignment with the infrared and Raman spectra.

  8. Matching School Resources and Student Needs: Scheduling and Assignment Problems in High Schools Serving At-Risk Youth. Final Report.

    ERIC Educational Resources Information Center

    Natriello, Gary; And Others

    By studying the process by which disadvantaged and low-achieving high school students are assigned to classes and special programs, how and why disadvantaged students are placed in inappropriate programs can be understood. Reasons exist to question the assumption that students are assigned to programs rationally on the basis of information about…

  9. Considerations Taken in Developing the Frequency Assignment Guidelines for Communications in the Mars Region Provided in SFCG Recommendation 22-1, (SFCG Action Item No. 23/10)

    NASA Technical Reports Server (NTRS)

    Wang, Charles C.; Peng, Ted; Sue, Miles K.

    2004-01-01

    In the 23'd Annual SFCG meeting in San Diego, CA, the SFCG created SFCG Action Item No. 23/10 to provide a readable summary of the work done by the Mars Interim Working Group (MIWG). The SFCG created the MIWG to develop a frequency plan for future Mars missions. The working group has produced a number of documents resulting in a recommendation, SFCG Rec 22-1 [1], titled Frequency Assignment Guidelines for Communications in Mars Region, including a frequency plan for the Mars Region. This document is prepared in response to the SFCG Action Item to provide an overview of the considerations taken when selecting the frequencies and to point out where detailed information of the considerations can be found.

  10. Considerations Taken in Developing the Frequency Assignment Guidelines for Communications in the Mars Region Provided in SFCG Recommendation 22-1, (SFCG Action Item No. 23/10)

    NASA Technical Reports Server (NTRS)

    Wang, Charles C.; Peng, Ted; Sue, Miles K.

    2004-01-01

    In the 23'd Annual SFCG meeting in San Diego, CA, the SFCG created SFCG Action Item No. 23/10 to provide a readable summary of the work done by the Mars Interim Working Group (MIWG). The SFCG created the MIWG to develop a frequency plan for future Mars missions. The working group has produced a number of documents resulting in a recommendation, SFCG Rec 22-1 [1], titled Frequency Assignment Guidelines for Communications in Mars Region, including a frequency plan for the Mars Region. This document is prepared in response to the SFCG Action Item to provide an overview of the considerations taken when selecting the frequencies and to point out where detailed information of the considerations can be found.

  11. 47 CFR 90.257 - Assignment and use of frequencies in the band 72-76 MHz.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ...) Radio remote control of models is permitted on frequencies 10 kHz removed from these frequencies authorized for fixed and mobile operations in the 72-76 MHz band. Remote control operations are secondary to.... In any case, it shall be the responsibility of the licensee to correct, at its own expense, any such...

  12. Solution to the indexing problem of frequency domain simulation experiments

    NASA Technical Reports Server (NTRS)

    Mitra, Mousumi; Park, Stephen K.

    1991-01-01

    A frequency domain simulation experiment is one in which selected system parameters are oscillated sinusoidally to induce oscillations in one or more system statistics of interest. A spectral (Fourier) analysis of these induced oscillations is then performed. To perform this spectral analysis, all oscillation frequencies must be referenced to a common, independent variable - an oscillation index. In a discrete-event simulation, the global simulation clock is the most natural choice for the oscillation index. However, past efforts to reference all frequencies to the simulation clock generally yielded unsatisfactory results. The reason for these unsatisfactory results is explained in this paper and a new methodology which uses the simulation clock as the oscillation index is presented. Techniques for implementing this new methodology are demonstrated by performing a frequency domain simulation experiment for a network of queues.

  13. Word Frequency, Function Words and the Second Gavagai Problem

    ERIC Educational Resources Information Center

    Hochmann, Jean-Remy

    2013-01-01

    The classic gavagai problem exemplifies the difficulty to identify the referent of a novel word uttered in a foreign language. Here, we consider the reverse problem: identifying the referential part of a label. Assuming "gavagai" indicates a rabbit in a foreign language, it may very well mean ""a" rabbit" or ""that" rabbit". How can a learner know…

  14. Word Frequency, Function Words and the Second Gavagai Problem

    ERIC Educational Resources Information Center

    Hochmann, Jean-Remy

    2013-01-01

    The classic gavagai problem exemplifies the difficulty to identify the referent of a novel word uttered in a foreign language. Here, we consider the reverse problem: identifying the referential part of a label. Assuming "gavagai" indicates a rabbit in a foreign language, it may very well mean ""a" rabbit" or ""that" rabbit". How can a learner know…

  15. Recognition of music and melody in patients with cochlear implants, using a new programming approach for frequency assignment.

    PubMed

    Falcón-González, Juan C; Borkoski-Barreiro, Silvia; Limiñana-Cañal, José María; Ramos-Macías, Angel

    2014-01-01

    Music is a universal, cross-cultural phenomenon. Perception and enjoyment of music are still not solved with current technological objectives of cochlear implants. The objective of this article was to advance the development and validation of a method of programming of cochlear implants that implements a frequency allocation strategy. We compared standard programming vs frequency programming in every subject. We studied a total of 40 patients with cochlear implants. Each patient was programmed with a optimal version of the standard program, using the Custom Sound Suite 3.2 cochlear platform. Speech tests in quiet were performed using syllable word lists from the protocol for the assessment of hearing in the Spanish language. Patients implanted bilaterally were tested in both ears at the same time. For assessing music listening habits we used the Munich Music Questionnaire and «MACarena»(minimum auditory capability) software. All patients achieved better results in recognition, instrument tests and tonal scales with frequency programming (P<.005). Likewise, there were better results with frequency programming in recognising harmonics and pitch test (P<.005). Frequency programming achieves better perception and recognition results in patients in comparison with standard programming. Bilateral stimulation patients have better perception of musical patterns and better performance in recognition of tonal scales, harmonics and musical instruments compared with patients with unilateral stimulation. Modification and frequency allocation during programming allows decreased levels of current intensity and increase the dynamic range, which allows mapping of each audio band less obtrusively and improves the quality of representation of the signal. Copyright © 2013 Elsevier España, S.L.U. y Sociedad Española de Otorrinolaringología y Patología Cérvico-Facial. All rights reserved.

  16. The atom assignment problem in automated de novo drug design. 5. Tests for envelope-directed fragment placement based on molecular similarity

    NASA Astrophysics Data System (ADS)

    Barakat, M. T.; Dean, P. M.

    1995-10-01

    The fragment placement method has been successfully extended to the problem of envelope-directed design. The atom assignment paradigm was based on molecular similarity between two molecular structures. A composite supersurface is defined to form the surface onto which the molecular fields are projected. The assignment process is then determined by using molecular similarity in the objective function to be optimized. In principle, this procedure is closely similar to that outlined in the previous paper for site-directed design. The rationale has been extensively tested on two benzodiazepine antagonists believed to bind to the same site.

  17. Solution of the problem of interaction between capacitive coupled radio-frequency discharge and a sample

    NASA Astrophysics Data System (ADS)

    Chebakova, V. Ju; Gaisin, A. F.; Zheltukhin, V. S.

    2016-11-01

    The numerical study of interaction between the capacitive coupled radio frequency (CCRF) discharge and materials is performed. A nonlinear problem, which includes initialboundary value problems for electron, ion, neutral atom, metastable atom, gas temperature and Poisson's equation is solved. A harmonic voltage on the loaded electrodes and Ohm's law for the sample is assumed. A results of calculations of the model problem at pressure p=760 Torr, frequency of generator f=13.76 MHz in local approximation are presented.

  18. Career, Personal, and Educational Problems of Community College Students: Severity and Frequency.

    ERIC Educational Resources Information Center

    Coll, Kenneth M.

    1995-01-01

    Gathered information about the severity and frequency of community college student problems, through a survey of 65 public community college counselors. Most reported an increase in severity of personal problems (family, alcohol, self-worth), career (goals, job market), and educational problems (lack of skills, time management). Reports other…

  19. Career, Personal, and Educational Problems of Community College Students: Severity and Frequency.

    ERIC Educational Resources Information Center

    Coll, Kenneth M.

    1995-01-01

    Gathered information about the severity and frequency of community college student problems, through a survey of 65 public community college counselors. Most reported an increase in severity of personal problems (family, alcohol, self-worth), career (goals, job market), and educational problems (lack of skills, time management). Reports other…

  20. Understanding Adult Age Differences in the Frequency of Problems With Friends.

    PubMed

    Schlosnagle, Leo; Strough, JoNell

    2017-01-01

    We investigated characteristics of younger and older adults' friendships. Younger (N = 39) and older (N = 39) adults completed measures pertaining to a specific friend they had (i.e., contact frequency, positive friendship quality, and negative friendship quality) and their frequency of problems with friends in general. Older adults reported fewer problems with friends in general, and fewer negative friendship qualities, less frequent contact, and more positive friendship qualities with a specific friend than younger adults. Contact frequency, positive friendship quality, and negative friendship quality with a specific friend were related to frequency of problems with friends in general, but only contact frequency was a significant mediator of the relation between age and frequency of problems with friends in general. Results show that characteristics of a specific friendship relate to problems with friends in general, and that contact frequency with a specific friend mediates the relation between age and problems with friends in general. Implications are discussed. © The Author(s) 2016.

  1. The optimal control frequency response problem in manual control. [of manned aircraft systems

    NASA Technical Reports Server (NTRS)

    Harrington, W. W.

    1977-01-01

    An optimal control frequency response problem is defined within the context of the optimal pilot model. The problem is designed to specify pilot model control frequencies reflective of important aircraft system properties, such as control feel system dynamics, airframe dynamics, and gust environment, as well as man machine properties, such as task and attention allocation. This is accomplished by determining a bounded set of control frequencies which minimize the total control cost. The bounds are given by zero and the neuromuscular control frequency response for each control actuator. This approach is fully adaptive, i.e., does not depend upon user entered estimates. An algorithm is developed to solve this optimal control frequency response problem. The algorithm is then applied to an attitude hold task for a bare airframe fighter aircraft case with interesting dynamic properties.

  2. Using Problem-Solving as a Method of Developing Sequenced-Assignments in a Writing About Fiction and Film Class.

    ERIC Educational Resources Information Center

    Comprone, Joseph J.

    A series of 13 questions is offered for sequencing student writing activities according to a problem solving model of the composing process. The questions are organized in a cyclical framework for approaching any problem solving task that writing students may face. The questions fall into four progressively developed categories, including…

  3. The interaction of subsyllabic encoding and stress assignment: A new examination of an old problem in Spanish

    PubMed Central

    Shelton, Michael; Gerfen, Chip; Palma, Nicolás Gutiérrez

    2012-01-01

    This study employs a naming task to examine the role of the syllable in speech production, focusing on a lesser-studied aspect of syllabic processing, the interaction of subsyllabic patterns (i.e. syllable phonotactics) and higher-level prosody, in this case, stress assignment in Spanish. Specifically, we examine a controversial debate in Spanish regarding the interaction of syllable weight and stress placement, showing that traditional representations of weight fail to predict the differential modulation of stress placement by rising versus falling diphthongs in Spanish nonce forms. Our results also suggest that the internal structure of the syllable plays a larger role than is assumed in the processing literature in that it modulates higher-level processes such as stress encoding. Our results thus inform the debate regarding syllable weight in Spanish and linguistic theorizing more broadly, as well as expand our understanding of the importance of the syllable, and more specifically its internal structure, in modulating word processing. PMID:23264712

  4. Existence of solutions for electron balance problem in the stationary radio-frequency induction discharges

    NASA Astrophysics Data System (ADS)

    Zheltukhin, V. S.; Solovyev, S. I.; Solovyev, P. S.; Chebakova, V. Yu

    2016-11-01

    A sufficient condition for the existence of a minimal eigenvalue corresponding to a positive eigenfunction of an eigenvalue problem with nonlinear dependence on the parameter for a second order ordinary differential equation is established. The initial problem is approximated by the finite element method. Error estimates for the approximate minimal eigenvalue and corresponding positive eigenfunction are derived. Problems of this form arise in modelling the plasma of a radio-frequency discharge at reduced pressure.

  5. A note on the existence and uniqueness of solutions of frequency domain elastic wave problems

    NASA Astrophysics Data System (ADS)

    Bramble, James H.; Pasciak, Joseph E.

    2008-09-01

    In this note, we provide existence and uniqueness results for frequency domain elastic wave problems. These problems are posed on the complement of a bounded domain (the scatterer). The boundary condition at infinity is given by the Kupradze-Sommerfeld radiation condition and involves different Sommerfeld conditions on different components of the field. Our results are obtained by setting up the problem as a variational problem in the Sobolev space H1 on a bounded domain. We use a nonlocal boundary condition which is related to the Dirichlet to Neumann conditions used for acoustic and electromagnetic scattering problems. We obtain stability results for the source problem, a necessary ingredient for the analysis of numerical methods for this problem based on finite elements or finite differences.

  6. High-grading bias: subtle problems with assessing power of selected subsets of loci for population assignment.

    PubMed

    Waples, Robin S

    2010-07-01

    Recognition of the importance of cross-validation ('any technique or instance of assessing how the results of a statistical analysis will generalize to an independent dataset'; Wiktionary, en.wiktionary.org) is one reason that the U.S. Securities and Exchange Commission requires all investment products to carry some variation of the disclaimer, 'Past performance is no guarantee of future results.' Even a cursory examination of financial behaviour, however, demonstrates that this warning is regularly ignored, even by those who understand what an independent dataset is. In the natural sciences, an analogue to predicting future returns for an investment strategy is predicting power of a particular algorithm to perform with new data. Once again, the key to developing an unbiased assessment of future performance is through testing with independent data--that is, data that were in no way involved in developing the method in the first place. A 'gold-standard' approach to cross-validation is to divide the data into two parts, one used to develop the algorithm, the other used to test its performance. Because this approach substantially reduces the sample size that can be used in constructing the algorithm, researchers often try other variations of cross-validation to accomplish the same ends. As illustrated by Anderson in this issue of Molecular Ecology Resources, however, not all attempts at cross-validation produce the desired result. Anderson used simulated data to evaluate performance of several software programs designed to identify subsets of loci that can be effective for assigning individuals to population of origin based on multilocus genetic data. Such programs are likely to become increasingly popular as researchers seek ways to streamline routine analyses by focusing on small sets of loci that contain most of the desired signal. Anderson found that although some of the programs made an attempt at cross-validation, all failed to meet the 'gold standard' of using

  7. Prevalence and Frequency of Problems of Concerned Family Members with a Substance Using Loved One

    PubMed Central

    Benishek, Lois A.; Kirby, Kimberly C.; Dugosh, Karen Leggett

    2011-01-01

    Background Limited research has examined the prevalence and frequency of specific problems of concerned family members and significant others (CSOs) of alcohol or substance using individuals (SUIs). Objectives We surveyed CSOs of SUIs to determine the prevalence and frequency of their problems and explored whether relationship to the SUI, gender of the CSO, or living arrangements altered problem prevalence and frequency. Method Non-substance using CSOs (N = 110) completed the Significant Other Survey, which asks about problems in seven domains (emotional; family; relationship; financial; health; violence; legal). Problem outcomes were compared based on the CSO’s relationship to the SUI (partner or spouse vs. parent), gender of the CSO (male vs. female), and living arrangements of the CSO and SUI (residing together vs. residing apart). Results Problems were prevalent with at least two-thirds of the participants endorsing one or more problems in all but the legal domain. They also occurred frequently, with CSOs reporting problems on one-third to one-half of the past 30 days, in all but the violence and legal domains. Problems tended to be greater for CSOs who were partners, females, or living with the SUI. Conclusion CSOs experience frequent problems in a wide range of life domains and the types of difficulties they experience appear to differ based on type of relationship, gender, and their living arrangement relative to the SUI. Scientific Significance This investigation expands our understanding of the specific problems that CSOs face. The findings have important implications for treatment and health policy regarding these individuals. PMID:21219255

  8. Development of a Microbiology Course for Diverse Majors; Longitudinal Survey of the Use of Various Active, Problem-Based Learning Assignments

    PubMed Central

    CUNDELL, DIANA R.

    2002-01-01

    Educators are increasingly being encouraged to use more active- and problem-based-learning techniques and assignments in the classroom to improve critical and analytical thinking skills. Active learning-based courses have been purported to be more time consuming than traditional lecture methods and for many instructors have therefore proven difficult to include in many one-semester science courses. To address this problem, a series of assignments was developed for use in a basic microbiology course involving sophomore-, junior-, and senior-level students from five different biology majors (environmental science, biology, biochemistry, premedicine, and physician assistant). Writing assignments included global, historical, and social themes for which a standardized grading format was established. Students also participated in a class debate in which the merits of the living microbial kingdoms were discussed, with only one kingdom being saved from an imaginary global catastrophe. Traditional lectures were facilitated by the use of a dedicated note packet developed by the instructor and specific for course content. Laboratories involved group analysis of mini-case history studies involving pathogenic microbes. Students’ perceptions of the subject were assessed using an exit questionnaire sent to 100 of the 174 students who had taken the course during the 5-year time period. The majority of the 64 students who responded were sophomores (78%), in keeping with the target audience, and their perception of the course’s challenge level was significantly higher (p < 0.03, 8.7) than their junior and senior counterparts (7.9). Students rated the most useful learning tools as case history studies (9.4) and the class debate (9.1), with the introduction of a dedicated microbiology links web page to the University website representing the sole component resulting in a statistically significant increase in students’ perceptions of the importance of the course (p < 0.03). PMID

  9. Development of a microbiology course for diverse majors; longitudinal survey of the use of various active, problem-based learning assignments.

    PubMed

    Cundell, Diana R

    2002-05-01

    Educators are increasingly being encouraged to use more active- and problem-based-learning techniques and assignments in the classroom to improve critical and analytical thinking skills. Active learning-based courses have been purported to be more time consuming than traditional lecture methods and for many instructors have therefore proven difficult to include in many one-semester science courses. To address this problem, a series of assignments was developed for use in a basic microbiology course involving sophomore-, junior-, and senior-level students from five different biology majors (environmental science, biology, biochemistry, premedicine, and physician assistant). Writing assignments included global, historical, and social themes for which a standardized grading format was established. Students also participated in a class debate in which the merits of the living microbial kingdoms were discussed, with only one kingdom being saved from an imaginary global catastrophe. Traditional lectures were facilitated by the use of a dedicated note packet developed by the instructor and specific for course content. Laboratories involved group analysis of mini-case history studies involving pathogenic microbes. Students' perceptions of the subject were assessed using an exit questionnaire sent to 100 of the 174 students who had taken the course during the 5-year time period. The majority of the 64 students who responded were sophomores (78%), in keeping with the target audience, and their perception of the course's challenge level was significantly higher (p < 0.03, 8.7) than their junior and senior counterparts (7.9). Students rated the most useful learning tools as case history studies (9.4) and the class debate (9.1), with the introduction of a dedicated microbiology links web page to the University website representing the sole component resulting in a statistically significant increase in students' perceptions of the importance of the course (p < 0.03).

  10. How the credit assignment problems in motor control could be solved after the cerebellum predicts increases in error

    PubMed Central

    Verduzco-Flores, Sergio O.; O'Reilly, Randall C.

    2015-01-01

    We present a cerebellar architecture with two main characteristics. The first one is that complex spikes respond to increases in sensory errors. The second one is that cerebellar modules associate particular contexts where errors have increased in the past with corrective commands that stop the increase in error. We analyze our architecture formally and computationally for the case of reaching in a 3D environment. In the case of motor control, we show that there are synergies of this architecture with the Equilibrium-Point hypothesis, leading to novel ways to solve the motor error and distal learning problems. In particular, the presence of desired equilibrium lengths for muscles provides a way to know when the error is increasing, and which corrections to apply. In the context of Threshold Control Theory and Perceptual Control Theory we show how to extend our model so it implements anticipative corrections in cascade control systems that span from muscle contractions to cognitive operations. PMID:25852535

  11. Talk aloud problem solving: Exploration of acquisition and frequency building in science text

    NASA Astrophysics Data System (ADS)

    Dembek, Ginny

    Discovering new ways to help students attain higher levels of scientific knowledge and to think critically is a national goal (Educate to Innovate campaign). Despite the best intentions, many students struggle to achieve a basic level of science knowledge (NAEP, 2011). The present study examined Talk Aloud Pair Problem Solving and frequency building with five students who were diagnosed with a disability and receive specialized reading instruction in a special education setting. Acquisition was obtained through scripted lessons and frequency building or practice strengthened the student's verbal repertoire making the problem solving process a durable behavior. Overall, students all demonstrated improvements in problem solving performance when compared to baseline. Students became more significantly accurate in performance and maintenance in learning was demonstrated. Generalization probes indicated improvement in student performance. Implications for practice and future research are discussed.

  12. Numerical solution of an inverse medium scattering problem for Maxwell’s Equations at fixed frequency

    NASA Astrophysics Data System (ADS)

    Bao, Gang; Li, Peijun

    2009-07-01

    Consider a time-harmonic electromagnetic plane wave incident on a medium enclosed by a bounded domain in R3. In this paper, well-posedness of the variational problem for the direct scattering is examined. An energy estimate for the scattered field is obtained on which the Born approximation is based. A regularized recursive linearization method for the inverse medium scattering, which reconstructs the scatterer of an inhomogeneous medium from the boundary measurements of the scattered field, is developed. The algorithm requires only single-frequency data. Using an initial guess from the Born approximation, each update is obtained via continuation on the spatial frequency of a two-parameter family of plane waves by solving one direct problem and one adjoint problem of the Maxwell equation.

  13. Solitary cannabis use frequency mediates the relationship between social anxiety and cannabis use and related problems.

    PubMed

    Buckner, Julia D; Ecker, Anthony H; Dean, Kimberlye E

    2016-03-01

    Individuals with elevated social anxiety are seven times more likely to meet criteria for cannabis use disorders, yet social anxiety is unrelated to more frequent cannabis use. The lack of relation to cannabis use frequency may be at least partially due to lack of attention to cannabis use context. It may be that socially anxious persons engage in frequent solitary cannabis use, perhaps using before social situations in the hope that being intoxicated during the social event will help them feel less anxious. In fact, using cannabis alone has been associated with experiencing more cannabis-related problems in prior work. The current study sought to identify whether solitary cannabis use frequency mediated the relationship between social anxiety and cannabis-related problems among 276 current cannabis using undergraduates who completed an online survey of putative predictors of substance use. Social anxiety was robustly related to more frequent solitary (but not social) cannabis use and solitary cannabis use frequency uniquely mediated the relation of social anxiety to cannabis use and related problems. Frequent solitary use appears to play an important role in the experience of cannabis-related problems among socially anxious persons. Intervention strategies may benefit from targeting frequent solitary cannabis use, particularly among at-risk users such as those with elevated social anxiety. © American Academy of Addiction Psychiatry.

  14. Solitary Cannabis Use Frequency Mediates the Relationship Between Social Anxiety and Cannabis Use and Related Problems

    PubMed Central

    Buckner, Julia D.; Ecker, Anthony H.; Dean, Kimberlye E.

    2016-01-01

    Background and Objectives Individuals with elevated social anxiety are seven times more likely to meet criteria for cannabis use disorders, yet social anxiety is unrelated to more frequent cannabis use. The lack of relation to cannabis use frequency may be at least partially due to lack of attention to cannabis use context. It may be that socially anxious persons engage in frequent solitary cannabis use, perhaps using before social situations in the hope that being intoxicated during the social event will help them feel less anxious. In fact, using cannabis alone has been associated with experiencing more cannabis-related problems in prior work. Methods The current study sought to identify whether solitary cannabis use frequency mediated the relationship between social anxiety and cannabis-related problems among 276 current cannabis using undergraduates who completed an online survey of putative predictors of substance use. Results Social anxiety was robustly related to more frequent solitary (but not social) cannabis use and solitary cannabis use frequency uniquely mediated the relation of social anxiety to cannabis use and related problems. Discussion and Conclusions Frequent solitary use appears to play an important role in the experience of cannabis-related problems among socially anxious persons. Scientific Significance Intervention strategies may benefit from targeting frequent solitary cannabis use, particularly among at-risk users such as those with elevated social anxiety. PMID:26890064

  15. 47 CFR 90.267 - Assignment and use of frequencies in the 450-470 MHz band for low power use.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... for low power use. (a) The following frequencies between 450-470 MHz are designated for low-power use... as “low power frequencies.” Pairs are shown but single frequencies are available for simplex... operation on Group A1 frequencies is as follows: Operation Low side of frequency pair (watts) High side...

  16. 47 CFR 90.267 - Assignment and use of frequencies in the 450-470 MHz band for low power use.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... for low power use. (a) The following frequencies between 450-470 MHz are designated for low-power use... as “low power frequencies.” Pairs are shown but single frequencies are available for simplex... operation on Group A1 frequencies is as follows: Operation Low side of frequency pair (watts) High side...

  17. 47 CFR 90.267 - Assignment and use of frequencies in the 450-470 MHz band for low power use.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... for low power use. (a) The following frequencies between 450-470 MHz are designated for low-power use... as “low power frequencies.” Pairs are shown but single frequencies are available for simplex... operation on Group A1 frequencies is as follows: Operation Low side of frequency pair (watts) High side...

  18. Motivational pathways from reward sensitivity and punishment sensitivity to gambling frequency and gambling-related problems.

    PubMed

    Wardell, Jeffrey D; Quilty, Lena C; Hendershot, Christian S; Bagby, R Michael

    2015-12-01

    Motives for gambling have been shown to have an important role in gambling behavior, consistent with the literature on motives for substance use. While studies have demonstrated that traits related to sensitivity to reward (SR) and sensitivity to punishment (SP) are predictive of substance use motives, little research has examined the role of these traits in gambling motives. This study investigated motivational pathways from SR and SP to gambling frequency and gambling problems via specific gambling motives, while also taking into account history of substance use disorder (SUD). A community sample of gamblers (N = 248) completed self-report questionnaires assessing SR, SP, gambling frequency, gambling-related problems, and motives for gambling (social, negative affect, and enhancement/winning motives). Lifetime SUD was also assessed with a structured clinical interview. The results of a path analysis showed that SR was uniquely associated with all 3 types of gambling motives, whereas SP and SUD were associated with negative affect and enhancement/winning motives but not social motives. Also, both negative affect and enhancement/winning motives were associated with gambling problems, but only enhancement/winning motives were significantly related to gambling frequency. Analyses of indirect associations revealed significant indirect associations from SR, SP, and SUD to gambling frequency mediated through enhancement/winning motives and to gambling problems mediated through both negative affect and enhancement/winning motives. The findings highlight the importance of SR and SP as independent predictors of gambling motives and suggest that specific motivational pathways underlie their associations with gambling outcomes.

  19. Fair Package Assignment

    NASA Astrophysics Data System (ADS)

    Lahaie, Sébastien; Parkes, David C.

    We consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with quasi-linear utilities. A fair assignment is one that is efficient and envy-free. We consider a model where bidders have superadditive valuations, meaning that items are pure complements. Our central result is that core outcomes are fair and even coalition-fair over this domain, while fair distributions may not even exist for general valuations. Of relevance to auction design, we also establish that the core is equivalent to the set of anonymous-price competitive equilibria, and that superadditive valuations are a maximal domain that guarantees the existence of anonymous-price competitive equilibrium. Our results are analogs of core equivalence results for linear prices in the standard assignment model, and for nonlinear, non-anonymous prices in the package assignment model with general valuations.

  20. Frequency, types and severity of medication use-related problems among medical outpatients in Nigeria.

    PubMed

    Yusuff, Kazeem B; Tayo, Fola

    2011-06-01

    To determine the frequency, types and severity of medications use-related problems among medical outpatients in a tertiary care setting in southwestern Nigeria. Medical outpatient clinics of a 900-bed Teaching Hospital located in Ibadan, Southwestern Nigeria. A prospective cross-sectional medication use review was conducted by ten pharmacists for 400 randomly selected medical outpatients over a 4 week period at a 900-bed premier teaching hospital located in Ibadan, Nigeria. Severity assessment of medication use-related problems was done by 3 independent assessors with a modified severity index. Frequency, types and severity of medication use-related problems identified through pharmacist-initiated medication use review. Of the 400 randomly selected patients, 324 (81.0%) consented and were interviewed. One hundred and sixty-three (50.3%) of the cohort were males and 161 (49.7%) were females; with mean ages 51.5 ± 17.6 and 52.1 ± 17.4 years respectively. Median no. of drugs prescribed per patient per day was 4 (Minimum-Maximum, 1-7). About 27.5% were self medicating with orthodox (prescription-only and over-the-counter) and/or herbal medicines; and only 14.6% claimed disclosure to their physicians. The proportion of patients self medicating with orthodox medicines was significantly higher (P < 0.0001). Two hundred and twenty-six medication use-related problems were identified from 58.6% of patients, but the highest number (5) was identified among 2.6% of patients. The frequency of medication use-related problems appear strongly related to the number of medicines prescribed (r = 0.71, P = 0.006). The majority of medication use-related problems were ranked as potentially harmful [Inter-rater reliability coefficient: Gwet AC1: 0.7214 (P ≤ 0.001)]. Non-adherence (43.8%), problems associated with self medication (39.3%) and adverse drug reactions (15.6%) were the most frequent. Unauthorized drug holidays (46.5%) and stoppage of prescribed prescription-only medications

  1. Stereospecificity of (1) H, (13) C and (15) N shielding constants in the isomers of methylglyoxal bisdimethylhydrazone: problem with configurational assignment based on (1) H chemical shifts.

    PubMed

    Afonin, Andrei V; Pavlov, Dmitry V; Ushakov, Igor A; Keiko, Natalia A

    2012-07-01

    In the (13) C NMR spectra of methylglyoxal bisdimethylhydrazone, the (13) C-5 signal is shifted to higher frequencies, while the (13) C-6 signal is shifted to lower frequencies on going from the EE to ZE isomer following the trend found previously. Surprisingly, the (1) H-6 chemical shift and (1) J(C-6,H-6) coupling constant are noticeably larger in the ZE isomer than in the EE isomer, although the configuration around the -CH═N- bond does not change. This paradox can be rationalized by the C-H⋯N intramolecular hydrogen bond in the ZE isomer, which is found from the quantum-chemical calculations including Bader's quantum theory of atoms in molecules analysis. This hydrogen bond results in the increase of δ((1) H-6) and (1) J(C-6,H-6) parameters. The effect of the C-H⋯N hydrogen bond on the (1) H shielding and one-bond (13) C-(1) H coupling complicates the configurational assignment of the considered compound because of these spectral parameters. The (1) H, (13) C and (15) N chemical shifts of the 2- and 8-(CH(3) )(2) N groups attached to the -C(CH(3) )═N- and -CH═N- moieties, respectively, reveal pronounced difference. The ab initio calculations show that the 8-(CH(3) )(2) N group conjugate effectively with the π-framework, and the 2-(CH(3) )(2) N group twisted out from the plane of the backbone and loses conjugation. As a result, the degree of charge transfer from the N-2- and N-8- nitrogen lone pairs to the π-framework varies, which affects the (1) H, (13) C and (15) N shieldings. Copyright © 2012 John Wiley & Sons, Ltd.

  2. Adaptive eigenspace method for inverse scattering problems in the frequency domain

    NASA Astrophysics Data System (ADS)

    Grote, Marcus J.; Kray, Marie; Nahum, Uri

    2017-02-01

    A nonlinear optimization method is proposed for the solution of inverse scattering problems in the frequency domain, when the scattered field is governed by the Helmholtz equation. The time-harmonic inverse medium problem is formulated as a PDE-constrained optimization problem and solved by an inexact truncated Newton-type iteration. Instead of a grid-based discrete representation, the unknown wave speed is projected to a particular finite-dimensional basis of eigenfunctions, which is iteratively adapted during the optimization. Truncating the adaptive eigenspace (AE) basis at a (small and slowly increasing) finite number of eigenfunctions effectively introduces regularization into the inversion and thus avoids the need for standard Tikhonov-type regularization. Both analytical and numerical evidence underpins the accuracy of the AE representation. Numerical experiments demonstrate the efficiency and robustness to missing or noisy data of the resulting adaptive eigenspace inversion method.

  3. Assignment Choice, Effort, and Assignment Completion: Does Work Ethic Predict Those Who Choose Higher-Effort Assignments?

    ERIC Educational Resources Information Center

    Parkhurst, John T.; Fleisher, Matthew S.; Skinner, Christopher H.; Woehr, David J.; Hawthorn-Embree, Meredith L.

    2011-01-01

    After completing the Multidimensional Work-Ethic Profile (MWEP), 98 college students were given a 20-problem math computation assignment and instructed to stop working on the assignment after completing 10 problems. Next, they were allowed to choose to finish either the partially completed assignment that had 10 problems remaining or a new…

  4. Assignment Choice, Effort, and Assignment Completion: Does Work Ethic Predict Those Who Choose Higher-Effort Assignments?

    ERIC Educational Resources Information Center

    Parkhurst, John T.; Fleisher, Matthew S.; Skinner, Christopher H.; Woehr, David J.; Hawthorn-Embree, Meredith L.

    2011-01-01

    After completing the Multidimensional Work-Ethic Profile (MWEP), 98 college students were given a 20-problem math computation assignment and instructed to stop working on the assignment after completing 10 problems. Next, they were allowed to choose to finish either the partially completed assignment that had 10 problems remaining or a new…

  5. 47 CFR 90.267 - Assignment and use of frequencies in the 450-470 MHz band for low power use.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... operation determine whether a station is within an “80 km circle.” (i) The maximum ERP for low power... ERP for low power operation on these frequencies is as follows: Operation Low side of frequency pair.... (2) Operation on these frequencies is limited to 6 watts ERP for base, mobile or operational...

  6. 47 CFR 90.267 - Assignment and use of frequencies in the 450-470 MHz band for low power use.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... operation determine whether a station is within an “80 km circle.” (i) The maximum ERP for low power... ERP for low power operation on these frequencies is as follows: Operation Low side of frequency pair.... (2) Operation on these frequencies is limited to 6 watts ERP for base, mobile or operational...

  7. 47 CFR 90.261 - Assignment and use of the frequencies in the band 450-470 MHz for fixed operations.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Standards for....35(b)(3) may be assigned to all eligibles for fixed use on a secondary basis to land mobile... the U.S. Department of Commerce publication “Airline Distance Between Cities in the United States.” (c...

  8. Development of a Microbiology Course for Diverse Majors: Longitudinal Survey of the Use of Various Active, Problem-Based Learning Assignments.

    ERIC Educational Resources Information Center

    Cundell, Diana R.

    2002-01-01

    Reports on the development of a series of assignments for use in a basic microbiology course involving sophomore-, junior-, and senior-level students from five different biology majors. Assignments include writing, a class debate, and case history studies. (Author/MM)

  9. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks.

    PubMed

    de la Hoz, Enrique; Gimenez-Guzman, Jose Manuel; Marsa-Maestre, Ivan; Orden, David

    2015-11-24

    Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.

  10. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks

    PubMed Central

    de la Hoz, Enrique; Gimenez-Guzman, Jose Manuel; Marsa-Maestre, Ivan; Orden, David

    2015-01-01

    Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them. PMID:26610512

  11. Fast iterative boundary element methods for high-frequency scattering problems in 3D elastodynamics

    NASA Astrophysics Data System (ADS)

    Chaillat, Stéphanie; Darbas, Marion; Le Louër, Frédérique

    2017-07-01

    The fast multipole method is an efficient technique to accelerate the solution of large scale 3D scattering problems with boundary integral equations. However, the fast multipole accelerated boundary element method (FM-BEM) is intrinsically based on an iterative solver. It has been shown that the number of iterations can significantly hinder the overall efficiency of the FM-BEM. The derivation of robust preconditioners for FM-BEM is now inevitable to increase the size of the problems that can be considered. The main constraint in the context of the FM-BEM is that the complete system is not assembled to reduce computational times and memory requirements. Analytic preconditioners offer a very interesting strategy by improving the spectral properties of the boundary integral equations ahead from the discretization. The main contribution of this paper is to combine an approximate adjoint Dirichlet to Neumann (DtN) map as an analytic preconditioner with a FM-BEM solver to treat Dirichlet exterior scattering problems in 3D elasticity. The approximations of the adjoint DtN map are derived using tools proposed in [40]. The resulting boundary integral equations are preconditioned Combined Field Integral Equations (CFIEs). We provide various numerical illustrations of the efficiency of the method for different smooth and non-smooth geometries. In particular, the number of iterations is shown to be completely independent of the number of degrees of freedom and of the frequency for convex obstacles.

  12. Adolescent Alcohol-Drinking Frequency and Problem-Gambling Severity: Adolescent Perceptions Regarding Problem-Gambling Prevention and Parental/Adult Behaviors and Attitudes

    PubMed Central

    Rahman, Ardeshir S.; Balodis, Iris M.; Pilver, Corey E.; Leeman, Robert F.; Hoff, Rani A.; Steinberg, Marvin A.; Rugle, Loreen; Krishnan-Sarin, Suchitra; Potenza, Marc N.

    2014-01-01

    Background To examine in adolescents how alcohol-drinking frequency relates to gambling-related attitudes and behaviors and their perceptions of both problem-gambling prevention strategies and adult (including parental) behaviors/attitudes. Methods A survey assessing alcohol, gambling and health and functioning measures in 1609 high-school students. Students were stratified into low-frequency/non-drinking and high-frequency drinking groups, and into low-risk and at-risk/problematic gambling groups. Results High-frequency drinking was associated with at-risk/problematic gambling (χ2(1, N=1842)=49.22, p<.0001). High-frequency-drinking versus low-frequency/non-drinking adolescents exhibited more permissive attitudes towards gambling (e.g., less likely to report multiple problem-gambling prevention efforts to be important). At-risk problematic gamblers exhibited more severe drinking patterns and greater likelihood of acknowledging parental approval of drinking (χ2(1, N=1842)=31.58, p<.0001). Problem-gambling severity was more strongly related to gambling with adults among high-frequency-drinking adolescents (odds ratio [OR]=3.17, 95% confidence interval [95%CI]=[1.97, 5.09]) versus low-frequency/non-drinking (OR=1.86, 95%CI=[0.61, 2.68]) adolescents (Interaction OR=1.78, 95%CI=[1.05, 3.02]). Conclusions Inter-relationships between problematic drinking and gambling in youth may relate to more permissive attitudes across these domains. Stronger links between at-risk/problem gambling and gambling with adults in the high-frequency-drinking group raises the possibility that interventions targeting adults may help mitigate youth gambling and drinking. PMID:25147928

  13. Ethics, finance, and automation: a preliminary survey of problems in high frequency trading.

    PubMed

    Davis, Michael; Kumiega, Andrew; Van Vliet, Ben

    2013-09-01

    All of finance is now automated, most notably high frequency trading. This paper examines the ethical implications of this fact. As automation is an interdisciplinary endeavor, we argue that the interfaces between the respective disciplines can lead to conflicting ethical perspectives; we also argue that existing disciplinary standards do not pay enough attention to the ethical problems automation generates. Conflicting perspectives undermine the protection those who rely on trading should have. Ethics in finance can be expanded to include organizational and industry-wide responsibilities to external market participants and society. As a starting point, quality management techniques can provide a foundation for a new cross-disciplinary ethical standard in the age of automation.

  14. 47 CFR 90.627 - Limitation on the number of frequency pairs that may be assignable for trunked systems and on the...

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the 806-824, 851-869, 896-901, and 935-940 MHz Bands Policies Governing the Processing of Applications and the Selection and... 70 mobile and control stations per channel....

  15. 47 CFR 90.627 - Limitation on the number of frequency pairs that may be assignable for trunked systems and on the...

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the 806-824, 851-869, 896-901, and 935-940 MHz Bands Policies Governing the Processing of Applications and the Selection and... 70 mobile and control stations per channel. ...

  16. Far infrared and low frequency gas phase Raman spectra, vibrational assignment, and conformational stability of 1-chloro-2-methylpropane and 1-bromo-2-methylpropane

    NASA Astrophysics Data System (ADS)

    Durig, J. R.; Sullivan, J. F.; Godbey, S. E.

    1986-08-01

    The Raman (3200—10cm -1) and infrared (3200—50 cm -1) spectra of gaseous and solid 1-chloro-2-methylpropane and 1-bromo-methylpropane, as well as the Raman spectra of the liquids, have been recorded and assigned. The gauche asymmetric torsion of the 1-chloro-2-methylpropane molecules has been observed at 110 cm -1 in the Raman spectrum of the gas. For the 1-bromo-2-methylpropane molecule, both the trans and gauche asymmetric torsions have been observed at 106.70 and 103.94 cm -1, respectively, along with three additional transitions for the gauche conformer. From these data, the asymmetric potential function for the bromide molecules to V1 = —493 ±16, V2 = 595 ± 18, and V3 = 2006 ± 6 cm -1 with the trans conformer being more stable than the gauche conformer by 44 ± 20 cm -1. The trans form is found experimentally to be more stable in the liquid phase by 30 ± 14 cm -1 (83 ± 40 cal mol -1). From the relative intensities, in the Raman spectra, of the CCl stretches measured as a function of temperature, the gauche conformer of the chloride molecules to be 167 ± 71 cm -1 (479 ± 203 cal mol -1) more stable than the trans conformer in the gas phase, and 73 ± 10 cm -1 (208 ± 29 cal mol -1) more stable in the liquid phase. The methyl torsions for the gauche and trans conformers of both molecules are tentatively assigned in the gas phase and the barriers have been calculated. The results of this study are compared with previous studies on these molecules.

  17. Lexical Stress Assignment in Italian Developmental Dyslexia

    ERIC Educational Resources Information Center

    Paizi, Despina; Zoccolotti, Pierluigi; Burani, Cristina

    2011-01-01

    Stress assignment to Italian polysyllabic words is unpredictable, because stress is neither marked nor predicted by rule. Stress assignment, especially to low frequency words, has been reported to be a function of stress dominance and stress neighbourhood. Two experiments investigate stress assignment in sixth-grade, skilled and dyslexic, readers.…

  18. Lexical Stress Assignment in Italian Developmental Dyslexia

    ERIC Educational Resources Information Center

    Paizi, Despina; Zoccolotti, Pierluigi; Burani, Cristina

    2011-01-01

    Stress assignment to Italian polysyllabic words is unpredictable, because stress is neither marked nor predicted by rule. Stress assignment, especially to low frequency words, has been reported to be a function of stress dominance and stress neighbourhood. Two experiments investigate stress assignment in sixth-grade, skilled and dyslexic, readers.…

  19. Assignment of job modules onto array processors

    SciTech Connect

    Fukunaga, K.; Yamada, S.; Kasai, T.

    1987-07-01

    This paper deals with the optimum assignment of job modules onto array processors. In array processors it is important to assign job modules onto processors such that the modules that communicate with each other are assigned to adjacent processors, because communication overhead increases as communications occur between processors that are remotely connected. The authors propose an efficient algorithm to solve this assignment problem for a specific array of processors. The algorithm reduces the quadratic problem to a solvable linear problem that produces a good, but not necessarily optimal solution. This is followed by a phase of iterations in which the solution is improved by small perturbation of the assignment.

  20. Peak-to-average power ratio mitigation and adaptive bit assignment in single-carrier frequency division multiplexing access via hierarchical modulation

    NASA Astrophysics Data System (ADS)

    Zhang, Lijia; Liu, Bo; Xin, Xiangjun; Wang, Yongjun

    2014-11-01

    A hierarchical modulation with multilevels is proposed for an optical single-carrier frequency division multiplexing access (SC-FDMA) system. It can mitigate the nonlinearity by reducing the peak-to-average power ratio (PAPR) of the SC-FDM signal. According to different optical signal-to-noise ratio requirements, the adaptive bit allocation can be implemented on different levels during hierarchical modulation. In the experiment, the PAPR of the hierarchical-modulated SC-FDM signal outperforms the conventional SC-FDM signal by 0.7 dB. Signals with 4- and 6-bit hierarchical modulation are successfully demodulated by the optical network unit with power penalties less than 0.2 and 0.45 dB, respectively.

  1. Frequency of behavioural problems at one year following traumatic brain injury: correspondence between patient and caregiver reports.

    PubMed

    Marsh, Nigel V; Kersel, Denyse A

    2006-12-01

    A group of 62 adults with significant (i.e., ventilation required for > 24 hours) traumatic brain injury (TBI) were assessed approximately one year following their injury. The people with TBI and their primary caregivers completed the patient and relative/friend versions respectively, of the 20-item Head Injury Behaviour Rating Scale (HIBS). Responses by the patient and caregiver groups were compared for the total number of problems reported and the frequency of specific problem behaviours. The caregiver group reported a greater total number of problem behaviours and a higher frequency for 19 of the 20 specific behaviours. These differences between the patients' and caregivers' reports were statistically significant for seven of the 19 problem behaviours. The majority (86%) of these significant differences were on items from the Behavioural Regulation, rather than the Emotional Regulation, subscale of the HIBS. The implications of these findings for the practice of neuropsychological rehabilitation are presented.

  2. Comparative Analysis of the VA/Kaiser and NLM CORE Problem Subsets: An Empirical Study Based on Problem Frequency

    PubMed Central

    Wright, Adam; Feblowitz, Joshua; McCoy, Allison B.; Sittig, Dean F.

    2011-01-01

    The problem list is a critical component of the electronic medical record, with implications for clinical care, provider communication, clinical decision support, quality measurement and research. However, many of its benefits depend on the use of coded terminologies. Two standard terminologies (ICD-9 and SNOMED-CT) are available for problem documentation, and two SNOMED-CT subsets (VA/KP and CORE) are available for SNOMED-CT users. We set out to examine these subsets, characterize their overlap and measure their coverage. We applied the subsets to a random sample of 100,000 records from Brigham and Women’s Hospital to determine the proportion of problems covered. Though CORE is smaller (5,814 terms vs. 17,761 terms for VA/KP), 94.8% of coded problem entries from BWH were in the CORE subset, while only 84.0% of entries had matches in VA/KP (p<0.001). Though both subsets had reasonable coverage, CORE was superior in our sample, and had fewer clinically significant gaps. PMID:22195218

  3. Concentration of frequencies of trapped waves in problems on freely floating bodies

    SciTech Connect

    Nazarov, Sergei A

    2012-09-30

    It is shown that by choosing the shape of two identical bodies floating freely in a channel with symmetric cross-section it is possible to form any pre-assigned number of linearly independent trapped waves (localized solutions). Bibliography: 27 titles.

  4. The Relationship between Frequency of Family Dinner and Adolescent Problem Behaviors after Adjusting for Other Family Characteristics

    ERIC Educational Resources Information Center

    Sen, Bisakha

    2010-01-01

    Objective: To examine the association between frequency of family dinners (FFD) and selected problem behaviors for adolescents after adjusting for family connectedness, parental awareness, other family activities, and other potentially confounding factors. Methods: Data are drawn from the National Longitudinal Survey of Youth, 1997. The primary…

  5. The Relationship between Frequency of Family Dinner and Adolescent Problem Behaviors after Adjusting for Other Family Characteristics

    ERIC Educational Resources Information Center

    Sen, Bisakha

    2010-01-01

    Objective: To examine the association between frequency of family dinners (FFD) and selected problem behaviors for adolescents after adjusting for family connectedness, parental awareness, other family activities, and other potentially confounding factors. Methods: Data are drawn from the National Longitudinal Survey of Youth, 1997. The primary…

  6. An Investigation of Word Frequency in Mathematical Word Problems in Basal Mathematics Textbooks, Grades One Through Eight.

    ERIC Educational Resources Information Center

    Panchyshyn, Robert; Enright, Brian

    This research project was initiated to examine the vocabulary load contained in word problems appearing in basal mathematics textbooks through a study of word frequency. Five leading basal mathematics series were used. Every word, phrase or sentence that resulted in computation was included. A total of 476,674 words were identified. Information…

  7. Novel solutions to low-frequency problems with geometrically designed beam-waveguide systems

    NASA Technical Reports Server (NTRS)

    Imbriale, W. A.; Esquivel, M. S.; Manshadi, F.

    1995-01-01

    The poor low-frequency performance of geometrically designed beam-waveguide (BWG) antennas is shown to be caused by the diffraction phase centers being far from the geometrical optics mirror focus, resulting in substantial spillover and defocusing loss. Two novel solutions are proposed: (1) reposition the mirrors to focus low frequencies and redesign the high frequencies to utilize the new mirror positions, and (2) redesign the input feed system to provide an optimum solution for the low frequency. A novel use of the conjugate phase-matching technique is utilized to design the optimum low-frequency feed system, and the new feed system has been implemented in the JPL research and development BWG as part of a dual S-/X-band (2.3 GHz/8.45 GHz) feed system. The new S-band feed system is shown to perform significantly better than the original geometrically designed system.

  8. [Some problems in measuring the frequency-resolving power of hearing].

    PubMed

    Supin, A Ia

    2004-08-01

    In spite of detailed elaboration of masking methods of measuring the frequency selectivity of hearing, such measurements actually are not in use for diagnostics purpose because of their time-consumption and ambiguity of extrapolation of the results to perception of complex sound spectrum patterns. A method of direct measuring of spectrum resolving power using rippled-noise test, is suggested. Results of measurements have shown that the actual ability of hearing to discriminate complex sound spectra is higher than that predicted by acuteness of auditory frequency filters: dependence of acuteness of auditory frequency filters on sound level does not influence the ability to discriminate complex spectra; and the influence on interfering noise on the frequency resolving power can not be explained by a decrease of the spectral contrast by the spread of excitation.

  9. Some problems in the measurement of the frequency-resolving ability of hearing.

    PubMed

    Supin, A Ya

    2005-10-01

    Despite the detailed development of masking methods for measurement of the frequency selectivity of hearing, these measurements are hardly used for diagnostic purposes because they are time-consuming and because of the uncertain extrapolation of the results to the perception of complex spectral patterns. A method for the direct measurement of the spectral resolving ability of hearing using test signals with rippled spectra is proposed. These measurements showed 1) that the resolving ability of the auditory system in terms of discriminating complex spectra is greater than that suggested by the acuity of auditory frequency filters; 2) that changes in the acuity of frequency auditory filters associated with sound intensity hardly affect the ability to resolve complex spectra; 3) that the effects of interference on frequency-resolving ability do not lead to decreases in the spectral contrast of signals due to superimposition of noise.

  10. Peer and School Problems in the Lives of Urban Adolescents: Frequency, Difficulty, and Relation to Adjustment

    ERIC Educational Resources Information Center

    Farrell, Albert D.; Sullivan, Terri N.; Kliewer, Wendy; Allison, Kevin W.; Erwin, Elizabeth H.; Meyer, Aleta L.; Esposito, Layla

    2006-01-01

    This study examined the occurrence of problem situations in the peer and school domains and their relation to adjustment among urban adolescents. Students from three urban middle schools ("N"=176) serving a predominantly African American population rated 61 problem situations identified in a previous qualitative study and completed measures of…

  11. Level Set Methods for Optimization Problems Involving Geometry and Constraints. I. Frequencies of a Two-Density Inhomogeneous Drum

    NASA Astrophysics Data System (ADS)

    Osher, Stanley J.; Santosa, Fadil

    2001-07-01

    Many problems in engineering design involve optimizing the geometry to maximize a certain design objective. Geometrical constraints are often imposed. In this paper, we use the level set method devised in (Osher and Sethian, J. Comput. Phys.79, 12 (1988)), the variational level set calculus presented in (Zhao et al., J. Comput. Phys.127, 179 (1996)), and the projected gradient method, as in (Rudin et al., Physica D.60, 259 (1992)), to construct a simple numerical approach for problems of this type. We apply this technique to a model problem involving a vibrating system whose resonant frequency or whose spectral gap is to be optimized subject to constraints on geometry. Our numerical results are quite promising. We expect to use this approach to deal with a wide class of optimal design problems in the future.

  12. Fleet Assignment Using Collective Intelligence

    NASA Technical Reports Server (NTRS)

    Antoine, Nicolas E.; Bieniawski, Stefan R.; Kroo, Ilan M.; Wolpert, David H.

    2004-01-01

    Product distribution theory is a new collective intelligence-based framework for analyzing and controlling distributed systems. Its usefulness in distributed stochastic optimization is illustrated here through an airline fleet assignment problem. This problem involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of linear and non-linear constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of this new stochastic optimization algorithm to a non-linear objective cold start fleet assignment problem. Results show that the optimizer can successfully solve such highly-constrained problems (130 variables, 184 constraints).

  13. 47 CFR 74.602 - Frequency assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ..., 6425-6525 and 6875-7125 MHz bands for mobile television pickup only. Band A MHz Band B MHz Band D 1 GHz... and their operations are on a co-primary basis with the mobile-satellite and radiodetermination... part 27 fixed and mobile except aeronautical mobile service operations. (3)(i) After January 7,...

  14. 47 CFR 78.18 - Frequency assignments.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... IEEE standard 100-1972 as amended. Group B Channels Designation Channel boundaries (GHz) B01 1 12.7125...: Polarization designations shall be in accordance with IEEE standard 100-1972 as amended. (2) CARS...

  15. Assignments That Work.

    ERIC Educational Resources Information Center

    Hashimoto, I.

    1986-01-01

    Suggests, on a humorous note, a game-plan for assignment justification and elaboration that utilizes, in a constructive and professional manner, the best of what is known about assignment-making. (EL)

  16. Novel frequency domain techniques and advances in Finite Difference Time domain (FDTD) method for efficient solution of multiscale electromagnetic problems

    NASA Astrophysics Data System (ADS)

    Panayappan, Kadappan

    With the advent of sub-micron technologies and increasing awareness of Electromagnetic Interference and Compatibility (EMI/EMC) issues, designers are often interested in full- wave solutions of complete systems, taking to account a variety of environments in which the system operates. However, attempts to do this substantially increase the complexities involved in computing full-wave solutions, especially when the problems involve multi- scale geometries with very fine features. For such problems, even the well-established numerical methods, such as the time domain technique FDTD and the frequency domain methods FEM and MoM, are often challenged to the limits of their capabilities. In an attempt to address such challenges, three novel techniques have been introduced in this work, namely Dipole Moment (DM) Approach, Recursive Update in Frequency Domain (RUFD) and New Finite Difference Time Domain ( vFDTD). Furthermore, the efficacy of the above techniques has been illustrated, via several examples, and the results obtained by proposed techniques have been compared with other existing numerical methods for the purpose of validation. The DM method is a new physics-based approach for formulating MoM problems, which is based on the use of dipole moments (DMs), as opposed to the conventional Green's functions. The absence of the Green's functions, as well as those of the vector and scalar potentials, helps to eliminate two of the key sources of difficulties in the conventional MoM formulation, namely the singularity and low-frequency problems. Specifically, we show that there are no singularities that we need to be concerned with in the DM formulation; hence, this obviates the need for special techniques for integrating these singularities. Yet another salutary feature of the DM approach is its ability to handle thin and lossy structures, or whether they are metallic, dielectric-type, or even combinations thereof. We have found that the DM formulation can handle these

  17. Comparing Looping Teacher-Assigned and Traditional Teacher-Assigned Student Achievement Scores

    ERIC Educational Resources Information Center

    Lloyd, Melissa C.

    2014-01-01

    A problem in many elementary schools is determining which teacher assignment strategy best promotes the academic progress of students. To find and implement educational practices that address the academic needs of all learners, schools need research-based data focusing on the 2 teacher assignment strategies: looping assignment (LA) and traditional…

  18. A Procedure for Extending Input Selection Algorithms to Low Quality Data in Modelling Problems with Application to the Automatic Grading of Uploaded Assignments

    PubMed Central

    Otero, José; Palacios, Ana; Suárez, Rosario; Junco, Luis

    2014-01-01

    When selecting relevant inputs in modeling problems with low quality data, the ranking of the most informative inputs is also uncertain. In this paper, this issue is addressed through a new procedure that allows the extending of different crisp feature selection algorithms to vague data. The partial knowledge about the ordinal of each feature is modelled by means of a possibility distribution, and a ranking is hereby applied to sort these distributions. It will be shown that this technique makes the most use of the available information in some vague datasets. The approach is demonstrated in a real-world application. In the context of massive online computer science courses, methods are sought for automatically providing the student with a qualification through code metrics. Feature selection methods are used to find the metrics involved in the most meaningful predictions. In this study, 800 source code files, collected and revised by the authors in classroom Computer Science lectures taught between 2013 and 2014, are analyzed with the proposed technique, and the most relevant metrics for the automatic grading task are discussed. PMID:25114967

  19. Geometrical attenuation, frequency dependence of Q, and the absorption band problem

    NASA Astrophysics Data System (ADS)

    Morozov, Igor B.

    2008-10-01

    A geometrical attenuation model is proposed as an alternative to the conventional frequency-dependent attenuation law Q(f) = Q0(f/f0)η. The new model provides a straightforward differentiation between the geometrical and effective attenuation (Qe) which incorporates the intrinsic attenuation and small-scale scattering. Unlike the (Q0, η) description, the inversion procedure uses only the spectral amplitude data and does not rely on elaborate theoretical models or restrictive assumptions. Data from over 40 reported studies were transformed to the new parametrization. The levels of geometrical attenuation strongly correlate with crustal tectonic types and decrease with tectonic age. The corrected values of Qe are frequency-independent and generally significantly higher than Q0 and show no significant correlation with tectonic age. Several case studies were revisited in detail, with significant changes in the interpretations. The absorption-band and the `10-Hz transition' are not found in the corrected Qe data, and therefore, these phenomena are interpreted as related to geometrical attenuation. The absorption band could correspond to changes in the dominant mode content of the wavefield as the frequency changes from about 0.1 to 100 Hz. Alternatively, it could also be a pure artefact related to the power-law Q(f) paradigm above. The explicit separation of the geometrical and intrinsic attenuation achieves three goals: (1) it provides an unambiguous, assumption- and model-free description of attenuation, (2) it allows relating the observations to the basic physics and geology and (3) it simplifies the interpretation because of reduced emphasis on the apparent Q(f) dependence. The model also agrees remarkably well with the initial attempts for finite-difference short-period coda waveform modelling. Because of its consistency and direct link to the observations, the approach should also help in building robust and transportable coda magnitudes and in seismic

  20. A Geometric Theory of Natural Oscillation Frequencies in Exterior Scattering Problems.

    DTIC Science & Technology

    1979-09-30

    34 Annals of Physics, Vol. 9, pp. 24-75, 1960. 6. Weinberg, S ., Gravitation and Cosmology , Principles and Applica- tions of the General Theory of...A079 304 ARIZONA UN IV TUCSON ENGINEERING EXPERIMENT STATION F/ S 20/3 A GEOMETRIC THEORY OF NATURAL OSCILLATION FREQUENCIES IN IEXTEROl--ETC(U) SEP...7 MItM 2. GOVT ACCESSION NO. 3. RECIPIENT’S CATALOG NUMBER AFOSR. TR- It 9 - 1 ,0 5 4. TITLE (#Ad Subtitle) S . TYPE OF REPORT & PERIOO COVERED

  1. A scheme for noise suppression and spectral enhancement of speech to alleviate speech reception problems from loss of frequency selectivity

    NASA Astrophysics Data System (ADS)

    Lyzenga, Johannes; Festen, Joost M.; Houtgast, Tammo

    2002-05-01

    Even after sufficient amplification, hearing-impaired listeners often experience problems in understanding speech under noisy conditions. This may be caused by suprathreshold deficits such as loss of compression and reduced frequency selectivity. In this project we investigate a scheme in which speech and noise are processed before presentation to try and alleviate intelligibility problems caused by reduced frequency selectivity. The scheme contains three strategies, one in which the peak-to-valley ratios of selected modulations in the speech spectrum are enlarged, a second in which the overall speech spectrum is modified, and a third in which noise is suppressed before the two enhancement steps. An overlap-and-add (OLA) algorithm is used in the implementation. The effect of the speech processing is evaluated by measuring speech-reception thresholds (SRT) for sentences in speech noise, estimating the signal-to-noise ratio at which listeners can correctly reproduce 50% of presented sentences. Hearing-impaired and normal-hearing listeners were used. To simulate the hearing impairment resulting from a loss of frequency selectivity, we spectrally smeared the stimuli presented to the normal-hearing listeners. We found that the preprocessing scheme achieved a modest improvement of nearly 2 dB in the SRT for normal-hearing listeners. Data for hearing-impaired listeners are presently being collected.

  2. An investigation of the partial-assignment completion effect on students' assignment choice behavior.

    PubMed

    Hawthorn-Embree, Meredith L; Skinner, Christopher H; Parkhurst, John; Conley, Elisha

    2011-08-01

    This study was designed to investigate the partial assignment completion effect. Seventh-grade students were given a math assignment. After working for 5 min, they were interrupted and their partially completed assignments were collected. About 20 min later, students were given their partially completed assignment and a new, control assignment that contained the same number of equivalent problems that were incomplete on their partially completed assignment. Students were told that they would have to complete an assignment but could choose which assignment they completed. Significantly more students chose their partially completed assignment. Theoretical and applied implications and directions for future research are discussed. Copyright © 2011 Society for the Study of School Psychology. Published by Elsevier Ltd. All rights reserved.

  3. The relationship between frequency of family dinner and adolescent problem behaviors after adjusting for other family characteristics.

    PubMed

    Sen, Bisakha

    2010-02-01

    To examine the association between frequency of family dinners (FFD) and selected problem behaviors for adolescents after adjusting for family connectedness, parental awareness, other family activities, and other potentially confounding factors. Data are drawn from the National Longitudinal Survey of Youth, 1997. The primary variable of interest is self-reported FFD in a typical week. Problem behaviors studied are substance-use, physical violence, property-destruction, stealing, running away from home, andgang membership. Multivariate logistic models are estimated for each behaviors. Linear regression models are estimated for behavior-frequency for the sub-samples engaging in them. Analysis is done separately by gender. FFD is negatively associated with substance-use and running away for females; drinking, physical violence, property-destruction, stealing and running away for males. Family meals are negatively associated to certain problem behaviors for adolescents even after controlling rigorously for potentially confounding factors. Thus, programs that promote family meals are beneficial. Copyright (c) 2009 The Association for Professionals in Services for Adolescents. Published by Elsevier Ltd. All rights reserved.

  4. Convective stability in the Rayleigh-Benard and directional solidification problems - High-frequency gravity modulation

    NASA Technical Reports Server (NTRS)

    Wheeler, A. A.; Mcfadden, G. B.; Murray, B. T.; Coriell, S. R.

    1991-01-01

    The effect of vertical, sinusoidal, time-dependent gravitational acceleration on the onset of solutal convection during directional solidification is analyzed in the limit of large modulation frequency. When the unmodulated state is unstable, the modulation amplitude required to stabilize the system is determined by the method of averaging. When the unmodulated state is stable, resonant modes of instability occur at large modulation amplitude. These are analyzed using matched asymptotic expansions to elucidate the boundary-layer structure for both the Rayleigh-Benard and directional solidification configurations. Based on these analyses, a thorough examination of the dependence of the stability criteria on the unmodulated Rayleigh number, Schmidt number, and distribution coefficient, is carried out.

  5. A framework for solving atomistic phonon-structure scattering problems in the frequency domain using perfectly matched layer boundaries

    SciTech Connect

    Kakodkar, Rohit R.; Feser, Joseph P.

    2015-09-07

    We present a numerical approach to the solution of elastic phonon-interface and phonon-nanostructure scattering problems based on a frequency-domain decomposition of the atomistic equations of motion and the use of perfectly matched layer (PML) boundaries. Unlike molecular dynamic wavepacket analysis, the current approach provides the ability to simulate scattering from individual phonon modes, including wavevectors in highly dispersive regimes. Like the atomistic Green's function method, the technique reduces scattering problems to a system of linear algebraic equations via a sparse, tightly banded matrix regardless of dimensionality. However, the use of PML boundaries enables rapid absorption of scattered wave energies at the boundaries and provides a simple and inexpensive interpretation of the scattered phonon energy flux calculated from the energy dissipation rate in the PML. The accuracy of the method is demonstrated on connected monoatomic chains, for which an analytic solution is known. The parameters defining the PML are found to affect the performance and guidelines for selecting optimal parameters are given. The method is used to study the energy transmission coefficient for connected diatomic chains over all available wavevectors for both optical and longitudinal phonons; it is found that when there is discontinuity between sublattices, even connected chains of equivalent acoustic impedance have near-zero transmission coefficient for short wavelengths. The phonon scattering cross section of an embedded nanocylinder is calculated in 2D for a wide range of frequencies to demonstrate the extension of the method to high dimensions. The calculations match continuum theory for long-wavelength phonons and large cylinder radii, but otherwise show complex physics associated with discreteness of the lattice. Examples include Mie oscillations which terminate when incident phonon frequencies exceed the maximum available frequency in the embedded nanocylinder, and

  6. Quantum Monte Carlo impurity solvers for multi-orbital problems and frequency-dependent interactions

    NASA Astrophysics Data System (ADS)

    Shinaoka, H.; Assaad, F.; Blümer, N.; Werner, P.

    2017-07-01

    The solution of an auxiliary quantum impurity system is the computationally expensive step in dynamical mean field theory simulations of lattice models and materials. In this review, we discuss Monte Carlo based impurity solvers, which are suitable for a wide range of applications. In particular, we present an efficient implementation of the hybridization expansion approach, which enables the simulation of multiorbital impurity problems with off-diagonal and complex hybridizations, and dynamically screened (retarded) density-density interactions. As a complementary approach, we discuss an impurity solver based on the determinant Monte Carlo method, which scales favorably with inverse temperature and hence provides access to the very low temperature regime. The usefulness of these state-of-the-art impurity solvers is demonstrated with applications to the downfolding problem, i.e., the systematic derivation of dynamically screened interactions for low-energy effective models, and to pyrochlore iridates, where the spin-orbit coupling leads to complex hybridization functions in a multi-orbital system. As a benchmark for cluster extensions of dynamical mean field theory, we also present results from lattice Monte Carlo simulations for the momentum dependence of the pseudo-gap in the half-filled two-dimensional Hubbard model.

  7. Low-Frequency Vibrational Modes of Poly(glycolic acid) and Thermal Expansion of Crystal Lattice Assigned On the Basis of DFT-Spectral Simulation Aided with a Fragment Method.

    PubMed

    Yamamoto, Shigeki; Miyada, Mai; Sato, Harumi; Hoshina, Hiromichi; Ozaki, Yukihiro

    2017-02-09

    Low-frequency vibrational modes of lamellar crystalline poly(glycolic acid) (PGA) were measured on Raman and far-infrared (FIR) spectra. Among the observed bands, an FIR band at ∼70 cm(-1) and a Raman band at 125 cm(-1) showed a gradual lower-frequency shift with increasing temperature from 20 °C to the melting point at ∼230 °C. Their polarization direction was perpendicular to the chain axis of PGA. Both spectra were quantum-mechanically simulated with the aid of a fragment method, the Cartesian-coordinate tensor transfer, which enabled an explicit consideration of molecular interactions between two adjacent polymer chains. Good agreement was achieved between the experiment and theory in both spectra. The temperature-sensitive bands at ∼70 cm(-1) in FIR and at 125 cm(-1) in Raman comprise the out-of-plane C═O bending motion. The temperature-dependent shifts of the low-frequency bands were successfully simulated by the DFT-spectral calculation, exploring that the main origin of the shifts is the thermal expansion of the crystal lattice. This result indicates that the thermally shifted bands may be used as an indicator of the lattice expansion of PGA. Possible changes in intermolecular interactions of PGA under temperature rising were ascribed on the basis of natural bond orbital theory. The steric repulsion between the carbonyl O atom in one chain and the H-C bond in the adjacent chain will be a dominant interaction in the lattice-expanding process, which would cause the observed thermal shifts of the bending modes. Comparisons of the spectral assignment for PGA obtained in this study and that for poly-(R)-3-hydroxybutyrate (PHB) reported by us suggest that crystalline polyesters give vibrational modes composed of out-of-plane bending motion of C═O groups between ∼70 and ∼125 cm(-1), the modes of which are sensitive to the thermal expansion of crystal lattice and its concomitant changes in their intermolecular interactions.

  8. The seismic horizontal borehole problem: A mixed BEM-FEM-model approach in the frequency domain

    SciTech Connect

    Aubry, D.; Clouteau, D.; Svay, J.

    1994-12-31

    A hybrid method is developed in order to model seismic experiments performed in the specific configuration of horizontal boreholes. This method is based on a subdomain analysis which allows to couple together heterogeneous domains (fluid borehole, steel casing and layered soil) using virtual works, each domain is provided with a kinematically or geometrically appropriate model: the casing is handled with a thick cylindrical shell model, while fluid and soils are handled with boundary integral equations allowing to disregard their unbounded nature. A surfacic formulation of the problem is then obtained, which is further reduced to a lineic formulation using Fourier transform under the assumption of invariant media along the borehole axis. Numerical simulations make restitution of a tube wave guided along the borehole. Influences of the casing and a plane interface between two layers in the soil are also evaluated.

  9. Fleet Assignment Using Collective Intelligence

    NASA Technical Reports Server (NTRS)

    Antoine, Nicolas E.; Bieniawski, Stefan R.; Kroo, Ilan M.; Wolpert, David H.

    2004-01-01

    Airline fleet assignment involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of an agent-based integer optimization algorithm to a "cold start" fleet assignment problem. Results show that the optimizer can successfully solve such highly- constrained problems (129 variables, 184 constraints).

  10. Fleet Assignment Using Collective Intelligence

    NASA Technical Reports Server (NTRS)

    Antoine, Nicolas E.; Bieniawski, Stefan R.; Kroo, Ilan M.; Wolpert, David H.

    2004-01-01

    Airline fleet assignment involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of an agent-based integer optimization algorithm to a "cold start" fleet assignment problem. Results show that the optimizer can successfully solve such highly- constrained problems (129 variables, 184 constraints).

  11. Optimization of Rated Officer Staff Assignments

    DTIC Science & Technology

    2007-06-01

    determinant +1, -1 or 0, which holds for the assignment problem ( Bazaraa et al., 1990). The Unimodularity Theorem states for an integer matrix A with...Prentice-Hall, 1993. 2. Air Force Instruction 36-2110, Assignments, 20 April 2005. 3. Bazaraa , Mokhtar S., Jarvis, John J. and Sherali, Hanif D

  12. Cubic Icosahedra? A Problem in Assigning Symmetry

    ERIC Educational Resources Information Center

    Lloyd, D. R.

    2010-01-01

    There is a standard convention that the icosahedral groups are classified separately from the cubic groups, but these two symmetry types have been conflated as "cubic" in some chemistry textbooks. In this note, the connection between cubic and icosahedral symmetries is examined, using a simple pictorial model. It is shown that octahedral and…

  13. Cubic Icosahedra? A Problem in Assigning Symmetry

    ERIC Educational Resources Information Center

    Lloyd, D. R.

    2010-01-01

    There is a standard convention that the icosahedral groups are classified separately from the cubic groups, but these two symmetry types have been conflated as "cubic" in some chemistry textbooks. In this note, the connection between cubic and icosahedral symmetries is examined, using a simple pictorial model. It is shown that octahedral and…

  14. Therapeutic Homework Assignments.

    ERIC Educational Resources Information Center

    Corbishley, M. Anne; Yost, Elizabeth B.

    1985-01-01

    Outlines guidelines to follow in assigning therapeutic homework to students, focusing on student preparation, including behavior change, choosing and devising assignments, and checking on homework. With modification, counseling homework can be used with all students who are beyond second or third grade. (BL)

  15. The Failed Writing Assignment.

    ERIC Educational Resources Information Center

    Swyt, Wendy

    1995-01-01

    Discusses an unsuccessful English 101 writing assignment in which students were asked to analyze a Gary Larson cartoon. Examines critically the type of assignment that seeks to address and incorporate the student writer's "local knowledge" of cultural texts, while at the same time containing what counts as knowledge within limited parameters of…

  16. Optimal processor assignment for pipeline computations

    NASA Technical Reports Server (NTRS)

    Nicol, David M.; Simha, Rahul; Choudhury, Alok N.; Narahari, Bhagirath

    1991-01-01

    The availability of large scale multitasked parallel architectures introduces the following processor assignment problem for pipelined computations. Given a set of tasks and their precedence constraints, along with their experimentally determined individual responses times for different processor sizes, find an assignment of processor to tasks. Two objectives are of interest: minimal response given a throughput requirement, and maximal throughput given a response time requirement. These assignment problems differ considerably from the classical mapping problem in which several tasks share a processor; instead, it is assumed that a large number of processors are to be assigned to a relatively small number of tasks. Efficient assignment algorithms were developed for different classes of task structures. For a p processor system and a series parallel precedence graph with n constituent tasks, an O(np2) algorithm is provided that finds the optimal assignment for the response time optimization problem; it was found that the assignment optimizing the constrained throughput in O(np2log p) time. Special cases of linear, independent, and tree graphs are also considered.

  17. My Favorite Assignment.

    ERIC Educational Resources Information Center

    Post, Robert E.; Johnson, Jack E.

    1982-01-01

    Presents two assignments that show (1) how George Orwell's "Politics and the English Language" can be applied to business writing and (2) how structured student-teacher conferences can generate enthusiasm for oral expression in a business communication course. (AEA)

  18. My Favorite Assignment.

    ERIC Educational Resources Information Center

    Post, Robert E.; Johnson, Jack E.

    1982-01-01

    Presents two assignments that show (1) how George Orwell's "Politics and the English Language" can be applied to business writing and (2) how structured student-teacher conferences can generate enthusiasm for oral expression in a business communication course. (AEA)

  19. Using Computer-Assisted Personalized Assignments for Freshman Chemistry.

    ERIC Educational Resources Information Center

    Morrissey, D. J.; And Others

    1995-01-01

    Describes the Computer-Assisted Personalized Assignment (CAPA) system which offers a way to apply computers to assist instructors and students in the framework of lectures and assigned problem sets without students being forced to use the computer system. (DDR)

  20. Scheduling Linearly Indexed Assignment Codes

    NASA Astrophysics Data System (ADS)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

  1. Numerical solution of a coefficient inverse problem with multi-frequency experimental raw data by a globally convergent algorithm

    NASA Astrophysics Data System (ADS)

    Nguyen, Dinh-Liem; Klibanov, Michael V.; Nguyen, Loc H.; Kolesov, Aleksandr E.; Fiddy, Michael A.; Liu, Hui

    2017-09-01

    We analyze in this paper the performance of a newly developed globally convergent numerical method for a coefficient inverse problem for the case of multi-frequency experimental backscatter data associated to a single incident wave. These data were collected using a microwave scattering facility at the University of North Carolina at Charlotte. The challenges for the inverse problem under the consideration are not only from its high nonlinearity and severe ill-posedness but also from the facts that the amount of the measured data is minimal and that these raw data are contaminated by a significant amount of noise, due to a non-ideal experimental setup. This setup is motivated by our target application in detecting and identifying explosives. We show in this paper how the raw data can be preprocessed and successfully inverted using our inversion method. More precisely, we are able to reconstruct the dielectric constants and the locations of the scattering objects with a good accuracy, without using any advanced a priori knowledge of their physical and geometrical properties.

  2. 42 CFR 433.146 - Rights assigned; assignment method.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 42 Public Health 4 2010-10-01 2010-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN... Assignment of Rights to Benefits § 433.146 Rights assigned; assignment method. (a) Except as specified...

  3. Optimization of orbital assignment and specification of service areas in satellite communications

    NASA Technical Reports Server (NTRS)

    Wang, Cou-Way; Levis, Curt A.; Buyukdura, O. Merih

    1987-01-01

    The mathematical nature of the orbital and frequency assignment problem for communications satellites is explored, and it is shown that choosing the correct permutations of the orbit locations and frequency assignments is an important step in arriving at values which satisfy the signal-quality requirements. Two methods are proposed to achieve better spectrum/orbit utilization. The first, called the delta S concept, leads to orbital assignment solutions via either mixed-integer or restricted basis entry linear programming techniques; the method guarantees good single-entry carrier-to-interference ratio results. In the second, a basis for specifying service areas is proposed for the Fixed Satellite Service. It is suggested that service areas should be specified according to the communications-demand density in conjunction with the delta S concept in order to enable the system planner to specify more satellites and provide more communications supply.

  4. New optimization model for routing and spectrum assignment with nodes insecurity

    NASA Astrophysics Data System (ADS)

    Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli

    2017-04-01

    By adopting the orthogonal frequency division multiplexing technology, elastic optical networks can provide the flexible and variable bandwidth allocation to each connection request and get higher spectrum utilization. The routing and spectrum assignment problem in elastic optical network is a well-known NP-hard problem. In addition, information security has received worldwide attention. We combine these two problems to investigate the routing and spectrum assignment problem with the guaranteed security in elastic optical network, and establish a new optimization model to minimize the maximum index of the used frequency slots, which is used to determine an optimal routing and spectrum assignment schemes. To solve the model effectively, a hybrid genetic algorithm framework integrating a heuristic algorithm into a genetic algorithm is proposed. The heuristic algorithm is first used to sort the connection requests and then the genetic algorithm is designed to look for an optimal routing and spectrum assignment scheme. In the genetic algorithm, tailor-made crossover, mutation and local search operators are designed. Moreover, simulation experiments are conducted with three heuristic strategies, and the experimental results indicate that the effectiveness of the proposed model and algorithm framework.

  5. Generalised Assignment Matrix Methodology in Linear Programming

    ERIC Educational Resources Information Center

    Jerome, Lawrence

    2012-01-01

    Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…

  6. Generalised Assignment Matrix Methodology in Linear Programming

    ERIC Educational Resources Information Center

    Jerome, Lawrence

    2012-01-01

    Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…

  7. OptAssign--A Web-Based Tool for Assigning Students to Groups

    ERIC Educational Resources Information Center

    Meyer, David

    2009-01-01

    A frequent task in educational settings is to assign students to groups based on stated preferences for some projects or topics. This paper introduces a web-based tool supporting both the work flow of collecting student data and the group formation. The latter is based on finding optimal solutions to suitable mathematical assignment problems,…

  8. Model Refinement Using Eigensystem Assignment

    NASA Technical Reports Server (NTRS)

    Maghami, Peiman G.

    2000-01-01

    IA novel approach for the refinement of finite-element-based analytical models of flexible structures is presented. The proposed approach models the possible refinements in the mass, damping, and stiffness matrices of the finite element model in the form of a constant gain feedback with acceleration, velocity, and displacement measurements, respectively. Once the free elements of the structural matrices have been defined, the problem of model refinement reduces to obtaining position, velocity, and acceleration gain matrices with appropriate sparsity that reassign a desired subset of the eigenvalues of the model, along with partial mode shapes, from their baseline values to those obtained from system identification test data. A sequential procedure is used to assign one conjugate pair of eigenvalues at each step using symmetric output feedback gain matrices, and the eigenvectors are partially assigned, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The procedure can also impose that gain matrices be dissipative to guarantee the stability of the refined model. A numerical example, involving finite element model refinement for a structural testbed at NASA Langley Research Center (Controls-Structures-Interaction Evolutionary model) is presented to demonstrate the feasibility of the proposed approach.

  9. Model Refinement Using Eigensystem Assignment

    NASA Technical Reports Server (NTRS)

    Maghami, Pieman G.

    1998-01-01

    This paper presented a novel approach for the refinement of finite-element-based analytical models of flexible structures is presented. The proposed approach models the possible refinements in the mass, damping, and stiffness matrices of the finite element model in the form of a constant gain feedback with acceleration, velocity, and displacement measurements, respectively. Once, the free elements of the structural matrices have been defined, the problem of model refinement reduces to obtaining position, velocity, and acceleration gain matrices, which reassign a desired subset of the eigenvalues of the model, along with partial mode shapes, from their baseline values to those obtained from system identification test data. A sequential procedure is used to assign one self-conjugate pair of closed-loop eigenvalues at each step using symmetric output feedback gain matrices, and the closed-loop eigenvectors are partially assigned, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The procedure can also impose that gain matrices be dissipative in order to guarantee the stability of the refined model. A numerical example, involving finite element model refinement for a structural testbed at NASA Langley (CSI Evolutionary Model) is presented to demonstrate the feasibility of the proposed approach.

  10. Case Assignment in Agrammatism.

    ERIC Educational Resources Information Center

    Ruigendijk, Esther; van Zonneveld, Ron; Bastiaanse, Roelien

    1999-01-01

    This study evaluated the omission patterns of case markers in the spontaneous speech of 12 Dutch and German adult speakers with agrammatic aphasia within the framework of Chomsky's case theory. Data supported the hypothesis that, if no case assigner is produced, the noun will receive nominative case by default or the case-marking morpheme will be…

  11. Making Effective Assignments.

    ERIC Educational Resources Information Center

    McLeod, Alan M., Ed.

    1982-01-01

    Although the focus of this issue of the "Virginia English Bulletin" is on making effective assignments, most of the articles also emphasize the importance and power of writing. Articles deal with the following topics: (1) the use of I-search (as explained by Kenneth Macrorie in "Searching Writing") as a form of research paper…

  12. Principals Make Assignments Matter

    ERIC Educational Resources Information Center

    Dougherty, Eleanor

    2013-01-01

    The inner-city high school in Washington, DC, that Guillaume Gendre joined as an assistant principal had a modest reputation for achievement but was nevertheless challenged to raise expectations for student work. In other schools, Gendre had used assignments--a specific kind of instructional task in which students are charged to think about an…

  13. Eigenstructure assignment approach for structural damage detection

    NASA Technical Reports Server (NTRS)

    Zimmerman, David C.; Kaouk, Mohamed

    1992-01-01

    In this work, a methodology for incorporating measured modal data into an existing refined finite element model is examined with the objective of detecting and locating structural damage. The algorithm is based on the partial inverse problem, in that only partial spectral information is required. The technique utilizes a symmetric eigenstructure assignment algorithm to perform the partial spectral assignment. Algorithms to enhance mode shape assignability and to preserve sparsity in the damaged FEM are developed. The sparsity preservation is of particular importance when considering damage detection in trusslike structures. Several examples are presented to highlight the key points made within the paper.

  14. Dictums for problem solving and approximation in mathematical acoustics: examples involving low-frequency vibration and radiation.

    PubMed

    Pierce, Allan D; Thiam, Amadou G

    2012-03-01

    A sequence of dictums for mathematical acoustics is given representing opinions intended to be regarded as authoritative, but not necessarily universally agreed upon. The dictums are presented in the context of the detailed solution for a class of problems involving the forced vibration of a long cylinder protruding half-way into a half-space bounded by a compliant surface (impedance boundary) characterized by a spring constant. One limiting case corresponds to a cylinder vibrating within an infinite rigid baffle, and another limiting case corresponds to a vibrating cylinder on the compliant surface of an incompressible fluid. The second limiting case is identified as analogous to that of a floating half-submerged cylinder whose vibrations cause water waves to propagate over the surface. Attention is focused on vibrations at very low frequencies. Difficulties with insuring a causal solution are pointed out and dictums are given as to how one overcomes such difficulties. Various approximation techniques are described. The derivations involve application of the theory of complex variables and the method of matched asymptotic expansions, and the results include the apparent entrained mass in the near field of the cylinder and the radiation resistance per unit length experienced by the vibrating cylinder.

  15. Learning through Writing: Teaching Critical Thinking Skills in Writing Assignments

    ERIC Educational Resources Information Center

    Cavdar, Gamze; Doe, Sue

    2012-01-01

    Traditional writing assignments often fall short in addressing problems in college students' writing as too often these assignments fail to help students develop critical thinking skills and comprehension of course content. This article reports the use of a two-part (staged) writing assignment with postscript as a strategy for improving critical…

  16. Learning through Writing: Teaching Critical Thinking Skills in Writing Assignments

    ERIC Educational Resources Information Center

    Cavdar, Gamze; Doe, Sue

    2012-01-01

    Traditional writing assignments often fall short in addressing problems in college students' writing as too often these assignments fail to help students develop critical thinking skills and comprehension of course content. This article reports the use of a two-part (staged) writing assignment with postscript as a strategy for improving critical…

  17. Gain weighted eigenspace assignment

    NASA Technical Reports Server (NTRS)

    Davidson, John B.; Andrisani, Dominick, II

    1994-01-01

    This report presents the development of the gain weighted eigenspace assignment methodology. This provides a designer with a systematic methodology for trading off eigenvector placement versus gain magnitudes, while still maintaining desired closed-loop eigenvalue locations. This is accomplished by forming a cost function composed of a scalar measure of error between desired and achievable eigenvectors and a scalar measure of gain magnitude, determining analytical expressions for the gradients, and solving for the optimal solution by numerical iteration. For this development the scalar measure of gain magnitude is chosen to be a weighted sum of the squares of all the individual elements of the feedback gain matrix. An example is presented to demonstrate the method. In this example, solutions yielding achievable eigenvectors close to the desired eigenvectors are obtained with significant reductions in gain magnitude compared to a solution obtained using a previously developed eigenspace (eigenstructure) assignment method.

  18. Case assignment in agrammatism.

    PubMed

    Ruigendijk, E; van Zonneveld, R; Bastiaanse, R

    1999-08-01

    Agrammatic speech is characterized by the omission and substitution of grammatical morphemes. Some recent papers suggest that certain patterns of omission and substitution are ruled by linguistic, that is, syntactic processes (e.g., Hagiwara, 1995; Friedmann & Grodzinsky, 1997; Bastiaanse & Van Zonneveld, 1998). In the present paper, the omission pattern of case markers in the spontaneous speech of Dutch and German speakers with agrammatic aphasia is analyzed within the framework of Chomsky's (1986) case theory, which says that every phonetically realized NP must receive (abstract) case. The inflected verb (I) assigns nominative case to the subject in the sentence, and the verb (V) assigns dative and accusative case to the indirect and direct object, respectively. This, in combination with the knowledge that verbs and verb inflections are notoriously difficult for speakers with agrammatism, served as the basis for this study. We hypothesize that, if no case assigner is produced, the noun will receive nominative case by default or the case marking morpheme (i.e., the determiner) will be omitted. This hypothesis has been tested and was supported by the data.

  19. Simple wavelength assignment protocol

    NASA Astrophysics Data System (ADS)

    Suryaputra, Stephen; Touch, Joseph D.; Bannister, Joseph A.

    2000-10-01

    IP routers can be coupled with wavelength-selective optical cross- connects to support existing Internet infrastructure in a wavelength division multiplexing (WDM) optical network. Because optical wavelength routing is transparent to IP, packets can bypass traditional forwarding and pass directly through the optical cross-connect, resulting in very high throughput and low delay routing. This approach shares features with label switching, but wavelengths are much more scarce resource than labels. Because optical switches have larger switching times than electronic switches, and wavelength conversions are expensive, wavelength label swapping is not easily done. Wavelength label assignments must consider these limitations to be practical in an optical environment. The performance of an instance of this approach, called Packet over Wavelengths (POW) has been simulated and studied. A new signaling protocol, Simple Wavelength Assignment Protocol (SWAP) is devised to be POW signaling protocol. SWAP takes into account the optical device limitations, and is designed to minimize wavelength conversion, utilize wavelengths with the merging of flows, and reduce the reconfiguration of optical switches. SWAP, to our knowledge, is the first approach to combine signaling and wavelength assignment in an on- line protocol. This paper describes high level SWAP design challenges, decision, and overhead.

  20. Optimal Assignment Problem Applications of Finite Mathematics to Business and Economics. [and] Difference Equations with Applications. Applications of Difference Equations to Economics and Social Sciences. [and] Selected Applications of Mathematics to Finance and Investment. Applications of Elementary Algebra to Finance. [and] Force of Interest. Applications of Calculus to Finance. UMAP Units 317, 322, 381, 382.

    ERIC Educational Resources Information Center

    Gale, David; And Others

    Four units make up the contents of this document. The first examines applications of finite mathematics to business and economies. The user is expected to learn the method of optimization in optimal assignment problems. The second module presents applications of difference equations to economics and social sciences, and shows how to: 1) interpret…

  1. Alcohol Use Problems Mediate the Relation between Cannabis Use Frequency and College Functioning among Students Mandated to an Alcohol Diversion Program

    ERIC Educational Resources Information Center

    McChargue, Dennis E.; Klanecky, Alicia K.; Anderson, Jennifer

    2012-01-01

    The present study examined the degree to which alcohol use problems explained the relationship between cannabis use frequency and college functioning. Undergraduates (N = 546) mandated to an alcohol diversion program at a Midwestern United States university completed screening questionnaires between October 2003 and April 2006. Sobel's (1982) test…

  2. Alcohol Use Problems Mediate the Relation between Cannabis Use Frequency and College Functioning among Students Mandated to an Alcohol Diversion Program

    ERIC Educational Resources Information Center

    McChargue, Dennis E.; Klanecky, Alicia K.; Anderson, Jennifer

    2012-01-01

    The present study examined the degree to which alcohol use problems explained the relationship between cannabis use frequency and college functioning. Undergraduates (N = 546) mandated to an alcohol diversion program at a Midwestern United States university completed screening questionnaires between October 2003 and April 2006. Sobel's (1982) test…

  3. Military Personnel Assignments

    DTIC Science & Technology

    1987-01-09

    of Defense, Organization of the Joint Chiefs of Staff and the Defense Agencies," > f , February 4, 1970 (hereby canceled) (d) DoD Directive 1315.14...34DoD Components"). 2. Does not apply to service members in non-DoD activities covered by DoD Directive 1000.17 (reference ( f )). C. DEFINITIONS Terms...possible, shall be allowed to extend any assignment voluntarily beyond the prescribed tour. f . Through the grades of 0-5 for officers and E-8 for enlisted

  4. Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

    SciTech Connect

    Syed A. Ahmad; Umesh Shukla; Ryan E. Irwin; Luiz A. DaSilva; Allen B. MacKenzie

    2011-03-01

    In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five algorithms representative of DCPA used in literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate the effectiveness of the algorithms in achieving feasible link allocations in the network, as well as their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment (LICIPA) algorithm does not require cross-link gain information, has the overall lowest run time, and highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.

  5. Protein side-chain resonance assignment and NOE assignment using RDC-defined backbones without TOCSY data.

    PubMed

    Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall

    2011-08-01

    One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA: (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA: extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA: assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA: have backbone

  6. Pathways to Assignment of Payees

    PubMed Central

    Rosen, Marc I.; Ablondi, Karen; Black, Anne C.; Serowik, Kristin L.; Rowe, Michael

    2013-01-01

    How clients come to be assigned representative payees and/or conservators to manage their funds is not well understood. We compared clients assigned a payee during a clinical trial of a money management-based intervention to those not assigned payees and examined antecedents to payee assignment. One year after randomization, significantly more clients assigned to the ATM money management intervention were assigned payees than participants in the control condition (10 of 47 vs. 2 of 43; p=.02); those assigned payees had lower baseline GAF scores and participated more in study therapies. Several ATM clients were assigned payees after third parties paid more attention to clients’ finances, and others after having negotiated storage of their funds with the ATM money manager during the study. Assignment of payees appears to be influenced by whether third parties critically attend to how clients’ manage funds and by clients’ receptiveness to having a payee. PMID:23765182

  7. Pathways to assignment of payees.

    PubMed

    Rosen, Marc I; Ablondi, Karen; Black, Anne C; Serowik, Kristin L; Rowe, Michael

    2014-04-01

    How clients come to be assigned representative payees and/or conservators to manage their funds is not well understood. We compared clients assigned a payee during a clinical trial of a money management-based intervention to those not assigned payees and examined antecedents to payee assignment. One year after randomization, significantly more clients assigned to the advisor teller money manager (ATM) money management intervention were assigned payees than participants in the control condition (10 of 47 vs. 2 of 43; p = .02); those assigned payees had lower baseline GAF scores and participated more in study therapies. Several ATM clients were assigned payees after third parties paid more attention to clients' finances, and others after having negotiated storage of their funds with the ATM money manager during the study. Assignment of payees appears to be influenced by whether third parties critically attend to how clients' manage funds and by clients' receptiveness to having a payee.

  8. Evolution of Protein Lipograms: A Bioinformatics Problem

    ERIC Educational Resources Information Center

    White, Harold B., III; Dhurjati, Prasad

    2006-01-01

    A protein lacking one of the 20 common amino acids is a protein lipogram. This open-ended problem-based learning assignment deals with the evolution of proteins with biased amino acid composition. It has students query protein and metabolic databases to test the hypothesis that natural selection has reduced the frequency of each amino acid…

  9. Evolution of Protein Lipograms: A Bioinformatics Problem

    ERIC Educational Resources Information Center

    White, Harold B., III; Dhurjati, Prasad

    2006-01-01

    A protein lacking one of the 20 common amino acids is a protein lipogram. This open-ended problem-based learning assignment deals with the evolution of proteins with biased amino acid composition. It has students query protein and metabolic databases to test the hypothesis that natural selection has reduced the frequency of each amino acid…

  10. A new multi-frequency approach based on Padé approximants for the treatment of transient dynamics problems with the variational theory of complex rays

    NASA Astrophysics Data System (ADS)

    Rouzaud, C.; Gatuingt, F.; Hervé, G.; Dorival, O.

    2017-03-01

    Frequency-based methods were set up in order to circumvent the limits of classical finite element methods in fast dynamic simulations due to discretizations. In this approach the dynamic loading was shifted in the frequency domain by FFT, then treated by the Variational Theory of Complex Rays, and then the time response was reconstructed through an IFFT. This strategy proved to be very efficient due to the CPU VTCR very low cost. However in the case of a large loading spectrum this frequency-by-frequency approach could seriously degrade the computational performances of the strategy. This paper addresses this point by proposing the use of Padé approximants in order to limit the number of frequencies at which the response should be calculated. Padé approximation is applied to the overall VTCR system based on its frequency dependency. Finally, as simulations on a simple academic case and on a civil engineering structure show, this method is found to be very efficient for interpolating the frequency response functions of a complex structure. This is a key point to preserve the efficiency of the complete VTCR strategy for transient dynamic problems.

  11. Credit assignment during movement reinforcement learning.

    PubMed

    Dam, Gregory; Kording, Konrad; Wei, Kunlin

    2013-01-01

    We often need to learn how to move based on a single performance measure that reflects the overall success of our movements. However, movements have many properties, such as their trajectories, speeds and timing of end-points, thus the brain needs to decide which properties of movements should be improved; it needs to solve the credit assignment problem. Currently, little is known about how humans solve credit assignment problems in the context of reinforcement learning. Here we tested how human participants solve such problems during a trajectory-learning task. Without an explicitly-defined target movement, participants made hand reaches and received monetary rewards as feedback on a trial-by-trial basis. The curvature and direction of the attempted reach trajectories determined the monetary rewards received in a manner that can be manipulated experimentally. Based on the history of action-reward pairs, participants quickly solved the credit assignment problem and learned the implicit payoff function. A Bayesian credit-assignment model with built-in forgetting accurately predicts their trial-by-trial learning.

  12. Integrated assignment and path planning

    NASA Astrophysics Data System (ADS)

    Murphey, Robert A.

    2005-11-01

    A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact

  13. 76 FR 55880 - Recording Assignments

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-09-09

    ... United States Patent and Trademark Office Recording Assignments ACTION: Proposed collection; comment... should be directed to Joyce R. Johnson, Manager, Assignment Division, Mail Stop 1450, United States...) to record patent and trademark assignment documents, including transfers of properties (i.e. patents...

  14. Structural Case Assignment in Korean

    ERIC Educational Resources Information Center

    Koak, Heeshin

    2012-01-01

    In this dissertation, I aim to provide a theory on the distribution of structural Case in Korean. I propose the following Structural Case Assignment Hypothesis (SCAH) regarding the assignment of structural Case: "Structural Case is assigned by phase heads (C: nominative; v: accusative) to every argument in the c-command domain of the phase…

  15. Pole Assignment for Second-Order Systems

    NASA Astrophysics Data System (ADS)

    CHU, E. K.

    2002-01-01

    This paper contains some results for pole assignment problems for the second-order system M ẍ(t)+D ẋ(t)+K x (t)=B u (t) . Specifically, Algorithm 0 constructs feedback matrices F1 and F2 such that the closed-loop quadratic pencil Pc( λ)= λ2M+ λ ( D+ BF2)+( K+ BF1) has a desired set of eigenvalues and the associated eigenvectors are well-conditioned. The method is a modification of the SVD-based method proposed by Juang and Maghami [1, 2] which is a second-order adaptation of the well-known robust eigenvalue assignment method by Kautsky et al. [3] for first-order systems. Robustness is achieved by minimising some not-so-well-known condition numbers of the eigenvalues of the closed-loop second-order pencil. We next consider the partial pole assignment problem. In 1997, Datta, Elhay and Ram proposed three biorthogonality relations for eigenvectors of symmetric definite quadratic pencils [4]. One of these relations was used to derive an explicit solution to the partial pole assignment problem by state feedback for the related single-input symmetric definite second-order control system. The solution shed new light on the stabilisation and control of large flexible space structures, for which only one small subset of the spectrum needs to be reassigned while retaining the complementary part of the spectrum. In this paper, the method has been generalised for multi-input and non-symmetric quadratic pencils. Finally, we discuss briefly the output feedback pole assignment problem.

  16. 47 CFR 24.839 - Transfer of control or assignment of license.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 2 2014-10-01 2014-10-01 false Transfer of control or assignment of license... Broadband PCS § 24.839 Transfer of control or assignment of license. (a) Restrictions on Assignments and... control of a license for frequency Block C or frequency Block F won in closed bidding pursuant to...

  17. Characteristics and Predictors of Health Problems from Use among High-Frequency Cannabis Users in a Canadian University Student Population

    ERIC Educational Resources Information Center

    Fischer, Benedikt; Dawe, Meghan; Mcguire, Fraser; Shuper, Paul A; Jones, Wayne; Rudzinski, Katherine; Rehm, Jurgen

    2012-01-01

    Aims: Assess key cannabis use, risk and outcome characteristics among high-frequency cannabis users within a university student sample in Toronto, Canada. Methods: N = 134 active universities students (ages of 18-28) using cannabis at least three times per week were recruited by mass advertisement, telephone-screened and anonymously assessed by an…

  18. Characteristics and Predictors of Health Problems from Use among High-Frequency Cannabis Users in a Canadian University Student Population

    ERIC Educational Resources Information Center

    Fischer, Benedikt; Dawe, Meghan; Mcguire, Fraser; Shuper, Paul A; Jones, Wayne; Rudzinski, Katherine; Rehm, Jurgen

    2012-01-01

    Aims: Assess key cannabis use, risk and outcome characteristics among high-frequency cannabis users within a university student sample in Toronto, Canada. Methods: N = 134 active universities students (ages of 18-28) using cannabis at least three times per week were recruited by mass advertisement, telephone-screened and anonymously assessed by an…

  19. REVIEWS OF TOPICAL PROBLEMS: Natural and man-made low-frequency magnetic fields as a potential health hazard

    NASA Astrophysics Data System (ADS)

    Ptitsyna, N. G.; Villoresi, G.; Dorman, L. I.; Iucci, N.; Tyasto, Marta I.

    1998-07-01

    Is human health affected by low-frequency low-intensity environmental magnetic fields? There is much diehard evidence that it is. For this reason irregular, spectrally complex ULF (0-10 Hz) magnetic fields have recently come under scrutiny, typical of natural geomagnetic perturbations or electric transportation. Recent work shows that such fields do affect the nervous system and may even cause heart attacks.

  20. On eigensystem assignment with dissipativity constraints

    NASA Technical Reports Server (NTRS)

    Maghami, Peiman G.; Gupta, Sandeep

    1993-01-01

    Stability of the closed-loop system is of vital importance when controller synthesis is being performed using a reduced order model of the open-loop plant. For passive systems such as flexible space structures, closed-loop stability is often ensured by low-authority dissipative controllers using collocated and compatible sensors and actuators. This paper considers the problem of eigensystem assignment for flexible structures using constant-gain output feedback, under the dissipativity constraints requiring that the gain matrices be nonnegative definite. A novel method is developed in which a sequential procedure is used to assign one complex-conjugate pair of closed-loop eigenvalues in each step. At each step, an iterative technique is employed for generating a nonnegative definite gain matrix that assigns a new pair while keeping the previously assigned pairs unchanged. This method can assign up to m closed-loop system eigenvalues, where m is the number of control inputs. A numerical example of damping enhancement for a large flexible structure is presented to demonstrate the approach.

  1. Optimizing Marine Security Guard Assignments

    DTIC Science & Technology

    2011-06-01

    Bangkok , Thailand East Asia and Pacific 18 4 Fort Lauderdale, Florida Western Hemisphere - South 13 5 Frankfurt, Germany Western Europe and Scandinavia 15...2008). Each 7 stationing plan satisfies a myriad of unit requirements, such as building and land availability. Similarly, each assignment solution...optimize the assignment of enlisted Marines to billets. EAM-GLOBAL seeks to assign the best Marine-billet fit while balancing staffing shortages

  2. Assignment of Empirical Mode Decomposition Components and Its Application to Biomedical Signals.

    PubMed

    Schiecke, K; Schmidt, C; Piper, D; Putsche, P; Feucht, M; Witte, H; Leistritz, L

    2015-01-01

    Empirical mode decomposition (EMD) is a frequently used signal processing approach which adaptively decomposes a signal into a set of narrow-band components known as intrinsic mode functions (IMFs). For multi-trial, multivariate (multiple simultaneous recordings), and multi-subject analyses the number and signal properties of the IMFs can deviate from each other between trials, channels and subjects. A further processing of IMFs, e.g. a simple ensemble averaging, should determine which IMFs of one signal correspond to IMFs from another signal. When the signal properties have similar characteristics, the IMFs are assigned to each other. This problem is known as correspondence problem. From the mathematical point of view, in some cases the correspondence problem can be transformed into an assignment problem which can be solved e.g. by the Kuhn-Munkres algorithm (KMA) by which a minimal cost matching can be found. We use the KMA for solving classic assignment problems, i.e. the pairwise correspondence between two sets of IMFs of equal cardinalities, and for pairwise correspondences between two sets of IMFs with different cardinalities representing an unbalanced assignment problem which is a special case of the k-cardinality assignment problem. A KMA-based approach to solve the correspondence problem was tested by using simulated, heart rate variability (HRV), and EEG data. The KMA-based results of HRV decomposition are compared with those obtained from a hierarchical cluster analysis (state-of-the-art). The major difference between the two approaches is that there is a more consistent assignment pattern using KMA. Integrating KMA into complex analysis concepts enables a comprehensive exploitation of the key advantages of the EMD. This can be demonstrated by non-linear analysis of HRV-related IMFs and by an EMD-based cross-frequency coupling analysis of the EEG data. The successful application to HRV and EEG analysis demonstrates that our solutions can be used for

  3. Overcoming the overlap problem in the assignment of sup 1 H NMR spectra of larger proteins by use of three-dimensional heteronuclear sup 1 H- sup 15 N Hartmann-Hahn-multiple quantum coherence and nuclear Overhauser-multiple quantum coherence spectroscopy: Application to interleukin 1. beta

    SciTech Connect

    Marion, D.; Driscoll, P.C.; Kay, L.E.; Wingfield, P.T.; Bax, A.; Gronenborn, A.M.; Clore, G.M. )

    1989-07-25

    The application of three-dimensional (3D) heteronuclear NMR spectroscopy to the sequential assignment of the {sup 1}H NMR spectra of larger proteins is presented, using uniformly labeled ({sup 15}N)interleukin 1{beta}, a protein of 153 residues and molecular mass of 17.4 kDa, as an example. The two-dimensional (2D) 600-MHz spectra of interleukin 1{beta} are too complex for complete analysis, owing to extensive cross-peak overlap and chemical shift degeneracy. The authors show that the combined use of 3D {sup 1}H-{sup 15}N Hartmann-Hahn-multiple quantum coherence (HOHAHA-HMQC) and nuclear Overhauser-multiple quantum coherence (NOESY-HMQC) spectroscopy, designed to provide the necessary through-bond and through-space correlations for sequential assignment, provides a practical general-purpose method for resolving ambiguities which severely limit the analysis of conventional 2D NMR spectra. The problem of amide NH chemical shift degeneracy in the {sup 1}H NMR spectrum is therefore effectively removed, and the assignment procedure simply involves inspecting a series of 2D {sup 1}H-{sup 1}H slices edited by the chemical shift of the directly bonded {sup 15}N atom. It is envisaged that the intrinsic simplicity of the 3D heteronuclear spectra, even for proteins of 150-200 residues, will permit the development of efficient computer-assisted or automated sequential assignment methods.

  4. Improving load balance with flexibly assignable tasks

    SciTech Connect

    Pinar, Ali; Hendrickson, Bruce

    2003-09-09

    In many applications of parallel computing, distribution ofthe data unambiguously implies distribution of work among processors. Butthere are exceptions where some tasks can be assigned to one of severalprocessors without altering the total volume of communication. In thispaper, we study the problem of exploiting this flexibility in assignmentof tasks to improve load balance. We first model the problem in terms ofnetwork flow and use combinatorial techniques for its solution. Ourparametric search algorithms use maximum flow algorithms for probing on acandidate optimal solution value. We describe two algorithms to solve theassignment problem with \\logW_T and vbar P vbar probe calls, w here W_Tand vbar P vbar, respectively, denote the total workload and number ofproce ssors. We also define augmenting paths and cuts for this problem,and show that anyalgorithm based on augmenting paths can be used to findan optimal solution for the task assignment problem. We then consideracontinuous version of the problem, and formulate it as a linearlyconstrained optimization problem, i.e., \\min\\|Ax\\|_\\infty,\\; {\\rms.t.}\\;Bx=d. To avoid solving an intractable \\infty-norm optimization problem,we show that in this case minimizing the 2-norm is sufficient to minimizethe \\infty-norm, which reduces the problem to the well-studiedlinearly-constrained least squares problem. The continuous version of theproblem has the advantage of being easily amenable to parallelization.Our experiments with molecular dynamics and overlapped domaindecomposition applications proved the effectiveness of our methods withsignificant improvements in load balance. We also discuss how ourtechniques can be enhanced for heterogeneous systems.

  5. De-Coding Writing Assignments.

    ERIC Educational Resources Information Center

    Simon, Linda

    1991-01-01

    Argues that understanding assignments is the first step toward successful college writing. Urges instructors to support students by helping them to decode assignments. Breaks down instructions into individual tasks including (1) writing an essay, (2) examining an issue, (3) reviewing articles and books, and (4) focusing on some texts. Defines each…

  6. Large Scale Parameter Estimation Problems in Frequency-Domain Elastodynamics Using an Error in Constitutive Equation Functional

    PubMed Central

    Banerjee, Biswanath; Walsh, Timothy F.; Aquino, Wilkins; Bonnet, Marc

    2012-01-01

    This paper presents the formulation and implementation of an Error in Constitutive Equations (ECE) method suitable for large-scale inverse identification of linear elastic material properties in the context of steady-state elastodynamics. In ECE-based methods, the inverse problem is postulated as an optimization problem in which the cost functional measures the discrepancy in the constitutive equations that connect kinematically admissible strains and dynamically admissible stresses. Furthermore, in a more recent modality of this methodology introduced by Feissel and Allix (2007), referred to as the Modified ECE (MECE), the measured data is incorporated into the formulation as a quadratic penalty term. We show that a simple and efficient continuation scheme for the penalty term, suggested by the theory of quadratic penalty methods, can significantly accelerate the convergence of the MECE algorithm. Furthermore, a (block) successive over-relaxation (SOR) technique is introduced, enabling the use of existing parallel finite element codes with minimal modification to solve the coupled system of equations that arises from the optimality conditions in MECE methods. Our numerical results demonstrate that the proposed methodology can successfully reconstruct the spatial distribution of elastic material parameters from partial and noisy measurements in as few as ten iterations in a 2D example and fifty in a 3D example. We show (through numerical experiments) that the proposed continuation scheme can improve the rate of convergence of MECE methods by at least an order of magnitude versus the alternative of using a fixed penalty parameter. Furthermore, the proposed block SOR strategy coupled with existing parallel solvers produces a computationally efficient MECE method that can be used for large scale materials identification problems, as demonstrated on a 3D example involving about 400,000 unknown moduli. Finally, our numerical results suggest that the proposed MECE

  7. A Generalized Assignment Heuristic for Vehicle Routing

    DTIC Science & Technology

    1979-08-01

    1977), 517-524. 20. Shuster, K. A. and D. A. Schur.- "A Heuristic Approach to Routing Solid Waste Collection Vehicles," U.S. Environmental Protection...this problem by ( VRP ). L. . . . .. i -3- Formulation of the Vehicle Routing Problem ( VRP ) min Z c X. (1)ijk 1) i jk S.t. Z aiYik < bk , k ,...,K (2) 1...developing a sophisticated solution theory for the traveling salesman and generalized assignment models embedded within ( VRP ). By con- trast

  8. Emergency Department Rotational Patient Assignment.

    PubMed

    Traub, Stephen J; Stewart, Christopher F; Didehban, Roshanak; Bartley, Adam C; Saghafian, Soroush; Smith, Vernon D; Silvers, Scott M; LeCheminant, Ryan; Lipinski, Christopher A

    2016-02-01

    We compare emergency department (ED) operational metrics obtained in the first year of a rotational patient assignment system (in which patients are assigned to physicians automatically according to an algorithm) with those obtained in the last year of a traditional physician self-assignment system (in which physicians assigned themselves to patients at physician discretion). This was a pre-post retrospective study of patients at a single ED with no financial incentives for physician productivity. Metrics of interest were length of stay; arrival-to-provider time; rates of left before being seen, left subsequent to being seen, early returns (within 72 hours), and early returns with admission; and complaint ratio. We analyzed 23,514 visits in the last year of physician self-assignment and 24,112 visits in the first year of rotational patient assignment. Rotational patient assignment was associated with the following improvements (percentage change): median length of stay 232 to 207 minutes (11%), median arrival to provider time 39 to 22 minutes (44%), left before being seen 0.73% to 0.36% (51%), and complaint ratio 9.0/1,000 to 5.4/1,000 (40%). There were no changes in left subsequent to being seen, early returns, or early returns with admission. In a single facility, the transition from physician self-assignment to rotational patient assignment was associated with improvement in a broad array of ED operational metrics. Rotational patient assignment may be a useful strategy in ED front-end process redesign. Copyright © 2015 American College of Emergency Physicians. Published by Elsevier Inc. All rights reserved.

  9. Problems with the identification of 'problematic' cannabis use: examining the issues of frequency, quantity, and drug use environment.

    PubMed

    Asbridge, Mark; Duff, Cameron; Marsh, David C; Erickson, Patricia G

    2014-01-01

    Considerable recent attention has focused on how harmful or problematic cannabis use is defined and understood in the literature and put to use in clinical practice. The aim of the current study is to review conceptual and measurement shortcomings in the identification of problematic cannabis use, drawing on the WHO ASSIST instrument for specific examples. Three issues with the current approach are debated and discussed: (1) the identification of problematic cannabis use disproportionately relies on measures of the frequency of cannabis consumption rather than the harms experienced; (2) the quantity consumed on a typical day is not considered when assessing problematic use, and (3) screening tools for problematic use employ a 'one-size-fits-all approach' and fail to reflect on the drug use context (networks and environment). Our commentary tackles each issue, with a review of relevant literature coupled with analyses of two Canadian data sources--a representative sample of the Canadian adult population and a smaller sample of adult, regular, long-term cannabis users from four Canadian cities--to further articulate each point. This article concludes with a discussion of appropriate treatment interventions and approaches to reduce cannabis-related harms, and offers suggested changes to improve the measurement of problematic cannabis use. © 2014 S. Karger AG, Basel.

  10. Partial eigenvalue assignment for structural damage mitigation

    NASA Astrophysics Data System (ADS)

    Ashokkumar, Chimpalthradi R.; Iyengar, N. G. R.

    2011-01-01

    In partial eigenvalue assignment, not all eigenvalues of the open loop system matrix are modified through a multiple input state or output feedback controller. This freedom available to assign selected eigenvalues of the closed loop system matrix has been widely used in design contexts such as to eliminate spillover effects in structural control problems. Similar approach is also required to modify damping and/or stiffness characteristics in selected eigenmodes of a damaged structure. When an external force acts on the damaged structure, partial eigenvalue assignment in this fashion will attempt to use minimal control effort and keep the structure active with safe operation. In this paper, a new approach to partial eigenvalue assignment and its application to structural damage mitigation are presented. A three mass spring-damper model with damage in one of the springs is illustrated with damping modifications at specific eigenmodes. The procedure is repeated for a second example, which is a cantilever beam modeled using two inputs and 10 state variables.

  11. Multiobjective controller synthesis via eigenstructure assignment with state feedback

    NASA Astrophysics Data System (ADS)

    Li, Zhao; Lam, James

    2016-10-01

    A general parameter scheme for multiobjective controller synthesis via eigenstructure assignment with state feedback is proposed. The scheme provides total pole configurability, that is, pole assignment constraints, partial pole assignment constraints, generalised regional pole assignment constraints can be dealt with simultaneously without introducing essential conservatism. The scheme is derived from the pole assignment approach using Sylvester equations, and the parameter space is the Cartesian product of some subspaces characterising the free parameters. Under the scheme, the controller design problems are formulated as nonlinear optimisation problems with both objectives and constraints being differentiable and can be solved by derivative-based nonlinear programming technique. Numerical examples are given to illustrate the efficiency of the proposed method.

  12. An Assignment Sequence for Underprepared Writers.

    ERIC Educational Resources Information Center

    Nimmo, Kristi

    2000-01-01

    Presents a sequenced writing assignment on shopping to aid basic writers. Describes a writing assignment focused around online and mail-order shopping. Notes steps in preparing for the assignment, the sequence, and discusses responses to the assignments. (SC)

  13. An Assignment Sequence for Underprepared Writers.

    ERIC Educational Resources Information Center

    Nimmo, Kristi

    2000-01-01

    Presents a sequenced writing assignment on shopping to aid basic writers. Describes a writing assignment focused around online and mail-order shopping. Notes steps in preparing for the assignment, the sequence, and discusses responses to the assignments. (SC)

  14. Node assignment in heterogeneous computing

    NASA Technical Reports Server (NTRS)

    Som, Sukhamoy

    1993-01-01

    A number of node assignment schemes, both static and dynamic, are explored for the Algorithm to Architecture Mapping Model (ATAMM). The architecture under consideration consists of heterogeneous processors and implements dataflow models of real-time applications. Terminology is developed for heterogeneous computing. New definitions are added to the ATAMM for token and assignment classifications. It is proved that a periodic execution is possible for dataflow graphs. Assignment algorithms are developed and proved. A design procedure is described for satisfying an objective function in an heterogeneous architecture. Several examples are provided for illustration.

  15. Target-based fiber assignment for large survey spectrographs

    NASA Astrophysics Data System (ADS)

    Schaefer, Christoph E. R.; Makarem, Laleh; Kneib, Jean-Paul

    2016-07-01

    Next generation massive spectroscopic survey projects have to process a massive amount of targets. The preparation of subsequent observations should be feasible in a reasonable amount of time. We present a fast algorithm for target assignment that scales as O(log(n)). Our proposed algorithm follow a target based approach, which enables to assign large number of targets to their positioners quickly and with a very high assignment efficiency. We also discuss additional optimization of the fiber positioning problem to take into account the positioner collision problems and how to use the algorithm for an optimal survey strategy. We apply our target-based algorithm in the context of the MOONS project.

  16. Intelligence Surveillance and Reconnaissance Asset Assignment for Optimal Mission Effectiveness

    DTIC Science & Technology

    2008-03-01

    problem, including fuzzy op- timization [9], [18], goal programming [17], [18], surrogate constraints [21], dynamic programming [31], and the ε-constraint...complete. Given an instance of SRA (Decision Problem) with b, G, and a set of concave, increasing, non-linear functions, fp (where there are a total of γ...functions), does there exist an integer assignment to y ∈ Zγ such that γ∑ p=1 fp (yp) ≥ G (3.9) γ∑ p=1 yp ≤ b First, assign F = G and α = b. Assign χ = 1

  17. Protein Side-Chain Resonance Assignment and NOE Assignment Using RDC-Defined Backbones without TOCSY Data3

    PubMed Central

    Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall

    2011-01-01

    One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA have backbone RMSD 0

  18. Inverse problem in ionospheric science: prediction of solar soft-X-ray spectrum from very low frequency radiosonde results

    NASA Astrophysics Data System (ADS)

    Palit, S.; Ray, S.; Chakrabarti, S. K.

    2016-05-01

    X-rays and gamma-rays from astronomical sources such as solar flares are mostly absorbed by the Earth's atmosphere. Resulting electron-ion production rate as a function of height depends on the intensity and wavelength of the injected spectrum and therefore the effects vary from one source to another. In other words, the ion density vs. altitude profile has the imprint of the incident photon spectrum. In this paper, we investigate whether we can invert the problem uniquely by deconvolution of the VLF amplitude signal to obtain the details of the injected spectrum. We find that it is possible to do this up to a certain accuracy. This leads us to the possibility of uninterrupted observation of X-ray photon spectra of solar flares that are often hindered by the restricted observation window of space satellites to avoid charge particle damages. Such continuous means of observation are essential in deriving information on time evolution of physical processes related to electron acceleration and interaction with plasma in solar atmosphere. Our method is useful to carry out a similar exercise to infer the spectra of more energetic events such as the Gamma Ray Bursts (GRBs), Soft Gamma-ray Repeaters (SGRs) etc., by probing even the lower part of the Earth's atmosphere. We thus show that to certain extent, the Earth's atmosphere could be used as a gigantic detector of relatively strong astronomical events.

  19. 47 CFR 74.638 - Frequency coordination.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency coordination. 74.638 Section 74.638... Stations § 74.638 Frequency coordination. (a) Coordination of all frequency assignments for fixed stations... parties agree. Coordination of all frequency assignments for all mobile (temporary fixed) stations in all...

  20. 47 CFR 74.638 - Frequency coordination.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency coordination. 74.638 Section 74.638... Stations § 74.638 Frequency coordination. (a) Coordination of all frequency assignments for fixed stations... parties agree. Coordination of all frequency assignments for all mobile (temporary fixed) stations in all...

  1. 47 CFR 87.303 - Frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Frequencies. 87.303 Section 87.303... Flight Test Stations § 87.303 Frequencies. (a) These frequencies are available for assignment to flight....375 3 123.450 3 (b) These additional frequencies are available for assignment only to flight test...

  2. 47 CFR 74.638 - Frequency coordination.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency coordination. 74.638 Section 74.638... Stations § 74.638 Frequency coordination. (a) Coordination of all frequency assignments for fixed stations... parties agree. Coordination of all frequency assignments for all mobile (temporary fixed) stations in all...

  3. 47 CFR 87.303 - Frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Frequencies. 87.303 Section 87.303... Flight Test Stations § 87.303 Frequencies. (a) These frequencies are available for assignment to flight....375 3 123.450 3 (b) These additional frequencies are available for assignment only to flight test...

  4. 47 CFR 74.638 - Frequency coordination.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency coordination. 74.638 Section 74.638... Stations § 74.638 Frequency coordination. (a) Coordination of all frequency assignments for fixed stations... parties agree. Coordination of all frequency assignments for all mobile (temporary fixed) stations in all...

  5. 47 CFR 87.303 - Frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Frequencies. 87.303 Section 87.303... Flight Test Stations § 87.303 Frequencies. (a) These frequencies are available for assignment to flight....375 3 123.450 3 (b) These additional frequencies are available for assignment only to flight test...

  6. 47 CFR 87.303 - Frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Frequencies. 87.303 Section 87.303... Flight Test Stations § 87.303 Frequencies. (a) These frequencies are available for assignment to flight....375 3 123.450 3 (b) These additional frequencies are available for assignment only to flight test...

  7. 47 CFR 74.638 - Frequency coordination.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency coordination. 74.638 Section 74.638... Stations § 74.638 Frequency coordination. (a) Coordination of all frequency assignments for fixed stations... parties agree. Coordination of all frequency assignments for all mobile (temporary fixed) stations in all...

  8. 47 CFR 87.303 - Frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 5 2014-10-01 2014-10-01 false Frequencies. 87.303 Section 87.303... Flight Test Stations § 87.303 Frequencies. (a) These frequencies are available for assignment to flight....375 3 123.450 3 (b) These additional frequencies are available for assignment only to flight test...

  9. 47 CFR 90.723 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 20 0.8-2.0 25 2.0-4.0 50 4.0-5.0 100 5.0-6.0 200 Over 6.0 500 1 Transmitter peak envelope power shall... this chapter, with a 9 dB correction factor for antenna height differential. The 10 dB protection to... correction factor for antenna height differential....

  10. 47 CFR 80.707 - Cooperative use of frequency assignments.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... point-to-point communication needs can be adequately served by a single radio communication facility. (b....707 Section 80.707 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Alaska Fixed Stations § 80.707 Cooperative use...

  11. 47 CFR 90.621 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... the Public Safety and Business/Industrial/Land Transportation Categories must specify on the...″ North Mountain 47° 19′ 07.3″ 123° 20′ 48.6″ Green Mountain 47° 33′ 40.3″ 122° 48′ 31.5″ Capitol Peak 46... described in § 90.16) and Business/Industrial/Land Transportation categories which have not met the...

  12. 47 CFR 90.723 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ...) will be geographically separated from those Phase I base or fixed station transmitters utilizing 220... Separation of Sub-Band A; Base or Fixed Station Receivers and Sub-Band B; Base or Fixed Station Transmitters... separate their base station or fixed station transmitters from the base station or fixed......

  13. 47 CFR 90.723 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ...) will be geographically separated from those Phase I base or fixed station transmitters utilizing 220... Separation of Sub-Band A; Base or Fixed Station Receivers and Sub-Band B; Base or Fixed Station Transmitters... separate their base station or fixed station transmitters from the base station or fixed......

  14. 47 CFR 90.723 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ...) will be geographically separated from those Phase I base or fixed station transmitters utilizing 220... Separation of Sub-Band A; Base or Fixed Station Receivers and Sub-Band B; Base or Fixed Station Transmitters... separate their base station or fixed station transmitters from the base station or fixed......

  15. 47 CFR 90.621 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... criteria. The separation between co-channel systems will be a minimum of 113 km (70 mi) with one exception... (see § 90.693), the separation between co-channel systems will be a minimum of 173 km (107 mi). The... section, no station in Channel Blocks A through V shall be less than 169 km (105 mi) distant from a...

  16. 47 CFR 90.621 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... criteria. The separation between co-channel systems will be a minimum of 113 km (70 mi) with one exception... (see § 90.693), the separation between co-channel systems will be a minimum of 173 km (107 mi). The... section, no station in Channel Blocks A through V shall be less than 169 km (105 mi) distant from a...

  17. 47 CFR 90.621 - Selection and assignment of frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... criteria. The separation between co-channel systems will be a minimum of 113 km (70 mi) with one exception... (see § 90.693), the separation between co-channel systems will be a minimum of 173 km (107 mi). The... section, no station in Channel Blocks A through V shall be less than 169 km (105 mi) distant from a...

  18. Improving reimbursement with nursing case manager status assignment.

    PubMed

    Bledsoe, Marlyn K; Marshall, Michele L

    2013-01-01

    Historically, physicians completed status assignment during the admission process. Incorrect status assignment of patients can result in reimbursement problems and denial of payment by Medicare, Medicaid, and private insurance companies. The purpose of this study was to evaluate the impact of case manager's role with status assignment during the admission process by looking at the denial of payment for services rendered. Denial rates were evaluated for two 15-month time periods: preintervention group (status assignment completed by physicians) and intervention group (status assignment recommended by case managers with physician signature). Denial data for all diagnosis-related groups possessing a more than 2% denial rate related to status assignment were further examined to identify the rationale for denial of payment. FINDINGS/OUTCOMES: The greatest denial rates for payment occurred during the Preintervention Period, when physicians assigned status for patients independently. There was a significant reduction in denial of payment for most diagnosis-related groups during the Intervention time period when case managers were recommending status assignment. Evaluation of denial data provides an opportunity to target creative performance improvement solutions to reduce denial of payment related to incorrect status assignment.

  19. Assigning functional meaning to digital circuits

    SciTech Connect

    Eckmann, S.T.; Chisholm, G.H.

    1997-07-01

    During computer-aided design, the problem of how to determine the logical function of a digital circuit arises in many contexts. For example, assigning functional meaning to a circuit is a fundamental operation in both reverse engineering and implementation validation. This report describes such a determination by discussing how a higher-level functional representation is constructed from a detailed circuit description (i.e., a gate-level netlist, which is a list of logic gates and their interconnections). The approach used involves transforming parts of the netlist into a functional representation and then manipulating this representation. Two types of functional representations are described: (1) a mathematical representation based on the logical operators ``exor`` and ``and`` and (2) a directed acyclic graph representation based on binary decision trees. Each representation provides a canonical form of the logical function being implemented (i.e., a form that is independent of implementation details). Such forms, however, have a well-known problem associated with the ordering of inputs: for each order, a unique form exists. A solution to this problem is given for both representations. Experimental results that demonstrate the use of these representations in the process of assigning functional meaning to a circuit are provided. The report also identifies and discusses issues critical to the performance required of this fundamental operation.

  20. Radio frequency spectrum management

    NASA Astrophysics Data System (ADS)

    Sujdak, E. J., Jr.

    1980-03-01

    This thesis is a study of radio frequency spectrum management as practiced by agencies and departments of the Federal Government. After a brief introduction to the international agency involved in radio frequency spectrum management, the author concentrates on Federal agencies engaged in frequency management. These agencies include the National Telecommunications and Information Administration (NTIA), the Interdepartment Radio Advisory Committee (IRAC), and the Department of Defense (DoD). Based on an analysis of Department of Defense frequency assignment procedures, recommendations are given concerning decentralizing military frequency assignment by delegating broader authority to unified commanders. This proposal includes a recommendation to colocate the individual Service frequency management offices at the Washington level. This would result in reduced travel costs, lower manpower requirements, and a common tri-Service frequency management data base.

  1. An assessment of health behavior peer effects in Peking University dormitories: a randomized cluster-assignment design for interference.

    PubMed

    Yuan, Changzheng; Lv, Jun; VanderWeele, Tyler J

    2013-01-01

    Relatively little is known about the peer influence in health behaviors within university dormitory rooms. Moreover, in China, the problem of unhealthy behaviors among university students has not yet been sufficiently recognized. We thus investigated health behavior peer influence in Peking University dormitories utilizing a randomized cluster-assignment design. Cross-sectional in-dormitory survey. Current students from Peking University Health Science Center from April to June, 2009. Self-reported questionnaire on health behaviors: physical activity (including bicycling), dietary intake and tobacco use. Use of bicycle, moderate-intensity exercise, frequency of sweet food and soybean milk intake, frequency of roasted/baked/toasted food intake were behaviors significantly or marginally significantly affected by peer influence. Health behavior peer effects exist within dormitory rooms among university students. This could provide guidance on room assignment, or inform intervention programs. Examining these may demand attention from university administrators and policy makers.

  2. An Assessment of Health Behavior Peer Effects in Peking University Dormitories: A Randomized Cluster-Assignment Design for Interference

    PubMed Central

    Yuan, Changzheng; Lv, Jun; VanderWeele, Tyler J.

    2013-01-01

    Background Relatively little is known about the peer influence in health behaviors within university dormitory rooms. Moreover, in China, the problem of unhealthy behaviors among university students has not yet been sufficiently recognized. We thus investigated health behavior peer influence in Peking University dormitories utilizing a randomized cluster-assignment design. Methods Study design: Cross-sectional in-dormitory survey. Study population: Current students from Peking University Health Science Center from April to June, 2009. Measurement: Self-reported questionnaire on health behaviors: physical activity (including bicycling), dietary intake and tobacco use. Results Use of bicycle, moderate-intensity exercise, frequency of sweet food and soybean milk intake, frequency of roasted/baked/toasted food intake were behaviors significantly or marginally significantly affected by peer influence. Conclusion Health behavior peer effects exist within dormitory rooms among university students. This could provide guidance on room assignment, or inform intervention programs. Examining these may demand attention from university administrators and policy makers. PMID:24040377

  3. Expert systems for personnel assignment

    SciTech Connect

    Hardee, J.L.; Liepins, G.

    1986-01-01

    In order to reduce stress on assignment personnel (detailers) and ensure maximum fairness and consistency in the Navy's personnel assignment process, The Navy Military Personnel Command (NMPC) has begun to explore the potential use of expert systems to supplement current manual and computerized distribution methods. The Detailer's Assistant expert system is being developed to improve the detailers' ability to satisfy the needs of their constituents and Navy management. An initial prototype of the Detailer's Assistant is now being evaluated. Numerous upgrades and extensions should lead to an operational system in the near future. Further development to a production system will involve additional research in machine learning, intelligent database methods, and cooperating expert systems.

  4. 7 CFR 97.131 - Conditional assignments.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 3 2010-01-01 2010-01-01 false Conditional assignments. 97.131 Section 97.131... PLANT VARIETY AND PROTECTION Assignments and Recording § 97.131 Conditional assignments. Assignments recorded in the Office are regarded as absolute assignments for Office purposes until canceled in writing...

  5. Neural Mechanisms of Credit Assignment in a Multicue Environment.

    PubMed

    Akaishi, Rei; Kolling, Nils; Brown, Joshua W; Rushworth, Matthew

    2016-01-27

    In complex environments, many potential cues can guide a decision or be assigned responsibility for the outcome of the decision. We know little, however, about how humans and animals select relevant information sources that should guide behavior. We show that subjects solve this relevance selection and credit assignment problem by selecting one cue and its association with a particular outcome as the main focus of a hypothesis. To do this, we examined learning while using a task design that allowed us to estimate the focus of each subject's hypotheses on a trial-by-trial basis. When a prediction is confirmed by the outcome, then credit for the outcome is assigned to that cue rather than an alternative. Activity in medial frontal cortex is associated with the assignment of credit to the cue that is the main focus of the hypothesis. However, when the outcome disconfirms a prediction, the focus shifts between cues, and the credit for the outcome is assigned to an alternative cue. This process of reselection for credit assignment to an alternative cue is associated with lateral orbitofrontal cortex. Learners should infer which features of environments are predictive of significant events, such as rewards. This "credit assignment" problem is particularly challenging when any of several cues might be predictive. We show that human subjects solve the credit assignment problem by implicitly "hypothesizing" which cue is relevant for predicting subsequent outcomes, and then credit is assigned according to this hypothesis. This process is associated with a distinctive pattern of activity in a part of medial frontal cortex. By contrast, when unexpected outcomes occur, hypotheses are redirected toward alternative cues, and this process is associated with activity in lateral orbitofrontal cortex. Copyright © 2016 Akaishi et al.

  6. Puzzles & Problems.

    ERIC Educational Resources Information Center

    Murphy, Pat, Ed.

    1993-01-01

    "Exploring" is a magazine of science, art, and human perception, produced by Exploratorium in collaboration with other participating museums. This issue focuses on puzzles and problem solving. Brain teasers, puzzles, and the strategies for solving them are included. Features include: (1) "Homework Assignment #3" (Paul Doherty);…

  7. Contact replacement for NMR resonance assignment.

    PubMed

    Xiong, Fei; Pandurangan, Gopal; Bailey-Kellogg, Chris

    2008-07-01

    Complementing its traditional role in structural studies of proteins, nuclear magnetic resonance (NMR) spectroscopy is playing an increasingly important role in functional studies. NMR dynamics experiments characterize motions involved in target recognition, ligand binding, etc., while NMR chemical shift perturbation experiments identify and localize protein-protein and protein-ligand interactions. The key bottleneck in these studies is to determine the backbone resonance assignment, which allows spectral peaks to be mapped to specific atoms. This article develops a novel approach to address that bottleneck, exploiting an available X-ray structure or homology model to assign the entire backbone from a set of relatively fast and cheap NMR experiments. We formulate contact replacement for resonance assignment as the problem of computing correspondences between a contact graph representing the structure and an NMR graph representing the data; the NMR graph is a significantly corrupted, ambiguous version of the contact graph. We first show that by combining connectivity and amino acid type information, and exploiting the random structure of the noise, one can provably determine unique correspondences in polynomial time with high probability, even in the presence of significant noise (a constant number of noisy edges per vertex). We then detail an efficient randomized algorithm and show that, over a variety of experimental and synthetic datasets, it is robust to typical levels of structural variation (1-2 AA), noise (250-600%) and missings (10-40%). Our algorithm achieves very good overall assignment accuracy, above 80% in alpha-helices, 70% in beta-sheets and 60% in loop regions. Our contact replacement algorithm is implemented in platform-independent Python code. The software can be freely obtained for academic use by request from the authors.

  8. Contact replacement for NMR resonance assignment

    PubMed Central

    Xiong, Fei; Pandurangan, Gopal; Bailey-Kellogg, Chris

    2008-01-01

    Motivation: Complementing its traditional role in structural studies of proteins, nuclear magnetic resonance (NMR) spectroscopy is playing an increasingly important role in functional studies. NMR dynamics experiments characterize motions involved in target recognition, ligand binding, etc., while NMR chemical shift perturbation experiments identify and localize protein–protein and protein–ligand interactions. The key bottleneck in these studies is to determine the backbone resonance assignment, which allows spectral peaks to be mapped to specific atoms. This article develops a novel approach to address that bottleneck, exploiting an available X-ray structure or homology model to assign the entire backbone from a set of relatively fast and cheap NMR experiments. Results: We formulate contact replacement for resonance assignment as the problem of computing correspondences between a contact graph representing the structure and an NMR graph representing the data; the NMR graph is a significantly corrupted, ambiguous version of the contact graph. We first show that by combining connectivity and amino acid type information, and exploiting the random structure of the noise, one can provably determine unique correspondences in polynomial time with high probability, even in the presence of significant noise (a constant number of noisy edges per vertex). We then detail an efficient randomized algorithm and show that, over a variety of experimental and synthetic datasets, it is robust to typical levels of structural variation (1–2 AA), noise (250–600%) and missings (10–40%). Our algorithm achieves very good overall assignment accuracy, above 80% in α-helices, 70% in β-sheets and 60% in loop regions. Availability: Our contact replacement algorithm is implemented in platform-independent Python code. The software can be freely obtained for academic use by request from the authors. Contact: gopal@cs.purdue.edu; cbk@cs.dartmouth.edu PMID:18586716

  9. Assessing Contributions to Group Assignments

    ERIC Educational Resources Information Center

    Johnston, Lucy; Miles, Lynden

    2004-01-01

    We report the use of a combination of self- and peer-assessment in an undergraduate social psychology laboratory course. Students worked in small groups on a self-directed empirical project that they each wrote up independently as a laboratory report. Marks for the written assignment were moderated by a contribution index measure based on the…

  10. Managing Large Volumes of Assignments

    ERIC Educational Resources Information Center

    Park, James; Hagen, John, Jr.

    2005-01-01

    In spring 2003, the Distance Education Network (DEN), Viterbi School of Engineering at the University of Southern California (USC), had 860 students and more than 1,000 enrollments in 70 courses toward 10 different degrees. Typically, for assignments in engineering courses, professors require students to show how their answers are derived so that…

  11. The Year of Secret Assignments

    ERIC Educational Resources Information Center

    Moriarty, Jaclyn

    2004-01-01

    The path to "novelist" was a convoluted one for Moriarty, who began writing fiction as doctoral student at Cambridge University. Her interest in young adults stems from an appreciation for the "troubles, strengths, and surprises of that age group." Now, in a uniquely formatted book titled "The Year of Secret Assignments," we peek inside the mind…

  12. A Stochastic Employment Problem

    ERIC Educational Resources Information Center

    Wu, Teng

    2013-01-01

    The Stochastic Employment Problem(SEP) is a variation of the Stochastic Assignment Problem which analyzes the scenario that one assigns balls into boxes. Balls arrive sequentially with each one having a binary vector X = (X[subscript 1], X[subscript 2],...,X[subscript n]) attached, with the interpretation being that if X[subscript i] = 1 the ball…

  13. A Stochastic Employment Problem

    ERIC Educational Resources Information Center

    Wu, Teng

    2013-01-01

    The Stochastic Employment Problem(SEP) is a variation of the Stochastic Assignment Problem which analyzes the scenario that one assigns balls into boxes. Balls arrive sequentially with each one having a binary vector X = (X[subscript 1], X[subscript 2],...,X[subscript n]) attached, with the interpretation being that if X[subscript i] = 1 the ball…

  14. A Robust Method for Computing Truth-to-Track Assignments

    DTIC Science & Technology

    2009-07-01

    A Robust Method for Computing Truth -to-Track Assignments Mark Silbert Air 4.5.3.3 NAVAIR Patuxent River, MD. mark.silbert@navy.mil...tracked by each track. Determining which track corresponds to which target is called the truth -to-track assignment problem. In the past, this...be used for all types of tracking systems. Keywords: Multi-target tracking performance, Multi- sensor tracking performance, truth -to-track

  15. Assignments of autoionization states of O2-asterisk

    NASA Technical Reports Server (NTRS)

    Wu, C. Y. Robert

    1987-01-01

    Attention is given to the uncertainties that remain concerning the autoionization states of O2 leading to the a 4Pi(u) and A 2Pi(u) states of O2(+), as well as some of the assignments of the autoionization states and the determinations of effective quantum numbers and quantum defects. The former problems of vibrational assignments are unambiguously established in view of a study of isotopic oxygen molecules. A systematic examination of the known Rydberg series is conducted, and new assignments and interpretations for several autoionization states leading to the various states of O2(+) are suggested.

  16. Efficient Credit Assignment through Evaluation Function Decomposition

    NASA Technical Reports Server (NTRS)

    Agogino, Adrian; Turner, Kagan; Mikkulainen, Risto

    2005-01-01

    Evolutionary methods are powerful tools in discovering solutions for difficult continuous tasks. When such a solution is encoded over multiple genes, a genetic algorithm faces the difficult credit assignment problem of evaluating how a single gene in a chromosome contributes to the full solution. Typically a single evaluation function is used for the entire chromosome, implicitly giving each gene in the chromosome the same evaluation. This method is inefficient because a gene will get credit for the contribution of all the other genes as well. Accurately measuring the fitness of individual genes in such a large search space requires many trials. This paper instead proposes turning this single complex search problem into a multi-agent search problem, where each agent has the simpler task of discovering a suitable gene. Gene-specific evaluation functions can then be created that have better theoretical properties than a single evaluation function over all genes. This method is tested in the difficult double-pole balancing problem, showing that agents using gene-specific evaluation functions can create a successful control policy in 20 percent fewer trials than the best existing genetic algorithms. The method is extended to more distributed problems, achieving 95 percent performance gains over tradition methods in the multi-rover domain.

  17. Assertiveness for Librarians Harried by Inappropriate Lecture Hall and Classroom Assignments.

    ERIC Educational Resources Information Center

    Parker, J. Carlyle

    1990-01-01

    Describes problems encountered by public librarians when assisting students with assignments that are difficult or impossible to complete. Examples of librarians' successes in assertive, tactful communication with instructors and a list of solutions to inappropriate assignments are provided. Special emphasis is given to assignments dealing with…

  18. A model for routing problem in quay management problem

    NASA Astrophysics Data System (ADS)

    Zirour, Mourad; Oughalime, Ahmed; Liong, Choong-Yeun; Ismail, Wan Rosmanira; Omar, Khairuddin

    2014-06-01

    Quadratic Assignment Problem (QAP), like Vehicle Routing Problem, is one of those optimization problems that interests many researchers in the last decades. The Quay Management Problem is a specific problem which could be presented as a QAP which involves a double assignment of customers and products toward loading positions using lifting trucks. This study focuses on the routing problem while delivering the customers' demands. In this problem, lifting trucks will route around the storage sections to collect the products then deliver to the customers who are assigned to specific loading positions. The objective of minimizing the residence time for each customer is sought. This paper presents the problem and the proposed model.

  19. Integrated Project Scheduling and Staff Assignment with Controllable Processing Times

    PubMed Central

    Framinan, Jose M.

    2014-01-01

    This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, together with some extensions to cope with different situations. Additionally, the advantages of the controllable processing times approach are compared with the fixed processing times. Due to the complexity of the integrated model, a simple GRASP algorithm is implemented in order to obtain good, approximate solutions in short computation times. PMID:24895672

  20. Computing Role Assignments of Proper Interval Graphs in Polynomial Time

    NASA Astrophysics Data System (ADS)

    Heggernes, Pinar; van't Hof, Pim; Paulusma, Daniël

    A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-role assignment of G. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The Role Assignment problem has as input a pair of graphs (G,R) and asks whether G has an R-role assignment. This problem is NP-complete already on input pairs (G,R) where R is a path on three vertices. So far, the only known non-trivial tractable case consists of input pairs (G,R) where G is a tree. We present a polynomial time algorithm that solves Role Assignment on all input pairs (G,R) where G is a proper interval graph. Thus we identify the first graph class other than trees on which the problem is tractable. As a complementary result, we show that the problem is Graph Isomorphism-hard on chordal graphs, a superclass of proper interval graphs and trees.

  1. Neural Mechanisms of Credit Assignment in a Multicue Environment

    PubMed Central

    Kolling, Nils; Brown, Joshua W.; Rushworth, Matthew

    2016-01-01

    In complex environments, many potential cues can guide a decision or be assigned responsibility for the outcome of the decision. We know little, however, about how humans and animals select relevant information sources that should guide behavior. We show that subjects solve this relevance selection and credit assignment problem by selecting one cue and its association with a particular outcome as the main focus of a hypothesis. To do this, we examined learning while using a task design that allowed us to estimate the focus of each subject's hypotheses on a trial-by-trial basis. When a prediction is confirmed by the outcome, then credit for the outcome is assigned to that cue rather than an alternative. Activity in medial frontal cortex is associated with the assignment of credit to the cue that is the main focus of the hypothesis. However, when the outcome disconfirms a prediction, the focus shifts between cues, and the credit for the outcome is assigned to an alternative cue. This process of reselection for credit assignment to an alternative cue is associated with lateral orbitofrontal cortex. SIGNIFICANCE STATEMENT Learners should infer which features of environments are predictive of significant events, such as rewards. This “credit assignment” problem is particularly challenging when any of several cues might be predictive. We show that human subjects solve the credit assignment problem by implicitly “hypothesizing” which cue is relevant for predicting subsequent outcomes, and then credit is assigned according to this hypothesis. This process is associated with a distinctive pattern of activity in a part of medial frontal cortex. By contrast, when unexpected outcomes occur, hypotheses are redirected toward alternative cues, and this process is associated with activity in lateral orbitofrontal cortex. PMID:26818500

  2. Depression remission, receipt of problem-solving therapy, and self-care behavior frequency among low-income, predominantly Hispanic diabetes patients.

    PubMed

    Oh, Hyunsung; Ell, Kathleen

    2016-01-01

    This study explored whether depression remission and problem-solving therapy (PST) receipt are associated with more frequent self-care behaviors via cross-sectional and prospective analyses. We analyzed data from a randomized clinical trial (N=387) that tested collaborative depression care among predominantly Hispanic patients with diabetes in safety-net clinics. Data at 12-month follow-up, measured with the Patient Health Questionnaire-9 and Hopkins Symptom Checklist-20, were used to define depression remission. PST was provided by a bilingual social worker. Multivariate regression analysis was used to examine associations between predictors and frequency change of each self-care behavior (healthy diet, exercise, self-blood glucose monitoring, and foot care between baseline and 12-month (N=281), 18-month (N=249), and 24-month (N=235) follow-up surveys. Inconsistent relationships were observed depending on the instrument to identify depression remission, type of self-care behaviors, and time when self-care behavior was measured. Significant associations were more likely to be observed in cross-sectional analyses. PST receipt was not associated with self-care behaviors. Depression remission or the receipt of PST may not be a reliable antecedent for more frequent self-care behaviors among this group. A few recommendations for studies were offered to enhance existing depression care for diabetes patients. Copyright © 2016 Elsevier Inc. All rights reserved.

  3. 37 CFR 3.56 - Conditional assignments.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 37 Patents, Trademarks, and Copyrights 1 2010-07-01 2010-07-01 false Conditional assignments. 3.56... COMMERCE GENERAL ASSIGNMENT, RECORDING AND RIGHTS OF ASSIGNEE Date and Effect of Recording § 3.56 Conditional assignments. Assignments which are made conditional on the performance of certain acts or events...

  4. 48 CFR 252.227-7011 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignments. 252.227-7011... Clauses 252.227-7011 Assignments. As prescribed at 227.7010, insert the following clause in assignments. Assignment (AUG 1984) The Contractor hereby conveys to the Government, as represented by the Secretary of...

  5. 48 CFR 227.7010 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignments. 227.7010..., Licenses, and Assignments 227.7010 Assignments. (a) The clause at 252.227-7011 is an example which may be used in contracts of assignment of patent rights to the Government. (b) To facilitate proof of...

  6. 25 CFR 535.2 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 25 Indians 2 2010-04-01 2010-04-01 false Assignments. 535.2 Section 535.2 Indians NATIONAL INDIAN... § 535.2 Assignments. Subject to the approval of the Chairman, a management contractor may assign its... contractor shall submit such assignment to the Chairman upon execution. The Chairman shall approve or...

  7. Semantic Gender Assignment Regularities in German

    ERIC Educational Resources Information Center

    Schwichtenberg, Beate; Schiller, Niels O.

    2004-01-01

    Gender assignment relates to a native speaker's knowledge of the structure of the gender system of his/her language, allowing the speaker to select the appropriate gender for each noun. Whereas categorical assignment rules and exceptional gender assignment are well investigated, assignment regularities, i.e., tendencies in the gender distribution…

  8. UHF TELEVISION CHANNEL ASSIGNMENT PLAN, REPORT OF THE NAEB STUDY TO DEVELOP A UHF ASSIGNMENT PLAN USING DIGITAL COMPUTER METHODS.

    ERIC Educational Resources Information Center

    BRONSON, VERNON; AND OTHERS

    THE PURPOSE OF THIS STUDY WAS TO DEMONSTRATE THE EFFICIENCY AND EFFECTIVENESS OF USING DIGITAL COMPUTER METHODS TO ESTABLISH AN ULTRAHIGH FREQUENCY UHF ASSIGNMENT PLAN. THE STUDY FOLLOWS UP A PREVIOUS NATIONAL ASSOCIATION OF EDUCATIONAL BROADCASTERS (NAEB) SURVEY WHICH INDICATED THE NEED FOR FUTURE EDUCATIONAL TELEVISION CHANNELS BEYOND THOSE…

  9. A Successive Shortest Path Algorithm for the Assignment Problem.

    DTIC Science & Technology

    1980-08-01

    x .. / - Node,i Predecessor,Pt Distance,D iI I lD, 3 none 0 2 3 6 2 3 1 1 4 3 3 (,2 4 5 1 3 6 2 10 7 1 1 6 Fig. 1. A shortest path tree. 4 In a...set Rk = O- Lk and Kk= Lk - O!. For any remaining origins i or destinations j, set Rk = Kk = 0 . B 11 4 . k Rk k for (i,j)E E. 4 .Set c. l =cj iK Ij 1i...preliminary results. (1.) Suppose that (Ck,Ak) is in standard form and that step 4 of the algorithm has been completed. Then ck+ 1 = 0 whenever i and

  10. A Multimodal Assignment that Enriches Literacy Learning: The Problem

    ERIC Educational Resources Information Center

    Oldakowski, Tim

    2014-01-01

    In education the linguistic is the mode most commonly assessed because it is important for students to write clear, complex pieces to show their understanding of content. However, in worlds outside of classrooms additional modes, such as visual, aural, and digital are often used to convey messages. This article demonstrates the value of multimodal…

  11. Dynamic Logic Assigned to Automata

    NASA Astrophysics Data System (ADS)

    Chajda, Ivan; Paseka, Jan

    2017-02-01

    A dynamic logic B can be assigned to every automaton [InlineMediaObject not available: see fulltext.] without regard if [InlineMediaObject not available: see fulltext.] is deterministic or nondeterministic. This logic enables us to formulate observations on [InlineMediaObject not available: see fulltext.] in the form of composed propositions and, due to a transition functor T, it captures the dynamic behaviour of [InlineMediaObject not available: see fulltext.]. There are formulated conditions under which the automaton [InlineMediaObject not available: see fulltext.] can be recovered by means of B and T.

  12. Multi-topic assignment for exploratory navigation of consumer health information in NetWellness using formal concept analysis.

    PubMed

    Cui, Licong; Xu, Rong; Luo, Zhihui; Wentz, Susan; Scarberry, Kyle; Zhang, Guo-Qiang

    2014-08-03

    Finding quality consumer health information online can effectively bring important public health benefits to the general population. It can empower people with timely and current knowledge for managing their health and promoting wellbeing. Despite a popular belief that search engines such as Google can solve all information access problems, recent studies show that using search engines and simple search terms is not sufficient. Our objective is to provide an approach to organizing consumer health information for navigational exploration, complementing keyword-based direct search. Multi-topic assignment to health information, such as online questions, is a fundamental step for navigational exploration. We introduce a new multi-topic assignment method combining semantic annotation using UMLS concepts (CUIs) and Formal Concept Analysis (FCA). Each question was tagged with CUIs identified by MetaMap. The CUIs were filtered with term-frequency and a new term-strength index to construct a CUI-question context. The CUI-question context and a topic-subject context were used for multi-topic assignment, resulting in a topic-question context. The topic-question context was then directly used for constructing a prototype navigational exploration interface. Experimental evaluation was performed on the task of automatic multi-topic assignment of 99 predefined topics for about 60,000 consumer health questions from NetWellness. Using example-based metrics, suitable for multi-topic assignment problems, our method achieved a precision of 0.849, recall of 0.774, and F₁ measure of 0.782, using a reference standard of 278 questions with manually assigned topics. Compared to NetWellness' original topic assignment, a 36.5% increase in recall is achieved with virtually no sacrifice in precision. Enhancing the recall of multi-topic assignment without sacrificing precision is a prerequisite for achieving the benefits of navigational exploration. Our new multi-topic assignment method

  13. Multi-topic assignment for exploratory navigation of consumer health information in NetWellness using formal concept analysis

    PubMed Central

    2014-01-01

    Background Finding quality consumer health information online can effectively bring important public health benefits to the general population. It can empower people with timely and current knowledge for managing their health and promoting wellbeing. Despite a popular belief that search engines such as Google can solve all information access problems, recent studies show that using search engines and simple search terms is not sufficient. Our objective is to provide an approach to organizing consumer health information for navigational exploration, complementing keyword-based direct search. Multi-topic assignment to health information, such as online questions, is a fundamental step for navigational exploration. Methods We introduce a new multi-topic assignment method combining semantic annotation using UMLS concepts (CUIs) and Formal Concept Analysis (FCA). Each question was tagged with CUIs identified by MetaMap. The CUIs were filtered with term-frequency and a new term-strength index to construct a CUI-question context. The CUI-question context and a topic-subject context were used for multi-topic assignment, resulting in a topic-question context. The topic-question context was then directly used for constructing a prototype navigational exploration interface. Results Experimental evaluation was performed on the task of automatic multi-topic assignment of 99 predefined topics for about 60,000 consumer health questions from NetWellness. Using example-based metrics, suitable for multi-topic assignment problems, our method achieved a precision of 0.849, recall of 0.774, and F1 measure of 0.782, using a reference standard of 278 questions with manually assigned topics. Compared to NetWellness’ original topic assignment, a 36.5% increase in recall is achieved with virtually no sacrifice in precision. Conclusion Enhancing the recall of multi-topic assignment without sacrificing precision is a prerequisite for achieving the benefits of navigational exploration. Our

  14. Dipolar Assisted Assignment Protocol (DAAP) for MAS solid-state NMR of rotationally aligned membrane proteins in phospholipid bilayers

    NASA Astrophysics Data System (ADS)

    Das, Bibhuti B.; Zhang, Hua; Opella, Stanley J.

    2014-05-01

    A method for making resonance assignments in magic angle spinning solid-state NMR spectra of membrane proteins that utilizes the range of heteronuclear dipolar coupling frequencies in combination with conventional chemical shift based assignment methods is demonstrated. The Dipolar Assisted Assignment Protocol (DAAP) takes advantage of the rotational alignment of the membrane proteins in liquid crystalline phospholipid bilayers. Improved resolution is obtained by combining the magnetically inequivalent heteronuclear dipolar frequencies with isotropic chemical shift frequencies. Spectra with both dipolar and chemical shift frequency axes assist with resonance assignments. DAAP can be readily extended to three- and four-dimensional experiments and to include both backbone and side chain sites in proteins.

  15. Static assignment of complex stochastic tasks using stochastic majorization

    NASA Technical Reports Server (NTRS)

    Nicol, David; Simha, Rahul; Towsley, Don

    1992-01-01

    We consider the problem of statically assigning many tasks to a (smaller) system of homogeneous processors, where a task's structure is modeled as a branching process, and all tasks are assumed to have identical behavior. We show how the theory of majorization can be used to obtain a partial order among possible task assignments. Our results show that if the vector of numbers of tasks assigned to each processor under one mapping is majorized by that of another mapping, then the former mapping is better than the latter with respect to a large number of objective functions. In particular, we show how measurements of finishing time, resource utilization, and reliability are all captured by the theory. We also show how the theory may be applied to the problem of partitioning a pool of processors for distribution among parallelizable tasks.

  16. Task Assignment Heuristics for Parallel and Distributed CFD Applications

    NASA Technical Reports Server (NTRS)

    Lopez-Benitez, Noe; Djomehri, M. Jahed; Biswas, Rupak

    2003-01-01

    This paper proposes a task graph (TG) model to represent a single discrete step of multi-block overset grid computational fluid dynamics (CFD) applications. The TG model is then used to not only balance the computational workload across the overset grids but also to reduce inter-grid communication costs. We have developed a set of task assignment heuristics based on the constraints inherent in this class of CFD problems. Two basic assignments, the smallest task first (STF) and the largest task first (LTF), are first presented. They are then systematically costs. To predict the performance of the proposed task assignment heuristics, extensive performance evaluations are conducted on a synthetic TG with tasks defined in terms of the number of grid points in predetermined overlapping grids. A TG derived from a realistic problem with eight million grid points is also used as a test case.

  17. 47 CFR 87.173 - Frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Frequencies. 87.173 Section 87.173... Frequencies § 87.173 Frequencies. (a) The table in paragraph (b) of this section lists assignable carrier frequencies or frequency bands. (1) The single letter symbol appearing in the “Subpart” column indicates the...

  18. 47 CFR 74.661 - Frequency tolerance.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency tolerance. 74.661 Section 74.661... Stations § 74.661 Frequency tolerance. Stations in this service shall maintain the carrier frequency of each authorized transmitter to within the following percentage of the assigned frequency. Frequency...

  19. 47 CFR 87.173 - Frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Frequencies. 87.173 Section 87.173... Frequencies § 87.173 Frequencies. (a) The table in paragraph (b) of this section lists assignable carrier frequencies or frequency bands. (1) The single letter symbol appearing in the “Subpart” column indicates the...

  20. 47 CFR 87.173 - Frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Frequencies. 87.173 Section 87.173... Frequencies § 87.173 Frequencies. (a) The table in paragraph (b) of this section lists assignable carrier frequencies or frequency bands. (1) The single letter symbol appearing in the “Subpart” column indicates the...

  1. 47 CFR 87.173 - Frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 5 2014-10-01 2014-10-01 false Frequencies. 87.173 Section 87.173... Frequencies § 87.173 Frequencies. (a) The table in paragraph (b) of this section lists assignable carrier frequencies or frequency bands. (1) The single letter symbol appearing in the “Subpart” column indicates the...

  2. 47 CFR 74.661 - Frequency tolerance.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency tolerance. 74.661 Section 74.661... Stations § 74.661 Frequency tolerance. Stations in this service shall maintain the carrier frequency of each authorized transmitter to within the following percentage of the assigned frequency. Frequency...

  3. 47 CFR 74.661 - Frequency tolerance.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 4 2012-10-01 2012-10-01 false Frequency tolerance. 74.661 Section 74.661... Stations § 74.661 Frequency tolerance. Stations in this service shall maintain the carrier frequency of each authorized transmitter to within the following percentage of the assigned frequency. Frequency...

  4. 47 CFR 74.661 - Frequency tolerance.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 4 2010-10-01 2010-10-01 false Frequency tolerance. 74.661 Section 74.661... Stations § 74.661 Frequency tolerance. Stations in this service shall maintain the carrier frequency of each authorized transmitter to within the following percentage of the assigned frequency. Frequency...

  5. 47 CFR 74.661 - Frequency tolerance.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency tolerance. 74.661 Section 74.661... Stations § 74.661 Frequency tolerance. Stations in this service shall maintain the carrier frequency of each authorized transmitter to within the following percentage of the assigned frequency. Frequency...

  6. A microgenetic study of insightful problem solving.

    PubMed

    Luwel, Koen; Siegler, Robert S; Verschaffel, Lieven

    2008-03-01

    An eight-session microgenetic study of acquisition of an insightful problem-solving strategy was conducted. A total of 35 second graders who did not use this insightful strategy initially were assigned to two groups that differed in the frequency of problems likely to facilitate discovery and generalization of the strategy. Children in the facilitative problems group discovered the insightful strategy earlier, used it more often subsequently, and transferred it more often to novel problems than did those in the nonfacilitative problems group. Children generally discovered the insightful strategy on the most facilitative items and extended it progressively to items on which its advantages were smaller but still substantial. The results indicate that experience outside the experimental situation, as well as experience inside the experimental situation, influences use of new strategies.

  7. Listener Reliability in Assigning Utterance Boundaries in Children's Spontaneous Speech

    ERIC Educational Resources Information Center

    Stockman, Ida J.

    2010-01-01

    Research and clinical practices often rely on an utterance unit for spoken language analysis. This paper calls attention to the problems encountered when identifying utterance boundaries in young children's spontaneous conversational speech. The results of a reliability study of utterance boundary assignment are described for 20 females with…

  8. Increasing Math Assignment Completion Using Solution-Focused Brief Counseling

    ERIC Educational Resources Information Center

    Fearrington, Jamie Y.; McCallum, R. Steve; Skinner, Christopher H.

    2011-01-01

    Solution-focused brief counseling (SFBC) is an efficient and direct approach to therapy that emphasizes problem identification and solutions. A multiple-baseline-across-participants design was used to evaluate the effects of a SFBC intervention on mathematics assignment completion and accuracy across six fifth-grade students who were failing math.…

  9. Student's Lab Assignments in PDE Course with MAPLE.

    ERIC Educational Resources Information Center

    Ponidi, B. Alhadi

    Computer-aided software has been used intensively in many mathematics courses, especially in computational subjects, to solve initial value and boundary value problems in Partial Differential Equations (PDE). Many software packages were used in student lab assignments such as FORTRAN, PASCAL, MATLAB, MATHEMATICA, and MAPLE in order to accelerate…

  10. RF environment survey of Space Shuttle related EEE frequency bands

    NASA Technical Reports Server (NTRS)

    Simpson, J.; Prigel, B.; Postelle, J.

    1977-01-01

    Radio frequency assignments within the continental United States in frequency bands between 121 MHz abd 65 GHz were surveyed and analyzed in order to determine current utilization of anticipated frequency bands for the shuttle borne electromagnetic environment experiment. Data from both government and nongovernment files were used. Results are presented in both narrative form and in histograms which show the total number of unclassified assignments versus frequency and total assigned power versus frequency.

  11. Is Poor Frequency Modulation Detection Linked to Literacy Problems? A Comparison of Specific Reading Disability and Mild to Moderate Sensorineural Hearing Loss

    ERIC Educational Resources Information Center

    Halliday, L. F.; Bishop, D. V. M.

    2006-01-01

    Specific reading disability (SRD) is now widely recognised as often being caused by phonological processing problems, affecting analysis of spoken as well as written language. According to one theoretical account, these phonological problems are due to low-level problems in auditory perception of dynamic acoustic cues. Evidence for this has come…

  12. 28 CFR 548.17 - Work assignments.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 28 Judicial Administration 2 2012-07-01 2012-07-01 false Work assignments. 548.17 Section 548.17... PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the religious tenets of an inmate's faith are violated or jeopardized by a particular work assignment, a...

  13. 28 CFR 548.17 - Work assignments.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 28 Judicial Administration 2 2014-07-01 2014-07-01 false Work assignments. 548.17 Section 548.17... PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the religious tenets of an inmate's faith are violated or jeopardized by a particular work assignment, a...

  14. 28 CFR 548.17 - Work assignments.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 28 Judicial Administration 2 2013-07-01 2013-07-01 false Work assignments. 548.17 Section 548.17... PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the religious tenets of an inmate's faith are violated or jeopardized by a particular work assignment, a...

  15. 28 CFR 548.17 - Work assignments.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 28 Judicial Administration 2 2011-07-01 2011-07-01 false Work assignments. 548.17 Section 548.17... PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the religious tenets of an inmate's faith are violated or jeopardized by a particular work assignment, a...

  16. The Mechanism Design Approach to Student Assignment

    ERIC Educational Resources Information Center

    Pathak, Parag A.

    2011-01-01

    The mechanism design approach to student assignment involves the theoretical, empirical, and experimental study of systems used to allocate students into schools around the world. Recent practical experience designing systems for student assignment has raised new theoretical questions for the theory of matching and assignment. This article reviews…

  17. 24 CFR 221.770 - Assignment option.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment option. 221.770 Section... § 221.770 Assignment option. A mortgagee holding a conditional or firm commitment issued on or before... securing it, directly to the Government National Mortgage Association (GNMA). Upon such assignment...

  18. 33 CFR 20.201 - Assignment.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Assignment. 20.201 Section 20.201 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY GENERAL RULES OF PRACTICE... § 20.201 Assignment. An ALJ, assigned by the Chief ALJ after receipt of the complaint, shall preside...

  19. 48 CFR 208.7002 - Assignment authority.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignment authority. 208... 208.7002 Assignment authority. (a) Under the DoD Coordinated Acquisition Program, contracting... Administration (GSA). Commodity assignments are made— (1) To the departments and agencies, by the Deputy Under...

  20. 5 CFR 870.901 - Assignments permitted.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Assignments permitted. 870.901 Section... (CONTINUED) FEDERAL EMPLOYEES' GROUP LIFE INSURANCE PROGRAM Assignments of Life Insurance § 870.901 Assignments permitted. (a) (1) Section 208 of the Bankruptcy Amendments and Federal Judgeship Act of 1984, Pub...

  1. 42 CFR 414.918 - Assignment.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 42 Public Health 3 2010-10-01 2010-10-01 false Assignment. 414.918 Section 414.918 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICARE... B § 414.918 Assignment. Payment for a CAP drug may be made only on an assignment-related basis. ...

  2. 25 CFR 215.20 - Assignment.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Assignment. 215.20 Section 215.20 Indians BUREAU OF..., QUAPAW AGENCY § 215.20 Assignment. Leases granted or approved under the regulations in this part may be... Secretary of the Interior and subject to his approval as to the terms and conditions of such assignments...

  3. 36 CFR 228.52 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Assignments. 228.52 Section... of Mineral Materials General Provisions § 228.52 Assignments. (a) Limitations. A purchaser or... proposed assignment involving contract or permit performance unless the assignee: (1) Submits information...

  4. 7 CFR 701.42 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 7 2010-01-01 2010-01-01 false Assignments. 701.42 Section 701.42 Agriculture Regulations of the Department of Agriculture (Continued) FARM SERVICE AGENCY, DEPARTMENT OF AGRICULTURE... ADMINISTERED UNDER THIS PART § 701.42 Assignments. Participants may assign ECP cost-share assistance payments...

  5. 31 CFR 337.5 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Assignments. 337.5 Section 337.5... ADMINISTRATION DEBENTURES Certificated Debentures § 337.5 Assignments. (a) If the registered payee, or an assignee holding a certificated debenture under proper assignment from the registered payee, desires that...

  6. 25 CFR 214.18 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Assignments. 214.18 Section 214.18 Indians BUREAU OF..., OKLAHOMA, FOR MINING, EXCEPT OIL AND GAS § 214.18 Assignments. Approved leases or any interest therein may... otherwise. Transfers or assignments, when so approved, shall be subject to the terms and conditions of the...

  7. 7 CFR 1488.17 - Assignment.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Assignment. 1488.17 Section 1488.17 Agriculture Regulations of the Department of Agriculture (Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF...) Miscellaneous Provisions § 1488.17 Assignment. The exporter shall not assign any claim or rights or any amounts...

  8. 32 CFR 1656.6 - Overseas assignments.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 32 National Defense 6 2010-07-01 2010-07-01 false Overseas assignments. 1656.6 Section 1656.6 National Defense Other Regulations Relating to National Defense SELECTIVE SERVICE SYSTEM ALTERNATIVE SERVICE § 1656.6 Overseas assignments. Alternative Service job assignments outside the United States, its...

  9. 7 CFR 1430.218 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Assignments. 1430.218 Section 1430.218 Agriculture Regulations of the Department of Agriculture (Continued) COMMODITY CREDIT CORPORATION, DEPARTMENT OF... Assignments. Any producer may assign a payment to be made under this part in accordance with part 1404 of this...

  10. 7 CFR 1401.6 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Assignments. 1401.6 Section 1401.6 Agriculture... PAYMENT § 1401.6 Assignments. Notwithstanding any other provision of this chapter, a payment made under this part may not be the subject of an assignment, except as determined and announced by CCC. ...

  11. 7 CFR 247.21 - Caseload assignment.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 4 2010-01-01 2010-01-01 false Caseload assignment. 247.21 Section 247.21 Agriculture... CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.21 Caseload assignment. (a) How does... assignment of additional caseload are determined in the following manner: (i) A State agency entering its...

  12. 28 CFR 548.17 - Work assignments.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Work assignments. 548.17 Section 548.17... PROGRAMS Religious Beliefs and Practices of Committed Offenders § 548.17 Work assignments. When the religious tenets of an inmate's faith are violated or jeopardized by a particular work assignment, a...

  13. 24 CFR 221.255 - Assignment option.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment option. 221.255 Section... Assignment option. (a) A mortgagee holding a mortgage insured pursuant to a conditional or firm commitment..., directly to the Government National Mortgage Association (GNMA). Upon such assignment, transfer and...

  14. 44 CFR 295.14 - Assignments.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Assignments. 295.14 Section 295.14 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF HOMELAND....14 Assignments. Assignment of claims and the right to receive compensation for claims under the CGFAA...

  15. 12 CFR 563e.28 - Assigned ratings.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Assigned ratings. 563e.28 Section 563e.28 Banks... for Assessing Performance § 563e.28 Assigned ratings. (a) Ratings in general. Subject to paragraphs (b) and(c) of this section, the OTS assigns to a savings association a rating of “outstanding...

  16. 12 CFR 228.28 - Assigned ratings.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 12 Banks and Banking 3 2010-01-01 2010-01-01 false Assigned ratings. 228.28 Section 228.28 Banks... COMMUNITY REINVESTMENT (REGULATION BB) Standards for Assessing Performance § 228.28 Assigned ratings. (a) Ratings in general. Subject to paragraphs (b) and (c) of this section, the Board assigns to a bank a...

  17. 43 CFR 2521.3 - Assignment.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused...

  18. 43 CFR 2521.3 - Assignment.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused...

  19. 43 CFR 2521.3 - Assignment.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused...

  20. 43 CFR 2521.3 - Assignment.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... OF THE INTERIOR LAND RESOURCE MANAGEMENT (2000) DESERT-LAND ENTRIES Procedures § 2521.3 Assignment...), assignments of desert-land entries were recognized, the Department of the Interior, largely for administrative reasons, held that a desert-land entry might be assigned as a whole or in its entirety, but refused...

  1. 7 CFR 1437.104 - Assigned production.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 10 2011-01-01 2011-01-01 false Assigned production. 1437.104 Section 1437.104... Determining Yield Coverage Using Actual Production History § 1437.104 Assigned production. (a) When determining losses under this section, assigned production will be used to offset the loss of production...

  2. Assigning Homework to Couples and Families

    ERIC Educational Resources Information Center

    Dattilio, Frank M.; Dickson, Jan

    2007-01-01

    Homework assignments, or "out-of-session assignments," have gained popularity among couple and family therapists due to their potential to solidify the work achieved during the course of therapy and to help clients take responsibility for their own change. Homework assignments also serve as a testing ground in therapy to determine what works and…

  3. 5 CFR 351.705 - Administrative assignment.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Administrative assignment. 351.705 Section 351.705 Administrative Personnel OFFICE OF PERSONNEL MANAGEMENT CIVIL SERVICE REGULATIONS REDUCTION IN FORCE Assignment Rights (Bump and Retreat) § 351.705 Administrative assignment. (a) An...

  4. The Mechanism Design Approach to Student Assignment

    ERIC Educational Resources Information Center

    Pathak, Parag A.

    2011-01-01

    The mechanism design approach to student assignment involves the theoretical, empirical, and experimental study of systems used to allocate students into schools around the world. Recent practical experience designing systems for student assignment has raised new theoretical questions for the theory of matching and assignment. This article reviews…

  5. Context-Aware Reviewer Assignment for Trust Enhanced Peer Review.

    PubMed

    Li, Lei; Wang, Yan; Liu, Guanfeng; Wang, Meng; Wu, Xindong

    2015-01-01

    Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications) with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT), which aims to effectively estimate the "true" ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are.

  6. Context-Aware Reviewer Assignment for Trust Enhanced Peer Review

    PubMed Central

    Li, Lei; Wang, Yan; Liu, Guanfeng; Wang, Meng; Wu, Xindong

    2015-01-01

    Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications) with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT), which aims to effectively estimate the “true” ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are. PMID:26090849

  7. Comparing Examples: WebAssign versus Textbook

    NASA Astrophysics Data System (ADS)

    Richards, Evan; Polak, Jeff; Hardin, Ashley; Risley, John, , Dr.

    2005-11-01

    Research shows students can learn from worked examples.^1 This pilot study compared two groups of students' performance (10 each) in solving physics problems. One group had access to interactive examples^2 released in WebAssign^3, while the other group had access to the counterpart textbook examples. Verbal data from students in problem solving sessions was collected using a think aloud protocol^4 and the data was analyzed using Chi's procedures.^5 An explanation of the methodology and results will be presented. Future phases of this pilot study based upon these results will also be discussed. ^1Atkinson, R.K., Derry, S.J., Renkl A., Wortham, D. (2000). ``Learning from Examples: Instructional Principles from the Worked Examples Research'', Review of Educational Research, vol. 70, n. 2, pp. 181-214. ^2Serway, R.A. & Faughn, J.S. (2006). College Physics (7^th ed.). Belmont, CA: Thomson Brooks/Cole. ^3 see www.webassign.net ^4 Ericsson, K.A. & Simon, H.A. (1984). Protocol Analysis: Verbal Reports as Data. Cambridge, Massachusetts: The MIT Press. ^5 Chi, Michelene T.H. (1997). ``Quantifying Qualitative Analyses of Verbal Data: A Practical Guide,'' The Journal of the Learning Sciences, vol. 6, n. 3, pp. 271-315.

  8. Variable Temperature, Intensity Calibrated, Complete Submillimeter Spectra and Analysis for Astrophysical Assignment

    NASA Astrophysics Data System (ADS)

    Fortman, Sarah M.

    Traditional spectroscopic approaches which relied on quantum mechanical assignment have left astrophysical catalogs incomplete with regards to the perturbed excited vibrational/torsional states of several astrophysically common molecular species. The result is that many of the unidentified features in astrophysical spectra are due to already identified species in an excited state. The confusion of lines due to target species and lines due to molecular 'weeds', hinders the astronomers' ability to identify new molecules in astrophysical spectra. With the advent of powerful new telescopes this problem has been further exacerbated. This thesis describes a new approach for analyzing intensity calibrated laboratory spectra taken at many different temperatures. By analyzing these spectra together, it is possible to derive the lower state energy and transition strength for every spectral line without quantum mechanical assignment. These derived parameters can then be used to predict a complete spectrum, including the difficult to assign excited states, at astrophysically relevant temperatures. Unlike the astrophysical catalogs this approach is not limited to spectral lines. By using fitting parameters, every frequency point of laboratory data can be modeled and the entire spectral range can be predicted at an arbitrary temperature. This approach was developed, tested and refined while studying eight astrophysical 'weeds' in two frequency regions. In ethyl cyanide, vinyl cyanide and methanol, the three molecules for which rigorous analysis was completed, the lower state energies and transition strengths were determined for over 8200 currently uncataloged lines. An additional five molecules in the 210-270 GHz region have had preliminary analyses completed. Astrophysical data was obtained and compared to the complete spectra predicted from this analysis. The results yielded excellent matches for methyl cyanide, ethyl cyanide and vinyl cyanide including isotopologues and

  9. Caseload Assignments. Position Statement. Revised

    ERIC Educational Resources Information Center

    DuRant, Bonnie V.; Gibbons, Linda J.; Poole, Cynthia; Suessmann, Mary; Wyckoff, Leah

    2010-01-01

    It is the position of the National Association of School Nurses (NASN) that schools should employ professionally prepared Registered Nurses, to conduct and supervise school health programs which address the variety of health problems experienced by school children. NASN recommends a formula-based approach with minimum ratios of nurses-to-students…

  10. The Economic Naturalist Writing Assignment

    ERIC Educational Resources Information Center

    Frank, Robert H.

    2006-01-01

    Several months after having completed an introductory economics course, most students are no better able to answer simple economic questions than students who never took the course. The problem seems to be that principles courses try to teach students far too much, with the result that everything goes by in a blur. The good news is that a…

  11. Convergence properties of the softassign quadratic assignment algorithm.

    PubMed

    Rangarajan, A; Vuille, A; Mjolsness, E

    1999-08-15

    The softassign quadratic assignment algorithm is a discrete-time, continuous-state, synchronous updating optimizing neural network. While its effectiveness has been shown in the traveling salesman problem, graph matching, and graph partitioning in thousands of simulations, its convergence properties have not been studied. Here, we construct discrete-time Lyapunov functions for the cases of exact and approximate doubly stochastic constraint satisfaction, which show convergence to a fixed point. The combination of good convergence properties and experimental success makes the softassign algorithm an excellent choice for neural quadratic assignment optimization.

  12. Multi-Frequency Synthesis

    NASA Astrophysics Data System (ADS)

    Conway, J. E.; Sault, R. J.

    Introduction; Image Fidelity; Multi-Frequency Synthesis; Spectral Effects; The Spectral Expansion; Spectral Dirty Beams; First Order Spectral Errors; Second Order Spectral Errors; The MFS Deconvolution Problem; Nature of The Problem; Map and Stack; Direct Assault; Data Weighting Methods; Double Deconvolution; The Sault Algorithm; Multi-Frequency Self-Calibration; Practical MFS; Conclusions

  13. Value-of-information aware active task assignment

    NASA Astrophysics Data System (ADS)

    Mu, Beipeng; Chowdhary, Girish; How, Jonathan P.

    2013-05-01

    This paper discusses the problem of robust allocation of unmanned vehicles (T.N) to targets with uncertainties. In particular, the team consists of heterogeneous vehicles with different exploration and exploitation abilities. A general framework is presented to model uncertainties in the planning problems, which goes beyond traditional Gaussian noise. Traditionally, exploration and exploitation are decoupled into two assignment problems are planned with un-correlated goals. The coupled planning method considered here assign exploration vehicles based on its potential influence of the exploitation. Furthermore, a fully decentralized algorithm, Consensus-Based Bundle Algorithm (CBBA), is used to implement the decoupled and coupled methods. CBBA can handle system dynamic constraints such as target distance, vehicle velocities, and has computation complexity polynomial to the number of vehicles and targets. The coupled method is shown to have improved planning performance in a simulated scenario with uncertainties about target classification.

  14. Dominant pole and eigenstructure assignment for positive systems with state feedback

    NASA Astrophysics Data System (ADS)

    Li, Zhao; Lam, James

    2016-09-01

    In this paper, the dominant pole assignment problem, the dominant eigenstructure assignment problem and the robust dominant pole assignment problem for linear time-invariant positive systems with state feedback are considered. The dominant pole assignment problem is formulated as a linear programming problem, and the dominant eigenstructure problem is formulated as a quasiconvex optimisation problem with linear constraints. The robust dominant pole assignment problem is formulated as a non-convex optimisation problem with non-linear constraints which is solved using particle swarm optimisation (PSO) with an efficient scheme which employs the dominant eigenstructure assignment technique to accelerate the convergence of the PSO procedure. Each of the three problems can be further constrained by requiring that the controller has a pre-specified structure, or the gain matrix have both elementwise upper and lower bounds. These constraints can be incorporated into the proposed scheme without increasing the complexity of the algorithms. Both the continuous-time case and the discrete-time case are treated in the paper.

  15. Assignments, Details, and Transfers: Enlisted Assignments and Utilization Management

    DTIC Science & Technology

    2007-11-02

    Pregnancies involving threatened miscarriage, breech birth, cesarean section , or RH incompatibility of spouse. (7) The problem expected to be resolved by...Department of Defense Directive (DODD) 1315.7. Special duty a s s i g n m e n t p a y ( S D A P ) i s a u t h o r i z e d under section 307, title 37...Contents (Listed by paragraph and page number) Chapter 1 Introduction, page 1 Section I General, page 1 Purpose • 1–1, page 1 References • 1–2, page 1

  16. Due-window assignment scheduling with variable job processing times.

    PubMed

    Wu, Yu-Bin; Ji, Ping

    2015-01-01

    We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.

  17. Due-Window Assignment Scheduling with Variable Job Processing Times

    PubMed Central

    Wu, Yu-Bin

    2015-01-01

    We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time. PMID:25918745

  18. Robust eigensystem assignment for second-order estimators

    NASA Technical Reports Server (NTRS)

    Juang, Jer-Nan; Maghami, Peiman G.

    1990-01-01

    An approach for the robust eigensystem assignment of flexible structures using full state or output feedback is developed. Using the second-order dynamic equations, the approach can assign the eigenvalues of the system via velocity and displacement feedbacks, or acceleration and velocity feedbacks. The eigenvalues and eigenvectors of the system are assigned, via the second-order eigenvalue problem for the structural system, in two steps. First, an orthonormal basis spanning the attainable closed-loop eigenvector space corresponding to each desired closed-loop eigenvalue is generated using the Singular Value or QR decompositions. Second, a sequential procedure is used to choose a set of closed-loop eigenvectors that are as close as possible to the column space of a well-conditioned target matrix. Among the possible choices of the target matrix, the closest unitary matrix to the open-loop eigenvector matrix appears to be a suitable choice. A numerical example is given to illustrate the proposed algorithm.

  19. Neural reactivations during sleep determine network credit assignment.

    PubMed

    Gulati, Tanuj; Guo, Ling; Ramanathan, Dhakshin S; Bodepudi, Anitha; Ganguly, Karunesh

    2017-09-01

    A fundamental goal of motor learning is to establish the neural patterns that produce a desired behavioral outcome. It remains unclear how and when the nervous system solves this 'credit assignment' problem. Using neuroprosthetic learning, in which we could control the causal relationship between neurons and behavior, we found that sleep-dependent processing was required for credit assignment and the establishment of task-related functional connectivity reflecting the casual neuron-behavior relationship. Notably, we observed a strong link between the microstructure of sleep reactivations and credit assignment, with downscaling of non-causal activity. Decoupling of spiking to slow oscillations using optogenetic methods eliminated rescaling. Thus, our results suggest that coordinated firing during sleep is essential for establishing sparse activation patterns that reflect the causal neuron-behavior relationship.

  20. CAPA-An integrated computer-assisted personalized assignment system

    NASA Astrophysics Data System (ADS)

    Kashy, E.; Sherrill, B. M.; Tsai, Y.; Thaler, D.; Weinshank, D.; Engelmann, M.; Morrissey, D. J.

    1993-12-01

    A new integrated computer-assisted personalized assignment (CAPA) system that creates individual assignments for each student has been developed and found to be a powerful motivator. The CAPA system allows students to enter their answers to personalized assignments directly via networked terminals, gives immediate feedback and hints (allowing challenging questions), while providing the instructor with on-line performance information. The students are encouraged to study together which is known to be an effective learning strategy, but each must still obtain his/her own correct answers. Students are allowed to re-enter solutions to the problems before the due date without penalty, thus providing students with different skills levels the opportunity and incentive to understand the material without being judged during the learning process. The features and operation of the system are described, observations on its use in an introductory general physics class are reported, and some of the highly favorable student reactions are included.

  1. An Investigation of the Partial-Assignment Completion Effect on Students' Assignment Choice Behavior

    ERIC Educational Resources Information Center

    Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; Conley, Elisha

    2011-01-01

    This study was designed to investigate the partial assignment completion effect. Seventh-grade students were given a math assignment. After working for 5 min, they were interrupted and their partially completed assignments were collected. About 20 min later, students were given their partially completed assignment and a new, control assignment…

  2. An Investigation of the Partial-Assignment Completion Effect on Students' Assignment Choice Behavior

    ERIC Educational Resources Information Center

    Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; Conley, Elisha

    2011-01-01

    This study was designed to investigate the partial assignment completion effect. Seventh-grade students were given a math assignment. After working for 5 min, they were interrupted and their partially completed assignments were collected. About 20 min later, students were given their partially completed assignment and a new, control assignment…

  3. 48 CFR 211.274-5 - Policy for assignment of Government-assigned serial numbers.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Policy for assignment of... Using and Maintaining Requirements Documents 211.274-5 Policy for assignment of Government-assigned serial numbers. It is DoD policy that contractors apply Government-assigned serial numbers, such as...

  4. 48 CFR 211.274-5 - Policy for assignment of Government-assigned serial numbers.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 48 Federal Acquisition Regulations System 3 2011-10-01 2011-10-01 false Policy for assignment of... Using and Maintaining Requirements Documents 211.274-5 Policy for assignment of Government-assigned serial numbers. It is DoD policy that contractors apply Government-assigned serial numbers, such as...

  5. 47 CFR 24.129 - Frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 2 2012-10-01 2012-10-01 false Frequencies. 24.129 Section 24.129... SERVICES Narrowband PCS § 24.129 Frequencies. The following frequencies are available for narrowband PCS: (a) Eighteen frequencies are available for assignment on a nationwide basis as follows: (1) Seven 50...

  6. 47 CFR 74.1261 - Frequency tolerance.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency tolerance. 74.1261 Section 74.1261... FM Broadcast Booster Stations § 74.1261 Frequency tolerance. (a) The licensee of an FM translator or... frequency at the output of the translator within 0.01 percent of its assigned frequency. (b) The licensee of...

  7. 47 CFR 87.421 - Frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 5 2013-10-01 2013-10-01 false Frequencies. 87.421 Section 87.421... Airport Control Tower Stations § 87.421 Frequencies. The Commission will assign VHF frequencies after coordination with the FAA. Frequencies in the following bands are available to control towers and RCOs. Channel...

  8. 47 CFR 74.503 - Frequency selection.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency selection. 74.503 Section 74.503... § 74.503 Frequency selection. (a) Each application for a new station or change in an existing station shall be specific with regard to frequency. In general, the lowest suitable frequency will be assigned...

  9. 47 CFR 87.421 - Frequencies.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Frequencies. 87.421 Section 87.421... Airport Control Tower Stations § 87.421 Frequencies. The Commission will assign VHF frequencies after coordination with the FAA. Frequencies in the following bands are available to control towers and RCOs. Channel...

  10. 47 CFR 95.853 - Frequency segments.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Frequency segments. 95.853 Section 95.853... SERVICES 218-219 MHz Service Technical Standards § 95.853 Frequency segments. There are two frequency segments available for assignment to the 218-219 MHz Service in each service area. Frequency segment A is...

  11. 47 CFR 87.475 - Frequencies.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 5 2011-10-01 2011-10-01 false Frequencies. 87.475 Section 87.475... Stations in the Radiodetermination Service § 87.475 Frequencies. (a) Frequency coordination. The Commission will assign frequencies to radionavigation land stations and radionavigation land test stations after...

  12. 47 CFR 74.503 - Frequency selection.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency selection. 74.503 Section 74.503... § 74.503 Frequency selection. (a) Each application for a new station or change in an existing station shall be specific with regard to frequency. In general, the lowest suitable frequency will be assigned...

  13. 47 CFR 95.853 - Frequency segments.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Frequency segments. 95.853 Section 95.853... SERVICES 218-219 MHz Service Technical Standards § 95.853 Frequency segments. There are two frequency segments available for assignment to the 218-219 MHz Service in each service area. Frequency segment A is...

  14. 47 CFR 74.503 - Frequency selection.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 4 2013-10-01 2013-10-01 false Frequency selection. 74.503 Section 74.503... § 74.503 Frequency selection. (a) Each application for a new station or change in an existing station shall be specific with regard to frequency. In general, the lowest suitable frequency will be assigned...

  15. 47 CFR 87.475 - Frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Frequencies. 87.475 Section 87.475... Stations in the Radiodetermination Service § 87.475 Frequencies. (a) Frequency coordination. The Commission will assign frequencies to radionavigation land stations and radionavigation land test stations after...

  16. 47 CFR 74.1261 - Frequency tolerance.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 4 2011-10-01 2011-10-01 false Frequency tolerance. 74.1261 Section 74.1261... FM Broadcast Booster Stations § 74.1261 Frequency tolerance. (a) The licensee of an FM translator or... frequency at the output of the translator within 0.01 percent of its assigned frequency. (b) The licensee of...

  17. 47 CFR 87.349 - Frequencies.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 5 2012-10-01 2012-10-01 false Frequencies. 87.349 Section 87.349... Aeronautical Utility Mobile Stations § 87.349 Frequencies. (a) The frequency assigned to an aeronautical... frequency used by the control tower for ground traffic control or by the flight service station for...

  18. 47 CFR 24.129 - Frequencies.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 2 2014-10-01 2014-10-01 false Frequencies. 24.129 Section 24.129... SERVICES Narrowband PCS § 24.129 Frequencies. The following frequencies are available for narrowband PCS: (a) Eighteen frequencies are available for assignment on a nationwide basis as follows: (1) Seven 50...

  19. 47 CFR 24.129 - Frequencies.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 2 2013-10-01 2013-10-01 false Frequencies. 24.129 Section 24.129... SERVICES Narrowband PCS § 24.129 Frequencies. The following frequencies are available for narrowband PCS: (a) Eighteen frequencies are available for assignment on a nationwide basis as follows: (1) Seven 50...

  20. 47 CFR 74.1261 - Frequency tolerance.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 4 2014-10-01 2014-10-01 false Frequency tolerance. 74.1261 Section 74.1261... FM Broadcast Booster Stations § 74.1261 Frequency tolerance. (a) The licensee of an FM translator or... frequency at the output of the translator within 0.01 percent of its assigned frequency. (b) The licensee of...