It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

On the capacity of a cellular CDMA system

The task of optimizing a complex system presents at least two levels of problems for the system designer. First, a class of optimization algorithms must be chosen that is suitable for application to the system. Second, various parameters of the optimization algorithm need to be tuned for efficiency. A class of adaptive search procedures called genetic algorithms (GA) has been used to optimize a wide variety of complex systems. GA's are applied to the second level task of identifying efficient GA's for a set of numerical optimization problems. The results are validated on an image registration problem. GA's are shown to be effective for both levels of the systems optimization problem.

Optimization of Control Parameters for Genetic Algorithms

A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest Such a point of interest is referred to as a slicing criterion, and is typically specified by a location in the program in combination with a subset of the program’s variables The task of computing program slices is called program slicing The original definition of a program slice was presented by Weiser in 1979 Since then, various slightly different notions of program slices have been proposed, as well as a number of methods to compute them An important distinction is that between a static and a dynamic slice Static slices are computed without making assumptions regarding a program’s input, whereas the computation of dynamic slices relies on a specific test case This survey presents an overview of program slicing, including the various general approaches used to compute slices, as well as the specific techniques used to address a variety of language features such as procedures, unstructured control flow, composite data types and pointers, and concurrency Static and dynamic slicing methods for each of these features are compared and classified in terms of their accuracy and efficiency Moreover, the possibilities for combining solutions for different features are investigated Recent work on the use of compiler-optimization and symbolic execution techniques for obtaining more accurate slices is discussed The paper concludes with an overview of the applications of program slicing, which include debugging, program integration, dataflow testing, and software maintenance

/pdf/a-survey-of-program-slicing-techniques-1u546ok1jr.pdf

A Survey of Program Slicing Techniques.

Natural evolution is a population-based optimization process. Simulating this process on a computer results in stochastic optimization techniques that can often outperform classical methods of optimization when applied to difficult real-world problems. There are currently three main avenues of research in simulated evolution: genetic algorithms, evolution strategies, and evolutionary programming. Each method emphasizes a different facet of natural evolution. Genetic algorithms stress chromosomal operators. Evolution strategies emphasize behavioral changes at the level of the individual. Evolutionary programming stresses behavioral change at the level of the species. The development of each of these procedures over the past 35 years is described. Some recent efforts in these areas are reviewed. >

An introduction to simulated evolutionary optimization

computational bounds for local search in combinatorial local search algorithms for combinatorial problems local search algorithms for solving the combinatorial a dual local search framework for combinatorial the max-min ant system and local search for combinatorial a framework for local combinatorial optimization problems local search in combinatorial optimization mifou local search in combinatorial optimization radarx heuristics and local search paginas.fe.up local search in combinatorial optimization banani local search in combinatorial optimization integrating interval estimates of global optima and local local search in combinatorial optimization holbarto a fuzzy valuation-based local search framework for local search in combinatorial optimization gbv gentle introduction to local search in combinatorial e cient local search for several combinatorial introduction: combinatorial problems and search on application of the local search optimization online local search for combinatorial optimisation problems how to choose solutions for local search in multiobjective a hybrid of inference and local search for distributed on set-based local search for multiobjective combinatorial localsolver: black-box local search for combinatorial on local optima in multiobjective combinatorial sets of interacting scalarization functions in local introduction e r optimization online estimation-based local search for stochastic combinatorial advanced search combinatorial problems sas/or user's guide: local search optimization how easy is local search? univerzita karlova metaheuristic search for combinatorial optimization local search genetic algorithms for the job shop towards a formalization of combinatorial local search dynamic and adaptive neighborhood search in combinatorial global search in combinatorial optimization using a framework for the development of local search heuristics a feasibility-preserving local search operator for hybrid metaheuristics in combinatorial optimization: a survey consultant-guided search algorithms with local search for a new optimization algorithm for combinatorial problems hybrid metaheuristics in combinatorial optimization: a survey network algorithms colorado state university model-based search for combinatorial optimization: a local and global optimization stochastic local search algorithms for multiobjective corso (collaborative reactive search optimization local search in combinatorial optimization zaraa

Local Search in Combinatorial Optimization

Genetic Algorithms for the Traveling Salesman Problem

