Downloads & Free Reading Options - Results

This paper is first attempt to establish the structure of solution set on model. The NRE have a wide applications in various real world problems like flow rate in chemical plants, transportation problem, study of bounded labor problem, study of interrelations among HIV/AIDS affected patients and use of genetic algorithms in chemical problems.

This project proposes to investigate the effectiveness of prototype and generalized geometric programming (GP) developments in the routine solution of inequality constrained algebraic programs. The research seeks to elucidate under what conditions which of the equivalent prototype GP problem forms: primal, convexified primal, transformed primal, and, or transformed dual, as well as their generalized GP analogous are best solved and under what conditions. Moreover, direct and sequential strategies will be examined to identify the most efficient strategies for the solution of GGP's. The computational tests in the study will be performed using the leading specialized GP and GGP codes as well as a selection of general nonlinear programming codes. Statistical tests will be employed to deduce suitable measures of prototype and generalized GP problem difficulty. (Author)

The global optimization trends of protective honeycomb structural designs for spacecraft subject to hypervelocity meteroid and space debris are presented. This nonlinear problem is first formulated for weight minimization of the orbital maneuvering vehicle (OMV) using a generic monomial predictor. Five problem formulations are considered, each dependent on the selection of independent design variables. Each case is optimized by considering the dual geometric programming problem. The dual variables are solved for in terms of the generic estimated exponents of the monomial predictor. The primal variables are then solved for by conversion. Finally, parametric design trends are developed for ranges of the estimated regression parameters. Results specify nonmonotonic relationships for the optimal first and second sheet mass per unit areas in terms of the estimated exponents.

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This result generalizes a result of Lasserre and a result of Fidalgo and Kovacec, and it also generalizes the improvements of these results given in [6]. We apply this result to obtain a new lower bound $f_{gp}$ for $f$, and we explain how $f_{gp}$ can be computed using geometric programming. The lower bound $f_{gp}$ is generally not as good as the lower bound $f_{sos}$ introduced by Lasserre and Parrilo and Sturmfels, which is computed using semidefinite programming, but a run time comparison shows that, in practice, the computation of $f_{gp}$ is much faster. The computation is simplest when the highest degree term of $f$ has the form $\sum_{i=1}^n a_iX_i^{2d}$, $a_i>0$, $i=1,...,n$. The lower bounds for $f$ established in [6] are obtained by evaluating the objective function of the geometric program at the appropriate feasible points.

Generalizations of the Kuhn-Tucker optimality conditions are given, as are the fundamental theorems having to do with their necessity and/or sufficiency. (Author)

Fenchel's duality theorem is extended to generalized geometric programming with explicit constraints - an extension that also generalizes and strengthens Slater's version of the Kuhn-Tucker Theorem. (Author)

Many important problems of engineering and management are of a form which could be represented as geometric programs except that the functional to be minimized as well as the constraints are not confined to posynomials in that some of the coefficients are negative. This paper supplies a way for dealing with such negative terms by a constraint adjunction procedure which yields an associated approximating problem involving only polynomials which can, in turn, be transformed into a convex programming problem that has only one local (= global) optimum. The latter, which is called a convex approximant, has an associated dual. Recourse to the related duality theory then supplies guidance for improving the approximation along lines that are indicated in the paper.

The CCK duality theory of semi-infinite programming is specialized to situations involving differentiability (or partial differentiability) of objective and constraint functions to obtain in a uniform and direct manner various results and interpretations, such as generalization of the Kuhn-Tucker Theorem, the 'geometric' programming of Duffin-Peterson, and the Slater constraint qualification example.

The research in this grant involves the application of generalized geometric programming (conjugate duality) to a variety of problems. The duality theory constructs a dual program which can provide insight into the problem and assist in solution. Composite geometric programming was developed as an important new class of mathematical programming was developed as an important new class of mathematical programs. Applications studied included machining economics, resource allocation, assignment, nonlinear multicommodity network flow problems, mineral processing, statistical analysis of ordinal categorical data, and estimation. Geometric programming was extended from functions of posynomial form to functions which include exponential, logarithmic and other factors by the development of composite geometric programming. This class retains the power of geometric programming while addressing new problems. Certain machining economics problems and chemical equilibrium problems fall into this new class of mathematical programs. Research on the machining economics problem resulted in the problem being reduced from a nonlinear program to a one-dimensional search. In addition, duality theory provided easy parametric analysis.

The research in this grant involves the application of generalized geometric programming (conjugate duality) to a variety of problems. The duality theory constructs a dual program which can provide insight into the problem and assist in solution. Composite geometric programming was developed as an important new class of mathematical programming was developed as an important new class of mathematical programs. Applications studied included machining economics, resource allocation, assignment, nonlinear multicommodity network flow problems, mineral processing, statistical analysis of ordinal categorical data, and estimation. Geometric programming was extended from functions of posynomial form to functions which include exponential, logarithmic and other factors by the development of composite geometric programming. This class retains the power of geometric programming while addressing new problems. Certain machining economics problems and chemical equilibrium problems fall into this new class of mathematical programs. Research on the machining economics problem resulted in the problem being reduced from a nonlinear program to a one-dimensional search. In addition, duality theory provided easy parametric analysis.

