Auction-based bandwidth allocation in the Internet

Science.gov (United States)

Wei, Jiaolong; Zhang, Chi

2002-07-01

It has been widely accepted that auctioning which is the pricing approach with minimal information requirement is a proper tool to manage scare network resources. Previous works focus on Vickrey auction which is incentive compatible in classic auction theory. In the beginning of this paper, the faults of the most representative auction-based mechanisms are discussed. And then a new method called uniform-price auction (UPA), which has the simplest auction rule is proposed and it's incentive compatibility in the network environment is also proved. Finally, the basic mode is extended to support applications which require minimum bandwidth guarantees for a given time period by introducing derivative market, and a market mechanism for network resource allocation which is predictable, riskless, and simple for end-users is completed.

Bandwidth and power allocation for two-way relaying in overlay cognitive radio systems

KAUST Repository

Alsharoa, Ahmad M.; Ghazzai, Hakim; Yaacoub, Elias E.; Alouini, Mohamed-Slim

2014-01-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

Bandwidth Allocation Considering Priorities among Multimedia Components in Mobile Networks

OpenAIRE

Shigeki, Shiokawa; Shuji, Tasaka

2001-01-01

This paper proposes a bandwidth allocation scheme which improves degradation of communication quality due to handoffs in mobile multimedia networks. In general, a multimedia call consists of several component calls. For example, a video phone call consists of a voice call and a video call. In realistic environments, each component call included in one multimedia call may have different requirements for quality-of-service (QoS) from each other, and priorities among these component calls often ...

A multiprocessor computer simulation model employing a feedback scheduler/allocator for memory space and bandwidth matching and TMR processing

Science.gov (United States)

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.

An intelligent allocation algorithm for parallel processing

Science.gov (United States)

Carroll, Chester C.; Homaifar, Abdollah; Ananthram, Kishan G.

1988-01-01

The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

Cluster Formation and Joint Power-Bandwidth Allocation for Imperfect NOMA in DL-HetNets

KAUST Repository

Celik, Abdulkadir; Al-Qahtani, Fawaz; Radaydeh, Redha; Alouini, Mohamed-Slim

2017-01-01

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

An enhanced DWBA algorithm in hybrid WDM/TDM EPON networks with heterogeneous propagation delays

Science.gov (United States)

Li, Chengjun; Guo, Wei; Jin, Yaohui; Sun, Weiqiang; Hu, Weisheng

2011-12-01

An enhanced dynamic wavelength and bandwidth allocation (DWBA) algorithm in hybrid WDM/TDM PON is proposed and experimentally demonstrated. In addition to the fairness of bandwidth allocation, this algorithm also considers the varying propagation delays between ONUs and OLT. The simulation based on MATLAB indicates that the improved algorithm has a better performance compared with some other algorithms.

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.

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

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.

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.

Bandwidth allocation for video under quality of service constraints

CERN Document Server

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

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

Energy-efficient routing, modulation and spectrum allocation in elastic optical networks

Science.gov (United States)

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.

Analysis of Online DBA Algorithm with Adaptive Sleep Cycle in WDM EPON

Science.gov (United States)

Pajčin, Bojan; Matavulj, Petar; Radivojević, Mirjana

2018-05-01

In order to manage Quality of Service (QoS) and energy efficiency in the optical access network, an online Dynamic Bandwidth Allocation (DBA) algorithm with adaptive sleep cycle is presented. This DBA algorithm has the ability to allocate an additional bandwidth to the end user within a single sleep cycle whose duration changes depending on the current buffers occupancy. The purpose of this DBA algorithm is to tune the duration of the sleep cycle depending on the network load in order to provide service to the end user without violating strict QoS requests in all network operating conditions.

Holding-time-aware asymmetric spectrum allocation in virtual optical networks

Science.gov (United States)

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.

Multi-robot task allocation based on two dimensional artificial fish swarm algorithm

Science.gov (United States)

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.

Priority and Negotiation Based Dynamic Spectrum Allocation Scheme for Multiple Radio Access Network Operators

Science.gov (United States)

Kim, Hoon; Hyon, Taein; Lee, Yeonwoo

Most of previous works have presented the dynamic spectrum allocation (DSA) gain achieved by utilizing the time or regional variations in traffic demand between multi-network operators (NOs). In this paper, we introduce the functionalities required for the entities related with the spectrum sharing and allocation and propose a spectrum allocation algorithm while considering the long-term priority between NOs, the priority between multiple class services, and the urgent bandwidth request. To take into account the priorities among the NOs and the priorities of multiple class services, a spectrum sharing metric (SSM) is proposed, while a negotiation procedure is proposed to treat the urgent bandwidth request.

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.

The implement of Talmud property allocation algorithm based on graphic point-segment way

Science.gov (United States)

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.

A mechanism design approach to bandwidth allocation in tactical data networks

Science.gov (United States)

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.

Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm

Directory of Open Access Journals (Sweden)

T.P. Shabeera

2017-04-01

