ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (71)
  • Other Sources
  • optimization  (71)
  • Springer  (71)
  • American Geophysical Union
  • American Institute of Physics (AIP)
  • American Physical Society
  • Blackwell Publishing Ltd
  • Elsevier
  • 2000-2004  (21)
  • 1995-1999  (50)
  • 1955-1959
  • 1945-1949
  • Computer Science  (36)
  • Economics  (16)
  • Physics  (9)
  • Architecture, Civil Engineering, Surveying  (7)
  • Geosciences  (4)
  • Natural Sciences in General
Collection
  • Articles  (71)
  • Other Sources
Publisher
  • Springer  (71)
  • American Geophysical Union
  • American Institute of Physics (AIP)
  • American Physical Society
  • Blackwell Publishing Ltd
  • +
Years
Year
  • 1
    ISSN: 1436-6304
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; Latin hypercube ; optimization ; sampling ; sensitivity analysis ; Stichprobenverfahren ; Permutationsmatrizen ; implizite Funktionen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Lateinische Hyperwürfel Stichprobenverfahren (LHS) dienen dazu, in geeigneter Weise die Verteilungsfunktion (zumindest angenähert) der Funktionswerte einer komplexen (impliziten) Funktion, in Abhängigkeit ihrer Variablen werte, zu schätzen. Anwendungen finden sich in Modellen, in denen erforderliche Variablenumformungen nicht möglich sind und in denen die Zahl der Simulationsläufe aus zeitlichen Gründen gering zu halten oder fixiert ist. Es stellt sich die Frage, welche Werte in jedem Lauf den Variablen zuzuordnen sind. Herkömmliche Vorgehensweisen benutzen ausgefeilte, geschichtete Stichprobenverfahren, die jedoch Fehler bei der Bestimmung von Varianz und Kovarianz, aufgrund der Korrelation der Stichprobenpaare, beinhalten können. In dieser Arbeit wird eine Methode beschrieben, den absoluten Fehler zwischen dem tatsächlichen und dem korrelierenden Stichprobenpaar so klein wie möglich zu halten. Selbst für kleine Stichprobenumfänge können dabei schon optimale Pläne erzielt werden. Permutationsmatrizen haben die Eigenschaft, die Summe der Korrelationen zwischen Spaltenpaaren zu minimieren. Die vorgestellte Heuristik ist in der Lage, in allen getesteten Fällen das Optimum zu finden.
    Notes: Abstract The objective of Latin Hypercube Sampling is to determine an effective procedure for sampling from a (possibly correlated) multivariate population to estimate the distribution function (or at least a significant number of moments) of a complicated function of its variables. The typical application involves a computer-based model in which it is largely impossible to find a way (closed form or numerical) to do the necessary transformation of variables and where it is expensive to run in terms of computing resources and time. Classical approaches to hypercube sampling have used sophisticated stratified sampling techniques; but such sampling may provide incorrect measures of the output parameters' variances or covariances due to correlation between the sampling pairs. In this work, we offer a strategy which provides a sampling specification minimizing the sum of the absolute values of the pairwise differences between the true and sampled correlation pairs. We show that optimal plans can be obtained for even small sample sizes. We consider the characteristics of permutation matrices which minimize the sum of correlations between column pairs and then present an effective heuristic for solution. This heuristic generally finds plans which match the correlation structure exactly. When it does not, we provide a hybrid lagrangian/heuristic method, which empirically has found the optimal solution for all cases tested.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Fire technology 32 (1996), S. 291-296 
    ISSN: 1572-8099
    Keywords: Building codes ; building economics ; economic analysis ; fire safety ; health care facilities ; hospitals ; life safety codes ; linear programming ; mathematical programming ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying
    Notes: Abstract ALARM is personal computer software that helps building managers and fire safety engineers achieve cost-effective compliance with the widely used NFPA 101,Life Safety Code ®. The software currently supports health-care occupancy analysis. Through the equivalency provision of the code,ALARM implements a goal-oriented, or performance-based, approach to code compliance. The software generates a set of alternative code compliance strategies and their estimated construction costs. Engineering judgment is then applied to select the most appropriate code compliance strategy based on both cost and design considerations. The software offers a code-compliance optimizer, a comprehensive file manager, and a full-screen data editor. Since 1981, the optimization method used inALARM has been field-tested in 89 hospitals (17,898 beds). For this sample, the least-cost solution identified by the software was, on average, 41 percent less expensive than the prescriptive solution. This represents a potential cost savings of $2,116 per bed or more than $37 million. Future versions ofALARM could address other building occupancies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Design automation for embedded systems 3 (1998), S. 59-73 
    ISSN: 1572-8080
    Keywords: Code generation ; optimization ; digital signal processors
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventional code generation methods typically result in inefficient code. In this paper we formulate and solve some optimization problems that arise in code generation for processors with irregular datapaths. In addition to instruction scheduling and register allocation, we also formulate the accumulator spilling and mode selection problems that arise in DSP microprocessors. We present optimal and heuristic algorithms that determine an instruction schedule simultaneously optimizing accumulator spilling and mode selection. Experimental results are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 21 (1995), S. 337-389 
    ISSN: 1572-9443
    Keywords: Queueing networks ; loss networks ; multiarmed bandits ; bounds ; policies ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We survey a new approach that the author and his co-workers have developed to formulate stochastic control problems (predominantly queueing systems) asmathematical programming problems. The central idea is to characterize the region of achievable performance in a stochastic control problem, i.e., find linear or nonlinear constraints on the performance vectors that all policies satisfy. We present linear and nonlinear relaxations of the performance space for the following problems: Indexable systems (multiclass single station queues and multiarmed bandit problems), restless bandit problems, polling systems, multiclass queueing and loss networks. These relaxations lead to bounds on the performance of an optimal policy. Using information from the relaxations we construct heuristic nearly optimal policies. The theme in the paper is the thesis that better formulations lead to deeper understanding and better solution methods. Overall the proposed approach for stochastic control problems parallels efforts of the mathematical programming community in the last twenty years to develop sharper formulations (polyhedral combinatorics and more recently nonlinear relaxations) and leads to new insights ranging from a complete characterization and new algorithms for indexable systems to tight lower bounds and nearly optimal algorithms for restless bandit problems, polling systems, multiclass queueing and loss networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 379-402 
    ISSN: 1572-9338
    Keywords: Optimal control ; stochastic control ; dynamic systems ; economics ; public-sector applications ; optimization ; budgetary policies ; monetary policy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we determine optimal budgetary and monetary policies for Austria using a small macroeconometric model. We use a Keynesian model of the Austrian economy, called FINPOL1, estimated by ordinary least squares, which relates the main objective variables of Austrian economic policies, such as the growth rate of real gross domestic product, the rate of unemployment, the rate of inflation, the balance of payments, and the ratio of the federal budget deficit to GDP, to fiscal and monetary policy instruments, namely expenditures and revenues of the federal budget and money supply. Optimal fiscal and monetary policies are calculated for the model under a quadratic objective function using the algorithm OPTCON for the optimum control of nonlinear stochastic dynamic systems. Several control experiments are performed in order to assess the influence of different kinds of uncertainty on optimal budgetary and monetary policies. Apart from deterministic optimization runs, different assumptions about parameter uncertainties are introduced; the results of these different stochastic optimum control experiments are compared and interpreted.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 56 (1995), S. 287-311 
    ISSN: 1572-9338
    Keywords: Probability functions ; gradient of integral ; sensitivity analysis ; optimization ; discrete event dynamic systems ; shut-down problem ; probabilistic risk analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Probability functions depending upon parameters are represented as integrals over sets given by inequalities. New derivative formulas for the intergrals over a volume are considered. Derivatives are presented as sums of integrals over a volume and over a surface. Two examples are discussed: probability functions with linear constraints (random right-hand sides), and a dynamical shut-down problem with sensors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Constraints 4 (1999), S. 79-89 
    ISSN: 1572-9354
    Keywords: benchmarks ; radio link frequency assignment ; constraint satisfaction ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French “Centre d'Electronique de l'Armement”) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1572-9354
    Keywords: overconstrained problems ; constraint satisfaction ; optimization ; soft constraint ; dynamic programming ; branch and bound ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we describe and compare two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. While comparing the two approaches, we show how to pass from one to the other one, and we discuss when this is possible. The two frameworks have been independently introduced in ijcai95,jacm and schiex-ijcai95.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 30 (1998), S. 273-287 
    ISSN: 1572-9443
    Keywords: single server queue ; controlled service rate ; batch Markovian arrival process ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper deals with the problem of the optimal service rate control in the system with BMAP (Batch Markovian Arrival Process) arrival stream. An algorithm for the computation of the embedded stationary queue length distribution is developed. The procedure for the cost criteria calculation is elaborated for any fixed parameters of the multithreshold control policy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Celestial mechanics and dynamical astronomy 63 (1995), S. 255-269 
    ISSN: 1572-9478
    Keywords: Solar sail ; orbit-rotation coupling ; passive radiative orientation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract A complete treatment of the general motion of rotation and translation of a solar-sail spacecraft is proposed for the non-flat sail of complex shape. The planar heliocentric roto-translatory motion is considered, orbit-rotational coupling in the problem of altitude and orbital sail motion is investigated for the two-folding sail formed by two unequal reflective rectangular plates oriented at a right angle. The problem of orbit-rotational coupling is essentially a planar one: both sail plates are orthogonal to the orbital plane. The possibility of the non-controlled interplanetary transfer with such two-folding sail at its passive radiational orientation is established analytically from point of view of orbit-rotational coupling. Optimal geometric proportions of this sail are found at minimum-time interplanetary transfers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 57 (1995), S. 217-232 
    ISSN: 1572-9338
    Keywords: Scheduling ; robotic cell ; tandem machines ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operationsn, an optimalO(n logn)-time algorithm is proposed together with the proof of optimality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 243-260 
    ISSN: 1572-9338
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; latin hypercube ; optimization ; sampling ; sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Latin hypercube sampling is often used to estimate the distribution function of a complicated function of many random variables. In so doing, it is typically necessary to choose a permutation matrix which minimizes the correlation among the cells in the hypercube layout. This problem can be formulated as a generalized, multi-dimensional assignment problem. For the two-dimensional case, we provide a polynomial algorithm. For higher dimensions, we offer effective heuristic and bounding procedures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Constraints 4 (1999), S. 101-112 
    ISSN: 1572-9354
    Keywords: sensitivity analysis ; duality ; optimization ; inference
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The constraint programming community has recently begun to address certain types of optimization problems. These problems tend to be discrete or to have discrete elements. Although sensitivity analysis is well developed for continuous problems, progress in this area for discrete problems has been limited. This paper proposes a general approach to sensitivity analysis that applies to both continuous and discrete problems. In the continuous case, particularly in linear programming, sensitivity analysis can be obtained by solving a dual problem. One way to broaden this result is to generalize the classical idea of a dual to that of an “inference dual,” which can be defined for any optimization problem. To solve the inference dual is to obtain a proof of the optimal value of the problem. Sensitivity analysis can be interpreted as an analysis of the role of each constraint in this proof. This paper shows that traditional sensitivity analysis for linear programming is a special case of this approach. It also illustrates how the approach can work out in a discrete problem by applying it to 0-1 linear programming (linear pseudo-boolean optimization).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 20 (1995), S. 207-254 
    ISSN: 1572-9443
    Keywords: Scheduling ; random polling ; optimization ; perturbation analysis ; Golden Ratio policy ; radio network
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We address the problem of schedulingM customer classes in a single-server system, with customers arriving in one ofN arrival streams, as it arises in scheduling transmissions in packet radio networks. In general,N≠M and a customer from some stream may join one of several classes. We consider a slotted time model where at each scheduling epoch the server (channel) is assigned to a particular class (transmission set) and can serve multiple customers (packets) simultaneously, one from every arrival stream (network node) that can belong to this class. The assignment is based on arandom polling policy: the current time slot is allocated to theith class with probability θi. Our objective is to determine the optimal probabilities by adjusting them on line so as to optimize some overall performance measure. We present an approach based on perturbation analysis techniques, where all customer arrival processes can be arbitrary, and no information about them is required. The basis of this approach is the development of two sensitivity estimators leading to amarked slot and aphantom slot algorithm. The algorithms determine the effect of removing/ adding service slots to an existing schedule on the mean customer waiting times by directly observing the system. The optimal slot assignment probabilities are then used to design adeterministic scheduling policy based on the Golden Ratio policy. Finally, several numerical results based on a simple optimization algorithm are included.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Computational complexity 5 (1995), S. 155-166 
    ISSN: 1420-8954
    Keywords: Complexity classes ; nondeterministic logspace ; optimization ; iterated multiplication ; 68Q15 ; 68Q25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We show that computing iterated multiplication of word matrices over {0,1}*, using the operations maximum and concatenation, is complete for the class optL of logspace optimization functions. The same problem for word matrices over {1}* is complete for the class FNL of nondeterministic logspace functions. Improving previously obtained results, we furthermore place the class optL in AC1, and characterize FNL by restricted logspace optimization functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Marketing letters 8 (1997), S. 167-181 
    ISSN: 1573-059X
    Keywords: price and promotion ; economics models ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract Does it matter if managers use an absolute amount or the relativepercentage discount when determining the optimal price and promotionalstrategy for a good? Intuitively, one might expect that the results ofboth models (deal amount and deal percentage) would be identical. Thisresearch shows that the deal-percentage model dominates the deal-amountmodel on three dimensions: (1) consumers pay more when an amount modelis used, (2) the seller has lower profits and different promotionalstrategies when an amount model is used, and (3) consumer behavior isunrealistically constrained by the amount model. This research showsthat whenever the seller offers a promotion in the deal-amount model,the net price paid by the consumer (regular price minus the deal) isalways higher than the net price in the deal-discount model. Thisresult implies that the ultimate price and promotional strategy (suchas depth of promotion, timing of promotions, and so on) prescribed bythe models are different. Additionally, this research shows that whenconsumers respond similarly in the models, the seller's profits arehigher in the deal-percentage model. This finding is a direct result ofthe higher net price in the deal-amount model. Finally, contrary toempirical findings in the marketing literature, the deal-amount modelrequires consumers to respond more strongly to price changes than topromotions (that is, the promotional elasticity plus one must be lessthan the magnitude of the price elasticity) for the optimal price to bepositive. The deal-percentage model does not place similar restrictionson consumer behavior.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 19 (1997), S. 39-54 
    ISSN: 1573-0409
    Keywords: extended Jacobian method ; Lagrange multiplier method ; kinematically redundant manipulators ; numerical efficiency ; optimization ; robotics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Several methods have been proposed in the past for resolving the control of kinematically redundant manipulators by optimizing a secondary criterion. The extended Jacobian method constrains the gradient of this criterion to be in the null space of the Jacobian matrix, while the Lagrange multiplier method represents the gradient as being in the row space. In this paper, a numerically efficient form of the Lagrange multiplier method is presented and is compared analytically, computationally, and operationally to the extended Jacobian method. This paper also presents an improved method for tracking algorithmic singularities over previous work.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 19 (1997), S. 89-103 
    ISSN: 1573-0409
    Keywords: kinematics ; manipulator ; optimization ; performance criteria ; redundancy ; robot
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract A method to simultaneously optimize multiple performance criteria for a redundant manipulator is presented. Preferred formulation requirements for the criteria are discussed, and previously proposed normalization methods are examined. A statistically based variable weighting technique is developed and evaluated. A seven-degree-of-freedom Robotics Research Corporation manipulator is used as a test bed for the multiple criteria optimization scheme.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 24 (1999), S. 43-68 
    ISSN: 1573-0409
    Keywords: learning robots ; system organization ; optimization ; physical equation ; look-ut table ; neural networks ; fuzzy controllers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This paper explores a stepwise learning approach based on a system's decomposition into functional subsystems. Two case studies are examined: a visually guided robot that learns to track a maneuvering object, and a robot that learns to use the information from a force sensor in order to put a peg into a hole. These two applications show the features and advantages of the proposed approach: i) the subsystems naturally arise as functional components of the hardware and software; ii) these subsystems are building blocks of the robot behavior and can be combined in several ways for performing various tasks; iii) this decomposition makes it easier to check the performances and detect the cause of a malfunction; iv) only those subsystems for which a satisfactory solution is not available need to be learned; v) the strategy proposed for coordinating the optimization of all subsystems ensures an improvement at the task-level; vi) the overall system's behavior is significantly improved by the stepwise learning approach.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 19 (1997), S. 105-117 
    ISSN: 1573-0409
    Keywords: optimization ; Pontryagin’s maximum principle ; redundant manipulators ; state-space augmentation ; trajectory planning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The off-line global trajectory planning for kinematically redundant manipulators is formulated as an optimization problem whose solution is obtained by applying the Pontryagin’s Maximum Principle. The state space augmentation method is developed to obtain a set of optimal joint trajectories corresponding to a singularity-free Cartesian path which avoids joint limits and conserves joint configuration in cyclic motion. Results of computer simulation conducted on a three-degree-of-freedom planar manipulator are presented and discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 24 (1999), S. 125-149 
    ISSN: 1573-0409
    Keywords: planning ; control ; multi-fingered robot hand ; optimization ; internal force ; simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, the problem of controlling multi-fingered robot hands with rolling and sliding contacts is addressed. Several issues are explored. These issues involve the kinematic analysis and modeling, the dynamic analysis and control, and the coordination of a multi-fingered robot hand system. Based on a hand-object system in which the contacts are allowed to both roll and slide, a kinematic model is derived and analyzed. Also, the dynamic model of the hand-object system with relative motion contacts is studied. A control law is proposed to guarantee the asymptotic tracking of the object trajectory together with the desired rolling and/or sliding motions along the surface of the object. A planning approach is then introduced to minimize the contact forces so that the desired motion of the object and the relative motions between the fingers and the object can be achieved. Simulation results which support the theoretical development are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Optical review 2 (1995), S. 463-470 
    ISSN: 1349-9432
    Keywords: lens design ; optimization ; global optimization ; damped least squares method ; damping factor ; aberration ; merit function ; escape function
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract The technique of using the ‘escape function’ for global optimization in lens design is described. This includes how to identify two solutions as independent; the threshold value for this criterion can be chosen to determine how to explore local solutions—rough or fine. Choice of appropriate values for two parameters in the escape function is most important, since this will affect the efficiency of the automatic global optimization process. There are two problems, i.e. giving default values at the beginning of the design, and determining a default rule to change them when the escape is unsuccessful. The latter was solved by assuming a ‘saddle path’ as the best route to escape. An exact solution for the former was not found, but a hint for finding a second best solution is shown based on the statistical study of local minima.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Optical review 2 (1995), S. 47-51 
    ISSN: 1349-9432
    Keywords: lens design ; optimization ; global optimization ; damped least squares method ; damping factor ; aberration ; merit function
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract In designing lenses with the damped least squares method, the solution obtained by optimization routine is a local minimum of the merit function. To get out of this and seek a different solution, we propose to use an ‘escape function’ as an additional operand of the lens system, to be controlled. Experiments were made on simple models of merit function and the advantage of this technique was ascertained. We also planted this algorithm into OSLO SIX (lens design software by Sinclair Optics) by means of CCL (C-compatible language) and applied it to actual lens design. Experiments convinced us that the method would be an effective tool for global optimization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Soft computing 4 (2000), S. 76-80 
    ISSN: 1433-7479
    Keywords: Key words Genetic algorithms ; optimization ; numerical methods ; search methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract  In Genetic Algorithms mutation probability is usually assigned a constant value, therefore all chromosome have the same likelihood of mutation irrespective of their fitness. It is shown in this paper that making mutation a function of fitness produces a more efficient search. This function is such that the least significant bits are more likely to be mutated in high-fitness chromosomes, thus improving their accuracy, whereas low-fitness chromosomes have an increased probability of mutation, enhancing their role in the search. In this way, the chance of disrupting a high-fitness chromosome is decreased and the exploratory role of low-fitness chromosomes is best exploited. The implications of this new mutation scheme are assessed with the aid of numerical examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Environmental and resource economics 9 (1997), S. 199-224 
    ISSN: 1573-1502
    Keywords: environmental policy ; pulp and paper ; life cycle ; optimization ; technology lock-in ; recycling ; geography of production ; environment-trade conflict
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Economics
    Notes: Abstract In this paper, we propose a methodology, based on materials accounting and operational research techniques, to assess different industry configurations according to their life cycle environmental impacts. Rather than evaluating a specific technology, our methodology searches for the feasible configuration with the minimum impact. This approach allows us to address some basic policy-relevant questions regarding technology choice, investment priorities, industrial structures, and international trade patterns. We demonstrate the methodology in the context of the European pulp and paper industry. We are able to show that current environmental policy's focus on maximizing recycling is optimal now, but that modest improvements in primary pulping technology may shift the optimal industry configuration away from recycling toward more primary pulping with incineration. We show that this will have significant implications for the amount and type of environmental damage, for the location of different stages in the production chain, and for trade between European member states. We caution policy makers that their single-minded focus on recycling may foreclose investment in technologies that could prove environmentally superior. Finally, we hint that member state governments may be fashioning their environmental policy positions at least in part on some of the trade and industrial implications we find.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Environmental and resource economics 9 (1997), S. 409-427 
    ISSN: 1573-1502
    Keywords: structural diversity ; optimization ; resource management
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Economics
    Notes: Abstract This paper introduces a computationally convenient measure of structural diversity based on absolute deviations between relative shares of individual groups forming a community. A conceptual framework is developed, some theoretical properties of the measure are derived, and its close relation to the Shannon index, a widely used diversity measure, is explored. The paper also presents an empirical application involving this measure where optimum harvesting strategies are determined under diversity constraints, and investigates the trade off between economic and environmental objectives for a mixed forest in Indonesia.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Acta mechanica Sinica 12 (1996), S. 104-116 
    ISSN: 1614-3116
    Keywords: partial differential equation ; flow database ; optimization ; dynamical system
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Notes: Abstract A new theory on the construction of optimal truncated Low-Dimensional Dynamical Systems (LDDSs) with different physical meanings has been developed. The physical properties of the optimal bases are reflected in the user-defined optimal conditions. Through the analysis of linear and nonlinear examples, it is shown that the LDDSs constructed by using the Proper Orthogonal Decomposition (POD) method are not the optimum. After comparing the errors of LDDSs based on the new theory, POD and Fourier methods, it is concluded that the LDDSs based on the new theory are optimally truncated and catch the desired physical properties of the systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Computational economics 13 (1999), S. 103-115 
    ISSN: 1572-9974
    Keywords: optimization ; econometric functions ; nonlinear programming ; evolutionary programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Economics
    Notes: Abstract In the present paper we apply a new Genetic Hybrid Algorithm (GHA) to globally minimize a representative set of ill-conditioned econometric/mathematical functions. The genetic algorithm was specifically designed for nonconvex mixed integer nonlinear programming problems and it can be successfully applied to both global and constrained optimization. In previous studies, we have demonstrated the efficiency of the GHA in solving complicated NLP, INLP and MINLP problems. The present study is a continuation of this research, now focusing on a set of highly irregular optimization problems. In this paper we discuss the genetic hybrid algorithm, the nonlinear problems to be solved and present the results of the empirical tests.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Journal of bioeconomics 1 (1999), S. 205-217 
    ISSN: 1573-6989
    Keywords: economics ; fisheries ; optimization ; stochastic simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Economics
    Notes: Abstract Consider an offshore fishing grounds of size K. Suppose the grounds has been overfished to the point that net revenue has been driven to zero and the fishery is in open access equilibrium at (X∞, Y∞). A marine sanctuary, where fishing is prohibited, is then created. Suppose the marine sanctuary is of size K2 and that fishing is allowed on a smaller grounds, now of size K1, where K1 + K2 = K. In the first, deterministic, model, the present value of net revenue from the grounds-sanctuary system is maximized subject to migration (diffusion) of fish from the sanctuary to the grounds. The size of the sanctuary is varied, the system is re-optimized, and the populations levels, harvest, and value of the fishery is compared to the 'no-sanctuary' optimum, and the open access equilibrium. In the deterministic model, a marine sanctuary reduces the present value of the fishery relative to the 'ideal' of optimal management of the original grounds. In the second model net growth is subject to stochastic fluctuation. Simulation demonstrates the ability of a marine sanctuary to reduce the variation in biomass on the fishing grounds. Variance reduction in fishable biomass is examined for different-sized sanctuaries when net growth on the grounds and in the sanctuary fluctuate independently and when they are perfectly correlated. For the stochastic model of this paper, sanctuaries ranging in size from 60 to 40% of the original grounds (0.6 ≥ K2/K ≥ 0.4) had the ability to lower variation in fishable biomass compared to the no sanctuary case. For a sanctuary equal to or greater than 70% of the original grounds (K2 ≥ 0.7K), net revenue would be nonpositive and there would be no incentive to fish.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Journal of bioeconomics 2 (2000), S. 203-220 
    ISSN: 1573-6989
    Keywords: productivity ; efficiency ; hysteresis ; path dependency ; rationality ; market selection ; natural selection ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Economics
    Notes: Abstract The paper investigates whether evolutionary selection, in nature or the market, ensures the survival of rational agents. It argues that once rationality appears, evolutionary selection can account for its diffusion—but cannot account for its appearance in the first place. This issue differs from the investigation of whether history matters. The issue of history or path-dependency focuses on whether evolutionary selection can favor the survival of the potentially most productive apparatus (in the biological or technological sense). To show this, the paper commences with the much-neglected difference between efficiency and productivity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 12 (1996), S. 321-346 
    ISSN: 1572-9265
    Keywords: Capillarity ; numerical approximation ; optimization ; 65Dxx ; 65Gxx ; 65K10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We propose an algorithm to compute an approximation of capillary surfaces in a gravitational field. This algorithm is based on a decomposition-coordination method by augmented lagrangians and the discretization is done using the finite element method. We study the convergence of the algorithm and the error of discretization for the axisymmetric case; some numerical results are given. This method can be generalized to a two-dimensional space.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Journal of systems integration 10 (2000), S. 23-39 
    ISSN: 1573-8787
    Keywords: computer-integrated design ; mechanical design ; engineering methodology ; CAD ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper a methodologyto improve the development of mechanical components during thefirst design phase is proposed. This phase is one of the mostimportant ones in order to build up a product meeting with consumers'approval. The approach is based on a preliminary geometric-structuralmodeling optimization of the component studied. This optimizationis of a multiobjective kind and it aims to obtain some meaningfulgoals to find feasible shapes of the component to design. Themaximization/minimization of the objective functions is performedby an evolutionary algorithm to accomplish a constrained optimizationusing discrete variables. The characteristics of the methodologyare pointed out in relation to the properties of the evolutionaryalgorithm implemented. The paper concludes with an applicationexample of the procedure. The case study is a car gearbox. Threeobjectives are simultaneously pursued: the lowest weight, thegreatest flexural and torsional stiffnesses.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    ISSN: 1573-8868
    Keywords: simulation ; nonlinear conditioning ; optimization ; FFT ; local perturbation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract A fast Fourier transform (FFT) moving average (FFT-MA) method for generating Gaussian stochastic processes is derived. Using discrete Fourier transforms makes the calculations easy and fast so that large random fields can be produced. On the other hand, the basic moving average frame allows us to uncouple the random numbers from the structural parameters (mean, variance, correlation length, ... ), but also to draw the randomness components in spatial domain. Such features impart great flexibility to the FFT-MA generator. For instance, changing only the random numbers gives distinct realizations all having the same covariance function. Similarly, several realizations can be built from the same random number set, but from different structural parameters. Integrating the FFT-MA generator into an optimization procedure provides a tool theoretically capable to determine the random numbers identifying the Gaussian field as well as the structural parameters from dynamic data. Moreover, all or only some of the random numbers can be perturbed so that realizations produced using the FFT-MA generator can be locally updated through an optimization process.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Journal of scientific computing 13 (1998), S. 303-321 
    ISSN: 1573-7691
    Keywords: Infiltration processes ; optimization ; partial differential equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A variety of infiltration techniques can be used to fabricate solid materials, particularly composites. In general these processes can be described with at least one time dependent partial differential equation describing the evolution of the solid phase, coupled to one or more partial differential equations describing mass transport through a porous structure. This paper presents a detailed mathematical analysis of a relatively simple set of equations which is used to describe chemical vapor infiltration. The results demonstrate that the process is controlled by only two parameters, α and β. The optimization problem associated with minimizing the infiltration time is also considered. Allowing α and β to vary with time leads to significant reductions in the infiltration time, compared with the conventional case where α and β are treated as constants.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 12 (2000), S. 115-128 
    ISSN: 1573-773X
    Keywords: evolutionary algorithms ; generalization ; learning ; neural networks ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper proposes a new version of a method (G-Prop, genetic backpropagation) that attempts to solve the problem of finding appropriate initial weights and learning parameters for a single hidden layer Multilayer Perceptron (MLP) by combining an evolutionary algorithm (EA) and backpropagation (BP). The EA selects the MLP initial weights, the learning rate and changes the number of neurons in the hidden layer through the application of specific genetic operators, one of which is BP training. The EA works on the initial weights and structure of the MLP, which is then trained using QuickProp; thus G-Prop combines the advantages of the global search performed by the EA over the MLP parameter space and the local search of the BP algorithm. The application of the G-Prop algorithm to several real-world and benchmark problems shows that MLPs evolved using G-Prop are smaller and achieve a higher level of generalization than other perceptron training algorithms, such as QuickPropagation or RPROP, and other evolutive algorithms. It also shows some improvement over previous versions of the algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 3 (1996), S. 139-149 
    ISSN: 1573-773X
    Keywords: Steiner tree ; neural networks ; Hopfield model ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 11 (1997), S. 193-225 
    ISSN: 1573-7462
    Keywords: lazy learning ; model selection ; cross validation ; optimization ; attribute selection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Given a set of models and some training data, we would like to find the model that best describes the data. Finding the model with the lowest generalization error is a computationally expensive process, especially if the number of testing points is high or if the number of models is large. Optimization techniques such as hill climbing or genetic algorithms are helpful but can end up with a model that is arbitrarily worse than the best one or cannot be used because there is no distance metric on the space of discrete models. In this paper we develop a technique called “racing” that tests the set of models in parallel, quickly discards those models that are clearly inferior and concentrates the computational effort on differentiating among the better models. Racing is especially suitable for selecting among lazy learners since training requires negligible expense, and incremental testing using leave-one-out cross validation is efficient. We use racing to select among various lazy learning algorithms and to find relevant features in applications ranging from robot juggling to lesion detection in MRI scans.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Journal of network and systems management 4 (1996), S. 133-153 
    ISSN: 1573-7705
    Keywords: High-speed network management ; ATM network management ; multipoint virtual paths design ; optimization ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Multicast routing over semi-permanent VP (virtual path)s in an ATM (asynchronous transfer mode)-based B-ISDN (broadband integrated services digital network) determines a set of VPs connecting from a source node to destination nodes. The problem of finding the optimal constrained multicasting tree over the semi-permanent VPs in an ATM network is known to be NP (nondeterministic polynomial time)-complete. We develop an optimization methodology for searching a constrained multicast routing tree with minimum cost, using simulated annealing technique. We define the problem-dependent components such as state space and cost function, and refine the implementation-dependent factors including initial temperature and cooling schedule. The simulation results show that our optimization methodology demonstrates good behavior in terms of performance on a variety of graphs modeling the sample ATM networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 10 (1999), S. 211-222 
    ISSN: 1573-773X
    Keywords: constraint satisfaction ; Hopfield network ; neural networks ; optimization ; relaxation procedure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract When solving an optimization problem with a Hopfield network, a solution is obtained after the network is relaxed to an equilibrium state. The relaxation process is an important step in achieving a solution. In this paper, a new procedure for the relaxation process is proposed. In the new procedure, the amplified signal received by a neuron from other neurons is treated as the target value for its activation (output) value. The activation of a neuron is updated directly based on the difference between its current activation and the received target value, without using the updating of the input value as an intermediate step. A relaxation rate is applied to control the updating scale for a smooth relaxation process. The new procedure is evaluated and compared with the original procedure in the Hopfield network through simulations based on 200 randomly generated instances of the 10-city traveling salesman problem. The new procedure reduces the error rate by 34.6% and increases the percentage of valid tours by 194.6% as compared with the original procedure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 9 (1999), S. 119-127 
    ISSN: 1573-773X
    Keywords: reinforcement learning ; neurocontrol ; optimization ; polytope algorithm ; pole balancing ; genetic reinforcement
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorithm to adjust the weights of the action network so that a simple direct measure of the training performance is maximized. Experimental results from the application of the method to the pole balancing problem indicate improved training performance compared with critic-based and genetic reinforcement approaches.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Transport in porous media 41 (2000), S. 149-171 
    ISSN: 1573-1634
    Keywords: hydrodynamic isolation ; plume ; remediation ; genetic algorithms ; optimization ; aquifer
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Technology
    Notes: Abstract Produced water constitutes a large amount of waste fluids during the production operation of an oil field. Underground injection for disposing the wastewater from hydrocarbon production is an engineering problem due to the possibility of leakage of injected pollutant material from receiving medium to a drinking water source. This paper describes a method for optimization of polluted aquifer remediation design using one of the artificial intelligence optimization methods, namely Genetic Algorithms (GAs). As a case study, the contaminated area was created by using a groundwater transport simulator, which is based on Method of Characteristics (MOC). Then, the developed computer program was run to find the optimum solution for remediation, and the solution yielded from the program was verified by using a groundwater simulator. The plume was captured and the concentration level of chloride ion within the aquifer was diminished by using extraction wells. The analytical model approach provided different alternatives for appropriate isolation of plume. GAs were used as an optimization technique for making a decision among the alternatives, by considering operation time, number of wells, pumping rate and drawdown as decision variables and constraints.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Water resources management 13 (1999), S. 153-170 
    ISSN: 1573-1650
    Keywords: Aquifer management ; infrastructure location ; least-cost design and operation ; optimization ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract Aquifer systems play an essential role in meeting the ever increasing use of water for different purposes. Proper design and management of such systems should therefore be a very important matter of concern, not only to ensure that water will be available in adequate quantity (and quality) to satisfy demands but also to guarantee that this would be done in an optimal manner. This paper presents a model serving to define which water supply structures (especially pumping equipment and pipes) should be installed in order to minimize the sum of set-up costs and operation costs while satisfying demands, using a heuristic approach based on simulated annealing. Annealing algorithms are random local search optimization algorithms that allow, at least in theory and in probability, the determination of a global optimum of a (possibly constrained) function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Water resources management 12 (1998), S. 375-396 
    ISSN: 1573-1650
    Keywords: genetic algorithms ; groundwater recharge ; optimization ; soil aquifer treatment
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract The genetic algorithm (GA) is a nonconventional search technique which is patterned after the biological processes of natural selection and evolution. It has the ability to search large and complex decision spaces and handle nonconvexities. In this paper, the genetic algorithm is investigated and applied to solve the optimal operation problem of soil aquifer treatment (SAT) systems. This problem involves finding optimal water application time and drying time which maximize infiltration for a predetermined starting influent rate of waste water and subject to various physical and operational constraints. A new scaling method is developed and some improvements on the evolution procedure are presented. A comprehensive GA–SAT computer model was developed and applied to an example SAT problem. The results are encouraging, when compared with using the successive approximation linear quadratic regulator algorithm. It was found that genetic algorithms are easy to program and interface with large complicated simulators.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Water resources management 11 (1997), S. 165-184 
    ISSN: 1573-1650
    Keywords: optimization ; linear programming ; simulation ; irrigation planning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract A methodology is presented for planning the operation of the Fuerte-Carrizo irrigation system in northwest Mexico. The system has two storage dams, two irrigation districts, and water transfer capabilities between both dams. The methodology uses a combination of linear programming (LP) and simulation. The LP model maximizes the net return of the farmers, subject to restrictions of the system, availability of water and land, and water transfer relationships. The simulation model is programmed as a microcomputer interactive package simulating the performance of the system. The methodology has proven to be a useful tool to assist those responsible for the operation of the irrigation system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Water resources management 14 (2000), S. 457-472 
    ISSN: 1573-1650
    Keywords: fuzzy mathematical programming ; multireservoir system ; optimization ; steady state solution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract For a multireservoir system, where the number of reservoirs islarge, the conventional modelling by classical stochastic dynamicprogramming (SDP) presents difficulty, due to the curse ofdimensionality inherent in the model solution. It takes a longtime to obtain a steady state policy and also it requires largeamount of computer storage space, which form drawbacks inapplication. An attempt is made to explore the concept of fuzzysets to provide a viable alternative in this context. Theapplication of fuzzy set theory to water resources systems isillustrated through the formulation of a fuzzy mathematicalprogramming model to a multireservoir system with a number ofupstream parallel reservoirs, and one downstream reservoir. Thestudy is aimed to minimize the sum of deviations of the irrigationwithdrawals from their target demands, on a monthly basis, over ayear. Uncertainty in reservoir inflows is considered by treatingthem as fuzzy sets. The model considers deterministic irrigationdemands. The model is applied to a three reservoir system in theUpper Cauvery River basin, South India. The model clearlydemonstrates that, use of fuzzy linear programming inmultireservoir system optimization presents a potentialalternative to get the steady state solution with a lot lesseffort than classical stochastic dynamic programming.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Water resources management 9 (1995), S. 39-51 
    ISSN: 1573-1650
    Keywords: multiobjective ; optimization ; systems engineering ; water resources allocation ; Hierarchical dynamic programming ; subregion ; trunk stream ; basin
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract The major purpose of this paper is to present the useful techniques in the optimal allocation of water resources (OAWR) and to demonstrate using water resources applications how these methods can be conveniently employed in practice for systematically studying both simple and complex water resources problems. Formal modelling techniques in multiobjective decision-making provide many benefits to professionals working in water resources and elsewhere. A new Large-system Hierarchical Dynamic Programming (LHDP) method to solve the model can be carried out to ascertain the consequences of meaningful parameter changes upon the optimal or compromise solution. As a case study, the techniques and methods are applied to the OAWR of the Yellow River Basin (YRB) of China. The next paper shares with the reader recent research results on the OAWRYRB.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 28 (1996), S. 895-907 
    ISSN: 1573-8868
    Keywords: reservoir geometry ; multiple-point histogram ; geological accretion ; optimization ; flow responses
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract Large-scale reservoir architecture constitutes first-order reservoir heterogeneity and dietates to a large extent reservoir flow behavior. It also manifests geometric characteristics beyond the capability of traditional geostatistical models conditioned only on single-point and two-point statistics. Multiple-point statistics, as obtained by scanning a training image deemed representative of the actual reservoir, if reproduced properly provides stochastic models that better capture the essence of the heterogeneity. A “growth” algorithm, coupled with an optimization procedure, is proposed to reproduce target multiple-point histograms. The growth algorithm makes an analogy between geological accretion process and stochastic process and amounts to restricting the random path of sequential simulation at any given stage to a set of eligible nodes (immediately adjacent to a previously simulated node or sand grain). The proposed algorithm, combined with a multiple-grid approach, is shown to reproduce effectively the geometric essence of complex training images exhibiting long-range and curvilinear structures. Also, by avoiding a rigorous search for global minimum and accepting local minima, the proposed algorithm improves CPU time over traditional optimization procedures by several orders of magnitude. Average flow responses run on simulated realizations are shown to bracket correctly the reference responses of the training image.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 32 (2000), S. 87-108 
    ISSN: 1573-8868
    Keywords: heterogeneity ; geostatistics ; optimization ; inversion ; nonlinearity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract This paper describes a new method for gradually deforming realizations of Gaussian-related stochastic models while preserving their spatial variability. This method consists in building a stochastic process whose state space is the ensemble of the realizations of a spatial stochastic model. In particular, a stochastic process, built by combining independent Gaussian random functions, is proposed to perform the gradual deformation of realizations. Then, the gradual deformation algorithm is coupled with an optimization algorithm to calibrate realizations of stochastic models to nonlinear data. The method is applied to calibrate a continuous and a discrete synthetic permeability fields to well-test pressure data. The examples illustrate the efficiency of the proposed method. Furthermore, we present some extensions of this method (multidimensional gradual deformation, gradual deformation with respect to structural parameters, and local gradual deformation) that are useful in practice. Although the method described in this paper is operational only in the Gaussian framework (e.g., lognormal model, truncated Gaussian model, etc.), the idea of gradually deforming realizations through a stochastic process remains general and therefore promising even for calibrating non-Gaussian models.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    International journal of computer vision 34 (1999), S. 19-28 
    ISSN: 1573-1405
    Keywords: geodesic active contours ; active surfaces ; Hamiltonian ; snakes ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Recently, Caselles et al. have shown the equivalence between a classical snake problem of Kass et al. and a geodesic active contour model. The PDE derived from the geodesic problem gives an evolution equation for active contours which is very powerfull for image segmentation since changes of topology are allowed using the level set implementation. However in Caselles' paper the equivalence with classical snake is only shown for 2D images and 1D curves, by using concepts of Hamiltonian theory which have no meanings for active surfaces. This paper propose to examine the notion of equivalence and to revisite Caselles et al. arguments. Then a notion equivalence is introduced and shown for classical snakes and geodesic active contours in the 2D (active contour) and 3D (active surface) case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Environmental and resource economics 9 (1997), S. 199-224 
    ISSN: 1573-1502
    Keywords: environmental policy ; pulp and paper ; life cycle ; optimization ; technology lock-in ; recycling ; geography of production ; environment-trade conflict
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Economics
    Notes: Abstract In this paper, we propose a methodology, based on materials accounting and operational research techniques, to assess different industry configurations according to their life cycle environmental impacts. Rather than evaluating a specific technology, our methodology searches for the feasible configuration with the minimum impact. This approach allows us to address some basic policy-relevant questions regarding technology choice, investment priorities, industrial structures, and international trade patterns. We demonstrate the methodology in the context of the European pulp and paper industry. We are able to show that current environmental policy's focus on maximizing recycling is optimal now, but that modest improvements in primary pulping technology may shift the optimal industry configuration away from recycling toward more primary pulping with incineration. We show that this will have significant implications for the amount and type of environmental damage, for the location of different stages in the production chain, and for trade between European member states. We caution policy makers that their single-minded focus on recycling may foreclose investment in technologies that could prove environmentally superior. Finally, we hint that member state governments may be fashioning their environmental policy positions at least in part on some of the trade and industrial implications we find.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Journal of automated reasoning 24 (2000), S. 205-223 
    ISSN: 1573-0670
    Keywords: SAT problem ; local search ; meta-heuristics ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT problem. GLS is a general, penalty-based meta-heuristic, which sits on top of local search algorithms to help guide them out of local minima. GLS has been shown to be successful in solving a number of practical real-life problems, such as the traveling salesman problem, BT"s workforce scheduling problem, the radio link frequency assignment problem, and the vehicle routing problem. We present empirical results of applying GLS to instances of the SAT problem from the DIMACS archive and also a small set of weighted MAX-SAT problem instances and compare them with the results of other local search algorithms for the SAT problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Water resources management 14 (2000), S. 349-368 
    ISSN: 1573-1650
    Keywords: adaptive ; dynamic ; management ; optimization ; reservoir ; SCADA
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract In large metropolitan areas of the world the operation andmanagement programs for water supply reservoirs play adominant role in economic, social and cultural growth anddevelopment. An unprecedented population increase inaddition to intensive migration from rural areas add extrapressure on the available limited natural resources suchas land, air and water. Although there are many optimizationtechniques including simple linear or dynamic programming whichmight also include chance constraints, they are rather sophisticated for layman operators who deal with the real timejoint operation of various reservoirs. Furthermore, these operation programs require data on daily basis on hydrologicvariable such as rainfall, runoff, evaporation and others which might not be available in sufficient amounts. It is, therefore, necessary to develop simple, dynamic and adaptiveoperation rules according to the special set up of thereservoirs for each city water resources. This article providesthe fundamentals of Istanbul city water-supply-reservoir operation rules suitable for the combination of already existing Supervised Control And DataAcquisition (SCADA) unit of the city. The operation rules are developed on daily basis under the worstpossible constraints to appear. The suggested model is namedSimple Adaptive Daily Dynamic Program (SADP which runs on the concept of critical duration with unpredictable rainfall-runoff, evaporation and infiltration properties.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    International journal of infrared and millimeter waves 21 (2000), S. 1381-1395 
    ISSN: 1572-9559
    Keywords: gyrotrons ; optimization ; mode competition ; start-up ; recovery
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract The opportunity of use of a TE25.10 operating mode for CW 170 GHz/1 MW gyrotron for ITER is estimated. Parameters are optimized to achieve maximum efficiency of the gyrotron with an acceptable Ohmic load on the cavity. The influence of unwanted mode conversion at the output of the resonator, mode competition, electron beam potential depression, ion compensation of the space charge and beam energy recovery is investigated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    International journal of thermophysics 19 (1998), S. 491-500 
    ISSN: 1572-9567
    Keywords: equations of state ; optimization ; nonpolar fluids ; methane ; argon ; oxygen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract A new algorithm for the optimization of functional forms of empirical equations of state is presented which considers data sets of different substances simultaneously. In this way, functional forms for empirical equations of state can be developed which yield, on average, the best representation of the thermo-dynamic properties of all substances within larger groups of substances (e.g., “nonpolar” and “polar” substances). The new algorithm is being used to develop a new class of empirical equations of state which meet typical technical requirements on the accuracy of thermodynamic properties with only about 10 fittable coefficients. The first results for nonpolar fluids are reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Computational optimization and applications 12 (1999), S. 41-51 
    ISSN: 1573-2894
    Keywords: convex programming ; optimization ; duality ; error bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Given a single feasible solution $$x_F $$ and a single infeasible solution $$x_I $$ of a mathematical program, we provide an upper bound to the optimal dual value. We assume that $$x_F $$ satisfies a weakened form of the Slater condition. We apply the bound to convex programs and we discuss its relation to Hoffman-like bounds. As a special case, we recover a bound due to Mangasarian [11] on the distance of a point to a convex set specified by inequalities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 51 (2000), S. 341-352 
    ISSN: 1432-5217
    Keywords: Key words: Stable ditributions ; portfolio management ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. The aim of this short review is to outline the main directions of stable Paretian modeling in portfolio management.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 51 (2000), S. 315-339 
    ISSN: 1432-5217
    Keywords: Key words: Incomplete market ; quadratic hedging ; optimization ; semimartingales ; stochastic integrals ; Kunita-Watanabe projection ; L2-projection ; minimal martingale measure ; variance-optimal martingale measure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. We review the main results in the theory of quadratic hedging in a general incomplete model of continuous trading with semimartingale price process. The objective is to hedge contingent claims by using portfolio strategies. We describe two types of criteria: the so-called (local) risk-minimization and the mean-variance approaches. From a mathematical viewpoint, these optimization problems lead to new variants of decomposition theorems in stochastic analysis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 21 (2000), S. 19-26 
    ISSN: 1573-2754
    Keywords: structure ; optimization ; topology optimization ; modeling ; dual programming ; O223 ; TU323
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract Topology optimization design of continuum structures that can take account of stress and displacement constraints simultaneously is difficult to solve at present. The main obstacle lies in that, the explicit function expressions between topological variables and stress or displacement constraints can not be obtained using homogenization method or variable density method. Furthermore, large quantities of design variables in the problem make it hard to deal with by the formal mathematical programming approach. In this paper, a smooth model of topology optimization for continuum structures is established which has weight objective considering stress and displacement constraints based on the independent-continuous topological variable concept and mapping transformation method proposed by Sui Yunkang and Yang Deqing. Moreover, the approximate, explicit expressions are given between topological variables and stress or displacement constraints. The problem is well solved by using dual programming approach, and the proposed element deletion criterion implements the inversion of topology variables from the discrete to the continuous. Numerical examples verify the validity of proposed method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Computational optimization and applications 16 (2000), S. 159-172 
    ISSN: 1573-2894
    Keywords: optimization ; conjugate gradient method ; global convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper a new nonmonotone conjugate gradient method is introduced, which can be regarded as a generalization of the Perry and Shanno memoryless quasi-Newton method. For convex objective functions, the proposed nonmonotone conjugate gradient method is proved to be globally convergent. Its global convergence for non-convex objective functions has also been studied. Numerical experiments indicate that it is able to efficiently solve large scale optmization problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Computational optimization and applications 7 (1997), S. 143-158 
    ISSN: 1573-2894
    Keywords: planning under uncertainty ; parallel computing ; optimization ; software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a computationally efficient implementation of an interior point algorithm for solving large-scale problems arising in stochastic linear programming and robust optimization. A matrix factorization procedure is employed that exploits the structure of the constraint matrix, and it is implemented on parallel computers. The implementation is perfectly scalable. Extensive computational results are reported for a library of standard test problems from stochastic linear programming, and also for robust optimization formulations.The results show that the codes are efficient and stable for problems with thousands of scenarios. Test problems with 130 thousand scenarios, and a deterministic equivalent linear programming formulation with 2.6 million constraints and 18.2 million variables, are solved successfully.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Environmental and resource economics 9 (1997), S. 409-427 
    ISSN: 1573-1502
    Keywords: structural diversity ; optimization ; resource management
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Economics
    Notes: Abstract This paper introduces a computationally convenient measure of structural diversity based on absolute deviations between relative shares of individual groups forming a community. A conceptual framework is developed, some theoretical properties of the measure are derived, and its close relation to the Shannon index, a widely used diversity measure, is explored. The paper also presents an empirical application involving this measure where optimum harvesting strategies are determined under diversity constraints, and investigates the trade off between economic and environmental objectives for a mixed forest in Indonesia.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 5 (1995), S. 175-190 
    ISSN: 1573-1375
    Keywords: Image analysis ; MAP estimation ; optimization ; simulated annealing ; multi-resolution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We describe an image reconstruction problem and the computational difficulties arising in determining the maximum a posteriori (MAP) estimate. Two algorithms for tackling the problem, iterated conditional modes (ICM) and simulated annealing, are usually applied pixel by pixel. The performance of this strategy can be poor, particularly for heavily degraded images, and as a potential improvement Jubb and Jennison (1991) suggest the cascade algorithm in which ICM is initially applied to coarser images formed by blocking squares of pixels. In this paper we attempt to resolve certain criticisms of cascade and present a version of the algorithm extended in definition and implementation. As an illustration we apply our new method to a synthetic aperture radar (SAR) image. We also carry out a study of simulated annealing, with and without cascade, applied to a more tractable minimization problem from which we gain insight into the properties of cascade algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    ISSN: 1573-2681
    Keywords: fractal geometry ; fractal interpelation functions ; debonding ; delamination ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Notes: Abstract The present paper studies the influence of adhesives on the behaviour of cracks in deformable bodies. Especially the delamination and debonding effects are studied. The adhesive material is assumed to introduce nonmonotone possibly multivalued laws which can be described via nonconvex superpotentials. Cracks of fractal geometry are considered. Approximating the fractal crack by a sequence of smooth surfaces or curves and combining this procedure with an algorithm based on the optimization of the potential and of the complementary energy for each approximation of the fractal crack, we get the solution of the problem. Numerical examples, using singular elements for the consideration of the crack singularity, illustrate the theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Journal of elasticity 60 (2000), S. 103-117 
    ISSN: 1573-2681
    Keywords: optimization ; anisotropic elasticity ; fiber-mesh layout ; elastic wedge ; Lekhnitskii formalism
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Notes: Abstract We consider a homogeneous orthotropic elastic wedge in plane stress loaded by a concentrated force at the apex. The orthotropic material is conceived of to be formed by a matrix reinforced by a triangular net of elastic fibers, so that the fiber size and the net shape determine the average elastic moduli of the composite material. It is found that maintaining fixed the amount of material used for the reinforcement, there exists a particular fiber disposal which maximizes the stiffness of the wedge. The optimal disposal is different-in-type for diverse opening-angles of the wedge.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous robots 2 (1995), S. 11-27 
    ISSN: 1573-7527
    Keywords: mobile robot ; path ; optimization ; sliding mode ; adaptive control ; tracking strategy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The paper deals with a set of algorithms including path planning, trajectory planning, and path tracking for a tricycle type wheeled mobile robot. Path planning is carried out with parametric polynomial interpolation using an optimization algorithm based on robot geometric constraints. Trajectory characteristics are then derived from the planned geometric path with time varying parameters. A sliding mode control algorithm combined with an adaptive control law are used to track the planned trajectory. The technique deals with an environment free of obstacles. However, it can be easily integrated in a piecewise non colliding path generation. Simulation results are presented to show the validity of the different algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Data mining and knowledge discovery 2 (1998), S. 311-324 
    ISSN: 1573-756X
    Keywords: market segmentation ; optimization ; clustering
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We present a rigorous framework, based on optimization, for evaluating data mining operations such as associations and clustering, in terms of their utility in decision-making. This framework leads quickly to some interesting computational problems related to sensitivity analysis, segmentation and the theory of games.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 28 (2000), S. 325-345 
    ISSN: 1573-7640
    Keywords: compiler ; optimization ; instruction level parallelism ; code size
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract To achieve high-performance on processors featuring ILP, most compilers apply locally a set of heuristics. This leads to a potentially high-performance on separate code fragments. Unfortunately, most optimizations also increase code size, which may lead to a global net performance loss. In this paper, we propose a Global Constraints-Driven Strategy (GCDS) for guiding code optimization. When using GCDS, the final code optimization decision is taken according to global criteria rather than local criteria. For instance, such criteria might be performance, code size, instruction cache behavior, etc. The performance/code size trade-off is a particularly important problem for embedded systems. We show how GCDS can be used to master code size while optimizing performance.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Cybernetics and systems analysis 36 (2000), S. 829-844 
    ISSN: 1573-8337
    Keywords: variational inequalities ; numerical methods ; optimization ; economic equilibrium models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Algorithms for solving finite-dimensional inequalities are studied. The emphasis is on numerical methods based on the optimization approach. Examples of economic equilibrium models that assist in solving variational inequalities are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Cybernetics and systems analysis 36 (2000), S. 891-897 
    ISSN: 1573-8337
    Keywords: inventory control system ; controlled Markovian process ; optimization ; convex cost function ; Bellman equation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Some controlled Markovian processes in discrete time in the context of optimization of inventory control systems are studied. Optimality of (s, S)-policies for the case of convex cost functions is proved using theorems on existence and uniqueness of a nonrandomized stationary optimal policy for Markovian processes with discrete time and a continuous control set for criteria characterizing mean costs per unit time and overestimated total costs and Bellman equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Cybernetics and systems analysis 36 (2000), S. 722-728 
    ISSN: 1573-8337
    Keywords: optimization ; guaranteed state estimation ; dynamic system ; set-valued estimation ; dynamic programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The optimization approach to set-theoretic estimation problems is developed. Level sets of strictly convex and continuous functions are used as the set estimates. These functions are shown to satisfy, in estimating, the functional equation of dynamic programming.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Journal of bioeconomics 2 (2000), S. 133-138 
    ISSN: 1573-6989
    Keywords: economics ; fisheries ; optimization ; stochastic simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Economics
    Notes: Abstract Conrad (1999) examined the bioeconomics of marine sanctuaries and found: (1) a sanctuary that takes up a large share of the potential grounds can make fishing uneconomic, (2) a sanctuary of roughly the same size as the grounds can significantly reduce the standard deviation of the stock on the grounds when both stocks are growing randomly. It is argued that when one divides a fishery into grounds and a sanctuary the firm cost parameter should be adjusted in value as well as the capacity parameters. With this modification one finds that fishing grounds of smaller sizes are more profitable relative to their size than larger grounds and that the reduction in variability of stocks on the fishing ground is relatively smaller.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...