This note shows how information theoretic methods can be used to obtain simply the fundamental geometric inequality lemma. This lemma is the base used by Duffin, Peterson and Zener (1967) for providing their duality results for geometric programming, and its proof occupies three pages in their book. Their method of proof is a technically impressive procedure. However to illustrate the power of information theoretic methods we shall give a simple proof of this fundamental inequality. The approach we shall take is to show the connection between geometric programming and constrained Khinchine-Kullback- Leibler, or minimum discrimination information (MDI) estimation. Complete duality states for MDI estimation are known (c.f. Brockett, Charnes and Cooper (1980), Charnes, Cooper and Seiford (1978), Charnes and Cooper (1974a,b)). Additionally, in the usual duality state of interest, the statistical properties of the solution are known, facilitating sensitivity analysis. The computation of MDI estimation is easily performed using an unconstrained dual convex program involving only linear and exponential functions.

In this paper, we propose an optimization framework to design a network of positive linear systems whose structure switches according to a Markov process. The optimization framework herein proposed allows the network designer to optimize the coupling elements of a directed network, as well as the dynamics of the nodes in order to maximize the stabilization rate of the network and/or the disturbance rejection against an exogenous input. The cost of implementing a particular network is modeled using posynomial cost functions, which allow for a wide variety of modeling options. In this context, we show that the cost-optimal network design can be efficiently found using geometric programming in polynomial time. We illustrate our results with a practical problem in network epidemiology, namely, the cost-optimal stabilization of the spread of a disease over a time-varying contact network.

Achieving the desired level of satisfaction for a decision-maker in any decision-making scenario is considered a challenging endeavor because minor modifications in the process might lead to incorrect findings and inaccurate decisions. In order to maximize the decision-maker’s satisfaction, this paper proposes a Single-valued Neutrosophic Geometric Programming model based on pentagonal fuzzy numbers. The decision-maker is typically assumed to be certain of the parameters, but in reality, this is not the case, hence the parameters are presented as neutrosophic fuzzy values. The decision-maker, with this strategy, is able to achieve varying levels of satisfaction and dissatisfaction for each constraint and even complete satisfaction for certain constraints. Here the decision maker aims to achieve the maximum level of satisfaction while maintaining the level of hesitation and minimizing dissatisfaction in order to retain an optimum solution. Furthermore, transforming the objective function into a constraint adds one more layer to the N -dimensional multi-parametrizes and . The advantages of this multi-parametrized proposed method over the existing ones are proven using numerical examples.

In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares representation. These criteria rely on the coefficients and the support of a polynomial and generalize all previous ones by Lasserre, Ghasemi, Marshall, Fidalgo and Kovacec to polynomials with arbitrary simplex Newton polytopes. This generalization yields a geometric programming approach for computing lower bounds for polynomials that significantly extends the geometric programming method proposed by Ghasemi and Marshall. Furthermore, it shows that geometric programming is strongly related to nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the authors.

In this paper, a method for the design of analog-to-digital converters is presented. This method computes the sizes of the different components (transistors, capacitors, etc.) in a predefined ADC topology so that the design specifications are met in the desired process technology. The method is based on formulating the ADC design constraints such as specifications on power, signal-to-noise ratio (SNR), area, and sampling frequency in special convex form in terms of the component sizes of the ADC and intermediate design variables. More specifically, the problem of sizing the components of the ADC are cast as a geometric program. Therefore, all design constraints are formulated as posynomial inequality or monomial equality constraints. Very efficient numerical algorithms are then used to solve the resulting geometric program and to compute the component sizes of an ADC that meets the desired specifications. The synthesis method is fast, and determines the globally optimal design; in particular, the final solution is completely independent of the starting point (which can even be infeasible), and infeasible specifications are unambiguously detected. This paper introduces the concept of hierarchical problem formulation within a geometric programming framework. This modular formulation allows a high reuse of the ADC posynomial model. (6 figures, 25 refs.)

In this paper, a method for the design of analog-to-digital converters is presented. This method computes the sizes of the different components (transistors, capacitors, etc.) in a predefined ADC topology so that the design specifications are met in the desired process technology. The method is based on formulating the ADC design constraints such as specifications on power, signal-to-noise ratio (SNR), area, and sampling frequency in special convex form in terms of the component sizes of the ADC and intermediate design variables. More specifically, the problem of sizing the components of the ADC are cast as a geometric program. Therefore, all design constraints are formulated as posynomial inequality or monomial equality constraints. Very efficient numerical algorithms are then used to solve the resulting geometric program and to compute the component sizes of an ADC that meets the desired specifications. The synthesis method is fast, and determines the globally optimal design; in particular, the final solution is completely independent of the starting point (which can even be infeasible), and infeasible specifications are unambiguously detected. This paper introduces the concept of hierarchical problem formulation within a geometric programming framework. This modular formulation allows a high reuse of the ADC posynomial model. (6 figures, 25 refs.)

To solve a posynomial geometric program, rather than solve its dual directly, one solves the duals of a sequence of approximating geometric programs. Each approximating program, obtained by condensing certain terms of the given problem, has fewer degrees of difficulty than the given problem. Therefore, this method is to solve a sequence of problems, each posed in the same low dimensional space, rather than solve one problem in a higher dimensional space. The method requires a special sub-matrix of the matrix of exponents, and procedures to find such a sub-matrix are presented. A line search on an exact penalty function is employed. Under mild conditions, from any arbitrary starting solution estimate the method generates a sequence of estimates converging to a solution. The method also generates a sequence of lower bounds, thus providing an effective stopping criterion. A numerical example is presented.

This volume was digitized and made accessible online due to deterioration of the original print copy.

