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.
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.
47 CFR 74.802 - Frequency assignment.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 47 Telecommunication 4 2010-10-01 2010-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...
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...
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...
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...
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...
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....
47 CFR 80.509 - Frequency assignment.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 47 Telecommunication 5 2012-10-01 2012-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....
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....
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... 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....
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....
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....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...
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...
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...
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...
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...
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...
47 CFR 74.1202 - Frequency assignment.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 47 Telecommunication 4 2010-10-01 2010-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...
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...
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...
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...
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...
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...
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...
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...
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...
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... Frequency Allocations. These stations will be protected from possible interference caused by new users...
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...
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...
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 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO, AUXILIARY, SPECIAL BROADCAST AND OTHER PROGRAM DISTRIBUTIONAL SERVICES Remote Pickup Broadcast Stations § 74.402 Frequency assignment....
47 CFR 101.147 - Frequency assignments.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 47 Telecommunication 5 2011-10-01 2011-10-01 false Frequency assignments. 101.147 Section 101.147 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.147 Frequency assignments. Link to an amendment published at 76 FR 59573, Sept. 27, 2011....
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 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO, AUXILIARY, SPECIAL BROADCAST AND OTHER PROGRAM DISTRIBUTIONAL SERVICES Television Broadcast Auxiliary Stations § 74.602 Frequency assignment....
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 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO, AUXILIARY, SPECIAL BROADCAST AND OTHER PROGRAM DISTRIBUTIONAL SERVICES Television Broadcast Auxiliary Stations § 74.602 Frequency assignment....
Absolute Points for Multiple Assignment Problems
ERIC Educational Resources Information Center
Adlakha, V.; Kowalski, K.
2006-01-01
An algorithm is presented to solve multiple assignment problems in which a cost is incurred only when an assignment is made at a given cell. The proposed method recursively searches for single/group absolute points to identify cells that must be loaded in any optimal solution. Unlike other methods, the first solution is the optimal solution. The…
Optimum frequency assignment for satellite SCPC systems
NASA Astrophysics Data System (ADS)
Okinaka, H.; Yasuda, Y.; Hirata, Y.
A technique for deriving a quasi-optimum solution for IM-minimum channel allocation for single-level SCPC systems is presented. Two types of IM products are considered as the dominant components in an RF band. The third order IM product is proportional to the product of the power of concerned carriers, allowing a weighting function to be defined for calculating the IM noise. An IM minimum channel allocation technique can then be used to reduce the IM noise occurring in the carrier slots through frequency assignment. The worst carrier is automatically deleted with an initial channel allocation and the process is iterated until the maximum noise reduction is obtained. The first two or three carriers are assigned to unused frequency slots with low noise. The method is also viable when dealing with a larger number of carriers.
The Airport Gate Assignment Problem: A Survey
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
The airport gate assignment problem: a survey.
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. PMID:25506074
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.
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 of frequencies. (a) Except as...
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 of frequencies. (a) Except as...
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.
Solving multiconstraint assignment problems using learning automata.
Horn, Geir; Oommen, B John
2010-02-01
This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the
Approximate algorithms for partitioning and assignment problems
NASA Technical Reports Server (NTRS)
Iqbal, M. A.
1986-01-01
The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy.
47 CFR 2.102 - Assignment of frequencies.
Code of Federal Regulations, 2013 CFR
2013-10-01
... frequency band not exclusively allocated to the passive services (including the radio astronomy service). (4... 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...
47 CFR 2.102 - Assignment of frequencies.
Code of Federal Regulations, 2011 CFR
2011-10-01
... (including the radio astronomy service). (4) In the event a band is reallocated so as to delete its... 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...
47 CFR 2.102 - Assignment of frequencies.
Code of Federal Regulations, 2010 CFR
2010-10-01
... (including the radio astronomy service). (4) In the event a band is reallocated so as to delete its... 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...
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.
47 CFR 74.402 - Frequency assignment.
Code of Federal Regulations, 2014 CFR
2014-10-01
... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO... frequencies is limited to operational communications, including tones for signaling and for remote control and automatic transmission system control and telemetry. Stations licensed or applied for before April 16,...
47 CFR 74.402 - Frequency assignment.
Code of Federal Regulations, 2012 CFR
2012-10-01
... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO... frequencies is limited to operational communications, including tones for signaling and for remote control and automatic transmission system control and telemetry. Stations licensed or applied for before April 16,...
47 CFR 74.402 - Frequency assignment.
Code of Federal Regulations, 2011 CFR
2011-10-01
... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO... frequencies is limited to operational communications, including tones for signaling and for remote control and automatic transmission system control and telemetry. Stations licensed or applied for before April 16,...
47 CFR 74.402 - Frequency assignment.
Code of Federal Regulations, 2010 CFR
2010-10-01
... Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES EXPERIMENTAL RADIO... frequencies is limited to operational communications, including tones for signaling and for remote control and automatic transmission system control and telemetry. Stations licensed or applied for before April 16,...
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... conditions specified in footnote 15 of § 25.202(a)(1) of this chapter, see 47 CFR 47 25.202(a)(1) n.16. (33... November 19, 2002, no applications for new stations for 47 CFR part 101 licenses will be accepted in the...
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... in footnote 15 of § 25.202(a)(1) of this chapter, see 47 CFR 47 25.202(a)(1) n.16. (33) The... November 19, 2002, no applications for new stations for 47 CFR part 101 licenses will be accepted in the...
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... conditions specified in footnote 15 of § 25.202(a)(1) of this chapter, see 47 CFR 47 25.202(a)(1) n.16. (33... operations. After November 19, 2002, no applications for new stations for 47 CFR part 101 licenses will...
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... in footnote 15 of § 25.202(a)(1) of this chapter, see 47 CFR 47 25.202(a)(1) n.16. (33) The... operations. After November 19, 2002, no applications for new stations for 47 CFR part 101 licenses will...
47 CFR 90.723 - 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... A 221-222 MHz frequencies 200 kHz or less removed. (i) A mobile station is authorized to transmit on any frequency assigned to its associated base station. Mobile units not associated with base...
47 CFR 90.723 - Selection and assignment of frequencies.
Code of Federal Regulations, 2014 CFR
2014-10-01
... SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the... A 221-222 MHz frequencies 200 kHz or less removed. (i) A mobile station is authorized to transmit on any frequency assigned to its associated base station. Mobile units not associated with base...
47 CFR 90.723 - Selection and assignment of frequencies.
Code of Federal Regulations, 2012 CFR
2012-10-01
... SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the... A 221-222 MHz frequencies 200 kHz or less removed. (i) A mobile station is authorized to transmit on any frequency assigned to its associated base station. Mobile units not associated with base...
47 CFR 90.723 - Selection and assignment of frequencies.
Code of Federal Regulations, 2013 CFR
2013-10-01
... SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the... A 221-222 MHz frequencies 200 kHz or less removed. (i) A mobile station is authorized to transmit on any frequency assigned to its associated base station. Mobile units not associated with base...
47 CFR 90.723 - 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... A 221-222 MHz frequencies 200 kHz or less removed. (i) A mobile station is authorized to transmit on any frequency assigned to its associated base station. Mobile units not associated with base...
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.
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 47 Telecommunication 5 2011-10-01 2011-10-01 false Selection and assignment of frequencies. 90.621 Section 90.621 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Regulations Governing Licensing and Use of Frequencies in the 806-824, 851-869, 896-901, and...
Phase transition in the assignment problem for random matrices
NASA Astrophysics Data System (ADS)
Esteve, J. G.; Falceto, F.
2005-12-01
We report an analytic and numerical study of a phase transition in a P problem (the assignment problem) that separates two phases whose representatives are the simple matching problem (an easy P problem) and the traveling-salesman problem (a NP-complete problem). Like other phase transitions found in combinatoric problems (K-satisfiability, number partitioning) this can help to understand the nature of the difficulties in solving NP problems an to find more accurate algorithms for them.
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.
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.
Complexity and Approximation of a Geometric Local Robot Assignment Problem
NASA Astrophysics Data System (ADS)
Bonorden, Olaf; Degener, Bastian; Kempkes, Barbara; Pietrzyk, Peter
We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in {mathcal P} or are mathcal{ NP}-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with {mathcal O}(log^*n) communication rounds.
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2010 CFR
2010-10-01
....8″ 118°50′22.3″ * * * 35°38′28.8″ 118°47′11.3″ * * * 35°33′08.8″ 118°49′23.3″ * * * 35°17′16.9″ 119... 47 Telecommunication 5 2010-10-01 2010-10-01 false Selection and assignment of frequencies. 90.621... 118° West Longitude North latitude West longitude * * * 38°03′39.7″ 122°36′20.9″ * * * 37°55′43.7″...
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2013 CFR
2013-10-01
....8″ 118°50′22.3″ * * * 35°38′28.8″ 118°47′11.3″ * * * 35°33′08.8″ 118°49′23.3″ * * * 35°17′16.9″ 119... 47 Telecommunication 5 2013-10-01 2013-10-01 false Selection and assignment of frequencies. 90.621... 118° West Longitude North latitude West longitude * * * 38°03′39.7″ 122°36′20.9″ * * * 37°55′43.7″...
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2012 CFR
2012-10-01
....8″ 118°50′22.3″ * * * 35°38′28.8″ 118°47′11.3″ * * * 35°33′08.8″ 118°49′23.3″ * * * 35°17′16.9″ 119... 47 Telecommunication 5 2012-10-01 2012-10-01 false Selection and assignment of frequencies. 90.621... 118° West Longitude North latitude West longitude * * * 38°03′39.7″ 122°36′20.9″ * * * 37°55′43.7″...
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2014 CFR
2014-10-01
....8″ 118°50′22.3″ * * * 35°38′28.8″ 118°47′11.3″ * * * 35°33′08.8″ 118°49′23.3″ * * * 35°17′16.9″ 119... 47 Telecommunication 5 2014-10-01 2014-10-01 false Selection and assignment of frequencies. 90.621... 118° West Longitude North latitude West longitude * * * 38°03′39.7″ 122°36′20.9″ * * * 37°55′43.7″...
An Improved Approach to Solution of the Faculty Assignment Problem.
ERIC Educational Resources Information Center
Yang, Chin W.
1989-01-01
Examined is the problem of assigning faculty members to teach various courses in an accounting department. Based on selected evaluation information, a zero-one integer programing model was implemented. This approach utilizes readily available data and takes into consideration the learning curve phenomenon, various competing needs, and…
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.
A polyhedral approach to a constrained assignment problem
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.
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.
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 stations. 80.379 Section 80.379 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Frequencies Aircraft Stations § 80.379 Maritime frequencies assignable to...
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.
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.
Massively parallel solution of the assignment problem. Technical report
Wein, J.; Zenios, S.
1990-12-01
In this paper we discuss the design, implementation and effectiveness of massively parallel algorithms for the solution of large-scale assignment problems. In particular, we study the auction algorithms of Bertsekas, an algorithm based on the method of multipliers of Hestenes and Powell, and an algorithm based on the alternating direction method of multipliers of Eckstein. We discuss alternative approaches to the massively parallel implementation of the auction algorithm, including Jacobi, Gauss-Seidel and a hybrid scheme. The hybrid scheme, in particular, exploits two different levels of parallelism and an efficient way of communicating the data between them without the need to perform general router operations across the hypercube network. We then study the performance of massively parallel implementations of two methods of multipliers. Implementations are carried out on the Connection Machine CM-2, and the algorithms are evaluated empirically with the solution of large scale problems. The hybrid scheme significantly outperforms all of the other methods and gives the best computational results to date for a massively parallel solution to this problem.
Cerebellar Synaptic Plasticity and the Credit Assignment Problem.
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. PMID:25417189
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2012 CFR
2012-10-01
... affecting § 90.621, see the List of CFR Sections Affected, which appears in the Finding Aids section of the... between common antenna sites are given by table 1. A channel group assigned to a station on a site listed... separations involving antenna sites not listed in table 1 shall be determined by Commission staff on a case...
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2014 CFR
2014-10-01
... affecting § 90.621, see the List of CFR Sections Affected, which appears in the Finding Aids section of the... between common antenna sites are given by table 1. A channel group assigned to a station on a site listed... separations involving antenna sites not listed in table 1 shall be determined by Commission staff on a case...
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2013 CFR
2013-10-01
... affecting § 90.621, see the List of CFR Sections Affected, which appears in the Finding Aids section of the... between common antenna sites are given by table 1. A channel group assigned to a station on a site listed... separations involving antenna sites not listed in table 1 shall be determined by Commission staff on a case...
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2011 CFR
2011-10-01
... pending. Editorial Notes 1. For Federal Register citations affecting § 90.621, see the List of CFR... between common antenna sites are given by table 1. A channel group assigned to a station on a site listed... separations involving antenna sites not listed in table 1 shall be determined by Commission staff on a case...
47 CFR 90.173 - Policies governing the assignment of frequencies.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 47 Telecommunication 5 2011-10-01 2011-10-01 false Policies governing the assignment of frequencies. 90.173 Section 90.173 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Policies Governing the Assignment of Frequencies § 90.173 Policies governing the...
47 CFR 90.173 - Policies governing the assignment of frequencies.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 47 Telecommunication 5 2010-10-01 2010-10-01 false Policies governing the assignment of frequencies. 90.173 Section 90.173 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Policies Governing the Assignment of Frequencies § 90.173 Policies governing the...
47 CFR 90.621 - Selection and assignment of frequencies.
Code of Federal Regulations, 2010 CFR
2010-10-01
... pending. Editorial Notes 1. For Federal Register citations affecting § 90.621, see the List of CFR... 806-824, 851-869, 896-901, and 935-940 MHz Bands Policies Governing the Processing of Applications and... parties or a certified frequency coordinator to utilize an 18 dBµV/m signal strength interference...
Lexical stress assignment as a problem of probabilistic inference.
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. PMID:25636917
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.
Solving the assignment problem using continuous-time and discrete-time improved dual networks.
Hu, Xiaolin; Wang, Jun
2012-05-01
The assignment problem is an archetypal combinatorial optimization problem. In this brief, we present a continuous-time version and a discrete-time version of the improved dual neural network (IDNN) for solving the assignment problem. Compared with most assignment networks in the literature, the two versions of IDNNs are advantageous in circuit implementation due to their simple structures. Both of them are theoretically guaranteed to be globally convergent to a solution of the assignment problem if only the solution is unique. PMID:24806130
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.
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)
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…
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.
An integer programming model for gate assignment problem at airline terminals
NASA Astrophysics Data System (ADS)
Chun, Chong Kok; Nordin, Syarifah Zyurina
2015-05-01
In this paper, we concentrate on a gate assignment problem (GAP) at the airlines terminal. Our problem is to assign an arrival plane to a suitable gate. There are two considerations needed to take. One of its is passenger walking distance from arrival gate to departure gate while another consideration is the transport baggage distance from one gate to another. Our objective is to minimize the total distance between the gates that related to assign the arrival plane to the suitable gates. An integer linear programming (ILP) model is proposed to solve this gate assignment problem. We also conduct a computational experiment using CPLEX 12.1 solver in AIMMS 3.10 software to analyze the performance of the model. Results of the computational experiments are presented. The efficiency of flights assignment is depends on the ratio of the weight for both total passenger traveling distances and total baggage transport distances.
Successive linear optimization approach to the dynamic traffic assignment problem
Ho, J.K.
1980-11-01
A dynamic model for the optimal control of traffic flow over a network is considered. The model, which treats congestion explicitly in the flow equations, gives rise to nonlinear, nonconvex mathematical programming problems. It has been shown for a piecewise linear version of this model that a global optimum is contained in the set of optimal solutions of a certain linear program. A sufficient condition for optimality which implies that a global optimum can be obtained by successively optimizing at most N + 1 objective functions for the linear program, where N is the number of time periods in the planning horizon is presented. Computational results are reported to indicate the efficiency of this approach.
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…
Parallel shortest augmenting path algorithm for the assignment problem. Technical report
Balas, E.; Miller, D.; Pekny, J.; Toth, P.
1989-04-01
We describe a parallel version of the shortest augmenting path algorithm for the assignment problem. While generating the initial dual solution and partial assignment in parallel does not require substantive changes in the sequential algorithm, using several augmenting paths in parallel does require a new dual variable recalculation method. The parallel algorithm was tested on a 14-processor Butterfly Plus computer, on problems with up to 900 million variables. The speedup obtained increases with problem size. The algorithm was also embedded into a parallel branch and bound procedure for the traveling salesman problem on a directed graph, which was tested on the Butterfly Plus on problems involving up to 7,500 cities. To our knowledge, these are the largest assignment problems and traveling salesman problems solved so far.
Inverse scattering problems with multi-frequencies
NASA Astrophysics Data System (ADS)
Bao, Gang; Li, Peijun; Lin, Junshan; Triki, Faouzi
2015-09-01
This paper is concerned with computational approaches and mathematical analysis for solving inverse scattering problems in the frequency domain. The problems arise in a diverse set of scientific areas with significant industrial, medical, and military applications. In addition to nonlinearity, there are two common difficulties associated with the inverse problems: ill-posedness and limited resolution (diffraction limit). Due to the diffraction limit, for a given frequency, only a low spatial frequency part of the desired parameter can be observed from measurements in the far field. The main idea developed here is that if the reconstruction is restricted to only the observable part, then the inversion will become stable. The challenging task is how to design stable numerical methods for solving these inverse scattering problems inspired by the diffraction limit. Recently, novel recursive linearization based algorithms have been presented in an attempt to answer the above question. These methods require multi-frequency scattering data and proceed via a continuation procedure with respect to the frequency from low to high. The objective of this paper is to give a brief review of these methods, their error estimates, and the related mathematical analysis. More attention is paid to the inverse medium and inverse source problems. Numerical experiments are included to illustrate the effectiveness of these methods.
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...
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...
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...
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...
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...
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.
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
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
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
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++…
A tabu search approach for the NMR protein structure-based assignment problem.
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. PMID:23221084
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...
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...
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...
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...
Applying genetic algorithms to the state assignment problem: a case study
NASA Astrophysics Data System (ADS)
Amaral, Jose N.; Tumer, Kagan; Ghosh, Joydeep
1992-08-01
Finding the best state assignment for implementing a synchronous sequential circuit is important for reducing silicon area or chip count in many digital designs. This State Assignment Problem (SAP) belongs to a broader class of combinatorial optimization problems than the well studied traveling salesman problem, which can be formulated as a special case of SAP. The search for a good solution is considerably more involved for the SAP than it is for the traveling salesman problem due to a much larger number of equivalent solutions, and no effective heuristic has been found so far to cater to all types of circuits. In this paper, a matrix representation is used as the genotype for a Generic Algorithm (GA) approach to this problem. A novel selection mechanism is introduced, and suitable genetic operators for crossover and mutation, are constructed. The properties of each of these elements of the GA are discussed and an analysis of parameters that influence the algorithm is given. A canonical form for a solution is defined to significantly reduce the search space and number of local minima. Simulation results for scalable examples show that the GA approach yields results that are comparable to those obtained using competing heuristics. Although a GA does not seem to be the tool of choice for use in a sequential Von-Neumann machine, the results obtained are good enough to encourage further research on distributed processing GA machines that can exploit its intrinsic parallelism.
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.
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'.
Short communication : a linear assignment approach for the least-squares protein morphing problem.
Anitescu, M.; Park, S.; Mathematics and Computer Science
2009-02-01
This work addresses the computation of free-energy differences between protein conformations by using morphing (i.e., transformation) of a source conformation into a target conformation. To enhance the morphing procedure, we employ permutations of atoms: we seek to find the permutation s that minimizes the mean-square distance traveled by the atoms. Instead of performing this combinatorial search in the space of permutations, we show that the best permutation can be found by solving a linear assignment problem. We demonstrate that the use of such optimal permutations significantly improves the efficiency of the free-energy computation.
NASA Astrophysics Data System (ADS)
Mont, Alexander D.; Calderon, Christopher P.; Poore, Aubrey B.
2014-06-01
We present a new approach to estimating the probability of each association in a 2D assignment problem defined by likelihood ratios. Our method divides the set of feasible hypotheses into clusters, and converts a collection of hypotheses into a collection of clusters containing them, reducing the variance of the estimate. Simulations show that our method often generates substantially more accurate probability estimates in less time than traditional methods. Our method can obtain reasonably accurate probabilities of association based on only the input cost matrix and single best candidate solution, eliminating the need for a K-best solution method or MCMC sampling.
A neural network-based optimization algorithm for the weapon-target assignment problem
Wacholder, E.
1989-02-01
A neural network-based algorithm was developed for the Weapon-Target Assignment Problem (WTAP) in Ballistic Missile Defense (BMD). An optimal assignment policy is one which allocates targets to weapon platforms such that the total expected leakage value of targets surviving the defense is minimized. This involves the minimization of a non-linear objective function subject to inequality constraints specifying the maximum number of interceptors available to each platform and the maximum number of interceptors allowed to be fired at each target as imposed by the Battle Management/Command Control and Communications (BM/C/sup 3/) system. The algorithm consists of solving a system of ODEs trajectories and variables. Simulations of the algorithm on PC and VAX computers were carried out using a simple numerical scheme. In all the battle instances tested, the algorithm has proven to be stable and to converge to solutions very close to global optima. The time to achieve convergence was consistently less than the time constant of the network's processing elements (neurons). This implies that fast solutions can be realized if the algorithm is implemented in hardware circuits. Three series of battle scenarios are analyzed and discussed in this report. Input data and results are presented in detail. The main advantage of this algorithm is that it can be adapted to either a special-purpose hardware circuit or a general-purpose concurrent machine to yield fast and accurate solutions to difficult decision problems. 40 refs., 8 figs., 8 tabs.
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.
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.
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.
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.
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
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
Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.
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. PMID:23757559
47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.
Code of Federal Regulations, 2014 CFR
2014-10-01
... aircraft stations for simplex operations: (a) Available frequencies: Carrier frequency Conditions of use... Sound and the Strait of Juan de Fuca and its approaches, the Great Lakes, and the St. Lawrence...
47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.
Code of Federal Regulations, 2013 CFR
2013-10-01
... aircraft stations for simplex operations: (a) Available frequencies: Carrier frequency Conditions of use... Sound and the Strait of Juan de Fuca and its approaches, the Great Lakes, and the St. Lawrence...
47 CFR 80.379 - Maritime frequencies assignable to aircraft stations.
Code of Federal Regulations, 2012 CFR
2012-10-01
... aircraft stations for simplex operations: (a) Available frequencies: Carrier frequency Conditions of use... Sound and the Strait of Juan de Fuca and its approaches, the Great Lakes, and the St. Lawrence...
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.
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.
Binge drinking among Brazilians: Higher drinking frequency increases related problems.
de Castro, Daniel Sócrates; Sanchez, Zila M; Zaleski, Marcos; Palhares Alves, Hamer Nastasy; Pinsky, Ilana; Caetano, Raul; Laranjeira, Ronaldo Ramos
2014-05-14
Abstract Aims: To correlate binge drinking (BD) with alcohol-related problems (ARP) in the Brazilian population. Methods: A representative cross-sectional survey was conducted in 143 Brazilian cities. Associations between the frequencies of BD and ARP were gathered using an ordered logit regression model. Results: Higher BD frequencies significantly increased the chance of injury in accidents, job loss, and involvement in intense arguments and assaults over the year. High frequency in BD increases the odds of all ARP. Conclusion: There is a dose-response association between the frequency BD and ARP and is therefore a possible target for public prevention policies. PMID:24829095
47 CFR 80.479 - Assignment and use of frequencies for AMTS.
Code of Federal Regulations, 2011 CFR
2011-10-01
....479 Section 80.479 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Public Coast Stations Automated Systems § 80.479... frequencies may be used for mobile-to-mobile communications if written consent is obtained from all...
47 CFR 80.479 - Assignment and use of frequencies for AMTS.
Code of Federal Regulations, 2013 CFR
2013-10-01
....479 Section 80.479 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Public Coast Stations Automated Systems § 80.479... frequencies may be used for mobile-to-mobile communications if written consent is obtained from all...
47 CFR 80.479 - Assignment and use of frequencies for AMTS.
Code of Federal Regulations, 2014 CFR
2014-10-01
....479 Section 80.479 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Public Coast Stations Automated Systems § 80.479... frequencies may be used for mobile-to-mobile communications if written consent is obtained from all...
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…
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.
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.
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. PMID:23783452
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…
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.
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.
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.
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.
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 PMID:26372261
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…
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.
NASA Astrophysics Data System (ADS)
Ishiyama, Tatsuya; Sokolov, Vladimir V.; Morita, Akihiro
2011-01-01
Vibrational spectra of methyl C-H stretching region are notoriously complicated, and thus a theoretical method of systematic assignment is strongly called for in condensed phase. Here we develop a unified analysis method of the vibrational spectra, such as infrared (IR), polarized and depolarized Raman, and ssp polarized sum frequency generation (SFG), by flexible and polarizable molecular dynamics simulation. The molecular model for methanol has been developed by charge response kernel model to allow for analyzing the methyl C-H stretching vibrations. The complicated spectral structure by the Fermi resonance has been unraveled by empirically shifting potential parameters, which provides clear information on the coupling mechanism. The analysis confirmed that for the IR, polarized Raman, and SFG spectra, two-band structure at about 2830 and 2950 cm^{-1} results from the Fermi resonance splitting of the methyl C-H symmetric stretching and bending overtones. In the IR spectrum, the latter, higher-frequency band is overlapped with prominent asymmetric C-H stretching bands. In the depolarized Raman spectrum, the high frequency band at about 2980 cm^{-1} is assigned to the asymmetric C-H stretching mode. In the SFG spectrum, the two bands of the splitted symmetric C-H stretching mode have negative amplitudes of imaginary nonlinear susceptibility χ ^{(2)}, while the higher-frequency band is partly cancelled by positive imaginary components of asymmetric C-H stretching modes.
Ishiyama, Tatsuya; Sokolov, Vladimir V; Morita, Akihiro
2011-01-14
Vibrational spectra of methyl C-H stretching region are notoriously complicated, and thus a theoretical method of systematic assignment is strongly called for in condensed phase. Here we develop a unified analysis method of the vibrational spectra, such as infrared (IR), polarized and depolarized Raman, and ssp polarized sum frequency generation (SFG), by flexible and polarizable molecular dynamics simulation. The molecular model for methanol has been developed by charge response kernel model to allow for analyzing the methyl C-H stretching vibrations. The complicated spectral structure by the Fermi resonance has been unraveled by empirically shifting potential parameters, which provides clear information on the coupling mechanism. The analysis confirmed that for the IR, polarized Raman, and SFG spectra, two-band structure at about 2830 and 2950 cm(-1) results from the Fermi resonance splitting of the methyl C-H symmetric stretching and bending overtones. In the IR spectrum, the latter, higher-frequency band is overlapped with prominent asymmetric C-H stretching bands. In the depolarized Raman spectrum, the high frequency band at about 2980 cm(-1) is assigned to the asymmetric C-H stretching mode. In the SFG spectrum, the two bands of the splitted symmetric C-H stretching mode have negative amplitudes of imaginary nonlinear susceptibility χ(2), while the higher-frequency band is partly cancelled by positive imaginary components of asymmetric C-H stretching modes. PMID:21241123
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…
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…
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.
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
ERIC Educational Resources Information Center
Pool, Ithiel de Sola
1979-01-01
Presents several anticipated problems to be handled at the 1979 World Administrative Conference including an orbital allocation plan, political and ideological issues concerning sovereignty and prior consent, spectrum assignments, and sharing of TV frequencies with land mobile radio. (JMF)
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
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). PMID
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
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.
Inverse Problems of Low-Frequency Diagnostics of the Earth's Crust
NASA Astrophysics Data System (ADS)
Gaikovich, K. P.; Smirnov, A. I.
2015-11-01
We develop and test (in numerical simulation) methods of computer tomography of distributed under-surface inhomogeneities in the conductivity of a medium and for holography (i.e., reconstruction of the shape) of solid and uniformly composed subsurface objects in the context of the problems of multifrequency electromagnetic diagnostics of the Earth's crust structure in the extremely and ultra low frequency bands. The methods are based on solution of the inverse scattering problem using the results provided by multifrequency measurements of the distribution of complex amplitudes of the electromagnetic field on the surface of the medium under consideration.
Directional algorithms for the frequency isolation problem in undamped vibrational systems
NASA Astrophysics Data System (ADS)
Moro, Julio; Egaña, Juan C.
2016-06-01
A new algorithm is presented to solve the frequency isolation problem for vibrational systems with no damping: given an undamped mass-spring system with resonant eigenvalues, the system must be re-designed, finding some close-by non-resonant system at a reasonable cost. Our approach relies on modifying masses and stiffnesses along directions in parameter space which produce a maximal variation in the resonant eigenvalues, provided the non-resonant ones do not undergo large variations. The algorithm is derived from first principles, implemented, and numerically tested. The numerical experiments show that the new algorithms are considerably faster and more robust than previous algorithms solving the same problem.
Frequency-domain calculation of the self-force: The high-frequency problem and its resolution
Barack, Leor; Sago, Norichika; Ori, Amos
2008-10-15
The mode-sum method provides a practical means for calculating the self-force acting on a small particle orbiting a larger black hole. In this method, one first computes the spherical-harmonic l-mode contributions F{sub l}{sup {mu}} of the 'full-force' field F{sup {mu}}, evaluated at the particle's location, and then sums over l subject to a certain regularization scheme. In the frequency-domain variant of this procedure the quantities F{sub l}{sup {mu}} are obtained by fully decomposing the particle's self-field into Fourier-harmonic modes lm{omega}, calculating the contribution of each such mode to F{sub l}{sup {mu}}, and then summing over {omega} and m for given l. This procedure has the advantage that one only encounters ordinary differential equations. However, for eccentric orbits, the sum over {omega} is found to converge badly at the particle's location. This problem (reminiscent of the familiar Gibbs phenomenon of Fourier analysis) results from the discontinuity of the time-domain F{sub l}{sup {mu}} field at the particle's worldline. Here we propose a simple and practical method to resolve this problem. The method utilizes the homogeneous modes lm{omega} of the self-field to construct F{sub l}{sup {mu}} (rather than the inhomogeneous modes, as in the standard method), which guarantees an exponentially fast convergence to the correct value of F{sub l}{sup {mu}}, even at the particle's location. We illustrate the application of the method with the example of the monopole scalar-field perturbation from a scalar charge in an eccentric orbit around a Schwarzschild black hole. Our method, however, should be applicable to a wider range of problems, including the calculation of the gravitational self-force using either Teukolsky's formalism, or a direct integration of the metric perturbation equations.
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. PMID:22615146
47 CFR 90.261 - Assignment and use of the frequencies in the band 450-470 MHz for fixed operations.
Code of Federal Regulations, 2013 CFR
2013-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...
47 CFR 90.261 - Assignment and use of the frequencies in the band 450-470 MHz for fixed operations.
Code of Federal Regulations, 2014 CFR
2014-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...
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...
47 CFR 90.261 - Assignment and use of the frequencies in the band 450-470 MHz for fixed operations.
Code of Federal Regulations, 2012 CFR
2012-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...
47 CFR 90.261 - Assignment and use of the frequencies in the band 450-470 MHz for fixed operations.
Code of Federal Regulations, 2011 CFR
2011-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...
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. PMID:25915690
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…
Frequencies and resonances around L4 in the elliptic restricted three-body problem
NASA Astrophysics Data System (ADS)
Rajnai, R.; Nagy, I.; Érdi, B.
2014-09-01
More and more Trojan asteroids are discovered in our Solar system, suggesting that they are probably a common spinoff of planet formation and evolution. Till date we know thousands of Trojan followers of Jupiter, and Trojan asteroids and moons of other major planets have also been discovered. The large number of such celestial bodies can mean that Trojan companions to extrasolar planets may also be common. Trojan celestial bodies are examples for the Lagrangian triangular solutions of the three-body problem. In this paper, the stability of the Lagrangian point L4 is investigated in the elliptic restricted three-body problem by using Floquet's theory. Stable and unstable domains are determined in the parameter plane of the mass parameter and the eccentricity by computing the characteristic exponents. Frequencies of motion around L4 have been determined both in the stable and unstable domains, and fitting functions for the frequencies are derived depending on the mass parameter and the eccentricity. Resonances between the frequencies are studied in the whole parameter plane. It is shown that the 1:1 resonances are not restricted only to single curves but extend to the whole unstable domain. In the unstable domains, longer escape times of the test particle from the neighbourhood of L4 are related to certain resonances, but changing the parameters the same resonances may lead to faster escape.
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)
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks.
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
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks
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
Du, Yi; Kong, Lingzhi; Wang, Qian; Wu, Xihong; Li, Liang
2011-11-01
How do we recognize what one person is saying when others are speaking at the same time? The "cocktail-party problem" proposed by Cherry (1953) has puzzled scientific societies for half a century. This puzzle will not be solved without using appropriate neurophysiological investigation that should satisfy the following four essential requirements: (1) certain critical speech characteristics related to speech intelligibility are recorded; (2) neural responses to different speech sources are differentiated; (3) neural correlates of bottom-up binaural unmasking of responses to target speech are measurable; (4) neural correlates of attentional top-down unmasking of target speech are measurable. Before speech signals reach the cerebral cortex, some critical acoustic features are represented in subcortical structures by the frequency-following responses (FFRs), which are sustained evoked potentials based on precisely phase-locked responses of neuron populations to low-to-middle-frequency periodical acoustical stimuli. This review summarizes previous studies on FFRs associated with each of the four requirements and suggests that FFRs are useful for studying the "cocktail-party problem". PMID:21645541
ERIC Educational Resources Information Center
Vick, John W.; Houden, Dorothy
This report contains recommendations of a Wisconsin Task Assignment Steering Committee created to explore solutions to some significant problems facing adult chronic "revolving-detox-door" alcohol abusers (CRA's), persons with repeated admissions for detoxification services; and to examine the system that serves and funds them. This report is…
Thomas, Silke; Heinrich, Sabine; von Kries, Rüdiger; Radon, Katja
2010-02-01
Only few studies have so far investigated possible health effects of radio-frequency electromagnetic fields (RF EMF) in children and adolescents, although experts discuss a potential higher vulnerability to such fields. We aimed to investigate a possible association between measured exposure to RF EMF fields and behavioural problems in children and adolescents. 1,498 children and 1,524 adolescents were randomly selected from the population registries of four Bavarian (South of Germany) cities. During an Interview data on participants' mental health, socio-demographic characteristics and potential confounders were collected. Mental health behaviour was assessed using the German version of the Strengths and Difficulties Questionnaire (SDQ). Using a personal dosimeter, we obtained radio-frequency EMF exposure profiles over 24 h. Exposure levels over waking hours were expressed as mean percentage of the reference level. Overall, exposure to radiofrequency electromagnetic fields was far below the reference level. Seven percent of the children and 5% of the adolescents showed an abnormal mental behaviour. In the multiple logistic regression analyses measured exposure to RF fields in the highest quartile was associated to overall behavioural problems for adolescents (OR 2.2; 95% CI 1.1-4.5) but not for children (1.3; 0.7-2.6). These results are mainly driven by one subscale, as the results showed an association between exposure and conduct problems for adolescents (3.7; 1.6-8.4) and children (2.9; 1.4-5.9). As this is one of the first studies that investigated an association between exposure to mobile telecommunication networks and mental health behaviour more studies using personal dosimetry are warranted to confirm these findings. PMID:19960235
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
On the fundamental sloshing frequency in the ice-fishing problem
NASA Astrophysics Data System (ADS)
Kozlov, Vladimir; Kuznetsov, Nikolay
2002-11-01
The sloshing problem is considered in a half-space covered by a rigid dock with apertures. The dependence of the fundamental sloshing frequency on the shape of the free surface region is studied. It is proved that the inequality holds between the fundamental eigenvalues corresponding to two different regions if some conditions are fulfilled. These conditions are verified for particular classes of regions of a fixed area in order to demonstrate that the disk yields the maximum of the fundamental eigenvalue for each of these classes. On the other hand, examples of regions are constructed for which the fundamental eigenfrequency is larger than that for the circular aperture of the same area and even as large as one wishes. To cite this article: V. Kozlov, N. Kuznetsov, C. R. Mecanique 330 (2002) 723-728.
Ethics, finance, and automation: a preliminary survey of problems in high frequency trading.
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. PMID:23138232
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.…
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
... above ground level of any commercially manufactured radiating transmission line when the transmission line is terminated in a non-radiating load and is routed at least 7 meters (20 feet) interior to the... structures. (5) Continuous carrier operations are prohibited on these frequencies. (6) Unless...
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
... frequency pair (watts) Operational Fixed or Base 20 6 Mobile 6 6 Portable 2 2 (ii) The maximum antenna... this chapter; (ii) For any operational fixed, base or mobile station exceeding the low power or antenna... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Standards...
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
... frequency pair (watts) Operational Fixed or Base 20 6 Mobile 6 6 Portable 2 2 (ii) The maximum antenna... this chapter; (ii) For any operational fixed, base or mobile station exceeding the low power or antenna... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Standards...
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
... frequency pair (watts) Operational Fixed or Base 20 6 Mobile 6 6 Portable 2 2 (ii) The maximum antenna... this chapter; (ii) For any operational fixed, base or mobile station exceeding the low power or antenna... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Standards...
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
... frequency pair (watts) Operational Fixed or Base 20 6 Mobile 6 6 Portable 2 2 (ii) The maximum antenna... this chapter; (ii) For any operational fixed, base or mobile station exceeding the low power or antenna... COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND MOBILE RADIO SERVICES Standards...
Negotiating Assignment Pathways: Students and Academic Assignments
ERIC Educational Resources Information Center
McDowell, Liz
2008-01-01
Existing research identifies that students' approaches to assignments are related to their general approaches to study. It is suggested that students need to better understand the requirements of assignments and acquire new concepts such as "argument". This fine-grained study proposes four qualitatively distinct assignment pathways: gathering,…
ERIC Educational Resources Information Center
Parlante, Nick
2001-01-01
Describes a Web site called Nifty Assignments that offers assignments for computer science education. Topics include programming assignments; student appeal; appropriateness for high school classes; and links to other related Web sites. (LRW)
Miller, M M; Goto, R M; Taylor, R L; Zoorob, R; Auffray, C; Briles, R W; Briles, W E; Bloom, S E
1996-01-01
Rfp-Y is a second region in the genome of the chicken containing major histocompatibility complex (MHC) class I and II genes. Haplotypes of Rfp-Y assort independently from haplotypes of the B system, a region known to function as a MHC and to be located on chromosome 16 (a microchromosome) with the single nucleolar organizer region (NOR) in the chicken genome. Linkage mapping with reference populations failed to reveal the location of Rfp-Y, leaving Rfp-Y unlinked in a map containing >400 markers. A possible location of Rfp-Y became apparent in studies of chickens trisomic for chromosome 16 when it was noted that the intensity of restriction fragments associated with Rfp-Y increased with increasing copy number of chromosome 16. Further evidence that Rfp-Y might be located on chromosome 16 was obtained when individuals trisomic for chromosome 16 were found to transmit three Rfp-Y haplotypes. Finally, mapping of cosmid cluster III of the molecular map of chicken MHC genes (containing a MHC class II gene and two rRNA genes) to Rfp-Y validated the assignment of Rfp-Y to the MHC/NOR microchromosome. A genetic map can now be drawn for a portion of chicken chromosome 16 with Rfp-Y, encompassing two MHC class I and three MHC class II genes, separated from the B system by a region containing the NOR and exhibiting highly frequent recombination. Images Fig. 1 Fig. 2 Fig. 3 Fig. 4 PMID:8632997
Nadeau, Joshua M; Arnold, Elysse B; Keene, Amanda C; Collier, Amanda B; Lewin, Adam B; Murphy, Tanya K; Storch, Eric A
2015-08-01
Sleep-related problems (SRPs) are common and problematic among anxious youth but have not been investigated in anxious youth with autism spectrum disorder (ASD). Participants were 102 youth (ages 7-16 years) with ASD and comorbid anxiety. Youth and their primary caregiver were administered the Pediatric Anxiety Rating Scale. Parents completed the Multidimensional Anxiety Scale for Children-Parent (MASC-P) Report, Social Responsiveness Scale, and the Child Behavior Checklist (CBCL). A measure of SRPs was created from items from the CBCL and MASC-P. Results suggest SRPs were relatively common among youth with ASD and comorbid anxiety. The number of SRPs endorsed directly associated with parent ratings of social deficits, internalizing and externalizing symptoms, and anxiety symptoms, as well as with clinician-rated anxiety symptoms. Parent-rated internalizing symptoms predicted frequency of SRPs over and above social deficits, externalizing symptoms, and parent- and clinician-rated anxiety symptoms. A subset of 40 participants who completed family-based cognitive-behavioral therapy (CBT) experienced reduced SRPs following treatment. Implications, study limitations, and recommendations for future research are discussed. PMID:25239284
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
NASA Astrophysics Data System (ADS)
Śmiechowski, Maciej; Forbert, Harald; Marx, Dominik
2013-07-01
Ionic hydration is of fundamental relevance from chemical reactivity in aqueous solution to biomolecular function at physiological conditions. Vibrational spectroscopy belongs to the most widely used experimental methods in studies of solvation phenomena. There is, however, still limited molecular understanding as to how the vibrational response of solutions is modulated by the presence of solvation shells around solutes, i.e., by interfacial water. Liquid-state THz spectroscopy has been demonstrated to be able to detect even small solute-induced changes of the hydrogen bond dynamics at the solute-water interface. In many cases it reveals rather long-ranged dynamical correlations around solutes, involving many solvent molecules, that can be tackled theoretically by analyzing vibrational spectra in a distance-resolved manner. Here, several spatial decomposition schemes for infrared spectra are used to reveal the distinct distance- and frequency-dependent contributions of the solvation shells to the spectral response in aqueous solutions of Li+ and F-. The importance of an explicit representation of the solute's electronic structure for the proper description of solute-solvent polarization effects is demonstrated. The solvent's response to the presence of the solute is systematically disentangled and reveals important differences between the spectral responses due to intra- and intermolecular motion as probed in the mid- and far-infrared spectral windows, respectively.
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…
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).
[Some problems in measuring the frequency-resolving power of hearing].
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. PMID:15552366
Some problems in the measurement of the frequency-resolving ability of hearing.
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. PMID:16132266
Khan, T.; Ramuhalli, Pradeep; Dass, Sarat
2011-06-30
Flaw profile characterization from NDE measurements is a typical inverse problem. A novel transformation of this inverse problem into a tracking problem, and subsequent application of a sequential Monte Carlo method called particle filtering, has been proposed by the authors in an earlier publication [1]. In this study, the problem of flaw characterization from multi-sensor data is considered. The NDE inverse problem is posed as a statistical inverse problem and particle filtering is modified to handle data from multiple measurement modes. The measurement modes are assumed to be independent of each other with principal component analysis (PCA) used to legitimize the assumption of independence. The proposed particle filter based data fusion algorithm is applied to experimental NDE data to investigate its feasibility.
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)
47 CFR 78.18 - Frequency assignments.
Code of Federal Regulations, 2013 CFR
2013-10-01
... channel. Editorial Note: For Federal Register citations affecting § 78.18, see the List of CFR Sections... with the indicated polarization: (1) For CARS stations using FM transmission: Group A Channels...-13.175 A20 1 2 13.170-13.200 1 Appropriate polarization designation: H=Horizontally...
47 CFR 78.18 - Frequency assignments.
Code of Federal Regulations, 2012 CFR
2012-10-01
... channel. Editorial Note: For Federal Register citations affecting § 78.18, see the List of CFR Sections... with the indicated polarization: (1) For CARS stations using FM transmission: Group A Channels...-13.175 A20 1 2 13.170-13.200 1 Appropriate polarization designation: H=Horizontally...
47 CFR 78.18 - Frequency assignments.
Code of Federal Regulations, 2014 CFR
2014-10-01
... channel. Editorial Note: For Federal Register citations affecting § 78.18, see the List of CFR Sections... with the indicated polarization: (1) For CARS stations using FM transmission: Group A Channels...-13.175 A20 1 2 13.170-13.200 1 Appropriate polarization designation: H=Horizontally...
47 CFR 78.18 - Frequency assignments.
Code of Federal Regulations, 2011 CFR
2011-10-01
... channel. Editorial Note: For Federal Register citations affecting § 78.18, see the List of CFR Sections... with the indicated polarization: (1) For CARS stations using FM transmission: Group A Channels...-13.175 A20 1 2 13.170-13.200 1 Appropriate polarization designation: H=Horizontally...
47 CFR 78.18 - Frequency assignments.
Code of Federal Regulations, 2010 CFR
2010-10-01
... channel. Editorial Note: For Federal Register citations affecting § 78.18, see the List of CFR Sections... with the indicated polarization: (1) For CARS stations using FM transmission: Group A Channels...-13.175 A20 1 2 13.170-13.200 1 Appropriate polarization designation: H=Horizontally...
47 CFR 74.602 - Frequency assignment.
Code of Federal Regulations, 2013 CFR
2013-10-01
...) Editorial Note: For Federal Register citations affecting § 74.602, see the List of CFR Sections Affected...) Maximum EIRP is limited to 35 dBW; (ii) Transmitting antenna beamwidth is limited to 25 degrees...
47 CFR 74.602 - Frequency assignment.
Code of Federal Regulations, 2010 CFR
2010-10-01
... § 74.602, see the List of CFR Sections Affected, which appears in the Finding Aids section of the...; (ii) Transmitting antenna beamwidth is limited to 25 degrees (measured at the 3 dB points); and...
47 CFR 74.602 - Frequency assignment.
Code of Federal Regulations, 2011 CFR
2011-10-01
... § 74.602, see the List of CFR Sections Affected, which appears in the Finding Aids section of the...; (ii) Transmitting antenna beamwidth is limited to 25 degrees (measured at the 3 dB points); and...
NASA Astrophysics Data System (ADS)
Argeso, Hakan; Mengi, Yalcin
2014-02-01
A unified formulation is presented, based on the boundary element method, to perform the interaction analysis for the problems involving poroviscoelastic media. The proposed formulation permits the evaluation of all the elements of impedance and input motion matrices at a single step in terms of system matrices of boundary element method without solving any special problem, such as, unit displacement or load problem, as required by conventional methods. It further eliminates the complicated procedure and the need for using scattering analysis in the evaluation of input motion functions. The formulation is explained by considering a simple interaction problem involving an inclusion embedded in an infinite poroviscoelastic medium, which is under the influence of a dynamic excitation induced by seismic waves. In the formulation, an impedance relation is established for this interaction problem, suitable for performing the interaction analysis by substructure method, which permits carrying out the analysis for inclusion and its surrounding medium separately. The inclusion is first treated as poroviscoelastic, then viscoelastic and finally rigid, where the formulation in each of these cases is obtained consecutively as a special case of the previous one. It is remarkable to note that, a cavity problem where there is a hole in place of inclusion can be also considered within the framework of the present formulation. The formulation is assessed by applying it to some sample problems. The extension of the formulation to other types of interaction problems, such as, multi-inclusion problems, the analyses of foundations supported by a poroviscoelastic medium, etc., will be the subject of a separate study.
NASA Astrophysics Data System (ADS)
Plachenov, A. B.
An algorithm is proposed for the transition from the short-wave asymptotics of stationary problems to the space-time asymptotics of nonstationary problems of linear wave propagation. The relationship between this algorithm and constructs of the spatial-temporal ray tracing method is examined. As an example, the algorithm is applied to the problem of the detection of a diffraction wave in the deep shade behind a smooth convex obstacle in the case where the incident wave is specified by its spatial-temporal ray expansion.
NASA Astrophysics Data System (ADS)
Kandaurova, Gerta S.
2002-10-01
Research into the phenomenon of dynamic self-organization and the excited ('anger') state of multidomain magnetic films with perpendicular anisotropy is reviewed. The phenomenon was dicsovered in 1988 when studying the domain structure of iron garnet films in low-frequency (0.1-10 kHz) ac magnetic fields.
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
Otero, José; Palacios, Ana; Suárez, Rosario; Junco, Luis; Couso, Inés; Sánchez, Luciano
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
Using Cognitive Science to Assign Test Weights.
ERIC Educational Resources Information Center
Bhaskar, R.; Dillard, Jesse F.
1983-01-01
Description of an objective method for assigning weights to questions on examinations includes discussions of classical test theory, knowledge organization, and how task analysis can be used to identify knowledge elements required to solve specific problems, rank them, and assign objective weights to exam questions using a Pareto distribution (7…
Scaling Preference Data for Program Assignments.
ERIC Educational Resources Information Center
Carifio, James
The present study devised a computerized assignment-by-preference algorithm for a ninth-grade exploratory curriculum. The problem addressed was one of maximally mapping all students into 8 of 12 vocational programs in terms of their preferences for studying each of the programs and the assignment restrictions established by the school. To minimize…
NASA Astrophysics Data System (ADS)
Fominov, Ya. V.; Tanaka, Y.; Asano, Y.; Eschrig, M.
2015-04-01
We consider physical properties of a superconductor with a recently proposed type of odd-frequency pairing that exhibits diamagnetic Meissner response ("odd-dia state"). Such a state was suggested in order to address stability issues arising in an odd-frequency superconducting state with paramagnetic Meissner response ("odd-para state"). Assuming the existence of an odd-dia state (due to a proper retarded interaction), we study its coexistence with an odd-para state. The latter is known to be generated as an induced superconducting component in, e.g., singlet superconductor/ferromagnet proximity structures or triplet superconductor/normal metal systems. Calculating the superfluid density of the mixed odd-para/odd-dia state and the Josephson current between the odd-para and odd-dia states, we find that the expressions for the currents in both cases have nonvanishing imaginary contributions and are therefore unphysical. We show that a realization of the odd-dia state implies the absence of a Hamiltonian description of the system, and suggest that there exists no physically realizable perturbation that could give rise to the spontaneous symmetry breaking necessary for an actual realization of the odd-dia superconducting state.
Solving the EEG inverse problem based on space-time-frequency structured sparsity constraints.
Castaño-Candamil, Sebastián; Höhne, Johannes; Martínez-Vargas, Juan-David; An, Xing-Wei; Castellanos-Domínguez, German; Haufe, Stefan
2015-09-01
We introduce STOUT (spatio-temporal unifying tomography), a novel method for the source analysis of electroencephalograpic (EEG) recordings, which is based on a physiologically-motivated source representation. Our method assumes that only a small number of brain sources are active throughout a measurement, where each of the sources exhibits focal (smooth but localized) characteristics in space, time and frequency. This structure is enforced through an expansion of the source current density into appropriate spatio-temporal basis functions in combination with sparsity constraints. This approach combines the main strengths of two existing methods, namely Sparse Basis Field Expansions (Haufe et al., 2011) and Time-Frequency Mixed-Norm Estimates (Gramfort et al., 2013). By adjusting the ratio between two regularization terms, STOUT is capable of trading temporal for spatial reconstruction accuracy and vice versa, depending on the requirements of specific analyses and the provided data. Due to allowing for non-stationary source activations, STOUT is particularly suited for the localization of event-related potentials (ERP) and other evoked brain activity. We demonstrate its performance on simulated ERP data for varying signal-to-noise ratios and numbers of active sources. Our analysis of the generators of visual and auditory evoked N200 potentials reveals that the most active sources originate in the temporal and occipital lobes, in line with the literature on sensory processing. PMID:26048621
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).
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
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…
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.
NASA Astrophysics Data System (ADS)
Brinkmeier, Maik; Nackenhorst, Udo
2008-03-01
The transient dynamic response of rolling tires is of essential importance for comfort questions, e.g. noise radiation. Whereas finite element models are well established for stationary rolling simulations, it lacks computational methods for the treatment of the high frequency response. One challenge is the large mode density of tire structures that is up to the acoustic frequency domain and another lies on the physically correct description of rolling (gyroscopic) structures. Despite that the eigenvalue analysis of gyroscopic systems, described by complex-valued quadratic eigenvalue systems, seems to be well understood in general, specific problems arise for the computability of large scale three-dimensional tire models. In this presentation an overall computational strategy for the high frequency response of FE-tire models is outlined, where special emphasis is placed upon the efficient numerical treatment of the complex-valued eigenproblems for large scale gyroscopic systems. The practicability of the proposed approach will be demonstrated by the analysis of detailed finite element tire models. The physical interpretation of the computational results is also discussed in detail.
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)
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...
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.
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…
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.
Target assignment of simultaneous arrival for UAVs
NASA Astrophysics Data System (ADS)
Xia, Jie; Gao, Jinyuan
2003-09-01
The Extend Hungary Method (EHM) is presented to solve the assignment problem that the number of UAVs is larger than that of targets. The target assignment is modeling and the motivations are minimize the distance of the UAV fleet, maximize the survivability of the UAV fleet, maximize the number of UAVs assigned to each target and maximize the number of target attacked. An algorithm for arriving simultaneously is presented by combination of the EHM. Simulation results demonstrating the feasibility of the approach are presented. The approach could be easily applied into other multi-robot cooperative mission.
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…
ERIC Educational Resources Information Center
Hebert, Margaret; And Others
1991-01-01
Contains seven brief articles which offer assignments designed to help students perform job searches, write job application letters, answer difficult questions, write letters of resignation, alleviate fears of public speaking, use the interview effectively in the business communication, and develop listening skills. (PRA)
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…
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 that narrates the…
NASA Astrophysics Data System (ADS)
Klibanov, Michael V.; Timonov, Alexandre
2001-12-01
Some coefficient inverse problems of electromagnetic frequency sounding of inhomogeneous media are considered. Such problems occur in many areas of applied physics, such as the geophysical exploration of gas, oil and mineral deposits, reservoir monitoring, marine acoustics and electromagnetics, optical sensing, and radio physics. Reformulating these problems in terms of nonlinear least squares, also known in the applied literature as matched field processing, often leads to a multiextremal and multidimensional objective function. This makes it extremely difficult to find its global extremum which corresponds to the solution of the original problem. It is shown in this paper that an inverse problem of frequency sounding can first be identically transformed to a certain boundary value problem which does not explicitly contain an unknown coefficient. The nonlinear least squares are then applied to the transformed problem. Using the weight functions associated with the Carleman estimates for the Laplace operator, an objective function is constructed in such a way that it is strictly convex on a certain compact set. The feasibility of the proposed approach is demonstrated in computational experiments with a model problem of magnetotelluric frequency sounding of layered media.
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.
NASA Astrophysics Data System (ADS)
Angelo, Joseph P.; Bigio, Irving J.; Gioux, Sylvain
2016-03-01
Imaging technologies working in the spatial frequency domain are becoming increasingly popular for generating wide-field optical property maps, enabling further analysis of tissue parameters such as absorption or scattering. While acquisition methods have witnessed a very rapid growth and are now performing in real-time, processing methods are yet slow preventing information to be acquired and displayed in real-time. In this work, we present solutions for rapid inverse problem solving for optical properties by use of advanced look-up tables. In particular, we present methods and results from a dense, linearized look-up table and an analytical representation that currently run 100 times faster than the standard method and within 10% in both absorption and scattering. With the resulting computation time in the tens of milliseconds range, the proposed techniques enable video-rate feedback of real-time techniques such as snapshot of optical properties (SSOP) imaging, making full video-rate guidance in the clinic possible.
Vibrational assignments of 2-iodopyridine
NASA Astrophysics Data System (ADS)
Sortur, Veenasangeeta; Yenagi, Jayashree; Tonannavar, J.
2008-02-01
A review of the vibrational assignments for 2-iodopyridine has been proposed based on the FT-Raman (3500-50 cm -1) and IR (4000-400 cm -1) spectral measurements. Equilibrium geometries and vibrational frequencies have been computed from a variety of electronic structure methods: the ab initio (RHF), six DFT (BLYP, BP86, B3LYP, B3P86, B3PW91 and SVWN) and MP2 methods using 3-21G*, LANL2DZ and DGDZVP basis sets. A normal coordinate analysis has been carried out: the normal modes and their couplings are characterized in terms of potential energy distributions (PEDs). The comparison of assignments for pyridine and halopyridines shows that several of the normal modes arise from coupled vibrations in 2-iodopyridine. The BP86 and B3LYP methods with LANL2DZ basis set have performed reasonably well in reproducing the observed spectra, demonstrating that the LANL2DZ basis set (with effective core potential representations of electrons near the nuclei for post-third row atoms) is suitable for 2-iodopyridine.
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…
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…
Pathways to Assignment of Payees
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
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…
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
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…
Fair Assignment of Responsibilities.
ERIC Educational Resources Information Center
Yeaman, Andrew R. J.
1994-01-01
Focuses on the principle of the Association of Educational Communications and Technology (AECT) Code of Professional Ethics that deals with delegating tasks only to qualified personnel who have training or can demonstrate competency in performing the task. A problem illustrating the need for the principle and a discussion of its application are…
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…
Balanced input-output assignment
NASA Technical Reports Server (NTRS)
Gawronski, W.; Hadaegh, F. Y.
1989-01-01
Actuator/sensor locations and balanced representations of linear systems are considered for a given set of controllability and observability grammians. The case of equally controlled and observed states is given special attention. The assignability of grammians is examined, and the conditions for their existence are presented, along with several algorithms for their determination. Although an arbitrary positive semidefinite matrix is not always assignable, the identity grammian is shown to be always assignable. The results are extended to the case of flexible structures.
On Automated Grading of Programming Assignments in an Academic Institution
ERIC Educational Resources Information Center
Cheang, Brenda; Kurnia, Andy; Lim, Andrew; Oon, Wee-Chong
2003-01-01
Practise is one of the most important steps in learning the art of computer programming. Unfortunately, human grading of programming assignments is a tedious and error-prone task, a problem compounded by the large enrolments of many programming courses. As a result, students in such courses tend to be given fewer programming assignments than…
Supervising Unsuccessful Student Teaching Assignments: Two Terminator's Tales.
ERIC Educational Resources Information Center
St. Maurice, Henry
2001-01-01
Discusses problems that arise when there is a conflict between a student teacher and the supervising teacher and when a student teacher does not perform satisfactorily. Focuses on how supervisors deal with failed assignments and how beginning teachers improve their teaching and learn from failed assignments. (Contains 21 references.) (JOW)
Automated protein NMR resonance assignments.
Wan, Xiang; Xu, Dong; Slupsky, Carolyn M; Lin, Guohui
2003-01-01
NMR resonance peak assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protein sequence, providing the prerequisite for establishing intra- and inter-residue spatial relationships between atoms. The assignment process is tedious and time-consuming, which could take many weeks. Though there exist a number of computer programs to assist the assignment process, many NMR labs are still doing the assignments manually to ensure quality. This paper presents (1) a new scoring system for mapping spin systems to residues, (2) an automated adjacency information extraction procedure from NMR spectra, and (3) a very fast assignment algorithm based on our previous proposed greedy filtering method and a maximum matching algorithm to automate the assignment process. The computational tests on 70 instances of (pseudo) experimental NMR data of 14 proteins demonstrate that the new score scheme has much better discerning power with the aid of adjacency information between spin systems simulated across various NMR spectra. Typically, with automated extraction of adjacency information, our method achieves nearly complete assignments for most of the proteins. The experiment shows very promising perspective that the fast automated assignment algorithm together with the new score scheme and automated adjacency extraction may be ready for practical use. PMID:16452794
42 CFR 433.146 - Rights assigned; assignment method.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 42 Public Health 4 2013-10-01 2013-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL ASSISTANCE PROGRAMS STATE FISCAL ADMINISTRATION Third Party...
42 CFR 433.146 - Rights assigned; assignment method.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 42 Public Health 4 2011-10-01 2011-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL ASSISTANCE PROGRAMS STATE FISCAL ADMINISTRATION Third Party...
42 CFR 433.146 - Rights assigned; assignment method.
Code of Federal Regulations, 2014 CFR
2014-10-01
... 42 Public Health 4 2014-10-01 2014-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL ASSISTANCE PROGRAMS STATE FISCAL ADMINISTRATION Third Party...
42 CFR 433.146 - Rights assigned; assignment method.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 42 Public Health 4 2012-10-01 2012-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL ASSISTANCE PROGRAMS STATE FISCAL ADMINISTRATION Third Party...