Naeem, Huma; Hussain, Mukhtar; Khan, Shoab A
2009-01-01
Surveillance control and reporting (SCR) system for air threats play an important role in the defense of a country. SCR system corresponds to air and ground situation management/processing along with information fusion, communication, coordination, simulation and other critical defense oriented tasks. Threat Evaluation and Weapon Assignment (TEWA) sits at the core of SCR system. In such a system, maximal or near maximal utilization of constrained resources is of extreme importance. Manual TEWA systems cannot provide optimality because of different limitations e.g.surface to air missile (SAM) can fire from a distance of 5Km, but manual TEWA systems are constrained by human vision range and other constraints. Current TEWA systems usually work on target-by-target basis using some type of greedy algorithm thus affecting the optimality of the solution and failing in multi-target scenario. his paper relates to a novel two-staged flexible dynamic decision support based optimal threat evaluation and weapon assignment...
Evolutionary algorithm based index assignment algorithm for noisy channel
Institute of Scientific and Technical Information of China (English)
李天昊; 余松煜
2004-01-01
A globally optimal solution to vector quantization (VQ) index assignment on noisy channel, the evolutionary algorithm based index assignment algorithm (EAIAA), is presented. The algorithm yields a significant reduction in average distortion due to channel errors, over conventional arbitrary index assignment, as confirmed by experimental results over the memoryless binary symmetric channel (BSC) for any bit error.
Colony location algorithm for assignment problems
Institute of Scientific and Technical Information of China (English)
Dingwei WANG
2004-01-01
A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic conmunity that colonies of species could be located in the places most suitable to their growth. The factors working on the species location such as the nutrient of soil, resource competition between species, growth and decline process, and effect on environment were considered in CLA via the nutrient function, growth and decline rates, environment evaluation and fertilization strategy.CLA was applied to solve the classical assignment problems. The computation results show that CLA can achieve the optimal solution with higher possibility and shorter running time.
Weekly Fleet Assignment Model and Algorithm
Institute of Scientific and Technical Information of China (English)
ZHU Xing-hui; ZHU Jin-fu; GONG Zai-wu
2007-01-01
A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity,and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a realworld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.
Competition assignment problem algorithm based on Hungarian method
Institute of Scientific and Technical Information of China (English)
KONG Chao; REN Yongtai; GE Huiling; DENG Hualing
2007-01-01
Traditional Hungarian method can only solve standard assignment problems, while can not solve competition assignment problems. This article emphatically discussed the difference between standard assignment problems and competition assignment problems. The kinds of competition assignment problem algorithms based on Hungarian method and the solutions of them were studied.
A multicast dynamic wavelength assignment algorithm based on matching degree
Institute of Scientific and Technical Information of China (English)
WU Qi-wu; ZHOU Xian-wei; WANG Jian-ping; YIN Zhi-hong; ZHANG Long
2009-01-01
The wavelength assignment with multiple multicast requests in fixed routing WDM network is studied. A new multicast dynamic wavelength assignment algorithm is presented based on matching degree. First, the wavelength matching degree between available wavelengths and multicast routing trees is introduced into the algorithm. Then, the wavelength assign-ment is translated into the maximum weight matching in bipartite graph, and this matching problem is solved by using an extended Kuhn-Munkres algorithm. The simulation results prove that the overall optimal wavelength assignment scheme is obtained in polynomial time. At the same time, the proposed algorithm can reduce the connecting blocking probability and improve the system resource utilization.
An Improved Point-track Optimal Assignment Algorithm
Zhonglei Zhang; Weihua Zhang; Li Zhou
2013-01-01
In order to improve the accuracy of data association of the Optimal Assignment (OA) algorithm based on dynamic information, an improved Point-Track Optimal Assignment (IPTOA) algorithm based on multi-source information is proposed. The improved algorithm gets valid 3-tuple of measurement set by solving 3-Dimensional (3-D) assignment problem which is based on dynamic information. Then fuses multi-source information by combination rule of D-S evidence theory and constructs the point-track corre...
An efficient and impartial online algorithm for kidney assignment network
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
An online algorithm balancing the efficiency and equity principles is proposed for the kidney resource assignment when only the current patient and resource information is known to the assignment network. In the algorithm, the assignment is made according to the priority, which is calculated according to the efficiency principle and the equity principle. The efficiency principle is concerned with the post-transplantation immunity spending caused by the possible post-operation immunity rejection and patient’...
An Improved Point-track Optimal Assignment Algorithm
Directory of Open Access Journals (Sweden)
Zhonglei Zhang
2013-12-01
Full Text Available In order to improve the accuracy of data association of the Optimal Assignment (OA algorithm based on dynamic information, an improved Point-Track Optimal Assignment (IPTOA algorithm based on multi-source information is proposed. The improved algorithm gets valid 3-tuple of measurement set by solving 3-Dimensional (3-D assignment problem which is based on dynamic information. Then fuses multi-source information by combination rule of D-S evidence theory and constructs the point-track correlation matrix between valid 3-tuple of measurement and target track. Compared with the optimal assignment algorithm based on dynamic information, the new algorithm effectively fuses multi-source information to correlate measurement data, which improves the performance of multi-target tracking in different degrees. Simulation results verify the feasibility and effectiveness of the new algorithm.
Localized Algorithm for Channel Assignment in Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
Harpreet Kaur
2015-12-01
Full Text Available Cognitive Radio has been emerged as a revolutionary solution to migrate the current shortage of spectrum allocation in wireless networks. In this paper, an improved localized channel allocation algorithm based on channel weight is proposed. A factor of channel stability is introduced based on link environment, which efficiently assigns the best channels to the links. Based on the framework, a conflict resolution strategy is used to make the scheme adaptable to different network conditions. Calculations indicate that this algorithm can reduce the conflicts, increase the delivery rate and link assignment rate compared with the basic channel assignment algorithm.
Solving the Quadratic Assignment Problem by a Hybrid Algorithm
Directory of Open Access Journals (Sweden)
Aldy Gunawan
2011-01-01
Full Text Available This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP. The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP to obtain an initial solution, and then using a combined Simulated Annealing (SA and Tabu Search (TS algorithm to improve the solution. Experimental results indicate that the hybrid algorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.
Ant Colony Algorithm and Simulation for Robust Airport Gate Assignment
Directory of Open Access Journals (Sweden)
Hui Zhao
2014-01-01
Full Text Available Airport gate assignment is core task for airport ground operations. Due to the fact that the departure and arrival time of flights may be influenced by many random factors, the airport gate assignment scheme may encounter gate conflict and many other problems. This paper aims at finding a robust solution for airport gate assignment problem. A mixed integer model is proposed to formulate the problem, and colony algorithm is designed to solve this model. Simulation result shows that, in consideration of robustness, the ability of antidisturbance for airport gate assignment scheme has much improved.
ZAP: a distributed channel assignment algorithm for cognitive radio networks
Directory of Open Access Journals (Sweden)
Munaretto Anelise
2011-01-01
Full Text Available Abstract We propose ZAP, an algorithm for the distributed channel assignment in cognitive radio (CR networks. CRs are capable of identifying underutilized licensed bands of the spectrum, allowing their reuse by secondary users without interfering with primary users. In this context, efficient channel assignment is challenging as ideally it must be simple, incur acceptable communication overhead, provide timely response, and be adaptive to accommodate frequent changes in the network. Another challenge is the optimization of network capacity through interference minimization. In contrast to related work, ZAP addresses these challenges with a fully distributed approach based only on local (neighborhood knowledge, while significantly reducing computational costs and the number of messages required for channel assignment. Simulations confirm the efficiency of ZAP in terms of (i the performance tradeoff between different metrics and (ii the fast achievement of a suitable assignment solution regardless of network size and density.
Fast and Rigorous Assignment Algorithm Multiple Preference and Calculation
Directory of Open Access Journals (Sweden)
Ümit Çiftçi
2010-03-01
Full Text Available The goal of paper is to develop an algorithm that evaluates students then places them depending on their desired choices according to dependant preferences. The developed algorithm is also used to implement software. The success and accuracy of the software as well as the algorithm are tested by applying it to ability test at Beykent University. This ability test is repeated several times in order to fill all available places at Fine Art Faculty departments in every academic year. It has been shown that this algorithm is very fast and rigorous after application of 2008-2009 and 2009-20010 academic years.Key Words: Assignment algorithm, student placement, ability test
An efficient and impartial online algorithm for kidney assignment network
Institute of Scientific and Technical Information of China (English)
Yu-jue Wang; Jia-yin Wang; Pei-jia Tang; Yi-tuo Ye
2009-01-01
An online algorithm balancing the efficiency and equity principles is proposed for the kidney resource assignment when only the current patient and resource information is known to the assignment network. In the algorithm, the assignment is made according to the priority, which is calculated according to the efficiency principle and the equity principle. The efficiency principle is concerned with the post-transplantation- immunity spending caused by the possible post-operation immunity rejection and patient's mental depression due to the HLA mismatch. The equity principle is concerned with three other factors, namely the treatment spending incurred starting from the day of registering with the kidney assignment network, the post-operation immunity spending and the negative effects of waiting for kidney resources on the clinical efficiency. The competitive analysis conducted through computer simulation indicates that the efficiency competitive ratio is between 6. 29 and 10. 43 and the equity competitive ratio is between 1. 31 and 5. 21, demonstrating that the online algorithm is of great significance in application.
Locomotive assignment problem with train precedence using genetic algorithm
Noori, Siamak; Ghannadpour, Seyed Farid
2012-07-01
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should be serviced earlier than others. This problem is modeled using vehicle routing and scheduling problem where trains representing the customers are supposed to be serviced in pre-specified hard/soft fuzzy time windows. A two-phase approach is used which, in the first phase, the multi-depot locomotive assignment is converted to a set of single depot problems, and after that, each single depot problem is solved heuristically by a hybrid genetic algorithm. In the genetic algorithm, various heuristics and efficient operators are used in the evolutionary search. The suggested algorithm is applied to solve the medium sized numerical example to check capabilities of the model and algorithm. Moreover, some of the results are compared with those solutions produced by branch-and-bound technique to determine validity and quality of the model. Results show that suggested approach is rather effective in respect of quality and time.
ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMS BASED ON EQUIVALENT NETWORKS
Institute of Scientific and Technical Information of China (English)
Qi Xiaogang; Liu Lifang; Lin Sanyang
2006-01-01
In this paper, a Wavelength Division Multiplexing (WDM) network model based on the equivalent networks is described, and wavelength-dependent equivalent arc, equivalent networks, equivalent multicast tree and some other terms are presented. Based on this model and relevant Routing and Wavelength Assignment (RWA) strategy, a unicast RWA algorithm and a multicast RWA algorithm are presented. The wavelength-dependent equivalent arc expresses the schedule of local RWA and the equivalent network expresses the whole topology of WDM optical networks, so the two algorithms are of the flexibility in RWA and the optimization of the whole problem. The theoretic analysis and simulation results show the two algorithms are of the stronger capability and the lower complexity than the other existing algorithms for RWA problem, and the complexity of the two algorithms are only related to the scale of the equivalent networks. Finally, we prove the two algorithms' feasibility and the one-by-one corresponding relation between the equivalent multicast tree and original multicast tree, and point out the superiorities and drawbacks of the two algorithms respectively.
Efficient scheduling algorithm for demand-assigned TDMA satellite systems
Durrani, Sajjad H.; Jo, Kyung Y.
1989-01-01
An efficient scheduling algorithm (stations burst plan) for demand-assigned time-division multiple-access (TDMA) satellite network systems is introduced. The total demand for transmitting data through a transponder may exceed the available bit-rate capacity, and a scheduler of the system wishes to utilize the system with minimum changes of slot allocations while maximizing throughputs. By implementing such a burst-plan algorithm, transmission of all demanded data traffic can be completed with minimum unused resources (idle slots). The underlying ideas adopted for the algorithm are that jobs with shorter remaining processing times should have higher priorities and that as many jobs are processed at a time as possible. The algorithm is particularly useful for deriving smooth burst plans for a satellite system with a large number of ground stations.
EVOLUTIONARY NEURAL NETWORKS ALGORITHM FOR THE DYNAMIC FREQUENCY ASSIGNMENT PROBLEM
Directory of Open Access Journals (Sweden)
Jamal Elhachmi
2011-06-01
Full Text Available Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application-specific characteristics. Researchers have developed different modelling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion. This paper presents a new approach for solving the problem of frequency allocation based on using initially a partial solution respecting all constraints according to a greedy algorithm. This partial solution is then used for the construction of our stimulation in the form of a neural network. In a second step, the approach will use searching techniques used in conjunction with iterative algorithms for theoptimization of the parameters and topology of the network. The iterative algorithms used are named hierarchical genetic algorithms (HGA. Our approach has been tested on standard benchmark problems called Philadelphia problems of frequency assignment. The results obtained are equivalent to those of current methods. Moreover, our approach shows more efficiency in terms of flexibility and autonomy.
Backbone analysis and algorithm design for the quadratic assignment problem
Institute of Scientific and Technical Information of China (English)
JIANG He; ZHANG XianChao; CHEN GuoLiang; LI MingChu
2008-01-01
As the hot line in NP-hard problems research in recent years, backbone analysis is crucial for phase transition, hardness, and algorithm design. Whereas theoretical analysis of backbone and its applications in algorithm design are still at a begin-ning state yet, this paper took the quadratic assignment problem (QAP) as a case study and proved by theoretical analysis that it is NP-hard to find the backbone, l.e., no algorithm exists to obtain the backbone of a QAP in polynomial time. Results of this paper showed that it is reasonable to acquire approximate backbone by inter-section of local optimal solutions. Furthermore, with the method of constructing biased instances, this paper proposed a new meta-heuristic - biased instance based approximate backbone (BI-AB), whose basic idea is as follows: firstly, con-struct a new biased instance for every QAP instance (the optimal solution of the new instance is also optimal for the original one); secondly, the approximate backbone is obtained by intersection of multiple local optimal solutions computed by some existing algorithm; finally, search for the optimal solutions in the reduced space by fixing the approximate backbone. Work of the paper enhanced the re-search area of theoretical analysis of backbone. The meta-heuristic proposed in this paper provided a new way for general algorithm design of NP-hard problems as well.
Study on Fleet Assignment Problem Model and Algorithm
Directory of Open Access Journals (Sweden)
Yaohua Li
2013-01-01
Full Text Available The Fleet Assignment Problem (FAP of aircraft scheduling in airlines is studied, and the optimization model of FAP is proposed. The objective function of this model is revenue maximization, and it considers comprehensively the difference of scheduled flights and aircraft models in flight areas and mean passenger flows. In order to solve the model, a self-adapting genetic algorithm is supposed to solve the model, which uses natural number coding, adjusts dynamically crossover and mutation operator probability, and adopts intelligent heuristic adjusting to quicken optimization pace. The simulation with production data of an airline shows that the model and algorithms suggested in this paper are feasible and have a good application value.
Shape Assignment by Genetic Algorithm towards Designing Optimal Areas
Directory of Open Access Journals (Sweden)
Ismadi Md Badarudin
2010-07-01
Full Text Available This paper presents a preliminary study on space allocation focusing on the rectangular shapes to be assigned into an area with an intention to find optimal combination of shapes. The proposed solution is vital for promoting an optimal planting area and eventually finds the optimal number of trees as the ultimate goal. Thus, the evolutionary algorithm by GA technique was performed to find the objective. GAs by implementing some metaheuristic approaches is one of the most common techniques for handling ambiguous and / or vast possible solutions. The shape assignment strategy by the determined shapes coordinate to be assigned into an area was introduced. The aim of this study is to gauge the capability of GA to solve this problem. Therefore some strategies to determine the chromosome representation and genetic operators are essential for less computational time and result quality. Some areas coordinate were used to generate the optimal solutions. The result indicates the GA is able to fulfill both feasible result and acceptable time.
Some recent results in the analysis of greedy algorithms for assignment problems
Faigle, Ulrich
1994-01-01
We survey some recent developments in the analysis of greedy algorithms for assignment and transportation problems. We focus on the linear programming model for matroids and linear assignment problems with Monge property, on general linear programs, probabilistic analysis for linear assignment and makespan minimization, and on-line algorithms for linear and non-linear assignment problems.
Locomotive assignment problem with train precedence using genetic algorithm
Noori, Siamak; Ghannadpour, Seyed
2012-01-01
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should...
Institute of Scientific and Technical Information of China (English)
ZHAO Hui; GAO Ziyou
2005-01-01
This paper presents a unified framework of the nonmonotone convex combination algorithms (such as Frank-Wolfe Algorithm) for solving the traffic assignment problems. Global convergence results are established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the nonmonotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.
A new algorithm for pole assignment of single-input linear systems using state feedback
Institute of Scientific and Technical Information of China (English)
QIAN Jiang; CHENG Mingsong; XU Shufang
2005-01-01
In this paper we present a new algorithm for the single-input pole assignment problem using state feedback. This algorithm is based on the Schur decomposition of the closed-loop system matrix, and the numerically stable unitary transformations are used whenever possible, and hence it is numerically reliable.The good numerical behavior of this algorithm is also illustrated by numerical examples.
Task Assignment for Heterogeneous Computing Problems using Improved Iterated Greedy Algorithm
Directory of Open Access Journals (Sweden)
R.Mohan
2014-06-01
Full Text Available The problem of task assignment is one of the most fundamental among combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. A classic problem that confronts computer scientists across the globe pertaining to the effective assignment of tasks to the various processors of the system due to the intractability of the task assignment problem for more than 3 processors. Several Algorithms and methodologies have been proposed to solve the Task Assignment Problem, most of which use Graph Partitioning and Graph Matching Techniques. Significant research has also been carried out in solving the Task Assignment Problem in a parallel environment. Here we propose a modified version of iterated greedy algorithm that capitalizes on the efficacy of the Parallel Processing paradigm, minimizing the various costs along with the duration of convergence. The central notion of the algorithm is to enhance the quality of assignment in every iteration, utilizing the values from the preceding iterations and at the same time assigning these smaller computations to internal processors (i.e. parallel processing to hasten the computation. On implementation, the algorithm was tested using Message Passing Interface (MPI and the results show the effectiveness of the said algorithm.
Channel Assignment Algorithms for MRMC Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Mohammad A Hoque
2011-11-01
Full Text Available The wireless mesh networksare considered as one of the vital elements in today’s converged networks,providing high bandwidth and connectivity over large geographical areas. Mesh routers equipped with multiple radios can significantly overcome the capacity problem and increase the aggregate throughput of the network where single radio nodessuffer from performancedegradation. Moreover, the market availability of cheap radios or network interfaces also makes multi-radio solutions more feasible.A key issue in such networks is how to efficiently design a channel assignmentscheme that utilizes the available channels as well as increases overall performance of the network. This paper provides an overall review on the issues pertaining to the channel assignment in WMNs and the most relevant approaches and solutions developed in the area. They include design challenges, goals and criteria; routing considerations, graph based solutions and challenges of partially overlapped channels. We conclude that the assignment of channels to the radio interfaces continuously poses significant challenges. Many research issues remain open for further investigation.
Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian
2015-10-23
The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.
Zhu, Liuhong; Guo, Gang
2012-01-01
This study tested an improved fiber tracking algorithm, which was based on fiber assignment using a continuous tracking algorithm and a two-tensor model. Different models and tracking decisions were used by judging the type of estimation of each voxel. This method should solve the cross-track problem. This study included eight healthy subjects, two axonal injury patients and seven demyelinating disease patients. This new algorithm clearly exhibited a difference in nerve fiber direction betwee...
Heuristic file sorted assignment algorithm of parallel I/O on cluster computing system
Institute of Scientific and Technical Information of China (English)
CHEN Zhi-gang; ZENG Bi-qing; XIONG Ce; DENG Xiao-heng; ZENG Zhi-wen; LIU An-feng
2005-01-01
A new file assignment strategy of parallel I/O, which is named heuristic file sorted assignment algorithm was proposed on cluster computing system. Based on the load balancing, it assigns the files to the same disk according to the similar service time. Firstly, the files were sorted and stored at the set I in descending order in terms of their service time, then one disk of cluster node was selected randomly when the files were to be assigned, and at last the continuous files were taken orderly from the set I to the disk until the disk reached its load maximum. The experimental results show that the new strategy improves the performance by 20.2% when the load of the system is light and by 31.6% when the load is heavy. And the higher the data access rate, the more evident the improvement of the performance obtained by the heuristic file sorted assignment algorithm.
A Novel Dynamic Bandwidth Assignment Algorithm for Multi-Services EPONs
Institute of Scientific and Technical Information of China (English)
CHEN Xue; ZHANG Yang; HUANG Xiang; DENG Yu; SUN Shu-he
2005-01-01
In this paper we propose a novel Dynamic Bandwidth Assignment (DBA) algorithm for Ethernet-based Passive Optical Networks (EPON) which offers multiple kinds of services. To satisfy crucial Quality of Service (QoS) requirement for Time Division Multiplexing (TDM) service and achieve fair and high bandwidth utilization simultaneously, the algorithm integrates periodic, for TDM service, and polling granting for Ethernet service. Detailed simulation shows that the algorithm guarantees carrier-grade QoS for TDM service, high bandwidth utilization and good fairness of bandwidth assignment among Optical Network Units (ONU).
Institute of Scientific and Technical Information of China (English)
Wang Yanxia; Qian Longjun; Guo Zhi; Ma Lifeng
2008-01-01
A weapon target assignment (WTA) model satisfying expected damage probabilities with an ant colony algorithm is proposed.In order to save armament resource and attack the targets effectively,the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted.The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result.Ant colony algorithm has been successfully used in many fields,especially in combination optimization.The ant colony algorithm for this WTA problem is described by analyzing path selection,pheromone update,and tabu table update.The effectiveness of the model and the algorithm is demonstrated with an example.
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
Routing and wavelength assignment for online real-time multicast connection setup is a difficulttask due to the dynamic change of availabilities of wavelengths on links and the consideration of wave-length conversion delay in WDM networks. This paper presents a distributed routing and wavelength as-signment scheme for the setup of real-time multicast connections. It integrates routing and wavelength as-signment as a single process, which greatly reduces the connection setup time. The proposed routingmethod is based on the Prim's MST (Minimum Spanning Tree) algorithm and the K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound. The wave-length assignment uses the least-conversion and load balancing strategies. Simulation results show that theproposed algorithm is suitable for online multicast connection establishment in WDM networks.
Institute of Scientific and Technical Information of China (English)
Liuhong Zhu; Gang Guo
2012-01-01
This study tested an improved fiber tracking algorithm, which was based on fiber assignment using a continuous tracking algorithm and a two-tensor model. Different models and tracking decisions were used by judging the type of estimation of each voxel. This method should solve the cross-track problem. This study included eight healthy subjects, two axonal injury patients and seven demyelinating disease patients. This new algorithm clearly exhibited a difference in nerve fiber direction between axonal injury and demyelinating disease patients and healthy control subjects. Compared with fiber assignment with a continuous tracking algorithm, our novel method can track more and longer nerve fibers, and also can solve the fiber crossing problem.
Simulated annealing algorithm for solving chambering student-case assignment problem
Ghazali, Saadiah; Abdul-Rahman, Syariza
2015-12-01
The problem related to project assignment problem is one of popular practical problem that appear nowadays. The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased. This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem. The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. The problem of assigning chambering students to cases has never been addressed in the literature before. For the proposed problem, it is essential for law graduates to peruse in chambers before they are qualified to become legal counselor. Thus, assigning the chambering students to cases is a critically needed especially when involving many preferences. Hence, this study presents a preliminary study of the proposed project assignment problem. The objective of the study is to minimize the total completion time for all students in solving the given cases. This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution. The search then is preceded with a simulated annealing algorithm for further improvement of solution quality. The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. Hence, this research has demonstrated the advantages of solving project assignment problem by using metaheuristic techniques.
Lee, Chankyun; Cao, Xiaoyuan; Yoshikane, Noboru; Tsuritani, Takehiro; Rhee, June-Koo Kevin
2015-10-19
The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study. PMID:26480397
Institute of Scientific and Technical Information of China (English)
TIAN Ye; SHENG Min; LI Jiandong
2007-01-01
This Paper presents a novel distributed media access control(MAC)address assignment algorithm,namely virtual grid spatial reusing(VGSR),for wireless sensor networks,which reduces the size of the MAC address efficiently on the basis of both the spatial reuse of MAC address and the mapping of geographical position.By adjusting the communication range of sensor nodes,VGSR algorithm can minimize the size of MAC address and meanwhile guarantee the connectivity of the sensor network.Theoretical analysis and experimental results show that VGSR algorithm is not only of low energy cost,but also scales well with the network ize,with its performance superior to that of other existing algorithms.
Directory of Open Access Journals (Sweden)
Zhaocai Wang
2015-10-01
Full Text Available The unbalanced assignment problem (UAP is to optimally resolve the problem of assigning n jobs to m individuals (m < n, such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.
An O(NlogN Algorithm for Region Definition Using Channels/Switchboxes and Ordering Assignment
Directory of Open Access Journals (Sweden)
Jin-Tai Yan
1996-01-01
Full Text Available For a building block placement, the routing space can be further partitioned into channels and switchboxes. In general, the definition of switchboxes releases the cyclic channel precedence constraints and further yields a safe routing ordering process. However, switchbox routing is more difficult than channel routing. In this paper, an O(NlogN region definition and ordering assignment (RDAOA algorithm is proposed to minimize the number of switchboxes for the routing phase, where N is the number of vertices in a channel precedence graph. Several examples have been tested on the proposed algorithm, and the experimental results are listed and compared.
Algorithm Design for Assignment Frequency Channels for Services in CATV Network
Directory of Open Access Journals (Sweden)
Jan Hlubik
2008-01-01
Full Text Available This article describes algorithm design for assignment frequency channels for services in CATV network. QAM modulated channels in designed system are dynamically switched and frequency adapted. On introduction, there is shortly described principle of providing analog video, digital video and data services in CATV network. Object of the article is focused on method of allocation individual TV and data channels on the frequency band. The conclusion compares advantages and disadvantages present and design system.
FPGA implementation of dynamic channel assignment algorithm for cognitive wireless sensor networks
Martínez, Daniela M.; Andrade, Ángel G.
2015-07-01
The reliability of wireless sensor networks (WSNs) in industrial applications can be thwarted due to multipath fading, noise generated by industrial equipment or heavy machinery and particularly by the interference generated from other wireless devices operating in the same spectrum band. Recently, cognitive WSNs (CWSNs) were proposed to improve the performance and reliability of WSNs in highly interfered and noisy environments. In this class of WSN, the nodes are spectrum aware, that is, they monitor the radio spectrum to find channels available for data transmission and dynamically assign and reassign nodes to low-interference condition channels. In this work, we present the implementation of a channel assignment algorithm in a field-programmable gate array, which dynamically assigns channels to sensor nodes based on the interference and noise levels experimented in the network. From the results obtained from the performance evaluation of the CWSN when the channel assignment algorithm is considered, it is possible to identify how many channels should be available in the network in order to achieve a desired percentage of successful transmissions, subject to constraints on the signal-to-interference plus noise ratio on each active link.
Advanced Credit-Assignment CMAC Algorithm for Robust Self-Learning and Self-Maintenance Machine
Institute of Scientific and Technical Information of China (English)
ZHANG Lei(张蕾); LEE Jay; CAO Qixin(曹其新); WANG Lei(王磊)
2004-01-01
Smart machine necessitates self-learning capabilities to assess its own performance and predict its behavior. To achieve self-maintenance intelligence, robust and fast learning algorithms need to be embedded in machine for real-time decision. This paper presents a credit-assignment cerebellar model articulation controller (CA-CMAC) algorithm to reduce learning interference in machine learning. The developed algorithms on credit matrix and the credit correlation matrix are presented. The error of the training sample distributed to the activated memory cell is proportional to the cell's credibility, which is determined by its activated times. The convergence processes of CA-CMAC in cyclic learning are further analyzed with two convergence theorems. In addition, simulation results on the inverse kinematics of 2-degree-of-freedom planar robot arm are used to prove the convergence theorems and show that CA-CMAC converges faster than conventional machine learning.
Directory of Open Access Journals (Sweden)
Zhang Xuejun
2015-04-01
Full Text Available The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by reasonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimization problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm (MPEA framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is proposed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution (CC algorithm combined with non-dominated sorting genetic algorithm II (NSGA-II is introduced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multi-objective genetic algorithm (MOGA, multi-objective evolutionary algorithm based on decomposition (MOEA/D, CC-based multi-objective algorithm (CCMA as well as other two MPEAs with different migration interval strategies.
Wavelength assignment algorithm considering the state of neighborhood links for OBS networks
Tanaka, Yu; Hirota, Yusuke; Tode, Hideki; Murakami, Koso
2005-10-01
Recently, Optical WDM technology is introduced into backbone networks. On the other hand, as the future optical switching scheme, Optical Burst Switching (OBS) systems become a realistic solution. OBS systems do not consider buffering in intermediate nodes. Thus, it is an important issue to avoid overlapping wavelength reservation between partially interfered paths. To solve this problem, so far, the wavelength assignment scheme which has priority management tables has been proposed. This method achieves the reduction of burst blocking probability. However, this priority management table requires huge memory space. In this paper, we propose a wavelength assignment algorithm that reduces both the number of priority management tables and burst blocking probability. To reduce priority management tables, we allocate and manage them for each link. To reduce burst blocking probability, our method announces information about the change of their priorities to intermediate nodes. We evaluate its performance in terms of the burst blocking probability and the reduction rate of priority management tables.
Heuristic algorithms for a storage location assignment problem in a chaotic warehouse
Quintanilla, Sacramento; Pérez, Ángeles; Ballestín, Francisco; Lino, Pilar
2015-10-01
The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorithms can also be used for other purposes such as to assess when and how it is convenient to perform relocation of stored items to improve the current level of storage space availability. Computational tests performed on a set of randomly generated and real warehouse instances show the effectiveness of the proposed methods.
Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms
International Nuclear Information System (INIS)
This work considers the problem of maximum utilization of a set of mobile robots with limited sensor-range capabilities and limited travel distances. The robots are initially in random positions. A set of robots properly guards or covers a region if every point within the region is within the effective sensor range of at least one vehicle. The authors wish to move the vehicles into surveillance positions so as to guard or cover a region, while minimizing the maximum distance traveled by any vehicle. This problem can be formulated as an assignment problem, in which they must optimally decide which robot to assign to which slot of a desired matrix of grid points. The cost function is the maximum distance traveled by any robot. Assignment problems can be solved very efficiently. Solutions times for one hundred robots took only seconds on a Silicon Graphics Crimson workstation. The initial positions of all the robots can be sampled by a central base station and their newly assigned positions communicated back to the robots. Alternatively, the robots can establish their own coordinate system with the origin fixed at one of the robots and orientation determined by the compass bearing of another robot relative to this robot. This paper presents example solutions to the multiple-target-multiple-agent scenario using a matching algorithm. Two separate cases with one hundred agents in each were analyzed using this method. They have found these mobile robot problems to be a very interesting application of network optimization methods, and they expect this to be a fruitful area for future research
Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah
2016-01-01
The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585
Evaluation of the Jonker-Volgenant-Castanon (JVC) assignment algorithm for track association
Malkoff, Donald B.
1997-07-01
The Jonker-Volgenant-Castanon (JVC) assignment algorithm was used by Lockheed Martin Advanced Technology Laboratories (ATL) for track association in the Rotorcraft Pilot's Associate (RPA) program. RPA is Army Aviation's largest science and technology program, involving an integrated hardware/software system approach for a next generation helicopter containing advanced sensor equipments and applying artificial intelligence `associate' technologies. ATL is responsible for the multisensor, multitarget, onboard/offboard track fusion. McDonnell Douglas Helicopter Systems is the prime contractor and Lockheed Martin Federal Systems is responsible for developing much of the cognitive decision aiding and controls-and-displays subsystems. RPA is scheduled for flight testing beginning in 1997. RPA is unique in requiring real-time tracking and fusion for large numbers of highly-maneuverable ground (and air) targets in a target-dense environment. It uses diverse sensors and is concerned with a large area of interest. Target class and identification data is tightly integrated with spatial and kinematic data throughout the processing. Because of platform constraints, processing hardware for track fusion was quite limited. No previous experience using JVC in this type environment had been reported. ATL performed extensive testing of the JVC, concentrating on error rates and run- times under a variety of conditions. These included wide ranging numbers and types of targets, sensor uncertainties, target attributes, differing degrees of target maneuverability, and diverse combinations of sensors. Testing utilized Monte Carlo approaches, as well as many kinds of challenging scenarios. Comparisons were made with a nearest-neighbor algorithm and a new, proprietary algorithm (the `Competition' algorithm). The JVC proved to be an excellent choice for the RPA environment, providing a good balance between speed of operation and accuracy of results.
New algorithm for robust H2/H∞ filtering with error variance assignment
Institute of Scientific and Technical Information of China (English)
刘立恒; 邓正隆; 王广雄
2004-01-01
We consider the robust H2/H∞ filtering problem for linear perturbed systems with steady-state error variance assignment. The generalized inverse technique of matrix is introduced, and a new algorithm is developed. After two Riccati equations are solved, the filter can be obtained directly, and the following three performance requirements are simultaneously satisfied: The filtering process is asymptotically stable; the steady-state variance of the estimation error of each state is not more than the individual prespecified upper bound; the transfer function from exogenous noise inputs to error state outputs meets the prespecified H∞ norm upper bound constraint. A numerical example is provided to demonstrate the flexibility of the proposed design approach.
Particle swarm optimization algorithm for optimizing assignment of blood in blood banking system.
Olusanya, Micheal O; Arasomwan, Martins A; Adewumi, Aderemi O
2015-01-01
This paper reports the performance of particle swarm optimization (PSO) for the assignment of blood to meet patients' blood transfusion requests for blood transfusion. While the drive for blood donation lingers, there is need for effective and efficient management of available blood in blood banking systems. Moreover, inherent danger of transfusing wrong blood types to patients, unnecessary importation of blood units from external sources, and wastage of blood products due to nonusage necessitate the development of mathematical models and techniques for effective handling of blood distribution among available blood types in order to minimize wastages and importation from external sources. This gives rise to the blood assignment problem (BAP) introduced recently in literature. We propose a queue and multiple knapsack models with PSO-based solution to address this challenge. Simulation is based on sets of randomly generated data that mimic real-world population distribution of blood types. Results obtained show the efficiency of the proposed algorithm for BAP with no blood units wasted and very low importation, where necessary, from outside the blood bank. The result therefore can serve as a benchmark and basis for decision support tools for real-life deployment.
Particle Swarm Optimization Algorithm for Optimizing Assignment of Blood in Blood Banking System
Directory of Open Access Journals (Sweden)
Micheal O. Olusanya
2015-01-01
Full Text Available This paper reports the performance of particle swarm optimization (PSO for the assignment of blood to meet patients’ blood transfusion requests for blood transfusion. While the drive for blood donation lingers, there is need for effective and efficient management of available blood in blood banking systems. Moreover, inherent danger of transfusing wrong blood types to patients, unnecessary importation of blood units from external sources, and wastage of blood products due to nonusage necessitate the development of mathematical models and techniques for effective handling of blood distribution among available blood types in order to minimize wastages and importation from external sources. This gives rise to the blood assignment problem (BAP introduced recently in literature. We propose a queue and multiple knapsack models with PSO-based solution to address this challenge. Simulation is based on sets of randomly generated data that mimic real-world population distribution of blood types. Results obtained show the efficiency of the proposed algorithm for BAP with no blood units wasted and very low importation, where necessary, from outside the blood bank. The result therefore can serve as a benchmark and basis for decision support tools for real-life deployment.
Hu, Kan-Nian; Qiang, Wei; Tycko, Robert
2011-01-01
We describe a general computational approach to site-specific resonance assignments in multidimensional NMR studies of uniformly 15N,13C-labeled biopolymers, based on a simple Monte Carlo/simulated annealing (MCSA) algorithm contained in the program MCASSIGN2. Input to MCASSIGN2 includes lists of multidimensional signals in the NMR spectra with their possible residue-type assignments (which need not be unique), the biopolymer sequence, and a table that describes the connections that relate one signal list to another. As output, MCASSIGN2 produces a high-scoring sequential assignment of the multidimensional signals, using a score function that rewards good connections (i.e., agreement between relevant sets of chemical shifts in different signal lists) and penalizes bad connections, unassigned signals, and assignment gaps. Examination of a set of high-scoring assignments from a large number of independent runs allows one to determine whether a unique assignment exists for the entire sequence or parts thereof. We demonstrate the MCSA algorithm using two-dimensional (2D) and three-dimensional (3D) solid state NMR spectra of several model protein samples (α-spectrin SH3 domain and protein G/B1 microcrystals, HET-s218–289 fibrils), obtained with magic-angle spinning and standard polarization transfer techniques. The MCSA algorithm and MCASSIGN2 program can accommodate arbitrary combinations of NMR spectra with arbitrary dimensionality, and can therefore be applied in many areas of solid state and solution NMR. PMID:21710190
A Genetic Algorithm Approach for the TV Self-Promotion Assignment Problem
Pereira, Paulo A.; Fontes, Fernando A. C. C.; Fontes, Dalila B. M. M.
2009-09-01
We report on the development of a Genetic Algorithm (GA), which has been integrated into a Decision Support System to plan the best assignment of the weekly self-promotion space for a TV station. The problem addressed consists on deciding which shows to advertise and when such that the number of viewers, of an intended group or target, is maximized. The GA proposed incorporates a greedy heuristic to find good initial solutions. These solutions, as well as the solutions later obtained through the use of the GA, go then through a repair procedure. This is used with two objectives, which are addressed in turn. Firstly, it checks the solution feasibility and if unfeasible it is fixed by removing some shows. Secondly, it tries to improve the solution by adding some extra shows. Since the problem faced by the commercial TV station is too big and has too many features it cannot be solved exactly. Therefore, in order to test the quality of the solutions provided by the proposed GA we have randomly generated some smaller problem instances. For these problems we have obtained solutions on average within 1% of the optimal solution value.
Evolutionary decision-makings for the dynamic weapon-target assignment problem
Institute of Scientific and Technical Information of China (English)
CHEN Jie; XIN Bin; PENG ZhiHong; DOU LiHua; ZHANG Juan
2009-01-01
The dynamic weapon-target assignment (DWTA) problem is an important issue In the field of military command and control.An asset-based DWTA optimization model was proposed with four kinds of constraints considered,including capability constraints,strategy constraints,resource constraints and engagement feasibility constraints.A general "virtual"representation of decisions was presented to facilitate the generation of feasible decisions.The representation is in essence the permutation of all assignment pairs.A construction procedure converts the permutations into real feasible decisions.In order to solve this problem,three evolutionary decision-making algorithms,Including a genetic algorithm and two memeitc algorithms,were developed.Experimental results show that the memetic algorithm based on greedy local search can generate obviously better DWTA decisions,especially for large-scale problems,than the genetic algorithm and the memetic algorithm based on steepest local search.
Application of k-person and k-task maximal efficiency assignment algorithm to water piping repair
Institute of Scientific and Technical Information of China (English)
Su-juan ZHENG; Xiu-ming YU; Li-qing CAO
2009-01-01
Solving the absent assignment problern of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
Ishikawa, Akio; Kishi, Yoji
2000-09-01
This paper newly proposes a self-healing architecture in all- optical WDM networks based on virtual embedded multiple rings (Virtual Multiple Self Healing Rings: VM-SHR). Focusing upon the network design aspect of the proposed architecture, this paper describes design methodologies for VM-SHR networks. For two major problems in all-optical WDM network design, that is, the connection routing and wavelength assignment problems, we first established solution models based on mathematical programming formulation, each of which can be solved by common integer programming algorithms, respectively. In addition, we also developed an efficient heuristic algorithm for the wavelength assignment problem. Their usefulness and performance are demonstrated through the extensive simulation results.
DEFF Research Database (Denmark)
Robenek, Tomáš; Umang, Nitish; Bierlaire, Michel;
2014-01-01
In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight the diffe......In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight......-shaking neighborhood search is presented. The proposed algorithms are tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithms can be successfully used to solve instances containing up to 40 vessels within reasonable computational...
International Nuclear Information System (INIS)
Rapid analysis of protein structure, interaction, and dynamics requires fast and automated assignments of 3D protein backbone triple-resonance NMR spectra. We introduce a new depth-first ordered tree search method of automated assignment, CASA, which uses hand-edited peak-pick lists of a flexible number of triple resonance experiments. The computer program was tested on 13 artificially simulated peak lists for proteins up to 723 residues, as well as on the experimental data for four proteins. Under reasonable tolerances, it generated assignments that correspond to the ones reported in the literature within a few minutes of CPU time. The program was also tested on the proteins analyzed by other methods, with both simulated and experimental peaklists, and it could generate good assignments in all relevant cases. The robustness was further tested under various situations
Equilibrium model and algorithm of urban transit assignment based on augmented network
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
The passenger flow assignment problem for the urban transit network is relatively complicated due to the complexity of the network structure and many factors influencing the passengers’ route and line choices. In the past three decades, many models have been proposed to solve the passenger flow assignment problem. However, the common-line problem remains challenging in transit flow assignment. In this paper, the characteristics of the urban transit network is analysed and a new technique of augmented network is proposed to represent the urban transit system. The purpose is to eliminate the complex common-line problem when modeling transit passenger flow assignment. Through this augmentation technique, the urban transit system can be represented by an augmented network-it then behaves like a simple network and can be used as a generalized network for traffic assignment or network analysis. This paper presents a user equilibrium model for the urban transit assignment problem based on such a technique. A numerical example is also provided to illustrate the approach.
Chao, Fa-An; Kim, Jonggul; Xia, Youlin; Milligan, Michael; Rowe, Nancy; Veglia, Gianluigi
2014-08-01
We present an enhanced version of the FLAMEnGO (Fuzzy Logic Assignment of Methyl Group) software, a structure-based method to assign methyl group resonances in large proteins. FLAMEnGO utilizes a fuzzy logic algorithm coupled with Monte Carlo sampling to obtain a probability-based assignment of the methyl group resonances. As an input, FLAMEnGO requires either the protein X-ray structure or an NMR structural ensemble including data such as methyl-methyl NOESY, paramagnetic relaxation enhancement (PRE), methine-methyl TOCSY data. Version 2.0 of this software (FLAMEnGO 2.0) has a user-friendly graphic interface and presents improved modules that enable the input of partial assignments and additional NMR restraints. We tested the performance of FLAMEnGO 2.0 on maltose binding protein (MBP) as well as the C-subunit of the cAMP-dependent protein kinase A (PKA-C). FLAMEnGO 2.0 can be used as a standalone method or to assist in the completion of partial resonance assignments and can be downloaded at www.chem.umn.edu/groups/veglia/forms/flamengo2-form.html.
Artificial Bee Colony Algorithm and Its Application to Generalized Assignment Problem
Baykaso&#;lu, Adil; Özbak&#;r, Lale; Tapkan, P&#;nar
2007-01-01
In this study a relatively new member of swarm intelligence family that is named as "artificial bee colony" is explained in detail. Actually, different names were used in the literature for the algorithms inspired from natural honey bees. Here we prefer to use the name "artificial bee colony" to reflect population characteristic of the algorithm. A very detailed literature review along with a categorization is presented in this study. All accessible previous work on bee based optimization alg...
A genetic algorithm for robust berth allocation and quay crane assignment
Rodríguez Molins, Mario; Ingolotti Hetter, Laura Paola; Barber Sanchís, Federico; Salido Gregorio, Miguel Angel; R. Sierra, María; Puente, Jorge
2014-01-01
Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial schedule obtained might be unfeasible. To overcome this issue, a proactive approach is presented for scheduling problems without any previous knowledge about the incidences that can occur. In this paper, we consider the berth allocation problem and the quay crane assignment probl...
Celandroni, Nedo; Ferro, Erina; Potort?, Francesco
1995-01-01
Most demand assignment TDMA satellite access protocols use centralised control schemes rather than distributed ones because their simplicity and robustness usually compensate for the longer allocationdelay. In this work the authors define the working details of two different distributed-control protocols, both derived from the FODA/IBEA(*) centralised control protocol, and they presentthe probabilities of disastrous events and the re levantrecovery procedures, whose handling is central to the...
Multiple People Picking Assignment and Routing Optimization Based on Genetic Algorithm
Institute of Scientific and Technical Information of China (English)
孙慧
2014-01-01
In order to improve the picking efficiency, reduce the picking time, this paper take artificial picking operation of a certain distribution center which has double-area warehouse as the studying object. Discuss the picking task allocation and routing problems. Establish the TSP model of order-picking system. Create a heuristic algorithm bases on the Genetic Algorithm (GA) which help to solve the task allocating problem and to get the associated order-picking routes. And achieve the simulation experiment with the Visual 6.0C++platform to prove the rationality of the model and the effectiveness of the arithmetic.
Belief propagation : an asymptotically optimal algorithm for the random assignment problem
Salez, Justin; Shah, Devavrat
2009-01-01
The random assignment problem asks for the minimum-cost perfect matching in the complete $n\\times n$ bipartite graph $\\Knn$ with i.i.d. edge weights, say uniform on $[0,1]$. In a remarkable work by Aldous (2001), the optimal cost was shown to converge to $\\zeta(2)$ as $n\\to\\infty$, as conjectured by M\\'ezard and Parisi (1987) through the so-called cavity method. The latter also suggested a non-rigorous decentralized strategy for finding the optimum, which turned out to be an instance of the B...
Directory of Open Access Journals (Sweden)
Abd El–Naser A. Mohammed
2013-02-01
Full Text Available In simple wavelength-division multiplexed (WDM networks, a connection must be established along a route using a common wavelength on all of the links along the route. The introduction of wavelength converters into WDM cross connects increases the hardware cost and complexity. Given a set of connection requests, the routing and wavelength assignment problem involves finding a route (routing and assigning a wavelength to each request. This paper has presented the WDM technology is being extensively deployed on point to point links within transport networks in the EGYPT. However, WDM promises advantages for switching and routing as well as for transmission. Optical cross connects are currently being developed which can switch an entire wavelength from an input fiber to an output fiber so that large bandwidth circuits can be routed through the network according to wavelength. High speed, fixed bandwidth, end to end connections called lightpaths can then be established between different nodes. Our suggested Trans-Egypt Network (TEGYNET which uses optical cross connects to route lightpaths through the network are referred to as wavelength routing networks. The average setup time, average link utilization, traffic load, blocking probability, and achievable link utilization in the presence of both single path and multi math routing are the major interesting parameters in the design of TEGYNET topology.
Ansari, Elnaz Saberi; Eslahchi, Changiz; Pezeshk, Hamid; Sadeghi, Mehdi
2014-09-01
Decomposition of structural domains is an essential task in classifying protein structures, predicting protein function, and many other proteomics problems. As the number of known protein structures in PDB grows exponentially, the need for accurate automatic domain decomposition methods becomes more essential. In this article, we introduce a bottom-up algorithm for assigning protein domains using a graph theoretical approach. This algorithm is based on a center-based clustering approach. For constructing initial clusters, members of an independent dominating set for the graph representation of a protein are considered as the centers. A distance matrix is then defined for these clusters. To obtain final domains, these clusters are merged using the compactness principle of domains and a method similar to the neighbor-joining algorithm considering some thresholds. The thresholds are computed using a training set consisting of 50 protein chains. The algorithm is implemented using C++ language and is named ProDomAs. To assess the performance of ProDomAs, its results are compared with seven automatic methods, against five publicly available benchmarks. The results show that ProDomAs outperforms other methods applied on the mentioned benchmarks. The performance of ProDomAs is also evaluated against 6342 chains obtained from ASTRAL SCOP 1.71. ProDomAs is freely available at http://www.bioinf.cs.ipm.ir/software/prodomas. PMID:24596179
Directory of Open Access Journals (Sweden)
Min Jin
2014-01-01
Full Text Available There is recently a great deal of interest and excitement in understanding the role of inertia and acceleration in the motion equation of discrete particle swarm optimization (DPSO algorithms. It still remains unknown whether the inertia section should be abandoned and how to select the appropriate acceleration in order for DPSO to show the best convergence performance. Adopting channel assignment as a case study, this paper systematically conducts experimental filtering research on this issue. Compared with other channel assignment schemes, the proposed scheme and the selection of inertia and acceleration are verified to have the advantage to channel assignment in three respects of convergence rate, convergence speed, and the independency of the quality of initial solution. Furthermore, the experimental result implies that DSPO might have the best convergence performance when its motion equation includes an inertia section in a less medium weight, a bigger acceleration coefficient for global-search optimum, and a smaller acceleration coefficient for individual-search optimum.
Institute of Scientific and Technical Information of China (English)
Deng Qibo; Yu Jianqiao; Wang Ningfei
2013-01-01
The task assignment problem of multiple heterogeneous unmanned aerial vehicles (UAVs), concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources (e.g., weapons) onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo-somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.
Asset-Based Assessment in Educational Psychology: Capturing Perceptions during a Paradigm Shift
Lubbe, Carien; Eloff, Irma
2004-01-01
Several trends are compelling educational psychologists towards a philosophy of assessment that is asset-based and strength focused. This article shares the results from a study that explored perceptions about asset-based assessment in Educational Psychology in South Africa. Three focus groups were held and four main themes emerged from the…
Channel Assignment and Performance Evaluation of AODV Algorithm in Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Shreenidhi P. L.
2014-03-01
Full Text Available Adhoc Networks are those Networks which does not require complex configuration. Wireless mesh Networks are also a part of Adhoc Networks. Wireless Mesh Networks have capacity to support Internet Access at fewer expenses for mobile and as well as Stationary Networks. It involves multihopping techniques which involves routers in Wireless Mesh Networks. The main advantage here the geographical area can be increased without any disturbances in the existing Network. In this paper, we propose a Channel Assignment Method which reduces the congestion mechanism and tried to remove all the disadvantages in the earlier mechanism. With this concept, the main focus is given on reducing the packet drop when the network size is increased and maintain the same QoS parameters. As a result when the network size increases the same performances is expected and in turn covering more geographical areas.
García Molina, Pablo; Balaguer López, Evelin
2009-04-01
Bed sores among children are an adverse effect provoked by the application of new technology adapted to pediatrics. Special surfaces for managing pressure in pediatrics are a preventive measure effective to avoid the development of these lesions. So that children benefit from this preventive measure, it must be adapted to their specific circumstances. In order for this to occur, it is fundamental to know: the specific characteristics which differentiate children from adults, and the type of special surfaces for managing pressure in pediatrics which are available on the market and to evaluate their appropriateness and effectiveness. The Group of Nurses to Improve Quality in Pediatrics at the University Clinical Hospital in Valencia has developed some tools which make it possible to manage and assign different sizes and types of special surfaces for managing pressure in pediatrics by means of a scientific method (Tarise). These are based on anthropometric measurements (Pediatric Space table) for each age range, the risk to develop a bed sore or skin ulcer due to pressure, the presence of a bed sore, the pathological seriousness and the type of special surfaces for managing pressure in pediatrics. PMID:19554896
Successful Community Midwives in Pakistan: An Asset-Based Approach.
Mumtaz, Zubia; Levay, Adrienne V; Bhatti, Afshan
2015-01-01
In response to the low levels of skilled birth attendance in rural Pakistan, the government introduced a new cadre of community midwives (CMWs) in 2006. Assessments to-date have found that these CMWs have yet to emerge as significant providers for a number of sociocultural, geographic and financial reasons. However, a small number of CMWs have managed to establish functional practices in the private sector in conservative, infrastructure-challenged rural contexts. With an objective to highlight "what are the successful CMWs doing right given their context?" this paper adopts an asset-based approach to explore the experiences of the Pakistani CMWs who have managed to overcome the barriers and practice. We drew upon ethnographic data that was collected as part of a larger mixed methods study conducted in 2011-2012 in districts Jhelum and Layyah, Pakistan. Thirty eight CMWs, 45 other health care providers, 20 policymakers, 78 women, 35 husbands and 23 older women were interviewed. CMW clinics and practices were observed. Our data showed that only eight 8 out of 38 CMWs sampled were active providers. Poverty as a push factor to work and intrinsic individual-level characteristics that enabled the CMWs to respond successfully to the demands of the midwifery profession in the private sector emerged as the two key themes. Household poverty pushed the CMWs to work in this perceived low-status occupation. Their families supported them since they became the breadwinners. The successful CMWs also had an intrinsic sense of what was required to establish a private practice; they exhibited professionalism, had strong business sense and provided respectful maternity care. The study provides insight into how the program might improve its functioning by adapting its recruitment criteria to ensure selection of right candidates.
Successful Community Midwives in Pakistan: An Asset-Based Approach.
Directory of Open Access Journals (Sweden)
Zubia Mumtaz
Full Text Available In response to the low levels of skilled birth attendance in rural Pakistan, the government introduced a new cadre of community midwives (CMWs in 2006. Assessments to-date have found that these CMWs have yet to emerge as significant providers for a number of sociocultural, geographic and financial reasons. However, a small number of CMWs have managed to establish functional practices in the private sector in conservative, infrastructure-challenged rural contexts. With an objective to highlight "what are the successful CMWs doing right given their context?" this paper adopts an asset-based approach to explore the experiences of the Pakistani CMWs who have managed to overcome the barriers and practice. We drew upon ethnographic data that was collected as part of a larger mixed methods study conducted in 2011-2012 in districts Jhelum and Layyah, Pakistan. Thirty eight CMWs, 45 other health care providers, 20 policymakers, 78 women, 35 husbands and 23 older women were interviewed. CMW clinics and practices were observed. Our data showed that only eight 8 out of 38 CMWs sampled were active providers. Poverty as a push factor to work and intrinsic individual-level characteristics that enabled the CMWs to respond successfully to the demands of the midwifery profession in the private sector emerged as the two key themes. Household poverty pushed the CMWs to work in this perceived low-status occupation. Their families supported them since they became the breadwinners. The successful CMWs also had an intrinsic sense of what was required to establish a private practice; they exhibited professionalism, had strong business sense and provided respectful maternity care. The study provides insight into how the program might improve its functioning by adapting its recruitment criteria to ensure selection of right candidates.
Sarjaš, Andrej; Chowdhury, Amor; Svečko, Rajko
2016-09-01
This paper presents the synthesis of an optimal robust controller design using the polynomial pole placement technique and multi-criteria optimisation procedure via an evolutionary computation algorithm - differential evolution. The main idea of the design is to provide a reliable fixed-order robust controller structure and an efficient closed-loop performance with a preselected nominally characteristic polynomial. The multi-criteria objective functions have quasi-convex properties that significantly improve convergence and the regularity of the optimal/sub-optimal solution. The fundamental aim of the proposed design is to optimise those quasi-convex functions with fixed closed-loop characteristic polynomials, the properties of which are unrelated and hard to present within formal algebraic frameworks. The objective functions are derived from different closed-loop criteria, such as robustness with metric ?∞, time performance indexes, controller structures, stability properties, etc. Finally, the design results from the example verify the efficiency of the controller design and also indicate broader possibilities for different optimisation criteria and control structures.
Performance Analysis of IMS Network: the Proposal of new Algorithms for S-CSCF Assignment
Directory of Open Access Journals (Sweden)
Lubos Nagy
2013-01-01
Full Text Available This article is focused on the proposal of three load balancing methods which can be used for a selection of S-CSCF (Serving-Call Session Control Server server in IP Multimedia Subsystem (IMS during the registration procedures of subscribers. All presented methods are implemented and evaluated for various inter-arrival and service times in the mathematical model based on queueing theory. In this article, two methods based on performance parameters (such as utilizations, etc. and one method based on number of registered subscribers to each of available S-CSCF server are described. The main advantage of third method is that all related information is obtained from traffic analysis through I-CSCF (Interrogating-CSCF node. Also, the designed methods are compared with other selection algorithms presented in previous research works by others researchers (Hwang et col., Cho et col. or Tirana et col.. The article shows that the implemented methods can optimize the service latency of whole IMS network.
Community-based advocacy training: applying asset-based community development in resident education.
Hufford, Laura; West, Daniel C; Paterniti, Debora A; Pan, Richard J
2009-06-01
Communities and Physicians Together (CPT) at University of California, Davis Health System provides a novel approach to teaching residents to be effective community advocates. Founded in 1999, CPT is a partnership between a pediatric residency program, five community collaboratives located in diverse neighborhoods, and a grassroots child advocacy organization. Using the principles of Asset-Based Community Development, the program emphasizes establishing partnerships with community members and organizations to improve child health and identifies community assets and building capacity. Community members function as the primary faculty for CPT.The authors describe the CPT curriculum, which teaches residents to build partnerships with their assigned community. Residents have three, two-week blocks each year for CPT activities and maintain a longitudinal relationship with their community. In the first year, collaborative coordinators from each community orient residents to their community. Residents identify community assets and perform activities designed to provide them with a community member's perspective. In the second and third years, residents partner with community members and organizations to implement a project to improve the health of children in that community. CPT also provides faculty development to community partners including a workshop on medical culture and resident life. A qualitative evaluation demonstrated residents' attitudes of their role as pediatricians in the community changed with CPT.CPT is unique because it provides a model of service learning that emphasizes identifying and utilizing strengths and building capacity. This approach differs from the traditional medical model, which emphasizes deficits and needs. PMID:19474556
Intersecting Asset-Based Service, Strengths, and Mentoring for Socially Responsible Leadership.
Hastings, Lindsay
2016-06-01
Grounded in a youth leadership and mentoring program, this chapter discusses the value of asset-based community development from the service-learning literature and the concept of generativity from the leadership development literature. PMID:27150907
von Maltzahn, Robyn; Durrheim, Kevin
2008-01-01
This paper contests the major emphasis placed on the multidimensional nature of poverty measurement. Instead, it argues that poverty pictures created by different measures and at different units of analysis tend to converge. This argument is derived from a comparison of poverty pictures created using income and asset-based measures at the national…
改进蚁群算法在二次分配问题中的应用%Application of Improved Ant Colony Algorithm for Quadratic Assignment Problems
Institute of Scientific and Technical Information of China (English)
袁东锋; 吕聪颖
2013-01-01
为了解决基本蚁群算法在求解大规模二次分配问题时暴露出的缺陷,本文提出一种改进的蚁群算法.在基本蚂蚁算法中,采用全局信息素更新策略,使用距离及流量作为启发式信息并引入局部优化策略,对每代的最优解进行改进,进一步加快算法的收敛速度.通过对于二次分配问题的3种不同类型的问题进行实验,将改进的蚁群算法与基本蚂蚁算法及混合遗传算法进行比较,结果表明该改进算法具有更优的性能.%In order to solve the problems that the basic ant colony algorithm for solving large scale quadratic assignment has revealed defects, this paper proposes an improved ant colony algorithm. This algorithm adopts the global pheromone update strategy, the use of distance and traffic as heuristic information and the introduction of local optimization strategy. The optimal solution for each generation is to improve and further accelerate the convergence speed. For the quadratic assignment problem through three different types of problems, and improved ant colony algorithm with the basic ant algorithm and the hybrid genetic algorithm are compared, the experiments show that the improved method has better performance.
Karapetyan, Daniel
2010-01-01
Memetic Algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm one needs to make a host of decisions; selecting a population size is one of the most important among them. Most algorithms in the literature fix the population size to a certain constant value. This reduces the algorithm's quality since the optimal population size varies for different instances, local search procedures and running times. In this paper we propose an adjustable population size. It is calculated as a function of the running time of the whole algorithm and the average running time of the local search for the given instance. Note that in many applications the running time of a heuristic should be limited and therefore we use this limit as a parameter of the algorithm. The average running time of the local search procedure is obtained during the algorithm's run. Some coefficients which are independent with respect to the instance or the local search are to be tuned before th...
Institute of Scientific and Technical Information of China (English)
何建华; 王安龙; 陈松; 张越; 刘琨; 赵焕义
2014-01-01
为解决多机协同任务分配这一多约束组合优化问题，提出了一种基于矩阵二进制编码的改进多目标混合蛙跳算法（ multi-objective shuffled frog-leaping algorithm， MOSFLA）的任务分配策略。首先，建立了基于目标剩余价值、战机攻击损耗和航程代价的多目标优化模型；然后，对混合蛙跳算法的位置更新策略进行了改进，以保证更新过程中解的可行性及算法的全局收敛能力；最后，利用改进算法求解多机协同对地攻击任务分配问题，得出问题的Pareto最优解集。仿真实验表明，改进算法能够在较短时间内同时得出多个分配方案，增加决策的灵活性。%The multi-fighter cooperative task assignment problem is a multi-constrained combinatorial optimization problem. In order to solve this problem, a multi-objective shuffled frog-leaping algorithm ( MOSFLA) based on ma-trix binary encoding is proposed. First of all, it establishes a multi-objective optimization model of task assignment by using the target residual value, the damages of fighters and the voyage costs. Then to ensure the feasibility of so-lutions produced in the update process and to ensure the global convergence capability of the improved algorithm, it improves the individual position update strategy of shuffled frog-leaping algorithm. Finally, it uses the improved al-gorithm to obtain the Pareto optimal solutions in air-to-ground attack mission assignment problem. Simulation results and their analysis show preliminarily that the improved algorithm can come in a variety of task assignment alterna-tives in a short time simultaneously, thus increasing the flexibility of the decision.
改进的人工蜂群算法求解任务指派问题%Improved Artificial Bee Colony Algorithm for Assignment Problem
Institute of Scientific and Technical Information of China (English)
孙晓雅; 林焰
2012-01-01
针对指派问题提出了一种改进的人工蜂群算法.该算法充分考虑到指派问题解的离散性特点,给出了食物源位置的离散编码方法,并且采用邻域移动法生成候选食物源,这一方法既保证了解的可行性,又增加了食物源的多样性.实算表明在求解指派问题时,该算法比原人工蜂群算法在求解精度和收敛速度上都有显著地提高,两性能也优于其他粒子群算法.这种改进的离散人工蜂群算法简洁,应用方便,不但是一种有效求解指派问题的新算法,同时也为其他组合优化问题求解提供了一种有益思路.%An improved artificial bee colony（IABC） optimization algorithm is presented for assignment problem.In consideration of the solution＇s discreteness,this algorithm gives a discrete coding method for the food source position.The algorithm adopts neighborhood shift to produce a candidate food position,which can ensure the solution feasible and increase the diversity of food sources.The actual calculation shows that the IABC algorithm can accelerate the convergence process obviously and improve the precision compared with the original artificial bee colony（ABC） algorithm,and this method is also superior to other particle swarm optimization（PSO） algorithms.The principle of this algorithm is simple and its application is flexible and easy.It is a new algorithm for assignment problem and it presents a new vision for other combinatorial optimization problems.
Energy Technology Data Exchange (ETDEWEB)
Riihimaki, Laura D.; Comstock, Jennifer M.; Anderson, K. K.; Holmes, Aimee E.; Luke, Edward
2016-06-10
Knowledge of cloud phase (liquid, ice, mixed, etc) is necessary to describe the radiative impact of clouds and their lifetimes, but is a property that is difficult to simulate correctly in climate models. One step towards improving those simulations is to make observations of cloud phase with sufficient accuracy to help constrain model representations of cloud processes. A variety of methods, based primarily on decision tree approaches, have been used to identify cloud phase from active remote sensors. These algorithms do not include uncertainty estimates, which contributes an unknown amount of uncertainty to the retrieval of cloud microphysical properties and to model parameterization development and evaluation. In this study, we outline a methodology using a Bayesian classifier to estimate the probabilities of cloud phase class from Atmospheric Radiation Measurement (ARM) vertically pointing active remote sensors. We also test the value of including higher moments of the cloud radar Doppler spectrum than are traditionally used operationally. Using training data of known phase from the Mixed-Phase Arctic Cloud Experiment (M-PACE) field campaign, we demonstrate a proof of concept for how the algorithm can be trained and run as an operational cloud phase retrieval. Over 95% of data is identified correctly for pure ice and liquid cases used in this study. Mixed-phase and snow cases are more problematic to identify correctly. When lidar data are not available, including additional information from the Doppler spectrum provides substantial improvement to the algorithm.
State feedback eigenstructure assignment algorithm in direct force control%直接力控制的特征结构配置法
Institute of Scientific and Technical Information of China (English)
朱战霞; 王建培
2001-01-01
以现代控制理论和飞行力学原理为基础，针对直接力控制器设计中存在的模态耦合问题，提出一种应用状态反馈特征结构配置进行解耦的方法，并推导出相应的公式。分析表明，用此方法对系统的极点和特征向量可以进行希望的配置，并能达到设计要求。同时仿真结果说明，用状态反馈特征结构配置法设计的控制系统比用线性二次型调节器（LQR）方法设计的控制系统解耦性能好，响应速度快，并且解决了输出反馈特征结构配置不能确保闭环系统稳定的问题。%In order to solve the problem of the mode-coupling in direct force controller design, an algorithm-state feedback eigenstructure assignment, which is on the bases of flight dynamics and modern control theory, is proposed in this paper. Corresponding formulas are derived. Analysis show that this method can be used to assigned the poles and eigenvectors to the desired places to satisfy the requirement of the design. The simulation results prove that by using this method the decoupling performance of the designed controllers is better than that of LQR, and the problem that the stability of the closed-loop system can't be guaranteed when using output feedback eigenstructure assignment algorithm is also be solved.
Bacterial foraging algorithm for quadratic assignment problems%细菌觅食算法求解二次分配问题
Institute of Scientific and Technical Information of China (English)
戴秋萍; 马良; 郗莹
2013-01-01
To solve the quadratic assignment problems efficiently,a new intelligent optimization algorithm based on group searching strategy is proposed called bacterial foraging optimization algorithm (BFO).The bacteria feeding process is simulated,and the information of the bacterial individual is combined the bacterial group.It's efficiently to avoid the local optimization by adopting the new strategy,and the adaptive search step length improves the optimization of the convergence speed.Compared to other algorithms indicate that this algorithm is better than the other algorithm in quality of optimization.%为有效解决二次分配问题,提出了一种基于群体搜索的群智能优化算法—细菌觅食算法.算法模拟了细菌觅食全过程,并将细菌个体信息与探索细菌群体信息进行结合,采用了群体搜索策略进行局部寻优.该策略有效的避免了算法陷入局部最优,而算法中采用的自适应搜索步长,进一步提高了优化的收敛速度.实验结果表明,用细菌觅食算法解决二次分配问题,并将仿真结果与其他算法进行比较,表明了该算法的搜索质量优于其他算法.
Cuckoo Search Algorithm for Quadratic Assignment Problem%二次分配问题的布谷鸟搜索算法
Institute of Scientific and Technical Information of China (English)
许秋艳
2015-01-01
二次分配问题是一种典型的组合优化难题。该问题由于目标函数的非线性而使得问题的求解异常复杂。为求解二次分配问题，设计基于布谷鸟搜索算法的优化方法。布谷鸟搜索算法是一种新型现代启发式算法，具有结构简单和易于编程等特点。针对二次分配问题的特点，给出算法的实现流程。实验结果表明该算法的可行性和有效性。%Quadratic Assignment Problem (QAP) is a typical hard problem in combinatorial optimization. It is hard to solve QAP because of its non-linear objective function. To solve QAP, proposes a method based on Cuckoo Search Algorithm (CSA). CSA is a novel metaheuristic which is simple and easy to program. According the features of QAP, shows the algorithm procedure. The results demonstrate that the presented method is feasible and effective.
A multidimensional assignment data association algorithm based on DNA computing%基于DNA计算的多维分配数据关联算法
Institute of Scientific and Technical Information of China (English)
梁冰; 冯林
2012-01-01
The DNA computing was applied to investigation of the data association, a NP-hard mathematical problem in multitarget tracking, and a multidimensional assignment data association algorithm was realized through utilizing the super parallelism of DNA computation.The algorithm uses the DNA molecular chains containing the palindromic sequence of the restriction endonuclease Haelll to encode the observed sight lines.All target association combinations are obtained through the operation of connection and annealing.In order to select the optimal multidimensional data association solution, the techniques of DNA hairpin structure detection and gel electrophoresis are used to remove the target association combinations that do not satisfy the constraints.The results of the theoretic analysis show that the DNA computation based multidimensional assignment data association algorithm needs the DNA molecular chain number of O(nk!/(c - m)!) (the space complexity), and decreases the time complexity from exponential to 0 ( mn) , where n and m are the sensor number and target number respectively, k is the target localization number.%针对多目标跟踪中的多维分配数据关联这-NP难题,将DNA计算用于数据关联研究,利用DNA分子链生化反应的高度并行性,实现了基于DNA计算的多维分配数据关联算法.该算法利用包含限制性内切酶HaeⅢ回文序列的DNA分子链对观测视线进行编码,通过连接和退火操作获得所有目标关联组合,然后利用检测DNA发夹结构和凝胶电泳技术排除不满足约束条件的目标关联组合,筛选出多维分配数据关联的最优解.分析结果表明:基于DNA计算的多维分配数据关联算法所需的DNA分子链数即空间复杂度为O(nk!/(c-m)!),将多维分配问题的指数级复杂度降低到多项式复杂度O(mn),其中n为传感器数,m为目标数,k为目标定位点数.
Random Cell Identifiers Assignment
Directory of Open Access Journals (Sweden)
Robert Bestak
2012-01-01
Full Text Available Despite integration of advanced functions that enable Femto Access Points (FAPs to be deployed in a plug-and-play manner, the femtocell concept still cause several opened issues to be resolved. One of them represents an assignment of Physical Cell Identifiers (PCIs to FAPs. This paper analyses a random based assignment algorithm in LTE systems operating in diverse femtocell scenarios. The performance of the algorithm is evaluated by comparing the number of confusions for various femtocell densities, PCI ranges and knowledge of vicinity. Simulation results show that better knowledge of vicinity can significantly reduce the number of confusions events.
Target Optimal Assignment of Multi-Reconnaissance Sensor by Generic Algorithm%应用GA的多侦察传感器目标最优分配
Institute of Scientific and Technical Information of China (English)
周磊; 朱峰; 刘明辉
2012-01-01
Pros and cons on target assignment of multi - reconnaissance sensor training mission directly affect training effect. By analyzing the quantity and category of sensor and target, confirming the objective function,building the rational simulation programming model, and taking generic algorithm as search method, the best reconnaissance efficacy Plan of Target Assignment can be found out rapidly and effectively, which affordes beneficial help to training under best reconnaissance efficiency, and shortens the mission period and economizes the resource.%研究优化侦察效果问题,多侦察传感器训练演练任务中的侦察目标分配优劣直接影响着训练演练效果.为了提高侦察效能,通过分析传感器和目标的类别及数量,建立明确的目标函数,组成合理的仿真规划模型,采用遗传算法作为搜索最优方法,克服了传统算法缺点,能够快速而且有效地找出最大侦察效能下的目标分配方案.仿真结果表明,改进的方法为多传感器最佳侦察效果的相应训练演练提供了有益的帮助,节省了任务周期,降低了资源消耗.
Institute of Scientific and Technical Information of China (English)
刘传波
2012-01-01
考虑时间和空间的影响,动态武器目标分配是一个复杂的问题。针对时间和空间对武器目标分配过程的约束,建立了动态武器目标分配数学模型;提出了一种Memetic算法来解该问题,采用遗传算法作为全局搜索策略,模拟退火算法作为局部搜索策略,根据Any-time算法的特性,设置了一种有限时间元级控制策略来响应分配动态过程。最后,通过仿真实例,验证了该算法的有效性和实用性。%Consider the influence of time and space,dynamic weapon target assignment(DWTA) problem is a complex problem.First of all,the time restriction and space restriction for assignment are analyzed,and an assignment mathematic model is established.Secondly,a kind of Memetic algorithm is proposed to solve this problem.This algorithm adopts genetic algorithm as the global search tactic,and simulated annealing algorithm as the local search tactic.Meanwhile,a time control strategy is used to control the algorithm outputting a satisfying result in regulated time.At last,some simulated results testify this algorithm's feasibility and effectivity for dynamic assignment issues.
Balanced input-output assignment
Gawronski, W.; Hadaegh, F. Y.
1989-01-01
Actuator/sensor locations and balanced representations of linear systems are considered for a given set of controllability and observability grammians. The case of equally controlled and observed states is given special attention. The assignability of grammians is examined, and the conditions for their existence are presented, along with several algorithms for their determination. Although an arbitrary positive semidefinite matrix is not always assignable, the identity grammian is shown to be always assignable. The results are extended to the case of flexible structures.
Institute of Scientific and Technical Information of China (English)
宋业新; 陈绵云; 张曙红
2001-01-01
Two multi-object generalized assignment problems (MOGAP) are discussed and their multi-object integer linear programming models are presented respectively. By combining the fuzzy theory with Hungary algorithm applied to solving the conventional assignment problem, Fuzzy Hungary Algorithm for solving the MOGAP is proposed. The application in the ordnance material supply illustrates the method.%讨论了两类多目标广义指派问题，给出了它们的多目标整数线性规划数学模型，并结合模糊理论与解决传统指派问题的匈牙利算法提出了一种新的求解算法——模糊匈牙利法.给出了该方法在物资供应中的应用.
Institute of Scientific and Technical Information of China (English)
麻士东; 龚光红; 韩亮; 宋晓
2011-01-01
In the process of air-to-ground attacking by helicopter formations, target assignment plays an important role in completing military tasks. The integrated interest function and the principle of helicopter target assignment are made. Target assignment in helicopter formation' s air-to-ground attacking is realized by using hybrid strategy with ant colony algorithm and simulated annealing algorithm. Aimed at the defect because of deciding current best solution by integrated interest function, the hybrid strategy are improved, that is, to decide current best solution by amount of pheromone. So the best solution can be determined both by integrated interest function and amount of pheromone, and bad individual interests and slow convergence will be avoided in order to get maximal interests in process of assignment. A test is given to validate the improved hybrid algorithm, and the results indicate that the improved algorithm has a better performance in finding optimal solution and more quick convergence than before, and has a more reasonable assignment results.%直升机编队的对地攻击过程中,目标分配是实现作战任务的重要条件.确定了直升机目标分配的优势度计算方法以及目标分配的原则.利用蚁群-模拟退火算法实现了直升机对地攻击的目标分配过程,并针对分配过程中,采用综合优势度最大来确定最优路径所出现的不足对算法进行了改进,即根据信息素的积累量来确定最优路径,能够综合考虑信息素浓度与优势度的影响,避免了为达到全局最大优势度而出现的个体分配效益不好以及收敛缓慢的情况.实验结果表明,改进的算法效率更高,收敛的速度较之前更快,分配结果更趋合理.
Institute of Scientific and Technical Information of China (English)
俞礼军; 严宝杰
2001-01-01
The relation between two types of traffic assignment model(four models) is discussed. It is discovered that capacity restraint traffic assignment's algorithm can be transformed into UE model's algorithm by adding one mold. The research is useful for programming software based on UE model in traffic planning. Furthermore, classifying problem of all-or-nothing traffic assignment model is analyzed. The results can be used in engineering.%针对两类(4个)交通分配模型及其关系，以及“全有全无”交通分配模型归类问题进行了研究，通过对比研究发现，仅需在目前常用的基于容限交通分配模型的算法中加入一个模块即可实现一种用户平衡模型的结果，为编写一类用户平衡的软件提供了捷径，对理论与实践也有一定的指导价值。
Institute of Scientific and Technical Information of China (English)
程硕; 张毕西; 曹铭; 胡盛强
2015-01-01
为中小制造型企业生产模式下的"虚拟工序库"作业系统中的工人指派制定合理的方案,以生产成本最小化为目标,构建满足订单交货期的工人指派模型,采用种群的精英保留的遗传算法对此问题进行优化,并通过实例仿真验证了该方法增强了全局的寻优能力,提高全局的收敛速度,研究表明该方法对解决工人指派问题是行之有效的.%:In order to obtain a reasonable worker-assignment plan for small and medium-sized manufac-turing enterprises under"virtual process database" ( VPDs) operating system, and to minimize production cost, a worker-assignment model is constructed, through using the improved genetic algorithm of elitism preservation, optimizing the workers′assignment and scheduling in VPDs.Repeated simulation experi-ments and comparison show that the improved genetic algorithm has the faster speed of convergence, which indicates that it is effective.
移动 Ad Hoc 网络安全分配地址算法%Algorithm of Security Assigning Addresses for Mobile Ad Hoc Networks
Institute of Scientific and Technical Information of China (English)
吴岳
2013-01-01
通过分析现有自动地址分配算法中存在的安全隐患，采用目前通用的加密算法，提出一种安全的网络地址自动分配算法。无论是移动网络还是传统网络，采用该算法进行自动分配地址，被攻击的概率是非常低的。%Through analysis of the security risks existing in automatic address allocation algorithm , using common encryption algo-rithms currently , this paper presents a secure network address auto allocation algorithm .Both the mobile network and traditional networks , using the algorithm for automatic address allocation , the probabilities of being attacked are very low .
International Nuclear Information System (INIS)
Energy surfaces of metal clusters usually show a large variety of local minima. For homo-metallic species the energetically lowest can be found reliably with genetic algorithms, in combination with density functional theory without system-specific parameters. For mixed-metallic clusters this is much more difficult, as for a given arrangement of nuclei one has to find additionally the best of many possibilities of assigning different metal types to the individual positions. In the framework of electronic structure methods this second issue is treatable at comparably low cost at least for elements with similar atomic number by means of first-order perturbation theory, as shown previously [F. Weigend, C. Schrodt, and R. Ahlrichs, J. Chem. Phys. 121, 10380 (2004)]. In the present contribution the extension of a genetic algorithm with the re-assignment of atom types to atom sites is proposed and tested for the search of the global minima of PtHf12 and [LaPb7Bi7]4−. For both cases the (putative) global minimum is reliably found with the extended technique, which is not the case for the “pure” genetic algorithm
Institute of Scientific and Technical Information of China (English)
何凡; 任向东; 吴桐
2015-01-01
Genetic algorithm is based on its excellent optimization ability,it is widely used in engineering optimization problem solving after proposed. Based on the actual needs of power grid attack unmanned aerial vehicle squads tasks assignment,solution based on genetic algorithm is proposed,and on the basis of the original algorithm,the population group evolution strategy is used to improve. The basic principle of algorithm and simulation steps in detail and practical examples are given to the simulation,the experimental results prove the algorithm improvement has obtained the good effect.%遗传算法因其出色的寻优能力，自提出后就被广泛用于工程技术上的最优化问题求解。根据电力网攻击无人机分队任务分配的实际需要，提出基于遗传算法思想的解决方案，并在原算法基础上，采用种群分组进化的策略进行改进。详细介绍算法的基本原理和仿真步骤，再举出实际算例进行仿真，实验结果证明算法的改进取得了良好效果。
Institute of Scientific and Technical Information of China (English)
杨山亮; 黄健; 刘洋; 鞠儒生
2012-01-01
The assignment problem in joint fire strike is researched. Joint fire strike is a confrontment between multi-weapons and multi-targets involving various forces. The assignment affects the result significantly under a variety of conditions. Weapon-target assignment problem researches how to resist enemies based on the campaign units e-quipped with the same weapons. Considering the character of large scale and high precision in solving the WTA problem which can not be met by traditional algorithms, a Genetic Algorithm was put forward based on elite-selecting mechanism and dynamic inherited operator. This paper utilized the mathematical model of WTA to simulate, and the computational results demonstrate that it can get a satisfactory solution.%研究联合火力优化分配问题.联合火力是多种作战力量参战条件下的多武器-多目标对抗.由于火力分配受到多种条件的限制,分配方案又决定作战效果,而武器-目标分配(Weapon Target Assignment,WTA)是多个装备同类型武器的作战单元联合抗击多个目标进行的分配方法.针对WTA问题求解规模大和精度高的特点,传统算法均不能满足速度和精度的要求,在基本遗传算法的基础上,采用精英选择和动态遗传算子的改进算法,避免了过早收敛.利用WTA的数学模型进行仿真.仿真结果验证了算法的有效性.
基于航班机型分配的机队规划启发式算法%Heurist algorithm of fleet planning based on airline fleet assignment
Institute of Scientific and Technical Information of China (English)
汪瑜; 孙宏
2011-01-01
Traditional fleet planning methods could not accurately reflect airlines' operation environment.In order to solve this problem, based on airline fleet assignment technique, this research constructed a new fleet planning algorithm. The basic idea was given candidate aircraft types and airline's production and operation environment, which contained route network, flight schedule, traffic demand and mean fare level, this algorithm used fleet assignment technique to optimize airline fleet composition. Firstly, the flight fleet assignment was described as a network flow model in time sequence network. Secondly, the algorithm regarded the minimum "flight pairings-aircraft type assignment" cost as objective function, there and there only one competitive aircraft type in the fleet and lowest numbers of selected aircraft types were taken as constraints. Finally, the simulated annealing algorithm was set up. Simulation shows that for problem which scale is 13 fiight pairings and 7 candidate aircraft types, the average calculating time is 5.42 seconds,results are stable and feasible.%为了解决传统机队规划方法无法准确反映航空公司运营环境的问题,从航班机型分配的角度为航空公司设计机队规划算法,其基本思想是:给定候选机型以及航空公司生产运营环境(航线网络、航班计划、航班订座需求和平均票价水平),利用航班机型分配寻找最优的机队配置方案.将航班机型分配描述为时序网络图中的网络流问题,以"航班节-航班机型分配"成本最小为目标函数,机队中有且仅有一种竞争机型,被选用机型最低飞机数为约束条件设计模拟退火算法.仿真结果表明:对规模为13个航班节,7种候选机型的问题,算法平均运算时间为5.42秒,结果稳定且高效可行.
Institute of Scientific and Technical Information of China (English)
高尚
2012-01-01
An optimization model of the weapon-target assignment problem (WTA) is given. The similarities and differences of the distribution algorithm and the genetic algorithm are analyzed. The estimation distribution algorithm (EDA) is applied to solve the weapon-target assignment problem. In the EDA, through the statistics of the information of selected individuals in the current group, the probability of the individual distribution in next generation is given and the next generation of group is formed by random sampling. The influence of several parameter design strategies such as population and selection proportion is analyzed. It is concluded that the algorithm with a moderate population and a moderate selection proportion can efficiently find the converged solution among those algorithms. Simulation results show that the EDA is reliable and effective for solving the weapon-target assignment problem. This method has good scalability, and it can be modified to solve general combinatorial optimization problems.%建立了武器-目标分配问题的优化模型,分析了分布估计算法与遗传算法的异同.将分布估计算法应用于武器-目标分配问题,该算法通过统计当前群体中优选出的个体信息,给出下一代个体的概率估计,用随机取样的方法生成下一代群体.分析了个体种群数量、选择比例等参数对算法的影响,得出个体种群数量和选择比例取适中时效果最好的结论.仿真结果表明了分布估计算法求解武器-目标分配问题是可靠有效的.此方法具有较好的可扩展性,修改此算法可解决一般组合优化问题.
Institute of Scientific and Technical Information of China (English)
张涛; 胡佳研; 李福娟; 张玥杰
2012-01-01
本文将航班串的飞机指派问题归结为车辆路径问题,考虑连续航班串之间衔接时间、衔接机场的约束、每架飞机的总飞行时间约束,建立了带有飞行时间约束的车辆路径问题的混合整数规划模型.构造了蚁群系统算法,引入基于排序的蚂蚁系统和最大最小蚂蚁系统算法的信息素更新策略.选取某航空公司7组初始航班串集合进行测试,并对算法中的重要参数进行了分析.实验结果表明,本文设计的模型和算法可以有效地减少连续航班串之间的总衔接时间,在可接受的计算时间内获得满意解.%The domestic airlines are relatively small in comparison with the international airlines. Airlines used to make the flight plans using simple and rough methods. The competition among the airlines became stronger with the expansion of airlines, and the opening of the air transportation market. Therefore, flight-planning management becomes more important. Aircraft assigning problem ( AAP) is to assign planes to the proper flight reasonably in order to make full use of the fleet resources. Good flight planning can not only ensure the safety and punctuality of flights, but also improve the utilization rale of fleets and decrease the cost of operation and maintenance so as to maximize the economic benefits of the airlines.The theoretical research on the flight-assigning problem is in its infancy, and most of the research just considers the next day aircraft assignment. However, in practice the airline engineering personnel generally makes aircraft plans every week. Although conducting aircraft assignment daily simplifies the problem and greatly reduces the constraints involved, the assignment method can hardly capture the actual demand. Based on the process of flight planning of the domestic airlines, we transform the aircraft assignment problem into vehicle routing problem (VRP) and study the weekly flight assignment problem. This problem is a kind
Institute of Scientific and Technical Information of China (English)
肖继先; 寇春蕾
2015-01-01
文中从不确定理论出发，将随机模糊约束规划理论引入对随机模糊多目标指派问题的研究。构建了多目标指派问题的随机模糊规划机会约束模型，并设计了将随机模糊模拟、神经网络和遗传算法结合在一起的混合智能算法对模型进行求解。%This paper based on the uncertainty theory,put the theory of random fuzzy constraint programming introduce into the study of random fuzzy multi-objective assignment problem.Build random fuzzy planning opportunities constraint model of the Multi -objective Assignment problem.And design a hybrid intelligent algorithm, which combined the random fuzzy simulation,neural network and genetic algorithm,to solve the model.
Institute of Scientific and Technical Information of China (English)
黄国锐; 李朋辉; 丁俊香; 韩玮
2013-01-01
Weapon-target assignment is a typical NP-complete problem, with the incrase in the number of weapons and targets, as well as the existence of the diversity of evaluation criterion for the allocation result, traditional optimzation algorithm such as implicit enumeration method, cutting plane method, branch and bound method is difficult to solve the problem effectively. This paper desctibes the multi-objiective hybrid optimization theory based on the fuzzy optimization method, establishes the optimal weapon-target assignment model of multi-indicator and applies the ant colony algorithm to solve problem, which provides an effective method to solve the complex problem of weapon-target assignment.%武器-目标分配问题是一个典型的NP完全问题,随着武器和目标数量的增多,以及分配结果评价标准多样性的存在,传统的优化求解算法如隐枚举法、割平面法、分支定界法等很难进行有效地求解.介绍一种基于模糊优选技术的多目标混合优化理论,运用该理论建立了多个指标下的最佳武器-目标分配模型,并将蚁群算法应用于对模型的求解,为解决复杂的武器-目标分配问题提供了一种有效方法.
Institute of Scientific and Technical Information of China (English)
唐苏妍; 梅珊; 朱一凡; 雷永林; 李群
2011-01-01
Based on the description of distributed weapon target assignment (DWTA) , the contract net protocol (CNP) is expended from six aspects: task announcement conditions, the strategies of task announcement,bidding and bid evaluation between managers and contractors, extension of the protocol and contract types, and an extended CNP (ECNP) based DWTA architecture is designed for networked air defense missile systems (NADMS). After that, a DWTA algorithm based on the ECNP is presented, and a comparison is made between CNP based and ECNP based DWTA algorithm in the utility of NADMS, remotes firing times, and number of communications through an operational scenario. Simulation results demonstrate the effectiveness and superiority of the proposed algorithm.%以网络化防空导弹体系为研究背景,对分布式武器目标分配(dynamic weapon target assignment,DWTA)问题进行了描述,从招标条件、招标策略、投标策略、中标策略、协议机制及合同类型六个方面对合同网协议(contract net protocol,CNP)进行了扩展,构建了基于扩展CNP协同机制的DWTA体系结构,提出了基于扩展CNP的DWTA算法.通过某一作战想定,分别从整体效能变化、协同交战次数和通信量三方面对基于CNP和扩展CNP的DWTA算法进行了比较,实验结果证明了后者的有效性和优越性.
一种新型VHF／UHF数据链中的时隙分配策略%A novel timeslot assignment algorithm of VHF/UHF data link
Institute of Scientific and Technical Information of China (English)
粱爽; 赵伟光
2012-01-01
时隙分配技术是VHF/UHF数据链中的一项关键技术，通过它可以提高系统的通信效率。在目前VHF~HF数据链的基础上．提出了一种新的时隙分配高层算法：渐变分配策略，它主要是以固定分配方式为主，以竞争分配和动态分配为辅的一种新型时隙分配策略，兼有固定分配、竞争分配和动态分配的优点，同时又尽可能克服它们的缺点，以最小代价换来最大成效。%The timeslot allocation algorithm is one of important technologies on VHF/UHF Data Link to improve the communication efficiency of the system. Focus on the characteristics of VHF/UHF Data Link, the paper proposes a new algorithm, which named after Shading Allocation Strategy. It mainly gives priority to Fixation Allocation and minority to Competition Allocation and Dynamic Allocation. The strategy has concurrently advantages of Fixation, Competition and Dynamic Allocation, and avoids their disadvantages as much as possible to exchange minimum cost for maximum effect.
Directory of Open Access Journals (Sweden)
Yean-Fu Wen
2013-03-01
Full Text Available Recent advance in wireless sensor network (WSN applications such as the Internet of Things (IoT have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.
Lin, Frank Yeong-Sung; Hsiao, Chiu-Han; Lin, Leo Shih-Chang; Wen, Yean-Fu
2013-03-14
Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.
Lin, Frank Yeong-Sung; Hsiao, Chiu-Han; Lin, Leo Shih-Chang; Wen, Yean-Fu
2013-01-01
Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency. PMID:23493123
Institute of Scientific and Technical Information of China (English)
岳强; 宋瑞; 徐梁; 刘志谦
2011-01-01
In order to improve the informationization, planning and management of public transit< scientific public transit planning and management strategies are needed. Transit flow assignment is one of the key aspects of transit planning and management. This paper reviews the transit flow assignment research at both home and abroad. Based on the concept of urban general transit network, connection, connection segment and attraction connection set, this paper proposes a volume-restrained &. Timetable-based stochastic user equilibrium transit assignment model (VRT-SUE). The principle and solving steps of VRT-SUE algorithm are discussed and a numerical example is presented to showcase the proposed VRT-SUE. Assignment results show that the algorithm can well represent the influences of the departure time, arrival time, transfer number and cost onto traveler's behavior.%提高公共交通规划管理及信息化水平,需要制定科学的公交规划管理策略,公交客流分配是公交规划与管理的核心内容之一.为促进公交配流理论研究,提高公交客流分配结果科学性,分析了国内外公交配流研究现状,对于城市广义公交网络,结合公交时刻表,定义了公交连接、连接片段以及吸引连接集合,建立了容量限制下基于时刻表的公交网络随机用户均衡配流算法(VRT-SUE),对算法原理和求解步骤进行了探讨.构建实例公交网络进行分析测试,配流结果显示该模型能够很好的反映出出发时间、到达时间、换乘次数及费用等对乘客公交出行的影响,算法是合理和有效的.
Institute of Scientific and Technical Information of China (English)
吴坤鸿; 詹世贤
2016-01-01
根据火力打击规则，建立了多目标函数的目标分配模型，提出了分布式遗传模拟退火算法对模型进行求解。分布式遗传模拟退火算法基于经典遗传算法进行改进：将单目标串行搜索方式变成多目标分布式搜索方式，适用于多目标寻优问题求解；采用保留最优个体和轮盘赌相结合的方式进行个体选择，在交叉算子中引入模拟退火算法，使用自适应变异概率，较好地保持算法广度和深度搜索平衡。最后，通过仿真实验验证了算法的有效性和可靠性。%According to the rules of fire strike,a target assignment model is presented,and a Distributed Genetic Simulated Annealing algorithm (DGSA)is applied to resolve this model. DGSA is improved based on classic Genetic Algorithm (GA)as below:the single object serial-searched mode is changed to multiple objects distributed-searched mode,which is fitter for resolving multiobjective optimization; in order to keep a better balance between exploration and exploitation of algorithm,a method by coupling best one preservation and roulette wheel is established for individual selection,and simulated annealing algorithm is combined into crossover operation,and self -adaptive mutation probability is applied. Finally,the efficiency and reliability of DGSA is verified by simulation experiment.
A Model of Hierarchical Key Assignment Scheme
Institute of Scientific and Technical Information of China (English)
ZHANG Zhigang; ZHAO Jing; XU Maozhi
2006-01-01
A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.
Institute of Scientific and Technical Information of China (English)
孙小雷; 齐乃明; 董程; 姚蔚然
2015-01-01
针对无人机协同控制问题，提出一种多无人机任务分配与航迹规划的整体控制架构。将威胁和障碍区域考虑为合理的多边形模型，使用改进的 A*算法规划出两个航迹点之间的最短路径。并利用该路径航程作为任务分配过程全局目标函数的输入，采用与协同系统相匹配的粒子结构进行改进粒子群优化（particle swarm optimization， PSO）任务分配迭代寻优。根据分配结果并考虑无人机性能约束，基于 B-spline 法平滑路径组合，生成飞行航迹。仿真结果表明，算法在保证计算速度和收敛性能的同时，能够产生合理的任务分配结果和无人机的可飞行航迹。%An integrating framework of task assignment and path planning for multiple unmanned aerial ve-hicles (UAVs)is presented.To avoid the obstacles area which is represented as polygon,the shortest path seg-ment between UAVs and task can be found by the improved A* algorithm.According to this segment distance, the global objective function of task allocation is modeled.The assignment process is determined by improved particle swarm optimization (PSO),which particle structure matches the cooperative system.The B-spline method is adopted to smooth the flight path,which consists of path segments of the assignment.Numerical re-sults demonstrate that the proposed method can achieve the optimal task assignment solution and best flight routes.
Directory of Open Access Journals (Sweden)
Victor F. Suarez Chilma
2013-03-01
Full Text Available The objective of this proposal is to implement a school day agenda focused on the learning rhythms of students of elementary and secondary schools using a genetic algorithm. The methodology of this proposal takes into account legal requirements and constraints on the assignment of teachers and classrooms in public educational institutions in Colombia. In addition, this proposal provides a set of constraints focused on cognitive rhythms and subjects are scheduled at the most convenient times according to the area of knowledge. The genetic algorithm evolves through a process of mutation and selection and builds a total solution based on the best solutions for each group. Sixteen groups in a school are tested and the results of class schedule assignments are presented. The quality of the solution obtained through the established approach is validated by comparing the results to the solutions obtained using another algorithm.El objetivo de esta propuesta es implementar un horario escolar que tenga en cuenta los ritmos de aprendizaje en los estudiantes de educación primaria y secundaria, utilizando un algoritmo genético. La metodología considera los requerimientos legales y las restricciones necesarias para la asignación de maestros y aulas en instituciones educativas públicas de Colombia. Adicionalmente, se establecen un conjunto de restricciones relacionadas con el enfoque en los ritmos cognitivos, determinando las horas de la jornada en las que es más conveniente la ubicación de ciertas materias de acuerdo al área del conocimiento al que pertenecen. El algoritmo genético evoluciona mediante un proceso de mutación y selección, a través del cual se construye una solución completa a partir de la búsqueda de las mejores soluciones por grupo. Se presentan los resultados de las pruebas realizadas para la asignación de una institución con 16 grupos. La calidad de las soluciones obtenidas de acuerdo al enfoque establecido es validada
Force Assignment of Radar Jamming System Based on Adaptive Genetic Algorithm%基于自适应遗传算法的雷达干扰系统兵力分配
Institute of Scientific and Technical Information of China (English)
潘伟
2014-01-01
The electronic jamming measures are used to decrease the detect ability of airborne ra-dar in air-raid combat. The jamming effectiveness is directly affected by the assignment of jam-ming force. According to the air-raid combat feature, a jamming force optimization apportion model is proposed based on an adaptive genetic algorithm. The adaptive crossover probability and adaptive mutation probability are proposed, which consider the influence of every generation to algorithm and the effect individual fitness in every generation. Finally, an example is given, which shows the feasibility of the proposed algorithm for handling the complicate and difficult problem of optimization apportion for jamming force.%在防空袭作战中，为了有效地降低敌机载雷达的探测能力，必须综合运用电子干扰措施实施电子干扰，干扰兵力分配直接影响干扰效果。结合防空袭作战的特点，提出了基于自适应遗传算法的雷达干扰系统兵力分配模型，并设计了既考虑到进化代数对算法影响，又考虑到每代中不同个体适应度对算法作用的自适应交叉概率和变异概率。仿真实例表明该方法可以有效解决雷达干扰系统兵力分配这一复杂而困难的问题。
Institute of Scientific and Technical Information of China (English)
王永泉; 罗建军
2014-01-01
对多UCAV协同攻击目标分配问题进行了研究。以收益指标、消耗指标及航程指标为准则建立数学模型，采用改进的萤火虫优化算法对模型进行求解；对基本萤火虫优化算法进行了改进，给出了新的萤火虫更新策略，引入了局部搜索及全局信息交换机制，并将萤火虫优化算法与混合蛙跳算法融合，实现了多智能群体共同进化，提出了一种基于多群体改进萤火虫优化算法的UCAV目标分配算法；针对UCAV协同攻击决策特点，设计了萤火虫离散编码方式，最终得到多UCAV协同攻击最优分配方案。仿真结果表明，多群体萤火虫优化算法能够稳定快速地给出目标分配最优方案。%A target allocation algorithm based on multi-intelligence improved glowworm swarm optimization ( MIG-SO) algorithm is proposed. A model of decision-making is built up by taking benefit index, loss index and range in-dex as the criteria, and the MIGSO is used to solve the model. Finally the optimal allocation scheme for multi-air-craft cooperative attacking is gotten. According to the characteristics of UCAV attack decision making, a special coding for firefly particle and firefly update strategy is presented. With shuffled frog leaping algorithm (SFLA), glowworms are divided into different ethnic groups, and local search and global information exchange method im-proves GSO performance. SFLA is also combined with GSO, which realize the co-evolution of the two kinds of groups. The simulation results shows that the MIGSO algorithm can give the optimal target assignment solution quickly and effectively.
Institute of Scientific and Technical Information of China (English)
孔凡光; 何建华; 唐奎
2013-01-01
Based on the problem of target assignment in BVR(Beyond Visual Range)air combat, a Shuffled Frog Leaping Algo-rithm(SFLA)and Ant Colony Algorithm(ACA)fusion is presented. A model of decision-making in BVR is built up by taking target threat evaluation as the criterion. According to the characteristic of BVR, a special coding process for frog is presented. An improved SFLA based on mutation idea in Differential Evolution(DE)is proposed, and the aberrance operator for ACA is embedded to reduce the search time. Since shuffled frog leaping algorithm has the capability of taking a global searching rapidly and ant colony algorithm has the positive feedback feature, the fusion algorithms use the SFLA to build optimized group at its initial stage, and then use ACA to search the exact answer at the later stage. With Matlab, simulations are implemented. The simu-lation results show that this method can give a reasonable target allocation plan effectively.%针对未来超视距条件下的多机协同空战，提出了一种基于混合蛙跳融合蚁群算法的目标分配方法。以目标威胁评估值为准则建立空战决策模型，根据空战决策特点对青蛙粒子进行特殊编码处理，在混合蛙跳算法局部搜索过程中加入自适应差分扰动机制、在蚁群算法中引入变异算子以减少算法搜索时间。融合算法利用混合蛙跳算法快速的全局搜索能力生成初始优化解群，利用蚁群算法具有正反馈的特点求精确解，利用Matlab仿真。仿真结果表明该方法能够快速有效地给出合理的目标分配方案。
Crosstalk-Aware Routing Resource Assignment
Institute of Scientific and Technical Information of China (English)
Hai-Long Yao; Yi-Ci Cai; Qiang Zhou; Xian-Long Hong
2005-01-01
Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.
Institute of Scientific and Technical Information of China (English)
吴东华; 夏洪山
2012-01-01
A new method based on multi-objective fuzzy linear optimization algorithm for fleet assignment problem was proposed. The method applied fuzzy theory to optimization concept, turning the fuzzy multi-objective optimization mathematical model with the objective of the balance of aircraft flight time, the balance of the numbers of the aircraft movements and least waiting time first to a linear programming problem according to the maximum degree of membership. The result of the experiment shows the method can rapidly get the desired results.%提出了一种基于多目标模糊线性规划法解决飞机排班问题的新算法.该算法将模糊理论与最优化概念相结合,根据最大隶属度原则,将以飞机飞行时间均衡优先、飞机起降次数均衡优先、飞机等待时间最少优先为目标函数的多目标模糊线性规划数学模型转化为一般的线性规划问题进行求解.实验数据表明,该算法可行、有效,步骤简捷,计算量小,能得到理想的结果.
Energy Technology Data Exchange (ETDEWEB)
Zeng Jianyang [Duke University, Department of Computer Science (United States); Zhou Pei [Duke University Medical Center, Department of Biochemistry (United States); Donald, Bruce Randall [Duke University, Department of Computer Science (United States)
2011-08-15
One bottleneck in NMR structure determination lies in the laborious and time-consuming process of side-chain resonance and NOE assignments. Compared to the well-studied backbone resonance assignment problem, automated side-chain resonance and NOE assignments are relatively less explored. Most NOE assignment algorithms require nearly complete side-chain resonance assignments from a series of through-bond experiments such as HCCH-TOCSY or HCCCONH. Unfortunately, these TOCSY experiments perform poorly on large proteins. To overcome this deficiency, we present a novel algorithm, called Nasca (NOE Assignment and Side-Chain Assignment), to automate both side-chain resonance and NOE assignments and to perform high-resolution protein structure determination in the absence of any explicit through-bond experiment to facilitate side-chain resonance assignment, such as HCCH-TOCSY. After casting the assignment problem into a Markov Random Field (MRF), Nasca extends and applies combinatorial protein design algorithms to compute optimal assignments that best interpret the NMR data. The MRF captures the contact map information of the protein derived from NOESY spectra, exploits the backbone structural information determined by RDCs, and considers all possible side-chain rotamers. The complexity of the combinatorial search is reduced by using a dead-end elimination (DEE) algorithm, which prunes side-chain resonance assignments that are provably not part of the optimal solution. Then an A* search algorithm is employed to find a set of optimal side-chain resonance assignments that best fit the NMR data. These side-chain resonance assignments are then used to resolve the NOE assignment ambiguity and compute high-resolution protein structures. Tests on five proteins show that Nasca assigns resonances for more than 90% of side-chain protons, and achieves about 80% correct assignments. The final structures computed using the NOE distance restraints assigned by Nasca have backbone RMSD 0
Institute of Scientific and Technical Information of China (English)
赵军; 陈祥光; 刘春涛; 余向明; 岳彬
2011-01-01
为提高油料保障系统中信息采集的实时性和能量的高效性,使网关及时检测到移动设备的状态,降低无线网络间的干扰,提高网络的容量.以军用机场加油车为研究对象,提出了适用于快速移动节点的集中式信道分配算法和功率分级的能量控制方法.在无线网络节点上安装两个工作在不同频道上的网络接口,通过控制协商动态的切换数据信道,平衡网络负载,以增加总的带宽.实验结果表明,采用3条数据信道便可实现信道的集中式分配和发送功率的分级控制,有效地扩展了网络的容量和提高能量的高效性.%By investigating the working process of tanker trucks in a military airport, this paper proposes a centralized channel assignment algorithm and a power rating control method for fast-moving nodes to improve the real-time property and energy efficiency of the information collection, detect the state of mobile devices promptly, reduce interference between wireless networks and to increase network capacity in oil security systems. Considering the fact that IEEE 802. 11 wireless LAN standard defines a number of non-overlapping channels which could be used at the same time, two wireless network interfaces operating on different channels could be installed to every node. Through the negotiation on the control channel and switching the data channel dynamically, the balance of network loads could be fulfilled so as to increase the total bandwidth. Simulation and application results demonstrate that, only three data channels is needed to realize the centralized channel assignment and the power rating control, and the network capacity and energy efficiency could be improved effectively.
Fleet Assignment Using Collective Intelligence
Antoine, Nicolas E.; Bieniawski, Stefan R.; Kroo, Ilan M.; Wolpert, David H.
2004-01-01
Product distribution theory is a new collective intelligence-based framework for analyzing and controlling distributed systems. Its usefulness in distributed stochastic optimization is illustrated here through an airline fleet assignment problem. This problem involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of linear and non-linear constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of this new stochastic optimization algorithm to a non-linear objective cold start fleet assignment problem. Results show that the optimizer can successfully solve such highly-constrained problems (130 variables, 184 constraints).
Institute of Scientific and Technical Information of China (English)
于秀丽; 张毕西; 李逸帆; 李弘
2014-01-01
MTO( Make-To-Order) and MOS( Manual Operation System ) is the general production system model of the small and medium manufacturing enterprises .The worker ’ skills have an important influence on the perform-ance in such a system .With the growing in times of repetition , learning effect happens and workers ’ efficiencies continuously improve .We propose an optimization model of the front-line workers ’ Assignment considering learning effect , paying full attention to the individual difference in order to narrowing the gap between theory re-searches and production practices .Taking the lead time as the objective function , the model is based on work-ers’ previous experience, learning ability, technology difficulty and batch size .Due to workers’ assignment is NP complete problem , the Bootstrap approach to solve the problem is proposed .A case study indicates that the proposed model can provide a promising worker assignment approach and the proposed algorithm is effective for combinational optimization problem .%订单式生产（ MTO）人工作业系统（ MOS）是我国中小制造企业广泛采用的生产系统模式。在MTO/MOS中，一线员工生产技能对生产绩效具有直接的影响。随着重复操作次数的增多，员工的生产效率不断提高，即产生学习效应。本文考虑员工学习效应来优化一线员工的配置，强调员工初始技能和学习能力的个体差异对完工期的影响，以期缩小理论研究与生产实践之间的差距。本文首先提出一个基于员工初始技能、员工的学习能力、工艺难度和订单批量的员工技能动态变化函数。然后，以最小化完工期为目标，建立一个优化模型。由于员工指派问题属于“完全NP-Hard”问题，为了求解本文所提出模型，本文提出Bootstrap方法对问题进行求解。最后，基于一个算例分析，验证该模型及算法的有效性。
Institute of Scientific and Technical Information of China (English)
周溪召
2001-01-01
Because the randomness of transportation information has not been considered in present practical transportation planning ,the accuracy or efficiency of transportation planning is depreciated.In order to overcome this drawback,the combinatorial model simulaneously involving OD distribution of trips in a transportation network and stochastic user equilibrium assignment(SUEA) of trips to routes in each OD pairs was developped on the basis of analysis on random ness in choices of route and destination for a given mode. It was proved that the solution of the combinatorial model was unique and it satisfied Wardropian principle of SUEA and requirement of OD distribution by introducing Langrangian function.Finally,the algorithm of model was given by using the direction hunting method.%目前交通规划实践缺乏考虑交通信息的随机性，从而降低了它所得结果的准确性.为此，通过分析出行路径选择和目标选择的随机性，建立了交通网络OD分布与随机平衡（或均衡）分配的组合模型，通过引入拉格朗日函数，证明了模型最优解满足随机用户平衡条件和OD分布的要求且最优解是唯一的;最后给出了模型的方向搜索算法.
Scaffolding students’ assignments
DEFF Research Database (Denmark)
Slot, Marie Falkesgaard
2013-01-01
, on the shoulders of linguistics research, results of “assignment-didactics” as a useful but also very tentative term in the context of the assessment of design principles for the design of assignments. Based on empirical studies, I discuss cognition, multi-modality and collaboration as crucial types of scaffolding...
Adaptive Task Assignment in Online Learning Environments
Andersen, Per-Arne; Kråkevik, Christian; Goodwin, Morten; Yazidi, Anis
2016-01-01
With the increasing popularity of online learning, intelligent tutoring systems are regaining increased attention. In this paper, we introduce adaptive algorithms for personalized assignment of learning tasks to student so that to improve his performance in online learning environments. As main contribution of this paper, we propose a a novel Skill-Based Task Selector (SBTS) algorithm which is able to approximate a student's skill level based on his performance and consequently suggest adequa...
A parametric visualization software for the assignment problem
Directory of Open Access Journals (Sweden)
Papamanthou Charalampos
2005-01-01
Full Text Available In this paper we present a parametric visualization software used to assist the teaching of the Network Primal Simplex Algorithm for the assignment problem (AP. The assignment problem is a special case of the balanced transportation problem. The main functions of the algorithm and design techniques are also presented. Through this process, we aim to underline the importance and necessity of using such educational methods in order to improve the teaching of Computer Algorithms.
Historical WBAN ID Assignments
National Oceanic and Atmospheric Administration, Department of Commerce — 4"x6" index cards represent the first written assignments of Weather Bureau Army Navy (WBAN) station identifier numbers by the National Climatic Data Center....
42 CFR 433.146 - Rights assigned; assignment method.
2010-10-01
... 42 Public Health 4 2010-10-01 2010-10-01 false Rights assigned; assignment method. 433.146 Section 433.146 Public Health CENTERS FOR MEDICARE & MEDICAID SERVICES, DEPARTMENT OF HEALTH AND HUMAN... Assignment of Rights to Benefits § 433.146 Rights assigned; assignment method. (a) Except as specified...
Institute of Scientific and Technical Information of China (English)
刘万俊; 傅裕松; 翁兴伟
2012-01-01
To solve the mission assignment problem for MAV (Manned Aerial Vehicle) and multi-UAV (Unmanned Aerial Vehicle) in cooperation air combat. A DPSO (Discrete Particle Swarm Optimization) is put forward. The research is divided into three situation which includes that one UCAV is assigned one target, one UCAV is assigned two targets regardless of attack order and one UCAV is assigned two targets considering attack order. And then a new particle formation method is proposed. The risk return matrix and cost function of multi-mission assignment which combines air combat capability index and dominant function are designed. The simulation result shows that the arithmetic has good astringency and it has reference value for the Multi-mission assignment for MAV and multi-UAV in cooperation air combat.%针对有人机—无人机群协同空战目标分配问题,运用离散粒子群算法,分为1架UCAV分配1个目标,1架UCAV分配2个目标时不考虑攻击先后影响和考虑攻击先后影响3种情况进行了仿真研究,提出了一种新的粒子构造方法.综合考虑空战能力指数和优势函数,构造了收益风险矩阵和多目标分配的代价函数.仿真结果具有良好收敛性,对有人机—无人机群协同空战目标分配具有参考价值.
Hebert, Margaret; And Others
1991-01-01
Contains seven brief articles which offer assignments designed to help students perform job searches, write job application letters, answer difficult questions, write letters of resignation, alleviate fears of public speaking, use the interview effectively in the business communication, and develop listening skills. (PRA)
Routing and wavelength assignment in hierarchical WDM networks
Institute of Scientific and Technical Information of China (English)
Yiyi LU; Ruxiang JIN; Chen HE
2008-01-01
A new routing and wavelength assignment method applied in hierarchical wavelength division multiplexing(WDM)networks is proposed.The algorithm is called offiine band priority algorithm(offiine BPA).The offline BPA targets to maximize the number of waveband paths under the condition of minimum number of wavelengths,and solve the routing and wavelength assignment(RWA)problem with waveband grooming to reduce cost.Based on the circle construction algorithm,waveband priority function is introduced to calculate the RWA problem.Simulation results demonstrate that the proposed algorithm achieves significant cost reduction in WDM network construction.
File Assignment Policy in Network Storage System
Institute of Scientific and Technical Information of China (English)
CaoQiang; XieChang-sheng
2003-01-01
Network storage increase capacity and scalability of storage system, data availability and enables the sharing of data among clients. When the developing network technology reduce performance gap between disk and network, however,mismatched policies and access pattern can significantly reduce network storage performance. So the strategy of data place ment in system is an important factor that impacts the performance of overall system. In this paper, the two algorithms of file assignment are presented. One is Greed partition that aims at the load balance across all NADs (Network Attached Disk). The other is Sort partition that tries to minimize variance of service time in each NAD. Moreover, we also compare the performance of our two algorithms in practical environment. Our experimental results show that when the size distribution (load characters) of all assigning files is closer and larger, Sort partition provides consistently better response times than Greedy algorithm. However, when the range of all assigning files is wider, there are more small files and access rate is higher, the Greedy algorithm has superior performance in compared with the Sort partition in off-line.
File Assignment Policy in Network Storage System
Institute of Scientific and Technical Information of China (English)
Cao Qiang; Xie Chang-sheng
2003-01-01
Network storage increase capacity and scalability of storage system, data availability and enables the sharing of data among clients. When the developing network technology reduce performance gap between disk and network, however, mismatched policies and access pattern can significantly reduce network storage performance. So the strategy of data placement in system is an important factor that impacts the performance of overall system. In this paper, the two algorithms of file assignment are presented. One is Greed partition that aims at the load balance across all NADs (Network Attached Disk). The other is Sort partition that tries to minimize variance of service time in each NAD. Moreover, we also compare the performance of our two algorithms in practical environment. Our experimental results show that when the size distribution (load characters) of all assigning files is closer and larger, Sort partition provides consistently better response times than Greedy algorithm. However, when the range of all assigning files is wider, there are more small files and access rate is higher, the Greedy algorithm has superior performance in compared with the Sort partition in off-line.
Directory of Open Access Journals (Sweden)
Balen Julie
2010-09-01
Full Text Available Abstract Background There are growing concerns regarding inequities in health, with poverty being an important determinant of health as well as a product of health status. Within the People's Republic of China (P.R. China, disparities in socio-economic position are apparent, with the rural-urban gap of particular concern. Our aim was to compare direct and proxy methods of estimating household wealth in a rural and a peri-urban setting of Hunan province, P.R. China. Methods We collected data on ownership of household durable assets, housing characteristics, and utility and sanitation variables in two village-wide surveys in Hunan province. We employed principal components analysis (PCA and principal axis factoring (PAF to generate household asset-based proxy wealth indices. Households were grouped into quartiles, from 'most wealthy' to 'most poor'. We compared the estimated household wealth for each approach. Asset-based proxy wealth indices were compared to those based on self-reported average annual income and savings at the household level. Results Spearman's rank correlation analysis revealed that PCA and PAF yielded similar results, indicating that either approach may be used for estimating household wealth. In both settings investigated, the two indices were significantly associated with self-reported average annual income and combined income and savings, but not with savings alone. However, low correlation coefficients between the proxy and direct measures of wealth indicated that they are not complementary. We found wide disparities in ownership of household durable assets, and utility and sanitation variables, within and between settings. Conclusion PCA and PAF yielded almost identical results and generated robust proxy wealth indices and categories. Pooled data from the rural and peri-urban settings highlighted structural differences in wealth, most likely a result of localized urbanization and modernization. Further research is needed
Graphical interpretation of Boolean operators for protein NMR assignments
Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy
2008-01-01
We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical three-
Institute of Scientific and Technical Information of China (English)
冯超; 景小宁; 李秋妮; 夏菲; 费凯
2016-01-01
考虑对于目标与目标组成网络的攻击总收益最大、自身消耗最小的原则，建立网络对抗条件下火力分配多目标优化模型，引入随机网络拓扑结构，分析火力分配方案对于随机网络的攻击效果，采用改进量子免疫克隆多目标算法对模型进行求解。通过实验仿真，分析攻击收益与不同弹药成本之间的变化情况，发现使用改进算法得到火力分配方案的攻击效率比标准算法平均高出23%；对算法的收敛性与Pareto解分布的均匀性进行研究，发现改进算法得到的 Pa-reto解分布均匀性比标准算法提高了42%，验证了模型的有效性以及改进算法的优越性。%In consideration of the principles that attack benefits of network combined targets with targets are maximal and its own consumption is minimal in total,a multi-obj ective optimization model is estab-lished under conditions of network confrontation environment in fire distribution.Under conditions of ran-dom network topology introduced,the effect of fire distribution corresponding to the random network is analyzed.This paper adopts quantum-inspired immune clonic multi-obj ective optimization algorithm to solve the model of fire distribution.Though experimental simulation,the change circumstances of the total attack benefits are analyzed by using different cost ammunition.The attack efficiency of the fire distribu-tion scheme increases by 23% by using the improved algorithm over the fire distribution scheme by using standard algorithm.The convergence of the algorithm and superiority of Pareto solution distribution are studied.The experiments demonstrate that the Pareto efficiency solution distribution increases 42% by u-sing the improved algorithm over using the standard algorithm.The superiority of the model and the effi-ciency of the algorithm are verified.
Fast assignment reduction in inconsistent incomplete decision systems
Institute of Scientific and Technical Information of China (English)
Min Li; Shaobo Deng; Shengzhong Feng; Jianping Fan
2014-01-01
This paper focuses on fast algorithm for computing the assignment reduct in inconsistent incomplete decision systems. It is quite inconvenient to judge the assignment reduct directly ac-cording to its definition. We propose the judgment theorem for the assignment reduct in the inconsistent incomplete decision system, which greatly simplifies judging this type reduct. On such basis, we derive a novel attribute significance measure and construct the fast assignment reduction algorithm (F-ARA), intended for com-puting the assignment reduct in inconsistent incomplete decision systems. Final y, we make a comparison between F-ARA and the discernibility matrix-based method by experiments on 13 Univer-sity of California at Irvine (UCI) datasets, and the experimental results prove that F-ARA is efficient and feasible.
Flexible taxonomic assignment of ambiguous sequencing reads
Directory of Open Access Journals (Sweden)
Jansson Jesper
2011-01-01
Full Text Available Abstract Background To characterize the diversity of bacterial populations in metagenomic studies, sequencing reads need to be accurately assigned to taxonomic units in a given reference taxonomy. Reads that cannot be reliably assigned to a unique leaf in the taxonomy (ambiguous reads are typically assigned to the lowest common ancestor of the set of species that match it. This introduces a potentially severe error in the estimation of bacteria present in the sample due to false positives, since all species in the subtree rooted at the ancestor are implicitly assigned to the read even though many of them may not match it. Results We present a method that maps each read to a node in the taxonomy that minimizes a penalty score while balancing the relevance of precision and recall in the assignment through a parameter q. This mapping can be obtained in time linear in the number of matching sequences, because LCA queries to the reference taxonomy take constant time. When applied to six different metagenomic datasets, our algorithm produces different taxonomic distributions depending on whether coverage or precision is maximized. Including information on the quality of the reads reduces the number of unassigned reads but increases the number of ambiguous reads, stressing the relevance of our method. Finally, two measures of performance are described and results with a set of artificially generated datasets are discussed. Conclusions The assignment strategy of sequencing reads introduced in this paper is a versatile and a quick method to study bacterial communities. The bacterial composition of the analyzed samples can vary significantly depending on how ambiguous reads are assigned depending on the value of the q parameter. Validation of our results in an artificial dataset confirm that a combination of values of q produces the most accurate results.
Simulation Optimization of the Crossdock Door Assignment Problem
Aickelin, Uwe
2008-01-01
The purpose of this report is to present the Crossdock Door Assignment Problem, which involves assigning destinations to outbound dock doors of Crossdock centres such that travel distance by material handling equipment is minimized. We propose a two fold solution; simulation and optimization of the simulation model simulation optimization. The novel aspect of our solution approach is that we intend to use simulation to derive a more realistic objective function and use Memetic algorithms to find an optimal solution. The main advantage of using Memetic algorithms is that it combines a local search with Genetic Algorithms. The Crossdock Door Assignment Problem is a new domain application to Memetic Algorithms and it is yet unknown how it will perform.
Job Assignments under Moral Hazard
DEFF Research Database (Denmark)
Koch, Alexander; Nafziger, Julia
Inefficient job assignments are usually explained with incomplete information about employees' abilities or contractual imperfections. We show that inefficient assignments arise even without uncertainty about the employee's ability and with complete contracts. Building on this result we provide...
Task assignment algorithm of multi-AUV based on self-organizing map%多自治水下机器人多任务分配的自组织算法
Institute of Scientific and Technical Information of China (English)
朱大奇; 李欣; 颜明重
2012-01-01
针对自治水下机器人（AUV）研究中的多机器人多任务分配问题,提出一种基于自组织映射（SOM）神经网络的多AUV多目标分配策略.将目标点的位置坐标作为SOM神经网络的输入向量进行自组织竞争计算,输出为对应的AUV机器人,从而控制一组AUV在不同的地点完成不同的任务,使机器人按照优化的路径规则到达指定的目标位置.为了表明所提出算法的有效性,给出了二维、三维作业环境中的仿真实验结果.%Aiming to the task assignment issue of multi-AUV(autonomous underwater vehicles) system, a self-organizing map(SOM) neural network based strategy of task assignment of multi-AUV and multi-objective is presented. Targets' locations are set as input vectors of SOM neural network. Then self-organizing competitive calculations are carded out. Its output vectors are the corresponding AUV robots' locations, so that a group of AUVs can be controlled to complete different tasks in different locations, and the robots can reach the designated targets in optimized paths. Simulation results in two-dimensional and three-dimensional working environments show the effectiveness of the proposed method.
Institute of Scientific and Technical Information of China (English)
Huang; Ling; Liu; Yang; Xu; Jianfeng
2015-01-01
With the transformation of the Chinese economy from an extensive growth to intensive development, city development is also gradually turning from incremental construction to stock management. Community, as a basic unit of human settlements, is an important platform to build and improve the social governance capability. In 2013, Shiyoulu Jiedao Offi ce of Yuzhong District led the 1st urban community development planning, which was a milestone of Chongqing’s city regeneration and governance innovation. This paper focuses on two key issues: how to understand the community values and make the community development planning based on the above, and how to integrate with the local forces so that the community development planning can be integrated into the action plan. Combined with the practice of Minlecun Community Development Planning, using the concept of asset-based community development, a comprehensive survey is conducted on community assets(including three aspects of physical, human, and social capital), and a community comprehensive planning strategy is formulated which covers two parts: the optimization of community spaces and the upgrading of community governance. The paper explores the local-based community planning theories and methods from such aspects as value attitude, public participation, role transformation of urban planners, and others.
Solving multiconstraint assignment problems using learning automata.
Horn, Geir; Oommen, B John
2010-02-01
This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the
Institute of Scientific and Technical Information of China (English)
陈香
2013-01-01
In order to effectively solve Arrange fair and objective interview to interview members of the Group ,in this pa-per ,the issues were discussed ,establish its mathematical model ,the model is a complex non -linear integer programming problem .Proposed a packing code ,simulated annealing genetic ,multi-point crossover ,the search for variability in the field of genetic algorithms to solve the mathematical model ,And with an example :30 experts to interview 300 students each interview group of four experts ,with the genetic algorithm to solve the calculation of the examples ,show that the improved genetic algorithm can be efficient for solving the approximate optimal solution of problem solving can meet the job interview fair and reasonable arrangements required to achieve results .%为了有效求解如何安排面试专家组成员工作使面试公正客观的问题，建立面试安排工作数学模型，该模型为复杂的非线性整数规划问题。提出一种装箱编码、模拟退火遗传、多点交叉、领域搜索变异的遗传算法对数学模型进行求解，并以一个30名专家对300名学生进行面试，且每个面试组4名专家的例子用遗传算法进行求解计算。结果表明，改进后的遗传算法能高效求解出问题的近似最优解，求解结果能满足面试工作安排所提出的要求。
Interactive Assignments for Online Students
Directory of Open Access Journals (Sweden)
Pam Lowry
2009-04-01
Full Text Available Students can experience first hand through interactive assignments what is involved in teaching an online course. Most students develop a whole new appreciation for the student learning process. Faculty are beginning to realize that online instruction is more than a series of readings posted to a course management system. This paper summarizes the faculty member's instructional strategies involved when creating student interaction assignments. The paper also summarizes the assignments, discussion board, and trends in education from the student's perspective. In summary, it concludes with the faculty's overall perspective concerning these assignments and how the assignments could be more effective for the student.
Institute of Scientific and Technical Information of China (English)
赵金宝; 邓卫; 谢秋峰
2011-01-01
路径的感知时间主要受定量和随机两方面因素的影响．在实际的交通网络中，由于时间价值观的不同，道路使用者会根据习惯、偏好、信息而对出行时间、费用、道路拥挤等诸多影响因素做出不同的反应。本文通过综合考虑定量和随机两方面因素的影响效应，建立了基于感知时间的交通分配模型，设计了求解该模型的延迟加载算法。最后结合算例验证了算法的有效性．%The perception time of a path was mainly affected by two factors： the deterministic and the stochastic. In an actual traffic network, for different road users have different acknowledges on the value of time, they react differently to travel time, travel cost and traffic congestion on the basic of their own habit, taste and information. By considering both the deterministic and stochastic effect factors, this paper described amathematicalmodel and it＇s solution algorithm based on perception time. An numerical carried out at the end of this paper to prove the effectiveness of this algorithm experiment was model and it＇s
Taniman, R.O.; Sikkes, B.; Bochove, van A.C.; Boer, de P.T.
2006-01-01
In this paper, an adaptive subcarrier assignment method based on a stable matching algorithm is considered. From the performance comparison with other assignment methods (Hungarian-algorithm-based, contiguous and interleaved), our assignment method, while of relatively low complexity, resulted in a
Dynamic traffic assignment techniques for general road networks
Han, S.
2000-01-01
Dynamic traffic assignment is widely recognised as being more useful to evaluate traffic management measures than is static counterpart, as it allows us to analyse how congestion forms and dissipates in time-varying conditions. In this thesis, both deterministic and stochastic dynamic assignments are modelled with a proper link performance function, and solved with efficient solution algorithms so that they give rise to high quality solutions. A deterministic dynamic assignm...
Institute of Scientific and Technical Information of China (English)
栾渊鑫; 叶竹君
2015-01-01
为了降低邻居节点间的信道冲突，最大化并行传输的信道数目，从而提高移动Ad hoc网络的性能，提出了一种信道分配和路由选择相结合的多信道路由协议LBMMR．LBMMR协议在MAC层和路由层间进行实时的信道状态的信息交互，节点根据信道状态列表，在每一跳中始终选择信道干扰指数最小的信道，从而减少与邻居节点的信道干扰和冲突．在路由选择方面，以信道已用带宽和节点接口队列长度作为负载均衡的判据，在全路径范围内找到一条负载均衡且干扰最小的路径．仿真结果表明，与现有的多信道路由协议相比，LBMMR在网络吞吐量、端到端时延等方面具有明显的性能提升．%In order to reduce co -channel conflict and maximize the number of parallel transmission , thereby improving the performance of mobile Ad hoc networks , this paper pro-posed a multi -channel routing protocol LBMMR which combines with channel assignment and routing .The channel state and information can be exchanged between MAC and routing layer in real time .In order to reduce channel interference and conflicts with neighboring nodes, each node according to the channel usage list has always selected the least channel interference index at each hop .To find the least interfered path for network load balancing on a global scale , LBMMR employed occupied channel bandwidth and the length of the node ’ s interface-queue as the reference of the node routing .Simulation results showed that compared with the existing multi -channel routing protocols , LBMMR provided much higher system total throughputs and shorter end -to-end packet delays .
Towards an intelligent system for the automatic assignment of domains in globular proteins.
Sternberg, M J; Hegyi, H; Islam, S A; Luo, J; Russell, R B
1995-01-01
The automatic identification of protein domains from coordinates is the first step in the classification of protein folds and hence is required for databases to guide structure prediction. Most algorithms encode a single concept based and sometimes do not yield assignments that are consistent with the generally accepted perception. Our development of an automatic approach to identify reliably domains from protein coordinates is described. The algorithm is benchmarked against a manual identification of the domains in 284 representative protein chains. The first step is the domain assignment by distance (DAD) algorithm that considers the density of inter-residue contacts represented in a contact matrix. The algorithm yields 85% agreement with the manual assignment. The paper then considers how the reliability of these assignments could be evaluated. Finally the use of structural comparisons using the STAMP algorithm to validate domain assignment is reported on a test case. PMID:7584461
Graphical interpretation of Boolean operators for protein NMR assignments.
Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy
2008-09-01
We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical three-dimensional spectra to obtain its functionality. The method's strength lies in the continuous graphical presentation of the spectra, allowing both a semi-automatic peaklist construction and sequential assignment. We demonstrate here its general use for the case of a folded protein with a well-dispersed spectrum, but equally for a natively unfolded protein where spectral resolution is minimal. PMID:18762868
A New Approach to Pointer Analysis for Assignments
Institute of Scientific and Technical Information of China (English)
HUANG Bo; ZANG Binyu; LI Jing; ZHU Chuanqi
2001-01-01
Pointer analysis is a technique to identify at compile-time the po tential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are clas sified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by Institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.
76 FR 55880 - Recording Assignments
2011-09-09
..., depending on the date they were recorded. The public may also search patent and trademark assignment... United States Patent and Trademark Office Recording Assignments ACTION: Proposed collection; comment request. SUMMARY: The United States Patent and Trademark Office (USPTO), as part of its continuing...
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Moreno-Ternero, Juan D.; Østerdal, Lars Peter Raahave
2014-01-01
We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and assigned...
An Assignment Sequence for Underprepared Writers.
Nimmo, Kristi
2000-01-01
Presents a sequenced writing assignment on shopping to aid basic writers. Describes a writing assignment focused around online and mail-order shopping. Notes steps in preparing for the assignment, the sequence, and discusses responses to the assignments. (SC)
Artificial Bee Colony Optimization for Multiobjective Quadratic Assignment Problem
Eleyan, Haytham Mohammed
2015-01-01
ABSTRACT: Excellent ability of swarm intelligence can be used to solve multi-objective combinatorial optimization problems. Bee colony algorithms are new swarm intelligence techniques inspired from the smart behaviors of real honeybees in their foraging behavior. Artificial bee colony optimization algorithm has recently been applied for difficult real-valued and combinational optimization problems. Multiobjective quadratic assignment problem (mQAP) is a well-known and hard combinational optim...
Institute of Scientific and Technical Information of China (English)
王剑
2011-01-01
For traditional monetary policy instruments,there are many problems about dealing with more and more complicated economic conditions.Asset-based reserve requirements（ABRR） are the feasible choice for monetary policy innovation,which has significant advant%传统的货币政策工具已难以应对日益复杂的经济形势,基于资产的准备金制度在宏观调控、结构调整以及宏观审慎监管等方面都具有显著优势,是货币政策工具创新的一个可行选择。本文对该制度的作用机理、优势与局限性等问题进行了研究,并结合我国货币调控的实践得出一些启示与思考。
Improving load balance with flexibly assignable tasks
Energy Technology Data Exchange (ETDEWEB)
Pinar, Ali; Hendrickson, Bruce
2003-09-09
In many applications of parallel computing, distribution ofthe data unambiguously implies distribution of work among processors. Butthere are exceptions where some tasks can be assigned to one of severalprocessors without altering the total volume of communication. In thispaper, we study the problem of exploiting this flexibility in assignmentof tasks to improve load balance. We first model the problem in terms ofnetwork flow and use combinatorial techniques for its solution. Ourparametric search algorithms use maximum flow algorithms for probing on acandidate optimal solution value. We describe two algorithms to solve theassignment problem with \\logW_T and vbar P vbar probe calls, w here W_Tand vbar P vbar, respectively, denote the total workload and number ofproce ssors. We also define augmenting paths and cuts for this problem,and show that anyalgorithm based on augmenting paths can be used to findan optimal solution for the task assignment problem. We then consideracontinuous version of the problem, and formulate it as a linearlyconstrained optimization problem, i.e., \\min\\|Ax\\|_\\infty,\\; {\\rms.t.}\\;Bx=d. To avoid solving an intractable \\infty-norm optimization problem,we show that in this case minimizing the 2-norm is sufficient to minimizethe \\infty-norm, which reduces the problem to the well-studiedlinearly-constrained least squares problem. The continuous version of theproblem has the advantage of being easily amenable to parallelization.Our experiments with molecular dynamics and overlapped domaindecomposition applications proved the effectiveness of our methods withsignificant improvements in load balance. We also discuss how ourtechniques can be enhanced for heterogeneous systems.
Job Assignment with Multivariate Skills
Brilon, Stefanie
2010-01-01
This paper analyzes the job assignment problem faced by a firm when workers' skills are distributed along several dimensions and jobs require different skills to varying extent. I derive optimal assignment rules with and without slot constraints, and show that under certain circumstances workers may get promoted although in their new job they are expected to be less productive than in their old job. This can be interpreted as a version of the Peter Principle which states that workers get prom...
A New Approach to Pointer Analysis for Assignments
Institute of Scientific and Technical Information of China (English)
黄波; 臧斌宇; 等
2001-01-01
Pointer analysis is a technique to identify at copile-time the potential values of the pointer expressions in a program,which promises significant benefits for optimzing and parallelizing complilers.In this paper,a new approach to pointer analysis for assignments is presented.In this approach,assignments are classified into three categories:pointer assignments,structure(union)assignents and normal assignments which don't affect the point-to information.Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm.When analyzing a pointer assigemtn.a new method called expression expansion is used to calculate both the left targets and the right targets.The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper,which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables.This algorithm is implemented in Agassiz,an analyzing tool for C programs developed by Institute of Parallel Processing,Fudan University,Its accuracy and effectiveness are illustrated by experimental data.
A new heuristic for the quadratic assignment problem
Zvi Drezner
2002-01-01
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.
A Stone Resource Assignment Model under the Fuzzy Environment
Directory of Open Access Journals (Sweden)
Liming Yao
2012-01-01
to tackle a stone resource assignment problem with the aim of decreasing dust and waste water emissions. On the upper level, the local government wants to assign a reasonable exploitation amount to each stone plant so as to minimize total emissions and maximize employment and economic profit. On the lower level, stone plants must reasonably assign stone resources to produce different stone products under the exploitation constraint. To deal with inherent uncertainties, the object functions and constraints are defuzzified using a possibility measure. A fuzzy simulation-based improved simulated annealing algorithm (FS-ISA is designed to search for the Pareto optimal solutions. Finally, a case study is presented to demonstrate the practicality and efficiency of the model. Results and a comparison analysis are presented to highlight the performance of the optimization method, which proves to be very efficient compared with other algorithms.
Improved Harmony Search with Chaos for Solving Linear Assignment Problems
Directory of Open Access Journals (Sweden)
Osama Abdel-Raouf
2014-04-01
Full Text Available This paper presents an improved version of a harmony meta-heuristic algorithm, (IHSCH, for solving the linear assignment problem. The proposed algorithm uses chaotic behavior to generation a candidate solution in a behavior similar to acoustic monophony. Numerical results show that the IHSCH is able to obtain the optimal results in comparison with traditional methods (the Hungarian method. However, the benefit of the proposed algorithm is its ability to obtain the optimal solution within less computation in comparison with the Hungarian method.
Adaptive protection algorithm and system
Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA
2009-04-28
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
Capacity constrained assignment in spatial databases
DEFF Research Database (Denmark)
U, Leong Hou; Yiu, Man Lung; Mouratidis, Kyriakos;
2008-01-01
Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q 2 Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M Q × P such that (i) each point q 2 Q (p 2 P) appears at most k times (at most......, the quality of q's service to p in a given (q, p) pair is anti-proportional to their distance. Although max-flow algorithms are applicable to this problem, they require the complete distance-based bipartite graph between Q and P. For large spatial datasets, this graph is expensive to compute and it may be too...
Probabilistic analysis of power assignments
Graaf, de Maurits; Manthey, Bodo
2014-01-01
A fundamental problem for wireless ad hoc networks is the assignment of suitable transmission powers to the wireless devices such that the resulting communication graph is connected. The goal is to minimize the total transmit power in order to maximize the life-time of the network. Our aim is a prob
Who Benefits from Homework Assignments?
Ronning, Marte
2011-01-01
Using Dutch data on pupils in elementary school this paper is the first empirical study to analyze whether assigning homework has a heterogeneous impact on pupil achievement. Addressing potential biases by using a difference-in-difference approach, I find that the test score gap is larger in classes where everybody gets homework than in classes…
The use of meta-heuristics for airport gate assignment
DEFF Research Database (Denmark)
Cheng, Chun-Hung; Ho, Sin C.; Kwan, Cheuk-Lam
2012-01-01
Improper assignment of gates may result in flight delays, inefficient use of the resource, customer’s dissatisfaction. A typical metropolitan airport handles hundreds of flights a day. Solving the gate assignment problem (GAP) to optimality is often impractical. Meta-heuristics have recently been...... proposed to generate good solutions within a reasonable timeframe. In this work, we attempt to assess the performance of three meta-heuristics, namely, genetic algorithm (GA), tabu search (TS), simulated annealing (SA) and a hybrid approach based on SA and TS. Flight data from Incheon International Airport...
Combined automated NOE assignment and structure calculation with CYANA
Energy Technology Data Exchange (ETDEWEB)
Güntert, Peter, E-mail: guentert@em.uni-frankfurt.de; Buchner, Lena [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany)
2015-08-15
The automated assignment of NOESY cross peaks has become a fundamental technique for NMR protein structure analysis. A widely used algorithm for this purpose is implemented in the program CYANA. It has been used for a large number of structure determinations of proteins in solution but was so far not described in full detail. In this paper we present a complete description of the CYANA implementation of automated NOESY assignment, which differs extensively from its predecessor CANDID by the use of a consistent probabilistic treatment, and we discuss its performance in the second round of the critical assessment of structure determination by NMR.
Routing and wavelength assignment for transparent optical networks with QoT estimation inaccuracies
Azodolmolky, Siamak; Pointurier, Yvan; Angelou, Marianna; Solé Pareta, Josep; Tomkos, Ioannis
2010-01-01
We show how inaccuracies of Quality of Transmission (QoT) estimations, caused by imperfect models and lack of monitors in transparent optical networks, can be mitigated using a novel routing and wavelength assignment algorithm. Peer Reviewed
Systematic assignment of thermodynamic constraints in metabolic network models
Directory of Open Access Journals (Sweden)
Heinemann Matthias
2006-11-01
Full Text Available Abstract Background The availability of genome sequences for many organisms enabled the reconstruction of several genome-scale metabolic network models. Currently, significant efforts are put into the automated reconstruction of such models. For this, several computational tools have been developed that particularly assist in identifying and compiling the organism-specific lists of metabolic reactions. In contrast, the last step of the model reconstruction process, which is the definition of the thermodynamic constraints in terms of reaction directionalities, still needs to be done manually. No computational method exists that allows for an automated and systematic assignment of reaction directions in genome-scale models. Results We present an algorithm that – based on thermodynamics, network topology and heuristic rules – automatically assigns reaction directions in metabolic models such that the reaction network is thermodynamically feasible with respect to the production of energy equivalents. It first exploits all available experimentally derived Gibbs energies of formation to identify irreversible reactions. As these thermodynamic data are not available for all metabolites, in a next step, further reaction directions are assigned on the basis of network topology considerations and thermodynamics-based heuristic rules. Briefly, the algorithm identifies reaction subsets from the metabolic network that are able to convert low-energy co-substrates into their high-energy counterparts and thus net produce energy. Our algorithm aims at disabling such thermodynamically infeasible cyclic operation of reaction subnetworks by assigning reaction directions based on a set of thermodynamics-derived heuristic rules. We demonstrate our algorithm on a genome-scale metabolic model of E. coli. The introduced systematic direction assignment yielded 130 irreversible reactions (out of 920 total reactions, which corresponds to about 70% of all irreversible
Efficient Credit Assignment through Evaluation Function Decomposition
Agogino, Adrian; Turner, Kagan; Mikkulainen, Risto
2005-01-01
Evolutionary methods are powerful tools in discovering solutions for difficult continuous tasks. When such a solution is encoded over multiple genes, a genetic algorithm faces the difficult credit assignment problem of evaluating how a single gene in a chromosome contributes to the full solution. Typically a single evaluation function is used for the entire chromosome, implicitly giving each gene in the chromosome the same evaluation. This method is inefficient because a gene will get credit for the contribution of all the other genes as well. Accurately measuring the fitness of individual genes in such a large search space requires many trials. This paper instead proposes turning this single complex search problem into a multi-agent search problem, where each agent has the simpler task of discovering a suitable gene. Gene-specific evaluation functions can then be created that have better theoretical properties than a single evaluation function over all genes. This method is tested in the difficult double-pole balancing problem, showing that agents using gene-specific evaluation functions can create a successful control policy in 20 percent fewer trials than the best existing genetic algorithms. The method is extended to more distributed problems, achieving 95 percent performance gains over tradition methods in the multi-rover domain.
Analysis and Characterization of State AssignmentTechniques for Sequential Machines
Makki, R. Z.; Su, S.
1994-01-01
In this paper, we study the problem of state assignment as it relates to silicon area, propagation delay time and testability of finite state machines. The results of a study involving various FSM benchmarks show that the simple technique of one-hot encoding often produces better results than those attained by complex state assignment algorithms.
Who benefits from homework assignments?
Rønning, Marte
2008-01-01
Abstract: Using Dutch data on pupils in elementary school this paper is the first empirical study that analyzes whether assigning homework has an heterogeneous impact on pupil achievement. Addressing potential biases that arise from unobserved school quality, pupil selection by exploiting different methods, I find that the test score gap is larger in classes where everybody gets homework than in classes where nobody gets homework. More precisely pupils belonging to the upper part of the so...
Institute of Scientific and Technical Information of China (English)
刘晓; 刘忠; 孙坤; 许江湖
2013-01-01
To increase the cooperative anti-missile capability of calculating the multi-object weapon target assignment (WTA), an improved algorithm for multi-objective particle swarm optimization (MOPSO) was proposed based on the multi-objective WTA model so as to establish a multi-objective mathematic model. The problems of MOPSO used in the WTA were solved, such as linear inequality constraints and swarm blind search. The calculation process was defined. Simulation experiments show that the improved MOPSO algorithm for WTA multi-object programming model obtains the non-inferior solutions to the Pareto front; the maximum value of the non-inferior solutions in adaptability which varies with the iteration number evolution is stable in convergence. The results show that the improved MOPSO is effective.%为提高协同反导时的多目标火力分配计算能力,首先建立了火力分配多目标数学模型；然后,针对火力分配多目标规划具有的线性不等式约束条件难以使用多目标粒子群优化算法、粒子群算法自身存在的盲目搜索等问题进行了改进,并明确了计算流程；最后,对算法进行了仿真实验,仿真实验表明:改进的多目标粒子群算法求解多目标火力分配规划模型得到的非劣解集可构成Pareto前端,且非劣解集的适应度最大值随迭代步数演变具有稳定的收敛性,验证了改进多目标粒子群算法的有效性.
DNATCO: assignment of DNA conformers at dnatco.org.
Černý, Jiří; Božíková, Paulína; Schneider, Bohdan
2016-07-01
The web service DNATCO (dnatco.org) classifies local conformations of DNA molecules beyond their traditional sorting to A, B and Z DNA forms. DNATCO provides an interface to robust algorithms assigning conformation classes called NTC: to dinucleotides extracted from DNA-containing structures uploaded in PDB format version 3.1 or above. The assigned dinucleotide NTC: classes are further grouped into DNA structural alphabet NTA: , to the best of our knowledge the first DNA structural alphabet. The results are presented at two levels: in the form of user friendly visualization and analysis of the assignment, and in the form of a downloadable, more detailed table for further analysis offline. The website is free and open to all users and there is no login requirement. PMID:27150812
Equilibrium Assignment Model with Uncertainties in Traffic Demands
Directory of Open Access Journals (Sweden)
Aiwu Kuang
2013-01-01
Full Text Available In this study, we present an equilibrium traffic assignment model considering uncertainties in traffic demands. The link and route travel time distributions are derived based on the assumption that OD traffic demand follows a log-normal distribution. We postulate that travelers can acquire the variability of route travel times from past experiences and factor such variability into their route choice considerations in the form of mean route travel time. Furthermore, all travelers want to minimize their mean route travel times. We formulate the assignment problem as a variational inequality, which can be solved by a route-based heuristic solution algorithm. Some numerical studies on a small test road network are carried out to validate the proposed model and algorithm, at the same time, some reasonable results are obtained.
UPMASK: Unsupervised Photometric Membership Assignment in Stellar Clusters
Krone-Martins, Alberto; Moitinho, Andre
2015-04-01
UPMASK, written in R, performs membership assignment in stellar clusters. It uses photometry and spatial positions, but can take into account other types of data. UPMASK takes into account arbitrary error models; the code is unsupervised, data-driven, physical-model-free and relies on as few assumptions as possible. The approach followed for membership assessment is based on an iterative process, principal component analysis, a clustering algorithm and a kernel density estimation.
Hierarchical method of task assignment for multiple cooperating UAV teams
Institute of Scientific and Technical Information of China (English)
Xiaoxuan Hu; Huawei Ma; Qingsong Ye; He Luo
2015-01-01
The problem of task assignment for multiple cooperat-ing unmanned aerial vehicle (UAV) teams is considered. Multiple UAVs forming several smal teams are needed to perform attack tasks on a set of predetermined ground targets. A hierarchical task assignment method is presented to address the problem. It breaks the original problem down to three levels of sub-problems: tar-get clustering, cluster al ocation and target assignment. The first two sub-problems are central y solved by using clustering algo-rithms and integer linear programming, respectively, and the third sub-problem is solved in a distributed and paral el manner, using a mixed integer linear programming model and an improved ant colony algorithm. The proposed hierarchical method can reduce the computational complexity of the task assignment problem con-siderably, especial y when the number of tasks or the number of UAVs is large. Experimental results show that this method is feasi-ble and more efficient than non-hierarchical methods.
A Statistical Programme Assignment Model
DEFF Research Database (Denmark)
Rosholm, Michael; Staghøj, Jonas; Svarer, Michael
When treatment effects of active labour market programmes are heterogeneous in an observable way across the population, the allocation of the unemployed into different programmes becomes a particularly important issue. In this paper, we present a statistical model designed to improve the present...... duration of unemployment spells may result if a statistical programme assignment model is introduced. We discuss several issues regarding the plementation of such a system, especially the interplay between the statistical model and case workers....
Automated solid-state NMR resonance assignment of protein microcrystals and amyloids
International Nuclear Information System (INIS)
Solid-state NMR is an emerging structure determination technique for crystalline and non-crystalline protein assemblies, e.g., amyloids. Resonance assignment constitutes the first and often very time-consuming step to a structure. We present ssFLYA, a generally applicable algorithm for automatic assignment of protein solid-state NMR spectra. Application to microcrystals of ubiquitin and the Ure2 prion C-terminal domain, as well as amyloids of HET-s(218–289) and α-synuclein yielded 88–97 % correctness for the backbone and side-chain assignments that are classified as self-consistent by the algorithm, and 77–90 % correctness if also assignments classified as tentative by the algorithm are included
Automated solid-state NMR resonance assignment of protein microcrystals and amyloids
Energy Technology Data Exchange (ETDEWEB)
Schmidt, Elena [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany); Gath, Julia [ETH Zurich, Physical Chemistry (Switzerland); Habenstein, Birgit [UMR 5086 CNRS/Universite de Lyon 1, Institut de Biologie et Chimie des Proteines (France); Ravotti, Francesco; Szekely, Kathrin; Huber, Matthias [ETH Zurich, Physical Chemistry (Switzerland); Buchner, Lena [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany); Boeckmann, Anja, E-mail: a.bockmann@ibcp.fr [UMR 5086 CNRS/Universite de Lyon 1, Institut de Biologie et Chimie des Proteines (France); Meier, Beat H., E-mail: beme@ethz.ch [ETH Zurich, Physical Chemistry (Switzerland); Guentert, Peter, E-mail: guentert@em.uni-frankfurt.de [Goethe University Frankfurt am Main, Center for Biomolecular Magnetic Resonance, Institute of Biophysical Chemistry (Germany)
2013-07-15
Solid-state NMR is an emerging structure determination technique for crystalline and non-crystalline protein assemblies, e.g., amyloids. Resonance assignment constitutes the first and often very time-consuming step to a structure. We present ssFLYA, a generally applicable algorithm for automatic assignment of protein solid-state NMR spectra. Application to microcrystals of ubiquitin and the Ure2 prion C-terminal domain, as well as amyloids of HET-s(218-289) and {alpha}-synuclein yielded 88-97 % correctness for the backbone and side-chain assignments that are classified as self-consistent by the algorithm, and 77-90 % correctness if also assignments classified as tentative by the algorithm are included.
A Useful Metaheuristic for Dynamic Channel Assignment in Mobile Cellular Systems
Directory of Open Access Journals (Sweden)
Deepak Kumar Singh
2012-09-01
Full Text Available The prime objective of a Channel Assignment Problem (CAP is to assign appropriate number of required channels to each cell in a way to achieve both efficient frequency spectrum utilization and minimization of interference effects (by satisfying a number of channel reuse constraints. Dynamic Channel Assignment (DCA assigns the channels to the cells dynamically according to traffic demand, and hence, can provide higher capacity (or lower call blocking probability, fidelity and quality of service than the fixed assignment schemes. Channel assignment algorithms are formulated as combinatorial optimization problems and are NP-hard. Devising a DCA, that is practical, efficient, and which can generate high quality assignments, is challenging. Though Metaheuristic Search techniques like Evolutionary Algorithms, Differential Evolution, Particle Swarm Optimization prove effective in the solution of Fixed Channel Assignment (FCA problems but they still require high computational time and therefore may be inefficient for DCA. A number of approaches have been proposed for the solution of DCA problem but the high complexity of these proposed approaches makes them unsuitable/less efficient for practical use. Therefore, this paper presents an effective and efficient Hybrid Discrete Binary Differential Evolution Algorithm (HDB-DE for the solution of DCA Problem
Parkhurst, John T.; Fleisher, Matthew S.; Skinner, Christopher H.; Woehr, David J.; Hawthorn-Embree, Meredith L.
2011-01-01
After completing the Multidimensional Work-Ethic Profile (MWEP), 98 college students were given a 20-problem math computation assignment and instructed to stop working on the assignment after completing 10 problems. Next, they were allowed to choose to finish either the partially completed assignment that had 10 problems remaining or a new…
More General Optimal Offset Assignment
Directory of Open Access Journals (Sweden)
Sven Mallach
2015-06-01
Full Text Available This manuscript presents exact approaches to the general offset assignment problem arising in the address code generation phase of compilers for application-specific processors. First, integer programming models for architecture-dependent and theoretically motivated special cases of the problem are established. Then, these models are extended to provide the first widely applicable formulations for the most general problem setting, supporting processors with several address registers and complex addressing capabilities. Existing heuristics are similarly extended and practical applicability of the proposed methods is demonstrated by experimental evaluation using an established and large benchmark set. The experiments allow us to study the impact of exploiting more complex memory addressing capabilities on the address computation costs of real-world programs. We also show how to integrate operand reordering techniques for commutative instructions into existing solution approaches.
Managing voluntary turnover through challenging assignments
Preenen, P.T.Y.; Pater, I.E. de; Vianen, A.E.M. van; Keijzer, L.
2011-01-01
This study examines employees' challenging assignments as manageable means to reduce turnover intentions, job search behaviors, and voluntary turnover. Results indicate that challenging assignments are negatively related to turnover intentions and job search behaviors and that these relationships ar
Online Learning of Assignments that Maximize Submodular Functions
Golovin, Daniel; Streeter, Matthew
2009-01-01
Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize value of information? These applications exhibit strong diminishing returns: Selection of redundant ads and information sources decreases their marginal utility. We show that these and other problems can be formalized as repeatedly selecting an assignment of items to positions to maximize a sequence of monotone submodular functions that arrive one by one. We present an efficient algorithm for this general problem and analyze it in the no-regret model. Our algorithm possesses strong theoretical guarantees, such as a performance ratio that converges to the optimal constant of 1-1/e. We empirically evaluate our algorithm on two real-world online optimization problems on the web: ad allocation with submodular utilities, and dynamically ranking blogs to detect information cascades.
5 CFR 870.901 - Assignments permitted.
2010-01-01
... (CONTINUED) FEDERAL EMPLOYEES' GROUP LIFE INSURANCE PROGRAM Assignments of Life Insurance § 870.901..., and compensationers. (2) An individual may assign ownership of all life insurance under this part... Benefit before assigning the remainder of his/her insurance, the amount of Basic insurance does...
7 CFR 1437.104 - Assigned production.
2010-01-01
... 7 Agriculture 10 2010-01-01 2010-01-01 false Assigned production. 1437.104 Section 1437.104... Determining Yield Coverage Using Actual Production History § 1437.104 Assigned production. (a) When determining losses under this section, assigned production will be used to offset the loss of production...
Lexical Stress Assignment in Italian Developmental Dyslexia
Paizi, Despina; Zoccolotti, Pierluigi; Burani, Cristina
2011-01-01
Stress assignment to Italian polysyllabic words is unpredictable, because stress is neither marked nor predicted by rule. Stress assignment, especially to low frequency words, has been reported to be a function of stress dominance and stress neighbourhood. Two experiments investigate stress assignment in sixth-grade, skilled and dyslexic, readers.…
Algorithm for structure constants
Paiva, F M
2011-01-01
In a $n$-dimensional Lie algebra, random numerical values are assigned by computer to $n(n-1)$ especially selected structure constants. An algorithm is then created, which calculates without ambiguity the remaining constants, obeying the Jacobi conditions. Differently from others, this algorithm is suitable even for poor personal computer. ------------- En $n$-dimensia algebro de Lie, hazardaj numeraj valoroj estas asignitaj per komputilo al $n(n-1)$ speciale elektitaj konstantoj de strukturo. Tiam algoritmo estas kreita, kalkulante senambigue la ceterajn konstantojn, obeante kondicxojn de Jacobi. Malsimile al aliaj algoritmoj, tiu cxi tauxgas ecx por malpotenca komputilo.
Integrated assignment and path planning
Murphey, Robert A.
2005-11-01
A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact
A Decision Support System for Supervised Assignment in Banking Decisions
Rigopoulos, George; Psarras, John; Askounis, Dimitrios Th.
This study presents a Decision Support System (DSS) which supports assignment of actions (e.g., numbers, projects, people etc.) into predefined categories according to their score on evaluation criteria. It implements a novel classification algorithm based on multicriteria analysis and fuzzy preference relations. More detailed, assignment to classes is based on the concept of category threshold, which defines at what degree an alternative can be included in a specific category. For each category a threshold is defined by the corresponding decision maker, which indicates its lower limit with respect to the evaluation criteria. Actions are then evaluated according to the criteria and fuzzy inclusion degrees are calculated for each category. Finally, an action is assigned to the category for which the inclusion degree is the maximum. The DSS implements the above classification algorithm, providing a user-friendly interface, which supports decision makers to formulate and solve similar problems. In addition to the DSS, we present a real world application at a classification problem within the environment of a Greek bank. Results derived from evaluation experiments in the business environment provide evidence that the proposed methodology and the DSS can effectively support decision makers in classification decisions. The methodology as well as the proposed DSS can be used to classification problems not only in financial domain but to a variety of domains such as production, environmental, or human resources.
Optimization of Load Assignment to Boilers in Industrial Boiler Plants
Institute of Scientific and Technical Information of China (English)
CAO Jia-cong; QIU Guang; CAO Shuang-hua; LIU Feng-qiang
2004-01-01
Along with the increasing importance of sustainable energy, the optimization of load assignment to boilers in an industrial boiler plant becomes one of the major projects for the optimal operation of boiler plants. Optimal load assignment for power systems has been a long-lasting subject, while it is quite new for industrial boiler plants. The existing methods of optimal load assignment for boiler plants are explained and analyzed briefly in the paper. They all need the fuel cost curves of boilers. Thanks to some special features of the curves for industrial boilers, a new model referred to as minimized departure model (MDM) of optimization of load assignment for boiler plants is developed and proposed in the paper. It merely relies upon the accessible data of two typical working conditions to build the model, viz. the working conditions with the highest efficiency of a boiler and with no-load. Explanation of the algorithm of computer program is given, and effort is made so as to determine in advance how many and which boilers are going to work. Comparison between the results using MDM and the results reported in references is carried out, which proves that MDM is preferable and practicable.
An Investigation of the Partial-Assignment Completion Effect on Students' Assignment Choice Behavior
Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; Conley, Elisha
2011-01-01
This study was designed to investigate the partial assignment completion effect. Seventh-grade students were given a math assignment. After working for 5 min, they were interrupted and their partially completed assignments were collected. About 20 min later, students were given their partially completed assignment and a new, control assignment…
Block-decoupling vibration control using eigenstructure assignment
Wei, Xiaojun; Mottershead, John E.
2016-06-01
A theoretical study is presented on the feasibility of applying active control for the purpose of vibration isolation in lightweight structures by block diagonalisation of the system matrices and at the same time assigning eigenvalues (natural frequencies and damping) to the chosen substructures separately. The methodology, based on eigenstructure assignment using the method of receptances, is found to work successfully when the eigenvalues of the open-loop system are controllable and the open- and closed-loop eigenvalues are distinct. In the first part of the paper results are obtained under the restriction that the mass matrix is diagonal (lumped). This is certainly applicable in the case of numerous engineering systems consisting of discrete masses with flexible interconnections of negligible mass. Later in the paper this restriction is lifted to allow bandedness of the mass matrix. Several numerical examples are used to illustrate the working of the proposed algorithm.
National Aeronautics and Space Administration — SSCI proposes to develop and test a Configuration Optimization for Balanced Runway/Route Assignments (COBRA) tool, which includes analysis and planner algorithms...
Job Assignments, Intrinsic Motivation and Explicit Incentives
Nafziger, Julia
2008-01-01
This paper considers the interplay of job assignments with the intrinsic and extrinsic motivation of an agent. Job assignments influence the self confidence of the agent, and thereby his intrinsic motivation. Monetary reward allow the principal to complement intrinsic motivation with extrinsic incentives. The main result is that the principal chooses an inefficient job assignment rule to enhance the agent's intrinsic motivation even though she can motivate him with monetary rewards. This show...
Arbitrary eigenvalue assignments for linear time-varying multivariable control systems
Nguyen, Charles C.
1987-01-01
The problem of eigenvalue assignments for a class of linear time-varying multivariable systems is considered. Using matrix operators and canonical transformations, it is shown that a time-varying system that is 'lexicography-fixedly controllable' can be made via state feedback to be equivalent to a time-invariant system whose eigenvalues are arbitrarily assignable. A simple algorithm for the design of the state feedback is provided.
Institute of Scientific and Technical Information of China (English)
吴华; 孙恺霞; 娄云; 田娟
2015-01-01
In this paper, on the basis of the manufacturing dispatching system of the province-level metering centers, we established the process for the full life circle management of the power metering assets, analyzed the correspondence between the links in the life circle of the metering assets and the functional modules of the MDS system, proposed the strategy for the full life circle management of the power metering assets based on the MDS system, and at the end, through a specific case, demonstrated the effectiveness and practicality of the management process and strategy.%基于省级计量中心生产调度平台（MDS系统），构建了电能计量资产全寿命周期的管理流程，分析了计量资产全寿命周期环节与MDS系统各业务模块的对应关系，提出了基于MDS系统的电能计量资产全寿命周期流程管理策略。最后以国网重庆市电力公司电力科学研究院计量中心为例，验证了基于MDS系统的电能计量资产全寿命周期流程管理的有效性和实用性。
Java bytecode verification via static single assignment form
DEFF Research Database (Denmark)
Gal, Andreas; Probst, Christian W.; Franz, Michael
2008-01-01
Java Virtual Machines (JVMs) traditionally perform bytecode verification by way of an iterative data-flow analysis. Bytecode verification is necessary to ensure type safety because temporary variables in the JVM are not statically typed. We present an alternative verification mechanism...... that transforms JVM bytecode into Static Single Assignment Form (SSA) and thereby propagates definitions directly to uses. Type checking at control flow merge points can then be performed in a single pass. Our prototype implementation of the new algorithm is faster than the standard JVM bytecode verifier. It has...
Directory of Open Access Journals (Sweden)
Dr.G.Sumathi
2012-05-01
Full Text Available A grid is a heterogeneous computing and communication system that allows a group of nodes to compass a task. The process of assigning the jobs or subtasks to the nodes present in the heterogeneous grid is known as scheduling. The type of scheduling in which the subtasks are assigned to the nodes is known as Local Scheduling.A significant research problem is how to assign resources to the subtasks and order the execution of the subtasks that are matched to maximize performance criterion of a local grid system. This procedure of scheduling is called mapping or resource allocation. MidSFN adverts to Medium Subtask Fastest Node algorithm which classifies the subtasks into three tier categories, High, Middle and Low based on their priority. In MidSFN algorithm priority is assigned based on the new parameters Computational Complexity and Processing Power. The value for processing power is assigned based on the Performance Factor. The value of the Performance Factor is the product of the number of operations per cycle per processor and the number of instructions processed per second. In MidSFN algorithm the subtask of medium computational complexity and resources exhibiting medium processing power are assigned with a high priority. The subtasks are then mapped to respective processors based on the assigned priority for execution. Compared to other local scheduling algorithms, MidSFN algorithm shows efficient load balancing and better computation with effective usage of resources. The effectiveness of this algorithm is evaluated through simulation results.
Integrated consensus-based frameworks for unmanned vehicle routing and targeting assignment
Barnawi, Waleed T.
Unmanned aerial vehicles (UAVs) are increasingly deployed in complex and dynamic environments to perform multiple tasks cooperatively with other UAVs that contribute to overarching mission effectiveness. Studies by the Department of Defense (DoD) indicate future operations may include anti-access/area-denial (A2AD) environments which limit human teleoperator decision-making and control. This research addresses the problem of decentralized vehicle re-routing and task reassignments through consensus-based UAV decision-making. An Integrated Consensus-Based Framework (ICF) is formulated as a solution to the combined single task assignment problem and vehicle routing problem. The multiple assignment and vehicle routing problem is solved with the Integrated Consensus-Based Bundle Framework (ICBF). The frameworks are hierarchically decomposed into two levels. The bottom layer utilizes the renowned Dijkstra's Algorithm. The top layer addresses task assignment with two methods. The single assignment approach is called the Caravan Auction Algorithm (CarA) Algorithm. This technique extends the Consensus-Based Auction Algorithm (CBAA) to provide awareness for task completion by agents and adopt abandoned tasks. The multiple assignment approach called the Caravan Auction Bundle Algorithm (CarAB) extends the Consensus-Based Bundle Algorithm (CBBA) by providing awareness for lost resources, prioritizing remaining tasks, and adopting abandoned tasks. Research questions are investigated regarding the novelty and performance of the proposed frameworks. Conclusions regarding the research questions will be provided through hypothesis testing. Monte Carlo simulations will provide evidence to support conclusions regarding the research hypotheses for the proposed frameworks. The approach provided in this research addresses current and future military operations for unmanned aerial vehicles. However, the general framework implied by the proposed research is adaptable to any unmanned
Directory of Open Access Journals (Sweden)
Sorana D. BOLBOACĂ
2011-06-01
Full Text Available Aim: The properness of random assignment of compounds in training and validation sets was assessed using the generalized cluster technique. Material and Method: A quantitative Structure-Activity Relationship model using Molecular Descriptors Family on Vertices was evaluated in terms of assignment of carboquinone derivatives in training and test sets during the leave-many-out analysis. Assignment of compounds was investigated using five variables: observed anticancer activity and four structure descriptors. Generalized cluster analysis with K-means algorithm was applied in order to investigate if the assignment of compounds was or not proper. The Euclidian distance and maximization of the initial distance using a cross-validation with a v-fold of 10 was applied. Results: All five variables included in analysis proved to have statistically significant contribution in identification of clusters. Three clusters were identified, each of them containing both carboquinone derivatives belonging to training as well as to test sets. The observed activity of carboquinone derivatives proved to be normal distributed on every. The presence of training and test sets in all clusters identified using generalized cluster analysis with K-means algorithm and the distribution of observed activity within clusters sustain a proper assignment of compounds in training and test set. Conclusion: Generalized cluster analysis using the K-means algorithm proved to be a valid method in assessment of random assignment of carboquinone derivatives in training and test sets.
Predicting Assignment Submissions in a Multiclass Classification Problem
Directory of Open Access Journals (Sweden)
Bogdan Drăgulescu
2015-08-01
Full Text Available Predicting student failure is an important task that can empower educators to counteract the factors that affect student performance. In this paper, a part of the bigger problem of predicting student failure is addressed: predicting the students that do not complete their assignment tasks. For solving this problem, real data collected by our university’s educational platform was used. Because the problem consisted of predicting one of three possible classes (multi-class classification, the appropriate algorithms and methods were selected. Several experiments were carried out to find the best approach for this prediction problem and the used data set. An approach of time segmentation is proposed in order to facilitate the prediction from early on. Methods that address the problems of high dimensionality and imbalanced data were also evaluated. The outcome of each approach is shown and compared in order to select the best performing classification algorithm for the problem at hand.
Comparing of the Deterministic Simulated Annealing Methods for Quadratic Assignment Problem
Directory of Open Access Journals (Sweden)
Mehmet Güray ÜNSAL
2013-08-01
Full Text Available In this study, Threshold accepting and Record to record travel methods belonging to Simulated Annealing that is meta-heuristic method by applying Quadratic Assignment Problem are statistically analyzed whether they have a significant difference with regard to the values of these two methods target functions and CPU time. Between the two algorithms, no significant differences are found in terms of CPU time and the values of these two methods target functions. Consequently, on the base of Quadratic Assignment Problem, the two algorithms are compared in the study have the same performance in respect to CPU time and the target functions values
48 CFR 208.7002 - Assignment authority.
2010-10-01
... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Assignment authority. 208..., DEPARTMENT OF DEFENSE ACQUISITION PLANNING REQUIRED SOURCES OF SUPPLIES AND SERVICES Coordinated Acquisition 208.7002 Assignment authority. (a) Under the DoD Coordinated Acquisition Program,...
Individualized Assignments in an Experimental Psychology Course.
Hovancik, John R.
1984-01-01
A computer is used to individualize student assignments in statistics. The principal benefit of individualized activities is that they emphasize decision-making processes rather than correct answers. Students in an individualized assignment group scored higher on an examination than those in a comparison group. (RM)
Detecting Plagiarism in MS Access Assignments
Singh, Anil
2013-01-01
Assurance of individual effort from students in computer-based assignments is a challenge. Due to digitization, students can easily use a copy of their friend's work and submit it as their own. Plagiarism in assignments puts students who cheat at par with those who work honestly and this compromises the learning evaluation process. Using a…
A Role-Based Fuzzy Assignment Model
Institute of Scientific and Technical Information of China (English)
ZUO Bao-he; FENG Shan
2002-01-01
It's very important to dynamically assign the tasks to corresponding actors in workflow management system, especially in complex applications. This improves the flexibility of workflow systems.In this paper, a role-based workflow model with fuzzy optimized intelligent assignment is proposed and applied in the investment management system. A groupware-based software model is also proposed.
Stress Assignment in Reading Italian Polysyllabic Pseudowords
Sulpizio, Simone; Arduino, Lisa S.; Paizi, Despina; Burani, Cristina
2013-01-01
In 4 naming experiments we investigated how Italian readers assign stress to pseudowords. We assessed whether participants assign stress following distributional information such as stress neighborhood (the proportion and number of existent words sharing orthographic ending and stress pattern) and whether such distributional information affects…
Online Discussion Assignments Improve Students' Class Preparation
Lineweaver, Tara T.
2010-01-01
To increase the number of students who read the text before class and to promote student interaction centering on text material, I developed an online discussion assignment as a required component of a cognitive psychology course. Across 2 studies, this assignment had a limited effect on examination performance, but students completing online…
STAQ: Static Traffic Assignment with Queing
Brederode, L.; Bliemer, M.C.J.; Wismans, L.
2010-01-01
Because of computation time issues on large networks, most strategic regional and urban transport models today use static instead of dynamic traffic assignment procedures. Mathematical models of traffic assignment are usually based upon Wardrop’s principle. To solve this static traffic equilibrium p
Airport Gate Assignment: New Model and Implementation
Li, Chendong
2008-01-01
Airport gate assignment is of great importance in airport operations. In this paper, we study the Airport Gate Assignment Problem (AGAP), propose a new model and implement the model with Optimization Programming language (OPL). With the objective to minimize the number of conflicts of any two adjacent aircrafts assigned to the same gate, we build a mathematical model with logical constraints and the binary constraints, which can provide an efficient evaluation criterion for the Airlines to estimate the current gate assignment. To illustrate the feasibility of the model we construct experiments with the data obtained from Continental Airlines, Houston Gorge Bush Intercontinental Airport IAH, which indicate that our model is both energetic and effective. Moreover, we interpret experimental results, which further demonstrate that our proposed model can provide a powerful tool for airline companies to estimate the efficiency of their current work of gate assignment.
Priority-Based Routing Resource Assignment Considering Crosstalk
Institute of Scientific and Technical Information of China (English)
Yi-Ci Cai; Bin Liu; Yan Xiong; Qiang Zhou; Xian-Long Hong
2006-01-01
Crosstalk has become one of the most critical concerns in very deep sub-micron era. This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. Noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage,so that the operations could easily cooperate to fully exert their power on crosstalk reduction. An efficient priority-based heuristic algorithm is developed, which works slice by slice. Crosstalk avoidance, and many other aspects that are critical in routing practice including congestion, vias, layer preference, etc., are taken into account. A track reservation strategy is adopted in the algorithm framework to compensate the undesired effects caused by sequential routing. Experimental results on a series of ISPD98 and industrial benchmarks show that the proposed approach is able to reduce capacitive crosstalk by about 70% on average without compromising completion ratio compared with a previously reported graph based algorithm,demonstrating the advantages of the approach.
Asset-Based Measurement of Poverty
Brandolini, Andrea; Magri, Silvia; Smeeding, Timothy M.
2010-01-01
Poverty is generally defined as income or expenditure insufficiency, but the economic condition of a household also depends on its real and financial asset holdings. This paper investigates measures of poverty that rely on indicators of household net worth. We review and assess two main approaches followed in the literature: income-net worth…
Joux, Antoine
2009-01-01
Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic
Cooperative distributed target tracking algorithm in mobile wireless sensor networks
Institute of Scientific and Technical Information of China (English)
无
2011-01-01
The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor networks.There are two main components in the algorithm:distributed sensor-target assignment and sensor motion control.In the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking cost.Compared with the centralized algorithm and the noncooperative distrib...
5 CFR 870.902 - Making an assignment.
2010-01-01
... assignment. (a) To assign insurance, an insured individual must complete an approved assignment form. Only the insured individual can make an assignment; no one can assign on behalf of an insured individual... 5 Administrative Personnel 2 2010-01-01 2010-01-01 false Making an assignment. 870.902 Section...
Protein secondary structure: category assignment and predictability
DEFF Research Database (Denmark)
Andersen, Claus A.; Bohr, Henrik; Brunak, Søren
2001-01-01
In the last decade, the prediction of protein secondary structure has been optimized using essentially one and the same assignment scheme known as DSSP. We present here a different scheme, which is more predictable. This scheme predicts directly the hydrogen bonds, which stabilize the secondary...... structures. Single sequence prediction of the new three category assignment gives an overall prediction improvement of 3.1% and 5.1%, compared to the DSSP assignment and schemes where the helix category consists of a-helix and 3(10)-helix, respectively. These results were achieved using a standard feed-forward...
The Assignment Game : The Reduced Game
Owen, Guillermo
1992-01-01
Let v be an assignment game. For a given reference payoff vector (x; y), and a coalition S, bargaining within the coalition can be represented by either the reduced game or the derived game. It is known that the reduced game need not be an assignment game (in fact, it need not be super additive) while the derived game is another assignment game, with modified reservation prices. We prove that, when the reference vector is in the core of the game, the derived game is the super additive cover o...
Hougardy, Stefan
2016-01-01
Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.
Automated assignment of NMR chemical shifts based on a known structure and 4D spectra.
Trautwein, Matthias; Fredriksson, Kai; Möller, Heiko M; Exner, Thomas E
2016-08-01
Apart from their central role during 3D structure determination of proteins the backbone chemical shift assignment is the basis for a number of applications, like chemical shift perturbation mapping and studies on the dynamics of proteins. This assignment is not a trivial task even if a 3D protein structure is known and needs almost as much effort as the assignment for structure prediction if performed manually. We present here a new algorithm based solely on 4D [(1)H,(15)N]-HSQC-NOESY-[(1)H,(15)N]-HSQC spectra which is able to assign a large percentage of chemical shifts (73-82 %) unambiguously, demonstrated with proteins up to a size of 250 residues. For the remaining residues, a small number of possible assignments is filtered out. This is done by comparing distances in the 3D structure to restraints obtained from the peak volumes in the 4D spectrum. Using dead-end elimination, assignments are removed in which at least one of the restraints is violated. Including additional information from chemical shift predictions, a complete unambiguous assignment was obtained for Ubiquitin and 95 % of the residues were correctly assigned in the 251 residue-long N-terminal domain of enzyme I. The program including source code is available at https://github.com/thomasexner/4Dassign . PMID:27484442
A New Algorithm for Minimum Cost MRGAP
Directory of Open Access Journals (Sweden)
Lutfu Sagbansua
2009-10-01
Full Text Available This paper introduces an algorithm based on independent and combined strategies of surrogate constraint relaxation and scatter search coupled with simple Tabu search, subgradient optimization, and Lagrangean relaxation. The key contribution of this research is the development of effective RAMP and Primal-Dual RAMP algorithms for the MRGAP. Assignment problems involve assigning a set of jobs at hand to another set of agents which are limited in resources. Depending on the number of constraints, several different types of assignment problems can be formulated. The paper discusses the formulation of such a problem and an algorithm produced to solve these problems. Computational results are provided as a basis of comparison with several algorithms.
Performance-driven assignment and mapping for reliable networks-on-chips
Institute of Scientific and Technical Information of China (English)
Qian-qi LE; Guo-wu YANG; William N.N.HUNG; Xiao-yu SONG; Fu-you FAN
2014-01-01
Network-on-chip (NoC) communication architectures present promising solutions for scalable communication re-quests in large system-on-chip (SoC) designs. Intellectual property (IP) core assignment and mapping are two key steps in NoC design, significantly affecting the quality of NoC systems. Both are NP-hard problems, so it is necessary to apply intelligent algorithms. In this paper, we propose improved intelligent algorithms for NoC assignment and mapping to overcome the draw-backs of traditional intelligent algorithms. The aim of our proposed algorithms is to minimize power consumption, time, area, and load balance. This work involves multiple conflicting objectives, so we combine multiple objective optimization with intelligent algorithms. In addition, we design a fault-tolerant routing algorithm and take account of reliability using comprehensive perfor-mance indices. The proposed algorithms were implemented on embedded system synthesis benchmarks suite (E3S). Experimental results show the improved algorithms achieve good performance in NoC designs, with high reliability.
Tel, G.
1993-01-01
We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of distri
Computerized fetal heart rate analysis in labor: detection of intervals with un-assignable baseline
International Nuclear Information System (INIS)
The fetal heart rate (FHR) is monitored during labor to assess fetal health. Both visual and computerized interpretations of the FHR depend on assigning a baseline to detect key features such as accelerations or decelerations. However, it is sometimes impossible to assign a baseline reliably, by eye or by numerical methods. To address this issue, we used the Oxford Intrapartum FHR Database to derive an algorithm based on the distribution of the FHR that detects heart rate intervals without a clear baseline. We aimed to recognize when a fetus cannot maintain its heart rate baseline and use this to assist computerized FHR analysis. Twenty-three FHR windows (15 min long) were used to develop the method. The algorithm was then validated by comparison with experts who classified 50 FHR windows into two groups: baseline assignable or un-assignable. The average agreement between experts (κ = 0.76) was comparable to the agreement between method and experts (κ = 0.67). The algorithm was used in 22 559 patients with intrapartum FHR records to retrospectively determine the incidence of intervals (defined as 15 min windows) that had un-assignable baselines. Sixty-six percent had one or more such episodes at some stage, most commonly after the onset of pushing (55%) and least commonly pre-labor (16%). These episodes are therefore relatively common. Their detection should improve the reliability of computerized analysis and allow further studies of what they signify clinically
An Approach In Optimization Of Ad-Hoc Routing Algorithms
Directory of Open Access Journals (Sweden)
Sarvesh Kumar Sharma
2012-06-01
Full Text Available In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.
A new routing assignment model for Internet
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
This paper builds a new traffic assignment model for Internet. The routing policy based on this model can realize load splitting in a network automatically, which overcomes the shortcoming of OSPF and satisfies the load balancing requirement of IETF.
Competitive Traffic Assignment in Road Networks
Directory of Open Access Journals (Sweden)
Krylatov Alexander Y.
2016-09-01
Full Text Available Recently in-vehicle route guidance and information systems are rapidly developing. Such systems are expected to reduce congestion in an urban traffic area. This social benefit is believed to be reached by imposing the route choices on the network users that lead to the system optimum traffic assignment. However, guidance service could be offered by different competitive business companies. Then route choices of different mutually independent groups of users may reject traffic assignment from the system optimum state. In this paper, a game theoretic approach is shown to be very efficient to formalize competitive traffic assignment problem with various groups of users in the form of non-cooperative network game with the Nash equilibrium search. The relationships between the Wardrop’s system optimum associated with the traffic assignment problem and the Nash equilibrium associated with the competitive traffic assignment problem are investigated. Moreover, some related aspects of the Nash equilibrium and the Wardrop’s user equilibrium assignments are also discussed.
Dynamic Optimal CCI Weight Channel Pre-evaluative Assignment in Adaptive Array Antenna System
Institute of Scientific and Technical Information of China (English)
MENG Weixiao; ZHANG Naitong
2001-01-01
Dynamic Channel Assignment (DCA)together with Adaptive Array Antenna (AAA) takes an important part in cellular mobile communication system. In this paper, a conception of co-channel in terference (CCI) quantification is advanced in multicell 8-element circular adaptive array antenna system.Normalized CCI weight relational expression, which is concerned in distance and look angle difference is sublimed from experiential sampling, induction and non-linear fitting. Then an algorithm of optimal CCI weight channel pre-evaluation is proposed as a solution of dynamic channel assignment. The least sum of weight value before assignment is used to pre-evaluate the performance of all the channels. Based on an approached practical cellular model, a series of systemclassed simulations are accomplished. Simulation resuits show that this algorithm is quite effective: system capacity is increased greatly; traffic block probabilities are decreased remarkably; nice channel quality is maintained; the reliability of DCA is enhanced; the higher frequency utilization efficiency is also obtained.
Comparison of traffic assignment in VISUM and transport simulation in MATSim
Directory of Open Access Journals (Sweden)
Bartłomiej PIĄTKOWSKI
2013-01-01
Full Text Available The paper presents a comparison of different approaches to traffic modelling and forecasting in VISUM and MATSim. The comparison was based on three indicators: link volumes, average travel time and distance. For this purpose, a virtual city with a road network and an OD matrix describing travel demands were created. Next the input data were created to both systems. The equilibrium and the dynamic stochastic assignment algorithms were used in VISUM while in MATSim a multi-agent approach was used for planning and a queue-based flow model for simulation. The comparison showed that although the overall results obtained in both systems were convergent, the detailed distribution of traffic was different. In VISUM the static assignment algorithm resulted in increased traffic flow on links located near to the connectors, while the dynamic one assigned traffic more uniformly, matching the MATSim’s results.
Solving the Dial-a-Ride Problem using Genetic algorithms
DEFF Research Database (Denmark)
Bergvinsdottir, Kristin Berg; Larsen, Jesper; Jørgensen, Rene Munk
service level constraints (Quality of Service). In this paper we present a genetic algorithm for solving the DARP. The algorithm is based on the classical cluster-first route-second approach, where it alternates between assigning customers to vehicles using a genetic algorithm and solving independent...
DEFF Research Database (Denmark)
Bloch, Søren; Christiansen, Christian Holk
This paper addresses the Two-level Storage Location Assignment Problem (TSLAP) for two level low-level picker-to-part warehouses. The first level consists of a forward area from which all picking is done. The second level consists of a reserve storage area, from which the forward area...... is replenished. A large part of the cost of operating the warehouse is a function of the assignment of items to locations at both the reserve storage and the forward area. The cost of the storage location assignment at the forward area is dependent on the storage location assignment at the reserve area and visa...... versa. This, however, is often neglected in the existing literature. We solve the TSLAP simultaneously for the reserve area and the forward area. Based on randomly generated test instances we show that the solutions of TSLAP compare favorably to solutions found by other algorithms proposed...
Directory of Open Access Journals (Sweden)
de Brevern Alexandre G
2005-09-01
Full Text Available Abstract Background A number of methods are now available to perform automatic assignment of periodic secondary structures from atomic coordinates, based on different characteristics of the secondary structures. In general these methods exhibit a broad consensus as to the location of most helix and strand core segments in protein structures. However the termini of the segments are often ill-defined and it is difficult to decide unambiguously which residues at the edge of the segments have to be included. In addition, there is a "twilight zone" where secondary structure segments depart significantly from the idealized models of Pauling and Corey. For these segments, one has to decide whether the observed structural variations are merely distorsions or whether they constitute a break in the secondary structure. Methods To address these problems, we have developed a method for secondary structure assignment, called KAKSI. Assignments made by KAKSI are compared with assignments given by DSSP, STRIDE, XTLSSTR, PSEA and SECSTR, as well as secondary structures found in PDB files, on 4 datasets (X-ray structures with different resolution range, NMR structures. Results A detailed comparison of KAKSI assignments with those of STRIDE and PSEA reveals that KAKSI assigns slightly longer helices and strands than STRIDE in case of one-to-one correspondence between the segments. However, KAKSI tends also to favor the assignment of several short helices when STRIDE and PSEA assign longer, kinked, helices. Helices assigned by KAKSI have geometrical characteristics close to those described in the PDB. They are more linear than helices assigned by other methods. The same tendency to split long segments is observed for strands, although less systematically. We present a number of cases of secondary structure assignments that illustrate this behavior. Conclusion Our method provides valuable assignments which favor the regularity of secondary structure segments.
Unifying Temporal and Structural Credit Assignment Problems
Agogino, Adrian K.; Tumer, Kagan
2004-01-01
Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the structural credit assignment problem of determining the contributions of a particular agent to a common task. Instead, time-extended single-agent systems have the temporal credit assignment problem of determining the contribution of a particular action to the quality of the full sequence of actions. Traditionally these two problems are considered different and are handled in separate ways. In this article we show how these two forms of the credit assignment problem are equivalent. In this unified frame-work, a single-agent Markov decision process can be broken down into a single-time-step multi-agent process. Furthermore we show that Monte-Carlo estimation or Q-learning (depending on whether the values of resulting actions in the episode are known at the time of learning) are equivalent to different agent utility functions in a multi-agent system. This equivalence shows how an often neglected issue in multi-agent systems is equivalent to a well-known deficiency in multi-time-step learning and lays the basis for solving time-extended multi-agent problems, where both credit assignment problems are present.
Flow Oriented Channel Assignment for Multi-radio Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Niu Zhisheng
2010-01-01
Full Text Available We investigate channel assignment for a multichannel wireless mesh network backbone, where each router is equipped with multiple interfaces. Of particular interest is the development of channel assignment heuristics for multiple flows. We present an optimization formulation and then propose two iterative flow oriented heuristics for the conflict-free and interference-aware cases, respectively. To maximize the aggregate useful end-to-end flow rates, both algorithms identify and resolve congestion at instantaneous bottleneck link in each iteration. Then the link rate is optimally allocated among contending flows that share this link by solving a linear programming (LP problem. A thorough performance evaluation is undertaken as a function of the number of channels and interfaces/node and the number of contending flows. The performance of our algorithm is shown to be significantly superior to best known algorithm in its class in multichannel limited radio scenarios.
A tracked approach for automated NMR assignments in proteins (TATAPRO)
Energy Technology Data Exchange (ETDEWEB)
Atreya, H.S.; Sahu, S.C.; Chary, K.V.R.; Govil, Girjesh [Tata Institute of Fundamental Research, Department of Chemical Sciences (India)
2000-06-15
A novel automated approach for the sequence specific NMR assignments of {sup 1}H{sup N}, {sup 13}C{sup {alpha}}, {sup 13}C{sup {beta}}, {sup 13}C'/{sup 1}H{sup {alpha}} and {sup 15}N spins in proteins, using triple resonance experimental data, is presented. The algorithm, TATAPRO (Tracked AuTomated Assignments in Proteins) utilizes the protein primary sequence and peak lists from a set of triple resonance spectra which correlate {sup 1}H{sup N} and {sup 15}N chemical shifts with those of {sup 13}C{sup {alpha}}, {sup 13}C{sup {beta}} and {sup 13}C'/{sup 1}H{sup {alpha}}. The information derived from such correlations is used to create a 'master{sub l}ist' consisting of all possible sets of {sup 1}H{sup N}{sub i}, {sup 15}N{sub i}, {sup 13}C{sup {alpha}}{sub i}, {sup 13}C{sup {beta}}{sub i}, {sup 13}C'{sub i}/{sup 1}H{sup {alpha}}{sub i}, {sup 13}C{sup {alpha}}{sub i-1}, {sup 13}C{sup {beta}}{sub i-1} and {sup 13}C'{sub i-1}/ {sup 1}H{sup {alpha}}{sub i-1} chemical shifts. On the basis of an extensive statistical analysis of {sup 13}C{sup {alpha}} and {sup 13}C{sup {beta}} chemical shift data of proteins derived from the BioMagResBank (BMRB), it is shown that the 20 amino acid residues can be grouped into eight distinct categories, each of which is assigned a unique two-digit code. Such a code is used to tag individual sets of chemical shifts in the master{sub l}ist and also to translate the protein primary sequence into an array called pps{sub a}rray. The program then uses the master{sub l}ist to search for neighbouring partners of a given amino acid residue along the polypeptide chain and sequentially assigns a maximum possible stretch of residues on either side. While doing so, each assigned residue is tracked in an array called assig{sub a}rray, with the two-digit code assigned earlier. The assig{sub a}rray is then mapped onto the pps{sub a}rray for sequence specific resonance assignment. The program has been tested using
Assignment of fields from particles to mesh
Duque, Daniel
2016-01-01
In Computational Fluid Dynamics there have been many attempts to combine the power of a fixed mesh on which to carry out spatial calculations with that of a set of particles that moves following the velocity field. These ideas indeed go back to Particle-in-Cell methods, proposed about 60 years ago. Of course, some procedure is needed to transfer field information between particles and mesh. There are many possible choices for this "assignment", or "projection". Several requirements may guide this choice. Two well-known ones are conservativity and stability, which apply to volume integrals of the fields. An additional one is here considered: preservation of information. This means that mesh interpolation, followed by mesh assignment, should leave the field values invariant. The resulting methods are termed "mass" assignments due to their strong similarities with the Finite Element Method. We test several procedures, including the well-known FLIP, on three scenarios: simple 1D convection, 2D convection of Zales...
Medicare Accountable Care Organizations: Beneficiary Assignment Update.
Vaughn, Thomas; MacKinney, A Clinton; Mueller, Keith J; Ullrich, Fred; Zhu, Xi
2016-06-01
This brief updates Brief No. 2014-3 and explains changes in the Centers for Medicare & Medicaid Services (CMS) Accountable Care Organization (ACO) regulations issued in June 2015 pertaining to beneficiary assignment for Medicare Shared Savings Program ACOs. Overall, the regulatory changes are intended to (1) encourage ACOs to participate in two-sided risk contracts, (2) increase the likelihood that beneficiaries are assigned to the physician (and ACO) from whom they receive most of their primary care services, and (3) make it easier for Federally Qualified Health Centers (FQHCs) and Rural Health Clinics (RHCs) to participate in ACOs. Understanding ACO beneficiary assignment policies is critical for ACO in managing their panel of ACO providers and beneficiaries. PMID:27416650
From course assignment paper to publishable manuscript.
Rew, Lynn
2012-12-01
Both undergraduate and graduate nursing students are expected to write numerous papers in their educational programs; however, most of these papers are never published. Many students and faculty lack the skills needed to convert a course assignment paper to a publishable manuscript. The purpose of this article is to describe 10 steps that can transform a course assignment paper into a publishable manuscript. These steps include outlining, clarifying the topic, clearly stating the purpose, identifying an appropriate audience, revising with faculty's feedback, querying journal editors, revising to conform to journal's author guidelines, requesting and responding to peer feedback, and finally editing and proofreading prior to submitting the manuscript. Faculty members are encouraged to make writing assignments that students can then convert to publishable manuscripts. Such publications form an essential cornerstone of professional holistic nursing.
Medicare Accountable Care Organizations: Beneficiary Assignment Update.
Vaughn, Thomas; MacKinney, A Clinton; Mueller, Keith J; Ullrich, Fred; Zhu, Xi
2016-06-01
This brief updates Brief No. 2014-3 and explains changes in the Centers for Medicare & Medicaid Services (CMS) Accountable Care Organization (ACO) regulations issued in June 2015 pertaining to beneficiary assignment for Medicare Shared Savings Program ACOs. Overall, the regulatory changes are intended to (1) encourage ACOs to participate in two-sided risk contracts, (2) increase the likelihood that beneficiaries are assigned to the physician (and ACO) from whom they receive most of their primary care services, and (3) make it easier for Federally Qualified Health Centers (FQHCs) and Rural Health Clinics (RHCs) to participate in ACOs. Understanding ACO beneficiary assignment policies is critical for ACO in managing their panel of ACO providers and beneficiaries.
Writing Assignments that Promote Active Learning
Narayanan, M.
2014-12-01
Encourage students to write a detailed, analytical report correlating classroom discussions to an important historical event or a current event. Motivate students interview an expert from industry on a topic that was discussed in class. Ask the students to submit a report with supporting sketches, drawings, circuit diagrams and graphs. Propose that the students generate a complete a set of reading responses pertaining to an assigned topic. Require each student to bring in one comment or one question about an assigned reading. The assignment should be a recent publication in an appropriate journal. Have the students conduct a web search on an assigned topic. Ask them to generate a set of ideas that can relate to classroom discussions. Provide the students with a study guide. The study guide should provide about 10 or 15 short topics. Quiz the students on one or two of the topics. Encourage the students to design or develop some creative real-world examples based on a chapter discussed or a topic of interest. Require that students originate, develop, support and defend a viewpoint using a specifically assigned material. Make the students practice using or utilizing a set of new technical terms they have encountered in an assigned chapter. Have students develop original examples explaining the different terms. Ask the students to select one important terminology from the previous classroom discussions. Encourage the students to explain why they selected that particular word. Ask them to talk about the importance of the terminology from the point of view of their educational objectives and future career. Angelo, T. A. (1991). Ten easy pieces: Assessing higher learning in four dimensions. In T. A. Angelo (Ed.), Classroom research: Early lessons from success (pp. 17-31). New Directions for Teaching and Learning, No. 46. San Francisco: Jossey-Bass.
Tableaux for Dynamic Logic of Propositional Assignments
Lima, Tiago; Herzig, Andreas
2014-01-01
The Dynamic Logic for Propositional Assignments (DL-PA) has recently been studied as an alternative to Propositional Dynamic Logic (PDL). In DL-PA, the abstract atomic programs of PDL are replaced by assignments of propositional variables to truth values. This makes DL-PA enjoy some interesting meta-logical properties that PDL does not, such as eliminability of the Kleene star, compactness and interpolation. We define and analytic tableaux calculus for DL-PA and show that it matches the known...
Evolving Networks with Nonlinear Assignment of Weight
Institute of Scientific and Technical Information of China (English)
TANG Chao; TANG Yi
2006-01-01
We propose a weighted evolving network model in which the underlying topological structure is still driven by the degree according to the preferential attachment rule while the weight assigned to the newly established edges is dependent on the degree in a nonlinear form. By varying the parameter α that controls the function determining the assignment of weight, a wide variety of power-law behaviours of the total weight distributions as well as the diversity of the weight distributions of edges are displayed. Variation of correlation and heterogeneity in the network is illustrated as well.
Experimenting with Request Assignment Simulator (RAS
Directory of Open Access Journals (Sweden)
R. Arokia Paul Rajan
2014-11-01
Full Text Available There is no existence of dedicated simulators on the Internet that studies the impact of load balancing principles of the cloud architectures. Request Assignment Simulator (RAS is a customizable, visual tool that helps to understand the request assignment to the resources based on the load balancing principles. We have designed this simulator to fit into Infrastructure as a Service (IaaS cloud model. In this paper, we present a working manual useful for the conduct of experiment with RAS. The objective of this paper is to instill the user to understand the pertinent parameters in the cloud, their metrics, load balancing principles, and their impact on the performance.
State assignment approach to asynchronous CMOS circuit design
Kantabutra, Vitit; Andreou, Andreas G.
1994-04-01
We present a new algorithm for state assignment in asynchronous circuits so that for each circuit state transition, only one (secondary) state variable switches. No intermediate unstable states are used. The resultant circuits operate at optimum speed in terms of the number of transitions made and use only static CMOS gates. By reducing the number of switching events per state transition, noise due to the switching events is reduced and dynamic power dissipation may also be reduced. Our approach is suitable for asynchronous sequential circuits that are designed from flow tables or state transition diagrams. The proposed approach may also be useful for designing synchronous circuits, but explorations into the subject of clock power would be necessary to determine its usefulness.
UPMASK: unsupervised photometric membership assignment in stellar clusters
Krone-Martins, A
2013-01-01
We develop a method for membership assignment in stellar clusters using only photometry and positions. The method, UPMASK, is aimed to be unsupervised, data driven, model free, and to rely on as few assumptions as possible. It is based on an iterative process, principal component analysis, clustering algorithm, and kernel density estimations. Moreover, it is able to take into account arbitrary error models. An implementation in R was tested on simulated clusters that covered a broad range of ages, masses, distances, reddenings, and also on real data of cluster fields. Running UPMASK on simulations showed that it effectively separates cluster and field populations. The overall spatial structure and distribution of cluster member stars in the colour-magnitude diagram were recovered under a broad variety of conditions. For a set of 360 simulations, the resulting true positive rates (a measurement of purity) and member recovery rates (a measurement of completeness) at the 90% membership probability level reached ...
Systematic evaluation of combined automated NOE assignment and structure calculation with CYANA
Energy Technology Data Exchange (ETDEWEB)
Buchner, Lena; Güntert, Peter, E-mail: guentert@em.uni-frankfurt.de [Goethe University Frankfurt am Main, Institute of Biophysical Chemistry, Center for Biomolecular Magnetic Resonance, and Frankfurt Institute of Advanced Studies (Germany)
2015-05-15
The automated assignment of NOESY cross peaks has become a fundamental technique for NMR protein structure analysis. A widely used algorithm for this purpose is implemented in the program CYANA. It has been used for a large number of structure determinations of proteins in solution but a systematic evaluation of its performance has not yet been reported. In this paper we systematically analyze the reliability of combined automated NOESY assignment and structure calculation with CYANA under a variety of conditions on the basis of the experimental NMR data sets of ten proteins. To evaluate the robustness of the algorithm, the original high-quality experimental data sets were modified in different ways to simulate the effect of data imperfections, i.e. incomplete or erroneous chemical shift assignments, missing NOESY cross peaks, inaccurate peak positions, inaccurate peak intensities, lower dimensionality NOESY spectra, and higher tolerances for the matching of chemical shifts and peak positions. The results show that the algorithm is remarkably robust with regard to imperfections of the NOESY peak lists and the chemical shift tolerances but susceptible to lacking or erroneous resonance assignments, in particular for nuclei that are involved in many NOESY cross peaks.
48 CFR 211.274-5 - Policy for assignment of Government-assigned serial numbers.
2010-10-01
... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Policy for assignment of... DEFENSE ACQUISITION REGULATIONS SYSTEM, DEPARTMENT OF DEFENSE ACQUISITION PLANNING DESCRIBING AGENCY NEEDS Using and Maintaining Requirements Documents 211.274-5 Policy for assignment of...
75 FR 55352 - Delegation of Authorities and Assignment of Responsibilities
2010-09-10
... of the Secretary Delegation of Authorities and Assignment of Responsibilities Secretary's Order 5-2010 Subject: Delegation of Authorities and Assignment of Responsibilities to the Administrator, Wage and Hour Division. 1. Purpose. To delegate authorities and assign responsibilities to...
Lemak, Alexander; Steren, Carlos A; Arrowsmith, Cheryl H; Llinás, Miguel
2008-05-01
ABACUS [Grishaev et al. (2005) Proteins 61:36-43] is a novel protocol for automated protein structure determination via NMR. ABACUS starts from molecular fragments defined by unassigned J-coupled spin-systems and involves a Monte Carlo stochastic search in assignment space, probabilistic sequence selection, and assembly of fragments into structures that are used to guide the stochastic search. Here, we report further development of the two main algorithms that increase the flexibility and robustness of the method. Performance of the BACUS [Grishaev and Llinás (2004) J Biomol NMR 28:1-101] algorithm was significantly improved through use of sequential connectivities available from through-bond correlated 3D-NMR experiments, and a new set of likelihood probabilities derived from a database of 56 ultra high resolution X-ray structures. A Multicanonical Monte Carlo procedure, Fragment Monte Carlo (FMC), was developed for sequence-specific assignment of spin-systems. It relies on an enhanced assignment sampling and provides the uncertainty of assignments in a quantitative manner. The efficiency of the protocol was validated on data from four proteins of between 68-116 residues, yielding 100% accuracy in sequence specific assignment of backbone and side chain resonances.
A Literature Assignment with a Civic Emphasis.
Brough, Barbara L.
1989-01-01
Describes how students wrestled with an assignment that asked them to name their heroes or heroines, compare them to "Beowulf," and defend their choices in writing and class discussion. Tells how students gained insight into their community and the ways in which people make it better. (MG)
Writing Assignments Based on Literary Works.
Matthews, Dorothy, Ed.
1985-01-01
The literature selections serving as the basis for writing assignments in the articles in this journal issue range from time-honored English classics ("Beowulf,""Sir Gawain and the Green Knight") and American standards ("A Farewell to Arms,""The Scarlet Letter") to contemporary fiction. The articles deal with works by women writers (Shirley…
Tabu search for target-radar assignment
DEFF Research Database (Denmark)
Hindsberger, Magnus; Vidal, Rene Victor Valqui
2000-01-01
In the paper the problem of assigning air-defense illumination radars to enemy targets is presented. A tabu search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches, implementation and experimental aspects are discussed. It is argued ...
Test-assignment: a quadratic coloring problem
Duives, Jelle; Lodi, Andrea; Malaguti, Enrico
2013-01-01
We consider the problem of assigning the test variants of a written exam to the desks of a classroom in such a way that desks that are close-by receive different variants. The problem is a generalization of the Vertex Coloring and we model it as a binary quadratic problem. Exact solution methods bas
Politics, Internet Assignments, and Civic Knowledge.
May, Vaughn
2000-01-01
Describes how one professor of American government fights the apathy and cynicism of college students toward politics by using the Internet to help students more fairly appraise the workings of the American political system. One assignment has students research and manage a particular public policy initiative through visits to Web sites…
Incentivized optimal advert assignment via utility decomposition
F. Kelly; P. Key; N. Walton
2014-01-01
We consider a large-scale Ad-auction where adverts are assigned over a potentially infinite number of searches. We capture the intrinsic asymmetries in information between advertisers, the advert platform and the space of searches: advertisers know and can optimize the average performance of their a
Teaching Historical Analysis through Creative Writing Assignments
Peterson, Janine Larmon; Graham, Lea
2015-01-01
Incorporating creative writing exercises in history courses can heighten students' critical reading and analytical skills in an active learning model. We identify and define two types of possible assignments that use model texts as their locus: centripetal, which focuses on specific context and disciplinary terms, and centrifugal, which address…
On Online Assignments in a Calculus Class
Jungic, Veselin; Kent, Deborah; Menz, Petra
2012-01-01
In this paper, we describe our experience with the creation and utilization of online assignments for several calculus classes at Simon Fraser University (SFU). We present our findings regarding available software by considering the needs and perspectives of the instructors, students, and administrators. We provide a list of questions that guide…
An Optimal Online Algorithm for Halfplane Intersection
Institute of Scientific and Technical Information of China (English)
WU Jigang; JI Yongchang; CHEN Guoliang
2000-01-01
The intersection of N halfplanes is a basic problem in computational geometry and computer graphics. The optimal offiine algorithm for this problem runs in time O(N log N). In this paper, an optimal online algorithm which runs also in time O(N log N) for this problem is presented. The main idea of the algorithm is to give a new definition for the left side of a given line, to assign the order for the points of a convex polygon, and then to use binary search method in an ordered vertex set. The data structure used in the algorithm is no more complex than array.
Assignment and Correspondence Tracking System - Tactical / Operational Reporting
Social Security Administration — Reporting data store for the Assignment and Correspondence Tracking System (ACT). ACT automates the assignment and tracking of correspondence processing within the...
Stochastic User Equilibrium Traffic Assignment with Turn-delays in Intersections
DEFF Research Database (Denmark)
Nielsen, Otto Anker; Simonsen, Nikolaj; Frederiksen, Rasmus Dyhr
1997-01-01
Turn-delays in intersections contribute significant to travel times and thus route choices in urban networks. However, turns are difficult to handle in traffic assignment models due to the asymmetric Jacobian in the cost functions. The paper describes a model where turn delays have been included...... in the solution algorithm of Sto-chastic User Equilibrium traffic assignment (SUE). When the Jacobian is symme-tric, SUE minimises the road users' 'perceived travel resistance’s'. This equals a probit-model where the links cost-functions are traffic dependent. Hereby, overlap-ping routes are handled...
Artificial intelligence applied to assigned merchandise location in retail sales systems
Directory of Open Access Journals (Sweden)
Cruz-Domínguez, O.
2016-05-01
Full Text Available This paper presents an option for improving the process of assigning storage locations for merchandise in a warehouse. A disadvantage of policies in the literature is that the merchandise is assigned allocation only according to the volume of sales and the rotation it presents. However, in some cases it is necessary to deal with other aspects such as family group membership, the physical characteristics of the products, and their sales pattern to design an integral policy. This paper presents an alternative to the afore- mentioned process using Flexsim®, artificial neural networks, and genetic algorithms.
A New Page Ranking Algorithm Based On WPRVOL Algorithm
Directory of Open Access Journals (Sweden)
Roja Javadian Kootenae
2013-03-01
Full Text Available The amount of information on the web is always growing, thus powerful search tools are needed to search for such a large collection. Search engines in this direction help users so they can find their desirable information among the massive volume of information in an easier way. But what is important in the search engines and causes a distinction between them is page ranking algorithm used in them. In this paper a new page ranking algorithm based on "Weighted Page Ranking based on Visits of Links (WPRVOL Algorithm" for search engines is being proposed which is called WPR'VOL for short. The proposed algorithm considers the number of visits of first and second level in-links. The original WPRVOL algorithm takes into account the number of visits of first level in-links of the pages and distributes rank scores based on the popularity of the pages whereas the proposed algorithm considers both in-links of that page (first level in-links and in-links of the pages that point to it (second level in-links in order to calculation of rank of the page, hence more related pages are displayed at the top of search result list. In the summary it is said that the proposed algorithm assigns higher rank to pages that both themselves and pages that point to them be important.
Genetic Algorithms Principles Towards Hidden Markov Model
Directory of Open Access Journals (Sweden)
Nabil M. Hewahi
2011-10-01
Full Text Available In this paper we propose a general approach based on Genetic Algorithms (GAs to evolve Hidden Markov Models (HMM. The problem appears when experts assign probability values for HMM, they use only some limited inputs. The assigned probability values might not be accurate to serve in other cases related to the same domain. We introduce an approach based on GAs to find
out the suitable probability values for the HMM to be mostly correct in more cases than what have been used to assign the probability values.
Dominant pole and eigenstructure assignment for positive systems with state feedback
Li, Zhao; Lam, James
2016-09-01
In this paper, the dominant pole assignment problem, the dominant eigenstructure assignment problem and the robust dominant pole assignment problem for linear time-invariant positive systems with state feedback are considered. The dominant pole assignment problem is formulated as a linear programming problem, and the dominant eigenstructure problem is formulated as a quasiconvex optimisation problem with linear constraints. The robust dominant pole assignment problem is formulated as a non-convex optimisation problem with non-linear constraints which is solved using particle swarm optimisation (PSO) with an efficient scheme which employs the dominant eigenstructure assignment technique to accelerate the convergence of the PSO procedure. Each of the three problems can be further constrained by requiring that the controller has a pre-specified structure, or the gain matrix have both elementwise upper and lower bounds. These constraints can be incorporated into the proposed scheme without increasing the complexity of the algorithms. Both the continuous-time case and the discrete-time case are treated in the paper.
Hromkovic, Juraj
2009-01-01
Explores the science of computing. This book starts with the development of computer science, algorithms and programming, and then explains and shows how to exploit the concepts of infinity, computability, computational complexity, nondeterminism and randomness.
A linear-time algorithm for Euclidean feature transform sets
Hesselink, Wim H.
2007-01-01
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the function that assigns to every pixel the set of background pixels with this distance. We present an algorithm to compute the
Incentivized optimal advert assignment via utility decomposition
Kelly, F.; Key, P.; Walton, N.
2014-01-01
We consider a large-scale Ad-auction where adverts are assigned over a potentially infinite number of searches. We capture the intrinsic asymmetries in information between advertisers, the advert platform and the space of searches: advertisers know and can optimize the average performance of their advertisement campaign; the platform knows and can optimize on each search instance; and, neither party knows the distribution of the infinite number of searches that can occur. We look at maximizin...
Online Ad Assignment with an Ad Exchange
Dvořák, Wolfgang; Henzinger, Monika
2016-01-01
Ad exchanges are becoming an increasingly popular way to sell advertisement slots on the internet. An ad exchange is basically a spot market for ad impressions. A publisher who has already signed contracts reserving advertisement impressions on his pages can choose between assigning a new ad impression for a new page view to a contracted advertiser or to sell it at an ad exchange. This leads to an online revenue maximization problem for the publisher. Given a new impression to sell decide whe...
Structural Encoding of Static Single Assignment Form
DEFF Research Database (Denmark)
Gal, Andreas; Probst, Christian; Franz, Michael
2005-01-01
Static Single Assignment (SSA) form is often used as an intermediate representation during code optimization in Java Virtual Machines. Recently, SSA has successfully been used for bytecode verification. However, constructing SSA at the code consumer is costly. SSAbased mobile code transport formats...... Java bytecode. While the resulting bytecode sequence can still be directly executed by traditional Virtual Machines, our novel VM can infer SSA form and confirm its safety with virtually no overhead....
Automated feedback generation for introductory programming assignments
Singh, Rishabh; Gulwani, Sumit; Solar-Lezama, Armando
2013-01-01
We present a new method for automatically providing feedback for introductory programming problems. In order to use this method, we need a reference implementation of the assignment, and an error model consisting of potential corrections to errors that students might make. Using this information, the system automatically derives minimal corrections to student's incorrect solutions, providing them with a measure of exactly how incorrect a given solution was, as well as feedback about what they...
Assignation of limited resources in pediatrics
Directory of Open Access Journals (Sweden)
Garduño Espinosa Armando
2014-07-01
Full Text Available Limited resources assignation is fundamental in the development of health services and since they will never be enough, justice is- sues arise. Many distributive justice theories are discussed: liberal, equilable and utilitarian, as well as ethic principles and cost-benefit relation, that is, the consequences. Palliative medicine is suggested as a strategy to reduce the cost of hospitable care and to enhance its designation.
28 CFR 301.103 - Inmate work assignments.
2010-07-01
... COMPENSATION General § 301.103 Inmate work assignments. The unit team of each inmate, which ordinarily designates work assignments, or whoever makes work assignments, shall review appropriate medical records... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Inmate work assignments. 301.103...
38 CFR 19.3 - Assignment of proceedings.
2010-07-01
... 38 Pensions, Bonuses, and Veterans' Relief 2 2010-07-01 2010-07-01 false Assignment of proceedings... Assignment of proceedings. (a) Assignment. The Chairman may assign a proceeding instituted before the Board, including any motion, to an individual Member or to a panel of three or more Members for adjudication...
28 CFR 524.72 - CIM assignment categories.
2010-07-01
.... Factors to consider in classifying an individual to this assignment include, but are not limited to... 28 Judicial Administration 2 2010-07-01 2010-07-01 false CIM assignment categories. 524.72 Section... assignment categories. CIM cases are classified according to the following assignments: (a) Witness...
49 CFR 821.35 - Assignment, duties and powers.
2010-10-01
... SAFETY BOARD RULES OF PRACTICE IN AIR SAFETY PROCEEDINGS Law Judges § 821.35 Assignment, duties and powers. (a) Assignment of law judge and duration of assignment. The chief law judge shall assign a law... addressed to the Case Manager for handling by the chief law judge, who may handle these matters...
QoS Aware Wavelength Assignment in Wavelength Division Multiplexing Based Optical Networks
Directory of Open Access Journals (Sweden)
U. Mahmud
2015-01-01
Full Text Available Wavelength Division Multiplexing (WDM is used in optical networks to implement data circuits. These circuits allow exchange of information as a measure of wavelength in optical domain. Quality of Service (QoS provisioning is one of the issues in WDM optical networks. This paper discusses different QoS aware Routing and Wavelength Assignment (RWA algorithms. Some unaddressed issues are identified that include the effects of degraded performance, traffic patterns and type of QoS service for users. A software module is proposed that calculates a ‘D’ factor facilitating in the wavelength assignment for QoS provisioning. This module is designed to work in conjunction with existing RWA algorithms.
Hawthorn-Embree, Meredith L.; Taylor, Emily P.; Skinner, Christopher H.; Parkhurst, John; Nalls, Meagan L.
2014-01-01
After students acquire a skill, mastery often requires them to choose to engage in assigned academic activities (e.g., independent seatwork, and homework). Although students may be more likely to choose to work on partially completed assignments than on new assignments, the partial assignment completion (PAC) effect may not be very powerful. The…
Algorithms for worst-case tolerance optimization
DEFF Research Database (Denmark)
Schjær-Jacobsen, Hans; Madsen, Kaj
1979-01-01
New algorithms are presented for the solution of optimum tolerance assignment problems. The problems considered are defined mathematically as a worst-case problem (WCP), a fixed tolerance problem (FTP), and a variable tolerance problem (VTP). The basic optimization problem without tolerances...... is denoted the zero tolerance problem (ZTP). For solution of the WCP we suggest application of interval arithmetic and also alternative methods. For solution of the FTP an algorithm is suggested which is conceptually similar to algorithms previously developed by the authors for the ZTP. Finally, the VTP...... is solved by a double-iterative algorithm in which the inner iteration is performed by the FTP- algorithm. The application of the algorithm is demonstrated by means of relatively simple numerical examples. Basic properties, such as convergence properties, are displayed based on the examples....
The quadratic assignment problem: an analysis of applications and solution strategies
Liggett, Robin S
1980-01-01
A wide variety of practical problems in design, planning, and management can be formulated as quadratic assignment problems, and this paper discusses this class of problem. Since algorithms for producing optimal solutions to such problems are computationally infeasible for all but small problems of this type, heuristic techniques must usually be employed for the solution of real practical problems. This paper explores and compares a variety of solution techniques found in the literature, cons...
Karipidis, Eleftherios; Sidiropoulos, Nicholas; Tassiulas, Leandros
2008-01-01
The joint power control and base station (BS) assignment problem is considered under Quality-of-Service (QoS) constraints. If a feasible solution exists, the problem can be efficiently solved using existing distributed algorithms. Infeasibility is often encountered in practice, however, which brings up the issue of optimal admission control. The joint problem is NP-hard, yet important for QoS provisioning and bandwidth-efficient operation of existing and emerging cellular and overlay/underlay...
DEFF Research Database (Denmark)
Markham, Annette
This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also...
Hu, T C
2002-01-01
Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9
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.
Assignment procedure biases in randomized policy experiments
DEFF Research Database (Denmark)
Kirchsteiger, Georg; Sebald, Alexander Christopher; Aldashev, Gani
2016-01-01
Randomized controlled trials (RCT) have gained ground as the dominant tool for studying policy interventions in many fields of applied economics. We analyse theoretically encouragement and resentful demoralization in RCTs and show that these might be rooted in the same behavioural trait - people......’s propensity to act reciprocally. When people are motivated by reciprocity, the choice of assignment procedure influences the RCTs’ findings. We show that even credible and explicit randomization procedures do not guarantee an unbiased prediction of the impact of policy interventions; however, they minimize...
Algorithms and theoretical topics on selected combinatorial optimization problems
Kaveh, Arman
2010-01-01
We study the Quadratic Assignment Problem (QAP), Three Dimensional Assignment Problem (3AP) and Quadratic Three Dimensional Assignment Problem (Q3AP), which combines aspects of both QAP and 3AP. The three problems are known to be NP-hard. We propose new algorithms for obtaining near optimal solutions of QAP and 3AP and present computational results. Our algorithms obtain improved solutions in some benchmark instances of QAP and 3AP. We also discuss theoretical results on 3AP and Q3AP such as ...
Efficient routing and spectrum assignment in elastic optical networks with time scheduled traffic
Qiu, Yang; Fan, Zheyu; Chan, Chun-Kit
2016-07-01
Elastic optical networks (EONs) employ dynamic routing and spectrum assignment (RSA) algorithms to support diverse services and heterogeneous requests. However, these RSA algorithms may possibly induce spectrum fragments when allocating spectrum to accommodate different service requests. Therefore, such induced spectrum fragments should also be regarded as spectrum consumption besides the allocated spectrum by RSA algorithms. In this paper, by additionally considering the holding times of lightpaths and service connections, we first introduce a comprehensive spectrum consumption model to simultaneously investigate both the allocated and the fragmented spectrum consumptions. Then we solve this model in both static and dynamic traffic scenarios, by either formulating the RSA problem with time-scheduled traffic or introducing a time-aware spectrum-efficient heuristics algorithm. Since no defragmentation is executed in spectrum allocation, the proposed RSA algorithm requires no traffic disruption and can be realized more easily in reality. Simulation results show that the proposed algorithm reduces the comprehensive spectrum consumption and has lower bandwidth blocking probability than the typical first-fit RSA algorithm.
Directory of Open Access Journals (Sweden)
Xiangmin Guan
2015-01-01
Full Text Available Considering reducing the airspace congestion and the flight delay simultaneously, this paper formulates the airway network flow assignment (ANFA problem as a multiobjective optimization model and presents a new multiobjective optimization framework to solve it. Firstly, an effective multi-island parallel evolution algorithm with multiple evolution populations is employed to improve the optimization capability. Secondly, the nondominated sorting genetic algorithm II is applied for each population. In addition, a cooperative coevolution algorithm is adapted to divide the ANFA problem into several low-dimensional biobjective optimization problems which are easier to deal with. Finally, in order to maintain the diversity of solutions and to avoid prematurity, a dynamic adjustment operator based on solution congestion degree is specifically designed for the ANFA problem. Simulation results using the real traffic data from China air route network and daily flight plans demonstrate that the proposed approach can improve the solution quality effectively, showing superiority to the existing approaches such as the multiobjective genetic algorithm, the well-known multiobjective evolutionary algorithm based on decomposition, and a cooperative coevolution multiobjective algorithm as well as other parallel evolution algorithms with different migration topology.
DEFF Research Database (Denmark)
Gustavson, Fred G.; Reid, John K.; Wasniewski, Jerzy
2007-01-01
variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel...
Assigning functional meaning to digital circuits
Energy Technology Data Exchange (ETDEWEB)
Eckmann, S.T.; Chisholm, G.H. [Argonne National Lab., IL (United States). Decision and Information Sciences Div.
1997-07-01
During computer-aided design, the problem of how to determine the logical function of a digital circuit arises in many contexts. For example, assigning functional meaning to a circuit is a fundamental operation in both reverse engineering and implementation validation. This report describes such a determination by discussing how a higher-level functional representation is constructed from a detailed circuit description (i.e., a gate-level netlist, which is a list of logic gates and their interconnections). The approach used involves transforming parts of the netlist into a functional representation and then manipulating this representation. Two types of functional representations are described: (1) a mathematical representation based on the logical operators ``exor`` and ``and`` and (2) a directed acyclic graph representation based on binary decision trees. Each representation provides a canonical form of the logical function being implemented (i.e., a form that is independent of implementation details). Such forms, however, have a well-known problem associated with the ordering of inputs: for each order, a unique form exists. A solution to this problem is given for both representations. Experimental results that demonstrate the use of these representations in the process of assigning functional meaning to a circuit are provided. The report also identifies and discusses issues critical to the performance required of this fundamental operation.
Fast automated protein NMR data collection and assignment by ADAPT-NMR on Bruker spectrometers
Lee, Woonghee; Hu, Kaifeng; Tonelli, Marco; Bahrami, Arash; Neuhardt, Elizabeth; Glass, Karen C.; Markley, John L.
2013-11-01
ADAPT-NMR (Assignment-directed Data collection Algorithm utilizing a Probabilistic Toolkit in NMR) supports automated NMR data collection and backbone and side chain assignment for [U-13C, U-15N]-labeled proteins. Given the sequence of the protein and data for the orthogonal 2D 1H-15N and 1H-13C planes, the algorithm automatically directs the collection of tilted plane data from a variety of triple-resonance experiments so as to follow an efficient pathway toward the probabilistic assignment of 1H, 13C, and 15N signals to specific atoms in the covalent structure of the protein. Data collection and assignment calculations continue until the addition of new data no longer improves the assignment score. ADAPT-NMR was first implemented on Varian (Agilent) spectrometers [A. Bahrami, M. Tonelli, S.C. Sahu, K.K. Singarapu, H.R. Eghbalnia, J.L. Markley, PLoS One 7 (2012) e33173]. Because of broader interest in the approach, we present here a version of ADAPT-NMR for Bruker spectrometers. We have developed two AU console programs (ADAPT_ORTHO_run and ADAPT_NMR_run) that run under TOPSPIN Versions 3.0 and higher. To illustrate the performance of the algorithm on a Bruker spectrometer, we tested one protein, chlorella ubiquitin (76 amino acid residues), that had been used with the Varian version: the Bruker and Varian versions achieved the same level of assignment completeness (98% in 20 h). As a more rigorous evaluation of the Bruker version, we tested a larger protein, BRPF1 bromodomain (114 amino acid residues), which yielded an automated assignment completeness of 86% in 55 h. Both experiments were carried out on a 500 MHz Bruker AVANCE III spectrometer equipped with a z-gradient 5 mm TCI probe. ADAPT-NMR is available at http://pine.nmrfam.wisc.edu/ADAPT-NMR in the form of pulse programs, the two AU programs, and instructions for installation and use.
WDM Multicast Tree Construction Algorithms and Their Comparative Evaluations
Makabe, Tsutomu; Mikoshi, Taiju; Takenaka, Toyofumi
We propose novel tree construction algorithms for multicast communication in photonic networks. Since multicast communications consume many more link resources than unicast communications, effective algorithms for route selection and wavelength assignment are required. We propose a novel tree construction algorithm, called the Weighted Steiner Tree (WST) algorithm and a variation of the WST algorithm, called the Composite Weighted Steiner Tree (CWST) algorithm. Because these algorithms are based on the Steiner Tree algorithm, link resources among source and destination pairs tend to be commonly used and link utilization ratios are improved. Because of this, these algorithms can accept many more multicast requests than other multicast tree construction algorithms based on the Dijkstra algorithm. However, under certain delay constraints, the blocking characteristics of the proposed Weighted Steiner Tree algorithm deteriorate since some light paths between source and destinations use many hops and cannot satisfy the delay constraint. In order to adapt the approach to the delay-sensitive environments, we have devised the Composite Weighted Steiner Tree algorithm comprising the Weighted Steiner Tree algorithm and the Dijkstra algorithm for use in a delay constrained environment such as an IPTV application. In this paper, we also give the results of simulation experiments which demonstrate the superiority of the proposed Composite Weighted Steiner Tree algorithm compared with the Distributed Minimum Hop Tree (DMHT) algorithm, from the viewpoint of the light-tree request blocking.
Xia, Yan; Zeng, Yingzhi
2016-02-01
This paper proposed a broadcast Channel Assignment Mechanism on base of optimized Broadcast Tree for wireless Mesh network (WMN), which is created by Branch and Bound Method. The simulations show that our algorithm not only reduces the broadcast redundancy but also avoids the potential channel interferences produced by unnecessary relay nodes.
7 CFR 1404.3 - Payments which may be assigned.
2010-01-01
... OF AGRICULTURE GENERAL REGULATIONS AND POLICIES ASSIGNMENT OF PAYMENTS § 1404.3 Payments which may be assigned. Except as otherwise provided in this part or in individual program regulations, contracts...
Methods of using the quadratic assignment problem solution
Directory of Open Access Journals (Sweden)
Izabela Kudelska
2012-09-01
Full Text Available Background: Quadratic assignment problem (QAP is one of the most interesting of combinatorial optimization. Was presented by Koopman and Beckamanna in 1957, as a mathematical model of the location of indivisible tasks. This problem belongs to the class NP-hard issues. This forces the application to the solution already approximate methods for tasks with a small size (over 30. Even though it is much harder than other combinatorial optimization problems, it enjoys wide interest because it models the important class of decision problems. Material and methods: The discussion was an artificial intelligence tool that allowed to solve the problem QAP, among others are: genetic algorithms, Tabu Search, Branch and Bound. Results and conclusions: QAP did not arise directly as a model for certain actions, but he found its application in many areas. Examples of applications of the problem is: arrangement of buildings on the campus of the university, layout design of electronic components in systems with large scale integration (VLSI, design a hospital, arrangement of keys on the keyboard.
Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem
Directory of Open Access Journals (Sweden)
M. Rodriguez-Molins
2014-01-01
Full Text Available Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for scheduling problems without any previous knowledge about incidences. This paper is based on proportionally distributing operational buffers among the tasks. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems. The dynamism and uncertainty are managed by assessing the robustness of the schedules. The robustness is introduced by means of operational buffer times to absorb those unknown incidences or breakdowns. Therefore, this problem becomes a multiobjective combinatorial optimization problem that aims to minimize the total service time, to maximize the buffer times, and to minimize the standard deviation of the buffer times. To this end, a mathematical model and a new hybrid multiobjective metaheuristic is presented and compared with two well-known multiobjective genetic algorithms: NSGAII and SPEA2+.
Assignment Choice: Do Students Choose Briefer Assignments or Finishing What They Started?
Hawthorn-Embree, Meredith L.; Skinner, Christopher H.; Parkhurst, John; O'Neil, Michael; Conley, Elisha
2010-01-01
Academic skill development requires engagement in effortful academic behaviors. Although students may be more likely to choose to engage in behaviors that require less effort, they also may be motivated to complete assignments that they have already begun. Seventh-grade students (N = 88) began a mathematics computation worksheet, but were stopped…
Survey of the research on dynamic weapon-target assignment problem
Institute of Scientific and Technical Information of China (English)
Cai Huaiping; Liu Jingxu; Chen Yingwu; Wang Hao
2006-01-01
The basic concepts and models of weapon-target assignment (WTA) are introduced and the mathematical nature of the WTA models is also analyzed. A systematic survey of research on WTA problem is provided. The present research on WTA is focused on models and algorithms. In the research on models of WTA, the static WTA models are mainly studied and the dynamic WTA models are not fully studied in deed. In the research on algorithms of WTA, the intelligent algorithms are often used to solve the WTA problem. The small scale of static WTA problems has been solved very well, however, the large scale of dynamic WTA problems has not been solved effectively so far. Finally, the characteristics of dynamic WTA are analyzed and directions for the future research on dynamic WTA are discussed.
A New RWA Algorithm Based on Multi-Objective
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
In this article, we studied the associated research problems and challenges on routing and wavelength assignment (RWA) in WDM (wavelength division multiplexing) networks. Various RWA approaches are examined and compared. We proposed a new RWA algorithm based on multi-objective. In this new algorithm, we consider multiple network optimizing objectives to setup a lightpath with maximize profit and shortest path under the limited resources. By comparing and analyzing, the proposed algorithm is much better ...
Learning through Writing: Teaching Critical Thinking Skills in Writing Assignments
Cavdar, Gamze; Doe, Sue
2012-01-01
Traditional writing assignments often fall short in addressing problems in college students' writing as too often these assignments fail to help students develop critical thinking skills and comprehension of course content. This article reports the use of a two-part (staged) writing assignment with postscript as a strategy for improving critical…
75 FR 55354 - Delegation of Authority and Assignment of Responsibilities
2010-09-10
... of the Secretary Delegation of Authority and Assignment of Responsibilities Secretary's Order 3-2010 Subject: Delegation of Authority and Assignment of Responsibilities to the Employee Benefits Security Administration. 1. Purpose. To delegate authority and assign responsibilities for the administration of...
7 CFR 762.160 - Assignment of guarantee.
2010-01-01
... of the loan. The holder must assign the guaranteed portion back to the original lender if requested... AGRICULTURE SPECIAL PROGRAMS GUARANTEED FARM LOANS § 762.160 Assignment of guarantee. (a) The following general requirements apply to assigning guaranteed loans: (1) Subject to Agency concurrence, the...
24 CFR 255.2 - GNMA right to assignment.
2010-04-01
... will have the right to perfect an assignment of the mortgage to itself. However, before exercising this right, GNMA will attempt to have the Mortgage assigned to another eligible coinsuring lender (unless... defaulting lender-issuer, GNMA will have the right to perfect an assignment of the Coinsured...
24 CFR 252.2 - GNMA right to assignment.
2010-04-01
....2 GNMA right to assignment. If the lender-issuer defaults on its obligations under the GNMA Mortgage... defaulting lender-issuer, GNMA will have the right to perfect an assignment of the mortgage to itself. However, before exercising this right, GNMA will attempt to have the Mortgage assigned to another...
24 CFR 251.2 - GNMA right to assignment.
2010-04-01
... right to assignment. If the lender-issuer defaults on its obligations under the GNMA Mortgage-Backed...-issuer, GNMA will have the right to perfect an assignment of the mortgage to itself. However, before exercising this right, GNMA will attempt to have the Mortgage assigned to another eligible coinsuring...
Solving the k-cardinality assignment problem by transformation
A. Volgenant
2004-01-01
The k-cardinality Linear Assignment Problem (k-LAP) with k a given integer is a generalization of the linear assignment problem: one wants to assign k rows (a free choice out of more rows) to k columns (a free choice out of more columns) minimizing the sum of the corresponding costs. For this polyno
42 CFR 60.38 - Assignment of a HEAL loan.
2010-10-01
... 42 Public Health 1 2010-10-01 2010-10-01 false Assignment of a HEAL loan. 60.38 Section 60.38... ASSISTANCE LOAN PROGRAM The Lender and Holder § 60.38 Assignment of a HEAL loan. A HEAL note may not be assigned except to another HEAL lender, the Student Loan Marketing Association (popularly known as...
APPLYING REINFORCEMENT LEARNING TO THE WEAPON ASSIGNMENT PROBLEM IN AIR DEFENCE
Directory of Open Access Journals (Sweden)
Herman Le Roux
2011-11-01
Full Text Available The modern battlefield is a fast-paced, information-rich environment, where discovery of intent, situation awareness and the rapid evolution of concepts of operation and doctrine are critical success factors. A combination of the techniques investigated and tested in this work, together with other techniques in Artificial Intelligence (AI and modern computational techniques, may hold the key to relieving the burden of the decision-maker and aiding in better decision-making under pressure. The techniques investigated in this article were two methods from the machine-learning subfield of reinforcement learning (RL, namely a Monte Carlo (MC control algorithm with exploring starts (MCES, and an off-policy temporal-difference (TD learning-control algorithm, Q-learning. These techniques were applied to a simplified version of the weapon assignment (WA problem in air defence. The MCES control algorithm yielded promising results when searching for an optimal shooting order. A greedy approach was taken in the Q-learning algorithm, but experimentation showed that the MCES-control algorithm still performed significantly better than the Q-learning algorithm, even though it was slower.
Jang, Richard
2011-03-01
In NMR resonance assignment, an indispensable step in NMR protein studies, manually processed peaks from both N-labeled and C-labeled spectra are typically used as inputs. However, the use of homologous structures can allow one to use only N-labeled NMR data and avoid the added expense of using C-labeled data. We propose a novel integer programming framework for structure-based backbone resonance assignment using N-labeled data. The core consists of a pair of integer programming models: one for spin system forming and amino acid typing, and the other for backbone resonance assignment. The goal is to perform the assignment directly from spectra without any manual intervention via automatically picked peaks, which are much noisier than manually picked peaks, so methods must be error-tolerant. In the case of semi-automated/manually processed peak data, we compare our system with the Xiong-Pandurangan-Bailey- Kellogg\\'s contact replacement (CR) method, which is the most error-tolerant method for structure-based resonance assignment. Our system, on average, reduces the error rate of the CR method by five folds on their data set. In addition, by using an iterative algorithm, our system has the added capability of using the NOESY data to correct assignment errors due to errors in predicting the amino acid and secondary structure type of each spin system. On a publicly available data set for human ubiquitin, where the typing accuracy is 83%, we achieve 91% accuracy, compared to the 59% accuracy obtained without correcting for such errors. In the case of automatically picked peaks, using assignment information from yeast ubiquitin, we achieve a fully automatic assignment with 97% accuracy. To our knowledge, this is the first system that can achieve fully automatic structure-based assignment directly from spectra. This has implications in NMR protein mutant studies, where the assignment step is repeated for each mutant. © Copyright 2011, Mary Ann Liebert, Inc.
A Bayesian approach to simultaneously quantify assignments and linguistic uncertainty
Energy Technology Data Exchange (ETDEWEB)
Chavez, Gregory M [Los Alamos National Laboratory; Booker, Jane M [BOOKER SCIENTIFIC FREDERICKSBURG; Ross, Timothy J [UNM
2010-10-07
Subject matter expert assessments can include both assignment and linguistic uncertainty. This paper examines assessments containing linguistic uncertainty associated with a qualitative description of a specific state of interest and the assignment uncertainty associated with assigning a qualitative value to that state. A Bayesian approach is examined to simultaneously quantify both assignment and linguistic uncertainty in the posterior probability. The approach is applied to a simplified damage assessment model involving both assignment and linguistic uncertainty. The utility of the approach and the conditions under which the approach is feasible are examined and identified.
Casanova, Henri; Robert, Yves
2008-01-01
""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi
Abbas, Ahmed
2014-04-19
Despite significant advances in automated nuclear magnetic resonance-based protein structure determination, the high numbers of false positives and false negatives among the peaks selected by fully automated methods remain a problem. These false positives and negatives impair the performance of resonance assignment methods. One of the main reasons for this problem is that the computational research community often considers peak picking and resonance assignment to be two separate problems, whereas spectroscopists use expert knowledge to pick peaks and assign their resonances at the same time. We propose a novel framework that simultaneously conducts slice picking and spin system forming, an essential step in resonance assignment. Our framework then employs a genetic algorithm, directed by both connectivity information and amino acid typing information from the spin systems, to assign the spin systems to residues. The inputs to our framework can be as few as two commonly used spectra, i.e., CBCA(CO)NH and HNCACB. Different from the existing peak picking and resonance assignment methods that treat peaks as the units, our method is based on \\'slices\\', which are one-dimensional vectors in three-dimensional spectra that correspond to certain (N, H) values. Experimental results on both benchmark simulated data sets and four real protein data sets demonstrate that our method significantly outperforms the state-of-the-art methods while using a less number of spectra than those methods. Our method is freely available at http://sfb.kaust.edu.sa/Pages/Software.aspx. © 2014 Springer Science+Business Media.
On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies
Directory of Open Access Journals (Sweden)
Francisco Javier González-Castano
2013-08-01
Full Text Available The extension of the network lifetime of Wireless Sensor Networks (WSN is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively.
Regulatory focus and the assignment of punishment
Directory of Open Access Journals (Sweden)
Chloe Carmichael
2007-06-01
Full Text Available Regulatory Focus has been demonstrated to influence human behavior in a number of domains, such as object valuation and readiness to commit time or money to social projects. It has also been demonstrated to influence an individual’s approach to mistakes; and a person’s preference for global or local processing of information. The present work seeks to consider how regulatory focus might interact with punitive behaviors, specifically, the assignment of legal punishment. In this study, 240 undergraduates completed a series of written instruments that assessed their regulatory focus. They read a vignette that described a target that commits a crime, is detected by the police, and is arrested due to a careless mistake. Participants were asked what level of legal punishment they deemed appropriate. Participants’ punitive evaluations show that there are significant interactions a between the regulatory focus of the participant and the regulatory focus of the target and b between the regulatory focus of the participant and the level of detail used to describe the target and her behavior. In each case, when the regulatory foci matched, causing ‘fit,’ the participant was more lenient than in the non-fit condition.
Reference databases for taxonomic assignment in metagenomics.
Santamaria, Monica; Fosso, Bruno; Consiglio, Arianna; De Caro, Giorgio; Grillo, Giorgio; Licciulli, Flavio; Liuni, Sabino; Marzano, Marinella; Alonso-Alemany, Daniel; Valiente, Gabriel; Pesole, Graziano
2012-11-01
Metagenomics is providing an unprecedented access to the environmental microbial diversity. The amplicon-based metagenomics approach involves the PCR-targeted sequencing of a genetic locus fitting different features. Namely, it must be ubiquitous in the taxonomic range of interest, variable enough to discriminate between different species but flanked by highly conserved sequences, and of suitable size to be sequenced through next-generation platforms. The internal transcribed spacers 1 and 2 (ITS1 and ITS2) of the ribosomal DNA operon and one or more hyper-variable regions of 16S ribosomal RNA gene are typically used to identify fungal and bacterial species, respectively. In this context, reliable reference databases and taxonomies are crucial to assign amplicon sequence reads to the correct phylogenetic ranks. Several resources provide consistent phylogenetic classification of publicly available 16S ribosomal DNA sequences, whereas the state of ribosomal internal transcribed spacers reference databases is notably less advanced. In this review, we aim to give an overview of existing reference resources for both types of markers, highlighting strengths and possible shortcomings of their use for metagenomics purposes. Moreover, we present a new database, ITSoneDB, of well annotated and phylogenetically classified ITS1 sequences to be used as a reference collection in metagenomic studies of environmental fungal communities. ITSoneDB is available for download and browsing at http://itsonedb.ba.itb.cnr.it/.
Assigning the Vibration-Rotation Spectra Using the Lww Program Package
Lodyga, Wieslaw; Kreglewski, Marek
2016-06-01
The LWW program package is based on traditional methods used in assigning rotationally resolved IR molecular spectra. The Loomis-Wood diagrams, which are used to visualize spectral branches and facilitate their identification, are combined with the power of interactive lower state combination difference (LSCD) checking, which provides immediate verification of correct assignments of quantum numbers to spectral lines. The traditional Giessen/Cologne type Loomis-Wood algorithm is also implemented. Predictions of vibration-rotation wavenumbers are calculated from a table of vibration-rotation energies, which can be imported from any external fitting program. Program includes many additional tools like simulation of a spectrum from a catalog file (list of transitions with intensities), build-up of a vibration-rotation band from individual branches and simultaneous displaying of two IR spectra - active one used for assignments and a reference one, both with full link to their peak-list files. Importing energies as well as exporting assigned data for fitting in an external program is made easy and flexible by a user-programmed import/export interface, which facilitates iterative refining of energy levels and gives a possibility of using directly exact vibration-rotation energies. Program is available in tree versions: for symmetric top, asymmetric top and molecules with large amplitude motions. The program is designed for the Windows operating systems and is available with full documentation on www.lww.amu.edu.pl .
New algorithm for the rapid evaluation of electron repulsion integrals: elementary basis algorithm
Nakai, Hiromi; Kobayashi, Masato
2004-04-01
We propose a new algorithm for the rapid evaluation of electron repulsion integrals over Gaussian type orbitals, termed elementary basis algorithm (EBA). In the EBA, the information of the atomic basis functions is divided into two parts: an elementary and an atomic basis part. In the conventional algorithm, all information is assigned to atoms, which requires that all computations must be performed in the atomic loops. In the EBA, computations can be partly carried out in the elementary loops. We apply the EBA to the accompanying coordinate expansion method of Ishida.
A Near-Optimal Optimization Algorithm for Link Assignment in Wireless Ad-Hoc Networks
Institute of Scientific and Technical Information of China (English)
Heng-Chang Liu; Bao-Hua Zhao
2006-01-01
Over the past few years, wireless networking technologies have made vast forays in our daily lives. In wireless ad-hoc networks, links are set up by a number of units without any permanent infrastructures. In this paper, the resource optimization is considered to maximize the network throughput by efficiently using the network capacity, where multi-hop functionality and spatial TDMA (STDMA) access scheme are used. The objective is to find the minimum frame length with given traffic distributions and corresponding routing information. Because of the complex structure of the underlying mathematical problem, previous work and analysis become intractable for networks of realistic sizes. The problem is addressed through mathematical programming approach, the linear integer formulation is developed for optimizing the network throughput, and then the similarity between the original problem and the graph edge coloring problem is shown through the conflict graph concept. A column generation solution is proposed and several enhancements are made in order to fasten its convergence. Numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes.
A Joint Link and Channel Assignment Routing Scheme for Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
H.S.Zhao
2013-12-01
Full Text Available Cognitive radio (CR is a promising technology that enables opportunistic utilization of the temporarily vacant spectrum to mitigate the spectrum scarcity in wireless communications. Since secondary users (SUs should vacate the channel in use immediately after detecting the reappearances of primary users (PUs in cognitive radio networks (CRNs, the route reliability is a distinctive challenge for routing in CRNs. Furthermore, the throughput requirement of an SU session should be satisfied and it is always preferable to select a route with less negative influence on other current or latish sessions. To account for the route reliability challenge, we study the joint link and channel assignment routing problem for CRNs. It is formulated in a form of integer nonlinear programming (INLP, which is NP-hard, with the objective of minimizing the interference of a new route to other routes while providing route reliability and throughput guarantee. An on-demand route discovery algorithm is proposed to find reliable candidate paths, while a joint link and channel assignment routing algorithm with sequentially-connected-link coordination is proposed to choose the near-optimal route for improving the route reliability and minimizing negative influence. Simulation results demonstrate that the proposed algorithm achieves considerable improvement over existing schemes in both route reliability and throughput.
Improved MOEA/D for Dynamic Weapon-Target Assignment Problem
Institute of Scientific and Technical Information of China (English)
Ying Zhang∗; Rennong Yang; Jialiang Zuo; Xiaoning Jing
2015-01-01
Conducting reasonable weapon⁃target assignment ( WTA) with near real time can bring the maximum awards with minimum costs which are especially significant in the modern war. A framework of dynamic WTA ( DWTA) model based on a series of staged static WTA ( SWTA) models is established where dynamic factors including time window of target and time window of weapon are considered in the staged SWTA model. Then, a hybrid algorithm for the staged SWTA named Decomposition⁃Based Dynamic Weapon⁃target Assignment ( D⁃DWTA) is proposed which is based on the framework of multi⁃objective evolutionary algorithm based on decomposition ( MOEA/D) with two major improvements:one is the coding based on constraint of resource to generate the feasible solutions, and the other is the tabu search strategy to speed up the convergence. Comparative experiments prove that the proposed algorithm is capable of obtaining a well⁃converged and well diversified set of solutions on a problem instance and meets the time demand in the battlefield environment.
GPU-based SoftAssign for Maximizing Image Utilization in Photomosaics
Directory of Open Access Journals (Sweden)
Toru Tamaki
2011-07-01
Full Text Available Photomosaic generation is a popular non-photorealistic rendering technique, where a single image is assembled from several smaller ones. Visual responses change depending on the proximity to the photomosaic, leading to many creative prospects for publicity and art. Synthesizing photomosaics typically requires very large image databases in order to produce pleasing results. Moreover, repetitions are allowed to occur which may locally bias the mosaic. This paper provides alternatives to prevent repetitions while still being robust enough to work with coarse image subsets. Three approaches were considered for the matching stage of photomosaics: a greedy-based procedural algorithm, simulated annealing and SoftAssign. It was found that the latter delivers adequate arrangements in cases where only a restricted number of images is available. This paper introduces a novel GPU-accelerated SoftAssign implementation that outperforms an optimized CPU implementation by a factor of 60 times in the tested hardware.
Multiobjective Order Assignment Optimization in a Global Multiple-Factory Environment
Directory of Open Access Journals (Sweden)
Rong-Chang Chen
2014-01-01
Full Text Available In response to radically increasing competition, many manufacturers who produce time-sensitive products have expanded their production plants to worldwide sites. Given this environment, how to aggregate customer orders from around the globe and assign them quickly to the most appropriate plants is currently a crucial issue. This study proposes an effective method to solve the order assignment problem of companies with multiple plants distributed worldwide. A multiobjective genetic algorithm (MOGA is used to find solutions. To validate the effectiveness of the proposed approach, this study employs some real data, provided by a famous garment company in Taiwan, as a base to perform some experiments. In addition, the influences of orders with a wide range of quantities demanded are discussed. The results show that feasible solutions can be obtained effectively and efficiently. Moreover, if managers aim at lower total costs, they can divide a big customer order into more small manufacturing ones.
Clonify: unseeded antibody lineage assignment from next-generation sequencing data.
Briney, Bryan; Le, Khoa; Zhu, Jiang; Burton, Dennis R
2016-01-01
Defining the dynamics and maturation processes of antibody clonal lineages is crucial to understanding the humoral response to infection and immunization. Although individual antibody lineages have been previously analyzed in isolation, these studies provide only a narrow view of the total antibody response. Comprehensive study of antibody lineages has been limited by the lack of an accurate clonal lineage assignment algorithm capable of operating on next-generation sequencing datasets. To address this shortcoming, we developed Clonify, which is able to perform unseeded lineage assignment on very large sets of antibody sequences. Application of Clonify to IgG+ memory repertoires from healthy individuals revealed a surprising lack of influence of large extended lineages on the overall repertoire composition, indicating that this composition is driven less by the order and frequency of pathogen encounters than previously thought. Clonify is freely available at www.github.com/briney/clonify-python. PMID:27102563
Directory of Open Access Journals (Sweden)
Yu-Chi Wang
2015-01-01
Full Text Available This paper presents a unified approach to nonlinear dynamic inversion control algorithm with the parameters for desired dynamics determined by using an eigenvalue assignment method, which may be applied in a very straightforward and convenient way. By using this method, it is not necessary to transform the nonlinear equations into linear equations by feedback linearization before beginning control designs. The applications of this method are not limited to affine nonlinear control systems or limited to minimum phase problems if the eigenvalues of error dynamics are carefully assigned so that the desired dynamics is stable. The control design by using this method is shown to be robust to modeling uncertainties. To validate the theory, the design of a UAV control system is presented as an example. Numerical simulations show the performance of the design to be quite remarkable.
Variable Neighborhood Search for the University Lecturer-Student Assignment Problem
Geiger, Martin Josef
2008-01-01
The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical work of universities. Here, students have to be assigned to scientific topics which are proposed and supported by members of staff. The problem involves the optimization under given preferences of students which may be expressed when applying for certain topics. It is possible to observe that variable neighborhood search leads to superior results for the tested problem instances. One instance is taken from an actual case, while others have been generated based on the real world data to support the analysis with a deeper analysis. An extension of the problem has been formulated by integrating a second objective function that simultaneously balances the workload of the members of staff while maximizing utility of the students. The algorithmic approach has been prototypically implemented in a computer system. One important aspect in t...
Clonify: unseeded antibody lineage assignment from next-generation sequencing data.
Briney, Bryan; Le, Khoa; Zhu, Jiang; Burton, Dennis R
2016-04-22
Defining the dynamics and maturation processes of antibody clonal lineages is crucial to understanding the humoral response to infection and immunization. Although individual antibody lineages have been previously analyzed in isolation, these studies provide only a narrow view of the total antibody response. Comprehensive study of antibody lineages has been limited by the lack of an accurate clonal lineage assignment algorithm capable of operating on next-generation sequencing datasets. To address this shortcoming, we developed Clonify, which is able to perform unseeded lineage assignment on very large sets of antibody sequences. Application of Clonify to IgG+ memory repertoires from healthy individuals revealed a surprising lack of influence of large extended lineages on the overall repertoire composition, indicating that this composition is driven less by the order and frequency of pathogen encounters than previously thought. Clonify is freely available at www.github.com/briney/clonify-python.
Storage assignment optimization in a multi-tier shuttle warehousing system
Wang, Yanyan; Mou, Shandong; Wu, Yaohua
2016-03-01
The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP), which has been widely applied in the conventional automated storage and retrieval system(AS/RS). However, the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems(MSWS) because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP. In this study, a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period (SWP) and lift idle period (LIP) during transaction cycle time. A mean arrival time difference matrix for pairwise stock keeping units(SKUs) is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation. The decomposition method is applied to analyze the interactions among outbound task time, SWP, and LIP. The ant colony clustering algorithm is designed to determine storage partitions using clustering items. In addition, goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane. This combination is derived based on the analysis results of the queuing network model and on three basic principles. The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry. The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.
Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System
Institute of Scientific and Technical Information of China (English)
WANG Yanyan; MOU Shandong; WU Yaohua
2016-01-01
The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP), which has been widely applied in the conventional automated storage and retrieval system(AS/RS). However, the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems(MSWS) because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP. In this study, a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period (SWP) and lift idle period (LIP) during transaction cycle time. A mean arrival time difference matrix for pairwise stock keeping units(SKUs) is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation. The decomposition method is applied to analyze the interactions among outbound task time, SWP, and LIP. The ant colony clustering algorithm is designed to determine storage partitions using clustering items. In addition, goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane. This combination is derived based on the analysis results of the queuing network model and on three basic principles. The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry. The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.
Why the Rhetoric of CS Programming Assignments Matters
Wolfe, Joanna
2004-06-01
Despite the multiple potential benefits of asking students working on programming tasks to consider human factors, most programming assignments narrowly focus on technical details and requirements. Female students in particular may be attracted to assignments that emphasize human as well as technical factors. To assess how students respond to changes in the rhetorical presentation of programming instructions, 81 students completed questionnaires evaluating different assignment instructions. Students generally perceived assignments emphasizing real-world contexts and users as more motivating and enjoyable to program than those that did not emphasize human factors. Moreover, when asked what makes a "good" programming assignment, over half of the students volunteered that they looked for assignments stressing a real-world purpose, use or application.
Electronic marking of mathematics assignments using Microsoft Word 2007
Lowe, Tim; Mestel, Ben; Arrowsmith, Gaynor
2008-01-01
This paper describes on-going work within the Department of Mathematics and Statistics at The Open University to enable distance learning students to electronically submit assignments rich in mathematical notation and diagrams, and for those assignments to be marked and returned electronically by their tutor. A trial is currently underway of a prototype system that enables students to submit assignments in a range of electronic formats, which are then converted to Microsoft Word 2007 format t...
Strategies for Effective Comments on Students’ Written Assignments
Institute of Scientific and Technical Information of China (English)
任永东
2014-01-01
Comments on students’ assignments are important for English course. The loopholes in teachers’ working schemes-com-ments of their students’ written assignments are the clues around which the paper spreads. In the process of teaching, some English teach-ers pay so much attention to the contents taught in class but ignore the comments on students’ written assignments. Consequently, it is not applicable for students to correct their mistakes in time and they probably make the same mistakes repeatedly.
Factors of Success of Female Expatriates During International Assignments
Lapinoja, Anu
2012-01-01
The aim of this bachelor’s thesis was to study what the factors of success of female expatriates are during international assignments. Also, the objective was to find out how companies could support and enhance these factors in the future and what kind of barriers of success there exist for female expatriates. The theoretical study examined international assignments in general, expatriates, success and failure of international assignments and the barriers of success. Also, female expatriates ...
Integrated Project Scheduling and Staff Assignment with Controllable Processing Times
Victor Fernandez-Viagas; Framinan, Jose M.
2014-01-01
This paper addresses a decision problem related to simultaneously scheduling the tasks in a project and assigning the staff to these tasks, taking into account that a task can be performed only by employees with certain skills, and that the length of each task depends on the number of employees assigned. This type of problems usually appears in service companies, where both tasks scheduling and staff assignment are closely related. An integer programming model for the problem is proposed, tog...
CYCLE TIMES ASSIGNMENT OF NONLINEAR DISCRETE EVENT DYNAMIC SYSTEMS
Institute of Scientific and Technical Information of China (English)
CHEN Wende
2000-01-01
In this paper, nonautonomous models of Discrete Event Dynamic Systems (DEDS) are established by min-max function, reachability and observability are defined,the problem on cycle times assignment of DEDS, which corresponds with the important problem on poles assignment of linear systems, is studied. By Gunawardena et al.'Duality Theorem following results are obtained: Cycle times of system can be assigned under state feedback(or output feedback) if and only if system is reachable (or reachable and obserbable).
Novel multi-objective optimization algorithm
Institute of Scientific and Technical Information of China (English)
Jie Zeng; Wei Nie
2014-01-01
Many multi-objective evolutionary algorithms (MOEAs) can converge to the Pareto optimal front and work wel on two or three objectives, but they deteriorate when faced with many-objective problems. Indicator-based MOEAs, which adopt various indicators to evaluate the fitness values (instead of the Pareto-dominance relation to select candidate solutions), have been regarded as promising schemes that yield more satisfactory re-sults than wel-known algorithms, such as non-dominated sort-ing genetic algorithm (NSGA-II) and strength Pareto evolution-ary algorithm (SPEA2). However, they can suffer from having a slow convergence speed. This paper proposes a new indicator-based multi-objective optimization algorithm, namely, the multi-objective shuffled frog leaping algorithm based on the ε indicator (ε-MOSFLA). This algorithm adopts a memetic meta-heuristic, namely, the SFLA, which is characterized by the powerful capa-bility of global search and quick convergence as an evolutionary strategy and a simple and effective ε-indicator as a fitness as-signment scheme to conduct the search procedure. Experimental results, in comparison with other representative indicator-based MOEAs and traditional Pareto-based MOEAs on several standard test problems with up to 50 objectives, show thatε-MOSFLA is the best algorithm for solving many-objective optimization problems in terms of the solution quality as wel as the speed of convergence.
FellWalker - a Clump Identification Algorithm
Berry, David
2014-01-01
This paper describes the FellWalker algorithm, a watershed algorithm that segments a 1-, 2- or 3-dimensional array of data values into a set of disjoint clumps of emission, each containing a single significant peak. Pixels below a nominated constant data level are assumed to be background pixels and are not assigned to any clump. FellWalker is thus equivalent in purpose to the CLUMPFIND algorithm. However, unlike CLUMPFIND, which segments the array on the basis of a set of evenly-spaced contours and thus uses only a small fraction of the available data values, the FellWalker algorithm is based on a gradient-tracing scheme which uses all available data values. Comparisons of CLUMPFIND and FellWalker using a crowded field of artificial Gaussian clumps, all of equal peak value and width, suggest that the results produced by FellWalker are less dependent on specific parameter settings than are those of CLUMPFIND.
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Jäger, Gerold; Zhang, Weixiong
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been made on the HCP in undirected graphs, little is known for the HCP in directed graphs (DHCP). The contribution of this work is an effective algorithm for the DHCP. Our algorithm explores and exploits the close relationship between the DHCP and the Assignment Problem (AP) and utilizes a technique based on Boolean satisfiability (SAT). By combining effective algorithms for the AP and SAT, our algorithm significantly outperforms previous exact DHCP algorithms including an algorithm based on the award-winning Concorde TSP algorithm.
An explicit solution to right factorization with application in eigenstructure assignment
Institute of Scientific and Technical Information of China (English)
Guangren DUAN; Bin ZHOU
2005-01-01
Based on the well-known Leverrier algorithm, a simple explicit solution to right factorization of a linear system is established.This solution is expressed by the controllability matrix of the given system and a symmetric operator matrix.Applications of this solution to a type of generalized Sylvester matrix equations and the problem of parametric eigenstructure assignment by state feedback are investigated,and general complete parametric solutions to these two problems are deduced. These new solutions are simple,and possess desirable structural properties which render the solutions readily implementable.An example demonstrates the effect of the proposed results.
Probabilistic Cross-Identification in Crowded Fields as an Assignment Problem
Budavari, Tamas
2016-01-01
One of the outstanding challenges of cross-identification is multiplicity: detections in crowded regions of the sky are often linked to more than one candidate associations of similar likelihoods. We map the resulting maximum likelihood partitioning to the fundamental assignment problem of discrete mathematics and efficiently solve the two-way catalog-level matching in the realm of combinatorial optimization using the so-called Hungarian algorithm. We introduce the method, demonstrate its performance in a mock universe where the true associations are known, and discuss the applicability of the new procedure to large surveys.
Petri Net Decomposition Method for Simultaneous Optimization of Task Assignment and Routing for AGVs
Tanaka, Yuki; Nishi, Tatsushi; Inuiguchi, Masahiro
We propose a simultaneous optimization method for task assignment and routing problems with multiple AGVs by the decomposition of Petri Nets. In the proposed method, Petri Net is decomposed into several subnets representing task subproblems and AGV subproblems. Each subproblem is solved by Dijkstra's algorithm. The subproblem on each subnet is repeatedly solved until a feasible solution for the original problem is derived. A solution method for subproblems with no final marking is newly developed. The effectiveness of the proposed method is demonstrated by comparing the performance with CPLEX as well as a nearest neighborhood heuristic method.
Evolutionary Graph Drawing Algorithms
Institute of Scientific and Technical Information of China (English)
Huang Jing-wei; Wei Wen-fang
2003-01-01
In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the following advantages: the frames of the algorithms are unified, the method is simple, different algorithms may be attained by designing different objective functions, therefore enhance the reuse of the algorithms. Also, aesthetics or constrains may be added to satisfy different requirements.
Energy Technology Data Exchange (ETDEWEB)
Fontana, W.
1990-12-13
In this paper complex adaptive systems are defined by a self- referential loop in which objects encode functions that act back on these objects. A model for this loop is presented. It uses a simple recursive formal language, derived from the lambda-calculus, to provide a semantics that maps character strings into functions that manipulate symbols on strings. The interaction between two functions, or algorithms, is defined naturally within the language through function composition, and results in the production of a new function. An iterated map acting on sets of functions and a corresponding graph representation are defined. Their properties are useful to discuss the behavior of a fixed size ensemble of randomly interacting functions. This function gas'', or Turning gas'', is studied under various conditions, and evolves cooperative interaction patterns of considerable intricacy. These patterns adapt under the influence of perturbations consisting in the addition of new random functions to the system. Different organizations emerge depending on the availability of self-replicators.
A Randomized Algorithm for 3-SAT
Ghosh, Subhas Kumar
2009-01-01
In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals in every clause. Given a k-CNF formula phi on n variables, and alpha in{0,1}^n that satisfies phi, a clause of phi is critical if exactly one literal of that clause is satisfied under assignment alpha. Paturi et. al. (Chicago Journal of Theoretical Computer Science 1999) proposed a simple randomized algorithm (PPZ) for k-SAT for which success probability increases with the number of critical clauses (with respect to a fixed satisfiable solution of the input formula). Here, we first describe another simple randomized algorithm DEL which performs better if the number of critical clauses are less (with respect to a fixed satisfiable solution of the input formula). Subsequently, we combine these two simple algorithms such that the success probability of the combined algorithm is maximum of the success probabilities of PPZ and DEL on eve...
Bayesian Optimisation Algorithm for Nurse Scheduling
Li, Jingpeng
2008-01-01
Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurses assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.
Issues Challenges and Tools of Clustering Algorithms
Directory of Open Access Journals (Sweden)
Parul Agarwal
2011-05-01
Full Text Available Clustering is an unsupervised technique of Data Mining. It means grouping similar objects together and separating the dissimilar ones. Each object in the data set is assigned a class label in the clustering process using a distance measure. This paper has captured the problems that are faced in real when clustering algorithms are implemented .It also considers the most extensively used tools which are readily available and support functions which ease the programming. Once algorithms have been implemented, they also need to be tested for its validity. There exist several validation indexes for testing the performance and accuracy which have also been discussed here.
Institute of Scientific and Technical Information of China (English)
吕丹; 郑世跃; 欧阳勋志; 郭孝玉
2014-01-01
批量评估具有效率高、费用低且满足大量评估等优点。论文以中龄林为例，将BP神经网络应用于林木资源资产批量评估。通过比较学习算法、隐含层节点数，运用敏感性分析法确定影响因子对评估值的贡献程度，筛选输入层因子，从而优化了林木资源资产批量评估BP神经网络模型结构。结果表明：贝叶斯正则化法优于L-M算法；年龄、利率、蓄积、树种为强影响因子，这4个因子对评估值的贡献度超过60％；最优模型结构为BR 9-10-1，该模型平均绝对误差为32．46元/hm2，平均相对误差为1．28％，决定系数达0．9997，模型拟合精度高，泛化能力强，能够满足中龄林林木资源资产批量评估的要求。%Mass appraisal is of high efficiency,high precision,low cost,satisfies the needs of vast-amount evaluation.In this study,BP neural network was applied to mass appraisal of mid-age forest assets evaluation. By comparing different learning algorithms and the numbers of hidden layer nodes,selecting layer factors,using sensitivity analysis method which revealed the factors’ influence degree to the assessed value,the model struc-ture of BP neural network was optimized.The results showed that Bayesian regularization method was better than L-M algorithm;the contribution to the assessed values of the four factors including age,rate,accumula-tion,tree species was more than 60%;the best model structure was BR9-10-1.Its mean absolute error was 32.46 yuan/hm2 ,mean absolute percentage error was 1.28%,and decision coefficient was 0.999 7.The model has high fitting accuracy and generalization ability thus meets the requirement of mass appraisal of mid-age forest resource assets.
Centralized Fuzzy Data Association Algorithm of Three-sensor Multi-target Tracking System
Directory of Open Access Journals (Sweden)
Zhaofeng Su
2014-02-01
Full Text Available For improving the effect of multi-target tracking in dense target and clutter scenario, a centralized fuzzy optimal assignment algorithm (CMS-FOA of three-sensor multi-target system is proposed. And on the base of this, a generalized probabilistic data association algorithm (CMS-FOAGPDA based on CMS-FOA algorithm is presented. The fusion algorithm gets effective 3-tuple of measurement set by using components of several satisfactory solutions of the fuzzy optimal assignment problem and then uses generalized probabilistic data association algorithm to calculate the update states of targets. Simulation results show that, in the aspect of multi-target tracking accuracy, CMS-FOA algorithm is superior to the optimal assignment (CMS-OA algorithm based on state estimate and CMS-FOAGPDA algorithm is better than CMS-FOA algorithm. But considering the time spent, CMS-FOA algorithm spends a minimum of time and CMS-FOAGPDA algorithm is exactly on the contrary. Therefore, compared with CMS-OA algorithm, the two algorithms presented in the study each has its advantages and should be chosen according to the needs of the actual application when in use.
Low complexity bit loading algorithm for OFDM system
Institute of Scientific and Technical Information of China (English)
Yang Yu; Sha Xuejun; Zhang Zhonghua
2006-01-01
A new approach to loading for orthogonal frequency division multiplexing (OFDM) system is proposed, this bit-loading algorithm assigns bits to different subchannels in order to minimize the transmit energy. In the algorithm,first most bit are allocated to each subchannels according to channel condition, Shannon formula and QoS require of the user, then the residual bit are allocated to the subchannels bit by bit. In this way the algorithm is efficient while calculation is less complex. This is the first time to load bits with the scale following Shannon formula and the algorithm is of O (4N) complexity.
A New RWA Algorithm Based on Multi-Objective
Institute of Scientific and Technical Information of China (English)
Qu Hua; Zhao Jihong; Li Zengzhi
2003-01-01
In this article , we studied the associated research problems and challenges on routing and wavelength assignment (RWA) in WDM (wavelength division multiplexing) networks. Various RWA approaches are examined and compared.We proposed a new RWA algorithm based on multi-objective. In this new algorithm, we consider multiple network optimizing objectives to setup a lightpath with maximize profit and shortest path under the limited resources. By comparing and analyzing, the pro posed algorithm is much better than the algorithms, which only consider one optimizing objective.
New optimal algorithm of data association for multi-passive-sensor location system
Institute of Scientific and Technical Information of China (English)
ZHOU Li; HE You; ZHANG WeiHua
2007-01-01
In dense target and false detection scenario of four time difference of arrival (TDOA)for multi-passive-sensor location system, the global optimal data association algorithm has to be adopted. In view of the heavy calculation burden of the traditional optimal assignment algorithm, this paper proposes a new global optimal assignment algorithm and a 2-stage association algorithm based on a statistic test.Compared with the traditional optimal algorithm, the new optimal algorithm avoids the complicated operations for finding the target position before we calculate association cost; hence, much of the procedure time is saved. In the 2-stage association algorithm, a large number of false location points are eliminated from candidate associations in advance. Therefore, the operation is further decreased, and the correct data association probability is improved in varying degrees. Both the complexity analyses and simulation results can verify the effectiveness of the new algorithms.
Stang, Jared B; Perez, Sarah; Ives, Joss; Roll, Ido
2016-01-01
Pre-class reading assignments help prepare students for active classes by providing a first exposure to the terms and concepts to be used during class. We investigate if the use of inquiry-oriented PhET-based activities in conjunction with pre-class reading assignments can improve both the preparation of students for in-class learning and student attitudes towards and engagement with pre-class assignments. Over three course modules covering different topics, students were assigned randomly to complete either a textbook-only pre-class assignment or both a textbook pre-class assignment and a PhET-based activity. The assignments helped prepare students for class, as measured by performance on the pre-class quiz relative to a beginning-of-semester pre-test, but no evidence for increased learning due the PhET activity was observed. Students rated the assignments which included PhET as more enjoyable and, for the topic latest in the semester, reported engaging more with the assignments when PhET was included.
45 CFR 302.50 - Assignment of rights to support.
2010-10-01
... process; or (2) Except for obligations assigned under 42 CFR 433.146, other legal process as established... competent jurisdiction or administrative process which covers the assigned support rights. (2) If there is no court or administrative order, an amount determined in writing by the IV-D agency as part of...
76 FR 34658 - The Internet Assigned Numbers Authority (IANA) Functions
2011-06-14
... of Inquiry, Request for Comments on the Internet Assigned Numbers Authority (IANA) Functions, 76 FR 10569 (Feb. 25, 2011), available at http://www.ntia.doc.gov/frnotices/2011/fr_ianafunctionsnoi_02252011... National Telecommunications and Information Administration The Internet Assigned Numbers Authority...
Online Assignments in Economics: A Test of Their Effectiveness
Kennelly, Brendan; Considine, John; Flannery, Darragh
2011-01-01
This article compares the effectiveness of online and paper-based assignments and tutorials using summative assessment results. All of the students in a large managerial economics course at National University of Ireland, Galway were asked to do six assignments online using Aplia and to do two on paper. The authors examined whether a student's…
On the Use of Writing Assignments in Intermediate Microeconomic Theory
O'Neill, Patrick B.
2009-01-01
A typical writing assignment in upper level required courses is a term paper. However many economics majors, particularly those in business schools, need to develop skill at writing shorter pieces. In this paper I describe numerous examples of shorter writing assignments that I have incorporated into an Intermediate Microeconomic Theory course.…
14 CFR 1245.109 - Assignment of title to NASA.
2010-01-01
... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Assignment of title to NASA. 1245.109... INTELLECTUAL PROPERTY RIGHTS Patent Waiver Regulations § 1245.109 Assignment of title to NASA. (a) The instrument of waiver set forth in § 1245.115(c) shall be voided by NASA with respect to the domestic title...
47 CFR 52.111 - Toll free number assignment.
2010-10-01
... 47 Telecommunication 3 2010-10-01 2010-10-01 false Toll free number assignment. 52.111 Section 52...) NUMBERING Toll Free Numbers § 52.111 Toll free number assignment. Toll free numbers shall be made available on a first-come, first-served basis unless otherwise directed by the Commission....
Genetics of traffic assignment models for strategic transport planning
Bliemer, M.C.J.; Raadsen, M.; Brederode, L.; Bell, M.; Wismans, L.J.J.; Smith, M.
2016-01-01
This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic
Dynamic Equilibrium Assignment Convergence by En-route Flow Smoothing
Pel, A.J.; Bliemer, M.C.J.; Hoogendoorn, S.P.
2010-01-01
An essential feature in many dynamic traffic assignment (DTA) models used for planning purposes is to compute the (dynamic) equilibrium assignment, where travellers follow user-optimal routes, leading to minimal experienced route travel times. To compute these time-varying route flows in the equilib
24 CFR 203.350 - Assignment of mortgage.
2010-04-01
... 24 Housing and Urban Development 2 2010-04-01 2010-04-01 false Assignment of mortgage. 203.350... URBAN DEVELOPMENT MORTGAGE AND LOAN INSURANCE PROGRAMS UNDER NATIONAL HOUSING ACT AND OTHER AUTHORITIES SINGLE FAMILY MORTGAGE INSURANCE Contract Rights and Obligations Assignment of Mortgage §...
25 CFR 212.34 - Individual tribal assignments excluded.
2010-04-01
... 25 Indians 1 2010-04-01 2010-04-01 false Individual tribal assignments excluded. 212.34 Section... ALLOTTED LANDS FOR MINERAL DEVELOPMENT How To Acquire Leases § 212.34 Individual tribal assignments... made pursuant to tribal constitutions or ordinances for the use of individual Indians and assignees...
Assignment Situations with Multiple Ownership and their Games
Miquel, S.; van Velzen, S.; Hamers, H.J.M.; Norde, H.W.
2005-01-01
An assignment situation can be considered as a two-sided market consisting of two disjoint sets of objects.A non-negative reward matrix describes the profit if an object of one group is assigned to an object of the other group. Assuming that each object is owned by a different agent, Shapley and Shu
Semi-Infinite Assignment Problems and Related Games
Llorca, N.; Tijs, S.H.; Timmer, J.B.
1999-01-01
In 1972 Shapley and Shubik introduced assignment games associated to finite assignment problems in which two types of agents were involved and they proved that these games have a non-empty core. In this paper we look at the situation where the set of one type is infinite and investigatewhen the core
Negotiating Languages and Cultures: Enacting Translingualism through a Translation Assignment
Kiernan, Julia; Meier, Joyce; Wang, Xiqiao
2016-01-01
This collaborative project explores the affordances of a translation assignment in the context of a learner-centered pedagogy that places composition students' movement among languages and cultures as both a site for inquiry and subject of analysis. The translation assignment asks students to translate scholarly articles or culture stories from…
The Eco-Sculpture Assignment: Using Art to Scaffold Metacognition
Polegato, Rosemary
2014-01-01
The Eco-Sculpture Assignment demonstrates that art may be used as a conduit to scaffold metacognition in marketing courses. Theoretical underpinnings are drawn from the literature on pedagogy used in general, marketing, and art education contexts. The assignment is described in detail, followed by examples of learner response that illustrate…
The Pedagogy of Assignments in Social Justice Teacher Education
McDonald, Morva A.
2008-01-01
This article examines the pedagogy of assignments in social justice teacher education programs. Employing a programmatic view, this study aims to understand the collective representation of social justice provided by assignments across multiple courses. Findings come from a qualitative case study of two social justice programs. Drawing on concepts…
Graduate Writing Assignments across Faculties in a Canadian University
Shi, Ling; Dong, Yanning
2015-01-01
This study examines 143 graduate assignments across 12 faculties or schools in a Canadian university in order to identify types of writing tasks. Based on the descriptions provided by the instructors, we identified nine types of assignments, with scholarly essay being the most common, followed by summary and response, literature review, project,…
Automating Formative and Summative Feedback for Individualised Assignments
Hamilton, Ian Robert
2009-01-01
Purpose: The purpose of this paper is to report on the rationale behind the use of a unique paper-based individualised accounting assignment, which automated the provision to students of immediate formative and timely summative feedback. Design/methodology/approach: As students worked towards completing their assignment, the package provided…
Case Assignment in the Inalienable Possession Construction in Korean.
Maling, Joan; Kim, Soowon
1992-01-01
Investigates principles for assigning case to the Noun Phrases (NP) in the Part-Whole Construction in Korean. It is shown that the case marking on the part-NP is a function of the case-assigning properties of the matrix verb, even when this is lexically governed. (41 references) (Author/LB)
7 CFR 1530.115 - Paperwork Reduction Act assigned number.
2010-01-01
... 7 Agriculture 10 2010-01-01 2010-01-01 false Paperwork Reduction Act assigned number. 1530.115... SERVICE, DEPARTMENT OF AGRICULTURE THE REFINED SUGAR RE-EXPORT PROGRAM, THE SUGAR CONTAINING PRODUCTS RE-EXPORT PROGRAM, AND THE POLYHYDRIC ALCOHOL PROGRAM § 1530.115 Paperwork Reduction Act assigned...
Individual Assignments and Academic Dishonesty--Exploring the Learning Conundrum
Leonard, Valorie; LeBrasseur, Rolland
2008-01-01
A survey of university business professors focused on their use of individual assignments in courses and their views on cheating and its impact on student learning. Based on responses from 456 professors (37% response rate) from Ontario, Canada, it was concluded that most faculty believe that individual assignments are effective learning tools and…
42 CFR 435.610 - Assignment of rights to benefits.
2010-10-01
... 42 Public Health 4 2010-10-01 2010-10-01 false Assignment of rights to benefits. 435.610 Section....610 Assignment of rights to benefits. (a) As a condition of eligibility, the agency must require... paternity and in obtaining medical support and payments, unless the individual establishes good cause...
42 CFR 436.610 - Assignment of rights to benefits.
2010-10-01
... 42 Public Health 4 2010-10-01 2010-10-01 false Assignment of rights to benefits. 436.610 Section... General Financial Eligibility Requirements and Options § 436.610 Assignment of rights to benefits. (a) As... payments, unless the individual establishes good cause for not cooperating, and except for...
48 CFR 1442.202 - Assignment of contract administration.
2010-10-01
... Assignment of contract administration. (a) The decision to withhold normal individual contract administration... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Assignment of contract administration. 1442.202 Section 1442.202 Federal Acquisition Regulations System DEPARTMENT OF THE...
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....
Multiobjective controller synthesis via eigenstructure assignment with state feedback
Li, Zhao; Lam, James
2016-10-01
A general parameter scheme for multiobjective controller synthesis via eigenstructure assignment with state feedback is proposed. The scheme provides total pole configurability, that is, pole assignment constraints, partial pole assignment constraints, generalised regional pole assignment constraints can be dealt with simultaneously without introducing essential conservatism. The scheme is derived from the pole assignment approach using Sylvester equations, and the parameter space is the Cartesian product of some subspaces characterising the free parameters. Under the scheme, the controller design problems are formulated as nonlinear optimisation problems with both objectives and constraints being differentiable and can be solved by derivative-based nonlinear programming technique. Numerical examples are given to illustrate the efficiency of the proposed method.
Evaluation of a UMLS Auditing Process of Semantic Type Assignments
Gu, Huanying; Hripcsak, George; Chen, Yan; Morrey, C. Paul; Elhanan, Gai; Cimino, James J.; Geller, James; Perl, Yehoshua
2007-01-01
The UMLS is a terminological system that integrates many source terminologies. Each concept in the UMLS is assigned one or more semantic types from the Semantic Network, an upper level ontology for biomedicine. Due to the complexity of the UMLS, errors exist in the semantic type assignments. Finding assignment errors may unearth modeling errors. Even with sophisticated tools, discovering assignment errors requires manual review. In this paper we describe the evaluation of an auditing project of UMLS semantic type assignments. We studied the performance of the auditors who reviewed potential errors. We found that four auditors, interacting according to a multi-step protocol, identified a high rate of errors (one or more errors in 81% of concepts studied) and that results were sufficiently reliable (0.67 to 0.70) for the two most common types of errors. However, reliability was low for each individual auditor, suggesting that review of potential errors is resource-intensive. PMID:18693845
Directory of Open Access Journals (Sweden)
Md Shamsul Arefin
2012-12-01
Full Text Available This work presents a technique for the chirality (n, m assignment of semiconducting single wall carbon nanotubes by solving a set of empirical equations of the tight binding model parameters. The empirical equations of the nearest neighbor hopping parameters, relating the term (2n, m with the first and second optical transition energies of the semiconducting single wall carbon nanotubes, are also proposed. They provide almost the same level of accuracy for lower and higher diameter nanotubes. An algorithm is presented to determine the chiral index (n, m of any unknown semiconducting tube by solving these empirical equations using values of radial breathing mode frequency and the first or second optical transition energy from resonant Raman spectroscopy. In this paper, the chirality of 55 semiconducting nanotubes is assigned using the first and second optical transition energies. Unlike the existing methods of chirality assignment, this technique does not require graphical comparison or pattern recognition between existing experimental and theoretical Kataura plot.
DEFF Research Database (Denmark)
This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The 36 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 154 submissions. The papers address all...... issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, etc....
C. Kirabo Jackson
2011-01-01
Existing studies on single-sex schooling suffer from biases because students who attend single-sex schools differ in unmeasured ways from those who do not. In Trinidad and Tobago students are assigned to secondary schools based on an algorithm allowing one to address self-selection bias and estimate the causal effect of attending a single-sex school versus a similar coeducational school. While students (particularly females) with strong expressed preferences for single-sex schools benefit, mo...
A two-phase genetic algorithm for the berth and quay crane allocation and scheduling problem
A. PONOMAREV; Dullaert, W.; B. RAA
2010-01-01
This paper presents a hybrid genetic algorithm for a dynamic continuous berth allocation and quay crane scheduling problem. In the first phase of the algorithm, vessels are positioned at berthing locations and quay cranes are assigned to vessels using novel crane assignment heuristics. In the second phase, cranes are scheduled to minimize the distance travelled in repositioning the cranes. The solution approach is tested on benchmarks derived from real-life data, with varying levels of capaci...
Severson, Tracie Andrusiak
The long-term goal of this research is to contribute to the design of a conceptual architecture and framework for the distributed coordination of multifunction radar systems. The specific research objective of this dissertation is to apply results from graph theory, probabilistic optimization, and consensus control to the problem of distributed optimization of resource allocation for multifunction radars coordinating on their search and track assignments. For multiple radars communicating on a radar network, cooperation and agreement on a network resource management strategy increases the group's collective search and track capability as compared to non-cooperative radars. Existing resource management approaches for a single multifunction radar optimize the radar's configuration by modifying the radar waveform and beam-pattern. Also, multi-radar approaches implement a top-down, centralized sensor management framework that relies on fused sensor data, which may be impractical due to bandwidth constraints. This dissertation presents a distributed radar resource optimization approach for a network of multifunction radars. Linear and nonlinear models estimate the resource allocation for multifunction radar search and track functions. Interactions between radars occur over time-invariant balanced graphs that may be directed or undirected. The collective search area and target-assignment solution for coordinated radars is optimized by balancing resource usage across the radar network and minimizing total resource usage. Agreement on the global optimal target-assignment solution is ensured using a distributed binary consensus algorithm. Monte Carlo simulations validate the coordinated approach over uncoordinated alternatives.
An ideal mass assignment scheme for measuring the Power Spectrum with FFTs
Cui, Weiguang; Yang, Xiaohu; Wang, Yu; Feng, Longlong; Springel, Volker
2008-01-01
In measuring the power spectrum of the distribution of large numbers of dark matter particles in simulations, or galaxies in observations, one has to use Fast Fourier Transforms (FFT) for calculational efficiency. However, because of the required mass assignment onto grid points in this method, the measured power spectrum $\\la |\\delta^f(k)|^2\\ra$ obtained with an FFT is not the true power spectrum $P(k)$ but instead one that is convolved with a window function $|W(\\vec k)|^2$ in Fourier space. In a recent paper, Jing (2005) proposed an elegant algorithm to deconvolve the sampling effects of the window function and to extract the true power spectrum, and tests using N-body simulations show that this algorithm works very well for the three most commonly used mass assignment functions, i.e., the Nearest Grid Point (NGP), the Cloud In Cell (CIC) and the Triangular Shaped Cloud (TSC) methods. In this paper, rather than trying to deconvolve the sampling effects of the window function, we propose to select a particu...
Heuristic for Task-Worker Assignment with Varying Learning Slopes
Directory of Open Access Journals (Sweden)
Wipawee Tharmmaphornphilas
2010-04-01
Full Text Available Fashion industry has variety products, so the multi-skilled workers are required to improve flexibility in production and assignment. Generally the supervisor will assign task to the workers based on skill and skill levels of worker. Since in fashion industry new product styles are launched more frequently and the order size tends to be smaller, the workers always learn when the raw material and the production process changes. Consequently they require less time to produce the succeeding units of a task based on their learning ability. Since the workers have both experience and inexperience workers, so each worker has different skill level and learning ability. Consequently, the assignment which assumed constant skill level is not proper to use. This paper proposes a task-worker assignment considering worker skill levels and learning abilities. Processing time of each worker changes along production period due to a worker learning ability. We focus on a task-worker assignment in a fashion industry where tasks are ordered in series; the number of tasks is greater than the number of workers. Therefore, workers can perform multiple assignments followed the precedence restriction as an assembly line balancing problem. The problem is formulated in an integer linear programming model with objective to minimize makespan. A heuristic is proposed to determine the lower bound (LB and the upper bound (UB of the problem and the best assignment is determined. The performance of the heuristic method is tested by comparing quality of solution and computational time to optimal solutions.
Comparative Analysis of Serial Decision Tree Classification Algorithms
Matthew Nwokejizie Anyanwu; Sajjan Shiva
2009-01-01
Classification of data objects based on a predefined knowledge of the objects is a data mining and knowledge management technique used in grouping similar data objects together. It can be defined as supervised learning algorithms as it assigns class labels to data objects based on the relationship between the data items with a pre-defined class label. Classification algorithms have a wide range of applications like churn prediction, fraud detection, artificial intelligence, and credit card ra...
Linear assignment maps for correlated system-environment states
Energy Technology Data Exchange (ETDEWEB)
Rodriguez-Rosario, Cesar A.; Modi, Kavan; Aspuru-Guzik, Alan
2010-01-20
Assignment maps are mathematical operators that describe initial system-environment states for open quantum systems. We re-examine the notion of assignments that account for correlations between the system and the environment and show that these maps can be made linear at the expense of giving up positivity or consistency of the map. We study the role of positivity and consistency of the map and show the effects of relaxing these. Finally, we establish a connection between the violation of the positivity of linear assignments and the no-broadcasting theorem.
Optimal assignment of incoming flights to baggage carousels at airports
DEFF Research Database (Denmark)
Barth, Torben C.
The problem considered in this report is an assignment problem occurring at airports. This problem concerns the assignment of baggage carousels in baggage claim halls to arriving aircraft (baggage carousel assignment problem). This is a highly dynamic problem since disruptions frequently occur du...... and in general is a substantial support in decision making....... during operations. We introduce a basic static model that can be adapted to the layout of different airports. Afterwards we show how a decision support system based on a MIP-model can be designed in a dynamic real world environment. The system supports the decisions of the dispatcher during daily...
Assignment of phycocyanobilin in HMPT using triple resonance experiments.
Röben, Marco; Schmieder, Peter
2011-09-01
A complete assignment of all resonances of a small organic molecule is a prerequisite for a structure determination using NMR spectroscopy. This is conventionally obtained using a well-established strategy based on COSY, HMQC and HMBC spectra. In case of phycocyanobilin (PCB) in HMPT this strategy was unsuccessful due to the symmetry of the molecule and extreme signal overlap. Since (13)C and (15)N labeled material was available, an alternative strategy for resonance assignment was used. Triple resonance experiments derived from experiments conventionally performed for proteins are sensitive and easy to analyze. Their application led to a complete and unambiguous assignment using three types of experiments. PMID:21815209
Models and Algorithm for Stochastic Network Designs
Institute of Scientific and Technical Information of China (English)
Anthony Chen; Juyoung Kim; Seungjae Lee; Jaisung Choi
2009-01-01
The network design problem (NDP) is one of the most difficult and challenging problems in trans-portation. Traditional NDP models are often posed as a deterministic bilevel program assuming that all rele-vant inputs are known with certainty. This paper presents three stochastic models for designing transporta-tion networks with demand uncertainty. These three stochastic NDP models were formulated as the ex-pected value model, chance-constrained model, and dependent-chance model in a bilevel programming framework using different criteria to hedge against demand uncertainty. Solution procedures based on the traffic assignment algorithm, genetic algorithm, and Monte-Cado simulations were developed to solve these stochastic NDP models. The nonlinear and nonconvex nature of the bilevel program was handled by the genetic algorithm and traffic assignment algorithm, whereas the stochastic nature was addressed through simulations. Numerical experiments were conducted to evaluate the applicability of the stochastic NDP models and the solution procedure. Results from the three experiments show that the solution procedures are quite robust to different parameter settings.
Novel algorithm of finding good candidate pre-configuration cycles in survivable WDM mesh network
Institute of Scientific and Technical Information of China (English)
ZHAO Tai-fei; YU Hong-fang; LI Le-min
2006-01-01
We present a novel algorithm of finding cycles, called the Fast Cycles Mining Algorithm (FCMA),for effi cient p-cycle network design in WDM networks. The algorithm is also flexible in that the number and the length of cycles generated are controlled by several input parameters. The problem of wavelength assign ment on p-cycle is considered in the algorithm. This algorithm is scalable and especially suitable for surviv able WDM mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.
New multi layer data correlation algorithm for multi passive sensor location system
Institute of Scientific and Technical Information of China (English)
Zhou Li; Li Lingyun; He You
2007-01-01
Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough correlations before we calculate the correlation cost, so it avoids the operations for the target state estimate and the calculation of the correlation cost for the false correlation sets. In the meantime, with the elimination of these points in the rough correlation, the disturbance from the false correlations in the assignment process is decreased, so the data correlation accuracy is improved correspondingly. Complexity analyses of the new multi-layer optimal algorithm and the traditional optimal assignment algorithm are given. Simulation results show that the new algorithm is feasible and effective.
Zawadzka-Kazimierczuk, Anna; Koźmiński, Wiktor; Billeter, Martin
2012-09-01
While NMR studies of proteins typically aim at structure, dynamics or interactions, resonance assignments represent in almost all cases the initial step of the analysis. With increasing complexity of the NMR spectra, for example due to decreasing extent of ordered structure, this task often becomes both difficult and time-consuming, and the recording of high-dimensional data with high-resolution may be essential. Random sampling of the evolution time space, combined with sparse multidimensional Fourier transform (SMFT), allows for efficient recording of very high dimensional spectra (≥4 dimensions) while maintaining high resolution. However, the nature of this data demands for automation of the assignment process. Here we present the program TSAR (Tool for SMFT-based Assignment of Resonances), which exploits all advantages of SMFT input. Moreover, its flexibility allows to process data from any type of experiments that provide sequential connectivities. The algorithm was tested on several protein samples, including a disordered 81-residue fragment of the δ subunit of RNA polymerase from Bacillus subtilis containing various repetitive sequences. For our test examples, TSAR achieves a high percentage of assigned residues without any erroneous assignments. PMID:22806130
Cross layer scheduling algorithm for LTE Downlink
DEFF Research Database (Denmark)
Popovska Avramova, Andrijana; Yan, Ying; Dittmann, Lars
2012-01-01
(multiple antenna) techniques. The Radio Resource Management at the base station plays major role in satisfying the users demand for high data rates and QoS. Resources for both downlink and uplink transmission need to be assigned such that the capacity, throughput, and cell edge performance are optimized......The LTE standards is leading standard in the wireless broadband market. In order to accommodate the increased demand for mobile data services the radio interface in the LTE standard is enhanced with advanced technologies such as OFDMA (Orthogonal Frequency Division Multiple Access) and MIMO....... This paper evaluates a cross layer scheduling algorithm that aims at minimizing the resource utilization. The algorithm makes decisions regarding the channel conditions and the size of transmission buffers and different QoS demands. The simulation results show that the new algorithm improves the resource...
A Variable Weighted Least-Connection Algorithm for Multimedia Transmission
Institute of Scientific and Technical Information of China (English)
杨立辉; 余胜生
2003-01-01
Under high loads, a multimedia duster server can serve many hundreds of connections concurrently, where a load balancer distributes the incoming connection request to each node according to a preset algorithm. Among existing scheduling algorithms, round-Robin and least-connection do not take into account the difference of service capability of each node and improved algorithms such as weighted round-Robin and weighted least-connection. They also do not consider the fact that the ratio of number of TCP connections and the fixed weight does not reflect the real load of node. In this paper we introduce our attempts in improving the scheduling algorithms and propose a variable weighted least-connection algorithm, which assigns variable weight, instead of fixed weight, to each node according to its real time resource. A validating trial has been performed and the results show that the proposed algorithm has effective load balancing in one central control node scenario.
Skiena, Steven S
2008-01-01
Explaining designing algorithms, and analyzing their efficacy and efficiency, this book covers combinatorial algorithms technology, stressing design over analysis. It presents instruction on methods for designing and analyzing computer algorithms. It contains the catalog of algorithmic resources, implementations and a bibliography
Fister, Iztok; Yang, Xin-She; Fister, Dušan
2013-01-01
Swarm intelligence is a very powerful technique to be used for optimization purposes. In this paper we present a new swarm intelligence algorithm, based on the bat algorithm. The Bat algorithm is hybridized with differential evolution strategies. Besides showing very promising results of the standard benchmark functions, this hybridization also significantly improves the original bat algorithm.
Optimization of Fleet Assignment: A Case Study in Turkey
Directory of Open Access Journals (Sweden)
Yavuz OZDEMIR
2012-01-01
Full Text Available Since poor fleet assignment can cause a great increase in costs for airline companies, asolution of the type ‘right fleet for the right flight’ would be very useful. In this paper, a fleetassignment model is set up using the data of the largest Airline Company in Turkey, TurkishAirlines. The aim of this model is to assign the most appropriate fleet type to flights whileminimizing the cost and determining the optimal number of aircraft grounded overnight at eachairport. We set up a model with constraints with thinking all airline operations and solve ourproblem using integer linear programming. Finally, we get an optimum solution which minimizesthe total cost while assigning the fleet type to the flight leg. Using optimization software (Lindo6.1, the solution to this problem generates a minimum daily cost of fleet assignment.
28 CFR 544.74 - Work assignment limitations.
2010-07-01
... appointment and promotion apply to all inmates, including those exempted from required participation in the... of the assignment. Local Federal Prison Industry (FPI) management may elect to retain the...
34 CFR 682.508 - Assignment of a loan.
2010-07-01
... FISL Program loan is to result in a change in the identity of the party to whom the borrower must send..., provide separate notices to the borrower of— (i) The assignment; (ii) The identity of the assignee;...
Calibrated peer review assignments for the earth sciences
Rudd, J.A., II; Wang, V.Z.; Cervato, C.; Ridky, R.W.
2009-01-01
Calibrated Peer Review ??? (CPR), a web-based instructional tool developed as part of the National Science Foundation reform initiatives in undergraduate science education, allows instructors to incorporate multiple writing assignments in large courses without overwhelming the instructor. This study reports successful implementation of CPR in a large, introductory geology course and student learning of geoscience content. For each CPR assignment in this study, students studied web-based and paper resources, wrote an essay, and reviewed seven essays (three from the instructor, three from peers, and their own) on the topic. Although many students expressed negative attitudes and concerns, particularly about the peer review process of this innovative instructional approach, they also recognized the learning potential of completing CPR assignments. Comparing instruction on earthquakes and plate boundaries using a CPR assignment vs. an instructional video lecture and homework essay with extensive instructor feedback, students mastered more content via CPR instruction.
Energy Technology Data Exchange (ETDEWEB)
Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics
1997-11-01
The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.
Homework assignment and student achievement in OECD countries
Torberg Falch; Marte Rønning
2011-01-01
This paper analyzes the effect of assigning homework on student achievement using data from 16 OECD countries that participated in TIMSS 2007. The model exploits withinstudent variation in homework across subjects in a sample of primary school students who have the same teacher in two related subjects; mathematics and science. Unobserved teacher and student characteristics are thus conditioned out of the model and the identification rests on random relative homework assignment across the subj...
Membership Function Assignment for Elements of Single OWL Ontology
Verhodubs, Olegs
2014-01-01
This paper develops the idea of membership function assignment for OWL (Web Ontology Language) ontology elements in order to subsequently generate fuzzy rules from this ontology. The task of membership function assignment for OWL ontology elements had already been partially described, but this concerned the case, when several OWL ontologies of the same domain were available, and they were merged into a single ontology. The purpose of this paper is to present the way of membership function ass...
Managing cost uncertainties in transportation and assignment problems
Arsham, H.; Adlakha, V.
1998-01-01
In a fast changing global market, a manager is concerned with cost uncertainties of the cost matrix in transportation problems (TP) and assignment problems (AP).A time lag between the development and application of the model could cause cost parameters to assume different values when an optimal assignment is implemented. The manager might wish to determine the responsiveness of the current optimal solution to such uncertainties. A desirable tool is to construct a perturbation set (PS) of cost...
A delayed flow intersection model for dynamic traffic assignment
DURLIN, T; HENN, V
2005-01-01
Day-to-Day and Within-Day dynamics are classically observed in dynamic traffic assignment, but smaller ones due to traffic lights phases also occur. These micro variations induce flow fluctuations defined at a cycle time scale. Their precise knowledge is irrelevant in a dynamic traffic assignment context. We propose to integrate these micro dynamics into a new intersection model without stages in which their average effects must be taken into account, especially delay and flow restriction ge...
Context-Aware Reviewer Assignment for Trust Enhanced Peer Review.
Directory of Open Access Journals (Sweden)
Lei Li
Full Text Available Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT, which aims to effectively estimate the "true" ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are.
Context-Aware Reviewer Assignment for Trust Enhanced Peer Review.
Li, Lei; Wang, Yan; Liu, Guanfeng; Wang, Meng; Wu, Xindong
2015-01-01
Reviewer assignment is critical to peer review systems, such as peer-reviewed research conferences or peer-reviewed funding applications, and its effectiveness is a deep concern of all academics. However, there are some problems in existing peer review systems during reviewer assignment. For example, some of the reviewers are much more stringent than others, leading to an unfair final decision, i.e., some submissions (i.e., papers or applications) with better quality are rejected. In this paper, we propose a context-aware reviewer assignment for trust enhanced peer review. More specifically, in our approach, we first consider the research area specific expertise of reviewers, and the institution relevance and co-authorship between reviewers and authors, so that reviewers with the right expertise are assigned to the corresponding submissions without potential conflict of interest. In addition, we propose a novel cross-assignment paradigm, and reviewers are cross-assigned in order to avoid assigning a group of stringent reviewers or a group of lenient reviewers to the same submission. More importantly, on top of them, we propose an academic CONtext-aware expertise relevanCe oriEnted Reviewer cross-assignmenT approach (CONCERT), which aims to effectively estimate the "true" ratings of submissions based on the ratings from all reviewers, even though no prior knowledge exists about the distribution of stringent reviewers and lenient reviewers. The experiments illustrate that compared with existing approaches, our proposed CONCERT approach can less likely assign more than one stringent reviewers or lenient reviewers to a submission simultaneously and significantly reduce the influence of ratings from stringent reviewers and lenient reviewers, leading to trust enhanced peer review and selection, no matter what kind of distributions of stringent reviewers and lenient reviewers are. PMID:26090849
Jackson, C. Kirabo
2011-01-01
Existing studies on single-sex schooling suffer from biases due to student selection to schools and single-sex schools being better in unmeasured ways. In Trinidad and Tobago students are assigned to secondary schools based on an algorithm allowing one to address self-selection bias and cleanly estimate an upper-bound single-sex school effect. The…
Algorithmically specialized parallel computers
Snyder, Lawrence; Gannon, Dennis B
1985-01-01
Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster
A Bayesian Assignment Method for Ambiguous Bisulfite Short Reads.
Directory of Open Access Journals (Sweden)
Hong Tran
Full Text Available DNA methylation is an epigenetic modification critical for normal development and diseases. The determination of genome-wide DNA methylation at single-nucleotide resolution is made possible by sequencing bisulfite treated DNA with next generation high-throughput sequencing. However, aligning bisulfite short reads to a reference genome remains challenging as only a limited proportion of them (around 50-70% can be aligned uniquely; a significant proportion, known as multireads, are mapped to multiple locations and thus discarded from downstream analyses, causing financial waste and biased methylation inference. To address this issue, we develop a Bayesian model that assigns multireads to their most likely locations based on the posterior probability derived from information hidden in uniquely aligned reads. Analyses of both simulated data and real hairpin bisulfite sequencing data show that our method can effectively assign approximately 70% of the multireads to their best locations with up to 90% accuracy, leading to a significant increase in the overall mapping efficiency. Moreover, the assignment model shows robust performance with low coverage depth, making it particularly attractive considering the prohibitive cost of bisulfite sequencing. Additionally, results show that longer reads help improve the performance of the assignment model. The assignment model is also robust to varying degrees of methylation and varying sequencing error rates. Finally, incorporating prior knowledge on mutation rate and context specific methylation level into the assignment model increases inference accuracy. The assignment model is implemented in the BAM-ABS package and freely available at https://github.com/zhanglabvt/BAM_ABS.
A high fidelity VQ coding algorithm with region adaptive subbanding
Institute of Scientific and Technical Information of China (English)
YANG Zhong-qi; BAI Zhi-can; LI Dong-mei; YANG Chang-sheng
2005-01-01
Image subbands can be obtained by using filterbank. Traditional compression method uses direct entropy coding for each subband. After studying the energy distribution in image subbands, we proposed a vector quantization (VQ) coding algorithm to image subband. In the algorithm, vector quantizers were adaptively designed for high-frequency bands in an image. In particular,the edges of the image were examined and fewer bits were assigned to high-energy regions. The experimental result showed that the algorithm had higher SNR and higher compression ratio than possible by traditional subband coding, JPEG and JPEG 2000.
An algorithm for link restoration of wavelength routing optical networks
DEFF Research Database (Denmark)
Limal, Emmanuel; Stubkjær, Kristian
1999-01-01
We present an algorithm for restoration of single link failure in wavelength routing multihop optical networks. The algorithm is based on an innovative study of networks using graph theory. It has the following original features: it (i) assigns working and spare channels simultaneously, (ii......) prevents the search for unacceptable routing paths by pointing out channels required for restoration, (iii) offers a high utilization of the capacity resources and (iv) allows a trivial search for the restoration paths. The algorithm is for link restoration of networks without wavelength translation. Its...
Comparison of greedy algorithms for α-decision tree construction
Alkhalid, Abdulaziz
2011-01-01
A comparison among different heuristics that are used by greedy algorithms which constructs approximate decision trees (α-decision trees) is presented. The comparison is conducted using decision tables based on 24 data sets from UCI Machine Learning Repository [2]. Complexity of decision trees is estimated relative to several cost functions: depth, average depth, number of nodes, number of nonterminal nodes, and number of terminal nodes. Costs of trees built by greedy algorithms are compared with minimum costs calculated by an algorithm based on dynamic programming. The results of experiments assign to each cost function a set of potentially good heuristics that minimize it. © 2011 Springer-Verlag.
L. Finesso; A. Grassi; P. Spreij
2010-01-01
We propose a two-step algorithm for the construction of a Hidden Markov Model (HMM) of assigned size, i.e. cardinality of the state space of the underlying Markov chain, whose n-dimensional distribution is closest in divergence to a given distribution. The algorithm is based on the factorization of
Institute of Scientific and Technical Information of China (English)
Tian-qi WU; Min YAO; Jian-hua YANG
2016-01-01
By adopting the distributed problem-solving strategy, swarm intelligence algorithms have been successfully applied to many optimization problems that are difficult to deal with using traditional methods. At present, there are many well-implemented algorithms, such as particle swarm optimization, genetic algorithm, artificial bee colony algorithm, and ant colony optimization. These algorithms have already shown favorable performances. However, with the objects becoming increasingly complex, it is becoming gradually more difficult for these algorithms to meet human’s demand in terms of accuracy and time. Designing a new algorithm to seek better solutions for optimization problems is becoming increasingly essential. Dolphins have many noteworthy biological characteristics and living habits such as echolocation, information exchanges, cooperation, and division of labor. Combining these biological characteristics and living habits with swarm intelligence and bringing them into optimization prob-lems, we propose a brand new algorithm named the ‘dolphin swarm algorithm’ in this paper. We also provide the definitions of the algorithm and specific descriptions of the four pivotal phases in the algorithm, which are the search phase, call phase, reception phase, and predation phase. Ten benchmark functions with different properties are tested using the dolphin swarm algorithm, particle swarm optimization, genetic algorithm, and artificial bee colony algorithm. The convergence rates and benchmark func-tion results of these four algorithms are compared to testify the effect of the dolphin swarm algorithm. The results show that in most cases, the dolphin swarm algorithm performs better. The dolphin swarm algorithm possesses some great features, such as first-slow-then-fast convergence, periodic convergence, local-optimum-free, and no specific demand on benchmark functions. Moreover, the dolphin swarm algorithm is particularly appropriate to optimization problems, with more
International Nuclear Information System (INIS)
Genome wide gene expression data is a rich source for the identification of gene signatures suitable for clinical purposes and a number of statistical algorithms have been described for both identification and evaluation of such signatures. Some employed algorithms are fairly complex and hence sensitive to over-fitting whereas others are more simple and straight forward. Here we present a new type of simple algorithm based on ROC analysis and the use of metagenes that we believe will be a good complement to existing algorithms. The basis for the proposed approach is the use of metagenes, instead of collections of individual genes, and a feature selection using AUC values obtained by ROC analysis. Each gene in a data set is assigned an AUC value relative to the tumor class under investigation and the genes are ranked according to these values. Metagenes are then formed by calculating the mean expression level for an increasing number of ranked genes, and the metagene expression value that optimally discriminates tumor classes in the training set is used for classification of new samples. The performance of the metagene is then evaluated using LOOCV and balanced accuracies. We show that the simple uni-variate gene expression average algorithm performs as well as several alternative algorithms such as discriminant analysis and the more complex approaches such as SVM and neural networks. The R package rocc is freely available at http://cran.r-project.org/web/packages/rocc/index.html
Directory of Open Access Journals (Sweden)
Ryden Tobias
2010-10-01
Full Text Available Abstract Background Genome wide gene expression data is a rich source for the identification of gene signatures suitable for clinical purposes and a number of statistical algorithms have been described for both identification and evaluation of such signatures. Some employed algorithms are fairly complex and hence sensitive to over-fitting whereas others are more simple and straight forward. Here we present a new type of simple algorithm based on ROC analysis and the use of metagenes that we believe will be a good complement to existing algorithms. Results The basis for the proposed approach is the use of metagenes, instead of collections of individual genes, and a feature selection using AUC values obtained by ROC analysis. Each gene in a data set is assigned an AUC value relative to the tumor class under investigation and the genes are ranked according to these values. Metagenes are then formed by calculating the mean expression level for an increasing number of ranked genes, and the metagene expression value that optimally discriminates tumor classes in the training set is used for classification of new samples. The performance of the metagene is then evaluated using LOOCV and balanced accuracies. Conclusions We show that the simple uni-variate gene expression average algorithm performs as well as several alternative algorithms such as discriminant analysis and the more complex approaches such as SVM and neural networks. The R package rocc is freely available at http://cran.r-project.org/web/packages/rocc/index.html.
Decoherence in Search Algorithms
Abal, G; Marquezino, F L; Oliveira, A C; Portugal, R
2009-01-01
Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the implementation of those new algorithms in quantum computers or in other quantum devices is error-prone, it is important to analyze their robustness under decoherence. In this work we analyze the impact of decoherence on quantum search algorithms implemented on two-dimensional grids and on hypercubes.
Symplectic algebraic dynamics algorithm
Institute of Scientific and Technical Information of China (English)
2007-01-01
Based on the algebraic dynamics solution of ordinary differential equations andintegration of ,the symplectic algebraic dynamics algorithm sn is designed,which preserves the local symplectic geometric structure of a Hamiltonian systemand possesses the same precision of the na ve algebraic dynamics algorithm n.Computer experiments for the 4th order algorithms are made for five test modelsand the numerical results are compared with the conventional symplectic geometric algorithm,indicating that sn has higher precision,the algorithm-inducedphase shift of the conventional symplectic geometric algorithm can be reduced,and the dynamical fidelity can be improved by one order of magnitude.
New focused crawling algorithm
Institute of Scientific and Technical Information of China (English)
Su Guiyang; Li Jianhua; Ma Yinghua; Li Shenghong; Song Juping
2005-01-01
Focused carawling is a new research approach of search engine. It restricts information retrieval and provides search service in specific topic area. Focused crawling search algorithm is a key technique of focused crawler which directly affects the search quality. This paper first introduces several traditional topic-specific crawling algorithms, then an inverse link based topic-specific crawling algorithm is put forward. Comparison experiment proves that this algorithm has a good performance in recall, obviously better than traditional Breadth-First and Shark-Search algorithms. The experiment also proves that this algorithm has a good precision.
RNA-PAIRS: RNA probabilistic assignment of imino resonance shifts
Energy Technology Data Exchange (ETDEWEB)
Bahrami, Arash; Clos, Lawrence J.; Markley, John L.; Butcher, Samuel E. [National Magnetic Resonance Facility at Madison (United States); Eghbalnia, Hamid R., E-mail: eghbalhd@uc.edu [University of Cincinnati, Department of Molecular and Cellular Physiology (United States)
2012-04-15
The significant biological role of RNA has further highlighted the need for improving the accuracy, efficiency and the reach of methods for investigating RNA structure and function. Nuclear magnetic resonance (NMR) spectroscopy is vital to furthering the goals of RNA structural biology because of its distinctive capabilities. However, the dispersion pattern in the NMR spectra of RNA makes automated resonance assignment, a key step in NMR investigation of biomolecules, remarkably challenging. Herein we present RNA Probabilistic Assignment of Imino Resonance Shifts (RNA-PAIRS), a method for the automated assignment of RNA imino resonances with synchronized verification and correction of predicted secondary structure. RNA-PAIRS represents an advance in modeling the assignment paradigm because it seeds the probabilistic network for assignment with experimental NMR data, and predicted RNA secondary structure, simultaneously and from the start. Subsequently, RNA-PAIRS sets in motion a dynamic network that reverberates between predictions and experimental evidence in order to reconcile and rectify resonance assignments and secondary structure information. The procedure is halted when assignments and base-parings are deemed to be most consistent with observed crosspeaks. The current implementation of RNA-PAIRS uses an initial peak list derived from proton-nitrogen heteronuclear multiple quantum correlation ({sup 1}H-{sup 15}N 2D HMQC) and proton-proton nuclear Overhauser enhancement spectroscopy ({sup 1}H-{sup 1}H 2D NOESY) experiments. We have evaluated the performance of RNA-PAIRS by using it to analyze NMR datasets from 26 previously studied RNAs, including a 111-nucleotide complex. For moderately sized RNA molecules, and over a range of comparatively complex structural motifs, the average assignment accuracy exceeds 90%, while the average base pair prediction accuracy exceeded 93%. RNA-PAIRS yielded accurate assignments and base pairings consistent with imino
Channel assignment under a conflict-free allocation policy
Stavrakakis, Ioannis
1994-02-01
In this paper, a random, conflict-free slot assignment policy is adopted for the allocation of a common channel between two (non-communicating) stations. Although this policy is inferior to the optimal periodic, fixed slot assignment policy, it is shown than it achieves the performance of that optimal policy as the variance of the packet arrival process increases. The main advantage of the random, conflict-free slot assignment policy is that it is simple and always feasible unlike the optimal, periodic, fixed slot assignment policy. Furthermore, the proposed policy is easily implemented in a dynamically changing environment; the optimal of such a policy is derived, and a simple strategy based on a threshold test is developed for the identification of the optimal such policy, when estimates of the traffic parameters are available. No such strategy is known for the adaptation of the parameters of the optimal periodic, fixed slot assignment policy. The developed analysis approach can be applied, to a great extent, to a system with more than two stations.
Wildlife forensic science: A review of genetic geographic origin assignment.
Ogden, Rob; Linacre, Adrian
2015-09-01
Wildlife forensic science has become a key means of enforcing legislation surrounding the illegal trade in protected and endangered species. A relatively new dimension to this area of forensic science is to determine the geographic origin of a seized sample. This review focuses on DNA testing, which relies on assignment of an unknown sample to its genetic population of origin. Key examples of this are the trade in timber, fish and ivory and these are used only to illustrate the large number of species for which this type of testing is potentially available. The role of mitochondrial and nuclear DNA markers is discussed, alongside a comparison of neutral markers with those exhibiting signatures of selection, which potentially offer much higher levels of assignment power to address specific questions. A review of assignment tests is presented along with detailed methods for evaluating error rates and considerations for marker selection. The availability and quality of reference data are of paramount importance to support assignment applications and ensure reliability of any conclusions drawn. The genetic methods discussed have been developed initially as investigative tools but comment is made regarding their use in courts. The potential to compliment DNA markers with elemental assays for greater assignment power is considered and finally recommendations are made for the future of this type of testing.
An integer programming model for assigning students to elective courses
Directory of Open Access Journals (Sweden)
Ivo Beroš
2015-10-01
Full Text Available This paper deals with the problem of assigning students to elective courses according to their preferences. This process of assigning students to elective courses according to their preferences often places before academic institutions numerous obstacles, the most typical being a limited number of students who can be assigned to any particular class. Furthermore, due to financial or technical reasons, the maximum number of the elective courses is determined in advance, meaning that the institution decides which courses to conduct. Therefore, the expectation that all the students will be assigned to their first choice of courses is not realistic (perfect satisfaction. This paper presents an integer programming model that maximizes the total student satisfaction in line with a number of different constraints. The measure of student satisfaction is based on a student's order of preference according to the principle: the more a choice is met the higher the satisfaction. Following the basic model, several versions of the models are generated to cover possible real-life situations, while taking into consideration the manner student satisfaction is measured, as well as the preference of academic institution within set technical and financial constraints. The main contribution of the paper is introducing the concept of the minimal student satisfaction level that reduces the number of students dissatised with the courses to which they were assigned.
Raman vapor spectrum and vibrational assignment for pyridine
Klots, T. D.
1998-09-01
Assignment modifications for the pyridine fundamentals are proposed, based on first time Raman vapor measurements, and a more complete set of infrared and Raman spectra for the gas and liquid. Raman polarization measurements are newly given for some 70 lines between 1600 and 3000 cm -1. The Kakiuti et al. (Kakiuti et al., J. Mol. Spectrosc. 61 (1976) 164) assignment for the nonplanar modes in CS 2 solution is shown to be the only previous correct assignment. Planar assignment modifications, though generally small, are warranted because of the benchmark nature of pyridine. A previous set of vibrational frequencies, derived from a scaled 4-21G force field calculation (Pongor et al., J. Am. Chem. Soc. 106 (1984) 2765; Pongor et al., J. Mol. Spectrosc. 114 (1985) 445), is in excellent agreement with the observed fundamentals, and in fact, tips the balance in favor of assigning ν22 to 1053 cm -1. Ideal-gas entropies derived from spectroscopic constants are also seen to be in excellent agreement with those from calorimetry (Chirico et al., J. Chem. Thermodyn. 28 (1996) 797; Chirico and Steele, J. Chem. Thermodyn. 28 (1996) 819).
Reflective practice: assessment of assignments in English for Specific Purposes
Directory of Open Access Journals (Sweden)
Galina Kavaliauskiené
2007-10-01
Full Text Available The construct alternative assessment has been widely used in higher education. It is often defined as any type of assessment of learners who provide a response to an assignment. The key features of alternative assessment are active participation of learners in self-evaluation of their performance, and the development of reflective thinking through reflective thinking (Schön, 1983. The success of alternative assessment in language teaching is predetermined by student’s performance and demonstrates learner’s language proficiency in contemporary communicative classrooms. This paper aims at researching the influence of students’ evaluations of various assignments for their linguistic development in English for Specific Purposes (ESP. The study uses learners’ assessment of different assignments and learners’ in-course and post-course written reflections on benefits to language mastery. Learners’ assignments included were contributions to portfolios (dossiers, such as essays and summaries, oral presentations, short impromptu talks, creative tasks, tests, and self-assessment notes (reflections on activities in learning ESP. Findings were obtained for two streams of the project participants. Results showed that self-assessment was beneficial for learners’ linguistic development. The context of learners’ reflections reveals that the attitudes to various assignments are affected by success or failure in students’ performance. Reflective practice might help teachers develop ways of dealing with previously identified difficulties and improve the quality of teaching.
Using Genetic Algorithm For Winter Maintenance Operations: Multi Depot K-Chinese Postman Problem
Directory of Open Access Journals (Sweden)
İbrahim Zeki Akyurt
2015-02-01
Full Text Available In this study, the assignment and routing problem of one of Istanbul’s winter maintenance activities, salt pouring, was scrutinized. The starting point of the study considers the high cost of winter maintenance work, a shrinking assigned budget, high numbers of vehicles and streets to service that the increase in difficulty to solve the problem due to their high numbers. In this respect, the problem was modeled as multi depot k-Chinese postman problem, a type of arc routing problem. This mathematical model was solved by genetic algorithm. For comparison, the current solution, Clarke and Wright Algorithm and Sweep Algorithm were used.
Multi-Deme Parallel FGAs-Based Algorithm for Multitarget Tracking
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation (COW) with Message Passing Interface (MPI) is built. The proposed Multi-Deme Parallel FGA (MDPFGA) is run on the platform. A serial of special MDPFGAs are used to determine the static and the dynamic solutions of generalized m-best S-D assignment problem respectively, as well as target states estimation in track management. Such an assignment-based parallel algorithm is demonstrated on simulated passive sensor track formation and maintenance problem. While illustrating the feasibility of the proposed algorithm in multisensor multitarget tracking, simulation results indicate that the MDPFGAs-based algorithm has greater efficiency and speed than the FGAs-based algorithm.
Self-adaptive learning based discrete differential evolution algorithm for solving CJWTA problem
Institute of Scientific and Technical Information of China (English)
Yu Xue; Yi Zhuang; Tianquan Ni; Siru Ni; Xuezhi Wen
2014-01-01
Cooperative jamming weapon-target assignment (CJWTA) problem is a key issue in electronic countermeasures (ECM). Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution (SLDDE) algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.
Directory of Open Access Journals (Sweden)
Khanh Nguyen Quang
2013-01-01
Full Text Available The paper presents a dynamic subchannel assignment algorithm based on orthogonal frequency division multiple access technology operating in the time division duplexing and a new cross-layer design based on a proposed routing protocol jointed with the MAC protocol. The proposed dynamic sub-channel assignment algorithm provides a new interference avoidance mechanism which solves several drawbacks of existing radio resource allocation techniques in wireless networks using OFDMA/TDD, such as the hidden node and exposed node problems, mobility, and cochannels interference in frequency (CCI. Besides, in wireless networks, when a route is established, the radio resource allocation problems may decrease the end to end performance proportionally with the length of each route. The contention at MAC layer may cause the routing protocol at network layer to respond by finding new routes and routing table updates. The proposed routing protocol is jointed with the MAC protocol based on dynamic sub-channel assignment to ensure that the quality of service in multihop ad hoc networks is significantly improved.
Assigning on-ramp flows to maximize highway capacity
Wang, Qiao-Ming; Jiang, Rui; Sun, Xiao-Yan; Wang, Bing-Hong
2009-09-01
In this paper, we study the capacity of a highway with two on-ramps by using a cellular automata traffic flow model. We investigate how to improve the system capacity by assigning traffic flow to the two ramps. The system phase diagram is presented and different regions are classified. It is shown that in region I, in which both ramps are in free flow and the main road upstream of the ramps is in congestion, assigning a higher proportion of the demand to the upstream on-ramp could improve the overall flow, which is consistent with previous studies. This is explained through studying the spatiotemporal patterns and analytical investigations. In contrast, optimal assignment has not been observed in other regions. We point out that our result is robust and model independent under certain conditions.
Assignment of sex in neonates with ambiguous genitalia.
Reiner, W G
1999-08-01
Sex assignment in the newborn with ambiguous genitalia has been based on the adequacy of the phallus in the male, potential fertility in the female, and cosmetic appearance of the reconstructed genitalia. Recent data from both the neurosciences and from clinical research, however, casts doubt on the validity of such criteria for clinical decision making. Current knowledge suggests a need to shift away from the current clinical approach and to incorporate these new data into decisions based on a broader understanding of the etiology of gender identity. Recognition of the primacy of psychosocial and psychosexual developmental outcomes for children with ambiguous genitalia is lending direction to longitudinal outcomes research. New approaches to sex assignment have been suggested, and the paradigm for sex assignment in the newborn period is in transition.
The ICAP (Interactive Course Assignment Pages Publishing System
Directory of Open Access Journals (Sweden)
Kim Griggs
2008-03-01
Full Text Available The ICAP publishing system is an open source custom content management system that enables librarians to easily and quickly create and manage library help pages for course assignments (ICAPs, without requiring knowledge of HTML or other web technologies. The system's unique features include an emphasis on collaboration and content reuse and an easy-to-use interface that includes in-line help, simple forms and drag and drop functionality. The system generates dynamic, attractive course assignment pages that blend Web 2.0 features with traditional library resources, and makes the pages easier to find by providing a central web page for the course assignment pages. As of December 2007, the code is available as free, open-source software under the GNU General Public License.
Lexical stress assignment as a problem of probabilistic inference.
Jouravlev, Olessia; Lupker, Stephen J
2015-10-01
A new conceptualization of the process of stress assignment, couched in the principles of (Bayesian) probabilistic inference, is introduced in this paper. According to this approach, in deciding where to place stress in a polysyllabic word, a reader estimates the posterior probabilities of alternative stress patterns. This estimation is accomplished by adjusting a prior belief about the likelihoods of alternative stress patterns (derived from experience with the distribution of stress patterns in the language) by using lexical and non-lexical sources of evidence for stress derived from the orthographic input. The proposed theoretical framework was used to compute probabilities of stress patterns for Russian disyllabic words and nonwords which were then compared with the performance of readers. The results showed that the estimated probabilities of stress patterns were reflective of actual stress assignment performance and of naming latencies, suggesting that the mechanisms that are involved in the process of stress assignment might indeed be inferentially-based. PMID:25636917
Smith, Edward M.; Littrell, Jack; Olivier, Michael
2007-01-01
High-throughput SNP genotyping platforms use automated genotype calling algorithms to assign genotypes. While these algorithms work efficiently for individual platforms, they are not compatible with other platforms, and have individual biases that result in missed genotype calls. Here we present data on the use of a second complementary SNP genotype clustering algorithm. The algorithm was originally designed for individual fluorescent SNP genotyping assays, and has been optimized to permit th...
Chandramouli Anandaraman; Arun Vikram Madurai Sankar; Ramaraj Natarajan
2012-01-01
A new evolutionary computation algorithm, Superbug algorithm, which simulates evolution of bacteria in a culture, is proposed. The algorithm is developed for solving large scale optimization problems such as scheduling, transportation and assignment problems. In this work, the algorithm optimizes machine schedules in a Flexible Manufacturing System (FMS) by minimizing makespan. The FMS comprises of four machines and two identical Automated Guided Vehicles (AGVs). AGVs are used for carrying jo...
Improved Parameterized Algorithms for Constraint Satisfaction
Kim, Eun Jung
2010-01-01
Results from inapproximability provide several sharp thresholds on the approximability of important optimization problems. We give several improved parameterized algorithms for solving constraint satisfaction problems above a tight threshold. Our results include the following: - Improved algorithms for any Constraint Satisfaction Problem: Take any boolean Max-CSP with at most $c$ variables per constraint such that a random assignment satisfies a constraint with probability $p$. There is an algorithm such that for every instance of the problem with $m$ constraints, the algorithm decides whether at least $pm+k$ constraints can be satisfied in $O(2^{(c(c+1)/2) k} m)$ time. This improves on results of [Alon et al., SODA 2010] and [Crowston et al., SWAT 2010]. We observe that an $O(2^{\\eps k + \\eps m})$ time algorithm for every $\\eps > 0$ would imply that 3SAT is in subexponential time, so it seems unlikely that our runtime dependence on $k$ can be significantly improved. Our proof also shows that every Max-$c$-CS...
Competing Sudakov Veto Algorithms
Kleiss, Ronald
2016-01-01
We present a way to analyze the distribution produced by a Monte Carlo algorithm. We perform these analyses on several versions of the Sudakov veto algorithm, adding a cutoff, a second variable and competition between emission channels. The analysis allows us to prove that multiple, seemingly different competition algorithms, including those that are currently implemented in most parton showers, lead to the same result. Finally, we test their performance and show that there are significantly faster alternatives to the commonly used algorithms.
Borbely, Eva
2007-01-01
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed by a measurement. Currently very few quantum algorithms are known and no general design methodology e...
Accurate Finite Difference Algorithms
Goodrich, John W.
1996-01-01
Two families of finite difference algorithms for computational aeroacoustics are presented and compared. All of the algorithms are single step explicit methods, they have the same order of accuracy in both space and time, with examples up to eleventh order, and they have multidimensional extensions. One of the algorithm families has spectral like high resolution. Propagation with high order and high resolution algorithms can produce accurate results after O(10(exp 6)) periods of propagation with eight grid points per wavelength.
Autonomous Star Tracker Algorithms
DEFF Research Database (Denmark)
Betto, Maurizio; Jørgensen, John Leif; Kilsgaard, Søren;
1998-01-01
Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances.......Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances....
Approximate iterative algorithms
Almudevar, Anthony Louis
2014-01-01
Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a
New Method for Spin Assignment of Superdeformed Rotational Bands
Institute of Scientific and Technical Information of China (English)
MU Liang-Zhu; WU Chong-Shi
2005-01-01
A new method for spin assignment of superdeformed rotational bands is proposed and it turns out to be more efficient than other methods used before. The application is made to superdeformed bands in A ～ 190 and A ～ 150 mass regions. By analyzing the standard deviation of the fixed γ-ray energies of an SD band in different methods,the advantage of the present method over the other methods is presented. This method brings then a comprehensive interpretation of the methods used in spin assignment.
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks
Directory of Open Access Journals (Sweden)
Enrique de la Hoz
2015-11-01
Full Text Available Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks.
de la Hoz, Enrique; Gimenez-Guzman, Jose Manuel; Marsa-Maestre, Ivan; Orden, David
2015-01-01
Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.
Modified Adaptive Weighted Averaging Filtering Algorithm for Noisy Image Sequences
Institute of Scientific and Technical Information of China (English)
LI Weifeng; YU Daoyin; CHEN Xiaodong
2007-01-01
In order to avoid the influence of noise variance on the filtering performances, a modified adaptive weighted averaging (MAWA) filtering algorithm is proposed for noisy image sequences. Based upon adaptive weighted averaging pixel values in consecutive frames, this algorithm achieves the filtering goal by assigning smaller weights to the pixels with inappropriate estimated motion trajectory for noise. It only utilizes the intensity of pixels to suppress noise and accordingly is independent of noise variance. To evaluate the performance of the proposed filtering algorithm, its mean square error and percentage of preserved edge points were compared with those of traditional adaptive weighted averaging and non-adaptive mean filtering algorithms under different noise variances. Relevant results show that the MAWA filtering algorithm can preserve image structures and edges under motion after attenuating noise, and thus may be used in image sequence filtering.
Efficient Fault-Tolerant Event Query Algorithm in Distributed Wireless Sensor Networks
Rongbo Zhu
2010-01-01
To overcome the faulty data query problem to improve the accuracy of data query, an efficient fault-tolerant event query algorithm (FTEQ) is proposed, which takes the short-term and long-term spatial and temporal similarities between sensors and environment into considerations. An imprecise and missing data correction algorithm based on Kalman filter is proposed to correct fault sensing data, and a score rank algorithm also is proposed to assign each sensor an appropriate value to reflect the...
DEFF Research Database (Denmark)
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...... techniques and is organized by algorithmic paradigm....
Nature-inspired optimization algorithms
Yang, Xin-She
2014-01-01
Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning
GPU-Based Heuristic Solver for Linear Sum Assignment Problems Under Real-time Constraints
Roverso, Roberto; El-Beltagy, Mohammed; El-Ansary, Sameh
2011-01-01
In this paper we modify a fast heuristic solver for the Linear Sum Assignment Problem (LSAP) for use on Graphical Processing Units (GPUs). The motivating scenario is an industrial application for P2P live streaming that is moderated by a central node which is periodically solving LSAP instances for assigning peers to one another. The central node needs to handle LSAP instances involving thousands of peers in as near to real-time as possible. Our findings are generic enough to be applied in other contexts. Our main result is a parallel version of a heuristic algorithm called Deep Greedy Switching (DGS) on GPUs using the CUDA programming language. DGS sacrifices absolute optimality in favor of low computation time and was designed as an alternative to classical LSAP solvers such as the Hungarian and auctioning methods. The contribution of the paper is threefold: First, we present the process of trial and error we went through, in the hope that our experience will be beneficial to adopters of GPU programming for...
Akl, Selim G
1985-01-01
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
Assigning Main Orientation to an EOH Descriptor on Multispectral Images
Directory of Open Access Journals (Sweden)
Yong Li
2015-07-01
Full Text Available This paper proposes an approach to compute an EOH (edge-oriented histogram descriptor with main orientation. EOH has a better matching ability than SIFT (scale-invariant feature transform on multispectral images, but does not assign a main orientation to keypoints. Alternatively, it tends to assign the same main orientation to every keypoint, e.g., zero degrees. This limits EOH to matching keypoints between images of translation misalignment only. Observing this limitation, we propose assigning to keypoints the main orientation that is computed with PIIFD (partial intensity invariant feature descriptor. In the proposed method, SIFT keypoints are detected from images as the extrema of difference of Gaussians, and every keypoint is assigned to the main orientation computed with PIIFD. Then, EOH is computed for every keypoint with respect to its main orientation. In addition, an implementation variant is proposed for fast computation of the EOH descriptor. Experimental results show that the proposed approach performs more robustly than the original EOH on image pairs that have a rotation misalignment.
Assigning Main Orientation to an EOH Descriptor on Multispectral Images.
Li, Yong; Shi, Xiang; Wei, Lijun; Zou, Junwei; Chen, Fang
2015-07-01
This paper proposes an approach to compute an EOH (edge-oriented histogram) descriptor with main orientation. EOH has a better matching ability than SIFT (scale-invariant feature transform) on multispectral images, but does not assign a main orientation to keypoints. Alternatively, it tends to assign the same main orientation to every keypoint, e.g., zero degrees. This limits EOH to matching keypoints between images of translation misalignment only. Observing this limitation, we propose assigning to keypoints the main orientation that is computed with PIIFD (partial intensity invariant feature descriptor). In the proposed method, SIFT keypoints are detected from images as the extrema of difference of Gaussians, and every keypoint is assigned to the main orientation computed with PIIFD. Then, EOH is computed for every keypoint with respect to its main orientation. In addition, an implementation variant is proposed for fast computation of the EOH descriptor. Experimental results show that the proposed approach performs more robustly than the original EOH on image pairs that have a rotation misalignment.
A Randomized Experiment Comparing Random and Cutoff-Based Assignment
Shadish, William R.; Galindo, Rodolfo; Wong, Vivian C.; Steiner, Peter M.; Cook, Thomas D.
2011-01-01
In this article, we review past studies comparing randomized experiments to regression discontinuity designs, mostly finding similar results, but with significant exceptions. The latter might be due to potential confounds of study characteristics with assignment method or with failure to estimate the same parameter over methods. In this study, we…
The Complexity of Approximately Counting Stable Roommate Assignments
Chebolu, Prasad; Martin, Russell
2010-01-01
We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the $k$-attribute model, in which the preference lists are determined by dot products of "preference vectors" with "attribute vectors" and (ii) the $k$-Euclidean model, in which the preference lists are determined by the closeness of the "positions" of the people to their "preferred positions". Exactly counting the number of assignments is #P-complete, since Irving and Leather demonstrated #P-completeness for the special case of the stable marriage problem. We show that counting the number of stable roommate assignments in the $k$-attribute model ($k \\geq 4$) and the $3$-Euclidean model($k \\geq 3$) is interreducible, in an approximation-preserving sense, with counting independent sets (of all sizes) (#IS) in a graph, or counting the number of satisfying assignments of a Boolean formula (#SAT). This means that there can be no FPRAS for any of these problems unless NP=RP. As a consequence, we infer that there ...
Augmenting superpopulation capture-recapture models with population assignment data
Wen, Zhi; Pollock, Kenneth; Nichols, James; Waser, Peter
2011-01-01
Ecologists applying capture-recapture models to animal populations sometimes have access to additional information about individuals' populations of origin (e.g., information about genetics, stable isotopes, etc.). Tests that assign an individual's genotype to its most likely source population are increasingly used. Here we show how to augment a superpopulation capture-recapture model with such information. We consider a single superpopulation model without age structure, and split each entry probability into separate components due to births in situ and immigration. We show that it is possible to estimate these two probabilities separately. We first consider the case of perfect information about population of origin, where we can distinguish individuals born in situ from immigrants with certainty. Then we consider the more realistic case of imperfect information, where we use genetic or other information to assign probabilities to each individual's origin as in situ or outside the population. We use a resampling approach to impute the true population of origin from imperfect assignment information. The integration of data on population of origin with capture-recapture data allows us to determine the contributions of immigration and in situ reproduction to the growth of the population, an issue of importance to ecologists. We illustrate our new models with capture-recapture and genetic assignment data from a population of banner-tailed kangaroo rats Dipodomys spectabilis in Arizona.
Understanding and Supporting the Career Implications of International Assignments
Collings, David G.; Doherty, Noeleen; Luethy, Madeleine; Osborn, Derek
2011-01-01
International assignments represent an important form of migration in the global economy. In contrast to most other migrants, international assignees enjoy a relatively privileged position in the labor market. Authored by a diverse team of academics and practitioners, this paper draws on insights from empirical research and unpublished examples…
48 CFR 1552.211-74 - Work assignments.
2010-10-01
... 48 Federal Acquisition Regulations System 6 2010-10-01 2010-10-01 true Work assignments. 1552.211-74 Section 1552.211-74 Federal Acquisition Regulations System ENVIRONMENTAL PROTECTION AGENCY CLAUSES... not allow for any change to the terms or conditions of the contract. Where any language in the...
An optimal query assignment for wireless sensor networks
Mitici, Mihaela; Onderwater, Martijn; Graaf, de Maurits; Ommeren, van Jan-Kees; Dijk, van Nico; Goseling, Jasper
2012-01-01
With the increased use of large-scale real-time embedded sensor networks, new control mechanisms are needed to avoid congestion and meet required Quality of Service (QoS) levels. In this paper, we propose a Markov Decision Problem (MDP) to prescribe an optimal query assignment strategy that achieves
Concept Maps as Cognitive Visualizations of Writing Assignments
Villalon, Jorge; Calvo, Rafael A.
2011-01-01
Writing assignments are ubiquitous in higher education. Writing develops not only communication skills, but also higher-level cognitive processes that facilitate deep learning. Cognitive visualizations, such as concept maps, can also be used as part of learning activities including as a form of scaffolding, or to trigger reflection by making…
An Improved Approach to Solution of the Faculty Assignment Problem.
Yang, Chin W.
1989-01-01
Examined is the problem of assigning faculty members to teach various courses in an accounting department. Based on selected evaluation information, a zero-one integer programing model was implemented. This approach utilizes readily available data and takes into consideration the learning curve phenomenon, various competing needs, and…
Mental reconstruction:Semantic property assignment of 'along'
Institute of Scientific and Technical Information of China (English)
苏都
2010-01-01
This article is an attempt to discuss the semantic properties of the word 'along'in the context of general syntax. It reveals that the meaning of it covers two parts of speechin the process of mental reconstruction while interacting with adjacent syntactic components.In this process semantic property assignment does concerns some distinct principles,such asforegrounding and the like.
Sources of Information for Stress Assignment in Reading Greek
Protopapas, Athanassios; Gerakaki, Svetlana; Alexandri, Stella
2007-01-01
To assign lexical stress when reading, the Greek reader can potentially rely on lexical information (knowledge of the word), visual-orthographic information (processing of the written diacritic), or a default metrical strategy (penultimate stress pattern). Previous studies with secondary education children have shown strong lexical effects on…
Semiclassical Assignment of the Vibrational Spectrum of N2O
Waalkens, Holger; Jung, Christof; Taylor, Howard S.
2002-01-01
The vibrational spectrum of N2O as given by an effective spectroscopic Hamiltonian based on the existence of a superpolyad number is analyzed and assigned in terms of classical motions. The effective Hamiltonian includes a large number of resonances of which only one is dominant for low and intermed
Consistent assignment of the vibrations of monosubstituted benzenes
Gardner, Adrian M.; Wright, Timothy G.
2011-09-01
We investigate the consistency of the labeling and assignments of the vibrations of the monosubstituted benzenes in the electronic ground state. In doing so, we also identify some inconsistencies in the labeling of the benzene modes. We commence by investigating the behavior of the benzene vibrations as one hydrogen is replaced by an artificial atomic substituent of increasing mass via quantum chemical calculations; the wavenumber variations with mass give insight into the assignments. We also examine how well the monohalobenzene vibrations can be described in terms of the benzene ones: consistent with some recent studies, we conclude that this is futile in a significant number of cases. We then show that "isotopic wavenumbers" obtained by artificially changing the mass of the fluorine atom in fluorobenzene are in very good agreement with the wavenumbers obtained via explicit calculation for the relevant monohalobenzene (chlorobenzene, bromobenzene, and iodobenzene) vibrations. As a consequence, we propose that the vibrations of monofluorobenzene be used as the basis for labelling the vibrational assignments of monosubstituted benzenes. As well as the four monohalobenzenes, we also apply this approach to the vibrations of aniline, toluene, benzonitrile, phenylacetylene, phenylphosphine, and nitrobenzene. This has allowed a much more consistent picture of the vibrational assignments to be obtained across ten monosubstituted benzenes.
Design of multivariable feedback control systems via spectral assignment
Mielke, R. R.; Tung, L. J.; Marefat, M.
1983-01-01
The applicability of spectral assignment techniques to the design of multivariable feedback control systems was investigated. A fractional representation design procedure for unstable plants is presented and illustrated with an example. A computer aided design software package implementing eigenvalue/eigenvector design procedures is described. A design example which illustrates the use of the program is explained.
Challenges and Dilemmas in Implementing Random Assignment in Educational Research
Ong-Dean, Colin; Hofstetter, Carolyn Huie; Strick, Betsy R.
2011-01-01
In the contentious debate over the use of randomized clinical trials (RCTs) in education research, little attention has been given to how methodological issues arise and/or are resolved in the implementation of random assignment. Following a review of the methodological-theoretical literature on RCTs and alternative research designs, this article…
Using Clouds for MapReduce Measurement Assignments
Rabkin, Ariel; Reiss, Charles; Katz, Randy; Patterson, David
2013-01-01
We describe our experiences teaching MapReduce in a large undergraduate lecture course using public cloud services and the standard Hadoop API. Using the standard API, students directly experienced the quality of industrial big-data tools. Using the cloud, every student could carry out scalability benchmarking assignments on realistic hardware,…
48 CFR 552.232-23 - Assignment of Claims.
2010-10-01
... following is substituted therefor: In order to prevent confusion and delay in making payment, the Contractor..., including any Federal lending agency, under the provisions of the Assignment of Claims Act, as amended, 31 U.S.C. 3727, 41 U.S.C. 15 (hereinafter referred to as “the Act”), all amounts due or to become...
Single Assignment C (SAC): High Productivity meets High Performance
C. Grelck
2012-01-01
We present the ins and outs of the purely functional, data parallel programming language SaC (Single Assignment C). SaC defines state- and side-effect-free semantics on top of a syntax resembling that of imperative languages like C/C++/C# or Java: functional programming with curly brackets. In contr
Integrating Video Documentary into the Classroom: A Community Assessment Assignment
Levinson, Samantha G.; Caldwell, Keith; Petracchi, Helen E.; Wexler, Sandra; Engel, Rafael
2016-01-01
Community assessment is a strategy commonly taught to social work students to identify a community's strengths and challenges. This article describes the value of using video documentary as part of a community assessment assignment. We identify the advantages of using video documentary in the assessment process and the reporting of findings. We…
The Utility of Writing Assignments in Undergraduate Bioscience
Libarkin, Julie; Ording, Gabriel
2012-01-01
We tested the hypothesis that engagement in a few, brief writing assignments in a nonmajors science course can improve student ability to convey critical thought about science. A sample of three papers written by students (n = 30) was coded for presence and accuracy of elements related to scientific writing. Scores for different aspects of…
A Storage Assignment Model for Batch Preparation in Process Industries
Ashayeri, J.; Selen, W.
2010-01-01
A new model formulation is developed for reducing the workload in pre-batching at a manufacturer of flavours and fragrances, by optimally assigning ingredients to different storage types, taking into account past usage of ingredients and several restrictions about volumes and number of storage units
A Competitive and Experiential Assignment in Search Engine Optimization Strategy
Clarke, Theresa B.; Clarke, Irvine, III
2014-01-01
Despite an increase in ad spending and demand for employees with expertise in search engine optimization (SEO), methods for teaching this important marketing strategy have received little coverage in the literature. Using Bloom's cognitive goals hierarchy as a framework, this experiential assignment provides a process for educators who may be…
15 CFR 2011.208 - Paperwork Reduction Act assigned number.
2010-01-01
... 15 Commerce and Foreign Trade 3 2010-01-01 2010-01-01 false Paperwork Reduction Act assigned number. 2011.208 Section 2011.208 Commerce and Foreign Trade Regulations Relating to Foreign Trade Agreements OFFICE OF THE UNITED STATES TRADE REPRESENTATIVE ALLOCATION OF TARIFF-RATE QUOTA ON IMPORTED SUGARS, SYRUPS AND MOLASSES Specialty Sugar...
PRECONDITIONS OF ORIGIN, ESSENCE AND ASSIGNMENT OF STRATEGIC MANAGERIAL ACCOUNTING
Boiko, I.
2010-01-01
The article is devoted to the research of preconditions and necessity of creation strategic managerial accounting in the accounting system of enterprise. There are investigated economic essence and assignment of strategic managerial accounting and substantiated its importance for making strategic decisions on an enterprise.
Assignment of circadian function for the Neurospora clock gene frequency
Merrow, Martha; Brunner, Michael; Roenneberg, Till
1999-01-01
Circadian clocks consist of three elements: entrainment pathways (inputs), the mechanism generating the rhythmicity (oscillator), and the output pathways that control the circadian rhythms. It is difficult to assign molecular clock components to any one of these elements. Experiments show that input
Undergraduates Improve upon Published Crystal Structure in Class Assignment
Horowitz, Scott; Koldewey, Philipp; Bardwell, James C.
2014-01-01
Recently, 57 undergraduate students at the University of Michigan were assigned the task of solving a crystal structure, given only the electron density map of a 1.3 Å crystal structure from the electron density server, and the position of the N-terminal amino acid. To test their knowledge of amino acid chemistry, the students were not given the…
Comparison of Categorical Assignments of the BSRI and the PAQ.
Gaa, John P.; Liberman, Dov
The degree of agreement between the Bem Sex Role Inventory (BSRI) and the Personality Attributes Questionnaire (PAQ) in assigning sex role categories was investigated by administering both instruments to undergraduate education majors. As a result of scoring, subjects were classified as androgynous, masculine, feminine, or undifferentiated. It was…
Lin, Yi-Kuei; Yeh, Cheng-Ta
2013-03-01
Many real-life systems, such as computer systems, manufacturing systems and logistics systems, are modelled as stochastic-flow networks (SFNs) to evaluate network reliability. Here, network reliability, defined as the probability that the network successfully transmits d units of data/commodity from an origin to a destination, is a performance indicator of the systems. Network reliability maximization is a particular objective, but is costly for many system supervisors. This article solves the multi-objective problem of reliability maximization and cost minimization by finding the optimal component assignment for SFN, in which a set of multi-state components is ready to be assigned to the network. A two-stage approach integrating Non-dominated Sorting Genetic Algorithm II and simple additive weighting are proposed to solve this problem, where network reliability is evaluated in terms of minimal paths and recursive sum of disjoint products. Several practical examples related to computer networks are utilized to demonstrate the proposed approach.
Directory of Open Access Journals (Sweden)
Shilpa S. Patil
2015-09-01
Full Text Available In wavelength division multiplexed all optical networks; lightpath establishes a connection between sending and receiving nodes bypassing the electronic processing at intermediate nodes. One of the prime objectives of Routing and Wavelength Assignment (RWA problem is to maximize the number of connections efficiently by choosing the best routes. Although there are several algorithms available, improving the blocking performance in optical networks and finding optimal solutions for RWA problem has still remained a challenging issue. Wavelength conversion can be helpful in restricting the problem of wavelength continuity constraint but it increases complexity in the network. In this paper, we propose new weight dependent routing and wavelength assignment strategy for all optical networks without use of wavelength converters. Proposed weight function reduces blocking probability significantly, improving the network performance at various load conditions. Further, due to absence of wavelength converters, the cost and complexity of network reduces. Results show that the proposed strategy performs better than earlier reported methods.
Modified Clipped LMS Algorithm
Directory of Open Access Journals (Sweden)
Lotfizad Mojtaba
2005-01-01
Full Text Available Abstract A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization ( scheme that involves the threshold clipping of the input signals in the filter weight update formula. Mathematical analysis shows the convergence of the filter weights to the optimum Wiener filter weights. Also, it can be proved that the proposed modified clipped LMS (MCLMS algorithm has better tracking than the LMS algorithm. In addition, this algorithm has reduced computational complexity relative to the unmodified one. By using a suitable threshold, it is possible to increase the tracking capability of the MCLMS algorithm compared to the LMS algorithm, but this causes slower convergence. Computer simulations confirm the mathematical analysis presented.
Zhou, Xiaojun; Gui, Weihua
2012-01-01
In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm is proposed. For continuous function optimization problems, four special transformation operators called rotation, translation, expansion and axesion are designed. Adjusting measures of the transformations are mainly studied to keep the balance of exploration and exploitation. Convergence analysis is also discussed about the algorithm based on random search method. In the meanwhile, to strengthen the search ability in high dimensional space, communication strategy is introduced into the basic algorithm and intermittent exchange is presented to prevent premature convergence. Finally, experiments are carried out for the algorithms. With 10 common benchmark unconstrained continuous functions used to test the performance, the results show that state transition algorithms are promising algorithms due to their good global search capability and convergence property when compared with some ...
基于动态交通分配的应急路径规划%Emergency Route Planning Through Dynamic Traffic Assignment
Institute of Scientific and Technical Information of China (English)
马宏亮; 张建平; 李瑞敏
2012-01-01
To improve the efficiency of emergency rescue and evacuation, this paper introduces an emergency route planning algorithm based on dynamic traffic assignment. Different from existing static route planning algorithms, the algorithm takes the dynamic and systematic characteristics of the problem into consideration. First, a dynamic traffic assignment model through traffic simulation is given. Then, the steps of the algorithm are explained. Finally, the algorithm is tested by using Beijing road network data. The results prove the feasibility and effectiveness of the proposed algorithm.%为了提高在应急救援与疏散工作中的应急交通效率,针对已有相关算法未考虑交通问题动态性的不足,提出了1个基于动态交通分配的应急路径规划算法.给出了问题的定义,设计了1个基于仿真的动态交通分配模型,给出了基于动态交通分配的算法求解步骤.通过北京市路网数据对算法进行验证,证明了算法的可行性与有效性.
Jang, Richard
2012-03-21
Background: Chemical shift mapping is an important technique in NMR-based drug screening for identifying the atoms of a target protein that potentially bind to a drug molecule upon the molecule\\'s introduction in increasing concentrations. The goal is to obtain a mapping of peaks with known residue assignment from the reference spectrum of the unbound protein to peaks with unknown assignment in the target spectrum of the bound protein. Although a series of perturbed spectra help to trace a path from reference peaks to target peaks, a one-to-one mapping generally is not possible, especially for large proteins, due to errors, such as noise peaks, missing peaks, missing but then reappearing, overlapped, and new peaks not associated with any peaks in the reference. Due to these difficulties, the mapping is typically done manually or semi-automatically, which is not efficient for high-throughput drug screening.Results: We present PeakWalker, a novel peak walking algorithm for fast-exchange systems that models the errors explicitly and performs many-to-one mapping. On the proteins: hBclXL, UbcH5B, and histone H1, it achieves an average accuracy of over 95% with less than 1.5 residues predicted per target peak. Given these mappings as input, we present PeakAssigner, a novel combined structure-based backbone resonance and NOE assignment algorithm that uses just 15N-NOESY, while avoiding TOCSY experiments and 13C-labeling, to resolve the ambiguities for a one-to-one mapping. On the three proteins, it achieves an average accuracy of 94% or better.Conclusions: Our mathematical programming approach for modeling chemical shift mapping as a graph problem, while modeling the errors directly, is potentially a time- and cost-effective first step for high-throughput drug screening based on limited NMR data and homologous 3D structures. 2012 Jang et al.; licensee BioMed Central Ltd.
Jang, Richard
2011-01-01
Chemical shift mapping is an important technique in NMRbased drug screening for identifying the atoms of a target protein that potentially bind to a drug molecule upon the molecule\\'s introduction in increasing concentrations. The goal is to obtain a mapping of peaks with known residue assignment from the reference spectrum of the unbound protein to peaks with unknown assignment in the target spectrum of the bound protein. Although a series of perturbed spectra help to trace a path from reference peaks to target peaks, a one-to-one mapping generally is not possible, especially for large proteins, due to errors, such as noise peaks, missing peaks, missing but then reappearing, overlapped, and new peaks not associated with any peaks in the reference. Due to these difficulties, the mapping is typically done manually or semi-automatically. However, automated methods are necessary for high-throughput drug screening. We present PeakWalker, a novel peak walking algorithm for fast-exchange systems that models the errors explicitly and performs many-to-one mapping. On the proteins: hBclXL, UbcH5B, and histone H1, it achieves an average accuracy of over 95% with less than 1.5 residues predicted per target peak. Given these mappings as input, we present PeakAssigner, a novel combined structure-based backbone resonance and NOE assignment algorithm that uses just 15N-NOESY, while avoiding TOCSY experiments and 13C- labeling, to resolve the ambiguities for a one-toone mapping. On the three proteins, it achieves an average accuracy of 94% or better. Copyright © 2011 ACM.
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.
Shao, Mingfu; Moret, Bernard M E
2016-05-01
A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when genomes contain duplicate genes. Sankoff proposed the use of exemplars to tackle the problem of duplicate genes and gene families: each gene family is represented by a single gene (the exemplar for that family), chosen so as to optimize some metric. Unfortunately, choosing exemplars is itself an NP-hard problem. In this article, we propose a very fast and exact algorithm to compute the exemplar breakpoint distance, based on new insights in the underlying structure of genome rearrangements and exemplars. We evaluate the performance of our algorithm on simulation data and compare its performance to the best effort to date (a divide-and-conquer approach), showing that our algorithm runs much faster and scales much better. We also devise a new algorithm for the intermediate breakpoint distance problem, which can then be applied to assign orthologs. We compare our algorithm with the state-of-the-art method MSOAR by assigning orthologs among five well annotated mammalian genomes, showing that our algorithm runs much faster and is slightly more accurate than MSOAR. PMID:26953781
Turner, James M.
1995-01-01
Discussion of indexing moving image documents at the shot level focuses on a study conducted at the National Film Board of Canada. Popular terms supplied by users were compared with terms assigned by professional indexers in the source stockshot collection. Results suggest that indexing images using preiconographic (ofness) and iconographic…
Travel Demand-Based Assignment Model for Multimodal and Multiuser Transportation System
Directory of Open Access Journals (Sweden)
Bingfeng Si
2012-01-01
Full Text Available In this paper, the structural characteristic of urban multimodal transport system is fully analyzed and then a two-tier network structure is proposed to describe such a system, in which the first-tier network is used to depict the traveller’s mode choice behaviour and the second-tier network is used to depict the vehicle routing when a certain mode has been selected. Subsequently, the generalized travel cost is formulated considering the properties of both traveller and transport mode. A new link impedance function is proposed, in which the interferences between different vehicle flows are taken into account. Simultaneously, the bi-equilibrium patterns for multimodal transport network are proposed by extending Wardrop principle. Correspondingly, a bi-level programming model is then presented to describe the bi-equilibrium based assignment for multi-class multimodal transport network. The solution algorithm is also given. Finally, a numerical example is provided to illustrate the model and algorithm.
Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.
Sun, Jianyong; Zhang, Qingfu; Yao, Xin
2014-03-01
The construction of promising solutions for NP-hard combinatorial optimization problems (COPs) in meta-heuristics is usually based on three types of information, namely a priori information, a posteriori information learned from visited solutions during the search procedure, and online information collected in the solution construction process. Prior information reflects our domain knowledge about the COPs. Extensive domain knowledge can surely make the search effective, yet it is not always available. Posterior information could guide the meta-heuristics to globally explore promising search areas, but it lacks local guidance capability. On the contrary, online information can capture local structures, and its application can help exploit the search space. In this paper, we studied the effects of using this information on metaheuristic's algorithmic performances for the COPs. The study was illustrated by a set of heuristic algorithms developed for the quadratic assignment problem. We first proposed an improved scheme to extract online local information, then developed a unified framework under which all types of information can be combined readily. Finally, we studied the benefits of the three types of information to meta-heuristics. Conclusions were drawn from the comprehensive study, which can be used as principles to guide the design of effective meta-heuristic in the future. PMID:23757559
Bahiraee, Ehsan; Raissi, Sadigh
2014-07-01
Control charts are extensively used in manufacturing contexts to monitor production processes. This article illustrates economical design of a variable sample size and control limit Hotelling's T 2 control chart based on a novel cost model when occurrence times of the assignable causes are exponentially distributed. The proposed nonlinear cost model is an extension of Duncan's (J Am Stat Assoc 51: 228-242, 1956) model which was employed for univariate cases. Applying genetic algorithm to find optimum parameter values and using an L 33 orthogonal array in sensitivity analysis on the model parameters is investigated through a numerical example to illustrate the effectiveness of the proposed approach.
Adaptive Alternating Minimization Algorithms
Niesen, Urs; Wornell, Gregory
2007-01-01
The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables or equivalently of finding a point in the intersection of two sets. The iterative nature and simplicity of the algorithm has led to its application to many areas such as signal processing, information theory, control, and finance. A general set of sufficient conditions for the convergence and correctness of the algorithm is quite well-known when the underlying problem parameters are fixed. In many practical situations, however, the underlying problem parameters are changing over time, and the use of an adaptive algorithm is more appropriate. In this paper, we study such an adaptive version of the alternating minimization algorithm. As a main result of this paper, we provide a general set of sufficient conditions for the convergence and correctness of the adaptive algorithm. Perhaps surprisingly, these conditions seem to be the minimal ones one would expect in ...
Multi-objective Evolutionary Algorithms for MILP and MINLP in Process Synthesis
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of σshare is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.
Method for assigning sites to projected generic nuclear power plants
Energy Technology Data Exchange (ETDEWEB)
Holter, G.M.; Purcell, W.L.; Shutz, M.E.; Young, J.R.
1986-07-01
Pacific Northwest Laboratory developed a method for forecasting potential locations and startup sequences of nuclear power plants that will be required in the future but have not yet been specifically identified by electric utilities. Use of the method results in numerical ratings for potential nuclear power plant sites located in each of the 10 federal energy regions. The rating for each potential site is obtained from numerical factors assigned to each of 5 primary siting characteristics: (1) cooling water availability, (2) site land area, (3) power transmission land area, (4) proximity to metropolitan areas, and (5) utility plans for the site. The sequence of plant startups in each federal energy region is obtained by use of the numerical ratings and the forecasts of generic nuclear power plant startups obtained from the EIA Middle Case electricity forecast. Sites are assigned to generic plants in chronological order according to startup date.
Confirmed assignments of isomeric dimethylbenzyl radicals generated by corona discharge.
Yoon, Young Wook; Lee, Sang Kuk
2011-12-01
The controversial vibronic assignments of isomeric dimethylbenzyl radicals were clearly resolved by using different precursors. By employing corresponding dimethylbenzyl chlorides as precursors, we identified the origins of the vibronic bands of the dimethylbenzyl radicals generated by corona discharge of 1,2,4-trimethylbenzene. From the analysis of the spectra observed from the dimethylbenzyl chlorides in a corona excited supersonic expansion, we revised previous assignments of the 3,4-, 2,4-, and 2,5-dimethylbenzyl radicals. Spectroscopic data of electronic transition and vibrational mode frequencies in the ground electronic state of each isomer were accurately determined by comparing them with those obtained by an ab initio calculation and with the known vibrational data of 1,2,4-trimethylbenzene. PMID:22149790