Extensions of the ordinary Lagrangian are used both in saddle point characterizations of optimality and in a development of duality theory. (Author)

This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates.

Neutrosophic (over, off, under) set and logic were defined for the first time in 1995 by Florentin Smarandache, and presented during 1995-2018 to various national and international conferences and seminars. The (over, off, under) neutrosophic geometric programming was put forward by Huda et al. in (2016), in an attempt to define a new type of geometric programming using (over, off, under) neutrosophic less than or equal to. This paper completes the basic notions of (over, off, under) neutrosophic geometric programming illustrating its convexity condition, and its decomposition theorems. The definitions of ( α, β, γ ) and strong ( α, β, γ ) are introduced, and some of their important properties are proved.

During the grant period the author's research efforts has been concentrated in five major directions: (1) the effective formulation and study of two important optimization problems and two important equilibrium problems (as generalized geometric programming problems), (2) an investigation of the relations between suboptimization and parameter deletion, including the relations between ordinary duality, geometric duality, and Rockafellar duality, (3) an investigation of the relations between the fixed point problem and the geometric complementarity problem (a generalization of the ordinary complementarity problem), (4) an extension of the classical existence theorems for both the fixed point problem and the variational inequality problem, to deal with the geometric complementarity problem, (5) the preparation of a book that unifies and contrasts ordinary programming theory, geometric programming theory, parametric programming theory, ordinary complementarity theory, geometric complementarity theory, fixed point theory, and variational inequality theory; while showing how each of these theories supplies different insights into various important optimization problems and equilibrium problems. (KR)

The rapid advancement of technology in the electronic industry has created a need for solving a certain class of large nonlinear reliability problems. The Department of Defense and civilian industries when planning for the allocations of budget resources require an efficient method for solving these problems. In certain areas a specific reliability, such as with nuclear reactors, must be attainable to ensure the accomplishment of the mission or to provide necessary safety factors. The current methods used to solve these problems are very difficult and time consuming. A computer algorithm which is based on geometric programming has been developed to provide a quick, accurate, and efficient way of solving reliability problems. Keywords: theses; electric equipment.

Monomials function has always been considered as a significant and most extensively used function in real living. Resource allocation, structure optimization and technology management can often apply these functions. In optimization problems the objective functions can be considered by monomials. In this paper, we present monomials geometric programming with fuzzy relation inequalities constraint with max-product composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and a few practical examples are presented to abbreviate and illustrate the steps of the problem resolution.

Monomials function has always been considered as a significant and most extensively used function in real living. Resource allocation, structure optimization and technology management can often apply these functions. In optimization problems the objective functions can be considered by monomials. In this paper, we present monomials geometric programming with fuzzy relation inequalities constraint with max-product composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and a few practical examples are presented to abbreviate and illustrate the steps of the problem resolution.

Monomials function has always been considered as a significant and most extensively used function in real living. Resource allocation, structure optimization and technology management can often apply these functions. In optimization problems the objective functions can be considered by monomials. In this paper, we present monomials geometric programming with fuzzy relation inequalities constraint with max-product composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and a few practical examples are presented to abbreviate and illustrate the steps of the problem resolution.

Monomials function has always been considered as a significant and most extensively used function in real living. Resource allocation, structure optimization and technology management can often apply these functions. In optimization problems the objective functions can be considered by monomials. In this paper, we present monomials geometric programming with fuzzy relation inequalities constraint with max-product composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and a few practical examples are presented to abbreviate and illustrate the steps of the problem resolution.

In this article we combine two recent developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third author. On the other hand, we investigate geometric programming methods for constrained polynomial optimization problems, which were recently developed by Ghasemi and Marshall. We show that the combination of both results yields an efficient new method to solve constrained polynomial optimization problems with many variables or with high degree polynomials. The resulting method is significantly faster and for certain classes of polynomials also better than semidefinite programming as we demonstrate in various examples.

Monomials function has always been considered as a significant and most extensively used function in real living. Resource allocation, structure optimization and technology management can often apply these functions. In optimization problems the objective functions can be considered by monomials. In this paper, we present monomials geometric programming with fuzzy relation inequalities constraint with max-product composition.

This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In essence, it reduces the negative hypothesis in complexity theory (the lower bound problems), such as the P vs. NP problem in characteristic zero, to the positive hypothesis in complexity theory (the upper bound problems): specifically, to showing that the problems of deciding nonvanishing of the fundamental structural constants in representation theory and algebraic geometry, such as the well known plethysm constants--or rather certain relaxed forms of these decision probelms--belong to the complexity class P. In this article, we suggest a plan for implementing the flip, i.e., for showing that these relaxed decision problems belong to P. This is based on the reduction of the preceding complexity-theoretic positive hypotheses to mathematical positivity hypotheses: specifically, to showing that there exist positive formulae--i.e. formulae with nonnegative coefficients--for the structural constants under consideration and certain functions associated with them. These turn out be intimately related to the similar positivity properties of the Kazhdan-Lusztig polynomials and the multiplicative structural constants of the canonical (global crystal) bases in the theory of Drinfeld-Jimbo quantum groups. The known proofs of these positivity properties depend on the Riemann hypothesis over finite fields and the related results. Thus the reduction here, in conjunction with the flip, in essence, says that the validity of the P vs. NP conjecture in characteristic zero is intimately linked to the Riemann hypothesis over finite fields and related problems.

