Wu, Yating; Kuang, Bin; Wang, Tao; Zhang, Qianwu; Wang, Min
2015-12-01
This paper presents a minimum cost maximum flow (MCMF) based upstream bandwidth allocation algorithm, which supports differentiated QoS for orthogonal frequency division multiple access passive optical networks (OFDMA-PONs). We define a utility function as the metric to characterize the satisfaction degree of an ONU on the obtained bandwidth. The bandwidth allocation problem is then formulated as maximizing the sum of the weighted total utility functions of all ONUs. By constructing a flow network graph, we obtain the optimized bandwidth allocation using the MCMF algorithm. Simulation results show that the proposed scheme improves the performance in terms of mean packet delay, packet loss ratio and throughput.
Energy-saving EPON Bandwidth Allocation Algorithm Supporting ONU's Sleep Mode
Zhang, Yinfa; Ren, Shuai; Liao, Xiaomin; Fang, Yuanyuan
2014-09-01
A new bandwidth allocation algorithm was presented by combining merits of the IPACT algorithm and the cyclic DBA algorithm based on the DBA algorithm for ONU's sleep mode. Simulation results indicate that compared with the normal mode ONU, the ONU's sleep mode can save about 74% of energy. The new algorithm has a smaller average packet delay and queue length in the upstream direction. While in the downstream direction, the average packet delay of the new algorithm is less than polling cycle Tcycle and the average queue length is less than the product of Tcycle and the maximum link rate. The new algorithm achieves a better compromise between energy-saving and ensuring quality of service.
Dias, Maluge Pubuduni Imali; Wong, Elaine
2013-04-22
In this work, we present a comparative study of two just-in-time (JIT) dynamic bandwidth allocation algorithms (DBAs), designed to improve the energy-efficiency of the 10 Gbps Ethernet passive optical networks (10G-EPONs). The algorithms, termed just-in-time with varying polling cycle times (JIT) and just-in-time with fixed polling cycle times (J-FIT), are designed to achieve energy-savings when the idle time of an optical network unit (ONU) is less than the sleep-to-active transition time. This is made possible by a vertical-cavity surface-emitting laser (VCSEL) ONU that can transit into sleep or doze modes during its idle time. We evaluate the performance of the algorithms in terms of polling cycle time, power consumption, percentage of energy-savings, and average delay. The energy-efficiency of a VCSEL ONU that can transition into sleep or doze mode is compared to an always-ON distributed feedback (DFB) laser ONU. Simulation results indicate that both JIT and J-FIT DBA algorithms result in improved energy-efficiency whilst J-FIT performs better in terms of energy-savings at low network loads. The J-FIT DBA however, results in increased average delay in comparison to the JIT DBA. Nonetheless, this increase in average delay is within the acceptable range to support the quality of service (QoS) requirements of the next-generation access networks.
Average Bandwidth Allocation Model of WFQ
Directory of Open Access Journals (Sweden)
Tomáš Balogh
2012-01-01
Full Text Available We present a new iterative method for the calculation of average bandwidth assignment to traffic flows using a WFQ scheduler in IP based NGN networks. The bandwidth assignment calculation is based on the link speed, assigned weights, arrival rate, and average packet length or input rate of the traffic flows. We prove the model outcome with examples and simulation results using NS2 simulator.
modeling the effect of bandwidth allocation on network performance
African Journals Online (AJOL)
Modeling The Effect Of Bandwidth Allocation On Network Performance. MODELING THE EFFECT OF BANDWIDTH ... ABSTRACT. In this paper, a new channel capacity model for interference- limited systems was obtained .... congestion admission control, with the intent of minimizing energy consumption at each terminal.
Bandwidth allocation and pricing problem for a duopoly market
Directory of Open Access Journals (Sweden)
You Peng-Sheng
2011-01-01
Full Text Available This research discusses the Internet service provider (ISP bandwidth allocation and pricing problems for a duopoly bandwidth market with two competitive ISPs. According to the contracts between Internet subscribers and ISPs, Internet subscribers can enjoy their services up to their contracted bandwidth limits. However, in reality, many subscribers may experience the facts that their on-line requests are denied or their connection speeds are far below their contracted speed limits. One of the reasons is that ISPs accept too many subscribers as their subscribers. To avoid this problem, ISPs can set limits for their subscribers to enhance their service qualities. This paper develops constrained nonlinear programming to deal with this problem for two competitive ISPs. The condition for reaching the equilibrium between the two competitive firms is derived. The market equilibrium price and bandwidth resource allocations are derived as closed form solutions.
A Hybrid OFDM-TDM Architecture with Decentralized Dynamic Bandwidth Allocation for PONs
Cevik, Taner
2013-01-01
One of the major challenges of passive optical networks is to achieve a fair arbitration mechanism that will prevent possible collisions from occurring at the upstream channel when multiple users attempt to access the common fiber at the same time. Therefore, in this study we mainly focus on fair bandwidth allocation among users, and present a hybrid Orthogonal Frequency Division Multiplexed/Time Division Multiplexed architecture with a dynamic bandwidth allocation scheme that provides satisfying service qualities to the users depending on their varying bandwidth requirements. Unnecessary delays in centralized schemes occurring during bandwidth assignment stage are eliminated by utilizing a decentralized approach. Instead of sending bandwidth demands to the optical line terminal (OLT) which is the only competent authority, each optical network unit (ONU) runs the same bandwidth demand determination algorithm. ONUs inform each other via signaling channel about the status of their queues. This information is fed to the bandwidth determination algorithm which is run by each ONU in a distributed manner. Furthermore, Light Load Penalty, which is a phenomenon in optical communications, is mitigated by limiting the amount of bandwidth that an ONU can demand. PMID:24194684
Flexible power and bandwidth allocation in mobile satellites
Keyes, L. A.
The introduction of L-band mobile communication services by spot beam satellites creates a payload design challenge due to uncertainty in the location and size of the new market to be served. A combination of payload technologies that allow a flexible allocation of power and bandwidth to any portion of the coverage area is described. Power flexibility is achieved by a novel combination of a low-level beam-forming network and a matrix power module which ensures equal sharing of power among individual amplifiers. This eliminates the loss of efficiency and increased mass when an amplifier associated with a beam must be over-designed to meet uncertainties in power distribution between beams. Flexibility in allocation of bandwidth to beams is achieved by intermediate frequency subdivision of the L-band service categories defined by ITU. These spectral subdivisions are assigned to beams by an IF interconnect matrix having beam ports and filter ports as inputs and outputs, respectively. Two such filter switch matrices are required, one for the inbound L-band to feeder link transponder, and one for the outbound feeder link to L-band transponder.
Bandwidth and power allocation for two-way relaying in overlay cognitive radio systems
Alsharoa, Ahmad M.
2014-12-01
In this paper, the problem of both bandwidth and power allocation for two-way multiple relay systems in overlay cognitive radio (CR) setup is investigated. In the CR overlay mode, primary users (PUs) cooperate with cognitive users (CUs) for mutual benefits. In our framework, we propose that the CUs are allowed to allocate a part of the PUs spectrum to perform their cognitive transmission. In return, acting as an amplify-and-forward two-way relays, they are used to support PUs to achieve their target data rates over the remaining bandwidth. More specifically, CUs acts as relays for the PUs and gain some spectrum as long as they respect a specific power budget and primary quality-of-service constraints. In this context, we first derive closed-form expressions for optimal transmit power allocated to PUs and CUs in order to maximize the cognitive objective. Then, we employ a strong optimization tool based on particle swarm optimization algorithm to find the optimal relay amplification gains and optimal cognitive released bandwidths as well. Our numerical results illustrate the performance of our proposed algorithm for different utility metrics and analyze the impact of some system parameters on the achieved performance.
Bandwidth allocation for video under quality of service constraints
Anjum, Bushra
2014-01-01
We present queueing-based algorithms to calculate the bandwidth required for a video stream so that the three main Quality of Service constraints, i.e., end-to-end delay, jitter and packet loss, are ensured. Conversational and streaming video-based applications are becoming a major part of the everyday Internet usage. The quality of these applications (QoS), as experienced by the user, depends on three main metrics of the underlying network, namely, end-to-end delay, jitter and packet loss. These metrics are, in turn, directly related to the capacity of the links that the video traffic trave
Power allocation, bit loading and sub-carrier bandwidth sizing for OFDM-based cognitive radio
Directory of Open Access Journals (Sweden)
Desai Uday
2011-01-01
Full Text Available Abstract The function of the Radio Resource Management module of a Cognitive Radio (CR system is to evaluate the available resources and assign them to meet the Quality of Service (QoS objectives of the Secondary User (SU, within some constraints on factors which limit the performance of the Primary User (PU. While interference mitigation to the PU spectral band from the SU's transmission has received a lot of attention in recent literature; the novelty of our work is in considering a more realistic and effective approach of dividing the PU into sub-bands, and ensuring that the interference to each of them is below a specified threshold. With this objective, and within a power budget, we execute the tasks of power allocation, bit loading and sizing the sub-carrier bandwidth for an orthogonal frequency division multiplexing (OFDM-based SU. After extensively analyzing the solution form of the optimization problems posed for the resource allocation, we suggest iterative algorithms to meet the aforementioned objectives. The algorithm for sub-carrier bandwidth sizing is novel, and not previously presented in literature. A multiple SU scenario is also considered, which entails assigning sub-carriers to the users, besides the resource allocation. Simulation results are provided, for both single and multi-user cases, which indicate the effectiveness of the proposed algorithms in a CR environment.
Bandwidth allocation strategy for traffic systems of scale-free network
International Nuclear Information System (INIS)
Ling Xiang; Hu MaobBin; Du Wenbo; Jiang Rui; Wu Yonghong; Wu Qingsong
2010-01-01
In this Letter, the bandwidth resource allocation strategy is considered for traffic systems of complex networks. With a finite resource of bandwidth, an allocation strategy with preference parameter α is proposed considering the links importance. The performance of bandwidth allocation strategy is studied for the local routing protocol and the shortest path protocol. When important links are slightly favored in the bandwidth allocation, the system can achieve the optimal traffic performance for the two routing protocols. For the shortest path protocol, we also give a method to estimate the network traffic capacity theoretically.
Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach
Burns, J. E.; Ott, Teunis J.; de Kock, Johan M.; Krzesinski, Anthony E.
2001-07-01
Multi-protocol Label Switching extends the IPv4 destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters: It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm to find and capacitate optimal LSPs. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for several test networks carrying a single traffic class.
Effective Bandwidth Allocation for WiMAX Mesh Network
Directory of Open Access Journals (Sweden)
Hung-Chin Jang
2010-04-01
Full Text Available The aim of this paper is to reduce the media access delay in a WiMAX mesh network. We observe that as the number of subscriber stations (SS in a neighborhood increases, the processes of transmission opportunity (TO competition and 3- way handshake are easy to fail. This may degrade transmission efficiency and increase packet transmission delay. Besides, the minislot allocation defined in the WiMAX mesh mode may cause many lower priority services reserve earlier minislots than that of higher priority services like rtPS. This may cause great negative impact on delay-sensitive traffic. In this paper, we design a QoS classifier to enqueue packets according to different QoS service classes, present a dynamic holdoff exponent mechanism to reduce control subframe delay, and propose a Neighborhood-Based Minislot Allocation (NBMA mechanism to reduce data subframe delay. Simulations show that the proposed methodology outperforms that of IEEE 802.16 and Baye's DynExp in delay, jitter and throughput.
The Bandwidths of a Matrix. A Survey of Algorithms
Directory of Open Access Journals (Sweden)
Mafteiu-Scai Liviu Octavian
2014-12-01
Full Text Available The bandwidth, average bandwidth, envelope, profile and antibandwidth of the matrices have been the subjects of study for at least 45 years. These problems have generated considerable interest over the years because of them practical relevance in areas like: solving the system of equations, finite element methods, circuit design, hypertext layout, chemical kinetics, numerical geophysics etc. In this paper a brief description of these problems are made in terms of their definitions, followed by a comparative study of them, using both approaches: matrix geometry and graph theory. Time evolution of the corresponding algorithms as well as a short description of them are made. The work also contains concrete real applications for which a large part of presented algorithms were developed.
Wei, Pei; Gu, Rentao; Ji, Yuefeng
2014-06-01
As an innovative and promising technology, network coding has been introduced to passive optical networks (PON) in recent years to support inter optical network unit (ONU) communication, yet the signaling process and dynamic bandwidth allocation (DBA) in PON with network coding (NC-PON) still need further study. Thus, we propose a joint signaling and DBA scheme for efficiently supporting differentiated services of inter ONU communication in NC-PON. In the proposed joint scheme, the signaling process lays the foundation to fulfill network coding in PON, and it can not only avoid the potential threat to downstream security in previous schemes but also be suitable for the proposed hybrid dynamic bandwidth allocation (HDBA) scheme. In HDBA, a DBA cycle is divided into two sub-cycles for applying different coding, scheduling and bandwidth allocation strategies to differentiated classes of services. Besides, as network traffic load varies, the entire upstream transmission window for all REPORT messages slides accordingly, leaving the transmission time of one or two sub-cycles to overlap with the bandwidth allocation calculation time at the optical line terminal (the OLT), so that the upstream idle time can be efficiently eliminated. Performance evaluation results validate that compared with the existing two DBA algorithms deployed in NC-PON, HDBA demonstrates the best quality of service (QoS) support in terms of delay for all classes of services, especially guarantees the end-to-end delay bound of high class services. Specifically, HDBA can eliminate queuing delay and scheduling delay of high class services, reduce those of lower class services by at least 20%, and reduce the average end-to-end delay of all services over 50%. Moreover, HDBA also achieves the maximum delay fairness between coded and uncoded lower class services, and medium delay fairness for high class services.
Multi-granularity Bandwidth Allocation for Large-Scale WDM/TDM PON
Gao, Ziyue; Gan, Chaoqin; Ni, Cuiping; Shi, Qiongling
2017-12-01
WDM (wavelength-division multiplexing)/TDM (time-division multiplexing) PON (passive optical network) is being viewed as a promising solution for delivering multiple services and applications, such as high-definition video, video conference and data traffic. Considering the real-time transmission, QoS (quality of services) requirements and differentiated services model, a multi-granularity dynamic bandwidth allocation (DBA) in both domains of wavelengths and time for large-scale hybrid WDM/TDM PON is proposed in this paper. The proposed scheme achieves load balance by using the bandwidth prediction. Based on the bandwidth prediction, the wavelength assignment can be realized fairly and effectively to satisfy the different demands of various classes. Specially, the allocation of residual bandwidth further augments the DBA and makes full use of bandwidth resources in the network. To further improve the network performance, two schemes named extending the cycle of one free wavelength (ECoFW) and large bandwidth shrinkage (LBS) are proposed, which can prevent transmission from interruption when the user employs more than one wavelength. The simulation results show the effectiveness of the proposed scheme.
Dynamic and balanced capacity allocation scheme with uniform bandwidth for OFDM-PON systems
Lei, Cheng; Chen, Hongwei; Chen, Minghua; Yu, Ying; Guo, Qiang; Yang, Sigang; Xie, Shizhong
2015-03-01
As the bitrate of orthogonal frequency division multiplexing passive optical network (OFDM-PON) system is continuously increasing, how to effectively allocate the system bandwidth among the huge number of optical network units (ONUs) is one of the key problems before OFDM-PON can be practical deployed. Unlike traditional bandwidth allocation scheme, in this paper, the transmission performance of single ONU is for the first time taken into consideration and optimized. To reduce the manufacturing complexity and fully utilize the processing ability of the receivers, the system bandwidth is equally distributed to the ONUs. Bit loading is used to allocate the total transmission capacity, and power loading is used to guarantee the ONUs have balanced transmission performance even if they operate at different bitrate. In this way, a dynamic and balanced capacity allocation scheme with uniform bandwidth for OFDM-PON systems can be realized. At last, an experimental system is established to verify the feasibility of the proposed scheme, and the influence that the scheme brings to the whole system is also analyzed.
Zhang, Chongfu; Xiao, Nengwu; Chen, Chen; Yuan, Weicheng; Qiu, Kun
2016-02-01
We propose an energy-efficient orthogonal frequency division multiplexing-based passive optical network (OFDM-PON) using adaptive sleep-mode control and dynamic bandwidth allocation. In this scheme, a bidirectional-centralized algorithm named the receiver and transmitter accurate sleep control and dynamic bandwidth allocation (RTASC-DBA), which has an overall bandwidth scheduling policy, is employed to enhance the energy efficiency of the OFDM-PON. The RTASC-DBA algorithm is used in an optical line terminal (OLT) to control the sleep mode of an optical network unit (ONU) sleep and guarantee the quality of service of different services of the OFDM-PON. The obtained results show that, by using the proposed scheme, the average power consumption of the ONU is reduced by ˜40% when the normalized ONU load is less than 80%, compared with the average power consumption without using the proposed scheme.
A mechanism design approach to bandwidth allocation in tactical data networks
Mour, Ankur
to the defense community. In this thesis, we consider a scenario where a number of military platforms have been tasked with the goal of detecting and tracking targets. The sensors onboard a military platform have a partial and inaccurate view of the operating picture and need to make use of data transmitted from neighboring sensors in order to improve the accuracy of their own measurements. The communication takes place over tactical data networks with scarce bandwidth. The problem is compounded by the possibility that the local goals of military platforms might not be aligned with the global system goal. Such a scenario might occur in multi-flag, multi-platform military exercises, where the military commanders of each platform are more concerned with the well-being of their own platform over others. Therefore there is a need to design a mechanism that efficiently allocates the flow of data within the network to ensure that the resulting global performance maximizes the information gain of the entire system, despite the self-interested actions of the individual actors. We propose a two-stage mechanism based on modified strictly-proper scoring rules, with unknown costs, whereby multiple sensor platforms can provide estimates of limited precisions and the center does not have to rely on knowledge of the actual outcome when calculating payments. In particular, our work emphasizes the importance of applying robust optimization techniques to deal with the uncertainty in the operating environment. We apply our robust optimization - based scoring rules algorithm to an agent-based model framework of the combat tactical data network, and analyze the results obtained. Through the work we hope to demonstrate how mechanism design, perched at the intersection of game theory and microeconomics, is aptly suited to address one set of challenges of the ULS system paradigm - challenges not amenable to traditional system engineering approaches.
Cognitive radio resource allocation based on coupled chaotic genetic algorithm
International Nuclear Information System (INIS)
Zu Yun-Xiao; Zhou Jie; Zeng Chang-Chang
2010-01-01
A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed
Two-dimensional priority-based dynamic resource allocation algorithm for QoS in WDM/TDM PON networks
Sun, Yixin; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Zhang, Qi; Rao, Lan
2018-01-01
Wavelength division multiplexing/time division multiplexing (WDM/TDM) passive optical networks (PON) is being viewed as a promising solution for delivering multiple services and applications. The hybrid WDM / TDM PON uses the wavelength and bandwidth allocation strategy to control the distribution of the wavelength channels in the uplink direction, so that it can ensure the high bandwidth requirements of multiple Optical Network Units (ONUs) while improving the wavelength resource utilization. Through the investigation of the presented dynamic bandwidth allocation algorithms, these algorithms can't satisfy the requirements of different levels of service very well while adapting to the structural characteristics of mixed WDM / TDM PON system. This paper introduces a novel wavelength and bandwidth allocation algorithm to efficiently utilize the bandwidth and support QoS (Quality of Service) guarantees in WDM/TDM PON. Two priority based polling subcycles are introduced in order to increase system efficiency and improve system performance. The fixed priority polling subcycle and dynamic priority polling subcycle follow different principles to implement wavelength and bandwidth allocation according to the priority of different levels of service. A simulation was conducted to study the performance of the priority based polling in dynamic resource allocation algorithm in WDM/TDM PON. The results show that the performance of delay-sensitive services is greatly improved without degrading QoS guarantees for other services. Compared with the traditional dynamic bandwidth allocation algorithms, this algorithm can meet bandwidth needs of different priority traffic class, achieve low loss rate performance, and ensure real-time of high priority traffic class in terms of overall traffic on the network.
Bradley, D. B.; Irwin, J. D.
1974-01-01
A computer simulation model for a multiprocessor computer is developed that is useful for studying the problem of matching multiprocessor's memory space, memory bandwidth and numbers and speeds of processors with aggregate job set characteristics. The model assumes an input work load of a set of recurrent jobs. The model includes a feedback scheduler/allocator which attempts to improve system performance through higher memory bandwidth utilization by matching individual job requirements for space and bandwidth with space availability and estimates of bandwidth availability at the times of memory allocation. The simulation model includes provisions for specifying precedence relations among the jobs in a job set, and provisions for specifying precedence execution of TMR (Triple Modular Redundant and SIMPLEX (non redundant) jobs.
Wang, Yunyun; Li, Hui; Liu, Yuze; Ji, Yuefeng; Li, Hongfa
2017-10-01
With the development of large video services and cloud computing, the network is increasingly in the form of services. In SDON, the SDN controller holds the underlying physical resource information, thus allocating the appropriate resources and bandwidth to the VON service. However, for some services that require extremely strict QoT (quality of transmission), the shortest distance path algorithm is often unable to meet the requirements because it does not take the link spectrum resources into account. And in accordance with the choice of the most unoccupied links, there may be more spectrum fragments. So here we propose a new RMLSA (the routing, modulation Level, and spectrum allocation) algorithm to reduce the blocking probability. The results show about 40% less blocking probability than the shortest-distance algorithm and the minimum usage of the spectrum priority algorithm. This algorithm is used to satisfy strict request of QoT for demands.
The entity-to-algorithm allocation problem: Extending the analysis
CSIR Research Space (South Africa)
Grobler, J
2014-12-01
Full Text Available This paper extends the investigation into the algorithm selection problem in hyper-heuristics, otherwise referred to as the entity-to-algorithm allocation problem, introduced by Grobler et al.. Two newly developed population-based portfolio...
Cluster Formation and Joint Power-Bandwidth Allocation for Imperfect NOMA in DL-HetNets
Celik, Abdulkadir
2017-04-15
Non-orthogonal multiple access (NOMA) has recently drawn attentions on its ability to fairly serve multiple users on the same radio resource with a desirable performance. However, achievable NOMA gain is primarily limited by channel gain disparity and successive interference cancellation (SIC) receiver characteristics. Accordingly, we introduce an imperfect SIC receiver model considering the power disparity and sensitivity constraints, delay tolerance, and residual interference due to detection and estimation errors. Then, a generic cluster formation (CF) and Power-Bandwidth Allocation (PBA) is formulated as a mixed-integer non-linear programming (MINLP) problem for downlink (DL) heterogeneous networks (HetNets). After dividing the MINLP problem into mixed-integer and non-linear subprobems, we first transform CF into a multi-partite matching, which is solved sequentially using bi-partite matching techniques. For sumrate maximization, max-min fairness, and energy & spectrum efficiency objectives, we secondly put highly non-convex joint PBA into a convex form using geometric programming (GP). Extensive simulations unleash the potential of NOMA to handle large number of users, traffic offloading, and user fairness.
Alsharoa, Ahmad
2015-10-08
This paper studies the achievable cognitive sum rate of an overlay cognitive radio (CR) system assisted with multiple antennas two-way relays in which primary users (PUs) cooperate with cognitive users (CUs) for mutual benefits. In this context, the problem of both bandwidth and power allocation is investigated. We propose that the CUs are allowed to allocate a part of the PUs spectrum to perform their cognitive transmission. In return, acting as amplify-and-forward two-way relays, they are exploited to support PUs to reach their target data rates over the remaining bandwidth. Power expressions for optimal transmit power allocated per PU and CU antenna are derived under primary quality-of-service constraint in addition to bandwidth and power budget constraints. More specifically, CUs act as relays for the PUs transmission and gain some spectrum as long as they respect these constraints. After deriving the optimal transmit powers, we employ a strong optimization tool based on swarm intelligence to optimize the full and complex relay amplification gain matrices in addition to the bandwidths released to primary and cognitive transmission. Furthermore, three different utility functions are considered in our optimization problems depending on the level of fairness among CUs.
Can abnormal returns be earned on bandwidth-bounded currencies? Evidence from a genetic algorithm
Pedro Godinho
2012-01-01
Most of the studies about the Foreign Exchange market (Forex) analyse the behaviour of currencies that are allowed to float freely (or almost freely), but some currencies are still bounded by bandwidths (either disclosed or undisclosed). In this paper, I try to find out whether two bandwidth-bounded currencies, the Hong Kong dollar (HKD) and the Singapore dollar (SGD), present opportunities for abnormal returns. I consider a set of trading rules, and I use a genetic algorithm to optimise both...
Development and analysis of a three phase cloudlet allocation algorithm
Directory of Open Access Journals (Sweden)
Sudip Roy
2017-10-01
Full Text Available Cloud computing is one of the most popular and pragmatic topics of research nowadays. The allocation of cloudlet(s to suitable VM(s is one of the most challenging areas of research in the domain of cloud computing. This paper highlights a new cloudlet allocation algorithm which improves the performance of a cloud service provider (CSP in comparison with the other existing cloudlet allocation algorithms. The proposed Range wise Busy-checking 2-way Balanced (RB2B cloudlet allocation algorithm optimizes few basic parameters associated with the performance analysis. An extensive simulation is done to evaluate the proposed algorithm using Cloudsim to attest its efficacy in comparison to the other existing allocation policies.
Yi, Tianzhu; He, Zhihua; He, Feng; Dong, Zhen; Wu, Mnaqing
2017-05-29
This paper presents an efficient and precise imaging algorithm for the large bandwidth sliding spotlight synthetic aperture radar (SAR). The existing sub-aperture processing method based on the baseband azimuth scaling (BAS) algorithm cannot cope with the high order phase coupling along the range and azimuth dimensions. This coupling problem causes defocusing along the range and azimuth dimensions. This paper proposes a generalized chirp scaling (GCS)-BAS processing algorithm, which is based on the GCS algorithm. It successfully mitigates the deep focus along the range dimension of a sub-aperture of the large bandwidth sliding spotlight SAR, as well as high order phase coupling along the range and azimuth dimensions. Additionally, the azimuth focusing can be achieved by this azimuth scaling method. Simulation results demonstrate the ability of the GCS-BAS algorithm to process the large bandwidth sliding spotlight SAR data. It is proven that great improvements of the focus depth and imaging accuracy are obtained via the GCS-BAS algorithm.
Signal Processing Algorithm for Controlling Dynamic Bandwidth of Fiber Optic Accelerometer
International Nuclear Information System (INIS)
Kim, Dae Hyun
2007-01-01
This paper presents a signal processing algorithm to control the dynamic bandwidth of a single-degree-of-freedom (SDF) dynamic sensor system. An accelerometer is a representative SDF sensor system. In this paper, a moire-fringe-based fiber optic accelerometer is newly used for the test of the algorithm. The accelerometer is composed of one mass, one damper and one spring as a SDF dynamic system. In order to increase the dynamic bandwidth of the accelerometer, it is needed to increase the spring constant or decrease the mass. However, there are mechanical difficulties of this adjustment. Therefore, the presented signal processing algorithm is very effective to overcome the difficulties because it is just adjustment in the signal processing software. In this paper, the novel fiber optic accelerometer is introduced shortly, and the algorithm is applied to the fiber optic accelerometer to control its natural frequency and damping ratio. Several simulations and experiments are carried out to prove the performance of the algorithm. As a result, it is shown that the presented signal processing algorithm is a good way to broaden the dynamic bandwidth of the fiber optic accelerometer
A generic optimization algorithm for the allocation of DP actuators
van Daalen, E.F.G.; Cozijn, J.L.; Loussouarn, C.; Hemker, P.W.
2011-01-01
In this paper we present a generic optimization algorithm for the allocation of dynamic positioning actuators, such as azimuthing thrusters and fixed thrusters. The algorithm is based on the well-known Lagrange multipliers method. In the present approach the Lagrangian functional represents not only
An Improved Dynamic Joint Resource Allocation Algorithm Based on SFR
Directory of Open Access Journals (Sweden)
Yibing Li
2016-04-01
Full Text Available Inter-cell interference (ICI is the main factor affecting system capacity and spectral efficiency. Effective spectrum resource management is an important and challenging issue for the design of wireless communication systems. The soft frequency reuse (SFR is regarded as an interesting approach to significantly eliminate ICI. However, the allocation of resource is fixed prior to system deployment in static SFR. To overcome this drawback, this paper adopts a distributed method and proposes an improved dynamic joint resource allocation algorithm (DJRA. The improved scheme adaptively adjusts resource allocation based on the real-time user distribution. DJRA first detects the edge-user distribution vector to determine the optimal scheme, which guarantees that all the users have available resources and the number of iterations is reduced. Then, the DJRA maximizes the throughput for each cell via optimizing resource and power allocation. Due to further eliminate interference, the sector partition method is used in the center region and in view of fairness among users, the novel approach adds the proportional fair algorithm at the end of DJRA. Simulation results show that the proposed algorithm outperforms previous approaches for improving the system capacity and cell edge user performance.
Fair Adaptive Bandwidth and Subchannel Allocation in the WiMAX Uplink
Directory of Open Access Journals (Sweden)
Antoni Morell
2009-01-01
Full Text Available In some modern communication systems, as it is the case of WiMAX, it has been decided to implement Demand Assignment Multiple Access (DAMA solutions. End-users request transmission opportunities before accessing the system, which provides an efficient way to share system resources. In this paper, we briefly review the PHY and MAC layers of an OFDMA-based WiMAX system, and we propose to use a Network Utility Maximization (NUM framework to formulate the DAMA strategy foreseen in the uplink of IEEE 802.16. Utility functions are chosen to achieve fair solutions attaining different degrees of fairness and to further support the QoS requirements of the services in the system. Moreover, since the standard allocates resources in a terminal basis but each terminal may support several services, we develop a new decomposition technique, the coupled-decompositions method, that obtains the optimal service flow allocation with a small number of iterations (the improvement is significant when compared to other known solutions. Furthermore, since the PHY layer in mobile WiMAX has the means to adapt the transport capacities of the links between the Base Station (BS and the Subscriber Stations (SSs, the proposed PHY-MAC cross-layer design uses this extra degree of freedom in order to enhance the network utility.
Zhang, Yuchao; Gan, Chaoqin; Gou, Kaiyu; Hua, Jian
2017-07-01
ONU schedule algorithm and ONU transfer mechanism for multi-subsystem-based VPONs' management is proposed in this paper. To avoid frequent wavelength switch and realize high system stability, ONU schedule algorithm is presented for wavelength allocation by introducing box-filling model. At the same time, judgement mechanism is designed to filter wavelength-increased request caused by slight bandwidth fluctuation of VPON. To share remained bandwidth among VPONs, ONU transfer mechanism is put forward according to flexible wavelength routing. To manage wavelength resource of entire network and wavelength requirement from VPONs, information-managed matrix model is constructed. Finally, the effectiveness of the proposed scheme is demonstrated by simulation and analysis.
Un algorithme d'allocation de bande passante satellitaire
Alouf, Sara; Altman, Eitan; Galtier, Jérôme; Lalande, Jean-François; Touati, Corinne
2004-01-01
Ce rapport présente un algorithme d'allocation de ressources pour les réseaux satellitaires. Il s'agit de prévoir un plan d'allocation en temps/fréquence pour un ensemble de terminaux ayant une configuration géométrique définie et soumis à des contraintes d'interférence. On cherche à minimiser la taille du plan de fréquences tout en garantissant que toutes les demandes des terminaux, en termes de bande passante et pour différents types, sont satisfaites. L'algorithme proposé repose sur deux t...
Optimization Algorithms and Equilibrium Analysis for Dynamic Resource Allocation
2011-11-30
throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power allocation over a multichannel link. The formulation...user (player) aims to maximize his own opportunistic throughput by choosing jointly the sensing duration, the detection thresholds, and the vector power...problems. Award: EURASIP 2011 Best Paper Award for the joint paper with Zhi-Quan Luo: Analysis of iterative waterfilling algorithm for multiuser power
Hazlett, Thomas W.
2001-01-01
In 1959 the Federal Communications Commission invited economist Ronald Coase to testify about his proposal for market allocation of radio spectrum rights. The FCC's first question: 'Is this all a big joke'' Today, however, leading policy makers, including the current FCC Chair, decry the 'spectrum drought' produced by administrative allocation and call for the creation of private bandwidth markets. This essay examines marketplace trends driving regulators' change of humor, and considers the p...
A Game Theoretic Framework for Bandwidth Allocation and Pricing in Federated Wireless Networks
Gu, Bo; Yamori, Kyoko; Xu, Sugang; Tanaka, Yoshiaki
With the proliferation of IEEE 802.11 wireless local area networks, large numbers of wireless access points have been deployed, and it is often the case that a user can detect several access points simultaneously in dense metropolitan areas. Most owners, however, encrypt their networks to prevent the public from accessing them due to the increased traffic and security risk. In this work, we use pricing as an incentive mechanism to motivate the owners to share their networks with the public, while at the same time satisfying users' service demand. Specifically, we propose a “federated network” concept, in which radio resources of various wireless local area networks are managed together. Our algorithm identifies two candidate access points with the lowest price being offered (if available) to each user. We then model the price announcements of access points as a game, and characterize the Nash Equilibrium of the system. The efficiency of the Nash Equilibrium solution is evaluated via simulation studies as well.
The implement of Talmud property allocation algorithm based on graphic point-segment way
Cen, Haifeng
2017-04-01
Under the guidance of the Talmud allocation scheme's theory, the paper analyzes the algorithm implemented process via the perspective of graphic point-segment way, and designs the point-segment way's Talmud property allocation algorithm. Then it uses Java language to implement the core of allocation algorithm, by using Android programming to build a visual interface.
An OFDMA resource allocation algorithm based on coalitional games
Directory of Open Access Journals (Sweden)
Bacci Giacomo
2011-01-01
Full Text Available Abstract This work investigates a fair adaptive resource management criterion (in terms of transmit powers and subchannel assignment for the uplink of an orthogonal frequency-division multiple access network, populated by mobile users with constraints in terms of target data rates. The inherent optimization problem is tackled with the analytical tools of coalitional game theory, and a practical algorithm based on Markov modeling is introduced. The proposed scheme allows the mobile devices to fulfill their rate demands exactly with a minimum utilization of network resources. Simulation results show that the average number of operations of the proposed iterative algorithm are much lower than K · N, where N and K are the number of allocated subcarriers and of mobile terminals.
Scheduling with Group Dynamics: a Multi-Robot Task Allocation Algorithm based on Vacancy Chains
National Research Council Canada - National Science Library
Dahl, Torbjorn S; Mataric, Maja J; Sukhatme, Gaurav S
2002-01-01
.... We present a multi-robot task allocation algorithm that is sensitive to group dynamics. Our algorithm is based on vacancy chains, a resource distribution process common in human and animal societies...
Healy, John J; Sheridan, John T
2011-05-01
The product of the spatial and spatial frequency extents of a wave field has proven useful in the analysis of the sampling requirements of numerical simulations. We propose that the ratio of these quantities is also illuminating. We have shown that the distance at which the so-called "direct method" becomes more efficient than the so-called "spectral method" for simulations of Fresnel transforms may be written in terms of this space-bandwidth ratio. We have proposed generalizations of these algorithms for numerical simulations of general ABCD systems and derived expressions for the "transition space-bandwidth ratio," above which the generalization of the spectral method is the more efficient algorithm and below which the generalization of the direct method is preferable.
Speeding up the Algorithm for Finding Optimal Kernel Bandwidth in Spike Train Analysis
Czech Academy of Sciences Publication Activity Database
Šanda, Pavel
2010-01-01
Roč. 6, č. 1 (2010), s. 73-75 ISSN 1801-5603 Grant - others:Univerzita Karlova(CZ) SVV-2010-265-513 Institutional research plan: CEZ:AV0Z50110509 Keywords : neural coding * kernel bandwidth estimation * parallel computing Subject RIV: FH - Neurology
Adaptable bandwidth planning using reinforcement learning
Directory of Open Access Journals (Sweden)
Dirk Hetzer
2006-08-01
Full Text Available In order to improve the bandwidth allocation considering feedback of operational environment, adaptable bandwidth planning based on reinforcement learning is proposed. The approach is based on new constrained scheduling algorithms controlled by reinforcement learning techniques. Different constrained scheduling algorithms,, such as "conflict free scheduling with minimum duration", "partial displacement" and "pattern oriented scheduling" are defined and implemented. The scheduling algorithms are integrated into reinforcement learning strategies. These strategies include: - Q-learning for selection of optimal planning schedule using Q-values; - Informed Q-learning for exploitation and handling of prior-knowledge (patterns of network behaviour; - Relational Q-learning for improving of bandwidth allocation policies dynamically in operational networks considering actual network performance data. Scenarios based on integration of the scheduling algorithms and reinforcement learning techniques in the experimental monitoring and bandwidth planning system called QORE (QoS and resource optimisation are given. The proposed adaptable bandwidth planning is required for more efficient usage of network resources.
Availability Allocation of Networked Systems Using Markov Model and Heuristics Algorithm
Directory of Open Access Journals (Sweden)
Ruiying Li
2014-01-01
Full Text Available It is a common practice to allocate the system availability goal to reliability and maintainability goals of components in the early design phase. However, the networked system availability is difficult to be allocated due to its complex topology and multiple down states. To solve these problems, a practical availability allocation method is proposed. Network reliability algebraic methods are used to derive the availability expression of the networked topology on the system level, and Markov model is introduced to determine that on the component level. A heuristic algorithm is proposed to obtain the reliability and maintainability allocation values of components. The principles applied in the AGREE reliability allocation method, proposed by the Advisory Group on Reliability of Electronic Equipment, and failure rate-based maintainability allocation method persist in our allocation method. A series system is used to verify the new algorithm, and the result shows that the allocation based on the heuristic algorithm is quite accurate compared to the traditional one. Moreover, our case study of a signaling system number 7 shows that the proposed allocation method is quite efficient for networked systems.
Research on Multirobot Pursuit Task Allocation Algorithm Based on Emotional Cooperation Factor
Directory of Open Access Journals (Sweden)
Baofu Fang
2014-01-01
Full Text Available Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots’ individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on emotional cooperation factor. Combined with the two-step auction algorithm recruiting team leaders and team collaborators, set up pursuit teams, and finally use certain strategies to complete the pursuit task. In order to verify the effectiveness of this algorithm, some comparing experiments have been done with the instantaneous greedy optimal auction algorithm; the results of experiments show that the total pursuit time and total team revenue can be optimized by using this algorithm.
An algorithm and a Tool for Wavelength Allocation in OMS-SP Ring Architecture
DEFF Research Database (Denmark)
Riaz, Muhammad Tahir; Pedersen, Jens Myrup; Madsen, Ole Brun
2006-01-01
OMS-SP ring is one of the well known architectures in Wavelength Division Multiplexing based optical fiber networks. The architecture supports a restorable full mesh in an optical fiber ring using multiple light wavelengths. The paper presents an algorithm to allocate wavelengths in the OMS-SP ri...... architecture. A tool is also introduced which implements the algorithm and assigns wavelengths. The proposed algorithm uses fewer number of wavelengths than the classical allocation method. The algorithm is described and results are presented.......OMS-SP ring is one of the well known architectures in Wavelength Division Multiplexing based optical fiber networks. The architecture supports a restorable full mesh in an optical fiber ring using multiple light wavelengths. The paper presents an algorithm to allocate wavelengths in the OMS-SP ring...
Gui, Zhipeng; Yu, Manzhu; Yang, Chaowei; Jiang, Yunfeng; Chen, Songqing; Xia, Jizhe; Huang, Qunying; Liu, Kai; Li, Zhenlong; Hassan, Mohammed Anowarul; Jin, Baoxuan
2016-01-01
Dust storm has serious disastrous impacts on environment, human health, and assets. The developments and applications of dust storm models have contributed significantly to better understand and predict the distribution, intensity and structure of dust storms. However, dust storm simulation is a data and computing intensive process. To improve the computing performance, high performance computing has been widely adopted by dividing the entire study area into multiple subdomains and allocating each subdomain on different computing nodes in a parallel fashion. Inappropriate allocation may introduce imbalanced task loads and unnecessary communications among computing nodes. Therefore, allocation is a key factor that may impact the efficiency of parallel process. An allocation algorithm is expected to consider the computing cost and communication cost for each computing node to minimize total execution time and reduce overall communication cost for the entire simulation. This research introduces three algorithms to optimize the allocation by considering the spatial and communicational constraints: 1) an Integer Linear Programming (ILP) based algorithm from combinational optimization perspective; 2) a K-Means and Kernighan-Lin combined heuristic algorithm (K&K) integrating geometric and coordinate-free methods by merging local and global partitioning; 3) an automatic seeded region growing based geometric and local partitioning algorithm (ASRG). The performance and effectiveness of the three algorithms are compared based on different factors. Further, we adopt the K&K algorithm as the demonstrated algorithm for the experiment of dust model simulation with the non-hydrostatic mesoscale model (NMM-dust) and compared the performance with the MPI default sequential allocation. The results demonstrate that K&K method significantly improves the simulation performance with better subdomain allocation. This method can also be adopted for other relevant atmospheric and numerical
Multi-robot task allocation based on two dimensional artificial fish swarm algorithm
Zheng, Taixiong; Li, Xueqin; Yang, Liangyi
2007-12-01
The problem of task allocation for multiple robots is to allocate more relative-tasks to less relative-robots so as to minimize the processing time of these tasks. In order to get optimal multi-robot task allocation scheme, a twodimensional artificial swarm algorithm based approach is proposed in this paper. In this approach, the normal artificial fish is extended to be two dimension artificial fish. In the two dimension artificial fish, each vector of primary artificial fish is extended to be an m-dimensional vector. Thus, each vector can express a group of tasks. By redefining the distance between artificial fish and the center of artificial fish, the behavior of two dimension fish is designed and the task allocation algorithm based on two dimension artificial swarm algorithm is put forward. At last, the proposed algorithm is applied to the problem of multi-robot task allocation and comparer with GA and SA based algorithm is done. Simulation and compare result shows the proposed algorithm is effective.
A Heuristic Optimal Discrete Bit Allocation Algorithm for Margin Maximization in DMT Systems
Directory of Open Access Journals (Sweden)
Dong Shi-Wei
2007-01-01
Full Text Available A heuristic optimal discrete bit allocation algorithm is proposed for solving the margin maximization problem in discrete multitone (DMT systems. Starting from an initial equal power assignment bit distribution, the proposed algorithm employs a multistaged bit rate allocation scheme to meet the target rate. If the total bit rate is far from the target rate, a multiple-bits loading procedure is used to obtain a bit allocation close to the target rate. When close to the target rate, a parallel bit-loading procedure is used to achieve the target rate and this is computationally more efficient than conventional greedy bit-loading algorithm. Finally, the target bit rate distribution is checked, if it is efficient, then it is also the optimal solution; else, optimal bit distribution can be obtained only by few bit swaps. Simulation results using the standard asymmetric digital subscriber line (ADSL test loops show that the proposed algorithm is efficient for practical DMT transmissions.
A Heuristic Optimal Discrete Bit Allocation Algorithm for Margin Maximization in DMT Systems
Zhu, Li-Ping; Yao, Yan; Zhou, Shi-Dong; Dong, Shi-Wei
2007-12-01
A heuristic optimal discrete bit allocation algorithm is proposed for solving the margin maximization problem in discrete multitone (DMT) systems. Starting from an initial equal power assignment bit distribution, the proposed algorithm employs a multistaged bit rate allocation scheme to meet the target rate. If the total bit rate is far from the target rate, a multiple-bits loading procedure is used to obtain a bit allocation close to the target rate. When close to the target rate, a parallel bit-loading procedure is used to achieve the target rate and this is computationally more efficient than conventional greedy bit-loading algorithm. Finally, the target bit rate distribution is checked, if it is efficient, then it is also the optimal solution; else, optimal bit distribution can be obtained only by few bit swaps. Simulation results using the standard asymmetric digital subscriber line (ADSL) test loops show that the proposed algorithm is efficient for practical DMT transmissions.
Page, Andrew J.; Keane, Thomas M.; Naughton, Thomas J.
2010-01-01
We present a multi-heuristic evolutionary task allocation algorithm to dynamically map tasks to processors in a heterogeneous distributed system. It utilizes a genetic algorithm, combined with eight common heuristics, in an effort to minimize the total execution time. It operates on batches of unmapped tasks and can preemptively remap tasks to processors. The algorithm has been implemented on a Java distributed system and evaluated with a set of six problems from the areas of bioinformatics, biomedical engineering, computer science and cryptography. Experiments using up to 150 heterogeneous processors show that the algorithm achieves better efficiency than other state-of-the-art heuristic algorithms. PMID:20862190
A CR Spectrum Allocation Algorithm in Smart Grid Wireless Sensor Network
Directory of Open Access Journals (Sweden)
Wei He
2014-10-01
Full Text Available Cognitive radio (CR method was introduced in smart grid communication systems to resolve potential maladies such as the coexistence of heterogeneous networks, overloaded data flow, diversity in data structures, and unstable quality of service (QOS. In this paper, a cognitive spectrum allocation algorithm based on non-cooperative game theory is proposed. The CR spectrum allocation model was developed by modifying the traditional game model via the insertion of a time variable and a critical function. The computing simulation result shows that the improved spectrum allocation algorithm can achieve stable spectrum allocation strategies and avoid the appearance of multi-Nash equilibrium at the expense of certain sacrifices in the system utility. It is suitable for application in distributed cognitive networks in power grids, thus contributing to the improvement of the isomerism and data capacity of power communication systems.
Keller Alevtina; Vinogradova Tatyana
2017-01-01
The article considers the issue of allocation of depreciation costs in the dynamic inputoutput model of an industrial enterprise. Accounting the depreciation costs in such a model improves the policy of fixed assets management. It is particularly relevant to develop the algorithm for the allocation of depreciation costs in the construction of dynamic input-output model of an industrial enterprise, since such enterprises have a significant amount of fixed assets. Implementation of terms of the...
Directory of Open Access Journals (Sweden)
Arfianto Fahmi
2014-11-01
Full Text Available In this paper, the problem of subcarrier allocation on chunk-by-chunk basis in SC-FDMA uplink systems is investigated. Improved mean enhanced greedy algorithms are proposed for performing joint-user and chunk-based allocation at each transmission time interval. Selection criteria based on spectral efficiency and fairness are also proposed to choose the final allocation at each transmission time interval. Simulation results show that when the number of users and the velocity of the users were varied, the improved algorithms that use selection criteria based on spectral efficiency and fairness could outperform the existing mean greedy algorithms that employ user-based allocation in terms of spectral efficiency and fairness. Moreover, the improved algorithms not only showed better performance but also had the same time complexity as the existing mean greedy algorithms.
A dynamic programming algorithm for the space allocation and aisle positioning problem
DEFF Research Database (Denmark)
Bodnar, Peter; Lysgaard, Jens
2014-01-01
The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage...... locations. In this paper, we develop an exact dynamic programming algorithm for the SAAPP. The computational study shows that our exact algorithm can be used to find optimal solutions for numerous SAAPP instances of moderate size....
Naeem, Muhammad; Pareek, Udit; Lee, Daniel C; Anpalagan, Alagan
2013-04-12
Due to the rapid increase in the usage and demand of wireless sensor networks (WSN), the limited frequency spectrum available for WSN applications will be extremely crowded in the near future. More sensor devices also mean more recharging/replacement of batteries, which will cause significant impact on the global carbon footprint. In this paper, we propose a relay-assisted cognitive radio sensor network (CRSN) that allocates communication resources in an environmentally friendly manner. We use shared band amplify and forward relaying for cooperative communication in the proposed CRSN. We present a multi-objective optimization architecture for resource allocation in a green cooperative cognitive radio sensor network (GC-CRSN). The proposed multi-objective framework jointly performs relay assignment and power allocation in GC-CRSN, while optimizing two conflicting objectives. The first objective is to maximize the total throughput, and the second objective is to minimize the total transmission power of CRSN. The proposed relay assignment and power allocation problem is a non-convex mixed-integer non-linear optimization problem (NC-MINLP), which is generally non-deterministic polynomial-time (NP)-hard. We introduce a hybrid heuristic algorithm for this problem. The hybrid heuristic includes an estimation-of-distribution algorithm (EDA) for performing power allocation and iterative greedy schemes for constraint satisfaction and relay assignment. We analyze the throughput and power consumption tradeoff in GC-CRSN. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results.
Overhead-Aware-Best-Fit (OABF) Resource Allocation Algorithm for Minimizing VM Launching Overhead
Energy Technology Data Exchange (ETDEWEB)
Wu, Hao [IIT; Garzoglio, Gabriele [Fermilab; Ren, Shangping [IIT, Chicago; Timm, Steven [Fermilab; Noh, Seo Young [KISTI, Daejeon
2014-11-11
FermiCloud is a private cloud developed in Fermi National Accelerator Laboratory to provide elastic and on-demand resources for different scientific research experiments. The design goal of the FermiCloud is to automatically allocate resources for different scientific applications so that the QoS required by these applications is met and the operational cost of the FermiCloud is minimized. Our earlier research shows that VM launching overhead has large variations. If such variations are not taken into consideration when making resource allocation decisions, it may lead to poor performance and resource waste. In this paper, we show how we may use an VM launching overhead reference model to minimize VM launching overhead. In particular, we first present a training algorithm that automatically tunes a given refer- ence model to accurately reflect FermiCloud environment. Based on the tuned reference model for virtual machine launching overhead, we develop an overhead-aware-best-fit resource allocation algorithm that decides where and when to allocate resources so that the average virtual machine launching overhead is minimized. The experimental results indicate that the developed overhead-aware-best-fit resource allocation algorithm can significantly improved the VM launching time when large number of VMs are simultaneously launched.
An Enhanced OFDM Resource Allocation Algorithm in C-RAN Based 5G Public Safety Network
Directory of Open Access Journals (Sweden)
Lei Feng
2016-01-01
Full Text Available Public Safety Network (PSN is the network for critical communication when disaster occurs. As a key technology in 5G, Cloud-Radio Access Network (C-RAN can play an important role in PSN instead of LTE-based RAN. This paper firstly introduces C-RAN based PSN architecture and models the OFDM resource allocation problem in C-RAN based PSN as an integer quadratic programming, which allows the trade-off between expected bitrates and allocating fairness of PSN Service User (PSU. However, C-RAN based PSN needs to improve the efficiency of allocating algorithm because of a mass of PSU-RRH associations when disaster occurs. To deal with it, the resources allocating problem with integer variables is relaxed into one with continuous variables in the first step and an algorithm based on Generalized Bender’s Decomposition (GBD is proposed to solve it. Then we use Feasible Pump (FP method to get a feasible integer solution on the original OFDM resources allocation problem. The final experiments show the total throughput achieved by C-RAN based PSN is at most higher by 19.17% than the LTE-based one. And the average computational time of the proposed GBD and FP algorithm is at most lower than Barrier by 51.5% and GBD with no relaxation by 30.1%, respectively.
A Computational Study of Approximation Algorithms for a Minmax Resource Allocation Problem
Directory of Open Access Journals (Sweden)
Bogusz Przybysławski
2012-01-01
Full Text Available A basic resource allocation problem with uncertain costs has been discussed. The problem is to minimize the total cost of choosing exactly p items out of n available. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a solution. This problem is known to be NP-hard, but several approximation algorithms exist. The aim of this paper is to investigate the quality of the solutions returned by these approximation algorithms. According to the results obtained, the randomized algorithms described are fast and output solutions of good quality, even if the problem size is large. (original abstract
Single Allocation Hub-and-spoke Networks Design Based on Ant Colony Optimization Algorithm
Directory of Open Access Journals (Sweden)
Yang Pingle
2014-10-01
Full Text Available Capacitated single allocation hub-and-spoke networks can be abstracted as a mixed integer linear programming model equation with three variables. Introducing an improved ant colony algorithm, which has six local search operators. Meanwhile, introducing the "Solution Pair" concept to decompose and optimize the composition of the problem, the problem can become more specific and effectively meet the premise and advantages of using ant colony algorithm. Finally, location simulation experiment is made according to Australia Post data to demonstrate this algorithm has good efficiency and stability for solving this problem.
A Spatial Queuing-Based Algorithm for Multi-Robot Task Allocation
Directory of Open Access Journals (Sweden)
William Lenagh
2015-08-01
Full Text Available Multi-robot task allocation (MRTA is an important area of research in autonomous multi-robot systems. The main problem in MRTA is to allocate a set of tasks to a set of robots so that the tasks can be completed by the robots while ensuring that a certain metric, such as the time required to complete all tasks, or the distance traveled, or the energy expended by the robots is reduced. We consider a scenario where tasks can appear dynamically and a task needs to be performed by multiple robots to be completed. We propose a new algorithm called SQ-MRTA (Spatial Queueing-MRTA that uses a spatial queue-based model to allocate tasks between robots in a distributed manner. We have implemented the SQ-MRTA algorithm on accurately simulated models of Corobot robots within the Webots simulator for different numbers of robots and tasks and compared its performance with other state-of-the-art MRTA algorithms. Our results show that the SQ-MRTA algorithm is able to scale up with the number of tasks and robots in the environment, and it either outperforms or performs comparably with respect to other distributed MRTA algorithms.
Fanuel, Ibrahim Mwita; Mushi, Allen; Kajunguri, Damian
2018-03-01
This paper analyzes more than 40 papers with a restricted area of application of Multi-Objective Genetic Algorithm, Non-Dominated Sorting Genetic Algorithm-II and Multi-Objective Differential Evolution (MODE) to solve the multi-objective problem in agricultural water management. The paper focused on different application aspects which include water allocation, irrigation planning, crop pattern and allocation of available land. The performance and results of these techniques are discussed. The review finds that there is a potential to use MODE to analyzed the multi-objective problem, the application is more significance due to its advantage of being simple and powerful technique than any Evolutionary Algorithm. The paper concludes with the hopeful new trend of research that demand effective use of MODE; inclusion of benefits derived from farm byproducts and production costs into the model.
Directory of Open Access Journals (Sweden)
Rong Chai
2017-01-01
Full Text Available In recent years, heterogeneous radio access technologies have experienced rapid development and gradually achieved effective coordination and integration, resulting in heterogeneous networks (HetNets. In this paper, we consider the downlink secure transmission of HetNets where the information transmission from base stations (BSs to legitimate users is subject to the interception of eavesdroppers. In particular, we stress the problem of joint user association and power allocation of the BSs. To achieve data transmission in a secure and energy efficient manner, we introduce the concept of secrecy energy efficiency which is defined as the ratio of the secrecy transmission rate and power consumption of the BSs and formulate the problem of joint user association and power allocation as an optimization problem which maximizes the joint secrecy energy efficiency of all the BSs under the power constraint of the BSs and the minimum data rate constraint of user equipment (UE. By equivalently transforming the optimization problem into two subproblems, that is, power allocation subproblem and user association subproblem of the BSs, and applying iterative method and Kuhn-Munkres (K-M algorithm to solve the two subproblems, respectively, the optimal user association and power allocation strategies can be obtained. Numerical results demonstrate that the proposed algorithm outperforms previously proposed algorithms.
Directory of Open Access Journals (Sweden)
Alagan Anpalagan
2013-04-01
Full Text Available Due to the rapid increase in the usage and demand of wireless sensor networks (WSN, the limited frequency spectrum available for WSN applications will be extremely crowded in the near future. More sensor devices also mean more recharging/replacement of batteries, which will cause significant impact on the global carbon footprint. In this paper, we propose a relay-assisted cognitive radio sensor network (CRSN that allocates communication resources in an environmentally friendly manner. We use shared band amplify and forward relaying for cooperative communication in the proposed CRSN. We present a multi-objective optimization architecture for resource allocation in a green cooperative cognitive radio sensor network (GC-CRSN. The proposed multi-objective framework jointly performs relay assignment and power allocation in GC-CRSN, while optimizing two conflicting objectives. The first objective is to maximize the total throughput, and the second objective is to minimize the total transmission power of CRSN. The proposed relay assignment and power allocation problem is a non-convex mixed-integer non-linear optimization problem (NC-MINLP, which is generally non-deterministic polynomial-time (NP-hard. We introduce a hybrid heuristic algorithm for this problem. The hybrid heuristic includes an estimation-of-distribution algorithm (EDA for performing power allocation and iterative greedy schemes for constraint satisfaction and relay assignment. We analyze the throughput and power consumption tradeoff in GC-CRSN. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results.
Directory of Open Access Journals (Sweden)
Guo Jiansheng
2014-12-01
Full Text Available Based on the uncertainty theory, this paper is devoted to the redundancy allocation problem in repairable parallel-series systems with uncertain factors, where the failure rate, repair rate and other relative coefficients involved are considered as uncertain variables. The availability of the system and the corresponding designing cost are considered as two optimization objectives. A crisp multiobjective optimization formulation is presented on the basis of uncertainty theory to solve this resultant problem. For solving this problem efficiently, a new multiobjective artificial bee colony algorithm is proposed to search the Pareto efficient set, which introduces rank value and crowding distance in the greedy selection strategy, applies fast non-dominated sort procedure in the exploitation search and inserts tournament selection in the onlooker bee phase. It shows that the proposed algorithm outperforms NSGA-II greatly and can solve multiobjective redundancy allocation problem efficiently. Finally, a numerical example is provided to illustrate this approach.
A discrete force allocation algorithm for modelling wind turbines in computational fluid dynamics
DEFF Research Database (Denmark)
Réthoré, Pierre-Elouan; Sørensen, Niels N.
2012-01-01
This paper describes an algorithm for allocating discrete forces in computational fluid dynamics (CFD). Discrete forces are useful in wind energy CFD. They are used as an approximation of the wind turbine blades’ action on the wind (actuator disc/line), to model forests and to model turbulent inf...... applicable in other fields of CFD that use discrete body forces. Copyright © 2011 John Wiley & Sons, Ltd....... inflows. Many CFD codes are designed with collocated variables layout. Although this approach has many attractive features, it can generate a numerical decoupling between the pressure and the velocities. This issue is addressed by the Rhie–Chow control volume momentum interpolation. However......This paper describes an algorithm for allocating discrete forces in computational fluid dynamics (CFD). Discrete forces are useful in wind energy CFD. They are used as an approximation of the wind turbine blades’ action on the wind (actuator disc/line), to model forests and to model turbulent...
Buzzi, Stefano; Poor, H. Vincent; Saturnino, Daniela
2008-12-01
The issue of adaptive and distributed cross-layer resource allocation for energy efficiency in uplink code-division multiple-access (CDMA) wireless data networks is addressed. The resource allocation problems are formulated as noncooperative games wherein each terminal seeks to maximize its own energy efficiency, namely, the number of reliably transmitted information symbols per unit of energy used for transmission. The focus of this paper is on the issue of adaptive and distributed implementation of policies arising from this approach, that is, it is assumed that only readily available measurements, such as the received data, are available at the receiver in order to play the considered games. Both single-cell and multicell networks are considered. Stochastic implementations of noncooperative games for power allocation, spreading code allocation, and choice of the uplink (linear) receiver are thus proposed, and analytical results describing the convergence properties of selected stochastic algorithms are also given. Extensive simulation results show that, in many instances of practical interest, the proposed stochastic algorithms approach with satisfactory accuracy the performance of nonadaptive games, whose implementation requires much more prior information.
Directory of Open Access Journals (Sweden)
Luman Zhao
2015-01-01
Full Text Available A thrust allocation method was proposed based on a hybrid optimization algorithm to efficiently and dynamically position a semisubmersible drilling rig. That is, the thrust allocation was optimized to produce the generalized forces and moment required while at the same time minimizing the total power consumption under the premise that forbidden zones should be taken into account. An optimization problem was mathematically formulated to provide the optimal thrust allocation by introducing the corresponding design variables, objective function, and constraints. A hybrid optimization algorithm consisting of a genetic algorithm and a sequential quadratic programming (SQP algorithm was selected and used to solve this problem. The proposed method was evaluated by applying it to a thrust allocation problem for a semisubmersible drilling rig. The results indicate that the proposed method can be used as part of a cost-effective strategy for thrust allocation of the rig.
A Fair Resource Allocation Algorithm for Data and Energy Integrated Communication Networks
Directory of Open Access Journals (Sweden)
Qin Yu
2016-01-01
Full Text Available With the rapid advancement of wireless network technologies and the rapid increase in the number of mobile devices, mobile users (MUs have an increasing high demand to access the Internet with guaranteed quality-of-service (QoS. Data and energy integrated communication networks (DEINs are emerging as a new type of wireless networks that have the potential to simultaneously transfer wireless energy and information via the same base station (BS. This means that a physical BS is virtualized into two parts: one is transferring energy and the other is transferring information. The former is called virtual energy base station (eBS and the latter is named as data base station (dBS. One important issue in such setting is dynamic resource allocation. Here the resource concerned includes both power and time. In this paper, we propose a fair data-and-energy resource allocation algorithm for DEINs by jointly designing the downlink energy beamforming and a power-and-time allocation scheme, with the consideration of finite capacity batteries at MUs and power sensitivity of radio frequency (RF to direct current (DC conversion circuits. Simulation results demonstrate that our proposed algorithm outperforms the existing algorithms in terms of fairness, beamforming design, sensitivity, and average throughput.
Directory of Open Access Journals (Sweden)
Keller Alevtina
2017-01-01
Full Text Available The article considers the issue of allocation of depreciation costs in the dynamic inputoutput model of an industrial enterprise. Accounting the depreciation costs in such a model improves the policy of fixed assets management. It is particularly relevant to develop the algorithm for the allocation of depreciation costs in the construction of dynamic input-output model of an industrial enterprise, since such enterprises have a significant amount of fixed assets. Implementation of terms of the adequacy of such an algorithm itself allows: evaluating the appropriateness of investments in fixed assets, studying the final financial results of an industrial enterprise, depending on management decisions in the depreciation policy. It is necessary to note that the model in question for the enterprise is always degenerate. It is caused by the presence of zero rows in the matrix of capital expenditures by lines of structural elements unable to generate fixed assets (part of the service units, households, corporate consumers. The paper presents the algorithm for the allocation of depreciation costs for the model. This algorithm was developed by the authors and served as the basis for further development of the flowchart for subsequent implementation with use of software. The construction of such algorithm and its use for dynamic input-output models of industrial enterprises is actualized by international acceptance of the effectiveness of the use of input-output models for national and regional economic systems. This is what allows us to consider that the solutions discussed in the article are of interest to economists of various industrial enterprises.
Directory of Open Access Journals (Sweden)
Mohamed A. Tolba
2018-01-01
Full Text Available Integration of Renewable Distributed Generations (RDGs such as photovoltaic (PV systems and wind turbines (WTs in distribution networks can be considered a brilliant and efficient solution to the growing demand for energy. This article introduces new robust and effective techniques like hybrid Particle Swarm Optimization in addition to a Gravitational Search Algorithm (PSOGSA and Moth-Flame Optimization (MFO that are proposed to deduce the optimum location with convenient capacity of RDGs units for minimizing system power losses and operating cost while improving voltage profile and voltage stability. This paper describes two stages. First, the Loss Sensitivity Factors (LSFs are employed to select the most candidate buses for RDGs location. In the second stage, the PSOGSA and MFO are implemented to deduce the optimal location and capacity of RDGs from the elected buses. The proposed schemes have been applied on 33-bus and 69-bus IEEE standard radial distribution systems. To insure the suggested approaches validity, the numerical results have been compared with other techniques like Backtracking Search Optimization Algorithm (BSOA, Genetic Algorithm (GA, Particle Swarm Algorithm (PSO, Novel combined Genetic Algorithm and Particle Swarm Optimization (GA/PSO, Simulation Annealing Algorithm (SA, and Bacterial Foraging Optimization Algorithm (BFOA. The evaluated results have been confirmed the superiority with high performance of the proposed MFO technique to find the optimal solutions of RDGs units’ allocation. In this regard, the MFO is chosen to solve the problems of Egyptian Middle East distribution network as a practical case study with the optimal integration of RDGs.
A genetic algorithm approach to optimization for the radiological worker allocation problem
International Nuclear Information System (INIS)
Yan Chen; Masakuni Narita; Masashi Tsuji; Sangduk Sa
1996-01-01
The worker allocation optimization problem in radiological facilities inevitably involves various types of requirements and constraints relevant to radiological protection and labor management. Some of these goals and constraints are not amenable to a rigorous mathematical formulation. Conventional methods for this problem rely heavily on sophisticated algebraic or numerical algorithms, which cause difficulties in the search for optimal solutions in the search space of worker allocation optimization problems. Genetic algorithms (GAB) are stochastic search algorithms introduced by J. Holland in the 1970s based on ideas and techniques from genetic and evolutionary theories. The most striking characteristic of GAs is the large flexibility allowed in the formulation of the optimal problem and the process of the search for the optimal solution. In the formulation, it is not necessary to define the optimal problem in rigorous mathematical terms, as required in the conventional methods. Furthermore, by designing a model of evolution for the optimal search problem, the optimal solution can be sought efficiently with computational simple manipulations without highly complex mathematical algorithms. We reported a GA approach to the worker allocation problem in radiological facilities in the previous study. In this study, two types of hard constraints were employed to reduce the huge search space, where the optimal solution is sought in such a way as to satisfy as many of soft constraints as possible. It was demonstrated that the proposed evolutionary method could provide the optimal solution efficiently compared with conventional methods. However, although the employed hard constraints could localize the search space into a very small region, it brought some complexities in the designed genetic operators and demanded additional computational burdens. In this paper, we propose a simplified evolutionary model with less restrictive hard constraints and make comparisons between
Deng, Zhenhua; Liang, Shu; Hong, Yiguang
2017-10-17
In this paper, a distributed resource allocation problem with nonsmooth local cost functions is considered, where the interaction among agents is depicted by strongly connected and weight-balanced digraphs. Here the decision variable of each agent is within a local feasibility constraint described as a convex set, and all the decision variables have to satisfy a network resource constraint, which is the sum of available resources. To solve the problem, a distributed continuous-time algorithm is developed by virtue of differentiated projection operations and differential inclusions, and its convergence to the optimal solution is proved via the set-valued LaSalle invariance principle. Furthermore, the exponential convergence of the proposed algorithm can be achieved when the local cost functions are differentiable with Lipschitz gradients and there are no local feasibility constraints. Finally, numerical examples are given to verify the effectiveness of the proposed algorithms.In this paper, a distributed resource allocation problem with nonsmooth local cost functions is considered, where the interaction among agents is depicted by strongly connected and weight-balanced digraphs. Here the decision variable of each agent is within a local feasibility constraint described as a convex set, and all the decision variables have to satisfy a network resource constraint, which is the sum of available resources. To solve the problem, a distributed continuous-time algorithm is developed by virtue of differentiated projection operations and differential inclusions, and its convergence to the optimal solution is proved via the set-valued LaSalle invariance principle. Furthermore, the exponential convergence of the proposed algorithm can be achieved when the local cost functions are differentiable with Lipschitz gradients and there are no local feasibility constraints. Finally, numerical examples are given to verify the effectiveness of the proposed algorithms.
A new algorithm for allocating multiple distributed generation units based on load centroid concept
Directory of Open Access Journals (Sweden)
A. Elmitwally
2013-12-01
Full Text Available Allocation of distributed generation (DG units is commonly formulated as a constrained nonlinear optimization problem solved by complex iterative mathematical or heuristic techniques. Heavy computational burden, very long solution time, probable divergence and possibility of getting only a sub-optimal solution are some serious drawbacks. In this paper, a systematic simple approach to allocate multiple DG units in radial/meshed distribution network is proposed. The concept of equivalent load is introduced and extended to identify the load centroid precisely with two methods. A performance index that combines the power system real power loss and average node voltage is defined. Based on load centroid and performance index, a straightforward algorithm for sizing and locating multiple DG units is developed. The proposed technique is applied to radial and meshed test systems. Results confirm stability, integrity and efficacy of the proposed approach.
Collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation
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.
Directory of Open Access Journals (Sweden)
Shaat Musbah
2010-01-01
Full Text Available Cognitive Radio (CR systems have been proposed to increase the spectrum utilization by opportunistically access the unused spectrum. Multicarrier communication systems are promising candidates for CR systems. Due to its high spectral efficiency, filter bank multicarrier (FBMC can be considered as an alternative to conventional orthogonal frequency division multiplexing (OFDM for transmission over the CR networks. This paper addresses the problem of resource allocation in multicarrier-based CR networks. The objective is to maximize the downlink capacity of the network under both total power and interference introduced to the primary users (PUs constraints. The optimal solution has high computational complexity which makes it unsuitable for practical applications and hence a low complexity suboptimal solution is proposed. The proposed algorithm utilizes the spectrum holes in PUs bands as well as active PU bands. The performance of the proposed algorithm is investigated for OFDM and FBMC based CR systems. Simulation results illustrate that the proposed resource allocation algorithm with low computational complexity achieves near optimal performance and proves the efficiency of using FBMC in CR context.
Development of Efficient Resource Allocation Algorithm in Chunk Based OFDMA System
Directory of Open Access Journals (Sweden)
Yadav Mukesh Kumar
2016-01-01
Full Text Available The emerging demand for diverse data applications in next generation wireless networks entails both high data rate wireless connections and intelligent multiuser scheduling designs. The orthogonal frequency division multiple access based system is capable of delivering high speed data rate and can operate in a multipath environment. OFDMA based system dividing an entire channel into many orthogonal narrow band subcarriers. Due to this, it is useful to eliminate inter symbol interferences which is a limit of total available data rates. In this paper, investigation about resource allocation problem for the chunk based Orthogonal Frequency Division Multiple Access (OFDMA wireless multicast systems is done. In this paper, it is expected that the Base Station (BS has multiple antennas in a Distributed Antenna System (DAS. The allocation unit is a group of contiguous subcarriers (chunk in conventional OFDMA systems. The aim of this investigation is to develop an efficient resource allocation algorithm to maximize the total throughput and minimize the average outage probability over a chunk with respect to average Bit Error Rate (BER and total available power.
Jevtić, Aleksandar; Gutiérrez, Alvaro
2011-01-01
Swarms of robots can use their sensing abilities to explore unknown environments and deploy on sites of interest. In this task, a large number of robots is more effective than a single unit because of their ability to quickly cover the area. However, the coordination of large teams of robots is not an easy problem, especially when the resources for the deployment are limited. In this paper, the distributed bees algorithm (DBA), previously proposed by the authors, is optimized and applied to distributed target allocation in swarms of robots. Improved target allocation in terms of deployment cost efficiency is achieved through optimization of the DBA's control parameters by means of a genetic algorithm. Experimental results show that with the optimized set of parameters, the deployment cost measured as the average distance traveled by the robots is reduced. The cost-efficient deployment is in some cases achieved at the expense of increased robots' distribution error. Nevertheless, the proposed approach allows the swarm to adapt to the operating conditions when available resources are scarce.
International Nuclear Information System (INIS)
Jazebi, S.; Hosseinian, S.H.; Vahidi, B.
2011-01-01
Highlights: → Reconfiguration and DSTATCOM allocation are implemented for RDS planning. → Differential evolution algorithm is applied to solve the nonlinear problem. → Optimal status of tie switches, DSTATCOM size and location are determined. → The goal is to minimize network losses and to improve voltage profile. → The results show the effectiveness of the proposed method to satisfy objectives. -- Abstract: The main idea in distribution network reconfiguration is usually to reduce loss by changing the status of sectionalizing switches and determining appropriate tie switches. Recently Distribution FACTS (DFACTS) devices such as DSTATCOM also have been planned for loss reduction and voltage profile improvement in steady state conditions. This paper implements a combinatorial process based on reconfiguration and DSTATCOM allocation in order to mitigate losses and improve voltage profile in power distribution networks. The distribution system tie switches, DSTATCOM location and size have been optimally determined to obtain an appropriate operational condition. Differential evolution algorithm (DEA) has been used to solve and overcome the complicity of this combinatorial nonlinear optimization problem. To validate the accuracy of results a comparison with particle swarm optimization (PSO) has been made. Simulations have been applied on 69 and 83 busses distribution test systems. All optimization results show the effectiveness of the combinatorial approach in loss reduction and voltage profile improvement.
Directory of Open Access Journals (Sweden)
Álvaro Gutiérrez
2011-11-01
Full Text Available Swarms of robots can use their sensing abilities to explore unknown environments and deploy on sites of interest. In this task, a large number of robots is more effective than a single unit because of their ability to quickly cover the area. However, the coordination of large teams of robots is not an easy problem, especially when the resources for the deployment are limited. In this paper, the Distributed Bees Algorithm (DBA, previously proposed by the authors, is optimized and applied to distributed target allocation in swarms of robots. Improved target allocation in terms of deployment cost efficiency is achieved through optimization of the DBA’s control parameters by means of a Genetic Algorithm. Experimental results show that with the optimized set of parameters, the deployment cost measured as the average distance traveled by the robots is reduced. The cost-efficient deployment is in some cases achieved at the expense of increased robots’ distribution error. Nevertheless, the proposed approach allows the swarm to adapt to the operating conditions when available resources are scarce.
A proposed algorithm for scheduling and resource allocation For the downlink of LTE networks
Directory of Open Access Journals (Sweden)
Kareem Dhahir Rahi
2017-07-01
Full Text Available Long Term Evaluation (LTE networks can be categorized as a member of the third generation of mobile communication system, and it is capable of supporting real time multimedia and a variety of broadband technologies. In order to satisfy customers, these technologies must be transmitted with a good level of Quality of Service (QoS. This can be achieved by fulfilling a number of requirements such as lowest possible packet loss rate and delay. While from a provider’s perspective, improving the systems performance by efficient and fair spectrum allocation is challenging issue. As known, these requirements are mainly managed by the scheduler at the transmitter side. In this research, a novel algorithm of scheduling is proposed and implemented for real time applications in the downlink of LTE networks. The proposed algorithm reduces the number of packets that has been dropped due to congestion as well as the number of lost packets due to bad channel quality, and thus enhancing the system performance. It also prioritizes the user with the highest packet loss rate by taking into account the packet loss rate of each user and maintaining the metric of fairness within normal levels as the number of users increases. Also the system capacity, throughput and modulation order were increased by taking advantage of the Adaptive Modulation and Coding Scheme (AMC. The proposed algorithm has proven to be more efficient in terms of system performance than similar algorithms
Directory of Open Access Journals (Sweden)
Zhihong Yan
2018-01-01
Full Text Available With the deepening discrepancy between water supply and demand caused by water shortages, alleviating water shortages by optimizing water resource allocation has received extensive attention. How to allocate water resources optimally, rapidly, and effectively has become a challenging problem. Thus, this study employs a meta-heuristic swarm-based algorithm, the whale optimization algorithm (WOA. To overcome drawbacks like relatively low convergence precision and convergence rates, when applying the WOA algorithm to complex optimization problems, logistic mapping is used to initialize swarm location, and inertia weighting is employed to improve the algorithm. The resulting ameliorative whale optimization algorithm (AWOA shows substantially enhanced convergence rates and precision than the WOA and particle swarm optimization algorithms, demonstrating relatively high reliability and applicability. A water resource allocation optimization model with optimal economic efficiency and least total water shortage volume is established for Handan, China, and solved by the AWOA. The allocation results better reflect actual water usage in Handan. In 2030, the p = 50% total water shortage is forecast as 404.34 × 106 m3 or 14.8%. The shortage is mainly in the primary agricultural sector. The allocation results provide a reference for regional water resources management.
Multi-objective hierarchical genetic algorithms for multilevel redundancy allocation optimization
International Nuclear Information System (INIS)
Kumar, Ranjan; Izui, Kazuhiro; Yoshimura, Masataka; Nishiwaki, Shinji
2009-01-01
Multilevel redundancy allocation optimization problems (MRAOPs) occur frequently when attempting to maximize the system reliability of a hierarchical system, and almost all complex engineering systems are hierarchical. Despite their practical significance, limited research has been done concerning the solving of simple MRAOPs. These problems are not only NP hard but also involve hierarchical design variables. Genetic algorithms (GAs) have been applied in solving MRAOPs, since they are computationally efficient in solving such problems, unlike exact methods, but their applications has been confined to single-objective formulation of MRAOPs. This paper proposes a multi-objective formulation of MRAOPs and a methodology for solving such problems. In this methodology, a hierarchical GA framework for multi-objective optimization is proposed by introducing hierarchical genotype encoding for design variables. In addition, we implement the proposed approach by integrating the hierarchical genotype encoding scheme with two popular multi-objective genetic algorithms (MOGAs)-the strength Pareto evolutionary genetic algorithm (SPEA2) and the non-dominated sorting genetic algorithm (NSGA-II). In the provided numerical examples, the proposed multi-objective hierarchical approach is applied to solve two hierarchical MRAOPs, a 4- and a 3-level problems. The proposed method is compared with a single-objective optimization method that uses a hierarchical genetic algorithm (HGA), also applied to solve the 3- and 4-level problems. The results show that a multi-objective hierarchical GA (MOHGA) that includes elitism and mechanism for diversity preserving performed better than a single-objective GA that only uses elitism, when solving large-scale MRAOPs. Additionally, the experimental results show that the proposed method with NSGA-II outperformed the proposed method with SPEA2 in finding useful Pareto optimal solution sets
Suboptimal Rate Adaptive Resource Allocation for Downlink OFDMA Systems
Directory of Open Access Journals (Sweden)
Sanam Sadr
2009-01-01
Full Text Available This paper aims to study the performance of low complexity adaptive resource allocation in the downlink of OFDMA systems with fixed or variable rate requirements (with fairness consideration. Two suboptimal resource allocation algorithms are proposed using the simplifying assumption of transmit power over the entire bandwidth. The objective of the first algorithm is to maximize the total throughput while maintaining rate proportionality among the users. The proposed suboptimal algorithm prioritizes the user with the highest sensitivity to the subcarrier allocation, and the variance over the subchannel gains is used to define the sensitivity of each user. The second algorithm concerns rate adaptive resource allocation in multiuser systems with fixed rate constraints. We propose a suboptimal joint subchannel and power allocation algorithm which prioritizes the users with the highest required data rates. The main feature of this algorithm is its low complexity while achieving the rate requirements.
International Nuclear Information System (INIS)
Huang, Chia-Ling
2015-01-01
This paper proposes a new swarm intelligence method known as the Particle-based Simplified Swarm Optimization (PSSO) algorithm while undertaking a modification of the Updating Mechanism (UM), called N-UM and R-UM, and simultaneously applying an Orthogonal Array Test (OA) to solve reliability–redundancy allocation problems (RRAPs) successfully. One difficulty of RRAP is the need to maximize system reliability in cases where the number of redundant components and the reliability of corresponding components in each subsystem are simultaneously decided with nonlinear constraints. In this paper, four RRAP benchmarks are used to display the applicability of the proposed PSSO that advances the strengths of both PSO and SSO to enable optimizing the RRAP that belongs to mixed-integer nonlinear programming. When the computational results are compared with those of previously developed algorithms in existing literature, the findings indicate that the proposed PSSO is highly competitive and performs well. - Highlights: • This paper proposes a particle-based simplified swarm optimization algorithm (PSSO) to optimize RRAP. • Furthermore, the UM and an OA are adapted to advance in optimizing RRAP. • Four systems are introduced and the results demonstrate the PSSO performs particularly well
Game Algorithm for Resource Allocation Based on Intelligent Gradient in HetNet
Directory of Open Access Journals (Sweden)
Fang Ye
2017-02-01
Full Text Available In order to improve system performance such as throughput, heterogeneous network (HetNet has become an effective solution in Long Term Evolution-Advanced (LET-A. However, co-channel interference leads to degradation of the HetNet throughput, because femtocells are always arranged to share the spectrum with the macro base station. In this paper, in view of the serious cross-layer interference in double layer HetNet, the Stackelberg game model is adopted to analyze the resource allocation methods of the network. Unlike the traditional system models only focusing on macro base station performance improvement, we take into account the overall system performance and build a revenue function with convexity. System utility functions are defined as the average throughput, which does not adopt frequency spectrum trading method, so as to avoid excessive signaling overhead. Due to the value scope of continuous Nash equilibrium of the built game model, the gradient iterative algorithm is introduced to reduce the computational complexity. As for the solution of Nash equilibrium, one kind of gradient iterative algorithm is proposed, which is able to intelligently choose adjustment factors. The Nash equilibrium can be quickly solved; meanwhile, the step of presetting adjustment factors is avoided according to network parameters in traditional linear iterative model. Simulation results show that the proposed algorithm enhances the overall performance of the system.
Rahman, Imran; Vasant, Pandian M.; Singh, Balbir Singh Mahinder; Abdullah-Al-Wadud, M.
2014-10-01
Recent researches towards the use of green technologies to reduce pollution and increase penetration of renewable energy sources in the transportation sector are gaining popularity. The development of the smart grid environment focusing on PHEVs may also heal some of the prevailing grid problems by enabling the implementation of Vehicle-to-Grid (V2G) concept. Intelligent energy management is an important issue which has already drawn much attention to researchers. Most of these works require formulation of mathematical models which extensively use computational intelligence-based optimization techniques to solve many technical problems. Higher penetration of PHEVs require adequate charging infrastructure as well as smart charging strategies. We used Gravitational Search Algorithm (GSA) to intelligently allocate energy to the PHEVs considering constraints such as energy price, remaining battery capacity, and remaining charging time.
Latent Dirichlet Allocation (LDA) Model and kNN Algorithm to Classify Research Project Selection
Safi’ie, M. A.; Utami, E.; Fatta, H. A.
2018-03-01
Universitas Sebelas Maret has a teaching staff more than 1500 people, and one of its tasks is to carry out research. In the other side, the funding support for research and service is limited, so there is need to be evaluated to determine the Research proposal submission and devotion on society (P2M). At the selection stage, research proposal documents are collected as unstructured data and the data stored is very large. To extract information contained in the documents therein required text mining technology. This technology applied to gain knowledge to the documents by automating the information extraction. In this articles we use Latent Dirichlet Allocation (LDA) to the documents as a model in feature extraction process, to get terms that represent its documents. Hereafter we use k-Nearest Neighbour (kNN) algorithm to classify the documents based on its terms.
Directory of Open Access Journals (Sweden)
Ji She
2016-12-01
Full Text Available Radar networks are proven to have numerous advantages over traditional monostatic and bistatic radar. With recent developments, radar networks have become an attractive platform due to their low probability of intercept (LPI performance for target tracking. In this paper, a joint sensor selection and power allocation algorithm for multiple-target tracking in a radar network based on LPI is proposed. It is found that this algorithm can minimize the total transmitted power of a radar network on the basis of a predetermined mutual information (MI threshold between the target impulse response and the reflected signal. The MI is required by the radar network system to estimate target parameters, and it can be calculated predictively with the estimation of target state. The optimization problem of sensor selection and power allocation, which contains two variables, is non-convex and it can be solved by separating power allocation problem from sensor selection problem. To be specific, the optimization problem of power allocation can be solved by using the bisection method for each sensor selection scheme. Also, the optimization problem of sensor selection can be solved by a lower complexity algorithm based on the allocated powers. According to the simulation results, it can be found that the proposed algorithm can effectively reduce the total transmitted power of a radar network, which can be conducive to improving LPI performance.
Zhao, Wenle; Weng, Yanqiu
2011-01-01
Permuted block design is the most popular randomization method used in clinical trials, especially for trials with more than two treatments and unbalanced allocation, because of its consistent imbalance control and simplicity in implementation. However, the risk of selection biases caused by high proportion of deterministic assignments is a cause of concern. Efron’s biased coin design and Wei’s urn design provide better allocation randomness without deterministic assignments, but they do not consistently control treatment imbalances. Alternative randomization designs with improved performances have been proposed over the past few decades, including Soares and Wu’s big stick design, which has high allocation randomness, but is limited to two-treatment balanced allocation scenarios only, and Berger’s maximal procedure design which has a high allocation randomness and a potential for more general trial scenarios, but lacks the explicit function for the conditional allocation probability and is more complex to implement than most other designs. The block urn design proposed in this paper combines the advantages of existing randomization designs while overcoming their limitations. Statistical properties of the new algorithm are assessed and compared to currently available designs via analytical and computer simulation approaches. The results suggest that the block urn design simultaneously provides consistent imbalance control and high allocation randomness. It can be easily implemented for sequential clinical trials with two or more treatments and balanced or unbalanced allocation. PMID:21893215
Frost, Susan A.; Bodson, Marc; Acosta, Diana M.
2009-01-01
The Next Generation (NextGen) transport aircraft configurations being investigated as part of the NASA Aeronautics Subsonic Fixed Wing Project have more control surfaces, or control effectors, than existing transport aircraft configurations. Conventional flight control is achieved through two symmetric elevators, two antisymmetric ailerons, and a rudder. The five effectors, reduced to three command variables, produce moments along the three main axes of the aircraft and enable the pilot to control the attitude and flight path of the aircraft. The NextGen aircraft will have additional redundant control effectors to control the three moments, creating a situation where the aircraft is over-actuated and where a simple relationship does not exist anymore between the required effector deflections and the desired moments. NextGen flight controllers will incorporate control allocation algorithms to determine the optimal effector commands and attain the desired moments, taking into account the effector limits. Approaches to solving the problem using linear programming and quadratic programming algorithms have been proposed and tested. It is of great interest to understand their relative advantages and disadvantages and how design parameters may affect their properties. In this paper, we investigate the sensitivity of the effector commands with respect to the desired moments and show on some examples that the solutions provided using the l2 norm of quadratic programming are less sensitive than those using the l1 norm of linear programming.
Directory of Open Access Journals (Sweden)
UMADEVI K. S.
2017-07-01
Full Text Available WiMedia Medium Access Control (MAC provides high rate data transfer for wireless networking thereby enables construction of high speed home networks. It facilitates data communication between the nodes through two modes namely: i Distributed Reservation Protocol (DRP for isochronous traffic and ii Prioritized Contention Access (PCA for asynchronous traffic. PCA mode enables medium access using CSMA/CA similar to IEEE 802.11e. In the presence of DRP, the throughput of PCA saturates when there is an increase in the number of devices accessing PCA channel. Researchers suggest that the better utilization of medium resolves many issues in an effective way. To demonstrate the effective utilization of the medium, Contention Based Distributed Reservation Protocol Allocation Algorithm for WiMedia Medium Access Control is proposed for reserving Medium Access Slots under DRP in the presence of PCA. The proposed algorithm provides a better medium access, reduces energy consumption and enhances the throughput when compared to the existing methodologies.
Low and Expensive Bandwidth Remains Key Bottleneck for ...
African Journals Online (AJOL)
These bottlenecks have dwarfed the expectations of the citizens to fully participate in the new world economic order galvanized by e-commerce and world trade. It is estimated that M.I.T in Boston USA has bandwidth allocation that surpasses all the bandwidth allocated to Nigeria put together. Low bandwidth has been found ...
A Novel Pareto-Based Meta-Heuristic Algorithm to Optimize Multi-Facility Location-Allocation Problem
Vahid Hajipour; Samira V. Noshafagh; Reza Tavakkoli-Moghaddam
2013-01-01
This article proposes a novel Pareto-based multiobjective meta-heuristic algorithm named non-dominated ranking genetic algorithm (NRGA) to solve multi-facility location-allocation problem. In NRGA, a fitness value representing rank is assigned to each individual of the population. Moreover, two features ranked based roulette wheel selection including select the fronts and choose solutions from the fronts, are utilized. The proposed solving methodology is validated using s...
Alsharoa, Ahmad M.
2014-06-01
In this paper, the problem of power allocation for a multiple-input multiple-output two-way system is investigated in underlay Cognitive Radio (CR) set-up. In the CR underlay mode, secondary users are allowed to exploit the spectrum allocated to primary users in an opportunistic manner by respecting a tolerated temperature limit. The secondary networks employ an amplify-and-forward two-way relaying technique in order to maximize the sum rate under power budget and interference constraints. In this context, we formulate an optimization problem that is solved in two steps. First, we derive a closed-form expression of the optimal power allocated to terminals. Then, we employ a strong optimization tool based on particle swarm optimization algorithm to find the power allocated to secondary relays. Simulation results demonstrate the efficiency of the proposed solution and analyze the impact of some system parameters on the achieved performance. © 2014 IEEE.
Directory of Open Access Journals (Sweden)
Xiangang Peng
2015-12-01
Full Text Available Distributed generation (DG systems are integral parts in future distribution networks. In this paper, a novel approach integrating crisscross optimization algorithm and Monte Carlo simulation (CSO-MCS is implemented to solve the optimal DG allocation (ODGA problem. The feature of applying CSO to address the ODGA problem lies in three interacting operators, namely horizontal crossover, vertical crossover and competitive operator. The horizontal crossover can search new solutions in a hypercube space with a larger probability while in the periphery of each hypercube with a decreasing probability. The vertical crossover can effectively facilitate those stagnant dimensions of a population to escape from premature convergence. The competitive operator allows the crisscross search to always maintain in a historical best position to quicken the converge rate. It is the combination of the double search strategies and competitive mechanism that enables CSO significant advantage in convergence speed and accuracy. Moreover, to deal with system uncertainties such as the output power of wind turbine and photovoltaic generators, an MCS-based method is adopted to solve the probabilistic power flow. The effectiveness of the CSO-MCS method is validated on the typical 33-bus and 69-bus test system, and results substantiate the suitability of CSO-MCS for multi-objective ODGA problem.
Mass weighted urn design - a new randomization algorithm for unequal allocations
Zhao, Wenle
2015-01-01
Unequal allocations have been used in clinical trials motivated by ethical, efficiency, or feasibility concerns. Commonly used permuted block randomization faces a tradeoff between effective imbalance control with a small block size and accurate allocation target with a large block size. Few other unequal allocation randomization designs have been proposed in literature with applications in real trials hardly ever been reported, partly due to their complexity in implementation compared to the permuted block randomization. Proposed in this paper is the mass weighted urn design, in which the number of balls in the urn equals to the number of treatments, and remains unchanged during the study. The chance a ball being randomly selected is proportional to the mass of the ball. After each treatment assignment, a part of the mass of the selected ball is re-distributed to all balls based on the target allocation ratio. This design allows any desired optimal unequal allocations be accurately targeted without approximation, and provides a consistent imbalance control throughout the allocation sequence. The statistical properties of this new design is evaluated with the Euclidean distance between the observed treatment distribution and the desired treatment distribution as the treatment imbalance measure; and the Euclidean distance between the conditional allocation probability and the target allocation probability as the allocation predictability measure. Computer simulation results are presented comparing the mass weighted urn design with other randomization designs currently available for unequal allocations. PMID:26091947
Mass weighted urn design--A new randomization algorithm for unequal allocations.
Zhao, Wenle
2015-07-01
Unequal allocations have been used in clinical trials motivated by ethical, efficiency, or feasibility concerns. Commonly used permuted block randomization faces a tradeoff between effective imbalance control with a small block size and accurate allocation target with a large block size. Few other unequal allocation randomization designs have been proposed in literature with applications in real trials hardly ever been reported, partly due to their complexity in implementation compared to the permuted block randomization. Proposed in this paper is the mass weighted urn design, in which the number of balls in the urn equals to the number of treatments, and remains unchanged during the study. The chance a ball being randomly selected is proportional to the mass of the ball. After each treatment assignment, a part of the mass of the selected ball is re-distributed to all balls based on the target allocation ratio. This design allows any desired optimal unequal allocations be accurately targeted without approximation, and provides a consistent imbalance control throughout the allocation sequence. The statistical properties of this new design is evaluated with the Euclidean distance between the observed treatment distribution and the desired treatment distribution as the treatment imbalance measure; and the Euclidean distance between the conditional allocation probability and the target allocation probability as the allocation predictability measure. Computer simulation results are presented comparing the mass weighted urn design with other randomization designs currently available for unequal allocations. Copyright © 2015 Elsevier Inc. All rights reserved.
Directory of Open Access Journals (Sweden)
Elham Faraji
2016-03-01
Full Text Available In this research, the capability of a charged system search algorithm (CSS in handling water management optimization problems is investigated. First, two complex mathematical problems are solved by CSS and the results are compared with those obtained from other metaheuristic algorithms. In the last step, the optimization model developed by the CSS algorithm is applied to the waste load allocation in rivers based on the total maximum daily load (TMDL concept. The results are presented in Tables and Figures for easy comparison. The study indicates the superiority of the CSS algorithm in terms of its speed and performance over the other metaheuristic algorithms while its precision in water management optimization problems is verified.
Upgrade trigger: Bandwidth strategy proposal
Fitzpatrick, Conor; Meloni, Simone; Boettcher, Thomas Julian; Whitehead, Mark Peter; Dziurda, Agnieszka; Vesterinen, Mika Anton
2017-01-01
This document describes a selection strategy for the upgrade trigger using charm signals as a benchmark. The Upgrade trigger uses a 'Run 2-like' sequence consisting of a first and second stage, in between which the calibration and alignment is performed. The first stage, HLT1, uses an inclusive strategy to select beauty and charm decays, while the second stage uses offline-quality exclusive selections. A novel genetic algorithm-based bandwidth division is performed at the second stage to distribute the output bandwidth among different physics channels, maximising the efficiency for useful physics events. The performance is then studied as a function of the available output bandwidth.
Directory of Open Access Journals (Sweden)
Li Ran
2017-01-01
Full Text Available Optimal allocation of generalized power sources in distribution network is researched. A simple index of voltage stability is put forward. Considering the investment and operation benefit, the stability of voltage and the pollution emissions of generalized power sources in distribution network, a multi-objective optimization planning model is established. A multi-objective particle swarm optimization algorithm is proposed to solve the optimal model. In order to improve the global search ability, the strategies of fast non-dominated sorting, elitism and crowding distance are adopted in this algorithm. Finally, tested the model and algorithm by IEEE-33 node system to find the best configuration of GP, the computed result shows that with the generalized power reasonable access to the active distribution network, the investment benefit and the voltage stability of the system is improved, and the proposed algorithm has better global search capability.
Kirschstein, Timo; Wolters, Alexander; Lenz, Jan-Hendrik; Fröhlich, Susanne; Hakenberg, Oliver; Kundt, Günther; Darmüntzel, Martin; Hecker, Michael; Altiner, Attila; Müller-Hilke, Brigitte
2016-01-01
The amendment of the Medical Licensing Act (ÄAppO) in Germany in 2002 led to the introduction of graded assessments in the clinical part of medical studies. This, in turn, lent new weight to the importance of written tests, even though the minimum requirements for exam quality are sometimes difficult to reach. Introducing exam quality as a criterion for the award of performance-based allocation of funds is expected to steer the attention of faculty members towards more quality and perpetuate higher standards. However, at present there is a lack of suitable algorithms for calculating exam quality. In the spring of 2014, the students' dean commissioned the "core group" for curricular improvement at the University Medical Center in Rostock to revise the criteria for the allocation of performance-based funds for teaching. In a first approach, we developed an algorithm that was based on the results of the most common type of exam in medical education, multiple choice tests. It included item difficulty and discrimination, reliability as well as the distribution of grades achieved. This algorithm quantitatively describes exam quality of multiple choice exams. However, it can also be applied to exams involving short assay questions and the OSCE. It thus allows for the quantitation of exam quality in the various subjects and - in analogy to impact factors and third party grants - a ranking among faculty. Our algorithm can be applied to all test formats in which item difficulty, the discriminatory power of the individual items, reliability of the exam and the distribution of grades are measured. Even though the content validity of an exam is not considered here, we believe that our algorithm is suitable as a general basis for performance-based allocation of funds.
Directory of Open Access Journals (Sweden)
Kirschstein, Timo
2016-05-01
Full Text Available Objective: The amendment of the Medical Licensing Act (ÄAppO in Germany in 2002 led to the introduction of graded assessments in the clinical part of medical studies. This, in turn, lent new weight to the importance of written tests, even though the minimum requirements for exam quality are sometimes difficult to reach. Introducing exam quality as a criterion for the award of performance-based allocation of funds is expected to steer the attention of faculty members towards more quality and perpetuate higher standards. However, at present there is a lack of suitable algorithms for calculating exam quality.Methods: In the spring of 2014, the students‘ dean commissioned the „core group“ for curricular improvement at the University Medical Center in Rostock to revise the criteria for the allocation of performance-based funds for teaching. In a first approach, we developed an algorithm that was based on the results of the most common type of exam in medical education, multiple choice tests. It included item difficulty and discrimination, reliability as well as the distribution of grades achieved. Results: This algorithm quantitatively describes exam quality of multiple choice exams. However, it can also be applied to exams involving short assay questions and the OSCE. It thus allows for the quantitation of exam quality in the various subjects and – in analogy to impact factors and third party grants – a ranking among faculty. Conclusion: Our algorithm can be applied to all test formats in which item difficulty, the discriminatory power of the individual items, reliability of the exam and the distribution of grades are measured. Even though the content validity of an exam is not considered here, we believe that our algorithm is suitable as a general basis for performance-based allocation of funds.
OPTIMUM ALLOCATION OF WATER TO THE CULTIVATION FARMS USING GENETIC ALGORITHM
Directory of Open Access Journals (Sweden)
B. Saeidian
2015-12-01
By optimum allocation of the water to the farms with different areas and crop types, and considering the deficit irrigation method, the general income of the entire area can be improved substantially.
Liu, Chun; Kroll, Andreas
2016-01-01
Multi-robot task allocation determines the task sequence and distribution for a group of robots in multi-robot systems, which is one of constrained combinatorial optimization problems and more complex in case of cooperative tasks because they introduce additional spatial and temporal constraints. To solve multi-robot task allocation problems with cooperative tasks efficiently, a subpopulation-based genetic algorithm, a crossover-free genetic algorithm employing mutation operators and elitism selection in each subpopulation, is developed in this paper. Moreover, the impact of mutation operators (swap, insertion, inversion, displacement, and their various combinations) is analyzed when solving several industrial plant inspection problems. The experimental results show that: (1) the proposed genetic algorithm can obtain better solutions than the tested binary tournament genetic algorithm with partially mapped crossover; (2) inversion mutation performs better than other tested mutation operators when solving problems without cooperative tasks, and the swap-inversion combination performs better than other tested mutation operators/combinations when solving problems with cooperative tasks. As it is difficult to produce all desired effects with a single mutation operator, using multiple mutation operators (including both inversion and swap) is suggested when solving similar combinatorial optimization problems.
DEFF Research Database (Denmark)
Robenek, Tomáš; Umang, Nitish; Bierlaire, Michel
2014-01-01
-shaking neighborhood search is presented. The proposed algorithms are tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithms can be successfully used to solve instances containing up to 40 vessels within reasonable computational......In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight...... the differences in operations between bulk ports and container terminals which highlights the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on a branch and price framework to solve...
Bandwidth provisioning in infrastructure-based wireless networks employing directional antennas
Energy Technology Data Exchange (ETDEWEB)
Hasiviswanthan, Shiva [Los Alamos National Laboratory; Zhao, Bo [PENN STATE UNIV.; Vasudevan, Sudarshan [UNIV OF MASS AMHERST; Yrgaonkar, Bhuvan [PENN STATE UNIV.
2009-01-01
Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a set of subscribers and one or more access points possessing directional antennas, we formalize the problem of orienting these antennas in two fundamental settings: (1) subscriber-centric, where the objective is to fairly allocate bandwidth among the subscribers and (2) provider-centric, where the objective is to maximize the revenue generated by satisfying the bandwidth requirements of subscribers. For both the problems, we first design algorithms for a network with only one access point working under the assumption that the number of antennas does not exceed the number of noninterfering channels. Using the well-regarded lexicographic max-min fair allocation as the objective for a subscriber-centric network, we present an optimum dynamic programming algorithm. For a provider-centric network, the allocation problem turns out to be NP-hard. We present a greedy heuristic based algorithm that guarantees almost half of the optimum revenue. We later enhance both these algorithms to operate in more general networks with multiple access points and no restrictions on the relative numbers of antennas and channels. A simulation-based evaluation using OPNET demonstrates the efficacy of our approaches and provides us further in insights into these problems.
Directory of Open Access Journals (Sweden)
Hyunhee Park
2012-04-01
Full Text Available Directional antennas have the considerable benefits of higher antenna gain, long transmission distance and spatial reuse compared to omni-antennas. To support a directional antenna, IEEE 802.15.3c specifies a high data transmission rate and short frequency range communication based on the characteristics of 60GHz band. However, the contention-based protocol of IEEE 802.15.3c may cause channel collisions and throughput degradation as the number of stations in the network increases. In order to resolve this problem and reduce channel access latency, we propose an adaptive allocation algorithm in which the contention window size for optimal transmission probability is derived after the directional information has been obtained by means of AP control procedures. Extensive simulations demonstrate that the proposed algorithm outperforms the existing channel access scheme in IEEE 802.15.3c wireless personal area networks under different situations, especially when the number of contending stations is large.
Kumar, Rakesh; Chandrawat, Rajesh Kumar; Garg, B. P.; Joshi, Varun
2017-07-01
Opening the new firm or branch with desired execution is very relevant to facility location problem. Along the lines to locate the new ambulances and firehouses, the government desires to minimize average response time for emergencies from all residents of cities. So finding the best location is biggest challenge in day to day life. These type of problems were named as facility location problems. A lot of algorithms have been developed to handle these problems. In this paper, we review five algorithms that were applied to facility location problems. The significance of clustering in facility location problems is also presented. First we compare Fuzzy c-means clustering (FCM) algorithm with alternating heuristic (AH) algorithm, then with Particle Swarm Optimization (PSO) algorithms using different type of distance function. The data was clustered with the help of FCM and then we apply median model and min-max problem model on that data. After finding optimized locations using these algorithms we find the distance from optimized location point to the demanded point with different distance techniques and compare the results. At last, we design a general example to validate the feasibility of the five algorithms for facilities location optimization, and authenticate the advantages and drawbacks of them.
Fundamental resource-allocating model in colleges and universities based on Immune Clone Algorithms
Ye, Mengdie
2017-05-01
In this thesis we will seek the combination of antibodies and antigens converted from the optimal course arrangement and make an analogy with Immune Clone Algorithms. According to the character of the Algorithms, we apply clone, clone gene and clone selection to arrange courses. Clone operator can combine evolutionary search and random search, global search and local search. By cloning and clone mutating candidate solutions, we can find the global optimal solution quickly.
Efficient Algorithm for Power Allocation in Relay-based Cognitive Radio Network
Directory of Open Access Journals (Sweden)
N. Ferdous
2011-12-01
Full Text Available This paper addresses a cognitive radio (CR network scenario where a relay is assigned to mitigate interference to primary users (PUs. We develop an average probability of successful secondary transmission (PSST to introduce relay in the CR network. The power allocation is done using dual domain concept to maximize the system throughput as well as maintaining interference to an acceptable level and this approach is implemented in our paper that has a higher convergence rate. Furthermore, we propose an alternative approach that maintains a high throughput and at the same time reduces the computational complexity significantly. A detailed analysis is done before simulation. The simulated results validate the theoretical analysis.
Near optimal power allocation algorithm for OFDM-based cognitive using adaptive relaying strategy
Soury, Hamza
2012-01-01
Relayed transmission increases the coverage and achievable capacity of communication systems. Adaptive relaying scheme is a relaying technique by which the benefits of the amplifying or decode and forward techniques can be achieved by switching the forwarding technique according to the quality of the signal. A cognitive Orthogonal Frequency-Division Multiplexing (OFDM) based adaptive relaying protocol is considered in this paper. The objective is to maximize the capacity of the cognitive radio system while ensuring that the interference introduced to the primary user is below the tolerated limit. A Near optimal power allocation in the source and the relay is presented for two pairing techniques such that the matching and random pairing. The simulation results confirm the efficiency of the proposed adaptive relaying protocol, and the consequence of choice of pairing technique. © 2012 ICST.
Karimi, Mohammad
2011-01-01
Many loads in power systems are inductive loads then consume reactive power, this fact lead to drop voltage and in worst case blackout and collapse voltage. Best option in distribution networks for avoid of this problem is installation of capacitor bank. In capacitor installation, finding optimal location and size of capacitor have special importance. In this paper, Differential Evolutionary (DE) algorithm is proposed for optimal placement and sizing of capacitor. Our objective funct...
Directory of Open Access Journals (Sweden)
Xiaomin Chen
2012-01-01
Full Text Available The SVD-aided joint transmitter and receiver design for the uplink of CDMA-based synchronous multiuser Turbo-BLAST systems is proposed in the presence of channel state information (CSI imperfection. At the transmitter, the beamforming and power allocation schemes are developed to maximize the capacity of the desired user. At the receiver, a suboptimal decorrelating scheme is first proposed to mitigate the multiuser interference (MUI and decouple the detection of different users with imperfect CSI, and then the iterative detecting algorithm that takes the channel estimation error into account is designed to cancel the coantenna interference (CAI and enhance the bit error rate (BER results further. Simulation results show that the proposed uplink CDMA-based multiuser Turbo-BLAST model is effective, the detection from every user is completely independent to each other after decorrelating, and the system performance can be enhanced by the proposed beamforming and power allocation schemes. Furthermore, BER performance can be enhanced by the modified iterative detection. The effect of CSI imperfection is evaluated, which is proved to be a useful tool to assess the system performance with imperfect CSI.
Compression of Video Tracking and Bandwidth Balancing Routing in Wireless Multimedia Sensor Networks
Directory of Open Access Journals (Sweden)
Yin Wang
2015-12-01
Full Text Available There has been a tremendous growth in multimedia applications over wireless networks. Wireless Multimedia Sensor Networks(WMSNs have become the premier choice in many research communities and industry. Many state-of-art applications, such as surveillance, traffic monitoring, and remote heath care are essentially video tracking and transmission in WMSNs. The transmission speed is constrained by the big file size of video data and fixed bandwidth allocation in constant routing paths. In this paper, we present a CamShift based algorithm to compress the tracking of videos. Then we propose a bandwidth balancing strategy in which each sensor node is able to dynamically select the node for the next hop with the highest potential bandwidth capacity to resume communication. Key to this strategy is that each node merely maintains two parameters that contain its historical bandwidth varying trend and then predict its near future bandwidth capacity. Then, the forwarding node selects the next hop with the highest potential bandwidth capacity. Simulations demonstrate that our approach significantly increases the data received by the sink node and decreases the delay on video transmission in Wireless Multimedia Sensor Network environments.
Bandwidth extension of speech using perceptual criteria
Berisha, Visar; Liss, Julie
2013-01-01
Bandwidth extension of speech is used in the International Telecommunication Union G.729.1 standard in which the narrowband bitstream is combined with quantized high-band parameters. Although this system produces high-quality wideband speech, the additional bits used to represent the high band can be further reduced. In addition to the algorithm used in the G.729.1 standard, bandwidth extension methods based on spectrum prediction have also been proposed. Although these algorithms do not require additional bits, they perform poorly when the correlation between the low and the high band is weak. In this book, two wideband speech coding algorithms that rely on bandwidth extension are developed. The algorithms operate as wrappers around existing narrowband compression schemes. More specifically, in these algorithms, the low band is encoded using an existing toll-quality narrowband system, whereas the high band is generated using the proposed extension techniques. The first method relies only on transmitted high-...
Mwakabuta, Ndaga Stanslaus
Electric power distribution systems play a significant role in providing continuous and "quality" electrical energy to different classes of customers. In the context of the present restrictions on transmission system expansions and the new paradigm of "open and shared" infrastructure, new approaches to distribution system analyses, economic and operational decision-making need investigation. This dissertation includes three layers of distribution system investigations. In the basic level, improved linear models are shown to offer significant advantages over previous models for advanced analysis. In the intermediate level, the improved model is applied to solve the traditional problem of operating cost minimization using capacitors and voltage regulators. In the advanced level, an artificial intelligence technique is applied to minimize cost under Distributed Generation injection from private vendors. Soft computing techniques are finding increasing applications in solving optimization problems in large and complex practical systems. The dissertation focuses on Genetic Algorithm for investigating the economic aspects of distributed generation penetration without compromising the operational security of the distribution system. The work presents a methodology for determining the optimal pricing of distributed generation that would help utilities make a decision on how to operate their system economically. This would enable modular and flexible investments that have real benefits to the electric distribution system. Improved reliability for both customers and the distribution system in general, reduced environmental impacts, increased efficiency of energy use, and reduced costs of energy services are some advantages.
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.
Directory of Open Access Journals (Sweden)
Lina Yang
2018-02-01
Full Text Available Land-use allocation is of great significance in urban development. This type of allocation is usually considered to be a complex multi-objective spatial optimization problem, whose optimized result is a set of Pareto-optimal solutions (Pareto front reflecting different tradeoffs in several objectives. However, obtaining a Pareto front is a challenging task, and the Pareto front obtained by state-of-the-art algorithms is still not sufficient. To achieve better Pareto solutions, taking the grid-representative land-use allocation problem with two objectives as an example, an artificial bee colony optimization algorithm for multi-objective land-use allocation (ABC-MOLA is proposed. In this algorithm, the traditional ABC’s search direction guiding scheme and solution maintaining process are modified. In addition, a knowledge-informed neighborhood search strategy, which utilizes the auxiliary knowledge of natural geography and spatial structures to facilitate the neighborhood spatial search around each solution, is developed to further improve the Pareto front’s quality. A series of comparison experiments (a simulated experiment with small data volume and a real-world data experiment for a large area shows that all the Pareto fronts obtained by ABC-MOLA totally dominate the Pareto fronts by other algorithms, which demonstrates ABC-MOLA’s effectiveness in achieving Pareto fronts of high quality.
Directory of Open Access Journals (Sweden)
Naseem Cassim
2017-02-01
Full Text Available Introduction: CD4 testing in South Africa is based on an integrated tiered service delivery model that matches testing demand with capacity. The National Health Laboratory Service has predominantly implemented laboratory-based CD4 testing. Coverage gaps, over-/under-capacitation and optimal placement of point-of-care (POC testing sites need investigation. Objectives: We assessed the impact of relational algebraic capacitated location (RACL algorithm outcomes on the allocation of laboratory and POC testing sites. Methods: The RACL algorithm was developed to allocate laboratories and POC sites to ensure coverage using a set coverage approach for a defined travel time (T. The algorithm was repeated for three scenarios (A: T = 4; B: T = 3; C: T = 2 hours. Drive times for a representative sample of health facility clusters were used to approximate T. Outcomes included allocation of testing sites, Euclidian distances and test volumes. Additional analysis included platform distribution and space requirement assessment. Scenarios were reported as fusion table maps. Results: Scenario A would offer a fully-centralised approach with 15 CD4 laboratories without any POC testing. A significant increase in volumes would result in a four-fold increase at busier laboratories. CD4 laboratories would increase to 41 in scenario B and 61 in scenario C. POC testing would be offered at two sites in scenario B and 20 sites in scenario C. Conclusion: The RACL algorithm provides an objective methodology to address coverage gaps through the allocation of CD4 laboratories and POC sites for a given T. The algorithm outcomes need to be assessed in the context of local conditions.
Chemical Industry Bandwidth Study
Energy Technology Data Exchange (ETDEWEB)
none,
2006-12-01
The Chemical Bandwidth Study provides a snapshot of potentially recoverable energy losses during chemical manufacturing. The advantage of this study is the use of "exergy" analysis as a tool for pinpointing inefficiencies.
Industrial Glass Bandwidth Analysis
Energy Technology Data Exchange (ETDEWEB)
Rue, David M. [Gas Technology Inst., Des Plaines, IL (United States); Servaites, James [Gas Technology Inst., Des Plaines, IL (United States); Wolf, Warren [Gas Technology Inst., Des Plaines, IL (United States)
2007-08-01
This is a study on energy use and potential savings, or "bandwidth" study, for several glassmaking processes. Intended to provide a realistic estimate of the potential amount of energy that can be saved in an industrial process, the "bandwidth" refers to the difference between the amount of energy that would be consumed in a process using commercially available technology versus the minimum amount of energy needed to achieve those same results.
Glass Industry Bandwidth Analysis
Energy Technology Data Exchange (ETDEWEB)
Rue, David M. [Gas Technology Inst., Des Plaines, IL (United States)
2006-07-01
This is a study on energy use and potential savings, or "bandwidth" study, for several glassmaking processes. Intended to provide a realistic estimate of the potential amount of energy that can be saved in an industrial process, the "bandwidth" refers to the difference between the amount of energy that would be consumed in a process using commercially available technology versus the minimum amount of energy needed to achieve those same results.
Traffic resource allocation for complex networks
International Nuclear Information System (INIS)
Ling Xiang; Long Jian-Cheng; Ding Jian-Xun; Shi Qin; Hu Mao-Bin
2013-01-01
In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness (ratio of algorithmic betweenness and local processing capacity). Three network structures (scale-free, small-world, and random networks) and two typical routing protocols (shortest path protocol and efficient routing protocol) are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted. (interdisciplinary physics and related areas of science and technology)
Probabilistic Bandwidth Assignment in Wireless Sensor Networks
Khan , Dawood; Nefzi , Bilel; Santinelli , Luca; Song , Ye-Qiong
2012-01-01
International audience; With this paper we offer an insight in designing and analyzing wireless sensor networks in a versatile manner. Our framework applies probabilistic and component-based design principles for the wireless sensor network modeling and consequently analysis; while maintaining flexibility and accuracy. In particular, we address the problem of allocating and reconfiguring the available bandwidth. The framework has been successfully implemented in IEEE 802.15.4 using an Admissi...
Directory of Open Access Journals (Sweden)
Feilong Tang
2010-01-01
Full Text Available Mobile and wireless networks are the integrant infrastructure of mobile and pervasive computing that aims at providing transparent and preferred information and services for people anytime anywhere. In such environments, end-to-end network bandwidth is crucial to improve user's transparent experience when providing on-demand services such as mobile video playing. As a result, powerful computing power is required for networked nodes, especially for routers. General-purpose processors cannot meet such requirements due to their limited processing ability, and poor programmability and scalability. Intel's network processor IXP is specially designed for fast packet processing to achieve a broad bandwidth. IXP provides a large number of registers to reduce the number of memory accesses. Registers in an IXP are physically partitioned as two banks so that two source operands in an instruction have to come from the two banks respectively, which makes the IXP register allocation tricky and different from conventional ones. In this paper, we investigate an approach for efficiently generating balanced bipartite graph and register allocation algorithms for the dual-bank register allocation in IXPs. The paper presents a graph uniform 2-way partition algorithm (FPT, which provides an optimal solution to the graph partition, and a heuristic algorithm for generating balanced bipartite graph. Finally, we design a framework for IXP register allocation. Experimental results demonstrate the framework and the algorithms are efficient in register allocation for IXP network processors.
Dynamic Subcarrier Allocation for Real-Time Traffic over Multiuser OFDM Systems
Directory of Open Access Journals (Sweden)
Li VictorOK
2009-01-01
Full Text Available A dynamic resource allocation algorithm to satisfy the packet delay requirements for real-time services, while maximizing the system capacity in multiuser orthogonal frequency division multiplexing (OFDM systems is introduced. Our proposed cross-layer algorithm, called Dynamic Subcarrier Allocation algorithm for Real-time Traffic (DSA-RT, consists of two interactive components. In the medium access control (MAC layer, the users' expected transmission rates in terms of the number of subcarriers per symbol and their corresponding transmission priorities are evaluated. With the above MAC-layer information and the detected subcarriers' channel gains, in the physical (PHY layer, a modified Kuhn-Munkres algorithm is developed to minimize the system power for a certain subcarrier allocation, then a PHY-layer resource allocation scheme is proposed to optimally allocate the subcarriers under the system signal-to-noise ratio (SNR and power constraints. In a system where the number of mobile users changes dynamically, our developed MAC-layer access control and removal schemes can guarantee the quality of service (QoS of the existing users in the system and fully utilize the bandwidth resource. The numerical results show that DSA-RT significantly improves the system performance in terms of the bandwidth efficiency and delay performance for real-time services.
International Nuclear Information System (INIS)
Sedighizadeh, Mostafa; Esmaili, Masoud; Esmaeili, Mobin
2014-01-01
In this paper, a multi-objective framework is proposed for simultaneous optimal network reconfiguration and DG (distributed generation) power allocation. The proposed method encompasses objective functions of power losses, voltage stability, DG cost, and greenhouse gas emissions and it is optimized subject to power system operational and technical constraints. In order to solve the optimization problem, the HBB-BC (Hybrid Big Bang-Big Crunch) algorithm as one of the most recent heuristic tools is modified and employed here by introducing a mutation operator to enhance its exploration capability. To resolve the scaling problem of differently-scaled objective functions, a fuzzy membership is used to bring them into a same scale and then, the fuzzy fitness of the final objective function is utilized to measure the satisfaction level of the obtained solution. The proposed method is tested on balanced and unbalanced test systems and its results are comprehensively compared with previous methods considering different scenarios. According to results, the proposed method not only offers an enhanced exploration capability but also has a better converge rate compared with previous methods. In addition, the simultaneous network reconfiguration and DG power allocation leads to a more optimal result than separately doing tasks of reconfiguration and DG power allocation. - Highlights: • Hybrid Big Bang-Big Crunch algorithm is applied to network reconfiguration problem. • Joint reconfiguration and DG power allocation leads to a more optimal solution. • A mutation operator is used to improve the exploration capability of HBB-BC method. • The HBB-BC has a better convergence rate than the compared algorithms
Energy Technology Data Exchange (ETDEWEB)
Deptuch, G. W. [AGH-UST, Cracow; Fahim, F. [Fermilab; Grybos, P. [AGH-UST, Cracow; Hoff, J. [Fermilab; Maj, P. [AGH-UST, Cracow; Siddons, D. P. [Brookhaven; Kmon, P. [AGH-UST, Cracow; Trimpl, M. [Fermilab; Zimmerman, T. [Fermilab
2017-05-06
An on-chip implementable algorithm for allocation of an X-ray photon imprint, called a hit, to a single pixel in the presence of charge sharing in a highly segmented pixel detector is described. Its proof-of-principle implementation is also given supported by the results of tests using a highly collimated X-ray photon beam from a synchrotron source. The algorithm handles asynchronous arrivals of X-ray photons. Activation of groups of pixels, comparisons of peak amplitudes of pulses within an active neighborhood and finally latching of the results of these comparisons constitute the three procedural steps of the algorithm. A grouping of pixels to one virtual pixel that recovers composite signals and event driven strobes to control comparisons of fractional signals between neighboring pixels are the actuators of the algorithm. The circuitry necessary to implement the algorithm requires an extensive inter-pixel connection grid of analog and digital signals that are exchanged between pixels. A test-circuit implementation of the algorithm was achieved with a small array of 32×32 pixels and the device was exposed to an 8 keV highly collimated to a diameter of 3 μm X-ray beam. The results of these tests are given in the paper assessing physical implementation of the algorithm.
Energy Technology Data Exchange (ETDEWEB)
Ramamurthy, Byravamurthy [University of Nebraska-Lincoln
2014-05-05
In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published several conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operatin optical WDM networks.
Energy-efficient routing, modulation and spectrum allocation in elastic optical networks
Tan, Yanxia; Gu, Rentao; Ji, Yuefeng
2017-07-01
With tremendous growth in bandwidth demand, energy consumption problem in elastic optical networks (EONs) becomes a hot topic with wide concern. The sliceable bandwidth-variable transponder in EON, which can transmit/receive multiple optical flows, was recently proposed to improve a transponder's flexibility and save energy. In this paper, energy-efficient routing, modulation and spectrum allocation (EE-RMSA) in EONs with sliceable bandwidth-variable transponder is studied. To decrease the energy consumption, we develop a Mixed Integer Linear Programming (MILP) model with corresponding EE-RMSA algorithm for EONs. The MILP model jointly considers the modulation format and optical grooming in the process of routing and spectrum allocation with the objective of minimizing the energy consumption. With the help of genetic operators, the EE-RMSA algorithm iteratively optimizes the feasible routing path, modulation format and spectrum resources solutions by explore the whole search space. In order to save energy, the optical-layer grooming strategy is designed to transmit the lightpath requests. Finally, simulation results verify that the proposed scheme is able to reduce the energy consumption of the network while maintaining the blocking probability (BP) performance compare with the existing First-Fit-KSP algorithm, Iterative Flipping algorithm and EAMGSP algorithm especially in large network topology. Our results also demonstrate that the proposed EE-RMSA algorithm achieves almost the same performance as MILP on an 8-node network.
Londoño, Jorge M.; Bestavros, Azer
2009-01-01
The advent of virtualization and cloud computing technologies necessitates the development of effective mechanisms for the estimation and reservation of resources needed by content providers to deliver large numbers of video-on-demand (VOD) streams through the cloud. Unfortunately, capacity planning for the QoS-constrained delivery of a large number of VOD streams is inherently difficult as VBR encoding schemes exhibit significant bandwidth variability. In this paper, we present a novel resource management scheme to make such allocation decisions using a mixture of per-stream reservations and an aggregate reservation, shared across all streams to accommodate peak demands. The shared reservation provides capacity slack that enables statistical multiplexing of peak rates, while assuring analytically bounded frame-drop probabilities, which can be adjusted by trading off buffer space (and consequently delay) and bandwidth. Our two-tiered bandwidth allocation scheme enables the delivery of any set of streams with less bandwidth (or equivalently with higher link utilization) than state-of-the-art deterministic smoothing approaches. The algorithm underlying our proposed framework uses three per-stream parameters and is linear in the number of servers, making it particularly well suited for use in an on-line setting. We present results from extensive trace-driven simulations, which confirm the efficiency of our scheme especially for small buffer sizes and delay bounds, and which underscore the significant realizable bandwidth savings, typically yielding losses that are an order of magnitude or more below our analytically derived bounds.
Teleoperation over low bandwidth communication links
International Nuclear Information System (INIS)
Fryer, R.J.; Mair, G.M.; Clark, N.; Heng, J.
1996-01-01
Teleoperation is well established for many areas of hazardous environment working. Where such environments are well structured and contained, such as within a working plant, communications bandwidths need not be a constraining factor. However where the worksite is remote, large, poorly structured or damaged communications rapidly become a critical factor in the efficient deployment and use of teleoperation equipment. The paper justifies and describes means which we are exploring to reduce the required communications bandwidth for teleoperation whist retaining full functionality. Techniques involved include incorporation of local intelligence at the worksite, with bandwidth devoted to high-level up-link control signals and down-link feedback, and the use of highly compressed video feeding 'virtual reality type' HMDs to provide maximum system transparency for the operator. The work is drawing on previous experience with an 'anthropomorphic robot heat' for telepresence work, and proprietary algorithms capable of compressing full colour video to standard telephone modem data rates. (Author)
International Nuclear Information System (INIS)
Alikar, Najmeh; Mousavi, Seyed Mohsen; Raja Ghazilla, Raja Ariffin; Tavana, Madjid; Olugu, Ezutah Udoncy
2017-01-01
In this paper, we formulate a mixed-integer binary non-linear programming model to study a series-parallel multi-component multi-periodic inventory-redundancy allocation problem (IRAP). This IRAP is a novel redundancy allocation problem (RAP) because components (products) are purchased under an all unit discount (AUD) policy and then installed on a series-parallel system. The total budget available for purchasing the components, the storage space, the vehicle capacities, and the total weight of the system are limited. Moreover, a penalty function is used to penalize infeasible solutions, generated randomly. The overall goal is to find the optimal number of the components purchased for each subsystem so that the total costs including ordering cost, holding costs, and purchasing cost are minimized while the system reliability is maximized, simultaneously. A non-dominated sorting genetic algorithm-II (NSGA-II), a multi-objective particle swarm optimization (MOPSO), and a multi-objective harmony search (MOHS) algorithm are applied to obtain the optimal Pareto solutions. While no benchmark is available in the literature, some numerical examples are generated randomly to evaluate the results of NSGA-II on the proposed IRAP. The results are in favor of NSGA-II. - Highlights: • An inventory control system employing an all-unit discount policy is considered in the proposed model. • The proposed model considers limited total budget, storage space, transportation capacity, and total weight. Moreover, a penalty function is used to penalize infeasible solutions. • The overall goal is to find the optimal number components purchased for each subsystem so that the total costs including ordering cost, holding cost and purchasing cost are minimized and the system reliability are maximized, simultaneously. • A NSGA-II algorithm is derived where a multi-objective particle swarm optimization and a multi-objective harmony search algorithm are used to evaluate the NSGA-II results.
Energy efficiency in elastic-bandwidth optical networks
DEFF Research Database (Denmark)
Vizcaino, Jorge Lopez; Ye, Yabin; Tafur Monroy, Idelfonso
2011-01-01
The forecasted growth in the Internet traffic has made the operators and industry to be concerned about the power consumption of the networks, and to become interested in alternatives to plan and operate the networks in a more energy efficient manner. The introduction of OFDM, and its property...... of elastic bandwidth allocation, opens new horizons in the operation of optical networks. In this paper, we compare the network planning problem in an elastic bandwidth CO-OFDM-based network and a fixed-grid WDM network. We highlight the benefits that bandwidth elasticity and the selection of different...
Directory of Open Access Journals (Sweden)
Chi-Ling Joanna Sinn
2017-11-01
Full Text Available Abstract Background Personal support services enable many individuals to stay in their homes, but there are no standard ways to classify need for functional support in home and community care settings. The goal of this project was to develop an evidence-based clinical tool to inform service planning while allowing for flexibility in care coordinator judgment in response to patient and family circumstances. Methods The sample included 128,169 Ontario home care patients assessed in 2013 and 25,800 Ontario community support clients assessed between 2014 and 2016. Independent variables were drawn from the Resident Assessment Instrument-Home Care and interRAI Community Health Assessment that are standardised, comprehensive, and fully compatible clinical assessments. Clinical expertise and regression analyses identified candidate variables that were entered into decision tree models. The primary dependent variable was the weekly hours of personal support calculated based on the record of billed services. Results The Personal Support Algorithm classified need for personal support into six groups with a 32-fold difference in average billed hours of personal support services between the highest and lowest group. The algorithm explained 30.8% of the variability in billed personal support services. Care coordinators and managers reported that the guidelines based on the algorithm classification were consistent with their clinical judgment and current practice. Conclusions The Personal Support Algorithm provides a structured yet flexible decision-support framework that may facilitate a more transparent and equitable approach to the allocation of personal support services.
Directory of Open Access Journals (Sweden)
Zh.L. Kozina
2014-12-01
Full Text Available Purpose : develop and prove experimentally allocation algorithm athletes in groups to form a tactical tasks in team sports game using methods of multivariate analysis. Material : The study involved 12 basketball hearing impaired 20-25 years old - female players team of Ukraine on basketball. Analyzed the results of testing and competitive activity 12 basketball players with hearing impairments - Lithuanian team players. Results : An algorithm for distribution by groups of athletes for the formation of tactical tasks. The algorithm consists of the following steps: 1 - testing of athletes; 2 - A hierarchical cluster analysis performance testing; 3 - Distribution of sportsmen groups, analysis of the characteristics of athletes, the formation of tactical tasks. Found higher rates of reaction rate at the offensive players. We pivot revealed a higher level of absolute strength. The defenders found a higher frequency of movement and jumping. Conclusions : The algorithm is the basis for determining the best options mutual combination players in the development and implementation of tactical combinations, the selection of partners when working in pairs and triples in training.
Design and Analytical Analysis of a Novel DBA Algorithm with Dual-Polling Tables in EPON
Directory of Open Access Journals (Sweden)
Jiunn-Ru Lai
2015-01-01
Full Text Available Ethernet passive optical network is a point-to-multipoint structure, and an effective media access protocol should be designed for collision avoidance and bandwidth allocation. Most previous researches have aimed to solve the problem using dynamic bandwidth allocation (DBA algorithms with polling-based schemes. Unfortunately, idle channel time among the polling cycles cannot be overcome efficiently. In this paper, a dual-polling DBA (DP-DBA algorithm which consists of an interpolling mechanism and an intrapolling mechanism is proposed. The interpolling mechanism helps eliminate the idle time problem while the intrapolling part aggregates the unused bandwidth of the light-loaded users and those due to nondefragmentation of the Ethernet frames of the general users. We also evaluate the performance of the DP-DBA algorithm by a comparison with the interleaved polling with adaptive cycle time (IPACT, the dynamic bandwidth allocation with a modified grant table generation algorithm (DBA2, the Double-Phase Polling (DPP, and the adaptive DBA algorithm with sorting report messages (Sort-DBA schemes with simulation results. For greater realism with regard to general applications, we also simulate the asymmetric traffic loads at the optical network units (ONUs.The results show that DP-DBA outperforms the other DBA schemes under asymmetric load conditions.
DEFF Research Database (Denmark)
Siano, P.; Chen, Peiyuan; Chen, Zhe
2012-01-01
a hybrid optimization method that aims of maximizing the Net Present Value related to the Investment made by Wind Turbines developers in an active distribution network. The proposed network combines a Genetic Algorithm with a multi-period optimal power flow. The method, integrating active management...
Ultrahigh bandwidth signal processing
DEFF Research Database (Denmark)
Oxenløwe, Leif Katsuo
2016-01-01
Optical time lenses have proven to be very versatile for advanced optical signal processing. Based on a controlled interplay between dispersion and phase-modulation by e.g. four-wave mixing, the processing is phase-preserving, an hence useful for all types of data signals including coherent multi......-level modulation founats. This has enabled processing of phase-modulated spectrally efficient data signals, such as orthogonal frequency division multiplexed (OFDM) signa In that case, a spectral telescope system was used, using two time lenses with different focal lengths (chirp rates), yielding a spectral...... regeneratio These operations require a broad bandwidth nonlinear platform, and novel photonic integrated nonlinear platform like aluminum gallium arsenide nano-waveguides used for 1.28 Tbaud optical signal processing will be described....
Experiences in Traceroute and Bandwidth Change Analysis
Energy Technology Data Exchange (ETDEWEB)
Logg, C
2004-06-23
SLAC has been studying end-to-end WAN bandwidth availability and achievability for 2.5 years via IEPM-BW [1]. IEPM-BW performs network intensive tests every 90 minutes. Based on that experience we have also developed a light weight available bandwidth (ABwE [2]) measurement tool that can make a measurement within a second. We are now extending this to a WAN measurement and detection system (IEPM-LITE) aimed at more quickly detecting and troubleshooting network performance problems and also to be more friendly on lower performance paths. IEPM-LITE uses ping, forward traceroutes, and ABwE sensors to monitor, in close to real-time, Round Trip Times (RTT), changes in available bandwidth and routes to and from target hosts. This paper discusses the experiences, techniques and algorithms used to detect and report on significant traceroute and bandwidth changes. The ultimate aim is to develop a lightweight WAN network performance monitoring system that can detect, in near real time, significant changes and generate alerts.
Experiences in Traceroute and Bandwidth Change Analysis
International Nuclear Information System (INIS)
Logg, C
2004-01-01
SLAC has been studying end-to-end WAN bandwidth availability and achievability for 2.5 years via IEPM-BW [1]. IEPM-BW performs network intensive tests every 90 minutes. Based on that experience we have also developed a light weight available bandwidth (ABwE [2]) measurement tool that can make a measurement within a second. We are now extending this to a WAN measurement and detection system (IEPM-LITE) aimed at more quickly detecting and troubleshooting network performance problems and also to be more friendly on lower performance paths. IEPM-LITE uses ping, forward traceroutes, and ABwE sensors to monitor, in close to real-time, Round Trip Times (RTT), changes in available bandwidth and routes to and from target hosts. This paper discusses the experiences, techniques and algorithms used to detect and report on significant traceroute and bandwidth changes. The ultimate aim is to develop a lightweight WAN network performance monitoring system that can detect, in near real time, significant changes and generate alerts
Holding-time-aware asymmetric spectrum allocation in virtual optical networks
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.
Huseyin Turan, Hasan; Kasap, Nihat; Savran, Huseyin
2014-03-01
Nowadays, every firm uses telecommunication networks in different amounts and ways in order to complete their daily operations. In this article, we investigate an optimisation problem that a firm faces when acquiring network capacity from a market in which there exist several network providers offering different pricing and quality of service (QoS) schemes. The QoS level guaranteed by network providers and the minimum quality level of service, which is needed for accomplishing the operations are denoted as fuzzy numbers in order to handle the non-deterministic nature of the telecommunication network environment. Interestingly, the mathematical formulation of the aforementioned problem leads to the special case of a well-known two-dimensional bin packing problem, which is famous for its computational complexity. We propose two different heuristic solution procedures that have the capability of solving the resulting nonlinear mixed integer programming model with fuzzy constraints. In conclusion, the efficiency of each algorithm is tested in several test instances to demonstrate the applicability of the methodology.
Threshold-based bandwidth allocation scheme for multiservice ...
African Journals Online (AJOL)
Journal of Computer Science and Its Application. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 22, No 1 (2015) >. Log in or Register to get access to full text downloads.
Estimating Bottleneck Bandwidth using TCP
Allman, Mark
1998-01-01
Various issues associated with estimating bottleneck bandwidth using TCP are presented in viewgraph form. Specific topics include: 1) Why TCP is wanted to estimate the bottleneck bandwidth; 2) Setting ssthresh to an appropriate value to reduce loss; 3) Possible packet-pair solutions; and 4) Preliminary results: ACTS and the Internet.
Indian Academy of Sciences (India)
have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming language Is called a program. From activities 1-3, we can observe that: • Each activity is a command.
Directory of Open Access Journals (Sweden)
Muhammad Nugraha
2017-01-01
Full Text Available Important Problem on Internet networking is exhausted resource and bandwidth by some user while other user did not get service properly. To overcome that problem we need to implement traffic control and bandwidth management system in router. In this research author want to implement Hierarchical Token Bucket algorithm as queue discipline (qdisc to get bandwidth management accurately in order the user can get bandwidth properly. The result of this research is form the management bandwidth cheaply and efficiently by using Hierarchical Token Bucket qdisc on Linux operating system were able to manage the user as we want.
Indian Academy of Sciences (India)
algorithms such as synthetic (polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language ... ·1 x:=sln(theta) x : = sm(theta) 1. ~. Idl d.t Read A.B,C. ~ lei ~ Print x.y.z. L;;;J. Figure 2 Symbols used In flowchart language to rep- resent Assignment, Read.
Indian Academy of Sciences (India)
In the previous articles, we have discussed various common data-structures such as arrays, lists, queues and trees and illustrated the widely used algorithm design paradigm referred to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted ...
Network bandwidth utilization forecast model on high bandwidth networks
Energy Technology Data Exchange (ETDEWEB)
Yoo, Wuchert (William) [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Sim, Alex [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
2015-03-30
With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.
Network Bandwidth Utilization Forecast Model on High Bandwidth Network
Energy Technology Data Exchange (ETDEWEB)
Yoo, Wucherl; Sim, Alex
2014-07-07
With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.
Bandwidth Management in Wireless Home Networks for IPTV Solutions
Directory of Open Access Journals (Sweden)
Tamás Jursonovics
2013-01-01
Full Text Available The optimal allocation of the retransmission bandwidth is essential for IPTV service providers to ensure maximal service quality. This paper highlights the relevance of the wireless transport in today’s IPTV solution and discusses how this new media affects the existing broadcast technologies. A new Markovian channel model is developed to address the optimization issues of the retransmission throughput, and a new method is presented which is evaluated by empirical measurements followed by mathematical analysis.
Yahampath, Pradeepa
2017-12-01
Consider communicating a correlated Gaussian source over a Rayleigh fading channel with no knowledge of the channel signal-to-noise ratio (CSNR) at the transmitter. In this case, a digital system cannot be optimal for a range of CSNRs. Analog transmission however is optimal at all CSNRs, if the source and channel are memoryless and bandwidth matched. This paper presents new hybrid digital-analog (HDA) systems for sources with memory and channels with bandwidth expansion, which outperform both digital-only and analog-only systems over a wide range of CSNRs. The digital part is either a predictive quantizer or a transform code, used to achieve a coding gain. Analog part uses linear encoding to transmit the quantization error which improves the performance under CSNR variations. The hybrid encoder is optimized to achieve the minimum AMMSE (average minimum mean square error) over the CSNR distribution. To this end, analytical expressions are derived for the AMMSE of asymptotically optimal systems. It is shown that the outage CSNR of the channel code and the analog-digital power allocation must be jointly optimized to achieve the minimum AMMSE. In the case of HDA predictive quantization, a simple algorithm is presented to solve the optimization problem. Experimental results are presented for both Gauss-Markov sources and speech signals.
Iterative Available Bandwidth Estimation for Mobile Transport Networks
DEFF Research Database (Denmark)
Ubeda Castellanos, Carlos; López Villa, Dimas; Teyeb, Oumer Mohammed
2007-01-01
Available bandwidth estimation has lately been proposed to be used for end-to-end resource management in existing and emerging mobile communication systems, whose transport networks could end up being the bottleneck rather than the air interface. Algorithms for admission control, handover...
Fast discriminative latent Dirichlet allocation
National Aeronautics and Space Administration — This is the code for fast discriminative latent Dirichlet allocation, which is an algorithm for topic modeling and text classification. The related paper is at...
High-bandwidth memory interface
Kim, Chulwoo; Song, Junyoung
2014-01-01
This book provides an overview of recent advances in memory interface design at both the architecture and circuit levels. Coverage includes signal integrity and testing, TSV interface, high-speed serial interface including equalization, ODT, pre-emphasis, wide I/O interface including crosstalk, skew cancellation, and clock generation and distribution. Trends for further bandwidth enhancement are also covered. • Enables readers with minimal background in memory design to understand the basics of high-bandwidth memory interface design; • Presents state-of-the-art techniques for memory interface design; • Covers memory interface design at both the circuit level and system architecture level.
Mining Industry Energy Bandwidth Study
Energy Technology Data Exchange (ETDEWEB)
none,
2007-07-01
The Industrial Technologies Program (ITP) relies on analytical studies to identify large energy reduction opportunities in energy-intensive industries and uses these results to guide its R&D portfolio. The energy bandwidth illustrates the total energy-saving opportunity that exists in the industry if the current processes are improved by implementing more energy-efficient practices and by using advanced technologies. This bandwidth analysis report was conducted to assist the ITP Mining R&D program in identifying energy-saving opportunities in coal, metals, and mineral mining. These opportunities were analyzed in key mining processes of blasting, dewatering, drilling, digging, ventilation, materials handling, crushing, grinding, and separations.
Indian Academy of Sciences (India)
In the program shown in Figure 1, we have repeated the algorithm. M times and we can make the following observations. Each block is essentially a different instance of "code"; that is, the objects differ by the value to which N is initialized before the execution of the. "code" block. Thus, we can now avoid the repetition of the ...
Indian Academy of Sciences (India)
algorithms built into the computer corresponding to the logic- circuit rules that are used to .... For the purpose of carrying ou t ari thmetic or logical operations the memory is organized in terms .... In fixed point representation, one essentially uses integer arithmetic operators assuming the binary point to be at some point other ...
Efficient Bandwidth Management for Ethernet Passive Optical Networks
Elrasad, Amr Elsayed M.
2016-05-15
The increasing bandwidth demands in access networks motivates network operators, networking devices manufacturers, and standardization institutions to search for new approaches for access networks. These approaches should support higher bandwidth, longer distance between end user and network operator, and less energy consumption. Ethernet Passive Optical Network (EPON) is a favorable choice for broadband access networks. EPONs support transmission rates up to 10 Gbps. EPONs also support distance between end users and central office up to 20 Km. Moreover, optical networks have the least energy consumption among all types of networks. In this dissertation, we focus on reducing delay and saving energy in EPONs. Reducing delay is essential for delay-sensitive traffic, while minimizing energy consumption is an environmental necessity and also reduces the network operating costs. We identify five challenges, namely excess bandwidth allocation, frame delineation, congestion resolution, large round trip time delay in long-reach EPONs (LR-EPONs), and energy saving. We provide a Dynamic Bandwidth Allocation (DBA) approach for each challenge. We also propose a novel scheme that combines the features of the proposed approaches in one highly performing scheme. Our approach is to design novel DBA protocols that can further reduce the delay and be simultaneously simple and fair. We also present a dynamic bandwidth allocation scheme for Green EPONs taking into consideration maximizing energy saving under target delay constraints. Regarding excess bandwidth allocation, we develop an effective DBA scheme called Delayed Excess Scheduling (DES). DES achieves significant delay and jitter reduction and is more suitable for industrial deployment due to its simplicity. Utilizing DES in hybrid TDM/WDM EPONs (TWDM-EPONs) is also investigated. We also study eliminating the wasted bandwidth due to frame delineation. We develop an interactive DBA scheme, Efficient Grant Sizing Interleaved
Bandwidth-sharing in LHCONE, an analysis of the problem
Wildish, T.
2015-12-01
The LHC experiments have traditionally regarded the network as an unreliable resource, one which was expected to be a major source of errors and inefficiency at the time their original computing models were derived. Now, however, the network is seen as much more capable and reliable. Data are routinely transferred with high efficiency and low latency to wherever computing or storage resources are available to use or manage them. Although there was sufficient network bandwidth for the experiments’ needs during Run-1, they cannot rely on ever-increasing bandwidth as a solution to their data-transfer needs in the future. Sooner or later they need to consider the network as a finite resource that they interact with to manage their traffic, in much the same way as they manage their use of disk and CPU resources. There are several possible ways for the experiments to integrate management of the network in their software stacks, such as the use of virtual circuits with hard bandwidth guarantees or soft real-time flow-control, with somewhat less firm guarantees. Abstractly, these can all be considered as the users (the experiments, or groups of users within the experiment) expressing a request for a given bandwidth between two points for a given duration of time. The network fabric then grants some allocation to each user, dependent on the sum of all requests and the sum of available resources, and attempts to ensure the requirements are met (either deterministically or statistically). An unresolved question at this time is how to convert the users’ requests into an allocation. Simply put, how do we decide what fraction of a network's bandwidth to allocate to each user when the sum of requests exceeds the available bandwidth? The usual problems of any resourcescheduling system arise here, namely how to ensure the resource is used efficiently and fairly, while still satisfying the needs of the users. Simply fixing quotas on network paths for each user is likely to lead
Directory of Open Access Journals (Sweden)
Yueyue Deng
2013-01-01
Full Text Available Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.
Black holes, bandwidths and Beethoven
Kempf, Achim
2000-04-01
It is usually believed that a function φ(t) whose Fourier spectrum is bounded can vary at most as fast as its highest frequency component ωmax. This is, in fact, not the case, as Aharonov, Berry, and others drastically demonstrated with explicit counterexamples, so-called superoscillations. It has been claimed that even the recording of an entire Beethoven symphony can occur as part of a signal with a 1 Hz bandwidth. Bandlimited functions also occur as ultraviolet regularized fields. Their superoscillations have been suggested, for example, to resolve the trans-Planckian frequencies problem of black hole radiation. Here, we give an exact proof for generic superoscillations. Namely, we show that for every fixed bandwidth there exist functions that pass through any finite number of arbitrarily prespecified points. Further, we show that, in spite of the presence of superoscillations, the behavior of bandlimited functions can be characterized reliably, namely through an uncertainty relation: The standard deviation ΔT of samples φ(tn) taken at the Nyquist rate obeys ΔT>=1/4ωmax. This uncertainty relation generalizes to variable bandwidths. For ultraviolet regularized fields we identify the bandwidth as the in general spatially variable finite local density of degrees of freedom.
Department of Housing and Urban Development — This report displays the Emergency Solutions Grants (ESG), formerly Emergency Shelter Grants, allocation by jurisdiction. The website allows users to look at...
Bandwidth utilization maximization of scientific RF communication systems
Energy Technology Data Exchange (ETDEWEB)
Rey, D. [Sandia National Lab., Albuquerque, NM (United States); Ryan, W. [New Mexico State Univ., Las Cruces, NM (United States); Ross, M.
1997-01-01
A method for more efficiently utilizing the frequency bandwidth allocated for data transmission is presented. Current space and range communication systems use modulation and coding schemes that transmit 0.5 to 1.0 bits per second per Hertz of radio frequency bandwidth. The goal in this LDRD project is to increase the bandwidth utilization by employing advanced digital communications techniques. This is done with little or no increase in the transmit power which is usually very limited on airborne systems. Teaming with New Mexico State University, an implementation of trellis coded modulation (TCM), a coding and modulation scheme pioneered by Ungerboeck, was developed for this application and simulated on a computer. TCM provides a means for reliably transmitting data while simultaneously increasing bandwidth efficiency. The penalty is increased receiver complexity. In particular, the trellis decoder requires high-speed, application-specific digital signal processing (DSP) chips. A system solution based on the QualComm Viterbi decoder and the Graychip DSP receiver chips is presented.
Directory of Open Access Journals (Sweden)
Saheli Ray
2015-08-01
Full Text Available Reliability enhancement of power distribution system has attained much significance in the present competitive electricity market. Accordingly, methodologies to assess and improve distribution system reliability are also gaining much importance. This study proposes oppositional differential search (ODS algorithm to solve reliability optimisation problem of radial distribution system. The objective of this study is to obtain the optimum number, size and location of distributed generation as well as optimal number and location of remote control switch simultaneously in radial distribution system in order to improve system reliability at a compromised cost. A multi-objective function has been formulated here. Differential search (DS algorithm imitates the seasonal migration behaviour of an organism in search of efficiency of food areas. Opposition-based DS (ODS algorithm has been used here to improve the quality of solution in minimum time. The proposed opposition-based DS (ODS algorithm utilises opposition-based learning for Superorganism initialisation and also for iteration wise update operation. Simulation results obtained by ODS algorithm have been compared with that of DS algorithm and differential evolutionary algorithm. Simulation results reveal that ODS algorithm provides considerably superior performance, in terms of quality of solution obtained and computational efficiency.
Gandotra, Pimmy; Jha, Rakesh Kumar; Jain, Sanjeev
2018-01-01
The mounting content sharing among users has resulted in a considerable rise in wireless data traffic, pressurizing the cellular networks to undergo a suitable upheaval. A competent technology of the fifth-generation networks (5G) for efficiently supporting proximity-based applications is Device-to-Device (D2D) communication, underlaying cellular networks. Significant advances have been made till date, for allocating resources to D2D users in cellular networks, such that sharing of spectral r...
Directory of Open Access Journals (Sweden)
Ikhthison Mekongga
2014-02-01
Full Text Available The need for bandwidth has been increasing recently. This is because the development of internet infrastructure is also increasing so that we need an economic and efficient provider system. This can be achieved through good planning and a proper system. The prediction of the bandwidth consumption is one of the factors that support the planning for an efficient internet service provider system. Bandwidth consumption is predicted using ANN. ANN is an information processing system which has similar characteristics as the biologic al neural network. ANN is chosen to predict the consumption of the bandwidth because ANN has good approachability to non-linearity. The variable used in ANN is the historical load data. A bandwidth consumption information system was built using neural networks with a backpropagation algorithm to make the use of bandwidth more efficient in the future both in the rental rate of the bandwidth and in the usage of the bandwidth.Keywords: Forecasting, Bandwidth, Backpropagation
BMCloud: Minimizing Repair Bandwidth and Maintenance Cost in Cloud Storage
Directory of Open Access Journals (Sweden)
Chao Yin
2013-01-01
Full Text Available To protect data in cloud storage, fault tolerance and efficient recovery become very important. Recent studies have developed numerous solutions based on erasure code techniques to solve this problem using functional repairs. However, there are two limitations to address. The first one is consistency since the Encoding Matrix (EM is different among clouds. The other one is repairing bandwidth, which is a concern for most of us. We addressed these two problems from both theoretical and practical perspectives. We developed BMCloud, a new low repair bandwidth, low maintenance cost cloud storage system, which aims to reduce repair bandwidth and maintenance cost. The system employs both functional repair and exact repair while it inherits advantages from the both. We propose the JUDGE_STYLE algorithm, which can judge whether the system should adopt exact repair or functional repair. We implemented a networked storage system prototype and demonstrated our findings. Compared with existing solutions, BMCloud can be used in engineering to save repair bandwidth and degrade maintenance significantly.
Xu, Chuanpei; Niu, Junhao; Ling, Jing; Wang, Suyan
2018-03-01
In this paper, we present a parallel test strategy for bandwidth division multiplexing under the test access mechanism bandwidth constraint. The Pareto solution set is combined with a cloud evolutionary algorithm to optimize the test time and power consumption of a three-dimensional network-on-chip (3D NoC). In the proposed method, all individuals in the population are sorted in non-dominated order and allocated to the corresponding level. Individuals with extreme and similar characteristics are then removed. To increase the diversity of the population and prevent the algorithm from becoming stuck around local optima, a competition strategy is designed for the individuals. Finally, we adopt an elite reservation strategy and update the individuals according to the cloud model. Experimental results show that the proposed algorithm converges to the optimal Pareto solution set rapidly and accurately. This not only obtains the shortest test time, but also optimizes the power consumption of the 3D NoC.
Controlling Laser Plasma Instabilities Using Temporal Bandwidth
Tsung, Frank; Weaver, J.; Lehmberg, R.
2016-10-01
We are performing particle-in-cell simulations using the code OSIRIS to study the effects of laser plasma interactions in the presence of temporal bandwidth under conditions relevant to current and future experiments on the NIKE laser. Our simulations show that, for sufficiently large bandwidth (where the inverse bandwidth is comparable with the linear growth time), the saturation level, and the distribution of hot electrons, can be effected by the addition of temporal bandwidths (which can be accomplished in experiments using beam smoothing techniques such as ISI). We will quantify these effects and investigate higher dimensional effects such as laser speckles. This work is supported by DOE and NRL.
Real-Time Optimization Of Receiver Bandwidth
Vilnrotter, V. A.; Hurd, W. J.; Brown, D. H.
1989-01-01
Estimates of signal and noise spectra enhance reception of weak signals. Carrier-tracking phase-locked loop represented by linear mathematical model at small rms phase errors. Loop continuously generates estimates of received phase. Bandwidth (in effect, scale of complex-frequency variable p) optimized to minimize rms phase error. Minimum signals tracked 5 to 15 dB below those tracked by current receivers. Improvement accomplished by use of bandwidths of 0.1 to 1.0 Hz, in contrast with 3-Hz bandwidth in current use. Principle of real-time optimization of bandwidth adapted to other situations to enhance reception of weak signals otherwise "buried" in noise.
Bandwidth Optimization in Centralized WLANs for Different Traffic Types
Directory of Open Access Journals (Sweden)
Haines RJ
2007-01-01
Full Text Available Allocating bandwidth between different forms of coexisting traffic (such as web-browsing, streaming, and telephony within a wireless LAN is a challenging and interesting problem. Centralized coordination functions in wireless LANs offer several advantages over distributed approaches, having the benefit of a system overview at the controller, but obtaining a stable configuration of bandwidth allocation for the system is nontrivial. We present, review, and compare different mechanisms to achieve this end, and a number of different means of obtaining the configurations themselves. We describe an analytical model of the system under consideration and present two mathematical approaches to derive solutions for any system configuration and deployment, along with an adaptive feedback-based solution. We also describe a comprehensive simulation-based model for the problem, and a prototype that allows comparison of these approaches. Our investigations demonstrate that a self-adaptive dynamic approach far outperforms any static scheme, and that using a mathematical model to produce the configurations themselves confers several advantages.
Dynamic capacity allocation for low-cost multicarrier multimode PON
Taniman, R.O.; van Bochove, A.C.; de Boer, Pieter-Tjerk; Sikkes, B.
A stable-matching-based multiuser multicarrier capacity allocation algorithm is proposed. It responds to ONU backlogs and dynamic subchannel gains. Benchmarked against Binary Linear Programming, it results in just 5% less allocated capacity, at much lower complexity.
Bandwidth engineering of photonic crystal waveguide bends
DEFF Research Database (Denmark)
Borel, Peter Ingo; Frandsen, Lars Hagedorn; Harpøth, Anders
2004-01-01
An effective design principle has been applied to photonic crystal waveguide bends fabricated in silicon-on-insulator material using deep UV lithography resulting in a large increase in the low-loss bandwidth of the bends. Furthermore, it is experimentally demonstrated that the absolute bandwidth...... range can be adjusted in a post-fabrication thermal oxidation process....
Bandwidth engineering of photonic crystal waveguide bends
DEFF Research Database (Denmark)
Borel, Peter Ingo; Frandsen, Lars Hagedorn; Harpøth, Anders
2004-01-01
An effective design principle has been applied to photonic crystal waveguide bends fabricated in silicon-on-insulator material using deep UV lithography resulting in a large increase in the low-loss bandwidth of the bends. Furthermore, it is experimentally demonstrated that the absolute bandwidth...
3 Approaches to Achieve Bandwidth Capacity
Indian Academy of Sciences (India)
First page Back Continue Last page Overview Graphics. 3 Approaches to Achieve Bandwidth Capacity. Install new fiber. Average cost $70,000 per mile. Right of way. Higher bandwidth on SONET/TDM. Single mode fiber high dispersion rate. NZDSF cost some 50 percent more than SMF. DWDM. Multi Wavelength Switching ...
Energy Bandwidth for Petroleum Refining Processes
Energy Technology Data Exchange (ETDEWEB)
none,
2006-10-01
The petroleum refining energy bandwidth report analyzes the most energy-intensive unit operations used in U.S. refineries: crude oil distillation, fluid catalytic cracking, catalytic hydrotreating, catalytic reforming, and alkylation. The "bandwidth" provides a snapshot of the energy losses that can potentially be recovered through best practices and technology R&D.
A cooperative online learning scheme for resource allocation in 5G systems
Alqerm, Ismail
2016-07-26
The demand on mobile Internet related services has increased the need for higher bandwidth in cellular networks. The 5G technology is envisioned as a solution to satisfy this demand as it provides high data rates and scalable bandwidth. The multi-tier heterogeneous structure of 5G with dense base station deployment, relays, and device-to-device (D2D) communications intends to serve users with different QoS requirements. However, the multi-tier structure causes severe interference among the multi-tier users which further complicates the resource allocation problem. In this paper, we propose a cooperative scheme to tackle the interference problem, including both cross-tier interference that affects macro users from other tiers and co-tier interference, which is among users belong to the same tier. The scheme employs an online learning algorithm for efficient spectrum allocation with power and modulation adaptation capability. Our evaluation results show that our online scheme outperforms others and achieves significant improvements in throughput, spectral efficiency, fairness, and outage ratio. © 2016 IEEE.
Bandwidth Selection for Weighted Kernel Density Estimation
Wang, Bin; Wang, Xiaofeng
2007-01-01
In the this paper, the authors propose to estimate the density of a targeted population with a weighted kernel density estimator (wKDE) based on a weighted sample. Bandwidth selection for wKDE is discussed. Three mean integrated squared error based bandwidth estimators are introduced and their performance is illustrated via Monte Carlo simulation. The least-squares cross-validation method and the adaptive weight kernel density estimator are also studied. The authors also consider the boundary...
Department of Veterans Affairs — The Residency Allocation Database is used to determine allocation of funds for residency programs offered by Veterans Affairs Medical Centers (VAMCs). Information...
Bandwidth Efficient Hybrid Synchronization for Wireless Sensor Network
DEFF Research Database (Denmark)
Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee
2015-01-01
Data collection and transmission are the fundamental operations of Wireless Sensor Networks (WSNs). A key challenge in effective data collection and transmission is to schedule and synchronize the activities of the nodes with the global clock. This paper proposes the Bandwidth Efficient Hybrid...... Synchronization Data Aggregation Algorithm (BESDA) using spanning tree mechanism (SPT). It uses static sink and mobile nodes in the network. BESDA considers the synchronization of a local clock of node with global clock of the network. In the initial stage algorithm established the hierarchical structure...... in the network and then perform the pair-wise synchronization. With the mobility of node, the structure frequently changes causing an increase in energy consumption. To mitigate the problem BESDA aggregate data with the notion of a global timescale throughout the network and schedule based time-division multiple...
Dynamic Online Bandwidth Adjustment Scheme Based on Kalai-Smorodinsky Bargaining Solution
Kim, Sungwook
Virtual Private Network (VPN) is a cost effective method to provide integrated multimedia services. Usually heterogeneous multimedia data can be categorized into different types according to the required Quality of Service (QoS). Therefore, VPN should support the prioritization among different services. In order to support multiple types of services with different QoS requirements, efficient bandwidth management algorithms are important issues. In this paper, I employ the Kalai-Smorodinsky Bargaining Solution (KSBS) for the development of an adaptive bandwidth adjustment algorithm. In addition, to effectively manage the bandwidth in VPNs, the proposed control paradigm is realized in a dynamic online approach, which is practical for real network operations. The simulations show that the proposed scheme can significantly improve the system performances.
Bayesian Bandwidth Selection for a Nonparametric Regression Model with Mixed Types of Regressors
Directory of Open Access Journals (Sweden)
Xibin Zhang
2016-04-01
Full Text Available This paper develops a sampling algorithm for bandwidth estimation in a nonparametric regression model with continuous and discrete regressors under an unknown error density. The error density is approximated by the kernel density estimator of the unobserved errors, while the regression function is estimated using the Nadaraya-Watson estimator admitting continuous and discrete regressors. We derive an approximate likelihood and posterior for bandwidth parameters, followed by a sampling algorithm. Simulation results show that the proposed approach typically leads to better accuracy of the resulting estimates than cross-validation, particularly for smaller sample sizes. This bandwidth estimation approach is applied to nonparametric regression model of the Australian All Ordinaries returns and the kernel density estimation of gross domestic product (GDP growth rates among the organisation for economic co-operation and development (OECD and non-OECD countries.
Bandwidth efficient cluster-based data aggregation for Wireless Sensor Network
DEFF Research Database (Denmark)
Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee
2015-01-01
the available bandwidth efficiently. The proposed Bandwidth Efficient Cluster- based Data Aggregation (BECDA) algorithm presents the solution for the effective data gathering with in-network aggregation. It considers the network with heterogeneous nodes in terms of energy and mobile sink to aggregate the data......A fundamental challenge in the design of Wireless Sensor Network (WSNs) is the proper utilization of resources that are scarce. The critical challenge is to maximize the bandwidth utilization in data gathering and forwarding from sensor nodes to the sink. The main design objective is to utilize...... packets. The optimal approach is achieved by intra and inter-cluster aggregation on the randomly distributed nodes with the variable data generation rate. The proposed algorithm uses the correlation of data within the packet for applying the aggregation function on the data generated by nodes. BECDA shows...
Negative inductance circuits for metamaterial bandwidth enhancement
Avignon-Meseldzija, Emilie; Lepetit, Thomas; Ferreira, Pietro Maris; Boust, Fabrice
2017-12-01
Passive metamaterials have yet to be translated into applications on a large scale due in large part to their limited bandwidth. To overcome this limitation many authors have suggested coupling metamaterials to non-Foster circuits. However, up to now, the number of convincing demonstrations based on non-Foster metamaterials has been very limited. This paper intends to clarify why progress has been so slow, i.e., the fundamental difficulty in making a truly broadband and efficient non-Foster metamaterial. To this end, we consider two families of metamaterials, namely Artificial Magnetic Media and Artificial Magnetic Conductors. In both cases, it turns out that bandwidth enhancement requires negative inductance with almost zero resistance. To estimate bandwidth enhancement with actual non-Foster circuits, we consider two classes of such circuits, namely Linvill and gyrator. The issue of stability being critical, both metamaterial families are studied with equivalent circuits that include advanced models of these non-Foster circuits. Conclusions are different for Artificial Magnetic Media coupled to Linvill circuits and Artificial Magnetic Conductors coupled to gyrator circuits. In the first case, requirements for bandwidth enhancement and stability are very hard to meet simultaneously whereas, in the second case, an adjustment of the transistor gain does significantly increase bandwidth.
Negative inductance circuits for metamaterial bandwidth enhancement
Directory of Open Access Journals (Sweden)
Avignon-Meseldzija Emilie
2017-01-01
Full Text Available Passive metamaterials have yet to be translated into applications on a large scale due in large part to their limited bandwidth. To overcome this limitation many authors have suggested coupling metamaterials to non-Foster circuits. However, up to now, the number of convincing demonstrations based on non-Foster metamaterials has been very limited. This paper intends to clarify why progress has been so slow, i.e., the fundamental difficulty in making a truly broadband and efficient non-Foster metamaterial. To this end, we consider two families of metamaterials, namely Artificial Magnetic Media and Artificial Magnetic Conductors. In both cases, it turns out that bandwidth enhancement requires negative inductance with almost zero resistance. To estimate bandwidth enhancement with actual non-Foster circuits, we consider two classes of such circuits, namely Linvill and gyrator. The issue of stability being critical, both metamaterial families are studied with equivalent circuits that include advanced models of these non-Foster circuits. Conclusions are different for Artificial Magnetic Media coupled to Linvill circuits and Artificial Magnetic Conductors coupled to gyrator circuits. In the first case, requirements for bandwidth enhancement and stability are very hard to meet simultaneously whereas, in the second case, an adjustment of the transistor gain does significantly increase bandwidth.
A Bandwidth Reconfigurable Antenna for Cognitive Radios
Ghanem, F.; Hall, P. S.
Cognitive radios have two operating modes, the searching mode where the system looks for the bandwidth to operate in and the operating mode where users transmit and receive information data through this bandwidth. In the first mode, one may have a very wide bandwidth antenna to be able to scan all the spectrum and in the operating mode one may have a narrow bandwidth antenna to filter out unwanted signals. In this chapter, we present a new antenna capable of operating in both UWB and narrowband modes, which is also tunable in the operating (narrowband) mode. It is composed of a microstrip disc monopole with defect slots in its ground plane. When the slots are deactivated, the antenna exhibits UWB behaviour from 2 to 10 GHz. To narrow the frequency bandwidth, defect slots are activated to act as a band-pass filter that narrows the antenna response. The activation and deactivation of the slots can be achieved by using switches located under the antenna feed line. In this case, the antenna response can be tuned by varying the slots' length. To examine the presented approach, both simulated and measured results are presented and discussed.
Bandwidth Assessment for MultiRotor UAVs
Directory of Open Access Journals (Sweden)
Ferrarese Gastone
2017-06-01
Full Text Available This paper is a technical note about the theoretical evaluation of the bandwidth of multirotor helicopters. Starting from a mathematical linear model of the dynamics of a multirotor aircraft, the transfer functions of the state variables that deeply affect the stability characteristics of the aircraft are obtained. From these transfer functions, the frequency response analysis of the system is effected. After this analysis, the bandwidth of the system is defined. This result is immediately utilized for the design of discrete PID controllers for hovering flight stabilization. Numeric simulations are shown to demonstrate that the knowledge of the bandwidth is a valid aid in the design of flight control systems of these machines.
Improved space bandwidth product in image upconversion
DEFF Research Database (Denmark)
Dam, Jeppe Seidelin; Pedersen, Christian; Tidemand-Lichtenberg, Peter
2012-01-01
We present a technique increasing the space bandwidth product of a nonlinear image upconversion process used for spectral imaging. The technique exploits the strong dependency of the phase-matching condition in sum frequency generation (SFG) on the angle of propagation of the interacting fields...... with respect to the optical axis. Appropriate scanning of the phase-match condition (Δk=0) while acquiring images, allow us to perform monochromatic image reconstruction with a significantly increased space bandwidth product. We derive the theory for the image reconstruction process and demonstrate acquisition...... of images with >10 fold increase in space bandwidth product, i.e. the number of pixel elements, when compared to upconversion of images using fixed phase-match conditions....
Modulation bandwidth of a spin laser
Banerjee, D.; Adari, R.; Murthy, M.; Suggisetti, P.; Ganguly, S.; Saha, D.
2011-04-01
We have studied small signal frequency response of a spin laser. We have shown that the response is characterized by two distinct resonant peaks corresponding to the two polarization modes of the spin laser. It is observed that the modulation bandwidth of a spin laser can be smaller or larger than that of a conventional laser depending upon the current bias and spin relaxation time constant. A small value for spin relaxation constant may not be detrimental for modulation bandwidth. This anomalous observation is explained by considering both the amplitude and phase response of the two polarization modes. A spin laser can act as a combination of low-pass and bandpass filters. The passband frequency range is tunable by external bias. We have also studied the evolution of resonant peaks and modulation bandwidth as a function of spin relaxation time constant.
Effective masking bandwidths at low frequencies.
Fidell, S; Horonjeff, R; Teffeteller, S; Green, D M
1983-02-01
Masking of low-frequency sinusoids of varying durations by Gaussian noise of varying spectral shape was measured in three different studies. Common solutions to technical problems associated with control and specification of low-frequency signals were used in the three studies. If interpreted in terms of Fletcher's critical ratio assumptions, data from the first study lead to the inference that the masking bandwidth is inversely related to signal frequency below about 200 Hz. Data from the second study rule out the likelihood that the apparent increase in masking bandwidth is attributable to changes in auditory integration times at low frequencies. The data of the third study suggest that the apparent increase in auditory filter bandwidth at low frequencies is more adequately explained by a decrease in observers' detection efficiency than by broadening of the filter bandpass.
The information bandwidth of neutron scattering instruments
International Nuclear Information System (INIS)
Johnson, M.W.
1995-07-01
The concept of the information content of a scientific measurement is introduced, and a theory is presented which enables the information that may be obtained by a neutron scattering instrument to be calculated. When combined with the time taken to perform the measurement the bandwidth of the instrument is obtained. This bandwidth is effectively a figure of merit which is of use in three respects: in the design of neutron instrumentation, the optimisation of measurements, and in the comparison of one instrument with another. (author)
3 Approaches to Achieve Bandwidth Capacity
Indian Academy of Sciences (India)
Install new fiber. Average cost $70,000 per mile. Right of way. Higher bandwidth on SONET/TDM. Single mode fiber high dispersion rate. NZDSF cost some 50 percent more than SMF. DWDM. Multi Wavelength Switching, Multiple Interface ATM,Ethernet, Frame Relay, TDM/SONET; Fast, Simple, Cheap.
Big Bandwidth Battle: Universal ADSL Looks Ahead.
Hargadon, Tom
1998-01-01
Discusses the new Universal ADSL (Asymmetric Digital Subscriber Line) standard, which promises simple, high-bandwidth access over standard telephone lines. Topics include varieties of DSL; voice and data capacities; adapters and installation for personal computers; Internet backbone capacity; and headend access. (LRW)
Discrete Tolerance Allocation for Product Families
2011-01-01
Abstract This paper extends earlier research on the discrete tolerance allocation problem in order to optimize an entire product family simultaneously. This methodology enables top-down tolerancing approach where requirements on assembly level on products within a family are allocated to single part requirements. The proposed solution has been implemented as an interface with an optimization algorithm coupled with a variation simulation software. The paper also consists of an exten...
A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem
Pintea, Camelia-M.; Crişan, Gloria-Cerasela; Chira, Camelia
The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous permutation of the rows and the columns of a square matrix in order to keep its nonzero entries close to the main diagonal. The MBMP is a highly investigated {NP}-complete problem, as it has broad applications in industry, logistics, artificial intelligence or information recovery. This paper describes a new attempt to use the Ant Colony Optimization framework in tackling MBMP. The introduced model is based on the hybridization of the Ant Colony System technique with new local search mechanisms. Computational experiments confirm a good performance of the proposed algorithm for the considered set of MBMP instances.
4G femtocells resource allocation and interference management
Zhang, Haijun; Wen, Xiangming
2014-01-01
This brief examines resource allocation and interference management for 4G femtocells. It introduces 4G femtocells in the context of 4G mobile networks and discusses related technical challenges in resource allocation and interference management. Topics include ant colony algorithm based downlink resource allocation, intelligent scheduling and power control, uplink and downlink for two-tier networks, quality of service (QoS) constraints and the cross-tier interference constraint. The authors present algorithms to alleviate common femtocell-related problems such as subchannel power allocation. The complexity of the proposed resource allocation algorithms is analyzed, and the effectiveness of the proposed algorithms is verified by simulations. This concise and practical book directly addresses common problems relating to femtocells and resource management. It serves as a useful tool for researchers in the field. Advanced-level students or professionals interested in femtocells and networks will also find the co...
DEFF Research Database (Denmark)
Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee
2013-01-01
Data Aggregation (MHBCDA) algorithm for the randomly distributed nodes. It considers the mobile sink based packet aggregation for the heterogeneous WSN. It uses predefined region for the aggregation at cluster head to minimize computation and communication cost. The MHBCDA is energy and bandwidth......Wireless Sensor Network (WSN) offers a variety of novel applications for mobile targets. It generates the large amount of redundant sensing data. The data aggregation techniques are extensively used to reduce the energy consumption and increase the network lifetime, although it has the side effect...... of reduced reliability. In the mobile environment, it is necessary to consider the techniques which minimize the communication cost with efficient bandwidth utilization by decreasing the packet count reached at the sink. This paper proposes the mobility and heterogeneity aware bandwidth efficient Cluster-based...
Digital demodulator for wide bandwidth SAR
DEFF Research Database (Denmark)
Jørgensen, Jørn Hjelm
2000-01-01
A novel approach to the design of efficient digital quadrature demodulators for wide bandwidth SAR systems is described. Efficiency is obtained by setting the intermediate frequency to 1/4 the ADC sampling frequency. One channel is made filter-free by synchronizing the local oscillator with the o......A novel approach to the design of efficient digital quadrature demodulators for wide bandwidth SAR systems is described. Efficiency is obtained by setting the intermediate frequency to 1/4 the ADC sampling frequency. One channel is made filter-free by synchronizing the local oscillator...... with the output decimator. The filter required by the other channel is optimized through global search using the system level performance metrics integrated sidelobe level ratio (ISLR) and peak sidelobe level ratio (PSLR)....
Bandwidth Analysis of Smart Meter Network Infrastructure
DEFF Research Database (Denmark)
Balachandran, Kardi; Olsen, Rasmus Løvenstein; Pedersen, Jens Myrup
2014-01-01
Advanced Metering Infrastructure (AMI) is a net-work infrastructure in Smart Grid, which links the electricity customers to the utility company. This network enables smart services by making it possible for the utility company to get an overview of their customers power consumption and also control...... to utilize smart meters and which existing broadband network technologies can facilitate this smart meter service. Initially, scenarios for smart meter infrastructure are identified. The paper defines abstraction models which cover the AMI scenarios. When the scenario has been identified a general overview...... of the bandwidth requirements are analysed. For this analysis the assumptions and limitations are defined. The results obtained by the analysis show, that the amount of data collected and transferred by a smart meter is very low compared to the available bandwidth of most internet connections. The results show...
Large-bandwidth planar photonic crystal waveguides
DEFF Research Database (Denmark)
Søndergaard, Thomas; Lavrinenko, Andrei
2002-01-01
A general design principle is presented for making finite-height photonic crystal waveguides that support leakage-free guidance of light over large frequency intervals. The large bandwidth waveguides are designed by introducing line defects in photonic crystal slabs, where the material in the line...... defect has appropriate dispersion properties relative to the photonic crystal slab material surrounding the line defect. A three-dimensional theoretical analysis is given for large-bandwidth waveguide designs based on a silicon-air photonic crystal slab suspended in air. In one example, the leakage......-free single-mode guidance is found for a large frequency interval covering 60% of the photonic band-gap....
High bandwidth concurrent processing on commodity platforms
Boosten, M; Van der Stok, P D V
1999-01-01
The I/O bandwidth and real-time processing power required for high- energy physics experiments is increasing rapidly over time. The current requirements can only be met by using large-scale concurrent processing. We are investigating the use of a large PC cluster interconnected by Fast and Gigabit Ethernet to meet the performance requirements of the ATLAS second level trigger. This architecture is attractive because of its performance and competitive pricing. A major problem is obtaining frequent high-bandwidth I/O without sacrificing the CPU's processing power. We present a tight integration of a user-level scheduler and a zero-copy communication layer. This system closely approaches the performance of the underlying hardware in terms of both CPU power and I/O capacity. (0 refs).
Reconstitution of Low Bandwidth Reaction History
International Nuclear Information System (INIS)
May, M.; Clancy, T.; Fittinghoff, D.; Gennaro, P.; Hagans, K.; Halvorson, G.; Lowry, M.; Perry, T.; Roberson, P.; Smith, D.; Teruya, A.; Blair, J.; Davis, B.; Hunt, E.; Emkeit, B.; Galbraith, J.; Kelly, B.; Montoya, R.; Nickel, G.; Ogle, J.; Wilson, K.; Wood, M.
2004-01-01
The goal of the Test Readiness Program is to transition to a 24 month test readiness posture and if approved move to an 18-month posture. One of the key components of the Test Readiness Program necessary to meet this goal is the reconstitution of the important diagnostics. Since the end of nuclear testing, the ability to field diagnostics on a nuclear test has deteriorated. Reconstitution of diagnostics before those who had experience in nuclear testing either retire or leave is essential to achieving a shorter test readiness posture. Also, the data recording systems have not been used since the end of testing. This report documents the reconstitution of one vital diagnostic: the low bandwidth reaction history diagnostic for FY04. Reaction history is one of the major diagnostics that has been used on all LLNL and LANL tests since the early days of nuclear testing. Reaction history refers to measuring the time history of the gamma and neutron output from a nuclear test. This gives direct information on the nuclear reactions taking place in the device. The reaction history measurements are one of the prime measurements the nuclear weapon scientists use to validate their models of device performance. All tests currently under consideration require the reaction history diagnostic. Thus moving to a shorter test readiness posture requires the reconstitution of the ability to make reaction history measurements. Reconstitution of reaction history was planned to be in two steps. Reaction history measurements that have been used in the past can be broadly placed into two categories. The most common type of reaction history and the one that has been performed on virtually all nuclear tests is termed low bandwidth reaction history. This measurement has a time response that is limited by the bandpass of kilometer length coaxial cables. When higher bandwidth has been required for specific measurements, fiber optic techniques have been used. This is referred to as high-bandwidth
Time-optimal control with finite bandwidth
Hirose, M.; Cappellaro, P.
2018-04-01
Time-optimal control theory provides recipes to achieve quantum operations with high fidelity and speed, as required in quantum technologies such as quantum sensing and computation. While technical advances have achieved the ultrastrong driving regime in many physical systems, these capabilities have yet to be fully exploited for the precise control of quantum systems, as other limitations, such as the generation of higher harmonics or the finite response time of the control apparatus, prevent the implementation of theoretical time-optimal control. Here we present a method to achieve time-optimal control of qubit systems that can take advantage of fast driving beyond the rotating wave approximation. We exploit results from time-optimal control theory to design driving protocols that can be implemented with realistic, finite-bandwidth control fields, and we find a relationship between bandwidth limitations and achievable control fidelity.
Software defined multi-OLT passive optical network for flexible traffic allocation
Zhang, Shizong; Gu, Rentao; Ji, Yuefeng; Zhang, Jiawei; Li, Hui
2016-10-01
With the rapid growth of 4G mobile network and vehicular network services mobile terminal users have increasing demand on data sharing among different radio remote units (RRUs) and roadside units (RSUs). Meanwhile, commercial video-streaming, video/voice conference applications delivered through peer-to-peer (P2P) technology are still keep on stimulating the sharp increment of bandwidth demand in both business and residential subscribers. However, a significant issue is that, although wavelength division multiplexing (WDM) and orthogonal frequency division multiplexing (OFDM) technology have been proposed to fulfil the ever-increasing bandwidth demand in access network, the bandwidth of optical fiber is not unlimited due to the restriction of optical component properties and modulation/demodulation technology, and blindly increase the wavelength cannot meet the cost-sensitive characteristic of the access network. In this paper, we propose a software defined multi-OLT PON architecture to support efficient scheduling of access network traffic. By introducing software defined networking technology and wavelength selective switch into TWDM PON system in central office, multiple OLTs can be considered as a bandwidth resource pool and support flexible traffic allocation for optical network units (ONUs). Moreover, under the configuration of the control plane, ONUs have the capability of changing affiliation between different OLTs under different traffic situations, thus the inter-OLT traffic can be localized and the data exchange pressure of the core network can be released. Considering this architecture is designed to be maximum following the TWDM PON specification, the existing optical distribution network (ODN) investment can be saved and conventional EPON/GPON equipment can be compatible with the proposed architecture. What's more, based on this architecture, we propose a dynamic wavelength scheduling algorithm, which can be deployed as an application on control plane
Nishio, Tatsuya; Numai, Takahiro
2013-05-01
The purpose of this paper is to reduce four-wave-mixing (FWM) noises with narrow total bandwidth in frequency-division-multiplexing optical fiber transmission systems. In this work, unequally spaced (US) frequency allocations using base units (BUs), which have US frequency allocations, are proposed, and dependence of the total bandwidth and FWM noises on the allocation of the BUs is investigated. When the frequency separations of the channels in the BUs are ascending arithmetic progressions, the lowest power penalty is obtained for the combination of the BUs with ascending bandwidths.
Energy-Efficient Bandwidth Allocation for Multiuser Scalable Video Streaming over WLAN
Directory of Open Access Journals (Sweden)
Lafruit Gauthier
2008-01-01
Full Text Available Abstract We consider the problem of packet scheduling for the transmission of multiple video streams over a wireless local area network (WLAN. A cross-layer optimization framework is proposed to minimize the wireless transceiver energy consumption while meeting the user required visual quality constraints. The framework relies on the IEEE 802.11 standard and on the embedded bitstream structure of the scalable video coding scheme. It integrates an application-level video quality metric as QoS constraint (instead of a communication layer quality metric with energy consumption optimization through link layer scaling and sleeping. Both energy minimization and min-max energy optimization strategies are discussed. Simulation results demonstrate significant energy gains compared to the state-of-the-art approaches.
Wireless bandwidth authentication improving quality of service
Peart, Amanda; Good, Alice
2012-01-01
With the popularity of distributed applications such as BitTorrent and Peer 2 Peer (P2P) networks, coupled with the increase in mobility of end user devices, there is a requirement for dynamic bandwidth management. Mobile users require access to the internet at varying times and for various reasons. Generally this access is via public hotspots in places such as airports, hotels and coffee shops. Therefore it is paramount that user access is managed as some users will utilize an unfair amount ...
QoS routing via multiple paths using bandwidth reservation
Energy Technology Data Exchange (ETDEWEB)
Rao, N.S.V.; Batsell, S.G.
1997-11-01
The authors address the problem of computing a multipath, consisting of possibly overlapping paths, to transmit data from the source node s to the destination node d over a computer network while ensuring deterministic bounds on end-to-end delay or delivery rate. They consider two generic routing problems within the framework wherein bandwidth can be reserved, and guaranteed, once reserved, on various links of the communication network. The first problem requires that a message of finite length be transmitted from s to d within {tau} units of time. The second problem requires that a sequential message of r units be transmitted at a rate of {eta} such that maximum time difference between two units that are received out of order is no more than q. They propose a polynomial-time algorithm to the first problem based on an adaptation of the classical Ford-Fulkerson`s method. They present simulation results to illustrate the applicability of the proposed algorithm. They show the second problem to be NP-complete and propose a polynomial-time approximate solution.
QoS routing via multiple paths using bandwidth reservation
Energy Technology Data Exchange (ETDEWEB)
Rao, N.S.V.; Batsell, S.G.
1998-01-01
The authors address the problem of computing a multipath, consisting of possibly overlapping paths, to transmit data from the source node s to the destination node d over a computer network while ensuring deterministic bounds on end-to-end delay or delivery rate.They consider two generic routing problems within the framework wherein bandwidth can be reserved, and guaranteed, once reserved, on various links of the communication network. The first problem requires that a message of finite length be transmitted from s to d within {tau} units of time. The second problem requires that a sequential message of r units be transmitted at a rate of {eta} such that maximum time difference between two units that are received out of order is no more than q. They propose a polynomial-time algorithm to the first problem based on an adaptation of the classical Ford-Fulkerson`s method. They present simulation results to illustrate the applicability of the proposed algorithm. They show the second problem to be NP-complete, and propose a polynomial-time approximately solution.
Identifying Memory Allocation Patterns in HEP Software
Kama, S.; Rauschmayr, N.
2017-10-01
HEP applications perform an excessive amount of allocations/deallocations within short time intervals which results in memory churn, poor locality and performance degradation. These issues are already known for a decade, but due to the complexity of software frameworks and billions of allocations for a single job, up until recently no efficient mechanism has been available to correlate these issues with source code lines. However, with the advent of the Big Data era, many tools and platforms are now available to do large scale memory profiling. This paper presents, a prototype program developed to track and identify each single (de-)allocation. The CERN IT Hadoop cluster is used to compute memory key metrics, like locality, variation, lifetime and density of allocations. The prototype further provides a web based visualization back-end that allows the user to explore the results generated on the Hadoop cluster. Plotting these metrics for every single allocation over time gives a new insight into application’s memory handling. For instance, it shows which algorithms cause which kind of memory allocation patterns, which function flow causes how many short-lived objects, what are the most commonly allocated sizes etc. The paper will give an insight into the prototype and will show profiling examples for the LHC reconstruction, digitization and simulation jobs.
EXPERIENCED TASK-BASED MULTI ROBOT TASK ALLOCATION
Ezercan Kayır, H. Hilal
2017-01-01
In multi robot system applications, itis possible that the robots transform their past experiences into usefulinformation which will be used for next task allocation processes by usinglearning-based task allocation mechanisms. The major disadvantages of multi-robotQ-learning algorithm are huge learning space and computational cost due togeneralized state and joint action spaces of robots. In this study, experiencedtask-based multi robot task allocation approach is proposed. According to thisa...
2003-09-01
21 9. Beowulf Ethernet Channel Bonding.................................................22 F. SUMMARY...on demand, hybrid channel allocation in wireless networks, and 3 Beowulf Ethernet channel bonding. The background information presented in this...channels are available for dynamic allocation [Ref 32]. 9. Beowulf Ethernet Channel Bonding A by-product of using older computers in a NASA research lab
Hardware Resource Allocation for Hardware/Software Partitioning in the LYCOS System
DEFF Research Database (Denmark)
Grode, Jesper Nicolai Riis; Knudsen, Peter Voigt; Madsen, Jan
1998-01-01
as a designer's/design tool's aid to generate good hardware allocations for use in hardware/software partitioning. The algorithm has been implemented in a tool under the LYCOS system. The results show that the allocations produced by the algorithm come close to the best allocations obtained by exhaustive search.......This paper presents a novel hardware resource allocation technique for hardware/software partitioning. It allocates hardware resources to the hardware data-path using information such as data-dependencies between operations in the application, and profiling information. The algorithm is useful...
Hardware Resource Allocation for Hardware/Software Partitioning in the LYCOS System
DEFF Research Database (Denmark)
Grode, Jesper Nicolai Riis; Madsen, Jan; Knudsen, Peter Voigt
1998-01-01
as a designer's/design tool's aid to generate good hardware allocations for use in hardware/software partitioning. The algorithm has been implemented in a tool under the LYCOS system. The results show that the allocations produced by the algorithm come close to the best allocations obtained by exhaustive search......This paper presents a novel hardware resource allocation technique for hardware/software partitioning. It allocates hardware resources to the hardware data-path using information such as data-dependencies between operations in the application, and profiling information. The algorithm is useful...
Cooperative Task Allocation Method of MCAV/UCAV Formation
Yun Zhong; Peiyang Yao; Yu Sun; Juan Yang
2016-01-01
Unmanned Combat Aerial Vehicle (UCAV) cooperative task allocation under Manned Combat Aerial Vehicle’s (MCAV) limited control is one of the important problems in UCAV research field. Hereto, we analyze the key technical and tactical indices influence task allocation problem and build an appropriate model to maximize the objective function values as well as reflecting various constraints. A novel improved multigroup ant colony algorithm (IMGACA) is proposed to solve the model; the algorithm ma...
A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid
Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid
2015-01-01
Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application’s priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively. PMID:25830703
A novel LTE scheduling algorithm for green technology in smart grid.
Directory of Open Access Journals (Sweden)
Mohammad Nour Hindia
Full Text Available Smart grid (SG application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA, distributed energy system-storage (DER and electrical vehicle (EV, are investigated in order to study their suitability in Long Term Evolution (LTE network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule, modified-largest weighted delay first (M-LWDF and exponential/PF (EXP/PF, respectively.
A novel LTE scheduling algorithm for green technology in smart grid.
Hindia, Mohammad Nour; Reza, Ahmed Wasif; Noordin, Kamarul Ariffin; Chayon, Muhammad Hasibur Rashid
2015-01-01
Smart grid (SG) application is being used nowadays to meet the demand of increasing power consumption. SG application is considered as a perfect solution for combining renewable energy resources and electrical grid by means of creating a bidirectional communication channel between the two systems. In this paper, three SG applications applicable to renewable energy system, namely, distribution automation (DA), distributed energy system-storage (DER) and electrical vehicle (EV), are investigated in order to study their suitability in Long Term Evolution (LTE) network. To compensate the weakness in the existing scheduling algorithms, a novel bandwidth estimation and allocation technique and a new scheduling algorithm are proposed. The technique allocates available network resources based on application's priority, whereas the algorithm makes scheduling decision based on dynamic weighting factors of multi-criteria to satisfy the demands (delay, past average throughput and instantaneous transmission rate) of quality of service. Finally, the simulation results demonstrate that the proposed mechanism achieves higher throughput, lower delay and lower packet loss rate for DA and DER as well as provide a degree of service for EV. In terms of fairness, the proposed algorithm shows 3%, 7 % and 9% better performance compared to exponential rule (EXP-Rule), modified-largest weighted delay first (M-LWDF) and exponential/PF (EXP/PF), respectively.
Polybinary modulation for bandwidth limited optical links
DEFF Research Database (Denmark)
Vegas Olmos, Juan José; Jurado-Navas, Antonio
2015-01-01
Optical links using traditional modulation formats are reaching a plateau in terms of capacity, mainly due to bandwidth limitations in the devices employed at the transmitter and receivers. Advanced modulation formats, which boost the spectral efficiency, provide a smooth migration path towards...... effectively increase the available capacity. Advanced modulation formats however require digitalization of the signals and digital signal processing blocks to both generate and recover the data. There is therefore a trade-off in terms of efficiency gain vs. complexity. Poly binary modulation, a generalized...... form of partial response modulation, employs simple codification and filtering at the transmitter to drastically increase the spectral efficiency. At the receiver side, poly binary modulation requires low complexity direct detection and very little digital signal processing. This talk will review...
Optimal filter bandwidth for pulse oximetry
Stuban, Norbert; Niwayama, Masatsugu
2012-10-01
Pulse oximeters contain one or more signal filtering stages between the photodiode and microcontroller. These filters are responsible for removing the noise while retaining the useful frequency components of the signal, thus improving the signal-to-noise ratio. The corner frequencies of these filters affect not only the noise level, but also the shape of the pulse signal. Narrow filter bandwidth effectively suppresses the noise; however, at the same time, it distorts the useful signal components by decreasing the harmonic content. In this paper, we investigated the influence of the filter bandwidth on the accuracy of pulse oximeters. We used a pulse oximeter tester device to produce stable, repetitive pulse waves with digitally adjustable R ratio and heart rate. We built a pulse oximeter and attached it to the tester device. The pulse oximeter digitized the current of its photodiode directly, without any analog signal conditioning. We varied the corner frequency of the low-pass filter in the pulse oximeter in the range of 0.66-15 Hz by software. For the tester device, the R ratio was set to R = 1.00, and the R ratio deviation measured by the pulse oximeter was monitored as a function of the corner frequency of the low-pass filter. The results revealed that lowering the corner frequency of the low-pass filter did not decrease the accuracy of the oxygen level measurements. The lowest possible value of the corner frequency of the low-pass filter is the fundamental frequency of the pulse signal. We concluded that the harmonics of the pulse signal do not contribute to the accuracy of pulse oximetry. The results achieved by the pulse oximeter tester were verified by human experiments, performed on five healthy subjects. The results of the human measurements confirmed that filtering out the harmonics of the pulse signal does not degrade the accuracy of pulse oximetry.
Directory of Open Access Journals (Sweden)
Brigitte Jaumard
Full Text Available ABSTRACT Cost-effective planning and dimensioning of backhaul microwave networks under unreliable channel conditions remains a relatively underexplored area in the literature. In particular, bandwidth assignment requires special attention as the transport capacity of microwave links is prone to variations due to, e.g., weather conditions. In this paper, we formulate an optimization model that determines the minimum cost bandwidth assignment of the links in the network for which traffic requirements can be fulfilled with high probability. This model also aims to increase network reliability by adjusting dynamically traffic routes in response to variations of link capacities induced by channel conditions. Experimental results show that 45% of the bandwidth cost can be saved compared to the case where a bandwidth over-provisioning policy is uniformly applied to all links in the network planning. Comparisons with previous work also show that our solution approach, based on column generation technique, is able to solve much larger instances in significantly shorter computing times (i.e., few minutes for medium-size networks, and up to 2 hours for very large networks, unsolved so far by previous models/algorithms, with a comparable level of reliability.
An Enhanced Feedback-Base Downlink Packet Scheduling Algorithm for Mobile TV in WIMAX Networks
Directory of Open Access Journals (Sweden)
Joseph Oyewale
2013-06-01
Full Text Available With high speed access network technology like WIMAX, there is the need for efficient management of radio resources where the throughput and Qos requirements for Multicasting Broadcasting Services (MBS for example TV are to be met. An enhanced feedback-base downlink Packet scheduling algorithm that can be used in IEEE 802.16d/e networks for mobile TV “one way traffic”(MBS is needed to support many users utilizing multiuser diversity of the broadband of WIMAX systems where a group of users(good/worst channels share allocated resources (bandwidth. This paper proposes a WIMAX framework feedback-base (like a channel-awareness downlink packet scheduling algorithm for Mobile TV traffics in IEEE806.16, in which network Physical Timing Slots (PSs resource blocks are allocated in a dynamic way to mobile TV subscribers based on the Channel State information (CSI feedback, and then considering users with worst channels with the aim of improving system throughput while system coverage is being guaranteed. The algorithm was examined by changing the PSs bandwidth allocation of the users and different number of users of a cell. Simulation results show our proposed algorithm performed better than other algorithms (blind algorithms in terms of improvement in system throughput performance. /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso
Compact antenna arrays with wide bandwidth and low sidelobe levels
Strassner, II, Bernd H.
2014-09-09
Highly efficient, low cost, easily manufactured SAR antenna arrays with lightweight low profiles, large instantaneous bandwidths and low SLL are disclosed. The array topology provides all necessary circuitry within the available antenna aperture space and between the layers of material that comprise the aperture. Bandwidths of 15.2 GHz to 18.2 GHz, with 30 dB SLLs azimuthally and elevationally, and radiation efficiencies above 40% may be achieved. Operation over much larger bandwidths is possible as well.
Department of Housing and Urban Development — The CPD Allocation and Award database provides filterable on-screen and exportable reports on select programs, such as the Community Development Block Grant Program,...
PIC Simulation of Laser Plasma Interactions with Temporal Bandwidths
Tsung, Frank; Weaver, J.; Lehmberg, R.
2015-11-01
We are performing particle-in-cell simulations using the code OSIRIS to study the effects of laser plasma interactions in the presence of temperal bandwidths under conditions relevant to current and future shock ignition experiments on the NIKE laser. Our simulations show that, for sufficiently large bandwidth, the saturation level, and the distribution of hot electrons, can be effected by the addition of temporal bandwidths (which can be accomplished in experiments using smoothing techniques such as SSD or ISI). We will show that temporal bandwidth along play an important role in the control of LPI's in these lasers and discuss future directions. This work is conducted under the auspices of NRL.
Frequency Bandwidth Optimization of Left-Handed Metamaterial
Chevalier, Christine T.; Wilson, Jeffrey D.
2004-01-01
Recently, left-handed metamaterials (LHM s) have been demonstrated with an effective negative index of refraction and with antiparallel group and phase velocities for microwave radiation over a narrow frequency bandwidth. In order to take advantage of these characteristics for practical applications, it will be beneficial to develop LHM s with increased frequency bandwidth response and lower losses. In this paper a commercial three-dimensional electromagnetic simulation code is used to explore the effects of geometry parameter variations on the frequency bandwidth of a LHM at microwave frequencies. Utilizing an optimizing routine in the code, a geometry was generated with a bandwidth more than twice as large as the original geometry.
A Framework for Optimal Control Allocation with Structural Load Constraints
Frost, Susan A.; Taylor, Brian R.; Jutte, Christine V.; Burken, John J.; Trinh, Khanh V.; Bodson, Marc
2010-01-01
Conventional aircraft generally employ mixing algorithms or lookup tables to determine control surface deflections needed to achieve moments commanded by the flight control system. Control allocation is the problem of converting desired moments into control effector commands. Next generation aircraft may have many multipurpose, redundant control surfaces, adding considerable complexity to the control allocation problem. These issues can be addressed with optimal control allocation. Most optimal control allocation algorithms have control surface position and rate constraints. However, these constraints are insufficient to ensure that the aircraft's structural load limits will not be exceeded by commanded surface deflections. In this paper, a framework is proposed to enable a flight control system with optimal control allocation to incorporate real-time structural load feedback and structural load constraints. A proof of concept simulation that demonstrates the framework in a simulation of a generic transport aircraft is presented.
Function allocation in distributed safeguards and security systems
International Nuclear Information System (INIS)
Barlich, G.L.
1991-01-01
Computerized distributed systems are being used to collect and manage data for activities such as nuclear materials accounting, process control, laboratory coordination, and security. Poor choices made in allocating functions to individual processors can make a system unusable by burdening machines with excessive network retrievals and updates. During system design phases, data allocation algorithms based on operation frequencies, field sizes, security information, and reliability requirements can be applied in sensitivity studies to mathematically ensure processor efficiency. The Los Alamos Network Design System (NDS) implements such an allocation algorithm. The authors analyzed a large, existing distributed system to test the cost functions and to compare actual network problems with NDS results. Several common configurations were also designed and studied using the software. From these studies, some basic principles for allocating functions emerged. In this paper recommendations for function allocation in generic systems and related design options are discussed
Robust resource allocation in future wireless networks
Parsaeefard, Saeedeh; Mokari, Nader
2017-01-01
This book presents state-of-the-art research on robust resource allocation in current and future wireless networks. The authors describe the nominal resource allocation problems in wireless networks and explain why introducing robustness in such networks is desirable. Then, depending on the objectives of the problem, namely maximizing the social utility or the per-user utility, cooperative or competitive approaches are explained and their corresponding robust problems are considered in detail. For each approach, the costs and benefits of robust schemes are discussed and the algorithms for reducing their costs and improving their benefits are presented. Considering the fact that such problems are inherently non-convex and intractable, a taxonomy of different relaxation techniques is presented, and applications of such techniques are shown via several examples throughout the book. Finally, the authors argue that resource allocation continues to be an important issue in future wireless networks, and propose spec...
Reduced bandwidth video for remote vehicle operations
Energy Technology Data Exchange (ETDEWEB)
Noell, T.E.; DePiero, F.W.
1993-08-01
Oak Ridge National Laboratory staff have developed a video compression system for low-bandwidth remote operations. The objective is to provide real-time video at data rates comparable to available tactical radio links, typically 16 to 64 thousand bits per second (kbps), while maintaining sufficient quality to achieve mission objectives. The system supports both continuous lossy transmission of black and white (gray scale) video for remote driving and progressive lossless transmission of black and white images for remote automatic target acquisition. The average data rate of the resulting bit stream is 64 kbps. This system has been demonstrated to provide video of sufficient quality to allow remote driving of a High-Mobility Multipurpose Wheeled Vehicle at speeds up to 15 mph (24.1 kph) on a moguled dirt track. The nominal driving configuration provides a frame rate of 4 Hz, a compression per frame of 125:1, and a resulting latency of {approximately}1s. This paper reviews the system approach and implementation, and further describes some of our experiences when using the system to support remote driving.
Ngo, Nam Quoc; Song, Yufeng; Lin, Bo
2011-02-01
We present the design and analysis of a wideband and tunable optical Hilbert transformer (OHT) using a tunable waveguide-based finite-impulse response (FIR) filter structure by using the digital filter design method and the Remez algorithm. The tunable Nth-order waveguide-based FIR filter, which simply consists of N delay lines, N tunable couplers, N tunable phase shifters and a combiner, can be tuned, by thermally adjusting the tunable couplers and tunable phase shifters, to tune the bandwidth of an OHT using silica-based planar lightwave circuit (PLC) technology. To demonstrate the effectiveness of the method, the simulation results have an excellent agreement with the theoretical predictions. The tunable OHT can function as a wideband and tunable 90° phase shifter and thus has many potential applications. The two unique features of wideband characteristic (up to ~ 2 THz) and tunable bandwidth (THz tuning range) of the proposed OHT cannot be obtained from the existing OHTs.
Optimal defense resource allocation in scale-free networks
Zhang, Xuejun; Xu, Guoqiang; Xia, Yongxiang
2018-02-01
The robustness research of networked systems has drawn widespread attention in the past decade, and one of the central topics is to protect the network from external attacks through allocating appropriate defense resource to different nodes. In this paper, we apply a specific particle swarm optimization (PSO) algorithm to optimize the defense resource allocation in scale-free networks. Results reveal that PSO based resource allocation shows a higher robustness than other resource allocation strategies such as uniform, degree-proportional, and betweenness-proportional allocation strategies. Furthermore, we find that assigning less resource to middle-degree nodes under small-scale attack while more resource to low-degree nodes under large-scale attack is conductive to improving the network robustness. Our work provides an insight into the optimal defense resource allocation pattern in scale-free networks and is helpful for designing a more robust network.
A game-theoretical pricing mechanism for multiuser rate allocation for video over WiMAX
Chen, Chao-An; Lo, Chi-Wen; Lin, Chia-Wen; Chen, Yung-Chang
2010-07-01
In multiuser rate allocation in a wireless network, strategic users can bias the rate allocation by misrepresenting their bandwidth demands to a base station, leading to an unfair allocation. Game-theoretical approaches have been proposed to address the unfair allocation problems caused by the strategic users. However, existing approaches rely on a timeconsuming iterative negotiation process. Besides, they cannot completely prevent unfair allocations caused by inconsistent strategic behaviors. To address these problems, we propose a Search Based Pricing Mechanism to reduce the communication time and to capture a user's strategic behavior. Our simulation results show that the proposed method significantly reduce the communication time as well as converges stably to an optimal allocation.
Stochastic Collapsed Variational Bayesian Inference for Latent Dirichlet Allocation
Foulds, J.; Boyles, L.; DuBois, C.; Smyth, P.; Welling, M.; Dhillon, I.S.; Koren, Y.; Ghani, R.; Senator, T.E.; Bradley, P.; Parekh, R.; He, J.; Grossman, R.L.; Uthurusamy, R.
2013-01-01
There has been an explosion in the amount of digital text information available in recent years, leading to challenges of scale for traditional inference algorithms for topic models. Recent advances in stochastic variational inference algorithms for latent Dirichlet allocation (LDA) have made it
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Smilgins, Aleksandrs
Risk capital allocation problems have been widely discussed in the academic literature. We consider a company with multiple subunits having individual portfolios. Hence, when portfolios of subunits are merged, a diversification benefit arises: the risk of the company as a whole is smaller than th...... of new axioms related directly to the problem of risk capital allocation and show that the Lorenz set satisfies these new axioms in contrast to other well-known coherent methods. Finally, we discuss how to deal with non-uniqueness of the Lorenz set.......Risk capital allocation problems have been widely discussed in the academic literature. We consider a company with multiple subunits having individual portfolios. Hence, when portfolios of subunits are merged, a diversification benefit arises: the risk of the company as a whole is smaller than...... the sum of the risks of the individual sub-units. The question is how to allocate the risk capital of the company among the subunits in a fair way. In this paper we propose to use the Lorenz set as an allocation method. We show that the Lorenz set is operational and coherent. Moreover, we propose a set...
Bandwidth selection in smoothing functions | Kibua | East African ...
African Journals Online (AJOL)
... inexpensive and, hence, worth adopting. We argue that the bandwidth parameter is determined by two factors: the kernel function and the length of the smoothing region. We give an illustrative example of its application using real data. Keywords: Kernel, Smoothing functions, Bandwidth > East African Journal of Statistics ...
Variable Bandwidth Analog Channel Filters for Software Defined Radio
Arkesteijn, V.J.; Klumperink, Eric A.M.; Nauta, Bram
2001-01-01
An important aspect of Software Defined Radio is the ability to define the bandwidth of the filter that selects the desired channel. This paper first explains the importance of channel filtering. Then the advantage of analog channel filtering with a variable bandwidth in a Software Defined Radio is
Physically Connected Stacked Patch Antenna Design with 100% Bandwidth
Klionovski, Kirill
2017-11-01
Typically, stacked patch antennas are parasitically coupled and provide larger bandwidth than a single patch antenna. Here, we show a stacked patch antenna design where square patches with semi-circular cutouts are physically connected to each other. This arrangement provides 100% bandwidth from 23.9–72.2 GHz with consistent high gain (5 dBi or more) across the entire bandwidth. In another variation, a single patch loaded with a superstrate provides 83.5% bandwidth from 25.6–62.3 GHz. The mechanism of bandwidth enhancement is explained through electromagnetic simulations. Measured reflection coefficient, radiation patterns and gain results confirm the extremely wideband performance of the design.
Properties and solution methods for large location-allocation problems
DEFF Research Database (Denmark)
Juel, Henrik; Love, Robert F.
1982-01-01
Location-allocation with l$ _p$ distances is studied. It is shown that this structure can be expressed as a concave minimization programming problem. Since concave minimization algorithms are not yet well developed, five solution methods are developed which utilize the special properties of the l......Location-allocation with l$ _p$ distances is studied. It is shown that this structure can be expressed as a concave minimization programming problem. Since concave minimization algorithms are not yet well developed, five solution methods are developed which utilize the special properties...... of the location-allocation problem. Using the rectilinear distance measure, two of these algorithms achieved optimal solutions in all 102 test problems for which solutions were known. The algorithms can be applied to much larger problems than any existing exact methods....
SOME NOTES ON COST ALLOCATION IN MULTICASTING
Directory of Open Access Journals (Sweden)
Darko Skorin-Kapov
2012-12-01
Full Text Available We analyze the cost allocation strategies with the problef of broadcasting information from some source to a number of communication network users. A multicast routing chooses a minimum cost tree network that spans the source and all the receivers. The cost of such a network is distributed among its receivers who may be individuals or organizations with possibly conflicting interests. Providing network developers, users and owners with practical computable 'fair' cost allocation solution procedures is of great importance for network mamagement. Consequently, this multidisciplinary problem was extensively studied by Operational Researchers, Economists, Mathematicians and Computer Scientists. The fairness of various proposed solutions was even argued in US courts. This presentation overviews some previously published, as well as some recent results, in the development of algorithmic mechanisms to efficiently compute 'attractive' cost allocation solutions for multicast networks. Specifically, we will analyze cooperative game theory based cost allocation models that avoid cross subsidies and/or are distance and population monotonic. We will also present some related open cost allocation problems and the potential contribution that such models might make to this problem in the future.
Optical Computations for Image Bandwidth Compression.
1982-05-15
e.g., DPCM . Future research will consider the effect of the sampling scheme on single-band methods. The performance of various reconstruction-window...for spatial compression alg-orithms, such as differential pulse code modulation ( DPCM ), etc. The typical examples are adaptive prediction and...paralleled by a similar shift in data compres- sion schemes, from spatially nonadaptive M N-i M-i differential pulse code modulation ( DPCM ) sys- R(J
Channel Estimation and Optimal Power Allocation for a Multiple-Antenna OFDM System
Directory of Open Access Journals (Sweden)
Yao Kung
2002-01-01
Full Text Available We propose combining channel estimation and optimal power allocation approaches for a multiple-antenna orthogonal frequency division multiplexing (OFDM system in high-speed transmission applications. We develop a least-square channel estimation approach, derive the performance bound of the estimator, and investigate the optimal training sequences for initial channel acquisition. Based on the channel estimates, the optimal power allocation solution which maximizes the bandwidth efficiency is derived under power and quality of service (Qos (symbol error rate constraints. It is shown that combining channel tracking and adaptive power allocation can dramatically enhance the outage capacity of an OFDM multiple-antenna system when severing fading occurs.
Link Monotonic Allocation Schemes
Slikker, M.
1999-01-01
A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This
Directory of Open Access Journals (Sweden)
Masoud Rabbani
2017-02-01
Full Text Available Nowadays, fiber-optic due to having greater bandwidth and being more efficient compared with other similar technologies, are counted as one the most important tools for data transfer. In this article, an integrated mathematical model for a three-level fiber-optic distribution network with consideration of simultaneous backbone and local access networks is presented in which the backbone network is a ring and the access networks has a star-star topology. The aim of the model is to determine the location of the central offices and splitters, how connections are made between central offices, and allocation of each demand node to a splitter or central office in a way that the wiring cost of fiber optical and concentrator installation are minimized. Moreover, each user’s desired bandwidth should be provided efficiently. Then, the proposed model is validated by GAMS software in small-sized problems, afterwards the model is solved by two meta-heuristic methods including differential evolution (DE and genetic algorithm (GA in large-scaled problems and the results of two algorithms are compared with respect to computational time and objective function obtained value. Finally, a sensitivity analysis is provided. Keyword: Fiber-optic, telecommunication network, hub-location, passive splitter, three-level network.
Antenna allocation in MIMO radar with widely separated antennas for multi-target detection.
Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong
2014-10-27
In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes.
Fixed tile rate codec for bandwidth saving in video processors
Lachine, Vladimir; Dinh, Chon-Tam Le; Le, Dinh Kha; Wong, Jeffrey
2014-02-01
The paper presents an image compression circuit for bandwidth saving in video display processors. This is intra frame tile based compression algorithm offering visually lossless quality for compression rates between 1.5 and 2.5. RGB and YCbCr (4:4:4, 4:2:2 and 4:2:0) video formats are supported for 8/10 bits video signals. The Band Width Compressor (BWC) consists of Lossless Compressor (LC) and Quantization Compressor (QC) that generate output bit streams for tiles of pixels. Size of output bit stream generated for a tile by the LC may be less or greater than a required size of output memory block. The QC generates bit stream that always fits output memory block of the required size. The output bit stream generated by the LC is transmitted if its size is less than the required size of the output memory block. Otherwise, the output bit stream generated by the QC is transmitted. The LC works on pixel basis. A difference between original and predicted pixel's values for each pixel of a tile is encoded as prefix and suffix. The prefix is encoded by means of variable length code, and suffix is encoded as is. The QC divides a tile of pixels on a set of blocks and quantizes pixels of each block independently of the other blocks. The number of quantization bits for all pixels of a block depends on standard deviation calculated over the block. A difference between pixel's value and average value over the block is quantized and transmitted.
CoZi: basic Coding for better Bandwidth Utilization in ZigBee Sensor Networks
Salhi, Ismail; Ghamri-Doudane, Yacine; Lohier, Stéphane; Livolant, Erwan
2010-01-01
International audience; This paper describes CoZi, a new packet scheduling mechanism for large scale ZigBee networks. CoZi aims at enhancing the reliability of the data delivery and the bandwidth utilization of the network. Based on simple network coding, instead of the classic packet forwarding, our algorithm takes advantage of the shared nature of the wireless medium as well as the cluster-tree topology of IEEE 802.15.4 networks to increase the global throughput and to reduce transmissions ...
Optimization of Gain, Impedance, and Bandwidth of Yagi-Uda Array Using Particle Swarm Optimization
Directory of Open Access Journals (Sweden)
Munish Rattan
2008-01-01
Full Text Available Particle swarm optimization (PSO is a new, high-performance evolutionary technique, which has recently been used for optimization problems in antennas and electromagnetics. It is a global optimization technique-like genetic algorithm (GA but has less computational cost compared to GA. In this paper, PSO has been used to optimize the gain, impedance, and bandwidth of Yagi-Uda array. To evaluate the performance of designs, a method of moments code NEC2 has been used. The results are comparable to those obtained using GA.
Automatic high-bandwidth calibration and reconstruction of arbitrarily sampled parallel MRI.
Directory of Open Access Journals (Sweden)
Jan Aelterman
Full Text Available Today, many MRI reconstruction techniques exist for undersampled MRI data. Regularization-based techniques inspired by compressed sensing allow for the reconstruction of undersampled data that would lead to an ill-posed reconstruction problem. Parallel imaging enables the reconstruction of MRI images from undersampled multi-coil data that leads to a well-posed reconstruction problem. Autocalibrating pMRI techniques encompass pMRI techniques where no explicit knowledge of the coil sensivities is required. A first purpose of this paper is to derive a novel autocalibration approach for pMRI that allows for the estimation and use of smooth, but high-bandwidth coil profiles instead of a compactly supported kernel. These high-bandwidth models adhere more accurately to the physics of an antenna system. The second purpose of this paper is to demonstrate the feasibility of a parameter-free reconstruction algorithm that combines autocalibrating pMRI and compressed sensing. Therefore, we present several techniques for automatic parameter estimation in MRI reconstruction. Experiments show that a higher reconstruction accuracy can be had using high-bandwidth coil models and that the automatic parameter choices yield an acceptable result.
Secure Fusion Estimation for Bandwidth Constrained Cyber-Physical Systems Under Replay Attacks.
Chen, Bo; Ho, Daniel W C; Hu, Guoqiang; Yu, Li
2017-07-03
State estimation plays an essential role in the monitoring and supervision of cyber-physical systems (CPSs), and its importance has made the security and estimation performance a major concern. In this case, multisensor information fusion estimation (MIFE) provides an attractive alternative to study secure estimation problems because MIFE can potentially improve estimation accuracy and enhance reliability and robustness against attacks. From the perspective of the defender, the secure distributed Kalman fusion estimation problem is investigated in this paper for a class of CPSs under replay attacks, where each local estimate obtained by the sink node is transmitted to a remote fusion center through bandwidth constrained communication channels. A new mathematical model with compensation strategy is proposed to characterize the replay attacks and bandwidth constrains, and then a recursive distributed Kalman fusion estimator (DKFE) is designed in the linear minimum variance sense. According to different communication frameworks, two classes of data compression and compensation algorithms are developed such that the DKFEs can achieve the desired performance. Several attack-dependent and bandwidth-dependent conditions are derived such that the DKFEs are secure under replay attacks. An illustrative example is given to demonstrate the effectiveness of the proposed methods.
Energy Technology Data Exchange (ETDEWEB)
Gewehr, Diego N.; Vargas, Ricardo B.; Melo, Eduardo D. de; Paschoareli Junior, Dionizio [Universidade Estadual Paulista (DEE/UNESP), Ilha Solteira, SP (Brazil). Dept. de Engenharia Eletrica. Grupo de Pesquisa em Fontes Alternativas e Aproveitamento de Energia
2008-07-01
This paper presents a methodology for electric power sources location in isolated direct current micro grids, using genetic algorithm. In this work, photovoltaic panels are considered, although the methodology can be extended for any kind of DC sources. A computational tool is developed using the Matlab simulator, to obtain the best dc system configuration for reduction of panels quantity and costs, and to improve the system performance. (author)
A Simple Dual Decomposition Method for Resource Allocation in Telecommunication Networks
Directory of Open Access Journals (Sweden)
Konnov Igor
2016-01-01
Full Text Available We consider a problem of optimal resource allocation in a wireless communication network divided into zones (clusters. The network manager aims to distribute some homogeneous resource (bandwidth among users of several zones in order to maximize the total network profit, which takes into account payments from users and implementation costs. As a result, we obtain a convex optimization problem involving capacity and balance constraints. By using the dual Lagrangian method with respect to the capacity constraint, we reduce the initial problem to a suitable one-dimensional problem, so that calculation of its cost function value leads to independent solution of zonal problems, treated as two-side auction models with one trader. We show that solution of each zonal problem can be found exactly by a simple arrangement type algorithm even in the case where the trader price is not fixed. Besides, we suggest ways to adjust the basic problem to the case of moving nodes. Some results of computational experiments confirm the applicability of the new method.
Resource Allocation and Cluster Formation for Imperfect NOMA in DL/UL Decoupled HetNets
Celik, Abdulkadir
2017-04-15
Being capable of serving multiple users with the same radio resource, non-orthogonal multiple access (NOMA) can provide desirable performance enhancements in a fair and spectral efficient manner. In this paper, we investigate the resource allocation (RA) and cluster formation (CF) aspects of NOMA for downlink (DL) uplink (UL) decoupled (DUDe) heterogeneous networks (HetNets). A non-ideal NOMA scheme is considered with power disparity and sensitivity constraints (PDSCs), delay tolerance, and residual interference after cancellation. Taking the PDSCs into account, we analytically show that using the DL decoding order limits UL-NOMA performance by that of OMA, while employing an inverse order result in a performance gain that is mainly determined by the channel gain disparity of users. Thereafter, a generic CF method is proposed for any type of user graph, which iteratively forms clusters using Blossom algorithm. Finally, highly non-convex RA problem is converted into a convex form by employing geometric programming (GP) where power and bandwidth are optimized to maximize network sumrate and max-min fairness objectives.
Congestion Pricing for Aircraft Pushback Slot Allocation.
Directory of Open Access Journals (Sweden)
Lihua Liu
Full Text Available In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the "external cost of surface congestion" is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm.
High bandwidth deflection readout for atomic force microscopes.
Steininger, Juergen; Bibl, Matthias; Yoo, Han Woong; Schitter, Georg
2015-10-01
This contribution presents the systematic design of a high bandwidth deflection readout mechanism for atomic force microscopes. The widely used optical beam deflection method is revised by adding a focusing lens between the cantilever and the quadrant photodetector (QPD). This allows the utilization of QPDs with a small active area resulting in an increased detection bandwidth due to the reduced junction capacitance. Furthermore the additional lens can compensate a cross talk between a compensating z-movement of the cantilever and the deflection readout. Scaling effects are analyzed to get the optimal spot size for the given geometry of the QPD. The laser power is tuned to maximize the signal to noise ratio without limiting the bandwidth by local saturation effects. The systematic approach results in a measured -3 dB detection bandwidth of 64.5 MHz at a deflection noise density of 62fm/√Hz.
Increase of the grating coupler bandwidth with a graphene overlay
Energy Technology Data Exchange (ETDEWEB)
Cheng, Zhenzhou; Li, Zhen; Xu, Ke; Tsang, Hon Ki, E-mail: hktsang@ee.cuhk.edu.hk [Department of Electronic Engineering, The Chinese University of Hong Kong, Shatin (Hong Kong)
2014-03-17
We present theoretical and experimental results that demonstrate an increase in the grating bandwidth by placing a graphene on the chip. A focusing subwavelength grating with coupling efficiency of −4.3 dB and 1 dB bandwidth of ∼60 nm was demonstrated. After a graphene sheet was transferred onto the chip, the maximum 1 dB bandwidth was increased to ∼72 nm. Experimental results are consistent with the calculated graphene induced waveguide refractive index and dispersion changes, and the bandwidth improvement may be attributed to the reduction of grating dispersion. This study may be of interest for graphene-on-silicon photonic integrated circuit applications.
Bandwidth Estimation in Wireless Lans for Multimedia Streaming Services
Directory of Open Access Journals (Sweden)
Heung Ki Lee
2007-01-01
Full Text Available The popularity of multimedia streaming services via wireless networks presents major challenges in the management of network bandwidth. One challenge is to quickly and precisely estimate the available bandwidth for the decision of streaming rates of layered and scalable multimedia services. Previous studies based on wired networks are too burdensome to be applied to multimedia applications in wireless networks. In this paper, a new method, IdleGap, is suggested to estimate the available bandwidth of a wireless LAN based on the information from a low layer in the protocol stack. We use a network simulation tool, NS-2, to evaluate our new method with various ranges of cross-traffic and observation times. Our simulation results show that IdleGap accurately estimates the available bandwidth for all ranges of cross-traffic (100 Kbps ∼ 1 Mbps with a very short observation time of 10 seconds.
High-Bandwidth Hybrid Sensor (HYSENS), Phase II
National Aeronautics and Space Administration — ATA has demonstrated the primary innovation of combining a precision MEMS gyro (BAE SiRRS01) with a high bandwidth angular rate sensor, ATA's ARS-14 resulting in a...
Ultrafast broadband tunable-bandwidth magneto-optic modulator
Jones, Gavin D.; Elezzabi, Abdulhakem Y.
1999-11-01
We present our investigation of a variable bandwidth, ultrafast magneto-optic waveguide modulator employing the ferromagnetic resonant precession of the magnetization in a Bizmuth-substituted YIG film. Ultrafast magnetic field pulses, produced by current pulses propagated through a high-speed transmission line, are used to modulate the optical beam in the film. Such a device is capable of multi- gigahertz bandwidth and potential integration into current IC technology. Single frequency modulation of an 800 nm optical carrier is measured at bandwidths tuned between 4.6 and 11.7 GHz. The bandwidth is tuned by means of an externally applied DC magnetic field. It is found that the mode conversion efficiency of a waveguide type of device is limited by the linear birefringence of the thin Bi-YIG film. Birefringence-compensating schemes are discussed to optimize the mode conversion.
DEFF Research Database (Denmark)
Bogetoft, Peter; Hougaard, Jens Leth; Smilgins, Aleksandrs
2016-01-01
This paper deals with empirical computation of Aumann–Shapley cost shares for joint production. We show that if one uses a mathematical programing approach with its non-parametric estimation of the cost function there may be observations in the data set for which we have multiple Aumann–Shapley p...... of assumptions concerning firm behavior. These assumptions enable us to connect inefficient with efficient production and thereby provide consistent ways of allocating the costs arising from inefficiency....
Downlink resource allocation for multichannel TDMA visible light communications
Abdelhady, Amr Mohamed Abdelaziz
2017-05-12
Optical wireless communications (OWC) in general and resource allocation in OWC networks particularly have gained lots of attention recently. In this work, we consider the resource allocation problem of a visible light communication downlink transmission system based on time division multiple access with the objective of maximizing spectral efficiency (SE). As for the operational conditions, we impose constraints on the average optical intensity, the energy consumption and the quality-of-service. To solve the non-convex problem, we transform the objective function into a difference of concave functions by solving a second order differential inequality. Then, we propose a low-complexity algorithm to solve the resource allocation problem. Finally, we show by simulations the SE performance gains achieved by optimizing the power allocation over equal power allocation in the considered system. Numerical results show the SE gains achieved by using this solution.
Gain-switched all-fiber laser with narrow bandwidth
DEFF Research Database (Denmark)
Larsen, Casper; Giesberts, M.; Nyga, S.
2013-01-01
Gain-switching of a CW fiber laser is a simple and cost-effective approach to generate pulses using an all-fiber system. We report on the construction of a narrow bandwidth (below 0.1 nm) gain-switched fiber laser and optimize the pulse energy and pulse duration under this constraint. The extracted...... the bandwidth below 0.1 nm. This allows frequency doubling in a periodically poled lithium tantalate crystal with a reasonable conversion efficiency....
Connor, C. B.; Connor, L. J.
2007-12-01
On July 16, 2007, a strong 6.8 magnitude earthquake occurred on Japan's west coast, rocking the nearby Kashiwazaki Kariwa nuclear power plant, the largest nuclear power station on Earth. Shaking during this event produced ground accelerations of ~680 gal, exceeding the plant seismic design specification of 273 gal. This occurrence renews concerns regarding seismic hazards at nuclear facilities located in regions with persistent earthquake activity. Seismic hazard assessments depend upon an understanding of the spatial distribution of earthquakes to effectively assess future earthquake hazards. Earthquake spatial density is best estimated using kernel density functions based on the locations of past seismic events. Two longstanding problems encountered when using kernel density estimation are the selection of an optimal smoothing bandwidth and the quantification of the uncertainty inherent in these estimates. Currently, kernel bandwidths are often selected subjectively and the uncertainty in spatial density estimation is not calculated. As a result, hazards with potentially large consequences for society are poorly estimated. We solve these two problems by employing an optimal bandwidth selector algorithm to objectively identify an appropriately sized kernel bandwidth based on earthquake locations from catalog databases and by assessing uncertainty in the spatial density estimate using a modified smoothed bootstrap technique. After applying these methods to the Kashiwazaki Kariwa site, the calculated probability of one or more Mw 6-7 earthquakes within 10 km of the site during a 40 yr facility lifetime is between 0.005 and 0.02 with 95 percent confidence. This result is made more robust by calculating similar probabilities using alternative databases of earthquake locations and magnitudes. The objectivity and quantitative robustness of these techniques make them extremely beneficial for seismic hazard assessment.
Directory of Open Access Journals (Sweden)
Young Han Lee
2013-01-01
Full Text Available A bandwidth extension (BWE algorithm from wideband to superwideband (SWB is proposed for a scalable speech/audio codec that uses modified discrete cosine transform (MDCT coefficients as spectral parameters. The superwideband is first split into several subbands that are represented as gain parameters and normalized MDCT coefficients in the proposed BWE algorithm. We then estimate normalized MDCT coefficients of the wideband to be fetched for the superwideband and quantize the fetch indices. After that, we quantize gain parameters by using relative ratios between adjacent subbands. The proposed BWE algorithm is embedded into a standard superwideband codec, the SWB extension of G.729.1 Annex E, and its bitrate and quality are compared with those of the BWE algorithm already employed in the standard superwideband codec. It is shown from the comparison that the proposed BWE algorithm relatively reduces the bitrate by around 19% with better quality, compared to the BWE algorithm in the SWB extension of G.729.1 Annex E.
TPROXY dan FILTERING SEBAGAI METODE OPTIMASI PEMAKAIAN BANDWIDTH INTERNET
Directory of Open Access Journals (Sweden)
Sutiyo Sutiyo
2015-04-01
Full Text Available Until now the use of the internet disuatu agencies viewed from the initial planning, use and care, even long-term planning is still not optimal. The main factor lies in the existing human resources, especially in IT personnel and policy makers who do not understand or do not even know at all how your use of the Internet well, optimal, efficient, particularly associated with the consumption of Internet bandwidth. Internet bandwidth capacity greatly affect the speed of web access or other Internet applications. So we need a plan and maintance necessary to obtain good Internet bandwidth consumption efficiency and guaranteed QoS, such as by utilizing Tproxy and filtering methods. TProxy is a development of which has been patched Squid, a proxy to be able to pass traffic without NAT (Network Access Translation. Fitering a firewall system which is used for filtering data packets that do not want filtered dikendaki or akhirmya able to minimize traffic on bandwidth usage. Tproxy and filtering runs on the Linux platform. Linux distributions are often used to Tproxy is a variant Debian, Centos and then to use Mikrotik Filtering. At the end of each request or query from the client or the response of the proxy server does not have meaningful constraints, the bandwidth between the client and the proxy server does not happen limitation, bandwidth capable of running close to capacity including 10 Mbps Ethernet, 100 Mbps, and even a GPS (full speed.
Optimal safety goal allocation for nuclear power plants
International Nuclear Information System (INIS)
Yang, X.P.; Kastenberg, W.E.; Okrent, D.
1989-01-01
This paper is on the development of a methodology for safety goal allocation given cost functions and Probabilistic Risk Assessment (PRA) models. The safety goal allocation problem is formulated as a constrained nonlinear optimization problem. Based on the decomposition principle, the safety goal allocation problem is first reduced to a lower order optimization problem. Then, a set of optimization algorithms is used to solve the decomposed optimization problem. In order to introduce expert opinion, weighting factors are incorporated in the objective function. Computer software was developed to perform the optimization and sensitivity analysis. The proposed method is demonstrated by using an industrially developed PRA model. (author)
Energy Efficient Power Allocation for Cognitive MIMO Channels
Sboui, Lokman
2016-01-06
Two major issues are facing today s wireless communications evolution: -Spectrum scarcity: Need for more bandwidth. As a solution, the Cognitive Radio (CR) paradigm, where secondary users (unlicensed) share the spectrum with licensed users, was introduced. -Energy consumption and CO2 emission: The ICT produces 2% of global CO2 emission (equivalent to the aviation industry emission). The cellular networks produces 0.2%. As solution energy efficient systems should be designed rather than traditional spectral efficient systems. In this work, an energy efficient power allocation framework based on maximizing the average EE per parallel channel is presented.
Cost allocation with limited information
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Tind, Jørgen
This article investigates progressive development of Aumann-Shapley cost allocation in a multilevel organizational or production structure. In particular, we study a linear parametric programming setup utilizing the Dantzig-Wolfe decomposition procedure. Typically cost allocation takes place after...... all activities have been performed, for example by finishing all outputs. Here the allocation is made progressively with suggestions for activities. I other words cost allocation is performed in parallel for example with a production planning process. This development does not require detailed...
Ahmed, Irfan; Khammari, Hedi; Shahid, Adnan
2017-01-01
This paper presents a study on joint radio resource allocation and hybrid precoding in multicarrier massive multiple-input multiple-output communications for 5G cellular networks. In this paper, we present the resource allocation algorithm to maximize the proportional fairness (PF) spectral efficiency under the per subchannel power and the beamforming rank constraints. Two heuristic algorithms are designed. The proportional fairness hybrid beamforming algorithm provides the transmit precoder ...
Optimization of Power Allocation for Multiusers in Multi-Spot-Beam Satellite Communication Systems
Directory of Open Access Journals (Sweden)
Heng Wang
2014-01-01
Full Text Available In recent years, multi-spot-beam satellite communication systems have played a key role in global seamless communication. However, satellite power resources are scarce and expensive, due to the limitations of satellite platform. Therefore, this paper proposes optimizing the power allocation of each user in order to improve the power utilization efficiency. Initially the capacity allocated to each user is calculated according to the satellite link budget equations, which can be achieved in the practical satellite communication systems. The problem of power allocation is then formulated as a convex optimization, taking account of a trade-off between the maximization of the total system capacity and the fairness of power allocation amongst the users. Finally, an iterative algorithm based on the duality theory is proposed to obtain the optimal solution to the optimization. Compared with the traditional uniform resource allocation or proportional resource allocation algorithms, the proposed optimal power allocation algorithm improves the fairness of power allocation amongst the users. Moreover, the computational complexity of the proposed algorithm is linear with both the numbers of the spot beams and users. As a result, the proposed power allocation algorithm is easy to be implemented in practice.
Automated fenestration allocation as complying with LEED rating system
Directory of Open Access Journals (Sweden)
Hazem Mohamed Talaat El Daly
2014-12-01
The allocation of windows, through the help of certain well known heuristic algorithms and simulation programs, could be reached automatically to compromise with the LEED rating system by achieving the required daylight amounts with a minimum solar radiation inside a particular building. This research shows a design method based on simulation techniques with the help of heuristic algorithms through a parametric design that automatically allocate windows to comply with LEED. At the end of the research, a small project is discussed for evaluating the design process.
CERN. Geneva; PUNZI, Giovanni
2015-01-01
Charge particle reconstruction is one of the most demanding computational tasks found in HEP, and it becomes increasingly important to perform it in real time. We envision that HEP would greatly benefit from achieving a long-term goal of making track reconstruction happen transparently as part of the detector readout ("detector-embedded tracking"). We describe here a track-reconstruction approach based on a massively parallel pattern-recognition algorithm, inspired by studies of the processing of visual images by the brain as it happens in nature ('RETINA algorithm'). It turns out that high-quality tracking in large HEP detectors is possible with very small latencies, when this algorithm is implemented in specialized processors, based on current state-of-the-art, high-speed/high-bandwidth digital devices.
Fund Allocation in Complex Rehabilitation Programs
Directory of Open Access Journals (Sweden)
Tarek Hegazy
2013-12-01
Full Text Available Civil Infrastructure assets require continuous renewal actions to sustain their operability and safety. Allocating limited renewal funds amongst numerous building components, however, represents a large-scale optimization problem and earlier efforts utilized genetic algorithms (GAs to optimize medium size problems yet exhibit steep performance degradation as problem size increases. In this research, after experimenting with various approaches of segmenting a large problem into multiple smaller sub-problems, clustered segmentation proved to be the most promising. The paper discusses the underlying life cycle analysis model, the various segmentation methods, and the optimization results using the improved GAs + clustered segmentation, which proved to be able to optimize asset renewals for 50,000 components with no noticeable performance degradation. The proposed method is simple and logical, and can be used on variety of asset types to improve infrastructure fund allocation. Future extension of this research is then highlighted.
Online Job Allocation with Hard Allocation Ratio Requirement (Author’s Manuscript)
2016-04-14
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’08, (Philadelphia, PA, USA), pp. 982–991, Society for Industrial and...when jobs arrive according to some random process . I. INTRODUCTION In this paper, we discuss the problem of online job allocation for cloud computing...not only stores the video but also has remaining capacity to process this request. If no server can process this request, the request is dropped, which
Open-Loop Wide-Bandwidth Phase Modulation Techniques
Directory of Open Access Journals (Sweden)
Nitin Nidhi
2011-01-01
Full Text Available The ever-increasing growth in the bandwidth of wireless communication channels requires the transmitter to be wide-bandwidth and power-efficient. Polar and outphasing transmitter topologies are two promising candidates for such applications, in future. Both these architectures require a wide-bandwidth phase modulator. Open-loop phase modulation presents a viable solution for achieving wide-bandwidth operation. An overview of prior art and recent approaches for phase modulation is presented in this paper. Phase quantization noise cancellation was recently introduced to lower the out-of-band noise in a digital phase modulator. A detailed analysis on the impact of timing and quantization of the cancellation signal is presented. Noise generated by the transmitter in the receive band frequency poses another challenge for wide-bandwidth transmitter design. Addition of a noise transfer function notch, in a digital phase modulator, to reduce the noise in the receive band during phase modulation is described in this paper.
Abdulghafoor, O. B.; Shaat, M. M. R.; Ismail, M.; Nordin, R.; Yuwono, T.; Alwahedy, O. N. A.
2017-05-01
In this paper, the problem of resource allocation in OFDM-based downlink cognitive radio (CR) networks has been proposed. The purpose of this research is to decrease the computational complexity of the resource allocation algorithm for downlink CR network while concerning the interference constraint of primary network. The objective has been secured by adopting pricing scheme to develop power allocation algorithm with the following concerns: (i) reducing the complexity of the proposed algorithm and (ii) providing firm power control to the interference introduced to primary users (PUs). The performance of the proposed algorithm is tested for OFDM- CRNs. The simulation results show that the performance of the proposed algorithm approached the performance of the optimal algorithm at a lower computational complexity, i.e., O(NlogN), which makes the proposed algorithm suitable for more practical applications.
Optimal load allocation of multiple fuel boilers.
Dunn, Alex C; Du, Yan Yi
2009-04-01
This paper presents a new methodology for optimally allocating a set of multiple industrial boilers that each simultaneously consumes multiple fuel types. Unlike recent similar approaches in the utility industry that use soft computing techniques, this approach is based on a second-order gradient search method that is easy to implement without any specialized optimization software. The algorithm converges rapidly and the application yields significant savings benefits, up to 3% of the overall operating cost of industrial boiler systems in the examples given and potentially higher in other cases, depending on the plant circumstances. Given today's energy prices, this can yield significant savings benefits to manufacturers that raise steam for plant operations.
Moiré volume Bragg grating filter with tunable bandwidth.
Mokhov, Sergiy; Ott, Daniel; Divliansky, Ivan; Zeldovich, Boris; Glebov, Leonid
2014-08-25
We propose a monolithic large-aperture narrowband optical filter based on a moiré volume Bragg grating formed by two sequentially recorded gratings with slightly different resonant wavelengths. Such recording creates a spatial modulation of refractive index with a slowly varying sinusoidal envelope. By cutting a specimen at a small angle, to a thickness of one-period of this envelope, the longitudinal envelope profile will shift from a sine profile to a cosine profile across the face of the device. The transmission peak of the filter has a tunable bandwidth while remaining at a fixed resonant wavelength by a transversal shift of incidence position. Analytical expressions for the tunable bandwidth of such a filter are calculated and experimental data from a filter operating at 1064 nm with bandwidth range 30-90 pm is demonstrated.
Efficient use of satellite bandwidth for shipboard science platforms
Foley, S.; Berger, J.; Orcutt, J. A.
2012-12-01
In its 11th year of operation, HiSeasNet, a satellite network connecting the University-National Oceanographic Laboratory System (UNOLS) fleet to the Internet, enables ships to stream sets of sensor data to shore in near-real-time, along with a variety of other ship traffic. With more ongoing and single-cruise projects wishing to use significant amounts of ship-to-shore bandwidth, efficient use of the bandwidth has become increasingly important. Incremental improvements have been made over the past few years. However, as use cases change and technology becomes more bandwidth-intensive, more work remains on both technical and behavioral levels for optimizing scientific use of satellite links.
Optical computing for image bandwidth compression: analysis and simulation.
Hunt, B R
1978-09-15
Image bandwidth compression is dominated by digital methods for carrying out the required computations. This paper discusses the general problem of using optics to realize the computations in bandwidth compression. A common method of digital bandwidth compression, feedback differential pulse code modulation (DPCM), is reviewed, and the obstacles to making a direct optical analogy to feedback DPCM are discussed. Instead of a direct optical analogy to DPCM, an optical system which captures the essential features of DPCM without optical feedback is introduced. The essential features of this incoherent optical system are encoding of low-frequency information and generation of difference samples which can be coded with a small number of bits. A simulation of this optical system by means of digital image processing is presented, and performance data are also included.
Correlation and image compression for limited-bandwidth CCD.
Energy Technology Data Exchange (ETDEWEB)
Thompson, Douglas G.
2005-07-01
As radars move to Unmanned Aerial Vehicles with limited-bandwidth data downlinks, the amount of data stored and transmitted with each image becomes more significant. This document gives the results of a study to determine the effect of lossy compression in the image magnitude and phase on Coherent Change Detection (CCD). We examine 44 lossy compression types, plus lossless zlib compression, and test each compression method with over 600 CCD image pairs. We also derive theoretical predictions for the correlation for most of these compression schemes, which compare favorably with the experimental results. We recommend image transmission formats for limited-bandwidth programs having various requirements for CCD, including programs which cannot allow performance degradation and those which have stricter bandwidth requirements at the expense of CCD performance.
[Tumor segmentation of brain MRI with adaptive bandwidth mean shift].
Hou, Xiaowen; Liu, Qi
2014-10-01
In order to get the adaptive bandwidth of mean shift to make the tumor segmentation of brain magnetic resonance imaging (MRI) to be more accurate, we in this paper present an advanced mean shift method. Firstly, we made use of the space characteristics of brain image to eliminate the impact on segmentation of skull; and then, based on the characteristics of spatial agglomeration of different tissues of brain (includes tumor), we applied edge points to get the optimal initial mean value and the respectively adaptive bandwidth, in order to improve the accuracy of tumor segmentation. The results of experiment showed that, contrast to the fixed bandwidth mean shift method, the method in this paper could segment the tumor more accurately.
High bandwidth frequency lock of a rigid tunable optical cavity.
Millo, Jacques; Merzougui, Mourad; Di Pace, Sibilla; Chaibi, Walid
2014-11-10
In this paper, we present a high bandwidth frequency lock of a rigid tunable Fabry Perot cavity based on a set of lead zirconate titanate (PZT) actuators. The cavity spacer was specifically designed such that the frequency of the first resonance of the whole assembly under PZT excitation is above 35 kHz, thus allowing a servo-loop bandwidth of 13 kHz. It is demonstrated that no significant noise is added by the cavity to the output beam with respect to the input beam over the servo-loop bandwidth. This cavity can be used as a pre-mode cleaner in interferometric gravitational wave detectors such as the Laser Interferometer Gravitational-Wave Observatory (LIGO) and Virgo.
Estimating auditory filter bandwidth using distortion product otoacoustic emissions
DEFF Research Database (Denmark)
Hauen, Sigurd van; Rukjær, Andreas Harbo; Ordoñez Pizarro, Rodrigo Eduardo
2017-01-01
The basic frequency selectivity in the listener’s hearing is often characterized by auditory filters. These filters are determined through listening tests, which determine the masking threshold as a function of frequency of the tone and the bandwidth of the masking sound. The auditory filters have...... correlation to the theoretical relation between frequency and auditory filter bandwidth, described by the equivalent rectangular bandwidth (ERB, Glasberg and Moore, 1990). The purpose of the present study is to test if a similar correlation exists on an individual basis at normal audiometric frequencies....... The optimal 2f1-f2 (L1/L2=65/45 dB SPL). The distortion-product-otoacoustic-emission ratio is determined using a custom-made measurement system programmed in MATLAB. The auditory filters are determined using notched-noise method in a two alternative forced choice experiment with noise levels at 40 dB SPL...
Constrained ℋ∞ control for low bandwidth active suspensions
Wasiwitono, Unggul; Sutantra, I. Nyoman
2017-08-01
Low Bandwidth Active Suspension (LBAS) is shown to be more competitive to High Bandwidth Active Suspension (HBAS) when energy and cost aspects are taken into account. In this paper, the constrained ℋ∞ control scheme is applied for LBAS system. The ℋ∞ performance is used to measure ride comfort while the concept of reachable set in a state-space ellipsoid defined by a quadratic storage function is used to capture the time domain constraint that representing the requirements for road holding, suspension deflection limitation and actuator saturation. Then, the control problem is derived in the framework of Linear Matrix Inequality (LMI) optimization. The simulation is conducted considering the road disturbance as a stationary random process. The achievable performance of LBAS is analyzed for different values of bandwidth and damping ratio.
Development of a bandwidth limiting neutron chopper for CSNS
Wang, P.; Yang, B.; Cai, W. L.
2015-08-01
Bandwidth limiting neutron choppers are indispensable key equipments for the time-of-flight neutron scattering spectrometers of China Spallation Neutron Source (CSNS). The main principle is to chop the neutron beam to limit the neutron wavelength bandwidth at the neutron detector. We have successfully developed a bandwidth limiting neutron chopper for CSNS in the CSNS advance research project II. The transmission rate of the neutron absorbing coating is less than 1×10-4 (for 1 angstrom neutron). The phase control accuracy is ±0.084° (±9.4 μs at 25 Hz). The dynamic balance grade is G1.0. Various experimental technical features have met the design requirements, and it also runs stably and reliably during the long-term tests.
Development of a bandwidth limiting neutron chopper for CSNS
International Nuclear Information System (INIS)
Wang, P.; Yang, B.; Cai, W.L.
2015-01-01
Bandwidth limiting neutron choppers are indispensable key equipments for the time-of-flight neutron scattering spectrometers of China Spallation Neutron Source (CSNS). The main principle is to chop the neutron beam to limit the neutron wavelength bandwidth at the neutron detector. We have successfully developed a bandwidth limiting neutron chopper for CSNS in the CSNS advance research project II. The transmission rate of the neutron absorbing coating is less than 1×10 −4 (for 1 angstrom neutron). The phase control accuracy is ±0.084° (±9.4 μs at 25 Hz). The dynamic balance grade is G1.0. Various experimental technical features have met the design requirements, and it also runs stably and reliably during the long-term tests
Sistem Pakar Fuzzy Untuk Optimasi Penggunaan Bandwidth Jaringan Komputer
Directory of Open Access Journals (Sweden)
Mustaziri Mustaziri
2014-02-01
Full Text Available The need for bandwidth availability today is very high along with the increase of infrastructural growth of internet network. Therefore, the presence of efficient, reliable, and economical service availability system is required. It can be achieved byperforming good and appropriate system planning. In providing efficient and reliable internet services, one of the supporting factors is the optimization of bandwidth using. To optimize the use of bandwidth, we use fuzzy expert system by Sugeno method. This fuzzy expert system use 3 input variables, such as lecture room, day, and t ime, with one output variable of the capacity of bandwidth used. Rule base being made based on the consultation with the expert to determine the rule base for fuzzy system input. The computation to determine the average error using the computation formula of MAPE (Means Absolute Percentage Error which is the error median of absolute percentage. The data of the research results on the optimization of bandwidth using in fuzzy expert system with Sugeno method obtain from verification, that is by comparing actual data to prediction data with fuzzy system. The average error result is 6,5142 %.Keywords: Fuzzy Expert System; Optimization; Bandwidth
Better bounds for incremental frequency allocation in bipartite graphs
Czech Academy of Sciences Publication Activity Database
Chrobak, M.; Jeż, Łukasz; Sgall, J.
2013-01-01
Roč. 514, 25 November (2013), s. 75-83 ISSN 0304-3975 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : online algorithms * frequency allocation * graph algorithms Subject RIV: BA - General Mathematics Impact factor: 0.516, year: 2013 http://www.sciencedirect.com/science/article/pii/S0304397512004781
Lee, Chongdeuk; Jeong, Taegwon
2011-01-01
Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the membership of the cluster while preserving current cluster structure as much as possible. This paper proposes a Fuzzy Relevance-based Cluster head selection Algorithm (FRCA) to solve problems found in existing wireless mobile ad hoc sensor networks, such as the node distribution found in dynamic properties due to mobility and flat structures and disturbance of the cluster formation. The proposed mechanism uses fuzzy relevance to select the cluster head for clustering in wireless mobile ad hoc sensor networks. In the simulation implemented on the NS-2 simulator, the proposed FRCA is compared with algorithms such as the Cluster-based Routing Protocol (CBRP), the Weighted-based Adaptive Clustering Algorithm (WACA), and the Scenario-based Clustering Algorithm for Mobile ad hoc networks (SCAM). The simulation results showed that the proposed FRCA achieves better performance than that of the other existing mechanisms.
SSC accelerator availability allocation
International Nuclear Information System (INIS)
Dixon, K.T.; Franciscovich, J.
1991-03-01
Superconducting Super Collider (SSC) operational availability is an area of major concern, judged by the Central Design Group to present such risk that use of modern engineering tools would be essential to program success. Experience has shown that as accelerator beam availability falls below about 80%, efficiency of physics experiments degrades rapidly due to inability to maintain adequate coincident accelerator and detector operation. For this reason, the SSC availability goal has been set at 80%, even though the Fermi National Accelerator Laboratory accelerator, with a fraction of the SSC's complexity, has only recently approached that level. This paper describes the allocation of the top-level goal to part-level reliability and maintainability requirements, and it gives the results of parameter sensitivity studies designed to help identify the best approach to achieve the needed system availability within funding and schedule constraints. 1 ref., 12 figs., 4 tabs
EFFECTIVE BANDWIDTH FOR SELF-SIMILAR TRAFFIC IN ATM NETWORK
Directory of Open Access Journals (Sweden)
Linawati Linawati
2009-05-01
Full Text Available This paper proposes a new approach to estimate the effective bandwidth for self-similar traffic in ATM network. In this approach we use the tail distribution of queue length based on FBM model. This approach is derived from the inequalities for Millsâ€™ ratio. Then a comparison with Norros and Trinh&Miki schemes are analysed. The results demonstrate reasonable agreement between numerical and simulation results and between all schemes. Their bandwidth estimation tends closer for CLP improvement.
Compact silicon multimode waveguide spectrometer with enhanced bandwidth
DEFF Research Database (Denmark)
Piels, Molly; Zibar, Darko
2017-01-01
Compact, broadband, and high-resolution spectrometers are appealing for sensing applications, but difficult to fabricate. Here we show using calibration data a spectrometer based on a multimode waveguide with 2 GHz resolution, 250 GHz bandwidth, and a 1.6 mm × 2.1 mm footprint. Typically......, such spectrometers have a bandwidth limited by the number of modes supported by the waveguide. In this case, an on-chip mode-exciting element is used to repeatably excite distinct collections of waveguide modes. This increases the number of independent spectral channels from the number of modes to this number...
Real time target allocation in cooperative unmanned aerial vehicles
Kudleppanavar, Ganesh
The prolific development of Unmanned Aerial Vehicles (UAV's) in recent years has the potential to provide tremendous advantages in military, commercial and law enforcement applications. While safety and performance take precedence in the development lifecycle, autonomous operations and, in particular, cooperative missions have the ability to significantly enhance the usability of these vehicles. The success of cooperative missions relies on the optimal allocation of targets while taking into consideration the resource limitation of each vehicle. The task allocation process can be centralized or decentralized. This effort presents the development of a real time target allocation algorithm that considers available stored energy in each vehicle while minimizing the communication between each UAV. The algorithm utilizes a nearest neighbor search algorithm to locate new targets with respect to existing targets. Simulations show that this novel algorithm compares favorably to the mixed integer linear programming method, which is computationally more expensive. The implementation of this algorithm on Arduino and Xbee wireless modules shows the capability of the algorithm to execute efficiently on hardware with minimum computation complexity.
Importance measures and resource allocation
International Nuclear Information System (INIS)
Guey, C.N.; Morgan, T.; Hughes, E.A.
1987-01-01
This paper discusses various importance measures and their practical relevance to allocating resources. The characteristics of importance measures are illustrated through simple examples. Important factors associated with effectively allocating resources to improve plant system performance or to prevent system degradation are discussed. It is concluded that importance measures are only indicative of and not equal to the risk significance of a component, system, or event. A decision framework is suggested to provide a comprehensive basis for resource allocation
DEFF Research Database (Denmark)
Mahnke, Martina; Uprichard, Emma
2014-01-01
changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...
Radio resource allocation over fading channels under statistical delay constraints
Le-Ngoc, Tho
2017-01-01
This SpringerBrief presents radio resource allocation schemes for buffer-aided communications systems over fading channels under statistical delay constraints in terms of upper-bounded average delay or delay-outage probability. This Brief starts by considering a source-destination communications link with data arriving at the source transmission buffer. The first scenario, the joint optimal data admission control and power allocation problem for throughput maximization is considered, where the source is assumed to have a maximum power and an average delay constraints. The second scenario, optimal power allocation problems for energy harvesting (EH) communications systems under average delay or delay-outage constraints are explored, where the EH source harvests random amounts of energy from renewable energy sources, and stores the harvested energy in a battery during data transmission. Online resource allocation algorithms are developed when the statistical knowledge of the random channel fading, data arrivals...
Cost allocation protocols for supply contract design in network situations
Moretti, S.; Tijs, S.H.; Brânzei, R.; Norde, H.W.
2009-01-01
The class of Construct and Charge (CC-) rules for minimum cost spanning tree (mcst) situations is considered. CC-rules are defined starting from the notion of charge systems, which specify particular allocation protocols rooted on the Kruskal algorithm for computing an mcst. These protocols can be
Frequency Selective Surfaces for extended Bandwidth backing reflector functions
Pasian, M.; Neto, A.; Monni, S.; Ettorre, M.; Gerini, G.
2008-01-01
This paper deals with the use of Frequency Selective Surfaces (FSS) to increase the Efficiency × Bandwidth product in Ultra-Wide Band (UWB) antenna arrays whose efficiency is limited by the front-to-back ratio. If the backing reflector is realized in one metal plane solution its location will be
Come together: African universities collaborate to improve bandwidth
International Development Research Centre (IDRC) Digital Library (Canada)
2011-02-02
Feb 2, 2011 ... SEE ALSO... In Reports magazine: Viewpoint: Bandwidth can bring African universities up to speed. In Reports magazine: Brain Drain and Capacity Building in Africa · The AAU Web site. The Connectivity Africa Web site. The World Summit on the Information Society (WSIS) Web site. IDRC's ICT4D Web site ...
Estimating auditory filter bandwidth using distortion product otoacoustic emissions
DEFF Research Database (Denmark)
Rukjær, Andreas Harbo; Hauen, Sigurd van; Ordoñez Pizarro, Rodrigo Eduardo
2017-01-01
The basic frequency selectivity in the listener’s hearing is often characterized by auditory filters. These filters are determined through listening tests, which estimate the masking threshold as a function of frequency of the tone and the bandwidth of the masking sound. The auditory filters have...
Sensitivity-Bandwidth Limit in a Multimode Optoelectromechanical Transducer
Moaddel Haghighi, I.; Malossi, N.; Natali, R.; Di Giuseppe, G.; Vitali, D.
2018-03-01
An optoelectromechanical system formed by a nanomembrane capacitively coupled to an L C resonator and to an optical interferometer has recently been employed for the highly sensitive optical readout of rf signals [T. Bagci et al., Nature (London) 507, 81 (2013), 10.1038/nature13029]. We propose and experimentally demonstrate how the bandwidth of such a transducer can be increased by controlling the interference between two electromechanical interaction pathways of a two-mode mechanical system. With a proof-of-principle device operating at room temperature, we achieve a sensitivity of 300 nV /√{Hz } over a bandwidth of 15 kHz in the presence of radio-frequency noise, and an optimal shot-noise-limited sensitivity of 10 nV /√{Hz } over a bandwidth of 5 kHz. We discuss strategies for improving the performance of the device, showing that, for the same given sensitivity, a mechanical multimode transducer can achieve a bandwidth significantly larger than that for a single-mode one.
Come together: African universities collaborate to improve bandwidth
International Development Research Centre (IDRC) Digital Library (Canada)
2011-02-02
Feb 2, 2011 ... However, a stumbling block to realizing this vision arose: the cost of access. As Bob Hawkins, a senior education specialist at the WBI, points out, “the average African university pays 50 times more than the amount a North American university pays for Internet access.” Moreover, the bandwidth available to ...
A Practical Approach For Excess Bandwidth Distribution for EPONs
Elrasad, Amr
2014-03-09
This paper introduces a novel approach called Delayed Excess Scheduling (DES), which practically reuse the excess bandwidth in EPONs system. DES is suitable for the industrial deployment as it requires no timing constraint and achieves better performance compared to the previously reported schemes.
On bounding the bandwidth of graphs with symmetry
van Dam, E.R.; Sotirov, R.
2015-01-01
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the min-cut problem. Our new semidefinite programming relaxation of the min-cut problem is obtained by strengthening the known semidefinite programming relaxation for the quadratic assignment problem (or
A Multi-Carrier Scheduling Algorithm for LTE-Advanced
DEFF Research Database (Denmark)
Vulpe, Alexander; Mihovska, Albena D.; Prasad, Ramjee
2013-01-01
LTE-Advanced aims to provide a transmission bandwidth of 100 MHz by using Carrier Aggregation to aggregate LTE Rel. 8 carriers. In order to increase the system capacity, resource allocation becomes a very good tool, and, in the context of the existence of multiple Component Carriers in LTE-Advanc...
Efficient Metropolitan Resource Allocation
Directory of Open Access Journals (Sweden)
Richard Arnott
2016-05-01
Full Text Available Over the past 30 years Calgary has doubled in size, from a population of 640,645 in 1985 to 1,230,915 in 2015. During that time the City has had five different mayors, hosted the Winter Olympics, and expanded the C-Train from 25 platforms to 45. Calgary’s Metropolitan Area has grown too, with Airdrie, Chestermere, Okotoks and Cochrane growing into full-fledged cities, ripe with inter-urban commuters.* And with changes to provincial legislation in the mid-’90s, rural Rocky View County and the Municipal District of Foothills are now real competitors for residential, commercial and industrial development that in the past would have been considered urban. In this metropolitan system, where people live, their household structure, and their place of work informs the services they need to conduct their daily lives, and directly impacts the spatial character of the City and the broader region. In sum, Metropolitan Calgary is increasingly complex. Calgary and the broader metropolitan area will continue to grow, even with the current economic slowdown. Frictions within Calgary, between the various municipalities in the metropolitan area, and the priorities of other local authorities (such as the School Boards and Alberta Health Services will continue to impact the agendas of local politicians and their ability to answer to the needs of their residents. How resources – whether it is hard infrastructure, affordable housing, classrooms, or hospital beds – are allocated over space and how these resources are funded, directly impacts these relationships. This technical paper provides my perspective as an urban economist on the efficient allocation of resources within a metropolitan system in general, with reference to Calgary where appropriate, and serves as a companion to the previously released “Reflections on Calgary’s Spatial Structure: An Urban Economists Critique of Municipal Planning in Calgary.” It is hoped that the concepts reviewed
Risk allocation under liquidity constraints
Csóka, P.; Herings, P.J.J.
2013-01-01
Risk allocation games are cooperative games that are used to attribute the risk of a financial entity to its divisions. In this paper, we extend the literature on risk allocation games by incorporating liquidity considerations. A liquidity policy specifies state-dependent liquidity requirements that
Energy Technology Data Exchange (ETDEWEB)
Clark, M. A. [NVIDIA Corp., Santa Clara; Strelchenko, Alexei [Fermilab; Vaquero, Alejandro [Utah U.; Wagner, Mathias [NVIDIA Corp., Santa Clara; Weinberg, Evan [Boston U.
2017-10-26
Lattice quantum chromodynamics simulations in nuclear physics have benefited from a tremendous number of algorithmic advances such as multigrid and eigenvector deflation. These improve the time to solution but do not alleviate the intrinsic memory-bandwidth constraints of the matrix-vector operation dominating iterative solvers. Batching this operation for multiple vectors and exploiting cache and register blocking can yield a super-linear speed up. Block-Krylov solvers can naturally take advantage of such batched matrix-vector operations, further reducing the iterations to solution by sharing the Krylov space between solves. However, practical implementations typically suffer from the quadratic scaling in the number of vector-vector operations. Using the QUDA library, we present an implementation of a block-CG solver on NVIDIA GPUs which reduces the memory-bandwidth complexity of vector-vector operations from quadratic to linear. We present results for the HISQ discretization, showing a 5x speedup compared to highly-optimized independent Krylov solves on NVIDIA's SaturnV cluster.
MPC Toolbox with GPU Accelerated Optimization Algorithms
DEFF Research Database (Denmark)
Gade-Nielsen, Nicolai Fog; Jørgensen, John Bagterp; Dammann, Bernd
2012-01-01
The introduction of Graphical Processing Units (GPUs) in scientific computing has shown great promise in many different fields. While GPUs are capable of very high floating point performance and memory bandwidth, its massively parallel architecture requires algorithms to be reimplemented to suit...
A Parallel Butterfly Algorithm
Poulson, Jack
2014-02-04
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
Loss Allocation in a Distribution System with Distributed Generation Units
DEFF Research Database (Denmark)
Lund, Torsten; Nielsen, Arne Hejde; Sørensen, Poul Ejnar
2007-01-01
In Denmark, a large part of the electricity is produced by wind turbines and combined heat and power plants (CHPs). Most of them are connected to the network through distribution systems. This paper presents a new algorithm for allocation of the losses in a distribution system with distributed...... generation. The algorithm is based on a reduced impedance matrix of the network and current injections from loads and production units. With the algorithm, the effect of the covariance between production and consumption can be evaluated. To verify the theoretical results, a model of the distribution system...
Cooperative Task Allocation Method of MCAV/UCAV Formation
Directory of Open Access Journals (Sweden)
Yun Zhong
2016-01-01
Full Text Available Unmanned Combat Aerial Vehicle (UCAV cooperative task allocation under Manned Combat Aerial Vehicle’s (MCAV limited control is one of the important problems in UCAV research field. Hereto, we analyze the key technical and tactical indices influence task allocation problem and build an appropriate model to maximize the objective function values as well as reflecting various constraints. A novel improved multigroup ant colony algorithm (IMGACA is proposed to solve the model; the algorithm mainly includes random sequence-based UCAV selection strategy, constraint-based candidate task generation strategy, objective function value-based state transition strategy, and crossover operator-based local search strategy. Simulation results show that the built model is reasonable and the proposed algorithm performs well in feasibility, timeliness, and stability.
Nkanta, Julie E.; Maldonado-Basilio, Ramón; Abdul-Majid, Sawsan; Zhang, Jessica; Hall, Trevor J.
2013-12-01
An exhausted capacity of current Passive Optical Networks has been anticipated as bandwidth-hungry applications such as HDTV and 3D video become available to end-users. To enhance their performance, the next generation optical access networks have been proposed, using optical carriers allocated within the E-band (1360-1460 nm). It is partly motivated by the low-water peak fiber being manufactured by Corning. At these wavelengths, choices for low cost optical amplifiers, with compact size, low energy consumption and feasibility for integration with other optoelectronic components are limited, making the semiconductor optical amplifiers (SOA) a realistic solution. An experimental characterization of a broadband and low polarization sensitive asymmetric multi quantum well (MQW) SOA operating in the E-band is reported. The SOA device is composed of nine 6 nm In1-xGaxAsyP1-y 0.2% tensile strained asymmetric MQW layers sandwiched between nine latticed matched 6 nm InGaAsP barrier layers. The active region is grown on an n-doped InP substrate and buried by p-doped InGaAsP layers. The SOA devices have 7-degrees tilt anti-reflected coated facets, with 2 μm ridge width, and a cavity length of 900 μm. For input powers of -10 dBm and -20 dBm, a maximum gain of 20 dB at 1360 nm with a polarization insensitivity under 3 dB for over 90 nm bandwidth is measured. Polarization sensitivity of less than 0.5 dB is observed for some wavelengths. Obtained results indicate a promising SOA with broadband amplification, polarization insensitivity and high gain. These SOAs were designed and characterized at the Photonics Technology Laboratory, University of Ottawa, Canada.
An investigation of dynamic subcarrier allocation in MIMO–OFDMA systems
Peng, Y; Armour, SMD; McGeehan, JP
2007-01-01
In this paper, orthogonal frequency-division multiple-access (OFDMA) systems with dynamic deterministic (as opposed to pseudorandom) allocation of subcarriers to users to exploit multiuser diversity are investigated. Previously published work on dynamic multiuser subcarrrier allocation for OFDMA systems with single-input-single-output (SISO) channels are surveyed. A near-optimal low-complexity algorithm for SISO systems, which is structurally similar to the algorithm by Rhee and Cioffi, is ex...
Adaptive Radio Resource Allocation in Hierarchical QoS Scheduling for IEEE 802.16 Systems
DEFF Research Database (Denmark)
Wang, Hua; Dittmann, Lars
2007-01-01
an adaptive bandwidth distribution algorithm for the aggregate scheduler in a two-level hierarchical scheduler, which can provide more organized service differentiation among different service classes. By taking the backlogged traffic, the spectral efficiency in terms of modulation efficiency, and the Qo...
A low complexity based spectrum management algorithm for ‘Near–Far’ problem in VDSL environment
Directory of Open Access Journals (Sweden)
Sunil Sharma
2015-10-01
Full Text Available In digital subscriber line (DSL system, crosstalk created by electromagnetic interference among twisted pairs degrades the system performance. Very high bit rate DSL (VDSL, utilizes higher bandwidth of copper cable for data transmission. During upstream transmission, a ‘Near–Far’ problem occurs in VDSL system. In this problem the far end crosstalk (FEXT is produced from near end user degrades the data rate achieved at the far end user. The effect of FEXT can be reduced by properly managing power spectral densities (PSD of transmitters of near and far users. This kind of power allocation is called dynamic spectrum management (DSM. In this paper, a new distributed DSM algorithm is proposed in which power from only those sub channels of near end user are reduced which create interference to far end user. This power back off strategy takes place with the help of power spectral density (PSD masks at interference creating sub channels of near end user. The simulation results of the proposed algorithm show an improvement in terms of data rate and approaches near to that of optimal spectrum balancing (OSB algorithm.
A study of application sensitivity to variation in message passing latency and bandwidth
Energy Technology Data Exchange (ETDEWEB)
Worley, P.H.; Mackay, D.R. [Oak Ridge National Lab., TN (United States); Robinson, A.C. [Sandia National Labs, Albuquerque, NM (United States); Barragy, E.J. [Intel Corp., Beaverton, OR (United States)
1996-06-01
This study measures the effects of changes in message latency and bandwidth for production-level codes on a current generation tightly coupled MPP, the Intel Paragon. Messages are sent multiple times to study the application sensitivity to variations in band - width and latency. This method preserves the effects of contention on the interconnection network. Two applications are studied, PCTH, a shock physics code developed at Sandia National Laboratories, and PSTSWM, a spectral shallow water code developed at Oak Ridge National Laboratory and Argonne National Laboratory. These codes are significant in that PCTH is a {open_quote}full physics{close_quotes} application code in production use, while PSTSWM serves as a parallel algorithm test bed and benchmark for production codes used in atmospheric modeling. They are also significant in that the message-passing behavior differs significantly between the two codes, each representing an important class of scientific message-passing applications.
Cross-Layer Optimal Rate Allocation for Heterogeneous Wireless Multicast
Directory of Open Access Journals (Sweden)
Amr Mohamed
2009-01-01
Full Text Available Heterogeneous multicast is an efficient communication scheme especially for multimedia applications running over multihop networks. The term heterogeneous refers to the phenomenon when multicast receivers in the same session require service at different rates commensurate with their capabilities. In this paper, we address the problem of resource allocation for a set of heterogeneous multicast sessions over multihop wireless networks. We propose an iterative algorithm that achieves the optimal rates for a set of heterogeneous multicast sessions such that the aggregate utility for all sessions is maximized. We present the formulation of the multicast resource allocation problem as a nonlinear optimization model and highlight the cross-layer framework that can solve this problem in a distributed ad hoc network environment with asynchronous computations. Our simulations show that the algorithm achieves optimal resource utilization, guarantees fairness among multicast sessions, provides flexibility in allocating rates over different parts of the multicast sessions, and adapts to changing conditions such as dynamic channel capacity and node mobility. Our results show that the proposed algorithm not only provides flexibility in allocating resources across multicast sessions, but also increases the aggregate system utility and improves the overall system throughput by almost 30% compared to homogeneous multicast.
Optimal Scanning Bandwidth Strategy Incorporating Uncertainty about Adversary’s Characteristics
Directory of Open Access Journals (Sweden)
Andrey Garnaev
2014-12-01
Full Text Available In this paper, we investigate the problem of designing a spectrum scanning strategy to detect an intelligent Invader who wants to utilize spectrum undetected for his/her unapproved purposes. To deal with this problem we model the situation as two games, between a Scanner and an Invader, and solve them sequentially. The first game is formulated to design the optimal (in maxmin sense scanning algorithm, while the second one allows one to find the optimal values of the parameters for the algorithm depending on the parameters of the network. These games provide solutions for two dilemmas that the rivals face. The Invader’s dilemma consists of the following: the more bandwidth the Invader attempts to use leads to a larger payoff if he is not detected, but at the same time also increases the probability of being detected and thus fined. Similarly, the Scanner faces a dilemma: the wider the bandwidth scanned, the higher the probability of detecting the Invader, but at the expense of increasing the cost of building the scanning system. The equilibrium strategies are found explicitly and reveal interesting properties. In particular, we have found a discontinuous dependence of the equilibrium strategies on the network parameters, fine and the type of the Invader’s award. This discontinuity of the fine means that the network provider has to take into account a human/social factor since some threshold values of fine could be very sensible for the Invader, while in other situations simply increasing the fine has a minimal deterrence impact. Also we show how incomplete information about the Invader’s technical characteristics and reward (e.g. motivated by using different type of application, say, video-streaming or downloading files can be incorporated into the scanning strategy to increase its efficiency.
Bandwidth-enhanced photopolymer waveguide hologram-based optical backplane
Bi, Hai; Tian, Chuhua; Chen, Ray T.; Han, Xuliang
2005-01-01
As multiprocessing comes into the mainstream, the board-to-board interconnects become even more critical. In a shared-memory multiprocessing system, the shared bus topology is the preferred interconnect scheme because its broadcast nature can be effectively utilized to reduce communication latency, lessen networking complexity, and support cache coherence. In the electrical domain, however, a major performance bottleneck is anticipated due to the restricted bus bandwidth. In this paper, an innovative architecture, optical centralized shared bus, is proposed for use in the multiprocessing systems. This architecture utilizes the terascale bandwidth capacity of substrate-guided optical interconnects, while at the same time, retaining the essential merits of the shared bus topology. Thus, a smooth migration with substantial multiprocessing performance improvement is expected. A conceptual emulation of the shared-memory multiprocessing scheme is demonstrated on a generic PCI subsystem with an optical centralized shared bus. The objective of this effort is to prove the technical feasibility from the architecture standpoint.
Systems with selective overflow and change of bandwidth
DEFF Research Database (Denmark)
Iversen, Villy Bæk
2012-01-01
We consider a loss system with n channels and a finite or infinite overflow group, which is offered N different services, all having Poisson arrival processes. All calls have same bandwidth demand and mean service time, but the mean service time may be different on the primary group and the overf......We consider a loss system with n channels and a finite or infinite overflow group, which is offered N different services, all having Poisson arrival processes. All calls have same bandwidth demand and mean service time, but the mean service time may be different on the primary group...... on the overflow group, we show by balance equations that the number of calls of each service will be Multinomial distributed with probabilities proportional with the arrival rates. Using a recent result of Newcomer & al, we then find moments (done up to fourth order) of individual overflow streams or any...
Bandwidth improvement for germanium photodetector using wire bonding technology.
Chen, Guanyu; Yu, Yu; Deng, Shupeng; Liu, Lei; Zhang, Xinliang
2015-10-05
We demonstrate an ultrahigh speed germanium photodetector by introducing gold wires into the discrete ground electrodes with standard wire bonding technology. To engineer the parasitic parameter, the physical dimension of the gold wire used for wire bonding is specially designed with an inductance of about 450 pH. Simulation and experimental results show that the bandwidth of the photodetector can be effectively extended from less than 30 GHz to over 60 GHz.
Designing large-bandwidth planar photonic crystal waveguides
DEFF Research Database (Denmark)
Lavrinenko, Andrei; Søndergaard, Thomas
2002-01-01
Our waveguide design is characterized by first of all a large bandwidth, and secondly it is characterized by a relatively high group velocity giving a better modal dispersion match with the modes of standard waveguides used for coupling light into the planar crystal waveguide (PCW). We consider t...... the dispersion properties for a PCW based on introducing a line defect in a photonic crystal with air-holes arranged periodically on a triangular lattice in silicon....
T0001 / MilliNewton force sensor / frequency bandwidth
Maeder, Thomas
2014-01-01
This document gives an approximate calculation of the frequency bandwidth of the MilliNewton – and serves as a starting point for calculations on other cantilever-type sensors. The mechanical resonance frequencies of MilliNewton are high, due to the very small cantilever size. The working frequency is in fact limited by the electrical circuit at ca. 1 kHz (MilliNewton-A) or ca. 200 Hz (MilliNewton-B).
Development of Information Assurance Protocol for Low Bandwidth Nanosatellite Communications
2017-09-01
encryption method may be the fastest most reliable encryption method for nanosatellites. Utilizing Python as a development and testing platform for the...immediately by the state of health data. F. NERDP PROOF OF CONCEPT PLATFORM DEVELOPMENT In order to test the validity of the design of NERDP, a proof of...bandwidth reliable network protocol that can support a cryptographic system for encrypted communications using commercial off-the-shelf components
Allocation Fairness for MIMO Precoded UTRA-LTE TDD System
DEFF Research Database (Denmark)
Wang, Yuanye; Rahman, Muhammad Imadur; Das, Suvra
2008-01-01
. To increase the cell coverage while ensuring the Quality of Service (QoS) for all UEs across the cell area, fairness should be maximized as much as possible. This paper presents a novel way to help improving fairness performance in the physical layer, via fair power allocation together with resource...... allocation, in MU-MIMO precoding scenarios where the common approach of guaranteeing fairness at MAC layer is not feasible. The results presented in this paper show that the proposed algorithm is able to reduce the system outage event to a large extent, thus increases fairness....
Solving the optimal attention allocation problem in manual control
Kleinman, D. L.
1976-01-01
Within the context of the optimal control model of human response, analytic expressions for the gradients of closed-loop performance metrics with respect to human operator attention allocation are derived. These derivatives serve as the basis for a gradient algorithm that determines the optimal attention that a human should allocate among several display indicators in a steady-state manual control task. Application of the human modeling techniques are made to study the hover control task for a CH-46 VTOL flight tested by NASA.
A Review of Function Allocation and En Route Separation Assurance
Lewis, Timothy A.; Aweiss, Arwa S.; Guerreiro, Nelson M.; Daiker, Ronald J.
2016-01-01
Today's air traffic control system has reached a limit to the number of aircraft that can be safely managed at the same time. This air traffic capacity bottleneck is a critical problem along the path to modernization for air transportation. The design of the next separation assurance system to address this problem is a cornerstone of air traffic management research today. This report reviews recent work by NASA and others in the areas of function allocation and en route separation assurance. This includes: separation assurance algorithms and technology prototypes; concepts of operations and designs for advanced separation assurance systems; and specific investigations into air-ground and human-automation function allocation.
iGrid2002 Demonstration: Bandwidth from the Low Lands
Energy Technology Data Exchange (ETDEWEB)
Cottrell, Les
2002-11-01
We report on a demonstration of several complementary high performance end-to-end active network throughput measurement tools. These include: the PingWorld Java applet that displays the Round Trip Time (RTT) and losses to sites around the world from the user's host; the multi-path analysis tool that visualizes common paths from traceroutes to selected hosts; the IEPM high-performance BandWidth monitoring toolkit which gives achievable throughput for several types of TCP data transfer applications; and the Available Bandwidth Estimation (ABWE) tool that reports in real time the available bandwidth to several paths within the range from Mbits/s to Gbit/s. We also demonstrated sending high-speed data from 4 hosts at iGrid2002 to over 30 hosts in 10 countries to simulate a high energy physics experiment distributing data to collaborators. The demonstration utilized the high-speed, long latency, trans-Atlantic network set up for iGrid2002 in Amsterdam during September 2002.
Large-bandwidth data acquisition network for XFEL facility, SACLA
International Nuclear Information System (INIS)
Sugimoto, T.; Joti, Y.; Ohata, T.; Tanaka, R.; Yamaga, M.; Hatsui, T.
2012-01-01
The SACLA (SPring-8 Angstrom Compact Free Electron Laser) facility consists of an accelerator building, an undulator building and an experimental facility. SACLA is designed to produce X-ray with a wavelength as short as 0.06 nm and with a repetition rate of 60 Hz. X-ray Free-Electron Laser (XFEL) experiments demands large bandwidth network for data acquisition (DAQ). At SACLA the experimental data rate is to be up to 5.8 Giga bit per second (Gbps). Some of the experiments demands preprocessing and on-line analysis by high-performance computers. In order to fulfill these requirements, a dedicated network system for DAQ and data analysis has been developed. A DAQ network consists of a dedicated 10 Gbps Ethernet (10 GbE) physical layer to secure the data bandwidth and a 1 GbE layer for instrument controls. The DAQ network is connected to a primary storage and indirectly to a PC cluster for data preprocessing. A fire-wall system with virtual private network (VPN) features is also implemented in order to secure remote access from off-site institutes. The use of a large-bandwidth data transfer technique allows the efficient transfer of pre-processed data from SACLA to an off-site supercomputer
Neural bandwidth of veridical perception across the visual field
Wilkinson, Michael O.; Anderson, Roger S.; Bradley, Arthur; Thibos, Larry N.
2016-01-01
Neural undersampling of the retinal image limits the range of spatial frequencies that can be represented veridically by the array of retinal ganglion cells conveying visual information from eye to brain. Our goal was to demarcate the neural bandwidth and local anisotropy of veridical perception, unencumbered by optical imperfections of the eye, and to test competing hypotheses that might account for the results. Using monochromatic interference fringes to stimulate the retina with high-contrast sinusoidal gratings, we measured sampling-limited visual resolution along eight meridians from 0° to 50° of eccentricity. The resulting isoacuity contour maps revealed all of the expected features of the human array of retinal ganglion cells. Contours in the radial fringe maps are elongated horizontally, revealing the functional equivalent of the anatomical visual streak, and are extended into nasal retina and superior retina, indicating higher resolution along those meridians. Contours are larger in diameter for radial gratings compared to tangential or oblique gratings, indicating local anisotropy with highest bandwidth for radially oriented gratings. Comparison of these results to anatomical predictions indicates acuity is proportional to the sampling density of retinal ganglion cells everywhere in the retina. These results support the long-standing hypothesis that “pixel density” of the discrete neural image carried by the human optic nerve limits the spatial bandwidth of veridical perception at all retinal locations. PMID:26824638
Managing high-bandwidth real-time data storage
Energy Technology Data Exchange (ETDEWEB)
Bigelow, David D. [Los Alamos National Laboratory; Brandt, Scott A [Los Alamos National Laboratory; Bent, John M [Los Alamos National Laboratory; Chen, Hsing-Bung [Los Alamos National Laboratory
2009-09-23
There exist certain systems which generate real-time data at high bandwidth, but do not necessarily require the long-term retention of that data in normal conditions. In some cases, the data may not actually be useful, and in others, there may be too much data to permanently retain in long-term storage whether it is useful or not. However, certain portions of the data may be identified as being vitally important from time to time, and must therefore be retained for further analysis or permanent storage without interrupting the ongoing collection of new data. We have developed a system, Mahanaxar, intended to address this problem. It provides quality of service guarantees for incoming real-time data streams and simultaneous access to already-recorded data on a best-effort basis utilizing any spare bandwidth. It has built in mechanisms for reliability and indexing, can scale upwards to meet increasing bandwidth requirements, and handles both small and large data elements equally well. We will show that a prototype version of this system provides better performance than a flat file (traditional filesystem) based version, particularly with regard to quality of service guarantees and hard real-time requirements.
Quantum gates with optimal bandwidth in noisy environments
Low, Guang Hao; Theodore, Yoder; Chuang, Isaac
The traditional approach of open-loop quantum error correction suppresses certain systematic imperfections ɛ in quantum control to higher orders ɛ (L) by a well-designed sequence of L imperfect quantum gates. However, this philosophy of maximal flatness leads to an ɛ-bandwidth that scales poorly with length and a residual that is easily overwhelmed by unaccounted sources of noise. We advance the paradigm of equiripple compensated gates that directly optimize for bandwidth given the limitations imposed by noise of magnitude δ, leading to dramatically improved performance. Where ɛ represent amplitude errors, we provide a formalism that generalizes both approaches and is effective at finding such gates. With it, we provide in closed-form the phase angles for an optimal family of population inversion gates with an ɛ -bandwidth of (logδ-1/L) - a quadratic improvement over optimal maximally flat variants. We also construct optimal NOT gates and discuss extensions to other gates and error models.
Probabilistic Analysis of a Network Resource Allocation Algorithm.
1985-06-01
1.8 1111IL25 111 14 111 . MICROCOPY RESOLUTION TEST CHART - ) ARDlS 1963- LABORATORY FOR O COMPUTER SCIENCER TCHNOLOGY Lfl MIT/LCS/TM -278 LC...assume that each resource and request has a unique identifier. The execution model for this distributed network is event-based. Two types of events may...are modelled as a set of ’, ,foLr r-s. (Here. we do not concern ourselves about the tree structure beyond the children.) Li, . , ti C, , ,’, ueic vri
Department of Housing and Urban Development — The Fiscal Year (FY) 2012 budget for the Department of Housing and Urban Development has been enacted. This spreadsheet provide full-year allocations for the Office...
International Development Aid Allocation Determinants
Tapas Mishra; Bazoumana Ouattara; Mamata Parhi
2012-01-01
This paper investigates the factors explaining aid allocation by bilateral and multilateral donors. We use data for 146 aid recipient countries over the period 1990-2007 and employ Bayesian Averaging of Classical Estimates Approach (BACE) approach and find that both the recipient need and donor interest motives are `significant' determinants of bilateral and multilateral aid allocation process. Our results also indicate that the measures for recipient need and donor interests vary from bilate...
Application of an allocation methodology
International Nuclear Information System (INIS)
Youngblood, R.
1989-01-01
This paper presents a method for allocating resources to elements of a system for the purpose of achieving prescribed levels of defense-in-depth at minimal cost. The method makes extensive use of logic modelling. An analysis of a simplified high-level waste repository is used as an illustrative application of the method. It is shown that it is possible to allocate quality control costs (or demonstrate performance) in an optimal way over elements of a conceptual design
How should INGOs allocate resources?
Directory of Open Access Journals (Sweden)
Scott Wisor
2012-02-01
Full Text Available International Non-governmental Organizations (INGOs face difficult choices when choosing to allocate resources. Given that the resources made available to INGOs fall far short of what is needed to reduce massive human rights deficits, any chosen scheme of resource allocation requires failing to reach other individuals in great need. Facing these moral opportunity costs, what moral reasons should guide INGO resource allocation? Two reasons that clearly matter, and are recognized by philosophers and development practitioners, are the consequences (or benefit or harm reduction of any given resource allocation and the need (or priority of individual beneficiaries. If accepted, these reasons should lead INGOs to allocate resources to a limited number of countries where the most prioritarian weighted harm reduction will be achieved. I make three critiques against this view. First, on grounds the consequentialist accepts, I argue that INGOs ought to maintain a reasonably wide distribution of resources. Second, I argue that even if one is a consequentialist, consequentialism ought not act as an action guiding principle for INGOs. Third, I argue that additional moral reasons should influence decision making about INGO resource allocation. Namely, INGO decision making should attend to relational reasons, desert, respect for agency, concern for equity, and the importance of expressing a view of moral wrongs.
Generalized multidimensional dynamic allocation method.
Lebowitsch, Jonathan; Ge, Yan; Young, Benjamin; Hu, Feifang
2012-12-10
Dynamic allocation has received considerable attention since it was first proposed in the 1970s as an alternative means of allocating treatments in clinical trials which helps to secure the balance of prognostic factors across treatment groups. The purpose of this paper is to present a generalized multidimensional dynamic allocation method that simultaneously balances treatment assignments at three key levels: within the overall study, within each level of each prognostic factor, and within each stratum, that is, combination of levels of different factors Further it offers capabilities for unbalanced and adaptive designs for trials. The treatment balancing performance of the proposed method is investigated through simulations which compare multidimensional dynamic allocation with traditional stratified block randomization and the Pocock-Simon method. On the basis of these results, we conclude that this generalized multidimensional dynamic allocation method is an improvement over conventional dynamic allocation methods and is flexible enough to be applied for most trial settings including Phases I, II and III trials. Copyright © 2012 John Wiley & Sons, Ltd.
Re-use of Low Bandwidth Equipment for High Bit Rate Transmission Using Signal Slicing Technique
DEFF Research Database (Denmark)
Wagner, Christoph; Spolitis, S.; Vegas Olmos, Juan José
: Massive fiber-to-the-home network deployment requires never ending equipment upgrades operating at higher bandwidth. We show effective signal slicing method, which can reuse low bandwidth opto-electronical components for optical communications at higher bit rates.......: Massive fiber-to-the-home network deployment requires never ending equipment upgrades operating at higher bandwidth. We show effective signal slicing method, which can reuse low bandwidth opto-electronical components for optical communications at higher bit rates....
Environmental flow allocation and statistics calculator
Konrad, Christopher P.
2011-01-01
The Environmental Flow Allocation and Statistics Calculator (EFASC) is a computer program that calculates hydrologic statistics based on a time series of daily streamflow values. EFASC will calculate statistics for daily streamflow in an input file or will generate synthetic daily flow series from an input file based on rules for allocating and protecting streamflow and then calculate statistics for the synthetic time series. The program reads dates and daily streamflow values from input files. The program writes statistics out to a series of worksheets and text files. Multiple sites can be processed in series as one run. EFASC is written in MicrosoftRegistered Visual BasicCopyright for Applications and implemented as a macro in MicrosoftOffice Excel 2007Registered. EFASC is intended as a research tool for users familiar with computer programming. The code for EFASC is provided so that it can be modified for specific applications. All users should review how output statistics are calculated and recognize that the algorithms may not comply with conventions used to calculate streamflow statistics published by the U.S. Geological Survey.
Matching Theory for Channel Allocation in Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
L. Cao
2016-12-01
Full Text Available For a cognitive radio network (CRN in which a set of secondary users (SUs competes for a limited number of channels (spectrum resources belonging to primary users (PUs, the channel allocation is a challenge and dominates the throughput and congestion of the network. In this paper, the channel allocation problem is first formulated as the 0-1 integer programming optimization, with considering the overall utility both of primary system and secondary system. Inspired by matching theory, a many-to-one matching game is used to remodel the channel allocation problem, and the corresponding PU proposing deferred acceptance (PPDA algorithm is also proposed to yield a stable matching. We compare the performance and computation complexity between these two solutions. Numerical results demonstrate the efficiency and obtain the communication overhead of the proposed scheme.
Multi-robot Task Allocation for Search and Rescue Missions
Hussein, Ahmed; Adel, Mohamed; Bakr, Mohamed; Shehata, Omar M.; Khamis, Alaa
2014-12-01
Many researchers from academia and industry are attracted to investigate how to design and develop robust versatile multi-robot systems by solving a number of challenging and complex problems such as task allocation, group formation, self-organization and much more. In this study, the problem of multi-robot task allocation (MRTA) is tackled. MRTA is the problem of optimally allocating a set of tasks to a group of robots to optimize the overall system performance while being subjected to a set of constraints. A generic market-based approach is proposed in this paper to solve this problem. The efficacy of the proposed approach is quantitatively evaluated through simulation and real experimentation using heterogeneous Khepera-III mobile robots. The results from both simulation and experimentation indicate the high performance of the proposed algorithms and their applicability in search and rescue missions.
Multi-robot Task Allocation for Search and Rescue Missions
International Nuclear Information System (INIS)
Hussein, Ahmed; Adel, Mohamed; Bakr, Mohamed; Shehata, Omar M; Khamis, Alaa
2014-01-01
Many researchers from academia and industry are attracted to investigate how to design and develop robust versatile multi-robot systems by solving a number of challenging and complex problems such as task allocation, group formation, self-organization and much more. In this study, the problem of multi-robot task allocation (MRTA) is tackled. MRTA is the problem of optimally allocating a set of tasks to a group of robots to optimize the overall system performance while being subjected to a set of constraints. A generic market-based approach is proposed in this paper to solve this problem. The efficacy of the proposed approach is quantitatively evaluated through simulation and real experimentation using heterogeneous Khepera-III mobile robots. The results from both simulation and experimentation indicate the high performance of the proposed algorithms and their applicability in search and rescue missions
Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network
Cheung, Kar-Ming; Jennings, Esther H.; Sergui, John S.
2013-01-01
A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of
Cost allocation in distribution planning
Energy Technology Data Exchange (ETDEWEB)
Engevall, S.
1996-12-31
This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the {tau}-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m{sup 3} can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs
Cost allocation in distribution planning
International Nuclear Information System (INIS)
Engevall, S.
1996-01-01
This thesis concerns cost allocation problems in distribution planning. The cost allocation problems we study are illustrated using the distribution planning situation at the Logistics department of Norsk Hydro Olje AB. The planning situation is modeled as a Traveling Salesman Problem and a Vehicle Routing Problem with an inhomogeneous fleet. The cost allocation problems are the problems of how to divide the transportation costs among the customers served in each problem. The cost allocation problems are formulated as cooperative games, in characteristic function form, where the customers are defined to be the players. The games contain five and 21 players respectively. Game theoretical solution concepts such as the core, the nucleolus, the Shapley value and the τ-value are discussed. From the empirical results we can, among other things, conclude that the core of the Traveling Salesman Game is large, and that the core of the Vehicle Routing Game is empty. In the accounting of Norsk Hydro the cost per m 3 can be found for each tour. We conclude that for a certain definition of the characteristic function, a cost allocation according to this principle will not be included in the core of the Traveling Salesman Game. The models and methods presented in this thesis can be applied to transportation problems similar to that of Norsk Hydro, independent of the type of products that are delivered. 96 refs, 11 figs, 26 tabs
Study on bandwidth enhancement techniques of microstrip antenna
Directory of Open Access Journals (Sweden)
Ragab M. Elsagheer
2016-12-01
Full Text Available In this paper we present a Novel Triangular UWB microstrip antenna which offers an ultra-wide bandwidth (UWB greater than 8 GHz. This optimum antenna design provides satisfactory gain all over the UWB. The study includes partially truncating the ground plane (defected ground, inserting slits in the triangular radiating patch, and using different substrate materials in order to obtain band-notched UWB. The simulation experiments have been carried out using the IE3D Zeland software. The final antenna design is fabricated on two substrates; FR4 and Droid 5880 (Teflon. The practical measurements well agree with the simulation results.
An empirical spectral bandwidth model for superior conjunction. [spacecraft communication
Rockwell, R. S.
1978-01-01
The downlink signal from spacecraft in superior solar conjunction phases suffers a great reduction in signal-to-noise ratio. Responsible in large part for this effect is the line broadening of the signal spectrum. An analytic empirical expression was developed for spectral bandwidth as a function of heliocentric distance from 1 to 20 solar radii. The study is based on spectral broadening data obtained from the superior conjunctions of Helios 1 (1975), Helios 2 (1976), and Pioneer 6 (1968). The empirical fit is based in part on a function describing the electron content in the solar corona.
Modulator reliability and bandwidth improvement: replacing tetrodes with MOSFETs
International Nuclear Information System (INIS)
Donaldson, A.R.
1982-01-01
Three types of power MOS field effect transistors were studied with the intent of replacing a parallel pair of vacuum tube tetrodes in a linear modulator. The tetrodes have the shortest lifetimes of any other tubes in the system. The FETs offer definite performance advantages when compared to bipolar transistors and definite cost advantages when compared to vacuum tubes. Replacement of the tetrodes does however require careful consideration of voltage, current and to a lesser extent bandwidth capability in order to enhance overall modulator reliability without compromising present performance
Storage Space Allocation of Inbound Container in Railway Container Terminal
Directory of Open Access Journals (Sweden)
Li Wang
2014-01-01
Full Text Available Efficient storage strategy of railway container terminals is important in balancing resource utilization, reducing waiting time, and improving handling efficiency. In this paper, we consider the formulation and solution algorithm for storage space allocation problem of inbound containers in railway container terminal. The problem is formulated as two-stage optimization models, whose objectives are balancing the workload of inbound containers and reducing the overlapping amounts. An algorithm implement process based on rolling horizon approach is designed to solve the proposed models. Computational experiments on an actual railway container terminal show that the proposed approach is effective to solve space allocation problem of inbound container and is significant for the operation and organization of railway container terminals.
High rate concatenated coding systems using bandwidth efficient trellis inner codes
Deng, Robert H.; Costello, Daniel J., Jr.
1989-05-01
High-rate concatenated coding systems with bandwidth-efficient trellis inner codes and Reed-Solomon (RS) outer codes are investigated for application in high-speed satellite communication systems. Two concatenated coding schemes are proposed. In one the inner code is decoded with soft-decision Viterbi decoding, and the outer RS code performs error-correction-only decoding (decoding without side information). In the other, the inner code is decoded with a modified Viterbi algorithm, which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, whereas branch metrics are used to provide reliability information on the decoded sequence. This information is used to erase unreliable bits in the decoded output. An errors-and-erasures RS decoder is then used for the outer code. The two schemes have been proposed for high-speed data communication on NASA satellite channels. The rates considered are at least double those used in current NASA systems, and the results indicate that high system reliability can still be achieved.
Centralized Allocation in Multiple Markets
DEFF Research Database (Denmark)
Monte, Daniel; Tumennasan, Norovsambuu
The problem of allocating indivisible objects to different agents, where each indi vidual is assigned at most one object, has been widely studied. Pápai (2000) shows that the set of strategy-proof, nonbossy, Pareto optimal and reallocation-proof rules are hierarchical exchange rules | generalizat......The problem of allocating indivisible objects to different agents, where each indi vidual is assigned at most one object, has been widely studied. Pápai (2000) shows that the set of strategy-proof, nonbossy, Pareto optimal and reallocation-proof rules are hierarchical exchange rules...... | generalizations of Gale's Top Trading Cycles mechanism. We study the centralized allocation that takes place in multiple markets. For example, the assignment of multiple types of indivisible objects; or the assignment of objects in successive periods. We show that the set of strategy-proof, Pareto efficient...
Kuznetsova, Olga M; Tymofyeyev, Yevgen
2012-04-13
The demand for unequal allocation in clinical trials is growing. Most commonly, the unequal allocation is achieved through permuted block randomization. However, other allocation procedures might be required to better approximate the allocation ratio in small samples, reduce the selection bias in open-label studies, or balance on baseline covariates. When these allocation procedures are generalized to unequal allocation, special care is to be taken to preserve the allocation ratio at every allocation step. This paper offers a way to expand the biased coin randomization to unequal allocation that preserves the allocation ratio at every allocation. The suggested expansion works with biased coin randomization that balances only on treatment group totals and with covariate-adaptive procedures that use a random biased coin element at every allocation. Balancing properties of the allocation ratio preserving biased coin randomization and minimization are described through simulations. It is demonstrated that these procedures are asymptotically protected against the shift in the rerandomization distribution identified for some examples of minimization with 1:2 allocation. The asymptotic shift in the rerandomization distribution of the difference in treatment means for an arbitrary unequal allocation procedure is explicitly derived in the paper. Copyright © 2011 John Wiley & Sons, Ltd.
Market-based Risk Allocation for Multi-agent Systems
Ono, Masahiro; Williams, Brian Charles
2010-01-01
This paper proposes Market-based Iterative Risk Allocation (MIRA), a new market-based distributed planning algorithm for multi-agent systems under uncertainty. In large coordination problems, from power grid management to multi-vehicle missions, multiple agents act collectively in order to optimize the performance of the system, while satisfying mission constraints. These optimal plans are particularly susceptible to risk when uncertainty is introduced. We present a di...
Mobile devices and computing cloud resources allocation for interactive applications
Directory of Open Access Journals (Sweden)
Krawczyk Henryk
2017-06-01
Full Text Available Using mobile devices such as smartphones or iPads for various interactive applications is currently very common. In the case of complex applications, e.g. chess games, the capabilities of these devices are insufficient to run the application in real time. One of the solutions is to use cloud computing. However, there is an optimization problem of mobile device and cloud resources allocation. An iterative heuristic algorithm for application distribution is proposed. The algorithm minimizes the energy cost of application execution with constrained execution time.
Adaptive dynamic capacity allocation scheme for voice and data transmission
Yu, Yonglin; Wang, Gang; Lei, Daocheng; Ma, Runnian
2011-12-01
Based on the theory of adaptive modulation, the compressed format is introduced in voice and data transmission, and a novel adaptive dynamic capability allocation algorithm is presented. In the given transmission system model, according to the channel state information (CSI) provided by channel estimating, the transmitter can adaptively select the modulation model, and shrink the voice symbol duration to improve the data throughput of data transmission. Simulation results shows that the novel algorithm can effectively evaluate the percentage occupation of data bit in one fame, and improve the data throughput.
A Scratchpad Memory Allocation Scheme for Dataflow Models
2008-08-25
perform via static analysis of C/C++. We use the heterochronous dataflow (HDF) model of computation [16, 39] in Ptolemy II [11] as a means to specify the...buffer data) as the key memory requirements [9]. 4.1 Structure of an HDF Model We use Ptolemy II’s graphical interface and the HDF domain to specify...algorithm. The allocation algorithm was implemented in Ptolemy II [11], a Java-based framework for studying modeling, simulation and design of concurrent
Analisis Efektifitas Bandwidth Menggunakan Ipcop (Studi Kasus : Balai Besar Teknologi Energi
Directory of Open Access Journals (Sweden)
Viva Arifin
2016-03-01
Full Text Available Pada Balai Besar Teknologi Energi (B2TE kerap mengalami masalah koneksi. Masalah koneksi dapat mengganggu jalannya aktifitas komunikasi. Untuk menanggulangi masalah tersebut, maka perlu adanya pengaturan bandwidth. Salah satu pengaturan bandwidth yang dapat menurunkan beban bandwidth adalah menggunakan pemakaian dua jalur modem ADSL. Pada IPCop pembatasan bandwidth menggunakan Advanced Proxy yaitu dengan download throttling. Pada B2TE total bandwidth pada jaringan antarmuka GREEN adalah 2 Mbps, kemudian dibatasi setiap host/pengguna untuk mengunduh adalah 512 Kbps. Begitu juga pada jaringan antarmuka BLUE bandwidth yang disediakan adalah 512 Kbps, dan untuk setiap pengguna dibatasi untuk mengunduh adalah 512 Kbps. Traffic shaping digunakan untuk membatasi kecepatan lajur. Maksimal kecepatan dibatasi hanya sampai 1 Mbps, sedangkan untuk mengundah 512 Kbps. Hal ini untuk mencegah para pengguna mengunduh data secara berlebihan yang mengakibatkan pemborosan bandwidth.
Allocation Problems and Market Design
DEFF Research Database (Denmark)
Smilgins, Aleksandrs
The thesis contains six independent papers with a common theme: Allocation problems and market design. The first paper is concerned with fair allocation of risk capital where independent autonomous subunits have risky activities and together constitute the entity's total risk, whose associated risk......-to-one matching model by including a set of objects, such that a matching consists of two agents from disjoint sets, and an object. Agents' preference lists consist of all possible pairs of objects and agents from the other set, and thus contain important information about agent-object tradeoffs. The notion...
A wide-bandwidth and high-sensitivity robust microgyroscope
International Nuclear Information System (INIS)
Sahin, Korhan; Sahin, Emre; Akin, Tayfun; Alper, Said Emre
2009-01-01
This paper reports a microgyroscope design concept with the help of a 2 degrees of freedom (DoF) sense mode to achieve a wide bandwidth without sacrificing mechanical and electronic sensitivity and to obtain robust operation against variations under ambient conditions. The design concept is demonstrated with a tuning fork microgyroscope fabricated with an in-house silicon-on-glass micromachining process. When the fabricated gyroscope is operated with a relatively wide bandwidth of 1 kHz, measurements show a relatively high raw mechanical sensitivity of 131 µV (° s −1 ) −1 . The variation in the amplified mechanical sensitivity (scale factor) of the gyroscope is measured to be less than 0.38% for large ambient pressure variations such as from 40 to 500 mTorr. The bias instability and angle random walk of the gyroscope are measured to be 131° h −1 and 1.15° h −1/2 , respectively
Multi-Modulator for Bandwidth-Efficient Communication
Gray, Andrew; Lee, Dennis; Lay, Norman; Cheetham, Craig; Fong, Wai; Yeh, Pen-Shu; King, Robin; Ghuman, Parminder; Hoy, Scott; Fisher, Dave
2009-01-01
A modulator circuit board has recently been developed to be used in conjunction with a vector modulator to generate any of a large number of modulations for bandwidth-efficient radio transmission of digital data signals at rates than can exceed 100 Mb/s. The modulations include quadrature phaseshift keying (QPSK), offset quadrature phase-shift keying (OQPSK), Gaussian minimum-shift keying (GMSK), and octonary phase-shift keying (8PSK) with square-root raised-cosine pulse shaping. The figure is a greatly simplified block diagram showing the relationship between the modulator board and the rest of the transmitter. The role of the modulator board is to encode the incoming data stream and to shape the resulting pulses, which are fed as inputs to the vector modulator. The combination of encoding and pulse shaping in a given application is chosen to maximize the bandwidth efficiency. The modulator board includes gallium arsenide serial-to-parallel converters at its input end. A complementary metal oxide/semiconductor (CMOS) field-programmable gate array (FPGA) performs the coding and modulation computations and utilizes parallel processing in doing so. The results of the parallel computation are combined and converted to pulse waveforms by use of gallium arsenide parallel-to-serial converters integrated with digital-to-analog converters. Without changing the hardware, one can configure the modulator to produce any of the designed combinations of coding and modulation by loading the appropriate bit configuration file into the FPGA.
Ionospheric Coherence Bandwidth Measurements in the Lower VHF Frequency Range
Suszcynsky, D. M.; Light, M. E.; Pigue, M. J.
2015-12-01
The United States Department of Energy's Radio Frequency Propagation (RFProp) experiment consists of a satellite-based radio receiver suite to study various aspects of trans-ionospheric signal propagation and detection in four frequency bands, 2 - 55 MHz, 125 - 175 MHz, 365 - 415 MHz and 820 - 1100 MHz. In this paper, we present simultaneous ionospheric coherence bandwidth and S4 scintillation index measurements in the 32 - 44 MHz frequency range collected during the ESCINT equatorial scintillation experiment. 40-MHz continuous wave (CW) and 32 - 44 MHz swept frequency signals were transmitted simultaneously to the RFProp receiver suite from the Reagan Test Site at Kwajalein Atoll in the Marshall Islands (8.7° N, 167.7° E) in three separate campaigns during the 2014 and 2015 equinoxes. Results show coherence bandwidths as small as ~ 1 kHz for strong scintillation (S4 > 0.7) and indicate a high degree of ionospheric variability and irregularity on 10-m spatial scales. Spread-Doppler clutter effects arising from preferential ray paths to the satellite due to refraction off of isolated density irregularities are also observed and are dominant at low elevation angles. The results are compared to previous measurements and available scaling laws.
Bandwidth Extension of Telephone Speech Aided by Data Embedding
Directory of Open Access Journals (Sweden)
David Malah
2007-01-01
Full Text Available A system for bandwidth extension of telephone speech, aided by data embedding, is presented. The proposed system uses the transmitted analog narrowband speech signal as a carrier of the side information needed to carry out the bandwidth extension. The upper band of the wideband speech is reconstructed at the receiving end from two components: a synthetic wideband excitation signal, generated from the narrowband telephone speech and a wideband spectral envelope, parametrically represented and transmitted as embedded data in the telephone speech. We propose a novel data embedding scheme, in which the scalar Costa scheme is combined with an auditory masking model allowing high rate transparent embedding, while maintaining a low bit error rate. The signal is transformed to the frequency domain via the discrete Hartley transform (DHT and is partitioned into subbands. Data is embedded in an adaptively chosen subset of subbands by modifying the DHT coefficients. In our simulations, high quality wideband speech was obtained from speech transmitted over a telephone line (characterized by spectral magnitude distortion, dispersion, and noise, in which side information data is transparently embedded at the rate of 600 information bits/second and with a bit error rate of approximately 3⋅10−4. In a listening test, the reconstructed wideband speech was preferred (at different degrees over conventional telephone speech in 92.5% of the test utterances.
Bandwidth Extension of Telephone Speech Aided by Data Embedding
Directory of Open Access Journals (Sweden)
Sagi Ariel
2007-01-01
Full Text Available A system for bandwidth extension of telephone speech, aided by data embedding, is presented. The proposed system uses the transmitted analog narrowband speech signal as a carrier of the side information needed to carry out the bandwidth extension. The upper band of the wideband speech is reconstructed at the receiving end from two components: a synthetic wideband excitation signal, generated from the narrowband telephone speech and a wideband spectral envelope, parametrically represented and transmitted as embedded data in the telephone speech. We propose a novel data embedding scheme, in which the scalar Costa scheme is combined with an auditory masking model allowing high rate transparent embedding, while maintaining a low bit error rate. The signal is transformed to the frequency domain via the discrete Hartley transform (DHT and is partitioned into subbands. Data is embedded in an adaptively chosen subset of subbands by modifying the DHT coefficients. In our simulations, high quality wideband speech was obtained from speech transmitted over a telephone line (characterized by spectral magnitude distortion, dispersion, and noise, in which side information data is transparently embedded at the rate of 600 information bits/second and with a bit error rate of approximately . In a listening test, the reconstructed wideband speech was preferred (at different degrees over conventional telephone speech in of the test utterances.
Improving microwave antenna gain and bandwidth with phase compensation metasurface
Directory of Open Access Journals (Sweden)
Ke Chen
2015-06-01
Full Text Available Metasurface, as a planar version of artificial metamaterial, provide an effective way to manipulate electromagnetic wave propagation. Here, we present a transparent metasurface for compensating the out-of-phase radiation from a microstrip patch antenna to improve its radiation gain and bandwidth. Based on the equivalence principle of Huygens’ surface, we propose metasurface composed of both inductive and capacitive resonant elements which could produce high transmission with variable phase characteristics. Such metasurface mounted on a patch antenna can transform the spherical-like phase profile generated from the patch into an in-phase planar one. A prototype antenna has been fabricated and validated the squeezed radiation pattern with suppressed sidelobes as well as enhanced impedance bandwidth due to strong near-field coupling. As operating at around 5.7 GHz, the proposed antenna may have potential application in wireless communication systems especially for point-to-point data transmission. It is believed that the design methodology could also be scaled to other frequency bands such as millimeter or terahertz wave.
Practical Approaches to Adaptive Resource Allocation in OFDM Systems
Directory of Open Access Journals (Sweden)
N. Y. Ermolova
2007-11-01
Full Text Available Whenever a communication system operates in a time-frequency dispersive radio channel, the link adaptation provides a benefit in terms of any system performance metric by employing time, frequency, and, in case of multiple users, multiuser diversities. With respect to an orthogonal frequency division multiplexing (OFDM system, link adaptation includes bit, power, and subcarrier allocations. While the well-known water-filling principle provides the optimal solution for both margin-maximization and rate-maximization problems, implementation complexity often makes difficult its application in practical systems. This paper presents a few suboptimal (low-complexity adaptive loading algorithms for both single- and multiuser OFDM systems. We show that the single-user system performance can be improved by suitable power loading and an algorithm based on the incomplete channel state information is derived. At the same time, the power loading in a multiuser system only slightly affects performance while the initial subcarrier allocation has a rather big impact. A number of subcarrier allocation algorithms are discussed and the best one is derived on the basis of the order statistics theory.
TASK ALLOCATION IN GEO-DISTRIBUTATED CYBER-PHYSICAL SYSTEMS
Energy Technology Data Exchange (ETDEWEB)
Aggarwal, Rachel; Smidts, Carol
2017-03-01
This paper studies the task allocation algorithm for a distributed test facility (DTF), which aims to assemble geo-distributed cyber (software) and physical (hardware in the loop components into a prototype cyber-physical system (CPS). This allows low cost testing on an early conceptual prototype (ECP) of the ultimate CPS (UCPS) to be developed. The DTF provides an instrumentation interface for carrying out reliability experiments remotely such as fault propagation analysis and in-situ testing of hardware and software components in a simulated environment. Unfortunately, the geo-distribution introduces an overhead that is not inherent to the UCPS, i.e. a significant time delay in communication that threatens the stability of the ECP and is not an appropriate representation of the behavior of the UCPS. This can be mitigated by implementing a task allocation algorithm to find a suitable configuration and assign the software components to appropriate computational locations, dynamically. This would allow the ECP to operate more efficiently with less probability of being unstable due to the delays introduced by geo-distribution. The task allocation algorithm proposed in this work uses a Monte Carlo approach along with Dynamic Programming to identify the optimal network configuration to keep the time delays to a minimum.
Multidemand Multisource Order Quantity Allocation with Multiple Transportation Alternatives
Directory of Open Access Journals (Sweden)
Jun Gang
2015-01-01
Full Text Available This paper focuses on a multidemand multisource order quantity allocation problem with multiple transportation alternatives. To solve this problem, a bilevel multiobjective programming model under a mixed uncertain environment is proposed. Two levels of decision makers are considered in the model. On the upper level, the purchaser aims to allocate order quantity to multiple suppliers for each demand node with the consideration of three objectives: total purchase cost minimization, total delay risk minimization, and total defect risk minimization. On the lower level, each supplier attempts to optimize the transportation alternatives with total transportation and penalty costs minimization as the objective. In contrast to prior studies, considering the information asymmetry in the bilevel decision, random and fuzzy random variables are used to model uncertain parameters of the construction company and the suppliers. To solve the bilevel model, a solution method based on Kuhn-Tucker conditions, sectional genetic algorithm, and fuzzy random simulation is proposed. Finally, the applicability of the proposed model and algorithm is evaluated through a practical case from a large scale construction project. The results show that the proposed model and algorithm are efficient in dealing with practical order quantity allocation problems.
Practical Approaches to Adaptive Resource Allocation in OFDM Systems
Directory of Open Access Journals (Sweden)
Ermolova NY
2008-01-01
Full Text Available Abstract Whenever a communication system operates in a time-frequency dispersive radio channel, the link adaptation provides a benefit in terms of any system performance metric by employing time, frequency, and, in case of multiple users, multiuser diversities. With respect to an orthogonal frequency division multiplexing (OFDM system, link adaptation includes bit, power, and subcarrier allocations. While the well-known water-filling principle provides the optimal solution for both margin-maximization and rate-maximization problems, implementation complexity often makes difficult its application in practical systems. This paper presents a few suboptimal (low-complexity adaptive loading algorithms for both single- and multiuser OFDM systems. We show that the single-user system performance can be improved by suitable power loading and an algorithm based on the incomplete channel state information is derived. At the same time, the power loading in a multiuser system only slightly affects performance while the initial subcarrier allocation has a rather big impact. A number of subcarrier allocation algorithms are discussed and the best one is derived on the basis of the order statistics theory.
Xie, Zhenwei; Zhu, Qi
2017-01-01
In this study, an optimal power allocation algorithm by maximizing the sum-throughput in energy harvesting cognitive radio networks is proposed. Under the causality constraints of the harvested energy by solar radiation, electromagnetic waves and so on in the two secondary users (SUs), and the interference constraint in the primary user (PU), the sum-throughput maximization problem is formulated. The algorithm decomposes the interference threshold constraint to the power upper bounds of the two SUs. Then, the power allocation problems of the two SUs can be solved by a directional water-filling algorithm (DWA) with the power upper bounds, respectively. The paper gives the algorithm steps and simulation results, and the simulation results verify that the proposed algorithm has obvious advantages over the other two algorithms.
Energy Efficient Multiresource Allocation of Virtual Machine Based on PSO in Cloud Data Center
Directory of Open Access Journals (Sweden)
An-ping Xiong
2014-01-01
Full Text Available Presently, massive energy consumption in cloud data center tends to be an escalating threat to the environment. To reduce energy consumption in cloud data center, an energy efficient virtual machine allocation algorithm is proposed in this paper based on a proposed energy efficient multiresource allocation model and the particle swarm optimization (PSO method. In this algorithm, the fitness function of PSO is defined as the total Euclidean distance to determine the optimal point between resource utilization and energy consumption. This algorithm can avoid falling into local optima which is common in traditional heuristic algorithms. Compared to traditional heuristic algorithms MBFD and MBFH, our algorithm shows significantly energy savings in cloud data center and also makes the utilization of system resources reasonable at the same time.
Research status of multi - robot systems task allocation and uncertainty treatment
Li, Dahui; Fan, Qi; Dai, Xuefeng
2017-08-01
The multi-robot coordination algorithm has become a hot research topic in the field of robotics in recent years. It has a wide range of applications and good application prospects. This paper analyzes and summarizes the current research status of multi-robot coordination algorithms at home and abroad. From task allocation and dealing with uncertainty, this paper discusses the multi-robot coordination algorithm and presents the advantages and disadvantages of each method commonly used.
Regulating nutrient allocation in plants
Udvardi, Michael; Yang, Jiading; Worley, Eric
2014-12-09
The invention provides coding and promoter sequences for a VS-1 and AP-2 gene, which affects the developmental process of senescence in plants. Vectors, transgenic plants, seeds, and host cells comprising heterologous VS-1 and AP-2 genes are also provided. Additionally provided are methods of altering nutrient allocation and composition in a plant using the VS-1 and AP-2 genes.
Operational risk economic capital allocation
Nikonov, Oleg I.; Vlasov, Vladimir E.; Medvedeva, Marina A.
2013-10-01
In the paper we describe a model of operational risk of economic capital estimation and allocation based on Loss Distribution Approach (LDA). Bank's total losses are modeled through Monte-Carlo simulations of its business units' losses. It allows to fairly distributing the corresponding capital between business units in order to assess and manage their risk adjusted performance.
Planning and Resource Allocation Management.
Coleman, Jack W.
1986-01-01
Modern scientific management techniques provide college administrators with valuable planning and resource allocation insights and enhances the decision process. The planning model should incorporate assessment, strategic planning, dynamic and long-term budgeting, operational planning, and feedback and control for actual operations. (MSE)
Designing for dynamic task allocation
Dongen, C.J.G. van; Maanen, P.P. van
2005-01-01
Future platforms are envisioned in which human-machine teams are able to share and trade tasks as demands in situations change. It seems that human-machine coordination has not received the attention it deserves by past and present approaches to task allocation. In this paper a simple way to make
Governance and Foreign Aid Allocation
2006-07-01
In addition, this chapter develops a microeconomic model to explore donors’ aid allocation decisions and their potential impact on aid effectiveness...the promotion of market-based principles to restructure macroeconomic policies in developing countries. The greater focus on...be explained by successful development 29 efforts of number of countries in the region, such as Republic of Korea, Malaysia , Singapore, and Peoples
Joux, Antoine
2009-01-01
Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic
Land use allocation model considering climate change impact
Lee, D. K.; Yoon, E. J.; Song, Y. I.
2017-12-01
In Korea, climate change adaptation plans are being developed for each administrative district based on impact assessments constructed in various fields. This climate change impact assessments are superimposed on the actual space, which causes problems in land use allocation because the spatial distribution of individual impacts may be different each other. This implies that trade-offs between climate change impacts can occur depending on the composition of land use. Moreover, the actual space is complexly intertwined with various factors such as required area, legal regulations, and socioeconomic values, so land use allocation in consideration of climate change can be very difficult problem to solve (Liu et al. 2012; Porta et al. 2013).Optimization techniques can generate a sufficiently good alternatives for land use allocation at the strategic level if only the fitness function of relationship between impact and land use composition are derived. It has also been noted that land use optimization model is more effective than the scenario-based prediction model in achieving the objectives for problem solving (Zhang et al. 2014). Therefore in this study, we developed a quantitative tool, MOGA (Multi Objective Genetic Algorithm), which can generate a comprehensive land use allocations considering various climate change impacts, and apply it to the Gangwon-do in Korea. Genetic Algorithms (GAs) are the most popular optimization technique to address multi-objective in land use allocation. Also, it allows for immediate feedback to stake holders because it can run a number of experiments with different parameter values. And it is expected that land use decision makers and planners can formulate a detailed spatial plan or perform additional analysis based on the result of optimization model. Acknowledgments: This work was supported by the Korea Ministry of Environment (MOE) as "Climate Change Correspondence Program (Project number: 2014001310006)"
Impedance Bandwidth and Gain Improvement for Microstrip Antenna Using Metamaterials
Directory of Open Access Journals (Sweden)
H. Xiong
2012-12-01
Full Text Available An improved ultra-wideband (UWB and high gain rectangular antenna is specifically designed in this paper using planar-patterned metamaterial concepts. The antenna has isolated triangle gaps and crossed gaps etched on the metal patch and ground plane, respectively. By changing the pattern on the ground, the impedance matching characteristics of the antenna are much better. The -10 dB impedance bandwidth of the proposed antenna is 3.85–15.62 GHz, which is about 267% broader. The proposed antenna has an average gain of 5.42 dB and the peak is 8.36 dB at 13.5 GHz. Compared with the original one, the gain of the proposed antenna improved about 1.4 dB. Moreover, the size is reduced slightly. Simulated and experimental results obtained for this antenna show that it exhibits good radiation behavior within the UWB frequency range
Adaptive slope compensation for high bandwidth digital current mode controller
DEFF Research Database (Denmark)
Taeed, Fazel; Nymand, Morten
2015-01-01
An adaptive slope compensation method for digital current mode control of dc-dc converters is proposed in this paper. The compensation slope is used for stabilizing the inner current loop in peak current mode control. In this method, the compensation slope is adapted with the variations...... in converter duty cycle. The adaptive slope compensation provides optimum controller operation in term of bandwidth over wide range of operating points. In this paper operation principle of the controller is discussed. The proposed controller is implemented in an FPGA to control a 100 W buck converter....... The experimental results of measured loop-gain at different operating points are presented to validate the theoretical performance of the controller....
Description of a New 400MHz Bandwidth Chirp Transform Spectrometer
Paganini, Lucas; Hartogh, Paul
A new chirp transform spectrometer (CTS) with a bandwidth of 400MHz and a spectral resolution of 100 kHz has been developed. The CTS is deviced using a digital chirp generator and a preprocessing unit based on a Complementary Metal Oxide Semiconductor (CMOS) and an Application-Specific Integrated Circuit (ASIC). A build in PC 104 computer handles the process control and the external communication via Ethernet and a Transistor-Transistor Logic (TTL) interface. The CTS has been applied to atmospheric science, i.e., a 25-K noise temperature, 22-GHz water vapor, and a 142-GHz ozone system. Astronomical observations have been performed using the Heinrich Hertz submillimeter telescope. In this paper, we describe the function of the CTS and provide information about its functional performance.
Very low bandwidth, unattended imager for surveillance applications
Energy Technology Data Exchange (ETDEWEB)
Eichel, P.H.; Jakowatz, C.V. Jr.
1986-01-01
The need arises in certain vehicular surveillance applications for an electronic imager that can perform without human interaction and can transmit definitive images over very low bandwidth channels. The investigators have found that line scan imagers offer particular advantages toward these ends. Specifically, the use of a line scan imager facilitates the following processing steps: (1) segmentation of the vehicle from the background, (2) automatic exposure control, (3) light level equalization prior to quantization, and (4) implementation of an adaptive sampling scheme. These processing steps together with the source encoder may be implemented on a relatively low throughput processor and achieve near real time operation. The specific encoding method used here is an extended differential pulse code modulation (DPCM). A prototype system has been developed, producing medium resolution images at less than 10K bits per frame.
Graphene metascreen for designing compact infrared absorbers with enhanced bandwidth
Chen, Pai-Yen
2015-03-31
We propose a compact, wideband terahertz and infrared absorber, comprising a patterned graphene sheet on a thin metal-backed dielectric slab. This graphene-based nanostructure can achieve a low or negative effective permeability, necessary for realizing the perfect absorption. The dual-reactive property found in both the plasmonic graphene sheet and the grounded highpermittivity slab introduces extra poles into the equivalent circuit model of the system, thereby resulting in a dual-band or broadband magnetic resonance that enhances the absorption bandwidth. More interestingly, the two-dimensional patterned graphene sheet significantly simplifies the design and fabrication processes for achieving resonant magnetic response, and allows the frequency-reconfigurable operation via electrostatic gating.
Ultrawide Bandwidth Receiver Based on a Multivariate Generalized Gaussian Distribution
Ahmed, Qasim Zeeshan
2015-04-01
Multivariate generalized Gaussian density (MGGD) is used to approximate the multiple access interference (MAI) and additive white Gaussian noise in pulse-based ultrawide bandwidth (UWB) system. The MGGD probability density function (pdf) is shown to be a better approximation of a UWB system as compared to multivariate Gaussian, multivariate Laplacian and multivariate Gaussian-Laplacian mixture (GLM). The similarity between the simulated and the approximated pdf is measured with the help of modified Kullback-Leibler distance (KLD). It is also shown that MGGD has the smallest KLD as compared to Gaussian, Laplacian and GLM densities. A receiver based on the principles of minimum bit error rate is designed for the MGGD pdf. As the requirement is stringent, the adaptive implementation of the receiver is also carried out in this paper. Training sequence of the desired user is the only requirement when implementing the detector adaptively. © 2002-2012 IEEE.
Fibre Bragg grating based accelerometer with extended bandwidth
International Nuclear Information System (INIS)
Basumallick, Nandini; Biswas, Palas; Dasgupta, Kamal; Bandyopadhyay, Somnath; Chakraborty, Rajib; Chakraborty, Sushanta
2016-01-01
We have shown experimentally that the operable bandwidth of a fibre Bragg grating (FBG) based accelerometer can be extended significantly, without compromising its sensitivity, using a post-signal processing technique which involves frequency domain weighting. It has been demonstrated that using the above technique acceleration can be correctly interpreted even when the operating frequency encroaches on the region where the frequency response of the sensor is non-uniform. Two different excitation signals, which we often encounter in structural health monitoring applications, e.g. (i) a signal composed of multi-frequency components and (ii) a sinusoidal excitation with a frequency sweep, have been considered in our experiment. The results obtained have been compared with a piezo accelerometer. (paper)
Development of high frequency and wide bandwidth Johnson noise thermometry
International Nuclear Information System (INIS)
Crossno, Jesse; Liu, Xiaomeng; Kim, Philip; Ohki, Thomas A.; Fong, Kin Chung
2015-01-01
We develop a high frequency, wide bandwidth radiometer operating at room temperature, which augments the traditional technique of Johnson noise thermometry for nanoscale thermal transport studies. Employing low noise amplifiers and an analog multiplier operating at 2 GHz, auto- and cross-correlated Johnson noise measurements are performed in the temperature range of 3 to 300 K, achieving a sensitivity of 5.5 mK (110 ppm) in 1 s of integration time. This setup allows us to measure the thermal conductance of a boron nitride encapsulated monolayer graphene device over a wide temperature range. Our data show a high power law (T ∼ 4) deviation from the Wiedemann-Franz law above T ∼ 100 K
Hougardy, Stefan
2016-01-01
Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.
Bit Loading Algorithms for Cooperative OFDM Systems
Directory of Open Access Journals (Sweden)
Gui Bo
2008-01-01
Full Text Available Abstract We investigate the resource allocation problem for an OFDM cooperative network with a single source-destination pair and multiple relays. Assuming knowledge of the instantaneous channel gains for all links in the entire network, we propose several bit and power allocation schemes aiming at minimizing the total transmission power under a target rate constraint. First, an optimal and efficient bit loading algorithm is proposed when the relay node uses the same subchannel to relay the information transmitted by the source node. To further improve the performance gain, subchannel permutation, in which the subchannels are reallocated at relay nodes, is considered. An optimal subchannel permutation algorithm is first proposed and then an efficient suboptimal algorithm is considered to achieve a better complexity-performance tradeoff. A distributed bit loading algorithm is also proposed for ad hoc networks. Simulation results show that significant performance gains can be achieved by the proposed bit loading algorithms, especially when subchannel permutation is employed.
Tel, G.
We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of
Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations
Tenenbaum, Adam J.; Adve, Raviraj S.
2009-01-01
In the multiuser downlink, power allocation for linear precoders that minimize the sum of mean squared errors under a sum power constraint is a non-convex problem. Many existing algorithms solve an equivalent convex problem in the virtual uplink and apply a transformation based on uplink-downlink duality to find a downlink solution. In this letter, we analyze the optimality criteria for the power allocation subproblem in the virtual uplink, and demonstrate that the optimal solution leads to i...
Park, Kihong
2011-12-01
We consider optical wireless communication which can be utilized for illumination and communication by relying on lighting devices. Due to the limited bandwidth of optical sources, it is challenging to achieve high data rate in optical wireless systems. In order to obtain a multiplexing gain and high spectral efficiency, we design an optical multi-input multi-output (MIMO) system utilizing a singular value decomposition-based spatial multiplexing and adaptive modulation. We note that the conventional allocation method in radio frequency MIMO channels cannot be applied directly to the optical intensity channels. In this paper, we generalize the result of power allocation method in [1] for arbitrary number of transmit and receive antennas in optical wireless MIMO systems. Based on three constraints, namely, the nonnegativity, the aggregate optical power, and the bit error rate requirement, we propose a novel method to allocate the optical power, the offset value, and the modulation size for maximum sum rate. From some selected simulation results, we show that our proposed allocation method gives a better spectral efficiency than the method that allocates the optical power equally for each data stream. © 2011 IEEE.
High-Bandwidth Photon-Counting Detectors with Enhanced Near-Infrared Response Project
National Aeronautics and Space Administration — Long-range optical telecommunications (LROT) impose challenging requirements on detector array sensitivity at 1064nm and arrays timing bandwidth. Large photonic...
Bandwidth tunable microwave photonic filter based on digital and analog modulation
Zhang, Qi; Zhang, Jie; Li, Qiang; Wang, Yubing; Sun, Xian; Dong, Wei; Zhang, Xindong
2018-05-01
A bandwidth tunable microwave photonic filter based on digital and analog modulation is proposed and experimentally demonstrated. The digital modulation is used to broaden the effective gain spectrum and the analog modulation is to get optical lines. By changing the symbol rate of data pattern, the bandwidth is tunable from 50 MHz to 700 MHz. The interval of optical lines is set according to the bandwidth of gain spectrum which is related to the symbol rate. Several times of bandwidth increase are achieved compared to a single analog modulation and the selectivity of the response is increased by 3.7 dB compared to a single digital modulation.
Bandwidth-adaptable silicon photonic differentiator employing a slow light effect
DEFF Research Database (Denmark)
Yan, Siqi; Cheng, Ziwei; Frandsen, Lars Hagedorn
2017-01-01
A photonic differentiator (DIFF) plays a crucial role in photonic circuits. Despite the fact that a DIFF having a tera-hertz bandwidth has been reported, the practical bandwidth is limited to being a bandpass response. In this Letter, we propose the concept of a bandwidth-adaptable DIFF, which...... exploits the slow light effect in a photonic crystal waveguide (PhCW) to overcome the inherent bandwidth limitation of current photonic DIFFs. We fabricated a PhCW Mach-Zehnder interferometer (PhCW-MZI) on the silicon-onisolator material platform to validate our concept. Input Gaussian pulses with full...
Multi-Robot Dynamic Task Allocation Using Modified Ant Colony System
Xu, Zhenzhen; Xia, Feng; Zhang, Xianchao
This paper presents a dynamic task allocation algorithm for multiple robots to visit multiple targets. This algorithm is specifically designed for the environment where robots have dissimilar starting and ending locations. And the constraint of balancing the number of targets visited by each robot is considered. More importantly, this paper takes into account the dynamicity of multi-robot system and the obstacles in the environment. This problem is modeled as a constrained MTSP which can not be transformed to TSP and can not be solved by classical Ant Colony System (ACS). The Modified Ant Colony System (MACS) is presented to solve this problem and the unvisited targets are allocated to appropriate robots dynamically. The simulation results show that the output of the proposed algorithm can satisfy the constraints and dynamicity for the problem of multi-robot task allocation.
Directory of Open Access Journals (Sweden)
Mingjie Feng
2015-02-01
Full Text Available In this paper, we aim to maximize the sum rate of a full-duplex cognitive femtocell network (FDCFN as well as guaranteeing the quality of service (QoS of users in the form of a required signal to interference plus noise ratios (SINR. We first consider the case of a pair of channels, and develop optimum-achieving power control solutions. Then, for the case of multiple channels, we formulate joint duplex model selection, power control, and channel allocation as a mixed integer nonlinear problem (MINLP, and propose an iterative framework to solve it. The proposed iterative framework consists of a duplex mode selection scheme, a near-optimal distributed power control algorithm, and a greedy channel allocation algorithm. We prove the convergence of the proposed iterative framework as well as a lower bound for the greedy channel allocation algorithm. Numerical results show that the proposed schemes effectively improve the sum rate of FDCFNs.
Scaling Mesa Indium Phosphide DHBTs to Record Bandwidths
Lobisser, Evan
Indium phosphide heterojunction bipolar transistors are able to achieve higher bandwidths at a given feature size than transistors in the Silicon material system for a given feature size. Indium phosphide bipolar transistors demonstrate higher breakdown voltages at a given bandwidth than both Si bipolars and field effect transistors in the InP material system. The high bandwidth of InP HBTs results from both intrinsic material parameters and bandgap engineering through epitaxial growth. The electron mobility in the InGaAs base and saturation velocity in the InP collector are both approximately three times higher than their counterparts in the SiGe material system. Resistance of the base can be made very low due to the large offset in the valence band between the InP emitter and the InGaAs base, which allows the base to be doped on the order of 1020 cm-3 with negligible reduction in emitter injection efficiency. This thesis deals with type-I, NPN dual-heterojunction bipolar transistors. The emitters are InP, and the base is InGaAs. There is a thin (˜ 10 nm) n-type InGaAs "setback" region, followed by a chirped superlattice InGaAs/InAlAs grade to the InP collector. The setback, grade, and collector are all lightly doped n-type. The emitter and collector are contacted through thin (˜ 5 nm) heavily doped n-type InGaAs layers to reduce contact resistivity. The primary focus of this work is increasing the bandwidth of InP HBTs through the proportional scaling of the device dimensions, both layer thicknesses and junction areas, as well as the reduction of the contact resistivities associated with the transistor. Essentially, all RC time constants and transit times must be reduced by a factor of two to double a transistor's bandwidth. Chapter 2 describes in detail the scaling laws and design principles for high frequency bipolar transistor design. A low-stress, blanket sputter deposited composite emitter metal process was developed. Refractory metal base contacts were
Schwind, Michael; Fandel, G
2007-01-01
Many firms provide their customers with online information products which require limited resources such as server capacity. This book develops allocation mechanisms that aim to ensure an efficient resource allocation in modern IT-services. Recent methods of artificial intelligence, such as neural networks and reinforcement learning, and nature-oriented optimization methods, such as genetic algorithms and simulated annealing, are advanced and applied to allocation processes in distributed IT-infrastructures, e.g. grid systems. The author presents two methods, both of which using the users??? w
Power Allocation and Outage Probability Analysis for SDN-based Radio Access Networks
Zhao, Yongxu; Chen, Yueyun; Mai, Zhiyuan
2018-01-01
In this paper, performance of Access network Architecture based SDN (Software Defined Network) is analyzed with respect to the power allocation issue. A power allocation scheme PSO-PA (Particle Swarm Optimization-power allocation) algorithm is proposed, the proposed scheme is subjected to constant total power with the objective of minimizing system outage probability. The entire access network resource configuration is controlled by the SDN controller, then it sends the optimized power distribution factor to the base station source node (SN) and the relay node (RN). Simulation results show that the proposed scheme reduces the system outage probability at a low complexity.
New resource allocation scheme for cognitive relay networks with opportunistic access
Zafar, Ammar
2012-06-01
In this paper, a new resource allocation scheme to minimize Symbol Error rate (SER) for relay assisted cognitive radio networks is studied. A cognitive relay network with amplify-and-forward (AF) fixed gain relays and opportunistic access to the licensed spectrum is considered. The SER objective function and the optimization constraints are derived first. The resource allocation algorithm is then derived using the Langrangian multiplier method. Closed form expressions are derived for the source and relay powers and, symbol time. Analytical results show that the optimal power allocation follows an extended water-filling solution. © 2012 IEEE.
Energy-Efficient Power Allocation of Cognitive Radio Systems without CSI at the Transmitter
Sboui, Lokman
2015-01-07
Two major issues are facing today’s wireless communications evolution: -Spectrum scarcity: Need for more bandwidth. As a solution, the Cognitive Radio (CR) paradigm, where secondary users (unlicensed) share the spectrum with licensed users, was introduced. -Energy consumption and CO2 emission: The ICT produce 2% of global CO2 emission (equivalent to the aviation industry emission). The cellular networks produces 0.2%. As solution energy efficient systems should be designed rather than traditional spectral efficient systems. In this work, we aim to determine the optimal energy efficient power allocation of CR when the channel state information at the transmitter CSI-T is not available.
Somers, Ben; Bertrand, Alexander
2016-12-01
Chronic, 24/7 EEG monitoring requires the use of highly miniaturized EEG modules, which only measure a few EEG channels over a small area. For improved spatial coverage, a wireless EEG sensor network (WESN) can be deployed, consisting of multiple EEG modules, which interact through short-distance wireless communication. In this paper, we aim to remove eye blink artifacts in each EEG channel of a WESN by optimally exploiting the correlation between EEG signals from different modules, under stringent communication bandwidth constraints. We apply a distributed canonical correlation analysis (CCA-)based algorithm, in which each module only transmits an optimal linear combination of its local EEG channels to the other modules. The method is validated on both synthetic and real EEG data sets, with emulated wireless transmissions. While strongly reducing the amount of data that is shared between nodes, we demonstrate that the algorithm achieves the same eye blink artifact removal performance as the equivalent centralized CCA algorithm, which is at least as good as other state-of-the-art multi-channel algorithms that require a transmission of all channels. Due to their potential for extreme miniaturization, WESNs are viewed as an enabling technology for chronic EEG monitoring. However, multi-channel analysis is hampered in WESNs due to the high energy cost for wireless communication. This paper shows that multi-channel eye blink artifact removal is possible with a significantly reduced wireless communication between EEG modules.
Radio Resource Allocation on Complex 4G Wireless Cellular Networks
Psannis, Kostas E.
2015-09-01
In this article we consider the heuristic algorithm which improves step by step wireless data delivery over LTE cellular networks by using the total transmit power with the constraint on users’ data rates, and the total throughput with the constraints on the total transmit power as well as users’ data rates, which are jointly integrated into a hybrid-layer design framework to perform radio resource allocation for multiple users, and to effectively decide the optimal system parameter such as modulation and coding scheme (MCS) in order to adapt to the varying channel quality. We propose new heuristic algorithm which balances the accessible data rate, the initial data rates of each user allocated by LTE scheduler, the priority indicator which signals delay- throughput- packet loss awareness of the user, and the buffer fullness by achieving maximization of radio resource allocation for multiple users. It is noted that the overall performance is improved with the increase in the number of users, due to multiuser diversity. Experimental results illustrate and validate the accuracy of the proposed methodology.
Energy-Efficient Power Allocation for MIMO-SVD Systems
Sboui, Lokman
2017-05-24
In this paper, we address the problem of energyefficient power allocation in MIMO systems. In fact, the widely adopted water-filling power allocation does not ensure the maximization of the energy efficiency (EE). Since the EE maximization is a non-convex problem, numerical methods based on fractional programming were introduced to find the optimal power solutions. In this paper, we present a novel and simple power allocation scheme based on the explicit expressions of the optimal power. We also present a low-complexity algorithm that complements the proposed scheme for low circuit-power regime. Furthermore, we analyze power-constrained and rate-constrained systems and present the corresponding optimal power control. In the numerical results, we show that the presented analytical expressions are accurate and that the algorithm converges within two iterations. We also show that as the number of antenna increases, the system becomes more energy-efficient. Also, a saturation of the EE is observed at high power budget and low minimal rate regimes.
Dynamic Resource Allocation in Hybrid Access Femtocell Network
Directory of Open Access Journals (Sweden)
Afaz Uddin Ahmed
2014-01-01
Full Text Available Intercell interference is one of the most challenging issues in femtocell deployment under the coverage of existing macrocell. Allocation of resources between femtocell and macrocell is essential to counter the effects of interference in dense femtocell networks. Advances in resource management strategies have improved the control mechanism for interference reduction at lower node density, but most of them are ineffective at higher node density. In this paper, a dynamic resource allocation management algorithm (DRAMA for spectrum shared hybrid access OFDMA femtocell network is proposed. To reduce the macro-femto-tier interference and to improve the quality of service, the proposed algorithm features a dynamic resource allocation scheme by controlling them both centrally and locally. The proposed scheme focuses on Femtocell Access Point (FAP owners’ satisfaction and allows maximum utilization of available resources based on congestion in the network. A simulation environment is developed to study the quantitative performance of DRAMA in hybrid access-control femtocell network and compare it to closed and open access mechanisms. The performance analysis shows that higher number of random users gets connected to the FAP without compromising FAP owners’ satisfaction allowing the macrocell to offload a large number of users in a dense heterogeneous network.
Integer Programming Models for Sales Resource Allocation
Andris A. Zoltners; Prabhakant Sinha
1980-01-01
A practical conceptual framework for sales resource allocation modeling is presented in this paper. A literature review of sales resource allocation models is described in terms of this framework. The conceptual framework also lends itself to several integer programming models which may be used to address the variety of sales resource allocation decisions faced by every sales organization. A general model for sales resource allocation is developed which incorporates multiple sales resources, ...
Vannacci, E; Granchi, S; Belsito, L; Roncaglia, A; Biagi, E
2017-03-01
An ultrasonic probe consisting of two optical fiber-based miniaturized transducers for wideband ultrasound emission and detection is employed for the characterization of in vitro biological tissues. In the probe, ultrasound generation is obtained by thermoelastic emission from patterned carbon films in Micro-Opto-Mechanical-System (MOMS) devices mounted on the tip of an optical fiber, whereas acousto-optical detection is performed in a similar way by a miniaturized polymeric interferometer. The microprobe presents a wide, flat bandwidth that is a very attractive feature for ultrasonic investigation, especially for tissue characterization. Thanks to the very high ultrasonic frequencies obtained, the probe is able to reveal different details of the object under investigation by analyzing the ultrasonic signal within different frequencies ranges, as shown by specific experiments performed on a patterned cornstarch flour sample in vitro. This is confirmed by measurements executed to determine the lateral resolution of the microprobe at different frequencies of about 70μm at 120MHz. Moreover, measurements performed with the wideband probe in pulsed-echo mode on a histological finding of porcine kidney are presented, on which two different spectral signal processing algorithms are applied. After processing, the ultrasonic spectral features show a peculiar spatial distribution on the sample, which is expected to depend on different ultrasonic backscattering properties of the analyzed tissues. Copyright © 2016 Elsevier B.V. All rights reserved.
Analysis and development of a wide-bandwidth gravitational wave detector
International Nuclear Information System (INIS)
Pang, Yi.
1990-01-01
The theory and design of multi-mode bar detectors of gravitational waves and the construction and test of a five-mode system are discussed. The theory includes the calculation of the energy absorbed from a pulse of gravitational radiation, the calculation of the energy transfer from the bar antenna to the electromechanical transducer, the detector noise analysis, and an algorithm for the design of the optimum filter for gravitational signal retrieval. Design and construction efforts were focussed on a five-mode system. The use of finite element methods (FEM's), computer-aided design (CAD), and results from tests on a 10 g niobium resonator in the design of multi-mode systems and in the construction of a specific five-mode system. The results of tests of that five-mode system carried at room temperature are given. The energy transfer from the bar to the fifth resonator is determined to be high (67 percent) and completed within 4.6 ms, which leads to an effective detector bandwidth of approximately 500 Hz
Directory of Open Access Journals (Sweden)
A. Neumann
2010-08-01
Full Text Available Many proposals for next generation light sources based on single pass free electron lasers or energy recovery linac facilities require a continuous wave (cw driven superconducting linac. The effective beam loading in such machines is very small and in principle the cavities can be operated at a bandwidth of a few Hz and with less than a few kW of rf power. However, a power reserve is required to ensure field stability. A major error source is the mechanical microphonics detuning of the niobium cavities. To understand the influence of cavity detuning on longitudinal beam stability, a measurement program has been started at the horizontal cavity test facility HoBiCaT at HZB to study TESLA-type cavities. The microphonics detuning spectral content, peak detuning values, and the driving terms for these mechanical oscillations have been analyzed. In combination with the characterization of cw-adapted fast tuning systems based on the piezoelectric effect this information has been used to design a detuning compensation algorithm. It has been shown that a compensation factor between 2–7 is achievable, reducing the typical detuning of 2–3 Hz rms to below 0.5 Hz rms. These results were included in rf-control simulations of the cavities, and it was demonstrated that a phase stability below 0.02° can be achieved.
Review of the convolution algorithm for evaluating service integrated systems
DEFF Research Database (Denmark)
Iversen, Villy Bæk
1997-01-01
In this paper we give a review of the applicability of the convolution algorithm. By this we are able to evaluate communication networks end--to--end with e.g. BPP multi-ratetraffic models insensitive to the holding time distribution. Rearrangement, minimum allocation, and maximum allocation...
Intelligent tactical asset allocation support system
Hiemstra, Y.
1995-01-01
This paper presents an advanced support system for Tactical Asset Allocation. Asset allocation explains over 90% of portfolio performance (Brinson, Hood and Beebower, 1988). Tactical asset allocation adjusts a strategic portfolio on the basis of short term market outlooks. The system includes
Named Entity Linking Algorithm
Directory of Open Access Journals (Sweden)
M. F. Panteleev
2017-01-01
Full Text Available In the tasks of processing text in natural language, Named Entity Linking (NEL represents the task to define and link some entity, which is found in the text, with some entity in the knowledge base (for example, Dbpedia. Currently, there is a diversity of approaches to solve this problem, but two main classes can be identified: graph-based approaches and machine learning-based ones. Graph and Machine Learning approaches-based algorithm is proposed accordingly to the stated assumptions about the interrelations of named entities in a sentence and in general.In the case of graph-based approaches, it is necessary to solve the problem of identifying an optimal set of the related entities according to some metric that characterizes the distance between these entities in a graph built on some knowledge base. Due to limitations in processing power, to solve this task directly is impossible. Therefore, its modification is proposed. Based on the algorithms of machine learning, an independent solution cannot be built due to small volumes of training datasets relevant to NEL task. However, their use can contribute to improving the quality of the algorithm. The adaptation of the Latent Dirichlet Allocation model is proposed in order to obtain a measure of the compatibility of attributes of various entities encountered in one context.The efficiency of the proposed algorithm was experimentally tested. A test dataset was independently generated. On its basis the performance of the model was compared using the proposed algorithm with the open source product DBpedia Spotlight, which solves the NEL problem.The mockup, based on the proposed algorithm, showed a low speed as compared to DBpedia Spotlight. However, the fact that it has shown higher accuracy, stipulates the prospects for work in this direction.The main directions of development were proposed in order to increase the accuracy of the system and its productivity.
An algorithm for link restoration in wavwlength translating networks
DEFF Research Database (Denmark)
Limal, Emmanuel; Gliese, Ulrik Bo
1999-01-01
We propose the BONRA, a new and innovative algorithm for dynamic allocation of working and spare channel capacity for single link restoration in wavelength translating optical networks. The BONRA has very low calculation complexity yet gives high capacity utilisation.......We propose the BONRA, a new and innovative algorithm for dynamic allocation of working and spare channel capacity for single link restoration in wavelength translating optical networks. The BONRA has very low calculation complexity yet gives high capacity utilisation....
Relay selection and resource allocation for two-way DF-AF cognitive radio networks
Alsharoa, Ahmad M.
2013-08-01
In this letter, the problem of relay selection and optimal resource allocation for two-way relaying cognitive radio networks using half duplex amplify-and-forward and decode-and-forward protocols is investigated. The primary and secondary users are assumed to access the spectrum simultaneously, in a way that the interference introduced to the primary users should be below a certain tolerated limit. Dual decomposition and subgradient methods are used to find the optimal power allocation. A suboptimal approach based on a genetic algorithm is also presented. Simulation results show that the proposed suboptimal algorithm offers a performance close to the optimal performance with a considerable complexity saving. © 2013 IEEE.
Location-based resource allocation for OFDMA cognitive radio systems
Nam, Haewoon
2010-01-01
In cognitive radio systems, in order for the secondary users to opportunistically share the spectrum without interfering the primary users, an accurate spectrum measurement and a precise estimation of the interference at the primary users are necessary but are challenging tasks. Since it is impractical in cognitive radio systems to assume that the channel state information of the interference link is available at the cognitive transmitter, the interference at the primary users is hard to be estimated accurately. This paper introduces a resource allocation algorithm for OFDMA-based cognitive radio systems, which utilizes location information of the primary and secondary users instead of the channel state information of the interference link. Simulation results show that it is indeed effective to incorporate location information into resource allocation so that a near-optimal capacity is achieved.
High Bandwidth Short Stroke Rotary Fast Tool Servo
Energy Technology Data Exchange (ETDEWEB)
Montesanti, R C; Trumper, D L
2003-08-22
This paper presents the design and performance of a new rotary fast tool servo (FTS) capable of developing the 40 g's tool tip acceleration required to follow a 5 micron PV sinusoidal surface at 2 kHz with a planned accuracy of 50 nm, and having a full stroke of 50 micron PV at lower frequencies. Tests with de-rated power supplies have demonstrated a closed-loop unity-gain bandwidth of 2 kHz with 20 g's tool acceleration, and we expect to achieve 40 g's with supplies providing {+-} 16 Amp to the Lorentz force actuator. The use of a fast tool servo with a diamond turning machine for producing non-axisymmetric or textured surfaces on a workpiece is well known. Our new rotary FTS was designed to specifically accommodate fabricating prescription textured surfaces on 5 mm diameter spherical target components for High Energy Density Physics experiments on the National Ignition Facility Laser (NIF).
Social value of high bandwidth networks: creative performance and education.
Mansell, Robin; Foresta, Don
2016-03-06
This paper considers limitations of existing network technologies for distributed theatrical performance in the creative arts and for symmetrical real-time interaction in online learning environments. It examines the experience of a multidisciplinary research consortium that aimed to introduce a solution to latency and other network problems experienced by users in these sectors. The solution builds on the Multicast protocol, Access Grid, an environment supported by very high bandwidth networks. The solution is intended to offer high-quality image and sound, interaction with other network platforms, maximum user control of multipoint transmissions, and open programming tools that are flexible and modifiable for specific uses. A case study is presented drawing upon an extended period of participant observation by the authors. This provides a basis for an examination of the challenges of promoting technological innovation in a multidisciplinary project. We highlight the kinds of technical advances and cultural and organizational changes that would be required to meet demanding quality standards, the way a research consortium planned to engage in experimentation and learning, and factors making it difficult to achieve an open platform that is responsive to the needs of users in the creative arts and education sectors. © 2016 The Author(s).
Review of single transient oscillographic recorders with gigahertz bandwidth
International Nuclear Information System (INIS)
Campbell, D.E.
1982-01-01
In laser driven inertial confinement fusion research, at Livermore, we are diagnosing many phenomena that occur in a time frame that exceeds the capabilities of even the most advanced, present day oscillographic recording instruments. Many of the by-products of the interaction between the laser beam and fuel pellet are monitored to determine the specifics of the fusion process. By the use of appropriate detectors, we convert the information contained in the radiated by-products to electrical signals which are recorded on high bandwidth oscillographic recorders. Our present range of recording capabilities for one x-ray diagnostic measurement in use at Livermore is shown. A commonly used configuration consists of an XRD-31 x-ray detector connected to a direct access Tektronix R7912 transient digitizer using 1/2 in. diameter air dielectric coaxial cable. This configuration gives a system fwhm of approximately 335 ps. Our premier configuration, on the other hand, consists of an improved response detector and a French Thomson-CSF TSN-660 oscilloscope with a shorter length of coaxial cable (typically 20 feet). The system fwhm in this case is less than 120 ps which is our fastest oscillographic recording system at the present time
A Multicarrier Multiplexing Method for Very Wide Bandwidth Transmission
Directory of Open Access Journals (Sweden)
Efthymoglou George
2006-01-01
Full Text Available The multicarrier orthogonal code division multiplexing (MC-OCDM introduced here has been designed for very wide bandwidth (VWB point-to-point and point-to-multipoint transmission. In order to meet VWB transmission requirements, the MC-OCDM design has two components, the basic and the composite. The basic MC-OCDM is a generalized form of the standard orthogonal frequency division multiplexing (OFDM. It has the property of distributing the power of each transmitted symbol into all subcarrier frequencies. Each subcarrier will then carry all transmitted symbols which are distinguished by orthogonal Hadamard sequences. The resulting system is shown to improve the performance of OFDM by introducing frequency and time diversity. As shown, by both analysis and simulation, the basic MC-OCDM combats the effects of narrowband interference (NBI. In particular, the simulation results show that the BER performance of the basic MC-OCDM in the presence of NBI is better than OFDM for both coded and uncoded systems. Furthermore, the composite MC-OCDM is a method of orthogonal frequency division multiplexing (OFDM basic MC-OCDM channels. This allows us to multiplex more than one basic MC-OCDM channel into a VWB transmission system which can have the performance and spectral efficiency required in fixed wireless transmission environments.
Bandwidth-Enhanced Low-Profile Antenna with Parasitic Patches
Directory of Open Access Journals (Sweden)
Son Xuat Ta
2017-01-01
Full Text Available This paper presents low-profile broadband antennas, which are composed of four parasitic patches placed between planar radiators and a perfect electric conductor ground plane. Two types of planar radiators, a conventional dipole and a crossed dipole, are employed to produce linearly polarized (LP and circularly polarized (CP radiations, respectively. The radiator and parasitic patches are realized on thin substrates to lower the cost. Owing to the presence of parasitic patches, the antenna performance improves in terms of profile reduction, resonant frequency decrease, and bandwidth enhancement. These improvements are discussed and confirmed computationally and experimentally. The LP design with the overall dimensions of 120 mm × 120 mm × 16.3 mm (0.64λ0 × 0.64λ0 × 0.087λ0 at 1.6 GHz has a |S11| 96%. The CP design, which has the same physical size as the LP case, has a |S11| 90%.
Constant-bandwidth constant-temperature hot-wire anemometer.
Ligeza, P
2007-07-01
A constant-temperature anemometer (CTA) enables the measurement of fast-changing velocity fluctuations. In the classical solution of CTA, the transmission band is a function of flow velocity. This is a minor drawback when the mean flow velocity does not significantly change, though it might lead to dynamic errors when flow velocity varies over a considerable range. A modification is outlined, whereby an adaptive controller is incorporated in the CTA system such that the anemometer's transmission band remains constant in the function of flow velocity. For that purpose, a second feedback loop is provided, and the output signal from the anemometer will regulate the controller's parameters such that the transmission bandwidth remains constant. The mathematical model of a CTA that has been developed and model testing data allow a through evaluation of the proposed solution. A modified anemometer can be used in measurements of high-frequency variable flows in a wide range of velocities. The proposed modification allows the minimization of dynamic measurement errors.
Cost Allocation and Convex Data Envelopment
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Tind, Jørgen
This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann-Shapley and the Friedman-Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming...... such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output...
Directory of Open Access Journals (Sweden)
Hui Zhou
2015-08-01
Full Text Available Attracting increasing attention in recent years, the Free Space Optics (FSO technology has been recognized as a cost-effective wireless access technology for multi-Gigabit rate wireless networks. Radio on Free Space Optics (RoFSO provides a new approach to support various bandwidth-intensive wireless services in an optical wireless link. In an RoFSO system using wavelength-division multiplexing (WDM, it is possible to concurrently transmit multiple data streams consisting of various wireless services at very high rate. In this paper, we investigate the problem of optical power allocation under power budget and eye safety constraints for adaptive WDM transmission in RoFSO networks. We develop power allocation schemes for adaptive WDM transmissions to combat the effect of weather turbulence on RoFSO links. Simulation results show that WDM RoFSO can support high data rates even over long distance or under bad weather conditions with an adequate system design.
MATLAB implementation of a dynamic clamp with bandwidth >125 KHz capable of generating INa at 37°C
Clausen, Chris; Valiunas, Virginijus; Brink, Peter R.; Cohen, Ira S.
2012-01-01
We describe the construction of a dynamic clamp with bandwidth >125 KHz that utilizes a high performance, yet low cost, standard home/office PC interfaced with a high-speed (16 bit) data acquisition module. High bandwidth is achieved by exploiting recently available software advances (code-generation technology, optimized real-time kernel). Dynamic-clamp programs are constructed using Simulink, a visual programming language. Blocks for computation of membrane currents are written in the high-level matlab language; no programming in C is required. The instrument can be used in single- or dual-cell configurations, with the capability to modify programs while experiments are in progress. We describe an algorithm for computing the fast transient Na+ current (INa) in real time, and test its accuracy and stability using rate constants appropriate for 37°C. We then construct a program capable of supplying three currents to a cell preparation: INa, the hyperpolarizing-activated inward pacemaker current (If), and an inward-rectifier K+ current (IK1). The program corrects for the IR drop due to electrode current flow, and also records all voltages and currents. We tested this program on dual patch-clamped HEK293 cells where the dynamic clamp controls a current-clamp amplifier and a voltage-clamp amplifier controls membrane potential, and current-clamped HEK293 cells where the dynamic clamp produces spontaneous pacing behavior exhibiting Na+ spikes in otherwise passive cells. PMID:23224681
Thomas, Minta; De Brabanter, Kris; De Moor, Bart
2014-05-10
DNA microarrays are potentially powerful technology for improving diagnostic classification, treatment selection, and prognostic assessment. The use of this technology to predict cancer outcome has a history of almost a decade. Disease class predictors can be designed for known disease cases and provide diagnostic confirmation or clarify abnormal cases. The main input to this class predictors are high dimensional data with many variables and few observations. Dimensionality reduction of these features set significantly speeds up the prediction task. Feature selection and feature transformation methods are well known preprocessing steps in the field of bioinformatics. Several prediction tools are available based on these techniques. Studies show that a well tuned Kernel PCA (KPCA) is an efficient preprocessing step for dimensionality reduction, but the available bandwidth selection method for KPCA was computationally expensive. In this paper, we propose a new data-driven bandwidth selection criterion for KPCA, which is related to least squares cross-validation for kernel density estimation. We propose a new prediction model with a well tuned KPCA and Least Squares Support Vector Machine (LS-SVM). We estimate the accuracy of the newly proposed model based on 9 case studies. Then, we compare its performances (in terms of test set Area Under the ROC Curve (AUC) and computational time) with other well known techniques such as whole data set + LS-SVM, PCA + LS-SVM, t-test + LS-SVM, Prediction Analysis of Microarrays (PAM) and Least Absolute Shrinkage and Selection Operator (Lasso). Finally, we assess the performance of the proposed strategy with an existing KPCA parameter tuning algorithm by means of two additional case studies. We propose, evaluate, and compare several mathematical/statistical techniques, which apply feature transformation/selection for subsequent classification, and consider its application in medical diagnostics. Both feature selection and feature
Smart LED allocation scheme for efficient multiuser visible light communication networks.
Sewaiwar, Atul; Tiwari, Samrat Vikramaditya; Chung, Yeon Ho
2015-05-18
In a multiuser bidirectional visible light communication (VLC), a large number of LEDs or an LED array needs to be allocated in an efficient manner to ensure sustainable data rate and link quality. Moreover, in order to support an increasing or decreasing number of users in the network, the LED allocation is required to be performed dynamically. In this paper, a novel smart LED allocation scheme for efficient multiuser VLC networks is presented. The proposed scheme allocates RGB LEDs to multiple users in a dynamic and efficient fashion, while satisfying illumination requirements in an indoor environment. The smart LED array comprised of RGB LEDs is divided into sectors according to the location of the users. The allocated sectors then provide optical power concentration toward the users for efficient and reliable data transmission. An algorithm for the dynamic allocation of the LEDs is also presented. To verify its effective resource allocation feature of the proposed scheme, simulations were performed. It is found that the proposed smart LED allocation scheme provides the effect of optical beamforming toward individual users, thereby increasing the collective power concentration of the optical signals on the desirable users and resulting in significantly increased data rate, while ensuring sufficient illumination in a multiuser VLC environment.
Cost allocation review : staff discussion paper
International Nuclear Information System (INIS)
2005-09-01
This report addressed the need for updated cost allocation studies filed by local electricity distribution companies because they ensure that distribution rates for each customer class remain just and reasonable. According to the 2001 Electricity Distribution Rate Handbook, the Ontario Energy Board requires new cost allocation studies before implementing any future incentive regulation plans. A review of cost allocations allows the Board to consider the need for adjustments to the current share of distribution costs paid by different classes of ratepayers. This report included 14 sections to facilitate consultations with stakeholders on financial information requirements for cost allocation; directly assignable costs; functionalization; categorization; allocation methods; allocation of other costs; load data requirements; cost allocation implementation issues; addition of new rate class and rate design for scattered unmetered loads; addition of new rate class for larger users; rates to charge embedded distributors; treatment of the rate sub-classification identified as time-of-use; and, rate design implementation issues. 1 fig., 7 appendices
Coherence bandwidth characterization in an urban microcell at 62.4 GHz
DEFF Research Database (Denmark)
Sánchez, M. G.; Hammoudeh, A. M.; Grindrod, E.
2000-01-01
variation of this coefficient with distance and in order to provide accurate estimates of the coherence bandwidth in the microcell, the correlation coefficient has to be measured over large sections. Two methods to calculate the coherence bandwidth are presented and compared. It is shown that estimating...
Task Mapping and Bandwidth Reservation for Mixed Hard/Soft Fault-Tolerant Embedded Systems
DEFF Research Database (Denmark)
Saraswat, Prabhat Kumar; Pop, Paul; Madsen, Jan
2010-01-01
In this paper we are interested in mixed hard/soft real-time fault-tolerant applications mapped on distributed heterogeneous architectures. We use the Earliest Deadline First (EDF) scheduling for the hard real-time tasks and the Constant Bandwidth Server (CBS) for the soft tasks. The bandwidth re...
A wideband supply modulator for 20MHz RF bandwidth polar PAs in 65nm CMOS
Shrestha, R.; van der Zee, Ronan A.R.; de Graauw, A.J.M.; Nauta, Bram
2008-01-01
Abstract A wideband modulator for a 20MHz bandwidth polar modulated PA is presented which achieves a maximum efficiency of 87.5% and a small signal -3dB bandwidth of 285MHz. Realized in 65nm CMOS, it consists of a cascoded nested Miller compensated linear amplifier and a class D switching amplifier.
High-Q Variable Bandwidth Passive Filters for Software Defined Radio
Arkesteijn, V.J.; Klumperink, Eric A.M.; Nauta, Bram
2001-01-01
An important aspect of Software Defined Radio is the ability to define the bandwidth of the filter that selects the desired channel. This paper describes a technique for channel filtering, in which two passive filters are combined to obtain a variable bandwidth. Passive filters have the advantage of
High-Q variable bandwidth passive filters for Software Defined Radio
Arkesteijn, V.J.; Klumperink, Eric A.M.; Nauta, Bram
An important aspect of Software Defined Radio is the ability to define the bandwidth of the filter that selects the desired channel. This paper describes a technique for channel filtering, in which two passive filters are combined to obtain a variable bandwidth. Passive filters have the advantage of
Comparison of Available Bandwidth Estimation Techniques in Packet-Switched Mobile Networks
DEFF Research Database (Denmark)
López Villa, Dimas; Ubeda Castellanos, Carlos; Teyeb, Oumer Mohammed
2006-01-01
of information regarding the available bandwidth in the transport network, as it could end up being the bottleneck rather than the air interface. This paper provides a comparative study of three well known available bandwidth estimation techniques, i.e. TOPP, SLoPS and pathChirp, taking into account...
DEFF Research Database (Denmark)
Zhang, Shuai; Zhao, Kun; Ying, Zhinong
2015-01-01
A diagonal antenna-chassis mode is investigated in long-term evolution multiple-input-multiple-output (LTE MIMO) antennas. The MIMO bandwidth is defined in this paper as the overlap range of the low-envelope correlation coefficient, high total efficiency, and -6-dB impedance matching bandwidths...
Construction and experimental testing of the constant-bandwidth constant-temperature anemometer.
Ligeza, P
2008-09-01
A classical constant-temperature hot-wire anemometer enables the measurement of fast-changing flow velocity fluctuations, although its transmission bandwidth is a function of measured velocity. This may be a source of significant dynamic errors. Incorporation of an adaptive controller into the constant-temperature system results in hot-wire anemometer operating with a constant transmission bandwidth. The construction together with the results of experimental testing of a constant-bandwidth hot-wire anemometer prototype are presented in this article. During the testing, an approximately constant transmission bandwidth of the anemometer was achieved. The constant-bandwidth hot-wire anemometer can be used in measurements of high-frequency variable flows characterized by a wide range of velocity changes.
Comparison between hybridized algorithm of GA–SA and ABC, GA ...
Indian Academy of Sciences (India)
Shidrokh Goudarzi
algorithms: artificial bee colony (ABC), genetic algorithm (GA), differential evolution (DE), and particle swarm optimization (PSO). Moreover, a cost function is used to sustain the desired QoS during the transition between networks, which is measured in terms of the bandwidth, BER, ABR, SNR, and monetary cost. Simulation ...
Proposed first-generation WSQ bit allocation procedure
Energy Technology Data Exchange (ETDEWEB)
Bradley, J.N.; Brislawn, C.M.
1993-09-08
The Wavelet/Scalar Quantization (WSQ) gray-scale fingerprint image compression algorithm involves a symmetric wavelet transform (SWT) image decomposition followed by uniform scalar quantization of each subband. The algorithm is adaptive insofar as the bin widths for the scalar quantizers are image-specific and are included in the compressed image format. Since the decoder requires only the actual bin width values -- but not the method by which they were computed -- the standard allows for future refinements of the WSQ algorithm by improving the method used to select the scalar quantizer bin widths. This report proposes a bit allocation procedure for use with the first-generation WSQ encoder. In previous work a specific formula is provided for the relative sizes of the scalar quantizer bin widths in terms of the variances of the SWT subbands. An explicit specification for the constant of proportionality, q, that determines the absolute bin widths was not given. The actual compression ratio produced by the WSQ algorithm will generally vary from image to image depending on the amount of coding gain obtained by the run-length and Huffman coding, stages of the algorithm, but testing performed by the FBI established that WSQ compression produces archival quality images at compression ratios of around 20 to 1. The bit allocation procedure described in this report possesses a control parameter, r, that can be set by the user to achieve a predetermined amount of lossy compression, effectively giving the user control over the amount of distortion introduced by quantization noise. The variability observed in final compression ratios is thus due only to differences in lossless coding gain from image to image, chiefly a result of the varying amounts of blank background surrounding the print area in the images. Experimental results are presented that demonstrate the proposed method`s effectiveness.
45-Gbps 3D-CAP transmission over a 16-GHz bandwidth SSMF link assisted by Wiener filtering
Sun, Lin; Du, Jiangbing; You, Yue; Liang, Chenyu; Zhang, Wenjia; Ma, Lin; He, Zuyuan
2017-04-01
In this study, the optical 3-dimensional carrier-less amplitude phase (3D-CAP) modulation up to 45 Gbps at 1550 nm is demonstrated and standard single mode fiber (SSMF) transmission up to 10-Km is achieved. The 10-dB bandwidth of the optical back-to-back link is only 16 GHz. Digital Wiener filter is employed to compensate signal distortion with low algorithm complexity. The results indicate a power sensitivity of about 2-dBm after 10-Km transmission for achieving BER of 3.8e-3 at 7% FEC limit. To our best acknowledgement, this is the highest transmission capacity for the 3D-CAP transmission over 10-Km SSMF at 1550 nm. The demonstrated results of 3D-CAP modulation and transmission with paralleled data streams in 3 dimensions present a good potential for improving the density and reducing the cost of parallel optical transceivers in short reach optical interconnections.
Optimum design for pipe-support allocation against seismic loading
International Nuclear Information System (INIS)
Hara, Fumio; Iwasaki, Akira
1996-01-01
This paper deals with the optimum design methodology of a piping system subjected to a seismic design loading to reduce its dynamic response by selecting the location of pipe supports and whereby reducing the number of pipe supports to be used. The author employs the Genetic Algorithm for obtaining a reasonably optimum solution of the pipe support location, support capacity and number of supports. The design condition specified by the support location, support capacity and the number of supports to be used is encored by an integer number string for each of the support allocation candidates and they prepare many strings for expressing various kinds of pipe-support allocation state. Corresponding to each string, the authors evaluate the seismic response of the piping system to the design seismic excitation and apply the Genetic Algorithm to select the next generation candidates of support allocation to improve the seismic design performance specified by a weighted linear combination of seismic response magnitude, support capacity and the number of supports needed. Continuing this selection process, they find a reasonably optimum solution to the seismic design problem. They examine the feasibility of this optimum design method by investigating the optimum solution for 5, 7 and 10 degree-of-freedom models of piping system, and find that this method can offer one a theoretically feasible solution to the problem. They will be, thus, liberated from the severe uncertainty of damping value when the pipe support guaranties the design capacity of damping. Finally, they discuss the usefulness of the Genetic Algorithm for the seismic design problem of piping systems and some sensitive points when it will be applied to actual design problems
McCreery, Ryan W; Stelmachowicz, Patricia G
2013-09-01
Understanding speech in acoustically degraded environments can place significant cognitive demands on school-age children who are developing the cognitive and linguistic skills needed to support this process. Previous studies suggest the speech understanding, word learning, and academic performance can be negatively impacted by background noise, but the effect of limited audibility on cognitive processes in children has not been directly studied. The aim of the present study was to evaluate the impact of limited audibility on speech understanding and working memory tasks in school-age children with normal hearing. Seventeen children with normal hearing between 6 and 12 years of age participated in the present study. Repetition of nonword consonant-vowel-consonant stimuli was measured under conditions with combinations of two different signal to noise ratios (SNRs; 3 and 9 dB) and two low-pass filter settings (3.2 and 5.6 kHz). Verbal processing time was calculated based on the time from the onset of the stimulus to the onset of the child's response. Monosyllabic word repetition and recall were also measured in conditions with a full bandwidth and 5.6 kHz low-pass cutoff. Nonword repetition scores decreased as audibility decreased. Verbal processing time increased as audibility decreased, consistent with predictions based on increased listening effort. Although monosyllabic word repetition did not vary between the full bandwidth and 5.6 kHz low-pass filter condition, recall was significantly poorer in the condition with limited bandwidth (low pass at 5.6 kHz). Age and expressive language scores predicted performance on word recall tasks, but did not predict nonword repetition accuracy or verbal processing time. Decreased audibility was associated with reduced accuracy for nonword repetition and increased verbal processing time in children with normal hearing. Deficits in free recall were observed even under conditions where word repetition was not affected
Flow enforcement algorithms for ATM networks
DEFF Research Database (Denmark)
Dittmann, Lars; Jacobsen, Søren B.; Moth, Klaus
1991-01-01
Four measurement algorithms for flow enforcement in asynchronous transfer mode (ATM) networks are presented. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletraffic...... theory and partly on signal processing theory, is carried out. It is seen that the time constant involved increases with the increasing burstiness of the connection. It is suggested that the RMS measurement bandwidth be used to dimension linear algorithms for equal flow enforcement characteristics....... Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewal-type connection using the four algorithms. The corresponding hardware demands are estimated aid compared...
Extravehicular Activity Operations Concepts Under Communication Latency and Bandwidth Constraints
Beaton, Kara H.; Chappell, Steven P.; Abercromby, Andrew F. J.; Miller, Matthew J.; Nawotniak, Shannon Kobs; Hughes, Scott; Brady, Allyson; Lim, Darlene S. S.
2017-01-01
The Biologic Analog Science Associated with Lava Terrains (BASALT) project is a multi-year program dedicated to iteratively develop, implement, and evaluate concepts of operations (ConOps) and supporting capabilities intended to enable and enhance human scientific exploration of Mars. This pa-per describes the planning, execution, and initial results from the first field deployment, referred to as BASALT-1, which consisted of a series of 10 simulated extravehicular activities (EVAs) on volcanic flows in Idaho's Craters of the Moon (COTM) National Monument. The ConOps and capabilities deployed and tested during BASALT-1 were based on previous NASA trade studies and analog testing. Our primary research question was whether those ConOps and capabilities work acceptably when performing real (non-simulated) biological and geological scientific exploration under 4 different Mars-to-Earth communication conditions: 5 and 15 min one-way light time (OWLT) communication latencies and low (0.512 Mb/s uplink, 1.54 Mb/s downlink) and high (5.0 Mb/s uplink, 10.0 Mb/s downlink) bandwidth conditions representing the lower and higher limits of technical communication capabilities currently proposed for future human exploration missions. The synthesized results of BASALT-1 with respect to the ConOps and capabilities assessment were derived from a variety of sources, including EVA task timing data, network analytic data, and subjective ratings and comments regarding the scientific and operational acceptability of the ConOp and the extent to which specific capabilities were enabling and enhancing, and are presented here. BASALT-1 established preliminary findings that baseline ConOp, software systems, and communication protocols were scientifically and operationally acceptable with minor improvements desired by the "Mars" extravehicular (EV) and intravehicular (IV) crewmembers, but unacceptable with improvements required by the "Earth" Mission Support Center. These data will provide a
A Spectrum Allocation Mechanism Based on HJ-DQPSO for Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
Zhu Jiang
2015-11-01
Full Text Available In cognitive radio network model consisting of secondary users and primary users, in order to solve the difficult multi-objective spectrum allocation issue about maximizing network efficiency and users’ fairness to access network, this paper proposes a new discrete multi-objective combinatorial optimization mechanism—HJ-DQPSO based on Hooke Jeeves (HJ and Quantum Particle Swarm Optimization (QPSO algorithm. The mechanism adopts HJ algorithm to local search to prevent falling into the local optimum, and proposes a discrete QPSO algorithm to match the discrete spectrum assignment model. The mechanism has the advantages of approximating optimal solution, rapid convergence, less parameters, avoiding falling into local optimum. Compared with existing spectrum assignment algorithms, the simulation results show that according to different optimization objectives, the HJ-DQPSO optimization mechanism for multi-objective optimization can better approximate optimal solution and converge fast. We can obtain a reasonable spectrum allocation scheme in the case of satisfying multiple optimization objectives.
Energy Technology Data Exchange (ETDEWEB)
Fischler, M.
1992-04-01
The issues to be addressed here are those of ``balance`` in machine architecture. By this, we mean how much emphasis must be placed on various aspects of the system to maximize its usefulness for physics. There are three components that contribute to the utility of a system: How the machine can be used, how big a problem can be attacked, and what the effective capabilities (power) of the hardware are like. The effective power issue is a matter of evaluating the impact of design decisions trading off architectural features such as memory bandwidth and interprocessor communication capabilities. What is studied is the effect these machine parameters have on how quickly the system can solve desired problems. There is a reasonable method for studying this: One selects a few representative algorithms and computes the impact of changing memory bandwidths, and so forth. The only room for controversy here is in the selection of representative problems. The issue of how big a problem can be attacked boils down to a balance of memory size versus power. Although this is a balance issue it is very different than the effective power situation, because no firm answer can be given at this time. The power to memory ratio is highly problem dependent, and optimizing it requires several pieces of physics input, including: how big a lattice is needed for interesting results; what sort of algorithms are best to use; and how many sweeps are needed to get valid results. We seem to be at the threshold of learning things about these issues, but for now, the memory size issue will necessarily be addressed in terms of best guesses, rules of thumb, and researchers` opinions.
Energy Technology Data Exchange (ETDEWEB)
Fischler, M.
1992-04-01
The issues to be addressed here are those of balance'' in machine architecture. By this, we mean how much emphasis must be placed on various aspects of the system to maximize its usefulness for physics. There are three components that contribute to the utility of a system: How the machine can be used, how big a problem can be attacked, and what the effective capabilities (power) of the hardware are like. The effective power issue is a matter of evaluating the impact of design decisions trading off architectural features such as memory bandwidth and interprocessor communication capabilities. What is studied is the effect these machine parameters have on how quickly the system can solve desired problems. There is a reasonable method for studying this: One selects a few representative algorithms and computes the impact of changing memory bandwidths, and so forth. The only room for controversy here is in the selection of representative problems. The issue of how big a problem can be attacked boils down to a balance of memory size versus power. Although this is a balance issue it is very different than the effective power situation, because no firm answer can be given at this time. The power to memory ratio is highly problem dependent, and optimizing it requires several pieces of physics input, including: how big a lattice is needed for interesting results; what sort of algorithms are best to use; and how many sweeps are needed to get valid results. We seem to be at the threshold of learning things about these issues, but for now, the memory size issue will necessarily be addressed in terms of best guesses, rules of thumb, and researchers' opinions.
International Nuclear Information System (INIS)
Fischler, M.
1992-04-01
The issues to be addressed here are those of ''balance'' in machine architecture. By this, we mean how much emphasis must be placed on various aspects of the system to maximize its usefulness for physics. There are three components that contribute to the utility of a system: How the machine can be used, how big a problem can be attacked, and what the effective capabilities (power) of the hardware are like. The effective power issue is a matter of evaluating the impact of design decisions trading off architectural features such as memory bandwidth and interprocessor communication capabilities. What is studied is the effect these machine parameters have on how quickly the system can solve desired problems. There is a reasonable method for studying this: One selects a few representative algorithms and computes the impact of changing memory bandwidths, and so forth. The only room for controversy here is in the selection of representative problems. The issue of how big a problem can be attacked boils down to a balance of memory size versus power. Although this is a balance issue it is very different than the effective power situation, because no firm answer can be given at this time. The power to memory ratio is highly problem dependent, and optimizing it requires several pieces of physics input, including: how big a lattice is needed for interesting results; what sort of algorithms are best to use; and how many sweeps are needed to get valid results. We seem to be at the threshold of learning things about these issues, but for now, the memory size issue will necessarily be addressed in terms of best guesses, rules of thumb, and researchers' opinions
Effect of latency and packet loss on achievable bandwidth
CERN. Geneva
2015-01-01
Following an incident with a slow database replication between CERN's data centers, we discovered that even a very low rate packet loss in the network can induce significant penalties to long distance single stream TCP transfers. We explore the behaviour of multiple congestion control algorithms in a controlled loss environment in order to understand what is the achievable throughput of TCP data transfers between the Meyrin and Wigner data centres.
Spectrum-space-divided spectrum allocation approaches in software-defined elastic optical networks
Chen, Bowen; Yu, Xiaosong; Zhao, Yongli
2017-08-01
Recently, the architecture of elastic optical network (EON) has been proposed as a candidate solution to accommodate both huge bandwidth requirements and flexible connections in next generation optical networks. In order to improve the spectrum efficiency, we propose different spectrum-space-divided approaches and develop two integer linear programming (ILP) models and several spectrum-space-divided spectrum allocation approaches with and without dedicated-path protection in software-defined elastic optical networks (SD-EONs). Simulation results show that the ILP models achieve better performance in terms of the number of frequency slots and hop counts than the proposed spectrum-space-divided spectrum allocation approaches with and without dedicated-path protection under the static scenario of connection requests. Furthermore, we apply the spectrum-space-divided spectrum allocation approaches with and without dedicated-path protection to reduce the blocking probability and to improve spectrum efficiency under the dynamic connection requests compared to the traditional first-fit spectrum allocation approach in SD-EONs.
Resource Allocation for Downlink Multi-Cell OFDMA Cognitive Radio Network Using Hungarian Method
Directory of Open Access Journals (Sweden)
N. Forouzan
2013-12-01
Full Text Available This paper considers the problem of resource allocation for downlink part of an OFDM-based multi-cell cognitive radio network which consists of multiple secondary transmitters and receivers communicating simultaneously in the presence of multiple primary users. We present a new framework to maximize the total data throughput of secondary users by means of subchannel assignment, while ensuring interference leakage to PUs is below a threshold. In this framework, we first formulate the resource allocation problem as a nonlinear and non-convex optimization problem. Then we represent the problem as a maximum weighted matching in a bipartite graph and propose an iterative algorithm based on Hungarian method to solve it. The present contribution develops an efficient subchannel allocation algorithm that assigns subchannels to the secondary users without the perfect knowledge of fading channel gain between cognitive radio transmitter and primary receivers. The performance of the proposed subcarrier allocation algorithm is compared with a blind subchannel allocation as well as another scheme with the perfect knowledge of channel-state information. Simulation results reveal that a significant performance advantage can still be realized, even if the optimization at the secondary network is based on imperfect network information.
Park, Kihong
2013-04-01
In this paper, we consider resource allocation method in the visible light communication. It is challenging to achieve high data rate due to the limited bandwidth of the optical sources. In order to increase the spectral efficiency, we design a suitable multiple-input multiple-output (MIMO) system utilizing spatial multiplexing based on singular value decomposition and adaptive modulation. More specifically, after explaining why the conventional allocation method in radio frequency MIMO channels cannot be applied directly to the optical intensity channels, we theoretically derive a power allocation method for an arbitrary number of transmit and receive antennas for optical wireless MIMO systems. Based on three key constraints: the nonnegativity of the intensity-modulated signal, the aggregate optical power budget, and the bit error rate requirement, we propose a novel method to allocate the optical power, the offset value, and the modulation size. Based on some selected simulation results, we show that our proposed allocation method gives a better spectral efficiency at the expense of an increased computational complexity in comparison to a simple method that allocates the optical power equally among all the data streams. © 2013 IEEE.
Transmission usage cost allocation schemes
International Nuclear Information System (INIS)
Abou El Ela, A.A.; El-Sehiemy, R.A.
2009-01-01
This paper presents different suggested transmission usage cost allocation (TCA) schemes to the system individuals. Different independent system operator (ISO) visions are presented using the proportional rata and flow-based TCA methods. There are two proposed flow-based TCA schemes (FTCA). The first FTCA scheme generalizes the equivalent bilateral exchanges (EBE) concepts for lossy networks through two-stage procedure. The second FTCA scheme is based on the modified sensitivity factors (MSF). These factors are developed from the actual measurements of power flows in transmission lines and the power injections at different buses. The proposed schemes exhibit desirable apportioning properties and are easy to implement and understand. Case studies for different loading conditions are carried out to show the capability of the proposed schemes for solving the TCA problem. (author)
Legitimate Allocation of Public Healthcare
DEFF Research Database (Denmark)
Lippert-Rasmussen, Kasper; Lauridsen, Sigurd
2009-01-01
Citizens' consent to political decisions is often regarded as a necessary condition of political legitimacy. Consequently, legitimate allocation of healthcare has seemed almost unattainable in contemporary pluralistic societies. The problem is that citizens do not agree on any single principle...... governing priorities among groups of patients. The Accountability for Reasonableness (A4R) framework suggests an ingenious solution to this problem of moral disagreement. Rather than advocating any substantive distributive principle, its advocates propose a feasible set of conditions, which, if met...... by decision makers at the institutional level, provide, so it is promised, legitimate decisions. While we agree that A4R represents an important contribution to the priority-setting debate, we challenge the framework in two respects. First, we argue that A4R, and more specifically the relevance condition of A...
Theory of stable allocations II
Directory of Open Access Journals (Sweden)
Pantelić Svetlana
2015-01-01
Full Text Available The Swedish Royal Academy awarded the 2012 Nobel Prize in Economics to Lloyd Shapley and Alvin Roth, for the theory of stable allocations and the practice of market design. These two American researchers worked independently from each other, combining basic theory and empirical investigations. Through their experiments and practical design they generated a flourishing field of research and improved the performance of many markets. Shapley provided the fundamental theoretical contribution to this field of research, whereas Roth, a professor at the Harvard University in Boston, developed and upgraded these theoretical investigations by applying them to the American market of medical doctors. Namely, their research helps explain the market processes at work, for instance, when doctors are assigned to hospitals, students to schools and human organs for transplant to recipients.
A Machine Learning Method for Improving Task Allocation in Distributed Multi-Robot Transportation
Dahl, Torbjørn S.; MatariĆ, Maja J.; Sukhatme, Gaurav S.
Machine learning is a means of automatically generating solutions that perform better than those that are hand-coded by human programmers. We present a general behavior-based algorithm that uses reinforcement learning to improve the spatiotemporal organization of a homogeneous group of robots. In this algorithm each robot applies the learning at the level of individual behavior selection. We demonstrate how the interactions within the group affect the individual learning in a way that produces group-level effects, such as lane-formation and task-specialization, and improves group performance. We also present a model of multi-robot task allocation as resource distribution through vacancy chains, a distribution method common in human and animal societies, and an algorithm for multi-robot task allocation based on that model. The model predicts the task allocation achieved by our algorithm and highlights its limitations. We present experimental results that validate our model and show that our algorithm outperforms pre-programmed solutions. Last, we present an extension of our algorithm that makes it sensitive to differences in robot performance levels.
Knee implant imaging at 3 Tesla using high-bandwidth radiofrequency pulses.
Bachschmidt, Theresa J; Sutter, Reto; Jakob, Peter M; Pfirrmann, Christian W A; Nittka, Mathias
2015-06-01
To investigate the impact of high-bandwidth radiofrequency (RF) pulses used in turbo spin echo (TSE) sequences or combined with slice encoding for metal artifact correction (SEMAC) on artifact reduction at 3 Tesla in the knee in the presence of metal. Local transmit/receive coils feature increased maximum B1 amplitude, reduced SAR exposition and thus enable the application of high-bandwidth RF pulses. Susceptibility-induced through-plane distortion scales inversely with the RF bandwidth and the view angle, hence blurring, increases for higher RF bandwidths, when SEMAC is used. These effects were assessed for a phantom containing a total knee arthroplasty. TSE and SEMAC sequences with conventional and high RF bandwidths and different contrasts were tested on eight patients with different types of implants. To realize scan times of 7 to 9 min, SEMAC was always applied with eight slice-encoding steps and distortion was rated by two radiologists. A local transmit/receive knee coil enables the use of an RF bandwidth of 4 kHz compared with 850 Hz in conventional sequences. Phantom scans confirm the relation of RF bandwidth and through-plane distortion, which can be reduced up to 79%, and demonstrate the increased blurring for high-bandwidth RF pulses. In average, artifacts in this RF mode are rated hardly visible for patients with joint arthroplasties, when eight SEMAC slice-encoding steps are applied, and for patients with titanium fixtures, when TSE is used. The application of high-bandwidth RF pulses by local transmit coils substantially reduces through-plane distortion artifacts at 3 Tesla. © 2014 Wiley Periodicals, Inc.
Menshikh, V.; Samorokovskiy, A.; Avsentev, O.
2018-03-01
The mathematical model of optimizing the allocation of resources to reduce the time for management decisions and algorithms to solve the general problem of resource allocation. The optimization problem of choice of resources in organizational systems in order to reduce the total execution time of a job is solved. This problem is a complex three-level combinatorial problem, for the solving of which it is necessary to implement the solution to several specific problems: to estimate the duration of performing each action, depending on the number of performers within the group that performs this action; to estimate the total execution time of all actions depending on the quantitative composition of groups of performers; to find such a distribution of the existing resource of performers in groups to minimize the total execution time of all actions. In addition, algorithms to solve the general problem of resource allocation are proposed.
Bayesian Modelling, Monte Carlo Sampling and Capital Allocation of Insurance Risks
Directory of Open Access Journals (Sweden)
Gareth W. Peters
2017-09-01
Full Text Available The main objective of this work is to develop a detailed step-by-step guide to the development and application of a new class of efficient Monte Carlo methods to solve practically important problems faced by insurers under the new solvency regulations. In particular, a novel Monte Carlo method to calculate capital allocations for a general insurance company is developed, with a focus on coherent capital allocation that is compliant with the Swiss Solvency Test. The data used is based on the balance sheet of a representative stylized company. For each line of business in that company, allocations are calculated for the one-year risk with dependencies based on correlations given by the Swiss Solvency Test. Two different approaches for dealing with parameter uncertainty are discussed and simulation algorithms based on (pseudo-marginal Sequential Monte Carlo algorithms are described and their efficiency is analysed.
Cognitive radio networks dynamic resource allocation schemes
Wang, Shaowei
2014-01-01
This SpringerBrief presents a survey of dynamic resource allocation schemes in Cognitive Radio (CR) Systems, focusing on the spectral-efficiency and energy-efficiency in wireless networks. It also introduces a variety of dynamic resource allocation schemes for CR networks and provides a concise introduction of the landscape of CR technology. The author covers in detail the dynamic resource allocation problem for the motivations and challenges in CR systems. The Spectral- and Energy-Efficient resource allocation schemes are comprehensively investigated, including new insights into the trade-off
Joint Power Allocation for Multicast Systems with Physical-Layer Network Coding
Directory of Open Access Journals (Sweden)
Chunguo Li
2010-01-01
Full Text Available This paper addresses the joint power allocation issue in physical-layer network coding (PLNC of multicast systems with two sources and two destinations communicating via a large number of distributed relays. By maximizing the achievable system rate, a constrained optimization problem is first formulated to jointly allocate powers for the source and relay terminals. Due to the nonconvex nature of the cost function, an iterative algorithm with guaranteed convergence is developed to solve the joint power allocation problem. As an alternative, an upper bound of the achievable rate is also derived to modify the original cost function in order to obtain a convex optimization solution. This approximation is shown to be asymptotically optimal in the sense of maximizing the achievable rate. It is confirmed through Monte Carlo simulations that the proposed joint power allocation schemes are superior to the existing schemes in terms of achievable rate and cumulative distribution function (CDF.
Directory of Open Access Journals (Sweden)
Dan Wu
2009-06-01
Full Text Available The principal-subordinate hierarchical multi-objective programming model of initial water rights allocation was developed based on the principle of coordinated and sustainable development of different regions and water sectors within a basin. With the precondition of strictly controlling maximum emissions rights, initial water rights were allocated between the first and the second levels of the hierarchy in order to promote fair and coordinated development across different regions of the basin and coordinated and efficient water use across different water sectors, realize the maximum comprehensive benefits to the basin, promote the unity of quantity and quality of initial water rights allocation, and eliminate water conflict across different regions and water sectors. According to interactive decision-making theory, a principal-subordinate hierarchical interactive iterative algorithm based on the satisfaction degree was developed and used to solve the initial water rights allocation model. A case study verified the validity of the model.
Optimization of Quantum-Dot Molecular Beam Epitaxy for Broad Spectral Bandwidth Devices
Majid, Mohammed Abdul
2012-12-01
The optimization of the key growth parameters for broad spectral bandwidth devices based on quantum dots is reported. A combination of atomic force microscopy, photoluminescence of test samples, and optoelectronic characterization of superluminescent diodes (SLDs) is used to optimize the growth conditions to obtain high-quality devices with large spectral bandwidth, radiative efficiency (due to a reduced defective-dot density), and thus output power. The defective-dot density is highlighted as being responsible for the degradation of device performance. An SLD device with 160 nm of bandwidth centered at 1230 nm is demonstrated.
Increasing the bandwidth of resonant gravitational antennas The case of Explorer
Astone, P; Bassan, M; Carelli, P; Cavallari, Giorgio; Coccia, E; Cosmelli, C; D'Antonio, S; Fafone, V; Fauth, A C; Federici, G; Giordano, G; Marini, A; Minenkov, Y; Modena, I; Modestino, G; Moleti, A; Pallottino, G V; Pizzella, G; Quintieri, L; Rocchi, A; Ronga, F; Terenzi, R; Torrioli, G; Visco, M
2003-01-01
Resonant gravitational wave detectors with an observation bandwidth of tens of hertz are a reality: the antenna Explorer, operated at CERN by the ROG collaboration, has been upgraded with a new read-out. In this new configuration, it exhibits an unprecedented useful bandwidth: in over 55 Hz about its frequency of operation of 919 Hz the spectral sensitivity is better than 10^{-20} /sqrt(Hz) . We describe the detector and its sensitivity and discuss the foreseable upgrades to even larger bandwidths.
Energy Technology Data Exchange (ETDEWEB)
Sabine Brueske, Caroline Kramer, Aaron Fisher
2015-06-01
Energy bandwidth studies of U.S. manufacturing sectors can serve as foundational references in framing the range (or bandwidth) of potential energy savings opportunities. This bandwidth study examines energy consumption and potential energy savings opportunities in U.S. chemical manufacturing. The study relies on multiple sources to estimate the energy used in the production of 74 individual chemicals, representing 57% of sector-wide energy consumption. Energy savings opportunities for individual chemicals and for 15 subsectors of chemicals manufacturing are based on technologies currently in use or under development; these potential savings are then extrapolated to estimate sector-wide energy savings opportunity.
Bandwidth Study on Energy Use and Potential Energy Savings Opportunities in U.S. Petroleum Refining
Energy Technology Data Exchange (ETDEWEB)
Sabine Brueske, Caroline Kramer, Aaron Fisher
2015-06-01
Energy bandwidth studies of U.S. manufacturing sectors can serve as foundational references in framing the range (or bandwidth) of potential energy savings opportunities. This bandwidth study examines energy consumption and potential energy savings opportunities in U.S. petroleum refining. The study relies on multiple sources to estimate the energy used in nine individual process areas, representing 68% of sector-wide energy consumption. Energy savings opportunities for individual processes are based on technologies currently in use or under development; these potential savings are then extrapolated to estimate sector-wide energy savings opportunity.
Acousto-optics bandwidth broadening in a Bragg cell based on arbitrary synthesized signal methods.
Peled, Itay; Kaminsky, Ron; Kotler, Zvi
2015-06-01
In this work, we present the advantages of driving a multichannel acousto-optical deflector (AOD) with a digitally synthesized multifrequency RF signal. We demonstrate a significant bandwidth broadening of ∼40% by providing well-tuned phase control of the array transducers. Moreover, using a multifrequency, complex signal, we manage to suppress the harmonic deflections and return most of the spurious energy to the main beam. This method allows us to operate the AOD with more than an octave of bandwidth with negligible spurious energy going to the harmonic beams and a total bandwidth broadening of over 70%.
Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS
DEFF Research Database (Denmark)
Wang, Haibo; Devendra, Devendra; Zhou, Xin
This paper investigates the Radio Resource Management (RRM) approaches for GSM/GPRS networks. The effort was put on Access Control(AC), Time-Slot (TS) allocation, and Radio Link Control (RLC) packet scheduling for down-link performance enhancement. A new credit-based algorithm was proposed...
RESOURCE-EFFICIENT ALLOCATION HEURISTICS FOR MANAGEMENT OF DATA CENTERS FOR CLOUD COMPUTING
Directory of Open Access Journals (Sweden)
Vitaliy Litvinov
2014-07-01
Full Text Available Survey of research in resource-efficient computing and architectural principles forresource-efficient management of Clouds are offered in this article. Resource-efficient resource allocation policies and scheduling algorithms considering QoS expectations and power usage characteristics of the devices are defined.
A Methodology to Exploit Profit Allocation in Logistics Joint Distribution Network Optimization
Directory of Open Access Journals (Sweden)
Yong Wang
2015-01-01
Full Text Available Logistics joint distribution network (LJDN optimization involves vehicle routes scheduling and profit allocation for multiple distribution centers. This is essentially a combinational and cooperative game optimization problem seeking to serve a number of customers with a fleet of vehicles and allocate profit among multiple centers. LJDN routing optimization based on customer clustering units can alleviate the computational complexity and improve the calculation accuracy. In addition, the profit allocation mechanism can be realized based on cooperative game theory through a negotiation procedure by the Logistics Service Provider (LSP. This paper establishes a model to minimize the total cost of the multiple centers joint distribution network when each distribution center is assigned to serve a series of distribution units. An improved particle swarm optimization (PSO algorithm is presented to tackle the model formulation by assigning distribution centers (DCs to distribution units. Improved PSO algorithm combines merits of PSO algorithm and genetic algorithm (GA with global and local search capabilities. Finally, a Shapley value model based on cooperative game theory is proposed to obtain the optimal profit allocation strategy among distribution centers from nonempty coalitions. The computational results from a case study in Guiyang city, China, suggest the optimal sequential coalition of distribution centers can be achieved according to Strictly Monotonic Path (SMP.
Directory of Open Access Journals (Sweden)
Samira Bolouri
2018-01-01
Full Text Available Determining the positions of facilities, and allocating demands to them, is a vitally important problem. Location-allocation problems are optimization NP-hard procedures. This article evaluates the ordered capacitated multi-objective location-allocation problem for fire stations, using simulated annealing and a genetic algorithm, with goals such as minimizing the distance and time as well as maximizing the coverage. After tuning the parameters of the algorithms using sensitivity analysis, they were used separately to process data for Region 11, Tehran. The results showed that the genetic algorithm was more efficient than simulated annealing, and therefore, the genetic algorithm was used in later steps. Next, we increased the number of stations. Results showed that the model can successfully provide seven optimal locations and allocate high demands (280,000 to stations in a discrete space in a GIS, assuming that the stations’ capacities are known. Following this, we used a weighting program so that in each repetition, we could allot weights to each target randomly. Finally, by repeating the model over 10 independent executions, a set of solutions with the least sum and the highest number of non-dominated solutions was selected from among many non-dominated solutions as the best set of optimal solutions.
Many-objective robust decision making for water allocation under climate change.
Yan, Dan; Ludwig, Fulco; Huang, He Qing; Werners, Saskia E
2017-12-31
Water allocation is facing profound challenges due to climate change uncertainties. To identify adaptive water allocation strategies that are robust to climate change uncertainties, a model framework combining many-objective robust decision making and biophysical modeling is developed for large rivers. The framework was applied to the Pearl River basin (PRB), China where sufficient flow to the delta is required to reduce saltwater intrusion in the dry season. Before identifying and assessing robust water allocation plans for the future, the performance of ten state-of-the-art MOEAs (multi-objective evolutionary algorithms) is evaluated for the water allocation problem in the PRB. The Borg multi-objective evolutionary algorithm (Borg MOEA), which is a self-adaptive optimization algorithm, has the best performance during the historical periods. Therefore it is selected to generate new water allocation plans for the future (2079-2099). This study shows that robust decision making using carefully selected MOEAs can help limit saltwater intrusion in the Pearl River Delta. However, the framework could perform poorly due to larger than expected climate change impacts on water availability. Results also show that subjective design choices from the researchers and/or water managers could potentially affect the ability of the model framework, and cause the most robust water allocation plans to fail under future climate change. Developing robust allocation plans in a river basin suffering from increasing water shortage requires the researchers and water managers to well characterize future climate change of the study regions and vulnerabilities of their tools. Copyright © 2017 Elsevier B.V. All rights reserved.
Optimizing Bandwidth Limited Problems Using One-SidedCommunication and Overlap
Energy Technology Data Exchange (ETDEWEB)
Bell, Christian; Bonachea, Dan; Nishtala, Rajesh; Yelick, Katherine
2005-10-14
Partitioned Global Address Space languages like Unified Parallel C (UPC) are typically valued for their expressiveness, especially for computations with fine-grained random accesses. In this paper we show that the one-sided communication model used in these languages also has a significant performance advantage for bandwidth-limited applications. We demonstrate this benefit through communication microbenchmarks and a case-study that compares UPC and MPI implementations of the NAS Fourier Transform (FT) benchmark. Our optimizations rely on aggressively overlapping communication with computation but spreading communication events throughout the course of the local computation. This alleviates the potential communication bottleneck that occurs when the communication is packed into a single phase (e.g., the large all-to-all in a multidimensional FFT). Even though the new algorithms require more messages for the same total volume of data, the resulting overlap leads to speedups of over 1.75x and 1.9x for the two-sided and one-sided implementations, respectively, when compared to the default NAS Fortran/MPI release. Our best one-sided implementations show an average improvement of 15 percent over our best two-sided implementations. We attribute this difference to the lower software overhead of one-sided communication, which is partly fundamental to the semantic difference between one-sided and two-sided communication. Our UPC results use the Berkeley UPC compiler with the GASNet communication system, and demonstrate the portability and scalability of that language and implementation, with performance approaching 0.5TFlop/s on the FT benchmark running on 512 processors.
Short-term storage allocation in a filmless hospital
Strickland, Nicola H.; Deshaies, Marc J.; Reynolds, R. Anthony; Turner, Jonathan E.; Allison, David J.
1997-05-01
Optimizing limited short term storage (STS) resources requires gradual, systematic changes, monitored and modified within an operational PACS environment. Optimization of the centralized storage requires a balance of exam numbers and types in STS to minimize lengthy retrievals from long term archive. Changes to STS parameters and work procedures were made while monitoring the effects on resource allocation by analyzing disk space temporally. Proportions of disk space allocated to each patient category on STS were measured to approach the desired proportions in a controlled manner. Key factors for STS management were: (1) sophisticated exam prefetching algorithms: HIS/RIS-triggered, body part-related and historically-selected, and (2) a 'storage onion' design allocating various exam categories to layers with differential deletion protection. Hospitals planning for STS space should consider the needs of radiology, wards, outpatient clinics and clinicoradiological conferences for new and historical exams; desired on-line time; and potential increase in image throughput and changing resources, such as an increase in short term storage disk space.
An application of the maximal independent set algorithm to course ...
African Journals Online (AJOL)
In this paper, we demonstrated one of the many applications of the Maximal Independent Set Algorithm in the area of course allocation. A program was developed in Pascal and used in implementing a modified version of the algorithm to assign teaching courses to available lecturers in any academic environment and it ...
Westera, Wim
2009-01-01
Westera, W. (2007). Peer-Allocated Instant Response (PAIR): Computational allocation of peer tutors in learning communities. Journal of Artificial Societies and Social Simulation, http://jasss.soc.surrey.ac.uk/10/2/5.html
Location-Based Resource Allocation for OFDMA Cognitive Radio Systems
Ghorbel, Mahdi
2011-05-01
Cognitive radio is one of the hot topics for emerging and future wireless communication. It has been proposed as a suitable solution for the spectrum scarcity caused by the increase in frequency demand. The concept is based on allowing unlicensed users, called cognitive or secondary users, to share the unoccupied frequency bands with their owners, called the primary users, under constraints on the interference they cause to them. In order to estimate this interference, the cognitive system usually uses the channel state information to the primary user, which is often impractical to obtain. However, we propose to use location information, which is easier to obtain, to estimate this interference. The purpose of this work is to propose a subchannel and power allocation method which maximizes the secondary users\\' total capacity under the constraints of limited budget power and total interference to the primary under certain threshold. We model the problem as a constrained optimization problem for both downlink and uplink cases. Then, we propose low-complexity resource allocation schemes based on the waterfilling algorithm. The simulation results show the efficiency of the proposed method with comparison to the exhaustive search algorithm.
Sima, Chaotan; Gates, J C; Holmes, C; Mennea, P L; Zervas, M N; Smith, P G R
2013-09-01
Terahertz bandwidth photonic Hilbert transformers are proposed and experimentally demonstrated. The integrated device is fabricated via a direct UV grating writing technique in a silica-on-silicon platform. The photonic Hilbert transformer operates at bandwidths of up to 2 THz (~16 nm) in the telecom band, a 10-fold greater bandwidth than any previously reported experimental approaches. Achieving this performance requires detailed knowledge of the system transfer function of the direct UV grating writing technique; this allows improved linearity and yields terahertz bandwidth Bragg gratings with improved spectral quality. By incorporating a flat-top reflector and Hilbert grating with a waveguide coupler, an ultrawideband all-optical single-sideband filter is demonstrated.
DEFF Research Database (Denmark)
Buchholz, Jörg; Caminade, Sabine; Strelcyk, Olaf
2010-01-01
Frequency selectivity in the human auditory system is often measured using simultaneous masking of tones presented in notched noise. Based on such masking data, the equivalent rectangular bandwidth (ERB) of the auditory filters can be derived by applying the power spectrum model of masking....... Considering bandwidth estimates from previous studies based on forward masking, only average data across a number of subjects have been considered. The present study is concerned with bandwidth estimates in simultaneous and forward masking in individual normal-hearing subjects. In order to investigate...... the reliability of the individual estimates, a statistical resampling method is applied. It is demonstrated that a rather large set of experimental data is required to reliably estimate auditory filter bandwidth, particularly in the case of simultaneous masking. The poor overall reliability of the filter...
Kernel bandwidth estimation for non-parametric density estimation: a comparative study
CSIR Research Space (South Africa)
Van der Walt, CM
2013-12-01
Full Text Available We investigate the performance of conventional bandwidth estimators for non-parametric kernel density estimation on a number of representative pattern-recognition tasks, to gain a better understanding of the behaviour of these estimators in high...
Bandwidth Controllable Tunable Filter for Hyper-/Multi-Spectral Imager, Phase I
National Aeronautics and Space Administration — This SBIR Phase I proposal introduces a fast speed bandwidth controllable tunable filter for hyper-/multi-spectral (HS/MS) imagers. It dynamically passes a variable...
Improvement of delay-bandwidth product in photonic crystal slow-light waveguides.
Hao, Ran; Cassan, Eric; Le Roux, Xavier; Gao, Dingshan; Do Khanh, Van; Vivien, Laurent; Marris-Morini, Delphine; Zhang, Xinliang
2010-08-02
We report new results about the improvement of delay-bandwidth product in photonic crystal slow light waveguides. Previous studies have obtained large delay-bandwidth product at the price of small average group index. It is pointed out here that the radius and the distance between the two boundary rows of holes have a key contribution for delay-bandwidth product. We show the possibility of improving this factor of merit meanwhile maintaining the same group index. We succeed in improving normal delay-bandwidth product from 0.15 to 0.35, keeping at the same time the group index unchanged at high value of 90. This optimization approach may be applicable for previous flat band slow light devices.
Ultra-low Noise, High Bandwidth, 1550nm HgCdTe APD, Phase II
National Aeronautics and Space Administration — To meet the demands of future high-capacity free space optical communications links, a high bandwidth, near infrared (NIR), single photon sensitive optoelectronic...
High-Bandwidth Photon-Counting Detectors with Enhanced Near-Infrared Response Project
National Aeronautics and Space Administration — Laser optical communications offer the potential to dramatically increase the link bandwidth and decrease the emitter power in long-range space communications....
Single-channel labyrinthine metasurfaces as perfect sound absorbers with tunable bandwidth
Liu, Liu; Chang, Huiting; Zhang, Chi; Hu, Xinhua
2017-08-01
Perfect sound absorbers with a deep-subwavelength thickness are important to applications such as noise reduction and sound detection. But their absorption bandwidths are usually narrow and difficult to adjust. A recent solution for this problem relies on multiple-resonator metasurfaces, which are hard to fabricate. Here, we report on the design, fabrication, and characterization of a single-channel labyrinthine metasurface, which allows total sound absorption at resonant frequency when appropriate amounts of porous media (or critical sound losses) are introduced in the channels. The absorption bandwidth can be tuned by changing the cross-sectional areas of channels. A tradeoff is found between the absorption bandwidth and the metasurface thickness. However, large tunability in the relative absorption bandwidth (from 17% to 121%) is still attainable by such metasurfaces with a deep-subwavelength thickness (0.03-0.13λ).
A 750MHz and a 8GHz High Bandwidth Digital FFT Spectrometer, Phase I
National Aeronautics and Space Administration — The scope of this project is to to develop a wide bandwidth, low power, and compact single board digital Fast Fourier Transform spectrometer (FFTS) optimized for the...
Credit allocation for research institutes
Wang, J.-P.; Guo, Q.; Yang, K.; Han, J.-T.; Liu, J.-G.
2017-05-01
It is a challenging work to assess research performance of multiple institutes. Considering that it is unfair to average the credit to the institutes which is in the different order from a paper, in this paper, we present a credit allocation method (CAM) with a weighted order coefficient for multiple institutes. The results for the APS dataset with 18987 institutes show that top-ranked institutes obtained by the CAM method correspond to well-known universities or research labs with high reputation in physics. Moreover, we evaluate the performance of the CAM method when citation links are added or rewired randomly quantified by the Kendall's Tau and Jaccard index. The experimental results indicate that the CAM method has better performance in robustness compared with the total number of citations (TC) method and Shen's method. Finally, we give the first 20 Chinese universities in physics obtained by the CAM method. However, this method is valid for any other branch of sciences, not just for physics. The proposed method also provides universities and policy makers an effective tool to quantify and balance the academic performance of university.
Time allocation of disabled individuals.
Pagán, Ricardo
2013-05-01
Although some studies have analysed the disability phenomenon and its effect on, for example, labour force participation, wages, job satisfaction, or the use of disability pension, the empirical evidence on how disability steals time (e.g. hours of work) from individuals is very scarce. This article examines how disabled individuals allocate their time to daily activities as compared to their non-disabled counterparts. Using time diary information from the Spanish Time Use Survey (last quarter of 2002 and the first three quarters of 2003), we estimate the determinants of time (minutes per day) spent on four aggregate categories (market work, household production, tertiary activities and leisure) for a sample of 27,687 non-disabled and 5250 disabled individuals and decompose the observed time differential by using the Oaxaca-Blinder methodology. The results show that disabled individuals devote less time to market work (especially females), and more time to household production (e.g. cooking, cleaning, child care), tertiary activities (e.g., sleeping, personal care, medical treatment) and leisure activities. We also find a significant effect of age on the time spent on daily activities and important differences by gender and disability status. The results are consistent with the hypothesis that disability steals time, and reiterate the fact that more public policies are needed to balance working life and health concerns among disabled individuals. Copyright © 2013 Elsevier Ltd. All rights reserved.
Resource allocation based on cost efficiency
DEFF Research Database (Denmark)
Dehnokhalaji, Akram; Ghiyasi, Mojtaba; Korhonen, Pekka
2017-01-01
In this paper, we consider a resource allocation (RA) problem and develop an approach based on cost (overall) efficiency. The aim is to allocate some inputs among decision making units (DMUs) in such way that their cost efficiencies improve or stay unchanged after RA. We formulate a multi...... examples and an empirical illustration are also provided....
'Unconscionable and irrational' SAPS human resource allocation ...
African Journals Online (AJOL)
These areas also suffer among the highest rates of murder and serious violent crime in the province. The allocation of human resources to policing impinges on various constitutional rights. Given the inequity and irrationality apparent in the allocation of police personnel, the Khayelitsha Commission recommended that this ...
Nash Social Welfare in Multiagent Resource Allocation
S. Ramezani (Sara); U. Endriss; E. David; E.H. Gerding (Enrico); D. Sarne; O. Shehory (Onn)
2010-01-01
htmlabstractWe study different aspects of the multiagent resource allocation problem when the objective is to find an allocation that maximizes Nash social welfare, the product of the utilities of the individual agents. The Nash solution is an important welfare criterion that combines efficiency and
Obtaining a Proportional Allocation by Deleting Items
Dorn, B.; de Haan, R.; Schlotter, I.; Röthe, J.
2017-01-01
We consider the following control problem on fair allocation of indivisible goods. Given a set I of items and a set of agents, each having strict linear preference over the items, we ask for a minimum subset of the items whose deletion guarantees the existence of a proportional allocation in the
Risk and reliability allocation to risk control
International Nuclear Information System (INIS)
Vojnovic, D.; Kozuh, M.
1992-01-01
The risk allocation procedure is used as an analytical model to support the optimal decision making for reliability/availability improvement planning. Both levels of decision criteria, the plant risk measures and plant performance indices, are used in risk allocation procedure. Decision support system uses the multi objective decision making concept. (author) [sl
Optimal Allocation in Stratified Randomized Response Model
Directory of Open Access Journals (Sweden)
Javid Shabbir
2005-07-01
Full Text Available A Warner (1965 randomized response model based on stratification is used to determine the allocation of samples. Both linear and log-linear cost functions are discussed under uni and double stratification. It observed that by using a log-linear cost function, one can get better allocations.