Optimal erasure protection for scalably compressed video streams with limited retransmission.
Taubman, David; Thie, Johnson
2005-08-01
This paper shows how the priority encoding transmission (PET) framework may be leveraged to exploit both unequal error protection and limited retransmission for RD-optimized delivery of streaming media. Previous work on scalable media protection with PET has largely ignored the possibility of retransmission. Conversely, the PET framework has not been harnessed by the substantial body of previous work on RD optimized hybrid forward error correction/automatic repeat request schemes. We limit our attention to sources which can be modeled as independently compressed frames (e.g., video frames), where each element in the scalable representation of each frame can be transmitted in one or both of two transmission slots. An optimization algorithm determines the level of protection which should be assigned to each element in each slot, subject to transmission bandwidth constraints. To balance the protection assigned to elements which are being transmitted for the first time with those which are being retransmitted, the proposed algorithm formulates a collection of hypotheses concerning its own behavior in future transmission slots. We show how the PET framework allows for a decoupled optimization algorithm with only modest complexity. Experimental results obtained with Motion JPEG2000 compressed video demonstrate that substantial performance benefits can be obtained using the proposed framework.
New optimization model for routing and spectrum assignment with nodes insecurity
NASA Astrophysics Data System (ADS)
Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli
2017-04-01
By adopting the orthogonal frequency division multiplexing technology, elastic optical networks can provide the flexible and variable bandwidth allocation to each connection request and get higher spectrum utilization. The routing and spectrum assignment problem in elastic optical network is a well-known NP-hard problem. In addition, information security has received worldwide attention. We combine these two problems to investigate the routing and spectrum assignment problem with the guaranteed security in elastic optical network, and establish a new optimization model to minimize the maximum index of the used frequency slots, which is used to determine an optimal routing and spectrum assignment schemes. To solve the model effectively, a hybrid genetic algorithm framework integrating a heuristic algorithm into a genetic algorithm is proposed. The heuristic algorithm is first used to sort the connection requests and then the genetic algorithm is designed to look for an optimal routing and spectrum assignment scheme. In the genetic algorithm, tailor-made crossover, mutation and local search operators are designed. Moreover, simulation experiments are conducted with three heuristic strategies, and the experimental results indicate that the effectiveness of the proposed model and algorithm framework.
TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks
Song, W.-Z.; Huang, R.; Shirazi, B.; Husent, R.L.
2009-01-01
Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This motivates us to design an innovative localized TDMA MAC protocol to achieve high throughput and low congestion in data collection sensor networks, besides energy conservation. TreeMAC divides a time cycle into frames and frame into slots. Parent determines children's frame assigmnent based on their relative bandwidth demand, and each node calculates its own slot assignment based on its hop-count to the sink. This innovative 2-dimensional frame-slot assignment algorithm has the following nice theory properties. Firstly, given any node, at any time slot, there is at most one active sender in its neighborhood (includ ing itself). Secondly, the packet scheduling with TreelMAC is bufferless, which therefore minimizes the probability of network congestion. Thirdly, the data throughput to gateway is at least 1/3 of the optimum assuming reliable links. Our experiments on a 24 node test bed demonstrate that TreeMAC protocol significantly improves network throughput and energy efficiency, by comparing to the TinyOS's default CSMA MAC protocol and a recent TDMA MAC protocol Funneling-MAC[8]. ?? 2009 IEEE.
TraPy-MAC: Traffic Priority Aware Medium Access Control Protocol for Wireless Body Area Network.
Ullah, Fasee; Abdullah, Abdul Hanan; Kaiwartya, Omprakash; Cao, Yue
2017-06-01
Recently, Wireless Body Area Network (WBAN) has witnessed significant attentions in research and product development due to the growing number of sensor-based applications in healthcare domain. Design of efficient and effective Medium Access Control (MAC) protocol is one of the fundamental research themes in WBAN. Static on-demand slot allocation to patient data is the main approach adopted in the design of MAC protocol in literature, without considering the type of patient data specifically the level of severity on patient data. This leads to the degradation of the performance of MAC protocols considering effectiveness and traffic adjustability in realistic medical environments. In this context, this paper proposes a Traffic Priority-Aware MAC (TraPy-MAC) protocol for WBAN. It classifies patient data into emergency and non-emergency categories based on the severity of patient data. The threshold value aided classification considers a number of parameters including type of sensor, body placement location, and data transmission time for allocating dedicated slots patient data. Emergency data are not required to carry out contention and slots are allocated by giving the due importance to threshold value of vital sign data. The contention for slots is made efficient in case of non-emergency data considering threshold value in slot allocation. Moreover, the slot allocation to emergency and non-emergency data are performed parallel resulting in performance gain in channel assignment. Two algorithms namely, Detection of Severity on Vital Sign data (DSVS), and ETS Slots allocation based on the Severity on Vital Sign (ETS-SVS) are developed for calculating threshold value and resolving the conflicts of channel assignment, respectively. Simulations are performed in ns2 and results are compared with the state-of-the-art MAC techniques. Analysis of results attests the benefit of TraPy-MAC in comparison with the state-of-the-art MAC in channel assignment in realistic medical environments.
14 CFR 93.223 - Slot withdrawal.
Code of Federal Regulations, 2010 CFR
2010-01-01
... shall assign, by random lottery, withdrawal priority numbers for the recall priority of slots at each... that slot or one acquired by trade of that slot, if the resulting total of slots held or operated at...
TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks
Song, W.-Z.; Huang, R.; Shirazi, B.; LaHusen, R.
2009-01-01
Earlier sensor network MAC protocols focus on energy conservation in low-duty cycle applications, while some recent applications involve real-time high-data-rate signals. This motivates us to design an innovative localized TDMA MAC protocol to achieve high throughput and low congestion in data collection sensor networks, besides energy conservation. TreeMAC divides a time cycle into frames and each frame into slots. A parent node determines the children's frame assignment based on their relative bandwidth demand, and each node calculates its own slot assignment based on its hop-count to the sink. This innovative 2-dimensional frame-slot assignment algorithm has the following nice theory properties. First, given any node, at any time slot, there is at most one active sender in its neighborhood (including itself). Second, the packet scheduling with TreeMAC is bufferless, which therefore minimizes the probability of network congestion. Third, the data throughput to the gateway is at least 1/3 of the optimum assuming reliable links. Our experiments on a 24-node testbed show that TreeMAC protocol significantly improves network throughput, fairness, and energy efficiency compared to TinyOS's default CSMA MAC protocol and a recent TDMA MAC protocol Funneling-MAC. Partial results of this paper were published in Song, Huang, Shirazi and Lahusen [W.-Z. Song, R. Huang, B. Shirazi, and R. Lahusen, TreeMAC: Localized TDMA MAC protocol for high-throughput and fairness in sensor networks, in: The 7th Annual IEEE International Conference on Pervasive Computing and Communications, PerCom, March 2009]. Our new contributions include analyses of the performance of TreeMAC from various aspects. We also present more implementation detail and evaluate TreeMAC from other aspects. ?? 2009 Elsevier B.V.
Collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation
NASA Astrophysics Data System (ADS)
Yang, Shangwen; Guo, Baohua; Xiao, Xuefei; Gao, Haichao
2018-01-01
To allocate the en-routes and slots to the flights with collaborative decision making, a collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation was proposed. Evaluation indexes include flight delay costs, delay time and the number of turning points. Analytic hierarchy process is applied to determining index weights. Remark set for current two flights not yet obtained the en-route and slot in flight schedule is established. Then, fuzzy comprehensive evaluation is performed, and the en-route and slot for the current two flights are determined. Continue selecting the flight not yet obtained an en-route and a slot in flight schedule. Perform fuzzy comprehensive evaluation until all flights have obtained the en-routes and slots. MatlabR2007b was applied to numerical test based on the simulated data of a civil en-route. Test results show that, compared with the traditional strategy of first come first service, the algorithm gains better effect. The effectiveness of the algorithm was verified.
Centralized Routing and Scheduling Using Multi-Channel System Single Transceiver in 802.16d
NASA Astrophysics Data System (ADS)
Al-Hemyari, A.; Noordin, N. K.; Ng, Chee Kyun; Ismail, A.; Khatun, S.
This paper proposes a cross-layer optimized strategy that reduces the effect of interferences from neighboring nodes within a mesh networks. This cross-layer design relies on the routing information in network layer and the scheduling table in medium access control (MAC) layer. A proposed routing algorithm in network layer is exploited to find the best route for all subscriber stations (SS). Also, a proposed centralized scheduling algorithm in MAC layer is exploited to assign a time slot for each possible node transmission. The cross-layer optimized strategy is using multi-channel single transceiver and single channel single transceiver systems for WiMAX mesh networks (WMNs). Each node in WMN has a transceiver that can be tuned to any available channel for eliminating the secondary interference. Among the considered parameters in the performance analysis are interference from the neighboring nodes, hop count to the base station (BS), number of children per node, slot reuse, load balancing, quality of services (QoS), and node identifier (ID). Results show that the proposed algorithms significantly improve the system performance in terms of length of scheduling, channel utilization ratio (CUR), system throughput, and average end to end transmission delay.
High capacity low delay packet broadcasting multiaccess schemes for satellite repeater systems
NASA Astrophysics Data System (ADS)
Bose, S. K.
1980-12-01
Demand assigned packet radio schemes using satellite repeaters can achieve high capacities but often exhibit relatively large delays under low traffic conditions when compared to random access. Several schemes which improve delay performance at low traffic but which have high capacity are presented and analyzed. These schemes allow random acess attempts by users, who are waiting for channel assignments. The performance of these are considered in the context of a multiple point communication system carrying fixed length messages between geographically distributed (ground) user terminals which are linked via a satellite repeater. Channel assignments are done following a BCC queueing discipline by a (ground) central controller on the basis of requests correctly received over a collision type access channel. In TBACR Scheme A, some of the forward message channels are set aside for random access transmissions; the rest are used in a demand assigned mode. Schemes B and C operate all their forward message channels in a demand assignment mode but, by means of appropriate algorithms for trailer channel selection, allow random access attempts on unassigned channels. The latter scheme also introduces framing and slotting of the time axis to implement a more efficient algorithm for trailer channel selection than the former.
Model and algorithm for container ship stowage planning based on bin-packing problem
NASA Astrophysics Data System (ADS)
Zhang, Wei-Ying; Lin, Yan; Ji, Zhuo-Shang
2005-09-01
In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem (CSSP) is regarded as “packing problem”, ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics (homogeneous containers group) are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows. The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.
On Channel-Discontinuity-Constraint Routing in Wireless Networks☆
Sankararaman, Swaminathan; Efrat, Alon; Ramasubramanian, Srinivasan; Agarwal, Pankaj K.
2011-01-01
Multi-channel wireless networks are increasingly deployed as infrastructure networks, e.g. in metro areas. Network nodes frequently employ directional antennas to improve spatial throughput. In such networks, between two nodes, it is of interest to compute a path with a channel assignment for the links such that the path and link bandwidths are the same. This is achieved when any two consecutive links are assigned different channels, termed as “Channel-Discontinuity-Constraint” (CDC). CDC-paths are also useful in TDMA systems, where, preferably, consecutive links are assigned different time-slots. In the first part of this paper, we develop a t-spanner for CDC-paths using spatial properties; a sub-network containing O(n/θ) links, for any θ > 0, such that CDC-paths increase in cost by at most a factor t = (1−2 sin (θ/2))−2. We propose a novel distributed algorithm to compute the spanner using an expected number of O(n log n) fixed-size messages. In the second part, we present a distributed algorithm to find minimum-cost CDC-paths between two nodes using O(n2) fixed-size messages, by developing an extension of Edmonds’ algorithm for minimum-cost perfect matching. In a centralized implementation, our algorithm runs in O(n2) time improving the previous best algorithm which requires O(n3) running time. Moreover, this running time improves to O(n/θ) when used in conjunction with the spanner developed. PMID:24443646
NASA Astrophysics Data System (ADS)
Wang, Fu; Liu, Bo; Zhang, Lijia; Jin, Feifei; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun
2017-03-01
The wavelength-division multiplexing passive optical network (WDM-PON) is a potential technology to carry multiple services in an optical access network. However, it has the disadvantages of high cost and an immature technique for users. A software-defined WDM/time-division multiplexing PON was proposed to meet the requirements of high bandwidth, high performance, and multiple services. A reasonable and effective uplink dynamic bandwidth allocation algorithm was proposed. A controller with dynamic wavelength and slot assignment was introduced, and a different optical dynamic bandwidth management strategy was formulated flexibly for services of different priorities according to the network loading. The simulation compares the proposed algorithm with the interleaved polling with adaptive cycle time algorithm. The algorithm shows better performance in average delay, throughput, and bandwidth utilization. The results show that the delay is reduced to 62% and the throughput is improved by 35%.
Tag-to-Tag Interference Suppression Technique Based on Time Division for RFID.
Khadka, Grishma; Hwang, Suk-Seung
2017-01-01
Radio-frequency identification (RFID) is a tracking technology that enables immediate automatic object identification and rapid data sharing for a wide variety of modern applications using radio waves for data transmission from a tag to a reader. RFID is already well established in technical areas, and many companies have developed corresponding standards and measurement techniques. In the construction industry, effective monitoring of materials and equipment is an important task, and RFID helps to improve monitoring and controlling capabilities, in addition to enabling automation for construction projects. However, on construction sites, there are many tagged objects and multiple RFID tags that may interfere with each other's communications. This reduces the reliability and efficiency of the RFID system. In this paper, we propose an anti-collision algorithm for communication between multiple tags and a reader. In order to suppress interference signals from multiple neighboring tags, the proposed algorithm employs the time-division (TD) technique, where tags in the interrogation zone are assigned a specific time slot so that at every instance in time, a reader communicates with tags using the specific time slot. We present representative computer simulation examples to illustrate the performance of the proposed anti-collision technique for multiple RFID tags.
A PML-FDTD ALGORITHM FOR SIMULATING PLASMA-COVERED CAVITY-BACKED SLOT ANTENNAS. (R825225)
A three-dimensional frequency-dependent finite-difference time-domain (FDTD) algorithm with perfectly matched layer (PML) absorbing boundary condition (ABC) and recursive convolution approaches is developed to model plasma-covered open-ended waveguide or cavity-backed slot antenn...
Congestion Pricing for Aircraft Pushback Slot Allocation.
Liu, Lihua; Zhang, Yaping; Liu, Lan; Xing, Zhiwei
2017-01-01
In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the "external cost of surface congestion" is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm.
Congestion Pricing for Aircraft Pushback Slot Allocation
Zhang, Yaping
2017-01-01
In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the “external cost of surface congestion” is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm. PMID:28114429
NASA Astrophysics Data System (ADS)
Covey, John; Chen, Ray T.
2014-03-01
Grating couplers are ideal for coupling into the tightly confined propagation modes of semiconductor waveguides. In addition, nonlinear optics has benefited from the sub-diffraction limit confinement of horizontal slot waveguides. By combining these two advancements, slot-based nonlinear optics with mode areas less than 0.02 μm2 can become as routine as twisting fiber connectors together. Surface normal fiber alignment to a chip is also highly desirable from time, cost, and manufacturing considerations. To meet these considerable design challenges, a custom genetic algorithm is created which, starting from purely random designs, creates a unique four stage grating coupler for two novel horizontal slot waveguide platforms. For horizontal multiple-slot waveguides filled with silicon nanocrystal, a theoretical fiber-towaveguide coupling efficiency of 68% is obtained. For thin silicon waveguides clad with optically active silicon nanocrystal, known as cover-slot waveguides, a theoretical fiber-to-waveguide coupling efficiency of 47% is obtained, and 1 dB and 3 dB theoretical bandwidths of 70 nm and 150 nm are obtained, respectively. Both waveguide platforms are fabricated from scratch, and their respective on-chip grating couplers are experimentally measured from a standard single mode fiber array that is mounted surface normally. The horizontal multiple-slot grating coupler achieved an experimental 60% coupling efficiency, and the horizontal cover-slot grating coupler achieved an experimental 38.7% coupling efficiency, with an extrapolated 1 dB bandwidth of 66 nm. This report demonstrates the promise of genetic algorithm-based design by reducing to practice the first large bandwidth vertical grating coupler to a novel silicon nanocrystal horizontal cover-slot waveguide.
Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms
NASA Astrophysics Data System (ADS)
Kwok, Kwan S.; Driessen, Brian J.; Phillips, Cynthia A.; Tovey, Craig A.
1997-09-01
This work considers the problem of maximum utilization of a set of mobile robots with limited sensor-range capabilities and limited travel distances. The robots are initially in random positions. A set of robots properly guards or covers a region if every point within the region is within the effective sensor range of at least one vehicle. We wish to move the vehicles into surveillance positions so as to guard or cover a region, while minimizing the maximum distance traveled by any vehicle. This problem can be formulated as an assignment problem, in which we must optimally decide which robot to assign to which slot of a desired matrix of grid points. The cost function is the maximum distance traveled by any robot. Assignment problems can be solved very efficiently. Solution times for one hundred robots took only seconds on a silicon graphics crimson workstation. The initial positions of all the robots can be sampled by a central base station and their newly assigned positions communicated back to the robots. Alternatively, the robots can establish their own coordinate system with the origin fixed at one of the robots and orientation determined by the compass bearing of another robot relative to this robot. This paper presents example solutions to the multiple-target-multiple-agent scenario using a matching algorithm. Two separate cases with one hundred agents in each were analyzed using this method. We have found these mobile robot problems to be a very interesting application of network optimization methods, and we expect this to be a fruitful area for future research.
Abel, Francois [Rueschlikon, CH; Iliadis, Ilias [Rueschlikon, CH; Minkenberg, Cyriel J. A. [Adliswil, CH
2009-02-03
A method for allocating pending requests for data packet transmission at a number of inputs to a number of outputs of a switching system in successive time slots, including a matching method including the steps of providing a first request information in a first time slot indicating data packets at the inputs requesting transmission to the outputs of the switching system, performing a first step in the first time slot depending on the first request information to obtain a first matching information, providing a last request information in a last time slot successive to the first time slot, performing a last step in the last time slot depending on the last request information and depending on the first matching information to obtain a final matching information, and assigning the pending data packets at the number of inputs to the number of outputs based on the final matching information.
Departure Trajectory Synthesis and the Intercept Problem
NASA Technical Reports Server (NTRS)
Bolender, Michael A.; Slater, G. L.
1997-01-01
Two areas of the departure problem in air traffic control are discussed. The first topic is the generation of climb-out trajectories to a fix. The trajectories would be utilized by a scheduling algorithm to allocate runways, sequence the proposed departures, and assign a departure time. The second area is concerned with finding horizontal trajectories to merge aircraft from the TRACON to an open slot in the en-route environment. Solutions are presented for the intercept problem for two cases: (1) the aircraft is traveling at the speed of the aircraft in the jetway; (2) the merging aircraft has to accelerate to reach the speed of the aircraft in the en-route stream. An algorithm is given regarding the computation of a solution for the latter case. For the former, a set of equations is given that allows us to numerically solve for the coordinate where the merge will occur.
Memon, Muhammad Qasim; He, Jingsha; Yasir, Mirza Ammar; Memon, Aasma
2018-04-12
Radio frequency identification is a wireless communication technology, which enables data gathering and identifies recognition from any tagged object. The number of collisions produced during wireless communication would lead to a variety of problems including unwanted number of iterations and reader-induced idle slots, computational complexity in terms of estimation as well as recognition of the number of tags. In this work, dynamic frame adjustment and optimal splitting are employed together in the proposed algorithm. In the dynamic frame adjustment method, the length of frames is based on the quantity of tags to yield optimal efficiency. The optimal splitting method is conceived with smaller duration of idle slots using an optimal value for splitting level M o p t , where (M > 2), to vary slot sizes to get the minimal identification time for the idle slots. The application of the proposed algorithm offers the advantages of not going for the cumbersome estimation of the quantity of tags incurred and the size (number) of tags has no effect on its performance efficiency. Our experiment results show that using the proposed algorithm, the efficiency curve remains constant as the number of tags varies from 50 to 450, resulting in an overall theoretical gain in the efficiency of 0.032 compared to system efficiency of 0.441 and thus outperforming both dynamic binary tree slotted ALOHA (DBTSA) and binary splitting protocols.
Sheng, Xinzhi; Feng, Zhen; Li, Bing
2013-04-20
We proposed and experimentally demonstrated all-optical packet-level time slot assignment scheme with two optical buffers cascaded. The function of time-slot interchange (TSI) was successfully implemented on two and three optical packets at a data rate of 10 Gb/s. Therefore, the functions of TSI on N packets should be implemented easily by the use of N-1 stage optical buffer. On the basis of the above experiment, we carried out the TSI experiment on four packets with the same two-stage experimental setup. Furthermore, packets compression on three optical packets was also carried out with the same experimental setup. The shortest guard time of the packets compression can reach to 13 ns due to the limit of FPGA's control accuracy. Due to the use of the same optical buffer, the proposed scheme has the advantages of simple and scalable configuration, modularization, and easy integration.
Runway Operations Planning: A Two-Stage Heuristic Algorithm
NASA Technical Reports Server (NTRS)
Anagnostakis, Ioannis; Clarke, John-Paul
2003-01-01
The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.
Study on additional carrier sensing for IEEE 802.15.4 wireless sensor networks.
Lee, Bih-Hwang; Lai, Ruei-Lung; Wu, Huai-Kuei; Wong, Chi-Ming
2010-01-01
Wireless sensor networks based on the IEEE 802.15.4 standard are able to achieve low-power transmissions in the guise of low-rate and short-distance wireless personal area networks (WPANs). The slotted carrier sense multiple access with collision avoidance (CSMA/CA) is used for contention mechanism. Sensor nodes perform a backoff process as soon as the clear channel assessment (CCA) detects a busy channel. In doing so they may neglect the implicit information of the failed CCA detection and further cause the redundant sensing. The blind backoff process in the slotted CSMA/CA will cause lower channel utilization. This paper proposes an additional carrier sensing (ACS) algorithm based on IEEE 802.15.4 to enhance the carrier sensing mechanism for the original slotted CSMA/CA. An analytical Markov chain model is developed to evaluate the performance of the ACS algorithm. Both analytical and simulation results show that the proposed algorithm performs better than IEEE 802.15.4, which in turn significantly improves throughput, average medium access control (MAC) delay and power consumption of CCA detection.
A novel L-shaped linear ultrasonic motor operating in a single resonance mode
NASA Astrophysics Data System (ADS)
Zhang, Bailiang; Yao, Zhiyuan; Liu, Zhen; Li, Xiaoniu
2018-01-01
In this study, a large thrust linear ultrasonic motor using an L-shaped stator is described. The stator is constructed by two mutually perpendicular rectangular plate vibrators, one of which is mounted in parallel with the slider to make the motor structure to be more compact. The symmetric and antisymmetric modes of the stator based on the first order bending vibration of two vibrators are adopted, in which each resonance mode is assigned to drive the slider in one direction. The placement of piezoelectric ceramics in a stator could be determined by finite element analysis, and the influence of slots in the head block on the vibration amplitudes of driving foot was studied as well. Three types of prototypes (non-slotted, dual-slot, and single-slot) were fabricated and experimentally investigated. Experimental results demonstrated that the prototype with one slot exhibited the best mechanical output performance. The maximum loads under the excitation of symmetric mode and antisymmetric mode were 65 and 90 N, respectively.
A novel L-shaped linear ultrasonic motor operating in a single resonance mode.
Zhang, Bailiang; Yao, Zhiyuan; Liu, Zhen; Li, Xiaoniu
2018-01-01
In this study, a large thrust linear ultrasonic motor using an L-shaped stator is described. The stator is constructed by two mutually perpendicular rectangular plate vibrators, one of which is mounted in parallel with the slider to make the motor structure to be more compact. The symmetric and antisymmetric modes of the stator based on the first order bending vibration of two vibrators are adopted, in which each resonance mode is assigned to drive the slider in one direction. The placement of piezoelectric ceramics in a stator could be determined by finite element analysis, and the influence of slots in the head block on the vibration amplitudes of driving foot was studied as well. Three types of prototypes (non-slotted, dual-slot, and single-slot) were fabricated and experimentally investigated. Experimental results demonstrated that the prototype with one slot exhibited the best mechanical output performance. The maximum loads under the excitation of symmetric mode and antisymmetric mode were 65 and 90 N, respectively.
Preventing patient absenteeism: validation of a predictive overbooking model.
Reid, Mark W; Cohen, Samuel; Wang, Hank; Kaung, Aung; Patel, Anish; Tashjian, Vartan; Williams, Demetrius L; Martinez, Bibiana; Spiegel, Brennan M R
2015-12-01
To develop a model that identifies patients at high risk for missing scheduled appointments ("no-shows" and cancellations) and to project the impact of predictive overbooking in a gastrointestinal endoscopy clinic-an exemplar resource-intensive environment with a high no-show rate. We retrospectively developed an algorithm that uses electronic health record (EHR) data to identify patients who do not show up to their appointments. Next, we prospectively validated the algorithm at a Veterans Administration healthcare network clinic. We constructed a multivariable logistic regression model that assigned a no-show risk score optimized by receiver operating characteristic curve analysis. Based on these scores, we created a calendar of projected open slots to offer to patients and compared the daily performance of predictive overbooking with fixed overbooking and typical "1 patient, 1 slot" scheduling. Data from 1392 patients identified several predictors of no-show, including previous absenteeism, comorbid disease burden, and current diagnoses of mood and substance use disorders. The model correctly classified most patients during the development (area under the curve [AUC] = 0.80) and validation phases (AUC = 0.75). Prospective testing in 1197 patients found that predictive overbooking averaged 0.51 unused appointments per day versus 6.18 for typical booking (difference = -5.67; 95% CI, -6.48 to -4.87; P < .0001). Predictive overbooking could have increased service utilization from 62% to 97% of capacity, with only rare clinic overflows. Information from EHRs can accurately predict whether patients will no-show. This method can be used to overbook appointments, thereby maximizing service utilization while staying within clinic capacity.
Student-Led Objective Tutorial (SLOT) in Medical Education.
Sivagnanam, Gurusamy; Saraswathi, Simansalam; Rajasekaran, Aiyalu
2006-12-01
Purpose - To assess an innovative tutoring program named 'Student-Led Objective Tutorial' (SLOT) among undergraduate medical students. Method - The program was conceptualized by the Pharmacology Unit of Faculty of Medicine and Health Sciences, Asian Institute of Medicine Science & Technology (AIMST), Malaysia and implemented in the middle of 2005. A cohort of 246 medical undergraduate students (spread across 5 consecutive batches) participated. Following a brief explanation on the purpose and nature of SLOT, each batch was divided into small groups and was given a reading assignment on 4 previously delivered lecture topics. Each group was asked to prepare 3-5 multiple choice questions (MCQs) of their own in PowerPoint format to be presented, in turns, to the whole class on the day of SLOT. The proceedings were facilitated by 2 lecturers. Student feedback on the efficacy and benefits were assessed through an anonymous self administered questionnaire. Results - About 76% (188) of the students favored SLOT. The acceptance rate of SLOT was higher among males. There was no significant difference between batches in their opinions on whether to pursue SLOT in future. The most prevalent positive comment was that SLOT enhanced learning skills, and the negative comment being, it consumed more time. Conclusions - SLOT is a novel tutorial method which can offset faculty shortage with advantages like enhanced interest among teachers and learners, uniform reach of content, opportunities for group learning, and involvement of visual aids as teaching-learning (T-L) method. SLOT unraveled the students' potential of peer tutoring both inside as well as outside the classroom. Consumer tutors (students) can be tapped as a resource for SLOT for all subjects and courses in healthcare teaching.
Analyser-based mammography using single-image reconstruction.
Briedis, Dahliyani; Siu, Karen K W; Paganin, David M; Pavlov, Konstantin M; Lewis, Rob A
2005-08-07
We implement an algorithm that is able to decode a single analyser-based x-ray phase-contrast image of a sample, converting it into an equivalent conventional absorption-contrast radiograph. The algorithm assumes the projection approximation for x-ray propagation in a single-material object embedded in a substrate of approximately uniform thickness. Unlike the phase-contrast images, which have both directional bias and a bias towards edges present in the sample, the reconstructed images are directly interpretable in terms of the projected absorption coefficient of the sample. The technique was applied to a Leeds TOR[MAM] phantom, which is designed to test mammogram quality by the inclusion of simulated microcalcifications, filaments and circular discs. This phantom was imaged at varying doses using three modalities: analyser-based synchrotron phase-contrast images converted to equivalent absorption radiographs using our algorithm, slot-scanned synchrotron imaging and imaging using a conventional mammography unit. Features in the resulting images were then assigned a quality score by volunteers. The single-image reconstruction method achieved higher scores at equivalent and lower doses than the conventional mammography images, but no improvement of visualization of the simulated microcalcifications, and some degradation in image quality at reduced doses for filament features.
Novel ID-based anti-collision approach for RFID
NASA Astrophysics Data System (ADS)
Zhang, De-Gan; Li, Wen-Bin
2016-09-01
Novel correlation ID-based (CID) anti-collision approach for RFID under the banner of the Internet of Things (IOT) has been presented in this paper. The key insights are as follows: according to the deterministic algorithms which are based on the binary search tree, we propose a method to increase the association between tags so that tags can initiatively send their own ID under certain trigger conditions, at the same time, we present a multi-tree search method for querying. When the number of tags is small, by replacing the actual ID with the temporary ID, it can greatly reduce the number of times that the reader reads and writes to tag's ID. Active tags send data to the reader by the way of modulation binary pulses. When applying this method to the uncertain ALOHA algorithms, the reader can determine the locations of the empty slots according to the position of the binary pulse, so it can avoid the decrease in efficiency which is caused by reading empty slots when reading slots. Theory and experiment show that this method can greatly improve the recognition efficiency of the system when applied to either the search tree or the ALOHA anti-collision algorithms.
A network coding based routing protocol for underwater sensor networks.
Wu, Huayang; Chen, Min; Guan, Xin
2012-01-01
Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime.
A Network Coding Based Routing Protocol for Underwater Sensor Networks
Wu, Huayang; Chen, Min; Guan, Xin
2012-01-01
Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime. PMID:22666045
Slot Machine Structural Characteristics: Creating near Misses Using High Award Symbol Ratios
ERIC Educational Resources Information Center
Harrigan, Kevin A.
2008-01-01
A near miss is a failure that was close to a win. In this paper we analyze the primary documents associated with a case that was brought before the Nevada Gaming Commission in 1988. This case resulted in the 1989 ruling that the proprietary computer algorithms used by one slot machine manufacturer to create a high number of near misses on the…
NASA Astrophysics Data System (ADS)
Kumar, Vijay M.; Murthy, ANN; Chandrashekara, K.
2012-05-01
The production planning problem of flexible manufacturing system (FMS) concerns with decisions that have to be made before an FMS begins to produce parts according to a given production plan during an upcoming planning horizon. The main aspect of production planning deals with machine loading problem in which selection of a subset of jobs to be manufactured and assignment of their operations to the relevant machines are made. Such problems are not only combinatorial optimization problems, but also happen to be non-deterministic polynomial-time-hard, making it difficult to obtain satisfactory solutions using traditional optimization techniques. In this paper, an attempt has been made to address the machine loading problem with objectives of minimization of system unbalance and maximization of throughput simultaneously while satisfying the system constraints related to available machining time and tool slot designing and using a meta-hybrid heuristic technique based on genetic algorithm and particle swarm optimization. The results reported in this paper demonstrate the model efficiency and examine the performance of the system with respect to measures such as throughput and system utilization.
Shape-optimization of round-to-slot holes for improving film cooling effectiveness on a flat surface
NASA Astrophysics Data System (ADS)
Huang, Ying; Zhang, Jing-zhou; Wang, Chun-hua
2018-01-01
Single-objective optimization for improving adiabatic film cooling effectiveness is performed for single row of round-to-slot film cooling holes on a flat surface by using CFD analysis and surrogate approximation methods. Among the main geometric parameters, dimensionless hole-to-hole pitch (P/d) and slot length-to-diameter (l/d) are fixed as 2.4 and 2 respectively, and the other parameters (hole height-to-diameter ratio, slot width-to-diameter and inclination angle) are chosen as the design variables. Given a wide range of possible geometric variables, the geometric optimization of round-to-slot holes is carried out under two typical blowing ratios of M = 0.5 and M = 1.5 by selecting a spatially-averaged adiabatic film cooling effectiveness between x/d = 2 and x/d = 12 as the objective function to be maximized. Radial basis function neural network is applied for constructing the surrogate model and then the optimal design point is searched by a genetic algorithm. It is revealed that the optimal round-to-slot hole is of converging feature under a low blowing ratio but of diffusing feature under a high blowing ratio. Further, the influence principle of optimal round-to-slot geometry on film cooling performance is illustrated according to the detailed flow and thermal behaviors.
Shape-optimization of round-to-slot holes for improving film cooling effectiveness on a flat surface
NASA Astrophysics Data System (ADS)
Huang, Ying; Zhang, Jing-zhou; Wang, Chun-hua
2018-06-01
Single-objective optimization for improving adiabatic film cooling effectiveness is performed for single row of round-to-slot film cooling holes on a flat surface by using CFD analysis and surrogate approximation methods. Among the main geometric parameters, dimensionless hole-to-hole pitch ( P/ d) and slot length-to-diameter ( l/ d) are fixed as 2.4 and 2 respectively, and the other parameters (hole height-to-diameter ratio, slot width-to-diameter and inclination angle) are chosen as the design variables. Given a wide range of possible geometric variables, the geometric optimization of round-to-slot holes is carried out under two typical blowing ratios of M = 0.5 and M = 1.5 by selecting a spatially-averaged adiabatic film cooling effectiveness between x/ d = 2 and x/ d = 12 as the objective function to be maximized. Radial basis function neural network is applied for constructing the surrogate model and then the optimal design point is searched by a genetic algorithm. It is revealed that the optimal round-to-slot hole is of converging feature under a low blowing ratio but of diffusing feature under a high blowing ratio. Further, the influence principle of optimal round-to-slot geometry on film cooling performance is illustrated according to the detailed flow and thermal behaviors.
Humanizing machines: Anthropomorphization of slot machines increases gambling.
Riva, Paolo; Sacchi, Simona; Brambilla, Marco
2015-12-01
Do people gamble more on slot machines if they think that they are playing against humanlike minds rather than mathematical algorithms? Research has shown that people have a strong cognitive tendency to imbue humanlike mental states to nonhuman entities (i.e., anthropomorphism). The present research tested whether anthropomorphizing slot machines would increase gambling. Four studies manipulated slot machine anthropomorphization and found that exposing people to an anthropomorphized description of a slot machine increased gambling behavior and reduced gambling outcomes. Such findings emerged using tasks that focused on gambling behavior (Studies 1 to 3) as well as in experimental paradigms that included gambling outcomes (Studies 2 to 4). We found that gambling outcomes decrease because participants primed with the anthropomorphic slot machine gambled more (Study 4). Furthermore, we found that high-arousal positive emotions (e.g., feeling excited) played a role in the effect of anthropomorphism on gambling behavior (Studies 3 and 4). Our research indicates that the psychological process of gambling-machine anthropomorphism can be advantageous for the gaming industry; however, this may come at great expense for gamblers' (and their families') economic resources and psychological well-being. (c) 2015 APA, all rights reserved).
Fryer, Roland G.; Loury, Glenn C.
2014-01-01
This paper explores the economics of diversity-enhancing policies. A model is proposed in which heterogeneous agents, distinguished by skill level and social identity, purchase productive opportunities in a competitive market. We analyze policies designed to raise the status of a disadvantaged identity group. When agent identity is contractible, efficient policy grants preferred access to slots but offers no direct assistance for acquiring skills. When identity is not contractible, efficient policy provides universal subsidies to skill development when the fraction of the disadvantaged group at the skill development margin is larger than their share at the slot assignment margin. PMID:25525280
Multigranular integrated services optical network
NASA Astrophysics Data System (ADS)
Yu, Oliver; Yin, Leping; Xu, Huan; Liao, Ming
2006-12-01
Based on all-optical switches without requiring fiber delay lines and optical-electrical-optical interfaces, the multigranular optical switching (MGOS) network integrates three transport services via unified core control to efficiently support bursty and stream traffic of subwavelength to multiwavelength bandwidth. Adaptive robust optical burst switching (AR-OBS) aggregates subwavelength burst traffic into asynchronous light-rate bursts, transported via slotted-time light paths established by fast two-way reservation with robust blocking recovery control. Multiwavelength optical switching (MW-OS) decomposes multiwavelength stream traffic into a group of timing-related light-rate streams, transported via a light-path group to meet end-to-end delay-variation requirements. Optical circuit switching (OCS) simply converts wavelength stream traffic from an electrical-rate into a light-rate stream. The MGOS network employs decoupled routing, wavelength, and time-slot assignment (RWTA) and novel group routing and wavelength assignment (GRWA) to select slotted-time light paths and light-path groups, respectively. The selected resources are reserved by the unified multigranular robust fast optical reservation protocol (MG-RFORP). Simulation results show that elastic traffic is efficiently supported via AR-OBS in terms of loss rate and wavelength utilization, while connection-oriented wavelength traffic is efficiently supported via wavelength-routed OCS in terms of connection blocking and wavelength utilization. The GRWA-tuning result for MW-OS is also shown.
Theory of a Traveling Wave Feed for a Planar Slot Array Antenna
NASA Technical Reports Server (NTRS)
Rengarajan, Sembiam
2012-01-01
Planar arrays of waveguide-fed slots have been employed in many radar and remote sensing applications. Such arrays are designed in the standing wave configuration because of high efficiency. Traveling wave arrays can produce greater bandwidth at the expense of efficiency due to power loss in the load or loads. Traveling wave planar slot arrays may be designed with a long feed waveguide consisting of centered-inclined coupling slots. The feed waveguide is terminated in a matched load, and the element spacing in the feed waveguide is chosen to produce a beam squinted from the broadside. The traveling wave planar slot array consists of a long feed waveguide containing resonant-centered inclined coupling slots in the broad wall, coupling power into an array of stacked radiating waveguides orthogonal to it. The radiating waveguides consist of longitudinal offset radiating slots in a standing wave configuration. For the traveling wave feed of a planar slot array, one has to design the tilt angle and length of each coupling slot such that the amplitude and phase of excitation of each radiating waveguide are close to the desired values. The coupling slot spacing is chosen for an appropriate beam squint. Scattering matrix parameters of resonant coupling slots are used in the design process to produce appropriate excitations of radiating waveguides with constraints placed only on amplitudes. Since the radiating slots in each radiating waveguide are designed to produce a certain total admittance, the scattering (S) matrix of each coupling slot is reduced to a 2x2 matrix. Elements of each 2x2 S-matrix and the amount of coupling into the corresponding radiating waveguide are expressed in terms of the element S11. S matrices are converted into transmission (T) matrices, and the T matrices are multiplied to cascade the coupling slots and waveguide sections, starting from the load end and proceeding towards the source. While the use of non-resonant coupling slots may provide an additional degree of freedom in the design, resonant coupling slots simplify the design process. The amplitude of the wave going to the load is set at unity. The S11 parameter, r of the coupling slot closest to the load, is assigned an arbitrary value. A larger value of r will reduce the power dissipated in the load while increasing the reflection coefficient at the input port. It is now possible to obtain the excitation of the radiating waveguide closest to the load and the coefficients of the wave incident and reflected at the input port of this coupling slot. The next coupling slot parameter, r , is chosen to realize the excitation of that radiating waveguide. One continues this process moving towards the source, until all the coupling slot parameters r and hence the S11 parameter of the 4-port coupler, r, are known for each coupling slot. The goal is to produce the desired array aperture distribution in the feed direction. From an interpolation of the computed moment method data for the slot parameters, all the coupling slot tilt angles and lengths are obtained. From the excitations of the radiating waveguides computed from the coupling values, radiating slot parameters may be obtained so as to attain the desired total normalized slot admittances. This process yields the radiating slot parameters, offsets, and lengths. The design is repeated by choosing different values of r for the last coupling slot until the percentage of power dissipated in the load and the input reflection coefficient values are satisfactory. Numerical results computed for the radiation pattern, the tilt angles and lengths of coupling slots, and excitation phases of the radiating waveguides, are presented for an array with uniform amplitude excitation. The design process has been validated using computer simulations. This design procedure is valid for non-uniform amplitude excitations as well.
A New Aloha Anti-Collision Algorithm Based on CDMA
NASA Astrophysics Data System (ADS)
Bai, Enjian; Feng, Zhu
The tags' collision is a common problem in RFID (radio frequency identification) system. The problem has affected the integrity of the data transmission during the process of communication in the RFID system. Based on analysis of the existing anti-collision algorithm, a novel anti-collision algorithm is presented. The new algorithm combines the group dynamic frame slotted Aloha algorithm with code division multiple access technology. The algorithm can effectively reduce the collision probability between tags. Under the same number of tags, the algorithm is effective in reducing the reader recognition time and improve overall system throughput rate.
Bessel beam fluorescence lifetime tomography of live embryos (Conference Presentation)
NASA Astrophysics Data System (ADS)
Xu, Dongli; Peng, Leilei
2016-03-01
Optical tomography allows isotropic 3D imaging of embryos. Scanning-laser optical tomography (SLOT) has superior light collecting efficiency than wide-field optical tomography, making it ideal for fluorescence imaging of live embryos. We previously reported an imaging system that combines SLOT with a novel Fourier-multiplexed fluorescence lifetime imaging (FmFLIM) technique named FmFLIM-SLOT. FmFLIM-SLOT performs multiplexed FLIM-FRET readout of multiple FRET sensors in live embryos. Here we report a recent effort on improving the spatial resolution of the FmFLIM-SLOT system in order to image complex biochemical processes in live embryos at the cellular level. Optical tomography has to compromise between resolution and the depth of view. In SLOT, the commonly-used focused Gaussian beam diverges quickly from the focal plane, making it impossible to achieve high resolution imaging in a large volume specimen. We thus introduce Bessel beam laser-scanning tomography, which illuminates the sample with a spatial-light-modulator-generated Bessel beam that has an extended focal depth. The Bessel beam is scanned across the whole specimen. Fluorescence projection images are acquired at equal angular intervals as the sample rotates. Reconstruction artifacts due to annular-rings of the Bessel beam are removed by a modified 3D filtered back projection algorithm. Furthermore, in combination of Fourier-multiplexing fluorescence lifetime imaging (FmFLIM) method, the Bessel FmFLIM-SLOT system is capable of perform 3D lifetime imaging of live embryos at cellular resolution. The system is applied to in-vivo imaging of transgenic Zebrafish embryos. Results prove that Bessel FmFLIM-SLOT is a promising imaging method in development biology research.
7 CFR 247.26 - Return of administrative funds.
Code of Federal Regulations, 2011 CFR
2011-01-01
... Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.26 Return of administrative... legislatively mandated grant per assigned caseload slot. (Approved by the Office of Management and Budget under...
7 CFR 247.26 - Return of administrative funds.
Code of Federal Regulations, 2014 CFR
2014-01-01
... Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.26 Return of administrative... legislatively mandated grant per assigned caseload slot. (Approved by the Office of Management and Budget under...
7 CFR 247.26 - Return of administrative funds.
Code of Federal Regulations, 2013 CFR
2013-01-01
... Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.26 Return of administrative... legislatively mandated grant per assigned caseload slot. (Approved by the Office of Management and Budget under...
7 CFR 247.26 - Return of administrative funds.
Code of Federal Regulations, 2010 CFR
2010-01-01
... Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.26 Return of administrative... legislatively mandated grant per assigned caseload slot. (Approved by the Office of Management and Budget under...
7 CFR 247.26 - Return of administrative funds.
Code of Federal Regulations, 2012 CFR
2012-01-01
... Agriculture Regulations of the Department of Agriculture (Continued) FOOD AND NUTRITION SERVICE, DEPARTMENT OF AGRICULTURE CHILD NUTRITION PROGRAMS COMMODITY SUPPLEMENTAL FOOD PROGRAM § 247.26 Return of administrative... legislatively mandated grant per assigned caseload slot. (Approved by the Office of Management and Budget under...
Universal Decoder for PPM of any Order
NASA Technical Reports Server (NTRS)
Moision, Bruce E.
2010-01-01
A recently developed algorithm for demodulation and decoding of a pulse-position- modulation (PPM) signal is suitable as a basis for designing a single hardware decoding apparatus to be capable of handling any PPM order. Hence, this algorithm offers advantages of greater flexibility and lower cost, in comparison with prior such algorithms, which necessitate the use of a distinct hardware implementation for each PPM order. In addition, in comparison with the prior algorithms, the present algorithm entails less complexity in decoding at large orders. An unavoidably lengthy presentation of background information, including definitions of terms, is prerequisite to a meaningful summary of this development. As an aid to understanding, the figure illustrates the relevant processes of coding, modulation, propagation, demodulation, and decoding. An M-ary PPM signal has M time slots per symbol period. A pulse (signifying 1) is transmitted during one of the time slots; no pulse (signifying 0) is transmitted during the other time slots. The information intended to be conveyed from the transmitting end to the receiving end of a radio or optical communication channel is a K-bit vector u. This vector is encoded by an (N,K) binary error-correcting code, producing an N-bit vector a. In turn, the vector a is subdivided into blocks of m = log2(M) bits and each such block is mapped to an M-ary PPM symbol. The resultant coding/modulation scheme can be regarded as equivalent to a nonlinear binary code. The binary vector of PPM symbols, x is transmitted over a Poisson channel, such that there is obtained, at the receiver, a Poisson-distributed photon count characterized by a mean background count nb during no-pulse time slots and a mean signal-plus-background count of ns+nb during a pulse time slot. In the receiver, demodulation of the signal is effected in an iterative soft decoding process that involves consideration of relationships among photon counts and conditional likelihoods of m-bit vectors of coded bits. Inasmuch as the likelihoods of all the m-bit vectors of coded bits mapping to the same PPM symbol are correlated, the best performance is obtained when the joint mbit conditional likelihoods are utilized. Unfortunately, the complexity of decoding, measured in the number of operations per bit, grows exponentially with m, and can thus become prohibitively expensive for large PPM orders. For a system required to handle multiple PPM orders, the cost is even higher because it is necessary to have separate decoding hardware for each order. This concludes the prerequisite background information. In the present algorithm, the decoding process as described above is modified by, among other things, introduction of an lbit marginalizer sub-algorithm. The term "l-bit marginalizer" signifies that instead of m-bit conditional likelihoods, the decoder computes l-bit conditional likelihoods, where l is fixed. Fixing l, regardless of the value of m, makes it possible to use a single hardware implementation for any PPM order. One could minimize the decoding complexity and obtain an especially simple design by fixing l at 1, but this would entail some loss of performance. An intermediate solution is to fix l at some value, greater than 1, that may be less than or greater than m. This solution makes it possible to obtain the desired flexibility to handle any PPM order while compromising between complexity and loss of performance.
Handling Neighbor Discovery and Rendezvous Consistency with Weighted Quorum-Based Approach
Own, Chung-Ming; Meng, Zhaopeng; Liu, Kehan
2015-01-01
Neighbor discovery and the power of sensors play an important role in the formation of Wireless Sensor Networks (WSNs) and mobile networks. Many asynchronous protocols based on wake-up time scheduling have been proposed to enable neighbor discovery among neighboring nodes for the energy saving, especially in the difficulty of clock synchronization. However, existing researches are divided two parts with the neighbor-discovery methods, one is the quorum-based protocols and the other is co-primality based protocols. Their distinction is on the arrangements of time slots, the former uses the quorums in the matrix, the latter adopts the numerical analysis. In our study, we propose the weighted heuristic quorum system (WQS), which is based on the quorum algorithm to eliminate redundant paths of active slots. We demonstrate the specification of our system: fewer active slots are required, the referring rate is balanced, and remaining power is considered particularly when a device maintains rendezvous with discovered neighbors. The evaluation results showed that our proposed method can effectively reschedule the active slots and save the computing time of the network system. PMID:26404297
GSHR-Tree: a spatial index tree based on dynamic spatial slot and hash table in grid environments
NASA Astrophysics Data System (ADS)
Chen, Zhanlong; Wu, Xin-cai; Wu, Liang
2008-12-01
Computation Grids enable the coordinated sharing of large-scale distributed heterogeneous computing resources that can be used to solve computationally intensive problems in science, engineering, and commerce. Grid spatial applications are made possible by high-speed networks and a new generation of Grid middleware that resides between networks and traditional GIS applications. The integration of the multi-sources and heterogeneous spatial information and the management of the distributed spatial resources and the sharing and cooperative of the spatial data and Grid services are the key problems to resolve in the development of the Grid GIS. The performance of the spatial index mechanism is the key technology of the Grid GIS and spatial database affects the holistic performance of the GIS in Grid Environments. In order to improve the efficiency of parallel processing of a spatial mass data under the distributed parallel computing grid environment, this paper presents a new grid slot hash parallel spatial index GSHR-Tree structure established in the parallel spatial indexing mechanism. Based on the hash table and dynamic spatial slot, this paper has improved the structure of the classical parallel R tree index. The GSHR-Tree index makes full use of the good qualities of R-Tree and hash data structure. This paper has constructed a new parallel spatial index that can meet the needs of parallel grid computing about the magnanimous spatial data in the distributed network. This arithmetic splits space in to multi-slots by multiplying and reverting and maps these slots to sites in distributed and parallel system. Each sites constructs the spatial objects in its spatial slot into an R tree. On the basis of this tree structure, the index data was distributed among multiple nodes in the grid networks by using large node R-tree method. The unbalance during process can be quickly adjusted by means of a dynamical adjusting algorithm. This tree structure has considered the distributed operation, reduplication operation transfer operation of spatial index in the grid environment. The design of GSHR-Tree has ensured the performance of the load balance in the parallel computation. This tree structure is fit for the parallel process of the spatial information in the distributed network environments. Instead of spatial object's recursive comparison where original R tree has been used, the algorithm builds the spatial index by applying binary code operation in which computer runs more efficiently, and extended dynamic hash code for bit comparison. In GSHR-Tree, a new server is assigned to the network whenever a split of a full node is required. We describe a more flexible allocation protocol which copes with a temporary shortage of storage resources. It uses a distributed balanced binary spatial tree that scales with insertions to potentially any number of storage servers through splits of the overloaded ones. The application manipulates the GSHR-Tree structure from a node in the grid environment. The node addresses the tree through its image that the splits can make outdated. This may generate addressing errors, solved by the forwarding among the servers. In this paper, a spatial index data distribution algorithm that limits the number of servers has been proposed. We improve the storage utilization at the cost of additional messages. The structure of GSHR-Tree is believed that the scheme of this grid spatial index should fit the needs of new applications using endlessly larger sets of spatial data. Our proposal constitutes a flexible storage allocation method for a distributed spatial index. The insertion policy can be tuned dynamically to cope with periods of storage shortage. In such cases storage balancing should be favored for better space utilization, at the price of extra message exchanges between servers. This structure makes a compromise in the updating of the duplicated index and the transformation of the spatial index data. Meeting the needs of the grid computing, GSHRTree has a flexible structure in order to satisfy new needs in the future. The GSHR-Tree provides the R-tree capabilities for large spatial datasets stored over interconnected servers. The analysis, including the experiments, confirmed the efficiency of our design choices. The scheme should fit the needs of new applications of spatial data, using endlessly larger datasets. Using the system response time of the parallel processing of spatial scope query algorithm as the performance evaluation factor, According to the result of the simulated the experiments, GSHR-Tree is performed to prove the reasonable design and the high performance of the indexing structure that the paper presented.
Reading in Perspective: What Real Cops and Pretend Burglars Look for in a Story.
ERIC Educational Resources Information Center
Goetz, Ernest T.; And Others
1983-01-01
Two hypotheses (selective attention and slot filling) of how schemata enhance the learning and recall of the initial comprehension of prose material were tested. Consistent with the attention-focusing hypothesis, readers spent more time on sentences containing information important to their assigned perspective. (Author/PN)
Routing in Networks with Random Topologies
NASA Technical Reports Server (NTRS)
Bambos, Nicholas
1997-01-01
We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.
MHEC Academic Scheduling Software Survey Results.
ERIC Educational Resources Information Center
Midwestern Higher Education Commission Academic Software Committee Research Bulletin, 1995
1995-01-01
This bulletin summarizes the chief quantitative findings of a survey of 264 small and medium sized colleges and universities in the midwest concerning their use of and interest in academic scheduling software. This type of software assists in planning course offerings, assigning instructors and course functions to facilities and time slots, and…
Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs
Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung
2017-01-01
Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes. PMID:28471416
NASA Technical Reports Server (NTRS)
Springett, J. C.
1982-01-01
The technique outlined in this paper is intended to eliminate the problems of cochannel interference and uniform geographic distribution of user channels which arise in conventional designs for a multiple spot beam communication satellite to serve mobile telephony users across the CONUS. By time multiplexing FM/FDMA signal ensembles so that only those beams operating on distinct frequency subbands are allowed to transmit concurrently, cochannel interference arising from simultaneous frequency subband reuse is precluded. Thus, time disjoint frequency reuse is accomplished over a repetitive sequence of fixed time slots. By assigning different size subbands to each time slot, a market of nonuniform users can be accommodated. The technique results in a greatly simplified antenna feed system design for the satellite, at a cost of imposing the need for time slot synchronization on the mobile FM receivers whose ability for rejecting adjacent channel interference is somewhat diminished.
Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs.
Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung
2017-05-04
Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes.
Induced sadness increases persistence in a simulated slot machine task among recreational gamblers.
Devos, Gaëtan; Clark, Luke; Maurage, Pierre; Billieux, Joël
2018-05-01
Gambling may constitute a strategy for coping with depressive mood, but a direct influence of depressive mood on gambling behaviors has never been tested via realistic experimental designs in gamblers. The current study tested whether experimentally induced sadness increases persistence on a simulated slot machine task using real monetary reinforcement in recreational gamblers. Sixty participants were randomly assigned to an experimental (sadness induction) or control (no emotional induction) condition, and then performed a slot machine task consisting of a mandatory phase followed by a persistence phase. Potential confounding variables (problem gambling symptoms, impulsivity traits, gambling cognitions) were measured to ensure that the experimental and control groups were comparable. The study showed that participants in the sadness condition displayed greater gambling persistence than control participants (p = .011). These data support the causal role of negative affect in decisions to gamble and persistence, which bears important theoretical and clinical implications. (PsycINFO Database Record (c) 2018 APA, all rights reserved).
NASA Astrophysics Data System (ADS)
Springett, J. C.
The technique outlined in this paper is intended to eliminate the problems of cochannel interference and uniform geographic distribution of user channels which arise in conventional designs for a multiple spot beam communication satellite to serve mobile telephony users across the CONUS. By time multiplexing FM/FDMA signal ensembles so that only those beams operating on distinct frequency subbands are allowed to transmit concurrently, cochannel interference arising from simultaneous frequency subband reuse is precluded. Thus, time disjoint frequency reuse is accomplished over a repetitive sequence of fixed time slots. By assigning different size subbands to each time slot, a market of nonuniform users can be accommodated. The technique results in a greatly simplified antenna feed system design for the satellite, at a cost of imposing the need for time slot synchronization on the mobile FM receivers whose ability for rejecting adjacent channel interference is somewhat diminished.
Effect of Slotted Anode on Gas Bubble Behaviors in Aluminum Reduction Cell
NASA Astrophysics Data System (ADS)
Sun, Meijia; Li, Baokuan; Li, Linmin; Wang, Qiang; Peng, Jianping; Wang, Yaowu; Cheung, Sherman C. P.
2017-12-01
In the aluminum reduction cells, gas bubbles are generated at the bottom of the anode which eventually reduces the effective current contact area and the system efficiency. To encourage the removal of gas bubbles, slotted anode has been proposed and increasingly adopted by some industrial aluminum reduction cells. Nonetheless, the exact gas bubble removal mechanisms are yet to be fully understood. A three-dimensional (3D) transient, multiphase flow mathematical model coupled with magnetohydrodynamics has been developed to investigate the effect of slotted anode on the gas bubble movement. The Eulerian volume of fluid approach is applied to track the electrolyte (bath)-molten aluminum (metal) interface. Meanwhile, the Lagrangian discrete particle model is employed to handle the dynamics of gas bubbles with considerations of the buoyancy force, drag force, virtual mass force, and pressure gradient force. The gas bubble coalescence process is also taken into account based on the O'Rourke's algorithm. The two-way coupling between discrete bubbles and fluids is achieved by the inter-phase momentum exchange. Numerical predictions are validated against the anode current variation in an industrial test. Comparing the results using slotted anode with the traditional one, the time-averaged gas bubble removal rate increases from 36 to 63 pct; confirming that the slotted anode provides more escaping ways and shortens the trajectories for gas bubbles. Furthermore, the slotted anode also reduces gas bubble's residence time and the probability of coalescence. Moreover, the bubble layer thickness in aluminum cell with slotted anode is reduced about 3.5 mm (17.4 pct), so the resistance can be cut down for the sake of energy saving and the metal surface fluctuation amplitude is significantly reduced for the stable operation due to the slighter perturbation with smaller bubbles.
NASA Technical Reports Server (NTRS)
Prevot, Thomas
2012-01-01
This paper describes the underlying principles and algorithms for computing the primary controller managed spacing (CMS) tools developed at NASA for precisely spacing aircraft along efficient descent paths. The trajectory-based CMS tools include slot markers, delay indications and speed advisories. These tools are one of three core NASA technologies integrated in NASAs ATM technology demonstration-1 (ATD-1) that will operationally demonstrate the feasibility of fuel-efficient, high throughput arrival operations using Automatic Dependent Surveillance Broadcast (ADS-B) and ground-based and airborne NASA technologies for precision scheduling and spacing.
NASA Technical Reports Server (NTRS)
Zhou, Xiaoming (Inventor); Baras, John S. (Inventor)
2010-01-01
The present invention relates to an improved communications protocol which increases the efficiency of transmission in return channels on a multi-channel slotted Alohas system by incorporating advanced error correction algorithms, selective retransmission protocols and the use of reserved channels to satisfy the retransmission requests.
Benefit Assessment of the Precision Departure Release Capability Concept
NASA Technical Reports Server (NTRS)
Palopo, Kee; Chatterji, Gano B.; Lee, Hak-Tae
2011-01-01
A Precision Departure Release Capability concept is being evaluated by both the National Aeronautics and Space Administration and the Federal Aviation Administration as part of a larger goal of improving throughput, efficiency and capacity in integrated departure, arrival and surface operations. The concept is believed to have the potential of increasing flight efficiency and throughput by avoiding missing assigned slots and minimizing speed increase or path stretch to recover the slot. The main thrust of the paper is determining the impact of early and late departures from the departure runway when an aircraft has a slot assigned either at a meter fix or at the arrival airport. Results reported in the paper are for two scenarios. The first scenario considers flights out of Dallas/Fort Worth destined for Hartsfield-Jackson International Airport in Atlanta flying through the Meridian meter-fix in the Memphis Center with miles-in-trail constraints. The second scenario considers flights destined to George Bush Intercontinental/Houston Airport with specified airport arrival rate constraint. Results show that delay reduction can be achieved by allowing reasonable speed changes in scheduling. It was determined that the traffic volume between Dallas/Fort Worth and Atlanta via the Meridian fix is low and the departures times are spread enough that large departure schedule uncertainty can be tolerated. Flights can depart early or late within 90 minutes without accruing much more delay due to miles-in-trail constraint at the Meridian fix. In the Houston scenario, 808 arrivals from 174 airports were considered. Results show that delay experienced by the 16 Dallas/Fort Worth departures is higher if initial schedules of the remaining 792 flights are kept unaltered while they are rescheduled. Analysis shows that the probability of getting the initially assigned slot back after perturbation and rescheduling decreases with increasing standard deviation of the departure delay distributions. Results show that most Houston arrivals can be expected to be on time based on the assumed zero-mean Normal departure delay distributions achievable by Precision Departure Release Capability. In the current system, airport-departure delay, which is the sum of gate-departure delay and taxi-out delay, is observed at the airports. This delay acts as a bias, which can be reduced by Precision Departure Release Capability.
NASA Astrophysics Data System (ADS)
Li, Yan; Collier, Martin
2007-11-01
Wavelength-routed networks have received enormous attention due to the fact that they are relatively simple to implement and implicitly offer Quality of Service (QoS) guarantees. However, they suffer from a bandwidth inefficiency problem and require complex Routing and Wavelength Assignment (RWA). Most attempts to address the above issues exploit the joint use of WDM and TDM technologies. The resultant TDM-based wavelength-routed networks partition the wavelength bandwidth into fixed-length time slots organized as a fixed-length frame. Multiple connections can thus time-share a wavelength and the grooming of their traffic leads to better bandwidth utilization. The capability of switching in both wavelength and time domains in such networks also mitigates the RWA problem. However, TMD-based wavelength-routed networks work in synchronous mode and strict synchronization among all network nodes is required. Global synchronization for all-optical networks which operate at extremely high speed is technically challenging, and deploying an optical synchronizer for each wavelength involves considerable cost. An Optical Slotted Circuit Switching (OSCS) architecture is proposed in this paper. In an OSCS network, slotted circuits are created to better utilize the wavelength bandwidth than in classic wavelength-routed networks. The operation of the protocol is such as to avoid the need for global synchronization required by TDM-based wavelength-routed networks.
Computational analysis of forebody tangential slot blowing on the high alpha research vehicle
NASA Technical Reports Server (NTRS)
Gee, Ken
1995-01-01
A numerical analysis of forebody tangential slot blowing as a means of generating side force and yawing moment is conducted using an aircraft geometry. The Reynolds-averaged, thin-layer, Navier-Stokes equations are solved using a partially flux-split, approximately-factored algorithm. An algebraic turbulence model is used to determine the turbulent eddy viscosity values. Solutions are obtained using both patched and overset grid systems. In the patched grid model, and actuator plane is used to introduce jet variables into the flow field. The overset grid model is used to model the physical slot geometry and facilitate modeling of the full aircraft configuration. A slot optimization study indicates that a short slot located close to the nose of the aircraft provided the most side force and yawing moment per unit blowing coefficient. Comparison of computed surface pressure with that obtained in full-scale wind tunnel tests produce good agreement, indicating the numerical method and grid system used in the study are valid. Full aircraft computations resolve the changes in vortex burst point due to blowing. A time-accurate full-aircraft solution shows the effect of blowing on the changes in the frequency of the aerodynamic loads over the vertical tails. A study of the effects of freestream Mach number and various jet parameters indicates blowing remains effective through the transonic Mach range. An investigation of the force onset time lag associated with forebody blowing shows the lag to be minimal. The knowledge obtained in this study may be applied to the design of a forebody tangential slot blowing system for use on flight aircraft.
A Minimax Network Flow Model for Characterizing the Impact of Slot Restrictions
NASA Technical Reports Server (NTRS)
Lee, Douglas W.; Patek, Stephen D.; Alexandrov, Natalia; Bass, Ellen J.; Kincaid, Rex K.
2010-01-01
This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports.
NASA Technical Reports Server (NTRS)
Culley, Dennis E.; Bright, Michelle M.; Prahst, Patricia S.; Strazisar, Anthony J.
2003-01-01
Micro-flow control actuation embedded in a stator vane was used to successfully control separation and improve near stall performance in a multistage compressor rig at NASA Glenn. Using specially designed stator vanes configured with internal actuation to deliver pulsating air through slots along the suction surface, a research study was performed to identify performance benefits using this microflow control approach. Pressure profiles and unsteady pressure measurements along the blade surface and at the shroud provided a dynamic look at the compressor during microflow air injection. These pressure measurements lead to a tracking algorithm to identify the onset of separation. The testing included steady air injection at various slot locations along the vane. The research also examined the benefit of pulsed injection and actively controlled air injection along the stator vane. Two types of actuation schemes were studied, including an embedded actuator for on-blade control. Successful application of an online detection and flow control scheme will be discussed. Testing showed dramatic performance benefit for flow reattachment and subsequent improvement in diffusion through the use of pulsed controlled injection. The paper will discuss the experimental setup, the blade configurations, and preliminary CFD results which guided the slot location along the blade. The paper will also show the pressure profiles and unsteady pressure measurements used to track flow control enhancement, and will conclude with the tracking algorithm for adjusting the control.
1994-12-07
set Ci is such that i C_ A and, in general, Ci n Cj 0 for i # j, The importance of the distinction n o ýt a av1 itIam i; the t Ulm hIt I 9B i l 16 a...be the M-dimensional slot assignment probability vector [01, . ., ’iM] T and Wi(0) as the expected node i waiting time. Our objective is to determine...Nominal Sample Path BP#m BP # (m+l) I I I! I I II * I II ,m A2,m :A3,m VIl m T l m T2,m 13 V3,m Figure 2b - (2,m) Phantom Slot Sample Path 8 3 A Schedule
ZEA-TDMA: design and system level implementation of a TDMA protocol for anonymous wireless networks
NASA Astrophysics Data System (ADS)
Banerjee, Debasmit; Dong, Bo; Biswas, Subir
2013-05-01
Wireless sensor network used in military applications may be deployed in hostile environments, where privacy and security is of primary concern. This can lead to the formation of a trust-based sub-network among mutually-trusting nodes. However, designing a TDMA MAC protocol is very challenging in situations where such multiple sub-networks coexist, since TDMA protocols require node identity information for slot assignments. This paper introduces a novel distributed TDMA MAC protocol, ZEA-TDMA (Zero Exposure Anonymous TDMA), for anonymous wireless networks. ZEA-TDMA achieves slot allocation with strict anonymity constraints, i.e. without nodes having to exchange any identity revealing information. By using just the relative time of arrival of packets and a novel technique of wireless collision-detection and resolution for fixed packetsizes, ZEA-TDMA is able to achieve MAC slot-allocation which is described as follows. Initially, a newly joined node listens to its one-hop neighborhood channel usage and creates a slot allocation table based on its own relative time, and finally, selects a slot that is collision free within its one-hop neighborhood. The selected slot can however cause hidden collisions with a two-hop neighbor of the node. These collisions are resolved by a common neighbor of the colliding nodes, which first detects the collision, and then resolve them using an interrupt packet. ZEA-TDMA provides the following features: a) it is a TDMA protocol ideally suited for highly secure or strictly anonymous environments b) it can be used in heterogeneous environments where devices use different packet structures c) it does not require network time-synchronization, and d) it is insensitive to channel errors. We have implemented ZEA-TDMA on the MICA2 hardware platform running TinyOS and evaluated the protocol functionality and performance on a MICA2 test-bed.
Engineering calculations for communications systems planning
NASA Technical Reports Server (NTRS)
Levis, C. A.; Martin, C. H.; Wang, C. W.; Gonsalvez, D.
1982-01-01
The single entry interference problem is treated for frequency sharing between the broadcasting satellite and intersatellite services near 23 GHz. It is recommended that very long (more than 120 longitude difference) intersatellite hops be relegated to the unshared portion of the band. When this is done, it is found that suitable orbit assignments can be determined easily with the aid of a set of universal curves. An attempt to develop synthesis procedures for optimally assigning frequencies and orbital slots for the broadcasting satellite service in region 2 was initiated. Several discrete programming and continuous optimization techniques are discussed.
NASA Astrophysics Data System (ADS)
Petrovic, Goran; Kilic, Tomislav; Terzic, Bozo
2009-04-01
In this paper a sensorless speed detection method of induction squirrel-cage machines is presented. This method is based on frequency determination of the stator neutral point voltage primary slot harmonic, which is dependent on rotor speed. In order to prove method in steady state and dynamic conditions the simulation and experimental study was carried out. For theoretical investigation the mathematical model of squirrel cage induction machines, which takes into consideration actual geometry and windings layout, is used. Speed-related harmonics that arise from rotor slotting are analyzed using digital signal processing and DFT algorithm with Hanning window. The performance of the method is demonstrated over a wide range of load conditions.
Distributed Channel Allocation and Time Slot Optimization for Green Internet of Things.
Ding, Kaiqi; Zhao, Haitao; Hu, Xiping; Wei, Jibo
2017-10-28
In sustainable smart cities, power saving is a severe challenge in the energy-constrained Internet of Things (IoT). Efficient utilization of limited multiple non-overlap channels and time resources is a promising solution to reduce the network interference and save energy consumption. In this paper, we propose a joint channel allocation and time slot optimization solution for IoT. First, we propose a channel ranking algorithm which enables each node to rank its available channels based on the channel properties. Then, we propose a distributed channel allocation algorithm so that each node can choose a proper channel based on the channel ranking and its own residual energy. Finally, the sleeping duration and spectrum sensing duration are jointly optimized to maximize the normalized throughput and satisfy energy consumption constraints simultaneously. Different from the former approaches, our proposed solution requires no central coordination or any global information that each node can operate based on its own local information in a total distributed manner. Also, theoretical analysis and extensive simulations have validated that when applying our solution in the network of IoT: (i) each node can be allocated to a proper channel based on the residual energy to balance the lifetime; (ii) the network can rapidly converge to a collision-free transmission through each node's learning ability in the process of the distributed channel allocation; and (iii) the network throughput is further improved via the dynamic time slot optimization.
Runway Scheduling for Charlotte Douglas International Airport
NASA Technical Reports Server (NTRS)
Malik, Waqar A.; Lee, Hanbong; Jung, Yoon C.
2016-01-01
This paper describes the runway scheduler that was used in the 2014 SARDA human-in-the-loop simulations for CLT. The algorithm considers multiple runways and computes optimal runway times for departures and arrivals. In this paper, we plan to run additional simulation on the standalone MRS algorithm and compare the performance of the algorithm against a FCFS heuristic where aircraft avail of runway slots based on a priority given by their positions in the FCFS sequence. Several traffic scenarios corresponding to current day traffic level and demand profile will be generated. We also plan to examine the effect of increase in traffic level (1.2x and 1.5x) and observe trends in algorithm performance.
Design optimization for permanent magnet machine with efficient slot per pole ratio
NASA Astrophysics Data System (ADS)
Potnuru, Upendra Kumar; Rao, P. Mallikarjuna
2018-04-01
This paper presents a methodology for the enhancement of a Brush Less Direct Current motor (BLDC) with 6Poles and 8slots. In particular; it is focused on amulti-objective optimization using a Genetic Algorithmand Grey Wolf Optimization developed in MATLAB. The optimization aims to maximize the maximum output power value and minimize the total losses of a motor. This paper presents an application of the MATLAB optimization algorithms to brushless DC (BLDC) motor design, with 7 design parameters chosen to be free. The optimal design parameters of the motor derived by GA are compared with those obtained by Grey Wolf Optimization technique. A comparative report on the specified enhancement approaches appearsthat Grey Wolf Optimization technique has a better convergence.
Energy-saving framework for passive optical networks with ONU sleep/doze mode.
Van, Dung Pham; Valcarenghi, Luca; Dias, Maluge Pubuduni Imali; Kondepu, Koteswararao; Castoldi, Piero; Wong, Elaine
2015-02-09
This paper proposes an energy-saving passive optical network framework (ESPON) that aims to incorporate optical network unit (ONU) sleep/doze mode into dynamic bandwidth allocation (DBA) algorithms to reduce ONU energy consumption. In the ESPON, the optical line terminal (OLT) schedules both downstream (DS) and upstream (US) transmissions in the same slot in an online and dynamic fashion whereas the ONU enters sleep mode outside the slot. The ONU sleep time is maximized based on both DS and US traffic. Moreover, during the slot, the ONU might enter doze mode when only its transmitter is idle to further improve energy efficiency. The scheduling order of data transmission, control message exchange, sleep period, and doze period defines an energy-efficient scheme under the ESPON. Three schemes are designed and evaluated in an extensive FPGA-based evaluation. Results show that whilst all the schemes significantly save ONU energy for different evaluation scenarios, the scheduling order has great impact on their performance. In addition, the ESPON allows for a scheduling order that saves ONU energy independently of the network reach.
NASA Technical Reports Server (NTRS)
Edwards, Jack R.; Mcrae, D. Scott
1991-01-01
An efficient method for computing two-dimensional compressible Navier-Stokes flow fields is presented. The solution algorithm is a fully-implicit approximate factorization technique based on an unsymmetric line Gauss-Seidel splitting of the equation system Jacobian matrix. Convergence characteristics are improved by the addition of acceleration techniques based on Shamanskii's method for nonlinear equations and Broyden's quasi-Newton update. Characteristic-based differencing of the equations is provided by means of Van Leer's flux vector splitting. In this investigation, emphasis is placed on the fast and accurate computation of shock-wave-boundary layer interactions with and without slot suction effects. In the latter context, a set of numerical boundary conditions for simulating the transpiration flow in an open slot is devised. Both laminar and turbulent cases are considered, with turbulent closure provided by a modified Cebeci-Smith algebraic model. Comparisons with computational and experimental data sets are presented for a variety of interactions, and a fully-coupled simulation of a plenum chamber/inlet flowfield with shock interaction and suction is also shown and discussed.
A new algorithm for reliable and general NMR resonance assignment.
Schmidt, Elena; Güntert, Peter
2012-08-01
The new FLYA automated resonance assignment algorithm determines NMR chemical shift assignments on the basis of peak lists from any combination of multidimensional through-bond or through-space NMR experiments for proteins. Backbone and side-chain assignments can be determined. All experimental data are used simultaneously, thereby exploiting optimally the redundancy present in the input peak lists and circumventing potential pitfalls of assignment strategies in which results obtained in a given step remain fixed input data for subsequent steps. Instead of prescribing a specific assignment strategy, the FLYA resonance assignment algorithm requires only experimental peak lists and the primary structure of the protein, from which the peaks expected in a given spectrum can be generated by applying a set of rules, defined in a straightforward way by specifying through-bond or through-space magnetization transfer pathways. The algorithm determines the resonance assignment by finding an optimal mapping between the set of expected peaks that are assigned by definition but have unknown positions and the set of measured peaks in the input peak lists that are initially unassigned but have a known position in the spectrum. Using peak lists obtained by purely automated peak picking from the experimental spectra of three proteins, FLYA assigned correctly 96-99% of the backbone and 90-91% of all resonances that could be assigned manually. Systematic studies quantified the impact of various factors on the assignment accuracy, namely the extent of missing real peaks and the amount of additional artifact peaks in the input peak lists, as well as the accuracy of the peak positions. Comparing the resonance assignments from FLYA with those obtained from two other existing algorithms showed that using identical experimental input data these other algorithms yielded significantly (40-142%) more erroneous assignments than FLYA. The FLYA resonance assignment algorithm thus has the reliability and flexibility to replace most manual and semi-automatic assignment procedures for NMR studies of proteins.
NASA Astrophysics Data System (ADS)
Sohn, Illsoo; Lee, Byong Ok; Lee, Kwang Bok
Recently, multimedia services are increasing with the widespread use of various wireless applications such as web browsers, real-time video, and interactive games, which results in traffic asymmetry between the uplink and downlink. Hence, time division duplex (TDD) systems which provide advantages in efficient bandwidth utilization under asymmetric traffic environments have become one of the most important issues in future mobile cellular systems. It is known that two types of intercell interference, referred to as crossed-slot interference, additionally arise in TDD systems; the performances of the uplink and downlink transmissions are degraded by BS-to-BS crossed-slot interference and MS-to-MS crossed-slot interference, respectively. The resulting performance unbalance between the uplink and downlink makes network deployment severely inefficient. Previous works have proposed intelligent time slot allocation algorithms to mitigate the crossed-slot interference problem. However, they require centralized control, which causes large signaling overhead in the network. In this paper, we propose to change the shape of the cellular structure itself. The conventional cellular structure is easily transformed into the proposed cellular structure with distributed receive antennas (DRAs). We set up statistical Markov chain traffic model and analyze the bit error performances of the conventional cellular structure and proposed cellular structure under asymmetric traffic environments. Numerical results show that the uplink and downlink performances of the proposed cellular structure become balanced with the proper number of DRAs and thus the proposed cellular structure is notably cost-effective in network deployment compared to the conventional cellular structure. As a result, extending the conventional cellular structure into the proposed cellular structure with DRAs is a remarkably cost-effective solution to support asymmetric traffic environments in future mobile cellular systems.
Experimental demonstration of time- and mode-division multiplexed passive optical network
NASA Astrophysics Data System (ADS)
Ren, Fang; Li, Juhao; Tang, Ruizhi; Hu, Tao; Yu, Jinyi; Mo, Qi; He, Yongqi; Chen, Zhangyuan; Li, Zhengbin
2017-07-01
A time- and mode-division multiplexed passive optical network (TMDM-PON) architecture is proposed, in which each optical network unit (ONU) communicates with the optical line terminal (OLT) independently utilizing both different time slots and switched optical linearly polarized (LP) spatial modes. Combination of a mode multiplexer/demultiplexer (MUX/DEUX) and a simple N × 1 optical switch is employed to select the specific LP mode in each ONU. A mode-insensitive power splitter is used for signal broadcast/combination between OLT and ONUs. We theoretically propose a dynamic mode and time slot assignment scheme for TMDM-PON based on inter-ONU priority rating, in which the time delay and packet loss ratio's variation tendency are investigated by simulation. Moreover, we experimentally demonstrate 2-mode TMDM-PON transmission over 10 km FMF with 10-Gb/s on-off keying (OOK) signal and direct detection.
NASA Astrophysics Data System (ADS)
Chao, I.-Fen; Zhang, Tsung-Min
2015-06-01
Long-reach passive optical networks (LR-PONs) have been considered to be promising solutions for future access networks. In this paper, we propose a distributed medium access control (MAC) scheme over an advantageous LR-PON network architecture that reroutes the control information from and back to all ONUs through an (N + 1) × (N + 1) star coupler (SC) deployed near the ONUs, thereby overwhelming the extremely long propagation delay problem in LR-PONs. In the network, the control slot is designed to contain all bandwidth requirements of all ONUs and is in-band time-division-multiplexed with a number of data slots within a cycle. In the proposed MAC scheme, a novel profit-weight-based dynamic bandwidth allocation (P-DBA) scheme is presented. The algorithm is designed to efficiently and fairly distribute the amount of excess bandwidth based on a profit value derived from the excess bandwidth usage of each ONU, which resolves the problems of previously reported DBA schemes that are either unfair or inefficient. The simulation results show that the proposed decentralized algorithms exhibit a nearly three-order-of-magnitude improvement in delay performance compared to the centralized algorithms over LR-PONs. Moreover, the newly proposed P-DBA scheme guarantees low delay performance and fairness even when under attack by the malevolent ONU irrespective of traffic loads and burstiness.
Study on store-space assignment based on logistic AGV in e-commerce goods to person picking pattern
NASA Astrophysics Data System (ADS)
Xu, Lijuan; Zhu, Jie
2017-10-01
This paper studied on the store-space assignment based on logistic AGV in E-commerce goods to person picking pattern, and established the store-space assignment model based on the lowest picking cost, and design for store-space assignment algorithm after the cluster analysis based on similarity coefficient. And then through the example analysis, compared the picking cost between store-space assignment algorithm this paper design and according to item number and storage according to ABC classification allocation, and verified the effectiveness of the design of the store-space assignment algorithm.
NASA Astrophysics Data System (ADS)
Yue, L.; Guan, Z.; He, C.; Luo, D.; Saif, U.
2017-06-01
In recent years, the competitive pressure on manufacturing companies shifted them from mass production to mass customization to produce large variety of products. It is a great challenge for companies nowadays to produce customized mixed flow mode of production to meet customized demand on time. Due to large variety of products, the storage system to deliver variety of products to production lines influences on the timely production of variety of products, as investigated from by simulation study of an inefficient storage system of a real Company, in the current research. Therefore, current research proposed a slotting optimization model with mixed model sequence to assemble in consideration of the final flow lines to optimize whole automated storage and retrieval system (AS/RS) and distribution system in the case company. Current research is aimed to minimize vertical height of centre of gravity of AS/RS and total time spent for taking the materials out from the AS/RS simultaneously. Genetic algorithm is adopted to solve the proposed problem and computational result shows significant improvement in stability and efficiency of AS/RS as compared to the existing method used in the case company.
Automated sequence-specific protein NMR assignment using the memetic algorithm MATCH.
Volk, Jochen; Herrmann, Torsten; Wüthrich, Kurt
2008-07-01
MATCH (Memetic Algorithm and Combinatorial Optimization Heuristics) is a new memetic algorithm for automated sequence-specific polypeptide backbone NMR assignment of proteins. MATCH employs local optimization for tracing partial sequence-specific assignments within a global, population-based search environment, where the simultaneous application of local and global optimization heuristics guarantees high efficiency and robustness. MATCH thus makes combined use of the two predominant concepts in use for automated NMR assignment of proteins. Dynamic transition and inherent mutation are new techniques that enable automatic adaptation to variable quality of the experimental input data. The concept of dynamic transition is incorporated in all major building blocks of the algorithm, where it enables switching between local and global optimization heuristics at any time during the assignment process. Inherent mutation restricts the intrinsically required randomness of the evolutionary algorithm to those regions of the conformation space that are compatible with the experimental input data. Using intact and artificially deteriorated APSY-NMR input data of proteins, MATCH performed sequence-specific resonance assignment with high efficiency and robustness.
Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall
2011-01-01
One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called NASCA (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), NASCA extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that NASCA assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by NASCA have backbone RMSD 0.8 – 1.5 Å from the reference structures determined by traditional NMR approaches. PMID:21706248
ECS: efficient communication scheduling for underwater sensor networks.
Hong, Lu; Hong, Feng; Guo, Zhongwen; Li, Zhengbao
2011-01-01
TDMA protocols have attracted a lot of attention for underwater acoustic sensor networks (UWSNs), because of the unique characteristics of acoustic signal propagation such as great energy consumption in transmission, long propagation delay and long communication range. Previous TDMA protocols all allocated transmission time to nodes based on discrete time slots. This paper proposes an efficient continuous time scheduling TDMA protocol (ECS) for UWSNs, including the continuous time based and sender oriented conflict analysis model, the transmission moment allocation algorithm and the distributed topology maintenance algorithm. Simulation results confirm that ECS improves network throughput by 20% on average, compared to existing MAC protocols.
Switching algorithm for maglev train double-modular redundant positioning sensors.
He, Ning; Long, Zhiqiang; Xue, Song
2012-01-01
High-resolution positioning for maglev trains is implemented by detecting the tooth-slot structure of the long stator installed along the rail, but there are large joint gaps between long stator sections. When a positioning sensor is below a large joint gap, its positioning signal is invalidated, thus double-modular redundant positioning sensors are introduced into the system. This paper studies switching algorithms for these redundant positioning sensors. At first, adaptive prediction is applied to the sensor signals. The prediction errors are used to trigger sensor switching. In order to enhance the reliability of the switching algorithm, wavelet analysis is introduced to suppress measuring disturbances without weakening the signal characteristics reflecting the stator joint gap based on the correlation between the wavelet coefficients of adjacent scales. The time delay characteristics of the method are analyzed to guide the algorithm simplification. Finally, the effectiveness of the simplified switching algorithm is verified through experiments.
Switching Algorithm for Maglev Train Double-Modular Redundant Positioning Sensors
He, Ning; Long, Zhiqiang; Xue, Song
2012-01-01
High-resolution positioning for maglev trains is implemented by detecting the tooth-slot structure of the long stator installed along the rail, but there are large joint gaps between long stator sections. When a positioning sensor is below a large joint gap, its positioning signal is invalidated, thus double-modular redundant positioning sensors are introduced into the system. This paper studies switching algorithms for these redundant positioning sensors. At first, adaptive prediction is applied to the sensor signals. The prediction errors are used to trigger sensor switching. In order to enhance the reliability of the switching algorithm, wavelet analysis is introduced to suppress measuring disturbances without weakening the signal characteristics reflecting the stator joint gap based on the correlation between the wavelet coefficients of adjacent scales. The time delay characteristics of the method are analyzed to guide the algorithm simplification. Finally, the effectiveness of the simplified switching algorithm is verified through experiments. PMID:23112657
PhosSA: Fast and accurate phosphorylation site assignment algorithm for mass spectrometry data.
Saeed, Fahad; Pisitkun, Trairak; Hoffert, Jason D; Rashidian, Sara; Wang, Guanghui; Gucek, Marjan; Knepper, Mark A
2013-11-07
Phosphorylation site assignment of high throughput tandem mass spectrometry (LC-MS/MS) data is one of the most common and critical aspects of phosphoproteomics. Correctly assigning phosphorylated residues helps us understand their biological significance. The design of common search algorithms (such as Sequest, Mascot etc.) do not incorporate site assignment; therefore additional algorithms are essential to assign phosphorylation sites for mass spectrometry data. The main contribution of this study is the design and implementation of a linear time and space dynamic programming strategy for phosphorylation site assignment referred to as PhosSA. The proposed algorithm uses summation of peak intensities associated with theoretical spectra as an objective function. Quality control of the assigned sites is achieved using a post-processing redundancy criteria that indicates the signal-to-noise ratio properties of the fragmented spectra. The quality assessment of the algorithm was determined using experimentally generated data sets using synthetic peptides for which phosphorylation sites were known. We report that PhosSA was able to achieve a high degree of accuracy and sensitivity with all the experimentally generated mass spectrometry data sets. The implemented algorithm is shown to be extremely fast and scalable with increasing number of spectra (we report up to 0.5 million spectra/hour on a moderate workstation). The algorithm is designed to accept results from both Sequest and Mascot search engines. An executable is freely available at http://helixweb.nih.gov/ESBL/PhosSA/ for academic research purposes.
Genetic algorithm to solve the problems of lectures and practicums scheduling
NASA Astrophysics Data System (ADS)
Syahputra, M. F.; Apriani, R.; Sawaluddin; Abdullah, D.; Albra, W.; Heikal, M.; Abdurrahman, A.; Khaddafi, M.
2018-02-01
Generally, the scheduling process is done manually. However, this method has a low accuracy level, along with possibilities that a scheduled process collides with another scheduled process. When doing theory class and practicum timetable scheduling process, there are numerous problems, such as lecturer teaching schedule collision, schedule collision with another schedule, practicum lesson schedules that collides with theory class, and the number of classrooms available. In this research, genetic algorithm is implemented to perform theory class and practicum timetable scheduling process. The algorithm will be used to process the data containing lists of lecturers, courses, and class rooms, obtained from information technology department at University of Sumatera Utara. The result of scheduling process using genetic algorithm is the most optimal timetable that conforms to available time slots, class rooms, courses, and lecturer schedules.
NASA Astrophysics Data System (ADS)
Bose, Sanjay K.
1991-02-01
Various mobile satellite communication systems are being developed for providing integrated voice/data services over a shared satellite transponder which is power-limited in nature. A common strategy is to use slotted ALOHA request channels to request channel assignments for voice/data calls from a network management station. To maximize efficiency in a system with a power-limited satellite transponder, it is proposed that the bursty nature of voice sources be exploited by the NMS to 'over-assign' channels. This may cause problems of inefficiency and potential instability, as well as a degradation in the quality of service. Augmenting this with the introduction of simple state-dependent control procedures provides systems which exhibit more desirable operational features.
An Algorithm for Protein Helix Assignment Using Helix Geometry
Cao, Chen; Xu, Shutan; Wang, Lincong
2015-01-01
Helices are one of the most common and were among the earliest recognized secondary structure elements in proteins. The assignment of helices in a protein underlies the analysis of its structure and function. Though the mathematical expression for a helical curve is simple, no previous assignment programs have used a genuine helical curve as a model for helix assignment. In this paper we present a two-step assignment algorithm. The first step searches for a series of bona fide helical curves each one best fits the coordinates of four successive backbone Cα atoms. The second step uses the best fit helical curves as input to make helix assignment. The application to the protein structures in the PDB (protein data bank) proves that the algorithm is able to assign accurately not only regular α-helix but also 310 and π helices as well as their left-handed versions. One salient feature of the algorithm is that the assigned helices are structurally more uniform than those by the previous programs. The structural uniformity should be useful for protein structure classification and prediction while the accurate assignment of a helix to a particular type underlies structure-function relationship in proteins. PMID:26132394
NASA Technical Reports Server (NTRS)
Mielke, Roland V. (Inventor); Stoughton, John W. (Inventor)
1990-01-01
Computationally complex primitive operations of an algorithm are executed concurrently in a plurality of functional units under the control of an assignment manager. The algorithm is preferably defined as a computationally marked graph contianing data status edges (paths) corresponding to each of the data flow edges. The assignment manager assigns primitive operations to the functional units and monitors completion of the primitive operations to determine data availability using the computational marked graph of the algorithm. All data accessing of the primitive operations is performed by the functional units independently of the assignment manager.
Tang, Wenming; Liu, Guixiong; Li, Yuzhong; Tan, Daji
2017-01-01
High data transmission efficiency is a key requirement for an ultrasonic phased array with multi-group ultrasonic sensors. Here, a novel FIFOs scheduling algorithm was proposed and the data transmission efficiency with hardware technology was improved. This algorithm includes FIFOs as caches for the ultrasonic scanning data obtained from the sensors with the output data in a bandwidth-sharing way, on the basis of which an optimal length ratio of all the FIFOs is achieved, allowing the reading operations to be switched among all the FIFOs without time slot waiting. Therefore, this algorithm enhances the utilization ratio of the reading bandwidth resources so as to obtain higher efficiency than the traditional scheduling algorithms. The reliability and validity of the algorithm are substantiated after its implementation in the field programmable gate array (FPGA) technology, and the bandwidth utilization ratio and the real-time performance of the ultrasonic phased array are enhanced. PMID:29035345
Unclassified Report on the President’s Surveillance Program
2009-07-10
for Intelligence Policy James Baker. Jay Bybee was OLC Assistant Attorney General from November 2001 through March 2003, and Yoo’s supervisor. Bybee ...Attorney General slots. Bybee said he was "enthusiastic" about Yoo and later agreed to Yoo’s request to be assigned to the "national security portfolio...34 because Y00 had more national security experience than any of the other OLC deputies. However, Bybee stated he was never read into the PSP and could
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
Quantum Algorithms and Protocols
NASA Astrophysics Data System (ADS)
Divincenzo, David
2001-06-01
Quantum Computing is better than classical computing, but not just because it speeds up some computations. Some of the best known quantum algorithms, like Grover's, may well have their most interesting applications in settings that involve the combination of computation and communication. Thus, Grover speeds up the appointment scheduling problem by reducing the amount of communication needed between two parties who want to find a common free slot on their calendars. I will review various other applications of this sort that are being explored. Other distributed computing protocols are required to have other attributes like obliviousness and privacy; I will discuss our recent applications involving quantum data hiding.
ECS: Efficient Communication Scheduling for Underwater Sensor Networks
Hong, Lu; Hong, Feng; Guo, Zhongwen; Li, Zhengbao
2011-01-01
TDMA protocols have attracted a lot of attention for underwater acoustic sensor networks (UWSNs), because of the unique characteristics of acoustic signal propagation such as great energy consumption in transmission, long propagation delay and long communication range. Previous TDMA protocols all allocated transmission time to nodes based on discrete time slots. This paper proposes an efficient continuous time scheduling TDMA protocol (ECS) for UWSNs, including the continuous time based and sender oriented conflict analysis model, the transmission moment allocation algorithm and the distributed topology maintenance algorithm. Simulation results confirm that ECS improves network throughput by 20% on average, compared to existing MAC protocols. PMID:22163775
Automatic paper sliceform design from 3D solid models.
Le-Nguyen, Tuong-Vu; Low, Kok-Lim; Ruiz, Conrado; Le, Sang N
2013-11-01
A paper sliceform or lattice-style pop-up is a form of papercraft that uses two sets of parallel paper patches slotted together to make a foldable structure. The structure can be folded flat, as well as fully opened (popped-up) to make the two sets of patches orthogonal to each other. Automatic design of paper sliceforms is still not supported by existing computational models and remains a challenge. We propose novel geometric formulations of valid paper sliceform designs that consider the stability, flat-foldability and physical realizability of the designs. Based on a set of sufficient construction conditions, we also present an automatic algorithm for generating valid sliceform designs that closely depict the given 3D solid models. By approximating the input models using a set of generalized cylinders, our method significantly reduces the search space for stable and flat-foldable sliceforms. To ensure the physical realizability of the designs, the algorithm automatically generates slots or slits on the patches such that no two cycles embedded in two different patches are interlocking each other. This guarantees local pairwise assembility between patches, which is empirically shown to lead to global assembility. Our method has been demonstrated on a number of example models, and the output designs have been successfully made into real paper sliceforms.
A New Secondary Structure Assignment Algorithm Using Cα Backbone Fragments
Cao, Chen; Wang, Guishen; Liu, An; Xu, Shutan; Wang, Lincong; Zou, Shuxue
2016-01-01
The assignment of secondary structure elements in proteins is a key step in the analysis of their structures and functions. We have developed an algorithm, SACF (secondary structure assignment based on Cα fragments), for secondary structure element (SSE) assignment based on the alignment of Cα backbone fragments with central poses derived by clustering known SSE fragments. The assignment algorithm consists of three steps: First, the outlier fragments on known SSEs are detected. Next, the remaining fragments are clustered to obtain the central fragments for each cluster. Finally, the central fragments are used as a template to make assignments. Following a large-scale comparison of 11 secondary structure assignment methods, SACF, KAKSI and PROSS are found to have similar agreement with DSSP, while PCASSO agrees with DSSP best. SACF and PCASSO show preference to reducing residues in N and C cap regions, whereas KAKSI, P-SEA and SEGNO tend to add residues to the terminals when DSSP assignment is taken as standard. Moreover, our algorithm is able to assign subtle helices (310-helix, π-helix and left-handed helix) and make uniform assignments, as well as to detect rare SSEs in β-sheets or long helices as outlier fragments from other programs. The structural uniformity should be useful for protein structure classification and prediction, while outlier fragments underlie the structure–function relationship. PMID:26978354
A Markov Random Field Framework for Protein Side-Chain Resonance Assignment
NASA Astrophysics Data System (ADS)
Zeng, Jianyang; Zhou, Pei; Donald, Bruce Randall
Nuclear magnetic resonance (NMR) spectroscopy plays a critical role in structural genomics, and serves as a primary tool for determining protein structures, dynamics and interactions in physiologically-relevant solution conditions. The current speed of protein structure determination via NMR is limited by the lengthy time required in resonance assignment, which maps spectral peaks to specific atoms and residues in the primary sequence. Although numerous algorithms have been developed to address the backbone resonance assignment problem [68,2,10,37,14,64,1,31,60], little work has been done to automate side-chain resonance assignment [43, 48, 5]. Most previous attempts in assigning side-chain resonances depend on a set of NMR experiments that record through-bond interactions with side-chain protons for each residue. Unfortunately, these NMR experiments have low sensitivity and limited performance on large proteins, which makes it difficult to obtain enough side-chain resonance assignments. On the other hand, it is essential to obtain almost all of the side-chain resonance assignments as a prerequisite for high-resolution structure determination. To overcome this deficiency, we present a novel side-chain resonance assignment algorithm based on alternative NMR experiments measuring through-space interactions between protons in the protein, which also provide crucial distance restraints and are normally required in high-resolution structure determination. We cast the side-chain resonance assignment problem into a Markov Random Field (MRF) framework, and extend and apply combinatorial protein design algorithms to compute the optimal solution that best interprets the NMR data. Our MRF framework captures the contact map information of the protein derived from NMR spectra, and exploits the structural information available from the backbone conformations determined by orientational restraints and a set of discretized side-chain conformations (i.e., rotamers). A Hausdorff-based computation is employed in the scoring function to evaluate the probability of side-chain resonance assignments to generate the observed NMR spectra. The complexity of the assignment problem is first reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is used to find a set of optimal side-chain resonance assignments that best fit the NMR data. We have tested our algorithm on NMR data for five proteins, including the FF Domain 2 of human transcription elongation factor CA150 (FF2), the B1 domain of Protein G (GB1), human ubiquitin, the ubiquitin-binding zinc finger domain of the human Y-family DNA polymerase Eta (pol η UBZ), and the human Set2-Rpb1 interacting domain (hSRI). Our algorithm assigns resonances for more than 90% of the protons in the proteins, and achieves about 80% correct side-chain resonance assignments. The final structures computed using distance restraints resulting from the set of assigned side-chain resonances have backbone RMSD 0.5 - 1.4 Å and all-heavy-atom RMSD 1.0 - 2.2 Å from the reference structures that were determined by X-ray crystallography or traditional NMR approaches. These results demonstrate that our algorithm can be successfully applied to automate side-chain resonance assignment and high-quality protein structure determination. Since our algorithm does not require any specific NMR experiments for measuring the through-bond interactions with side-chain protons, it can save a significant amount of both experimental cost and spectrometer time, and hence accelerate the NMR structure determination process.
NASA Astrophysics Data System (ADS)
Bose, Sanjay K.; Gordon, J. J.
The modeling and analysis of a system providing integrated voice/data services to mobile terminals over a power-limited satellite channel are discussed. The mobiles use slotted Aloha random access to send requests for channel assignments to a central station. For successful requests, the actual transmission of voice/data within a call is done using the channel assigned for this purpose by the central station. The satellite channel is assumed to be power limited. Taking into account the known burstiness of voice sources (which use a voice-activated switch), the central station overassigns channels so that the average total power is below the power limit of the satellite transponder. The performance of this model is analyzed. Certain simple, static control strategies for improving performance are also proposed.
Yang, Yu; Fritzsching, Keith J; Hong, Mei
2013-11-01
A multi-objective genetic algorithm is introduced to predict the assignment of protein solid-state NMR (SSNMR) spectra with partial resonance overlap and missing peaks due to broad linewidths, molecular motion, and low sensitivity. This non-dominated sorting genetic algorithm II (NSGA-II) aims to identify all possible assignments that are consistent with the spectra and to compare the relative merit of these assignments. Our approach is modeled after the recently introduced Monte-Carlo simulated-annealing (MC/SA) protocol, with the key difference that NSGA-II simultaneously optimizes multiple assignment objectives instead of searching for possible assignments based on a single composite score. The multiple objectives include maximizing the number of consistently assigned peaks between multiple spectra ("good connections"), maximizing the number of used peaks, minimizing the number of inconsistently assigned peaks between spectra ("bad connections"), and minimizing the number of assigned peaks that have no matching peaks in the other spectra ("edges"). Using six SSNMR protein chemical shift datasets with varying levels of imperfection that was introduced by peak deletion, random chemical shift changes, and manual peak picking of spectra with moderately broad linewidths, we show that the NSGA-II algorithm produces a large number of valid and good assignments rapidly. For high-quality chemical shift peak lists, NSGA-II and MC/SA perform similarly well. However, when the peak lists contain many missing peaks that are uncorrelated between different spectra and have chemical shift deviations between spectra, the modified NSGA-II produces a larger number of valid solutions than MC/SA, and is more effective at distinguishing good from mediocre assignments by avoiding the hazard of suboptimal weighting factors for the various objectives. These two advantages, namely diversity and better evaluation, lead to a higher probability of predicting the correct assignment for a larger number of residues. On the other hand, when there are multiple equally good assignments that are significantly different from each other, the modified NSGA-II is less efficient than MC/SA in finding all the solutions. This problem is solved by a combined NSGA-II/MC algorithm, which appears to have the advantages of both NSGA-II and MC/SA. This combination algorithm is robust for the three most difficult chemical shift datasets examined here and is expected to give the highest-quality de novo assignment of challenging protein NMR spectra.
Rotor for a line start permanent magnet machine
DOE Office of Scientific and Technical Information (OSTI.GOV)
Melfi, Mike; Schiferl, Rich; Umans, Stephen
A rotor comprises laminations with a plurality of rotor bar slots with an asymmetric arrangement about the rotor. The laminations also have magnet slots equiangularly spaced about the rotor. The magnet slots extend near to the rotor outer diameter and have permanent magnets disposed in the magnet slots creating magnetic poles. The magnet slots may be formed longer than the permanent magnets disposed in the magnets slots and define one or more magnet slot apertures. The permanent magnets define a number of poles and a pole pitch. The rotor bar slots are spaced from adjacent magnet slots by a distancemore » that is at least 4% of the pole pitch. Conductive material is disposed in the rotor bar slots, and in some embodiments, may be disposed in the magnet slot apertures.« less
Major, Thomas W.; Carey, Jason P.; Nobes, David S.; Major, Paul W.
2010-01-01
In all manufacturing processes there are tolerances; however, orthodontic bracket manufacturers seldom state the slot dimensional tolerances. This experiment develops a novel method of analyzing slot profile dimensions using photographs of the slot. Five points are selected along each wall, and lines are fitted to define a trapezoidal slot shape. This investigation measures slot height at the slot's top and bottom, angles between walls, slot taper, and the linearity of each wall. Slot dimensions for 30 upper right central incisor self-ligating stainless steel brackets from three manufacturers were evaluated. Speed brackets have a slot height 2% smaller than the nominal 0.559 mm size and have a slightly convergent taper. In-Ovation brackets have a divergent taper at an average angle of 1.47 degrees. In-Ovation is closest to the nominal value of slot height at the slot base and has the smallest manufacturing tolerances. Damon Q brackets are the most rectangular in shape, with nearly 90-degree corners between the slot bottom and walls. Damon slot height is on average 3% oversized. PMID:20981299
Real-Time Station Grouping under Dynamic Traffic for IEEE 802.11ah
Tian, Le; Latré, Steven
2017-01-01
IEEE 802.11ah, marketed as Wi-Fi HaLow, extends Wi-Fi to the sub-1 GHz spectrum. Through a number of physical layer (PHY) and media access control (MAC) optimizations, it aims to bring greatly increased range, energy-efficiency, and scalability. This makes 802.11ah the perfect candidate for providing connectivity to Internet of Things (IoT) devices. One of these new features, referred to as the Restricted Access Window (RAW), focuses on improving scalability in highly dense deployments. RAW divides stations into groups and reduces contention and collisions by only allowing channel access to one group at a time. However, the standard does not dictate how to determine the optimal RAW grouping parameters. The optimal parameters depend on the current network conditions, and it has been shown that incorrect configuration severely impacts throughput, latency and energy efficiency. In this paper, we propose a traffic-adaptive RAW optimization algorithm (TAROA) to adapt the RAW parameters in real time based on the current traffic conditions, optimized for sensor networks in which each sensor transmits packets with a certain (predictable) frequency and may change the transmission frequency over time. The TAROA algorithm is executed at each target beacon transmission time (TBTT), and it first estimates the packet transmission interval of each station only based on packet transmission information obtained by access point (AP) during the last beacon interval. Then, TAROA determines the RAW parameters and assigns stations to RAW slots based on this estimated transmission frequency. The simulation results show that, compared to enhanced distributed channel access/distributed coordination function (EDCA/DCF), the TAROA algorithm can highly improve the performance of IEEE 802.11ah dense networks in terms of throughput, especially when hidden nodes exist, although it does not always achieve better latency performance. This paper contributes with a practical approach to optimizing RAW grouping under dynamic traffic in real time, which is a major leap towards applying RAW mechanism in real-life IoT networks. PMID:28677617
Real-Time Station Grouping under Dynamic Traffic for IEEE 802.11ah.
Tian, Le; Khorov, Evgeny; Latré, Steven; Famaey, Jeroen
2017-07-04
IEEE 802.11ah, marketed as Wi-Fi HaLow, extends Wi-Fi to the sub-1 GHz spectrum. Through a number of physical layer (PHY) and media access control (MAC) optimizations, it aims to bring greatly increased range, energy-efficiency, and scalability. This makes 802.11ah the perfect candidate for providing connectivity to Internet of Things (IoT) devices. One of these new features, referred to as the Restricted Access Window (RAW), focuses on improving scalability in highly dense deployments. RAW divides stations into groups and reduces contention and collisions by only allowing channel access to one group at a time. However, the standard does not dictate how to determine the optimal RAW grouping parameters. The optimal parameters depend on the current network conditions, and it has been shown that incorrect configuration severely impacts throughput, latency and energy efficiency. In this paper, we propose a traffic-adaptive RAW optimization algorithm (TAROA) to adapt the RAW parameters in real time based on the current traffic conditions, optimized for sensor networks in which each sensor transmits packets with a certain (predictable) frequency and may change the transmission frequency over time. The TAROA algorithm is executed at each target beacon transmission time (TBTT), and it first estimates the packet transmission interval of each station only based on packet transmission information obtained by access point (AP) during the last beacon interval. Then, TAROA determines the RAW parameters and assigns stations to RAW slots based on this estimated transmission frequency. The simulation results show that, compared to enhanced distributed channel access/distributed coordination function (EDCA/DCF), the TAROA algorithm can highly improve the performance of IEEE 802.11ah dense networks in terms of throughput, especially when hidden nodes exist, although it does not always achieve better latency performance. This paper contributes with a practical approach to optimizing RAW grouping under dynamic traffic in real time, which is a major leap towards applying RAW mechanism in real-life IoT networks.
Runway Operations Planning: A Two-Stage Solution Methodology
NASA Technical Reports Server (NTRS)
Anagnostakis, Ioannis; Clarke, John-Paul
2003-01-01
The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.
Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Syed A. Ahmad; Umesh Shukla; Ryan E. Irwin
2011-03-01
In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five algorithms representative of DCPA used in literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate themore » effectiveness of the algorithms in achieving feasible link allocations in the network, as well as their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment (LICIPA) algorithm does not require cross-link gain information, has the overall lowest run time, and highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.« less
Dynamic traffic assignment : genetic algorithms approach
DOT National Transportation Integrated Search
1997-01-01
Real-time route guidance is a promising approach to alleviating congestion on the nations highways. A dynamic traffic assignment model is central to the development of guidance strategies. The artificial intelligence technique of genetic algorithm...
NASA Astrophysics Data System (ADS)
Yeh, Cheng-Ta; Lin, Yi-Kuei; Yang, Jo-Yun
2018-07-01
Network reliability is an important performance index for many real-life systems, such as electric power systems, computer systems and transportation systems. These systems can be modelled as stochastic-flow networks (SFNs) composed of arcs and nodes. Most system supervisors respect the network reliability maximization by finding the optimal multi-state resource assignment, which is one resource to each arc. However, a disaster may cause correlated failures for the assigned resources, affecting the network reliability. This article focuses on determining the optimal resource assignment with maximal network reliability for SFNs. To solve the problem, this study proposes a hybrid algorithm integrating the genetic algorithm and tabu search to determine the optimal assignment, called the hybrid GA-TS algorithm (HGTA), and integrates minimal paths, recursive sum of disjoint products and the correlated binomial distribution to calculate network reliability. Several practical numerical experiments are adopted to demonstrate that HGTA has better computational quality than several popular soft computing algorithms.
Evaluation of Automatically Assigned Job-Specific Interview Modules
Friesen, Melissa C.; Lan, Qing; Ge, Calvin; Locke, Sarah J.; Hosgood, Dean; Fritschi, Lin; Sadkowsky, Troy; Chen, Yu-Cheng; Wei, Hu; Xu, Jun; Lam, Tai Hing; Kwong, Yok Lam; Chen, Kexin; Xu, Caigang; Su, Yu-Chieh; Chiu, Brian C. H.; Ip, Kai Ming Dennis; Purdue, Mark P.; Bassig, Bryan A.; Rothman, Nat; Vermeulen, Roel
2016-01-01
Objective: In community-based epidemiological studies, job- and industry-specific ‘modules’ are often used to systematically obtain details about the subject’s work tasks. The module assignment is often made by the interviewer, who may have insufficient occupational hygiene knowledge to assign the correct module. We evaluated, in the context of a case–control study of lymphoid neoplasms in Asia (‘AsiaLymph’), the performance of an algorithm that provided automatic, real-time module assignment during a computer-assisted personal interview. Methods: AsiaLymph’s occupational component began with a lifetime occupational history questionnaire with free-text responses and three solvent exposure screening questions. To assign each job to one of 23 study-specific modules, an algorithm automatically searched the free-text responses to the questions ‘job title’ and ‘product made or services provided by employer’ using a list of module-specific keywords, comprising over 5800 keywords in English, Traditional and Simplified Chinese. Hierarchical decision rules were used when the keyword match triggered multiple modules. If no keyword match was identified, a generic solvent module was assigned if the subject responded ‘yes’ to any of the three solvent screening questions. If these question responses were all ‘no’, a work location module was assigned, which redirected the subject to the farming, teaching, health professional, solvent, or industry solvent modules or ended the questions for that job, depending on the location response. We conducted a reliability assessment that compared the algorithm-assigned modules to consensus module assignments made by two industrial hygienists for a subset of 1251 (of 11409) jobs selected using a stratified random selection procedure using module-specific strata. Discordant assignments between the algorithm and consensus assignments (483 jobs) were qualitatively reviewed by the hygienists to evaluate the potential information lost from missed questions with using the algorithm-assigned module (none, low, medium, high). Results: The most frequently assigned modules were the work location (33%), solvent (20%), farming and food industry (19%), and dry cleaning and textile industry (6.4%) modules. In the reliability subset, the algorithm assignment had an exact match to the expert consensus-assigned module for 722 (57.7%) of the 1251 jobs. Overall, adjusted for the proportion of jobs in each stratum, we estimated that 86% of the algorithm-assigned modules would result in no information loss, 2% would have low information loss, and 12% would have medium to high information loss. Medium to high information loss occurred for <10% of the jobs assigned the generic solvent module and for 21, 32, and 31% of the jobs assigned the work location module with location responses of ‘someplace else’, ‘factory’, and ‘don’t know’, respectively. Other work location responses had ≤8% with medium to high information loss because of redirections to other modules. Medium to high information loss occurred more frequently when a job description matched with multiple keywords pointing to different modules (29–69%, depending on the triggered assignment rule). Conclusions: These evaluations demonstrated that automatically assigned modules can reliably reproduce an expert’s module assignment without the direct involvement of an industrial hygienist or interviewer. The feasibility of adapting this framework to other studies will be language- and exposure-specific. PMID:27250109
Evaluation of Automatically Assigned Job-Specific Interview Modules.
Friesen, Melissa C; Lan, Qing; Ge, Calvin; Locke, Sarah J; Hosgood, Dean; Fritschi, Lin; Sadkowsky, Troy; Chen, Yu-Cheng; Wei, Hu; Xu, Jun; Lam, Tai Hing; Kwong, Yok Lam; Chen, Kexin; Xu, Caigang; Su, Yu-Chieh; Chiu, Brian C H; Ip, Kai Ming Dennis; Purdue, Mark P; Bassig, Bryan A; Rothman, Nat; Vermeulen, Roel
2016-08-01
In community-based epidemiological studies, job- and industry-specific 'modules' are often used to systematically obtain details about the subject's work tasks. The module assignment is often made by the interviewer, who may have insufficient occupational hygiene knowledge to assign the correct module. We evaluated, in the context of a case-control study of lymphoid neoplasms in Asia ('AsiaLymph'), the performance of an algorithm that provided automatic, real-time module assignment during a computer-assisted personal interview. AsiaLymph's occupational component began with a lifetime occupational history questionnaire with free-text responses and three solvent exposure screening questions. To assign each job to one of 23 study-specific modules, an algorithm automatically searched the free-text responses to the questions 'job title' and 'product made or services provided by employer' using a list of module-specific keywords, comprising over 5800 keywords in English, Traditional and Simplified Chinese. Hierarchical decision rules were used when the keyword match triggered multiple modules. If no keyword match was identified, a generic solvent module was assigned if the subject responded 'yes' to any of the three solvent screening questions. If these question responses were all 'no', a work location module was assigned, which redirected the subject to the farming, teaching, health professional, solvent, or industry solvent modules or ended the questions for that job, depending on the location response. We conducted a reliability assessment that compared the algorithm-assigned modules to consensus module assignments made by two industrial hygienists for a subset of 1251 (of 11409) jobs selected using a stratified random selection procedure using module-specific strata. Discordant assignments between the algorithm and consensus assignments (483 jobs) were qualitatively reviewed by the hygienists to evaluate the potential information lost from missed questions with using the algorithm-assigned module (none, low, medium, high). The most frequently assigned modules were the work location (33%), solvent (20%), farming and food industry (19%), and dry cleaning and textile industry (6.4%) modules. In the reliability subset, the algorithm assignment had an exact match to the expert consensus-assigned module for 722 (57.7%) of the 1251 jobs. Overall, adjusted for the proportion of jobs in each stratum, we estimated that 86% of the algorithm-assigned modules would result in no information loss, 2% would have low information loss, and 12% would have medium to high information loss. Medium to high information loss occurred for <10% of the jobs assigned the generic solvent module and for 21, 32, and 31% of the jobs assigned the work location module with location responses of 'someplace else', 'factory', and 'don't know', respectively. Other work location responses had ≤8% with medium to high information loss because of redirections to other modules. Medium to high information loss occurred more frequently when a job description matched with multiple keywords pointing to different modules (29-69%, depending on the triggered assignment rule). These evaluations demonstrated that automatically assigned modules can reliably reproduce an expert's module assignment without the direct involvement of an industrial hygienist or interviewer. The feasibility of adapting this framework to other studies will be language- and exposure-specific. Published by Oxford University Press on behalf of the British Occupational Hygiene Society 2016.
Time-aware service-classified spectrum defragmentation algorithm for flex-grid optical networks
NASA Astrophysics Data System (ADS)
Qiu, Yang; Xu, Jing
2018-01-01
By employing sophisticated routing and spectrum assignment (RSA) algorithms together with a finer spectrum granularity (namely frequency slot) in resource allocation procedures, flex-grid optical networks can accommodate diverse kinds of services with high spectrum-allocation flexibility and resource-utilization efficiency. However, the continuity and the contiguity constraints in spectrum allocation procedures may always induce some isolated, small-sized, and unoccupied spectral blocks (known as spectrum fragments) in flex-grid optical networks. Although these spectrum fragments are left unoccupied, they can hardly be utilized by the subsequent service requests directly because of their spectral characteristics and the constraints in spectrum allocation. In this way, the existence of spectrum fragments may exhaust the available spectrum resources for a coming service request and thus worsens the networking performance. Therefore, many reactive defragmentation algorithms have been proposed to handle the fragmented spectrum resources via re-optimizing the routing paths and the spectrum resources for the existing services. But the routing-path and the spectrum-resource re-optimization in reactive defragmentation algorithms may possibly disrupt the traffic of the existing services and require extra components. By comparison, some proactive defragmentation algorithms (e.g. fragmentation-aware algorithms) were proposed to suppress spectrum fragments from their generation instead of handling the fragmented spectrum resources. Although these proactive defragmentation algorithms induced no traffic disruption and required no extra components, they always left the generated spectrum fragments unhandled, which greatly affected their efficiency in spectrum defragmentation. In this paper, by comprehensively considering the characteristics of both the reactive and the proactive defragmentation algorithms, we proposed a time-aware service-classified (TASC) spectrum defragmentation algorithm, which simultaneously employed proactive and reactive mechanisms in suppressing spectrum fragments with the awareness of services' types and their duration times. By dividing the spectrum resources into several flexible groups according to services' types and limiting both the spectrum allocation and the spectrum re-tuning for a certain service inside one specific spectrum group according to its type, the proposed TASC defragmentation algorithm cannot only suppress spectrum fragments from generation inside each spectrum group, but also handle the fragments generated between two adjacent groups. In this way, the proposed TASC algorithm gains higher efficiency in suppressing spectrum fragments than both the reactive and the proactive defragmentation algorithms. Additionally, as the generation of spectrum fragments is retrained between spectrum groups and the defragmentation procedure is limited inside each spectrum group, the induced traffic disruption for the existing services can be possibly reduced. Besides, the proposed TASC defragmentation algorithm always re-tunes the spectrum resources of the service with the maximum duration time first in spectrum defragmentation procedure, which can further reduce spectrum fragments because of the fact that the services with longer duration times always have higher possibility in inducing spectrum fragments than the services with shorter duration times. The simulation results show that the proposed TASC defragmentation algorithm can significantly reduce the number of the generated spectrum fragments while improving the service blocking performance.
Kong, Deqing; Tsubokawa, Makoto
2015-07-27
We numerically analyzed the power-coupling characteristics between a high-index-contrast dielectric slot waveguide and a metal-insulator-metal (MIM) plasmonic slot waveguide as functions of structural parameters. Couplings due mainly to the transfer of evanescent components in two waveguides generated high transmission efficiencies of 62% when the slot widths of the two waveguides were the same and 73% when the waveguides were optimized by slightly different widths. The maximum transmission efficiency in the slot-to-slot coupling was about 10% higher than that in the coupling between a normal slab waveguide and an MIM waveguide. Large alignment tolerance of the slot-to-slot coupling was also proved. Moreover, a small gap inserted into the interface between two waveguides effectively enhances the transmission efficiency, as in the case of couplings between a normal slab waveguide and an MIM waveguide. In addition, couplings with very wideband transmissions over a wavelength region of a few hundred nanometers were validated.
An Energy Efficient MAC Protocol for Multi-Hop Swallowable Body Sensor Networks
Lin, Lin; Yang, Chengfeng; Wong, Kai Juan; Yan, Hao; Shen, Junwen; Phee, Soo Jay
2014-01-01
Swallowable body sensor networks (BSNs) are composed of sensors which are swallowed by patients and send the collected data to the outside coordinator. These sensors are energy constraint and the batteries are difficult to be replaced. The medium access control (MAC) protocol plays an important role in energy management. This paper investigates an energy efficient MAC protocol design for swallowable BSNs. Multi-hop communication is analyzed and proved more energy efficient than single-hop communication within the human body when the circuitry power is low. Based on this result, a centrally controlled time slotting schedule is proposed. The major workload is shifted from the sensors to the coordinator. The coordinator collects the path-loss map and calculates the schedules, including routing, slot assignment and transmission power. Sensor nodes follow the schedules to send data in a multi-hop way. The proposed protocol is compared with the IEEE 802.15.6 protocol in terms of energy consumption. The results show that it is more energy efficient than IEEE 802.15.6 for swallowable BSN scenarios. PMID:25330049
Variable Star Signature Classification using Slotted Symbolic Markov Modeling
NASA Astrophysics Data System (ADS)
Johnston, K. B.; Peter, A. M.
2017-01-01
With the advent of digital astronomy, new benefits and new challenges have been presented to the modern day astronomer. No longer can the astronomer rely on manual processing, instead the profession as a whole has begun to adopt more advanced computational means. This paper focuses on the construction and application of a novel time-domain signature extraction methodology and the development of a supporting supervised pattern classification algorithm for the identification of variable stars. A methodology for the reduction of stellar variable observations (time-domain data) into a novel feature space representation is introduced. The methodology presented will be referred to as Slotted Symbolic Markov Modeling (SSMM) and has a number of advantages which will be demonstrated to be beneficial; specifically to the supervised classification of stellar variables. It will be shown that the methodology outperformed a baseline standard methodology on a standardized set of stellar light curve data. The performance on a set of data derived from the LINEAR dataset will also be shown.
Variable Star Signature Classification using Slotted Symbolic Markov Modeling
NASA Astrophysics Data System (ADS)
Johnston, Kyle B.; Peter, Adrian M.
2016-01-01
With the advent of digital astronomy, new benefits and new challenges have been presented to the modern day astronomer. No longer can the astronomer rely on manual processing, instead the profession as a whole has begun to adopt more advanced computational means. Our research focuses on the construction and application of a novel time-domain signature extraction methodology and the development of a supporting supervised pattern classification algorithm for the identification of variable stars. A methodology for the reduction of stellar variable observations (time-domain data) into a novel feature space representation is introduced. The methodology presented will be referred to as Slotted Symbolic Markov Modeling (SSMM) and has a number of advantages which will be demonstrated to be beneficial; specifically to the supervised classification of stellar variables. It will be shown that the methodology outperformed a baseline standard methodology on a standardized set of stellar light curve data. The performance on a set of data derived from the LINEAR dataset will also be shown.
Prioritized retransmission in slotted all-optical packet-switched networks
NASA Astrophysics Data System (ADS)
Ghaffar Pour Rahbar, Akbar; Yang, Oliver
2006-12-01
We consider an all-optical slotted packet-switched network interconnected by a number of bufferless all-optical switches with contention-based operation. One approach to reduce the cost of the expensive contention resolution hardware could be retransmission in which each ingress switch keeps a copy of the transmitted traffic in the electronic buffer and retransmits whenever required. The conventional retransmission technique may need a higher number of retransmissions until traffic passes through the network. This in turn may lead to a retransmission at a higher layer and reduce the network throughput. In this paper, we propose and analyze a simple but effective prioritized retransmission technique in which dropped traffic is prioritized when retransmitted from ingress switches so that the core switch can process them with a higher priority. We present the analysis of both techniques in multifiber network architecture and verify it via simulation to demonstrate that our proposed algorithm can limit the number of retransmissions significantly and can improve TCP throughput better than the conventional retransmission technique.
A broadband double-slot waveguide antenna
NASA Astrophysics Data System (ADS)
Kisliuk, M.; Axelrod, A.
1987-09-01
A double transverse slot broadband antenna based on the H-guide transverse-slot radiator design of Kisliuk and Axelrod (1985) is described. The double transverse slot antenna may be used in microwave and mm-wave applications (as a phased array element), in imaging systems, or as a stand-alone linearly polarized antenna. The equations for calculating the radiation efficiency and the input impedance and the experimental and theoretical curves for radiation efficiency of the double-slot antenna are presented along with diagrams of the antenna and the equivalent circuit of an individual slot in a slot array.
Application of a fast sorting algorithm to the assignment of mass spectrometric cross-linking data.
Petrotchenko, Evgeniy V; Borchers, Christoph H
2014-09-01
Cross-linking combined with MS involves enzymatic digestion of cross-linked proteins and identifying cross-linked peptides. Assignment of cross-linked peptide masses requires a search of all possible binary combinations of peptides from the cross-linked proteins' sequences, which becomes impractical with increasing complexity of the protein system and/or if digestion enzyme specificity is relaxed. Here, we describe the application of a fast sorting algorithm to search large sequence databases for cross-linked peptide assignments based on mass. This same algorithm has been used previously for assigning disulfide-bridged peptides (Choi et al., ), but has not previously been applied to cross-linking studies. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Gómez-Espinosa, Alfonso; Hernández-Guzmán, Víctor M.; Bandala-Sánchez, Manuel; Jiménez-Hernández, Hugo; Rivas-Araiza, Edgar A.; Rodríguez-Reséndiz, Juvenal; Herrera-Ruíz, Gilberto
2013-01-01
Torque ripple occurs in Permanent Magnet Synchronous Motors (PMSMs) due to the non-sinusoidal flux density distribution around the air-gap and variable magnetic reluctance of the air-gap due to the stator slots distribution. These torque ripples change periodically with rotor position and are apparent as speed variations, which degrade the PMSM drive performance, particularly at low speeds, because of low inertial filtering. In this paper, a new self-tuning algorithm is developed for determining the Fourier Series Controller coefficients with the aim of reducing the torque ripple in a PMSM, thus allowing for a smoother operation. This algorithm adjusts the controller parameters based on the component's harmonic distortion in time domain of the compensation signal. Experimental evaluation is performed on a DSP-controlled PMSM evaluation platform. Test results obtained validate the effectiveness of the proposed self-tuning algorithm, with the Fourier series expansion scheme, in reducing the torque ripple. PMID:23519345
AUTOBA: automation of backbone assignment from HN(C)N suite of experiments.
Borkar, Aditi; Kumar, Dinesh; Hosur, Ramakrishna V
2011-07-01
Development of efficient strategies and automation represent important milestones of progress in rapid structure determination efforts in proteomics research. In this context, we present here an efficient algorithm named as AUTOBA (Automatic Backbone Assignment) designed to automate the assignment protocol based on HN(C)N suite of experiments. Depending upon the spectral dispersion, the user can record 2D or 3D versions of the experiments for assignment. The algorithm uses as inputs: (i) protein primary sequence and (ii) peak-lists from user defined HN(C)N suite of experiments. In the end, one gets H(N), (15)N, C(α) and C' assignments (in common BMRB format) for the individual residues along the polypeptide chain. The success of the algorithm has been demonstrated, not only with experimental spectra recorded on two small globular proteins: ubiquitin (76 aa) and M-crystallin (85 aa), but also with simulated spectra of 27 other proteins using assignment data from the BMRB.
Analysis of labor employment assessment on production machine to minimize time production
NASA Astrophysics Data System (ADS)
Hernawati, Tri; Suliawati; Sari Gumay, Vita
2018-03-01
Every company both in the field of service and manufacturing always trying to pass efficiency of it’s resource use. One resource that has an important role is labor. Labor has different efficiency levels for different jobs anyway. Problems related to the optimal allocation of labor that has different levels of efficiency for different jobs are called assignment problems, which is a special case of linear programming. In this research, Analysis of Labor Employment Assesment on Production Machine to Minimize Time Production, in PT PDM is done by using Hungarian algorithm. The aim of the research is to get the assignment of optimal labor on production machine to minimize time production. The results showed that the assignment of existing labor is not suitable because the time of completion of the assignment is longer than the assignment by using the Hungarian algorithm. By applying the Hungarian algorithm obtained time savings of 16%.
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 algorithm for the design and tuning of RF accelerating structures with variable cell lengths
NASA Astrophysics Data System (ADS)
Lal, Shankar; Pant, K. K.
2018-05-01
An algorithm is proposed for the design of a π mode standing wave buncher structure with variable cell lengths. It employs a two-parameter, multi-step approach for the design of the structure with desired resonant frequency and field flatness. The algorithm, along with analytical scaling laws for the design of the RF power coupling slot, makes it possible to accurately design the structure employing a freely available electromagnetic code like SUPERFISH. To compensate for machining errors, a tuning method has been devised to achieve desired RF parameters for the structure, which has been qualified by the successful tuning of a 7-cell buncher to π mode frequency of 2856 MHz with field flatness <3% and RF coupling coefficient close to unity. The proposed design algorithm and tuning method have demonstrated the feasibility of developing an S-band accelerating structure for desired RF parameters with a relatively relaxed machining tolerance of ∼ 25 μm. This paper discusses the algorithm for the design and tuning of an RF accelerating structure with variable cell lengths.
Gómez-Espinosa, Alfonso; Hernández-Guzmán, Víctor M; Bandala-Sánchez, Manuel; Jiménez-Hernández, Hugo; Rivas-Araiza, Edgar A; Rodríguez-Reséndiz, Juvenal; Herrera-Ruíz, Gilberto
2013-03-19
A New Adaptive Self-Tuning Fourier Coefficients Algorithm for Periodic Torque Ripple Minimization in Permanent Magnet Synchronous Motors (PMSM) Torque ripple occurs in Permanent Magnet Synchronous Motors (PMSMs) due to the non-sinusoidal flux density distribution around the air-gap and variable magnetic reluctance of the air-gap due to the stator slots distribution. These torque ripples change periodically with rotor position and are apparent as speed variations, which degrade the PMSM drive performance, particularly at low speeds, because of low inertial filtering. In this paper, a new self-tuning algorithm is developed for determining the Fourier Series Controller coefficients with the aim of reducing the torque ripple in a PMSM, thus allowing for a smoother operation. This algorithm adjusts the controller parameters based on the component's harmonic distortion in time domain of the compensation signal. Experimental evaluation is performed on a DSP-controlled PMSM evaluation platform. Test results obtained validate the effectiveness of the proposed self-tuning algorithm, with the Fourier series expansion scheme, in reducing the torque ripple.
More reliable protein NMR peak assignment via improved 2-interval scheduling.
Chen, Zhi-Zhong; Lin, Guohui; Rizzi, Romeo; Wen, Jianjun; Xu, Dong; Xu, Ying; Jiang, Tao
2005-03-01
Protein NMR peak assignment refers to the process of assigning a group of "spin systems" obtained experimentally to a protein sequence of amino acids. The automation of this process is still an unsolved and challenging problem in NMR protein structure determination. Recently, protein NMR peak assignment has been formulated as an interval scheduling problem (ISP), where a protein sequence P of amino acids is viewed as a discrete time interval I (the amino acids on P one-to-one correspond to the time units of I), each subset S of spin systems that are known to originate from consecutive amino acids from P is viewed as a "job" j(s), the preference of assigning S to a subsequence P of consecutive amino acids on P is viewed as the profit of executing job j(s) in the subinterval of I corresponding to P, and the goal is to maximize the total profit of executing the jobs (on a single machine) during I. The interval scheduling problem is max SNP-hard in general; but in the real practice of protein NMR peak assignment, each job j(s) usually requires at most 10 consecutive time units, and typically the jobs that require one or two consecutive time units are the most difficult to assign/schedule. In order to solve these most difficult assignments, we present an efficient 13/7-approximation algorithm for the special case of the interval scheduling problem where each job takes one or two consecutive time units. Combining this algorithm with a greedy filtering strategy for handling long jobs (i.e., jobs that need more than two consecutive time units), we obtain a new efficient heuristic for protein NMR peak assignment. Our experimental study shows that the new heuristic produces the best peak assignment in most of the cases, compared with the NMR peak assignment algorithms in the recent literature. The above algorithm is also the first approximation algorithm for a nontrivial case of the well-known interval scheduling problem that breaks the ratio 2 barrier.
Resource Allocation and Cross Layer Control in Wireless Networks
2006-08-25
arrival rates lies within the capacity region of the network. The notion of controlling the system to maximize its stability region and the following...optimization problem (4.5) that must be solved at the beginning of 48 Dynamic Control for Network Stability each time slot requires in general knowledge...Dynamic Control for Network Stability ~ (c) ab (t) those of any other feasible algorithm, then for any time t 0; X ic U (c) i (t) "X b ~ (c) ab (t) X
Grid generation by elliptic partial differential equations for a tri-element Augmentor-Wing airfoil
NASA Technical Reports Server (NTRS)
Sorenson, R. L.
1982-01-01
Two efforts to numerically simulate the flow about the Augmentor-Wing airfoil in the cruise configuration using the GRAPE elliptic partial differential equation grid generator algorithm are discussed. The Augmentor-Wing consists of a main airfoil with a slotted trailing edge for blowing and two smaller airfoils shrouding the blowing jet. The airfoil and the algorithm are described, and the application of GRAPE to an unsteady viscous flow simulation and a transonic full-potential approach is considered. The procedure involves dividing a complicated flow region into an arbitrary number of zones and ensuring continuity of grid lines, their slopes, and their point distributions across the zonal boundaries. The method for distributing the body-surface grid points is discussed.
Arici, Nursel
2015-01-01
Objective The coefficients of friction (COFs) of aesthetic ceramic and stainless steel brackets used in conjunction with stainless steel archwires were investigated using a modified linear tribometer and special computer software, and the effects of the bracket slot size (0.018 inches [in] or 0.022 in) and materials (ceramic or metal) on the COF were determined. Methods Four types of ceramic (one with a stainless steel slot) and one conventional stainless steel bracket were tested with two types of archwire sizes: a 0.017 × 0.025-in wire in the 0.018-in slots and a 0.019 × 0.025-in wire in the 0.022-in slot brackets. For pairwise comparisons between the 0.018-in and 0.022-in slot sizes in the same bracket, an independent sample t-test was used. One-way and two-way analysis of variance (ANOVA) and Tukey's post-hoc test at the 95% confidence level (α = 0.05) were also used for statistical analyses. Results There were significant differences between the 0.022-in and 0.018-in slot sizes for the same brand of bracket. ANOVA also showed that both slot size and bracket slot material had significant effects on COF values (p < 0.001). The ceramic bracket with a 0.022-in stainless steel slot showed the lowest mean COF (µ = 0.18), followed by the conventional stainless steel bracket with a 0.022-in slot (µ = 0.21). The monocrystalline alumina ceramic bracket with a 0.018-in slot had the highest COF (µ = 0.85). Conclusions Brackets with stainless steel slots exhibit lower COFs than ceramic slot brackets. All brackets show lower COFs as the slot size increases. PMID:25667915
Adaptive protection algorithm and system
Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA
2009-04-28
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
A Genetic-Based Scheduling Algorithm to Minimize the Makespan of the Grid Applications
NASA Astrophysics Data System (ADS)
Entezari-Maleki, Reza; Movaghar, Ali
Task scheduling algorithms in grid environments strive to maximize the overall throughput of the grid. In order to maximize the throughput of the grid environments, the makespan of the grid tasks should be minimized. In this paper, a new task scheduling algorithm is proposed to assign tasks to the grid resources with goal of minimizing the total makespan of the tasks. The algorithm uses the genetic approach to find the suitable assignment within grid resources. The experimental results obtained from applying the proposed algorithm to schedule independent tasks within grid environments demonstrate the applicability of the algorithm in achieving schedules with comparatively lower makespan in comparison with other well-known scheduling algorithms such as, Min-min, Max-min, RASA and Sufferage algorithms.
Integrated consensus-based frameworks for unmanned vehicle routing and targeting assignment
NASA Astrophysics Data System (ADS)
Barnawi, Waleed T.
Unmanned aerial vehicles (UAVs) are increasingly deployed in complex and dynamic environments to perform multiple tasks cooperatively with other UAVs that contribute to overarching mission effectiveness. Studies by the Department of Defense (DoD) indicate future operations may include anti-access/area-denial (A2AD) environments which limit human teleoperator decision-making and control. This research addresses the problem of decentralized vehicle re-routing and task reassignments through consensus-based UAV decision-making. An Integrated Consensus-Based Framework (ICF) is formulated as a solution to the combined single task assignment problem and vehicle routing problem. The multiple assignment and vehicle routing problem is solved with the Integrated Consensus-Based Bundle Framework (ICBF). The frameworks are hierarchically decomposed into two levels. The bottom layer utilizes the renowned Dijkstra's Algorithm. The top layer addresses task assignment with two methods. The single assignment approach is called the Caravan Auction Algorithm (CarA) Algorithm. This technique extends the Consensus-Based Auction Algorithm (CBAA) to provide awareness for task completion by agents and adopt abandoned tasks. The multiple assignment approach called the Caravan Auction Bundle Algorithm (CarAB) extends the Consensus-Based Bundle Algorithm (CBBA) by providing awareness for lost resources, prioritizing remaining tasks, and adopting abandoned tasks. Research questions are investigated regarding the novelty and performance of the proposed frameworks. Conclusions regarding the research questions will be provided through hypothesis testing. Monte Carlo simulations will provide evidence to support conclusions regarding the research hypotheses for the proposed frameworks. The approach provided in this research addresses current and future military operations for unmanned aerial vehicles. However, the general framework implied by the proposed research is adaptable to any unmanned vehicle. Civil applications that involve missions where human observability would be limited could benefit from the independent UAV task assignment, such as exploration and fire surveillance are also notable uses for this approach.
Deducing chemical structure from crystallographically determined atomic coordinates
Bruno, Ian J.; Shields, Gregory P.; Taylor, Robin
2011-01-01
An improved algorithm has been developed for assigning chemical structures to incoming entries to the Cambridge Structural Database, using only the information available in the deposited CIF. Steps in the algorithm include detection of bonds, selection of polymer unit, resolution of disorder, and assignment of bond types and formal charges. The chief difficulty is posed by the large number of metallo-organic crystal structures that must be processed, given our aspiration that assigned chemical structures should accurately reflect properties such as the oxidation states of metals and redox-active ligands, metal coordination numbers and hapticities, and the aromaticity or otherwise of metal ligands. Other complications arise from disorder, especially when it is symmetry imposed or modelled with the SQUEEZE algorithm. Each assigned structure is accompanied by an estimate of reliability and, where necessary, diagnostic information indicating probable points of error. Although the algorithm was written to aid building of the Cambridge Structural Database, it has the potential to develop into a general-purpose tool for adding chemical information to newly determined crystal structures. PMID:21775812
A Typology of UK Slot Machine Gamblers: A Longitudinal Observational and Interview Study
ERIC Educational Resources Information Center
Griffiths, Mark D.
2011-01-01
Slot machine gambling is a popular leisure activity worldwide yet there has been very little research into different types of slot machine gamblers. Earlier typologies of slot machine gamblers have only concentrated on adolescents in arcade environments. This study presents a new typology of slot machine players based on over 1000 h of participant…
Autonomous Guidance Strategy for Spacecraft Formations and Reconfiguration Maneuvers
NASA Astrophysics Data System (ADS)
Wahl, Theodore P.
A guidance strategy for autonomous spacecraft formation reconfiguration maneuvers is presented. The guidance strategy is presented as an algorithm that solves the linked assignment and delivery problems. The assignment problem is the task of assigning the member spacecraft of the formation to their new positions in the desired formation geometry. The guidance algorithm uses an auction process (also called an "auction algorithm''), presented in the dissertation, to solve the assignment problem. The auction uses the estimated maneuver and time of flight costs between the spacecraft and targets to create assignments which minimize a specific "expense'' function for the formation. The delivery problem is the task of delivering the spacecraft to their assigned positions, and it is addressed through one of two guidance schemes described in this work. The first is a delivery scheme based on artificial potential function (APF) guidance. APF guidance uses the relative distances between the spacecraft, targets, and any obstacles to design maneuvers based on gradients of potential fields. The second delivery scheme is based on model predictive control (MPC); this method uses a model of the system dynamics to plan a series of maneuvers designed to minimize a unique cost function. The guidance algorithm uses an analytic linearized approximation of the relative orbital dynamics, the Yamanaka-Ankersen state transition matrix, in the auction process and in both delivery methods. The proposed guidance strategy is successful, in simulations, in autonomously assigning the members of the formation to new positions and in delivering the spacecraft to these new positions safely using both delivery methods. This guidance algorithm can serve as the basis for future autonomous guidance strategies for spacecraft formation missions.
Woo, Jeong Min; Hussain, Sajid; Jang, Jae-Hyung
2017-01-01
A terahertz (THz) in-line polarization converter that yields a polarization conversion ratio as high as 99.9% is demonstrated at 1 THz. It has double-layer slot structures oriented in orthogonal directions that are electrically connected by 1/8-wavelngth-long through-via holes beside the slot structures. The slots on the front metal-plane respond to the incident THz wave with polarization orthogonal to the slots and generates a circulating surface current around the slots. The surface current propagates along a pair of through-via holes that function as a two-wire transmission line. The propagating current generates a surface current around the backside slot structures oriented orthogonal to the slot structures on the front metal layer. The circulating current generates a terahertz wave polarized orthogonal to the backside slot structures and the 90° polarization conversion is completed. The re-radiating THz wave with 90° converted polarization propagates in the same direction as the incident THz wave. PMID:28211498
Slotted Antenna with Uniaxial Dielectric Covering
2016-07-08
1 of 12 SLOTTED ANTENNA WITH UNIAXIAL DIELECTRIC COVERING STATEMENT OF GOVERNMENT INTEREST [0001] The invention described herein may be...invention is directed to a slotted antenna having enhanced broadband characteristics. (2) Description of the Prior Art [0004] Slotted cylinder antennas ...slotted cylinder antenna for use in a towed buoy. Though somewhat broadband in performance, it is not suitable for vertical mounting over a
Injector for liquid fueled rocket engine
NASA Technical Reports Server (NTRS)
Cornelius, Charles S. (Inventor); Myers, W. Neill (Inventor); Shadoan, Michael David (Inventor); Sparks, David L. (Inventor)
2000-01-01
An injector for liquid fueled rocket engines wherein a generally flat core having a frustoconical dome attached to one side of the core to serve as a manifold for a first liquid, with the core having a generally circular configuration having an axis. The other side of the core has a plurality of concentric annular first slots and a plurality of annular concentric second slots alternating with the first slots, the second slots having a greater depth than said first slots. A bore extends through the core for inletting a second liquid into said core, the bore intersecting the second slots to feed the second liquid into the second slots. The core also has a plurality of first passageways leading from the manifold to the first annular slots for feeding the first liquid into said first slots. A faceplate brazed to said other side of the core is provided with apertures extending from the first and second slots through said face plate, these apertures being positioned to direct fuel and liquid oxygen into contact with each other in the combustion chamber. The first liquid may be liquid oxygen and the second liquid may be kerosene or liquid hydrogen.
Craig, J.M.; Papoulias, D.M.; Thomas, M.V.; Annis, M.L.; Boase, J.
2009-01-01
This study focused on identifying the sex of lake sturgeon by measuring the sex hormones estradiol and testosterone, and the phosphoprotein vitellogenin (Vtg) in blood plasma by radioimmunoassay and enzyme-linked immunosorbent assay, respectively, and evaluating these techniques as tools in lake sturgeon population management. Surveys of the St Clair River (SCR) lake sturgeon population have characterized it as rebounding by having steady or increasing recruitment since 1997. However, researchers have not been able to effectively determine the sex for most of the sturgeon they capture because few fish caught during surveys are releasing gametes. A total of 115 fish were sampled from May through June in 2004 and 2005 from the SCR, Michigan, USA. Of these, only four females and eight males were verified (i.e. they were releasing gametes at time of capture), resulting in very few fish with which to validate blood hormone and Vtg biomarkers of sex. Fifty-six percent of the fish were assigned a sex designation based on biomarker criteria. Correspondence between actual gonadal sex and biomarker-directed classification was good for the small subset of fish for which gonadal sex was definitively determined. Moreover, application of the steroid values in a predictive sex assignment model developed for white sturgeon misclassified only the same two fish that were misclassified with the steroid and Vtg biomarkers. The experimental results suggest a sex ratio of 1 : 2.7 (F:M), however more conclusive methods are needed to confirm this ratio because so few fish were available for sex validation. Of the 43 males, 14 were within the legal slot limit, 11 were smaller than 1067 mm total length (TL), and 18 were larger than 1270 mm TL. All 15 females were larger than 1270 mm TL, and thus protected by the slot limit criteria. Considering that lake sturgeon are threatened in Michigan, an advantage to using blood plasma assays was that fish were not harmed, and sample collection was quick, simple, and inexpensive. However, because a sufficiently large number of fish could not be validated for gonadal sex due to handling restrictions given the fish's protected status, assignment of sex is not based on a robust multi-variate model. An immediate alternative may be to use other non-invasive field methods (e.g. ultrasound, fiber-optic endoscope) to provide a more timely classification while establishing well-validated plasma hormone and Vtg-based predictive models for sex assignment of lake sturgeon. ?? 2009 Blackwell Verlag, Berlin.
A multi-slot surface coil for MRI of dual-rat imaging at 4 T
NASA Astrophysics Data System (ADS)
Solis, S. E.; Wang, R.; Tomasi, D.; Rodriguez, A. O.
2011-06-01
A slotted surface coil inspired by the hole-and-slot cavity magnetron was developed for magnetic resonance imaging of obese rats at 4 T. Full-wave analysis of the magnetic field was carried out at 170 MHz for both the slotted and circular-shaped coils. The noise figure values of two coils were investigated via the numerical calculation of the quality factors. Fat simulated phantoms to mimic overweight rats were included in the analysis with weights ranging from 300 to 900 g. The noise figures were 1.2 dB for the slotted coil and 2.4 dB for the circular coil when loaded with 600 g of simulated phantom. A slotted surface coil with eight circular slots and a circular coil with similar dimensions were built and operated in the transceiver mode, and their performances were experimentally compared. The imaging tests in phantoms demonstrated that the slotted surface coil has a deeper RF-sensitivity and better field uniformity than the single-loop RF-coil. High quality images of two overweight Zucker rats were acquired simultaneously with the slotted surface coil using standard spin-echo pulse sequences. Experimental results showed that the slotted surface coil outperformed the circular coil for imaging considerably overweight rats. Thus, the slotted surface coil can be a good tool for MRI experiments in rats on a human whole-body 4 T scanner.
Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment
Karimzadehgan, Maryam; Zhai, ChengXiang
2011-01-01
Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. A general setup of the review assignment problem involves assigning a set of reviewers on a committee to a set of documents to be reviewed under the constraint of review quota so that the reviewers assigned to a document can collectively cover multiple topic aspects of the document. No previous work has addressed such a setup of committee review assignments while also considering matching multiple aspects of topics and expertise. In this paper, we tackle the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. The proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using a multi-aspect review assignment test set constructed using ACM SIGIR publications shows that the proposed algorithm is effective and efficient for committee review assignments based on multi-aspect expertise matching. PMID:22711970
Merrill, L.C.
1958-06-17
An electromagetic recording head is described for simultaneous recording of a plurality of signals within a small space on a magnetically semsitized medium. Basically the head structure comprises a non-magnetic centerpiece provided with only first and second groups of spaced cut-out slots respectively on opposite sides of the centerpiece. The two groups of slots are in parallel alignment and the slots of one group are staggered with respect to the slots of the other group so that one slot is not directly opposite another slot. Each slot has a magnet pole piece disposed therein and cooperating with a second pole and coil to provide a magnetic flux gap at the upper end of the slot. As a tape is drawn over the upper end of the centerpiece the individual magnetic circuits are disposed along its width to provide means for simultaneously recording information on separate portions, tracks. of the tape.
Dual frequency, dual polarized, multi-layered microstrip slot and dipole array antenna
NASA Technical Reports Server (NTRS)
Tulintseff, Ann N. (Inventor)
1995-01-01
An antenna array system is disclosed which uses subarrays of slots and subarrays of dipoles on separate planes. The slots and dipoles respectively are interleaved, which is to say there is minimal overlap between them. Each subarray includes a microstrip transmission line and a plurality of elements extending perpendicular thereto. The dipoles form the transmission elements and the slots form the receive elements. The plane in which the slots are formed also forms a ground plane for the dipoles--hence the feed to the dipole is on the opposite side of this ground plane as the feed to the slots. HPAs are located adjacent the dipoles on one side of the substrate and LNAs are located adjacent the slots on the other side of the substrate. The dipoles and slots are tuned by setting different offsets between each element and the microstrip transmission line.
NASA Technical Reports Server (NTRS)
Johnson, W. G., Jr.
1976-01-01
An investigation was made in the 5.18 m (17 ft) test section of the Langley 300 MPH 7 by 10 foot tunnel on a rectangular, aspect ratio 6 wing which had a slotted supercritical airfoil section and externally blown flaps. The 13 percent thick wing was fitted with two high lift flap systems: single slotted and double slotted. The designations single slotted and double slotted do not include the slot which exists near the trailing edge of the basic slotted supercritical airfoil. Tests were made over an angle of attack range of -6 deg to 20 deg and a thrust-coefficient range up to 1.94 for a free-stream dynamic pressure of 526.7 Pa (11.0 lb/sq ft). The results of the investigation are presented as curves and tabulations of the chordwise pressure distributions at the midsemispan station for the wing and each flap element.
NASA Technical Reports Server (NTRS)
Crozier, Stewart N.
1990-01-01
Random access signaling, which allows slotted packets to spill over into adjacent slots, is investigated. It is shown that sloppy-slotted ALOHA can always provide higher throughput than conventional slotted ALOHA. The degree of improvement depends on the timing error distribution. Throughput performance is presented for Gaussian timing error distributions, modified to include timing error corrections. A general channel capacity lower bound, independent of the specific timing error distribution, is also presented.
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.
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
Slot-coupled CW standing wave accelerating cavity
Wang, Shaoheng; Rimmer, Robert; Wang, Haipeng
2017-05-16
A slot-coupled CW standing wave multi-cell accelerating cavity. To achieve high efficiency graded beta acceleration, each cell in the multi-cell cavity may include different cell lengths. Alternatively, to achieve high efficiency with acceleration for particles with beta equal to 1, each cell in the multi-cell cavity may include the same cell design. Coupling between the cells is achieved with a plurality of axially aligned kidney-shaped slots on the wall between cells. The slot-coupling method makes the design very compact. The shape of the cell, including the slots and the cone, are optimized to maximize the power efficiency and minimize the peak power density on the surface. The slots are non-resonant, thereby enabling shorter slots and less power loss.
Effect of length of Handley Page tip slots on the lateral-stability factor, damping in roll
NASA Technical Reports Server (NTRS)
Weick, Fred E; Wenzinger, Carl J
1932-01-01
Tests have been made in the NACA 7 by 10 foot wind tunnel on a Clark Y wing model equipped with various lengths of Handley Page slots extending inward from the wing tips. The slot lengths tested ranged from 20 to 100 per cent of the semi span. The effect of slot lengths on damping in roll was determined by means of both free-autorotation and forced-rotation test. In addition, the maximum lift coefficient was found with each slot length. The optimum length of slot for satisfactory damping in roll over a large range of angles of attack was found to be slightly over 50 per cent of the semispan for the form of slot tested.
Method of data communications with reduced latency
Blocksome, Michael A; Parker, Jeffrey J
2013-11-05
Data communications with reduced latency, including: writing, by a producer, a descriptor and message data into at least two descriptor slots of a descriptor buffer, the descriptor buffer comprising allocated computer memory segmented into descriptor slots, each descriptor slot having a fixed size, the descriptor buffer having a header pointer that identifies a next descriptor slot to be processed by a DMA controller, the descriptor buffer having a tail pointer that identifies a descriptor slot for entry of a next descriptor in the descriptor buffer; recording, by the producer, in the descriptor a value signifying that message data has been written into descriptor slots; and setting, by the producer, in dependence upon the recorded value, a tail pointer to point to a next open descriptor slot.
Distributed resource allocation under communication constraints
NASA Astrophysics Data System (ADS)
Dodin, Pierre; Nimier, Vincent
2001-03-01
This paper deals with a study of the multi-sensor management problem for multi-target tracking. The collaboration between many sensors observing the same target means that they are able to fuse their data during the information process. Then one must take into account this possibility to compute the optimal association sensors-target at each step of time. In order to solve this problem for real large scale system, one must both consider the information aspect and the control aspect of the problem. To unify these problems, one possibility is to use a decentralized filtering algorithm locally driven by an assignment algorithm. The decentralized filtering algorithm we use in our model is the filtering algorithm of Grime, which relaxes the usual full-connected hypothesis. By full-connected, one means that the information in a full-connected system is totally distributed everywhere at the same moment, which is unacceptable for a real large scale system. We modelize the distributed assignment decision with the help of a greedy algorithm. Each sensor performs a global optimization, in order to estimate other information sets. A consequence of the relaxation of the full- connected hypothesis is that the sensors' information set are not the same at each step of time, producing an information dis- symmetry in the system. The assignment algorithm uses a local knowledge of this dis-symmetry. By testing the reactions and the coherence of the local assignment decisions of our system, against maneuvering targets, we show that it is still possible to manage with decentralized assignment control even though the system is not full-connected.
Communication Limits Due to Photon-Detector Jitter
NASA Technical Reports Server (NTRS)
Moision, Bruce E.; Farr, William H.
2008-01-01
A theoretical and experimental study was conducted of the limit imposed by photon-detector jitter on the capacity of a pulse-position-modulated optical communication system in which the receiver operates in a photon-counting (weak-signal) regime. Photon-detector jitter is a random delay between impingement of a photon and generation of an electrical pulse by the detector. In the study, jitter statistics were computed from jitter measurements made on several photon detectors. The probability density of jitter was mathematically modeled by use of a weighted sum of Gaussian functions. Parameters of the model were adjusted to fit histograms representing the measured-jitter statistics. Likelihoods of assigning detector-output pulses to correct pulse time slots in the presence of jitter were derived and used to compute channel capacities and corresponding losses due to jitter. It was found that the loss, expressed as the ratio between the signal power needed to achieve a specified capacity in the presence of jitter and that needed to obtain the same capacity in the absence of jitter, is well approximated as a quadratic function of the standard deviation of the jitter in units of pulse-time-slot duration.
NASA Technical Reports Server (NTRS)
Wade, T. O.
1984-01-01
Reduction techniques for traffic matrices are explored in some detail. These matrices arise in satellite switched time-division multiple access (SS/TDMA) techniques whereby switching of uplink and downlink beams is required to facilitate interconnectivity of beam zones. A traffic matrix is given to represent that traffic to be transmitted from n uplink beams to n downlink beams within a TDMA frame typically of 1 ms duration. The frame is divided into segments of time and during each segment a portion of the traffic is represented by a switching mode. This time slot assignment is characterized by a mode matrix in which there is not more than a single non-zero entry on each line (row or column) of the matrix. Investigation is confined to decomposition of an n x n traffic matrix by mode matrices with a requirement that the decomposition be 100 percent efficient or, equivalently, that the line(s) in the original traffic matrix whose sum is maximal (called critical line(s)) remain maximal as mode matrices are subtracted throughout the decomposition process. A method of decomposition of an n x n traffic matrix by mode matrices results in a number of steps that is bounded by n(2) - 2n + 2. It is shown that this upper bound exists for an n x n matrix wherein all the lines are maximal (called a quasi doubly stochastic (QDS) matrix) or for an n x n matrix that is completely arbitrary. That is, the fact that no method can exist with a lower upper bound is shown for both QDS and arbitrary matrices, in an elementary and straightforward manner.
Balasubramanian, Hari; Biehl, Sebastian; Dai, Longjie; Muriel, Ana
2014-03-01
Appointments in primary care are of two types: 1) prescheduled appointments, which are booked in advance of a given workday; and 2) same-day appointments, which are booked as calls come during the workday. The challenge for practices is to provide preferred time slots for prescheduled appointments and yet see as many same-day patients as possible during regular work hours. It is also important, to the extent possible, to match same-day patients with their own providers (so as to maximize continuity of care). In this paper, we present a mathematical framework (a stochastic dynamic program) for same-day patient allocation in multi-physician practices in which calls for same-day appointments come in dynamically over a workday. Allocation decisions have to be made in the presence of prescheduled appointments and without complete demand information. The objective is to maximize a weighted measure that includes the number of same-day patients seen during regular work hours as well as the continuity provided to these patients. Our experimental design is motivated by empirical data we collected at a 3-provider family medicine practice in Massachusetts. Our results show that the location of prescheduled appointments - i.e. where in the day these appointments are booked - has a significant impact on the number of same-day patients a practice can see during regular work hours, as well as the continuity the practice is able to provide. We find that a 2-Blocks policy which books prescheduled appointments in two clusters - early morning and early afternoon - works very well. We also provide a simple, easily implementable policy for schedulers to assign incoming same-day requests to appointment slots. Our results show that this policy provides near-optimal same-day assignments in a variety of settings.
Slot configuration for axial-flow turbomachinery blades
NASA Technical Reports Server (NTRS)
Taylor, W. E.
1972-01-01
Machining of slot in turbine blades of axial flow turbines to provide flow path between pressure and suction surfaces is discussed. Slot configuration and improvements in blade performance are described. Diagram of blade slot to show geometry of modification is included.
Downstream influence of swept slot injection in hypersonic turbulent flow
NASA Technical Reports Server (NTRS)
Hefner, J. N.; Cary, A. M., Jr.; Bushnell, D. B.
1977-01-01
Results of an experimental and numerical investigation of tangential swept slot injection into a thick turbulent boundary layer at Mach 6 are presented. Film cooling effectiveness, skin friction, and flow structure downstream of the swept slot injection were investigated. The data were compared with that for unswept slots, and it was found that cooling effectiveness and skin friction reductions are not significantly affected by sweeping the slot.
Ding, Jun; Arigong, Bayaner; Ren, Han; Zhou, Mi; Shao, Jin; Lu, Meng; Chai, Yang; Lin, Yuankun; Zhang, Hualiang
2014-01-01
Novel graphene-based tunable plasmonic metamaterials featuring single and multiple transparency windows are numerically studied in this paper. The designed structures consist of a graphene layer perforated with quadrupole slot structures and dolmen-like slot structures printed on a substrate. Specifically, the graphene-based quadrupole slot structure can realize a single transparency window, which is achieved without breaking the structure symmetry. Further investigations have shown that the single transparency window in the proposed quadrupole slot structure is more likely originated from the quantum effect of Autler-Townes splitting. Then, by introducing a dipole slot to the quadrupole slot structure to form the dolmen-like slot structure, an additional transmission dip could occur in the transmission spectrum, thus, a multiple-transparency-window system can be achieved (for the first time for graphene-based devices). More importantly, the transparency windows for both the quadrupole slot and the dolmen-like slot structures can be dynamically controlled over a broad frequency range by varying the Fermi energy levels of the graphene layer (through electrostatic gating). The proposed slot metamaterial structures with tunable single and multiple transparency windows could find potential applications in many areas such as multiple-wavelength slow-light devices, active plasmonic switching, and optical sensing. PMID:25146672
Ding, Jun; Arigong, Bayaner; Ren, Han; Zhou, Mi; Shao, Jin; Lu, Meng; Chai, Yang; Lin, Yuankun; Zhang, Hualiang
2014-08-22
Novel graphene-based tunable plasmonic metamaterials featuring single and multiple transparency windows are numerically studied in this paper. The designed structures consist of a graphene layer perforated with quadrupole slot structures and dolmen-like slot structures printed on a substrate. Specifically, the graphene-based quadrupole slot structure can realize a single transparency window, which is achieved without breaking the structure symmetry. Further investigations have shown that the single transparency window in the proposed quadrupole slot structure is more likely originated from the quantum effect of Autler-Townes splitting. Then, by introducing a dipole slot to the quadrupole slot structure to form the dolmen-like slot structure, an additional transmission dip could occur in the transmission spectrum, thus, a multiple-transparency-window system can be achieved (for the first time for graphene-based devices). More importantly, the transparency windows for both the quadrupole slot and the dolmen-like slot structures can be dynamically controlled over a broad frequency range by varying the Fermi energy levels of the graphene layer (through electrostatic gating). The proposed slot metamaterial structures with tunable single and multiple transparency windows could find potential applications in many areas such as multiple-wavelength slow-light devices, active plasmonic switching, and optical sensing.
Investigation of transonic flow over segmented slotted wind tunnel wall with mass transfer
NASA Technical Reports Server (NTRS)
Bhat, M. K.; Vakili, A. D.; Wu, J. M.
1990-01-01
The flowfield on a segmented multi-slotted wind tunnel wall was studied at transonic speeds by measurements in and near the wall layer using five port cone probes. The slotted wall flowfield was observed to be three-dimensional in nature for a relatively significant distance above the slot. The boundary layer characteristics measured on the single slotted wall were found to be very sensitive to the applied suction through the slot. The perturbation in the velocity components generated due to the flow through the slot decay rapidly in the transverse direction. A vortex-like flow existed on the single slotted wall for natural ventilation but diminished with increased suction flow rate. For flow on a segmented multi-slotted wall, the normal velocity component changes were found to be maximum for measurement points located between the segmented slots atop the active chamber. The lateral influence due to applied suction and blowing, through a compartment, exceeded only slightly that in the downstream direction. Limited upstream influence was observed. Influence coefficients were determined from the data in the least-square sense for blowing and suction applied through one and two compartments. This was found to be an adequate determination of the influence coefficients for the range of mass flows considered.
Fabrication Method for LOBSTER-Eye Optics in <110> Silicon
NASA Technical Reports Server (NTRS)
Chervenak, James; Collier, Michael; Mateo, Jennette
2013-01-01
Soft x-ray optics can use narrow slots to direct x-rays into a desirable pattern on a focal plane. While square-pack, square-pore, slumped optics exist for this purpose, they are costly. Silicon (Si) is being examined as a possible low-cost replacement. A fabrication method was developed for narrow slots in <110> Si demonstrating the feasibility of stacked slot optics to replace micropores. Current micropore optics exist that have 20-micron-square pores on 26-micron pitch in glass with a depth of 1 mm and an extent of several square centimeters. Among several proposals to emulate the square pore optics are stacked slot chips with etched vertical slots. When the slots in the stack are positioned orthogonally to each other, the component will approach the soft x-ray focusing observed in the micropore optics. A specific improvement Si provides is that it can have narrower sidewalls between slots to permit greater throughput of x-rays through the optics. In general, Si can have more variation in slot geometry (width, length). Further, the sidewalls can be coated with high-Z materials to enhance reflection and potentially reduce the surface roughness of the reflecting surface. Narrow, close-packed deep slots in <110> Si have been produced using potassium hydroxide (KOH) etching and a patterned silicon nitride (SiN) mask. The achieved slot geometries have sufficient wall smoothness, as observed through scanning electron microscope (SEM) imaging, to enable evaluation of these slot plates as an optical element for soft x-rays. Etches of different angles to the crystal plane of Si were evaluated to identify a specific range of etch angles that will enable low undercut slots in the Si <110> material. These slots with the narrow sidewalls are demonstrated to several hundred microns in depth, and a technical path to 500-micron deep slots in a precision geometry of narrow, closepacked slots is feasible. Although intrinsic stress in ultrathin wall Si is observed, slots with walls approaching 1.5 microns can be achieved (a significant improvement over the 6-micron walls in micro - pore optics). The major advantages of this technique are the potential for higher x-ray throughout (due to narrow slot walls) and lower cost over the existing slumped micropore glass plates. KOH etching of smooth sidewalls has been demonstrated for many applications, suggesting its feasibility for implementation in x-ray optics. Si cannot be slumped like the micropore optics, so the focusing will be achieved with millimeter-scale slot plates that populate a spherical dome. The possibility for large-scale production exists for Si parts that is more difficult to achieve in micropore parts.
On the synchronizability and detectability of random PPM sequences
NASA Technical Reports Server (NTRS)
Georghiades, Costas N.; Lin, Shu
1987-01-01
The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum-likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds derived on the symbol error probability as well as the probability of false synchronization indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.
On the synchronizability and detectability of random PPM sequences
NASA Technical Reports Server (NTRS)
Georghiades, Costas N.
1987-01-01
The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds were derived on the symbol error probability as well as the probability of false synchronization that indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.
Flow around a slotted circular cylinder at various angles of attack
NASA Astrophysics Data System (ADS)
Gao, Dong-Lai; Chen, Wen-Li; Li, Hui; Hu, Hui
2017-10-01
We experimentally investigated the flow characteristics around a circular cylinder with a slot at different angles of attack. The experimental campaign was performed in a wind tunnel at the Reynolds number of Re = 2.67 × 104. The cylindrical test model was manufactured with a slot at the slot width S = 0.075 D ( D is the diameter of the cylinder). The angle of attack α was varied from 0° to 90°. In addition to measuring the pressure distributions around the cylinder surface, a digital particle image velocimetry (PIV) system was employed to quantify the wake flow characteristics behind the baseline cylinder (i.e., baseline case of the cylinder without slot) and slotted cylinder at various angles of attack. Measurement results suggested that at low angles of attack, the passive jet flow generated by the slot would work as an effective control scheme to modify the wake flow characteristics and contribute to reducing the drag and suppressing the fluctuating lift. The flip-flop phenomenon was also identified and discussed with the slot at 0° angle of attack. As the angle of attack α became 45°, the effects of the slot were found to be minimal. When the angle of attack α of the slot approached 90°, the self-organized boundary layer suction and blowing were realized. As a result, the flow separations on both sides of the test model were found to be notably delayed, the wake width behind the slotted cylinder was decreased and the vortex formation length was greatly shrunk, in comparison with the baseline case. Instantaneous pressure measurement results revealed that the pressure difference between the two slot ends and the periodically fluctuating pressure distributions would cause the alternative boundary layer suction and blowing at α = 90°.
Service differentiated and adaptive CSMA/CA over IEEE 802.15.4 for Cyber-Physical Systems.
Xia, Feng; Li, Jie; Hao, Ruonan; Kong, Xiangjie; Gao, Ruixia
2013-01-01
Cyber-Physical Systems (CPS) that collect, exchange, manage information, and coordinate actions are an integral part of the Smart Grid. In addition, Quality of Service (QoS) provisioning in CPS, especially in the wireless sensor/actuator networks, plays an essential role in Smart Grid applications. IEEE 802.15.4, which is one of the most widely used communication protocols in this area, still needs to be improved to meet multiple QoS requirements. This is because IEEE 802.15.4 slotted Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) employs static parameter configuration without supporting differentiated services and network self-adaptivity. To address this issue, this paper proposes a priority-based Service Differentiated and Adaptive CSMA/CA (SDA-CSMA/CA) algorithm to provide differentiated QoS for various Smart Grid applications as well as dynamically initialize backoff exponent according to traffic conditions. Simulation results demonstrate that the proposed SDA-CSMA/CA scheme significantly outperforms the IEEE 802.15.4 slotted CSMA/CA in terms of effective data rate, packet loss rate, and average delay.
Service Differentiated and Adaptive CSMA/CA over IEEE 802.15.4 for Cyber-Physical Systems
Gao, Ruixia
2013-01-01
Cyber-Physical Systems (CPS) that collect, exchange, manage information, and coordinate actions are an integral part of the Smart Grid. In addition, Quality of Service (QoS) provisioning in CPS, especially in the wireless sensor/actuator networks, plays an essential role in Smart Grid applications. IEEE 802.15.4, which is one of the most widely used communication protocols in this area, still needs to be improved to meet multiple QoS requirements. This is because IEEE 802.15.4 slotted Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) employs static parameter configuration without supporting differentiated services and network self-adaptivity. To address this issue, this paper proposes a priority-based Service Differentiated and Adaptive CSMA/CA (SDA-CSMA/CA) algorithm to provide differentiated QoS for various Smart Grid applications as well as dynamically initialize backoff exponent according to traffic conditions. Simulation results demonstrate that the proposed SDA-CSMA/CA scheme significantly outperforms the IEEE 802.15.4 slotted CSMA/CA in terms of effective data rate, packet loss rate, and average delay. PMID:24260021
NASA Technical Reports Server (NTRS)
Howard, F. G.; Strokowski, A. J.
1978-01-01
Experiments were conducted to determine the reduction in surface skin friction and the effectiveness of surface cooling downstream of one to four successive flush slots injecting cold air at an angle of 10 deg into a turbulent Mach 6 boundary layer. Data were obtained by direct measurement of surface shear and equilibrium temperatures, respectively. Increasing the number of slots decreased the skin friction, but the incremental improvement in skin-friction reduction decreased as the number of slots was increased. Cooling effectiveness was found to improve, for a given total mass injection, as the number of slots was increased from one to four. Comparison with previously reported step-slot data, however, indicated that step slots with tangential injection are more effective for both reducing skin friction and cooling than the present flush-slot configuration. Finite-difference predictions are in reasonable agreement with skin-friction data and with boundary-layer profile data.
Assignment Of Finite Elements To Parallel Processors
NASA Technical Reports Server (NTRS)
Salama, Moktar A.; Flower, Jon W.; Otto, Steve W.
1990-01-01
Elements assigned approximately optimally to subdomains. Mapping algorithm based on simulated-annealing concept used to minimize approximate time required to perform finite-element computation on hypercube computer or other network of parallel data processors. Mapping algorithm needed when shape of domain complicated or otherwise not obvious what allocation of elements to subdomains minimizes cost of computation.
Electricity Usage Scheduling in Smart Building Environments Using Smart Devices
Lee, Eunji; Bahn, Hyokyung
2013-01-01
With the recent advances in smart grid technologies as well as the increasing dissemination of smart meters, the electricity usage of every moment can be detected in modern smart building environments. Thus, the utility company adopts different price of electricity at each time slot considering the peak time. This paper presents a new electricity usage scheduling algorithm for smart buildings that adopts real-time pricing of electricity. The proposed algorithm detects the change of electricity prices by making use of a smart device and changes the power mode of each electric device dynamically. Specifically, we formulate the electricity usage scheduling problem as a real-time task scheduling problem and show that it is a complex search problem that has an exponential time complexity. An efficient heuristic based on genetic algorithms is performed on a smart device to cut down the huge searching space and find a reasonable schedule within a feasible time budget. Experimental results with various building conditions show that the proposed algorithm reduces the electricity charge of a smart building by 25.6% on average and up to 33.4%. PMID:24453860
Electricity usage scheduling in smart building environments using smart devices.
Lee, Eunji; Bahn, Hyokyung
2013-01-01
With the recent advances in smart grid technologies as well as the increasing dissemination of smart meters, the electricity usage of every moment can be detected in modern smart building environments. Thus, the utility company adopts different price of electricity at each time slot considering the peak time. This paper presents a new electricity usage scheduling algorithm for smart buildings that adopts real-time pricing of electricity. The proposed algorithm detects the change of electricity prices by making use of a smart device and changes the power mode of each electric device dynamically. Specifically, we formulate the electricity usage scheduling problem as a real-time task scheduling problem and show that it is a complex search problem that has an exponential time complexity. An efficient heuristic based on genetic algorithms is performed on a smart device to cut down the huge searching space and find a reasonable schedule within a feasible time budget. Experimental results with various building conditions show that the proposed algorithm reduces the electricity charge of a smart building by 25.6% on average and up to 33.4%.
NASA Technical Reports Server (NTRS)
Abou-Khousa, M. A.
2009-01-01
A novel modulated slot design has been proposed and tested. The proposed slot is aimed to replace the inefficient small dipoles used in conventional MST-based imaging systems. The developed slot is very attractive as MST array element due to its small size and high efficiency/modulation depth. In fact, the developed slot has been successfully used to implement the first prototype of a microwave camera operating at 24 GHZ. It is also being used in the design of the second generation of the camera. Finally, the designed elliptical slot can be used as an electronically controlled waveguide iris for many other purposes (for instance in constructing waveguide reflective phase shifters and multiplexers/switches).
NASA Technical Reports Server (NTRS)
Sutliff, Daniel L. (Technical Monitor); Walker, Bruce E.
2004-01-01
Hersh Walker Acoustics (HWA) has performed a series of wind tunnel tests to support crack-repair studies for ITA flowliner vent slots. The overall goal of these tests is to determine if slot shape details have a significant influence on the propensity of the flowliner to produce aero-acoustic oscillations that could increase unsteady stresses on the flowliner walls. The test series, conducted using a full-scale two-dimensional model of a six-slot segment of the 38 slot liner, was intended to investigate the effects of altering slot shape by grinding away cracked portions.
Tailoring the dispersion behavior of silicon nanophotonic slot waveguides.
Mas, Sara; Caraquitena, José; Galán, José V; Sanchis, Pablo; Martí, Javier
2010-09-27
We investigate the chromatic dispersion properties of silicon channel slot waveguides in a broad spectral region centered at ~1.5 μm. The variation of the dispersion profile as a function of the slot fill factor, i.e., the ratio between the slot and waveguide widths, is analyzed. Symmetric as well as asymmetric geometries are considered. In general, two different dispersion regimes are identified. Furthermore, our analysis shows that the zero and/or the peak dispersion wavelengths can be tailored by a careful control of the geometrical waveguide parameters including the cross-sectional area, the slot fill factor, and the slot asymmetry degree.
Optimal slot dimension for skirt support structure of coke drums
NASA Astrophysics Data System (ADS)
Wang, Edward; Xia, Zihui
2018-03-01
The skirt-to-shell junction weld on coke drums is susceptible to fatigue failure due to severe thermal cyclic stresses. One method to decrease junction stress is to add slots near the top of the skirt, thereby reducing the local stiffness close to the weld. The most common skirt slot design is thin relative to its circumferential spacing. A new slot design, which is significantly wider, is proposed. In this study, thermal-mechanical elastoplastic 3-D finite element models of coke drums are created to analyze the effect of different skirt designs on the stress/strain field near the shell-to-skirt junction weld, as well as any other critical stress locations in the overall skirt design. The results confirm that the inclusion of the conventional slot design effectively reduces stress in the junction weld. However, it has also been found that the critical stress location migrates from the shell-to-skirt junction weld to the slot ends. A method is used to estimate the fatigue life near the critical areas of each skirt slot design. It is found that wider skirt slots provide a significant improvement on fatigue life in the weld and slot area.
Experimental quantum private queries with linear optics
NASA Astrophysics Data System (ADS)
de Martini, Francesco; Giovannetti, Vittorio; Lloyd, Seth; Maccone, Lorenzo; Nagali, Eleonora; Sansoni, Linda; Sciarrino, Fabio
2009-07-01
The quantum private query is a quantum cryptographic protocol to recover information from a database, preserving both user and data privacy: the user can test whether someone has retained information on which query was asked and the database provider can test the amount of information released. Here we discuss a variant of the quantum private query algorithm that admits a simple linear optical implementation: it employs the photon’s momentum (or time slot) as address qubits and its polarization as bus qubit. A proof-of-principle experimental realization is implemented.
Axial-Loading Circumferential Dovetail Turbine-Blade Mount
NASA Technical Reports Server (NTRS)
Pierce, Martin J.; Ward, Steven D.; Eskridge, Ronald R.
1992-01-01
In new configuration, retaining ring holds base of blades in circumferential dovetail slot. Blades inserted axially via loading slots into circumferential dovetail slot. Ring placed over loading slots and fastened with split ring held by arm of disk. Blades less likely to be shaken loose during operation.
Transverse slot antennas for high field MRI
Lattanzi, Riccardo; Lakshmanan, Karthik; Brown, Ryan; Deniz, Cem M.; Sodickson, Daniel K.; Collins, Christopher M.
2018-01-01
Purpose Introduce a novel coil design using an electrically long transversely oriented slot in a conductive sheet. Theory and Methods Theoretical considerations, numerical simulations, and experimental measurements are presented for transverse slot antennas as compared with electric dipole antennas. Results Simulations show improved central and average transmit and receive efficiency, as well as larger coverage in the transverse plane, for a single slot as compared to a single dipole element. Experiments on a body phantom confirm the simulation results for a slot antenna relative to a dipole, demonstrating a large region of relatively high sensitivity and homogeneity. Images in a human subject also show a large imaging volume for a single slot and six slot antenna array. High central transmit efficiency was observed for slot arrays relative to dipole arrays. Conclusion Transverse slots can exhibit improved sensitivity and larger field of view compared with traditional conductive dipoles. Simulations and experiments indicate high potential for slot antennas in high field MRI. Magn Reson Med 80:1233–1242, 2018. © 2018 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine. This is an open access article under the terms of the Creative Commons Attribution NonCommercial License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited and is not used for commercial purposes. PMID:29388250
Dogan, S; Babic, N; Gurkan, C; Goksu, A; Marjanovic, D; Hadziavdic, V
2016-12-01
Y-chromosomal haplogroups are sets of ancestrally related paternal lineages, traditionally assigned by the use of Y-chromosomal single nucleotide polymorphism (Y-SNP) markers. An increasingly popular and a less labor-intensive alternative approach has been Y-chromosomal haplogroup assignment based on already available Y-STR data using a variety of different algorithms. In the present study, such in silico haplogroup assignments were made based on 23-loci Y-STR data for 100 unrelated male individuals from the Tuzla Canton, Bosnia and Herzegovina (B&H) using the following four different algorithms: Whit Athey's Haplogroup Predictor, Jim Cullen's World Haplogroup & Haplogroup-I Subclade Predictor, Vadim Urasin's YPredictor and the NevGen Y-DNA Haplogroup Predictor. Prior in-house assessment of these four different algorithms using a previously published dataset (n=132) from B&H with both Y-STR (12-loci) and Y-SNP data suggested haplogroup misassignment rates between 0.76% and 3.02%. Subsequent analyses with the Tuzla Canton population sample revealed only a few differences in the individual haplogroup assignments when using different algorithms. Nevertheless, the resultant Y-chromosomal haplogroup distribution by each method was very similar, where the most prevalent haplogroups observed were I, R and E with their sublineages I2a, R1a and E1b1b, respectively, which is also in accordance with the previously published Y-SNP data for the B&H population. In conclusion, results presented herein not only constitute a concordance study on the four most popular haplogroup assignment algorithms, but they also give a deeper insight into the inter-population differentiation in B&H on the basis of Y haplogroups for the first time. Copyright © 2016 Elsevier GmbH. All rights reserved.
Systematic assignment of thermodynamic constraints in metabolic network models
Kümmel, Anne; Panke, Sven; Heinemann, Matthias
2006-01-01
Background The availability of genome sequences for many organisms enabled the reconstruction of several genome-scale metabolic network models. Currently, significant efforts are put into the automated reconstruction of such models. For this, several computational tools have been developed that particularly assist in identifying and compiling the organism-specific lists of metabolic reactions. In contrast, the last step of the model reconstruction process, which is the definition of the thermodynamic constraints in terms of reaction directionalities, still needs to be done manually. No computational method exists that allows for an automated and systematic assignment of reaction directions in genome-scale models. Results We present an algorithm that – based on thermodynamics, network topology and heuristic rules – automatically assigns reaction directions in metabolic models such that the reaction network is thermodynamically feasible with respect to the production of energy equivalents. It first exploits all available experimentally derived Gibbs energies of formation to identify irreversible reactions. As these thermodynamic data are not available for all metabolites, in a next step, further reaction directions are assigned on the basis of network topology considerations and thermodynamics-based heuristic rules. Briefly, the algorithm identifies reaction subsets from the metabolic network that are able to convert low-energy co-substrates into their high-energy counterparts and thus net produce energy. Our algorithm aims at disabling such thermodynamically infeasible cyclic operation of reaction subnetworks by assigning reaction directions based on a set of thermodynamics-derived heuristic rules. We demonstrate our algorithm on a genome-scale metabolic model of E. coli. The introduced systematic direction assignment yielded 130 irreversible reactions (out of 920 total reactions), which corresponds to about 70% of all irreversible reactions that are required to disable thermodynamically infeasible energy production. Conclusion Although not being fully comprehensive, our algorithm for systematic reaction direction assignment could define a significant number of irreversible reactions automatically with low computational effort. We envision that the presented algorithm is a valuable part of a computational framework that assists the automated reconstruction of genome-scale metabolic models. PMID:17123434
Demonstration of slot-waveguide structures on silicon nitride / silicon oxide platform.
Barrios, C A; Sánchez, B; Gylfason, K B; Griol, A; Sohlström, H; Holgado, M; Casquel, R
2007-05-28
We report on the first demonstration of guiding light in vertical slot-waveguides on silicon nitride/silicon oxide material system. Integrated ring resonators and Fabry-Perot cavities have been fabricated and characterized in order to determine optical features of the slot-waveguides. Group index behavior evidences guiding and confinement in the low-index slot region at O-band (1260-1370nm) telecommunication wavelengths. Propagation losses of <20 dB/cm have been measured for the transverse-electric mode of the slot-waveguides.
One of My Favorite Assignments: Automated Teller Machine Simulation.
ERIC Educational Resources Information Center
Oberman, Paul S.
2001-01-01
Describes an assignment for an introductory computer science class that requires the student to write a software program that simulates an automated teller machine. Highlights include an algorithm for the assignment; sample file contents; language features used; assignment variations; and discussion points. (LRW)
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.
Planar slot coupled microwave hybrid
Petter, Jeffrey K.
1991-01-01
A symmetrical 180.degree. microwave hybrid is constructed by opening a slot line in a ground plane below a conducting strip disposed on a dielectric substrate, creating a slot coupled conductor. Difference signals propagating on the slot coupled conductor are isolated on the slot line leaving sum signals to propagate on the microstrip. The difference signal is coupled from the slot line onto a second microstrip line for transmission to a desired location. The microstrip branches in a symmetrical fashion to provide the input/output ports of the 180.degree. hybrid. The symmetry of the device provides for balance and isolation between sum and difference signals, and provides an advantageous balance between the power handling capabilities and the bandwidth of the device.
Pressey, F.W.
1959-09-01
An improvement is reported in the shape and formation of the slot or opening in the collimating slot member which forms part of an ion source of the type wherein a vapor of the material to be ionized is bombarded by electrons in a magnetic field to strike an arc-producing ionization. The defining slot is formed so as to have a substantial taper away from the cathode, causing the electron bombardment from the cathode to be dispersed over a greater area reducing its temperature and at the same time bringing the principal concentration of heat from the electron bombardment nearer the anode side of the slot, thus reducing deterioration and prolonging the life of the slot member during operation.
Extending birthday paradox theory to estimate the number of tags in RFID systems.
Shakiba, Masoud; Singh, Mandeep Jit; Sundararajan, Elankovan; Zavvari, Azam; Islam, Mohammad Tariqul
2014-01-01
The main objective of Radio Frequency Identification systems is to provide fast identification for tagged objects. However, there is always a chance of collision, when tags transmit their data to the reader simultaneously. Collision is a time-consuming event that reduces the performance of RFID systems. Consequently, several anti-collision algorithms have been proposed in the literature. Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular of these algorithms. DFSA dynamically modifies the frame size based on the number of tags. Since the real number of tags is unknown, it needs to be estimated. Therefore, an accurate tag estimation method has an important role in increasing the efficiency and overall performance of the tag identification process. In this paper, we propose a novel estimation technique for DFSA anti-collision algorithms that applies birthday paradox theory to estimate the number of tags accurately. The analytical discussion and simulation results prove that the proposed method increases the accuracy of tag estimation and, consequently, outperforms previous schemes.
NASA Astrophysics Data System (ADS)
Chen, Jung-Chieh
This paper presents a low complexity algorithmic framework for finding a broadcasting schedule in a low-altitude satellite system, i. e., the satellite broadcast scheduling (SBS) problem, based on the recent modeling and computational methodology of factor graphs. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, in this paper, we transform the SBS problem into an LDPC-like problem through a factor graph instead of using the conventional neural network approaches to solve the SBS problem. Based on a factor graph framework, the soft-information, describing the probability that each satellite will broadcast information to a terminal at a specific time slot, is exchanged among the local processing in the proposed framework via the sum-product algorithm to iteratively optimize the satellite broadcasting schedule. Numerical results show that the proposed approach not only can obtain optimal solution but also enjoys the low complexity suitable for integral-circuit implementation.
Extending Birthday Paradox Theory to Estimate the Number of Tags in RFID Systems
Shakiba, Masoud; Singh, Mandeep Jit; Sundararajan, Elankovan; Zavvari, Azam; Islam, Mohammad Tariqul
2014-01-01
The main objective of Radio Frequency Identification systems is to provide fast identification for tagged objects. However, there is always a chance of collision, when tags transmit their data to the reader simultaneously. Collision is a time-consuming event that reduces the performance of RFID systems. Consequently, several anti-collision algorithms have been proposed in the literature. Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular of these algorithms. DFSA dynamically modifies the frame size based on the number of tags. Since the real number of tags is unknown, it needs to be estimated. Therefore, an accurate tag estimation method has an important role in increasing the efficiency and overall performance of the tag identification process. In this paper, we propose a novel estimation technique for DFSA anti-collision algorithms that applies birthday paradox theory to estimate the number of tags accurately. The analytical discussion and simulation results prove that the proposed method increases the accuracy of tag estimation and, consequently, outperforms previous schemes. PMID:24752285
Measurement of the depth of narrow slotted sections in eddy current reference standards
NASA Astrophysics Data System (ADS)
Kim, Young-Joo; Kim, Young-gil; Ahn, Bongyoung; Yoon, Dong-Jin
2007-02-01
The dimensions of the slots in eddy current (EC) reference standards are too narrow to be measured by general depth measurement methods such as the optical (laser) or stylus methods. However, measurement of the dimensions of the machined slots is a prerequisite to using the blocks as references. The present paper suggests a measurement method for the slotted section using an ultrasonic test. The width and depth of the slots measured in our study are roughly 0.1 mm and 0.5 mm, respectively. The time of flight (TOF) of the ultrasonic wave was measured precisely. The ultrasonic velocity in the material of the EC reference standard was calculated with the measured values of the TOF and its thickness. Reflected waves from the tip of the slot and the bottom surface of the EC standard were successfully classified. Using this method we have successfully determined the depth of the slotted section.
A slotted access control protocol for metropolitan WDM ring networks
NASA Astrophysics Data System (ADS)
Baziana, P. A.; Pountourakis, I. E.
2009-03-01
In this study we focus on the serious scalability problems that many access protocols for WDM ring networks introduce due to the use of a dedicated wavelength per access node for either transmission or reception. We propose an efficient slotted MAC protocol suitable for WDM ring metropolitan area networks. The proposed network architecture employs a separate wavelength for control information exchange prior to the data packet transmission. Each access node is equipped with a pair of tunable transceivers for data communication and a pair of fixed tuned transceivers for control information exchange. Also, each access node includes a set of fixed delay lines for synchronization reasons; to keep the data packets, while the control information is processed. An efficient access algorithm is applied to avoid both the data wavelengths and the receiver collisions. In our protocol, each access node is capable of transmitting and receiving over any of the data wavelengths, facing the scalability issues. Two different slot reuse schemes are assumed: the source and the destination stripping schemes. For both schemes, performance measures evaluation is provided via an analytic model. The analytical results are validated by a discrete event simulation model that uses Poisson traffic sources. Simulation results show that the proposed protocol manages efficient bandwidth utilization, especially under high load. Also, comparative simulation results prove that our protocol achieves significant performance improvement as compared with other WDMA protocols which restrict transmission over a dedicated data wavelength. Finally, performance measures evaluation is explored for diverse numbers of buffer size, access nodes and data wavelengths.
Stock optimizing in choice when a token deposit is the operant.
Widholm, J J; Silberberg, A; Hursh, S R; Imam, A A; Warren-Boulton, F R
2001-11-01
Each of 2 monkeys typically earned their daily food ration by depositing tokens in one of two slots. Tokens deposited in one slot dropped into a bin where they were kept (token kept). Deposits to a second slot dropped into a bin where they could be obtained again (token returned). In Experiment 1, a fixed-ratio (FR) 5 schedule that provided two food pellets was associated with each slot. Both monkeys preferred the token-returned slot. In Experiment 2, both subjects chose between unequal FR schedules with the token-returned slot always associated with the leaner schedule. When the FRs were 2 versus 3 and 2 versus 6, preferences were maintained for the token-returned slot; however, when the ratios were 2 versus 12, preference shifted to the token-kept slot. In Experiment 3, both monkeys chose between equal-valued concurrent variable-interval variable-interval schedules. Both monkeys preferred the slot that returned tokens. In Experiment 4, both monkeys chose between FRs that typically differed in size by a factor of 10. Both monkeys preferred the FR schedule that provided more food per trial. These data show that monkeys will choose so as to increase the number of reinforcers earned (stock optimizing) even when this preference reduces the rate of reinforcement (all reinforcers divided by session time).
Magesh, Varadaraju; Harikrishnan, Pandurangan; Kingsly Jeba Singh, Devadhas
2018-04-01
Torque applied on anterior teeth is vital for root positioning and stability. The aim of this study was to evaluate the detailed slot wall deformation in stainless steel (SS) and titanium (Ti) edgewise brackets during palatal root torque using finite element analysis. A finite element model was developed from a maxillary central incisor SS bracket (0.022 in). The generated torque values from an SS rectangular archwire (0.019 × 0.025 in) while twisting from 5° to 40° were obtained experimentally by a spine tester, and the calculated torque force was applied in the bracket slot. The deformations of the slot walls in both SS and Ti brackets were measured at various locations. There were gradual increases in the deformations of both bracket slot walls from the bottom to top locations. In the SS bracket slot for the 40° twist, the deformations were 9.28, 36.8, and 44.8 μm in the bottom, middle, and top slot wall locations, respectively. Similarly, in the Ti bracket slot for the 40° twist, the deformations were 39.2, 62.4, and 76.2 μm in the bottom, middle, and top slot wall locations, respectively. The elastic limits were reached at 28° for SS and at 37° for Ti. Both SS and Ti bracket slots underwent deformation during torque application. There are variations in the deformations at different locations in the slot walls and between the materials. Copyright © 2017 American Association of Orthodontists. Published by Elsevier Inc. All rights reserved.
Wind-Tunnel Investigation of an NACA 23021 Airfoil with a 0.32-Airfoil-Chord Double Slotted Flap
NASA Technical Reports Server (NTRS)
Fischel, Jack; Riebe, John M
1944-01-01
An investigation was made in the LMAL 7- by 10-foot wind tunnel of a NACA 23021 airfoil with a double slotted flap having a chord 32 percent of the airfoil chord (0.32c) to determine the aerodynamic section characteristics with the flaps deflected at various positions. The effects of moving the fore flap and rear flap as a unit and of deflecting or removing the lower lip of the slot were also determined. Three positions were selected for the fore flap and at each position the maximum lift of the airfoil was obtained with the rear flap at the maximum deflection used at that fore-flap position. The section lift of the airfoil increased as the fore flap was extended and maximum lift was obtained with the fore flap deflected 30 deg in the most extended position. This arrangement provided a maximum section lift coefficient of 3.31, which was higher than the value obtained with either a 0.2566c or a 0.40c single-slotted-flap arrangement and 0.25 less than the value obtained with a 0.4c double-slotted-flap arrangement on the same airfoil. The values of the profile-drag coefficient obtained with the 0.32c double slotted flap were larger than those for the 0.2566c or 0.40c single slotted flaps for section lift coefficients between 1.0 and approximately 2.7. At all values of the section lift coefficient above 1.0, the 0.40c double slotted flap had a lower profile drag than the 0.32c double slotted flap. At various values of the maximum section lift coefficient produced by various flap defections, the 0.32c double slotted flap gave negative section pitching-moment coefficients that were higher than those of other slotted flaps on the same airfoil. The 0.32c double slotted flap gave approximately the same maximum section lift coefficient as, but higher profile-drag coefficients over the entire lift range than, a similar arrangement of a 0.30c double slotted flap on an NACA 23012 airfoil.
An agglomerative hierarchical clustering approach to visualisation in Bayesian clustering problems
Dawson, Kevin J.; Belkhir, Khalid
2009-01-01
Clustering problems (including the clustering of individuals into outcrossing populations, hybrid generations, full-sib families and selfing lines) have recently received much attention in population genetics. In these clustering problems, the parameter of interest is a partition of the set of sampled individuals, - the sample partition. In a fully Bayesian approach to clustering problems of this type, our knowledge about the sample partition is represented by a probability distribution on the space of possible sample partitions. Since the number of possible partitions grows very rapidly with the sample size, we can not visualise this probability distribution in its entirety, unless the sample is very small. As a solution to this visualisation problem, we recommend using an agglomerative hierarchical clustering algorithm, which we call the exact linkage algorithm. This algorithm is a special case of the maximin clustering algorithm that we introduced previously. The exact linkage algorithm is now implemented in our software package Partition View. The exact linkage algorithm takes the posterior co-assignment probabilities as input, and yields as output a rooted binary tree, - or more generally, a forest of such trees. Each node of this forest defines a set of individuals, and the node height is the posterior co-assignment probability of this set. This provides a useful visual representation of the uncertainty associated with the assignment of individuals to categories. It is also a useful starting point for a more detailed exploration of the posterior distribution in terms of the co-assignment probabilities. PMID:19337306
Federal Register 2010, 2011, 2012, 2013, 2014
2011-10-24
... for the Reallocation of Slots at Ronald Reagan Washington National Airport and LaGuardia Airport... for the reallocation of slots at Ronald Reagan Washington National Airport and LaGuardia Airport... collectively to dispose of 16 slots at Ronald Reagan Washington National Airport (DCA) and 32 slots at LGA...
NASA Technical Reports Server (NTRS)
Weisman, Yale; Holtzclaw, Ralph W.
1944-01-01
Tests were conducted at dynamic pressure of 50 lb per square foot with lift drag and pitch moment measurements throughout useful angle of attack range for constant flap deflection and position of a low-drag airfoil. Two slots were investigated and practical flap paths were selected for each Slot shape had a negligible effect on the maximum lift coefficient flap deflected, the rounded-entry slot had lower profile drag.
Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets
NASA Astrophysics Data System (ADS)
Deng, Xiaotie; Sun, Yang; Yin, Ming; Zhou, Yunhong
In this paper, we study pricing models for multi-slot advertisements, where advertisers can bid to place links to their sales webpages at one or multiple slots on a webpage, called the multi-slot AD auction problem. We develop and analyze several important mechanisms, including the VCG mechanism for multi-slot ads auction, the optimal social welfare solution, as well as two weighted GSP-like protocols (mixed and hybrid). Furthermore, we consider that forward-looking Nash equilibrium and prove its existence in the weighted GSP-like pricing protocols.
Shared protection based virtual network mapping in space division multiplexing optical networks
NASA Astrophysics Data System (ADS)
Zhang, Huibin; Wang, Wei; Zhao, Yongli; Zhang, Jie
2018-05-01
Space Division Multiplexing (SDM) has been introduced to improve the capacity of optical networks. In SDM optical networks, there are multiple cores/modes in each fiber link, and spectrum resources are multiplexed in both frequency and core/modes dimensions. Enabled by network virtualization technology, one SDM optical network substrate can be shared by several virtual networks operators. Similar with point-to-point connection services, virtual networks (VN) also need certain survivability to guard against network failures. Based on customers' heterogeneous requirements on the survivability of their virtual networks, this paper studies the shared protection based VN mapping problem and proposes a Minimum Free Frequency Slots (MFFS) mapping algorithm to improve spectrum efficiency. Simulation results show that the proposed algorithm can optimize SDM optical networks significantly in terms of blocking probability and spectrum utilization.
Resource sharing on CSMA/CD networks in the presence of noise. M.S. Thesis
NASA Technical Reports Server (NTRS)
Dinschel, Duane Edward
1987-01-01
Resource sharing on carrier sense multiple access with collision detection (CSMA/CD) networks can be accomplished by using window-control algorithms for bus contention. The window-control algorithms are designed to grant permission to transmit to the station with the minimum contention parameter. Proper operation of the window-control algorithm requires that all stations sense the same state of the newtork in each contention slot. Noise causes the state of the network to appear as a collision. False collisions can cause the window-control algorithm to terminate without isolating any stations. A two-phase window-control protocol and approximate recurrence equation with noise as a parameter to improve the performance of the window-control algorithms in the presence of noise are developed. The results are compared through simulation, with the approximate recurrence equation yielding the best overall performance. Noise is even a bigger problem when it is not detected by all stations. In such cases it is possible for the window boundaries of the contending stations to become out of phase. Consequently, it is possible to isolate a station other than the one with the minimum contention parameter. To guarantee proper isolation of the minimum, a broadcast phase must be added after the termination of the algorithm. The protocol required to correct the window-control algorithm when noise is not detected by all stations is discussed.
Application of a Dynamic Programming Algorithm for Weapon Target Assignment
2016-02-01
25] A . Turan , “Techniques for the Allocation of Resources Under Uncertainty,” Middle Eastern Technical University, Ankara, Turkey, 2012. [26] K...UNCLASSIFIED UNCLASSIFIED Application of a Dynamic Programming Algorithm for Weapon Target Assignment Lloyd Hammond Weapons and...optimisation techniques to support the decision making process. This report documents the methodology used to identify, develop and assess a
Ehrenfeld, Jesse M; Dexter, Franklin; Rothman, Brian S; Minton, Betty Sue; Johnson, Diane; Sandberg, Warren S; Epstein, Richard H
2013-12-01
When the phase I postanesthesia care unit (PACU) is at capacity, completed cases need to be held in the operating room (OR), causing a "PACU delay." Statistical methods based on historical data can optimize PACU staffing to achieve the least possible labor cost at a given service level. A decision support process to alert PACU charge nurses that the PACU is at or near maximum census might be effective in lessening the incidence of delays and reducing over-utilized OR time, but only if alerts are timely (i.e., neither too late nor too early to act upon) and the PACU slot can be cleared quickly. We evaluated the maximum potential benefit of such a system, using assumptions deliberately biased toward showing utility. We extracted 3 years of electronic PACU data from a tertiary care medical center. At this hospital, PACU admissions were limited by neither inadequate PACU staffing nor insufficient PACU beds. We developed a model decision support system that simulated alerts to the PACU charge nurse. PACU census levels were reconstructed from the data at a 1-minute level of resolution and used to evaluate if subsequent delays would have been prevented by such alerts. The model assumed there was always a patient ready for discharge and an available hospital bed. The time from each alert until the maximum census was exceeded ("alert lead time") was determined. Alerts were judged to have utility if the alert lead time fell between various intervals from 15 or 30 minutes to 60, 75, or 90 minutes after triggering. In addition, utility for reducing over-utilized OR time was assessed using the model by determining if 2 patients arrived from 5 to 15 minutes of each other when the PACU census was at 1 patient less than the maximum census. At most, 23% of alerts arrived 30 to 60 minutes prior to the admission that resulted in the PACU exceeding the specified maximum capacity. When the notification window was extended to 15 to 90 minutes, the maximum utility was <50%. At most, 45% of alerts potentially would have resulted in reassigning the last available PACU slot to 1 OR versus another within 15 minutes of the original assignment. Despite multiple biases that favored effectiveness, the maximum potential benefit of a decision support system to mitigate PACU delays on the day on the surgery was below the 70% minimum threshold for utility of automated decision support messages, previously established via meta-analysis. Neither reduction in PACU delays nor reassigning promised PACU slots based on reducing over-utilized OR time were realized sufficiently to warrant further development of the system. Based on these results, the only evidence-based method of reducing PACU delays is to adjust PACU staffing and staff scheduling using computational algorithms to match the historical workload (e.g., as developed in 2001).
Student-led objective tutorials in Pharmacology: An interventional study.
Sukhlecha, Anupama; Jadav, Shilpa P; Gosai, Tushar R; Balusamy, Divakar
2016-10-01
Students learn in a better way if they are involved in active learning. Hence, the study was designed to introduce student-led objective tutorials (SLOTs) as an alternative to conventional tutorials (CTs) in pharmacology and to compare SLOT and CT on outcomes such as improved score in tests, active involvement of students, and faculty requirement of each. Didactic lectures taken on a topic in pharmacology were followed by a preintervention test for a batch of the 2 nd year medical undergraduates. They were allotted either in SLOT or CT group. For a SLOT session, students of Group A (interventional group) were divided into teams and each team prepared five multiple choice questions on the given topic in PowerPoint format, which were presented to other teams and audience. The proceedings were facilitated by two lecturers. Group B undertook CT (controls). A postintervention test was then taken for both groups. Feedback was sought from students and teachers on SLOT. The total marks for the test were 20. The mean marks in Group A improved by 31% (from 5.1 to 11.2). In Group B, they improved by 11% (from 5 to 7.2). Academic performance following SLOT was better than CT. Students (63%) favored SLOT as it stimulated their interest in the topic, improved self-learning skills, and teamwork. The teachers also favored SLOT for similar reasons. SLOT leads to greater satisfaction and better performance in tests. SLOT is an effective alternative to CT to promote active learning among students through group work. It helps overcome the logistic difficulties due to faculty shortage.
Near-Miss Effects on Response Latencies and Win Estimations of Slot Machine Players
ERIC Educational Resources Information Center
Dixon, Mark R.; Schreiber, James E.
2004-01-01
The present study examined the degree to which slot machine near-miss trials, or trials that displayed 2 of 3 winning symbols on the payoff line, affected response times and win estimations of 12 recreational slot machine players. Participants played a commercial slot machine in a casino-like laboratory for course extra-credit points. Videotaped…
Slotted Antenna with Anisotropic Magnetic Loading
2016-07-26
10 SLOTTED ANTENNA WITH ANISOTROPIC MAGNETIC LOADING STATEMENT OF GOVERNMENT INTEREST [0001] The invention described herein may be manufactured...is directed to a slotted antenna having enhanced broadband characteristics. (2) Description of the Prior Art [0004] Slotted cylinder antennas are...popular antennas for use in line of sight communications systems, especially where the carrier frequency exceeds 300 MHz. FIG. 1 provides a diagram
14 CFR 93.226 - Allocation of slots in low-demand periods.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 14 Aeronautics and Space 2 2011-01-01 2011-01-01 false Allocation of slots in low-demand periods... low-demand periods. (a) If there are available slots in the following time periods and there are no... available less than 5 days per week. (2) Any time period for which a slot is available for less than a full...
14 CFR 93.226 - Allocation of slots in low-demand periods.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Allocation of slots in low-demand periods... low-demand periods. (a) If there are available slots in the following time periods and there are no... available less than 5 days per week. (2) Any time period for which a slot is available for less than a full...
Optimal design of mixed-media packet-switching networks - Routing and capacity assignment
NASA Technical Reports Server (NTRS)
Huynh, D.; Kuo, F. F.; Kobayashi, H.
1977-01-01
This paper considers a mixed-media packet-switched computer communication network which consists of a low-delay terrestrial store-and-forward subnet combined with a low-cost high-bandwidth satellite subnet. We show how to route traffic via ground and/or satellite links by means of static, deterministic procedures and assign capacities to channels subject to a given linear cost such that the network average delay is minimized. Two operational schemes for this network model are investigated: one is a scheme in which the satellite channel is used as a slotted ALOHA channel; the other is a new multiaccess scheme we propose in which whenever a channel collision occurs, retransmission of the involved packets will route through ground links to their destinations. The performance of both schemes is evaluated and compared in terms of cost and average packet delay tradeoffs for some examples. The results offer guidelines for the design and optimal utilization of mixed-media networks.
NASA Astrophysics Data System (ADS)
Yun, Kukchol; Tajč, L.; Kolovratník, M.
2016-03-01
The aim of the paper is to present the CFD analysis of the steam flow in the two-stage turbine with a drum rotor and balancing slots. The balancing slot is a part of every rotor blade and it can be used in the same way as balancing holes on the classical rotor disc. The main attention is focused on the explanation of the experimental knowledge about the impact of the slot covering and uncovering on the efficiency of the individual stages and the entire turbine. The pressure and temperature fields and the mass steam flows through the shaft seals, slots and blade cascades are calculated. The impact of the balancing slots covering or uncovering on the reaction and velocity conditions in the stages is evaluated according to the pressure and temperature fields. We have also concentrated on the analysis of the seal steam flow through the balancing slots. The optimized design of the balancing slots has been suggested.
Two-slot coiled coaxial cable resonator: reaching critical coupling at a reduced number of coils.
Hefferman, Gerald; Chen, Zhen; Wei, Tao
2014-11-01
This paper reports the experimental demonstration of a coiled coaxial cable resonator capable of meeting the critical coupling condition using a reduced number of coils relative to previously reported coiled resonators. By introducing a second slot along the length of the device, a two-slot coiled coaxial cable resonator was fabricated and critical coupling observed at 22 turns. An additional device with one-slot, but otherwise identically constructed, was also fabricated. After 44 turns, the one-slot device had yet to reach critical coupling. An ultrahigh signal-to-noise ratio (greater than 70 dB) was observed at critical coupling of the two-slot device. This reduction in number of slots necessary to reach critical coupling, and the corresponding reduction of physical length of the device, makes this demonstration of the control of critical coupling a potentially important step towards the successful application of coiled coaxial cable resonators to microwave communication and robust sensing applications.
NASA Technical Reports Server (NTRS)
Bain, D. B.; Smith, C. E.; Holdeman, J. D.
1992-01-01
A CFD study was performed to analyze the mixing potential of opposed rows of staggered jets injected into confined crossflow in a rectangular duct. Three jet configurations were numerically tested: (1) straight (0 deg) slots; (2) perpendicular slanted (45 deg) slots angled in opposite directions on top and bottom walls; and (3) parallel slanted (45 deg) slots angled in the same direction on top and bottom walls. All three configurations were tested at slot spacing-to-duct height ratios (S/H) of 0.5, 0.75, and 1.0; a jet-to-mainstream momentum flux ratio (J) of 100; and a jet-to-mainstream mass flow ratio of 0.383. Each configuration had its best mixing performance at S/H of 0.75. Asymmetric flow patterns were expected and predicted for all slanted slot configurations. The parallel slanted slot configuration was the best overall configuration at x/H of 1.0 for S/H of 0.75.
Controlling temperature dependence of silicon waveguide using slot structure.
Lee, Jong-Moo; Kim, Duk-Jun; Kim, Gwan-Ha; Kwon, O-Kyun; Kim, Kap-Joong; Kim, Gyungock
2008-02-04
We show that the temperature dependence of a silicon waveguide can be controlled well by using a slot waveguide structure filled with a polymer material. Without a slot, the amount of temperature-dependent wavelength shift for TE mode of a silicon waveguide ring resonator is very slightly reduced from 77 pm/ degrees C to 66 pm/ degrees C by using a polymer (WIR30-490) upper cladding instead of air upper cladding. With a slot filled with the same polymer, however, the reduction of the temperature dependence is improved by a pronounced amount and can be controlled down to -2 pm/ degrees C by adjusting several variables of the slot structure, such as the width of the slot between the pair of silicon wires, the width of the silicon wire pair, and the height of the silicon slab in our experiment. This measurement proves that a reduction in temperature dependence can be improved about 8 times more by using the slot structure.
Spreadsheet Calculation of Jets in Crossflow: Opposed Rows of Slots Slanted at 45 Degrees
NASA Technical Reports Server (NTRS)
Holderman, James D.; Clisset, James R.; Moder, Jeffrey P.
2011-01-01
The purpose of this study was to extend a baseline empirical model to the case of jets entering the mainstream flow from opposed rows of 45 degrees slanted slots. The results in this report were obtained using a spreadsheet modified from the one posted with NASA/TM--2010-216100. The primary conclusion in this report is that the best mixing configuration for opposed rows of 45 degrees slanted slots at any down stream distance is a parallel staggered configuration where the slots are angled in the same direction on top and bottom walls and one side is shifted by half the orifice spacing. Although distributions from perpendicular slanted slots are similar to those from parallel staggered configurations at some downstream locations, results for perpendicular slots are highly dependent on downstream distance and are no better than parallel staggered slots at locations where they are similar and are worse than parallel ones at other distances.
Tri-Band CPW-Fed Stub-Loaded Slot Antenna Design for WLAN/WiMAX Applications
NASA Astrophysics Data System (ADS)
Li, Jianxing; Guo, Jianying; He, Bin; Zhang, Anxue; Liu, Qing Huo
2016-11-01
A novel uniplanar CPW-fed tri-band stub-loaded slot antenna is proposed for wireless local area network (WLAN) and worldwide interoperability for microwave access (WiMAX) applications. Dual resonant modes were effectively excited in the upper band by using two identical pairs of slot stubs and parasitic slots symmetrically along the arms of a traditional CPW-fed slot dipole, achieving a much wider bandwidth. The middle band was realized by the fundamental mode of the slot dipole. To obtain the lower band, two identical inverted-L-shaped open-ended slots were symmetrically etched in the ground plane. A prototype was fabricated and measured, showing that tri-band operation with 10-dB return loss bandwidths of 150 MHz from 2.375 to 2.525 GHz, 725 MHz from 3.075 to 3.8 GHz, and 1.9 GHz from 5.0 to 6.9 GHz has been achieved. Details of the antenna design as well as the measured and simulated results are presented and discussed.
McDonnell, Diana D; Graham, Carrie L
2015-03-01
In 2011 California began transitioning approximately 340,000 seniors and people with disabilities from Medicaid fee-for-service (FFS) to Medicaid managed care plans. When beneficiaries did not actively choose a managed care plan, the state assigned them to one using an algorithm based on their previous FFS primary and specialty care use. When no clear link could be established, beneficiaries were assigned by default to a managed care plan based on weighted randomization. In this article we report the results of a telephone survey of 1,521 seniors and people with disabilities enrolled in Medi-Cal (California Medicaid) and who were recently transitioned to a managed care plan. We found that 48 percent chose their own plan, 11 percent were assigned to a plan by algorithm, and 41 percent were assigned to a plan by default. People in the latter two categories reported being similarly less positive about their experiences compared to beneficiaries who actively chose a plan. Many states in addition to California are implementing mandatory transitions of Medicaid-only beneficiaries to managed care plans. Our results highlight the importance of encouraging beneficiaries to actively choose their health plan; when beneficiaries do not choose, states should employ robust intelligent assignment algorithms. Project HOPE—The People-to-People Health Foundation, Inc.
NASA Technical Reports Server (NTRS)
Wenzinger, Carl J; Shortal, Joseph A
1932-01-01
Aerodynamic force tests on a slotted Clark Y wing were conducted in a vertical wind tunnel to determine the best position for a given auxiliary airfoil with respect to the main wing. A systematic series of 100 changes in location of the auxiliary airfoil were made to cover all the probable useful ranges of slot gap, slot width, and slot depth. The results of the investigation may be applied to the design of automatic or controlled slots on wings with geometric characteristics similar to the wing tested. The best positions of the auxiliary airfoil were covered by the range of the tests, and the position for desired aerodynamic characteristics may easily be obtained from charts prepared especially for the purpose.
Practical Tests with the "auto Control Slot." Part II : Discussion
NASA Technical Reports Server (NTRS)
Lachmann, G
1930-01-01
For some time the D.V.L. has been investigating the question of applicability of Handley Page slotted wings to German airplanes. Comparitive gliding tests were made with open and closed slots on an Albatros L 75 airplane equipped with the Handley Page "auto control slots." This investigation served to determine the effect of the auto control slot on the properties and performances of airplanes at large angles of attack. The most important problems were whether the angle of glide at small angles of attack can be increased by the adoption of the auto control slot and, in particular, as to whether the flight characteristics at large angles of attack are improved thereby and equilibrium in gliding flight is guaranteed even at larger than ordinary angles of attack.
Practical Tests with the "auto Control Slot." Part I : Lecture
NASA Technical Reports Server (NTRS)
Lachmann, G
1930-01-01
For some time the D.V.L. has been investigating the question of applicability of Handley Page slotted wings to German airplanes. Comparitive gliding tests were made with open and closed slots on an Albatros L 75 airplane equipped with the Handley Page "auto control slots." This investigation served to determine the effect of the auto control slot on the properties and performances of airplanes at large angles of attack. The most important problems were whether the angle of glide at small angles of attack can be increased by the adoption of the auto control slot and, in particular, as to whether the flight characteristics at large angles of attack are improved thereby and equilibrium in gliding flight is guaranteed even at larger than ordinary angles of attack.
Slot Optimization Design of Induction Motor for Electric Vehicle
NASA Astrophysics Data System (ADS)
Shen, Yiming; Zhu, Changqing; Wang, Xiuhe
2018-01-01
Slot design of induction motor has a great influence on its performance. The RMxprt module based on magnetic circuit method can be used to analyze the influence of rotor slot type on motor characteristics and optimize slot parameters. In this paper, the authors take an induction motor of electric vehicle for a typical example. The first step of the design is to optimize the rotor slot by RMxprt, and then compare the main performance of the motor before and after the optimization through Ansoft Maxwell 2D. After that, the combination of optimum slot type and the optimum parameters are obtained. The results show that the power factor and the starting torque of the optimized motor have been improved significantly. Furthermore, the electric vehicle works at a better running status after the optimization.
Noise Reduction of Aircraft Flap
NASA Technical Reports Server (NTRS)
Hutcheson, Florence V. (Inventor); Brooks, Thomas F. (Inventor)
2009-01-01
A reduction in noise radiating from a side of a deployed aircraft flap is achieved by locating a slot adjacent the side of the flap, and then forcing air out through the slot with a suitable mechanism. One, two or even three or more slots are possible, where the slot is located at one;or more locations selected from a group of locations comprising a top surface of the flap, a bottom surface of the flap, an intersection of the top and side surface of the flap, an intersection of the bottom and side surfaces of the flap, and a side surface of the flap. In at least one embodiment the slot is substantially rectangular. A device for adjusting a rate of the air forced out through the slot can also be provided.
NASA Technical Reports Server (NTRS)
Wentz, W. H., Jr.
1977-01-01
Two dimensional wind tunnel tests were conducted for the GA(W)-2 airfoil section with: 20% aileron, 25% slotted flap; 30% Fowler flap, and 10% slot-lip spoiler. All tests were conducted at a Reynolds number of 2,200,000 and a Mach Number of 0.13. In addition to force measurements, tuft studies were conducted for the slotted and Fowler flap configurations. Aileron and spoiler hinge moments were obtained by integration of surface pressure measurements. Tests results show that a value of 3.82 was obtained with 30% Fowler flap. Aileron control effectiveness and hinge moments were similar to other airfoils. The slot-lip spoiler provided powerful, positive roll control at all flap settings.
An Improved SoC Test Scheduling Method Based on Simulated Annealing Algorithm
NASA Astrophysics Data System (ADS)
Zheng, Jingjing; Shen, Zhihang; Gao, Huaien; Chen, Bianna; Zheng, Weida; Xiong, Xiaoming
2017-02-01
In this paper, we propose an improved SoC test scheduling method based on simulated annealing algorithm (SA). It is our first to disorganize IP core assignment for each TAM to produce a new solution for SA, allocate TAM width for each TAM using greedy algorithm and calculate corresponding testing time. And accepting the core assignment according to the principle of simulated annealing algorithm and finally attain the optimum solution. Simultaneously, we run the test scheduling experiment with the international reference circuits provided by International Test Conference 2002(ITC’02) and the result shows that our algorithm is superior to the conventional integer linear programming algorithm (ILP), simulated annealing algorithm (SA) and genetic algorithm(GA). When TAM width reaches to 48,56 and 64, the testing time based on our algorithm is lesser than the classic methods and the optimization rates are 30.74%, 3.32%, 16.13% respectively. Moreover, the testing time based on our algorithm is very close to that of improved genetic algorithm (IGA), which is state-of-the-art at present.
Rectangular-cladding silicon slot waveguide with improved nonlinear performance
NASA Astrophysics Data System (ADS)
Huang, Zengzhi; Huang, Qingzhong; Wang, Yi; Xia, Jinsong
2018-04-01
Silicon slot waveguides have great potential in hybrid silicon integration to realize nonlinear optical applications. We propose a rectangular-cladding hybrid silicon slot waveguide. Simulation result shows that, with a rectangular-cladding, the slot waveguide can be formed by narrower silicon strips, so the two-photon absorption (TPA) loss in silicon is decreased. When the cladding material is a nonlinear polymer, the calculated TPA figure of merit (FOMTPA) is 4.4, close to the value of bulk nonlinear polymer of 5.0. This value confirms the good nonlinear performance of rectangular-cladding silicon slot waveguides.
Lipp, G. Daniel
1994-04-26
A method and die apparatus for manufacturing a honeycomb body of rhombic cell cross-section by extrusion through an extrusion die of triangular cell discharge slot configuration, the die incorporating feedholes at selected slot intersections only, such that slot segments communicating directly with the feedholes discharge web material and slot segments not so connected do not discharge web material, whereby a rhombic cell cross-section in the extruded body is provided.
Dual Mode Slotted Monopole Antenna
2017-01-05
of 15 DUAL MODE SLOTTED MONOPOLE ANTENNA STATEMENT OF GOVERNMENT INTEREST [0001] The invention described herein may be manufactured and used by...to a dual mode antenna having one mode as a slotted cylinder antenna and another mode as a monopole antenna . (2) Description of the Prior Art...0004] Slotted cylinder antennas are popular antennas for use in line of sight communications systems, especially where the carrier frequency exceeds
2013-01-01
Background During orthodontic treatment, a low resistance to slide (RS) is desirable when sliding mechanics are used. Many studies showed that several variables affect the RS at the bracket-wire interface; among these, the design of the bracket slot has not been deeply investigated yet. This study aimed to clarify the effect of different slot designs on the RS expressed by five types of low-friction brackets in vertical and horizontal active configurations of the wire. Methods Five low-friction brackets (Damon SL II, Ormco, Orange, CA, USA; In-Ovation, GAC International, Bohemia, NY, USA; Quick, Forestadent, Pforzheim, Germany; Time 2, AO, Sheboygan, WI, USA; Synergy, RMO, Denver, CO, USA) coupled with an 0.014-in NiTi thermal wire (Therma-Lite, AO) were tested in two three-bracket experimental models simulating vertical and horizontal bracket displacements. A custom-made machine was used to measure frictional resistance with tests repeated on ten occasions for each bracket-wire combination. Design characteristics such as the mesio-distal slot width, slot depth, and presence of chamfered edges at the extremities of the slot were evaluated on SEM images (SUPRA, Carl Zeiss, Oberkochen, Germany) and analyzed in relation to the data of RS recorded. Results Time 2 was found to show the higher frictional forces (1.50 and 1.35 N) in both experimental models (p < 0.05), while Quick and Synergy brackets showed the lower frictional values in the vertical (0.66 N) and in the horizontal (0.68 N) bracket displacements, respectively. With vertically displaced brackets, the increased mesio-distal slot width and the presence of clear angle at mesial and distal slot edges increase the values of RS. With brackets horizontally displaced, the RS expressed by the wire is influenced simultaneously by the depth of the slot, the mesio-distal slot width, and the presence of clear angle at the extremities of the slot base, the clip, or the slide. Conclusion In order to select the proper low-friction bracket system, clinicians should consider specific characteristics of slot design apart from the wire engaging method. PMID:24325837
Primary path reservation using enhanced slot assignment in TDMA for session admission.
Koneri Chandrasekaran, Suresh; Savarimuthu, Prakash; Andi Elumalai, Priya; Ayyaswamy, Kathirvel
2015-01-01
Mobile ad hoc networks (MANET) is a self-organized collection of nodes that communicates without any infrastructure. Providing quality of service (QoS) in such networks is a competitive task due to unreliable wireless link, mobility, lack of centralized coordination, and channel contention. The success of many real time applications is purely based on the QoS, which can be achieved by quality aware routing (QAR) and admission control (AC). Recently proposed QoS mechanisms do focus completely on either reservation or admission control but are not better enough. In MANET, high mobility causes frequent path break due to the fact that every time the source node must find the route. In such cases the QoS session is affected. To admit a QoS session, admission control protocols must ensure the bandwidth of the relaying path before transmission starts; reservation of such bandwidth noticeably improves the admission control performance. Many TDMA based reservation mechanisms are proposed but need some improvement over slot reservation procedures. In order to overcome this specific issue, we propose a framework-PRAC (primary path reservation admission control protocol), which achieves improved QoS by making use of backup route combined with resource reservation. A network topology has been simulated and our approach proves to be a mechanism that admits the session effectively.
Flexible Multi agent Algorithm for Distributed Decision Making
2015-01-01
How, J. P. Consensus - Based Auction Approaches for Decentralized task Assignment. Proceedings of the AIAA Guidance, Navigation, and Control...G. ; Kim, Y. Market- based Decentralized Task Assignment for Cooperative UA V Mission Including Rendezvous. Proceedings of the AIAA Guidance...scalable and adaptable to a variety of specific mission tasks . Additionally, the algorithm could easily be adapted for use on land or sea- based systems
Wind Tunnel Results of Pneumatic Forebody Vortex Control Using Rectangular Slots a Chined Forebody
NASA Technical Reports Server (NTRS)
Alexander, Michael; Meyn, Larry A.
1994-01-01
A subsonic wind tunnel investigation of pneumatic vortex flow control on a chined forebody using slots was accomplished at a dynamic pressure of 50 psf resulting in a R(n)/ft of 1.3 x 10(exp 6). Data were acquired from angles of attack ranging from -4deg to +34deg at side slips of +0.4deg and +10.4deg. The test article used in this study was the 10% scale Fighter Lift and Control (FLAC) advanced diamond winged, vee-tailed fighter configuration. Three different slot blowing concepts were evaluated; outward, downward, and tangential with ail blowing accomplished asymmetrically. The results of three different mass flows (0.067, 0.13, and 0.26 lbm/s; C(sub mu)'s of less than or equal to 0.006, 0.011. and 0.022 respectively) were analyzed and reported. Test data are presented on the effects of mass flows, slot lengths and positions and blowing concepts on yawing moment and side force generation. Results from this study indicate that the outward and downward blowing slots developed yawing moment and side force increments in the direction opposite of the blowing side while the tangential blowing slots generated yawing moment and side force increments in the direction towards the blowing side. The outward and downward blowing slots typically produced positive pitching moment increments while the tangential blowing slots typically generated negative pitching moment increments. The slot blowing nearest the forebody apex was most effective at generating the largest increments and as the slot was moved aft or increased in length, its effectiveness at generating forces and moments diminished.
Low Average Sidelobe Slot Array Antennas for Radiometer Applications
NASA Technical Reports Server (NTRS)
Rengarajan, Sembiam; Zawardzki, Mark S.; Hodges, Richard E.
2012-01-01
In radiometer applications, it is required to design antennas that meet low average sidelobe levels and low average return loss over a specified frequency bandwidth. It is a challenge to meet such specifications over a frequency range when one uses resonant elements such as waveguide feed slots. In addition to their inherent narrow frequency band performance, the problem is exacerbated due to modeling errors and manufacturing tolerances. There was a need to develop a design methodology to solve the problem. An iterative design procedure was developed by starting with an array architecture, lattice spacing, aperture distribution, waveguide dimensions, etc. The array was designed using Elliott s technique with appropriate values of the total slot conductance in each radiating waveguide, and the total resistance in each feed waveguide. Subsequently, the array performance was analyzed by the full wave method of moments solution to the pertinent integral equations. Monte Carlo simulations were also carried out to account for amplitude and phase errors introduced for the aperture distribution due to modeling errors as well as manufacturing tolerances. If the design margins for the average sidelobe level and the average return loss were not adequate, array architecture, lattice spacing, aperture distribution, and waveguide dimensions were varied in subsequent iterations. Once the design margins were found to be adequate, the iteration was stopped and a good design was achieved. A symmetric array architecture was found to meet the design specification with adequate margin. The specifications were near 40 dB for angular regions beyond 30 degrees from broadside. Separable Taylor distribution with nbar=4 and 35 dB sidelobe specification was chosen for each principal plane. A non-separable distribution obtained by the genetic algorithm was found to have similar characteristics. The element spacing was obtained to provide the required beamwidth and close to a null in the E-plane end-fire direction. Because of the alternating slot offsets, grating lobes called butterfly lobes are produced in non-principal planes close to the H-plane. An attempt to reduce the influence of such grating lobes resulted in a symmetric design.
NASA Astrophysics Data System (ADS)
Foronda, Augusto; Ohta, Chikara; Tamaki, Hisashi
Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.
NASA Technical Reports Server (NTRS)
Schultz, Howard
1990-01-01
The retrieval algorithm for spaceborne scatterometry proposed by Schultz (1985) is extended. A circular median filter (CMF) method is presented, which operates on wind directions independently of wind speed, removing any implicit wind speed dependence. A cell weighting scheme is included in the algorithm, permitting greater weights to be assigned to more reliable data. The mathematical properties of the ambiguous solutions to the wind retrieval problem are reviewed. The CMF algorithm is tested on twelve simulated data sets. The effects of spatially correlated likelihood assignment errors on the performance of the CMF algorithm are examined. Also, consideration is given to a wind field smoothing technique that uses a CMF.
Algorithmic Coordination in Robotic Networks
2010-11-29
appropriate performance, robustness and scalability properties for various task allocation , surveillance, and information gathering applications is...networking, we envision designing and analyzing algorithms with appropriate performance, robustness and scalability properties for various task ...distributed algorithms for target assignments; based on the classic auction algorithms in static networks, we intend to design efficient algorithms in worst
NASA Astrophysics Data System (ADS)
Wang, Zu-liang; Zhang, Ting; Xie, Shi-yang
2017-01-01
In order to improve the agricultural tracing efficiency and reduce tracking and monitoring cost, agricultural products quality tracking and tracing based on Radio-Frequency Identification(RFID) technology is studied, then tracing and tracking model is set up. Three-layer structure model is established to realize the high quality of agricultural products traceability and tracking. To solve the collision problems between multiple RFID tags and improve the identification efficiency a new reservation slot allocation mechanism is proposed. And then we analyze and optimize the parameter by numerical simulation method.
Adaptive Control Strategies for Flexible Robotic Arm
NASA Technical Reports Server (NTRS)
Bialasiewicz, Jan T.
1996-01-01
The control problem of a flexible robotic arm has been investigated. The control strategies that have been developed have a wide application in approaching the general control problem of flexible space structures. The following control strategies have been developed and evaluated: neural self-tuning control algorithm, neural-network-based fuzzy logic control algorithm, and adaptive pole assignment algorithm. All of the above algorithms have been tested through computer simulation. In addition, the hardware implementation of a computer control system that controls the tip position of a flexible arm clamped on a rigid hub mounted directly on the vertical shaft of a dc motor, has been developed. An adaptive pole assignment algorithm has been applied to suppress vibrations of the described physical model of flexible robotic arm and has been successfully tested using this testbed.
DNABIT Compress - Genome compression algorithm.
Rajarajeswari, Pothuraju; Apparao, Allam
2011-01-22
Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, "DNABIT Compress" for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that "DNABIT Compress" algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases.
Multi-cored vortices support function of slotted wing tips of birds in gliding and flapping flight
2017-01-01
Slotted wing tips of birds are commonly considered an adaptation to improve soaring performance, despite their presence in species that neither soar nor glide. We used particle image velocimetry to measure the airflow around the slotted wing tip of a jackdaw (Corvus monedula) as well as in its wake during unrestrained flight in a wind tunnel. The separated primary feathers produce individual wakes, confirming a multi-slotted function, in both gliding and flapping flight. The resulting multi-cored wingtip vortex represents a spreading of vorticity, which has previously been suggested as indicative of increased aerodynamic efficiency. Considering benefits of the slotted wing tips that are specific to flapping flight combined with the wide phylogenetic occurrence of this configuration, we propose the hypothesis that slotted wings evolved initially to improve performance in powered flight. PMID:28539482
NASA Technical Reports Server (NTRS)
Kazin, S. B.
1973-01-01
Acoustic tests were conducted on a high tip speed (1550 ft/sec, 472.44 m/sec) single stage fan with varying amounts of wall acoustic treatment and with circumferential slots over the rotor blade tips. The slots were also tested with acoustic treatment placed behind the slots. The wall treatment results show that the inlet treatment is more effective at high fan speeds and aft duct treatment is more effective at low fan speeds. Maximum PNL's on a 200-foot (60.96 m) sideline show the untreated slots to have increased the rear radiated noise at approach. However, when the treatment was added to the slots inlet radiated noise was decreased, resulting in little change relative to the solid casing on an EPNL basis.
High field pulsed microwiggler comprising a conductive tube with periodically space slots
Warren, R.W.
1992-09-01
A microwiggler assembly produces large magnetic fields for oscillating charged particle beams, particularly electron beams for free electron laser (FEL) application. A tube of electrically conductive material is formed with radial slots axially spaced at the period of the electron beam. The slots have alternate 180[degree] relationships and are formed to a maximum depth of 0.6 to 0.7 times the tube circumference. An optimum slot depth is selected to eliminate magnetic quadrupole fields within the microwiggler as determined from a conventional pulsed wire technique. Suitable slot configurations include single slits, double slits, triple slits, and elliptical slots. An axial electron beam direction is maintained by experimentally placing end slits adjacent entrance and exit portions of the assembly, where the end slit depth is determined by use of the pulsed wire technique outside the tube. 10 figs.
High field pulsed microwiggler comprising a conductive tube with periodically space slots
Warren, Roger W.
1992-01-01
A microwiggler assembly produces large magnetic fields for oscillating ched particle beams, particularly electron beams for free electron laser (FEL) application. A tube of electrically conductive material is formed with radial slots axially spaced at the period of the electron beam. The slots have alternate 180.degree. relationships and are formed to a maximum depth of 0.6 to 0.7 times the tube circumference. An optimum slot depth is selected to eliminate magnetic quadrupole fields within the microwiggler as determined from a conventional pulsed wire technique. Suitable slot configurations include single slits, double slits, triple slits, and elliptical slots. An axial electron beam direction is maintained by experimentally placing end slits adjacent entrance and exit portions of the assembly, where the end slit depth is determined by use of the pulsed wire technique outside the tube.
Slots in dielectric image line as mode launchers and circuit elements
NASA Astrophysics Data System (ADS)
Solbach, K.
1981-01-01
A planar resonator model is used to investigate slots in the ground plane of dielectric image lines. An equivalent circuit representation of the slot discontinuity is obtained, and the launching efficiency of the slot as a mode launcher is analyzed. Slots are also shown to be useful in the realization of dielectric image line array antennas. It is found that the slot discontinuity can be shown as a T-junction of the dielectric image line and a metal waveguide. The launching efficiency is found to increase with the dielectric constant of the dielectric image line, exhibiting a maximum value for guides whose height is slightly less than half a wavelength in the dielectric medium. The measured launching efficiencies of low permittivity dielectric image lines are found to be in good agreement with calculated values
Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J
2009-06-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian
2015-10-23
The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.
Islam, M T; Samsuzzaman, M
2014-01-01
This paper introduces a new configuration of compact, triangular- and diamond-slotted, microstrip-fed, low-profile antenna for C/X band applications on polytetrafluoroethylene glass microfiber reinforced material substrate. The antenna is composed of a rectangular-shaped patch containing eight triangles and two diamond-shaped slots and an elliptical-slotted ground plane. The rectangular-shaped patch is obtained by cutting two diamond slots in the middle of the rectangular patch, six triangular slots on the left and right side of the patch, and two triangular slots on the up and down side of the patch. The slotted radiating patch, the elliptical-slotted ground plane, and the microstrip feed enable the matching bandwidth to be widened. A prototype of the optimized antenna was fabricated on polytetrafluoroethylene glass microfiber reinforced material substrate using LPKF prototyping machine and investigated to validate the proposed design. The simulated results are compared with the measured data, and good agreement is achieved. The proposed antenna offers fractional bandwidths of 13.69% (7.78-8.91 GHz) and 10.35% (9.16-10.19 GHz) where S11 < -10 dB at center frequencies of 8.25 GHz and 9.95 GHz, respectively, and relatively stable gain, good radiation efficiency, and omnidirectional radiation patterns in the matching band.
NASA Astrophysics Data System (ADS)
Wang, Fu; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Tian, Qinghua; Zhang, Qi; Rao, Lan; Tian, Feng; Luo, Biao; Liu, Yingjun; Tang, Bao
2016-10-01
Elastic Optical Networks are considered to be a promising technology for future high-speed network. In this paper, we propose a RSA algorithm based on the ant colony optimization of minimum consecutiveness loss (ACO-MCL). Based on the effect of the spectrum consecutiveness loss on the pheromone in the ant colony optimization, the path and spectrum of the minimal impact on the network are selected for the service request. When an ant arrives at the destination node from the source node along a path, we assume that this path is selected for the request. We calculate the consecutiveness loss of candidate-neighbor link pairs along this path after the routing and spectrum assignment. Then, the networks update the pheromone according to the value of the consecutiveness loss. We save the path with the smallest value. After multiple iterations of the ant colony optimization, the final selection of the path is assigned for the request. The algorithms are simulated in different networks. The results show that ACO-MCL algorithm performs better in blocking probability and spectrum efficiency than other algorithms. Moreover, the ACO-MCL algorithm can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness. Compared with other algorithms, the ACO-MCL algorithm can reduce the blocking rate by at least 5.9% in heavy load.
Multi-Source Multi-Target Dictionary Learning for Prediction of Cognitive Decline.
Zhang, Jie; Li, Qingyang; Caselli, Richard J; Thompson, Paul M; Ye, Jieping; Wang, Yalin
2017-06-01
Alzheimer's Disease (AD) is the most common type of dementia. Identifying correct biomarkers may determine pre-symptomatic AD subjects and enable early intervention. Recently, Multi-task sparse feature learning has been successfully applied to many computer vision and biomedical informatics researches. It aims to improve the generalization performance by exploiting the shared features among different tasks. However, most of the existing algorithms are formulated as a supervised learning scheme. Its drawback is with either insufficient feature numbers or missing label information. To address these challenges, we formulate an unsupervised framework for multi-task sparse feature learning based on a novel dictionary learning algorithm. To solve the unsupervised learning problem, we propose a two-stage Multi-Source Multi-Target Dictionary Learning (MMDL) algorithm. In stage 1, we propose a multi-source dictionary learning method to utilize the common and individual sparse features in different time slots. In stage 2, supported by a rigorous theoretical analysis, we develop a multi-task learning method to solve the missing label problem. Empirical studies on an N = 3970 longitudinal brain image data set, which involves 2 sources and 5 targets, demonstrate the improved prediction accuracy and speed efficiency of MMDL in comparison with other state-of-the-art algorithms.
NASA Technical Reports Server (NTRS)
Renselaer, D. J.; Nishida, R. S.; Wilkin, C. A.
1975-01-01
The results and analyses of aerodynamic and acoustic studies conducted on the small scale noise and wind tunnel tests of upper surface blowing nozzle flap concepts are presented. Various types of nozzle flap concepts were tested. These are an upper surface blowing concept with a multiple slot arrangement with seven slots (seven slotted nozzle), an upper surface blowing type with a large nozzle exit at approximately mid-chord location in conjunction with a powered trailing edge flap with multiple slots (split flow or partially slotted nozzle). In addition, aerodynamic tests were continued on a similar multi-slotted nozzle flap, but with 14 slots. All three types of nozzle flap concepts tested appear to be about equal in overall aerodynamic performance but with the split flow nozzle somewhat better than the other two nozzle flaps in the landing approach mode. All nozzle flaps can be deflected to a large angle to increase drag without significant loss in lift. The nozzle flap concepts appear to be viable aerodynamic drag modulation devices for landing.
Federal Register 2010, 2011, 2012, 2013, 2014
2011-10-13
...The Secretary and the Federal Aviation Administration (FAA) are granting the joint waiver request of Delta Air Lines, Inc. (Delta) and US Airways, Inc. (US Airways) (together, the Joint Applicants or the carriers) from the prohibition on purchasing operating authorizations (slots) at LaGuardia Airport (LGA). The waiver permits the carriers to consummate a transaction in which US Airways would transfer to Delta 132 slot pairs (265 slots) at LGA. In exchange, Delta would transfer to US Airways 42 slot pairs (84 slots) at Ronald Reagan Washington National Airport (DCA), convey route authority to operate certain flights to S[atilde]o Paulo, Brazil, and make a cash payment to US Airways. The waiver is subject to a number of conditions, including that the carriers dispose of 16 slots at DCA and 32 slots at LGA to eligible new entrant and limited incumbent carriers, pursuant to procedures set out in this Notice, and achieve a mutually satisfactory agreement regarding gates and associated facilities with any such purchaser.
Subcutaneous electrode structure
NASA Technical Reports Server (NTRS)
Lund, G. F. (Inventor)
1980-01-01
A subcutaneous electrode structure suitable for a chronic implant and for taking a low noise electrocardiogram of an active animal, comprises a thin inflexible, smooth disc of stainless steel having a diameter as of 5 to 30 mm, which is sutured in place to the animal being monitored. The disc electrode includes a radially directed slot extending in from the periphery of the disc for approximately 1/3 of the diameter. Electrical connection is made to the disc by means of a flexible lead wire that extends longitudinally of the slot and is woven through apertures in the disc and held at the terminal end by means of a spot welded tab. Within the slot, an electrically insulative sleeve, such as silicone rubber, is placed over the wire. The wire with the sleeve mounted thereon is captured in the plane of the disc and within the slot by means of crimping tabs extending laterally of the slot and over the insulative wire. The marginal lip of the slot area is apertured and an electrically insulative potting material such as silicone rubber, is potted in place overlaying the wire slot region and through the apertures.
Predictors of return rate discrimination in slot machine play.
Coates, Ewan; Blaszczynski, Alex
2014-09-01
The purpose of this study was to investigate the extent to which accurate estimates of payback percentages and volatility combined with prior learning, enabled players to successfully discriminate between multi-line/multi-credit slot machines that provided differing rates of reinforcement. The aim was to determine if the capacity to discriminate structural characteristics of gaming machines influenced player choices in selecting 'favourite' slot machines. Slot machine gambling history, gambling beliefs and knowledge, impulsivity, illusions of control, and problem solving style were assessed in a sample of 48 first year undergraduate psychology students. Participants were subsequently exposed to a choice paradigm where they could freely select to play either of two concurrently presented PC-simulated slot machines programmed to randomly differ in expected player return rates (payback percentage) and win frequency (volatility). Results suggest that prior learning and cognitions (particularly gambler's fallacy) but not payback, were major contributors to the ability of a player to discriminate volatility between slot machines. Participants displayed a general tendency to discriminate payback, but counter-intuitively placed more bets on the slot machine with lower payback percentage rates.
Wind-tunnel tests on model wing with Fowler flap and specially developed leading-edge slot
NASA Technical Reports Server (NTRS)
Weick, Fred E; Platt, Robert C
1933-01-01
An investigation was made in the NACA 7 by 10 foot wind tunnel to find the increase in maximum lift coefficient which could be obtained by providing a model wing with both a Fowler trailing-edge extension flap and a Handley Page type leading-edge slot. A conventional Handley page slot proportioned to operate on the plain wing without a flap gave but a slight increase with the flap; so a special form of slot was developed to work more effectively with the flap. With the best combined arrangement the maximum lift coefficient based on the original area was increased from 3.17, for the Fowler wing, to 3.62. The minimum drag coefficient with both devices retracted was increased in approximately the same proportion. Tests were also made with the special-type slot on the plain wing without the flap. The special slot, used either with or without the Fowler flap, gave definitely higher values of the maximum lift coefficient than the slots of conventional form, with an increase of the same order in the minimum drag coefficient.
Interactive visual exploration and refinement of cluster assignments.
Kern, Michael; Lex, Alexander; Gehlenborg, Nils; Johnson, Chris R
2017-09-12
With ever-increasing amounts of data produced in biology research, scientists are in need of efficient data analysis methods. Cluster analysis, combined with visualization of the results, is one such method that can be used to make sense of large data volumes. At the same time, cluster analysis is known to be imperfect and depends on the choice of algorithms, parameters, and distance measures. Most clustering algorithms don't properly account for ambiguity in the source data, as records are often assigned to discrete clusters, even if an assignment is unclear. While there are metrics and visualization techniques that allow analysts to compare clusterings or to judge cluster quality, there is no comprehensive method that allows analysts to evaluate, compare, and refine cluster assignments based on the source data, derived scores, and contextual data. In this paper, we introduce a method that explicitly visualizes the quality of cluster assignments, allows comparisons of clustering results and enables analysts to manually curate and refine cluster assignments. Our methods are applicable to matrix data clustered with partitional, hierarchical, and fuzzy clustering algorithms. Furthermore, we enable analysts to explore clustering results in context of other data, for example, to observe whether a clustering of genomic data results in a meaningful differentiation in phenotypes. Our methods are integrated into Caleydo StratomeX, a popular, web-based, disease subtype analysis tool. We show in a usage scenario that our approach can reveal ambiguities in cluster assignments and produce improved clusterings that better differentiate genotypes and phenotypes.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Del Mastro, B. P.; Eckart, F.
1985-10-22
The slots for accommodating feather seals in the turbine vanes of a gas turbine engine has the end thereof sealed off by use of weld wire inserted into the slot and simultaneously welded and cut to the required length.
The Role of Ring Current on Slot Region Penetration
NASA Technical Reports Server (NTRS)
Fok, Mei-Ching; Elkington, Scot
2006-01-01
During magnetic quiet times, the inner belt, slot region and the outer belt are well defined regions. However, during some major storms, outer belt particles penetrate inward and significantly fill the slot region. In some extreme events, the outer belt particles travel through the slot and create a new belt in the inner region that persists from months to years. In this paper, we examine the role of the ring current on this radiation belt penetration into the slot region. The storm-time intensification of the ring current produces strong magnetic depression in the inner magnetosphere. This perturbation and its fluctuation enhance the radial transport and diffusion of the outer radiation belt particles. We perform kinetic and test-particle calculations to quantitatively assess the effects of the ring current field on filling of the slot region. Simulation results during major storms will be presented and discussed.
Multi-cored vortices support function of slotted wing tips of birds in gliding and flapping flight.
KleinHeerenbrink, Marco; Johansson, L Christoffer; Hedenström, Anders
2017-05-01
Slotted wing tips of birds are commonly considered an adaptation to improve soaring performance, despite their presence in species that neither soar nor glide. We used particle image velocimetry to measure the airflow around the slotted wing tip of a jackdaw ( Corvus monedula ) as well as in its wake during unrestrained flight in a wind tunnel. The separated primary feathers produce individual wakes, confirming a multi-slotted function, in both gliding and flapping flight. The resulting multi-cored wingtip vortex represents a spreading of vorticity, which has previously been suggested as indicative of increased aerodynamic efficiency. Considering benefits of the slotted wing tips that are specific to flapping flight combined with the wide phylogenetic occurrence of this configuration, we propose the hypothesis that slotted wings evolved initially to improve performance in powered flight. © 2017 The Author(s).
NASA Technical Reports Server (NTRS)
Grant, W. L.
1969-01-01
A high-temperature statorette, consisting of an iron-27 percent cobalt magnetic lamination stack and nickel-clad silver conductors, was tested with pyrolytic boron nitride slot insulation. Temperatures were measured in each test to determine characteristics of slot linear heat conductance from statorette conductors. Testing was carried out to temperatures of approximately 1500 F in a vacuum environment of 10-8 torr. Three assemblies were built and tested, each having a different room temperature slot clearance. The final statorette assembly was subjected to a 100-hour vacuum aging test at 1400 F followed by 25 thermal cycles. Temperature data from the three assemblies showed that decreasing slot clearance and increasing compression loading did enhance heat transfer. The temperature difference between slot and lamination at 1400 F increased 4 F during the thermal aging and an additional 10 F during the 25 thermal cycles.
Retention system and method for the blades of a rotary machine
Pedersen, Poul D.; Glynn, Christopher C.; Walker, Roger C.
2002-01-01
A retention system and method for the blades of a rotary machine for preventing forward or aft axial movement of the rotor blades includes a circumferential hub slot formed about a circumference of the machine hub. The rotor blades have machined therein a blade retention slot which is aligned with the circumferential hub slot when the blades are received in correspondingly shaped openings in the hub. At least one ring segment is secured in the blade retention slots and the circumferential hub slot to retain the blades from axial movement. A key assembly is used to secure the ring segments in the aligned slots via a hook portion receiving the ring segments and a threaded portion that is driven radially outwardly by a nut. A cap may be provided to provide a redundant back-up load path for the centrifugal loads on the key. Alternatively, the key assembly may be formed in the blade dovetail.
NASA Technical Reports Server (NTRS)
Everhart, Joel L.; Bobbitt, Percy J.
1994-01-01
The results of detailed parametric experiments are presented for the near-wall flow field of a longitudinally slotted transonic wind tunnel. Existing data are reevaluated and new data obtained in the Langley 6- by 19-inch Transonic Wind Tunnel are presented and analyzed. In the experiments, researchers systematically investigate many pertinent wall-geometry variables such as the wall openness and the number of slots along with the free stream Mach number and model angle of attack. Flow field surveys on the plane passing through the centerline of the slot were conducted and are presented. The effects of viscosity on the slot flow are considered in the analysis. The present experiments, combined with those of previous investigations, give a more complete physical characterization of the flow near and through the slotted wall of a transonic wind tunnel.
Analysis of Tangential Slot Blowing on F/A-18 Isolated Forebody
NASA Technical Reports Server (NTRS)
Gee, Ken; Rizk, Yehia M.; Schiff, Lewis B.
1995-01-01
The generation of significant side forces and yawing moments on an F/A-18 fuselage through tangential slot blowing is analyzed using computational fluid dynamics. The effects of freestream Mach number, jet exit conditions, jet length, and jet location are studied. The effects of over- and underblowing on force and moment production are analyzed. Non-time-accurate solutions are obtained to determine the steady-state side forces, yawing moments, and surface pressure distributions generated by tangential slot blowing. Time-accurate solutions are obtained to study the force onset time lag of tangential slot blowing. Comparison with available experimental data from full-scale wind-tunnel and subscale wind-tunnel tests are made. This computational analysis complements the experimental results and provides a detailed understanding of the effects of tangential slot blowing on the flowfield about the isolated F/A-18 forebody. Additionally, it extends the slot-blowing database to transonic maneuvering Mach numbers.
Voltage scheduling for low power/energy
NASA Astrophysics Data System (ADS)
Manzak, Ali
2001-07-01
Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned to lower voltage levels (thus reducing the power consumption). A polynomial time resource and latency constrained scheduling algorithm is developed to distribute the available slack among the nodes such that power consumption is minimum. The algorithm is iterative and utilizes the slack based on the Lagrange multiplier method.
NASA Astrophysics Data System (ADS)
Meyer, Hanna; Kühnlein, Meike; Appelhans, Tim; Nauss, Thomas
2016-03-01
Machine learning (ML) algorithms have successfully been demonstrated to be valuable tools in satellite-based rainfall retrievals which show the practicability of using ML algorithms when faced with high dimensional and complex data. Moreover, recent developments in parallel computing with ML present new possibilities for training and prediction speed and therefore make their usage in real-time systems feasible. This study compares four ML algorithms - random forests (RF), neural networks (NNET), averaged neural networks (AVNNET) and support vector machines (SVM) - for rainfall area detection and rainfall rate assignment using MSG SEVIRI data over Germany. Satellite-based proxies for cloud top height, cloud top temperature, cloud phase and cloud water path serve as predictor variables. The results indicate an overestimation of rainfall area delineation regardless of the ML algorithm (averaged bias = 1.8) but a high probability of detection ranging from 81% (SVM) to 85% (NNET). On a 24-hour basis, the performance of the rainfall rate assignment yielded R2 values between 0.39 (SVM) and 0.44 (AVNNET). Though the differences in the algorithms' performance were rather small, NNET and AVNNET were identified as the most suitable algorithms. On average, they demonstrated the best performance in rainfall area delineation as well as in rainfall rate assignment. NNET's computational speed is an additional advantage in work with large datasets such as in remote sensing based rainfall retrievals. However, since no single algorithm performed considerably better than the others we conclude that further research in providing suitable predictors for rainfall is of greater necessity than an optimization through the choice of the ML algorithm.
PLA realizations for VLSI state machines
NASA Technical Reports Server (NTRS)
Gopalakrishnan, S.; Whitaker, S.; Maki, G.; Liu, K.
1990-01-01
A major problem associated with state assignment procedures for VLSI controllers is obtaining an assignment that produces minimal or near minimal logic. The key item in Programmable Logic Array (PLA) area minimization is the number of unique product terms required by the design equations. This paper presents a state assignment algorithm for minimizing the number of product terms required to implement a finite state machine using a PLA. Partition algebra with predecessor state information is used to derive a near optimal state assignment. A maximum bound on the number of product terms required can be obtained by inspecting the predecessor state information. The state assignment algorithm presented is much simpler than existing procedures and leads to the same number of product terms or less. An area-efficient PLA structure implemented in a 1.0 micron CMOS process is presented along with a summary of the performance for a controller implemented using this design procedure.
Structural optimisation of cage induction motors using finite element analysis
NASA Astrophysics Data System (ADS)
Palko, S.
The current trend in motor design is to have highly efficient, low noise, low cost, and modular motors with a high power factor. High torque motors are useful in applications like servo motors, lifts, cranes, and rolling mills. This report contains a detailed review of different optimization methods applicable in various design problems. Special attention is given to the performance of different methods, when they are used with finite element analysis (FEA) as an objective function, and accuracy problems arising from the numerical simulations. Also an effective method for designing high starting torque and high efficiency motors is presented. The method described in this work utilizes FEA combined with algorithms for the optimization of the slot geometry. The optimization algorithm modifies the position of the nodal points in the element mesh. The number of independent variables ranges from 14 to 140 in this work.
A survey of the state-of-the-art and focused research in range systems, task 1
NASA Technical Reports Server (NTRS)
Omura, J. K.
1986-01-01
This final report presents the latest research activity in voice compression. We have designed a non-real time simulation system that is implemented around the IBM-PC where the IBM-PC is used as a speech work station for data acquisition and analysis of voice samples. A real-time implementation is also proposed. This real-time Voice Compression Board (VCB) is built around the Texas Instruments TMS-3220. The voice compression algorithm investigated here was described in an earlier report titled, Low Cost Voice Compression for Mobile Digital Radios, by the author. We will assume the reader is familiar with the voice compression algorithm discussed in this report. The VCB compresses speech waveforms at data rates ranging from 4.8 K bps to 16 K bps. This board interfaces to the IBM-PC 8-bit bus, and plugs into a single expansion slot on the mother board.
Characteristics of the Langley 8-foot Transonic Tunnel with Slotted Test Section
NASA Technical Reports Server (NTRS)
Wright, Ray H; Ritchie, Virgil S; Pearson, Albin O
1958-01-01
A large wind tunnel, approximately 8 feet in diameter, has been converted to transonic operation by means of slots in the boundary extending in the direction of flow. The usefulness of such a slotted wind tunnel, already known with respect to the reduction of the subsonic blockage interference and the production of continuously variable supersonic flows, has been augmented by devising a slot shape with which a supersonic test region with excellent flow quality could be produced. Experimental locations of detached shock waves ahead of axially symmetric bodies at low supersonic speeds in the slotted test section agreed satisfactorily with predictions obtained by use of existing approximate methods.
Placement insensitive antenna for RFID, sensing, and/or communication systems
Bernhard, Jennifer T.; Ruyle, Jessica E.
2014-06-10
An antenna includes a ground plane having a slot. The slot may be miniaturized using a meandered slot structure or other appropriate reactive loading method as an end load to one or both ends of the slot. An edge treatment may be included on one or more edges of the ground plane or a closely spaced reflecting plane. The antenna is structured to transmit or receive a signal independently or in response to electromagnetic radiation.
Portable conduit retention apparatus for releasably retaining a conduit therein
Metzger, Richard H.
1998-01-01
Portable conduit retention apparatus for releasably retaining a conduit therein. The apparatus releasably retains the conduit out of the way of nearby personnel and equipment. The apparatus includes a portable support frame defining a slot therein having an open mouth portion in communication with the slot for receiving the conduit through the open mouth portion and into the slot. A retention bar is pivotally connected to the support frame adjacent the mouth portion for releasably retaining the conduit in the slot. The retention bar freely pivots to a first position, so that the mouth portion is unblocked in order that the conduit is received through the mouth portion and into the slot. In addition, the retention bar freely pivots to a second position, so that the mouth portion is blocked in order that the conduit is retained in the slot. The conduit is released from the slot by pivoting the retention bar to the first position to unblock the mouth portion and thereafter manipulating the conduit from the slot and through the mouth portion. The apparatus may further include a mounting member attached to the support frame for mounting the apparatus on a vertical support surface. Another embodiment of the apparatus includes a shoe assembly of predetermined weight removably connected to the support frame for resting the apparatus on a floor in such a manner that the apparatus is substantially stationary on the floor.
Islam, M. T.; Samsuzzaman, M.
2014-01-01
This paper introduces a new configuration of compact, triangular- and diamond-slotted, microstrip-fed, low-profile antenna for C/X band applications on polytetrafluoroethylene glass microfiber reinforced material substrate. The antenna is composed of a rectangular-shaped patch containing eight triangles and two diamond-shaped slots and an elliptical-slotted ground plane. The rectangular-shaped patch is obtained by cutting two diamond slots in the middle of the rectangular patch, six triangular slots on the left and right side of the patch, and two triangular slots on the up and down side of the patch. The slotted radiating patch, the elliptical-slotted ground plane, and the microstrip feed enable the matching bandwidth to be widened. A prototype of the optimized antenna was fabricated on polytetrafluoroethylene glass microfiber reinforced material substrate using LPKF prototyping machine and investigated to validate the proposed design. The simulated results are compared with the measured data, and good agreement is achieved. The proposed antenna offers fractional bandwidths of 13.69% (7.78–8.91 GHz) and 10.35% (9.16–10.19 GHz) where S11 < −10 dB at center frequencies of 8.25 GHz and 9.95 GHz, respectively, and relatively stable gain, good radiation efficiency, and omnidirectional radiation patterns in the matching band. PMID:24987742
49 CFR 236.809 - Signal, slotted mechanical.
Code of Federal Regulations, 2010 CFR
2010-10-01
... 49 Transportation 4 2010-10-01 2010-10-01 false Signal, slotted mechanical. 236.809 Section 236.809 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD... § 236.809 Signal, slotted mechanical. A mechanically operated signal with an electromagnetic device...
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
Kumagami, Takashi
2014-01-01
In Japan, there are one to two million people suspected of being pathological gamblers according to the definition in DSM-IV-TR. Almost all of them use "pachinko" or "slot," which are gambling stores, throughout Japan, that number 12,000 in total. However, the characteristics and ratio of pathological "pachinko" and "slot" gamblers have not been investigated. The author aimed to determine the characteristics, ratio, and social support available for these users. The author administered an internet survey for users of "pachinko" or "slot." Two hundred and fifty users visited "pachinko" or "slot" stores more than twice a week, and 250 users visited once a week or once a month. The Japanese version of the South Oaks Gambling Screen was administered, and gamblers were asked about their awareness of pathological gambling and the condition of their social support. The author observed that 70.2% of "pachinko" or "slot" users were suspected pathological gamblers and 28.6% of "pachinko" or "slot" users were severe gamblers. A total of 39.3% of them were aware of their pathological gambling, and 6.5% of users who had awareness of pathological gambling had social support. However, most of their social support consisted of family and friends, and almost none of them attended psychiatric clinics, community health centers, or self-help groups like gamblers anonymous. Almost all "pachinko" or "slot" users were suspected of being pathological or severe gamblers. However, they did not approach psychiatric facilities or self-help groups. The author strongly recommends the need for educational programs in junior or high school to prevent future pathological gambling, and create awareness of the dangers of pathological gambling through TV commercials and "pachinko" or "slot" stores. Pathological gambling is a disease that afflicts many people; hence, psychiatric and social welfare professionals should continue to stress the dangers of and offer prevention programs for "pachinko" or "slot" gambling.
Duan, Litian; Wang, Zizhong John; Duan, Fu
2016-11-16
In the multiple-reader environment (MRE) of radio frequency identification (RFID) system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS) is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression) quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range.
Duan, Litian; Wang, Zizhong John; Duan, Fu
2016-01-01
In the multiple-reader environment (MRE) of radio frequency identification (RFID) system, multiple readers are often scheduled to interrogate the randomized tags via operating at different time slots or frequency channels to decrease the signal interferences. Based on this, a Geometric Distribution-based Multiple-reader Scheduling Optimization Algorithm using Artificial Immune System (GD-MRSOA-AIS) is proposed to fairly and optimally schedule the readers operating from the viewpoint of resource allocations. GD-MRSOA-AIS is composed of two parts, where a geometric distribution function combined with the fairness consideration is first introduced to generate the feasible scheduling schemes for reader operation. After that, artificial immune system (including immune clone, immune mutation and immune suppression) quickly optimize these feasible ones as the optimal scheduling scheme to ensure that readers are fairly operating with larger effective interrogation range and lower interferences. Compared with the state-of-the-art algorithm, the simulation results indicate that GD-MRSOA-AIS could efficiently schedules the multiple readers operating with a fairer resource allocation scheme, performing in larger effective interrogation range. PMID:27854342
Joint optimization of green vehicle scheduling and routing problem with time-varying speeds
Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo
2018-01-01
Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370
Joint optimization of green vehicle scheduling and routing problem with time-varying speeds.
Zhang, Dezhi; Wang, Xin; Li, Shuangyan; Ni, Nan; Zhang, Zhuo
2018-01-01
Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions.
Single-machine common/slack due window assignment problems with linear decreasing processing times
NASA Astrophysics Data System (ADS)
Zhang, Xingong; Lin, Win-Chin; Wu, Wen-Hsiang; Wu, Chin-Chia
2017-08-01
This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O(n log n) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.
The West Midlands breast cancer screening status algorithm - methodology and use as an audit tool.
Lawrence, Gill; Kearins, Olive; O'Sullivan, Emma; Tappenden, Nancy; Wallis, Matthew; Walton, Jackie
2005-01-01
To illustrate the ability of the West Midlands breast screening status algorithm to assign a screening status to women with malignant breast cancer, and its uses as a quality assurance and audit tool. Breast cancers diagnosed between the introduction of the National Health Service [NHS] Breast Screening Programme and 31 March 2001 were obtained from the West Midlands Cancer Intelligence Unit (WMCIU). Screen-detected tumours were identified via breast screening units, and the remaining cancers were assigned to one of eight screening status categories. Multiple primaries and recurrences were excluded. A screening status was assigned to 14,680 women (96% of the cohort examined), 110 cancers were not registered at the WMCIU and the cohort included 120 screen-detected recurrences. The West Midlands breast screening status algorithm is a robust simple tool which can be used to derive data to evaluate the efficacy and impact of the NHS Breast Screening Programme.
A multifunctional solar panel antenna for cube satellites
NASA Astrophysics Data System (ADS)
Fawole, Olutosin C.
The basic cube satellite (CubeSat) is a modern small satellite that has a standard size of about one liter (the 1U CubeSat). Three 1U CubeSats could be stacked to form a 3U CubeSat. Their low-cost, short development time, and ease of deployment make CubeSats popular for space research, geographical information gathering, and communication applications. An antenna is a key part of the CubeSat communication subsystem. Traditionally, antennas used on CubeSats are wrapped-up wire dipole antennas, which are deployed after satellite launch. Another antenna type used on CubeSats is the patch antenna. In addition to their low gain and efficiency, deployable dipole antennas may also fail to deploy on satellite launch. On the other hand, a solid patch antenna will compete for space with solar cells when placed on a CubeSat face, interfering with satellite power generation. Slot antennas are promising alternatives to dipole and patch antennas on CubeSats. When excited, a thin slot aperture etched on a conductive sheet (ground plane) is an efficient bidirectional radiator. This open slot antenna can be backed by a reflector or cavity for unidirectional radiation, and solar cells can be placed in spaces on the ground plane not occupied by the slot. The large surface areas of 3U CubeSats can be exploited for a multifunctional antenna by integrating multiple thin slot radiators, which are backed by a thin cavity on the CubeSat surfaces. Solar cells can then be integrated on the antenna surface. Polarization diversity and frequency diversity improve the overall performance of a communication system. Having a single radiating structure that could provide these diversities is desired. It has been demonstrated that when a probe excites a square cavity with two unequal length crossed-slots, the differential radiation from the two slots combines in the far-field to yield circular polarization. In addition, it has been shown that two equal-length proximal slots, when both fed with a stripline, resonate at a frequency due to their original lengths, and also resonate at a lower frequency due to mutual coupling between the slots, leading to a dual-band operation. The multifunctional antenna designs presented are harmonizations and extensions of these two independent works. In the multifunctional antenna designs presented, multiple slots were etched on a 83 mm x 340 mm two-layer shallow cavity. The slots were laid out on the cavity such when the cavity was excited by a probe at a particular point, the differential radiation from the slots would combine in the far-field to yield Left-Handed Circular Polarization (LHCP). Furthermore, when the cavity was excited by another probe at an opposite point, the slots would produce Right-Handed Circular Polarization (RHCP). In addition, as forethought, these slots were laid out on the cavity such that some slots were close together enough to give Linearly Polarized (LP) dual-band operation when fed with a stripline. This antenna was designed and optimized via computer simulations, fabricated using Printed Circuit Board (PCB) technology, and characterized using a Vector Network Analyzer (VNA) and NSI Far Field Systems.
NASA Astrophysics Data System (ADS)
Yadav, Dharmendra Singh; Babu, Sarath; Manoj, B. S.
2018-03-01
Spectrum conflict during primary and backup routes assignment in elastic optical networks results in increased resource consumption as well as high Bandwidth Blocking Probability. In order to avoid such conflicts, we propose a new scheme, Quasi Path Restoration (QPR), where we divide the available spectrum into two: (1) primary spectrum (for primary routes allocation) and (2) backup spectrum (for rerouting the data on link failures). QPR exhibits three advantages over existing survivable strategies such as Shared Path Protection (SPP), Primary First Fit Backup Last Fit (PFFBLF), Jointly Releasing and re-establishment Defragmentation SPP (JRDSSPP), and Path Restoration (PR): (1) the conflict between primary and backup spectrum during route assignment is completely eliminated, (2) upon a link failure, connection recovery requires less backup resources compared to SPP, PFFBLF, and PR, and (3) availability of the same backup spectrum on each link improves the recovery guarantee. The performance of our scheme is analyzed with different primary backup spectrum partitions on varying connection-request demands and number of frequency slots. Our results show that QPR provides better connection recovery guarantee and Backup Resources Utilization (BRU) compared to bandwidth recovery of PR strategy. In addition, we compare QPR with Shared Path Protection and Primary First-Fit Backup Last Fit strategies in terms of Bandwidth Blocking Probability (BBP) and average frequency slots per connection request. Simulation results show that BBP of SPP, PFFBLF, and JRDSPP varies between 18.59% and 14.42%, while in QPR, BBP ranges from 2.55% to 17.76% for Cost239, NSFNET, and ARPANET topologies. Also, QPR provides bandwidth recovery between 93.61% and 100%, while in PR, the recovery ranges from 86.81% to 98.99%. It is evident from our analysis that QPR provides a reasonable trade-off between bandwidth blocking probability and connection recoverability.
Distributed Topology Organization and Transmission Scheduling in Wireless Ad Hoc Networks
2004-01-01
slot consists of two mini -slots that support that support full-duplex transfer–one for master-to-slave transmission and the other from slave-to-master...protocol storage requirement would only be 208 bits in this case. 111 Communication requirements Each half-duplex mini -slot can be used by either a data or...either a data or control packet, eq. (4.2) sets the minimum half-duplex mini -slot size in the system or equivalently, the maximum system period
Resonant-tunnelling diode oscillator using a slot-coupled quasioptical open resonator
NASA Technical Reports Server (NTRS)
Stephan, K. D.; Brown, E. R.; Parker, C. D.; Goodhue, W. D.; Chen, C. L.
1991-01-01
A resonant-tunneling diode has oscillated at X-band frequencies in a microwave circuit consisting of a slot antenna coupled to a semiconfocal open resonator. Coupling between the open resonator and the slot oscillator improves the noise-to-carrier ratio by about 36 dB relative to that of the slot oscillator alone in the 100-200 kHz range. A circuit operating near 10 GHz has been designed as a scale model for millimeter- and submillimeter-wave applications.
Cutburth, Ronald W.; Smauley, David A.
1987-01-01
A clamp or dog is disclosed which preferably comprises a slotted stepped cylindrical body which is inserted into a hole in a workpiece and then fastened to a base or fixture using a screw which is inserted through the slot. The stepped configuration provides an annular clamping surface which securely clamps the workpiece against the base or fixture. The slotted cylindrical configuration permits adjustment of the workpiece and retaining clamp in any direction, i.e., over 360.degree., relative to the mounting position of the screw in the base or fixture.
DNABIT Compress – Genome compression algorithm
Rajarajeswari, Pothuraju; Apparao, Allam
2011-01-01
Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, “DNABIT Compress” for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that “DNABIT Compress” algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases. PMID:21383923
NASA Astrophysics Data System (ADS)
Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun
2017-07-01
Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.
Slot angle detecting method for fiber fixed chip
NASA Astrophysics Data System (ADS)
Zhang, Jiaquan; Wang, Jiliang; Zhou, Chaochao
2018-04-01
The slot angle of fiber fixed chip has a significant impact on performance of photoelectric devices. In order to solve the actual engineering problem, this paper put forward a detecting method based on imaging processing. Because the images have very low contrast that is hardly segmented, so this paper proposes imaging segment methods based on edge character. Then get fixed chip edge line slope k2 and calculate the fiber fixed slot line slope k1, which can be used calculating the slot angle. Lastly, test the repeatability and accuracy of system, which show that this method has very fast operation speed and good robustness. Clearly, it is also satisfied to the actual demand of fiber fixed chip slot angle detection.
Low-speed aerodynamic test of an axisymmetric supersonic inlet with variable cowl slot
NASA Technical Reports Server (NTRS)
Powell, A. G.; Welge, H. R.; Trefny, C. J.
1985-01-01
The experimental low-speed aerodynamic characteristics of an axisymmetric mixed-compression supersonic inlet with variable cowl slot are described. The model consisted of the NASA P-inlet centerbody and redesigned cowl with variable cowl slot powered by the JT8D single-stage fan simulator and driven by an air turbine. The model was tested in the NASA Lewis Research Center 9- by 15-foot low-speed tunnel at Mach numbers of 0, 0.1, and 0.2 over a range of flows, cowl slot openings, centerbody positions, and angles of attack. The variable cowl slot was effective in minimizing lip separation at high velocity ratios, showed good steady-state and dynamic distortion characteristics, and had good angle-of-attack tolerance.
NASA Astrophysics Data System (ADS)
Marčič, T.; Štumberger, B.; Štumberger, G.; Hadžiselimović, M.; Zagradišnik, I.
The electromechanical characteristics of induction motors depend on the used stator and rotor slot combination. The correlation between the usage of different stator and rotor slot number combinations, magnetic flux density distributions, no-load iron losses and rated load winding over-temperatures for a specific induction motor is presented. The motor's magnetic field was analyzed by traces of the magnetic flux density vector, obtained by FEM. Post-processing of FE magnetic field solution was used for posterior iron loss calculation of the motor iron loss at no-load. The examined motor stator lamination had 36 semi-closed slots and the rotor laminations had 28, 33, 34, 44 and 46 semi-closed slots.
NASA Technical Reports Server (NTRS)
Everhart, Joel Lee
1988-01-01
A theoretical examination of the slotted-wall flow field is conducted to determine the appropriate wall pressure drop (or boundary condition) equation. This analysis improves the understanding of the fluid physics of these types of flow fields and helps in evaluating the uncertainties and limitations existing in previous mathematical developments. It is shown that the resulting slotted-wall boundary condition contains contributions from the airfoil-induced streamline curvature and the non-linear, quadratic, slot crossflow in addition to an often neglected linear term which results from viscous shearing in the slot. Existing and newly acquired experimental data are examined in the light of this formulation and theoretical developments.
49 CFR 236.809 - Signal, slotted mechanical.
Code of Federal Regulations, 2011 CFR
2011-10-01
... 49 Transportation 4 2011-10-01 2011-10-01 false Signal, slotted mechanical. 236.809 Section 236..., INSPECTION, MAINTENANCE, AND REPAIR OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.809 Signal, slotted mechanical. A mechanically operated signal with an electromagnetic device...
Manipulating Slot Machine Preference in Problem Gamblers through Contextual Control
ERIC Educational Resources Information Center
Nastally, Becky L.; Dixon, Mark R.; Jackson, James W.
2010-01-01
Pathological and nonpathological gamblers completed a task that assessed preference among 2 concurrently available slot machines. Subsequent assessments of choice were conducted after various attempts to transfer contextual functions associated with irrelevant characteristics of the slot machines. Results indicated that the nonproblem gambling…
49 CFR 236.809 - Signal, slotted mechanical.
Code of Federal Regulations, 2012 CFR
2012-10-01
... 49 Transportation 4 2012-10-01 2012-10-01 false Signal, slotted mechanical. 236.809 Section 236..., INSPECTION, MAINTENANCE, AND REPAIR OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.809 Signal, slotted mechanical. A mechanically operated signal with an electromagnetic device...
49 CFR 236.809 - Signal, slotted mechanical.
Code of Federal Regulations, 2013 CFR
2013-10-01
... 49 Transportation 4 2013-10-01 2013-10-01 false Signal, slotted mechanical. 236.809 Section 236..., INSPECTION, MAINTENANCE, AND REPAIR OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.809 Signal, slotted mechanical. A mechanically operated signal with an electromagnetic device...
49 CFR 236.809 - Signal, slotted mechanical.
Code of Federal Regulations, 2014 CFR
2014-10-01
... 49 Transportation 4 2014-10-01 2014-10-01 false Signal, slotted mechanical. 236.809 Section 236..., INSPECTION, MAINTENANCE, AND REPAIR OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.809 Signal, slotted mechanical. A mechanically operated signal with an electromagnetic device...
NASA Technical Reports Server (NTRS)
Alexander, Michael G.; Anders, Scott G.; Johnson, Stuart K.; Florance, Jennifer P.; Keller, Donald F.
2005-01-01
A wind tunnel test was conducted in the NASA Langley Transonic Dynamics Tunnel (TDT) on a six percent thick slightly cambered elliptical circulation control airfoil with both upper and lower surface blowing capability. Parametric evaluations of jet slot heights and Coanda surface shapes were conducted at momentum coefficients (Cm) from 0.0 to 0.12. Test data were acquired at Mach numbers of 0.3, 0.5, 0.7, 0.8, and 0.84 at Reynolds numbers per foot of 2.43 x 105 to 1.05 x 106. For a transonic condition, (Mach = 0.8 at alpha = 3 degrees), it was generally found the smaller slot and larger Coanda surface combination was overall more effective than other slot/Coanda surface combinations. Lower surface blowing was not as effective as the upper surface blowing over the same range of momentum coefficients. No appreciable Coanda surface, slot height, or slot blowing position preference was indicated transonically with the dual slot blowing.
An improved broadband E patch microstrip antenna for wireless communications
NASA Astrophysics Data System (ADS)
Bzeih, Amer; Chahine, Soubhi Abou; Kabalan, Karim Y.; El-Hajj, Ali; Chehab, Ali
2007-12-01
A broadband probe-fed microstrip antenna with E-shaped patch on a single-layer air substrate is investigated. Bandwidth enhancement of the antenna is achieved by inserting two parallel slots into its radiating patch. The effects of the antenna parameters are analyzed, and their optimal values for broadband operation are obtained. The design parameters are formulated as a function of the center frequency, and the empirical equations are validated by simulation. A 51.5% enhanced E patch antenna for modern wireless communications (Personal Communications Service, Digital Cellular System, Universal Mobile Telecommunications System, Wireless Local Area Network 802.11 b/g, and Bluetooth) is designed, simulated, fabricated, and measured. A comparison between simulated and measured results is presented, and it showed satisfactory agreement. Moreover, the effect of incorporating more parallel slots into the radiating patch is investigated. The antenna is designed and simulated for different scenarios (four slots, six slots, and eight slots), where a bandwidth of 57% is achieved in the eight-slot design.
NASA Technical Reports Server (NTRS)
Harris, Thomas A
1939-01-01
An investigation has been made in the N.A.C.A. 7- by 10-foot wind tunnel of a large-chord N.A.C.A. 23012 airfoil with several arrangements of a 40-percent-chord slotted flap to determine the section aerodynamic characteristics of the airfoil as affected by slot shape, flap location, and flap deflection. The flap positions for maximum lift, the polar for arrangements considered favorable for take-off and climb, and the complete section aerodynamic characteristics for selected optimum arrangements were determined. A discussion is given of the relative merits of the various arrangements. A comparison is made of slotted flaps of different chords on the N.A.C.A. 23012 airfoil. The best 40-percent-chord slotted flap is only slightly superior to the 25-percent-chord slotted flap from considerations of maximum lift coefficient and low drag for take-off and initial climb.
Pole-phase modulated toroidal winding for an induction machine
Miller, John Michael; Ostovic, Vlado
1999-11-02
A stator (10) for an induction machine for a vehicle has a cylindrical core (12) with inner and outer slots (26, 28) extending longitudinally along the inner and outer peripheries between the end faces (22, 24). Each outer slot is associated with several adjacent inner slots. A plurality of toroidal coils (14) are wound about the core and laid in the inner and outer slots. Each coil occupies a single inner slot and is laid in the associated outer slot thereby minimizing the distance the coil extends from the end faces and minimizing the length of the induction machine. The toroidal coils are configured for an arbitrary pole phase modulation wherein the coils are configured with variable numbers of phases and poles for providing maximum torque for cranking and switchable to a another phase and pole configuration for alternator operation. An adaptor ring (36) circumferentially positioned about the stator improves mechanical strength, and provides a coolant channel manifold (34) for removing heat produced in stator windings during operation.
Algorithms for selecting informative marker panels for population assignment.
Rosenberg, Noah A
2005-11-01
Given a set of potential source populations, genotypes of an individual of unknown origin at a collection of markers can be used to predict the correct source population of the individual. For improved efficiency, informative markers can be chosen from a larger set of markers to maximize the accuracy of this prediction. However, selecting the loci that are individually most informative does not necessarily produce the optimal panel. Here, using genotypes from eight species--carp, cat, chicken, dog, fly, grayling, human, and maize--this univariate accumulation procedure is compared to new multivariate "greedy" and "maximin" algorithms for choosing marker panels. The procedures generally suggest similar panels, although the greedy method often recommends inclusion of loci that are not chosen by the other algorithms. In seven of the eight species, when applied to five or more markers, all methods achieve at least 94% assignment accuracy on simulated individuals, with one species--dog--producing this level of accuracy with only three markers, and the eighth species--human--requiring approximately 13-16 markers. The new algorithms produce substantial improvements over use of randomly selected markers; where differences among the methods are noticeable, the greedy algorithm leads to slightly higher probabilities of correct assignment. Although none of the approaches necessarily chooses the panel with optimal performance, the algorithms all likely select panels with performance near enough to the maximum that they all are suitable for practical use.
Investigation of a slot nanoantenna in optical frequency range
NASA Astrophysics Data System (ADS)
Dinesh kumar, V.; Asakawa, Kiyoshi
2009-11-01
Following the analogy of radio frequency slot antenna and its complementary dipole, we propose the implementation of a slot nanoantenna (SNA) in the optical frequency range. Using finite-difference time-domain (FDTD) method, we investigate the electromagnetic (EM) properties of a SNA formed in a thin gold film and compare the results with the properties of a gold dipole nanoantenna (DNA) of the same dimension as the slot. It is found that the response of the SNA is very similar to the DNA, like their counterparts in the radio frequency (RF) range. The SNA can enhance the near field intensity of incident field which strongly depends on its feedgap dimension. The resonance of the SNA is influenced by its slot length; for the increasing slot length, resonant frequency decreases whereas the sharpness of resonance increases. Besides, the resonance of the SNA is found sensitive to the thickness of metal film, when the latter is smaller than the skin depth. The effect of polarization of incident field on the EM response of the SNA was examined; the field enhancement is optimum when polarization is parallel to the feedgap. Finally, we calculate the radiation patterns of the DNA and SNA and compare them with those of the RF dipole antenna. The radiation pattern of the SNA is found to be independent of its slot length when excited at resonant frequency. To the best of our knowledge, this is the first study on a slot antenna in the optical frequency.
Portable conduit retention apparatus for releasably retaining a conduit therein
Metzger, R.H.
1998-07-07
Portable conduit retention apparatus is described for releasably retaining a conduit therein. The apparatus releasably retains the conduit out of the way of nearby personnel and equipment. The apparatus includes a portable support frame defining a slot therein having an open mouth portion in communication with the slot for receiving the conduit through the open mouth portion and into the slot. A retention bar is pivotally connected to the support frame adjacent the mouth portion for releasably retaining the conduit in the slot. The retention bar freely pivots to a first position, so that the mouth portion is unblocked in order that the conduit is received through the mouth portion and into the slot. In addition, the retention bar freely pivots to a second position, so that the mouth portion is blocked in order that the conduit is retained in the slot. The conduit is released from the slot by pivoting the retention bar to the first position to unblock the mouth portion and thereafter manipulating the conduit from the slot and through the mouth portion. The apparatus may further include a mounting member attached to the support frame for mounting the apparatus on a vertical support surface. Another embodiment of the apparatus includes a shoe assembly of predetermined weight removably connected to the support frame for resting the apparatus on a floor in such a manner that the apparatus is substantially stationary on the floor. 6 figs.
100-GHz Phase Switch/Mixer Containing a Slot-Line Transition
NASA Technical Reports Server (NTRS)
Gaier, Todd; Wells, Mary; Dawson, Douglas
2009-01-01
A circuit that can function as a phase switch, frequency mixer, or frequency multiplier operates over a broad frequency range in the vicinity of 100 GHz. Among the most notable features of this circuit is a grounded uniplanar transition (in effect, a balun) between a slot line and one of two coplanar waveguides (CPWs). The design of this circuit is well suited to integration of the circuit into a microwave monolithic integrated circuit (MMIC) package. One CPW is located at the input end and one at the output end of the top side of a substrate on which the circuit is fabricated (see Figure 1). The input CPW feeds the input signal to antiparallel flip-chip Schottky diodes connected to the edges of the slot line. Phase switching is effected by the combination of (1) the abrupt transition from the input CPW to the slot line and (2) CPW ground tuning effected by switching of the bias on the diodes. Grounding of the slot metal to the bottom metal gives rise to a frequency cutoff in the slot. This cutoff is valuable for separating different frequency components when the circuit is used as a mixer or multiplier. Proceeding along the slot line toward the output end, one encounters the aforementioned transition, which couples the slot line to the output CPW. Impedance tuning of the transition is accomplished by use of a high-impedance section immediately before the transition.
Metal membrane with dimer slots as a universal polarizer
NASA Astrophysics Data System (ADS)
Zhukovsky, Sergej; Zalkovskij, Maksim; Malureanu, Radu; Kremers, Christian; Chigrin, Dmitry; Tang, Peter T.; Jepsen, Peter U.; Lavrinenko, Andrei V.
2014-03-01
In this work, we show theoretically and confirm experimentally that thin metal membranes patterned with an array of slot dimers (or their Babinet analogue with metal rods) can function as a versatile spectral and polarization filter. We present a detailed covariant multipole theory for the electromagnetic response of an arbitrary dimer based on the Green functions approach. The theory confirms that a great variety of polarization properties, such as birefringence, chirality and elliptical dichroism, can be achieved in a metal layer with such slot-dimer patterning (i.e. in a metasurface). Optical properties of the metasurface can be extensively tuned by varying the geometry (shape and dimensions) of the dimer, for example, by adjusting the sizes and mutual placement of the slots (e.g. inter-slot distance and alignment angle). Three basic shapes of dimers are analyzed: II-shaped (parallel slots), V-shaped, and T-shaped. These particular shapes of dimers are found to be sensitive to variations of the slots lengths and orientation of elements. Theoretical results are well supported by full-wave three-dimensional simulations. Our findings were verified experimentally on the metal membranes fabricated using UV lithography with subsequent Ni growth. Such metasurfaces were characterized using time-domain THz spectroscopy. The samples exhibit pronounced optical activity (500 degrees per wavelength) and high transmission: even though the slots cover only 4.3 % of the total membrane area the amplitude transmission reaches 0.67 at the resonance frequency 0.56 THz.
An efficient randomized algorithm for contact-based NMR backbone resonance assignment.
Kamisetty, Hetunandan; Bailey-Kellogg, Chris; Pandurangan, Gopal
2006-01-15
Backbone resonance assignment is a critical bottleneck in studies of protein structure, dynamics and interactions by nuclear magnetic resonance (NMR) spectroscopy. A minimalist approach to assignment, which we call 'contact-based', seeks to dramatically reduce experimental time and expense by replacing the standard suite of through-bond experiments with the through-space (nuclear Overhauser enhancement spectroscopy, NOESY) experiment. In the contact-based approach, spectral data are represented in a graph with vertices for putative residues (of unknown relation to the primary sequence) and edges for hypothesized NOESY interactions, such that observed spectral peaks could be explained if the residues were 'close enough'. Due to experimental ambiguity, several incorrect edges can be hypothesized for each spectral peak. An assignment is derived by identifying consistent patterns of edges (e.g. for alpha-helices and beta-sheets) within a graph and by mapping the vertices to the primary sequence. The key algorithmic challenge is to be able to uncover these patterns even when they are obscured by significant noise. This paper develops, analyzes and applies a novel algorithm for the identification of polytopes representing consistent patterns of edges in a corrupted NOESY graph. Our randomized algorithm aggregates simplices into polytopes and fixes inconsistencies with simple local modifications, called rotations, that maintain most of the structure already uncovered. In characterizing the effects of experimental noise, we employ an NMR-specific random graph model in proving that our algorithm gives optimal performance in expected polynomial time, even when the input graph is significantly corrupted. We confirm this analysis in simulation studies with graphs corrupted by up to 500% noise. Finally, we demonstrate the practical application of the algorithm on several experimental beta-sheet datasets. Our approach is able to eliminate a large majority of noise edges and to uncover large consistent sets of interactions. Our algorithm has been implemented in the platform-independent Python code. The software can be freely obtained for academic use by request from the authors.
Lee, Chankyun; Cao, Xiaoyuan; Yoshikane, Noboru; Tsuritani, Takehiro; Rhee, June-Koo Kevin
2015-10-19
The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study.
Normalized Cut Algorithm for Automated Assignment of Protein Domains
NASA Technical Reports Server (NTRS)
Samanta, M. P.; Liang, S.; Zha, H.; Biegel, Bryan A. (Technical Monitor)
2002-01-01
We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.
Algorithmic Case Pedagogy, Learning and Gender
ERIC Educational Resources Information Center
Bromley, Robert; Huang, Zhenyu
2015-01-01
Great investment has been made in developing algorithmically-based cases within online homework management systems. This has been done because publishers are convinced that textbook adoption decisions are influenced by the incorporation of these systems within their products. These algorithmic assignments are thought to promote learning while…
On marker-based parentage verification via non-linear optimization.
Boerner, Vinzent
2017-06-15
Parentage verification by molecular markers is mainly based on short tandem repeat markers. Single nucleotide polymorphisms (SNPs) as bi-allelic markers have become the markers of choice for genotyping projects. Thus, the subsequent step is to use SNP genotypes for parentage verification as well. Recent developments of algorithms such as evaluating opposing homozygous SNP genotypes have drawbacks, for example the inability of rejecting all animals of a sample of potential parents. This paper describes an algorithm for parentage verification by constrained regression which overcomes the latter limitation and proves to be very fast and accurate even when the number of SNPs is as low as 50. The algorithm was tested on a sample of 14,816 animals with 50, 100 and 500 SNP genotypes randomly selected from 40k genotypes. The samples of putative parents of these animals contained either five random animals, or four random animals and the true sire. Parentage assignment was performed by ranking of regression coefficients, or by setting a minimum threshold for regression coefficients. The assignment quality was evaluated by the power of assignment (P[Formula: see text]) and the power of exclusion (P[Formula: see text]). If the sample of putative parents contained the true sire and parentage was assigned by coefficient ranking, P[Formula: see text] and P[Formula: see text] were both higher than 0.99 for the 500 and 100 SNP genotypes, and higher than 0.98 for the 50 SNP genotypes. When parentage was assigned by a coefficient threshold, P[Formula: see text] was higher than 0.99 regardless of the number of SNPs, but P[Formula: see text] decreased from 0.99 (500 SNPs) to 0.97 (100 SNPs) and 0.92 (50 SNPs). If the sample of putative parents did not contain the true sire and parentage was rejected using a coefficient threshold, the algorithm achieved a P[Formula: see text] of 1 (500 SNPs), 0.99 (100 SNPs) and 0.97 (50 SNPs). The algorithm described here is easy to implement, fast and accurate, and is able to assign parentage using genomic marker data with a size as low as 50 SNPs.
Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network.
Choi, Sangil; Park, Jong Hyuk
2016-12-02
Wireless mesh networks (WMNs) have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA) algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM). In addition, MICA achieves much lower throughput variation among the destination nodes than MCM.
Lakbub, Jude C; Su, Xiaomeng; Zhu, Zhikai; Patabandige, Milani W; Hua, David; Go, Eden P; Desaire, Heather
2017-08-04
The glycopeptide analysis field is tightly constrained by a lack of effective tools that translate mass spectrometry data into meaningful chemical information, and perhaps the most challenging aspect of building effective glycopeptide analysis software is designing an accurate scoring algorithm for MS/MS data. We provide the glycoproteomics community with two tools to address this challenge. The first tool, a curated set of 100 expert-assigned CID spectra of glycopeptides, contains a diverse set of spectra from a variety of glycan types; the second tool, Glycopeptide Decoy Generator, is a new software application that generates glycopeptide decoys de novo. We developed these tools so that emerging methods of assigning glycopeptides' CID spectra could be rigorously tested. Software developers or those interested in developing skills in expert (manual) analysis can use these tools to facilitate their work. We demonstrate the tools' utility in assessing the quality of one particular glycopeptide software package, GlycoPep Grader, which assigns glycopeptides to CID spectra. We first acquired the set of 100 expert assigned CID spectra; then, we used the Decoy Generator (described herein) to generate 20 decoys per target glycopeptide. The assigned spectra and decoys were used to test the accuracy of GlycoPep Grader's scoring algorithm; new strengths and weaknesses were identified in the algorithm using this approach. Both newly developed tools are freely available. The software can be downloaded at http://glycopro.chem.ku.edu/GPJ.jar.
Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network
Choi, Sangil; Park, Jong Hyuk
2016-01-01
Wireless mesh networks (WMNs) have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA) algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM). In addition, MICA achieves much lower throughput variation among the destination nodes than MCM. PMID:27918438
76 FR 69764 - Stab-Resistant Body Armor Standard Workshop
Federal Register 2010, 2011, 2012, 2013, 2014
2011-11-09
... standard. Time slots for individual breakout sessions may be requested from the registration page indicated below. Additional time slots will be made available if needed to accommodate attendee requests. Workshop... will be allowed to register for the general session. Individual time slots will be available on the...
77 FR 5293 - Petition for Exemption; Summary of Petition Received
Federal Register 2010, 2011, 2012, 2013, 2014
2012-02-02
.... Petitioner: Sun Country Airlines. Section of 14 CFR Affected: 14 CFR 93.123(a). Description of Relief Sought: Sun Country Airlines requests an exemption from the slot limit for Ronald Reagan Washington National... limited hours for Sun Country's use. The proposed air carrier slots would replace two slot exemptions...
UAVs Task and Motion Planning in the Presence of Obstacles and Prioritized Targets
Gottlieb, Yoav; Shima, Tal
2015-01-01
The intertwined task assignment and motion planning problem of assigning a team of fixed-winged unmanned aerial vehicles to a set of prioritized targets in an environment with obstacles is addressed. It is assumed that the targets’ locations and initial priorities are determined using a network of unattended ground sensors used to detect potential threats at restricted zones. The targets are characterized by a time-varying level of importance, and timing constraints must be fulfilled before a vehicle is allowed to visit a specific target. It is assumed that the vehicles are carrying body-fixed sensors and, thus, are required to approach a designated target while flying straight and level. The fixed-winged aerial vehicles are modeled as Dubins vehicles, i.e., having a constant speed and a minimum turning radius constraint. The investigated integrated problem of task assignment and motion planning is posed in the form of a decision tree, and two search algorithms are proposed: an exhaustive algorithm that improves over run time and provides the minimum cost solution, encoded in the tree, and a greedy algorithm that provides a quick feasible solution. To satisfy the target’s visitation timing constraint, a path elongation motion planning algorithm amidst obstacles is provided. Using simulations, the performance of the algorithms is compared, evaluated and exemplified. PMID:26610522
NASA Technical Reports Server (NTRS)
Vassberg, John C. (Inventor); Gea, Lie-Mine (Inventor); McLean, James D. (Inventor); Witowski, David P. (Inventor); Krist, Steven E. (Inventor); Campbell, Richard L. (Inventor)
2006-01-01
An aircraft wing includes a leading airfoil element and a trailing airfoil element. At least one slot is defined by the wing during at least one transonic condition of the wing. The slot may either extend spanwise along only a portion of the wingspan, or it may extend spanwise along the entire wingspan. In either case, the slot allows a portion of the air flowing along the lower surface of the leading airfoil element to split and flow over the upper surface of the trailing airfoil element so as to achieve a performance improvement in the transonic condition.
Analysis of advanced solid rocket motor ignition phenomena
NASA Technical Reports Server (NTRS)
Foster, Winfred A., Jr.; Jenkins, Rhonald M.
1995-01-01
This report presents the results obtained from an experimental analysis of the flow field in the slots of the star grain section in the head-end of the advanced solid rocket motor during the ignition transient. This work represents an extension of the previous tests and analysis to include the effects of using a center port in conjunction with multiple canted igniter ports. The flow field measurements include oil smear data on the star slot walls, pressure and heat transfer coefficient measurements on the star slot walls and velocity measurements in the star slot.
Spring loaded compliant seal for high temperature use
Memmen, Robert L; Fedock, John A; Downs, James P
2013-10-15
A flexible seal having an X-shaped cross section that forms four contact points on four contact surfaces of two opposed seal slots. The flexible seal is used for a component in which the two seal slots undergo a large deflection such that the opposed slots are not aligned and a rigid seal will not form an adequate seal. The flexible seal can be used in a component of a combustor or a turbine in a gas turbine engine where opposed seal slots undergo the large deflection during operation.
Kerley, P.L.
1959-01-01
A small-size antenna having a doughnut-shaped field pattern and which can act both as an antenna and a resonant circuit is described. The antenna is of the slotted type and comprises a resonant cavity with a center hole. A circular slot is provided in one wall of the cavity concentric with the hole and a radio frequency source is connected across the slot. The pattern and loading of the antenna are adjusted by varying the position and shape of a center element slidably disposed within the hole and projecting from the slotted side of the resonant cavity. The disclosed structure may also be used to propagate the oscillator signal down a transniission line by replacing the center element with one leg of the transmission line in a spaced relation from the walls of the cavity.
Implementation of rectangular slit-inserted ultra-wideband tapered slot antenna.
Kim, Sun-Woong; Choi, Dong-You
2016-01-01
In this paper, a tapered slot antenna capable of ultra-wideband communication was designed. In the proposed antenna, rectangular slits were inserted to enhance the bandwidth and reduce the area of the antenna. The rectangular slit-inserted tapered slot antenna operated at a bandwidth of 8.45 GHz, and the bandwidth improved upon the basic tapered slot antenna by 4.72 GHz. The radiation pattern of the antenna was suitable for location recognition in a certain direction owing to an appropriate 3 dB beam width. The antenna gain was analyzed within the proposed bandwidth, and the highest gain characteristic at 7.55 dBi was exhibited at a 5-GHz band. The simulation and measurement results of the proposed tapered slot antenna were similar.
A Theoretical Investigation of the Input Characteristics of a Rectangular Cavity-Backed Slot Antenna
NASA Technical Reports Server (NTRS)
Cockrell, C. R.
1975-01-01
Equations which represent the magnetic and electric stored energies are derived for an infinite section of rectangular waveguide and a rectangular cavity. These representations which are referred to as being physically observable are obtained by considering the difference in the volume integrals appearing in the complex Poynting theorem. It is shown that the physically observable stored energies are determined by the field components that vanish in a reference plane outside the aperture. These physically observable representations are used to compute the input admittance of a rectangular cavity-backed slot antenna in which a single propagating wave is assumed to exist in the cavity. The slot is excited by a voltage source connected across its center; a sinusoidal distribution is assumed in the slot. Input-admittance calculations are compared with measured data. In addition, input-admittance curves as a function of electrical slot length are presented for several size cavities. For the rectangular cavity backed slot antenna, the quality factor and relative bandwidth were computed independently by using these energy relationships. It is shown that the asymptotic relationship which is usually assumed to exist between the quality bandwidth and the reciprocal of relative bandwidth is equally valid for the rectangular cavity backed slot antenna.
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…
NASA Astrophysics Data System (ADS)
Kuri, Josu�; Gagnaire, Maurice; Puech, Nicolas
2005-10-01
Virtual concatenation (VCAT) is a Synchronous Digital Hierarchy (SDH)/Synchronous Optical Network (SONET) network functionality recently standardized by the International Telecommunication Union Telecommunication Standardization Sector (ITU-T). VCAT provides the flexibility required to efficiently allocate network resources to Ethernet, Fiber Channel (FC), Enterprise System Connection (ESCON), and other important data traffic signals. In this article, we assess the resources' gain provided by VCAT with respect to contiguous concatenation (CCAT) in SDH/SONET mesh transport networks bearing protected scheduled connection demands (SCDs).
Syllable timing and pausing: evidence from Cantonese.
Perry, Conrad; Wong, Richard Kwok-Shing; Matthews, Stephen
2009-01-01
We examined the relationship between the acoustic duration of syllables and the silent pauses that follow them in Cantonese. The results showed that at major syntactic junctures, acoustic plus silent pause durations were quite similar for a number of different syllable types whose acoustic durations differed substantially. In addition, it appeared that CV: syllables, which had the longest acoustic duration of all syllable types that were examined, were also the least likely to have silent pauses after them. These results suggest that cross-language differences between the probability that silent pauses are used at major syntactic junctures might potentially be explained by the accuracy at which timing slots can be assigned for syllables, rather than more complex explanations that have been proposed.
NASA Astrophysics Data System (ADS)
Mandrà, Salvatore; Giacomo Guerreschi, Gian; Aspuru-Guzik, Alán
2016-07-01
We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists in the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the Exact Satisfiability; while the second part performs a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query complexities for the worst-case are respectively bounded by O(\\sqrt{{2}n-{M\\prime }}) and O({2}n-{M\\prime }), where n is the number of variables and {M}\\prime the number of linearly independent clauses. Remarkably, the proposed quantum algorithm results to be faster than any known exact classical algorithm to solve dense formulas of Exact Satisfiability. As a concrete application, we provide the worst-case complexity for the Hamiltonian cycle problem obtained after mapping it to a suitable Occupation problem. Specifically, we show that the time complexity for the proposed quantum algorithm is bounded by O({2}n/4) for 3-regular undirected graphs, where n is the number of nodes. The same worst-case complexity holds for (3,3)-regular bipartite graphs. As a reference, the current best classical algorithm has a (worst-case) running time bounded by O({2}31n/96). Finally, when compared to heuristic techniques for Exact Satisfiability problems, the proposed quantum algorithm is faster than the classical WalkSAT and Adiabatic Quantum Optimization for random instances with a density of constraints close to the satisfiability threshold, the regime in which instances are typically the hardest to solve. The proposed quantum algorithm can be straightforwardly extended to the generalized version of the Exact Satisfiability known as Occupation problem. The general version of the algorithm is presented and analyzed.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bekelman, Justin E., E-mail: bekelman@uphs.upenn.edu; Department of Medical Ethics and Health Policy, Perelman School of Medicine, University of Pennsylvania, Philadelphia, Pennsylvania; Leonard Davis Institute of Health Economics, University of Pennsylvania, Philadelphia, Pennsylvania
Purpose: To present the principles and rationale of the Proton Priority System (PROPS), a priority points framework that assigns higher scores to patients thought to more likely benefit from proton therapy, and the distribution of PROPS scores by patient characteristics Methods and Materials: We performed multivariable logistic regression to evaluate the association between PROPS scores and receipt of proton therapy, adjusted for insurance status, gender, race, geography, and the domains that inform the PROPS score. Results: Among 1529 adult patients considered for proton therapy prioritization during our Center's ramp-up phase of treatment availability, PROPS scores varied by age, diagnosis, site,more » and other PROPS domains. In adjusted analyses, receipt of proton therapy was lower for patients with non-Medicare relative to Medicare health insurance (commercial vs Medicare: adjusted odds ratio [OR] 0.47, 95% confidence interval [CI] 0.34-0.64; managed care vs Medicare: OR 0.40, 95% CI 0.28-0.56; Medicaid vs Medicare: OR 0.24, 95% CI 0.13-0.44). Proton Priority System score and age were not significantly associated with receipt of proton therapy. Conclusions: The Proton Priority System is a rationally designed and transparent system for allocation of proton therapy slots based on the best available evidence and expert opinion. Because the actual allocation of treatment slots depends mostly on insurance status, payers may consider incorporating PROPS, or its underlying principles, into proton therapy coverage policies.« less
Numerical study on non-locally reacting behavior of nacelle liners incorporating drainage slots
NASA Astrophysics Data System (ADS)
Chen, Chao; Li, Xiaodong; Thiele, Frank
2018-06-01
For acoustic liners used in current commercial nacelles, in order to prevent any liquid accumulating in the resonators, drainage slots are incorporated on the partition walls between closely packed cavities. Recently, an experimental study conducted by Busse-Gerstengarbe et al. shown that the cell interaction introduced by drainage slots causes an additional dissipation peak which increases with the size of the slot. However, the variation of damping process due to drainage slots is still not fully understood. Therefore, a numerical study based on computational aeroacoustic methods is carried out to investigate the mechanism of the changed attenuation characteristics due to drainage slots in presence of grazing incident sound waves with low or high intensities. Different slot configurations are designed based on the generic non-locally reacting liner model adopted in the experimental investigation. Both 2-D and 3-D numerical simulations of only slit resonators are carried out. Numerical results indicate that the extra peak is a result of a resonance excited in the second cavity at specific frequency. Under high sound pressure level incoming waves, the basic characteristics of the acoustic performance remain. However, vortex shedding transpires at the resonances around both the slits and the drainage slot. Vorticity contours show that the connection of two coupled cavities decreases the strength of vortex shedding around the basic Helmholtz resonance due to a higher energy reflection. Meanwhile, the cell interaction significantly increases the vorticity magnitude near the extra resonant frequency. Finally, a semi-empirical model is derived to predict the extra attenuation peak frequency.
Effect of injection screen slot geometry on hydraulic conductivity tests
NASA Astrophysics Data System (ADS)
Klammler, Harald; Nemer, Bassel; Hatfield, Kirk
2014-04-01
Hydraulic conductivity and its spatial variability are important hydrogeological parameters and are typically determined through injection tests at different scales. For injection test interpretation, shape factors are required to account for injection screen geometry. Shape factors act as proportionality constants between hydraulic conductivity and observed ratios of injection flow rate and injection head at steady-state. Existing results for such shape factors assume either an ideal screen (i.e., ignoring effects of screen slot geometry) or infinite screen length (i.e., ignoring effects of screen extremes). In the present work, we investigate the combined effects of circumferential screen slot geometry and finite screen length on injection shape factors. This is done in terms of a screen entrance resistance by solving a steady-state potential flow mixed type boundary value problem in a homogeneous axi-symmetric flow domain using a semi-analytical solution approach. Results are compared to existing analytical solutions for circumferential and longitudinal slots on infinite screens, which are found to be identical. Based on an existing approximation, an expression is developed for a dimensionless screen entrance resistance of infinite screens, which is a function of the relative slot area only. For anisotropic conditions, e.g., when conductivity is smaller in the vertical direction than in the horizontal, screen entrance losses for circumferential slots increase, while they remain unaffected for longitudinal slots. This work is not concerned with investigating the effects of (possibly turbulent) head losses inside the injection device including the passage through the injection slots prior to entering the porous aquifer.
NASA Astrophysics Data System (ADS)
Hortos, William S.
1997-04-01
The use of artificial neural networks (NNs) to address the channel assignment problem (CAP) for cellular time-division multiple access and code-division multiple access networks has previously been investigated by this author and many others. The investigations to date have been based on a hexagonal cell structure established by omnidirectional antennas at the base stations. No account was taken of the use of spatial isolation enabled by directional antennas to reduce interference between mobiles. Any reduction in interference translates into increased capacity and consequently alters the performance of the NNs. Previous studies have sought to improve the performance of Hopfield- Tank network algorithms and self-organizing feature map algorithms applied primarily to static channel assignment (SCA) for cellular networks that handle uniformly distributed, stationary traffic in each cell for a single type of service. The resulting algorithms minimize energy functions representing interference constraint and ad hoc conditions that promote convergence to optimal solutions. While the structures of the derived neural network algorithms (NNAs) offer the potential advantages of inherent parallelism and adaptability to changing system conditions, this potential has yet to be fulfilled the CAP for emerging mobile networks. The next-generation communication infrastructures must accommodate dynamic operating conditions. Macrocell topologies are being refined to microcells and picocells that can be dynamically sectored by adaptively controlled, directional antennas and programmable transceivers. These networks must support the time-varying demands for personal communication services (PCS) that simultaneously carry voice, data and video and, thus, require new dynamic channel assignment (DCA) algorithms. This paper examines the impact of dynamic cell sectoring and geometric conditioning on NNAs developed for SCA in omnicell networks with stationary traffic to improve the metrics of convergence rate and call blocking. Genetic algorithms (GAs) are also considered in PCS networks as a means to overcome the known weakness of Hopfield NNAs in determining global minima. The resulting GAs for DCA in PCS networks are compared to improved DCA algorithms based on Hopfield NNs for stationary cellular networks. Algorithm performance is compared on the basis of rate of convergence, blocking probability, analytic complexity, and parametric sensitivity to transient traffic demands and channel interference.
Strategic Control Algorithm Development : Volume 1. Summary.
DOT National Transportation Integrated Search
1974-08-01
Strategic control is an air traffic management concept wherein a central control authority determines, and assigns to each participating airplane, a conflict-free, four-dimensional route-time profile. The route-time profile assignments are long term ...
A Two-Phase Model of Resource Allocation in Visual Working Memory
ERIC Educational Resources Information Center
Ye, Chaoxiong; Hu, Zhonghua; Li, Hong; Ristaniemi, Tapani; Liu, Qiang; Liu, Taosheng
2017-01-01
Two broad theories of visual working memory (VWM) storage have emerged from current research, a discrete slot-based theory and a continuous resource theory. However, neither the discrete slot-based theory or continuous resource theory clearly stipulates how the mental commodity for VWM (discrete slot or continuous resource) is allocated.…
14 CFR 93.218 - Slots for transborder service to and from Canada.
Code of Federal Regulations, 2010 CFR
2010-01-01
... Canada. 93.218 Section 93.218 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF... service to and from Canada. (a) Except as otherwise provided in this subpart, international slots...'Hare in the Winter season. (c) Any modification to the slot base by the Government of Canada or the...
14 CFR 93.227 - Slot use and loss.
Code of Federal Regulations, 2010 CFR
2010-01-01
... Operations at High Density Traffic Airports § 93.227 Slot use and loss. (a) Except as provided in paragraphs... commuter operator or other person holding a slot at a high density airport shall, within 14 days after the... High Density Traffic Airport on Thanksgiving Day, the Friday following Thanksgiving Day, and the period...
Lipp, G. Daniel
1994-05-03
A method and die apparatus for manufacturing a honeycomb body of triangular cell cross-section and high cell density, the die having a combination of (i) feedholes feeding slot intersections and (ii) feedholes feeding slot segments not supplied from slot intersections, whereby a reduction in feedhole count is achieved while still retaining good extrusion efficiency and extrudate uniformity.
14 CFR 93.227 - Slot use and loss.
Code of Federal Regulations, 2011 CFR
2011-01-01
... Operations at High Density Traffic Airports § 93.227 Slot use and loss. (a) Except as provided in paragraphs... commuter operator or other person holding a slot at a high density airport shall, within 14 days after the... High Density Traffic Airport on Thanksgiving Day, the Friday following Thanksgiving Day, and the period...
14 CFR 93.227 - Slot use and loss.
Code of Federal Regulations, 2014 CFR
2014-01-01
... Operations at High Density Traffic Airports § 93.227 Slot use and loss. (a) Except as provided in paragraphs... commuter operator or other person holding a slot at a high density airport shall, within 14 days after the... High Density Traffic Airport on Thanksgiving Day, the Friday following Thanksgiving Day, and the period...
14 CFR 93.227 - Slot use and loss.
Code of Federal Regulations, 2012 CFR
2012-01-01
... Operations at High Density Traffic Airports § 93.227 Slot use and loss. (a) Except as provided in paragraphs... commuter operator or other person holding a slot at a high density airport shall, within 14 days after the... High Density Traffic Airport on Thanksgiving Day, the Friday following Thanksgiving Day, and the period...
14 CFR 93.227 - Slot use and loss.
Code of Federal Regulations, 2013 CFR
2013-01-01
... Operations at High Density Traffic Airports § 93.227 Slot use and loss. (a) Except as provided in paragraphs... commuter operator or other person holding a slot at a high density airport shall, within 14 days after the... High Density Traffic Airport on Thanksgiving Day, the Friday following Thanksgiving Day, and the period...
FDTD Analysis of U-Slot Rectangular Patch Antenna
NASA Technical Reports Server (NTRS)
Luk, K. M.; Tong, K. F.; Shum, S. M.; Lee, K. F.; Lee, R. Q.
1997-01-01
The U-slot rectangular patch antenna (Figure I) has been found experimentally to provide impedance and gain bandwidths of about 300 without the need of stacked or coplanar parasitic elements [1,2]. In this paper, simulation results of the U-slot patch using FDTD analysis are presented. Comparison with measured results are given.
The impact of sound in modern multiline video slot machine play.
Dixon, Mike J; Harrigan, Kevin A; Santesso, Diane L; Graydon, Candice; Fugelsang, Jonathan A; Collins, Karen
2014-12-01
Slot machine wins and losses have distinctive, measurable, physiological effects on players. The contributing factors to these effects remain under-explored. We believe that sound is one of these key contributing factors. Sound plays an important role in reinforcement, and thus on arousal level and stress response of players. It is the use of sound for positive reinforcement in particular that we believe influences the player. In the current study, we investigate the role that sound plays in psychophysical responses to slot machine play. A total of 96 gamblers played a slot machine simulator with and without sound being paired with reinforcement. Skin conductance responses and heart rate, as well as subjective judgments about the gambling experience were examined. The results showed that the sound influenced the arousal of participants both psychophysically and psychologically. The sound also influenced players' preferences, with the majority of players preferring to play slot machines that were accompanied by winning sounds. The sounds also caused players to significantly overestimate the number of times they won while playing the slot machine.
NASA Technical Reports Server (NTRS)
Al-Saadi, Jassim A.
1993-01-01
A computational simulation of a transonic wind tunnel test section with longitudinally slotted walls is developed and described herein. The nonlinear slot model includes dynamic pressure effects and a plenum pressure constraint, and each slot is treated individually. The solution is performed using a finite-difference method that solves an extended transonic small disturbance equation. The walls serve as the outer boundary conditions in the relaxation technique, and an interaction procedure is used at the slotted walls. Measured boundary pressures are not required to establish the wall conditions but are currently used to assess the accuracy of the simulation. This method can also calculate a free-air solution as well as solutions that employ the classical homogeneous wall conditions. The simulation is used to examine two commercial transport aircraft models at a supercritical Mach number for zero-lift and cruise conditions. Good agreement between measured and calculated wall pressures is obtained for the model geometries and flow conditions examined herein. Some localized disagreement is noted, which is attributed to improper simulation of viscous effects in the slots.
Printed wide-slot antenna design with bandwidth and gain enhancement on low-cost substrate.
Samsuzzaman, M; Islam, M T; Mandeep, J S; Misran, N
2014-01-01
This paper presents a printed wide-slot antenna design and prototyping on available low-cost polymer resin composite material fed by a microstrip line with a rotated square slot for bandwidth enhancement and defected ground structure for gain enhancement. An I-shaped microstrip line is used to excite the square slot. The rotated square slot is embedded in the middle of the ground plane, and its diagonal points are implanted in the middle of the strip line and ground plane. To increase the gain, four L-shaped slots are etched in the ground plane. The measured results show that the proposed structure retains a wide impedance bandwidth of 88.07%, which is 20% better than the reference antenna. The average gain is also increased, which is about 4.17 dBi with a stable radiation pattern in the entire operating band. Moreover, radiation efficiency, input impedance, current distribution, axial ratio, and parametric studies of S11 for different design parameters are also investigated using the finite element method-based simulation software HFSS.
Printed Wide-Slot Antenna Design with Bandwidth and Gain Enhancement on Low-Cost Substrate
Samsuzzaman, M.; Islam, M. T.; Mandeep, J. S.; Misran, N.
2014-01-01
This paper presents a printed wide-slot antenna design and prototyping on available low-cost polymer resin composite material fed by a microstrip line with a rotated square slot for bandwidth enhancement and defected ground structure for gain enhancement. An I-shaped microstrip line is used to excite the square slot. The rotated square slot is embedded in the middle of the ground plane, and its diagonal points are implanted in the middle of the strip line and ground plane. To increase the gain, four L-shaped slots are etched in the ground plane. The measured results show that the proposed structure retains a wide impedance bandwidth of 88.07%, which is 20% better than the reference antenna. The average gain is also increased, which is about 4.17 dBi with a stable radiation pattern in the entire operating band. Moreover, radiation efficiency, input impedance, current distribution, axial ratio, and parametric studies of S11 for different design parameters are also investigated using the finite element method-based simulation software HFSS. PMID:24696661
Wideband Circularly Polarized Printed Ring Slot Antenna for 5 GHz – 6 GHz
NASA Astrophysics Data System (ADS)
Nasrun Osman, Mohamed; Rahim, Mohamad Helmi A.; Jusoh, Muzammil; Sabapathy, Thennarasan; Rahim, Mohamad Kamal A.; Norlyana Azemi, Saidatul
2018-03-01
This paper presents the design of circularly polarized printed slot antenna operating at 5 – 6 GHz. The proposed antenna consists of L-shaped feedline on the top of structure and circular ring slot positioned at the ground plane underneath the substrate as a radiator. A radial and narrow slot in the ground plane provides coupling between the L-shaped feedline and circular ring slot. The circular polarization is realized by implementing the slits perturbation located diagonally to perturb the current flow on the slot structure. The antenna prototype is fabricated on FR4 substrate. The simulated and measured results are compared and analyzed to demonstrate the performance of the antenna. Good measured of simulated results are obtained at the targeted operating frequency. The simulated -10dB reflection coefficient bandwidths and axial ratio are 750 MHz and 165 MHz, respectively. The investigation on the affect of the important parameters towards the reflection coefficient and axial are also presented. The proposed antenna is highly potential to be used for wireless local area network (WLAN) and wireless power transfer (WPT).
Alarm toe switch. [Patent application
Ganyard, F.P.
1980-11-18
An alarm toe switch inserted within a shoe for energizing an alarm circuit in a covert manner includes an insole mounting pad into which a miniature reed switch is fixedly molded. An elongated slot perpendicular to the reed switch is formed in the bottom surface of the mounting pad. A permanent cylindrical magnet positioned in the forward portion of the slot with a diameter greater than the pad thickness causes a bump above the pad. A foam rubber block is also positioned in the slot rearwardly of the magnet and holds the magnet in normal inoperative relation. A non-magnetic support plate covers the slot and holds the magnet and foam rubber in the slot. The plate minimizes bending and frictional forces to improve movement of the magnet for reliable switch activation. The bump occupies the knuckle space beneath the big toe. When the big toe is scrunched rearwardly the magnet is moved within the slot relative to the reed switch, thus magnetically activating the switch. When toe pressure is released the foam rubber block forces the magnet back into normal inoperative position to deactivate the reed switch.
Valve for controlling solids flow
Feldman, David K.
1980-01-01
A fluidized solids control valve is disclosed that is particularly well adapted for use with a flow of coal or char that includes both large particles and fines. The particles may or may not be fluidized at various times during the operation. The valve includes a tubular body that terminates in a valve seat covered by a normally closed closure plate. The valve body at the seat and the closure plate is provided with aligned longitudinal slots that receive a pivotally supported key plate. The key plate is positionable by an operator in inserted, intermediate and retracted positions respecting the longitudinal slot in the valve body. The key plate normally closes the slot within the closure plate but is shaped and aligned obliquely to the longitudinal slot within the valve body to provide progressively increasing slot openings between the inserted and retracted positions. Transfer members are provided between the operator, key plate and closure plate to move the closure plate into an open position only when the key plate is retracted from the longitudinal slot within the valve body.
Real-time handling of existing content sources on a multi-layer display
NASA Astrophysics Data System (ADS)
Singh, Darryl S. K.; Shin, Jung
2013-03-01
A Multi-Layer Display (MLD) consists of two or more imaging planes separated by physical depth where the depth is a key component in creating a glasses-free 3D effect. Its core benefits include being viewable from multiple angles, having full panel resolution for 3D effects with no side effects of nausea or eye-strain. However, typically content must be designed for its optical configuration in foreground and background image pairs. A process was designed to give a consistent 3D effect in a 2-layer MLD from existing stereo video content in real-time. Optimizations to stereo matching algorithms that generate depth maps in real-time were specifically tailored for the optical characteristics and image processing algorithms of a MLD. The end-to-end process included improvements to the Hierarchical Belief Propagation (HBP) stereo matching algorithm, improvements to optical flow and temporal consistency. Imaging algorithms designed for the optical characteristics of a MLD provided some visual compensation for depth map inaccuracies. The result can be demonstrated in a PC environment, displayed on a 22" MLD, used in the casino slot market, with 8mm of panel seperation. Prior to this development, stereo content had not been used to achieve a depth-based 3D effect on a MLD in real-time
Holding-time-aware asymmetric spectrum allocation in virtual optical networks
NASA Astrophysics Data System (ADS)
Lyu, Chunjian; Li, Hui; Liu, Yuze; Ji, Yuefeng
2017-10-01
Virtual optical networks (VONs) have been considered as a promising solution to support current high-capacity dynamic traffic and achieve rapid applications deployment. Since most of the network services (e.g., high-definition video service, cloud computing, distributed storage) in VONs are provisioned by dedicated data centers, needing different amount of bandwidth resources in both directions, the network traffic is mostly asymmetric. The common strategy, symmetric provisioning of traffic in optical networks, leads to a waste of spectrum resources in such traffic patterns. In this paper, we design a holding-time-aware asymmetric spectrum allocation module based on SDON architecture and an asymmetric spectrum allocation algorithm based on the module is proposed. For the purpose of reducing spectrum resources' waste, the algorithm attempts to reallocate the idle unidirectional spectrum slots in VONs, which are generated due to the asymmetry of services' bidirectional bandwidth. This part of resources can be exploited by other requests, such as short-time non-VON requests. We also introduce a two-dimensional asymmetric resource model for maintaining idle spectrum resources information of VON in spectrum and time domains. Moreover, a simulation is designed to evaluate the performance of the proposed algorithm, and results show that our proposed asymmetric spectrum allocation algorithm can improve the resource waste and reduce blocking probability.
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Song, W.-Z.; Yuan, F.; LaHuser, R.
2007-01-01
This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs max(2N(u1) - 1, N(u 0) -1) time slots, assuming each node reports one unit of data in each round. Here N(u0) is the total number of sensors, while N(u 1) denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also eliminated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle. ??2006 IEEE.
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.
2007-01-01
This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.
Multi-Source Multi-Target Dictionary Learning for Prediction of Cognitive Decline
Zhang, Jie; Li, Qingyang; Caselli, Richard J.; Thompson, Paul M.; Ye, Jieping; Wang, Yalin
2017-01-01
Alzheimer’s Disease (AD) is the most common type of dementia. Identifying correct biomarkers may determine pre-symptomatic AD subjects and enable early intervention. Recently, Multi-task sparse feature learning has been successfully applied to many computer vision and biomedical informatics researches. It aims to improve the generalization performance by exploiting the shared features among different tasks. However, most of the existing algorithms are formulated as a supervised learning scheme. Its drawback is with either insufficient feature numbers or missing label information. To address these challenges, we formulate an unsupervised framework for multi-task sparse feature learning based on a novel dictionary learning algorithm. To solve the unsupervised learning problem, we propose a two-stage Multi-Source Multi-Target Dictionary Learning (MMDL) algorithm. In stage 1, we propose a multi-source dictionary learning method to utilize the common and individual sparse features in different time slots. In stage 2, supported by a rigorous theoretical analysis, we develop a multi-task learning method to solve the missing label problem. Empirical studies on an N = 3970 longitudinal brain image data set, which involves 2 sources and 5 targets, demonstrate the improved prediction accuracy and speed efficiency of MMDL in comparison with other state-of-the-art algorithms. PMID:28943731
Energy dissipation of slot-type flip buckets
NASA Astrophysics Data System (ADS)
Wu, Jian-hua; Li, Shu-fang; Ma, Fei
2018-03-01
The energy dissipation is a key index in the evaluation of energy dissipation elements. In the present work, a flip bucket with a slot, called the slot-type flip bucket, is theoretically and experimentally investigated by the method of estimating the energy dissipation. The theoretical analysis shows that, in order to have the energy dissipation, it is necessary to determine the sequent flow depth h 1 and the flow speed V 1 at the corresponding position through the flow depth h 2 after the hydraulic jump. The relative flow depth h 2 / h 。 is a function of the approach flow Froude number Fr 。, the relative slot width b/B 。, and the relative slot angle θ/β. The expression for estimating the energy dissipation is developed, and the maximum error is not larger than 9.21%.
NASA Technical Reports Server (NTRS)
Stickle, George W; Naiman, Irven; Crigler, John L
1940-01-01
Report presents the results of an investigation of full-scale nose-slot cowlings conducted in the NACA 20-foot wind tunnel to furnish information on the pressure drop available for cooling. Engine conductances from 0 to 0.12 and exit-slot conductances from 0 to 0.30 were covered. Two basic nose shapes were tested to determine the effect of the radius of curvature of the nose contour; the nose shape with the smaller radius of curvature gave the higher pressure drop across the engine. The best axial location of the slot for low-speed operation was found to be in the region of maximum negative pressure for the basic shape for the particular operating condition. The effect of the pressure operating condition on the available cooling pressure is shown.
Energy dissipation of slot-type flip buckets
NASA Astrophysics Data System (ADS)
Wu, Jian-hua; Li, Shu-fang; Ma, Fei
2018-04-01
The energy dissipation is a key index in the evaluation of energy dissipation elements. In the present work, a flip bucket with a slot, called the slot-type flip bucket, is theoretically and experimentally investigated by the method of estimating the energy dissipation. The theoretical analysis shows that, in order to have the energy dissipation, it is necessary to determine the sequent flow depth h 1 and the flow speed V 1 at the corresponding position through the flow depth h 2 after the hydraulic jump. The relative flow depth h 2 / h o is a function of the approach flow Froude number Fr o, the relative slot width b/ B o, and the relative slot angle θ/ β. The expression for estimating the energy dissipation is developed, and the maximum error is not larger than 9.21%.
Mimicking glide symmetry dispersion with coupled slot metasurfaces
NASA Astrophysics Data System (ADS)
Camacho, Miguel; Mitchell-Thomas, Rhiannon C.; Hibbins, Alastair P.; Sambles, J. Roy; Quevedo-Teruel, Oscar
2017-09-01
In this letter, we demonstrate that the dispersion properties associated with glide symmetry can be achieved in systems that only possess reflection symmetry by balancing the influence of two sublattices. We apply this approach to a pair of coupled slots cut into an infinite perfectly conducting plane. Each slot is notched on either edge, with the complete two-slot system having only mirror symmetry. By modifying the relative size of the notches on either side of the slots, we show that a linear dispersion relation with a degeneracy with non-zero group velocity at the Brillouin zone boundary can be achieved. These properties, until now, only found in systems with glide symmetry are numerically and experimentally validated. We also show that these results can be used for the design of ultra-wideband one-dimensional leaky wave antennas in coplanar waveguide technology.
IDENTIFICATION BADGE WITH DETACHABLE CLIP
Burns, M.T.
1962-09-18
The clip has a long slot with a round enlarged end, flat on one side. The badge has a headed member that is circular except for a flat side. The badge is connected to, or disconnected from, the clip by insertion of the headed member through the enlarged end of the slot in the clip. The badge is unlikely to be accidentally disconnected from the clip while being worn on a worker's clothing, because the weight of the badge keeps the headed member away from the enlarged end of the slot in the clip, and the headed member can pass through the enlarged end of the slot only at one relative angular position between badge and clip, namely, that angle at which the flat side of the headed member is coincident with the flat side of the enlarged end of the slot. (AEC)
Computational Investigation of Tangential Slot Blowing on a Generic Chined Forebody
NASA Technical Reports Server (NTRS)
Agosta-Greenman, Roxana M.; Gee, Ken; Cummings, Russell M.; Schiff, Lewis B.
1995-01-01
The effect of tangential slot blowing on the flowfield about a generic chined forebody at high angles of attack is investigated numerically using solutions of the thin-layer, Reynolds-averaged, Navier-Stokes equations. The effects of jet mass now ratios, angle of attack, and blowing slot location in the axial and circumferential directions are studied. The computed results compare well with available wind-tunnel experimental data. Computational results show that for a given mass now rate, the yawing moments generated by slot blowing increase as the body angle of attack increases. It is observed that greater changes in the yawing moments are produced by a slot located closest to the lip of the nose. Also, computational solutions show that inboard blowing across the top surface is more effective at generating yawing moments than blowing outboard from the bottom surface.
Rule-based support system for multiple UMLS semantic type assignments
Geller, James; He, Zhe; Perl, Yehoshua; Morrey, C. Paul; Xu, Julia
2012-01-01
Background When new concepts are inserted into the UMLS, they are assigned one or several semantic types from the UMLS Semantic Network by the UMLS editors. However, not every combination of semantic types is permissible. It was observed that many concepts with rare combinations of semantic types have erroneous semantic type assignments or prohibited combinations of semantic types. The correction of such errors is resource-intensive. Objective We design a computational system to inform UMLS editors as to whether a specific combination of two, three, four, or five semantic types is permissible or prohibited or questionable. Methods We identify a set of inclusion and exclusion instructions in the UMLS Semantic Network documentation and derive corresponding rule-categories as well as rule-categories from the UMLS concept content. We then design an algorithm adviseEditor based on these rule-categories. The algorithm specifies rules for an editor how to proceed when considering a tuple (pair, triple, quadruple, quintuple) of semantic types to be assigned to a concept. Results Eight rule-categories were identified. A Web-based system was developed to implement the adviseEditor algorithm, which returns for an input combination of semantic types whether it is permitted, prohibited or (in a few cases) requires more research. The numbers of semantic type pairs assigned to each rule-category are reported. Interesting examples for each rule-category are illustrated. Cases of semantic type assignments that contradict rules are listed, including recently introduced ones. Conclusion The adviseEditor system implements explicit and implicit knowledge available in the UMLS in a system that informs UMLS editors about the permissibility of a desired combination of semantic types. Using adviseEditor might help accelerate the work of the UMLS editors and prevent erroneous semantic type assignments. PMID:23041716
W-Band On-Wafer Measurement of Uniplanar Slot-Type Antennas
NASA Technical Reports Server (NTRS)
Raman, Sanjay; Gauthier, Gildas P.; Rebeiz, Gabriel M.
1997-01-01
Uniplanar slot-type antennas such as coplanar waveguide fed single- and dual-polarized slot-ring antennas and double folded-slot antennas are characterized using a millimeter-wave network analyzer and on-wafer measurement techniques. The antennas are designed to be mounted on a dielectric lens to minimize power loss into substrate modes and realize high-gain antenna patterns. On-wafer measurements are performed by placing the antenna wafer on a thick dielectric spacer of similar e(sub t) and eliminating the reflection from the probe station chuck with time-domain gating. The measured results agree well with method-of-moments simulations.
Flight Tests of N.A.C.A. Nose-slot Cowlings on the BFC-1 Airplane
NASA Technical Reports Server (NTRS)
Stickle, George W
1939-01-01
The results of flight tests of four nose-slot cowling designs with several variations in each design are presented. The tests were made in the process of developing the nose-slot cowling. The results demonstrate that a nose-slot cowling may be successfully applied to an airplane and that it utilizes the increased slipstream velocity of low-speed operation to produce increased cooling pressure across the engine. A sample design calculation using results from wind-tunnel, flight, and ground tests is given in an appendix to illustrate the design procedure.
Single-stage experimental evaluation of compressor blading with slots and vortex generators, part 5
NASA Technical Reports Server (NTRS)
Brent, J. A.
1972-01-01
An experimental investigation was conducted to determine the extent that slots and vortex generators can increase the efficiency and stable operating range of highly loaded compressor stages. With slots in the rotor and stator, the stage performance both with and without vortex generators was inferior to that achieved with the unslotted blading. However, with vortex generators, stator slots, and an unslotted rotor, the stable operating range increased 25% and the stage peak efficiency increased 2.1% over the values achieved with the unslotted rotor and stator without vortex generators, at design equivalent rotor speed.
Developing an eco-routing application.
DOT National Transportation Integrated Search
2014-01-01
The study develops eco-routing algorithms and investigates and quantifies the system-wide impacts of implementing an eco-routing system. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assign...
A Depth Map Generation Algorithm Based on Saliency Detection for 2D to 3D Conversion
NASA Astrophysics Data System (ADS)
Yang, Yizhong; Hu, Xionglou; Wu, Nengju; Wang, Pengfei; Xu, Dong; Rong, Shen
2017-09-01
In recent years, 3D movies attract people's attention more and more because of their immersive stereoscopic experience. However, 3D movies is still insufficient, so estimating depth information for 2D to 3D conversion from a video is more and more important. In this paper, we present a novel algorithm to estimate depth information from a video via scene classification algorithm. In order to obtain perceptually reliable depth information for viewers, the algorithm classifies them into three categories: landscape type, close-up type, linear perspective type firstly. Then we employ a specific algorithm to divide the landscape type image into many blocks, and assign depth value by similar relative height cue with the image. As to the close-up type image, a saliency-based method is adopted to enhance the foreground in the image and the method combine it with the global depth gradient to generate final depth map. By vanishing line detection, the calculated vanishing point which is regarded as the farthest point to the viewer is assigned with deepest depth value. According to the distance between the other points and the vanishing point, the entire image is assigned with corresponding depth value. Finally, depth image-based rendering is employed to generate stereoscopic virtual views after bilateral filter. Experiments show that the proposed algorithm can achieve realistic 3D effects and yield satisfactory results, while the perception scores of anaglyph images lie between 6.8 and 7.8.
Frerichs, H.; Schmitz, O.; Covele, B.; ...
2018-02-28
Numerical simulations of toroidal asymmetries in a tightly baffled small angle slot (SAS) divertor on the DIII-D tokamak show that toroidal asymmetries in divertor closure result in (non-axisymmetric) local onset of detachment within a density window of 10-15% on top of the nominal threshold separatrix density. The SAS divertor is explored at DIII-D for improving access to cold, dissipative/detached divertor conditions. The narrow width of the slot divertor coupled with a small magnetic field line-to-target angle facilitates the buildup of neutral density, thereby increasing radiative and neutrals-related (atoms and molecules) losses in the divertor. Therefore, small changes in the strikemore » point location can be expected to have a large impact on diverter conditions. The combination of misaligned slot structure and non-axisymmetric perturbations to the magnetic field configuration causes the strike point to move along the divertor target plate, possibly leaving the diverter slot at some locations. The latter extreme case essentially introduces an opening in the divertor slot from where recycling neutrals can easily escape, and thereby degrade the performance of the slot divertor. Such a strike point dislocation is approximated by a finite gap in the divertor baffle for which three dimensional edge plasma and neutral gas simulations are performed with the EMC3-EIRENE code.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Frerichs, H.; Schmitz, O.; Covele, B.
Numerical simulations of toroidal asymmetries in a tightly baffled small angle slot (SAS) divertor on the DIII-D tokamak show that toroidal asymmetries in divertor closure result in (non-axisymmetric) local onset of detachment within a density window of 10-15% on top of the nominal threshold separatrix density. The SAS divertor is explored at DIII-D for improving access to cold, dissipative/detached divertor conditions. The narrow width of the slot divertor coupled with a small magnetic field line-to-target angle facilitates the buildup of neutral density, thereby increasing radiative and neutrals-related (atoms and molecules) losses in the divertor. Therefore, small changes in the strikemore » point location can be expected to have a large impact on diverter conditions. The combination of misaligned slot structure and non-axisymmetric perturbations to the magnetic field configuration causes the strike point to move along the divertor target plate, possibly leaving the diverter slot at some locations. The latter extreme case essentially introduces an opening in the divertor slot from where recycling neutrals can easily escape, and thereby degrade the performance of the slot divertor. Such a strike point dislocation is approximated by a finite gap in the divertor baffle for which three dimensional edge plasma and neutral gas simulations are performed with the EMC3-EIRENE code.« less
NASA Astrophysics Data System (ADS)
Frerichs, H.; Schmitz, O.; Covele, B.; Feng, Y.; Guo, H. Y.; Hill, D.
2018-05-01
Numerical simulations of toroidal asymmetries in a tightly baffled small angle slot (SAS) divertor on the DIII-D tokamak show that toroidal asymmetries in divertor closure result in (non-axisymmetric) local onset of detachment within a density window of 10-15% on top of the nominal threshold separatrix density. The SAS divertor is explored at DIII-D for improving access to cold, dissipative/detached divertor conditions. The narrow width of the slot divertor coupled with a small magnetic field line-to-target angle facilitates the buildup of neutral density, thereby increasing radiative and neutrals-related (atoms and molecules) losses in the divertor. Small changes in the strike point location can be expected to have a large impact on divertor conditions. The combination of misaligned slot structure and non-axisymmetric perturbations to the magnetic field configuration causes the strike point to move along the divertor target plate, possibly leaving the divertor slot at some locations. The latter extreme case essentially introduces an opening in the divertor slot from where recycling neutrals can easily escape, and thereby degrade the performance of the slot divertor. Such a strike point dislocation is approximated by a finite gap in the divertor baffle for which 3D edge plasma and neutral gas simulations are performed with the EMC3-EIRENE code.
Unusual refilling of the slot region between the Van Allen radiation belts
NASA Astrophysics Data System (ADS)
Yang, X.; Yu, J.; Ni, B.; Zhang, Y.; Zhang, X.
2017-12-01
Using multi-satellite measurements, the dynamics of relativistic electrons in the slot region are investigated from 2000 to 2011. The dependences of relativistic electron enhancements in the slot region on interplanetary and magnetospheric conditions are researched. It is resulted that the relativistic electron enhancements in the slot region occurred under remarkable interplanetary and magnetospheric conditions. A uniquely strong and long-lived relativistic electron slot region refilling event from November 2004 to January 2005 is studied especially. Both empirically modeled and observationally estimated plasmapause locations demonstrate that the plasmasphere eroded significantly prior to the enhancement phase of this event. The estimated diffusion coefficients indicate that the radial diffusion due to ULF waves is insufficient to account for the observed enhancement of slot region electrons. However, the diffusion coefficients evaluated using the distribution of chorus wave intensities derived from low-altitude POES electron observations indicate that the local acceleration induced by chorus could account for the major feature of observed enhancement outside the plasmapause. When the plasmasphere recovered, the refilled slot region was enveloped inside the plasmapause. In the plasmasphere, while the efficiency of hiss scattering loss increases by including unusually low frequency hiss waves, the interaction with hiss alone cannot fully explain the decay of this event, especially at higher energies, which suggests that EMIC waves contribute to the relativistic electron loss process at such low L-shells for this refilling event.
NASA Astrophysics Data System (ADS)
Wei, Qingyang; Dai, Tiantian; Ma, Tianyu; Liu, Yaqiang; Gu, Yu
2016-10-01
An Anger-logic based pixelated PET detector block requires a crystal position map (CPM) to assign the position of each detected event to a most probable crystal index. Accurate assignments are crucial to PET imaging performance. In this paper, we present a novel automatic approach to generate the CPMs for dual-layer offset (DLO) PET detectors using a stratified peak tracking method. In which, the top and bottom layers are distinguished by their intensity difference and the peaks of the top and bottom layers are tracked based on a singular value decomposition (SVD) and mean-shift algorithm in succession. The CPM is created by classifying each pixel to its nearest peak and assigning the pixel with the crystal index of that peak. A Matlab-based graphical user interface program was developed including the automatic algorithm and a manual interaction procedure. The algorithm was tested for three DLO PET detector blocks. Results show that the proposed method exhibits good performance as well as robustness for all the three blocks. Compared to the existing methods, our approach can directly distinguish the layer and crystal indices using the information of intensity and offset grid pattern.
Burnout and distribution of liquid between the flow core and wall films in narrow slot channels
NASA Astrophysics Data System (ADS)
Boltenko, E. A.; Shpakovskii, A. A.
2010-03-01
Previous works on studying distribution of liquid between the flow core and wall films in narrow slot channels are briefly reviewed. Interrelation between mass transfer processes and burnout is shown. A procedure for calculating burnout on convex and concave heat-transfer surfaces in narrow slot channels is presented.
Computational Fluid Dynamics Analysis for the Orbiter LH2 Feedline Flowliner
NASA Technical Reports Server (NTRS)
Kiris, Cetin C.
2005-01-01
In phase II, additional inducer rotations are simulated in order to understand the root cause of the flowliner crack problem. CFD results confirmed that there is a strong unsteady interaction between the backflow regions caused by the LPFTP inducer and secondary flow regions in the bellows cavity through the flowliner slots. It is observed that the swirl on the duct side of the downstream flowliner is stronger than on the duct side of the upstream flowliner. Due to this swirl, there are more significant unsteady flow interactions through the downstream slots than those observed in the upstream slots. Averaged values of the local velocity at the slots were provided to the NESC-ITA flow physics acoustics team to guide them in designing the acoustics experiment. A parametric study was performed to compare the flow field in the flowliner area when one upstream slot and one corresponding downstream slot were enlarged. No significant differences were observed between the flow field obtained from the enlarged slot configuration when compared with the original configuration. More cases must be analyzed with various enlarged slot configurations to generalize this observation. The flow through the A1 test stand and the flow through the orbiter fuel feedline manifold were simulated without the LPFTP. It was observed that incoming flow to the flowliner and inducer was more uniform in the A1 test stand then in the orbiter manifold. Additionally, each engine LPFTP in the orbiter receives significantly different velocity distributions. Because of the differences observed in the computed results, it is not possible for the A1 test stand to represent the three different engine feedlines simultaneously.
NASA Astrophysics Data System (ADS)
Haldar, Raktim; Mishra, V.; Dutt, Avik; Varshney, Shailendra K.
2016-10-01
In this work, we propose novel schemes to design on-chip ultra-compact optical directional couplers (DC) and broadband polarization beam splitters (PBS) based on off-centered and asymmetric dielectric slot waveguides, respectively. Slot dimensions and positions are optimized to achieve maximum coupling coefficients between two symmetric and non-symmetric slotted Si wire waveguides through overlap integral method. We observe >88% of enhancement in the coupling coefficients when the size-optimized slots are placed in optimal positions, with respect to the same waveguides with no slot. When the waveguides are parallel, in that case, a coupling length as short as 1.73 μm is accomplished for TM mode with the off-centered and optimized slots. This scheme enables us to design optical DC with very small footprint, L c ∼ 0.9 μm in the presence of S-bends. We also report a compact (L c ∼ 1.1 μm) on-chip broadband PBS with hybrid slots. Extinction ratios of 13 dB and 22.3 dB are realized with very low insertion loss (0.055 dB and 0.008 dB) for TM and TE modes at 1.55 μm, respectively. The designed PBS exhibits a bandwidth of 78 nm for the TM mode (C-and partial L-bands) and >100 nm for the TE mode (S + C + L wavelength bands). Such on-chip devices can be used to design compact photonic interconnects and quantum information processing units efficiently. We have also investigated the fabrication tolerances of the proposed devices and described the fabrication steps to realize such hybrid devices. Our results are in good agreement with 3D FDTD simulations.
Mohebbi, Saleh; Andrade, José; Nolte, Lena; Meyer, Heiko; Heisterkamp, Alexander; Majdani, Omid
2017-01-01
The present study focuses on the application of scanning laser optical tomography (SLOT) for visualization of anatomical structures inside the human cochlea ex vivo. SLOT is a laser-based highly efficient microscopy technique which allows for tomographic imaging of the internal structure of transparent specimens. Thus, in the field of otology this technique is best convenient for an ex vivo study of the inner ear anatomy. For this purpose, the preparation before imaging comprises decalcification, dehydration as well as optical clearing of the cochlea samples in toto. Here, we demonstrate results of SLOT imaging visualizing hard and soft tissue structures with an optical resolution of down to 15 μm using extinction and autofluorescence as contrast mechanisms. Furthermore, the internal structure can be analyzed nondestructively and quantitatively in detail by sectioning of the three-dimensional datasets. The method of X-ray Micro Computed Tomography (μCT) has been previously applied to explanted cochlea and is solely based on absorption contrast. An advantage of SLOT is that it uses visible light for image formation and thus provides a variety of contrast mechanisms known from other light microscopy techniques, such as fluorescence or scattering. We show that SLOT data is consistent with μCT anatomical data and provides additional information by using fluorescence. We demonstrate that SLOT is applicable for cochlea with metallic cochlear implants (CI) that would lead to significant artifacts in μCT imaging. In conclusion, the present study demonstrates the capability of SLOT for resolution visualization of cleared human cochleae ex vivo using multiple contrast mechanisms and lays the foundation for a broad variety of additional studies. PMID:28873437
NASA Astrophysics Data System (ADS)
Berdnik, S. L.; Katrich, V. A.; Nesterenko, M. V.; Penkin, Yu. M.
2016-09-01
Purpose: A problem of electromagnetic wave diffraction by a longitudinal slot cut in a waveguide wide wall is solved. The slot is cut in a wide wall of a rectangular waveguide and radiates in a half-space above a perfectly conducting plane where two vertical impedance monopoles with arbitrary lengths placed with their bases placed on the plane. The paper is aimed at studying the electrodynamic characteristics of vibratorwaveguide-slot structures which allow to form the emission fields as that in a Clavin element with two identical passive ideally conducting monopoles of a fixed length located on a set distance from a slot center on both sides of a narrow halfwave slot. Design/methodology/approach: The problem is solved by a generalized method of induced electromotive and magnetomotive forces in approximation of electric currents in the vibrators and equivalent magnetic current in the slot by the functions obtained by the asymptotic averaging method. Findings: The influence of geometric parameters of the structure on the directional characteristics of Clavin type element is analyzed on the assumption of simultaneous account for relative level of sidelobes in the E-plane and beamwidth differences at -3 dB level in the main planes. It is shown that the directional characteristics and energy characteristics of the radiators: radiation and reflection coefficients, antenna directivity and gain can be varied within wide limits by changing the electrical length and/or distributed surface impedances of the vibrators, providing at that a low level of radiation within a slot plane. Conclusions: The results obtained can be useful when designing both small-size and multi-element antenna arrays with Clavin elements.
Sustained eruptions on Enceladus explained by turbulent dissipation in tiger stripes
NASA Astrophysics Data System (ADS)
Kite, Edwin S.; Rubin, Allan M.
2016-04-01
Spacecraft observations suggest that the plumes of Saturn’s moon Enceladus draw water from a subsurface ocean, but the sustainability of conduits linking ocean and surface is not understood. Observations show eruptions from “tiger stripe” fissures that are sustained (although tidally modulated) throughout each orbit, and since the 2005 discovery of the plumes. Peak plume flux lags peak tidal extension by ˜1 rad, suggestive of resonance. Here, we show that a model of the tiger stripes as tidally flexed slots that puncture the ice shell can simultaneously explain the persistence of the eruptions through the tidal cycle, the phase lag, and the total power output of the tiger stripe terrain, while suggesting that eruptions are maintained over geological timescales. The delay associated with flushing and refilling of O(1)-m-wide slots with ocean water causes erupted flux to lag tidal forcing and helps to buttress slots against closure, while tidally pumped in-slot flow leads to heating and mechanical disruption that staves off slot freezeout. Much narrower and much wider slots cannot be sustained. In the presence of long-lived slots, the 106-y average power output of the tiger stripes is buffered by a feedback between ice melt-back and subsidence to O(1010) W, which is similar to observed power output, suggesting long-term stability. Turbulent dissipation makes testable predictions for the final flybys of Enceladus by Cassini. Our model shows how open connections to an ocean can be reconciled with, and sustain, long-lived eruptions. Turbulent dissipation in long-lived slots helps maintain the ocean against freezing, maintains access by future Enceladus missions to ocean materials, and is plausibly the major energy source for tiger stripe activity.
Flame-spreading phenomena in the fin-slot region of a solid rocket motor
NASA Astrophysics Data System (ADS)
Kuo, K. K.; Kokal, R. A.; Paulauskas, M.; Alaksin, P.; Lee, L. S.
1993-06-01
Flame-spreading processes in the fin-slot regions of solid-propellant motor grains have the potential to influence the behavior of the overall ignition transient. The work being done on this project is aimed at obtaining a better understanding of the flame-spreading processes in rocket motors with aft-end fin slots. Non-intrusive optical diagnostic methods were employed to acquire flame-spreading measurements in the fin-slot region of a subscale rocket motor. Highly non-uniform flame-spreading processes were observed in both the deep and shallow fin regions of the test rig. The average flame-spreading rates in the fin-slot region were found to be two orders of magnitude less than those in the circular port region of a typical rocket motor. The flame-spreading interval was found to correlate well with the local pressurization rates. A higher pressurization rate produces a shorter flame-spreading time interval.
NASA Astrophysics Data System (ADS)
Xu, Peifeng; Shi, Kai; Sun, Yuxin; Zhua, Huangqiu
2017-05-01
Dual rotor permanent magnet (DRPM) wind power generator using ferrite magnets has the advantages of low cost, high efficiency, and high torque density. How to further improve the performance and reduce the cost of the machine by proper choice of pole number and slot number is an important problem to be solved when performing preliminarily design a DRPM wind generator. This paper presents a comprehensive performance comparison of a DRPM wind generator using ferrite magnets with different slot and pole number combinations. The main winding factors are calculated by means of the star of slots. Under the same machine volume and ferrite consumption, the flux linkage, back-electromotive force (EMF), cogging torque, output torque, torque pulsation, and losses are investigated and compared using finite element analysis (FEA). The results show that the slot and pole number combinations have an important impact on the generator properties.
A hybrid electro-optic polymer and TiO2 double-slot waveguide modulator
Qiu, Feng; Spring, Andrew M.; Maeda, Daisuke; Ozawa, Masa-aki; Odoi, Keisuke; Otomo, Akira; Aoki, Isao; Yokoyama, Shiyoshi
2015-01-01
An electro-optic (EO) modulator using a TiO2 slot hybrid waveguide has been designed and fabricated. Optical mode calculations revealed that the mode was primarily confined within the slots when using a double-slot configuration, thus achieving a high EO activity experimentally. The TiO2 slots also acted as an important barrier to induce an enhanced DC field during the poling of the EO polymer and the driving of the EO modulator. The hybrid phase modulator exhibited a driving voltage (Vπ) of 1.6 V at 1550 nm, which can be further reduced to 0.8 V in a 1 cm-long push-pull Mach–Zehnder interferometer (MZI) structure. The modulator demonstrated a low propagation loss of 5 dB/cm and a relatively high end-fire coupling efficiency. PMID:25708425
Method and apparatus for staking optical elements
Woods, Robert O.
1988-01-01
A method and apparatus for staking two optical elements together in order to retain their alignment is disclosed. The apparatus includes a removable adaptor made up of first and second adaptor bodies each having a lateral slot in their front and side faces. The adaptor also includes a system for releasably attaching each adaptor body to a respective optical element such that when the two optical elements are positioned relative to one another the adaptor bodies are adjacent and the lateral slots therein are aligned to form key slots. The adaptor includes keys which are adapted to fit into the key slots. A curable filler material is employed to retain the keys in the key slots and thereby join the first and second adaptor bodies to form the adaptor. Also disclosed is a method for staking together two optical elements employing the adaptor of the present invention.
Method and apparatus for staking optical elements
Woods, Robert O.
1988-10-04
A method and apparatus for staking two optical elements together in order to retain their alignment is disclosed. The apparatus includes a removable adaptor made up of first and second adaptor bodies each having a lateral slot in their front and side faces. The adaptor also includes a system for releasably attaching each adaptor body to a respective optical element such that when the two optical elements are positioned relative to one another the adaptor bodies are adjacent and the lateral slots therein are aligned to form key slots. The adaptor includes keys which are adapted to fit into the key slots. A curable filler material is employed to retain the keys in the key slots and thereby join the first and second adaptor bodies to form the adaptor. Also disclosed is a method for staking together two optical elements employing the adaptor of the present invention.
Modeling of Slot Waveguide Sensors Based on Polymeric Materials
Bettotti, Paolo; Pitanti, Alessandro; Rigo, Eveline; De Leonardis, Francesco; Passaro, Vittorio M. N.; Pavesi, Lorenzo
2011-01-01
Slot waveguides are very promising for optical sensing applications because of their peculiar spatial mode profile. In this paper we have carried out a detailed analysis of mode confinement properties in slot waveguides realized in very low refractive index materials. We show that the sensitivity of a slot waveguide is not directly related to the refractive index contrast of high and low materials forming the waveguide. Thus, a careful design of the structures allows the realization of high sensitivity devices even in very low refractive index materials (e.g., polymers) to be achieved. Advantages of low index dielectrics in terms of cost, functionalization and ease of fabrication are discussed while keeping both CMOS compatibility and integrable design schemes. Finally, applications of low index slot waveguides as substitute of bulky fiber capillary sensors or in ring resonator architectures are addressed. Theoretical results of this work are relevant to well established polymer technologies. PMID:22164020
Study of Allocation Guaranteed Time Slot Wireless Body Area Networks Based on IEEE 802.15.4
NASA Astrophysics Data System (ADS)
Yundra, E.; Harsono, G. D.
2018-04-01
This paper aims to determine the size of the Guaranteed Time Slot (GTS) on the super frame structure required for each sensor as well as to know the performance of the GTS resized system compared to the GTS standard on IEEE 802.15.4. This article proposes a scheme to improve IEEE 802.15.4 medium access control, called allocation Guaranteed Time Slot (ALGATIS). ALGATIS is expected to effectively allocate guaranteed time slot to the requested sensors, it adjusts the length of the slot in super frame duration based on the length of the packet data. This article presents a simulation experiment of IEEE 802.15.4, especially for star network, to predict the throughput of networks and average energy consumption. The simulation experiments show that the performance of ALGATIS is better than that of IEEE 802.15.4 standard in term of the throughput of networks and average energy consumption
A Computer-Aided Approach for Designing Edge-Slot Waveguide Arrays
NASA Technical Reports Server (NTRS)
Gosselin, Renee Brian
2003-01-01
Traditional techniques for designing resonant edge-slot waveguide arrays have required an iterative trial-and-error process of measuring slot data from several prototypes. Since very little meaningful data has been published, this technology remains relatively immature and prohibitive for many smaller programs that could benefit from some advantages this antenna has to offer. A new Computer-Aided Design technique for designing resonant edge-slot waveguide arrays was used to successfuliy design such an X-band radiometer antenna for the NASA Light Rainfall Radiometer (LRR) instrument. Having the ability to rapidly create such an extremely accurate and efficient antenna design without the need to manufacture prototypes has also enabled inexpensive research that promises to improve the system-level performance of microwave radiometers for upcoming space-flight missions. This paper will present details of the LRR antenna design and describe some other current edge-slot array accomplishments at Goddard Space Flight Center.
Efficient finite element simulation of slot spirals, slot radomes and microwave structures
NASA Technical Reports Server (NTRS)
Gong, J.; Volakis, J. L.
1995-01-01
This progress report contains the following two documents: (1) 'Efficient Finite Element Simulation of Slot Antennas using Prismatic Elements' - A hybrid finite element-boundary integral (FE-BI) simulation technique is discussed to treat narrow slot antennas etched on a planar platform. Specifically, the prismatic elements are used to reduce the redundant sampling rates and ease the mesh generation process. Numerical results for an antenna slot and frequency selective surfaces are presented to demonstrate the validity and capability of the technique; and (2) 'Application and Design Guidelines of the PML Absorber for Finite Element Simulations of Microwave Packages' - The recently introduced perfectly matched layer (PML) uniaxial absorber for frequency domain finite element simulations has several advantages. In this paper we present the application of PML for microwave circuit simulations along with design guidelines to obtain a desired level of absorption. Different feeding techniques are also investigated for improved accuracy.
Dual optical mechanical position tracker
NASA Astrophysics Data System (ADS)
Everett, S. L., Jr.
1985-06-01
This patent application describes an apparatus for retaining control of moving carriage impact dot matrix print heads when subjected to strong external forces such as shock and/or vibration. Position and direction of carriage movement is provided by a photo emitter-sensor assembly and a slotted timing wheel or disc having a plurality of equally spaced slots whose slot width is equal to the slot separation. The slot width is sufficient to frame a pair of side-by-side emitters which operate in conjunction with a pair of side-by-side sensors on the other side of the timing wheel. The order or sequence in which the sensors receive photo energy from their respective emitters indicates the direction of rotation of the timing wheel while simultaneous reception of photo energy by the side-by-side sensors provides an indication of valid rest position of the carriage drive motor.
NASA Technical Reports Server (NTRS)
Zawadzki, Mark; Rengarajan, Sembiam; Hodges, Richard E.
2005-01-01
While the design of waveguide slot arrays in not new, this particular design effort shows that very good results can be achieved on a first attempt using established slot array design techniques and commercial software for the waveguide power divider network. The presentation will discuss this design process in detail.
NASA Astrophysics Data System (ADS)
Chu, Xiaowen; Li, Bo; Chlamtac, Imrich
2002-07-01
Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength conversion under the same RWA algorithm.
NASA Technical Reports Server (NTRS)
Gruyer, Nicolas; Lenoir, Nathalie
2003-01-01
The current allocation of slots on congested European airports constitutes an obstacle to the effective liberalisation of air transportation undertaken in Europe. With a view to favouring effluent slot utilisation and competition, as is the goal of the Euopean commission, we propose to use a market mechanism, based on temporary" utilisation licences. In order to allocate those licences, we propose and describe an iterated combinatorial auction mechanism where a percentage of licences would be reallocated each season. A secondary market would also be set up in order to reallocate slots during a season. Since a combinatorial auction involve a complex optimisation procedure, we describe how it can be made to work in the case of auctions.
Slotted Polyimide-Aerogel-Filled-Waveguide Arrays
NASA Technical Reports Server (NTRS)
Rodriguez-Solis, Rafael A.; Pacheco, Hector L.; Miranda, Felix A.; Meador, Mary Ann B.
2013-01-01
Polyimide aerogels were considered to serve as a filling for millimeter-wave waveguides. While these waveguides present a slightly higher loss than hollow waveguides, they have less losses than Duroid substrate integrated waveguides (less than 0.15 dB at Ka-band, in a 20 mm section), and exhibit an order of magnitude of mass reduction when compared to commercial waveguides. A Ka-band slotted aerogel-filled-waveguide array was designed, which provided the same gain (9 dBi) as its standard waveguide counterpart, and a slotted aerogel-filled-waveguide array using folded-slots was designed for comparison, obtaining a gain of 9 dB and a bandwidth of 590 MHz.
A Polarization Reconfigurable Slot Antenna with a Novel Switchable Feeding Network
NASA Astrophysics Data System (ADS)
Xie, Peng; Wang, Guang Ming
2017-12-01
A polarization reconfigurable slot antenna is proposed in this paper. The antenna consists of a microstrip line-to-slotline transition structure, two radiation slots and a switchable feeding network. The feeding network is a gradually changed ring slot with six switching diodes on it. By controlling the diodes states, the antenna can generate y-direction polarization, z-direction polarization, left-hand circular polarization and right-hand circular polarization. Detailed design considerations of the proposed antenna, simulated and measured results are presented and discussed. Measured results agree well with simulated. The results proved that the antenna can realize polarization reconfiguration effectively at 5 GHz.
High-Q silicon-on-insulator slot photonic crystal cavity infiltrated by a liquid
DOE Office of Scientific and Technical Information (OSTI.GOV)
Caër, Charles; Le Roux, Xavier; Cassan, Eric, E-mail: eric.cassan@u-psud.fr
We report the experimental realization of a high-Q slot photonic crystal cavity in Silicon-On-Insulator (SOI) configuration infiltrated by a liquid. Loaded Q-factor of 23 000 is measured at telecom wavelength. The intrinsic quality factor inferred from the transmission spectrum is higher than 200 000, which represents a record value for slot photonic crystal cavities on SOI, whereas the maximum of intensity of the cavity is roughly equal to 20% of the light transmitted in the waveguide. This result makes filled slot photonic crystal cavities very promising for silicon-based light emission and ultrafast nonlinear optics.
Current superimposition variable flux reluctance motor with 8 salient poles
NASA Astrophysics Data System (ADS)
Takahara, Kazuaki; Hirata, Katsuhiro; Niguchi, Noboru; Kohara, Akira
2017-12-01
We propose a current superimposition variable flux reluctance motor for a traction motor of electric vehicles and hybrid electric vehicles, which consists of 10 salient poles in the rotor and 12 slots in the stator. However, iron losses of this motor in high rotation speed ranges is large because the number of salient poles is large. In this paper, we propose a current superimposition variable flux reluctance motor that consists of 8 salient poles and 12 slots. The characteristics of the 10-pole-12-slot and 8-pole-12-slot current superimposition variable flux reluctance motors are compared using finite element analysis under vector control.
Perovskite solar cells in N-I-P structure with four slot-die-coated layers
Burkitt, Daniel; Searle, Justin
2018-01-01
The fabrication of perovskite solar cells in an N-I-P structure with compact titanium dioxide blocking, mesoporous titanium dioxide scaffold, single-step perovskite and hole-transport layers deposited using the slot-die coating technique is reported. Devices on fluorine-doped tin oxide-coated glass substrates with evaporated gold top contacts and four slot-die-coated layers are demonstrated, and best cells reach stabilized power conversion efficiencies of 7%. This work demonstrates the suitability of slot-die coating for the production of layers within this perovskite solar cell stack and the potential to transfer to large area and roll-to-roll manufacturing processes. PMID:29892402
NASA Astrophysics Data System (ADS)
Frerichs, Heinke; Schmitz, Oliver; Covele, Brent; Guo, Houyang; Hill, David; Feng, Yuhe
2017-10-01
In the Small Angle Slot (SAS) divertor in DIII-D, the combination of misaligned slot structure and non-axisymmetric perturbations to the magnetic field causes the strike point to vary radially along the divertor slot and even leave it at some toroidal locations. This effect essentially introduces an opening in the divertor slot from where recycling neutrals can easily escape, and thereby degrade performance of the slot divertor. This effect has been approximated by a finite gap in the divertor baffle. Simulations with EMC3-EIRENE show that a toroidally localized loss of divertor closure can result in non-axisymmetric divertor densities and temperatures. This introduces a density window of 10-15% on top of the nominal threshold separatrix density during which a non-axisymmetric onset of local detachment occurs, initially leaving the gap and up to 60 deg beyond that still attached. Conversely, the impact of such toroidally localized divertor perturbations on the toroidal symmetry of midplane separatrix conditions is small. This work has been funded by the U.S. Department of Energy under Early Career Award Grant DE-SC0013911, and Grant DE-FC02-04ER54698.
Japolla, Greice; Cunha-Junior, Jair Pereira; Pajuaba, Ana Claudia Arantes Marquez; Taketomi, Ernesto Akio; Bührer-Sékula, Samira; Bataus, Luiz Artur Mendes; de Souza, Guilherme Rocha Lino
2018-06-01
Bovine herpesvirus type 1 (BoHV-1) is recognized as an important pathogen causing respiratory, reproductive, and neurological disorders in cattle and is associated with economic losses to animal industry. Accurate diagnostic methods are needed for prevention of disease transmission. While the virus neutralization test is considered the gold standard method, it requires maintenance of the virus and cell cultures, which is time consuming and expensive. Serological techniques such as enzyme-linked immunosorbent assay (ELISA) are widely applied, as these are easy to perform and provide quick results. In the present study, a nanogold slot blot inhibition assay was developed for the serological diagnosis of BoHV-1 and compared with standard ELISA and horseradish peroxidase (HRP) slot blot assays. Of 42 serum samples tested by ELISA, 32 (76.2%) were positive and 10 (23.8%), were negative. The sensitivity and specificity of the nanogold slot blot inhibition assay was similar to that observed for ELISA and HRP slot blot assays, and a strong correlation was observed between the tests. Thus, the nanogold slot blot inhibition assay may serve as an efficient and rapid alternative to ELISA in settings, where plate-reading equipment is lacking.
Cadieux, Brigitte; Blanchfield, Burke; Smith, James P; Austin, John W
2005-05-01
A simple, rapid, cost-effective in vitro slot blot immunoassay was developed for the detection and quantification of botulinum neurotoxin type E (BoNT/E) in cultures. Culture supernatants of 36 strains of clostridia, including 12 strains of Clostridium botulinum type E, 12 strains of other C. botulinum neurotoxin serotypes, and 12 strains of other clostridial species were tested. Samples containing BoNT/E were detected using affinity-purified polyclonal rabbit antisera prepared against BoNT/E with subsequent detection of secondary antibodies using chemiluminescence. All strains of C. botulinum type E tested positive, while all non C. botulinum type E strains tested negative. The sensitivity of the slot blot immunoassay for detection of BoNT/E was approximately four mouse lethal doses (MLD). The intensity of chemiluminescence was directly correlated with the concentration of BoNT/E up to 128 MLD, allowing quantification of BoNT/E between 4 and 128 MLD. The slot blot immunoassay was compared to the mouse bioassay for detection of BoNT/E using cultures derived from fish samples inoculated with C. botulinum type E, and cultures derived from naturally contaminated environmental samples. A total of 120 primary enrichment cultures derived from fish samples, of which 103 were inoculated with C. botulinum type E, and 17 were uninoculated controls, were assayed. Of the 103 primary enrichment cultures derived from inoculated fish samples, all were positive by mouse bioassay, while 94 were also positive by slot blot immunoassay, resulting in a 7.5% false-negative rate. All 17 primary enrichment cultures derived from the uninoculated fish samples were negative by both mouse bioassay and slot blot immunoassay. A total of twenty-six primary enrichment cultures derived from environmental samples were tested by mouse bioassay and slot blot immunoassay. Of 13 primary enrichment cultures positive by mouse bioassay, 12 were also positive by slot blot immunoassay, resulting in a 3.8% false-negative rate. All 13 primary enrichment cultures that tested negative by mouse bioassay also tested negative by slot blot immunoassay. The slot blot immunoassay could be used routinely as a positive screen for BoNT/E in primary enrichment cultures, and could be used as a replacement for the mouse bioassay for pure cultures.
Reduced-rank technique for joint channel estimation in TD-SCDMA systems
NASA Astrophysics Data System (ADS)
Kamil Marzook, Ali; Ismail, Alyani; Mohd Ali, Borhanuddin; Sali, Adawati; Khatun, Sabira
2013-02-01
In time division-synchronous code division multiple access systems, increasing the system capacity by exploiting the inserting of the largest number of users in one time slot (TS) requires adding more estimation processes to estimate the joint channel matrix for the whole system. The increase in the number of channel parameters due the increase in the number of users in one TS directly affects the precision of the estimator's performance. This article presents a novel channel estimation with low complexity, which relies on reducing the rank order of the total channel matrix H. The proposed method exploits the rank deficiency of H to reduce the number of parameters that characterise this matrix. The adopted reduced-rank technique is based on truncated singular value decomposition algorithm. The algorithms for reduced-rank joint channel estimation (JCE) are derived and compared against traditional full-rank JCEs: least squares (LS) or Steiner and enhanced (LS or MMSE) algorithms. Simulation results of the normalised mean square error showed the superiority of reduced-rank estimators. In addition, the channel impulse responses founded by reduced-rank estimator for all active users offers considerable performance improvement over the conventional estimator along the channel window length.
Approximate dynamic programming approaches for appointment scheduling with patient preferences.
Li, Xin; Wang, Jin; Fung, Richard Y K
2018-04-01
During the appointment booking process in out-patient departments, the level of patient satisfaction can be affected by whether or not their preferences can be met, including the choice of physicians and preferred time slot. In addition, because the appointments are sequential, considering future possible requests is also necessary for a successful appointment system. This paper proposes a Markov decision process model for optimizing the scheduling of sequential appointments with patient preferences. In contrast to existing models, the evaluation of a booking decision in this model focuses on the extent to which preferences are satisfied. Characteristics of the model are analysed to develop a system for formulating booking policies. Based on these characteristics, two types of approximate dynamic programming algorithms are developed to avoid the curse of dimensionality. Experimental results suggest directions for further fine-tuning of the model, as well as improving the efficiency of the two proposed algorithms. Copyright © 2018 Elsevier B.V. All rights reserved.
Discrete-Slots Models of Visual Working-Memory Response Times
Donkin, Christopher; Nosofsky, Robert M.; Gold, Jason M.; Shiffrin, Richard M.
2014-01-01
Much recent research has aimed to establish whether visual working memory (WM) is better characterized by a limited number of discrete all-or-none slots or by a continuous sharing of memory resources. To date, however, researchers have not considered the response-time (RT) predictions of discrete-slots versus shared-resources models. To complement the past research in this field, we formalize a family of mixed-state, discrete-slots models for explaining choice and RTs in tasks of visual WM change detection. In the tasks under investigation, a small set of visual items is presented, followed by a test item in 1 of the studied positions for which a change judgment must be made. According to the models, if the studied item in that position is retained in 1 of the discrete slots, then a memory-based evidence-accumulation process determines the choice and the RT; if the studied item in that position is missing, then a guessing-based accumulation process operates. Observed RT distributions are therefore theorized to arise as probabilistic mixtures of the memory-based and guessing distributions. We formalize an analogous set of continuous shared-resources models. The model classes are tested on individual subjects with both qualitative contrasts and quantitative fits to RT-distribution data. The discrete-slots models provide much better qualitative and quantitative accounts of the RT and choice data than do the shared-resources models, although there is some evidence for “slots plus resources” when memory set size is very small. PMID:24015956
Takei, Yuichiro; Katsuta, Hiroki; Takizawa, Kenichi; Ikegami, Tetsushi; Hamaguchi, Kiyoshi
2012-01-01
This paper presents an experimental evaluation of communication during human walking motion, using the medium access control (MAC) evaluation system for a prototype ultra-wideband (UWB) based wireless body area network for suitable MAC parameter settings for data transmission. Its physical layer and MAC specifications are based on the draft standard in IEEE802.15.6. This paper studies the effects of the number of retransmissions and the number of commands of GTS (guaranteed time slot) request packets in the CAP (contention access period) during human walking motion by varying the number of sensor nodes or the number of CFP (contention free period) slots in the superframe. The experiments were performed in an anechoic chamber. The number of packets received is decreased by packet loss caused by human walking motion in the case where 2 slots are set for CFP, regardless of the number of nodes, and this materially decreases the total number of packets received. The number of retransmissions and the GTS request commands increase according to increases in the number of nodes, largely reflecting the effects of the number of CFP slots in the case where 4 nodes are attached. In the cases where 2 or 3 nodes are attached and 4 slots are set for CFP, the packet transmission rate is more than 95%. In the case where 4 nodes are attached and 6 slots are set for CFP, the packet transmission rate is reduced to 88% at best.
Three-dimensional imaging of intracochlear tissue by scanning laser optical tomography (SLOT)
NASA Astrophysics Data System (ADS)
Tinne, N.; Nolte, L.; Antonopoulos, G. C.; Schulze, J.; Andrade, J.; Heisterkamp, A.; Meyer, H.; Warnecke, A.; Majdani, O.; Ripken, T.
2016-02-01
The presented study focuses on the application of scanning laser optical tomography (SLOT) for non-destructive visualization of anatomical structures inside the human cochlea ex vivo. SLOT is a laser-based highly efficient microscopy technique, which allows for tomographic imaging of the internal structure of transparent large-scale specimens (up to 1 cm3). Thus, in the field of otology this technique is best convenient for an ex vivo study of the inner ear anatomy. For this purpose, the preparation before imaging comprises mechanically assisted decalcification, dehydration as well as optical clearing of the cochlea samples. Here, we demonstrate results of SLOT visualizing hard and soft tissue structures of the human cochlea with an optical resolution in the micrometer range using absorption and autofluorescence as contrast mechanisms. Furthermore, we compare our results with the method of X-ray micro tomography (micro-CT, μCT) as clinical gold standard which is based only on absorption. In general, SLOT can provide the advantage of covering all contrast mechanisms known from other light microscopy techniques, such as fluorescence or scattering. For this reason, a protocol for antibody staining has been developed, which additionally enables selective mapping of cellular structures within the cochlea. Thus, we present results of SLOT imaging rodent cochleae showing specific anatomical structures such as hair cells and neurofilament via fluorescence. In conclusion, the presented study has shown that SLOT is an ideally suited tool in the field of otology for in toto visualization of the inner ear microstructure.
Zhang, Xuejun; Lei, Jiaxing
2015-01-01
Considering reducing the airspace congestion and the flight delay simultaneously, this paper formulates the airway network flow assignment (ANFA) problem as a multiobjective optimization model and presents a new multiobjective optimization framework to solve it. Firstly, an effective multi-island parallel evolution algorithm with multiple evolution populations is employed to improve the optimization capability. Secondly, the nondominated sorting genetic algorithm II is applied for each population. In addition, a cooperative coevolution algorithm is adapted to divide the ANFA problem into several low-dimensional biobjective optimization problems which are easier to deal with. Finally, in order to maintain the diversity of solutions and to avoid prematurity, a dynamic adjustment operator based on solution congestion degree is specifically designed for the ANFA problem. Simulation results using the real traffic data from China air route network and daily flight plans demonstrate that the proposed approach can improve the solution quality effectively, showing superiority to the existing approaches such as the multiobjective genetic algorithm, the well-known multiobjective evolutionary algorithm based on decomposition, and a cooperative coevolution multiobjective algorithm as well as other parallel evolution algorithms with different migration topology. PMID:26180840
Administrative Data Algorithms Can Describe Ambulatory Physician Utilization
Shah, Baiju R; Hux, Janet E; Laupacis, Andreas; Zinman, Bernard; Cauch-Dudek, Karen; Booth, Gillian L
2007-01-01
Objective To validate algorithms using administrative data that characterize ambulatory physician care for patients with a chronic disease. Data Sources Seven-hundred and eighty-one people with diabetes were recruited mostly from community pharmacies to complete a written questionnaire about their physician utilization in 2002. These data were linked with administrative databases detailing health service utilization. Study Design An administrative data algorithm was defined that identified whether or not patients received specialist care, and it was tested for agreement with self-report. Other algorithms, which assigned each patient to a primary care and specialist physician, were tested for concordance with self-reported regular providers of care. Principal Findings The algorithm to identify whether participants received specialist care had 80.4 percent agreement with questionnaire responses (κ = 0.59). Compared with self-report, administrative data had a sensitivity of 68.9 percent and specificity 88.3 percent for identifying specialist care. The best administrative data algorithm to assign each participant's regular primary care and specialist providers was concordant with self-report in 82.6 and 78.2 percent of cases, respectively. Conclusions Administrative data algorithms can accurately match self-reported ambulatory physician utilization. PMID:17610448
Two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images.
He, Lifeng; Chao, Yuyan; Suzuki, Kenji
2011-08-01
Whenever one wants to distinguish, recognize, and/or measure objects (connected components) in binary images, labeling is required. This paper presents two efficient label-equivalence-based connected-component labeling algorithms for 3-D binary images. One is voxel based and the other is run based. For the voxel-based one, we present an efficient method of deciding the order for checking voxels in the mask. For the run-based one, instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our voxel-based algorithm is efficient for 3-D binary images with complicated connected components, that our run-based one is efficient for those with simple connected components, and that both are much more efficient than conventional 3-D labeling algorithms.
Dessimoz, Christophe; Boeckmann, Brigitte; Roth, Alexander C J; Gonnet, Gaston H
2006-01-01
Correct orthology assignment is a critical prerequisite of numerous comparative genomics procedures, such as function prediction, construction of phylogenetic species trees and genome rearrangement analysis. We present an algorithm for the detection of non-orthologs that arise by mistake in current orthology classification methods based on genome-specific best hits, such as the COGs database. The algorithm works with pairwise distance estimates, rather than computationally expensive and error-prone tree-building methods. The accuracy of the algorithm is evaluated through verification of the distribution of predicted cases, case-by-case phylogenetic analysis and comparisons with predictions from other projects using independent methods. Our results show that a very significant fraction of the COG groups include non-orthologs: using conservative parameters, the algorithm detects non-orthology in a third of all COG groups. Consequently, sequence analysis sensitive to correct orthology assignments will greatly benefit from these findings.
NASA Astrophysics Data System (ADS)
Zhao, Jijun; Zhang, Nawa; Ren, Danping; Hu, Jinhua
2017-12-01
The recently proposed flexible optical network can provide more efficient accommodation of multiple data rates than the current wavelength-routed optical networks. Meanwhile, the energy efficiency has also been a hot topic because of the serious energy consumption problem. In this paper, the energy efficiency problem of flexible optical networks with physical-layer impairments constraint is studied. We propose a combined impairment-aware and energy-efficient routing and spectrum assignment (RSA) algorithm based on the link availability, in which the impact of power consumption minimization on signal quality is considered. By applying the proposed algorithm, the connection requests are established on a subset of network topology, reducing the number of transitions from sleep to active state. The simulation results demonstrate that our proposed algorithm can improve the energy efficiency and spectrum resources utilization with the acceptable blocking probability and average delay.
Relabeling exchange method (REM) for learning in neural networks
NASA Astrophysics Data System (ADS)
Wu, Wen; Mammone, Richard J.
1994-02-01
The supervised training of neural networks require the use of output labels which are usually arbitrarily assigned. In this paper it is shown that there is a significant difference in the rms error of learning when `optimal' label assignment schemes are used. We have investigated two efficient random search algorithms to solve the relabeling problem: the simulated annealing and the genetic algorithm. However, we found them to be computationally expensive. Therefore we shall introduce a new heuristic algorithm called the Relabeling Exchange Method (REM) which is computationally more attractive and produces optimal performance. REM has been used to organize the optimal structure for multi-layered perceptrons and neural tree networks. The method is a general one and can be implemented as a modification to standard training algorithms. The motivation of the new relabeling strategy is based on the present interpretation of dyslexia as an encoding problem.
Array distribution in data-parallel programs
NASA Technical Reports Server (NTRS)
Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert; Sheffler, Thomas J.
1994-01-01
We consider distribution at compile time of the array data in a distributed-memory implementation of a data-parallel program written in a language like Fortran 90. We allow dynamic redistribution of data and define a heuristic algorithmic framework that chooses distribution parameters to minimize an estimate of program completion time. We represent the program as an alignment-distribution graph. We propose a divide-and-conquer algorithm for distribution that initially assigns a common distribution to each node of the graph and successively refines this assignment, taking computation, realignment, and redistribution costs into account. We explain how to estimate the effect of distribution on computation cost and how to choose a candidate set of distributions. We present the results of an implementation of our algorithms on several test problems.
Tolić, Nikola; Liu, Yina; Liyu, Andrey; Shen, Yufeng; Tfaily, Malak M; Kujawinski, Elizabeth B; Longnecker, Krista; Kuo, Li-Jung; Robinson, Errol W; Paša-Tolić, Ljiljana; Hess, Nancy J
2017-12-05
Ultrahigh resolution mass spectrometry, such as Fourier transform ion cyclotron resonance mass spectrometry (FT ICR MS), can resolve thousands of molecular ions in complex organic matrices. A Compound Identification Algorithm (CIA) was previously developed for automated elemental formula assignment for natural organic matter (NOM). In this work, we describe software Formularity with a user-friendly interface for CIA function and newly developed search function Isotopic Pattern Algorithm (IPA). While CIA assigns elemental formulas for compounds containing C, H, O, N, S, and P, IPA is capable of assigning formulas for compounds containing other elements. We used halogenated organic compounds (HOC), a chemical class that is ubiquitous in nature as well as anthropogenic systems, as an example to demonstrate the capability of Formularity with IPA. A HOC standard mix was used to evaluate the identification confidence of IPA. Tap water and HOC spike in Suwannee River NOM were used to assess HOC identification in complex environmental samples. Strategies for reconciliation of CIA and IPA assignments were discussed. Software and sample databases with documentation are freely available.
Theoretical and Experimental Methods in the Solution of Missile Nonlinear Roll Problems
1978-03-01
OF ILLUSTRATIONS (Continued) 34 Typical Effect of Slot on Induced Rolling Moment .............. 35 35 Effect of Slot on Amplitude of Induced Rolling...Characteristics of Slotted Fill Vehicle .............. 40 41 Effects of Fin Configuration on Stability ..................... 41 42 Release Envelope...missiles depended strongly upon roll rate. The concept of Magnus instability had been developed earlier from the linear theory of missile dynamics, and
Creating New Child Care Slots in Mini Child Care Centers: Big Bang for the Buck in New Jersey.
ERIC Educational Resources Information Center
Frankel, Arthur J.; And Others
1992-01-01
Small grants of $7,500 with technical assistance were offered to the child care community of New Jersey to either start or increase licensed capacity in mini-child care centers. Results of a subsequent analysis showed that 26 grantees created 481 new child care slots at an average cost of $561 per slot. (Author/SM)
A dual-slot microwave antenna for more spherical ablation zones: ex vivo and in vivo validation.
Chiang, Jason; Hynes, Kieran A; Bedoya, Mariajose; Brace, Christopher L
2013-08-01
To compare the performance of a microwave antenna design with two annular slots to that of a monopole antenna design in creating a more spherical ablation zone. Animal care and use committee approval was obtained before in vivo experiments were performed. Microwave ablation zones were created by using dual-slot and monopole control antennas for 2, 5, and 10 minutes at 50 and 100 W in ex vivo bovine livers. Dual-slot and monopole antennas were then used to create ablation zones at 100 W for 5 minutes in in vivo porcine livers, which also underwent intraprocedural imaging. Ablation diameter, length, and aspect ratio (diameter ÷ length) were measured at gross pathologic examination and compared at each combination of power and time by using the paired Student t test. A P value less than .05 was considered to indicate a significant difference. Aspect ratios closer to 1 reflected a more spherical ablation zone. The dual-slot antenna created ablation zones with a higher aspect ratio at 50 W for 2 minutes (0.75 vs 0.53, P = .003) and 5 minutes (0.82 vs 0.63, P = .053) than did the monopole antenna in ex vivo liver tissue, although the difference was only significant at 2 minutes. At 100 W, the dual-slot antenna had a significantly higher aspect ratio at 2 minutes (0.52 vs 0.42, P = .002). In vivo studies showed significantly higher aspect ratios at 100 W for 5 minutes (0.63 vs 0.53, respectively, P = .029). Intraprocedural imaging confirmed this characterization, showing higher rates of ablation zone growth and heating primarily at the early stages of the ablation procedure when the dual-slot antenna was used. The dual-slot microwave antenna created a more spherical ablation zone than did the monopole antenna both in vivo and ex vivo liver tissue. Greater control over power delivery can potentially extend the advantages of the dual-slot antenna design to higher power and longer treatment times.
A suggested periodic table up to Z≤ 172, based on Dirac-Fock calculations on atoms and ions.
Pyykkö, Pekka
2011-01-07
Extended Average Level (EAL) Dirac-Fock calculations on atoms and ions agree with earlier work in that a rough shell-filling order for the elements 119-172 is 8s < 5g≤ 8p(1/2) < 6f < 7d < 9s < 9p(1/2) < 8p(3/2). The present Periodic Table develops further that of Fricke, Greiner and Waber [Theor. Chim. Acta 1971, 21, 235] by formally assigning the elements 121-164 to (nlj) slots on the basis of the electron configurations of their ions. Simple estimates are made for likely maximum oxidation states, i, of these elements M in their MX(i) compounds, such as i = 6 for UF(6). Particularly high i are predicted for the 6f elements.
Taboo search algorithm for item assignment in synchronized zone automated order picking system
NASA Astrophysics Data System (ADS)
Wu, Yingying; Wu, Yaohua
2014-07-01
The idle time which is part of the order fulfillment time is decided by the number of items in the zone; therefore the item assignment method affects the picking efficiency. Whereas previous studies only focus on the balance of number of kinds of items between different zones but not the number of items and the idle time in each zone. In this paper, an idle factor is proposed to measure the idle time exactly. The idle factor is proven to obey the same vary trend with the idle time, so the object of this problem can be simplified from minimizing idle time to minimizing idle factor. Based on this, the model of item assignment problem in synchronized zone automated order picking system is built. The model is a form of relaxation of parallel machine scheduling problem which had been proven to be NP-complete. To solve the model, a taboo search algorithm is proposed. The main idea of the algorithm is minimizing the greatest idle factor of zones with the 2-exchange algorithm. Finally, the simulation which applies the data collected from a tobacco distribution center is conducted to evaluate the performance of the algorithm. The result verifies the model and shows the algorithm can do a steady work to reduce idle time and the idle time can be reduced by 45.63% on average. This research proposed an approach to measure the idle time in synchronized zone automated order picking system. The approach can improve the picking efficiency significantly and can be seen as theoretical basis when optimizing the synchronized automated order picking systems.
NASA Technical Reports Server (NTRS)
Sharpe, L., Jr.
1987-01-01
A 12.5 degree half cone with tangential slot injection at Mach 6.95 was studied to determine the heating rates to the surface of the body near and far downstream of the slot. The cone had a zero degree angle of attack. The heating rates were obtained using a computer program that was developed at NASA-Langley Research Center. The concentration of nitrogen from the slot into the boundary layer was also determined. The ratio of slot to freestream was varied to determine its effect on heating. The numerical heating rates were compared to other correlations obtained from experimental studies as well as theoretical laminar and turbulent results.
A Critical Review on Slotted Design for Propellers
NASA Astrophysics Data System (ADS)
Seeni, A.; Rajendran, P.; Kutty, H. A.
2018-05-01
The usage of slots has gained renewed interest in aerospace particularly on propeller design. Most of the works have focused on improving the aerodynamic performance and efficiency. Modern research on propeller design aims to design propellers with high thrust performance under low torque conditions without any weight penalty. This paper aims to review recent studies made in slotted designs of aerospace structures as well as other applications such as wind turbines. A review on the usage of slots is performed in order to understand the state-of-the-art in current technology. A review of the various studies has been made and general recommendations are provided in order to perform future research in propeller design.
Method and apparatus for assembling permanent magnet rotors
Hsu, J.S.; Adams, D.J.
1999-06-22
A permanent magnet assembly for assembly in large permanent magnet motors and generators includes a two-piece carrier that can be slid into a slot in the rotor and then secured in place using a set screw. The invention also provides an auxiliary carrier device with guide rails that line up with the teeth of the rotor, so that a permanent magnet assembly can be pushed first into a slot, and then down the slot to its proper location. An auxiliary tool is provided to move the permanent magnet assembly into position in the slot before it is secured in place. Methods of assembling and disassembling the magnet assemblies in the rotor are also disclosed. 2 figs.
Novel Dynamic Framed-Slotted ALOHA Using Litmus Slots in RFID Systems
NASA Astrophysics Data System (ADS)
Yim, Soon-Bin; Park, Jongho; Lee, Tae-Jin
Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular protocols to resolve tag collisions in RFID systems. In DFSA, it is widely known that the optimal performance is achieved when the frame size is equal to the number of tags. So, a reader dynamically adjusts the next frame size according to the current number of tags. Thus it is important to estimate the number of tags exactly. In this paper, we propose a novel tag estimation and identification method using litmus (test) slots for DFSA. We compare the performance of the proposed method with those of existing methods by analysis. We conduct simulations and show that our scheme improves the speed of tag identification.
Kinetic theory analysis of rarefied gas flow through finite length slots
NASA Technical Reports Server (NTRS)
Raghuraman, P.
1972-01-01
An analytic study is made of the flow a rarefied monatomic gas through a two dimensional slot. The parameters of the problem are the ratios of downstream to upstream pressures, the Knudsen number at the high pressure end (based on slot half width) and the length to slot half width ratio. A moment method of solution is used by assuming a discontinuous distribution function consisting of four Maxwellians split equally in angular space. Numerical solutions are obtained for the resulting equations. The characteristics of the transition regime are portrayed. The solutions in the free molecule limit are systematically lower than the results obtained in that limit by more accurate numerical methods.
Parallel Processing of Broad-Band PPM Signals
NASA Technical Reports Server (NTRS)
Gray, Andrew; Kang, Edward; Lay, Norman; Vilnrotter, Victor; Srinivasan, Meera; Lee, Clement
2010-01-01
A parallel-processing algorithm and a hardware architecture to implement the algorithm have been devised for timeslot synchronization in the reception of pulse-position-modulated (PPM) optical or radio signals. As in the cases of some prior algorithms and architectures for parallel, discrete-time, digital processing of signals other than PPM, an incoming broadband signal is divided into multiple parallel narrower-band signals by means of sub-sampling and filtering. The number of parallel streams is chosen so that the frequency content of the narrower-band signals is low enough to enable processing by relatively-low speed complementary metal oxide semiconductor (CMOS) electronic circuitry. The algorithm and architecture are intended to satisfy requirements for time-varying time-slot synchronization and post-detection filtering, with correction of timing errors independent of estimation of timing errors. They are also intended to afford flexibility for dynamic reconfiguration and upgrading. The architecture is implemented in a reconfigurable CMOS processor in the form of a field-programmable gate array. The algorithm and its hardware implementation incorporate three separate time-varying filter banks for three distinct functions: correction of sub-sample timing errors, post-detection filtering, and post-detection estimation of timing errors. The design of the filter bank for correction of timing errors, the method of estimating timing errors, and the design of a feedback-loop filter are governed by a host of parameters, the most critical one, with regard to processing very broadband signals with CMOS hardware, being the number of parallel streams (equivalently, the rate-reduction parameter).
Predictive Cache Modeling and Analysis
2011-11-01
metaheuristic /bin-packing algorithm to optimize task placement based on task communication characterization. Our previous work on task allocation showed...Cache Miss Minimization Technology To efficiently explore combinations and discover nearly-optimal task-assignment algorithms , we extended to our...it was possible to use our algorithmic techniques to decrease network bandwidth consumption by ~25%. In this effort, we adapted these existing
Guidance and control of swarms of spacecraft
NASA Astrophysics Data System (ADS)
Morgan, Daniel James
There has been considerable interest in formation flying spacecraft due to their potential to perform certain tasks at a cheaper cost than monolithic spacecraft. Formation flying enables the use of smaller, cheaper spacecraft that distribute the risk of the mission. Recently, the ideas of formation flying have been extended to spacecraft swarms made up of hundreds to thousands of 100-gram-class spacecraft known as femtosatellites. The large number of spacecraft and limited capabilities of each individual spacecraft present a significant challenge in guidance, navigation, and control. This dissertation deals with the guidance and control algorithms required to enable the flight of spacecraft swarms. The algorithms developed in this dissertation are focused on achieving two main goals: swarm keeping and swarm reconfiguration. The objectives of swarm keeping are to maintain bounded relative distances between spacecraft, prevent collisions between spacecraft, and minimize the propellant used by each spacecraft. Swarm reconfiguration requires the transfer of the swarm to a specific shape. Like with swarm keeping, minimizing the propellant used and preventing collisions are the main objectives. Additionally, the algorithms required for swarm keeping and swarm reconfiguration should be decentralized with respect to communication and computation so that they can be implemented on femtosats, which have limited hardware capabilities. The algorithms developed in this dissertation are concerned with swarms located in low Earth orbit. In these orbits, Earth oblateness and atmospheric drag have a significant effect on the relative motion of the swarm. The complicated dynamic environment of low Earth orbits further complicates the swarm-keeping and swarm-reconfiguration problems. To better develop and test these algorithms, a nonlinear, relative dynamic model with J2 and drag perturbations is developed. This model is used throughout this dissertation to validate the algorithms using computer simulations. The swarm-keeping problem can be solved by placing the spacecraft on J2-invariant relative orbits, which prevent collisions and minimize the drift of the swarm over hundreds of orbits using a single burn. These orbits are achieved by energy matching the spacecraft to the reference orbit. Additionally, these conditions can be repeatedly applied to minimize the drift of the swarm when atmospheric drag has a large effect (orbits with an altitude under 500 km). The swarm reconfiguration is achieved using two steps: trajectory optimization and assignment. The trajectory optimization problem can be written as a nonlinear, optimal control problem. This optimal control problem is discretized, decoupled, and convexified so that the individual femtosats can efficiently solve the optimization. Sequential convex programming is used to generate the control sequences and trajectories required to safely and efficiently transfer a spacecraft from one position to another. The sequence of trajectories is shown to converge to a Karush-Kuhn-Tucker point of the nonconvex problem. In the case where many of the spacecraft are interchangeable, a variable-swarm, distributed auction algorithm is used to determine the assignment of spacecraft to target positions. This auction algorithm requires only local communication and all of the bidding parameters are stored locally. The assignment generated using this auction algorithm is shown to be near optimal and to converge in a finite number of bids. Additionally, the bidding process is used to modify the number of targets used in the assignment so that the reconfiguration can be achieved even when there is a disconnected communication network or a significant loss of agents. Once the assignment is achieved, the trajectory optimization can be run using the terminal positions determined by the auction algorithm. To implement these algorithms in real time a model predictive control formulation is used. Model predictive control uses a finite horizon to apply the most up-to-date control sequence while simultaneously calculating a new assignment and trajectory based on updated state information. Using a finite horizon allows collisions to only be considered between spacecraft that are near each other at the current time. This relaxes the all-to-all communication assumption so that only neighboring agents need to communicate. Experimental validation is done using the formation flying testbed. The swarm-reconfiguration algorithms are tested using multiple quadrotors. Experiments have been performed using sequential convex programming for offline trajectory planning, model predictive control and sequential convex programming for real-time trajectory generation, and the variable-swarm, distributed auction algorithm for optimal assignment. These experiments show that the swarm-reconfiguration algorithms can be implemented in real time using actual hardware. In general, this dissertation presents guidance and control algorithms that maintain and reconfigure swarms of spacecraft while maintaining the shape of the swarm, preventing collisions between the spacecraft, and minimizing the amount of propellant used.
Process and apparatus for separation of components of a gas stream
Bryan, Charles R.; Torczynski, John R.; Brady, Patrick V.; Gallis, Michail; Brooks, Carlton F.
2014-06-17
A process and apparatus for separating a gas mixture comprising providing a slot in a gas separation channel (conceptualized as a laterally elongated Clusius-Dickel column), having a length through which a net cross-flow of the gas mixture may be established; applying a higher temperature to one side of the channel and a lower temperature on an opposite side of the channel thereby causing thermal-diffusion and buoyant-convection flow to occur in the slot; and establishing a net cross-flow of a gas mixture comprising at least one higher density gas component and at least one lower density gas component along the length of the slot, wherein the cross-flow causes, in combination with the convection flow, a spiraling flow in the slot; and wherein the spiral flow causes an increasing amount of separation of the higher density gas from the lower density gas along the length of the channel. The process may use one or more slots and/or channels.
Process and apparatus for separation of components of a gas stream
Bryan, Charles R; Torczynski, John R; Brady, Patrick V; Gallis, Michail; Brooks, Carlton F
2013-09-17
A process and apparatus for separating a gas mixture comprising providing a slot in a gas separation channel (conceptualized as a laterally elongated Clusius-Dickel column), having a length through which a net cross-flow of the gas mixture may be established; applying a higher temperature to one side of the channel and a lower temperature on an opposite side of the channel thereby causing thermal-diffusion and buoyant-convection flow to occur in the slot; and establishing a net cross-flow of a gas mixture comprising at least one higher density gas component and at least one lower density gas component along the length of the slot, wherein the cross-flow causes, in combination with the convection flow, a spiraling flow in the slot; and wherein the spiral flow causes an increasing amount of separation of the higher density gas from the lower density gas along the length of the channel. The process may use one or more slots and/or channels.
Process and apparatus for separation of components of a gas stream
Bryan, Charles R; Torczynski, John R; Brady, Patrick V; Gallis, Michail; Brooks, Carlton F
2013-11-19
A process and apparatus for separating a gas mixture comprising providing a slot in a gas separation channel (conceptualized as a laterally elongated Clusius-Dickel column), having a length through which a net cross-flow of the gas mixture may be established; applying a higher temperature to one side of the channel and a lower temperature on an opposite side of the channel thereby causing thermal-diffusion and buoyant-convection flow to occur in the slot; and establishing a net cross-flow of a gas mixture comprising at least one higher density gas component and at least one lower density gas component along the length of the slot, wherein the cross-flow causes, in combination with the convection flow, a spiraling flow in the slot; and wherein the spiral flow causes an increasing amount of separation of the higher density gas from the lower density gas along the length of the channel. The process may use one or more slots and/or channels.
Optimal Shape Design of Mail-Slot Nacelle on N3-X Hybrid Wing-Body Configuration
NASA Technical Reports Server (NTRS)
Kim, Hyoungjin; Liou, Meng-Sing
2013-01-01
System studies show that a N3-X hybrid wing-body aircraft with a turboelectric distributed propulsion system using a mail-slot inlet/nozzle nacelle can meet the environmental and performance goals for N+3 generation transports (three generations beyond the current air transport technology level) set by NASA's Subsonic Fixed Wing Project. In this study, a Navier-Stokes flow simulation of N3-X on hybrid unstructured meshes was conducted, including the mail-slot propulsor. The geometry of the mail-slot propulsor was generated by a CAD (Computer-Aided Design)-free shape parameterization. A novel body force model generation approach was suggested for a more realistic and efficient simulation of the flow turning, pressure rise and loss effects of the fan blades and the inlet-fan interactions. Flow simulation results of the N3-X demonstrates the validity of the present approach. An optimal Shape design of the mail-slot nacelle surface was conducted to reduce strength of shock waves and flow separations on the cowl surface.
Numerical analysis of tangential slot blowing on a generic chined forebody
NASA Technical Reports Server (NTRS)
Agosta, Roxana M.
1994-01-01
A numerical study is performed to investigate the effects of tangential slot blowing on a generic chined forebody. The Reynolds-averaged, thin-layer, Navier-Stokes equations are solved to obtain the high-angle-of-attack viscous flow field about a generic chined forebody. Tangential slot blowing is investigated as a means of forebody flow control to generate side force and yawing moment on the forebody. The effects of jet mass flow ratios, angle of attack, and blowing slot location in the axial and circumferential directions are studied. The computed results are compared with available wind tunnel experimental data. The solutions with and without blowing are also analyzed using helicity density contours, surface flow patterns, and off-surface instantaneous streamlines. The results of this analysis provide details of the flow field about the generic chined forebody, as well as show that tangential slot blowing can be used as a means of forebody flow control to generate side force and yawing moment.
Computational analysis of forebody tangential slot blowing
NASA Technical Reports Server (NTRS)
Gee, Ken; Agosta-Greenman, Roxana M.; Rizk, Yehia M.; Schiff, Lewis B.; Cummings, Russell M.
1994-01-01
An overview of the computational effort to analyze forebody tangential slot blowing is presented. Tangential slot blowing generates side force and yawing moment which may be used to control an aircraft flying at high-angle-of-attack. Two different geometries are used in the analysis: (1) The High Alpha Research Vehicle; and (2) a generic chined forebody. Computations using the isolated F/A-18 forebody are obtained at full-scale wind tunnel test conditions for direct comparison with available experimental data. The effects of over- and under-blowing on force and moment production are analyzed. Time-accurate solutions using the isolated forebody are obtained to study the force onset timelag of tangential slot blowing. Computations using the generic chined forebody are obtained at experimental wind tunnel conditions, and the results compared with available experimental data. This computational analysis compliments the experimental results and provides a detailed understanding of the effects of tangential slot blowing on the flow field about simple and complex geometries.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Weigend, Florian, E-mail: florian.weigend@kit.edu
2014-10-07
Energy surfaces of metal clusters usually show a large variety of local minima. For homo-metallic species the energetically lowest can be found reliably with genetic algorithms, in combination with density functional theory without system-specific parameters. For mixed-metallic clusters this is much more difficult, as for a given arrangement of nuclei one has to find additionally the best of many possibilities of assigning different metal types to the individual positions. In the framework of electronic structure methods this second issue is treatable at comparably low cost at least for elements with similar atomic number by means of first-order perturbation theory, asmore » shown previously [F. Weigend, C. Schrodt, and R. Ahlrichs, J. Chem. Phys. 121, 10380 (2004)]. In the present contribution the extension of a genetic algorithm with the re-assignment of atom types to atom sites is proposed and tested for the search of the global minima of PtHf{sub 12} and [LaPb{sub 7}Bi{sub 7}]{sup 4−}. For both cases the (putative) global minimum is reliably found with the extended technique, which is not the case for the “pure” genetic algorithm.« less
Quantum annealing for combinatorial clustering
NASA Astrophysics Data System (ADS)
Kumar, Vaibhaw; Bass, Gideon; Tomlin, Casey; Dulny, Joseph
2018-02-01
Clustering is a powerful machine learning technique that groups "similar" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum; however, the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small datasets. In order to circumvent this issue, cost function minima are found using popular local search-based heuristic approaches such as k-means and hierarchical clustering. Due to their greedy nature, such techniques do not guarantee that a global minimum will be found and can lead to sub-optimal clustering assignments. Other classes of global search-based techniques, such as simulated annealing, tabu search, and genetic algorithms, may offer better quality results but can be too time-consuming to implement. In this work, we describe how quantum annealing can be used to carry out clustering. We map the clustering objective to a quadratic binary optimization problem and discuss two clustering algorithms which are then implemented on commercially available quantum annealing hardware, as well as on a purely classical solver "qbsolv." The first algorithm assigns N data points to K clusters, and the second one can be used to perform binary clustering in a hierarchical manner. We present our results in the form of benchmarks against well-known k-means clustering and discuss the advantages and disadvantages of the proposed techniques.
NASA Astrophysics Data System (ADS)
Vardanyan, E. L.; Budilov, V. V.; Ramazanov, K. N.; Khusnimardanov, R. N.; Nagimov, R. Sh
2017-05-01
The operation conditions and mechanism of wear of slotting tools from high-speed steel was researched. The analysis of methods increasing durability was carried out. The effect of intermetallic coatings deposited from vacuum-arc discharge plasma on the physical-mechanical high-speed steel EP657MP was discovered. The pilot batch of the slotting tool and production tests were carried out.
A price- and-time-slot-negotiation mechanism for Cloud service reservations.
Son, Seokho; Sim, Kwang Mong
2012-06-01
When making reservations for Cloud services, consumers and providers need to establish service-level agreements through negotiation. Whereas it is essential for both a consumer and a provider to reach an agreement on the price of a service and when to use the service, to date, there is little or no negotiation support for both price and time-slot negotiations (PTNs) for Cloud service reservations. This paper presents a multi-issue negotiation mechanism to facilitate the following: 1) PTNs between Cloud agents and 2) tradeoff between price and time-slot utilities. Unlike many existing negotiation mechanisms in which a negotiation agent can only make one proposal at a time, agents in this work are designed to concurrently make multiple proposals in a negotiation round that generate the same aggregated utility, differing only in terms of individual price and time-slot utilities. Another novelty of this work is formulating a novel time-slot utility function that characterizes preferences for different time slots. These ideas are implemented in an agent-based Cloud testbed. Using the testbed, experiments were carried out to compare this work with related approaches. Empirical results show that PTN agents reach faster agreements and achieve higher utilities than other related approaches. A case study was carried out to demonstrate the application of the PTN mechanism for pricing Cloud resources.
Ganyard, Floyd P.
1982-01-01
An alarm toe switch inserted within a shoe for energizing an alarm circuit n a covert manner includes an insole mounting pad into which a miniature reed switch is fixedly molded. An elongated slot perpendicular to the reed switch is formed in the bottom surface of the mounting pad. A permanent cylindrical magnet positioned in the forward portion of the slot with a diameter greater than the pad thickness causes a bump above the pad. A foam rubber block is also positioned in the slot rearwardly of the magnet and holds the magnet in normal inoperative relation. A non-magnetic support plate covers the slot and holds the magnet and foam rubber in the slot. The plate minimizes bending and frictional forces to improve movement of the magnet for reliable switch activation. The bump occupies the knuckle space beneath the big toe. When the big toe is scrunched rearwardly the magnet is moved within the slot relative to the reed switch, thus magnetically activating the switch. When toe pressure is released the foam rubber block forces the magnet back into normal inoperative position to deactivate the reed switch. The reed switch is hermetically sealed with the magnet acting through the wall so the switch assembly S is capable of reliable operation even in wet and corrosive environments.
Multi-processor including data flow accelerator module
Davidson, George S.; Pierce, Paul E.
1990-01-01
An accelerator module for a data flow computer includes an intelligent memory. The module is added to a multiprocessor arrangement and uses a shared tagged memory architecture in the data flow computer. The intelligent memory module assigns locations for holding data values in correspondence with arcs leading to a node in a data dependency graph. Each primitive computation is associated with a corresponding memory cell, including a number of slots for operands needed to execute a primitive computation, a primitive identifying pointer, and linking slots for distributing the result of the cell computation to other cells requiring that result as an operand. Circuitry is provided for utilizing tag bits to determine automatically when all operands required by a processor are available and for scheduling the primitive for execution in a queue. Each memory cell of the module may be associated with any of the primitives, and the particular primitive to be executed by the processor associated with the cell is identified by providing an index, such as the cell number for the primitive, to the primitive lookup table of starting addresses. The module thus serves to perform functions previously performed by a number of sections of data flow architectures and coexists with conventional shared memory therein. A multiprocessing system including the module operates in a hybrid mode, wherein the same processing modules are used to perform some processing in a sequential mode, under immediate control of an operating system, while performing other processing in a data flow mode.
Wu, Zhongwei; Xu, Yin
2018-04-20
The hybrid plasmonic effect with lower loss and comparable light confinement than surface plasmon polariton opens new avenues for strengthening light-matter interactions with low loss. Here, we propose and numerically analyze a graphene-based electro-absorption modulator (EAM) with high-modulation efficiency and broad optical bandwidth using a dual-slot hybrid plasmonic waveguide (HPW), which consists of a central dual-slot HPW connected with two taper transitions and two additional dual-slot HPWs for coupling it with the input and output silicon nanowires, where graphene layers are located at the bottom and top side of the whole dual-slot HPW region. By combining the huge light enhancement effect of the dual-slot HPW and graphene's tunable conductivity, we obtain a high-modulation efficiency (ME) of 1.76 dB/μm for the graphene-based dual-slot HPW (higher ME of 2.19 dB/μm can also be obtained). Based upon this promising result, we further design a graphene-based hybrid plasmonic EAM, achieving a modulation depth (MD) of 15.95 dB and insertion loss of 1.89 dB @1.55 μm, respectively, in a total length of only 10 μm, where its bandwidth can reach over 500 nm for keeping MD>15 dB; MD can also be improved by slightly increasing the device length or shrinking the waveguide thickness, showing strong advantages for applying it into on-chip high-performance silicon modulators.
Modern Design of Resonant Edge-Slot Array Antennas
NASA Technical Reports Server (NTRS)
Gosselin, R. B.
2006-01-01
Resonant edge-slot (slotted-waveguide) array antennas can now be designed very accurately following a modern computational approach like that followed for some other microwave components. This modern approach makes it possible to design superior antennas at lower cost than was previously possible. Heretofore, the physical and engineering knowledge of resonant edge-slot array antennas had remained immature since they were introduced during World War II. This is because despite their mechanical simplicity, high reliability, and potential for operation with high efficiency, the electromagnetic behavior of resonant edge-slot antennas is very complex. Because engineering design formulas and curves for such antennas are not available in the open literature, designers have been forced to implement iterative processes of fabricating and testing multiple prototypes to derive design databases, each unique for a specific combination of operating frequency and set of waveguide tube dimensions. The expensive, time-consuming nature of these processes has inhibited the use of resonant edge-slot antennas. The present modern approach reduces costs by making it unnecessary to build and test multiple prototypes. As an additional benefit, this approach affords a capability to design an array of slots having different dimensions to taper the antenna illumination to reduce the amplitudes of unwanted side lobes. The heart of the modern approach is the use of the latest commercially available microwave-design software, which implements finite-element models of electromagnetic fields in and around waveguides, antenna elements, and similar components. Instead of building and testing prototypes, one builds a database and constructs design curves from the results of computational simulations for sets of design parameters. The figure shows a resonant edge-slot antenna designed following this approach. Intended for use as part of a radiometer operating at a frequency of 10.7 GHz, this antenna was fabricated from dimensions defined exclusively by results of computational simulations. The final design was found to be well optimized and to yield performance exceeding that initially required.
Assessment of Bracket Surface Morphology and Dimensional Change
Radhakrishnan, Pillai Devu; Sapna Varma, N. K.; Ajith, V. V.
2017-01-01
Objective: The objective of this study was to compare the surface morphology and dimensional stability of the bracket slot at the onset of treatment and after 12 months of intraoral exposure. The study also compared the amount of calcium at the bracket base which indicates enamel loss among the three orthodontic brackets following debonding after 12 months of intraoral exposure. Materials and Methods: The sample consisted of 60 (0.022” MBT) canine brackets. They were divided into three groups: self-ligating, ceramic bracket with metal slot, and stainless steel (SS) brackets. The slot dimensions, micromorphologic characteristics of as-received and retrieved brackets were measured with a stereomicroscope and scanning electron microscope (SEM), respectively. The amount of calcium at the bracket base which indicates enamel damage was quantified using energy-dispersive X-ray spectrometry (EDX). Results: The results showed statistically significant alterations (P < 0.05) in the right vertical dimension, internal tie wing width (cervical), right and left depth of the slot (Kruskal–Wallis test). Multiple comparison using Mann–Whitney test showed that ceramic brackets underwent (P < 0.05) minimal alterations in the right vertical dimension, internal tie wing width (cervical), right and left depth of the slot (0.01 mm, −0.003 mm, 0.006 mm, −0.002 mm, respectively) when compared with the changes seen in SS and self-ligating brackets. SEM analysis revealed an increase in the surface roughness of ceramic with metal slot brackets and self-ligating bracket showed the least irregularity. The presence of calcium was noted on all evaluated brackets under EDX, but ceramic with metal slot brackets showed a significantly greater amount of enamel loss (P = 0.001). Conclusion: Ceramic brackets were found to be dimensionally stable when compared to SS and self-ligating. Self-ligating bracket showed minimal surface irregularity. Ceramic with metal slot brackets showed a greater amount of enamel loss following debonding. PMID:28566855
NASA Technical Reports Server (NTRS)
Tulintseff, A. N.
1993-01-01
Printed dipole elements and their complement, linear slots, are elementary radiators that have found use in low-profile antenna arrays. Low-profile antenna arrays, in addition to their small size and low weight characteristics, offer the potential advantage of low-cost, high-volume production with easy integration with active integrated circuit components. The design of such arrays requires that the radiation and impedance characteristics of the radiating elements be known. The FDTD (Finite-Difference Time-Domain) method is a general, straight-forward implementation of Maxwell's equations and offers a relatively simple way of analyzing both printed dipole and slot elements. Investigated in this work is the application of the FDTD method to the analysis of printed dipole and slot elements transversely coupled to an infinite transmission line in a multilayered configuration. Such dipole and slot elements may be used in dipole and slot series-fed-type linear arrays, where element offsets and interelement line lengths are used to obtain the desired amplitude distribution and beam direction, respectively. The design of such arrays is achieved using transmission line theory with equivalent circuit models for the radiating elements. In an equivalent circuit model, the dipole represents a shunt impedance to the transmission line, where the impedance is a function of dipole offset, length, and width. Similarly, the slot represents a series impedance to the transmission line. The FDTD method is applied to single dipole and slot elements transversely coupled to an infinite microstrip line using a fixed rectangular grid with Mur's second order absorbing boundary conditions. Frequency-dependent circuit and scattering parameters are obtained by saving desired time-domain quantities and using the Fourier transform. A Gaussian pulse excitation is applied to the microstrip transmission line, where the resulting reflected signal due to the presence of the radiating element is used to determine the equivalent element impedance.
Stent design favorably influences the vascular response in normal porcine coronary arteries.
Carter, A J; Scott, D; Rahdert, D; Bailey, L; De Vries J; Ayerdi, K; Turnlund, T; Jones, R; Virmani, R; Fischell, T A
1999-03-01
The purpose of this study was to compare the arterial response following implantation of a stainless-steel, balloon-expandable, tubular slotted stent with that of a novel computer-designed, multi-cellular stent in normal porcine coronary arteries. Intracoronary stent placement has evolved into the primary strategy for percutaneous revascularization of symptomatic coronary arterial lesions. Presently there is intense interest in developing new stent designs to improve stent delivery and biocompatability. Computer-assisted design was utilized to develop a balloon-expandable stent with symmetric expansion properties, uniform arterial wall coverage, longitudinal flexibility and radial strength. Quantitative coronary angiography and histological assessment of the stented arteries was used to evaluate the acute and chronic vascular responses to a stainless-steel, balloon-expandable, tubular slotted stent as compared to the computer-designed BX stent in the normolipemic swine. Forty stents (24 BX, 16 tubular slotted) were implanted in 19 miniature swine at a mean inflation pressure of 9 atm using identical delivery systems. Eight of the BX and none of the tubular slotted stents were post-dilated with a non-compliant balloon at 12-14 atm. The mean stent-to-artery ratio was similar for the BX (1.03 +/- 0.06) and tubular slotted (1.04 +/- 0.11; p = 0.59) designs. Protrusion or asymmetric radial flaring of a strut at the stent margin was present in 1 of 23 BX stents (4.3%) and 10 of 15 tubular slotted stents (66.7%; p < 0.0001). The mean arterial injury score was significantly less for the BX stent (0.2 +/- 0.2) as compared with the tubular slotted stents (0.4 +/- 0.4; p = 0.025). At 3 days, thrombus area was similar for the BX and tubular slotted designs (0.42 +/- 0.16 mm2 versus 0.44 +/- 0.18 mm2, respectively; p = 0.88). The mean neointimal area was significantly less for the BX at 2 months (1.09 +/- 0.25 mm2 versus 2.93 +/- 2.26 mm2 in the tubular slotted stent) and at 6 months (1.10 +/- 0.26 mm2 versus 2.07 +/- 0.65 mm2 in the tubular slotted stent; p = 0.01), resulting in approximately 50% less in-stent stenosis. The arterial response to a balloon-expandable stent can be favorably influenced by computer-assisted modification of design in an experimental model. Further study is warranted to determine the impact of stent design upon clinical in-stent restenosis.
Brace, Christopher L
2011-07-01
Design and validate an efficient dual-slot coaxial microwave ablation antenna that produces an approximately spherical heating pattern to match the shape of most abdominal and pulmonary tumor targets. A dual-slot antenna geometry was utilized for this study. Permutations of the antenna geometry using proximal and distal slot widths from 1 to 10 mm separated by 1-20 mm were analyzed using finite-element electromagnetic simulations. From this series, the most optimal antenna geometry was selected using a two-term sigmoidal objective function to minimize antenna reflection coefficient and maximize the diameter-to-length aspect ratio of heat generation. Sensitivities to variations in tissue properties and insertion depth were also evaluated in numerical models. The most optimal dual-slot geometry of the parametric analysis was then fabricated from semirigid coaxial cable. Antenna reflection coefficients at various insertion depths were recorded in ex vivo bovine livers and compared to numerical results. Ablation zones were then created by applying 50 W for 2-10 min in simulations and ex vivo livers. Mean zone diameter, length, aspect ratio, and reflection coefficients before and after heating were then compared to a conventional monopole antenna using ANOVA with post-hoc t-tests. Statistical significance was indicated for P <0.05. Antenna performance was highly sensitive to dual-slot geometry. The best-performing designs utilized a proximal slot width of 1 mm, distal slot width of 4 mm +/- 1 mm and separation of 8 mm +/- 1 mm. These designs were characterized by an active choking mechanism that focused heating to the distal tip of the antenna. A dual-band resonance was observed in the most optimal design, with a minimum reflection coefficient of -20.9 dB at 2.45 and 1.25 GHz. Total operating bandwidth was greater than 1 GHz, but the desired heating pattern was achieved only near 2.45 GHz. As a result, antenna performance was robust to changes in insertion depth and variations in relative permittivity of the surrounding tissue medium. In both simulations and ex vivo liver, the dual-slot antenna created ablations greater in diameter than a coaxial monopole (35 mm +/- 2 mm versus 31 mm +/- 2 mm; P<0.05), while also shorter in length (49 mm +/- 2 mm versus 60 mm +/- 6 mm; P < 0.001) after 10 min. Similar results were obtained after 2 and 5 min as well. Dual-slot antennas can produce more spherical ablation zones while retaining low reflection coefficients. These benefits are obtained without adding to the antenna diameter. Further evaluation for clinical microwave ablation appears warranted.
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.
Ant colony optimization for solving university facility layout problem
NASA Astrophysics Data System (ADS)
Mohd Jani, Nurul Hafiza; Mohd Radzi, Nor Haizan; Ngadiman, Mohd Salihin
2013-04-01
Quadratic Assignment Problems (QAP) is classified as the NP hard problem. It has been used to model a lot of problem in several areas such as operational research, combinatorial data analysis and also parallel and distributed computing, optimization problem such as graph portioning and Travel Salesman Problem (TSP). In the literature, researcher use exact algorithm, heuristics algorithm and metaheuristic approaches to solve QAP problem. QAP is largely applied in facility layout problem (FLP). In this paper we used QAP to model university facility layout problem. There are 8 facilities that need to be assigned to 8 locations. Hence we have modeled a QAP problem with n ≤ 10 and developed an Ant Colony Optimization (ACO) algorithm to solve the university facility layout problem. The objective is to assign n facilities to n locations such that the minimum product of flows and distances is obtained. Flow is the movement from one to another facility, whereas distance is the distance between one locations of a facility to other facilities locations. The objective of the QAP is to obtain minimum total walking (flow) of lecturers from one destination to another (distance).
NASA Astrophysics Data System (ADS)
Begum, A. Yasmine; Gireesh, N.
2018-04-01
In superheater, steam temperature is controlled in a cascade control loop. The cascade control loop consists of PI and PID controllers. To improve the superheater steam temperature control the controller's gains in a cascade control loop has to be tuned efficiently. The mathematical model of the superheater is derived by sets of nonlinear partial differential equations. The tuning methods taken for study here are designed for delay plus first order transfer function model. Hence from the dynamical model of the superheater, a FOPTD model is derived using frequency response method. Then by using Chien-Hrones-Reswick Tuning Algorithm and Gain-Phase Assignment Algorithm optimum controller gains has been found out based on the least value of integral time weighted absolute error.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hubbard, L; Ziemer, B; Malkasian, S
Purpose: To evaluate the accuracy of a patient-specific coronary perfusion territory assignment algorithm that uses CT angiography (CTA) and a minimum-cost-path approach to assign coronary perfusion territories on a voxel-by-voxel basis for determination of myocardial mass at risk. Methods: Intravenous (IV) contrast (370 mg/mL iodine, 25 mL, 7 mL/s) was injected centrally into five swine (35–45 kg) and CTA was performed using a 320-slice CT scanner at 100 kVp and 200 mA. Additionally, a 4F catheter was advanced into the left anterior descending (LAD), left circumflex (LCX), and right coronary artery (RCA) and contrast (30 mg/mL iodine, 10 mL, 1.5more » mL/s) was directly injected into each coronary artery for isolation of reference coronary perfusion territories. Semiautomatic myocardial segmentation of the CTA data was then performed and the centerlines of the LAD, LCX, and RCA were digitally extracted through image processing. Individual coronary perfusion territories were then assigned using a minimum-cost-path approach, and were quantitatively compared to the reference coronary perfusion territories. Results: The results of the coronary perfusion territory assignment algorithm were in good agreement with the reference coronary perfusion territories. The average volumetric assignment error from mitral orifice to apex was 5.5 ± 1.1%, corresponding to 2.1 ± 0.7 grams of myocardial mass misassigned for each coronary perfusion territory. Conclusion: The results indicate that accurate coronary perfusion territory assignment is possible on a voxel-by-voxel basis using CTA data and an assignment algorithm based on a minimum-cost-path approach. Thus, the technique can potentially be used to accurately determine patient-specific myocardial mass at risk distal to a coronary stenosis, improving coronary lesion assessment and treatment. Conflict of Interest (only if applicable): Grant funding from Toshiba America Medical Systems.« less
Code of Federal Regulations, 2011 CFR
2011-04-01
... are exempt from withholding under section 3402(q)(5)) of $1,200 or more from a bingo game or slot machine play or of $1,500 or more from a keno game shall make an information return with respect to such... winnings equal or exceed the $1,200 or $1,500 amount— (1) In the case of a bingo game or slot machine play...
Code of Federal Regulations, 2012 CFR
2012-04-01
... are exempt from withholding under section 3402(q)(5)) of $1,200 or more from a bingo game or slot machine play or of $1,500 or more from a keno game shall make an information return with respect to such... winnings equal or exceed the $1,200 or $1,500 amount— (1) In the case of a bingo game or slot machine play...
Code of Federal Regulations, 2013 CFR
2013-04-01
... are exempt from withholding under section 3402(q)(5)) of $1,200 or more from a bingo game or slot machine play or of $1,500 or more from a keno game shall make an information return with respect to such... winnings equal or exceed the $1,200 or $1,500 amount— (1) In the case of a bingo game or slot machine play...
Code of Federal Regulations, 2010 CFR
2010-04-01
... are exempt from withholding under section 3402(q)(5)) of $1,200 or more from a bingo game or slot machine play or of $1,500 or more from a keno game shall make an information return with respect to such... winnings equal or exceed the $1,200 or $1,500 amount— (1) In the case of a bingo game or slot machine play...
Code of Federal Regulations, 2014 CFR
2014-04-01
... are exempt from withholding under section 3402(q)(5)) of $1,200 or more from a bingo game or slot machine play or of $1,500 or more from a keno game shall make an information return with respect to such... winnings equal or exceed the $1,200 or $1,500 amount— (1) In the case of a bingo game or slot machine play...
Machining of Silicon-Ribbon-Forming Dies
NASA Technical Reports Server (NTRS)
Menna, A. A.
1985-01-01
Carbon extension for dies used in forming silicon ribbon crystals machined precisely with help of special tool. Die extension has edges beveled toward narrow flats at top, with slot precisely oriented and centered between flats and bevels. Cutting tool assembled from standard angle cutter and circular saw or saws. Angle cutters cuts bevels while slot saw cuts slot between them. In alternative version, custom-ground edges or additional circular saws also cut flats simultaneously.
NASA Technical Reports Server (NTRS)
McLean, James D. (Inventor); Witkowski, David P. (Inventor); Campbell, Richard L. (Inventor)
2006-01-01
A swept aircraft wing includes a leading airfoil element and a trailing airfoil element. At least one full-span slot is defined by the wing during at least one transonic condition of the wing. The full-span slot allows a portion of the air flowing along the lower surface of the leading airfoil element to split and flow over the upper surface of the trailing airfoil element so as to achieve a performance improvement in the transonic condition.
NASA Technical Reports Server (NTRS)
Klemperer, W
1922-01-01
It is to be expected that the advantageous properties, hitherto discovered in many slotted wing sections, depend very largely on the contour of the slot and the structural details of the wing. It is therefore of interest, aside from measurements on wings of constant cross-section along the span, to measure also wing models in which the structural details have already been given practical consideration.
1980-01-01
instability at low flows was investigated. The major cause was found to be flow detachment from the impeller vanes . ] Slotted blades were found to be...Characteristics (70 RPM), Variant (D- Aerofoil Blades , Sets VB1, 2 & 3...12 7 Pressure Rise - Flow Characteristics (70 RPM), Variant () - Slotted Aerofoil Blades , Sets VB1, 2 & 3
Rotor blade construction for circulation control aircraft
NASA Technical Reports Server (NTRS)
Carter, Sr., Donald R. (Inventor); Sedlak, Matthew (Inventor); Krauss, Timothy A. (Inventor)
1986-01-01
A circulation control aircraft rotor blade having a spanwise Coanda surface 16 and a plurality of spanwise extending flexible composite material panels 18 cooperating with the surface to define slots for the discharge of compressed air from within the blade with each panel having first flexure means 60 associated with screw adjustments 36 for establishing a slot opening preload and second flexure means 62 associated with screw adjustments 38 for establishing a slot maximum opening.
Airborne tracking sunphotometer apparatus and system
NASA Technical Reports Server (NTRS)
Matsumoto, Yutaka (Inventor); Mina, Cesar (Inventor); Russell, Philip B. (Inventor); Vanark, William B. (Inventor)
1987-01-01
An airborne tracking Sun photometer apparatus has a rotatable dome. An azimuth drive motor is connected to rotate the dome. The dome has an equatorial slot. A cylindrical housing is pivotally mounted inside the dome at the equatorial slot. A photometer is mounted in the housing to move in the equatorial slot as the housing pivots. The photometer has an end facing from the slot with an optical flat transparent window. An elevation drive motor is connected to pivot the cylindrical housing. The rotatable dome is mounted in the bulkhead of an aircraft to extend from the interior of the aircraft. A Sun sensor causes the photometer to track the Sun automatically. Alternatively, the photometer may be oriented manually or by computer.
Radio frequency accelerating cavity having slotted irises for damping certain electromagnetic modes
Palmer, Robert B.
1991-01-01
An accelerating cavity having one or more iris structures mounted therein for strongly damping unwanted frequencies that are generated in the cavity by bunches of particles in a particle beam that is accelerated through the cavity during its operation. Each of the iris structures is characterized by containing a plurality of radial slots therein that extend from the central aperture through the iris member to the perimeter thereof. The outer end of each of the radial slots includes an enlarged portion that is effective to prevent undesired frequencies from being reflected back into the center aperture of the iris member. Waveguide means connect the outer ends of the radial slots to frequency damping means or to a dump or dumps.
Small angle slot divertor concept for long pulse advanced tokamaks
NASA Astrophysics Data System (ADS)
Guo, H. Y.; Sang, C. F.; Stangeby, P. C.; Lao, L. L.; Taylor, T. S.; Thomas, D. M.
2017-04-01
SOLPS-EIRENE edge code analysis shows that a gas-tight slot divertor geometry with a small-angle (glancing-incidence) target, named the small angle slot (SAS) divertor, can achieve cold, dissipative/detached divertor conditions at relatively low values of plasma density at the outside midplane separatrix. SAS exhibits the following key features: (1) strong enhancement of the buildup of neutral density in a localized region near the plasma strike point on the divertor target; (2) spreading of the cooling front across the divertor target with the slot gradually flaring out from the strike point, thus effectively reducing both heat flux and erosion on the entire divertor target surface. Such a divertor may potentially provide a power and particle handling solution for long pulse advanced tokamaks.
Characteristics of a Linearly Tapered Slot Antenna (LTSA) Conformed Longitudinally Around a Cylinder
NASA Technical Reports Server (NTRS)
Jordan, Jennifer L.; Ponchak, George E.; Tavassolian, Negar; Tentzeris, Manos M.
2007-01-01
The family of tapered slot antennas (TSA s) is suitable for numerous applications. Their ease of fabrication, wide bandwidth, and high gain make them desirable for military and commercial systems. Fabrication on thin, flexible substrates allows the TSA to be conformed over a given body, such as an aircraft wing or a piece of clothing for wearable networks. Previously, a Double Exponentially Tapered Slot Antenna (DETSA) was conformed around an exponential curvature, which showed that the main beam skewed towards the direction of curvature. This paper presents a Linearly Tapered Slot Antenna (LTSA) conformed longitudinally around a cylinder. Measured and simulated radiation patterns and the direction of maximum H co-polarization (Hco) as a function of the cylinder radius are presented.
Adaptor assembly for coupling turbine blades to rotor disks
Delvaux, John McConnel; Garcia-Crespo, Andres Jose; Joyce, Kilmer Joseph; Tindell, Allan Randall
2014-06-03
An adaptor assembly for coupling a blade root of a turbine blade to a root slot of a rotor disk is disclosed. The adaptor assembly may generally include an adaptor body having a root configured to be received within the root slot. The adaptor body may also define a slot having an open end configured to receive the blade root. The adaptor body may further define a channel. The adaptor assembly may also include a plate having an outwardly extending foot. The foot may be configured to be received within the channel. Additionally, the plate may be configured to cover at least a portion of the open end of the slot when the foot is received within the channel.
Babinet-Inverted Optical Yagi-Uda Antenna for Unidirectional Radiation to Free Space
NASA Astrophysics Data System (ADS)
Kim, Jineun; Roh, Young-Geun; Cheon, Sangmo; Choe, Jong-Ho; Lee, Jongcheon; Lee, Jaesoong; Jeong, Heejeong; Kim, Un Jeong; Park, Yeonsang; Song, In Yong; Park, Q.-Han; Hwang, Sung Woo; Kim, Kinam; Lee, Chang-Won
2014-06-01
Plasmonic nanoantennas are key elements in nanophotonics capable of directing radiation or enhancing the transition rate of a quantum emitter. Slot-type magnetic-dipole nanoantennas, which are complementary structures of typical electric-dipole-type antennas, have received little attention, leaving their antenna properties largely unexplored. Here we present a novel magnetic-dipole-fed multi-slot optical Yagi-Uda antenna. By engineering the relative phase of the interacting surface plasmon polaritons between the slot elements, we demonstrate that the optical antenna exhibits highly unidirectional radiation to free space. The unique features of the slot-based magnetic nanoantenna provide a new possibility of achieving integrated features such as energy transfer from one waveguide to another by working as a future optical via.
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
NASA Astrophysics Data System (ADS)
Jäger, Gerold; Zhang, Weixiong
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, little is known for the HCP in directed graphs (DHCP). The contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the Assignment Problem (AP) and utilizes a technique based on Boolean satisfiability (SAT). By combining effective algorithms for the AP and SAT, our algorithm significantly outperforms previous exact DHCP algorithms including an algorithm based on the award-winning Concorde TSP algorithm.
A learning approach to the bandwidth multicolouring problem
NASA Astrophysics Data System (ADS)
Akbari Torkestani, Javad
2016-05-01
In this article, a generalisation of the vertex colouring problem known as bandwidth multicolouring problem (BMCP), in which a set of colours is assigned to each vertex such that the difference between the colours, assigned to each vertex and its neighbours, is by no means less than a predefined threshold, is considered. It is shown that the proposed method can be applied to solve the bandwidth colouring problem (BCP) as well. BMCP is known to be NP-hard in graph theory, and so a large number of approximation solutions, as well as exact algorithms, have been proposed to solve it. In this article, two learning automata-based approximation algorithms are proposed for estimating a near-optimal solution to the BMCP. We show, for the first proposed algorithm, that by choosing a proper learning rate, the algorithm finds the optimal solution with a probability close enough to unity. Moreover, we compute the worst-case time complexity of the first algorithm for finding a 1/(1-ɛ) optimal solution to the given problem. The main advantage of this method is that a trade-off between the running time of algorithm and the colour set size (colouring optimality) can be made, by a proper choice of the learning rate also. Finally, it is shown that the running time of the proposed algorithm is independent of the graph size, and so it is a scalable algorithm for large graphs. The second proposed algorithm is compared with some well-known colouring algorithms and the results show the efficiency of the proposed algorithm in terms of the colour set size and running time of algorithm.
Braithwaite, Susan S.; Godara, Hemant; Song, Julie; Cairns, Bruce A.; Jones, Samuel W.; Umpierrez, Guillermo E.
2009-01-01
Background Algorithms for intravenous insulin infusion may assign the infusion rate (IR) by a two-step process. First, the previous insulin infusion rate (IRprevious) and the rate of change of blood glucose (BG) from the previous iteration of the algorithm are used to estimate the maintenance rate (MR) of insulin infusion. Second, the insulin IR for the next iteration (IRnext) is assigned to be commensurate with the MR and the distance of the current blood glucose (BGcurrent) from target. With use of a specific set of algorithm parameter values, a family of iso-MR curves is created, each giving IR as a function of MR and BG. Method To test the feasibility of estimating MR from the IRprevious and the previous rate of change of BG, historical hyperglycemic data points were used to compute the “maintenance rate cross step next estimate” (MRcsne). Historical cases had been treated with intravenous insulin infusion using a tabular protocol that estimated MR according to column-change rules. The mean IR on historical stable intervals (MRtrue), an estimate of the biologic value of MR, was compared to MRcsne during the hyperglycemic iteration immediately preceding the stable interval. Hypothetically calculated MRcsne-dependent IRnext was compared to IRnext assigned historically. An expanded theory of an algorithm is developed mathematically. Practical recommendations for computerization are proposed. Results The MRtrue determined on each of 30 stable intervals and the MRcsne during the immediately preceding hyperglycemic iteration differed, having medians with interquartile ranges 2.7 (1.2–3.7) and 3.2 (1.5–4.6) units/h, respectively. However, these estimates of MR were strongly correlated (R2 = 0.88). During hyperglycemia at 941 time points the IRnext assigned historically and the hypothetically calculated MRcsne-dependent IRnext differed, having medians with interquartile ranges 4.0 (3.0–6.0) and 4.6 (3.0–6.8) units/h, respectively, but these paired values again were correlated (R2 = 0.87). This article describes a programmable algorithm for intravenous insulin infusion. The fundamental equation of the algorithm gives the relationship among IR; the biologic parameter MR; and two variables expressing an instantaneous rate of change of BG, one of which must be zero at any given point in time and the other positive, negative, or zero, namely the rate of change of BG from below target (rate of ascent) and the rate of change of BG from above target (rate of descent). In addition to user-definable parameters, three special algorithm parameters discoverable in nature are described: the maximum rate of the spontaneous ascent of blood glucose during nonhypoglycemia, the glucose per daily dose of insulin exogenously mediated, and the MR at given patient time points. User-assignable parameters will facilitate adaptation to different patient populations. Conclusions An algorithm is described that estimates MR prior to the attainment of euglycemia and computes MR-dependent values for IRnext. Design features address glycemic variability, promote safety with respect to hypoglycemia, and define a method for specifying glycemic targets that are allowed to differ according to patient condition. PMID:20144334
DOT National Transportation Integrated Search
2011-01-01
Travel demand modeling plays a key role in the transportation system planning and evaluation process. The four-step sequential travel demand model is the most widely used technique in practice. Traffic assignment is the key step in the conventional f...
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…
Algorithm Analysis of the DSM-5 Alcohol Withdrawal Symptom.
Martin, Christopher S; Vergés, Alvaro; Langenbucher, James W; Littlefield, Andrew; Chung, Tammy; Clark, Duncan B; Sher, Kenneth J
2018-06-01
Alcohol withdrawal (AW) is an important clinical and diagnostic feature of alcohol dependence. AW has been found to predict a worsened course of illness in clinical samples, but in some community studies, AW endorsement rates are strikingly high, suggesting false-positive symptom assignments. Little research has examined the validity of the DSM-5 algorithm for AW, which requires either the presence of at least 2 of 8 subcriteria (i.e., autonomic hyperactivity, tremulousness, insomnia, nausea, hallucinations, psychomotor agitation, anxiety, and grand mal seizures), or, the use of alcohol to avoid or relieve these symptoms. We used item and algorithm analyses of data from waves 1 and 2 of the National Epidemiologic Survey on Alcohol and Related Conditions (current drinkers, n = 26,946 at wave 1) to study the validity of DSM-5 AW as operationalized by the Alcohol Use Disorder and Associated Disabilities Interview Schedule-DSM-IV (AUDADIS-IV). A substantial proportion of individuals given the AW symptom reported only modest to moderate levels of alcohol use and alcohol problems. Alternative AW algorithms were superior to DSM-5 in terms of levels of alcohol use and alcohol problem severity among those with AW, group difference effect sizes, and predictive validity at a 3-year follow-up. The superior alternative algorithms included those that excluded the nausea subcriterion; required withdrawal-related distress or impairment; increased the AW subcriteria threshold from 2 to 3 items; and required tremulousness for AW symptom assignment. The results indicate that the DSM-5 definition of AW, as assessed by the AUDADIS-IV, has low specificity. This shortcoming can be addressed by making the algorithm for symptom assignment more stringent. Copyright © 2018 by the Research Society on Alcoholism.
Path Planning Algorithms for the Adaptive Sensor Fleet
NASA Technical Reports Server (NTRS)
Stoneking, Eric; Hosler, Jeff
2005-01-01
The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.
Xia, Jiaqi; Peng, Zhenling; Qi, Dawei; Mu, Hongbo; Yang, Jianyi
2017-03-15
Protein fold classification is a critical step in protein structure prediction. There are two possible ways to classify protein folds. One is through template-based fold assignment and the other is ab-initio prediction using machine learning algorithms. Combination of both solutions to improve the prediction accuracy was never explored before. We developed two algorithms, HH-fold and SVM-fold for protein fold classification. HH-fold is a template-based fold assignment algorithm using the HHsearch program. SVM-fold is a support vector machine-based ab-initio classification algorithm, in which a comprehensive set of features are extracted from three complementary sequence profiles. These two algorithms are then combined, resulting to the ensemble approach TA-fold. We performed a comprehensive assessment for the proposed methods by comparing with ab-initio methods and template-based threading methods on six benchmark datasets. An accuracy of 0.799 was achieved by TA-fold on the DD dataset that consists of proteins from 27 folds. This represents improvement of 5.4-11.7% over ab-initio methods. After updating this dataset to include more proteins in the same folds, the accuracy increased to 0.971. In addition, TA-fold achieved >0.9 accuracy on a large dataset consisting of 6451 proteins from 184 folds. Experiments on the LE dataset show that TA-fold consistently outperforms other threading methods at the family, superfamily and fold levels. The success of TA-fold is attributed to the combination of template-based fold assignment and ab-initio classification using features from complementary sequence profiles that contain rich evolution information. http://yanglab.nankai.edu.cn/TA-fold/. yangjy@nankai.edu.cn or mhb-506@163.com. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com
The Role of Auditory Features Within Slot-Themed Social Casino Games and Online Slot Machine Games.
Bramley, Stephanie; Gainsbury, Sally M
2015-12-01
Over the last few years playing social casino games has become a popular entertainment activity. Social casino games are offered via social media platforms and mobile apps and resemble gambling activities. However, social casino games are not classified as gambling as they can be played for free, outcomes may not be determined by chance, and players receive no monetary payouts. Social casino games appear to be somewhat similar to online gambling activities in terms of their visual and auditory features, but to date little research has investigated the cross over between these games. This study examines the auditory features of slot-themed social casino games and online slot machine games using a case study design. An example of each game type was played on three separate occasions during which, the auditory features (i.e., music, speech, sound effects, and the absence of sound) within the games were logged. The online slot-themed game was played in demo mode. This is the first study to provide a qualitative account of the role of auditory features within a slot-themed social casino game and an online slot machine game. Our results found many similarities between how sound is utilised within the two games. Therefore the sounds within these games may serve functions including: setting the scene for gaming, creating an image, demarcating space, interacting with visual features, prompting players to act, communicating achievements to players, providing reinforcement, heightening player emotions and the gaming experience. As a result this may reduce the ability of players to make a clear distinction between these two activities, which may facilitate migration between games.
Federal Register 2010, 2011, 2012, 2013, 2014
2010-05-11
...The Secretary and the FAA are granting, subject to conditions, the joint waiver request of Delta Air Lines and US Airways from the prohibition on purchasing operating authorizations (``slots'' or ``slot interests'') at LaGuardia Airport (LGA). The grant permits the carriers to consummate a transaction in which Delta would transfer 42 pairs of slot interests to US Airways at Ronald Reagan Washington National Airport (DCA), international route authorities to S[atilde]o Paulo and Tokyo; and terminal space at the Marine Air Terminal at LGA. US Airways would transfer 125 pairs of slot interests to Delta at LGA, and would lease an additional 15 pairs of LGA slot interests with a purchase option, together with terminal space in LGA's Terminal C. The grant is subject to the conditions that the carriers dispose of 14 pairs of slot interests at DCA and 20 pairs of slot interests at LGA to eligible new entrant and limited incumbent carriers, pursuant to procedures set out in this Notice, and achieve a mutually satisfactory agreement regarding gates and associated facilities with any such purchaser. If you wish to review the background documents or comments received in this proceeding, you may go to http://www.regulations.gov at any time and follow the online instructions for accessing the electronic docket. You may also go to the U.S. Department of Transportation's Docket Operations in Room W12-140 on the ground floor of the West Building at 1200 New Jersey Avenue, SE., Washington, DC between 9 a.m. and 5 p.m. Monday through Friday, except Federal holidays.
Slotted Polyimide-Aerogel-Filled-Waveguide Arrays
NASA Technical Reports Server (NTRS)
Rodriguez-Solis, Rafael A.; Pacheco, Hector L.; Miranda, Felix A.; Meador, Mary Ann B.
2013-01-01
This presentation discussed the potential advantages of developing Slotted Waveguide Arrays using polyimide aerogels. Polyimide (PI) aerogels offer great promise as an enabling technology for lightweight aerospace antenna systems. PI aerogels are highly porous solids possessing low density and low dielectric permittivity combined with good mechanical properties. For slotted waveguide array applications, there are significant advantages in mass that more than compensate for the slightly higher loss of the aerogel filled waveguide when compared to state of practice commercial waveguide.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Tolić, Nikola; Liu, Yina; Liyu, Andrey
Ultrahigh-resolution mass spectrometry, such as Fourier transform ion-cyclotron resonance mass spectrometry (FT-ICR MS), can resolve thousands of molecular ions in complex organic matrices. A Compound Identification Algorithm (CIA) was previously developed for automated elemental formula assignment for natural organic matter (NOM). In this work we describe a user friendly interface for CIA, titled Formularity, which includes an additional functionality to perform search of formulas based on an Isotopic Pattern Algorithm (IPA). While CIA assigns elemental formulas for compounds containing C, H, O, N, S, and P, IPA is capable of assigning formulas for compounds containing other elements. We used halogenatedmore » organic compounds (HOC), a chemical class that is ubiquitous in nature as well as anthropogenic systems, as an example to demonstrate the capability of Formularity with IPA. A HOC standard mix was used to evaluate the identification confidence of IPA. The HOC spike in NOM and tap water were used to assess HOC identification in natural and anthropogenic matrices. Strategies for reconciliation of CIA and IPA assignments are discussed. Software and sample databases with documentation are freely available from the PNNL OMICS software repository https://omics.pnl.gov/software/formularity.« less
Magnetic resonance imaging of rodent spinal cord with an improved performance coil at 7 Tesla
NASA Astrophysics Data System (ADS)
Solis-Najera, S. E.; Rodriguez, A. O.
2014-11-01
Magnetic Resonance Imaging of animal models provide reliable means to study human diseases. The image acquisition particularly determined by the radio frequency coil to detect the signal emanated from a particular region of interest. A scaled-down version of the slotted surface coil was built based on the previous results of a magnetron-type surface coil for human applications. Our coil prototype had a 2 cm total diameter and six circular slots and was developed for murine spinal cord at 7 T. Electromagnetic simulations of the slotted and circular coils were also performed to compute the spatially dependent magnetic and electric fields using a simulated saline-solution sphere. The quality factor of both coils was experimentally measured giving a lower noise figure and a higher quality factor for the slotted coil outperforming the circular coil. Images of the spinal cord of a rat were acquired using standard pulse sequences. The slotted surface coil can be a good tool for spinal cord rat imaging using conventional pulse sequences at 7 T.
Analysis of the relationship between errors in manufacture of slot connections and gear drive noises
NASA Technical Reports Server (NTRS)
Bodronosov, M. K.
1973-01-01
On the basis of experimental research, an analysis was carried out of the effect of certain errors in manufacture of straight-barrel slots on the noise characteristics of gear drives. In carrying out the experiments, the gear crowns of the test wheels were held immovable, and only the geometric dimensions of the slots and the mutual locations of the individual elements were varied. The investigation of the effect of each factor was carried out under otherwise equal conditions, on 34:56 cog ratio gear pairs (m = 2mm), made of 40 C steel, with a gear crown accuracy of 7 X, machining fineness 7, at a speed v = 7.1 m/sec. The number of slots was 6. The clearance in slot pairs in dimension D, equal to 0.015, 0.05, 0.08 and 0.110 mm, was obtained by change in the outer diameter of the spindle by means of polishing. The results of the tests of the experimental wheels showed that their noise level increases with increase in clearance.
Elastic-plastic deformation of a metal-matrix composite coupon with a center slot
NASA Technical Reports Server (NTRS)
Post, D.; Czarnek, R.; Joh, D.; Jo, J.; Guo, Y.
1985-01-01
A comprehensive experimental analysis of deformations of the surface of a metal-matrix specimen is reported. The specimen is a 6-ply 0 + or - 45 sub s boron-aluminum tensile coupon with a central slot. Moire interferometry is used for high-sensitivity whole-field measurements of in-plane displacements. Normal and shear strains are calculated from displacement gradients. Displacement fields are analyzed at various load levels from 15% to 95% of the failure load. Deformations of the boron fibers could be distinguished from those of the matrix. Highly localized plastic slip zones occur tangent to the ends of the slot. Shear strains and concurrent transverse compressive strains in the slip zones reach approximately 10% and 1%, respectively. Upon unloading, elastic recovery in surrounding regions causes a reverse plastic shear strain in the slip zone of about 4%. Longitudinal normal strains on the unslotted ligament peak at the slot boundary at about 1% strain. The strain concentration factor at the end of the slot decreases with load level and the advance of plasticity.
Optical communication with semiconductor laser diodes
NASA Technical Reports Server (NTRS)
Davidson, F.
1988-01-01
Slot timing recovery in a direct detection optical PPM communication system can be achieved by processing the photodetector waveform with a nonlinear device whose output forms the input to a phase lock group. The choice of a simple transition detector as the nonlinearity is shown to give satisfactory synchronization performance. The rms phase error of the recovered slot clock and the effect of slot timing jitter on the bit error probability were directly measured. The experimental system consisted of an AlGaAs laser diode (lambda = 834 nm) and a silicon avalanche photodiode (APD) photodetector and used Q=4 PPM signaling operated at a source data rate of 25 megabits/second. The mathematical model developed to characterize system performance is shown to be in good agreement with actual performance measurements. The use of the recovered slot clock in the receiver resulted in no degradation in receiver sensitivity compared to a system with perfect slot timing. The system achieved a bit error probability of 10 to the minus 6 power at received signal energies corresponding to an average of less than 60 detected photons per information bit.
NASA Technical Reports Server (NTRS)
Kazin, S. B.; Minzner, W. R.; Paas, J. E.
1971-01-01
A scale model of the bypass flow region of a 1.5 pressure ratio, single stage, low tip speed fan was tested with a rotor tip casing bleed slot to determine its effects on noise generation. The bleed slot was located 1/2 inch (1.3 cm) upstream of the rotor leading edge and was configured to be a continuous opening around the circumference. The bleed manifold system was operated over a range of bleed rates corresponding to as much as 6% of the fan flow at approach thrust and 4.25% of the fan flow at takeoff thrust. Acoustic results indicate that a bleed rate of 4% of the fan flow reduces the fan maximum approach 200 foot (61.0 m) sideline PNL 0.5 PNdB and the corresponding takeoff thrust noise 1.1 PNdB below the level with zero bleed. However, comparison of the standard casing (no bleed slot) and the slotted bleed casing with zero bleed shows that the bleed slot itself caused a noise increase.
Dokos, J.A.
1997-12-30
A drill bit loader is described for loading a tapered shank of a drill bit into a similarly tapered recess in the end of a drill spindle. The spindle has a transverse slot at the inner end of the recess. The end of the tapered shank of the drill bit has a transverse tang adapted to engage in the slot so that the drill bit will be rotated by the spindle. The loader is in the form of a cylinder adapted to receive the drill bit with the shank projecting out of the outer end of the cylinder. Retainer pins prevent rotation of the drill bit in the cylinder. The spindle is lowered to extend the shank of the drill bit into the recess in the spindle and the spindle is rotated to align the slot in the spindle with the tang on the shank. A spring unit in the cylinder is compressed by the drill bit during its entry into the recess of the spindle and resiliently drives the tang into the slot in the spindle when the tang and slot are aligned. 5 figs.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Dokos, James A.
A drill bit loader for loading a tapered shank of a drill bit into a similarly tapered recess in the end of a drill spindle. The spindle has a transverse slot at the inner end of the recess. The end of the tapered shank of the drill bit has a transverse tang adapted to engage in the slot so that the drill bit will be rotated by the spindle. The loader is in the form of a cylinder adapted to receive the drill bit with the shank projecting out of the outer end of the cylinder. Retainer pins prevent rotationmore » of the drill bit in the cylinder. The spindle is lowered to extend the shank of the drill bit into the recess in the spindle and the spindle is rotated to align the slot in the spindle with the tang on the shank. A spring unit in the cylinder is compressed by the drill bit during its entry into the recess of the spindle and resiliently drives the tang into the slot in the spindle when the tang and slot are aligned.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Dokos, J.A.
A drill bit loader is described for loading a tapered shank of a drill bit into a similarly tapered recess in the end of a drill spindle. The spindle has a transverse slot at the inner end of the recess. The end of the tapered shank of the drill bit has a transverse tang adapted to engage in the slot so that the drill bit will be rotated by the spindle. The loader is in the form of a cylinder adapted to receive the drill bit with the shank projecting out of the outer end of the cylinder. Retainer pinsmore » prevent rotation of the drill bit in the cylinder. The spindle is lowered to extend the shank of the drill bit into the recess in the spindle and the spindle is rotated to align the slot in the spindle with the tang on the shank. A spring unit in the cylinder is compressed by the drill bit during its entry into the recess of the spindle and resiliently drives the tang into the slot in the spindle when the tang and slot are aligned. 5 figs.« less
NASA Technical Reports Server (NTRS)
Pfenninger, W.; Syberg, J.
1974-01-01
The feasibility of quiet, suction laminarized, high Reynolds number (Re) supersonic wind tunnel nozzles was studied. According to nozzle wall boundary layer development and stability studies, relatively weak area suction can prevent amplified nozzle wall TS (Tollmien-Schlichting) boundary layer oscillations. Stronger suction is needed in and shortly upstream of the supersonic concave curvature nozzle area to avoid transition due to amplified TG (Taylor-Goertler) vortices. To control TG instability, moderately rapid and slow expansion nozzles require smaller total suction rates than rapid expansion nozzles, at the cost of larger nozzle length Re and increased TS disturbances. Test section mean flow irregularities can be minimized with suction through longitudinal or highly swept slots (swept behind local Mach cone) as well as finely perforated surfaces. Longitudinal slot suction is optimized when the suction-induced crossflow velocity increases linearly with surface distance from the slot attachment line toward the slot (through suitable slot geometry). Suction in supersonic blowdown tunnels may be operated by one or several individual vacuum spheres.
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.
Multipoint to multipoint routing and wavelength assignment in multi-domain optical networks
NASA Astrophysics Data System (ADS)
Qin, Panke; Wu, Jingru; Li, Xudong; Tang, Yongli
2018-01-01
In multi-point to multi-point (MP2MP) routing and wavelength assignment (RWA) problems, researchers usually assume the optical networks to be a single domain. However, the optical networks develop toward to multi-domain and larger scale in practice. In this context, multi-core shared tree (MST)-based MP2MP RWA are introduced problems including optimal multicast domain sequence selection, core nodes belonging in which domains and so on. In this letter, we focus on MST-based MP2MP RWA problems in multi-domain optical networks, mixed integer linear programming (MILP) formulations to optimally construct MP2MP multicast trees is presented. A heuristic algorithm base on network virtualization and weighted clustering algorithm (NV-WCA) is proposed. Simulation results show that, under different traffic patterns, the proposed algorithm achieves significant improvement on network resources occupation and multicast trees setup latency in contrast with the conventional algorithms which were proposed base on a single domain network environment.
Remotely replaceable tokamak plasma limiter tiles
Tsuo, Simon , Langford, Alison A.
1989-01-01
U-shaped limiter tiles placed end-to-end over a pair of parallel runners secured to a wall have two rods which engage L-shaped slots in the runners. The short receiving legs of the L-shaped slots are perpendicular to the wall and open away from the wall, while long retaining legs are parallel to and adjacent the wall. A sliding bar between the runners has grooves with clips to retain the rods pressed into receiving legs of the L-shaped slots in the runners. Sliding the bar in the direction of retaining legs of the L-shaped slots latches the tiles in place over the runners. Resilient contact strips between the parallel arms of the U-shaped tiles and the wall assure thermal and electrical contact with the wall.
Error Rates and Channel Capacities in Multipulse PPM
NASA Technical Reports Server (NTRS)
Hamkins, Jon; Moision, Bruce
2007-01-01
A method of computing channel capacities and error rates in multipulse pulse-position modulation (multipulse PPM) has been developed. The method makes it possible, when designing an optical PPM communication system, to determine whether and under what conditions a given multipulse PPM scheme would be more or less advantageous, relative to other candidate modulation schemes. In conventional M-ary PPM, each symbol is transmitted in a time frame that is divided into M time slots (where M is an integer >1), defining an M-symbol alphabet. A symbol is represented by transmitting a pulse (representing 1) during one of the time slots and no pulse (representing 0 ) during the other M 1 time slots. Multipulse PPM is a generalization of PPM in which pulses are transmitted during two or more of the M time slots.
Method and apparatus for assembling permanent magnet rotors
Hsu, John S.; Adams, Donald J.
1999-01-01
A permanent magnet assembly (22) for assembly in large permanent magnet (PM) motors and generators includes a two-piece carrier (23, 24) that can be slid into a slot (13) in the rotor (10) and then secured in place using a set screw (37). The invention also provides an auxiliary carrier device (50) with guide rails (51) that line up with the teeth (12) of the rotor, so that a permanent magnet assembly (22) can be pushed first into a slot (13), and then down the slot (13) to its proper location. An auxiliary tool (50) is provided to move the permanent magnet assembly (22) into position in the slot (13) before it is secured in place. Methods of assembling and disassembling the magnet assemblies (22) in the rotor (10) are also disclosed.
Combination induction plasma tube and current concentrator for introducing a sample into a plasma
Hull, Donald E.; Bieniewski, Thomas M.
1988-01-01
An induction plasma tube in combination with a current concentrator. The rent concentrator has a substantially cylindrical body having an open end and a partially closed end which defines an aperture. A first slot extends the longitudinal length of the cylindrical body and a second slot extends radially outward from the aperture. Together the first and second slots form a single L-shaped slot. The current concentrator is disposed within a volume bounded by an induction coil substantially along the axis thereof, and when power is applied to the induction coil a concentrated current is induced within the current concentrator aperture. The concentrator is moveable relative to the coil along the longitudinal axis of the coil to control the amount of current which is concentrated at the aperture.
Reduction of Flap Side Edge Noise - the Blowing Flap
NASA Technical Reports Server (NTRS)
Hutcheson, Florence V.; Brooks, THomas F.
2005-01-01
A technique to reduce the noise radiating from a wing-flap side edge is being developed. As an airplane wing with an extended flap is exposed to a subsonic airflow, air is blown outward through thin rectangular chord-wise slots at various locations along the side edges and side surface of the flap to weaken and push away the vortices that originate in that region of the flap and are responsible for important noise emissions. Air is blown through the slots at up to twice the local flow velocity. The blowing is done using one or multiple slots, where a slot is located along the top, bottom or side surface of the flap along the side edge, or also along the intersection of the bottom (or top) and side surfaces.
Adaptor assembly for coupling turbine blades to rotor disks
DOE Office of Scientific and Technical Information (OSTI.GOV)
Garcia-Crespo, Andres Jose; Delvaux, John McConnell
2014-09-23
An adaptor assembly for coupling a blade root of a turbine blade to a root slot of a rotor disk is described. The adaptor assembly includes a turbine blade having a blade root and an adaptor body having an adaptor root. The adaptor body defines a slot having an open end configured to receive the blade root of the turbine blade such that the adaptor root of the adaptor body and the blade root of the turbine blade are adjacent to one another when the blade root of the turbine blade is positioned within the slot. Both the adaptor rootmore » of the adaptor body and the blade root of the turbine blade are configured to be received within the root slot of the rotor disk.« less
Integrated seat frame and back support
Martin, Leo
1999-01-01
An integrated seating device comprises a seat frame having a front end and a rear end. The seat frame has a double wall defining an exterior wall and an interior wall. The rear end of the seat frame has a slot cut therethrough both the exterior wall and the interior wall. The front end of the seat frame has a slot cut through just the interior wall thereof. A back support comprising a generally L shape has a horizontal member, and a generally vertical member which is substantially perpendicular to the horizontal member. The horizontal member is sized to be threaded through the rear slot and is fitted into the front slot. Welded slat means secures the back support to the seat frame to result in an integrated seating device.
Slotted rectangular waveguide with dielectric sandwich structure inside
NASA Astrophysics Data System (ADS)
Abdullin, R. R.; Sokolov, R. I.
2018-03-01
This paper continues the series of works devoted to the investigation of leaky-wave antenna based on layered rectangular waveguide with periodic transverse slots in broad face. Previously developed wavenumber calculation technique has been adapted for analysis of slotted sandwich waveguide with three layers at least. The paper provides the numerical results of velocity factor dependencies for partially filled slotted rectangular waveguide containing a dielectric slab in the middle position inside or an air gap between two dielectric slabs. Additionally, dispersion properties are also considered for multilayer waveguide with linear laws combinations of thickness and permittivity. This allows recognizing the trends to develop new prospective antennas with complex patterns of tilt angle change. All numerical results obtained are confirmed with the in-situ measurements of transmission coefficient phase.
Radio frequency accelerating cavity having slotted irises for damping certain electromagnetic modes
Palmer, R.B.
1991-05-21
An accelerating cavity is disclosed having one or more iris structures mounted therein for strongly damping unwanted frequencies that are generated in the cavity by bunches of particles in a particle beam that is accelerated through the cavity during its operation. Each of the iris structures is characterized by containing a plurality of radial slots therein that extend from the central aperture through the iris member to the perimeter thereof. The outer end of each of the radial slots includes an enlarged portion that is effective to prevent undesired frequencies from being reflected back into the center aperture of the iris member. Waveguide means connect the outer ends of the radial slots to frequency damping means or to a dump or dumps. 17 figures.
High performance x-ray anti-scatter grid
Logan, Clinton M.
1995-01-01
An x-ray anti-scatter grid for x-ray imaging, particularly for screening mammography, and method for fabricating same, x-rays incident along a direct path pass through a grid composed of a plurality of parallel or crossed openings, microchannels, grooves, or slots etched in a substrate, such as silicon, having the walls of the microchannels or slots coated with a high opacity material, such as gold, while x-rays incident at angels with respect to the slots of the grid, arising from scatter, are blocked. The thickness of the substrate is dependent on the specific application of the grid, whereby a substrate of the grid for mammography would be thinner than one for chest radiology. Instead of coating the walls of the slots, such could be filed with an appropriate liquid, such as mercury.
NASA Astrophysics Data System (ADS)
Liao, Jianfei; Xie, Yingmao; Wang, Xinghua; Li, Dongbo; Huang, Tianye
2017-07-01
A slot silicon photonic crystal fiber (PCF) is proposed to simultaneously achieve ultrahigh birefringence, large nonlinearity and ultra-flattened nearly-zero dispersion over a wide wavelength range. By taking advantage on the slot effect, ultrahigh birefringence up to 0.0736 and ultrahigh nonlinear coefficient up to 211.48 W-1 m-1 for quasi-TE mode can be obtained at the wavelength of 1.55 μm. Moreover, ultra-flattened dispersion of 0.49 ps/(nm km) for quasi-TE mode can be achieved over a 180 nm wavelength range with low dispersion slope of 1.85 × 10-3 ps/(nm2 km) at 1.55 μm. Leveraging on these advantages, the proposed slot PCF has great potential for efficient all-optical signal processing applications.
ERIC Educational Resources Information Center
Stanford Univ., CA. School Mathematics Study Group.
This is the second unit of a 15-unit School Mathematics Study Group (SMSG) mathematics text for high school students. Topics presented in the first chapter (Informal Algorithms and Flow Charts) include: changing a flat tire; algorithms, flow charts, and computers; assignment and variables; input and output; using a variable as a counter; decisions…
Brace, Christopher L.
2011-01-01
Purpose: Design and validate an efficient dual-slot coaxial microwave ablation antenna that produces an approximately spherical heating pattern to match the shape of most abdominal and pulmonary tumor targets.Methods: A dual-slot antenna geometry was utilized for this study. Permutations of the antenna geometry using proximal and distal slot widths from 1 to 10 mm separated by 1–20 mm were analyzed using finite-element electromagnetic simulations. From this series, the most optimal antenna geometry was selected using a two-term sigmoidal objective function to minimize antenna reflection coefficient and maximize the diameter-to-length aspect ratio of heat generation. Sensitivities to variations in tissue properties and insertion depth were also evaluated in numerical models. The most optimal dual-slot geometry of the parametric analysis was then fabricated from semirigid coaxial cable. Antenna reflection coefficients at various insertion depths were recorded in ex vivo bovine livers and compared to numerical results. Ablation zones were then created by applying 50 W for 2–10 min in simulations and ex vivo livers. Mean zone diameter, length, aspect ratio, and reflection coefficients before and after heating were then compared to a conventional monopole antenna using ANOVA with post-hoc t-tests. Statistical significance was indicated for P < 0.05.Results: Antenna performance was highly sensitive to dual-slot geometry. The best-performing designs utilized a proximal slot width of 1 mm, distal slot width of 4 mm ± 1 mm and separation of 8 mm ± 1 mm. These designs were characterized by an active choking mechanism that focused heating to the distal tip of the antenna. A dual-band resonance was observed in the most optimal design, with a minimum reflection coefficient of −20.9 dB at 2.45 and 1.25 GHz. Total operating bandwidth was greater than 1 GHz, but the desired heating pattern was achieved only near 2.45 GHz. As a result, antenna performance was robust to changes in insertion depth and variations in relative permittivity of the surrounding tissue medium. In both simulations and ex vivo liver, the dual-slot antenna created ablations greater in diameter than a coaxial monopole (35 mm ± 2 mm versus 31 mm ± 2 mm; P < 0.05), while also shorter in length (49 mm ± 2 mm versus 60 mm ± 6 mm; P < 0.001) after 10 min. Similar results were obtained after 2 and 5 min as well.Conclusions: Dual-slot antennas can produce more spherical ablation zones while retaining low reflection coefficients. These benefits are obtained without adding to the antenna diameter. Further evaluation for clinical microwave ablation appears warranted. PMID:21859025
Battery cars on superconducting magnetically levitated carriers: One commuting solution
NASA Technical Reports Server (NTRS)
Briggs, B. Mike; Oman, Henry
1992-01-01
Commuting to work in an urban-suburban metropolitan environment is becoming an unpleasant time-wasting process. We applied the technology of communication management to this commuting problem. Communication management is a system-engineering tool that produced today's efficient telephone network. The resulting best commuting option is magnetically levitated carriers of two-passenger, battery-powered, personally-owned local-travel cars. A commuter drives a car to a nearby station, selects a destination, drives on a waiting carrier, and enters an accelerating ramp. A central computer selects an optimum 100 miles-per-hour trunk route, considering existing and forecast traffic; assigns the commuter a travel slot, and subsequently orders switching-station actions. The commuter uses the expensive facilities for only a few minutes during each trip. The cost of travel could be less than 6 cents per mile.
NASA Astrophysics Data System (ADS)
Felix, J.
The management center and new circuit switching services offered by the French Telecom I network are described. Attention is focused on business services. The satellite has a 125 Mbit/sec capability distributed over 5 frequency bands, yielding the equivalent of 1800 channels. Data are transmitted in digitized bursts with TDMA techniques. Besides the management center, Telecom I interfaces with 310 local network antennas with access managed by the center through a reservation service and protocol assignment. The center logs and supervises alarms and network events, monitors traffic, logs taxation charges and manages the man-machine dialog for TDMA and terrestrial operations. Time slots are arranged in terms of minimal 10 min segments. The reservations can be directly accessed by up to 1000 terminals. All traffic is handled on a call-by-call basis.
The practical evaluation of DNA barcode efficacy.
Spouge, John L; Mariño-Ramírez, Leonardo
2012-01-01
This chapter describes a workflow for measuring the efficacy of a barcode in identifying species. First, assemble individual sequence databases corresponding to each barcode marker. A controlled collection of taxonomic data is preferable to GenBank data, because GenBank data can be problematic, particularly when comparing barcodes based on more than one marker. To ensure proper controls when evaluating species identification, specimens not having a sequence in every marker database should be discarded. Second, select a computer algorithm for assigning species to barcode sequences. No algorithm has yet improved notably on assigning a specimen to the species of its nearest neighbor within a barcode database. Because global sequence alignments (e.g., with the Needleman-Wunsch algorithm, or some related algorithm) examine entire barcode sequences, they generally produce better species assignments than local sequence alignments (e.g., with BLAST). No neighboring method (e.g., global sequence similarity, global sequence distance, or evolutionary distance based on a global alignment) has yet shown a notable superiority in identifying species. Finally, "the probability of correct identification" (PCI) provides an appropriate measurement of barcode efficacy. The overall PCI for a data set is the average of the species PCIs, taken over all species in the data set. This chapter states explicitly how to calculate PCI, how to estimate its statistical sampling error, and how to use data on PCR failure to set limits on how much improvements in PCR technology can improve species identification.
Further Flight Tests on the Effectiveness of Handley Page Automatic Control Slots
NASA Technical Reports Server (NTRS)
Pleines, Wilhelm
1932-01-01
Investigation of damping in roll within range of maximum lift with the Albatross L 75, with and without Handley Page automatic control slots, revealed the following: Without control slots, any attempt to go beyond a certain angle of attack near c(sub a max) in glide and climb, is followed by sudden sideslip. The conduct of the airplane throughout the motions in roll, moreover, confirmed that all attempts to higher angles of attack are accompanied by sudden loss of damping in roll.
The Calibration of the Slotted Section for Precision Microwave Measurements
1952-03-01
Calibration Curve for lossless Structures B. The Correction Relations for Dis’sipative Structures C The Effect of an Error in the Variable Short...a’discussipn of protoe effects ? and a methpd of correction? for large insertion depths are given in the literature-* xhrs. reppirt is _ cpnceraed...solely with error source fcp)v *w w«v 3Jhe: presence of the slot in the slptted section Intro dub« effects ? fa)" the slot, loads the vmyeguide
Independence-Based Optimization of Epistemic Model Checking
2017-02-22
favourite restaurant . Their waiter informs them that arrangements have been made with the maitre d’hotel for the bill to be paid anonymously. One of the...nondeterministically selecting a value of either 0 or 1. Each cryptographer is associated with a set of variables, whose values they are able to observe at each...slotsCi is used to represent which slot, if any, agent Ci has selected for its transmission; slotsCi[0] represents that the agent has nothing to transmit
2010-03-01
mounted in its center point. One can see the 62 Figure 45 Shear Specimen Drawing for ASTM Test D7078 wire lead pads coming from the gage in the ±45...wall is much stronger without the slots cut in it. This inward buckling motion tilts the three slots towards inward bulging and this crumpling of the...Structural Composites with Piezoelectric Micro-Constituents. Tech. rep., U.S. Army Research Office. 15. Thomas, J., Qidwai, M., Baucom, J., and Pogue, W
Design and Measurement of Self-Matched, Dual-Frequency Coplanar-Waveguide-Fed Slot Antennas
NASA Technical Reports Server (NTRS)
Omar, Amjad A.; Scardelletti, Maxmilian C.; Hejazi, Zuhair M.; Dib, Nihad
2007-01-01
This report presents two new designs of dual-frequency, coplanar-waveguide-fed, double-folded slot antennas. An important advantage of these antennas is that, because they are self-matched to the feeding coplanar waveguide, they do not need an external matching circuit. This reduces the antenna size and simplifies its design. To verify the designs, the authors measured and compared the return loss and radiation patterns with those obtained using available commercial software with good agreement. Dual-frequency slot antennas;
14 CFR 93.221 - Transfer of slots.
Code of Federal Regulations, 2010 CFR
2010-01-01
... Operations at High Density Traffic Airports § 93.221 Transfer of slots. (a) Except as otherwise provided in... high density traffic airport. Transfers, including leases, shall comply with the following conditions...