This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In essence, it reduces the negative hypothesis in complexity theory (the lower bound problems), such as the P vs. NP problem in characteristic zero, to the positive hypothesis in complexity theory (the upper bound problems): specifically, to showing that the problems of deciding nonvanishing of the fundamental structural constants in representation theory and algebraic geometry, such as the well known plethysm constants--or rather certain relaxed forms of these decision probelms--belong to the complexity class P. In this article, we suggest a plan for implementing the flip, i.e., for showing that these relaxed decision problems belong to P. This is based on the reduction of the preceding complexity-theoretic positive hypotheses to mathematical positivity hypotheses: specifically, to showing that there exist positive formulae--i.e. formulae with nonnegative coefficients--for the structural constants under consideration and certain functions associated with them. These turn out be intimately related to the similar positivity properties of the Kazhdan-Lusztig polynomials and the multiplicative structural constants of the canonical (global crystal) bases in the theory of Drinfeld-Jimbo quantum groups. The known proofs of these positivity properties depend on the Riemann hypothesis over finite fields and the related results. Thus the reduction here, in conjunction with the flip, in essence, says that the validity of the P vs. NP conjecture in characteristic zero is intimately linked to the Riemann hypothesis over finite fields and related problems.

22 p. 28 cm

The chemical equilibrium problem--finding the equilibrium composition of a multiphase, multicomponent system--is of interest in the study of chemical systems in general, with many potential applications in biochemistry and biomedicine. The problem can be posed as a nonlinear program, where a convex 'free energy' function is minimized, subject to linear mass balance equations. There is an associated dual chemical problem, equivalent to a geometric program when the system is ideal. This work studies the chemical duality and applies the existing theory of geometric programming to analyze and solve chemical problems. Some general characteristics of free energy functions are developed and are used to analyze the properties of equilibrium solutions. Chemical duality is applied to formulate and solve a class of related problems which are of a different nature than the original chemical equilibrium problem. A dual cutting- plane algorithm is adapted from a method developed for geometric programs and is tested and compared to a standard chemical equilibrium code. Geometric programming theory is extended to include forms having variables as exponents. The resulting 'transcendental geometric programs' are shown to be a generalization of chemical problems, where the system is not ideal.

Achieving the desired level of satisfaction for a decision-maker in any decision-making scenario is considered a challenging endeavor because minor modifications in the process might lead to incorrect findings and inaccurate decisions. In order to maximize the decision-maker’s satisfaction, this paper proposes a Single-valued Neutrosophic Geometric Programming model based on pentagonal fuzzy numbers. The decision-maker is typically assumed to be certain of the parameters, but in reality, this is not the case, hence the parameters are presented as neutrosophic fuzzy values. The decision-maker, with this strategy, is able to achieve varying levels of satisfaction and dissatisfaction for each constraint and even complete satisfaction for certain constraints. Here the decision maker aims to achieve the maximum level of satisfaction while maintaining the level of hesitation and minimizing dissatisfaction in order to retain an optimum solution. Furthermore, transforming the objective function into a constraint adds one more layer to the N-dimensional multi-parametrizes α, β and γ. The advantages of this multi-parametrized proposed method over the existing ones are proven using numerical examples .

1Ivanhoe

By Sir Walter Scott

Follows the fortunes of the son of a noble Saxon family in Norman England as he woos his lady, disobeys his father, and is loved by another. Set in late 12C England and in Palestine with Richard Cœur-de-Lion at the Crusades, it's another ripping historical yarn by Scott. (summary by annise)

2Talisman

By Sir Walter Scott

The Talisman is a gripping tale set near the end of the Third Crusade. King Richard the Lionheart is grievously ill, and all around him the leaders from allied countries plot and scheme to gain personal power, putting the future of the crusade in jeopardy. Sir Kenneth of Scotland finds himself caught up in events, and finds both his honour and his life are now on the line. Can a cure be found for the King? Can Kenneth redeem his honour? – Written by Rowen

3Rob Roy

By Sir Walter Scott

Rob Roy is a historical novel by Walter Scott. It is narrated by Frank Osbaldistone, the son of an English merchant who travels first to the North of England, and subsequently to the Scottish Highlands to collect a debt stolen from his father. On the way he encounters the larger-than-life title character of Rob Roy MacGregor. Though Rob Roy is not the lead character (in fact the narrative does not move to Scotland until half way through the book) his personality and actions are key to the development of the novel. (Summary from Wikipedia)

4Journals of Robert Falcon Scott; Vol 1 of 'Scott's Last Expedition'

By Leonard Huxley and Robert Falcon Scott

Capt. Robert F. Scott's bid to be the leader of the first expedition to reach the South Pole is one of the most famous journeys of all time. What started as a scientific expedition turned out to be an unwilling race against a team lead by R. Admunsen to reach the Pole. The Norwegian flag already stood at the end of the trail when Scott's party reached their target. All the five men of the Scott expedition who took part in the last march to the Pole perished on their way back to safety.<br><br> Robert F. Scott kept a journal throughout the journey, all the way to the tragic end, documenting all aspects of the expedition. The famous last words of the journal were: 'It seems a pity, but I do not think I can write more. For God's sake look after our people.'<br> (Summary by Illiterati)

5Kenilworth

By Sir Walter Scott

An Elizabethan era historical novel by Scotland's master of fiction, Sir Walter Scott. With a cast of historical and created characters, including the Queen herself, Scott presents the sad history and tragic consequences of the secretive marriage of young Amy Robsart and the Earl of Leicester. (Summary by SK)

6Antiquary

By Andrew Lang and Sir Walter Scott