Full Text Available Nowadays data-intensive applications for processing big data are being hosted in the cloud. Since the cloud environment provides virtualized resources for computation, and data-intensive applications require communication between the computing nodes, the placement of Virtual Machines (VMs and location of data affect the overall computation time. Majority of the research work reported in the current literature consider the selection of physical nodes for placing data and VMs as independent problems. This paper proposes an approach which considers VM placement and data placement hand in hand. The primary objective is to reduce cross network traffic and bandwidth usage, by placing required number of VMs and data in Physical Machines (PMs which are physically closer. The VM and data placement problem (referred as MinDistVMDataPlacement problem is defined in this paper and has been proved to be NP- Hard. This paper presents and evaluates a metaheuristic algorithm based on Ant Colony Optimization (ACO, which selects a set of adjacent PMs for placing data and VMs. Data is distributed in the physical storage devices of the selected PMs. According to the processing capacity of each PM, a set of VMs are placed on these PMs to process data stored in them. We use simulation to evaluate our algorithm. The results show that the proposed algorithm selects PMs in close proximity and the jobs executed in the VMs allocated by the proposed scheme outperforms other allocation schemes.

Balanced Bipartite Graph Based Register Allocation for Network Processors in Mobile and Wireless Networks

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.

Can abnormal returns be earned on bandwidth-bounded currencies? Evidence from a genetic algorithm

OpenAIRE

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

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.

Research on multirobot pursuit task allocation algorithm based on emotional cooperation factor.

Science.gov (United States)

Fang, Baofu; Chen, Lu; Wang, Hao; Dai, Shuanglu; Zhong, Qiubo

2014-01-01

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.

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.

A high performance long-reach passive optical network with a novel excess bandwidth distribution scheme

Science.gov (United States)

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.

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

Space-bandwidth ratio as a means of choosing between Fresnel and other linear canonical transform algorithms.

Science.gov (United States)

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.

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.

Bandwidth auction for SVC streaming in dynamic multi-overlay

Science.gov (United States)

Xiong, Yanting; Zou, Junni; Xiong, Hongkai

2010-07-01

In this paper, we study the optimal bandwidth allocation for scalable video coding (SVC) streaming in multiple overlays. We model the whole bandwidth request and distribution process as a set of decentralized auction games between the competing peers. For the upstream peer, a bandwidth allocation mechanism is introduced to maximize the aggregate revenue. For the downstream peer, a dynamic bidding strategy is proposed. It achieves maximum utility and efficient resource usage by collaborating with a content-aware layer dropping/adding strategy. Also, the convergence of the proposed auction games is theoretically proved. Experimental results show that the auction strategies can adapt to dynamic join of competing peers and video layers.

Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms

OpenAIRE

Luo, Zihan; Armour, Simon; McGeehan, Joe

2015-01-01

This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network. An exhaustive search is initially implementedto guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly selected termination conditions is used in the same network. The simulation results show that the genet...

Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation

Science.gov (United States)

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

Stochastic resource allocation in emergency departments with a multi-objective simulation optimization algorithm.

Science.gov (United States)

Feng, Yen-Yi; Wu, I-Chin; Chen, Tzu-Li

2017-03-01

The number of emergency cases or emergency room visits rapidly increases annually, thus leading to an imbalance in supply and demand and to the long-term overcrowding of hospital emergency departments (EDs). However, current solutions to increase medical resources and improve the handling of patient needs are either impractical or infeasible in the Taiwanese environment. Therefore, EDs must optimize resource allocation given limited medical resources to minimize the average length of stay of patients and medical resource waste costs. This study constructs a multi-objective mathematical model for medical resource allocation in EDs in accordance with emergency flow or procedure. The proposed mathematical model is complex and difficult to solve because its performance value is stochastic; furthermore, the model considers both objectives simultaneously. Thus, this study develops a multi-objective simulation optimization algorithm by integrating a non-dominated sorting genetic algorithm II (NSGA II) with multi-objective computing budget allocation (MOCBA) to address the challenges of multi-objective medical resource allocation. NSGA II is used to investigate plausible solutions for medical resource allocation, and MOCBA identifies effective sets of feasible Pareto (non-dominated) medical resource allocation solutions in addition to effectively allocating simulation or computation budgets. The discrete event simulation model of ED flow is inspired by a Taiwan hospital case and is constructed to estimate the expected performance values of each medical allocation solution as obtained through NSGA II. Finally, computational experiments are performed to verify the effectiveness and performance of the integrated NSGA II and MOCBA method, as well as to derive non-dominated medical resource allocation solutions from the algorithms.

An Optimization Algorithm for Multipath Parallel Allocation for Service Resource in the Simulation Task Workflow

Directory of Open Access Journals (Sweden)

Zhiteng Wang

2014-01-01

Full Text Available Service oriented modeling and simulation are hot issues in the field of modeling and simulation, and there is need to call service resources when simulation task workflow is running. How to optimize the service resource allocation to ensure that the task is complete effectively is an important issue in this area. In military modeling and simulation field, it is important to improve the probability of success and timeliness in simulation task workflow. Therefore, this paper proposes an optimization algorithm for multipath service resource parallel allocation, in which multipath service resource parallel allocation model is built and multiple chains coding scheme quantum optimization algorithm is used for optimization and solution. The multiple chains coding scheme quantum optimization algorithm is to extend parallel search space to improve search efficiency. Through the simulation experiment, this paper investigates the effect for the probability of success in simulation task workflow from different optimization algorithm, service allocation strategy, and path number, and the simulation result shows that the optimization algorithm for multipath service resource parallel allocation is an effective method to improve the probability of success and timeliness in simulation task workflow.

The Wireless Craze, The Unlimited Bandwidth Myth, The Spectrum Auction Faux Pas, and the Punchline to Ronald Coase's 'Big Joke': An Essay on Airwave Allocation Policy

OpenAIRE

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

Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm

International Nuclear Information System (INIS)

Zu Yun-Xiao; Zhou Jie

2012-01-01

Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algorithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate. (geophysics, astronomy, and astrophysics)

An Ameliorative Whale Optimization Algorithm for Multi-Objective Optimal Allocation of Water Resources in Handan, China

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.

A combinatorial approximation algorithm for CDMA downlink rate allocation

NARCIS (Netherlands)

Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard; Raghavan, S.; Anandalingam, G.

2006-01-01

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

A combinatorial approximation algorithm for CDMA downlink rate allocation

NARCIS (Netherlands)

Boucherie, Richardus J.; Bumb, A.F.; Endrayanto, A.I.; Woeginger, Gerhard

2004-01-01

This paper presents a combinatorial algorithm for downlink rate allocation in Code Division Multiple Access (CDMA) mobile networks. By discretizing the coverage area into small segments, the transmit power requirements are characterized via a matrix representation that separates user and system

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.

Path connectivity based spectral defragmentation in flexible bandwidth networks.

Science.gov (United States)

Wang, Ying; Zhang, Jie; Zhao, Yongli; Zhang, Jiawei; Zhao, Jie; Wang, Xinbo; Gu, Wanyi

2013-01-28

Optical networks with flexible bandwidth provisioning have become a very promising networking architecture. It enables efficient resource utilization and supports heterogeneous bandwidth demands. In this paper, two novel spectrum defragmentation approaches, i.e. Maximum Path Connectivity (MPC) algorithm and Path Connectivity Triggering (PCT) algorithm, are proposed based on the notion of Path Connectivity, which is defined to represent the maximum variation of node switching ability along the path in flexible bandwidth networks. A cost-performance-ratio based profitability model is given to denote the prons and cons of spectrum defragmentation. We compare these two proposed algorithms with non-defragmentation algorithm in terms of blocking probability. Then we analyze the differences of defragmentation profitability between MPC and PCT algorithms.

Bandwidth extension of speech using perceptual criteria

CERN Document Server

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

Energy efficiency in elastic-bandwidth optical networks

DEFF Research Database (Denmark)

Vizcaino, Jorge Lopez; Ye, Yabin; Tafur Monroy, Idelfonso

2011-01-01

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

modeling the effect of bandwidth allocation on network performance

African Journals Online (AJOL)

Using MATLAB, simulations were then .... of the network resource. Network bandwidth design, simulation, and management ... encoder processes longer signal data blocks, which entails longer ... c is the modulated signal carrier. However, the ...

Resource allocation in smart homes based on Banker's algorithm

NARCIS (Netherlands)

Virag, A.; Bogdan, S.

2011-01-01

This paper proposes a method for improved energy management in smart homes by means of resource allocation. For this purpose, a Banker's algorithm based strategy has been developed. It is used to control the system and decide which of the given processes should be provided with resources at the

Irrigation water allocation optimization using multi-objective evolutionary algorithm (MOEA) - a review

Science.gov (United States)

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.

A hybrid Jaya algorithm for reliability-redundancy allocation problems

Science.gov (United States)

Ghavidel, Sahand; Azizivahed, Ali; Li, Li

2018-04-01

This article proposes an efficient improved hybrid Jaya algorithm based on time-varying acceleration coefficients (TVACs) and the learning phase introduced in teaching-learning-based optimization (TLBO), named the LJaya-TVAC algorithm, for solving various types of nonlinear mixed-integer reliability-redundancy allocation problems (RRAPs) and standard real-parameter test functions. RRAPs include series, series-parallel, complex (bridge) and overspeed protection systems. The search power of the proposed LJaya-TVAC algorithm for finding the optimal solutions is first tested on the standard real-parameter unimodal and multi-modal functions with dimensions of 30-100, and then tested on various types of nonlinear mixed-integer RRAPs. The results are compared with the original Jaya algorithm and the best results reported in the recent literature. The optimal results obtained with the proposed LJaya-TVAC algorithm provide evidence for its better and acceptable optimization performance compared to the original Jaya algorithm and other reported optimal results.

Bandwidth-sharing in LHCONE, an analysis of the problem

Science.gov (United States)

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

Modeling the Effect of Bandwidth Allocation on Network Performance

African Journals Online (AJOL)

... The proposed model showed improved performance for CDMA networks, but further increase in the bandwidth did not benefit the network; (iii) A reliability measure such as the spectral efficiency is therefore useful to redeem the limitation in (ii). Keywords: Coverage Capacity, CDMA, Mobile Network, Network Throughput ...

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

Cluster Formation and Joint Power-Bandwidth Allocation for Imperfect NOMA in DL-HetNets

KAUST Repository

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.

Application of genetic algorithm for reliability allocation in nuclear power plants

International Nuclear Information System (INIS)

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

1999-01-01

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

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.

Adaptive Cross-Layer Distributed Energy-Efficient Resource Allocation Algorithms for Wireless Data Networks

Directory of Open Access Journals (Sweden)

Daniela Saturnino

2008-10-01

Full Text Available 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.

Efficient Bandwidth Management for Ethernet Passive Optical Networks

KAUST Repository

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

A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines

Directory of Open Access Journals (Sweden)

Diamantidis A. C.

2004-01-01

Full Text Available In this study, the buffer allocation problem (BAP in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990, for the performance evaluation (i.e., estimation of throughput of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.

A Thrust Allocation Method for Efficient Dynamic Positioning of a Semisubmersible Drilling Rig Based on the Hybrid Optimization Algorithm

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.

An Optimal Online Resource Allocation Algorithm for Energy Harvesting Body Area Networks

Directory of Open Access Journals (Sweden)

Guangyuan Wu

2018-01-01

Full Text Available In Body Area Networks (BANs, how to achieve energy management to extend the lifetime of the body area networks system is one of the most critical problems. In this paper, we design a body area network system powered by renewable energy, in which the sensors carried by patient with energy harvesting module can transmit data to a personal device. We do not require any a priori knowledge of the stochastic nature of energy harvesting and energy consumption. We formulate a user utility optimization problem. We use Lyapunov Optimization techniques to decompose the problem into three sub-problems, i.e., battery management, collecting rate control and transmission power allocation. We propose an online resource allocation algorithm to achieve two major goals: (1 balancing sensors’ energy harvesting and energy consumption while stabilizing the BANs system; and (2 maximizing the user utility. Performance analysis addresses required battery capacity, bounded data queue length and optimality of the proposed algorithm. Simulation results verify the optimization of algorithm.

Collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation

Science.gov (United States)

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.

Estimation of Distribution Algorithm for Resource Allocation in Green Cooperative Cognitive Radio Sensor Networks

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.

A trust-based sensor allocation algorithm in cooperative space search problems

Science.gov (United States)

Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

2011-06-01

Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

A cooperative online learning scheme for resource allocation in 5G systems

KAUST Repository

Alqerm, Ismail; Shihada, Basem

2016-01-01

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.

A cooperative online learning scheme for resource allocation in 5G systems

KAUST Repository

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.

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.

Optimal Power Allocation Algorithm for Radar Network Systems Based on Low Probability of Intercept Optimization(in English

Directory of Open Access Journals (Sweden)

Shi Chen-guang

2014-08-01

Full Text Available A novel optimal power allocation algorithm for radar network systems is proposed for Low Probability of Intercept (LPI technology in modern electronic warfare. The algorithm is based on the LPI optimization. First, the Schleher intercept factor for a radar network is derived, and then the Schleher intercept factor is minimized by optimizing the transmission power allocation among netted radars in the network to guarantee target-tracking performance. Furthermore, the Nonlinear Programming Genetic Algorithm (NPGA is used to solve the resulting nonconvex, nonlinear, and constrained optimization problem. Numerical simulation results show the effectiveness of the proposed algorithm.

A Novel Sensor Selection and Power Allocation Algorithm for Multiple-Target Tracking in an LPI Radar Network

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.

Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

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.

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

Development of algorithm for depreciation costs allocation in dynamic input-output industrial enterprise model

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.

A Knowledge-Informed and Pareto-Based Artificial Bee Colony Optimization Algorithm for Multi-Objective Land-Use Allocation

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.

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.

Reliability–redundancy allocation problem considering optimal redundancy strategy using parallel genetic algorithm

International Nuclear Information System (INIS)

Kim, Heungseob; Kim, Pansoo

2017-01-01

To maximize the reliability of a system, the traditional reliability–redundancy allocation problem (RRAP) determines the component reliability and level of redundancy for each subsystem. This paper proposes an advanced RRAP that also considers the optimal redundancy strategy, either active or cold standby. In addition, new examples are presented for it. Furthermore, the exact reliability function for a cold standby redundant subsystem with an imperfect detector/switch is suggested, and is expected to replace the previous approximating model that has been used in most related studies. A parallel genetic algorithm for solving the RRAP as a mixed-integer nonlinear programming model is presented, and its performance is compared with those of previous studies by using numerical examples on three benchmark problems. - Highlights: • Optimal strategy is proposed to solve reliability redundancy allocation problem. • The redundancy strategy uses parallel genetic algorithm. • Improved reliability function for a cold standby subsystem is suggested. • Proposed redundancy strategy enhances the system reliability.

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.

An Optimal Joint User Association and Power Allocation Algorithm for Secrecy Information Transmission in Heterogeneous Networks

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.

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 optical resource allocation for mobile core networks with software defined elastic optical networking.

Science.gov (United States)

Zhao, Yongli; Chen, Zhendong; Zhang, Jie; Wang, Xinbo

2016-07-25

Driven by the forthcoming of 5G mobile communications, the all-IP architecture of mobile core networks, i.e. evolved packet core (EPC) proposed by 3GPP, has been greatly challenged by the users' demands for higher data rate and more reliable end-to-end connection, as well as operators' demands for low operational cost. These challenges can be potentially met by software defined optical networking (SDON), which enables dynamic resource allocation according to the users' requirement. In this article, a novel network architecture for mobile core network is proposed based on SDON. A software defined network (SDN) controller is designed to realize the coordinated control over different entities in EPC networks. We analyze the requirement of EPC-lightpath (EPCL) in data plane and propose an optical switch load balancing (OSLB) algorithm for resource allocation in optical layer. The procedure of establishment and adjustment of EPCLs is demonstrated on a SDON-based EPC testbed with extended OpenFlow protocol. We also evaluate the OSLB algorithm through simulation in terms of bandwidth blocking ratio, traffic load distribution, and resource utilization ratio compared with link-based load balancing (LLB) and MinHops algorithms.

Ant Colony Optimization Algorithm for Centralized Dynamic Channel Allocation in Multi-Cell OFDMA Systems

Science.gov (United States)

Kim, Hyo-Su; Kim, Dong-Hoi

The dynamic channel allocation (DCA) scheme in multi-cell systems causes serious inter-cell interference (ICI) problem to some existing calls when channels for new calls are allocated. Such a problem can be addressed by advanced centralized DCA design that is able to minimize ICI. Thus, in this paper, a centralized DCA is developed for the downlink of multi-cell orthogonal frequency division multiple access (OFDMA) systems with full spectral reuse. However, in practice, as the search space of channel assignment for centralized DCA scheme in multi-cell systems grows exponentially with the increase of the number of required calls, channels, and cells, it becomes an NP-hard problem and is currently too complicated to find an optimum channel allocation. In this paper, we propose an ant colony optimization (ACO) based DCA scheme using a low-complexity ACO algorithm which is a kind of heuristic algorithm in order to solve the aforementioned problem. Simulation results demonstrate significant performance improvements compared to the existing schemes in terms of the grade of service (GoS) performance and the forced termination probability of existing calls without degrading the system performance of the average throughput.

Probabilistic Bandwidth Assignment in Wireless Sensor Networks

OpenAIRE

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

Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm

Institute of Scientific and Technical Information of China (English)

Guo Jiansheng; Wang Zutong; Zheng Mingfa; Wang Ying

2014-01-01

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 Dynamic Spectrum Allocation Algorithm for a Maritime Cognitive Radio Communication System Based on a Queuing Model

Directory of Open Access Journals (Sweden)

Jingbo Zhang

2017-09-01

Full Text Available With the rapid development of maritime digital communication, the demand for spectrum resources is increasing, and building a maritime cognitive radio communication system is an effective solution. In this paper, the problem of how to effectively allocate the spectrum for secondary users (SUs with different priorities in a maritime cognitive radio communication system is studied. According to the characteristics of a maritime cognitive radio and existing research about cognitive radio systems, this paper establishes a centralized maritime cognitive radio communication model and creates a simplified queuing model with two queues for the communication model. In the view of the behaviors of SUs and primary users (PUs, we propose a dynamic spectrum allocation (DSA algorithm based on the system status, and analyze it with a two-dimensional Markov chain. Simulation results show that, when different types of SUs have similar arrival rates, the algorithm can vary the priority factor according to the change of users’ status in the system, so as to adjust the channel allocation, decreasing system congestion. The improvement of the algorithm is about 7–26%, and the specific improvement is negatively correlated with the SU arrival rate.

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

Computationally Efficient Power Allocation Algorithm in Multicarrier-Based Cognitive Radio Networks: OFDM and FBMC Systems

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.

DSTATCOM allocation in distribution networks considering reconfiguration using differential evolution algorithm

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.

Test scheduling optimization for 3D network-on-chip based on cloud evolutionary algorithm of Pareto multi-objective

Science.gov (United States)

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.

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)

Data analysis-based autonomic bandwidth adjustment in software defined multi-vendor optical transport networks.

Science.gov (United States)

Li, Yajie; Zhao, Yongli; Zhang, Jie; Yu, Xiaosong; Jing, Ruiquan

2017-11-27

Network operators generally provide dedicated lightpaths for customers to meet the demand for high-quality transmission. Considering the variation of traffic load, customers usually rent peak bandwidth that exceeds the practical average traffic requirement. In this case, bandwidth provisioning is unmetered and customers have to pay according to peak bandwidth. Supposing that network operators could keep track of traffic load and allocate bandwidth dynamically, bandwidth can be provided as a metered service and customers would pay for the bandwidth that they actually use. To achieve cost-effective bandwidth provisioning, this paper proposes an autonomic bandwidth adjustment scheme based on data analysis of traffic load. The scheme is implemented in a software defined networking (SDN) controller and is demonstrated in the field trial of multi-vendor optical transport networks. The field trial shows that the proposed scheme can track traffic load and realize autonomic bandwidth adjustment. In addition, a simulation experiment is conducted to evaluate the performance of the proposed scheme. We also investigate the impact of different parameters on autonomic bandwidth adjustment. Simulation results show that the step size and adjustment period have significant influences on bandwidth savings and packet loss. A small value of step size and adjustment period can bring more benefits by tracking traffic variation with high accuracy. For network operators, the scheme can serve as technical support of realizing bandwidth as metered service in the future.

Hybrid digital-analog coding with bandwidth expansion for correlated Gaussian sources under Rayleigh fading

Science.gov (United States)

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.

A Hierarchical Auction-Based Mechanism for Real-Time Resource Allocation in Cloud Robotic Systems.

Science.gov (United States)

Wang, Lujia; Liu, Ming; Meng, Max Q-H

2017-02-01

Cloud computing enables users to share computing resources on-demand. The cloud computing framework cannot be directly mapped to cloud robotic systems with ad hoc networks since cloud robotic systems have additional constraints such as limited bandwidth and dynamic structure. However, most multirobotic applications with cooperative control adopt this decentralized approach to avoid a single point of failure. Robots need to continuously update intensive data to execute tasks in a coordinated manner, which implies real-time requirements. Thus, a resource allocation strategy is required, especially in such resource-constrained environments. This paper proposes a hierarchical auction-based mechanism, namely link quality matrix (LQM) auction, which is suitable for ad hoc networks by introducing a link quality indicator. The proposed algorithm produces a fast and robust method that is accurate and scalable. It reduces both global communication and unnecessary repeated computation. The proposed method is designed for firm real-time resource retrieval for physical multirobot systems. A joint surveillance scenario empirically validates the proposed mechanism by assessing several practical metrics. The results show that the proposed LQM auction outperforms state-of-the-art algorithms for resource allocation.

Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems.

Science.gov (United States)

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.

Multi-objective hierarchical genetic algorithms for multilevel redundancy allocation optimization

Energy Technology Data Exchange (ETDEWEB)

Kumar, Ranjan [Department of Aeronautics and Astronautics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)], E-mail: ranjan.k@ks3.ecs.kyoto-u.ac.jp; Izui, Kazuhiro [Department of Aeronautics and Astronautics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)], E-mail: izui@prec.kyoto-u.ac.jp; Yoshimura, Masataka [Department of Aeronautics and Astronautics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)], E-mail: yoshimura@prec.kyoto-u.ac.jp; Nishiwaki, Shinji [Department of Aeronautics and Astronautics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)], E-mail: shinji@prec.kyoto-u.ac.jp

2009-04-15

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.

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

Software defined multi-OLT passive optical network for flexible traffic allocation

Science.gov (United States)

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

IMPLEMENTASI MANAJEMEN BANDWIDTH DENGAN DISIPLIN ANTRIAN HIERARCHICAL TOKEN BUCKET (HTB PADA SISTEM OPERASI LINUX

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.

Implementasi Manajemen Bandwidth Dengan Disiplin Antrian Hierarchical Token Bucket (HTB Pada Sistem Operasi Linux

Directory of Open Access Journals (Sweden)

Muhammad Nugraha

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

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

A Novel LTE Scheduling Algorithm for Green Technology in Smart Grid

Science.gov (United States)

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.

Science.gov (United States)

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.

Resource allocation using ANN in LTE

Science.gov (United States)

Yigit, Tuncay; Ersoy, Mevlut

2017-07-01

LTE is the 4th generation wireless network technology, which provides flexible bandwidth, higher data speeds and lower delay. Difficulties may be experienced upon an increase in the number of users in LTE. The objective of this study is to ensure a faster solution to any such resource allocation problems which might arise upon an increase in the number of users. A fast and effective solution has been obtained by making use of Artificial Neural Network. As a result, fast working artificial intelligence methods may be used in resource allocation problems during operation.

Waste Load Allocation Based on Total Maximum Daily Load Approach Using the Charged System Search (CSS Algorithm

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.

EMG-Torque Dynamics Change With Contraction Bandwidth.

Science.gov (United States)

Golkar, Mahsa A; Jalaleddini, Kian; Kearney, Robert E

2018-04-01

An accurate model for ElectroMyoGram (EMG)-torque dynamics has many uses. One of its applications which has gained high attention among researchers is its use, in estimating the muscle contraction level for the efficient control of prosthesis. In this paper, the dynamic relationship between the surface EMG and torque during isometric contractions at the human ankle was studied using system identification techniques. Subjects voluntarily modulated their ankle torque in dorsiflexion direction, by activating their tibialis anterior muscle, while tracking a pseudo-random binary sequence in a torque matching task. The effects of contraction bandwidth, described by torque spectrum, on EMG-torque dynamics were evaluated by varying the visual command switching time. Nonparametric impulse response functions (IRF) were estimated between the processed surface EMG and torque. It was demonstrated that: 1) at low contraction bandwidths, the identified IRFs had unphysiological anticipatory (i.e., non-causal) components, whose amplitude decreased as the contraction bandwidth increased. We hypothesized that this non-causal behavior arose, because the EMG input contained a component due to feedback from the output torque, i.e., it was recorded from within a closed-loop. Vision was not the feedback source since the non-causal behavior persisted when visual feedback was removed. Repeating the identification using a nonparametric closed-loop identification algorithm yielded causal IRFs at all bandwidths, supporting this hypothesis. 2) EMG-torque dynamics became faster and the bandwidth of system increased as contraction modulation rate increased. Thus, accurate prediction of torque from EMG signals must take into account the contraction bandwidth sensitivity of this system.

Distributed Bees Algorithm Parameters Optimization for a Cost Efficient Target Allocation in Swarms of Robots

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.

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

An efficient simulated annealing algorithm for the redundancy allocation problem with a choice of redundancy strategies

International Nuclear Information System (INIS)

Chambari, Amirhossain; Najafi, Amir Abbas; Rahmati, Seyed Habib A.; Karimi, Aida

2013-01-01

The redundancy allocation problem (RAP) is an important reliability optimization problem. This paper studies a specific RAP in which redundancy strategies are chosen. To do so, the choice of the redundancy strategies among active and cold standby is considered as decision variables. The goal is to select the redundancy strategy, component, and redundancy level for each subsystem such that the system reliability is maximized. Since RAP is a NP-hard problem, we propose an efficient simulated annealing algorithm (SA) to solve it. In addition, to evaluating the performance of the proposed algorithm, it is compared with well-known algorithms in the literature for different test problems. The results of the performance analysis show a relatively satisfactory efficiency of the proposed SA algorithm

An algorithm for calculating exam quality as a basis for performance-based allocation of funds at medical schools.

Science.gov (United States)

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.

An algorithm for calculating exam quality as a basis for performance-based allocation of funds at medical schools

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.

Near-optimal power allocation with PSO algorithm for MIMO cognitive networks using multiple AF two-way relays

KAUST Repository

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.

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.

Resource Allocation for the Multiband Relay Channel: A Building Block for Hybrid Wireless Networks

Directory of Open Access Journals (Sweden)

Kyounghwan Lee

2010-01-01

Full Text Available We investigate optimal resource allocation for the multiband relay channel. We find the optimal power and bandwidth allocation strategies that maximize the bounds on the capacity, by solving the corresponding max-min optimization problem. We provide sufficient conditions under which the associated max-min problem is equivalent to a supporting plane problem, which renders the solution for an arbitrary number of bands tractable. In addition, the sufficient conditions derived are general enough so that a class of utility functions can be accommodated with this formulation. As an example, we concentrate on the case where the source has two bands and the relay has a single band available and find the optimal resource allocation. We observe that joint power and bandwidth optimization always yields higher achievable rates than power optimization alone, establishing the merit of bandwidth sharing. Motivated by our analytical results, we examine a simple scenario where new channels become available for a transmitter to communicate; that is, new source to relay bands are added to a frequency division relay network. Given the channel conditions of the network, we establish the guidelines on how to allocate resources in order to achieve higher rates, depending on the relative quality of the available links.

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.

A particle-based simplified swarm optimization algorithm for reliability redundancy allocation problems

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

Optimal Golomb Ruler Sequences Generation for Optical WDM Systems: A Novel Parallel Hybrid Multi-objective Bat Algorithm

Science.gov (United States)

Bansal, Shonak; Singh, Arun Kumar; Gupta, Neena

2017-02-01

In real-life, multi-objective engineering design problems are very tough and time consuming optimization problems due to their high degree of nonlinearities, complexities and inhomogeneity. Nature-inspired based multi-objective optimization algorithms are now becoming popular for solving multi-objective engineering design problems. This paper proposes original multi-objective Bat algorithm (MOBA) and its extended form, namely, novel parallel hybrid multi-objective Bat algorithm (PHMOBA) to generate shortest length Golomb ruler called optimal Golomb ruler (OGR) sequences at a reasonable computation time. The OGRs found their application in optical wavelength division multiplexing (WDM) systems as channel-allocation algorithm to reduce the four-wave mixing (FWM) crosstalk. The performances of both the proposed algorithms to generate OGRs as optical WDM channel-allocation is compared with other existing classical computing and nature-inspired algorithms, including extended quadratic congruence (EQC), search algorithm (SA), genetic algorithms (GAs), biogeography based optimization (BBO) and big bang-big crunch (BB-BC) optimization algorithms. Simulations conclude that the proposed parallel hybrid multi-objective Bat algorithm works efficiently as compared to original multi-objective Bat algorithm and other existing algorithms to generate OGRs for optical WDM systems. The algorithm PHMOBA to generate OGRs, has higher convergence and success rate than original MOBA. The efficiency improvement of proposed PHMOBA to generate OGRs up to 20-marks, in terms of ruler length and total optical channel bandwidth (TBW) is 100 %, whereas for original MOBA is 85 %. Finally the implications for further research are also discussed.

Analysis of blocking probability for OFDM-based variable bandwidth optical network

Science.gov (United States)

Gong, Lei; Zhang, Jie; Zhao, Yongli; Lin, Xuefeng; Wu, Yuyao; Gu, Wanyi

2011-12-01

Orthogonal Frequency Division Multiplexing (OFDM) has recently been proposed as a modulation technique. For optical networks, because of its good spectral efficiency, flexibility, and tolerance to impairments, optical OFDM is much more flexible compared to traditional WDM systems, enabling elastic bandwidth transmissions, and optical networking is the future trend of development. In OFDM-based optical network the research of blocking rate has very important significance for network assessment. Current research for WDM network is basically based on a fixed bandwidth, in order to accommodate the future business and the fast-changing development of optical network, our study is based on variable bandwidth OFDM-based optical networks. We apply the mathematical analysis and theoretical derivation, based on the existing theory and algorithms, research blocking probability of the variable bandwidth of optical network, and then we will build a model for blocking probability.

4G femtocells resource allocation and interference management

CERN Document Server

Zhang, Haijun; Wen, Xiangming

2014-01-01

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

Distributed Fair Access Point Selection for Multi-Rate IEEE 802.11 WLANs

Science.gov (United States)

Gong, Huazhi; Nahm, Kitae; Kim, Jongwon

In IEEE 802.11 networks, the access point (AP) selection based on the strongest signal strength often results in the extremely unfair bandwidth allocation among mobile users (MUs). In this paper, we propose a distributed AP selection algorithm to achieve a fair bandwidth allocation for MUs. The proposed algorithm gradually balances the AP loads based on max-min fairness for the available multiple bit rate choices in a distributed manner. We analyze the stability and overhead of the proposed algorithm, and show the improvement of the fairness via computer simulation.

Designing of a Decision Support System (DSS for resource allocation with genetic algorithm approach (Case Study: Central Library of Tarbiat Modares University

Directory of Open Access Journals (Sweden)

Alireza Hasanzadeh

2014-09-01

Full Text Available The allocation of information is one of the main responsibilities of a manager. In case there is a limitation in the available resources, the issue of resources allocation is raised. Universities and post graduate centers have faced limitations in accessing resources such as budget, human resources, physical space, etc. This problem results in inappropriate use of the approved budget in buying and sharing the different types of information resources, lack of easy access to information resources by users, and users’ dissatisfaction. This paper is intended to see whether the model of genetic algorithm can be used in helping library heads of university to develop a support system for the proper allocation of resources. The data of the central library of a university as the main core of DSS through using genetic algorithm in MATLAB was used in order to come up with a better distribution of effective resources. Research methodology used in this paper was field study and survey. The findings indicated that genetic algorithm was successful in achieving this end.

Application of the hybrid Big Bang-Big Crunch algorithm to optimal reconfiguration and distributed generation power allocation in distribution systems

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

Hierarchical resource allocation for robust in-home video streaming

NARCIS (Netherlands)

Stok, van der P.D.V.; Jarnikov, D.; Kozlov, S.; Hartskamp, van M.A.; Lukkien, J.J.

2007-01-01

High quality video streaming puts high demands on network and processor resources. The bandwidth of the communication medium and the timely arrival of the frames necessitate a tight resource allocation. Given the dynamic environment where videos are started and stopped and electro-magnetic

Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm

International Nuclear Information System (INIS)

Liang, Y.-C.; Chen, Y.-C.

2007-01-01

This paper presents a meta-heuristic algorithm, variable neighborhood search (VNS), to the redundancy allocation problem (RAP). The RAP, an NP-hard problem, has attracted the attention of much prior research, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. Authors' previously published work has shown promise for the variable neighborhood descent (VND) method, the simplest version among VNS variations, on RAP. The variable neighborhood search method itself has not been used in reliability design, yet it is a method that fits those combinatorial problems with potential neighborhood structures, as in the case of the RAP. Therefore, authors further extended their work to develop a VNS algorithm for the RAP and tested a set of well-known benchmark problems from the literature. Results on 33 test instances ranging from less to severely constrained conditions show that the variable neighborhood search method improves the performance of VND and provides a competitive solution quality at economically computational expense in comparison with the best-known heuristics including ant colony optimization, genetic algorithm, and tabu search

Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm

Energy Technology Data Exchange (ETDEWEB)

Liang, Y.-C. [Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320 (China)]. E-mail: ycliang@saturn.yzu.edu.tw; Chen, Y.-C. [Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320 (China)]. E-mail: s927523@mail.yzu.edu.tw

2007-03-15

This paper presents a meta-heuristic algorithm, variable neighborhood search (VNS), to the redundancy allocation problem (RAP). The RAP, an NP-hard problem, has attracted the attention of much prior research, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. Authors' previously published work has shown promise for the variable neighborhood descent (VND) method, the simplest version among VNS variations, on RAP. The variable neighborhood search method itself has not been used in reliability design, yet it is a method that fits those combinatorial problems with potential neighborhood structures, as in the case of the RAP. Therefore, authors further extended their work to develop a VNS algorithm for the RAP and tested a set of well-known benchmark problems from the literature. Results on 33 test instances ranging from less to severely constrained conditions show that the variable neighborhood search method improves the performance of VND and provides a competitive solution quality at economically computational expense in comparison with the best-known heuristics including ant colony optimization, genetic algorithm, and tabu search.

Virtual machine consolidation enhancement using hybrid regression algorithms

Directory of Open Access Journals (Sweden)

Amany Abdelsamea

2017-11-01

Full Text Available Cloud computing data centers are growing rapidly in both number and capacity to meet the increasing demands for highly-responsive computing and massive storage. Such data centers consume enormous amounts of electrical energy resulting in high operating costs and carbon dioxide emissions. The reason for this extremely high energy consumption is not just the quantity of computing resources and the power inefficiency of hardware, but rather lies in the inefficient usage of these resources. VM consolidation involves live migration of VMs hence the capability of transferring a VM between physical servers with a close to zero down time. It is an effective way to improve the utilization of resources and increase energy efficiency in cloud data centers. VM consolidation consists of host overload/underload detection, VM selection and VM placement. Most of the current VM consolidation approaches apply either heuristic-based techniques, such as static utilization thresholds, decision-making based on statistical analysis of historical data; or simply periodic adaptation of the VM allocation. Most of those algorithms rely on CPU utilization only for host overload detection. In this paper we propose using hybrid factors to enhance VM consolidation. Specifically we developed a multiple regression algorithm that uses CPU utilization, memory utilization and bandwidth utilization for host overload detection. The proposed algorithm, Multiple Regression Host Overload Detection (MRHOD, significantly reduces energy consumption while ensuring a high level of adherence to Service Level Agreements (SLA since it gives a real indication of host utilization based on three parameters (CPU, Memory, Bandwidth utilizations instead of one parameter only (CPU utilization. Through simulations we show that our approach reduces power consumption by 6 times compared to single factor algorithms using random workload. Also using PlanetLab workload traces we show that MRHOD improves

Optimizing utilization of kidneys from deceased donors over 60 years: five-year outcomes after implementation of a combined clinical and histological allocation algorithm.

Science.gov (United States)

Pierobon, Elisa Sefora; Sefora, Pierobon Elisa; Sandrini, Silvio; Silvio, Sandrini; De Fazio, Nicola; Nicola, De Fazio; Rossini, Giuseppe; Giuseppe, Rossini; Fontana, Iris; Iris, Fontana; Boschiero, Luigino; Luigino, Boschiero; Gropuzzo, Maria; Maria, Gropuzzo; Gotti, Eliana; Eliana, Gotti; Donati, Donato; Donato, Donati; Minetti, Enrico; Enrico, Minetti; Gandolfo, Maria Teresa; Teresa, Gandolfo Maria; Brunello, Anna; Anna, Brunello; Libetta, Carmelo; Carmelo, Libetta; Secchi, Antonio; Antonio, Secchi; Chiaramonte, Stefano; Stefano, Chiaramonte; Rigotti, Paolo; Paolo, Rigotti

2013-08-01

This 5 year observational multicentre study conducted in the Nord Italian Transplant programme area evaluated outcomes in patients receiving kidneys from donors over 60 years allocated according to a combined clinical and histological algorithm. Low-risk donors 60-69 years without risk factors were allocated to single kidney transplant (LR-SKT) based on clinical criteria. Biopsy was performed in donors over 70 years or 60-69 years with risk factors, allocated to Single (HR-SKT) or Dual kidney transplant (HR-DKT) according to the severity of histological damage. Forty HR-DKTs, 41 HR-SKTs and 234 LR-SKTs were evaluated. Baseline differences generally reflected stratification and allocation criteria. Patient and graft (death censored) survival were 90% and 92% for HR-DKT, 85% and 89% for HR-SKT, 88% and 87% for LR-SKT. The algorithm appeared user-friendly in daily practice and was safe and efficient, as demonstrated by satisfactory outcomes in all groups at 5 years. Clinical criteria performed well in low-risk donors. The excellent outcomes observed in DKTs call for fine-tuning of cut-off scores for allocation to DKT or SKT in high-risk patients. © 2013 Steunstichting ESOT. Published by John Wiley & Sons Ltd.

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.

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

Scheduling language and algorithm development study. Volume 1, phase 2: Design considerations for a scheduling and resource allocation system

Science.gov (United States)

Morrell, R. A.; Odoherty, R. J.; Ramsey, H. R.; Reynolds, C. C.; Willoughby, J. K.; Working, R. D.

1975-01-01

Data and analyses related to a variety of algorithms for solving typical large-scale scheduling and resource allocation problems are presented. The capabilities and deficiencies of various alternative problem solving strategies are discussed from the viewpoint of computer system design.

An Evaluation of the WSSC (Weapon System Support Cost) Cost Allocation Algorithms. II. Installation Support.

Science.gov (United States)

1983-06-01

S XX3OXX, or XX37XX is found. As a result, the following two host-financed tenant support accounts currently will be treated as unit operations costs ... Horngren , Cost Accounting : A Managerial Emphasis, Prentice-Hall Inc., Englewood Cliffs, NJ, 1972. 10. D. B. Levine and J. M. Jondrow, "The...WSSC COST ALLOCATION Technical Report ~ALGORITHMS II: INSTALLATION SUPPORT 6. PERFORMING ORG. REPORT NUMBER 7. AUTHOR( S ) 9. CONTRACT OR GRANT NUMBER

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

at the position of the wind turbine rotor to estimate correctly the power production and the rotor loading. The method proposed in this paper solves this issue by spreading the force on the direct neighbouring cells and applying an equivalent pressure jump at the cell faces. This can potentially open......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...

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.

The Prediction of Bandwidth On Need Computer Network Through Artificial Neural Network Method of Backpropagation

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

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.

Optimal Allocation of Generalized Power Sources in Distribution Network Based on Multi-Objective Particle Swarm Optimization Algorithm

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.

Programmatic implications of implementing the relational algebraic capacitated location (RACL algorithm outcomes on the allocation of laboratory sites, test volumes, platform distribution and space requirements

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.

A game-theoretical pricing mechanism for multiuser rate allocation for video over WiMAX

Science.gov (United States)

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.

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.

Resource Allocation in a Repetitive Project Scheduling Using Genetic Algorithm

Science.gov (United States)

Samuel, Biju; Mathew, Jeeno

2018-03-01

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

Bandwidth efficient coding

CERN Document Server

Anderson, John B

2017-01-01

Bandwidth Efficient Coding addresses the major challenge in communication engineering today: how to communicate more bits of information in the same radio spectrum. Energy and bandwidth are needed to transmit bits, and bandwidth affects capacity the most. Methods have been developed that are ten times as energy efficient at a given bandwidth consumption as simple methods. These employ signals with very complex patterns and are called "coding" solutions. The book begins with classical theory before introducing new techniques that combine older methods of error correction coding and radio transmission in order to create narrowband methods that are as efficient in both spectrum and energy as nature allows. Other topics covered include modulation techniques such as CPM, coded QAM and pulse design.

An Evaluation of Different Training Sample Allocation Schemes for Discrete and Continuous Land Cover Classification Using Decision Tree-Based Algorithms

Directory of Open Access Journals (Sweden)

René Roland Colditz

2015-07-01

Full Text Available Land cover mapping for large regions often employs satellite images of medium to coarse spatial resolution, which complicates mapping of discrete classes. Class memberships, which estimate the proportion of each class for every pixel, have been suggested as an alternative. This paper compares different strategies of training data allocation for discrete and continuous land cover mapping using classification and regression tree algorithms. In addition to measures of discrete and continuous map accuracy the correct estimation of the area is another important criteria. A subset of the 30 m national land cover dataset of 2006 (NLCD2006 of the United States was used as reference set to classify NADIR BRDF-adjusted surface reflectance time series of MODIS at 900 m spatial resolution. Results show that sampling of heterogeneous pixels and sample allocation according to the expected area of each class is best for classification trees. Regression trees for continuous land cover mapping should be trained with random allocation, and predictions should be normalized with a linear scaling function to correctly estimate the total area. From the tested algorithms random forest classification yields lower errors than boosted trees of C5.0, and Cubist shows higher accuracies than random forest regression.

C-DAM: CONTENTION BASED DISTRIBUTED RESERVATION PROTOCOL ALLOCATION ALGORITHM FOR WIMEDIA MEDIUM ACCESS CONTROL

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.

Location, Allocation and Routing of Temporary Health Centers in Rural Areas in Crisis, Solved by Improved Harmony Search Algorithm

Directory of Open Access Journals (Sweden)

Mahdi Alinaghian

2017-01-01

Full Text Available In this paper, an uncertain integrated model for simultaneously locating temporary health centers in the affected areas, allocating affected areas to these centers, and routing to transport their required good is considered. Health centers can be settled in one of the affected areas or in a place out of them; therefore, the proposed model offers the best relief operation policy when it is possible to supply the goods of affected areas (which are customers of goods directly or under coverage. Due to that the problem is NP-Hard, to solve the problem in large-scale, a meta-heuristic algorithm based on harmony search algorithm is presented and its performance has been compared with basic harmony search algorithm and neighborhood search algorithm in small and large scale test problems. The results show that the proposed harmony search algorithm has a suitable efficiency.

Intelligent energy allocation strategy for PHEV charging station using gravitational search algorithm

Science.gov (United States)

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.

Auction-Based Resource Allocation for Cooperative Video Transmission Protocols over Wireless Networks

Directory of Open Access Journals (Sweden)

Zhu Han

2009-01-01

Full Text Available Cooperative transmission has been proposed as a novel transmission strategy that takes advantage of broadcast nature of wireless networks, forms virtual MIMO system, and provides diversity gains. In this paper, wireless video transmission protocols are proposed, in which the spectrum resources are first allocated for the source side to broadcast video packets to the relay and destination, and then for the relay side to transmit side information generated from the received packets. The proposed protocols are optimized to minimize the end-to-end expected distortion via choosing bandwidth/power allocation, configuration of side information, subject to bandwidth and power constraints. For multiuser cases, most of current resource allocation approaches cannot be naturally extended and applied to the networks with relay nodes for video transmission. This paper extends the share auction approach into the cooperative video communication scenarios and provides a near-optimal solution for resource allocation. Experimental results have demonstrated that the proposed approach has significant advantage of up to 4 dB gain in single user case and 1.3 dB gain in multiuser case over the reference systems in terms of peak-to-signal-noise ratio. In addition, it reduces the formidable computational complexity of the optimal solution to linear complexity with performance degradation of less than 0.3 dB.

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

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.

Using Metaheuristic Algorithms for Solving a Hub Location Problem: Application in Passive Optical Network Planning

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.

Resource allocation in networks via coalitional games

NARCIS (Netherlands)

Shams, F.

2016-01-01

The main goal of this dissertation is to manage resource allocation in network engineering problems and to introduce efficient cooperative algorithms to obtain high performance, ensuring fairness and stability. Specifically, this dissertation introduces new approaches for resource allocation in

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.

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.

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

A general framework for performance guaranteed green data center networking

OpenAIRE

Wang, Ting; Xia, Yu; Muppala, Jogesh; Hamdi, Mounir; Foufou, Sebti

2014-01-01

From the perspective of resource allocation and routing, this paper aims to save as much energy as possible in data center networks. We present a general framework, based on the blocking island paradigm, to try to maximize the network power conservation and minimize sacrifices of network performance and reliability. The bandwidth allocation mechanism together with power-aware routing algorithm achieve a bandwidth guaranteed tighter network. Besides, our fast efficient heuristics for allocatin...

An Adaptive Allocation Algorithm Using Directional CSMA/CA over mmWave Wireless Personal Area Networks

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.

An efficient subband adaptive bit and power allocation algorithm for MIMO-OFDM systems%MIMO-OFDM系统中一种高效的分子带自适应比特功率分配算法

Institute of Scientific and Technical Information of China (English)

张世超; 季仲梅; 崔维嘉

2012-01-01

自适应比特、功率分配(ABPA)可根据各子载波在频率选择性衰落信道中不同的瞬时增益,动态地分配数据比特和发射功率,从而达到优化系统性能,提高频率效率的目的.针对MIMO-OFDM系统中ABPA算法计算复杂度高的问题,本文提出了一种高效分子带ABPA算法,该算法采用新颖的分簇随机选取的方式进行子带划分及等效,将以子载波为分配单元的Fischer算法扩展为以子带为分配单元的ABPA算法,并对此算法进行改进,使其可在一次迭代过程中剔除多个比特数小于等于0的不可用簇.仿真结果表明,该算法能够在保持系统性能不变的前提下,提高筛选效率,同时可通过选择不同的簇宽度,进一步灵活地调整算法的复杂度,使其在性能与计算量之间取得良好的折衷.%According to each subcarrier's different instantaneous gain in the frequency selective channel, adaptive bit and power allocation (ABPA) can allocate data bits and transmit power dynamically, which can optimize the system performance and improve the frequency spectrum efficiency. Conventional ABPA algorithms in MIMO-OFDM systems have many problems, including high computational complexity, time consuming etc. The paper proposes an efficient sub-band ABPA algorithm, which extends the Fischer algorithm to set the sub-bands as the allocation unit instead of sub-carriers with a novel cluster randomly selecting method, at the same time enhances it by eliminating multiple un-applicable clusters during one iterative process. The simulation results show that the algorithm can increase the screening efficiency while ensure the system performance, at the same time can neatly adjust the computational complexity with choose different bandwidth of cluster, which can realize a good trade off between performance and complexity.

Task mapping for non-contiguous allocations.

Energy Technology Data Exchange (ETDEWEB)

Leung, Vitus Joseph; Bunde, David P.; Ebbers, Johnathan; Price, Nicholas W.; Swank, Matthew.; Feer, Stefan P.; Rhodes, Zachary D.

2013-02-01

This paper examines task mapping algorithms for non-contiguously allocated parallel jobs. Several studies have shown that task placement affects job running time for both contiguously and non-contiguously allocated jobs. Traditionally, work on task mapping either uses a very general model where the job has an arbitrary communication pattern or assumes that jobs are allocated contiguously, making them completely isolated from each other. A middle ground between these two cases is the mapping problem for non-contiguous jobs having a specific communication pattern. We propose several task mapping algorithms for jobs with a stencil communication pattern and evaluate them using experiments and simulations. Our strategies improve the running time of a MiniApp by as much as 30% over a baseline strategy. Furthermore, this improvement increases markedly with the job size, demonstrating the importance of task mapping as systems grow toward exascale.

Sensitivity Analysis of Linear Programming and Quadratic Programming Algorithms for Control Allocation

Science.gov (United States)

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.

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

DEFF Research Database (Denmark)

Ruvald Pedersen, Mark; Madsen, Jan

2012-01-01

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

On joint power allocation and multipath routing in femto-relay networks

OpenAIRE

Hoteit , Sahar; Duhamel , Pierre; Lasaulce , Samson

2016-01-01

International audience; —Transmit power allocation techniques are very important to manage interference in small-cell networks. While available power allocation algorithms in the literature rely on a predefined routing protocol, we propose in this paper a power-efficient two-step algorithm that allows power allocation and routing to be performed jointly in femto-relay networks. First, we propose an interference-based partitioning method to cluster the femto-relays, then we adopt an iterative ...

An approach involving dynamic group search optimization for allocating resources in OFDM-based cognitive radio system

Directory of Open Access Journals (Sweden)

Sameer Suresh Nanivadekar

2018-03-01

Full Text Available Allocation of channel resources in a cognitive radio system for achieving minimized transmission energy at an increased transmission rate is a challenging research. This paper proposes a resource allocation algorithm based on the meta-heuristic search principle. The proposed algorithm is an improved version of the Group Search Optimizer (GSO, which is a currently developed optimization algorithm that works through imitating the searching behaviour of the animals. The improvement is accomplished through introducing dynamics in the maximum pursuit angle of the GSO members. A cognitive radio system, relying on Orthogonal Frequency Division Multiplexing (OFDM for its operation, is simulated and the experimentations are carried out for sub-channel allocation. The proposed algorithm is experimentally compared with five renowned optimization algorithms, namely, conventional GSO, Particle Swarm Optimization, Genetic Algorithm, Firefly Algorithm and Artificial Bee Colony algorithm. The obtained results assert the competing performance of the proposed algorithm over the other algorithms. Keywords: Cognitive radio, OFDM, Resource, Allocation, Optimization, GSO

Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series-parallel systems

International Nuclear Information System (INIS)

Nahas, Nabil; Nourelfath, Mustapha; Ait-Kadi, Daoud

2007-01-01

The redundancy allocation problem (RAP) is a well known NP-hard problem which involves the selection of elements and redundancy levels to maximize system reliability given various system-level constraints. As telecommunications and internet protocol networks, manufacturing and power systems are becoming more and more complex, while requiring short developments schedules and very high reliability, it is becoming increasingly important to develop efficient solutions to the RAP. This paper presents an efficient algorithm to solve this reliability optimization problem. The idea of a heuristic approach design is inspired from the ant colony meta-heuristic optimization method and the degraded ceiling local search technique. Our hybridization of the ant colony meta-heuristic with the degraded ceiling performs well and is competitive with the best-known heuristics for redundancy allocation. Numerical results for the 33 test problems from previous research are reported and compared. The solutions found by our approach are all better than or are in par with the well-known best solutions

Application of the NSGA-II algorithm to a multi-period inventory-redundancy allocation problem in a series-parallel system

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.

Availability Allocation of Networked Systems Using Markov Model and Heuristics Algorithm

OpenAIRE

Li, Ruiying; Liu, Xiaoxi; Huang, Ning

2014-01-01

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

A Flexible Reservation Algorithm for Advance Network Provisioning

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Chaniotakis, Evangelos; Shoshani, Arie; Sim, Alex

2010-04-12

Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

Distributed Multi-Cell Resource Allocation with Price Based ICI Coordination in Downlink OFDMA Networks

Science.gov (United States)

Lv, Gangming; Zhu, Shihua; Hui, Hui

Multi-cell resource allocation under minimum rate request for each user in OFDMA networks is addressed in this paper. Based on Lagrange dual decomposition theory, the joint multi-cell resource allocation problem is decomposed and modeled as a limited-cooperative game, and a distributed multi-cell resource allocation algorithm is thus proposed. Analysis and simulation results show that, compared with non-cooperative iterative water-filling algorithm, the proposed algorithm can remarkably reduce the ICI level and improve overall system performances.

An Algorithm of an X-ray Hit Allocation to a Single Pixel in a Cluster and Its Test-Circuit Implementation

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.

An algorithm for routing optimization in DiffServ-aware MPLS networks

OpenAIRE

Luigi Atzori; Fabio D'Andreagiovanni; Carlo Mannino; Tatiana Onali

2010-01-01

This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propos...

An investigation of dynamic subcarrier allocation in MIMO–OFDMA systems

OpenAIRE

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

In-camera video-stream processing for bandwidth reduction in web inspection

Science.gov (United States)

Jullien, Graham A.; Li, QiuPing; Hajimowlana, S. Hossain; Morvay, J.; Conflitti, D.; Roberts, James W.; Doody, Brian C.

1996-02-01

Automated machine vision systems are now widely used for industrial inspection tasks where video-stream data information is taken in by the camera and then sent out to the inspection system for future processing. In this paper we describe a prototype system for on-line programming of arbitrary real-time video data stream bandwidth reduction algorithms; the output of the camera only contains information that has to be further processed by a host computer. The processing system is built into a DALSA CCD camera and uses a microcontroller interface to download bit-stream data to a XILINXTM FPGA. The FPGA is directly connected to the video data-stream and outputs data to a low bandwidth output bus. The camera communicates to a host computer via an RS-232 link to the microcontroller. Static memory is used to both generate a FIFO interface for buffering defect burst data, and for off-line examination of defect detection data. In addition to providing arbitrary FPGA architectures, the internal program of the microcontroller can also be changed via the host computer and a ROM monitor. This paper describes a prototype system board, mounted inside a DALSA camera, and discusses some of the algorithms currently being implemented for web inspection applications.

Modelo AHP-VIKOR para handoff espectral en redes de radio cognitiva

Directory of Open Access Journals (Sweden)

César Hernández

2015-07-01

Full Text Available This paper proposed a hybrid algorithm for spectrum allocation in cognitive radio networks based on two algorithms, analytical hierarchical process (AHP and multi-criteria optimization and compromise solution (VIKOR, for improving the performance of mobility spectrum of secondary users in cognitive radio networks. To evaluate the level of performance of the proposed algorithm, a comparative analysis between the proposed AHP-VIKOR, Grey Relational Analysis (GRA and a random allocation of spectrum (Random algorithm, is performed. The first two algorithms work with the same decision criteria: probability of channel availability, estimated time availability, signal-to-interference-plus-noise ratio and bandwidth. Unlike related work, benchmarking was validated through a trace of real spectral occupation data, captured in the GSM frequency band, which models the actual behavior of licensed users. For performance evaluation five metric were used, handoff failed average cumulative number, handoff average cumulative number, average bandwidth, delay and throughput average cumulative. The results of the comparative analysis with the other two algorithms show that the AHP-VIKOR algorithm proposed provides the best performance in spectral mobility.

Superwideband Bandwidth Extension Using Normalized MDCT Coefficients for Scalable Speech and Audio Coding

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.

Resource allocation for transmit hybrid beamforming in decoupled millimeter wave multiuser-MIMO downlink

OpenAIRE

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

Latent Dirichlet Allocation (LDA) Model and kNN Algorithm to Classify Research Project Selection

Science.gov (United States)

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.

FRCA: A Fuzzy Relevance-Based Cluster Head Selection Algorithm for Wireless Mobile Ad-Hoc Sensor Networks

Directory of Open Access Journals (Sweden)

Taegwon Jeong

2011-05-01

Full Text Available 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.

FRCA: a fuzzy relevance-based cluster head selection algorithm for wireless mobile ad-hoc sensor networks.

Science.gov (United States)

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.

Downlink User Selection and Resource Allocation for Semi-Elastic Flows in an OFDM Cell

OpenAIRE

Yang, Chao; Jordan, Scott

2013-01-01

We are concerned with user selection and resource allocation in wireless networks for semi-elastic applications such as video conferencing. While many packet scheduling algorithms have been proposed for elastic applications, and many user selection algorithms have been proposed for inelastic applications, little is known about optimal user selection and resource allocation for semi-elastic applications in wireless networks. We consider user selection and allocation of downlink transmission po...

Market-Based Resource Allocation in a Wirelessly Integrated Naval Engineering Plant

Science.gov (United States)

2009-12-01

available wireless nodes will be developed. Using a multi-agent approach based on free market economics (termed market based control) will be explored...as battery power, data storage capacity, MPU time, wireless bandwidth, etc.) required to perform complex computational tasks are available only in a...network. One approach to this problem is to apply free-market economics to help allocate these resources. Free-market economies can be thought of as

Practical continuous-variable quantum key distribution without finite sampling bandwidth effects.

Science.gov (United States)

Li, Huasheng; Wang, Chao; Huang, Peng; Huang, Duan; Wang, Tao; Zeng, Guihua

2016-09-05

In a practical continuous-variable quantum key distribution system, finite sampling bandwidth of the employed analog-to-digital converter at the receiver's side may lead to inaccurate results of pulse peak sampling. Then, errors in the parameters estimation resulted. Subsequently, the system performance decreases and security loopholes are exposed to eavesdroppers. In this paper, we propose a novel data acquisition scheme which consists of two parts, i.e., a dynamic delay adjusting module and a statistical power feedback-control algorithm. The proposed scheme may improve dramatically the data acquisition precision of pulse peak sampling and remove the finite sampling bandwidth effects. Moreover, the optimal peak sampling position of a pulse signal can be dynamically calibrated through monitoring the change of the statistical power of the sampled data in the proposed scheme. This helps to resist against some practical attacks, such as the well-known local oscillator calibration attack.

Improved-Bandwidth Transimpedance Amplifier

Science.gov (United States)

Chapsky, Jacob

2009-01-01

The widest available operational amplifier, with the best voltage and current noise characteristics, is considered for transimpedance amplifier (TIA) applications where wide bandwidth is required to handle fast rising input signals (as for time-of-flight measurement cases). The added amplifier inside the TIA feedback loop can be configured to have slightly lower voltage gain than the bandwidth reduction factor.

Secure Fusion Estimation for Bandwidth Constrained Cyber-Physical Systems Under Replay Attacks.

Science.gov (United States)

Chen, Bo; Ho, Daniel W C; Hu, Guoqiang; Yu, Li; Bo Chen; Ho, Daniel W C; Guoqiang Hu; Li Yu; Chen, Bo; Ho, Daniel W C; Hu, Guoqiang; Yu, Li

2018-06-01

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.

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.

Congestion Pricing for Aircraft Pushback Slot Allocation

Science.gov (United States)

Zhang, Yaping

2017-01-01

In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the “external cost of surface congestion” is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm. PMID:28114429

Congestion Pricing for Aircraft Pushback Slot Allocation.

Science.gov (United States)

Liu, Lihua; Zhang, Yaping; Liu, Lan; Xing, Zhiwei

2017-01-01

In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the "external cost of surface congestion" is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm.

Congestion Pricing for Aircraft Pushback Slot Allocation.

Directory of Open Access Journals (Sweden)

Lihua Liu

Full Text Available In order to optimize aircraft pushback management during rush hour, aircraft pushback slot allocation based on congestion pricing is explored while considering monetary compensation based on the quality of the surface operations. First, the concept of the "external cost of surface congestion" is proposed, and a quantitative study on the external cost is performed. Then, an aircraft pushback slot allocation model for minimizing the total surface cost is established. An improved discrete differential evolution algorithm is also designed. Finally, a simulation is performed on Xinzheng International Airport using the proposed model. By comparing the pushback slot control strategy based on congestion pricing with other strategies, the advantages of the proposed model and algorithm are highlighted. In addition to reducing delays and optimizing the delay distribution, the model and algorithm are better suited for use for actual aircraft pushback management during rush hour. Further, it is also observed they do not result in significant increases in the surface cost. These results confirm the effectiveness and suitability of the proposed model and algorithm.

Tactical Asset Allocation mit Genetischen Algorithmen

OpenAIRE

Manuel Ammann; Christian Zenkner

2003-01-01

In this study of tactical asset allocation, we use a genetic algorithm to implement a market timing strategy. The algorithm makes a daily decision whether to invest in the market index or in a riskless asset. The market index is represented by the S&P500 Composite Index, the riskless asset by a 3-month T-Bill. The decision of the genetic algorithm is based on fundamental macroeconomic variables. The association of fundamental variables with a set of operators creates a space of possible strat...

Bandwidth-on-demand motion control

NARCIS (Netherlands)

Van Loon, S.J.L.M.; Hunnekens, B.G.B.; Simon, A.S.; van de Wouw, N.; Heemels, W.P.M.H.

2018-01-01

In this brief, we introduce a 'bandwidth-on-demand' variable-gain control (VGC) strategy that allows for a varying bandwidth of the feedback controller. The proposed VGC can achieve improved performance given time-varying, reference-dependent performance requirements compared with linear

Optimizing 4DCBCT projection allocation to respiratory bins

International Nuclear Information System (INIS)

O’Brien, Ricky T; Kipritidis, John; Shieh, Chun-Chien; Keall, Paul J

2014-01-01

4D cone beam computed tomography (4DCBCT) is an emerging image guidance strategy used in radiotherapy where projections acquired during a scan are sorted into respiratory bins based on the respiratory phase or displacement. 4DCBCT reduces the motion blur caused by respiratory motion but increases streaking artefacts due to projection under-sampling as a result of the irregular nature of patient breathing and the binning algorithms used. For displacement binning the streak artefacts are so severe that displacement binning is rarely used clinically. The purpose of this study is to investigate if sharing projections between respiratory bins and adjusting the location of respiratory bins in an optimal manner can reduce or eliminate streak artefacts in 4DCBCT images. We introduce a mathematical optimization framework and a heuristic solution method, which we will call the optimized projection allocation algorithm, to determine where to position the respiratory bins and which projections to source from neighbouring respiratory bins. Five 4DCBCT datasets from three patients were used to reconstruct 4DCBCT images. Projections were sorted into respiratory bins using equispaced, equal density and optimized projection allocation. The standard deviation of the angular separation between projections was used to assess streaking and the consistency of the segmented volume of a fiducial gold marker was used to assess motion blur. The standard deviation of the angular separation between projections using displacement binning and optimized projection allocation was 30%–50% smaller than conventional phase based binning and 59%–76% smaller than conventional displacement binning indicating more uniformly spaced projections and fewer streaking artefacts. The standard deviation in the marker volume was 20%–90% smaller when using optimized projection allocation than using conventional phase based binning suggesting more uniform marker segmentation and less motion blur. Images

A New Approach in Advance Network Reservation and Provisioning for High-Performance Scientific Data Transfers

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Chaniotakis, Evangelos; Shoshani, Arie; Sim, Alex

2010-01-28

Scientific applications already generate many terabytes and even petabytes of data from supercomputer runs and large-scale experiments. The need for transferring data chunks of ever-increasing sizes through the network shows no sign of abating. Hence, we need high-bandwidth high speed networks such as ESnet (Energy Sciences Network). Network reservation systems, i.e. ESnet's OSCARS (On-demand Secure Circuits and Advance Reservation System) establish guaranteed bandwidth of secure virtual circuits at a certain time, for a certain bandwidth and length of time. OSCARS checks network availability and capacity for the specified period of time, and allocates requested bandwidth for that user if it is available. If the requested reservation cannot be granted, no further suggestion is returned back to the user. Further, there is no possibility from the users view-point to make an optimal choice. We report a new algorithm, where the user specifies the total volume that needs to be transferred, a maximum bandwidth that he/she can use, and a desired time period within which the transfer should be done. The algorithm can find alternate allocation possibilities, including earliest time for completion, or shortest transfer duration - leaving the choice to the user. We present a novel approach for path finding in time-dependent networks, and a new polynomial algorithm to find possible reservation options according to given constraints. We have implemented our algorithm for testing and incorporation into a future version of ESnet?s OSCARS. Our approach provides a basis for provisioning end-to-end high performance data transfers over storage and network resources.

QoS support over ultrafast TDM optical networks

Science.gov (United States)

Narvaez, Paolo; Siu, Kai-Yeung; Finn, Steven G.

1999-08-01

HLAN is a promising architecture to realize Tb/s access networks based on ultra-fast optical TDM technologies. This paper presents new research results on efficient algorithms for the support of quality of service over the HLAN network architecture. In particular, we propose a new scheduling algorithm that emulates fair queuing in a distributed manner for bandwidth allocation purpose. The proposed scheduler collects information on the queue of each host on the network and then instructs each host how much data to send. Our new scheduling algorithm ensures full bandwidth utilization, while guaranteeing fairness among all hosts.

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.

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.

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.

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.

Many-objective robust decision making for water allocation under climate change.

Science.gov (United States)

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.

Optimal Allocation of Renewable Energy Sources for Energy Loss Minimization

Directory of Open Access Journals (Sweden)

Vaiju Kalkhambkar

2017-03-01

Full Text Available Optimal allocation of renewable distributed generation (RDG, i.e., solar and the wind in a distribution system becomes challenging due to intermittent generation and uncertainty of loads. This paper proposes an optimal allocation methodology for single and hybrid RDGs for energy loss minimization. The deterministic generation-load model integrated with optimal power flow provides optimal solutions for single and hybrid RDG. Considering the complexity of the proposed nonlinear, constrained optimization problem, it is solved by a robust and high performance meta-heuristic, Symbiotic Organisms Search (SOS algorithm. Results obtained from SOS algorithm offer optimal solutions than Genetic Algorithm (GA, Particle Swarm Optimization (PSO and Firefly Algorithm (FFA. Economic analysis is carried out to quantify the economic benefits of energy loss minimization over the life span of RDGs.

Resource Allocation and Cluster Formation for Imperfect NOMA in DL/UL Decoupled HetNets

KAUST Repository

Celik, Abdulkadir; Radaydeh, Redha; Al-Qahtani, Fawaz; Abd El-Malek, Ahmed H.; Alouini, Mohamed-Slim

2017-01-01

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.

Resource Allocation and Cluster Formation for Imperfect NOMA in DL/UL Decoupled HetNets

KAUST Repository

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.

Effective Loss Minimization and Allocation of Unbalanced Distribution Network

Directory of Open Access Journals (Sweden)

Manvir Kaur

2017-11-01

Full Text Available An efficient distribution network must be able to supply power with good voltage profile. The main objective of the proposed work is to allocate losses of the unbalanced distribution network by the firefly algorithm in regulated and deregulated environments before and after loss minimization. Reconfiguration is one of the methods for loss reduction of unbalanced distribution network. Further, optimal placement of distributed generation and capacitor in the reconfigured unbalanced distribution network can further reduce the loss. The results of reconfigured unbalanced distribution network in regulated environment have already been reported. In this paper reconfiguration of an unbalanced distribution network in a deregulated environment is also carried out using an established Fuzzy Firefly algorithm. Loss sensitivity factor of unbalanced distribution networks is used to get the appropriate location of distributed generation and capacitor to be placed in the unbalanced distribution network. Their ratings have been found out by using bacteria foraging optimization algorithm (BFOA. The suggested loss allocation method using Firefly algorithm is implemented at first on 13 node unbalanced distribution network to check the performance of the proposed loss allocation method when compared to other available method. Finally the proposed method has been implemented on 25 node unbalanced distribution network. Both of the implementations are carried out under MATLAB environment.

Optimal Bandwidth Selection for Kernel Density Functionals Estimation

Directory of Open Access Journals (Sweden)

Su Chen

2015-01-01

Full Text Available The choice of bandwidth is crucial to the kernel density estimation (KDE and kernel based regression. Various bandwidth selection methods for KDE and local least square regression have been developed in the past decade. It has been known that scale and location parameters are proportional to density functionals ∫γ(xf2(xdx with appropriate choice of γ(x and furthermore equality of scale and location tests can be transformed to comparisons of the density functionals among populations. ∫γ(xf2(xdx can be estimated nonparametrically via kernel density functionals estimation (KDFE. However, the optimal bandwidth selection for KDFE of ∫γ(xf2(xdx has not been examined. We propose a method to select the optimal bandwidth for the KDFE. The idea underlying this method is to search for the optimal bandwidth by minimizing the mean square error (MSE of the KDFE. Two main practical bandwidth selection techniques for the KDFE of ∫γ(xf2(xdx are provided: Normal scale bandwidth selection (namely, “Rule of Thumb” and direct plug-in bandwidth selection. Simulation studies display that our proposed bandwidth selection methods are superior to existing density estimation bandwidth selection methods in estimating density functionals.

Optimal defense resource allocation in scale-free networks

Science.gov (United States)

Zhang, Xuejun; Xu, Guoqiang; Xia, Yongxiang

2018-02-01

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

Energy-Efficient Power Allocation for MIMO-SVD Systems

KAUST Repository

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.

Energy Efficient Power Allocation for Cognitive MIMO Channels

KAUST Repository

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.

Accuracy Improvement for Light-Emitting-Diode-Based Colorimeter by Iterative Algorithm

Science.gov (United States)

Yang, Pao-Keng

2011-09-01

We present a simple algorithm, combining an interpolating method with an iterative calculation, to enhance the resolution of spectral reflectance by removing the spectral broadening effect due to the finite bandwidth of the light-emitting diode (LED) from it. The proposed algorithm can be used to improve the accuracy of a reflective colorimeter using multicolor LEDs as probing light sources and is also applicable to the case when the probing LEDs have different bandwidths in different spectral ranges, to which the powerful deconvolution method cannot be applied.

Improving the Bandwidth Selection in Kernel Equating

Science.gov (United States)

Andersson, Björn; von Davier, Alina A.

2014-01-01

We investigate the current bandwidth selection methods in kernel equating and propose a method based on Silverman's rule of thumb for selecting the bandwidth parameters. In kernel equating, the bandwidth parameters have previously been obtained by minimizing a penalty function. This minimization process has been criticized by practitioners…

The statistical bandwidth of Butterworth filters

Science.gov (United States)

Davy, J. L.; Dunn, I. P.

1987-06-01

The precision of standard architectural acoustic measurements is a function of the statistical bandwidth of the band pass filters used in the measurements. The International and United States Standards on octave and fractional octave-band filters which specify the band pass filters used in architectural acoustics measurements give the effective bandwidth, but unfortunately not the statistical bandwidth of the filters. Both these Standards are currently being revised and both revisions require the use of Butterworth filter characteristics. In this paper it is shown theoretically that the ratio of statistical bandwidth to effective bandwidth for an nth order Butterworth band pass filter is {2n}/{(2n-1)}. This is verified experimentally for third-octave third-order Butterworth band pass filters. It is also shown experimentally that this formula is approximately correct for some non-Butterworth third-octave third-order band pass filters. Because of the importance of Butterworth filters in the revised Standards, the theory of Butterworth filters is reviewed and the formulae for Butterworth filters given in both revised Standards are derived.

Dynamic Resource Allocation and QoS Control Capabilities of the Japanese Academic Backbone Network

Directory of Open Access Journals (Sweden)

Michihiro Aoki

2010-08-01

Full Text Available Dynamic resource control capabilities have become increasingly important for academic networks that must support big scientific research projects at the same time as less data intensive research and educational activities. This paper describes the dynamic resource allocation and QoS control capabilities of the Japanese academic backbone network, called SINET3, which supports a variety of academic applications with a wide range of network services. The article describes the network architecture, networking technologies, resource allocation, QoS control, and layer-1 bandwidth on-demand services. It also details typical services developed for scientific research, including the user interface, resource control, and management functions, and includes performance evaluations.

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.

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.

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.

Prototype Implementation of Two Efficient Low-Complexity Digital Predistortion Algorithms

Directory of Open Access Journals (Sweden)

Timo I. Laakso

2008-01-01

Full Text Available Predistortion (PD lineariser for microwave power amplifiers (PAs is an important topic of research. With larger and larger bandwidth as it appears today in modern WiMax standards as well as in multichannel base stations for 3GPP standards, the relatively simple nonlinear effect of a PA becomes a complex memory-including function, severely distorting the output signal. In this contribution, two digital PD algorithms are investigated for the linearisation of microwave PAs in mobile communications. The first one is an efficient and low-complexity algorithm based on a memoryless model, called the simplicial canonical piecewise linear (SCPWL function that describes the static nonlinear characteristic of the PA. The second algorithm is more general, approximating the pre-inverse filter of a nonlinear PA iteratively using a Volterra model. The first simpler algorithm is suitable for compensation of amplitude compression and amplitude-to-phase conversion, for example, in mobile units with relatively small bandwidths. The second algorithm can be used to linearise PAs operating with larger bandwidths, thus exhibiting memory effects, for example, in multichannel base stations. A measurement testbed which includes a transmitter-receiver chain with a microwave PA is built for testing and prototyping of the proposed PD algorithms. In the testing phase, the PD algorithms are implemented using MATLAB (floating-point representation and tested in record-and-playback mode. The iterative PD algorithm is then implemented on a Field Programmable Gate Array (FPGA using fixed-point representation. The FPGA implementation allows the pre-inverse filter to be tested in a real-time mode. Measurement results show excellent linearisation capabilities of both the proposed algorithms in terms of adjacent channel power suppression. It is also shown that the fixed-point FPGA implementation of the iterative algorithm performs as well as the floating-point implementation.

Accelerating Dust Storm Simulation by Balancing Task Allocation in Parallel Computing Environment

Science.gov (United States)

Gui, Z.; Yang, C.; XIA, J.; Huang, Q.; YU, M.

2013-12-01

Dust storm has serious negative impacts on environment, human health, and assets. The continuing global climate change has increased the frequency and intensity of dust storm in the past decades. To better understand and predict the distribution, intensity and structure of dust storm, a series of dust storm models have been developed, such as Dust Regional Atmospheric Model (DREAM), the NMM meteorological module (NMM-dust) and Chinese Unified Atmospheric Chemistry Environment for Dust (CUACE/Dust). The developments and applications of these models have contributed significantly to both scientific research and our daily life. However, dust storm simulation is a data and computing intensive process. Normally, a simulation for a single dust storm event may take several days or hours to run. It seriously impacts the timeliness of prediction and potential applications. To speed up the process, high performance computing is widely adopted. By partitioning a large study area into small subdomains according to their geographic location and executing them on different computing nodes in a parallel fashion, the computing performance can be significantly improved. Since spatiotemporal correlations exist in the geophysical process of dust storm simulation, each subdomain allocated to a node need to communicate with other geographically adjacent subdomains to exchange data. Inappropriate allocations may introduce imbalance task loads and unnecessary communications among computing nodes. Therefore, task allocation method is the key factor, which may impact the feasibility of the paralleling. The allocation algorithm needs to carefully leverage the computing cost and communication cost for each computing node to minimize total execution time and reduce overall communication cost for the entire system. This presentation introduces two algorithms for such allocation and compares them with evenly distributed allocation method. Specifically, 1) In order to get optimized solutions, a

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

Science.gov (United States)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

Bandwidth-Efficient Communication through 225 MHz Ka-band Relay Satellite Channel

Science.gov (United States)

Downey, Joseph; Downey, James; Reinhart, Richard C.; Evans, Michael Alan; Mortensen, Dale John

2016-01-01

The communications and navigation space infrastructure of the National Aeronautics and Space Administration (NASA) consists of a constellation of relay satellites (called Tracking and Data Relay Satellites (TDRS)) and a global set of ground stations to receive and deliver data to researchers around the world from mission spacecraft throughout the solar system. Planning is underway to enhance and transform the infrastructure over the coming decade. Key to the upgrade will be the simultaneous and efficient use of relay transponders to minimize cost and operations while supporting science and exploration spacecraft. Efficient use of transponders necessitates bandwidth efficient communications to best use and maximize data throughput within the allocated spectrum. Experiments conducted with NASA's Space Communication and Navigation (SCaN) Testbed on the International Space Station provides a unique opportunity to evaluate advanced communication techniques, such as bandwidth-efficient modulations, in an operational flight system. Demonstrations of these new techniques in realistic flight conditions provides critical experience and reduces the risk of using these techniques in future missions. Efficient use of spectrum is enabled by using high-order modulations coupled with efficient forward error correction codes. This paper presents a high-rate, bandwidth-efficient waveform operating over the 225 MHz Ka-band service of the TDRS System (TDRSS). The testing explores the application of Gaussian Minimum Shift Keying (GMSK), 248-phase shift keying (PSK) and 1632- amplitude PSK (APSK) providing over three bits-per-second-per-Hertz (3 bsHz) modulation combined with various LDPC encoding rates to maximize throughput. With a symbol rate of 200 Mbaud, coded data rates of 1000 Mbps were tested in the laboratory and up to 800 Mbps over the TDRS 225 MHz channel. This paper will present on the high-rate waveform design, channel characteristics, performance results, compensation

47 CFR 2.202 - Bandwidths.

Science.gov (United States)

2010-10-01

... three numerals and one letter. The letter occupies the position of the decimal point and represents the... quality desired Speech and music, M=4000, Bandwidth: 8000 Hz= 8 kHz 8K00A3E Sound broadcasting, single... desired Speech and music, M=4000, Bandwidth: 4000 Hz= 4 kHz 4K00R3E Sound broadcasting, single-sideband...

Controlling Laser Plasma Instabilities Using Temporal Bandwidth

Science.gov (United States)

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.

Expert System and Heuristics Algorithm for Cloud Resource Scheduling

Directory of Open Access Journals (Sweden)

Mamatha E

2017-03-01

Full Text Available Rule-based scheduling algorithms have been widely used on cloud computing systems and there is still plenty of room to improve their performance. This paper proposes to develop an expert system to allocate resources in cloud by using Rule based Algorithm, thereby measuring the performance of the system by letting the system adapt new rules based on the feedback. Here performance of the action helps to make better allocation of the resources to improve quality of services, scalability and flexibility. The performance measure is based on how the allocation of the resources is dynamically optimized and how the resources are utilized properly. It aims to maximize the utilization of the resources. The data and resource are given to the algorithm which allocates the data to resources and an output is obtained based on the action occurred. Once the action is completed, the performance of every action is measured that contains how the resources are allocated and how efficiently it worked. In addition to performance, resource allocation in cloud environment is also considered.

Reliability-oriented multi-resource allocation in a stochastic-flow network

International Nuclear Information System (INIS)

Hsieh, C.-C.; Lin, M.-H.

2003-01-01

A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple operational states. The network reliability of such a stochastic-flow network is the probability that resources can be successfully transmitted from source nodes through multi-capacitated arcs to sink nodes. Although the evaluation schemes of network reliability in stochastic-flow networks have been extensively studied in the literature, how to allocate various resources at source nodes in a reliable means remains unanswered. In this study, a resource allocation problem in a stochastic-flow network is formulated that aims to determine the optimal resource allocation policy at source nodes subject to given resource demands at sink nodes such that the network reliability of the stochastic-flow network is maximized, and an algorithm for computing the optimal resource allocation is proposed that incorporates the principle of minimal path vectors. A numerical example is given to illustrate the proposed algorithm

Sort-Mid tasks scheduling algorithm in grid computing.

Science.gov (United States)

Reda, Naglaa M; Tawfik, A; Marzok, Mohamed A; Khamis, Soheir M

2015-11-01

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Multimedia transmission in MC-CDMA using adaptive subcarrier power allocation and CFO compensation

Science.gov (United States)

Chitra, S.; Kumaratharan, N.

2018-02-01

Multicarrier code division multiple access (MC-CDMA) system is one of the most effective techniques in fourth-generation (4G) wireless technology, due to its high data rate, high spectral efficiency and resistance to multipath fading. However, MC-CDMA systems are greatly deteriorated by carrier frequency offset (CFO) which is due to Doppler shift and oscillator instabilities. It leads to loss of orthogonality among the subcarriers and causes intercarrier interference (ICI). Water filling algorithm (WFA) is an efficient resource allocation algorithm to solve the power utilisation problems among the subcarriers in time-dispersive channels. The conventional WFA fails to consider the effect of CFO. To perform subcarrier power allocation with reduced CFO and to improve the capacity of MC-CDMA system, residual CFO compensated adaptive subcarrier power allocation algorithm is proposed in this paper. The proposed technique allocates power only to subcarriers with high channel to noise power ratio. The performance of the proposed method is evaluated using random binary data and image as source inputs. Simulation results depict that the bit error rate performance and ICI reduction capability of the proposed modified WFA offered superior performance in both power allocation and image compression for high-quality multimedia transmission in the presence of CFO and imperfect channel state information conditions.

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.

Fluid limits for Bandwidth-Sharing Networks with Impatience.

NARCIS (Netherlands)

Remerova, M.; Reed, J.; Zwart, A.P.

2014-01-01

Bandwidth-sharing networks as introduced by Roberts and Massoulié [Roberts JW, Massoulié L (1998) Bandwidth sharing and admission control for elastic traffic. Proc. ITC Specialist Seminar, Yokohama, Japan], Massoulié and Roberts [Massoulié L, Roberts JW (1999) Bandwidth sharing: Objectives and

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.

Directing Traffic: Managing Internet Bandwidth Fairly

Science.gov (United States)

Paine, Thomas A.; Griggs, Tyler J.

2008-01-01

Educational institutions today face budgetary restraints and scarce resources, complicating the decision of how to allot bandwidth for campus network users. Additionally, campus concerns over peer-to-peer networking (specifically outbound Internet traffic) have increased because of bandwidth and copyright issues. In this article, the authors…

Identifying Memory Allocation Patterns in HEP Software

Science.gov (United States)

Kama, S.; Rauschmayr, N.

2017-10-01

HEP applications perform an excessive amount of allocations/deallocations within short time intervals which results in memory churn, poor locality and performance degradation. These issues are already known for a decade, but due to the complexity of software frameworks and billions of allocations for a single job, up until recently no efficient mechanism has been available to correlate these issues with source code lines. However, with the advent of the Big Data era, many tools and platforms are now available to do large scale memory profiling. This paper presents, a prototype program developed to track and identify each single (de-)allocation. The CERN IT Hadoop cluster is used to compute memory key metrics, like locality, variation, lifetime and density of allocations. The prototype further provides a web based visualization back-end that allows the user to explore the results generated on the Hadoop cluster. Plotting these metrics for every single allocation over time gives a new insight into application’s memory handling. For instance, it shows which algorithms cause which kind of memory allocation patterns, which function flow causes how many short-lived objects, what are the most commonly allocated sizes etc. The paper will give an insight into the prototype and will show profiling examples for the LHC reconstruction, digitization and simulation jobs.

The Retina Algorithm

CERN Multimedia

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.

The Ordered Capacitated Multi-Objective Location-Allocation Problem for Fire Stations Using Spatial Optimization

Directory of Open Access Journals (Sweden)

Samira Bolouri

2018-01-01

Full Text Available Determining the positions of facilities, and allocating demands to them, is a vitally important problem. Location-allocation problems are optimization NP-hard procedures. This article evaluates the ordered capacitated multi-objective location-allocation problem for fire stations, using simulated annealing and a genetic algorithm, with goals such as minimizing the distance and time as well as maximizing the coverage. After tuning the parameters of the algorithms using sensitivity analysis, they were used separately to process data for Region 11, Tehran. The results showed that the genetic algorithm was more efficient than simulated annealing, and therefore, the genetic algorithm was used in later steps. Next, we increased the number of stations. Results showed that the model can successfully provide seven optimal locations and allocate high demands (280,000 to stations in a discrete space in a GIS, assuming that the stations’ capacities are known. Following this, we used a weighting program so that in each repetition, we could allot weights to each target randomly. Finally, by repeating the model over 10 independent executions, a set of solutions with the least sum and the highest number of non-dominated solutions was selected from among many non-dominated solutions as the best set of optimal solutions.

Energy-Efficient Resource and Power Allocation for Underlay Multicast Device-to-Device Transmission

Directory of Open Access Journals (Sweden)

Fan Jiang

2017-11-01

Full Text Available In this paper, we present an energy-efficient resource allocation and power control scheme for D2D (Device-to-Device multicasting transmission. The objective is to maximize the overall energy-efficiency of D2D multicast clusters through effective resource allocation and power control schemes, while considering the quality of service (QoS requirements of both cellular users (CUs and D2D clusters. We first build the optimization model and a heuristic resource and power allocation algorithm is then proposed to solve the energy-efficiency problem with less computational complexity. Numerical results indicate that the proposed algorithm outperforms existing schemes in terms of throughput per energy consumption.

Downlink resource allocation for multichannel TDMA visible light communications

KAUST Repository

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

2017-01-01

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

Downlink resource allocation for multichannel TDMA visible light communications

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz

2017-05-12

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

Fuzzy Simulation-Optimization Model for Waste Load Allocation

Directory of Open Access Journals (Sweden)

Motahhare Saadatpour

2006-01-01

Full Text Available This paper present simulation-optimization models for waste load allocation from multiple point sources which include uncertainty due to vagueness of the parameters and goals. This model employs fuzzy sets with appropriate membership functions to deal with uncertainties due to vagueness. The fuzzy waste load allocation model (FWLAM incorporate QUAL2E as a water quality simulation model and Genetic Algorithm (GA as an optimization tool to find the optimal combination of the fraction removal level to the dischargers and pollution control agency (PCA. Penalty functions are employed to control the violations in the system.  The results demonstrate that the goal of PCA to achieve the best water quality and the goal of the dischargers to use the full assimilative capacity of the river have not been satisfied completely and a compromise solution between these goals is provided. This fuzzy optimization model with genetic algorithm has been used for a hypothetical problem. Results demonstrate a very suitable convergence of proposed optimization algorithm to the global optima.

High-bandwidth memory interface

CERN Document Server

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.

Optimization of broadband semiconductor chirped mirrors with genetic algorithm

OpenAIRE

Dems, M.; Wnuk, P.; Wasylczyk, P.; Zinkiewicz, L.; Wojcik-Jedlinska, A.; Reginski, K.; Hejduk, K.; Jasik, A.

2016-01-01

Genetic algorithm was applied for optimization of dispersion properties in semiconductor Bragg reflectors for applications in femtosecond lasers. Broadband, large negative group-delay dispersion was achieved in the optimized design: The group-delay dispersion (GDD) as large as −3500 fs2 was theoretically obtained over a 10-nm bandwidth. The designed structure was manufactured and tested, providing GDD −3320 fs2 over a 7-nm bandwidth. The mirror performance was ...

Energy Efficient Resource Allocation for Phantom Cellular Networks

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz

2016-01-01

experiencing negligible interference and assume perfect channel state information (CSI). For this setting, we propose an algorithm that finds the SE and EE resource allocation strategies. Then, we compare the performance of both design strategies versus number

A Distributed Flow Rate Control Algorithm for Networked Agent System with Multiple Coding Rates to Optimize Multimedia Data Transmission

Directory of Open Access Journals (Sweden)

Shuai Zeng

2013-01-01

Full Text Available With the development of wireless technologies, mobile communication applies more and more extensively in the various walks of life. The social network of both fixed and mobile users can be seen as networked agent system. At present, kinds of devices and access network technology are widely used. Different users in this networked agent system may need different coding rates multimedia data due to their heterogeneous demand. This paper proposes a distributed flow rate control algorithm to optimize multimedia data transmission of the networked agent system with the coexisting various coding rates. In this proposed algorithm, transmission path and upload bandwidth of different coding rate data between source node, fixed and mobile nodes are appropriately arranged and controlled. On the one hand, this algorithm can provide user nodes with differentiated coding rate data and corresponding flow rate. On the other hand, it makes the different coding rate data and user nodes networked, which realizes the sharing of upload bandwidth of user nodes which require different coding rate data. The study conducts mathematical modeling on the proposed algorithm and compares the system that adopts the proposed algorithm with the existing system based on the simulation experiment and mathematical analysis. The results show that the system that adopts the proposed algorithm achieves higher upload bandwidth utilization of user nodes and lower upload bandwidth consumption of source node.

Radio Resource Management for Uplink Carrier Aggregation in LTE-Advanced

DEFF Research Database (Denmark)

Wang, Hua; Rosa, Claudio; Pedersen, Klaus I.

2015-01-01

. On the other hand they will introduce additional power back-off for the power amplifier in the user equipment (UE) with non-contiguous resource allocation. Taking into account that the uplink is inherently limited by the maximum transmission power of the UE, the assignment of uplink CA and/or dual cluster...... scheduling algorithm is proposed for dual-cluster transmission, which tightly couples the bandwidth allocation and packet scheduling together to exploit the frequency domain diversity with low complexity. Simulation results show that with proper differentiation between power-limited and non-power-limited UEs......This paper investigates the uplink resource allocation problem in the context of LTE-Advanced systems with carrier aggregation (CA) and dual-cluster scheduling. On one hand these Rel’10 functionalities can increase the available transmission bandwidth and scheduling flexibility in uplink...

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.

Sort-Mid tasks scheduling algorithm in grid computing

Directory of Open Access Journals (Sweden)

Naglaa M. Reda

2015-11-01

Full Text Available Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

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

The entity-to-algorithm allocation problem: Extending the analysis

CSIR Research Space (South Africa)

Grobler, J

2014-12-01

Full Text Available . HYPOTHESES ANALYSIS OF ALTERNATIVE MULTI-METHOD ALGORITHMS. HMHH EIHH EEA-SLPS HMHH NA 4− 19− 5 11− 8− 9 EIHH 5− 19− 4 NA 6− 16− 6 EEA-SLPS 9− 8− 11 6− 16− 6 NA Multi-EA 3− 4− 21 3− 1− 24 2− 3− 23 Multi-EA TOTAL HMHH 21− 4− 3 36− 3− 17 EIHH 24− 1− 3 35− 36... ANALYSIS OF THE VARIOUS ALGORITHMS VERSUS THEIR CONSTITUENT ALGORITHMS. Algorithm HMHH EIHH EEA-SLPS Multi-EA CMAES 0-3-25 4-2-22 4-2-22 2-2-24 SaNSDE 17-2-9 16-8-4 12-12-4 5-0-23 GA 22-3-3 23-2-3 23-4-1 4-5-19 GCPSO 20-1-7 20-3-5 19-3-6 8-3-17 TOTAL 55...

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Science.gov (United States)

2014-01-01

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Directory of Open Access Journals (Sweden)

Shih-Wei Lin

2014-01-01

Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

Bandwidth Limitations in Characterization of High Intensity Focused Ultrasound Fields in the Presence of Shocks

Science.gov (United States)

Khokhlova, V. A.; Bessonova, O. V.; Soneson, J. E.; Canney, M. S.; Bailey, M. R.; Crum, L. A.

2010-03-01

Nonlinear propagation effects result in the formation of weak shocks in high intensity focused ultrasound (HIFU) fields. When shocks are present, the wave spectrum consists of hundreds of harmonics. In practice, shock waves are modeled using a finite number of harmonics and measured with hydrophones that have limited bandwidths. The goal of this work was to determine how many harmonics are necessary to model or measure peak pressures, intensity, and heat deposition rates of the HIFU fields. Numerical solutions of the Khokhlov-Zabolotskaya-Kuznetzov-type (KZK) nonlinear parabolic equation were obtained using two independent algorithms, compared, and analyzed for nonlinear propagation in water, in gel phantom, and in tissue. Measurements were performed in the focus of the HIFU field in the same media using fiber optic probe hydrophones of various bandwidths. Experimental data were compared to the simulation results.

Dual Kidney Allocation Score: A Novel Algorithm Utilizing Expanded Donor Criteria for the Allocation of Dual Kidneys in Adults.

Science.gov (United States)

Johnson, Adam P; Price, Thea P; Lieby, Benjamin; Doria, Cataldo

2016-09-08

BACKGROUND Dual kidney transplantation (DKT) of expanded-criteria donors is a cost-intensive procedure that aims to increase the pool of available deceased organ donors and has demonstrated equivalent outcomes to expanded-criteria single kidney transplantation (eSKT). The objective of this study was to develop an allocation score based on predicted graft survival from historical dual and single kidney donors. MATERIAL AND METHODS We analyzed United Network for Organ Sharing (UNOS) data for 1547 DKT and 26 381 eSKT performed between January 1994 and September 2013. We utilized multivariable Cox regression to identify variables independently associated with graft survival in dual and single kidney transplantations. We then derived a weighted multivariable product score from calculated hazard ratios to model the benefit of transplantation as dual kidneys. RESULTS Of 36 donor variables known at the time of listing, 13 were significantly associated with graft survival. The derived dual allocation score demonstrated good internal validity with strong correlation to improved survival in dual kidney transplants. Donors with scores less than 2.1 transplanted as dual kidneys had a worsened median survival of 594 days (24%, p-value 0.031) and donors with scores greater than 3.9 had improved median survival of 1107 days (71%, p-value 0.002). There were 17 733 eSKT (67%) and 1051 DKT (67%) with scores in between these values and no differences in survival (p-values 0.676 and 0.185). CONCLUSIONS We have derived a dual kidney allocation score (DKAS) with good internal validity. Future prospective studies will be required to demonstrate external validity, but this score may help to standardize organ allocation for dual kidney transplantation.

Visual Perception Based Rate Control Algorithm for HEVC

Science.gov (United States)

Feng, Zeqi; Liu, PengYu; Jia, Kebin

2018-01-01

For HEVC, rate control is an indispensably important video coding technology to alleviate the contradiction between video quality and the limited encoding resources during video communication. However, the rate control benchmark algorithm of HEVC ignores subjective visual perception. For key focus regions, bit allocation of LCU is not ideal and subjective quality is unsatisfied. In this paper, a visual perception based rate control algorithm for HEVC is proposed. First bit allocation weight of LCU level is optimized based on the visual perception of luminance and motion to ameliorate video subjective quality. Then λ and QP are adjusted in combination with the bit allocation weight to improve rate distortion performance. Experimental results show that the proposed algorithm reduces average 0.5% BD-BR and maximum 1.09% BD-BR at no cost in bitrate accuracy compared with HEVC (HM15.0). The proposed algorithm devotes to improving video subjective quality under various video applications.

On the power and offset allocation for rate adaptation of spatial multiplexing in optical wireless MIMO channels

KAUST Repository

Park, Kihong

2011-07-01

Visible light communication (VLC) using optical sources which can be simultaneously utilized for illumination and communication is currently an attractive option for wireless personal area network. Improving the data rate in optical wireless communication system is challenging due to the limited bandwidth of the optical sources. In this paper, we design the singular value decomposition (SVD)- based multiplexing multiple-input multiple-output (MIMO) system to support two data streams in optical wireless channels. Noting that the conventional allocation method in radio frequency (RF) MIMO channels cannot be applied directly to the optical intensity channels, we propose a novel method to allocate the optical power, the offset value and the modulation size for maximum sum rate under the constraints of the nonnegativity of the modulated signals, the aggregate optical power and the bit error rate (BER) requirement. The simulation results show that the proposed allocation method gives the better performance than the method to allocate the optical power equally for each data stream. © 2011 IEEE.

Physically Connected Stacked Patch Antenna Design with 100% Bandwidth

KAUST Repository

Klionovski, Kirill; Shamim, Atif

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

Physically Connected Stacked Patch Antenna Design with 100% Bandwidth

KAUST Repository

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.

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.

Volkov transform generalized projection algorithm for attosecond pulse characterization

International Nuclear Information System (INIS)

Keathley, P D; Bhardwaj, S; Moses, J; Laurent, G; Kärtner, F X

2016-01-01

An algorithm for characterizing attosecond extreme ultraviolet pulses that is not bandwidth-limited, requires no interpolation of the experimental data, and makes no approximations beyond the strong-field approximation is introduced. This approach fully incorporates the dipole transition matrix element into the retrieval process. Unlike attosecond retrieval methods such as phase retrieval by omega oscillation filtering (PROOF), or improved PROOF, it simultaneously retrieves both the attosecond and infrared (IR) pulses, without placing fundamental restrictions on the IR pulse duration, intensity or bandwidth. The new algorithm is validated both numerically and experimentally, and is also found to have practical advantages. These include an increased robustness to noise, and relaxed requirements for the size of the experimental dataset and the intensity of the streaking pulse. (paper)

On the power and offset allocation for rate adaptation of spatial multiplexing in optical wireless MIMO channels

KAUST Repository

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.

On the power and offset allocation for rate adaptation of spatial multiplexing in optical wireless MIMO channels

KAUST Repository

Park, Kihong; Ko, Youngchai; Alouini, Mohamed-Slim

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

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-limited control and ringdown suppression in high-Q resonators.

Science.gov (United States)

Borneman, Troy W; Cory, David G

2012-12-01

We describe how the transient behavior of a tuned and matched resonator circuit and a ringdown suppression pulse may be integrated into an optimal control theory (OCT) pulse-design algorithm to derive control sequences with limited ringdown that perform a desired quantum operation in the presence of resonator distortions of the ideal waveform. Inclusion of ringdown suppression in numerical pulse optimizations significantly reduces spectrometer deadtime when using high quality factor (high-Q) resonators, leading to increased signal-to-noise ratio (SNR) and sensitivity of inductive measurements. To demonstrate the method, we experimentally measure the free-induction decay of an inhomogeneously broadened solid-state free radical spin system at high Q. The measurement is enabled by using a numerically optimized bandwidth-limited OCT pulse, including ringdown suppression, robust to variations in static and microwave field strengths. We also discuss the applications of pulse design in high-Q resonators to universal control of anisotropic-hyperfine coupled electron-nuclear spin systems via electron-only modulation even when the bandwidth of the resonator is significantly smaller than the hyperfine coupling strength. These results demonstrate how limitations imposed by linear response theory may be vastly exceeded when using a sufficiently accurate system model to optimize pulses of high complexity. Copyright © 2012 Elsevier Inc. All rights reserved.

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.

Bandwidth-Efficient Communication through 225 MHz Ka-band Relay Satellite Channel

Science.gov (United States)

Downey, Joseph A.; Downey, James M.; Reinhart, Richard C.; Evans, Michael A.; Mortensen, Dale J.

2016-01-01

The communications and navigation space infrastructure of the National Aeronautics and Space Administration (NASA) consists of a constellation of relay satellites (called Tracking and Data Relay Satellites (TDRS)) and a global set of ground stations to receive and deliver data to researchers around the world from mission spacecraft throughout the solar system. Planning is underway to enhance and transform the infrastructure over the coming decade. Key to the upgrade will be the simultaneous and efficient use of relay transponders to minimize cost and operations while supporting science and exploration spacecraft. Efficient use of transponders necessitates bandwidth efficient communications to best use and maximize data throughput within the allocated spectrum. Experiments conducted with NASA's Space Communication and Navigation (SCaN) Testbed on the International Space Station provides a unique opportunity to evaluate advanced communication techniques, such as bandwidth-efficient modulations, in an operational flight system. Demonstrations of these new techniques in realistic flight conditions provides critical experience and reduces the risk of using these techniques in future missions. Efficient use of spectrum is enabled by using high-order modulations coupled with efficient forward error correction codes. This paper presents a high-rate, bandwidth-efficient waveform operating over the 225 MHz Ka-band service of the TDRS System (TDRSS). The testing explores the application of Gaussian Minimum Shift Keying (GMSK), 2/4/8-phase shift keying (PSK) and 16/32- amplitude PSK (APSK) providing over three bits-per-second-per-Hertz (3 b/s/Hz) modulation combined with various LDPC encoding rates to maximize through- put. With a symbol rate of 200 M-band, coded data rates of 1000 Mbps were tested in the laboratory and up to 800 Mbps over the TDRS 225 MHz channel. This paper will present on the high-rate waveform design, channel characteristics, performance results

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.

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

Sharing the 620-790 MHz band allocated to terrestrial television with an audio-bandwidth social service satellite system

Science.gov (United States)

Smith, E. K.; Reinhart, E. E.

1977-01-01

A study was carried out to identify the optimum uplink and downlink frequencies for audio-bandwidth channels for use by a satellite system distributing social services. The study considered functional-user-need models for five types of social services and identified a general baseline system that is appropriate for most of them. Technical aspects and costs of this system and of the frequency bands that it might use were reviewed, leading to the identification of the 620-790 MHz band as a perferred candidate for both uplink and downlink transmissions for nonmobile applications. The study also led to some ideas as to how to configure the satellite system.

Pushing Memory Bandwidth Limitations Through Efficient Implementations of Block-Krylov Space Solvers on GPUs

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.

A novel power and offset allocation method for spatial multiplexing MIMO Systems in optical wireless channels

KAUST Repository

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.

Optimization Analysis of Supply Chain Resource Allocation in Customized Online Shopping Service Mode

Directory of Open Access Journals (Sweden)

Jianming Yao

2015-01-01

Full Text Available For an online-shopping company, whether it can provide its customers with customized service is the key to enhance its customers’ experience value and its own competence. A good customized service requires effective integration and reasonable allocation of the company’s supply chain resources running in the background. Based on the analysis of the allocation of supply chain resources in the customized online shopping service mode and its operational characteristics, this paper puts forward an optimization model for the resource allocation and builds an improved ant algorithm to solve it. Finally, the effectiveness and feasibility of the optimization method and algorithm are demonstrated by a numerical simulation. This paper finds that the special online shopping environments lead to many dynamic and uncertain characters of the service demands. Different customized service patterns and their combination patterns should match with different supply chain resource allocations. The optimization model not only reflects the required service cost and delivery time in the objective function, but also considers the service scale effect optimization and the relations of integration benefits and risks. The improved ant algorithm has obvious advantages in flexibly balancing the multiobjective optimizations, adjusting the convergence speed, and adjusting the operation parameters.

Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

YongQiang Li

2018-01-01

Full Text Available For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR, is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

Science.gov (United States)

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

On semidefinite programming bounds for graph bandwidth

NARCIS (Netherlands)

de Klerk, E.; Nagy, M.; Sotirov, R.

2013-01-01

In this paper, we propose two new lower bounds on graph bandwidth and cyclic bandwidth based on semidefinite programming (SDP) relaxations of the quadratic assignment problem. We compare the new bounds with two other SDP bounds reported in [A. Blum, G. Konjevod, R. Ravi, and S. Vempala,

47 CFR 74.535 - Emission and bandwidth.

Science.gov (United States)

2010-10-01

... digital modulation in paragraph (a) of this section, the resolution bandwidth (BRES) of the measuring...), adjusted upward to the nearest greater resolution bandwidth available on the measuring equipment. In all... frequency energy outside the assigned channel. Upon notice by the FCC to the station licensee that...

Discrete rate resource allocation for OFDMA cognitive radio systems with location information

KAUST Repository

Ben Ghorbel, Mahdi; Nam, Haewoon; Alouini, Mohamed-Slim

2010-01-01

In this paper we introduce a resource allocation algorithm based on location information for cognitive radio systems. The location information allows a practical implementation of cognitive radio systems when the channel state knowledge of the interference links with the primary users is not available. Using this information and measurements, the secondary users estimate the pathloss between the secondary and primary users to avoid interfering the primary users while sharing the frequency bands. The major improvement in this paper is low-complex algorithms for downlink and uplink resource allocations with integer bit distributions, where collocated subchannel constraint is considered in uplink case. We show, through numerical simulations, that for the downlink case, the proposed algorithm is indeed optimal while for the uplink case, it is near-optimal. ©2010 IEEE.

Discrete rate resource allocation for OFDMA cognitive radio systems with location information

KAUST Repository

Ben Ghorbel, Mahdi

2010-09-01

In this paper we introduce a resource allocation algorithm based on location information for cognitive radio systems. The location information allows a practical implementation of cognitive radio systems when the channel state knowledge of the interference links with the primary users is not available. Using this information and measurements, the secondary users estimate the pathloss between the secondary and primary users to avoid interfering the primary users while sharing the frequency bands. The major improvement in this paper is low-complex algorithms for downlink and uplink resource allocations with integer bit distributions, where collocated subchannel constraint is considered in uplink case. We show, through numerical simulations, that for the downlink case, the proposed algorithm is indeed optimal while for the uplink case, it is near-optimal. ©2010 IEEE.

Efficient Bandwidth Management for Ethernet Passive Optical Networks

KAUST Repository

Elrasad, Amr

2016-01-01

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

Mitigating energy loss on distribution lines through the allocation of reactors

Science.gov (United States)

Miranda, T. M.; Romero, F.; Meffe, A.; Castilho Neto, J.; Abe, L. F. T.; Corradi, F. E.

2018-03-01

This paper presents a methodology for automatic reactors allocation on medium voltage distribution lines to reduce energy loss. In Brazil, some feeders are distinguished by their long lengths and very low load, which results in a high influence of the capacitance of the line on the circuit’s performance, requiring compensation through the installation of reactors. The automatic allocation is accomplished using an optimization meta-heuristic called Global Neighbourhood Algorithm. Given a set of reactor models and a circuit, it outputs an optimal solution in terms of reduction of energy loss. The algorithm is also able to verify if the voltage limits determined by the user are not being violated, besides checking for energy quality. The methodology was implemented in a software tool, which can also show the allocation graphically. A simulation with four real feeders is presented in the paper. The obtained results were able to reduce the energy loss significantly, from 50.56%, in the worst case, to 93.10%, in the best case.

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.

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.

Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network

Directory of Open Access Journals (Sweden)

Ui-Seong Yu

2017-01-01

Full Text Available The end-to-end throughput of a routing path in wireless multihop network is restricted by a bottleneck node that has the smallest bandwidth among the nodes on the routing path. In this study, we propose a method for resolving the bottleneck-node problem in multihop networks, which is based on multihop DESYNC (MH-DESYNC algorithm that is a bioinspired resource allocation method developed for use in multihop environments and enables fair resource allocation among nearby (up to two hops neighbors. Based on MH-DESYNC, we newly propose weighted-DESYNC (W-DESYNC as a tool artificially to control the amount of resource allocated to the specific user and thus to achieve throughput fairness over a routing path. Proposed W-DESYNC employs the weight factor of a link to determine the amount of bandwidth allocated to a node. By letting the weight factor be the link quality of a routing path and making it the same across a routing path via Cucker-Smale flocking model, we can obtain throughput fairness over a routing path. The simulation results show that the proposed algorithm achieves throughput fairness over a routing path and can increase total end-to-end throughput in wireless multihop networks.

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.

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.

Graph theoretical stable allocation as a tool for reproduction of control by human operators

Science.gov (United States)

van Nooijen, Ronald; Ertsen, Maurits; Kolechkina, Alla

2016-04-01

During the design of central control algorithms for existing water resource systems under manual control it is important to consider the interaction with parts of the system that remain under manual control and to compare the proposed new system with the existing manual methods. In graph theory the "stable allocation" problem has good solution algorithms and allows for formulation of flow distribution problems in terms of priorities. As a test case for the use of this approach we used the algorithm to derive water allocation rules for the Gezira Scheme, an irrigation system located between the Blue and White Niles south of Khartoum. In 1925, Gezira started with 300,000 acres; currently it covers close to two million acres.

Land use allocation model considering climate change impact

Science.gov (United States)

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

Research status of multi - robot systems task allocation and uncertainty treatment

Science.gov (United States)

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.

A novel frame-level constant-distortion bit allocation for smooth H.264/AVC video quality

Science.gov (United States)

Liu, Li; Zhuang, Xinhua

2009-01-01

It is known that quality fluctuation has a major negative effect on visual perception. In previous work, we introduced a constant-distortion bit allocation method [1] for H.263+ encoder. However, the method in [1] can not be adapted to the newest H.264/AVC encoder directly as the well-known chicken-egg dilemma resulted from the rate-distortion optimization (RDO) decision process. To solve this problem, we propose a new two stage constant-distortion bit allocation (CDBA) algorithm with enhanced rate control for H.264/AVC encoder. In stage-1, the algorithm performs RD optimization process with a constant quantization QP. Based on prediction residual signals from stage-1 and target distortion for smooth video quality purpose, the frame-level bit target is allocated by using a close-form approximations of ratedistortion relationship similar to [1], and a fast stage-2 encoding process is performed with enhanced basic unit rate control. Experimental results show that, compared with original rate control algorithm provided by H.264/AVC reference software JM12.1, the proposed constant-distortion frame-level bit allocation scheme reduces quality fluctuation and delivers much smoother PSNR on all testing sequences.

An efficient algorithm for removal of inactive blocks in reservoir simulation

Energy Technology Data Exchange (ETDEWEB)

Abou-Kassem, J.H.; Ertekin, T. (Pennsylvania State Univ., PA (United States))

1992-02-01

In the efficient simulation of reservoirs having irregular boundaries one is confronted with two problems: the removal of inactive blocks at the matrix level and the development and application of a variable band-width solver. A simple algorithm is presented that provides effective solutions to these two problems. The algorithm is demonstrated for both the natural ordering and D4 ordering schemes. It can be easily incorporated in existing simulators and results in significant savings in CPU and matrix storage requirements. The removal of the inactive blocks at the matrix level plays a major role in effecting these savings whereas the application of a variable band-width solver plays an enhancing role only. The value of this algorithm lies in the fact that it takes advantage of irregular reservoir boundaries that are invariably encountered in almost all practical applications of reservoir simulation. 11 refs., 3 figs., 3 tabs.

Finding the Pareto Optimal Equitable Allocation of Homogeneous Divisible Goods Among Three Players

Directory of Open Access Journals (Sweden)

Marco Dall'Aglio

2017-01-01

Full Text Available We consider the allocation of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we develop a simple algorithm that returns a Pareto optimal and equitable allocation. This is based on the tight relationship between two geometric objects of fair division: The Individual Pieces Set (IPS and the Radon-Nykodim Set (RNS. The algorithm can be considered as an extension of the Adjusted Winner procedure by Brams and Taylor to the three-player case, without the guarantee of envy-freeness. (original abstract

A framework for resources allocation in virtualised C-RAN

DEFF Research Database (Denmark)

Al-Samman, Imad; Artuso, Matteo; Christiansen, Henrik Lehrmann

2016-01-01

the performance gains of different resource allocation schemes in legacy LTE air interface virtualization. Moreover Cloud — based mobile networks are anticipated to play a significant role for next generation mobile networks. This paper investigates the potential deployment benefits of a novel resource...... virtualization algorithm (Traffic Aware Joint Scheduling) in Cloud-RANs (C-RAN). Air interface resources are coordinated and allocated dynamically by a hypervisor among different virtual operators (VOs). Three distinctive schemes are proposed and evaluated against standard Round Robin (RR) C-RAN scheduling...

Large bandwidth RGC transimpedance preamplifier design in SCA

International Nuclear Information System (INIS)

Wang Ke; Wang Zheng; Liu Zhen'an; Wei Wei; Lu Weiguo; Gary Varner

2009-01-01

A Large Bandwidth RGC Transimpedance Preamplifier is designed for amplifying the high-fidelity timing signal in Switch Capacitance Array chip application. This amplifier have characteristics of low input impedance, large bandwidth, high transimpedance. It will be made under TSMC 0.25μm CMOS technology, and the supply voltage is single 2.5 V. Simulation results indicate: the transimpedance is 5000 ohm, -3dB BW is 953 MHz, and the detector output capacitance have litter effect on the bandwidth in some range. (authors)

Joint User Scheduling and MU-MIMO Hybrid Beamforming Algorithm for mmWave FDMA Massive MIMO System

Directory of Open Access Journals (Sweden)

Jing Jiang

2016-01-01

Full Text Available The large bandwidth and multipath in millimeter wave (mmWave cellular system assure the existence of frequency selective channels; it is necessary that mmWave system remains with frequency division multiple access (FDMA and user scheduling. But for the hybrid beamforming system, the analog beamforming is implemented by the same phase shifts in the entire frequency band, and the wideband phase shifts may not be harmonious with all users scheduled in frequency resources. This paper proposes a joint user scheduling and multiuser hybrid beamforming algorithm for downlink massive multiple input multiple output (MIMO orthogonal frequency division multiple access (OFDMA systems. In the first step of user scheduling, the users with identical optimal beams form an OFDMA user group and multiplex the entire frequency resource. Then base station (BS allocates the frequency resources for each member of OFDMA user group. An OFDMA user group can be regarded as a virtual user; thus it can support arbitrary MU-MIMO user selection and beamforming algorithms. Further, the analog beamforming vectors employ the best beam of each selected MU-MIMO user and the digital beamforming algorithm is solved by weight MMSE to acquire the best performance gain and mitigate the interuser inference. Simulation results show that hybrid beamforming together with user scheduling can greatly improve the performance of mmWave OFDMA massive MU-MIMO system.

Optimal allocation of reviewers for peer feedback

DEFF Research Database (Denmark)

Wind, David Kofoed; Jensen, Ulf Aslak; Jørgensen, Rasmus Malthe

2017-01-01

feedback to be effective students should give and receive useful feedback. A key challenge in peer feedback is allocating the feedback givers in a good way. It is important that reviewers are allocated to submissions such that the feedback distribution is fair - meaning that all students receive good......Peer feedback is the act of letting students give feedback to each other on submitted work. There are multiple reasons to use peer feedback, including students getting more feedback, time saving for teachers and increased learning by letting students reflect on work by others. In order for peer...... indicated the quality of the feedback. Using this model together with historical data we calculate the feedback-giving skill of each student and uses that as input to an allocation algorithm that assigns submissions to reviewers, in order to optimize the feedback quality for all students. We test...

Joint duplex mode selection, channel allocation, and power control for full-duplex cognitive femtocell networks

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.

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.

Bit Loading Algorithms for Cooperative OFDM Systems

Directory of Open Access Journals (Sweden)

Bo Gui

2007-12-01

Full Text Available 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.

PIC Simulation of Laser Plasma Interactions with Temporal Bandwidths

Science.gov (United States)

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.

New resource allocation scheme for cognitive relay networks with opportunistic access

KAUST Repository

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.

Green cloud environment by using robust planning algorithm

Directory of Open Access Journals (Sweden)

Jyoti Thaman

2017-11-01

Full Text Available Cloud computing provided a framework for seamless access to resources through network. Access to resources is quantified through SLA between service providers and users. Service provider tries to best exploit their resources and reduce idle times of the resources. Growing energy concerns further makes the life of service providers miserable. User’s requests are served by allocating users tasks to resources in Clouds and Grid environment through scheduling algorithms and planning algorithms. With only few Planning algorithms in existence rarely planning and scheduling algorithms are differentiated. This paper proposes a robust hybrid planning algorithm, Robust Heterogeneous-Earliest-Finish-Time (RHEFT for binding tasks to VMs. The allocation of tasks to VMs is based on a novel task matching algorithm called Interior Scheduling. The consistent performance of proposed RHEFT algorithm is compared with Heterogeneous-Earliest-Finish-Time (HEFT and Distributed HEFT (DHEFT for various parameters like utilization ratio, makespan, Speed-up and Energy Consumption. RHEFT’s consistent performance against HEFT and DHEFT has established the robustness of the hybrid planning algorithm through rigorous simulations.

Fluid Limits for Bandwidth-Sharing Networks in Overload.

NARCIS (Netherlands)

Borst, S.; Egorova, R.; Zwart, A.P.

2014-01-01

Bandwidth-sharing networks as considered by Roberts and Massoulié [28] (Roberts JW, Massoulié L (1998) Bandwidth sharing and admission control for elastic traffic. Proc. ITC Specialist Seminar, Yokohama, Japan) provide a natural modeling framework for describing the dynamic flow-level interaction

Fluid limits for bandwidth-sharing networks in overload

NARCIS (Netherlands)

Borst, S.C.; Egorova, R.R.; Zwart, B.

2014-01-01

Bandwidth-sharing networks as considered by Roberts and Massoulié [28] (Roberts JW, Massoulié L (1998) Bandwidth sharing and admission control for elastic traffic. Proc. ITC Specialist Seminar, Yokohama, Japan) provide a natural modeling framework for describing the dynamic flow-level interaction

An acquisition system for CMOS imagers with a genuine 10 Gbit/s bandwidth

International Nuclear Information System (INIS)

Guérin, C.; Mahroug, J.; Tromeur, W.; Houles, J.; Calabria, P.; Barbier, R.

2012-01-01

This paper presents a high data throughput acquisition system for pixel detector readout such as CMOS imagers. This CMOS acquisition board offers a genuine 10 Gbit/s bandwidth to the workstation and can provide an on-line and continuous high frame rate imaging capability. On-line processing can be implemented either on the Data Acquisition Board or on the multi-cores workstation depending on the complexity of the algorithms. The different parts composing the acquisition board have been designed to be used first with a single-photon detector called LUSIPHER (800×800 pixels), developed in our laboratory for scientific applications ranging from nano-photonics to adaptive optics. The architecture of the acquisition board is presented and the performances achieved by the produced boards are described. The future developments (hardware and software) concerning the on-line implementation of algorithms dedicated to single-photon imaging are tackled.

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.

A note on resource allocation scheduling with group technology and learning effects on a single machine

Science.gov (United States)

Lu, Yuan-Yuan; Wang, Ji-Bo; Ji, Ping; He, Hongyu

2017-09-01

In this article, single-machine group scheduling with learning effects and convex resource allocation is studied. The goal is to find the optimal job schedule, the optimal group schedule, and resource allocations of jobs and groups. For the problem of minimizing the makespan subject to limited resource availability, it is proved that the problem can be solved in polynomial time under the condition that the setup times of groups are independent. For the general setup times of groups, a heuristic algorithm and a branch-and-bound algorithm are proposed, respectively. Computational experiments show that the performance of the heuristic algorithm is fairly accurate in obtaining near-optimal solutions.

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

Potential of dynamic spectrum allocation in LTE macro networks

Science.gov (United States)

Hoffmann, H.; Ramachandra, P.; Kovács, I. Z.; Jorguseski, L.; Gunnarsson, F.; Kürner, T.

2015-11-01

In recent years Mobile Network Operators (MNOs) worldwide are extensively deploying LTE networks in different spectrum bands and utilising different bandwidth configurations. Initially, the deployment is coverage oriented with macro cells using the lower LTE spectrum bands. As the offered traffic (i.e. the requested traffic from the users) increases the LTE deployment evolves with macro cells expanded with additional capacity boosting LTE carriers in higher frequency bands complemented with micro or small cells in traffic hotspot areas. For MNOs it is crucial to use the LTE spectrum assets, as well as the installed network infrastructure, in the most cost efficient way. The dynamic spectrum allocation (DSA) aims at (de)activating the available LTE frequency carriers according to the temporal and spatial traffic variations in order to increase the overall LTE system performance in terms of total network capacity by reducing the interference. This paper evaluates the DSA potential of achieving the envisaged performance improvement and identifying in which system and traffic conditions the DSA should be deployed. A self-optimised network (SON) DSA algorithm is also proposed and evaluated. The evaluations have been carried out in a hexagonal and a realistic site-specific urban macro layout assuming a central traffic hotspot area surrounded with an area of lower traffic with a total size of approximately 8 × 8 km2. The results show that up to 47 % and up to 40 % possible DSA gains are achievable with regards to the carried system load (i.e. used resources) for homogenous traffic distribution with hexagonal layout and for realistic site-specific urban macro layout, respectively. The SON DSA algorithm evaluation in a realistic site-specific urban macro cell deployment scenario including realistic non-uniform spatial traffic distribution shows insignificant cell throughput (i.e. served traffic) performance gains. Nevertheless, in the SON DSA investigations, a gain of up

A Survey of Wireless Fair Queuing Algorithms with Location-Dependent Channel Errors

Directory of Open Access Journals (Sweden)

Anca VARGATU

2011-01-01

Full Text Available The rapid development of wireless networks has brought more and more attention to topics related to fair allocation of resources, creation of suitable algorithms, taking into account the special characteristics of wireless environment and insurance fair access to the transmission channel, with delay bound and throughput guaranteed. Fair allocation of resources in wireless networks requires significant challenges, because of errors that occur only in these networks, such as location-dependent and bursty channel errors. In wireless networks, frequently happens, because interference of radio waves, that a user experiencing bad radio conditions during a period of time, not to receive resources in that period. This paper analyzes some resource allocation algorithms for wireless networks with location dependent errors, specifying the base idea for each algorithm and the way how it works. The analyzed fair queuing algorithms differ by the way they treat the following aspects: how to select the flows which should receive additional services, how to allocate these resources, which is the proportion received by error free flows and how the flows affected by errors are compensated.

Optimal allocation and adaptive VAR control of PV-DG in distribution networks

International Nuclear Information System (INIS)

Fu, Xueqian; Chen, Haoyong; Cai, Runqing; Yang, Ping

2015-01-01

Highlights: • A methodology for optimal PV-DG allocation based on a combination of algorithms. • Dealing with the randomicity of solar power energy using CCSP. • Presenting a VAR control strategy to balance the technical demands. • Finding the Pareto solutions using MOPSO and SVM. • Evaluating the Pareto solutions using WRSR. - Abstract: The development of distributed generation (DG) has brought new challenges to power networks. One of them that catches extensive attention is the voltage regulation problem of distribution networks caused by DG. Optimal allocation of DG in distribution networks is another well-known problem being widely investigated. This paper proposes a new method for the optimal allocation of photovoltaic distributed generation (PV-DG) considering the non-dispatchable characteristics of PV units. An adaptive reactive power control model is introduced in PV-DG allocation as to balance the trade-off between the improvement of voltage quality and the minimization of power loss in a distribution network integrated with PV-DG units. The optimal allocation problem is formulated as a chance-constrained stochastic programming (CCSP) model for dealing with the randomness of solar power energy. A novel algorithm combining the multi-objective particle swarm optimization (MOPSO) with support vector machines (SVM) is proposed to find the Pareto front consisting of a set of possible solutions. The Pareto solutions are further evaluated using the weighted rank sum ratio (WRSR) method to help the decision-maker obtain the desired solution. Simulation results on a 33-bus radial distribution system show that the optimal allocation method can fully take into account the time-variant characteristics and probability distribution of PV-DG, and obtain the best allocation scheme

Models of resource allocation optimization when solving the control problems in organizational systems

Science.gov (United States)

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.

Relay selection and resource allocation for two-way DF-AF cognitive radio networks

KAUST Repository

Alsharoa, Ahmad M.; Bader, Faouzi; Alouini, Mohamed-Slim

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

Relay selection and resource allocation for two-way DF-AF cognitive radio networks

KAUST Repository

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.

Energy-Aware Sensor Networks via Sensor Selection and Power Allocation

KAUST Repository

Niyazi, Lama B.; Chaaban, Anas; Dahrouj, Hayssam; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2018-01-01

sensor selection and power allocation algorithms of low complexity. Simulation results show an appreciable improvement in their performance over a system in which no selection strategy is applied, with a slight gap from derived lower bounds. The results

Sensitivity-Bandwidth Limit in a Multimode Optoelectromechanical Transducer

Science.gov (United States)

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.

A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem

Science.gov (United States)

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.

A distributed scheduling algorithm for heterogeneous real-time systems

Science.gov (United States)

Zeineldine, Osman; El-Toweissy, Mohamed; Mukkamala, Ravi

1991-01-01

Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

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

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

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.

Wide-bandwidth bilateral control using two-stage actuator system

International Nuclear Information System (INIS)

Kokuryu, Saori; Izutsu, Masaki; Kamamichi, Norihiro; Ishikawa, Jun

2015-01-01

This paper proposes a two-stage actuator system that consists of a coarse actuator driven by a ball screw with an AC motor (the first stage) and a fine actuator driven by a voice coil motor (the second stage). The proposed two-stage actuator system is applied to make a wide-bandwidth bilateral control system without needing expensive high-performance actuators. In the proposed system, the first stage has a wide moving range with a narrow control bandwidth, and the second stage has a narrow moving range with a wide control bandwidth. By consolidating these two inexpensive actuators with different control bandwidths in a complementary manner, a wide bandwidth bilateral control system can be constructed based on a mechanical impedance control. To show the validity of the proposed method, a prototype of the two-stage actuator system has been developed and basic performance was evaluated by experiment. The experimental results showed that a light mechanical impedance with a mass of 10 g and a damping coefficient of 2.5 N/(m/s) that is an important factor to establish good transparency in bilateral control has been successfully achieved and also showed that a better force and position responses between a master and slave is achieved by using the proposed two-stage actuator system compared with a narrow bandwidth case using a single ball screw system. (author)

Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations

OpenAIRE

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

Power Allocation and Outage Probability Analysis for SDN-based Radio Access Networks

Science.gov (United States)

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.

Allocation algorithm for athletes group to form tactical tasks in game team sports using the methods of multivariate analysis (illustrated women Ukrainian team basketball with hearing impairments

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.

Critical-path-first based allocation of real-time streaming applications on 2D mesh-type multi-cores.

NARCIS (Netherlands)

Ali, Hazem; Pinho, Luis Miguel; Akesson, K.B.

2013-01-01

Designing cost-efficient multi-core real-time systems requires efficient techniques to allocate applications to cores while satisfying their timing constraints. However, existing approaches typically allocate using a First-Fit algorithm, which does not consider the execution time and potential

Radio resource allocation over fading channels under statistical delay constraints

CERN Document Server

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

Allocation and sequencing in 1-out-of-N heterogeneous cold-standby systems: Multi-objective harmony search with dynamic parameters tuning

International Nuclear Information System (INIS)

Valaei, M.R.; Behnamian, J.

2017-01-01

A redundancy allocation is a famous problem in reliability sciences. A lot of researcher investigated about this problem, but a few of them focus on heterogeneous 1-out-of-N: G cold-standby redundancy in each subsystem. This paper considers a redundancy allocation problem (RAP) and standby element sequencing problem (SESP) for 1-out-of-N: G heterogeneous cold-standby system, simultaneously. Moreover, here, maximizing reliability of cold-standby allocation and minimizing cost of buying and time-independent elements are considered as two conflict objectives. This problem is NP-Hard and consequently, devizing a metaheuristic to solve this problem, especially for large-sized instances, is highly desirable. In this paper, we propose a multi-objective harmony search. Based on Taguchi experimental design, we, also, present a new parameters tuning method to improve the proposed algorithm. - Graphical abstract: Example of solution encoding. - Highlights: • This paper considers a redundancy allocation and standby element sequencing problem. • To solve this problem, a multi-objective harmony search algorithm is proposed. • Dynamic parameters tuning method is applied to improved the algorithm. • With this method, sensitivity of the algorithm to initial parameters is reduced.

Design of bandwidth tunable HTS filter using H-shaped waveguides

Energy Technology Data Exchange (ETDEWEB)

Koike, Y. [Department of Electrical Engineering, University of Yamanashi, Nakagawa-Sekiya Laboratory, 4-3-11 Takeda, Kofu 400-8511 (Japan); Sekiya, N., E-mail: nsekiya@yamanashi.ac.j [Department of Electrical Engineering, University of Yamanashi, Nakagawa-Sekiya Laboratory, 4-3-11 Takeda, Kofu 400-8511 (Japan); Nakagawa, Y. [Department of Electrical Engineering, University of Yamanashi, Nakagawa-Sekiya Laboratory, 4-3-11 Takeda, Kofu 400-8511 (Japan); Ohshima, S. [Yamagata University, 4-3-16 Johnan, Yonezawa 992-8510 (Japan)

2009-10-15

We have developed a bandwidth tuning method for use in high-temperature superconducting (HTS) microstrip filters. Several H-shaped waveguides are placed between the resonators, and the bandwidth is adjusted by changing the switch states of the waveguides. The coupling coefficients between the resonators are controlled by switching the connection or isolation of the center gaps of the waveguides so as to tune the bandwidth. The effects of using this method were evaluated by simulation using a filter composed of 3-pole half-wavelength straight-line resonators with an H-shaped waveguide between each pair and additional electric pads for post-tuning trimming. The filter was designed to have a center frequency of 5 GHz and a bandwidth of 100 MHz by using an electromagnetic simulator based on the moment method. The simulation showed that bandwidth tuning of 150 MHz can be obtained by using H-shaped waveguides to adjust the coupling coefficients. It also showed that using additional electric pads around the feed lines, which was previously shown to be useful for trimming to improve insertion loss after center-frequency tuning, is also useful for bandwidth tuning.

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

Knee implant imaging at 3 Tesla using high-bandwidth radiofrequency pulses.

Science.gov (United States)

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.

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.

Resource Allocation for Outdoor Visible Light Communications with Energy Harvesting Capabilities

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz

2018-01-25

Visible light communication (VLC) is a promising technology that can support high data rate services for outdoor mass gathering night events while permitting energy harvesting. In this paper, a VLC system is considered where a transmitter sends data to multiple users with energy harvesting capabilities. This multi-user VLC scenario can be supported using time division multiple access (TDMA). The achievable rates using TDMA are expressed in terms of the allocated resources per user, represented by average optical intensity and time slots. This allocation is to be optimized in order to maximize the average spectral efficiency while meeting power and quality-of-service (QoS) constraints. Herein, QoS is defined as a worst-case guaranteed rate and a minimum harvested energy. To solve this optimization, the optimality conditions are first derived. Then, an efficient algorithm is developed based on the derived conditions, and its near-optimality is verified through several numerical evaluations. The obtained performance is also compared to lower-complexity algorithms, thus reflecting the performance-complexity trade-off of these algorithms.

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

Science.gov (United States)

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

2015-05-18

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

Distributed Task Rescheduling With Time Constraints for the Optimization of Total Task Allocations in a Multirobot System.

Science.gov (United States)

Turner, Joanna; Meng, Qinggang; Schaefer, Gerald; Whitbrook, Amanda; Soltoggio, Andrea

2017-09-28

This paper considers the problem of maximizing the number of task allocations in a distributed multirobot system under strict time constraints, where other optimization objectives need also be considered. It builds upon existing distributed task allocation algorithms, extending them with a novel method for maximizing the number of task assignments. The fundamental idea is that a task assignment to a robot has a high cost if its reassignment to another robot creates a feasible time slot for unallocated tasks. Multiple reassignments among networked robots may be required to create a feasible time slot and an upper limit to this number of reassignments can be adjusted according to performance requirements. A simulated rescue scenario with task deadlines and fuel limits is used to demonstrate the performance of the proposed method compared with existing methods, the consensus-based bundle algorithm and the performance impact (PI) algorithm. Starting from existing (PI-generated) solutions, results show up to a 20% increase in task allocations using the proposed method.

ANCS: Achieving QoS through Dynamic Allocation of Network Resources in Virtualized Clouds

Directory of Open Access Journals (Sweden)

Cheol-Ho Hong

2016-01-01

Full Text Available To meet the various requirements of cloud computing users, research on guaranteeing Quality of Service (QoS is gaining widespread attention in the field of cloud computing. However, as cloud computing platforms adopt virtualization as an enabling technology, it becomes challenging to distribute system resources to each user according to the diverse requirements. Although ample research has been conducted in order to meet QoS requirements, the proposed solutions lack simultaneous support for multiple policies, degrade the aggregated throughput of network resources, and incur CPU overhead. In this paper, we propose a new mechanism, called ANCS (Advanced Network Credit Scheduler, to guarantee QoS through dynamic allocation of network resources in virtualization. To meet the various network demands of cloud users, ANCS aims to concurrently provide multiple performance policies; these include weight-based proportional sharing, minimum bandwidth reservation, and maximum bandwidth limitation. In addition, ANCS develops an efficient work-conserving scheduling method for maximizing network resource utilization. Finally, ANCS can achieve low CPU overhead via its lightweight design, which is important for practical deployment.

Optimal Bandwidth Selection in Observed-Score Kernel Equating

Science.gov (United States)

Häggström, Jenny; Wiberg, Marie

2014-01-01

The selection of bandwidth in kernel equating is important because it has a direct impact on the equated test scores. The aim of this article is to examine the use of double smoothing when selecting bandwidths in kernel equating and to compare double smoothing with the commonly used penalty method. This comparison was made using both an equivalent…

Optimal allocation of multi-state retransmitters in acyclic transmission networks

International Nuclear Information System (INIS)

Levitin, Gregory

2002-01-01

In this paper, an algorithm for optimal allocation of multi-state elements (MEs) in acyclic transmission networks (ATNs) is suggested. The ATNs consist of a number of positions (nodes) in which MEs capable of receiving and sending a signal are allocated. Each network has a root position where the signal source is located, a number of leaf positions that can only receive a signal, and a number of intermediate positions containing MEs capable of transmitting the received signal to some other nodes. Each ME that is located in a nonleaf node can have different states determined by a set of nodes receiving the signal directly from this ME. The probability of each state is assumed to be known for each ME. The ATN reliability is defined as the probability that a signal from the root node is transmitted to each leaf node. The optimal distribution of MEs with different characteristics among ATN positions provides the greatest possible ATN reliability. The suggested algorithm is based on using a universal generating function technique for network reliability evaluation. A genetic algorithm is used as the optimization tool. Illustrative examples are presented

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

SVC VIDEO STREAM ALLOCATION AND ADAPTATION IN HETEROGENEOUS NETWORK

Directory of Open Access Journals (Sweden)

E. A. Pakulova

2016-07-01

Full Text Available The paper deals with video data transmission in format H.264/SVC standard with QoS requirements satisfaction. The Sender-Side Path Scheduling (SSPS algorithm and Sender-Side Video Adaptation (SSVA algorithm were developed. SSPS algorithm gives the possibility to allocate video traffic among several interfaces while SSVA algorithm dynamically changes the quality of video sequence in relation to QoS requirements. It was shown that common usage of two developed algorithms enables to aggregate throughput of access networks, increase parameters of Quality of Experience and decrease losses in comparison with Round Robin algorithm. For evaluation of proposed solution, the set-up was made. The trace files with throughput of existing public networks were used in experiments. Based on this information the throughputs of networks were limited and losses for paths were set. The results of research may be used for study and transmission of video data in heterogeneous wireless networks.

Combined Rate and Power Allocation with Link Scheduling in Wireless Data Packet Relay Networks with Fading Channels

Directory of Open Access Journals (Sweden)

Subhrakanti Dey

2007-08-01

Full Text Available We consider a joint rate and power control problem in a wireless data traffic relay network with fading channels. The optimization problem is formulated in terms of power and rate selection, and link transmission scheduling. The objective is to seek high aggregate utility of the relay node when taking into account buffer load management and power constraints. The optimal solution for a single transmitting source is computed by a two-layer dynamic programming algorithm which leads to optimal power, rate, and transmission time allocation at the wireless links. We further consider an optimal power allocation problem for multiple transmitting sources in the same framework. Performances of the resource allocation algorithms including the effect of buffer load control are illustrated via extensive simulation studies.

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.

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.

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

Tactical Decision Aids High Bandwidth Links Using Autonomous Vehicles

Science.gov (United States)

2004-01-01

1 Tactical Decision Aids (High Bandwidth Links Using Autonomous Vehicles ) A. J. Healey, D. P. Horner, Center for Autonomous Underwater Vehicle...SUBTITLE Tactical Decision Aids (High Bandwidth Links Using Autonomous Vehicles ) 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6

Resource Allocation of Security-Critical Tasks with Statistically Guaranteed Energy Constraint

DEFF Research Database (Denmark)

Jiang, Wei; Jiang, Ke; Ma, Yue

2012-01-01

In this paper, we are interested in resource allocation for energy constrained and security-critical embedded systems. Tasks in such systems need to be successfully executed under certain energy budget and be robust against serious security threatens. Different to former energy minimal scheduling...... energy slack ratio. The proposed algorithm is very efficient in both time and space dimensions, and achieves good solutions. Extensive simulations demonstrate the superiority of our algorithm over other approaches....

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

Spectrum and power allocation in cognitive multi-beam satellite communications with flexible satellite payloads

Science.gov (United States)

Liu, Zhihui; Wang, Haitao; Dong, Tao; Yin, Jie; Zhang, Tingting; Guo, Hui; Li, Dequan

2018-02-01

In this paper, the cognitive multi-beam satellite system, i.e., two satellite networks coexist through underlay spectrum sharing, is studied, and the power and spectrum allocation method is employed for interference control and throughput maximization. Specifically, the multi-beam satellite with flexible payload reuses the authorized spectrum of the primary satellite, adjusting its transmission band as well as power for each beam to limit its interference on the primary satellite below the prescribed threshold and maximize its own achievable rate. This power and spectrum allocation problem is formulated as a mixed nonconvex programming. For effective solving, we first introduce the concept of signal to leakage plus noise ratio (SLNR) to decouple multiple transmit power variables in the both objective and constraint, and then propose a heuristic algorithm to assign spectrum sub-bands. After that, a stepwise plus slice-wise algorithm is proposed to implement the discrete power allocation. Finally, simulation results show that adopting cognitive technology can improve spectrum efficiency of the satellite communication.

Modeling Multioperator Multi-UAV Operator Attention Allocation Problem Based on Maximizing the Global Reward

Directory of Open Access Journals (Sweden)

Yuhang Wu

2016-01-01

Full Text Available This paper focuses on the attention allocation problem (AAP in modeling multioperator multi-UAV (MOMU, with the operator model and task properties taken into consideration. The model of MOMU operator AAP based on maximizing the global reward is established and used to allocate tasks to all operators as well as set work time and rest time to each task simultaneously for operators. The proposed model is validated in Matlab simulation environment, using the immune algorithm and dynamic programming algorithm to evaluate the performance of the model in terms of the reward value with regard to the work time, rest time, and task allocation. The result shows that the total reward of the proposed model is larger than the one obtained from previously published methods using local maximization and the total reward of our method has an exponent-like relation with the task arrival rate. The proposed model can improve the operators’ task processing efficiency in the MOMU command and control scenarios.

Real-time distributed scheduling algorithm for supporting QoS over WDM networks

Science.gov (United States)

Kam, Anthony C.; Siu, Kai-Yeung

1998-10-01

Most existing or proposed WDM networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently they are not suitable for data applications involving bursty traffic patterns. The MIT AON Consortium has developed an all-optical LAN/MAN testbed which provides time-slotted WDM service and employs fast-tunable transceivers in each optical terminal. In this paper, we explore extensions of this service to achieve fine-grained statistical multiplexing with different virtual circuits time-sharing the wavelengths in a fair manner. In particular, we develop a real-time distributed protocol for best-effort traffic over this time-slotted WDM service with near-optical fairness and throughput characteristics. As an additional design feature, our protocol supports the allocation of guaranteed bandwidths to selected connections. This feature acts as a first step towards supporting integrated services and quality-of-service guarantees over WDM networks. To achieve high throughput, our approach is based on scheduling transmissions, as opposed to collision- based schemes. Our distributed protocol involves one MAN scheduler and several LAN schedulers (one per LAN) in a master-slave arrangement. Because of propagation delays and limits on control channel capacities, all schedulers are designed to work with partial, delayed traffic information. Our distributed protocol is of the `greedy' type to ensure fast execution in real-time in response to dynamic traffic changes. It employs a hybrid form of rate and credit control for resource allocation. We have performed extensive simulations, which show that our protocol allocates resources (transmitters, receivers, wavelengths) fairly with high throughput, and supports bandwidth guarantees.

Multiarea Transmission Cost Allocation in Large Power Systems Using the Nodal Pricing Control Approach

Directory of Open Access Journals (Sweden)

M. Ghayeni

2010-12-01

Full Text Available This paper proposes an algorithm for transmission cost allocation (TCA in a large power system based on nodal pricing approach using the multi-area scheme. The nodal pricing approach is introduced to allocate the transmission costs by the control of nodal prices in a single area network. As the number of equations is dependent on the number of buses and generators, this method will be very time consuming for large power systems. To solve this problem, the present paper proposes a new algorithm based on multi-area approach for regulating the nodal prices, so that the simulation time is greatly reduced and therefore the TCA problem with nodal pricing approach will be applicable for large power systems. In addition, in this method the transmission costs are allocated to users more equitable. Since the higher transmission costs in an area having a higher reliability are paid only by users of that area in contrast with the single area method, in which these costs are allocated to all users regardless of their locations. The proposed method is implemented on the IEEE 118 bus test system which comprises three areas. Results show that with application of multi-area approach, the simulation time is greatly reduced and the transmission costs are also allocated to users with less variation in new nodal prices with respect to the single area approach.

Optical power allocation for adaptive transmissions in wavelength-division multiplexing free space optical networks

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.

Artificial intelligent techniques for optimizing water allocation in a reservoir watershed

Science.gov (United States)

Chang, Fi-John; Chang, Li-Chiu; Wang, Yu-Chung

2014-05-01

This study proposes a systematical water allocation scheme that integrates system analysis with artificial intelligence techniques for reservoir operation in consideration of the great uncertainty upon hydrometeorology for mitigating droughts impacts on public and irrigation sectors. The AI techniques mainly include a genetic algorithm and adaptive-network based fuzzy inference system (ANFIS). We first derive evaluation diagrams through systematic interactive evaluations on long-term hydrological data to provide a clear simulation perspective of all possible drought conditions tagged with their corresponding water shortages; then search the optimal reservoir operating histogram using genetic algorithm (GA) based on given demands and hydrological conditions that can be recognized as the optimal base of input-output training patterns for modelling; and finally build a suitable water allocation scheme through constructing an adaptive neuro-fuzzy inference system (ANFIS) model with a learning of the mechanism between designed inputs (water discount rates and hydrological conditions) and outputs (two scenarios: simulated and optimized water deficiency levels). The effectiveness of the proposed approach is tested on the operation of the Shihmen Reservoir in northern Taiwan for the first paddy crop in the study area to assess the water allocation mechanism during drought periods. We demonstrate that the proposed water allocation scheme significantly and substantially avails water managers of reliably determining a suitable discount rate on water supply for both irrigation and public sectors, and thus can reduce the drought risk and the compensation amount induced by making restrictions on agricultural use water.

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.

Variable Bandwidth Analog Channel Filters for Software Defined Radio

NARCIS (Netherlands)

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

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

Dynamic pricing and automated resource allocation for complex information services reinforcement learning and combinatorial auctions

CERN Document Server

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

3600 digital phase detector with 100-kHz bandwidth

International Nuclear Information System (INIS)

Reid, D.W.; Riggin, D.; Fazio, M.V.; Biddle, R.S.; Patton, R.D.; Jackson, H.A.

1981-01-01

The general availability of digital circuit components with propagation delay times of a few nanoseconds makes a digital phase detector with good bandwidth feasible. Such a circuit has a distinct advantage over its analog counterpart because of its linearity over wide range of phase shift. A phase detector that is being built at Los Alamos National Laboratory for the Fusion Materials Irradiation Test (FMIT) project is described. The specifications are 100-kHz bandwidth, linearity of +- 1 0 over +- 180 0 of phase shift, and 0.66 0 resolution. To date, the circuit has achieved the bandwidth and resolution. The linearity is approximately +- 3 0 over +- 180 0 phase shift

Application research of power allocation based on Buck circuit in DC microgrid

OpenAIRE

Wang Zihao; Zhou Mingyu

2017-01-01

In a traditional DC microgrid, the power sharing control strategy has been always used in the distributed power converters, resulting in not making outer power allocation arbitrarily. In order to solve the power output allocation problem of wind power in DC microgrid, the intelligent Buck circuit based on PI algorithm and the load current feed-forward method was used to realize the arbitrary regulation of the output power of the wind power in the DC microgrid system. Compared with traditional...

Towards Bandwidth Scalable Transceiver Technology for Optical Metro-Access Networks

DEFF Research Database (Denmark)

Spolitis, Sandis; Bobrovs, Vjaceslavs; Wagner, Christoph

2015-01-01

sliceable transceiver for 1 Gbit/s non-return to zero (NRZ) signal sliced into two slices is presented. Digital signal processing (DSP) power consumption and latency values for proposed sliceable transceiver technique are also discussed. In this research post FEC with 7% overhead error free transmission has......Massive fiber-to-the-home network deployment is creating a challenge for telecommunications network operators: exponential increase of the power consumption at the central offices and a never ending quest for equipment upgrades operating at higher bandwidth. In this paper, we report on flexible...... signal slicing technique, which allows transmission of high-bandwidth signals via low bandwidth electrical and optoelectrical equipment. The presented signal slicing technique is highly scalable in terms of bandwidth which is determined by the number of slices used. In this paper performance of scalable...

Energy-Efficient Power Allocation of Cognitive Radio Systems without CSI at the Transmitter

KAUST Repository

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.

Energy-Efficient Power Allocation of Cognitive Radio Systems without CSI at the Transmitter

KAUST Repository

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

2015-01-01

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.

Bandwidth tunable microwave photonic filter based on digital and analog modulation

Science.gov (United States)

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.

Ultra-high bandwidth quantum secured data transmission

Science.gov (United States)

Dynes, James F.; Tam, Winci W.-S.; Plews, Alan; Fröhlich, Bernd; Sharpe, Andrew W.; Lucamarini, Marco; Yuan, Zhiliang; Radig, Christian; Straw, Andrew; Edwards, Tim; Shields, Andrew J.

2016-10-01

Quantum key distribution (QKD) provides an attractive means for securing communications in optical fibre networks. However, deployment of the technology has been hampered by the frequent need for dedicated dark fibres to segregate the very weak quantum signals from conventional traffic. Up until now the coexistence of QKD with data has been limited to bandwidths that are orders of magnitude below those commonly employed in fibre optic communication networks. Using an optimised wavelength divisional multiplexing scheme, we transport QKD and the prevalent 100 Gb/s data format in the forward direction over the same fibre for the first time. We show a full quantum encryption system operating with a bandwidth of 200 Gb/s over a 100 km fibre. Exploring the ultimate limits of the technology by experimental measurements of the Raman noise, we demonstrate it is feasible to combine QKD with 10 Tb/s of data over a 50 km link. These results suggest it will be possible to integrate QKD and other quantum photonic technologies into high bandwidth data communication infrastructures, thereby allowing their widespread deployment.

Continuity-Aware Scheduling Algorithm for Scalable Video Streaming

Directory of Open Access Journals (Sweden)

Atinat Palawan

2016-05-01

Full Text Available The consumer demand for retrieving and delivering visual content through consumer electronic devices has increased rapidly in recent years. The quality of video in packet networks is susceptible to certain traffic characteristics: average bandwidth availability, loss, delay and delay variation (jitter. This paper presents a scheduling algorithm that modifies the stream of scalable video to combat jitter. The algorithm provides unequal look-ahead by safeguarding the base layer (without the need for overhead of the scalable video. The results of the experiments show that our scheduling algorithm reduces the number of frames with a violated deadline and significantly improves the continuity of the video stream without compromising the average Y Peek Signal-to-Noise Ratio (PSNR.

Derivation and validation of the Personal Support Algorithm: an evidence-based framework to inform allocation of personal support services in home and community care.

Science.gov (United States)

Sinn, Chi-Ling Joanna; Jones, Aaron; McMullan, Janet Legge; Ackerman, Nancy; Curtin-Telegdi, Nancy; Eckel, Leslie; Hirdes, John P

2017-11-25

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

Derivation and validation of the Personal Support Algorithm: an evidence-based framework to inform allocation of personal support services in home and community care

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.

Joint Power Allocation for Multicast Systems with Physical-Layer Network Coding

Directory of Open Access Journals (Sweden)

Zhu Wei-Ping

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.

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.

An application of data mining classification and bi-level programming for optimal credit allocation

Directory of Open Access Journals (Sweden)

Seyed Mahdi Sadatrasou

2015-01-01

Full Text Available This paper investigates credit allocation policy making and its effect on economic development using bi-level programming. There are two challenging problems in bi-level credit allocation; at the first level government/public related institutes must allocate the credit strategically concerning sustainable development to regions and industrial sectors. At the second level, there are agent banks, which should allocate the credit tactically to individual applicants based on their own profitability and risk using their credit scoring models. There is a conflict of interest between these two stakeholders but the cooperation is inevitable. In this paper, a new bi-level programming formulation of the leader-follower game in association with sustainable development theory in the first level and data mining classifier at the second level is used to mathematically model the problem. The model is applied to a national development fund (NDF as a government related organization and one of its agent banks. A new algorithm called Bi-level Genetic fuzzy apriori Algorithm (BGFAA is introduced to solve the bilateral model. Experimental results are presented and compared with a unilateral policy making scenario by the leader. Findings show that although the objective functions of the leader are worse in the bilateral scenario but agent banks collaboration is attracted and guaranteed.

Quasi Path Restoration: A post-failure recovery scheme over pre-allocated backup resource for elastic optical networks

Science.gov (United States)

Yadav, Dharmendra Singh; Babu, Sarath; Manoj, B. S.

2018-03-01

Spectrum conflict during primary and backup routes assignment in elastic optical networks results in increased resource consumption as well as high Bandwidth Blocking Probability. In order to avoid such conflicts, we propose a new scheme, Quasi Path Restoration (QPR), where we divide the available spectrum into two: (1) primary spectrum (for primary routes allocation) and (2) backup spectrum (for rerouting the data on link failures). QPR exhibits three advantages over existing survivable strategies such as Shared Path Protection (SPP), Primary First Fit Backup Last Fit (PFFBLF), Jointly Releasing and re-establishment Defragmentation SPP (JRDSSPP), and Path Restoration (PR): (1) the conflict between primary and backup spectrum during route assignment is completely eliminated, (2) upon a link failure, connection recovery requires less backup resources compared to SPP, PFFBLF, and PR, and (3) availability of the same backup spectrum on each link improves the recovery guarantee. The performance of our scheme is analyzed with different primary backup spectrum partitions on varying connection-request demands and number of frequency slots. Our results show that QPR provides better connection recovery guarantee and Backup Resources Utilization (BRU) compared to bandwidth recovery of PR strategy. In addition, we compare QPR with Shared Path Protection and Primary First-Fit Backup Last Fit strategies in terms of Bandwidth Blocking Probability (BBP) and average frequency slots per connection request. Simulation results show that BBP of SPP, PFFBLF, and JRDSPP varies between 18.59% and 14.42%, while in QPR, BBP ranges from 2.55% to 17.76% for Cost239, NSFNET, and ARPANET topologies. Also, QPR provides bandwidth recovery between 93.61% and 100%, while in PR, the recovery ranges from 86.81% to 98.99%. It is evident from our analysis that QPR provides a reasonable trade-off between bandwidth blocking probability and connection recoverability.

Bandwidth-narrowed Bragg gratings inscribed in double-cladding fiber by femtosecond laser.

Science.gov (United States)

Shi, Jiawei; Li, Yuhua; Liu, Shuhui; Wang, Haiyan; Liu, Ningliang; Lu, Peixiang

2011-01-31

Bragg gratings with the bandwidth(FWHM) narrowed up to 79 pm were inscribed in double-cladding fiber with femtosecond radiation and a phase mask followed by an annealing treatment. With the annealing temperature below a critical value, the bandwidth of Bragg gratings induced by Type I-IR and Type II-IR index change was narrowed without the reduction of reflectivity. The bandwidth narrowing is due to the profile transformation of the refractive index modulation caused by the annealing treatment. This mechanism was verified by comparing bandwidth narrowing processes of FBGs written with different power densities.

Review of high bandwidth fiber optics radiation sensors

International Nuclear Information System (INIS)

Lyons, P.B.

1985-01-01

This paper summarizes the use of fiber optics or guided optical systems for radiation sensors. It is limited a passive systems wherein electrical is not required at the sensor location. However, electrically powered light sources, receivers and/or recorders may still be required for detection and data storage in sensor system operation. This paper emphasizes sensor technologies that permit high bandwidth measurements of transient radiation levels, and will also discuss several low bandwidth applications. 60 refs

DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Francisco José Estévez

2016-06-01

Full Text Available The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.

MPTCP Tunnel: An Architecture for Aggregating Bandwidth of Heterogeneous Access Networks

Directory of Open Access Journals (Sweden)

Xiaolan Liu

2018-01-01

Full Text Available Fixed and cellular networks are two typical access networks provided by operators. Fixed access network is widely employed; nevertheless, its bandwidth is sometimes not sufficient enough to meet user bandwidth requirements. Meanwhile, cellular access network owns unique advantages of wider coverage, faster increasing link speed, more flexible deployment, and so forth. Therefore, it is attractive for operators to mitigate the bandwidth shortage by bundling these two. Actually, there have been existing schemes proposed to aggregate the bandwidth of two access networks, whereas they all have their own problems, like packet reordering or extra latency overhead. To address this problem, we design new architecture, MPTCP Tunnel, to aggregate the bandwidth of multiple heterogeneous access networks from the perspective of operators. MPTCP Tunnel uses MPTCP, which solves the reordering problem essentially, to bundle multiple access networks. Besides, MPTCP Tunnel sets up only one MPTCP connection at play which adapts itself to multiple traffic types and TCP flows. Furthermore, MPTCP Tunnel forwards intact IP packets through access networks, maintaining the end-to-end TCP semantics. Experimental results manifest that MPTCP Tunnel can efficiently aggregate the bandwidth of multiple access networks and is more adaptable to the increasing heterogeneity of access networks than existing mechanisms.

A simple algorithm for the identification of clinical COPD phenotypes

DEFF Research Database (Denmark)

Burgel, Pierre-Régis; Paillasseur, Jean-Louis; Janssens, Wim

2017-01-01

This study aimed to identify simple rules for allocating chronic obstructive pulmonary disease (COPD) patients to clinical phenotypes identified by cluster analyses. Data from 2409 COPD patients of French/Belgian COPD cohorts were analysed using cluster analysis resulting in the identification...... of subgroups, for which clinical relevance was determined by comparing 3-year all-cause mortality. Classification and regression trees (CARTs) were used to develop an algorithm for allocating patients to these subgroups. This algorithm was tested in 3651 patients from the COPD Cohorts Collaborative...... International Assessment (3CIA) initiative. Cluster analysis identified five subgroups of COPD patients with different clinical characteristics (especially regarding severity of respiratory disease and the presence of cardiovascular comorbidities and diabetes). The CART-based algorithm indicated...

Zinc allocation and re-allocation in rice

Science.gov (United States)

Stomph, Tjeerd Jan; Jiang, Wen; Van Der Putten, Peter E. L.; Struik, Paul C.

2014-01-01

Aims: Agronomy and breeding actively search for options to enhance cereal grain Zn density. Quantifying internal (re-)allocation of Zn as affected by soil and crop management or genotype is crucial. We present experiments supporting the development of a conceptual model of whole plant Zn allocation and re-allocation in rice. Methods: Two solution culture experiments using 70Zn applications at different times during crop development and an experiment on within-grain distribution of Zn are reported. In addition, results from two earlier published experiments are re-analyzed and re-interpreted. Results: A budget analysis showed that plant zinc accumulation during grain filling was larger than zinc allocation to the grains. Isotope data showed that zinc taken up during grain filling was only partly transported directly to the grains and partly allocated to the leaves. Zinc taken up during grain filling and allocated to the leaves replaced zinc re-allocated from leaves to grains. Within the grains, no major transport barrier was observed between vascular tissue and endosperm. At low tissue Zn concentrations, rice plants maintained concentrations of about 20 mg Zn kg−1 dry matter in leaf blades and reproductive tissues, but let Zn concentrations in stems, sheath, and roots drop below this level. When plant zinc concentrations increased, Zn levels in leaf blades and reproductive tissues only showed a moderate increase while Zn levels in stems, roots, and sheaths increased much more and in that order. Conclusions: In rice, the major barrier to enhanced zinc allocation towards grains is between stem and reproductive tissues. Enhancing root to shoot transfer will not contribute proportionally to grain zinc enhancement. PMID:24478788

DiamondTorre Algorithm for High-Performance Wave Modeling

Directory of Open Access Journals (Sweden)

Vadim Levchenko

2016-08-01

Full Text Available Effective algorithms of physical media numerical modeling problems’ solution are discussed. The computation rate of such problems is limited by memory bandwidth if implemented with traditional algorithms. The numerical solution of the wave equation is considered. A finite difference scheme with a cross stencil and a high order of approximation is used. The DiamondTorre algorithm is constructed, with regard to the specifics of the GPGPU’s (general purpose graphical processing unit memory hierarchy and parallelism. The advantages of these algorithms are a high level of data localization, as well as the property of asynchrony, which allows one to effectively utilize all levels of GPGPU parallelism. The computational intensity of the algorithm is greater than the one for the best traditional algorithms with stepwise synchronization. As a consequence, it becomes possible to overcome the above-mentioned limitation. The algorithm is implemented with CUDA. For the scheme with the second order of approximation, the calculation performance of 50 billion cells per second is achieved. This exceeds the result of the best traditional algorithm by a factor of five.

A Review of Function Allocation and En Route Separation Assurance

Science.gov (United States)

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.

An Application-Level QoS Control Method Based on Local Bandwidth Scheduling

Directory of Open Access Journals (Sweden)

Yong Wang

2018-01-01

Full Text Available Quality of service (QoS is an important performance indicator for Web applications and bandwidth is a key factor affecting QoS. Current methods use network protocols or ports to schedule bandwidth, which require tedious manual configurations or modifications of the underlying network. Some applications use dynamic ports and the traditional port-based bandwidth control methods cannot deal with them. A new QoS control method based on local bandwidth scheduling is proposed, which can schedule bandwidth at application level in a user-transparent way and it does not require tedious manual configurations. Experimental results indicate that the new method can effectively improve the QoS for applications, and it can be easily integrated into current Web applications without the need to modify the underlying network.

Distributed Channel Allocation and Time Slot Optimization for Green Internet of Things

Directory of Open Access Journals (Sweden)

Kaiqi Ding

2017-10-01

Full Text Available In sustainable smart cities, power saving is a severe challenge in the energy-constrained Internet of Things (IoT. Efficient utilization of limited multiple non-overlap channels and time resources is a promising solution to reduce the network interference and save energy consumption. In this paper, we propose a joint channel allocation and time slot optimization solution for IoT. First, we propose a channel ranking algorithm which enables each node to rank its available channels based on the channel properties. Then, we propose a distributed channel allocation algorithm so that each node can choose a proper channel based on the channel ranking and its own residual energy. Finally, the sleeping duration and spectrum sensing duration are jointly optimized to maximize the normalized throughput and satisfy energy consumption constraints simultaneously. Different from the former approaches, our proposed solution requires no central coordination or any global information that each node can operate based on its own local information in a total distributed manner. Also, theoretical analysis and extensive simulations have validated that when applying our solution in the network of IoT: (i each node can be allocated to a proper channel based on the residual energy to balance the lifetime; (ii the network can rapidly converge to a collision-free transmission through each node’s learning ability in the process of the distributed channel allocation; and (iii the network throughput is further improved via the dynamic time slot optimization.

Distributed Channel Allocation and Time Slot Optimization for Green Internet of Things.

Science.gov (United States)

Ding, Kaiqi; Zhao, Haitao; Hu, Xiping; Wei, Jibo

2017-10-28

In sustainable smart cities, power saving is a severe challenge in the energy-constrained Internet of Things (IoT). Efficient utilization of limited multiple non-overlap channels and time resources is a promising solution to reduce the network interference and save energy consumption. In this paper, we propose a joint channel allocation and time slot optimization solution for IoT. First, we propose a channel ranking algorithm which enables each node to rank its available channels based on the channel properties. Then, we propose a distributed channel allocation algorithm so that each node can choose a proper channel based on the channel ranking and its own residual energy. Finally, the sleeping duration and spectrum sensing duration are jointly optimized to maximize the normalized throughput and satisfy energy consumption constraints simultaneously. Different from the former approaches, our proposed solution requires no central coordination or any global information that each node can operate based on its own local information in a total distributed manner. Also, theoretical analysis and extensive simulations have validated that when applying our solution in the network of IoT: (i) each node can be allocated to a proper channel based on the residual energy to balance the lifetime; (ii) the network can rapidly converge to a collision-free transmission through each node's learning ability in the process of the distributed channel allocation; and (iii) the network throughput is further improved via the dynamic time slot optimization.

A Game Theoretic Framework for Bandwidth Allocation and Pricing in Federated Wireless Networks

Science.gov (United States)

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.

Development of a bandwidth limiting neutron chopper for CSNS

Science.gov (United States)

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

Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

Science.gov (United States)

Bai, Wei; Yang, Hui; Yu, Ao; Xiao, Hongyun; He, Linkuan; Feng, Lei; Zhang, Jie

2018-01-01

The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

Motion-related resource allocation in dynamic wireless visual sensor network environments.

Science.gov (United States)

Katsenou, Angeliki V; Kondi, Lisimachos P; Parsopoulos, Konstantinos E

2014-01-01

This paper investigates quality-driven cross-layer optimization for resource allocation in direct sequence code division multiple access wireless visual sensor networks. We consider a single-hop network topology, where each sensor transmits directly to a centralized control unit (CCU) that manages the available network resources. Our aim is to enable the CCU to jointly allocate the transmission power and source-channel coding rates for each node, under four different quality-driven criteria that take into consideration the varying motion characteristics of each recorded video. For this purpose, we studied two approaches with a different tradeoff of quality and complexity. The first one allocates the resources individually for each sensor, whereas the second clusters them according to the recorded level of motion. In order to address the dynamic nature of the recorded scenery and re-allocate the resources whenever it is dictated by the changes in the amount of motion in the scenery, we propose a mechanism based on the particle swarm optimization algorithm, combined with two restarting schemes that either exploit the previously determined resource allocation or conduct a rough estimation of it. Experimental simulations demonstrate the efficiency of the proposed approaches.

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.

Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

Science.gov (United States)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

Design of ultrathin dual-resonant reflective polarization converter with customized bandwidths

Science.gov (United States)

Kundu, Debidas; Mohan, Akhilesh; Chakrabarty, Ajay

2017-10-01

In this paper, an ultrathin dual-resonant reflective polarization converter is proposed to obtain customized bandwidths using precise space-filling technique to its top geometry. The unit cell of the dual-resonant prototype consists of conductive square ring with two diagonally arranged slits, supported by metal-backed thin dielectric layer. It offers two narrow bands with fractional bandwidths of 3.98 and 6.65% and polarization conversion ratio (PCR) of 97.16 and 98.87% at 4.52 and 6.97 GHz, respectively. The resonances are brought in proximity to each other by changing the length of surface current paths of the two resonances. By virtue of this mechanism, two polarization converters with two different types of bandwidths are obtained. One polarization converter produces a full-width at half-maxima PCR bandwidth of 34%, whereas another polarization converter produces a 90% PCR bandwidth of 19%. All the proposed polarization converters are insensitive to wide variations of incident angle for both TE- and TM-polarized incident waves. Measured results show good agreement with the numerically simulated results.

Pilot-based parametric channel estimation algorithm for DCO-OFDM-based visual light communications

Science.gov (United States)

Qian, Xuewen; Deng, Honggui; He, Hailang

2017-10-01

Due to wide modulation bandwidth in optical communication, multipath channels may be non-sparse and deteriorate communication performance heavily. Traditional compressive sensing-based channel estimation algorithm cannot be employed in this kind of situation. In this paper, we propose a practical parametric channel estimation algorithm for orthogonal frequency division multiplexing (OFDM)-based visual light communication (VLC) systems based on modified zero correlation code (ZCC) pair that has the impulse-like correlation property. Simulation results show that the proposed algorithm achieves better performances than existing least squares (LS)-based algorithm in both bit error ratio (BER) and frequency response estimation.

Research on bulk-cargo-port berth assignment based on priority of resource allocation

Directory of Open Access Journals (Sweden)

Chunfang Guo

2013-03-01

Full Text Available Purpose: The purpose of this paper is to propose a Priority of Resource Allocation model about how to utilize the resources of the port efficiently, through the improvement of traditional ant colony algorithm, the ship-berth matching relation constraint matrix formed by ontology reasoning. Design/methodology/approach: Through questionnaires?Explore factor analysis (EFA and principal component analysis, the authors extract the importance of the goods, the importance of customers, and type of trade as the main factors of the ship operating priority. Then the authors combine berth assignment problem with the improved ant colony algorithm, and use the model to improve ship scheduling quality. Finally, the authors verify the model with physical data in a bulk-cargo-port in China. Findings: Test by the real data of bulk cargo port, it show that ships’ resource using priority and the length of waiting time are consistent; it indicates that the priority of resource allocation play a prominent role in improving ship scheduling quality. Research limitations: The questionnaires is limited in only one port group, more  related Influence factors should be considered to extend the conclusion. Practical implications: The Priority of Resource Allocation model in this paper can be used to improve the efficiency of the dynamic berth assignment. Originality: This paper makes the time of ship in port minimized as the optimization of key indicators and establishes a dynamic berth assignment model based on improved ant colony algorithm and the ontology reasoning model.

Development and performance analysis of a lossless data reduction algorithm for voip

International Nuclear Information System (INIS)

Misbahuddin, S.; Boulejfen, N.

2014-01-01

VoIP (Voice Over IP) is becoming an alternative way of voice communications over the Internet. To better utilize voice call bandwidth, some standard compression algorithms are applied in VoIP systems. However, these algorithms affect the voice quality with high compression ratios. This paper presents a lossless data reduction technique to improve VoIP data transfer rate over the IP network. The proposed algorithm exploits the data redundancies in digitized VFs (Voice Frames) generated by VoIP systems. Performance of proposed data reduction algorithm has been presented in terms of compression ratio. The proposed algorithm will help retain the voice quality along with the improvement in VoIP data transfer rates. (author)

Location-Based Resource Allocation for OFDMA Cognitive Radio Systems

KAUST Repository

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.

Computer architecture for efficient algorithmic executions in real-time systems: New technology for avionics systems and advanced space vehicles

Science.gov (United States)

Carroll, Chester C.; Youngblood, John N.; Saha, Aindam

1987-01-01

Improvements and advances in the development of computer architecture now provide innovative technology for the recasting of traditional sequential solutions into high-performance, low-cost, parallel system to increase system performance. Research conducted in development of specialized computer architecture for the algorithmic execution of an avionics system, guidance and control problem in real time is described. A comprehensive treatment of both the hardware and software structures of a customized computer which performs real-time computation of guidance commands with updated estimates of target motion and time-to-go is presented. An optimal, real-time allocation algorithm was developed which maps the algorithmic tasks onto the processing elements. This allocation is based on the critical path analysis. The final stage is the design and development of the hardware structures suitable for the efficient execution of the allocated task graph. The processing element is designed for rapid execution of the allocated tasks. Fault tolerance is a key feature of the overall architecture. Parallel numerical integration techniques, tasks definitions, and allocation algorithms are discussed. The parallel implementation is analytically verified and the experimental results are presented. The design of the data-driven computer architecture, customized for the execution of the particular algorithm, is discussed.

Multiuser Radio Resource Allocation for Multiservice Transmission in OFDMA-Based Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Zhang Xing

2009-01-01

Full Text Available Abstract The problem of multiservice transmission in OFDMA-based cooperative relay networks is studied comprehensively. We propose a framework to adaptively allocate power, subcarriers, and data rate in OFDMA system to maximize spectral efficiency under the constraints of satisfying multiuser multiservices' QoS requirements. Specifically, first we concentrate on the single-user scenario which considers multiservice transmission in point-to-point cooperative relay network. Based on the analysis of single-user scenario, we extend the multiservice transmission to multiuser point-to-multipoint scenario. Next, based on the framework, we propose several suboptimal radio resource allocation algorithms for multiservice transmissions in OFDMA-based cooperative relay networks to further reduce the computational complexity. Simulation results show that the proposed algorithms yield much higher spectral efficiency and much lower outage probability, which are flexible and efficient for the OFDMA-based cooperative relay system.

High-Q Variable Bandwidth Passive Filters for Software Defined Radio

NARCIS (Netherlands)

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

NARCIS (Netherlands)

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

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

Moiré volume Bragg grating filter with tunable bandwidth.

Science.gov (United States)

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.

Joint Load Balancing and Power Allocation for Hybrid VLC/RF Networks

KAUST Repository

Obeed, Mohanad

2018-01-15

In this paper, we propose and study a new joint load balancing (LB) and power allocation (PA) scheme for a hybrid visible light communication (VLC) and radio frequency (RF) system consisting of one RF\\\\access point (AP) and multiple VLC\\\\APs. An iterative algorithm is proposed to distribute the users on the APs and distribute the powers of these APs on their users. In PA subproblem, an optimization problem is formulated to allocate the power of each AP to the connected users for the total achievable data rates maximization. It is proved that the PA optimization problem is concave but not easy to tackle. Therefore, we provide a new algorithm to obtain the optimal dual variables after formulating them in terms of each other. Then, the users that are connected to the overloaded APs and receive less data rates start seeking for other APs that offer higher data rates. Users with lower data rates continue re-connecting from AP to other to balance the load only if this travel increases the summation of the achievable data rates and enhances the system fairness. The numerical results demonstrate that the proposed algorithms improve the system capacity and system fairness with fast convergence.

Joint Load Balancing and Power Allocation for Hybrid VLC/RF Networks

KAUST Repository

Obeed, Mohanad; Salhab, Anas M.; Zummo, Salam A.; Alouini, Mohamed-Slim

2018-01-01

In this paper, we propose and study a new joint load balancing (LB) and power allocation (PA) scheme for a hybrid visible light communication (VLC) and radio frequency (RF) system consisting of one RF\\access point (AP) and multiple VLC\\APs. An iterative algorithm is proposed to distribute the users on the APs and distribute the powers of these APs on their users. In PA subproblem, an optimization problem is formulated to allocate the power of each AP to the connected users for the total achievable data rates maximization. It is proved that the PA optimization problem is concave but not easy to tackle. Therefore, we provide a new algorithm to obtain the optimal dual variables after formulating them in terms of each other. Then, the users that are connected to the overloaded APs and receive less data rates start seeking for other APs that offer higher data rates. Users with lower data rates continue re-connecting from AP to other to balance the load only if this travel increases the summation of the achievable data rates and enhances the system fairness. The numerical results demonstrate that the proposed algorithms improve the system capacity and system fairness with fast convergence.

Principal-subordinate hierarchical multi-objective programming model of initial water rights allocation

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.

Terahertz bandwidth photonic Hilbert transformers based on synthesized planar Bragg grating fabrication.

Science.gov (United States)

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.

Dynamic fair node spectrum allocation for ad hoc networks using random matrices

Science.gov (United States)

Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

2015-05-01

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

A Location-Allocation Model for Seaport-Dry Port System Optimization

Directory of Open Access Journals (Sweden)

Xuejun Feng

2013-01-01

Full Text Available Seaports participate in hinterland economic development through partnerships with dry ports, and the combined seaport-dry port network serves as the backbone of regional logistics. This paper constructs a location-allocation model for the regional seaport-dry port network optimization problem and develops a greedy algorithm and a genetic algorithm to obtain its solution. This model is applicable to situations under which the geographic distribution of demand is known. A case study involving configuration of dry ports near the west bank of the Taiwan Strait is conducted, and the model is successfully applied.

Time-optimal control with finite bandwidth

Science.gov (United States)

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.

Optimizing TCP Performance in Multi-AP Residential Broadband Connections via Minislot Access

Directory of Open Access Journals (Sweden)

Domenico Giustiniano

2013-01-01

Full Text Available The high bandwidth demand of Internet applications has recently driven the need of increasing the residential download speed. A practical solution to the problem is to aggregate the bandwidth of 802.11 access points (APs backhauls in range. Since 802.11 devices are usually single radio, the communication to APs on different radio channels requires a time-division multiple access (TDMA policy at the client station. With an in-depth experimental analysis and a customized 802.11 driver, in this paper, we show that the usage of multi-AP TDMA policy may cause degradation of the TCP throughput and an underutilization of the AP backhauls. We then introduce a simple analytical model that accurately predicts the TCP round-trip time (RTT with a multi-AP TDMA policy and propose a resource allocation algorithm to reduce the observed TCP RTT with a very low computational cost. Our proposed scheme runs locally at the client station and improves the aggregate throughput up to 1.5 times compared to state-of-the-art allocations. We finally show that the throughput achieved by our algorithm is very close to the theoretical upper bound in key simulation scenarios.

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Energy Technology Data Exchange (ETDEWEB)

Vydyanathan, Naga; Krishnamoorthy, Sriram; Sabin, Gerald M.; Catalyurek, Umit V.; Kurc, Tahsin; Sadayappan, Ponnuswamy; Saltz, Joel H.

2009-08-01

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.

Receiver bandwidth effects on complex modulation and detection using directly modulated lasers.

Science.gov (United States)

Yuan, Feng; Che, Di; Shieh, William

2016-05-01

Directly modulated lasers (DMLs) have long been employed for short- and medium-reach optical communications due to their low cost. Recently, a new modulation scheme called complex modulated DMLs has been demonstrated showing a significant optical signal to noise ratio sensitivity enhancement compared with the traditional intensity-only detection scheme. However, chirp-induced optical spectrum broadening is inevitable in complex modulated systems, which may imply a need for high-bandwidth receivers. In this Letter, we study the impact of receiver bandwidth effects on the performance of complex modulation and coherent detection systems based on DMLs. We experimentally demonstrate that such systems exhibit a reasonable tolerance for the reduced receiver bandwidth. For 10 Gbaud 4-level pulse amplitude modulation signals, the required electrical bandwidth is as low as 8.5 and 7.5 GHz for 7% and 20% forward error correction, respectively. Therefore, it is feasible to realize DML-based complex modulated systems using cost-effective receivers with narrow bandwidth.

K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.

Directory of Open Access Journals (Sweden)

Yunyue He

Full Text Available Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior.

Coarse-grain bandwidth estimation techniques for large-scale network

Science.gov (United States)

Cheung, Kar-Ming; Jennings, E.

In this paper, we describe a top-down analysis and simulation approach 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. We use these techniques to estimate the wide area network (WAN) bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network.

A cross-layer resource allocation scheme for spatial multiplexing-based MIMO-OFDMA systems

Directory of Open Access Journals (Sweden)

Al-Shatri Hussein

2011-01-01

Full Text Available Abstract We investigate the resource allocation problem for the downlink of a multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA system. The sum rate maximization itself cannot cope with fairness among users. Hence, we address this problem in the context of the utility-based resource allocation presented in earlier papers. This resource allocation method allows to enhance the efficiency and guarantee fairness among users by exploiting multiuser diversity, frequency diversity, as well as time diversity. In this paper, we treat the overall utility as the quality of service indicator and design utility functions with respect to the average transmission rate in order to simultaneously provide two services, real-time and best-effort. Since the optimal solutions are extremely computationally complex to obtain, we propose a suboptimal joint subchannel and power control algorithm that converges very fast and simplifies the MIMO resource allocation problem into a single-input single-output resource allocation problem. Simulation results indicate that using the proposed method achieves near-optimum solutions, and the available resources are distributed more fairly among users.

Exploring design tradeoffs of a distributed algorithm for cosmic ray event detection

Science.gov (United States)

Yousaf, S.; Bakhshi, R.; van Steen, M.; Voulgaris, S.; Kelley, J. L.

2013-03-01

Many sensor networks, including large particle detector arrays measuring high-energy cosmic-ray air showers, traditionally rely on centralised trigger algorithms to find spatial and temporal coincidences of individual nodes. Such schemes suffer from scalability problems, especially if the nodes communicate wirelessly or have bandwidth limitations. However, nodes which instead communicate with each other can, in principle, use a distributed algorithm to find coincident events themselves without communication with a central node. We present such an algorithm and consider various design tradeoffs involved, in the context of a potential trigger for the Auger Engineering Radio Array (AERA).

A Parallel Butterfly Algorithm

KAUST Repository

Poulson, Jack; Demanet, Laurent; Maxwell, Nicholas; Ying, Lexing

2014-01-01

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.

A Parallel Butterfly Algorithm

KAUST Repository

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.

Optimized Power Allocation and Relay Location Selection in Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Jianrong Bao

2017-01-01

Full Text Available An incremental selection hybrid decode-amplify forward (ISHDAF scheme for the two-hop single relay systems and a relay selection strategy based on the hybrid decode-amplify-and-forward (HDAF scheme for the multirelay systems are proposed along with an optimized power allocation for the Internet of Thing (IoT. Given total power as the constraint and outage probability as an objective function, the proposed scheme possesses good power efficiency better than the equal power allocation. By the ISHDAF scheme and HDAF relay selection strategy, an optimized power allocation for both the source and relay nodes is obtained, as well as an effective reduction of outage probability. In addition, the optimal relay location for maximizing the gain of the proposed algorithm is also investigated and designed. Simulation results show that, in both single relay and multirelay selection systems, some outage probability gains by the proposed scheme can be obtained. In the comparison of the optimized power allocation scheme with the equal power allocation one, nearly 0.1695 gains are obtained in the ISHDAF single relay network at a total power of 2 dB, and about 0.083 gains are obtained in the HDAF relay selection system with 2 relays at a total power of 2 dB.

An Interference-Aware Admission Control Design for Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Manikantan Shila Devu

2010-01-01

Full Text Available In this paper, we present IAC, an interference aware admission control algorithm for use in wireless mesh networks. The core concept of IAC is to use a low overhead dual threshold based approach to share the bandwidth information with its neighbors in the interfering range. As a result, IAC guarantees that the shared wireless bandwidth is not overutilized and the quality of all existing flows are preserved. Moreover, IAC takes into account the intraflow interference effect to estimate the bandwidth consumption of the flow in a multihop path. We have further proposed two approaches of bandwidth allocation, FCFS and MCU, and demonstrated that proper tuning of thresholds can lead to high performance of both schemes. Simulation results illustrate that IAC effectively limits the overutilization of channel resources which in turn results in high throughput, low delay and low packet loss rate for all admitted flows.

Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

Directory of Open Access Journals (Sweden)

Klaus Moessner

2013-10-01

Full Text Available This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or link failures. An evolutional self-learning mechanism based on a genetic algorithm continuously adapts the system parameters in order to meet the desired application delay requirements, while also achieving a sufficiently long network lifetime. Since the algorithm runtime incurs considerable time delay while updating task assignments, we introduce an adaptive window size to limit the delay periods and ensure an up-to-date solution based on node mobility patterns and device processing capabilities. To the best of our knowledge, this is the first study that yields multi-objective task allocation in a mobile multi-hop wireless environment under dynamic conditions. Simulations are performed in various settings, and the results show considerable performance improvement in extending network lifetime compared to heuristic mechanisms. Furthermore, the proposed framework provides noticeable reduction in the frequency of missing application deadlines.

A Statistical Approach for Gain Bandwidth Prediction of Phoenix-Cell Based Reflect arrays

Directory of Open Access Journals (Sweden)

Hassan Salti

2018-01-01

Full Text Available A new statistical approach to predict the gain bandwidth of Phoenix-cell based reflectarrays is proposed. It combines the effects of both main factors that limit the bandwidth of reflectarrays: spatial phase delays and intrinsic bandwidth of radiating cells. As an illustration, the proposed approach is successfully applied to two reflectarrays based on new Phoenix cells.

Generalized location-based resource allocation for OFDMA cognitive radio systems

KAUST Repository

Ben Ghorbel, Mahdi

2010-09-01

Cognitive radio is one of the hot topics for emerging and future wireless communication. Cognitive users can share channels with primary users under the condition of non interference. In order to compute this interference, the cognitive system usually use the channel state information of the primary user which is often impractical to obtain. However, using location information, we can estimate this interference by pathloss computation. In this paper, we introduce a low-complexity resource allocation algorithm for orthogonal frequency division multiple access (OFDMA) based cognitive radio systems, which uses relative location information between primary and secondary users to estimate the interference. This algorithm considers interference with multiple primary users having different thresholds. The simulation results show the efficiency of the proposed algorithm by comparing it with an optimal exhaustive search method. © 2010 IEEE.

Location-based resource allocation for OFDMA cognitive radio systems

KAUST Repository

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 concurrent processing on commodity platforms

CERN Document Server

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

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

Manajemen Bandwidth Simple Queue dan Queue Tree pada PT. Endorsindo Makmur Selaras

OpenAIRE

Budiman, Arif

2015-01-01

  The purpose of this study is to analyze and optimize the bandwidth management at PT. Endorsindo Makmur Selaras, with the expectation that the distribution of bandwidth can be evenly distributed to each employee so that the employee can improve performance and quality of the company. Research methods used include analysis methods (survey and interview system that runs directly on the user) and to optimize bandwidth management method to configure the proxy using the Queue Tree. The re...

State-of-the-art on Virtualization and Software Defined Networking for Efficient Resource Allocation on Multi-tenant 5G Networks

Directory of Open Access Journals (Sweden)

Tsirakis Christos

2017-01-01

Full Text Available Global data traffic explosion is expected to set stringent requirements for next generation networks in the next decades. Besides, very low latencies will have to be guaranteed for enabling new delay critical services. However, current Software Defined Networking (SDN solutions have limitations in terms of separating both data and control planes among tenants/operators, and the capability to adapt to new or changing requirements. Moreover, some virtualization schemes do not ensure isolation of resources and do not guarantee bandwidth across the entities. While some others fail to provide flexibility to the slices to customize the resource allocation across the users. Therefore, novel SDN and virtualization techniques should be implemented to realize the upcoming 5G network that will facilitate at least efficient resource allocation and multi-tenancy among the plethora of different requirements.

Implementation Aspects of a Flexible Frequency Spectrum Usage Algorithm for Cognitive OFDM Systems

DEFF Research Database (Denmark)

Sacchi, Claudio; Tonelli, Oscar; Cattoni, Andrea Fabio

2011-01-01

time on a shared spectrum chunk, emphasizes the role of resource allocation as a critical system design issue. This work is aimed at analyzing the practical issues related to the Software Defined Radio (SDR)-based implementation of a dynamic spectrum allocation algorithm, designed for OFDM...... on a Xilinx ML506 development board is performed. The main novelty proposed in this paper consists in the SDR-based implementation of a computationally-sustainable resource allocation algorithm for FSU on low-cost commercial FPGA platforms. The proposed implementation is competitive with respect to other ones...... on a Virtex 5 FPGA. Experimental results will illustrate that the selected core functionalities are effectively implementable with around 3% or less of the total FPGA computing resources....

Mathematical analysis and coordinated current allocation control in battery power module systems

Science.gov (United States)

Han, Weiji; Zhang, Liang

2017-12-01

As the major energy storage device and power supply source in numerous energy applications, such as solar panels, wind plants, and electric vehicles, battery systems often face the issue of charge imbalance among battery cells/modules, which can accelerate battery degradation, cause more energy loss, and even incur fire hazard. To tackle this issue, various circuit designs have been developed to enable charge equalization among battery cells/modules. Recently, the battery power module (BPM) design has emerged to be one of the promising solutions for its capability of independent control of individual battery cells/modules. In this paper, we propose a new current allocation method based on charging/discharging space (CDS) for performance control in BPM systems. Based on the proposed method, the properties of CDS-based current allocation with constant parameters are analyzed. Then, real-time external total power requirement is taken into account and an algorithm is developed for coordinated system performance control. By choosing appropriate control parameters, the desired system performance can be achieved by coordinating the module charge balance and total power efficiency. Besides, the proposed algorithm has complete analytical solutions, and thus is very computationally efficient. Finally, the efficacy of the proposed algorithm is demonstrated using simulations.

Bandwidth limitations in current mode and voltage mode integrated feedback amplifiers

DEFF Research Database (Denmark)

Bruun, Erik

1995-01-01

loop bandwidth remains constant for a feedback amplifier. The constant-bandwidth relations of such amplifier designs are reviewed in this paper and they are combined with the constraints imposed by technology when the feedback amplifier is to be designed in an integrated technology. From this analysis...

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

Using game theory for perceptual tuned rate control algorithm in video coding

Science.gov (United States)

Luo, Jiancong; Ahmad, Ishfaq

2005-03-01

This paper proposes a game theoretical rate control technique for video compression. Using a cooperative gaming approach, which has been utilized in several branches of natural and social sciences because of its enormous potential for solving constrained optimization problems, we propose a dual-level scheme to optimize the perceptual quality while guaranteeing "fairness" in bit allocation among macroblocks. At the frame level, the algorithm allocates target bits to frames based on their coding complexity. At the macroblock level, the algorithm distributes bits to macroblocks by defining a bargaining game. Macroblocks play cooperatively to compete for shares of resources (bits) to optimize their quantization scales while considering the Human Visual System"s perceptual property. Since the whole frame is an entity perceived by viewers, macroblocks compete cooperatively under a global objective of achieving the best quality with the given bit constraint. The major advantage of the proposed approach is that the cooperative game leads to an optimal and fair bit allocation strategy based on the Nash Bargaining Solution. Another advantage is that it allows multi-objective optimization with multiple decision makers (macroblocks). The simulation results testify the algorithm"s ability to achieve accurate bit rate with good perceptual quality, and to maintain a stable buffer level.

Design and fabrication of bandwidth tunable HTS transmit filter using {pi}-shaped waveguides

Energy Technology Data Exchange (ETDEWEB)

Sekiya, N., E-mail: nsekiya@yamanashi.ac.j [Department of Electrical Engineering, Yamanashi University, Nakagawa-Sekiya Laboratory, 4-3-11 Takeda, Kofu 400-8511 (Japan); Harada, H.; Nakagawa, Y. [Department of Electrical Engineering, Yamanashi University, Nakagawa-Sekiya Laboratory, 4-3-11 Takeda, Kofu 400-8511 (Japan); Ono, S.; Ohshima, S. [Yamagata University, 4-3-16 Johnan, Yonezawa 992-8510 (Japan)

2010-11-01

We have developed a method for tuning the bandwidth of a high-temperature superconducting (HTS) microstrip filter. Several {pi}-shaped waveguides are placed between the resonators, and the bandwidth is tuned in discrete steps by changing the switch states of the waveguides, which changes the coupling coefficient between the resonators. The filter contains 3-pole half-wavelength straight-line resonators and two {pi}-shaped waveguides for bandwidth tuning. It also has several electrical pads distributed around the feed lines for trimming after tuning. The filter was fabricated by depositing YBa{sub 2}Cu{sub 3}O{sub 7} thin film on an MgO substrate and has a measured center frequency of 5.17 GHz and bandwidth of 220 MHz. Use of the {pi}-shaped waveguides to adjust the coupling coefficients and the electrical pads to adjust the external quality factors resulted in 80-MHz bandwidth tuning without increased insertion loss.

Estimating individual listeners’ auditory-filter bandwidth in simultaneous and non-simultaneous masking

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

Zinc allocation and re-allocation in rice

NARCIS (Netherlands)

Stomph, T.J.; Jiang, W.; Putten, van der P.E.L.; Struik, P.C.

2014-01-01

Aims: Agronomy and breeding actively search for options to enhance cereal grain Zn density. Quantifying internal (re-)allocation of Zn as affected by soil and crop management or genotype is crucial. We present experiments supporting the development of a conceptual model of whole plant Zn allocation

Solving binary-state multi-objective reliability redundancy allocation series-parallel problem using efficient epsilon-constraint, multi-start partial bound enumeration algorithm, and DEA

International Nuclear Information System (INIS)

Khalili-Damghani, Kaveh; Amiri, Maghsoud

2012-01-01

In this paper, a procedure based on efficient epsilon-constraint method and data envelopment analysis (DEA) is proposed for solving binary-state multi-objective reliability redundancy allocation series-parallel problem (MORAP). In first module, a set of qualified non-dominated solutions on Pareto front of binary-state MORAP is generated using an efficient epsilon-constraint method. In order to test the quality of generated non-dominated solutions in this module, a multi-start partial bound enumeration algorithm is also proposed for MORAP. The performance of both procedures is compared using different metrics on well-known benchmark instance. The statistical analysis represents that not only the proposed efficient epsilon-constraint method outperform the multi-start partial bound enumeration algorithm but also it improves the founded upper bound of benchmark instance. Then, in second module, a DEA model is supplied to prune the generated non-dominated solutions of efficient epsilon-constraint method. This helps reduction of non-dominated solutions in a systematic manner and eases the decision making process for practical implementations. - Highlights: ► A procedure based on efficient epsilon-constraint method and DEA was proposed for solving MORAP. ► The performance of proposed procedure was compared with a multi-start PBEA. ► Methods were statistically compared using multi-objective metrics.

Energy-efficient dynamic resource allocation with energy harvesting nodes

OpenAIRE

Rubio López, Javier

2012-01-01

The allocation of radio resources where nodes are battery constrained. [ANGLÈS] In wireless communications, there is a trend to deploy shorter-distance networks to cope with the high demanding necessities of bit-rate that current applications require. In such networks, the power needed for transmission is considerably low, due to proximity between base station and mobile terminals. As a consequence, complex baseband algorithms for signal processing and radio frequency circuitry require an ...

360/degree/ digital phase detector with 100-kHz bandwidth

International Nuclear Information System (INIS)

Reid, D.W.; Riggin, D.; Fazio, M.V.; Biddle, R.S.; Patton, R.D.; Jackson, H.A.

1981-01-01

The general availability of digital circuit components with propagation delay times of a few nanoseconds makes a digital phase detector with good bandwidth feasible. Such a circuit has a distinct advantage over its analog counterpart because of its linearity over a wide range of phase shift. A description is given of a phase detector that is being built at Los Alamos National Laboratory for the Fusion Materials Irradiation Test (FMIT) project. The specifications are 100-kHz bandwidth, linearity of /plus or minus/1/degree/ over /plus or minus/180/degree/ of phase shift, and 0.66/degree/ resolution. To date, the circuit has achieved the bandwidth and resolution. The linearity is approximately /plus or minus/3/degree/ over /plus or minus/180/degree/ phase shift. 3 refs

The mixing evolutionary algorithm : indepedent selection and allocation of trials

NARCIS (Netherlands)

C.H.M. van Kemenade

1997-01-01

textabstractWhen using an evolutionary algorithm to solve a problem involving building blocks we have to grow the building blocks and then mix these building blocks to obtain the (optimal) solution. Finding a good balance between the growing and the mixing process is a prerequisite to get a reliable

Balance in machine architecture: Bandwidth on board and offboard, integer/control speed and flops versus memory

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

Resource Allocation Optimization Model of Collaborative Logistics Network Based on Bilevel Programming

Directory of Open Access Journals (Sweden)

Xiao-feng Xu

2017-01-01

Full Text Available Collaborative logistics network resource allocation can effectively meet the needs of customers. It can realize the overall benefit maximization of the logistics network and ensure that collaborative logistics network runs orderly at the time of creating value. Therefore, this article is based on the relationship of collaborative logistics network supplier, the transit warehouse, and sellers, and we consider the uncertainty of time to establish a bilevel programming model with random constraints and propose a genetic simulated annealing hybrid intelligent algorithm to solve it. Numerical example shows that the method has stronger robustness and convergence; it can achieve collaborative logistics network resource allocation rationalization and optimization.

An Architecture of IoT Service Delegation and Resource Allocation Based on Collaboration between Fog and Cloud Computing

Directory of Open Access Journals (Sweden)

Aymen Abdullah Alsaffar

2016-01-01

Full Text Available Despite the wide utilization of cloud computing (e.g., services, applications, and resources, some of the services, applications, and smart devices are not able to fully benefit from this attractive cloud computing paradigm due to the following issues: (1 smart devices might be lacking in their capacity (e.g., processing, memory, storage, battery, and resource allocation, (2 they might be lacking in their network resources, and (3 the high network latency to centralized server in cloud might not be efficient for delay-sensitive application, services, and resource allocations requests. Fog computing is promising paradigm that can extend cloud resources to edge of network, solving the abovementioned issue. As a result, in this work, we propose an architecture of IoT service delegation and resource allocation based on collaboration between fog and cloud computing. We provide new algorithm that is decision rules of linearized decision tree based on three conditions (services size, completion time, and VMs capacity for managing and delegating user request in order to balance workload. Moreover, we propose algorithm to allocate resources to meet service level agreement (SLA and quality of services (QoS as well as optimizing big data distribution in fog and cloud computing. Our simulation result shows that our proposed approach can efficiently balance workload, improve resource allocation efficiently, optimize big data distribution, and show better performance than other existing methods.

Distribute Off-Time Office Internet bandwidth Using Topology Mesh For Sorrounding Neighbour

Science.gov (United States)

Zendrato, Niskarto; Sihombing, Oloan; Laia, Yonata; Sabarita Barus, Ertina

2018-04-01

The Internet as one of the very rapidly growing information technology can provide data and information with wide world, complete, and up to date. Users can download and upload data such as the application file, multimedia and text through the Internet network. But for the Internet availability is still less equal access because of the lack of availability of adequate infrastructure, therefore the author make the utilization of bandwidth that can be establish Internet balancing although still on a small scale. By this research the authors use bandwidth from PT. Deltauli Home Teknikarya that where bandwidth necessity on when time off-time unused office, where the office always pay full for Internet connection even though at the time of the off-time. It’s many of the available bandwidth, so that the author is trying to take advantage of the bandwidth at the time of the off-time the office to be used by the community using radio connection link and use the radius server as user management and server to send sms and user and password to the users who want to enjoy free internet connection.

Coarse-Grain Bandwidth Estimation Techniques for Large-Scale Space Network

Science.gov (United States)

Cheung, Kar-Ming; Jennings, Esther

2013-01-01

In this paper, we describe a top-down analysis and simulation approach to size the bandwidths of a store-andforward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. We use these techniques to estimate the wide area network (WAN) bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network.

Fast Faraday Cup With High Bandwidth

Science.gov (United States)

Deibele, Craig E [Knoxville, TN

2006-03-14

A circuit card stripline Fast Faraday cup quantitatively measures the picosecond time structure of a charged particle beam. The stripline configuration maintains signal integrity, and stitching of the stripline increases the bandwidth. A calibration procedure ensures the measurement of the absolute charge and time structure of the charged particle beam.

Bandwidth-dependent transformation of noise data f

OpenAIRE

P. Bormann;  

1998-01-01

Additional keywords: bandwidth dependence amplitudes, Dynamikbereich, Frequenzband, relative Bandbreite, spektrale Leistungsdichte der Bodenunruhe, Darstellungen der Bodenunruhespektren in verschiedenen kinematischen Einheiten, Transformation kinematischer Einheiten, Transformation von Spektren in Amplituden der Bodenbewegung, Abhaengigkeit der Amplituden von der Bandbreite

Optimization of Quantum-Dot Molecular Beam Epitaxy for Broad Spectral Bandwidth Devices

KAUST Repository

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.

Optimization of Quantum-Dot Molecular Beam Epitaxy for Broad Spectral Bandwidth Devices

KAUST Repository

Majid, Mohammed Abdul; Hugues, M.; Vézian, S.; Childs, D. T. D.; Hogg, R. A.

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

Hybrid and dependent task scheduling algorithm for on-board system software

Institute of Scientific and Technical Information of China (English)

魏振华; 洪炳熔; 乔永强; 蔡则苏; 彭俊杰

2003-01-01

In order to solve the hybrid and dependent task scheduling and critical source allocation problems, atask scheduling algorithm has been developed by first presenting the tasks, and then describing the hybrid anddependent scheduling algorithm and deriving the predictable schedulability condition. The performance of thisagorithm was evaluated through simulation, and it is concluded from the evaluation results that the hybrid taskscheduling subalgorithm based on the comparison factor can be used to solve the problem of aperiodic task beingblocked by periodic task in the traditional operating system for a very long time, which results in poor schedu-ling predictability; and the resource allocation subalgorithm based on schedulability analysis can be used tosolve the problems of critical section conflict, ceiling blocking and priority inversion; and the scheduling algo-rithm is nearest optimal when the abortable critical section is 0.6.

A Comparison between Different Meta-Heuristic Techniques in Power Allocation for Physical Layer Security

Directory of Open Access Journals (Sweden)

N. Okati

2017-12-01

Full Text Available Node cooperation can protect wireless networks from eavesdropping by using the physical characteristics of wireless channels rather than cryptographic methods. Allocating the proper amount of power to cooperative nodes is a challenging task. In this paper, we use three cooperative nodes, one as relay to increase throughput at the destination and two friendly jammers to degrade eavesdropper’s link. For this scenario, the secrecy rate function is a non-linear non-convex problem. So, in this case, exact optimization methods can only achieve suboptimal solution. In this paper, we applied different meta-heuristic optimization techniques, like Genetic Algorithm (GA, Partial Swarm Optimization (PSO, Bee Algorithm (BA, Tabu Search (TS, Simulated Annealing (SA and Teaching-Learning-Based Optimization (TLBO. They are compared with each other to obtain solution for power allocation in a wiretap wireless network. Although all these techniques find suboptimal solutions, but they appear superlative to exact optimization methods. Finally, we define a Figure of Merit (FOM as a rule of thumb to determine the best meta-heuristic algorithm. This FOM considers quality of solution, number of required iterations to converge, and CPU time.

Optical tweezers with 2.5 kHz bandwidth video detection for single-colloid electrophoresis

Science.gov (United States)