A system with automatic control of local generation, consumption, storage, buying, and selling of electrical energy is provided. This automation can be governed by optimization criteria and policies established by the administrative entity responsible for the domain benefiting from this invention. The control method, using a data processing computer, implements the optimization criteria and provides near real time directives for the system. The control program estimates energy generation and consumption, monitors voltage and power levels, configures the power circuit and adjusts device specific controls over a network. Depending on a specific situation, the control program can continue to store extra energy, sell energy for a financial gain, maximize sustainable generation to meet social obligations, or increase consumption for extra comfort. This control program optimizes on multiple time granularities under a variable pricing scheme and environmental conditions, with related information including weather forecasts accessed over the Internet.

System and method for policy based control of local electrical energy generation and use

Approaches are provided for an SDSN that employs a satellite network nodes, where central L2 network nodes are controlled via a centralized Controller. Link status information is obtained regarding links of each L2 node. Global routing constraints, satellite ephemeris data, and resource allocation information are obtained. A constellation topology of the network nodes is determined based on the ephemeris data. Network routes between pairs of endpoints are determined. Each route includes links based on the link status information regarding the links, the global routing constraints, the bandwidth resources of the links and the current allocation of bandwidth resources, and/or the constellation topology. A forwarding table is generated for each network node, wherein each forwarding table includes route entries providing a next hop indicating a destination for data packets, wherein the destination is associated with a link of the respective network node that represents a link of a respective route.

Centralized ground-based route determination and traffic engineering for software defined satellite communications networks

A system is provided for reducing latency data collection from space-based sensor satellites. A mobile vehicle platform includes a sensor module configured to monitor certain conditions, circumstances, environments and situations occurring on or around, or associated with, the Earth, and to generate sensor data resulting from the monitoring. A relay satellite terminal is configured to execute data communications via a communications channel of a first satellite beam, wherein the data communications are configured to relay the sensor data, via satellites, to respective gateways for forwarding to a central processing facility for one or more of aggregation, processing, analysis and dissemination of the data. The relay satellite terminal is further configured to switch the data communications from the communications channel of the first satellite beam to a communications channel of a second satellite beam based on a position of the relay satellite terminal relative to the first and second satellite beams.

System and architecture for space-based and mobile terrestrial sensor vehicles, and end-to-end network for aggregation and processing of sensor data

5G systems have started field trials, and deployment plans are being formulated, following completion of comprehensive standardization efforts and the introduction of multiple technological innovations for improving data rates and latency. Similar to earlier terrestrial wireless technologies, build-out of 5G systems will occur initially in higher population density areas offering the best business cases while not fully addressing airborne and marine applications. Satellite communications will thus continue to be indispensable as part of an integrated 5G/satellite architecture to achieve truly universal coverage. Such a unified architecture across terrestrial and satellite wireless technologies can ensure global service, support innovative 5G use cases, and reduce both capital investments and operational costs through efficiencies in network infrastructure deployment and spectrum utilization. This article presents an architectural framework based on a layered approach comprising network, data link, and physical layers together with a multimode user terminal. The network layer uses off-the-shelf building blocks based on 4G and 5G industry standards. The data link layer benefits from dynamic sharing of resources across multiple systems, enabled by intersystem knowledge of estimated and actual traffic demands, RF situational awareness, and resource availability. Communication resource sharing has traditionally comprised time, frequency, and power dimensions. Sharing can be enhanced by leveraging dynamic knowledge of communication platform location, trajectory, and antenna directivity. Logically centralized resource management provides a scalable approach for better utilization of spectrum, especially in higher bands that have traditionally been used by satellites and now are also being proposed for 5G systems. Resource sharing maximizes the utility of a multimode terminal that can access satellite or terrestrial RF links based on specific use cases, traffic demand, and QoS requirements.

Rajeev Gopal

Papers

Genetic Algorithms for the Traveling Salesman Problem

System and method for policy based control of local electrical energy generation and use

Centralized ground-based route determination and traffic engineering for software defined satellite communications networks

System and architecture for space-based and mobile terrestrial sensor vehicles, and end-to-end network for aggregation and processing of sensor data

Framework for Unifying 5G and Next Generation Satellite Communications