Illegitimacy, false identity, and bankruptcy are the major elements of Sir Walter Scott's 1816 novel, The Antiquary. Set in the period of the French Revolution, the novel's hero, Lovel, struggles to gain repute and the hand of his beloved despite his uncertain parentage. During these pursuits, he befriends the title's antiquary, Johnathan Oldbuck, who finds Lovel a captive audience to his scholarly studies and a tragic likeness to his own disappointments in love. Readers will discover whether Lovel's acts of bravery and courage ultimately earn him the birth and fortunes of a nobleman. (Summary by S. Kovalchik)

7Waverley, Volume 1

By Sir Walter Scott

<i>Waverley</i> is set during the Jacobite Rebellion of 1745, which sought to restore the Stuart dynasty in the person of Charles Edward Stuart (or 'Bonnie Prince Charlie'). It relates the story of a young dreamer and English soldier, Edward Waverley, who was sent to Scotland in 1745. He journeys North from his aristocratic family home, Waverley-Honour, in the south of England first to the Scottish Lowlands and the home of family friend Baron Bradwardine, then into the Highlands and the heart of the 1745 Jacobite uprising and aftermath. (Summary by Wikipedia)

The narrative poems in this collection are written by Sir Walter Scott - the well-known Scottish poet and novelist. Each of these five poems are based loosely upon German ballads: rewritten in flowing English meter. <br></br> * The Chase - a.k.a. The Wild Huntsman - A profligate, noble-born keeper of the royal forest - avidly addicted to the pleasures of the hunt - cruelly uses and mistreats his fellow-men. One day God's messengers come to test him: executing sentence immediately in just proportion to the huntsman's responses.<br></br> * William & Helen - William - long thought dead - unexpectedly returns at midnight from the crusades to marry his betrothed. Helen - relieved at his return - joyfully agree,s after initial misgivings: follows him on horseback into the night. Approaching the church in which they will celebrate their wedding: it is clear to Helen that all is not what it seems. But, with their mutual love strong enough to transcend death itself - what can possibly go wrong?<br></br> * The Fire King - Count Albert never returns from crusade: having being imprisoned by Saracens. Rosalie, his betrothed, swears to leave at once for Lebanon to find him. Rosalie succeeds - but alas, all is changed between them forever: and their parting is death itself.<br></br> * Frederick & Alice - Frederick breaks troth and abandons the beautiful Alice: sending her mad with grief. But Alice contrives to meet her faithless lover once more: beyond the grave.<br></br> * The Erl-King - The Erl-King (or Oak-King) sings for the soul of a human boy: who cringes for dear life within the arms of his father riding home through the dreary wood. But do spirits really have power to charm away the lives of the living?<br></br> (Introduction by Godsend)

Scott's The Bridal of Triermain is a rhymed, romantic, narrative poem which weaves together elements of popular English legend using dramatic themes. <br></br>This beautiful poem celebrates the exploits of a knight errant - Sir Roland De Vaux - as he seeks to rescue (and hopefully espouse) a beautiful maiden, Gyneth. Gyneth is the illegitimate daughter of King Arthur: doomed by Merlin 500 years previously to an enchanted sleep inside a magic castle. The enchantment can only be broken by a rescuer both brave and noble enough to overcome the temptations used successively to distract and overcome him, namely: fear, wealth, pleasure and pride.<br></br>(Introduction by Godsend)

Harold the Dauntless is a rhymed, romantic, narrative-poem by Sir Walter Scott. Written in 1817, it weaves together elements of popular English legends and folklore using dramatic themes.<br><br>The poem recounts the exploits and the personal spiritual journey of a doubtful knight errant - Harold the son of Danish Count Witikind: who seeks to recover his lands and wed a suitable spouse.<br><br>Fire-breathing Harold is as much a stranger to love as he is addicted to dangerous adventure: yet his own confrontations with the spirit-world shake his faith in supposed omnipotence of the traditional Norse pantheon.<br><br>Can a blood-thirsty warrior like Harold ever feel the raptures of love? <br><br>Can a man born to cherish gods of war really wish to exchange them for a God of peace?<br>(Introduction by Godsend)

11Waverley, Volume 2

By Sir Walter Scott

<i>Waverley</i> is set during the Jacobite Rebellion of 1745, which sought to restore the Stuart dynasty in the person of Charles Edward Stuart (or 'Bonnie Prince Charlie'). It relates the story of a young dreamer and English soldier, Edward Waverley, who was sent to Scotland in 1745. He journeys North from his aristocratic family home, Waverley-Honour, in the south of England first to the Scottish Lowlands and the home of family friend Baron Bradwardine, then into the Highlands and the heart of the 1745 Jacobite uprising and aftermath. (Summary by Wikipedia)

In stunning narrative poetry, the story begins during the time when Robert Bruce, Earl of Carrick has been hunted out of Scotland into exile by the English and their allies. Bruce returns over sea from the Island of Rachrin: but is forced to land close to hostile forces at Artonish Castle on the seacoast of Argylshire. Seeking refuge from tempestuous seas, Bruce begs shelter from Ronald, Lord of the Isles: inadvertently on the day of his marriage feast to the beautiful Edith of Lorn.<br><br /> Bruce's very presence is enough to interrupt the nuptials and to break up the festivities: the guests quickly polarise into two armed and equally matched factions: one ready to raise Bruce to the Scottish crown, the other ready to slay him for desecration and murder. The combatants are dispersed with no bloodshed only by the combined offices of Lord Ronald himself, aided by a visiting Abbot: whereupon Bruce quickly removes himself to first the Island of Sky, and then Ayrshire: raising the an army willing to rout the English and re-establish Scottish independence. <br><br /> Bruce begins to win a steady stream of victories as his armies march inevitably towards Bannockburn. There, Bruce confronts Scotland's formidable enemy - led by the son of the Hammer of the Scots: the English outnumbering the Scots by more than two to one. <br><br /> - Can Bruce - the so-called fugitive, traitor, and turn-coat - succeed against the massed might of England?<br> - Will the beautiful Edith choose to side with her blood-relations - who fight for England; or with Lord Ronald, her betrothed - who marches to battle behind Scotland's Bruce? <br /> (Introduction by Godsend)

13Ivanhoe NL

By Sir Walter Scott

Ivanhoe is een historische roman uit 1819 van Sir Walter Scott. Het verhaal speelt ten tijde van het bewind van koning Richard Leeuwenhart en handelt over de smeulende tegenstellingen tussen de Normandiërs en de Saksen in de eeuwen na de Normandische verovering. De historische juistheid van het verhaal werd al meteen na verschijning van het boek in twijfel getrokken en Scott gaf ook toe dat het zeer waarschijnlijk was "dat ik de gebruiken van twee of drie eeuwen heb verward", maar hij troostte zich ermee dat "de fouten van deze aard aan de meeste lezers voorbij zou gaan".

14Lady of the Lake

By Sir Walter Scott

The scene of the following Poem is laid chiefly in the vicinity of Loch Katrine, in the Western Highlands of Perthshire. The time of Action includes Six Days, and the transactions of each Day occupy a Canto. (Summary by William J. Rolfe, ed.)

15Rival Pitchers of Oakdale

By Morgan Scott

Play Ball!!! It's the start of another baseball season at Oakdale Academy. But there is a rivalry brewing between the pitchers. One wants to be a starting pitcher, but he is inconsistent. Another, a new kid from Texas, has been mentored by last year's starter, and is proving to have talent. And don't forget that starting pitcher from last season, he wants to continue to take the rubber for the team. This should prove to be an exciting season for the boys! (Summary by Ann Boulais)

LibriVox volunteers bring you eight readings of End of Harvest, by William Bell Scott. This is the fortnightly poetry project for November 9, 2014.

17Monastery

By Sir Walter Scott

Dame Elspeth is kept in a tower after the death of her husband. The widow of the Baron of Avenel and her daughter seek safety with Elspeth in her tower. Hearing the baroness's deathbed confession, Father Philip notices her Bible. As he carries it to the Lord Abbot, it is taken from him by a White Lady. A sub-prior investigates this story and finds that the Bible is now back in the owner's hands. Later, Elspeth's son sees the White Lady when he snatches the Bible from a flaming altar. Intrigue follows intrigue. Halbert and Sir Piercie Shafton fight, and Halbert flees, leaving Sir Piercie mortally wounded. Shafton, however, recovers only to be accused of murdering Edward's missing brother. Mysie helps Shafton escape from jail. Edward has vowed to become a monk at the urging of the White Lady. After a battle between English and Scottish soldiers against Sir John's troops, Mysie is declared a suitable wife for Sir Piercie. The monks are allowed to keep their monastery. Summary by Bill Boerst, based on Wikipedia

18In the Village of Viger

By Duncan Campbell Scott

These ten superb short stories of Duncan Campbell Scott, published in 1896, portray humorous, farcical, and tragic aspects of life in the fictional Quebec village of Viger. Scott’s tales of the lives and vicissitudes of Viger’s inhabitants include an established milliner who is upset by the appearance of a younger, more popular rival; an innkeeper whose obsession with the Franco-Prussian War drives him mad; and a strange peddler with a carefully guarded secret that is accidentally revealed. <br><br> Duncan Campbell Scott was born in Ottawa, Ontario, in 1862. He entered the civil service in 1879 and remained until his retirement in 1932. Scott was an honored, skilled and popular poet, short-story writer, and essayist. He died in Ottawa in 1947. <br><br> For more information see https://en.wikipedia.org/wiki/Duncan_Campbell_Scott. (Lee Smalley)

An aging minstrel seeks who hospitality at Newark Castle and in recompense tells a tale of a sixteenth-century Border feud. In the poem, Lady Margaret Scott of Buccleuch, the "Flower of Teviot" is beloved by Baron Henry of Cranstown an ally of the Ker Clan, but a deadly feud exists between the two border clans of Scott and Carr/Ker, which has resulted in the recent murder of Lady Margaret's father, Sir Walter Scott of Buccleuch by the Kers on the High Street in Edinburgh. Maragaret's widowed mother – Lady Janet – hates the Ker clan as a result, and is adamant in refusing her consent to any suggestion of marriage between the lovers. Summary by Wikipedia

20Woodstock, or, The Cavalier

By Sir Walter Scott

This novel is set during the English Civil War and the Commonwealth. It is comprised of real events, along with fictional ones. If you are looking for an adventure novel with romance and mystery, please look no further. This is Scott at his finest. - Summary by Stav Nisser.

A fun poem with a great rhythm . - Summary by Stav Nisser

22Black Dwarf

By Sir Walter Scott

The Black Dwarf is the first of the “Tales of My Landlord” series, which also includes The Bride of Lammermoor and The Heart of Midlothian. The third preliminary chapter depicts two horsemen arriving at the Wallace Inn in Gandercleugh, where one of the horsemen relates the tale. The story proper is set on the Scottish borders during the reign of Queen Anne. The Jacobite movement is in its infancy, but the inhabitants of this part of the country have enough to quarrel about without politics inciting them to it. Several families of high and low birth bear no good intentions to each other, and a weird, brooding dwarf, who wishes ill on all of humanity, seems to direct and perpetuate the mayhem from his lonely cottage on Mucklestane Moor. (tbragg)

23Marmion: A Tale of Flodden Field

By Sir Walter Scott

Marmion is an epic poem in six cantos, written in emulation of the ancient Scottish minstrel style which was of such great interest to Scott. Unlike its predecessor, The Lay of the Last Minstrel, this one contains "introductions" to each canto, in the guise of poetic letters which serve the purpose of linking the ancient historical setting with Scott's contemporaneous society - a device which attracted some criticism.<br></br>The story of Lord Marmion and his arch-enemy Harold de Wilton is told with Scott's familiar swirling dark flair, combining a complex tale of intrigue, inconstancy and deception with the historical details of the Battle of Flodden Field, in which the English forces routed those of Scotland, killing the Scottish king. - Summary by Peter Tucker

24Romance of Polar Exploration

By G. Firth Scott

While stories of the Polar explorers and their efforts to reach the Poles have been told again and again, the constant renewal of expeditions adds, every year, fresh incidents to the record, until it may almost be said that the fascination of the frozen regions is as inexhaustible as the list of Polar heroes is illimitable. Nor is the interest confined solely to the achievement of modern explorers. However great the results of their exertions may be, the fact that, in spite of all the advantages conferred by recent scientific discovery and modern appliances, the explorers of to-day have failed to penetrate the uttermost secrets of the worlds of ice, renders more impressively heroic the struggles of the earlier travellers, whose equipment, viewed in comparison with that of modern man, was apparently so inadequate and often inappropriate. <br></br> No series of Polar adventure stories would be complete without a prominent place being given to the earlier explorers, and especially to that British hero, Franklin, whose name is so inseparably associated with the history of Arctic exploration. The account of his daring voyages and of his tragic end, at the moment of victory, has already been given in many a form; but the tale is one which will stand re-telling for generations yet to come. In the present instance it has been of necessity briefly written, but in such a manner as will, it is hoped, without loss of interest, render clear a comparison of the conditions under which he and his brave companions worked and fought to their death, with those that existed for later expeditions and especially the expeditions of Nansen, Peary, and Abruzzi. <br></br> The Antarctic, equally with the Arctic, now commands the attention of man. In the South, as in the North, the British race has again produced explorers who have fought their way into the icy fastnesses. From the time that Captain Cook sailed round the unknown southern ocean, more than a century ago, the British flag has waved in the forefront of the advance. The work which Sir James Ross began, over half a century since, has now been carried farther than ever it was anticipated it could be. By the voyage of the Discovery, the Antarctic continent has been revealed to within five hundred miles of the Pole, and in the gallant exploits of the commander, Captain Robert Scott, there are many who see a repetition of all that made the name of Franklin so immortal. <br></br> The source of the information on which these stories are based (as is frequently mentioned in the text) is the personal narrative of the explorer concerned, where available; and if the interest aroused in any of them requires more to satisfy it than the exigencies of space renders possible in this volume, the attention which will thereby be drawn to the more comprehensive records will stand as a slight acknowledgment of the indebtedness of the writer of these re-told stories to the authors of the original narratives. - Summary by the Preface

25Bride of Lammermoor

By Sir Walter Scott

An historical novel by Sir Walter Scott, part of the Tales of My Landlord series, published anonymously in 1819. Based on a true story, it is set in south-east Scotland and (in this edition) in the reign of Queen Anne, after the 1707 Acts of Union which joined Scotland and England. It tells of a tragic love affair between young Lucy Ashton and Edgar Ravenswood, her family's enemy. Lady Ashton sets out to end their engagement and make Lucy marry a man better placed politically. - Summary by Gillian Hendrie

Ivanhoe ist ein 1820 publizierter Roman von Sir Walter Scott und zugleich der Name der Hauptperson des Romans, des Kreuzritters Sir Wilfred of Ivanhoe.<br><br> Die Geschichte thematisiert die Rivalitäten in England zwischen Angelsachsen und Normannen nach dem Sieg Wilhelms des Eroberers sowie die Spätfolgen der Kreuzzüge mit der Geiselnahme des englischen Königs Richard Löwenherz in Österreich. Ebenso sind die zur Zeit der Handlung existierenden Vorurteile gegenüber Juden dargestellt. Robin Hood tritt unter dem Namen „Locksley“ in Erscheinung. Die normannischen Gegenspieler Ivanhoes tragen französische Namen, weil der Adel Englands damals noch Französisch sprach (Brian de Bois-Guilbert, Maurice de Bracy, Philippe de Malvoisin, Ralph de Vipont, Reginald Front-de-Boeuf Herr von Torquilstone). In Abwesenheit König Richards stützt sich dessen jüngerer Bruder Johann Ohneland auf die Macht dieser normannischen Ritter und Barone. Gegensätze zur düsteren Gestalt des normannischen Tempelritters Bois-Guilbert bilden der Held Ivanhoe und die tragische Rolle der Rebekka. - Summary by Wikipedia

27Legend of Montrose

By Sir Walter Scott

A Legend of Montrose is one of Sir Walter Scott's <i>Tales of my Landlord</i>. It is set in the tumultuous 17th century during the Earl of Montrose's military campaign in Scotland. Allan M'Aulay and his friend Lord Menteith both serve in Montrose's army, together with the loose cannon Dugald Dalgetty. The friends are also both in love with Annot Lyle, a beautiful young lady of mysterious heritage. Will they all make it through the war, and which of the friends will Annot finally choose? - Summary by Carolin

28Guy Mannering, or, The Astrologer

By Sir Walter Scott

Guy Mannering is a young astrologer, just down from Oxford. While travelling in Scotland, he loses his way and unexpectedly comes to stay at Ellangowan, just as the son of Godfrey Bertram is born. Guy Mannering consults the stars to tell the fortune of the new-born, but as the boy is destined to face much danger in his life, Mannering decides not to alarm the new parents just yet. He seals his predictions in a letter and instructs Betram to open it when the boy is five years old. But even a learned astrologer could not have foreseen how the fates of Guy Mannering and the Bertram family are intertwined.. - Summary by Carolin

29Fair Maid of Perth, Or, St. Valentine's Day

By Sir Walter Scott

Henry Gow has fallen in love with the Fair Maid of Perth, Catherine, the glovemaker's daughter. To make sure that he would be the first person she sees on Valentine's day, he walks to her house at the break of dawn, and arrives - just in time to save her from am attempted kidnapping. Henry acts immediately to save her, but the attackers are not just some ruffians but well-born and well-connected. Henry and Catherine are drawn into the games and intrigues of the nobility, with little choice but to play along.. - Summary by Carolin

30Anne of Geierstein, Volume 1

By Sir Walter Scott

Anne of Geierstein, or The Maiden of the Mist (1829) is a novel by Sir Walter Scott. It is set in Central Europe, mainly in Switzerland, shortly after the Yorkist victory at the Battle of Tewkesbury (1471). It covers the period of Swiss involvement in the Burgundian Wars. (Wikipedia)

31Anne of Geierstein, Volume 2

By Sir Walter Scott

Anne of Geierstein, or The Maiden of the Mist (1829) is an adventure and romance novel by Sir Walter Scott. It is set in Central Europe, mainly in Switzerland, shortly after the Yorkist victory at the Battle of Tewkesbury (1471). It covers the period of Swiss involvement in the Burgundian Wars. ( Wikipedia ) </p>

32Journals of Robert Falcon Scott; Volume 1 of 'Scott's Last Expedition' (Version 2)

By Robert Falcon Scott

Captain Scott’s ill-fated journey to the Antarctic Pole in 1911 is part triumph, part tragedy – but also a mythic adventure story which has inspired books, articles, and films over the generations. As so often in such cases the ‘truth’ of the explorers’ experiences (and there were many important figures in the party besides Scott) is much more rich, varied, and fascinating than the boy scout stereotype. Few know for example how much time during the many months of the journey were spent in scientific researches which remain of huge value to this day. But what comes across most vividly in Scott’s fascinating and finally very moving diary account is the complexity of the man and his closest comrades who reached the Pole fatally too late (the Norwegian Amundsen has beaten them to it by many weeks), then died trekking home, facing tortuous weather conditions, dwindling food supplies, and that gnawing, bitter sense of defeat. Ironically Robert Falcon Scott is now far more famous than Amundsen: his triumph secured by history and by myth. For if Scott was finally an imperfect explorer, he was the perfect author of his own amazing tale. Scott’s account is introduced by Clements R. Markham, president of the Royal Geographical Society at the time of the expedition; and concluded by E.L. Atkinson, a member of Scott’s party and leader of the relief expedition which found the bodies of Scott and his comrades some months after their death in November 1912. - Summary by Steve Gough

33End Of The Day

By Duncan Campbell Scott

LibriVox volunteers bring you 13 recordings of The End Of The Day by Duncan Campbell Scott. This was the Weekly Poetry project for February 23, 2020. <br> ------<br> Duncan Campbell Scott CMG FRSC was a Canadian bureaucrat, poet and prose writer. With Charles G.D. Roberts, Bliss Carman, and Archibald Lampman, he is classed as one of Canada's Confederation Poets. - Summary by Wikipedia

34Night in March

By Duncan Campbell Scott

LibriVox volunteers bring you 8 recordings of A Night in March by Duncan Campbell Scott.<br> This was the Fortnightly Poetry project for March 1, 2020. <br> ------<br> Hopefully this Fortnightly poem will encourage spring to arrive. - Summary by David Lawrence

35Description of Millenium Hall and the Country Adjacent

By Sarah Scott

Utopian novel by Sarah Scott, published in 1762 describes women living in complete harmony. Summary by kathrinee

36Heart of Mid-Lothian

By Sir Walter Scott

An historical novel set in Scotland in 1736, involving a riot and surrounding drama. - Summary by Deon Gines

37Redgauntlet

By Sir Walter Scott

Redgauntlet is an historical novel about a fictitious third Jacobite rebellion. It takes place mostly in Dumfriesshire, Scotland, in 1765. It is thought to be the most autobiographical of Scott's novels. - Summary by Deon Gines

38Surgeon's Daughter

By Sir Walter Scott

The Surgeon's Daughter is an historical novel, originally part of the Chronicles of the Canongate stories, later published on its own, in 1827. - Summary by Deon Gines

Quentin Durward is a historical novel set in the mid-1400's. The main character is a Scottish archer serving French King Louis XI, another main character. - Summary by Deon Gines