Datasets:

DeepDelve

/

AI-related-documents

like 0

Typical performance of gallager-type error-correcting codes

Physical Review Letters

The performance of Gallager’s error-correcting code is investigated via methods of statistical physics. In this approach, the transmitted codeword comprises products of the original message bits selected by two randomly constructed sparse matrices; the number of nonzero row/column elements in these matrices constitutes a family of codes. We show that Shannon’s channel capacity is saturated for many of the codes while slightly lower performance is obtained for others which may be of higher practical relevance. Decoding aspects are considered by employing the Thouless-Anderson-Palmer approach which is identical to the commonly used belief-propagation-based decoding. © 2000 American Physical Society.

["Kabashima Y.", "Murayama T.", "Saad D."]

["7004020076", "7201386389", "7006268913"]

[]

10.1103/PhysRevLett.84.1355

Article

English

[{"id": "60031126", "name": "Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, Yokohama, 2268502, Japan", "fullName": "Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology", "reference": "a", "fullAddress": "Yokohama, 2268502, Japan", "departmentId": "104582056"}, {"id": "60014551", "name": "Neural Computing Research Group, Aston University, Birmingham, B4 7ET, United Kingdom", "fullName": "Neural Computing Research Group, Aston University", "reference": "b", "fullAddress": "Birmingham, B4 7ET, United Kingdom", "departmentId": "103754498"}]

The Constrained Control of Force and Position by Multilink Manipulators

IEEE Transactions on Systems, Man and Cybernetics

The efficiency of a manipulator with actuators in each single joint can be improved considerably (up to a factor of 2) by adding actuators that act over more than a single joint. Even though this creates a redundancy of the manipulator, the efficient control of force and position of the manipulator end point induces a constraint, which eliminates (part of) the redundancy. It is demonstrated that an efficient control requires that monoarticular actuators contribute positive work to the total work done by the manipulator. Without biarticular actuators this requirement cannot be met and some monoarticular actuators will dissipate work delivered by other actuators. The role of biarticular actuators is to transfer the mechanical output (work or torque) of some monoarticular actuators to another joint. © 1992 IEEE

["Gielen C.C.A.M."]

["7005550381"]

[]

10.1109/21.179862

Article

English

[{"id": null, "name": "Department of Medical Physics and Biophysics, Geert Grooteplein Noord 21, NL, 6525, EZ Nijmegen, United States", "fullName": "Department of Medical Physics and Biophysics", "reference": "a", "fullAddress": "Geert Grooteplein Noord 21, NL, 6525, EZ Nijmegen, United States", "departmentId": null}, {"id": "115727548", "name": "Faculty of Human Movement Sciences, Free University van der Boechorststraat 9, NL, 1081, Netherlands", "fullName": "Faculty of Human Movement Sciences, Free University van der Boechorststraat 9", "reference": "b", "fullAddress": "NL, 1081, Netherlands", "departmentId": "115727643"}]

Fermionic molecular dynamics

Nuclear Physics, Section A

A new type of molecular dynamics is proposed to solve approximately the many-body problem of interacting identical fermions with spin 1 2. The interacting system is represented by an antisymmetrized many-body wave function consisting of single-particle states which are localized in phase space. The equations of motion for the parameters characterizing the many-body state (e.g. positions, momenta and spin of the particles) are derived from a quantum variational principle. The proposed fermionic molecular dynamics (FMD) model is illustrated with the help of two examples. © 1990.

["Feldmeier H."]

["56234608700"]

[]

10.1016/0375-9474(90)90328-J

Article

English

[{"id": "60008155", "name": "GSI, Gesellschaft für Schwerionenforschung mbH, D-6100 Darmsladt, Postfach 110552, Germany", "fullName": "GSI, Gesellschaft für Schwerionenforschung mbH", "reference": "a", "fullAddress": "D-6100 Darmsladt, Postfach 110552, Germany", "departmentId": null}]

Monte Carlo simulation of hard spheroids

Chemical Physics Letters

We present Monte Carlo simulations of the equation of state and radial distribution function for a model fluid composed of hard spheroids. © 1984.

["Perram J.W.", "Wertheim M.S.", "Lebowitz J.L.", "Williams G.O."]

["56630133300", "6701681683", "7101843149", "56770564800"]

[]

10.1016/0009-2614(84)85029-0

Article

English

[{"id": "60119141", "name": "Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, United States", "fullName": "Department of Mathematics, Rutgers University", "reference": "a", "fullAddress": "New Brunswick, NJ 08903, United States", "departmentId": "123158424"}, {"id": "60119141", "name": "Departments of Mathematics and Physics, Rutgers University, New Brunswick, NJ 08903, United States", "fullName": "Departments of Mathematics and Physics, Rutgers University", "reference": "b", "fullAddress": "New Brunswick, NJ 08903, United States", "departmentId": "123250410"}, {"id": "60021784", "name": "Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, 251 Mercer Street, United States", "fullName": "Courant Institute of Mathematical Sciences, New York University", "reference": "c", "fullAddress": "New York, NY 10012, 251 Mercer Street, United States", "departmentId": null}]

On the Toda criterion

Chaos, Solitons and Fractals

Using the path-integral formulation of classical mechanics, we present a further study of the Toda Criterion. This is an approximate criterion to detect local transitions from ordered to stochastic/ergodic motion or viceversa. We analyze the criterion by studying those minima of the classical path-integral weight that are not invariant under a universal supersymmetry present in any classical Hamiltonian system. This analysis relies on a theorem, that we previously proved, which says that systems which are in a phase with this supersymmetry un-broken are also in the ergodic phase, while systems which are in a phase characterized by ordered motion always have, in that phase, the supersymmetry broken. This study confirms that the Toda Criterion is neither a sufficient nor a necessary condition for the transition from ordered to stochastic motion. In the conclusions some ideas are put forward to find a true criterion based on our supersymmetry. © 1992.

["Gozzi E.", "Reuter M.", "Thacker W.D."]

["6603841427", "7202272563", "7005960068"]

[]

10.1016/0960-0779(92)90019-J

Article

English

[{"id": "60018363", "name": "Dipartimento di Fisica Teorica, Universita' di Trieste, Italy", "fullName": "Dipartimento di Fisica Teorica, Universita' di Trieste", "reference": "a", "fullAddress": "Italy", "departmentId": "103942137"}, {"id": "60114764", "name": "INFN sezione di Trieste, Italy", "fullName": "INFN sezione di Trieste", "reference": "b", "fullAddress": "Italy", "departmentId": null}, {"id": "60030635", "name": "DESY, D- W-2000 Hamburg 52, Notkestrasse 85, Germany", "fullName": "DESY", "reference": "c", "fullAddress": "D- W-2000 Hamburg 52, Notkestrasse 85, Germany", "departmentId": null}, {"id": "60028590", "name": "Dept. of Science and Mathematics, Parks College, Saint Louis University, Cahokia, IL 62206, United States", "fullName": "Dept. of Science and Mathematics, Parks College, Saint Louis University", "reference": "d", "fullAddress": "Cahokia, IL 62206, United States", "departmentId": "104447132"}]

Lower bound for accessible information in quantum mechanics

Physical Review A

It has long been known that the von Neumann entropy S is an upper bound on the information one can extract from a quantum system in an unknown pure state. In this paper we define the ''subentropy'' Q, which we prove to be a lower bound on this information. Moreover, just as the von Neumann entropy is the best upper bound that depends only on the density matrix, we show that Q is the best lower bound that depends only on the density matrix. Other parallels between S and Q are also demonstrated. © 1994 The American Physical Society.

["Jozsa R.", "Robb D.", "Wootters W.K."]

["7004414214", "12242258900", "6701914178"]

[]

10.1103/PhysRevA.49.668

Article

English

[{"id": "60009507", "name": "Département d' Informatique et de Recherche Opérationelle, Université de Montréal, Montréal, Que. H3C 3J7, Case Postale 6128, Succursale A, Canada", "fullName": "Département d' Informatique et de Recherche Opérationelle, Université de Montréal", "reference": "a", "fullAddress": "Montréal, Que. H3C 3J7, Case Postale 6128, Succursale A, Canada", "departmentId": "103521417"}, {"id": "60013372", "name": "Department of Physics, University of Texas at Austin, Austin, TX 78712, United States", "fullName": "Department of Physics, University of Texas at Austin", "reference": "b", "fullAddress": "Austin, TX 78712, United States", "departmentId": "100248133"}, {"id": "60021497", "name": "Department of Physics, Williams College, Williamstown, MA 01267, United States", "fullName": "Department of Physics, Williams College", "reference": "c", "fullAddress": "Williamstown, MA 01267, United States", "departmentId": "104100333"}]

Universally first return continuous functions

Proceedings of the American Mathematical Society

It is known that the first return continuous functions are precisely the Darboux functions in Baire class 1, and that every such function can be changed via a homeomorphism into an approximately continuous function. Here we give two characterizations of the smaller class of universally first return continuous functions, one of which is the capacity of changing such a function via a homeomorphism into an approximately continuous function which is continuous almost everywhere. © 1995 American Mathematical Society.

["Darji U.B.", "Evans M.J.", "O’malley R.J."]

["6602390438", "56316936700", "16473837000"]

["A.E. Topology", "Approximate continuity", "Baire class one", "Darboux", "First return continuity"]

10.1090/S0002-9939-1995-1233966-9

Article

English

[{"id": "60004923", "name": "epartment of Mathematics, North Carolina State University, Raleigh, NC, 27695-8205, United States", "fullName": "epartment of Mathematics, North Carolina State University", "reference": "a", "fullAddress": "Raleigh, NC, 27695-8205, United States", "departmentId": null}, {"id": "60020633", "name": "Department of Mathematics, University of Louisville, Louisville, KY, 40292, United States", "fullName": "Department of Mathematics, University of Louisville", "reference": "b", "fullAddress": "Louisville, KY, 40292, United States", "departmentId": "112906489"}, {"id": "60023603", "name": "Department of Mathematics, Washington and Lee University, Lexington, 24450, United States", "fullName": "Department of Mathematics, Washington and Lee University", "reference": "c", "fullAddress": "Lexington, 24450, United States", "departmentId": "110239523"}, {"id": "60019909", "name": "Department of Mathematical Sciences, University of Wisconsin- Milwaukee, Milwaukee, WI, 53201, United States", "fullName": "Department of Mathematical Sciences, University of Wisconsin- Milwaukee", "reference": "d", "fullAddress": "Milwaukee, WI, 53201, United States", "departmentId": "112202921"}]

Triviality bounds in two-doublet models

Physics Letters B

We examine perturbatively the two-Higgs-doublet extension of the standard model in the context of the suspected triviality of theories with fundamental scalars. Requiring the model to define a consistent effective theory for scales below a cutoff of 2π times the largest mass of the problem, as motivated by lattice investigations of the one-Higgs-doublet model, we obtain combined bounds for the parameters of the model. We find upper limits of 470 GeV for the mass of the light CP-even neutral scalar and 650-700 GeV for the other scalar masses. © 1993.

["Kominis D.", "Sekhar Chivukula R."]

["6506451664", "7003735713"]

[]

10.1016/0370-2693(93)91415-J

Article

English

[{"id": "60019674", "name": "Department of Physics, Boston University, Boston, MA 02215, 590 Commonwealth Avenue, United States", "fullName": "Department of Physics, Boston University", "reference": "a", "fullAddress": "Boston, MA 02215, 590 Commonwealth Avenue, United States", "departmentId": "105360300"}]

K-groups associated with substitution minimal systems

Israel Journal of Mathematics

Two ordered Bratteli diagrams can be constructed from an aperiodic substitution minimal dynamical system. One, the proper diagram, has a single maximal path and a single minimal path and the Vershik map on the path space can be extended homeomorphically to a map conjugate to the substitution system. The other, the improper diagram, encodes the substitution more naturally but often has many maximal and minimal paths and no continuous compact dynamics. This paper connects the two diagrams by considering their K₀-groups, obtaining the equation {Mathematical expression} where Q and ν can be determined from the combinatorial properties of the substitution. This allows several examples of substitution sequences to be distinguished at the level of strong orbit equivalence. A final section shows that every dimension group with unit which is a stationary limit of ℤⁿ groups can be represented as a K⁰ group of some substitution minimal system. Also every stationary proper minimal ordered Bratteli diagram has a Vershik map which is either Kakutani equivalent to a d-adic system or is conjugate to a substitution minimal system. The equation above applies to a much wider class which includes those minimal transformations which can be represented as a path-sequence dynamical system on a Bratteli diagram with a uniformly bounded number of vertices in each level. © 1997 Hebrew University.

["Forrest A.H."]

["24786456600"]

[]

10.1007/BF02937330

Article

English

[{"id": "60027272", "name": "The Department of Mathematics and Statistics, The University of Edinburgh, Edinburgh, EH9 3JZ, The King's Buildings, United Kingdom", "fullName": "The Department of Mathematics and Statistics, The University of Edinburgh", "reference": "a", "fullAddress": "Edinburgh, EH9 3JZ, The King's Buildings, United Kingdom", "departmentId": "105161365"}]

On quantum statistical mechanics of non-Hamiltonian systems

Reports on Mathematical Physics

An axiomatic definition of time evolution (dynamical semi-group) of a physical system has been given. A dynamical semi-group is defined as a one-parametersemi-group of linear endomorphisms of the set of all density operators corresponding to the physical system in question. Some classes of dynamical semi-groups (quantum Poisson and Brownian processes) induced by Markov processes on topological groups are described. Examples of dynamical semi-groups for the harmonic oscillator are given. © 1972.

["Kossakowski A."]

["6701508802"]

[]

10.1016/0034-4877(72)90010-9

Article

English

[{"id": "60021858", "name": "Institute of Physics, Nicholas Copernicus University, Toruń, Poland", "fullName": "Institute of Physics, Nicholas Copernicus University", "reference": "a", "fullAddress": "Toruń, Poland", "departmentId": "109179638"}]

Non-linear data structure extraction using simple hebbian networks

Biological Cybernetics

We present a class a neural networks algorithms based on simple hebbian learning which allow the finding of higher order structure in data. The neural networks use negative feedback of activation to selforganise; such networks have previously been shown to be capable of performing principal component analysis (PCA). In this paper, this is extended to exploratory projection pursuit (EPP), which is a statistical method for investigating structure in high-dimensional data sets. As opposed to previous proposals for networks which learn using hebbian learning, no explicit weight normalisation, decay or weight clipping is required. The results are extended to multiple units and related to both the statistical literature on EPP and the neural network literature on non-linear PCA. © 1995 Springer-Verlag.

["Fyfe C.", "Baddeley R."]

["14041684300", "7005844911"]

[]

10.1007/BF00199896

Article

English

[{"id": "60024724", "name": "Department of Computer Science, University of Strathclyde, United Kingdom", "fullName": "Department of Computer Science, University of Strathclyde", "reference": "a", "fullAddress": "United Kingdom", "departmentId": "104246876"}, {"id": "60026851", "name": "Department of Experimental Psychology, University of Oxford, Oxford, OX1 3UD, South Parks Rd, United Kingdom", "fullName": "Department of Experimental Psychology, University of Oxford", "reference": "b", "fullAddress": "Oxford, OX1 3UD, South Parks Rd, United Kingdom", "departmentId": "113097821"}]

Strategic experimentation

Econometrica

This paper extends the classic two-armed bandit problem to a many-agent setting in which N players each face the same experimentation problem. The main change from the single-agent problem is that an agent can now learn from the current experimentation of other agents. Information is therefore a public good, and a free-rider problem in experimentation naturally arises. More interestingly, the prospect of future experimentation by others encourages agents to increase current experimentation, in order to bring forward the time at which the extra information generated by such experimentation becomes available. The paper provides an analysis of the set of stationary Markov equilibria in terms of the free-rider effect and the encouragement effect.

["Bolton P.", "Harris C."]

["35963222300", "7403875952"]

["Encouragement effect", "Free-rider problem", "Informational public good", "Multi-agent two-armed bandit"]

10.1111/1468-0262.00022

Article

English

[]

A spectral approach to lower bounds with applications to geometric searching

SIAM Journal on Computing

We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requires Ω(n log n) additions and subtractions. This is the first nontrivial lower bound for range searching over a group. By contrast, range searching over a semigroup (which forbids subtractions) is almost completely understood. Our proof has two parts. First, we develop a general, entropy-based method for relating the linear circuit complexity of a linear map A to the spectrum of A^top;A. In the second part of the proof, we design a "high-spectrum" geometric set system for halfplane range searching and, using techniques from discrepancy theory, we estimate the median eigenvalue of its associated map. Interestingly, the method also shows that using up to a linear number of help gates cannot help; these are gates that can compute any bivariate function.

["Chazelle B."]

["7005144537"]

["Circuit complexity", "Eigenvalues", "Lower bounds", "Range searching"]

10.1137/S0097539794275665

Article

English

[{"id": "60003269", "name": "Department of Computer Science, Princeton University, Princeton, NJ 08544, United States", "fullName": "Department of Computer Science, Princeton University", "reference": "a", "fullAddress": "Princeton, NJ 08544, United States", "departmentId": null}]

Global Solvability on the Torus for Certain Classes of Operators in the Form of a Sum of Squares of Vector Fields

Journal of Differential Equations

["Petronilho G."]

["6602531166"]

[]

10.1006/jdeq.1997.3407

Article

English

[{"id": "60013792", "name": "Departamento de Matemática, Univ. Federal Sao Carlos, Sao Carlos, Sao Paulo, 13565-905, Rodovia Washington Luiz, Km 235, Brazil", "fullName": "Departamento de Matemática, Univ. Federal Sao Carlos", "reference": "a", "fullAddress": "Sao Carlos, Sao Paulo, 13565-905, Rodovia Washington Luiz, Km 235, Brazil", "departmentId": "103715710"}]

Smooth detectors of linear phase

Inverse Problems

Functions with (linear) phase depend on (linear) combinations of the independent variables. For example plane waves are functions of a single linear combination of the variables. Detection of phase is an important problem in seismic velocity analysis and ocean acoustic signal processing, amongst other applications. Robust estimation of phase by local optimization requires the construction of smooth objective functional. For this purpose it is useful to characterize those quadratic functionals of functions with linear phase which are smooth in the phase: all such smooth phase detectors are pseudodifferential. Some of these pseudodifferential quadratic forms are globally convex in the phase, hence permit phase estimation using local smooth optimization methods.

["Kim S.", "Symes W.W."]

["13007103400", "7004264390"]

[]

10.1088/0266-5611/14/1/010

Article

English

[{"id": "60015941", "name": "Department of Mathematics, University of Kentucky, Lexington, KY 40506-0027, United States", "fullName": "Department of Mathematics, University of Kentucky", "reference": "a", "fullAddress": "Lexington, KY 40506-0027, United States", "departmentId": "108257461"}, {"id": "60005286", "name": "Dept. of Computational Mathematics, Rice University, Houston, TX 77005-1892, United States", "fullName": "Dept. of Computational Mathematics, Rice University", "reference": "b", "fullAddress": "Houston, TX 77005-1892, United States", "departmentId": "109957618"}]

Priority of free recall of newly learned items

Journal of Verbal Learning and Verbal Behavior

Data are presented from three independently conducted free-recall experiments, representing a variety of procedures and learning materials, which demonstrate that newly-learned items tend to be recalled prior to those items which have been recalled correctly on previous trials, in sharp contrast with the widespread assumption that order of free recall directly reflects item strength. © 1965 Academic Press Inc. All rights reserved.

["Battig W.F.", "Allen M.", "Jensen A.R."]

["6506966189", "55447386400", "7403021170"]

[]

10.1016/S0022-5371(65)80017-2

Article

English

[{"id": "60020304", "name": "University of Maryland, College Park, MD, United States", "fullName": "University of Maryland", "reference": "a", "fullAddress": "College Park, MD, United States", "departmentId": null}, {"id": "60022659", "name": "University of Connecticut, Storrs, CT, United States", "fullName": "University of Connecticut", "reference": "b", "fullAddress": "Storrs, CT, United States", "departmentId": null}, {"id": "60025038", "name": "University of California, Berkeley, CA, United States", "fullName": "University of California", "reference": "c", "fullAddress": "Berkeley, CA, United States", "departmentId": null}]

A Consensus Conference Without Our Consensus

Psychological Inquiry

["Abramson L.Y.", "Alloy L.B."]

["7005485502", "7003600100"]

[]

10.1207/s15327965pli0303_2

Article

English

[{"id": "60032179", "name": "Department of Psychology, University of Wisconsin, Madison, WI 53706, W. J. Brogden Building, 1202 West Johnson Street, United States", "fullName": "Department of Psychology, University of Wisconsin", "reference": "a", "fullAddress": "Madison, WI 53706, W. J. Brogden Building, 1202 West Johnson Street, United States", "departmentId": "108382218"}, {"id": "60030398", "name": "Temple University, United States", "fullName": "Temple University", "reference": "b", "fullAddress": "United States", "departmentId": null}]

Demand management: The evaluation of price and due date negotiation strategies using simulation

Production and Operations Management

The research considers the problem of demand management in a firm where the firm's historical delivery service level reputation influences the number of quotation requests from its potential customers. Customers have a maximum and the firm has a minimum net price to due date tradeoff curve for each job. The demand management function bargains with the customer over price and promised due date. Bargaining finishes either with an agreed price and delivery date or with the customer refusing the firm's bid and placing the order elsewhere. The firm's objective is to maximize its long-term net revenue. The firm's demand management negotiation strategy guides this bidding process. The research demonstrates the use of simulation to test different demand management bidding and negotiation strategies for different market and firm scenarios. The demonstration uses 16 scenarios to test the different demand management negotiation strategies with a model of a classical job shop in a classical market. The investigation examines finite scheduling-based due date estimation methods, as well as the more traditional parameter-based methods. This demonstration shows that it is possible to test different bidding policies, using a simulation model of a firm and its customers, and to obtain usable results.

["Moodie D.R."]

["7102297213"]

["Demand management", "Due dates"]

10.1111/j.1937-5956.1999.tb00367.x

Article

English

[{"id": "60016536", "name": "School of Business and Economics, Michigan Technological University, Houghton, MI 49931-1295, United States", "fullName": "School of Business and Economics, Michigan Technological University", "reference": "a", "fullAddress": "Houghton, MI 49931-1295, United States", "departmentId": "103852709"}]

An evaluation tool for advanced traffic information and management systems in urban networks

Transportation Research Part C

Tools for evaluating traffic networks under information supply are a crucial necessity in view of the ATMS/ATIS systems being proposed and implemented around the world as part of Intelligent Vehicle-Highway Systems of the future. This paper presents an evaluation model that incorporates the driver response to information, the traffic flow behavior, and the resulting changes in the characteristics of network paths, into an integrated simulation framework. The model is based on simulating individual vehicle movements according to macroscopic flow principles, the driver path selection behavior under information being explicitly modelled. Detailed modelling of intersection delays as well as a variety of traffic control options for both freeways and arterials are performed. The path-processing component is designed for efficient application of the framework to large and realistic networks. The model can be effectively used for studying alternative information supply and traffic control strategies under various levels of market penetration of in-vehicle ATIS hardware. The paper also discusses its application to candidate networks. © 1994.

["Jayakrishnan R.", "Mahmassani H.S.", "Hu T.-Y."]

["7003658815", "7006887002", "7202704609"]

[]

10.1016/0968-090X(94)90005-1

Article

English

[{"id": "60007278", "name": "Civil and Environmental Engineering, University of California at Irvine, Irvine, CA 92717, United States", "fullName": "Civil and Environmental Engineering, University of California at Irvine", "reference": "a", "fullAddress": "Irvine, CA 92717, United States", "departmentId": "103403000"}, {"id": "60013372", "name": "Civil Engineering, University of Texas at Austin, Austin, TX 78712, United States", "fullName": "Civil Engineering, University of Texas at Austin", "reference": "b", "fullAddress": "Austin, TX 78712, United States", "departmentId": "105303309"}]

Chatoyant: A computer-aideddesign tool for free-space optoelectronic systems

Applied Optics

Chatoyant is a tool for the simulation and the analysis of heterogeneous free-space optoelectronic architectures. It is capable of modeling digital and analog electronic and optical signal propagation with mechanical tolerancing at the system level. We present models for a variety of optoelectronic devices and results that demonstrate the system’s ability to predict the effects of various component parameters, such as detector geometry, and system parameters, such as alignment tolerances, on system-performance measures, such as the bit-error rate. © 1998 Optical Society of America.

["Levitan S.P.", "Kurzweg T.P.", "Marchand P.J.", "Rempel M.A.", "Chiarulli D.M.", "Martinez J.A.", "Bridgen J.M.", "Fan C.", "McCormick F.B."]

["7006340623", "6701854634", "7101914643", "35779025800", "7003686620", "56693008900", "35777520400", "7402657009", "57214022648"]

[]

10.1364/AO.37.006078

Article

English

[{"id": "60015543", "name": "Department of Electrical Engineering, University of Pittsburgh, Pittsburgh, PA, 15261, United States", "fullName": "Department of Electrical Engineering, University of Pittsburgh", "reference": "a", "fullAddress": "Pittsburgh, PA, 15261, United States", "departmentId": "112351007"}, {"id": "60015543", "name": "Department of Computer Science, University of Pittsburgh, Pittsburgh, PA, 15261, United States", "fullName": "Department of Computer Science, University of Pittsburgh", "reference": "b", "fullAddress": "Pittsburgh, PA, 15261, United States", "departmentId": "109519735"}, {"id": "60030612", "name": "Department of Electrical and Computer Engineering, University of California, San Diego, CA, 92093, United States", "fullName": "Department of Electrical and Computer Engineering, University of California", "reference": "c", "fullAddress": "San Diego, CA, 92093, United States", "departmentId": null}, {"id": "60087783", "name": "Call/Recall Inc, San Diego, CA, 92121, 6160 Lusk Boulevard, Suite C-206, United States", "fullName": "Call/Recall Inc", "reference": "d", "fullAddress": "San Diego, CA, 92121, 6160 Lusk Boulevard, Suite C-206, United States", "departmentId": null}]

Recursive bayesian estimation using gaussian sums

Automatica

The Bayesian recursion relations which describe the behavior of the a posteriori probability density function of the state of a time-discrete stochastic system conditioned on available measurement data cannot generally be solved in closed-form when the system is either non-linear or nongaussian. In this paper a density approximation involving convex combinations of gaussian density functions is introduced and proposed as a meaningful way of circumventing the difficulties encountered in evaluating these relations and in using the resulting densities to determine specific estimation policies. It is seen that as the number of terms in the gaussian sum increases without bound, the approximation converges uniformly to any density function in a large class. Further, any finite sum is itself a valid density function unlike many other approximations that have been investigated. The problem of determining the a posteriori density and minimum variance estimates for linear systems with nongaussian noise is treated using the gaussian sum approximation. This problem is considered because it can be dealt with in a relatively straightforward manner using the approximation but still contains most of the difficulties that one encounters in considering non-linear systems since the a posteriori density is nongaussian. After discussing the general problem from the point-of-view of applying gaussian sums, a numerical example is presented in which the actual statistics of the a posteriori density are compared with the values predicted by the gaussian sum and by the Kalman filter approximations. © 1971.

["Sorenson H.W.", "Alspach D.L."]

["7004164550", "7004067054"]

[]

10.1016/0005-1098(71)90097-5

Article

English

[{"id": "60030612", "name": "Department of the Aerospace and Mechanical Engineering Sciences, University of California at San Diego, La Jolla, CA 92037, United States", "fullName": "Department of the Aerospace and Mechanical Engineering Sciences, University of California at San Diego", "reference": "a", "fullAddress": "La Jolla, CA 92037, United States", "departmentId": "105194570"}, {"id": "60009226", "name": "United States", "fullName": null, "reference": "b", "fullAddress": "United States", "departmentId": "112998778"}]

Nonmanipulable multi-valued social decision functions

Public Choice

Logically satisfactory methods for narrowing the range of social choice can be designed. For example, the SDF which transforms (S, R) into P(S, R), that is, the Pareto rule, satisfies all the conditions imposed on C(·) in Theorem 9: The Pareto rule is normal. For if x ∈ P(S, R) and y ∈ S, then y cannot be Pareto superior to x; so x ∈ P({x, y}, R), and α2 is satisfied. If x ∈ S and x ∈ P({x, y}, R) for all y ∈ S, no y in S is Pareto superior to x, and therefore, x ∈ P(S, R); so γ2 is satisfied. The Pareto rule is clearly neutral and anonymous; it is unbiased among the alternatives and among the individuals. The Pareto rule is obviously non-imposed. The Pareto rule is nonmanipulable. For if xP_iy, P({x, y}, R) must be either {x} or {x, y}. If P({x, y}, R) = {x, y}, there is an individual j ≠ i for whom yR_jx. Consequently no misrepresentation by i can force y out of the set of optima, and therefore the rule is cheatproof. The significance of this paper is that any rule which is logically satisfactory (in the sense of the conditions of Theorem 9) must be bracketed between the maximal and Pareto rules. So those rules are especially important: they provide lower and upper bounds for completely satisfactory multi-valued SDFs. © 1979 Martinus Nijhoff b.v.

["Feldman A."]

["16068434800"]

[]

10.1007/BF00129525

Article

English

[{"id": "60011460", "name": "Department of Economics, Brown University, Providence, United States", "fullName": "Department of Economics, Brown University", "reference": "a", "fullAddress": "Providence, United States", "departmentId": "103613030"}, {"id": "60021918", "name": "Department of Economics, The University of Virginia, Charlottesville, United States", "fullName": "Department of Economics, The University of Virginia", "reference": "b", "fullAddress": "Charlottesville, United States", "departmentId": "104120589"}]

Chain formation in a model dipolar liquid: Computer simulation study

Journal of Physics Condensed Matter

We have performed molecular dynamics (MD) simulations along a low-temperature isotherm for a system of strongly dipolar elongated molecules. The model molecules are found to associate to form well defined chains; this association is induced by the dipolar interaction. The order parameters, the polarization and the average number of molecules in a chain have been calculated for a range of densities.

["Kachel A.", "Gburski Z."]

["6505829483", "6603675266"]

[]

10.1088/0953-8984/9/46/007

Article

English

[{"id": "60006225", "name": "Department of Physics, University of Silesia, 40-007, Katowice, Uniwersytecka 4, Poland", "fullName": "Department of Physics, University of Silesia", "reference": "a", "fullAddress": "40-007, Katowice, Uniwersytecka 4, Poland", "departmentId": "100265000"}]

Percentage points of a weighted kolmogorov-smirnov statistic

Communications in Statistics - Simulation and Computation

Let F and G be the cumulative distribution functions corresponding to two independent random variables. Define the shift function, ∆(x), by F(x)-G(x+∆(x)). Doksum and Sievers (1976) compared two confidence bands for ∆(x). The confidence band they found to be best requires the percentage points of a weighted form of the Kolmogorov-Smirnov statistic. The goal in this paper is to supply a table of some of the exact percentage points. © 1989, Taylor & Francis Group, LLC. All rights reserved.

["Wilcox R.R."]

["7202527113"]

["confidence band", "effect size", "shift function"]

10.1080/03610918908812756

Article

English

[{"id": "60029311", "name": "Dept of Psychology, University of Southern California, Los Angeles, CA 90089-1061, United States", "fullName": "Dept of Psychology, University of Southern California", "reference": "a", "fullAddress": "Los Angeles, CA 90089-1061, United States", "departmentId": "108194148"}]

Knot polynomials and generalized mutation

Topology and its Applications

The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the present paper is a generalization of Conway's mutation of knots and links. Instead of flipping a 2-strand tangle, one flips a many-string tangle to produce a generalized mutant. In the presence of rotational symmetry in that tangle, the result is called a "rotant". We show that if a rotant is sufficiently simple, then its Jones polynomial agrees with that of the original link. As an application, this provides a method of generating many examples of links with the same Jones polynomial, but different Alexander polynomials. Various other knot polynomials, as well as signature, are also invariant under such moves, if one imposes more stringent conditions upon the symmetries. Applications are also given to polynomials of satellites and symmetric knots. © 1989.

["Anstee R.P.", "Przytycki J.H.", "Rolfsen D."]

["6603040453", "6701336362", "6602580934"]

["Jones polynomial", "knot", "link", "link polynomial", "mutant", "signature", "skein"]

10.1016/0166-8641(89)90031-X

Article

English

[{"id": "60010365", "name": "Mathematics Department, University of British Columbia, Vancouver, BC V6T 1Y4, 121-1984 Mathematics Road, Canada", "fullName": "Mathematics Department, University of British Columbia", "reference": "a", "fullAddress": "Vancouver, BC V6T 1Y4, 121-1984 Mathematics Road, Canada", "departmentId": "103566531"}, {"id": "60013756", "name": "Warsaw University, Warsaw, Poland", "fullName": "Warsaw University", "reference": "b", "fullAddress": "Warsaw, Poland", "departmentId": null}, {"id": "60010365", "name": "University of British Columbia, Vancouver, BC V6T 1Y4, 121-1984 Mathematics Road, Canada", "fullName": "University of British Columbia", "reference": "c", "fullAddress": "Vancouver, BC V6T 1Y4, 121-1984 Mathematics Road, Canada", "departmentId": null}]

Global asymptotic stability results for multisector models of optimal growth under uncertainty when future utilities are discounted

Journal of Economic Theory

["Brock W.A.", "Majumdar M."]

["35319716100", "7007081721"]

[]

10.1016/0022-0531(78)90080-7

Article

English

[{"id": "60007776", "name": "University of Chicago, Chicago, Illinois 60637 and Cornell University, Ithaca, NY 14853, United States", "fullName": "University of Chicago, Chicago, Illinois 60637 and Cornell University", "reference": "a", "fullAddress": "Ithaca, NY 14853, United States", "departmentId": null}, {"id": "60007776", "name": "Cornell University, Ithaca, NY 14853, United States", "fullName": "Cornell University", "reference": "b", "fullAddress": "Ithaca, NY 14853, United States", "departmentId": null}]

LOCSCL: A program to statistically optimize local scaling of single-isomorphous-replacement and single-wavelength-anomalous-scattering data

Journal of Applied Crystallography

A new stand-alone program, LOCSCL, for anisotropic local scaling of single-isomorphous-replacement or single-wavelength-anomalous-scattering pairs of data sets is described. The program features statistical weighting of the least-squares fit of the scale factors, statistical optimization of the size of the local blocks of reciprocal-lattice points used for the fitting, and propagation of the scaling-error estimates for both |F| and |E| data.

["Blessing R.H."]

["7004863794"]

[]

10.1107/S0021889896013210

Article

English

[{"id": "60013529", "name": "Hauptman-Woodward Institute, Buffalo, NY 14203-1196, 73 High Street, United States", "fullName": "Hauptman-Woodward Institute", "reference": "a", "fullAddress": "Buffalo, NY 14203-1196, 73 High Street, United States", "departmentId": null}]

Thermoluminescence dating based on feldspars

Nuclear Tracks and Radiation Measurements (1982)

A brief survey is given of our technique for TL dating. The principal feature is that we utilize different mineral fractions obtained by heavy liquid separation. We use all grain sizes up to several mm and have developed methods for taking into account the beta dose contribution from inherent potassium in feldspar grains. The technique has proved particularly useful for dating burnt stones. A few dating results are presented and discussed. © 1985.

["Mejdahl V."]

["6701647201"]

[]

10.1016/0735-245X(85)90019-5

Article

English

[{"id": "60011373", "name": "The Nordic Laboratory for Thermoluminescence Dating, Risø National Laboratory, DK-4000 Roskilde, Denmark", "fullName": "The Nordic Laboratory for Thermoluminescence Dating, Risø National Laboratory", "reference": "a", "fullAddress": "DK-4000 Roskilde, Denmark", "departmentId": "114701238"}]

Compact set valued flows II: Applications in biological modelling | Flots à valeurs compactes II : Applications en modélisation biologique

Comptes Rendus de l'Academie de Sciences - Serie IIb: Mecanique, Physique, Chimie, Astronomie

Compact set valued iterations generalize classical point iterations by replacing the function f with a tube f expressing the uncertainty about experimental data and allowing the study of the structural stability of Poincaré maps or phase response curves: logistic (Section 2) and respiratory (Section 3) examples show that bifurcation schemes are roughly respected. Finally, the problem of robustness of Poincaré maps or phase response curves used in physiology or embryology is discussed in Section 4.

["Demongeot J.", "Kulesa P.", "Murray J.D."]

["7005372567", "6701643282", "35518748900"]

[]

10.1016/s1251-8069(99)80014-1

Article

English

[{"id": "60015481", "name": "Department of Applied Mathematics, Box 352420, University of Washington, Seattle, WA 98195, United States", "fullName": "Department of Applied Mathematics, Box 352420, University of Washington", "reference": "a", "fullAddress": "Seattle, WA 98195, United States", "departmentId": "109891639"}, {"id": "60104653", "name": "TIMC-IMAG, Univ. J.-Fourier de Grenoble, 38700 La Tronche, France", "fullName": "TIMC-IMAG, Univ. J.-Fourier de Grenoble", "reference": "b", "fullAddress": "38700 La Tronche, France", "departmentId": null}]

On the Delay-Sensitivity of Gate Networks

IEEE Transactions on Computers

In classical switching theory, asynchronous sequential circuits are operated in the fundamental mode. In this mode, a circuit is started in a stable state, and then the inputs are changed to cause a transition to another stable state. The inputs are not allowed to change again until the entire circuit has stabilized. In contrast to this, delay-insensitive circuits—the correctness of which is insensitive to delays in their components and wires—use the input-output mode. Here, it is assumed that inputs may change again, in response to an output change, even before the entire circuit has stabilized. In this paper, we show that such commonly used behaviors as those of the set-reset latch and Muller’s C-element do not have delay-insensitive realizations, if gates are used as the basic components. In fact, we prove that no nontrivial sequential behavior with one binary input possesses a delayinsensitive realization using gates only. Our proof makes use of the equivalence between ternary simulation and the General Multiple Winner model of circuit behavior. © 1992 IEEE

["Brzozowski J.A.", "Ebergen J.C."]

["7005553606", "6603572484"]

["Asynchronous circuits", "delay-insensitive circuits", "fundamental mode", "gate networks", "input-output mode", "realizablity"]

10.1109/12.177306

Article

English

[{"id": "60032882", "name": "Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, Netherlands", "fullName": "Department of Mathematics and Computing Science, Eindhoven University of Technology", "reference": "a", "fullAddress": "Eindhoven, Netherlands", "departmentId": "113720248"}, {"id": "60014171", "name": "Department of Computer Science, University of Waterloo, Waterloo, Ont., N2L 3G1, Canada", "fullName": "Department of Computer Science, University of Waterloo", "reference": "b", "fullAddress": "Waterloo, Ont., N2L 3G1, Canada", "departmentId": "112961784"}]

Motion of level sets by mean curvature III

The Journal of Geometric Analysis

We continue our investigation [6,7] (see also [4], etc.) of the generalized motion of sets via mean curvature by the level set method. We study more carefully the fine properties of the mean curvature PDE, to obtain Hausdorff measure estimates of level sets and smoothness whenever the level sets are graphs. © 1992 Mathematica Josephina, Inc.

["Evans L.C.", "Spruck J."]

["7401488453", "6603114977"]

["Evolution by mean curvature", "Hausdorff measure", "Math Subject Classification: 53A10, 53A99, 35K55", "weak solutions of nonlinear PDE"]

10.1007/BF02921385

Article

English

[{"id": "60025038", "name": "Department of Mathematics, University of California, Berkeley, 94720, CA, United States", "fullName": "Department of Mathematics, University of California", "reference": "a", "fullAddress": "Berkeley, 94720, CA, United States", "departmentId": "105389791"}, {"id": "60014313", "name": "Department of Mathematics, University of Massachusetts, Amherst, 01003, MA, United States", "fullName": "Department of Mathematics, University of Massachusetts", "reference": "b", "fullAddress": "Amherst, 01003, MA, United States", "departmentId": "103745076"}]

Convergence of an ishikawa-type iteration scheme for a generalized contraction

Journal of Mathematical Analysis and Applications

We show that the result of Xu [J. Math. Anal. Appl.167 (1992), 582-587], dealing with an Ishikawa-type iteration for a map T satisfying Ćirić′s definition [Proc. Amer. Math. Soc.], can be extended to a wider class of maps. © 1994 Academic Press, Inc.

["Rhoades B.E."]

["7004191931"]

[]

10.1006/jmaa.1994.1253

Article

English

[{"id": "60021121", "name": "Department of Mathematics, Indiana University, Bloomington, IN 47405-5701, United States", "fullName": "Department of Mathematics, Indiana University", "reference": "a", "fullAddress": "Bloomington, IN 47405-5701, United States", "departmentId": "109108085"}]

Stability analysis of numerical schemes for Stochastic differential equations

SIAM Journal on Numerical Analysis

Stochastic differential equations (SDEs) represent physical phenomena dominated by stochastic processes. As for deterministic ordinary differential equations (ODEs), various numerical schemes are proposed for SDEs. In this paper we study the stability of numerical schemes for scalar SDEs with respect to the mean-square norm, which we call M S-stability. We will show some figures of the M S-stability domain or regions for some numerical schemes and present numerical results which confirm it. This notion is an extension of absolute stability in numerical methods for ODEs.

["Saito Y.", "Mitsui T."]

["55466449200", "7202337667"]

["Numerical schemes", "Numerical stability", "Stochastic differential equations"]

10.1137/S0036142992228409

Article

English

[{"id": "100384274", "name": "Shotoku Gakuen Women's Jr. College, Gifu-Shi 500, 1-38 Nakauzura, Japan", "fullName": "Shotoku Gakuen Women's Jr. College", "reference": "a", "fullAddress": "Gifu-Shi 500, 1-38 Nakauzura, Japan", "departmentId": null}, {"id": "60000264", "name": "Graduate School of Human Informatics, Nagoya University, Chikusa-ku, Nagoya 464-01, Furo-cho, Japan", "fullName": "Graduate School of Human Informatics, Nagoya University", "reference": "b", "fullAddress": "Chikusa-ku, Nagoya 464-01, Furo-cho, Japan", "departmentId": "103051185"}]

On a proposed Josephson-effect voltage standard at zero current bias

Applied Physics Letters

A voltage standard has been proposed which uses a series array of Josephson junctions locked to rf-induced constant-voltage steps at zero current bias. The feasibility of this proposal is examined in theory and experiment by determining the conditions under which rf-induced steps cros the zero current axis and the stability of phase lock under the zero bias condition.

["Kautz R.L."]

["7006023279"]

[]

10.1063/1.91497

Article

English

[{"id": "60023053", "name": "Electromagnetic Technology Division, National Bureau of Standards, Boulder, CO 80303, United States", "fullName": "Electromagnetic Technology Division, National Bureau of Standards", "reference": "a", "fullAddress": "Boulder, CO 80303, United States", "departmentId": "104173773"}]

Which set existence axioms are needed to prove the separable Hahn-Banach theorem?

Annals of Pure and Applied Logic

We work in the context of weak subsystems of second order arithmetic. RCA₀ is the system with Δ₁⁰ comprehension and Σ₁⁰ induction on the natural numbers. WKL₀ is RCA₀ plus weak König's lemma for trees of finite sequences of 0's and 1's. Within RCA₀ we encode a separable Banach space  as a countable normed space A over Q. Points of  are Cauchy sequences from A which converge at the rate of at least 2^-n. We show that the Hahn-Banach theorem for separable Banach spaces is provably equivalent to WKL₀ over RCA₀. Thus, once again, WKL₀ is revealed as mathematically powerful, despite being proof theoretically equivalent to primitive recursive arithmetic. © 1986.

["Brown D.K.", "Simpson S.G."]

["56122070900", "7201800176"]

[]

10.1016/0168-0072(86)90066-7

Article

English

[{"id": "60001439", "name": "Department of Mathematics, The Pennsylvania State University, University Park, PA 16802, United States", "fullName": "Department of Mathematics, The Pennsylvania State University", "reference": "a", "fullAddress": "University Park, PA 16802, United States", "departmentId": "100268723"}]

Calculating response functions in time domain with nonorthonormal basis sets

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

We extend the recently proposed order-[Formula Presented] algorithms for calculating linear- and nonlinear-response functions in time domain to the systems described by nonorthonormal basis sets. © 2000 The American Physical Society.

["Iitaka T.", "Ebisuzaki T."]

["7004386437", "55650183600"]

[]

10.1103/PhysRevE.61.R3314

Article

English

[{"id": "60021116", "name": "Division of Computational Science, RIKEN (The Institute of Physical and Chemical Research), Hirosawa, Saitama, 351-0198, Hirosawa 2-1, Japan", "fullName": "Division of Computational Science, RIKEN (The Institute of Physical and Chemical Research)", "reference": "a", "fullAddress": "Hirosawa, Saitama, 351-0198, Hirosawa 2-1, Japan", "departmentId": "104067099"}]

N = 2 superconformal models and their free field realization

Nuclear Physics, Section B

We discuss whether the N = 2 superconformal coset models can be described in terms of free fields by bosonizing directly the currents in the coset models. For this purpose, we develop the N = 2 superfield formalism for the N = 2 supercoset models. It is shown that this N = 2 superfield formulation naturally leads to a simple free field realization (or bosonization) of the supersymmetrized parafermionic models SU(2)/U(1) (the N = 2 minimal models) and SU(3)/U(1)². We also discuss various relations between the bosonized forms of the currents in coset models. © 1990.

["Ohta N.", "Suzuki H."]

["7201353458", "55704135700"]

[]

10.1016/0550-3213(90)90033-A

Article

English

[{"id": "60024322", "name": "Institute of Physics, College of General Education, Osaka University, Toyonaka, Osaka, 560, Japan", "fullName": "Institute of Physics, College of General Education, Osaka University", "reference": "a", "fullAddress": "Toyonaka, Osaka, 560, Japan", "departmentId": "104225570"}]

Abelian groups which satisfy pontryagin duality need not respect compactness

Proceedings of the American Mathematical Society

Let G be a topological Abelian group with character group G^. We will say that G respects compactness if its original topology and the weakest topology that makes each element of G^ continuous produce the same compact subspaces. We show the existence of groups which satisfy Pontryagin duality and do not respect compactness, thus furnishing counterexamples to a result published by Venkataraman in 1975. Our counterexamples will be the additive groups of all reflexive infinite-dimensional real Banach spaces. In order to do so, we first characterize those locally convex reflexive real spaces whose additive groups respect compactness. They are exactly the Montel spaces. Finally, we study the class of those groups that satisfy Pontryagin duality and respect compactness. © 1993 American Mathematical Society.

["Remus D.", "Trigos-Arrieta F.J."]

["23483972200", "6603173254"]

[]

10.1090/S0002-9939-1993-1132422-4

Article

English

[{"id": "60004935", "name": "Institut fur Mathematik, Universität Hannover, Hannover, D-3000, Lehrgebiet D, Welfengarten 1, Germany", "fullName": "Institut fur Mathematik, Universität Hannover", "reference": "a", "fullAddress": "Hannover, D-3000, Lehrgebiet D, Welfengarten 1, Germany", "departmentId": "103286998"}, {"id": "60023113", "name": "Department of Mathematics, California State University, Bakersfield, CA, 93311-1099, Bakersfield, 9001 Stockdale Highway, United States", "fullName": "Department of Mathematics, California State University", "reference": "b", "fullAddress": "Bakersfield, CA, 93311-1099, Bakersfield, 9001 Stockdale Highway, United States", "departmentId": "104175850"}]

A psychological evaluation method for fluctuating random noise based on fuzzy set theory

Applied Acoustics

In psychological noise evaluation, subjective judgment of the acoustical stimulus causes fuzziness. By paying special attention to the fuzziness of the subjective impression, the categorized psychological evaluation is quantitatively understood as the fuzzy event. The so-called discrete-type membership function in the field of fuzzy set theory is used as a practical method for discussing the relationship between the objective acoustical stimulus and the subjective human response. The patterns of discrete-type membership functions are determined by using the data actually observed to give the psychological impression. Next, a new method of evaluating the psychological impression is proposed for the case when subjects are exposed to the fluctuating random noise of arbitrary probability distribution. Finally, the validity and usefulness of the proposed method are confirmed experimentally by applying it to the data actually observed. © 1995.

["Yamaguchi S.", "Kato Y.", "Oimatsu K.", "Saeki T."]

["7403876827", "7404905954", "6602736680", "7201769104"]

[]

10.1016/0003-682X(94)00042-T

Article

English

[{"id": "60020739", "name": "Faculty of Engineering, Yamaguchi University, Ube, 755, 2557 Tokiwadai, Japan", "fullName": "Faculty of Engineering, Yamaguchi University", "reference": "a", "fullAddress": "Ube, 755, 2557 Tokiwadai, Japan", "departmentId": "104054779"}, {"id": "100366643", "name": "Kure Technical College, Kure, 737, Aga-minami, Japan", "fullName": "Kure Technical College", "reference": "b", "fullAddress": "Kure, 737, Aga-minami, Japan", "departmentId": null}, {"id": "100334189", "name": "Maritime Safety Academy, Kure, 737, Wakaba-cho, Japan", "fullName": "Maritime Safety Academy", "reference": "c", "fullAddress": "Kure, 737, Wakaba-cho, Japan", "departmentId": null}]

Web Usage Mining for Web Site Evaluation

Communications of the ACM

( Abstract ) : Making a site better fit its users.

["Spiliopoulou M."]

["56248430300"]

[]

10.1145/345124.345167

Article

English

[{"id": "60000762", "name": "Institute of Information Systems, Humboldt University, Berlin, Germany", "fullName": "Institute of Information Systems, Humboldt University", "reference": "a", "fullAddress": "Berlin, Germany", "departmentId": "103074375"}]

Application of the inverse scattering method to the generalised non-linear Schrodinger equation

Inverse Problems

The initial value problem for the generalised non-linear Schrodinger equation is solved by the inverse scattering method.

["Eichhorn H."]

["24452770400"]

[]

10.1088/0266-5611/1/3/005

Article

English

[{"id": "60029507", "name": "Sektion Phys., Friedrich-Schiller, Univ. Jena, Germany", "fullName": "Sektion Phys., Friedrich-Schiller, Univ. Jena", "reference": "a", "fullAddress": "Germany", "departmentId": null}]

Atomic-layer-deposited silicon-nitride/Si0₂ stacked gate dielectrics for highly reliable p-metal-oxide-semiconductor field-effect transistors

Applied Physics Letters

An extremely thin (∼0.4 nm) silicon-nitride layer has been deposited on thermally grown SiO₂ by an atomic-layer-deposition (ALD) technique. The boron penetration through the stacked gate dielectrics has dramatically been suppressed, and the reliability has been significantly improved, as confirmed by capacitance-voltage, gate-current-gate-voltage, and time-dependent dielectric-breakdown characteristics. The ALD technique allows us to fabricate an extremely thin, very uniform silicon-nitride layer with atomic-scale control. © 2000 American Institute of Physics.

["Nakajima A.", "Yoshimoto T.", "Kidera T.", "Obata K.", "Yokoyama S.", "Sunami H.", "Hirose M."]

["35516319300", "35376676900", "35511602400", "7103100022", "7402757876", "7005274323", "57082147600"]

[]

10.1063/1.1320847

Article

English

[{"id": "60030788", "name": "Res. Ctr. for Nanodevices and Syst., Hiroshima University, Hiroshima 739-8527, 1-4-2 Kagamiyama, Japan", "fullName": "Res. Ctr. for Nanodevices and Syst., Hiroshima University", "reference": "a", "fullAddress": "Hiroshima 739-8527, 1-4-2 Kagamiyama, Japan", "departmentId": "104558653"}]

On graphs containing a given graph as center

Journal of Graph Theory

We examine the problem of embedding a graph H as the center of a supergraph G, and we consider what properties one can restrict G to have. Letting A(H) denote the smallest difference ∣V(G)∣ ‐ ∣V(H)∣ over graphs G having center isomorphic to H it is demonstrated that A(H) ≤ 4 for all H, and for 0 ≤ i ≤ 4 we characterize the class of trees T with A(T) = i. for n ≥ 2 and any graph H, we demonstrate a graph G with point and edge connectivity equal to n, with chromatic number X(G) = n + X(H), and whose center is isomorphic to H. Finally, if ∣V(H)∣ ≥ 9 and k ≥ ∣V(H)∣ + 1, then for n sufficiently large (with n even when k is odd) we can construct a k‐regular graph on n vertices whose center is isomorphic to H. Copyright © 1981 Wiley Periodicals, Inc., A Wiley Company

["Buckley F.", "Miller Z.", "Slater P.J."]

["7004840256", "7003571556", "7202792831"]

[]

10.1002/jgt.3190050413

Article

English

[{"id": "60025447", "name": "St. John's University, New York, 10301, Staten Island, United States", "fullName": "St. John's University", "reference": "a", "fullAddress": "New York, 10301, Staten Island, United States", "departmentId": null}, {"id": "60032706", "name": "Miami University, Oxford, Ohio, 45056, United States", "fullName": "Miami University", "reference": "b", "fullAddress": "Oxford, Ohio, 45056, United States", "departmentId": null}, {"id": "60007843", "name": "Sandia Laboratories, Albuquerque, New Mexico, 87185, United States", "fullName": "Sandia Laboratories", "reference": "c", "fullAddress": "Albuquerque, New Mexico, 87185, United States", "departmentId": null}]

Exact risk approaches to smoothing parameter selection

Journal of Nonparametric Statistics

The past decade has seen the development of a large number of second-generational smoothing parameter selectors as a response to the high degree of variability of cross-validatory methods. However, most of these rules rely on asymptotic approximations which make them subject to adverse performance when the approximations are poor. They are also difficult to extend to those settings where asymptotics is difficult. We aim to alleviate each of these problems by developing rules based on exact expressions for the risk.

["Wand M.P.", "Gutierrez R.G."]

["35473584800", "57192065048"]

["Bandwidth selection", "Correlated errors", "Cross-validation", "Double smoothing", "Kernel estimator", "Partially linear model", "Smoothing spline"]

10.1080/10485259708832729

Article

English

[{"id": "60073904", "name": "Australian Grad. Sch. of Management, University of New South Wales, Sydney, NSW 2052, Australia", "fullName": "Australian Grad. Sch. of Management, University of New South Wales", "reference": "a", "fullAddress": "Sydney, NSW 2052, Australia", "departmentId": null}, {"id": "60017536", "name": "Department of Statistical Science, Southern Methodist University, Dallas, TX 75275-0332, United States", "fullName": "Department of Statistical Science, Southern Methodist University", "reference": "b", "fullAddress": "Dallas, TX 75275-0332, United States", "departmentId": "114715175"}]

Bile acids in asymmetric synthesis and molecular recognition

Current Science

This account summarizes the progress made in our laboratory towards the development of new uses of naturally occurring bile acids. Applications in Asymmetric Synthesis (intramolecular coupling, and intermolecular reactions) and Molecular Recognition are described with suitable examples.

["Maitra U."]

["7007147251"]

[]

Article

English

[{"id": "60014097", "name": "Department of Organic Chemistry, Indian Institute of Science, Bangalore 560 012, India", "fullName": "Department of Organic Chemistry, Indian Institute of Science", "reference": "a", "fullAddress": "Bangalore 560 012, India", "departmentId": "100271365"}]

Simultaneous component sequencing and feeder assignment for high speed chip shooter machines

Journal of Electronics Manufacturing

This paper proposes a methodology for efficient process planning of concurrent machines in electronics assembly. The particular machine type under consideration is the High Speed Chip Shooter (HSCS) for surface mount assembly. Currently, most surface mount assembly operations are modeled in a cyclic manner. The model that is proposed herein is an asynchronous (acyclic) model that augments the benefits of the unique features of this assembly machine. A heuristic algorithm is developed, referred to as the Acyclic Assembly Time (AAT) algorithm, which is based on the asynchronous model. The algorithm is thoroughly tested with orthogonal arrays, compared against previously published problems, and applied to a real life example. The AAT algorithm produced excellent results throughout the test process. By increasing the utilization of the individual mechanisms, the efficiency of the overall system naturally improves and the ultimate goal of reducing the total assembly time is achieved.

["Moyer L.K.", "Gupta S.M."]

["7004416813", "7407272563"]

["Concurrent machinery", "Electronics assembly", "Feeder assignment", "High speed chip shooter", "Path planning", "Printed circuit boards", "Surface mount"]

10.1142/S096031319600024X

Article

English

[{"id": "60028628", "name": "Department of Mechanical Engineering, 334 Snell Engineering Center, Northeastern University, Boston, MA 02115, 360 Huntington Avenue, United States", "fullName": "Department of Mechanical Engineering, 334 Snell Engineering Center, Northeastern University", "reference": "a", "fullAddress": "Boston, MA 02115, 360 Huntington Avenue, United States", "departmentId": "105205147"}]

An Impetus-Striction Simulation of the Dynamics of an Elastica

Journal of Nonlinear Science

This article concerns the three-dimensional, large deformation dynamics of an inextensible, unshearable rod. To enforce the conditions of inextensibility and unshearability, a technique we call the impetus-striction method is exploited to reformulate the constrained Lagrangian dynamics as an unconstrained Hamiltonian system in which the constraints appear as integrals of the evolution. We show here that this impetus-striction formulation naturally leads to a numerical scheme which respects the constraints and conservation laws of the continuous system. We present simulations of the dynamics of a rod that is fixed at one end and free at the other.

["Dichmann D.J.", "Maddocks J.H."]

["6603076026", "7005296525"]

[]

10.1007/BF02439312

Article

English

[{"id": "60020304", "name": "Inst. for Phys. Sci. and Technology, Department of Mathematics, University of Maryland, College Park, MD 20742, United States", "fullName": "Inst. for Phys. Sci. and Technology, Department of Mathematics, University of Maryland", "reference": "a", "fullAddress": "College Park, MD 20742, United States", "departmentId": "112811711"}]

Percolation points and critical point in the Ising model

Journal of Physics A: General Physics

Rigorous inequalities are proved, which relate percolation probability, mean cluster size and pair connectedness respectively with magnetization, susceptibility and pair correlation function in ferromagnetic Ising models. In two dimensions the critical point is shown to be a percolation point, while in three dimensions this is not true.

["Coniglio A.", "Nappi C.R.", "Peruggi F.", "Russo L."]

["7005636314", "7103285331", "23022911100", "16484541100"]

[]

10.1088/0305-4470/10/2/010

Article

English

[{"id": "60017293", "name": "Istituto de Fisica Teorica, Universitia di Napoli, Mostra D'Oltremare, Pad. 19, Napoli, Italy", "fullName": "Istituto de Fisica Teorica, Universitia di Napoli, Mostra D'Oltremare", "reference": "a", "fullAddress": "Pad. 19, Napoli, Italy", "departmentId": null}]

Stability of the method of lines

Numerische Mathematik

It is well known that a necessary condition for the Lax-stability of the method of lines is that the eigenvalues of the spatial discretization operator, scaled by the time step k, lie within a distance O(k) of the stability region of the time integration formula as k→0. In this paper we show that a necessary and sufficient condition for stability, except for an algebraic factor, is that the ε-pseudo-eigenvalues of the same operator lie within a distance O(ε)+O(k) of the stability region as k, ε→0. Our results generalize those of an earlier paper by considering: (a) Runge-Kutta and other one-step formulas, (b) implicit as well as explicit linear multistep formulas, (c) weighted norms, (d) algebraic stability, (e) finite and infinite time intervals, and (f) stability regions with cusps. In summary, the theory presented in this paper amounts to a transplantation of the Kreiss matrix theorem from the unit disk (for simple power iterations) to an arbitrary stability region (for method of lines calculations). © 1992 Springer-Verlag.

["Reddy S.C.", "Trefethen L.N."]

["36806533900", "7003930041"]

["Mathematics Subject Classification (1991): 65M20, 15A18"]

10.1007/BF01396228

Article

English

[{"id": "60022195", "name": "Department of Mathematics, Massachusetts Institute of Technology, Cambridge, 02139, MA, United States", "fullName": "Department of Mathematics, Massachusetts Institute of Technology", "reference": "a", "fullAddress": "Cambridge, 02139, MA, United States", "departmentId": "100247158"}]

Performability analysis: A new algorithm

IEEE Transactions on Computers

We propose, in this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm. © 1996 IEEE.

["Nabli H.", "Sericola B."]

["6602652388", "6601939262"]

["Fault tolerance", "Markov processes", "Performability", "Performance", "Reliability", "Repairable systems", "Uniformization"]

10.1109/12.494108

Article

English

[{"id": "60027031", "name": "IRISA-CNRS, Campus de Beaulieu, 35042 Rennes Cédex, France", "fullName": "IRISA-CNRS, Campus de Beaulieu", "reference": "a", "fullAddress": "35042 Rennes Cédex, France", "departmentId": null}, {"id": "60027031", "name": "IRISA-INRIA, Campus de Beaulieu, 35042 Rennes Cédex, France", "fullName": "IRISA-INRIA, Campus de Beaulieu", "reference": "b", "fullAddress": "35042 Rennes Cédex, France", "departmentId": null}]

Linear representations of projective planes in projective spaces

Journal of Algebra

A linear representation (LR) of a projective plane π (Desarguesian or not) is an isomorphic imbedding of π in a (Desarguesian) projective space ∑, in which each point or line of π becomes a nonempty, finite-dimensional projective subspace of ∑, and incidence is given by the containing relation of ∑. The paper begins an axiomatic study of LR's. At one end of the scale, every finite projective plane with exactly v lines has a "nondense" LR with ∑ of dimension v. Towards the other end of the scale, every translation plane which is suitably "finite-dimensional" has a "dense" LR with properties close to the lattice-structure of ∑. A theory of "switching-sets" is given, by which new translation planes can be derived from old. The paper generalizes an earlier one of the authors. (The construction of translation planes from projective spaces, J. Algebra 1 (1964), 85-102.). © 1966.

["Brück R.H.", "Bose R.C."]

["16516394100", "16523322200"]

[]

10.1016/0021-8693(66)90054-8

Article

English

[{"id": "60032179", "name": "University of Wisconsin, Madison, WI, United States", "fullName": "University of Wisconsin", "reference": "a", "fullAddress": "Madison, WI, United States", "departmentId": null}, {"id": "60025111", "name": "University of North Carolina, Chapel Hill, NC, United States", "fullName": "University of North Carolina", "reference": "b", "fullAddress": "Chapel Hill, NC, United States", "departmentId": null}, {"id": "60017717", "name": "University of North Carolina, United States", "fullName": "University of North Carolina", "reference": "c", "fullAddress": "United States", "departmentId": null}]

A necessary and a sufficient optimality condition for bilevel programming problems

Optimization

A necessary and a sufficient condition for local optimal solutions of bilevel programming problems are developed using differential stability results for parametric optimization problems. Verification of these conditions reduces to the solution of some auxiliary combinatorial optimization problems. © 1992 Gordon and Breach Science Publishers S.A.

["Dempe S."]

["6603561779"]

["Bilevel programming", "contingent derivative", "directional differentiability of optimal solutions", "hierarchical optimization problems", "necessary and sufficient optimality conditions", "parametric programming problems", "Stackelberg games"]

10.1080/02331939208843831

Article

English

[{"id": "60008069", "name": "Technical University Chemnitz, Dpt. of Mathematics, O-9010 Chemnitz, PSF 964, Germany", "fullName": "Technical University Chemnitz, Dpt. of Mathematics", "reference": "a", "fullAddress": "O-9010 Chemnitz, PSF 964, Germany", "departmentId": "116018588"}]

Exact solution of the Jaynes-Cummings model with cavity damping

Physical Review A - Atomic, Molecular, and Optical Physics

Operating in Laplace language and making use of a representation based on photon-number states, we find the exact solution for the density operator that belongs to the Jaynes-Cummings model with cavity damping. The detuning parameter is set equal to zero and the optical resonator does not contain any thermal photons. It is shown that the master equation for the density operator can be replaced by two algebraic recursion relations for vectors of dimension 2 and 4. These vectors are built up from suitably chosen matrix elements of the density operator. By performing an iterative procedure, the exact solution for each matrix element is found in the form of an infinite series. We demonstrate that all series are convergent and discuss how they can be truncated when carrying out numerical work. With the help of techniques from function theory, it is proved that our solutions respect the following conditions on the density operator: conservation of trace, Hermiticity, convergence to the initial state for small times, and convergence to the ground state for large times. We compute some matrix elements of the density operator for the case of weak damping and find that their analytic structure becomes much simpler. Finally, it is shown that the exact atomic density matrix converges to the state of maximum von Neumann entropy if the time, the square of the initial electromagnetic energy density, and the inverse of the cavity-damping parameter tend to infinity equally fast. The initial condition for the atom can be chosen freely, whereas the field may start from either a coherent or a photon-number state. © 1997 The American Physical Society.

["van Wonderen A.J."]

["6701472303"]

[]

10.1103/PhysRevA.56.3116

Article

English

[{"id": "60012614", "name": "Physikalisch-Chemisches Institut der Universität Zürich, Zürich, CH-8057, Winterthurerstrasse 190, Switzerland", "fullName": "Physikalisch-Chemisches Institut der Universität Zürich", "reference": "a", "fullAddress": "Zürich, CH-8057, Winterthurerstrasse 190, Switzerland", "departmentId": null}]

Astronomical image compression

Astronomy and Astrophysics Supplement Series

We compare a range of powerful compression methods - fractal, wavelets, pyramidal median, JPEG - with compression tools dedicated to astronomy such as HCOMPRESS, FITSPRESS and Mathematical Morphology, and apply these to astronomical images. Quality is quantified from visual appearance, and from photometric and astrometric measurements. Computational requirements of each method are discussed. We also review the implications of Web-based storage and transmission, stressing what we term progressive vision. In summary, no method is perfect, but the PMT method is the best compromise for general astronomical images, combining acceptable photometric and positional precision with good compression capabilities. JPEG is still an excellent method for compression factors less than 40 and has the advantage of being very widely available.

["Louys M.", "Starck J.L.", "Mei S.", "Bonnarel F.", "Murtagh F."]

["6603212257", "7005106453", "57201840269", "6508348089", "7005746699"]

["Astronomical data bases: miscellaneous", "Data analysis", "Image processing"]

10.1051/aas:1999235

Article

English

[{"id": "60103368", "name": "Observatoire de Strasbourg, Université Louis Pasteur, F-67000 Strasbourg, France", "fullName": "Observatoire de Strasbourg, Université Louis Pasteur", "reference": "a", "fullAddress": "F-67000 Strasbourg, France", "departmentId": null}, {"id": "60103368", "name": "Laboratoire des Sciences de l'Informatique, de l'Image et de la Télédétection, ENSPS, Université Louis Pasteur, F-67000 Strasbourg, France", "fullName": "Laboratoire des Sciences de l'Informatique, de l'Image et de la Télédétection, ENSPS, Université Louis Pasteur", "reference": "b", "fullAddress": "F-67000 Strasbourg, France", "departmentId": "119581574"}, {"id": "60121493", "name": "DAPNIA/SEI-SAP, CEA-Saclay, F-91191 Gif-sur-Yvette Cedex, France", "fullName": "DAPNIA/SEI-SAP, CEA-Saclay", "reference": "c", "fullAddress": "F-91191 Gif-sur-Yvette Cedex, France", "departmentId": null}, {"id": "60023599", "name": "European Southern Observatory, D-85748 Garching, Karl-Schwarzschild-Straße 2, Germany", "fullName": "European Southern Observatory", "reference": "d", "fullAddress": "D-85748 Garching, Karl-Schwarzschild-Straße 2, Germany", "departmentId": null}, {"id": "60029738", "name": "School of Computer Science, Queen's University of Belfast, Belfast BT7 1NN, United Kingdom", "fullName": "School of Computer Science, Queen's University of Belfast", "reference": "e", "fullAddress": "Belfast BT7 1NN, United Kingdom", "departmentId": "113427902"}]

On α-Bloch functions and VMOA

Acta Mathematica Scientia

In this paper some characterizations of α - Bloch functions and little α - Bloch functions are given. For 0 < α < ∞, it is shown that α - Bloch functions are contained in VMOA.

["Zhao R."]

["7401975773"]

[]

10.1016/s0252-9602(17)30811-1

Article

English

[{"id": "60019499", "name": "Wuhan Inst. of Mathematical Sciences, Academia Sinica, Wuhan 430071, China", "fullName": "Wuhan Inst. of Mathematical Sciences, Academia Sinica", "reference": "a", "fullAddress": "Wuhan 430071, China", "departmentId": "103989077"}]

The forest of merger history trees associated with the formation of dark matter haloes

Monthly Notices of the Royal Astronomical Society

We describe a simple, efficient algorithm that allows one to construct Monte Carlo realizations of merger histories of dark matter haloes. The algorithm is motivated by the excursion set model for the conditional and unconditional halo mass functions. The forest of trees constructed using this algorithm depends on the underlying power spectrum. For Poisson or white-noise initial power spectra, the forest has exactly the same properties as the ensemble of trees described by Sheth. In this case, many ensemble-averaged higher order statistics of the tree distribution can be computed analytically. For Gaussian initial conditions with more general power spectra, mean properties of our forests closely resemble the mean properties expected from the excursion set approach. For these more general initial conditions, our algorithm shows how to write down simple, analytic approximations to some higher order statistical quantities associated with the forest. These higher order statistics generated using our algorithm, and the associated analytic approximations, are in good agreement with what is measured in numerical simulations of hierarchical gravitational clustering.

["Sheth R.K.", "Lemson G."]

["7006123018", "6507433233"]

["Cosmology: Theory", "Dark matter", "Galaxies: Clusters: General"]

10.1046/j.1365-8711.1999.02477.x

Article

English

[{"id": "60023091", "name": "MPI-Astrophysik, 85748 Garching, Karl Schwarzschildstrasse 1, Germany", "fullName": "MPI-Astrophysik", "reference": "a", "fullAddress": "85748 Garching, Karl Schwarzschildstrasse 1, Germany", "departmentId": null}]

Automatic compensation technique for alternating current metrology based on synchronous filtering

Review of Scientific Instruments

In alternating current electrical metrology, the balancing procedure is the act of reduction to zero of a measured terminal-pair voltage (or current), accomplished via injection of a compensation voltage (current) in the circuit. An automatic compensation technique is described here: the terminal-pair voltage is continuously sensed, by means of vector synchronous detection, and the injected voltage is directly synthesized from the main circuit source. An implementation of the compensation technique, realized with analog electronics, permits compensation of audio frequency small voltages down to the nV range, with settling time in the order of milliseconds. © 1998 American Institute of Physics.

["Callegaro L.", "D'Elia V."]

["55876974900", "7003452601"]

[]

10.1063/1.1149237

Article

English

[{"id": "60003066", "name": "Ist. Elettrotecn. Naz. Galileo F., I-10135 Torino, strada delle Cacce 91, Italy", "fullName": "Ist. Elettrotecn. Naz. Galileo F.", "reference": "a", "fullAddress": "I-10135 Torino, strada delle Cacce 91, Italy", "departmentId": null}]

Design and performance analysis of delay insensitive multi-ring structures

Proceedings of the Annual Hawaii International Conference on System Sciences

A set of simple design and performance analysis techniques that have been successfully used to design a number of nontrivial delay insensitive circuits is described. Examples are building blocks for digital filters and a vector multiplier using a serial-parallel multiply and accumulate algorithm. The vector multiplier circuit has been laid out, submitted for fabrication and successfully tested. Throughout the analysis elements from this design are used to illustrate the design and performance analysis techniques. The design technique is based on a data flow approach using pipelines and rings that are composed into larger multiring structures by joining and forking of signals. By limiting to this class of structures, it is possible, even for complex designs, to analyze the performance and establish an understanding of the bottlenecks. © 1993 IEEE.

["Sparso J.", "Staunstrup J."]

["6603278517", "6701697741"]

[]

10.1109/HICSS.1993.270630

Conference Paper

English

[{"id": "60011373", "name": "Department of Computer Science, Building 344, Technical University of Denmark, Lyngby, DK-2800, Denmark", "fullName": "Department of Computer Science, Building 344, Technical University of Denmark", "reference": "a", "fullAddress": "Lyngby, DK-2800, Denmark", "departmentId": "103609105"}]

Development of a system framework for the computer-integrated manufacturing execution system: A distributed object-oriented approach

International Journal of Computer Integrated Manufacturing

Today, most of the Manufacturing Execution Systems (MES) are monolithic, insufficiently configurable and difficult to modify. Using a distributed object-oriented technique, we will present a systematic approach, to develop a computer-integrated MES Framework which is open, modularized, distributed, configurable, interoperable, and maintainable. We start with the system analysis by collecting domain requirements and analysing domain knowledge. Our MES Framework is designed by the process of constructing an abstract object model based on domain knowledge, partitioning the application domain into components, identifying generic parts among components, defining framework messages, and developing design patterns for generic parts. After finishing the MES Framework design, we design a variety of functional components by inheriting appropriate design patterns of the Framework. An application can then be constructed by invoking corresponding methods of related components. The proposed MES Framework can be integrated and tested. The CORBA infrastructure is adopted to develop this integratable MES. We also use OLE Automation and COM objects to construct sample applications. An example is shown to demonstrate the fruit of this systematic approach. © 1999 Taylor & Francis Ltd.

["Cheng F.-T.", "Shen E.", "Deng J.-Y.", "Nguyen K."]

["7202811304", "36942743400", "26660692300", "36857149300"]

[]

10.1080/095119299130137

Article

English

[{"id": "60014982", "name": "Institute of Manufacturing Engineering, National Cheng Kung University, Tainan, Taiwan, Taiwan", "fullName": "Institute of Manufacturing Engineering, National Cheng Kung University", "reference": "a", "fullAddress": "Tainan, Taiwan, Taiwan", "departmentId": "103770885"}, {"id": "101534337", "name": "Mitta Technology Group, Sunnyvale, CA, 94089, 155-A Moffett Park Drive, Suite 250, United States", "fullName": "Mitta Technology Group", "reference": "c", "fullAddress": "Sunnyvale, CA, 94089, 155-A Moffett Park Drive, Suite 250, United States", "departmentId": null}]

A 2D inspired 4D theory of gravity

Physics Letters B

Coadjoint orbits of the Virasoro and affine Lie algebras provide geometric actions for matter coupled to gravity and gauge fields in two dimensions. However, the Gauss' law constraints that arise from these actions are not necessarily endemic to two-dimensional topologies. Indeed the constraints associated with Yang-Mills naturally arise from the coadjoint orbit construction of the WZW model. One may in fact use a Yang-Mills theory to provide dynamics to the otherwise fixed coadjoint vectors that define the orbits. In this letter we would like to exhibit an analogue of the Yang-Mills classical action for the diffeomorphism sector. With this analogue one may postulate a 4D theory of gravitation that is related to an underlying two dimensional theory. Instead of quadratic differentials, a (1, 3) pseudo tensor becomes the dynamical variable. We briefly discuss how this tensor may be classically coupled to matter. © 1994.

["Rodgers V.G.J."]

["56822252700"]

[]

10.1016/0370-2693(94)90543-6

Article

English

[{"id": "60024324", "name": "Department of Physics and Astronomy, The University of Iowa, Iowa City, IA 52242-1479, United States", "fullName": "Department of Physics and Astronomy, The University of Iowa", "reference": "a", "fullAddress": "Iowa City, IA 52242-1479, United States", "departmentId": "105373435"}]

Recursion operator for coupled KdV equation

Physics Letters A

The recursion operator for the infinitesimal transformations about solutions of the coupled KdV is obtained as a 2 × 2 matrix. © 1993.

["Aiyer R.N."]

["22982928200"]

[]

10.1016/0375-9601(83)90461-9

Article

English

[{"id": "60033473", "name": "Laser Section, Bhabha Atomic Research Centre, Bombay, 400 085, India", "fullName": "Laser Section, Bhabha Atomic Research Centre", "reference": "a", "fullAddress": "Bombay, 400 085, India", "departmentId": "104700916"}]

Sequential search of an optimal dosage, I

Journal of the American Statistical Association

Sequential search procedures are described for determining an optimal dosage in the following biomedical problem. People are subjected to a certain chemotherapeutic treatment. The optimal dosage is the maximal dose for which the proportion of patients whose toxicity level does not cross the allowable limit is γ. We discuss Bayesian and non-Bayesian sequential procedures for searching the optimal dosage, assuming a linear regression between toxicity and dosage, and normal conditional distribution of the toxicity level at each dose, with a known variance. © Taylor & Francis Group, LLC.

["Eichhorn B.H.", "Zacks S."]

["16467181500", "35578648900"]

[]

10.1080/01621459.1973.10481389

Article

English

[{"id": "60005681", "name": "The University of Tel Aviv, Israel", "fullName": "The University of Tel Aviv", "reference": "a", "fullAddress": "Israel", "departmentId": null}, {"id": "60000305", "name": "Department of Mathematics and Statistics, Case Western Reserve University, Cleveland, OH, 44106, United States", "fullName": "Department of Mathematics and Statistics, Case Western Reserve University", "reference": "b", "fullAddress": "Cleveland, OH, 44106, United States", "departmentId": "115663725"}]

Investment under alternative return assumptions Comparing random walks and mean reversion

Journal of Economic Dynamics and Control

Many recent theoretical papers have come under attack for modeling prices as Geometric Brownian Motion. This process can diverge over time, implying that firms facing this price process can earn infinite profits. We explore the significance of this attack and contrast investment under Geometric Brownian Motion with investment assuming mean reversion. While analytically more complex, mean reversion in many cases is a more plausible assumption, allowing for supply responses to increasing prices. We show that cumulative investment is generally unaffected by the use of a mean reversion process rather than Geometric Brownian Motion and provide an explanation for this result. © 1995.

["Metcalf G.E.", "Hassett K.A."]

["7004606890", "6602557334"]

["Investment", "Stochastic processes", "Uncertainty"]

10.1016/0165-1889(94)00838-9

Article

English

[{"id": "60023143", "name": "Department of Economics, Tufts University, Medford, MA 02155, United States", "fullName": "Department of Economics, Tufts University", "reference": "a", "fullAddress": "Medford, MA 02155, United States", "departmentId": "104176401"}, {"id": "60023612", "name": "Board of Governors of the Federal Reserve System, Washington, DC 20551, United States", "fullName": "Board of Governors of the Federal Reserve System", "reference": "b", "fullAddress": "Washington, DC 20551, United States", "departmentId": null}]

Existence and stability of large scale nonlinear oscillations in suspension bridges

ZAMP Zeitschrift für angewandte Mathematik und Physik

A nonlinear model of a suspension bridge is considered in which large-scale, stable oscillatory motions can be produced by constant loading and a small-scale, external oscillatory force. Loud's implicit-function theoretic method for determining existence and stability of periodic solutions or nonlinear differential equations is extended to a case of a non-differentiable nonlinearity. © 1989 Birkhäuser Verlag.

["Glover J.", "Lazer A.C.", "McKenna P.J."]

["57204325923", "6603586766", "7201921683"]

[]

10.1007/BF00944997

Article

English

[{"id": "60013959", "name": "Dept. of Mathematics, University of Florida, Gainesville, 32611, Florida, United States", "fullName": "Dept. of Mathematics, University of Florida", "reference": "a", "fullAddress": "Gainesville, 32611, Florida, United States", "departmentId": "103722655"}, {"id": "60029251", "name": "Dept. of Mathematics and Computer Science, University of Miami, Coral Gables, 33124, Florida, United States", "fullName": "Dept. of Mathematics and Computer Science, University of Miami", "reference": "b", "fullAddress": "Coral Gables, 33124, Florida, United States", "departmentId": "104476648"}, {"id": "60022659", "name": "Dept. of Mathematics, University of Connecticut, Storrs, 06268, Connecticut, United States", "fullName": "Dept. of Mathematics, University of Connecticut", "reference": "c", "fullAddress": "Storrs, 06268, Connecticut, United States", "departmentId": "104153849"}]

Synchronization of coupled maps and stable windows

Physical Review E

Synchronization among globally coupled, chaotic map lattices can be related to stable periodic windows in isolated chaotic maps. This relation provides a simple predictive tool for the understanding of complicated behavior in coupled systems. © 1994 The American Physical Society.

["Shinbrot T."]

["7003412019"]

[]

10.1103/PhysRevE.50.3230

Short Survey

English

[{"id": "60007363", "name": "Laboratory for Fluid Mechanics, Chaos, and Mixing, Department of Chemical Engineering, Northwestern University, Evanston, IL 60208, United States", "fullName": "Laboratory for Fluid Mechanics, Chaos, and Mixing, Department of Chemical Engineering, Northwestern University", "reference": "a", "fullAddress": "Evanston, IL 60208, United States", "departmentId": "100251972"}]

A neural network designed to solve the N-Queens Problem

Biological Cybernetics

In this paper we discuss the Hopfield neural network designed to solve the N-Queens Problem (NQP). Our network exhibits good performance in escaping from local minima of energy surface of the problem. Only in approximately 1% of trials it settles in a false stable state (local minimum of energy). Extenive simulations indicate that the network is efficient and less sensitive to changes of its initial energy (potentials of neurons). Two strategies employed to achieve the solution and results of computer simulation are presented. Some theoretical remarks about convergence of the network are added. © 1992 Springer-Verlag.

["Mandziuk J.", "Macuk B."]

["6603131201", "16429570100"]

[]

10.1007/BF00203674

Article

English

[{"id": "60003675", "name": "Institute of Mathematics, Warsaw University of Technology, Warszawa, PL-00-661, Plac Politechniki 1, Poland", "fullName": "Institute of Mathematics, Warsaw University of Technology", "reference": "a", "fullAddress": "Warszawa, PL-00-661, Plac Politechniki 1, Poland", "departmentId": "100287619"}]

Critical properties of random-spin models from the ε expansion

Physical Review B

In quenched random-spin systems, the renormalization group can be used to develop recursion relations for the probability distribution for random potentials. Alternatively, recursion relations for the average values of potentials and their higher cumulants can be obtained. In this paper, the above technique is used to study phase transitions in quenched random n-component classical spin systems using the ε expansion to second order in ε. It there are long-range correlations in the random potentials (e.g., all potentials along a line are equal), there are no stable physical fixed points within the ε expansion. This is interpreted as a smeared transition. If there are no long-range correlations in the random potentials, there is a sharp transition with pure system exponents if the specific-heat exponent αH of the pure system is negative. If αH>0 and n>1, there is a sharp transition with new exponents η=[(5n2-8n)256(n-1)2]ε2 and ν=12+[3n32(n-1)]ε+[n(127n2-572n-32)4096(n-1)3]ε2. For n=1, there is no stable fixed point, which is again interpreted as a smeared transition. © 1975 The American Physical Society.

["Lubensky T.C."]

["7006483986"]

[]

10.1103/PhysRevB.11.3573

Article

English

[{"id": "60006297", "name": "Department of Physics, Laboratory for Research in the Structure of Matter, University of Pennsylvania, Philadelphia, PA 19174", "fullName": "Department of Physics, Laboratory for Research in the Structure of Matter, University of Pennsylvania", "reference": "a", "fullAddress": "Philadelphia, PA 19174", "departmentId": "100247007"}]

Sur un probleme aux valeurs propres non line aire

Israel Journal of Mathematics

In this paper, we give some sufficient conditions for which the differential operator P(λ=P₀+λP₁+...+λ^m-1 P_m-1+λ^m, depending polynomially on the complex parameter λ, verifies the following statement: there exists λ₀ ∈ ℂ, u_o=0, u₀ ∈ ℒ(ℝⁿ ) a Schwartz space of rapidly decreasing functions, such that P(λ₀)u₀=0-. © 1980 Hebrew University.

["Lai P.T.", "Robert D."]

["8424928400", "56213497100"]

[]

10.1007/BF02937354

Article

French

[{"id": "60032006", "name": "Institut de Mathematiques et d'Informatique, Universite de Nantes, Nantes, France", "fullName": "Institut de Mathematiques et d'Informatique, Universite de Nantes", "reference": "a", "fullAddress": "Nantes, France", "departmentId": "104624902"}]

The simulation of the geometry of a two-component yarn part II: Fibre distribution in the yarn cross-section

Journal of the Textile Institute

This paper considers the distribution of fibres in yarns and discusses the development of a model for the simulation of fibre distributions; the concept of ‘virtual location’ within the cross-section domain, which may contain a fibre, is introduced. The distribution of fibres in real yarns is compared with computer-generated distributions. The distributions predicted by using the model demonstrate all of the properties of the real yarns considered. The change in the fibre distribution caused by compressive forces is considered, and a model to describe the behaviour of real yarns is proposed. © 1997, © The Textile Institute, 1997.

["Grishanov S.A.", "Lomov S.V.", "Cassidy T.", "Harwood R.J."]

["6601981396", "7005067917", "57205699293", "7101978673"]

[]

10.1080/00405000.1997.11090889

Article

English

[{"id": "60017098", "name": "Department of Textiles and Fashion, De Montfort University, Leicester, United Kingdom", "fullName": "Department of Textiles and Fashion, De Montfort University", "reference": "a", "fullAddress": "Leicester, United Kingdom", "departmentId": null}]

Collusion in second price auctions with heterogeneous bidders

Games and Economic Behavior

We show that efficient collusion by any subset of bidders in second price private value auctions is possible, even when the bidders are heterogeneous. An important property of efficient collusion is that a bidder's net payoff from participating in collusion is independent of her valuation. We show that the cooperative game whose characteristic function (evaluated at a coalition) is the ex ante collusive surplus (of that coalition) has a nonempty core. A feature of more technical interest is the mechanism characterization when the private information of agents does not enter in a linear (or even piecewise linear) manner. © 1991.

["Mailath G.J.", "Zemsky P."]

["7003357524", "6507110503"]

[]

10.1016/0899-8256(91)90016-8

Article

English

[{"id": "60006297", "name": "Department of Economics, University of Pennsylvania, Philadelphia, PA 19104-6297, 3718 Locust Walk, United States", "fullName": "Department of Economics, University of Pennsylvania", "reference": "a", "fullAddress": "Philadelphia, PA 19104-6297, 3718 Locust Walk, United States", "departmentId": "103357445"}, {"id": "60012708", "name": "Graduate School of Business, Stanford University, Stanford, CA 94305, United States", "fullName": "Graduate School of Business, Stanford University", "reference": "b", "fullAddress": "Stanford, CA 94305, United States", "departmentId": null}]

Novel Canonical Coding Method for Representation of Three-Dimensional Structures

Journal of Chemical Information and Computer Sciences

A new canonical coding method for representation of three-dimensional structures, CAST (CAnonical representation of STereochemistry), is described. CAST canonically codes stereochemistry around an atom in a molecule. The same CAST notations are given for atoms of molecules in the same conformation. The CAST code is based on the dihedral angles of four atoms that are uniquely defined by a molecular tree structure. CAST has successfully represented similarities and differences between several conformers.

["Satoh H.", "Koshino H.", "Funatsu K.", "Nakata T."]

["36105439700", "7006369093", "55730038400", "7202137153"]

[]

10.1021/ci990147d

Article

English

[{"id": "60016648", "name": "RIKEN, Wako, Saitama 351-0198, 2-1 Hirosawa, Japan", "fullName": "RIKEN", "reference": "a", "fullAddress": "Wako, Saitama 351-0198, 2-1 Hirosawa, Japan", "departmentId": null}, {"id": "60015682", "name": "PRESTO, Japan Sci. and Technol. Corporation, Kawaguchi, Saitama 332-0012, 4-1-8 Honcho, Japan", "fullName": "PRESTO, Japan Sci. and Technol. Corporation", "reference": "b", "fullAddress": "Kawaguchi, Saitama 332-0012, 4-1-8 Honcho, Japan", "departmentId": "103813279"}, {"id": "60003497", "name": "Dept. of Knowledge-Based Info. Eng., Toyohashi University of Technology, Tempaku, Toyohashi, Aichi 441-8580, Japan", "fullName": "Dept. of Knowledge-Based Info. Eng., Toyohashi University of Technology", "reference": "c", "fullAddress": "Tempaku, Toyohashi, Aichi 441-8580, Japan", "departmentId": "103226426"}]

On a Lagrangean for classical field dynamics and renormalization group calculations of dynamical critical properties

Zeitschrift für Physik B Condensed Matter and Quanta

From the path probability density for nonlinear stochastic processes a Lagrangean for classical field dynamics is derived. This formulation provides a convenient approach to the mode coupling equations and the renormalization group theory of critical dynamics. An application is given for the time-dependent isotropic Heisenberg ferromagnet. The dynamical exponent {Mathematical expression} is derived above T_c for all dimensions d>2. © 1976 Springer-Verlag.

["Janssen H.-K."]

["23039158900"]

[]

10.1007/BF01316547

Article

English

[{"id": "60007774", "name": "Kernforschungsanlage Jülich, Institut für Festkörperforschung, Jülich, D-5170, Postfach 1913, Germany", "fullName": "Kernforschungsanlage Jülich, Institut für Festkörperforschung", "reference": "a", "fullAddress": "Jülich, D-5170, Postfach 1913, Germany", "departmentId": null}]

A 20 cm² CCD mosaic camera for a dark matter search part II : Electronics, data acquisition and performance

Experimental Astronomy

To summarize, the readout and the control system of the CCD mosaic camera are running since December 1991 at the La Silla Observatory (ESO). The overall performance of the camera has been good. About 12000 pictures (data and flat-fields) have been successfully registered up to now. We will report in the near future preliminary scientific results of the EROS experiment. © 1994 Kluwer Academic Publishers.

["Arnaud M.", "Aubourg E.", "Bareyre P.", "Br';ehin S.", "Caridroit R.", "de Kat J.", "Dispau G.", "Djidi K.", "Gros M.", "Lachièze-Rey M.", "Laigneau Y.", "Laurent B.", "Lesquoy E.", "Lavocat Ph.", "Magneville C.", "Mazeau B.", "Milsztajn A.", "Moscoso L.", "Pasquaud J.", "Paul B.", "Perrin P.", "Petibon J.", "Piret Y.", "Queinnec F.", "Rich J.", "Spiro M.", "de Trogoff J.", "Vigroux L.", "Zylberajch S.", "Ansari R.", "Cavalier F.", "Moniez M.", "Beaulieu J.P.", "Ferlet R.", "Grison Ph.", "Vidal-Madjar A.", "Adrianzyk G.", "Berger J.P.", "Burnage R.", "Delclite J.C.", "Kohler D.", "Magnan R.", "Richaud A.", "Guibert J.", "Moreau O.", "Tajahmady F.", "Baranne A.", "Maurice E.", "Prévôt L.", "Gry C."]

["7101923199", "7003836957", "7003994410", "16410786300", "16410959000", "7004130199", "6506928750", "6506796187", "57206379200", "6701341989", "16412974300", "57215513827", "6603873753", "23114709800", "7003800535", "6507953441", "6603926610", "6701825341", "16414173900", "22935865900", "36123617200", "16414751700", "15763777700", "6602319783", "8896450400", "7006421428", "16411626600", "7003434007", "6701411898", "58500586800", "7004325670", "6603871147", "55553753900", "7005187206", "6603910102", "7006793107", "14071336100", "55436407800", "14061658500", "16411475100", "7103211736", "16413401000", "56632940700", "7103331539", "7004260512", "16415488600", "14071317700", "7003308802", "7006604019", "7003966642"]

[]

10.1007/BF01580787

Article

English

[{"id": "60019615", "name": "DAPNIA, CE Saclay, Gif-sur-Yvette, 91191, France", "fullName": "DAPNIA, CE Saclay", "reference": "a", "fullAddress": "Gif-sur-Yvette, 91191, France", "departmentId": null}, {"id": "60073296", "name": "Laboratoire de l'Accélérateur Linéaire, Centre d'Orsay, Orsay Cedex, 91405, France", "fullName": "Laboratoire de l'Accélérateur Linéaire, Centre d'Orsay", "reference": "b", "fullAddress": "Orsay Cedex, 91405, France", "departmentId": null}, {"id": "60015201", "name": "Institut d'Astrophysique de Paris, Paris, 75014, 98 bis Boulevard Arago, France", "fullName": "Institut d'Astrophysique de Paris", "reference": "c", "fullAddress": "Paris, 75014, 98 bis Boulevard Arago, France", "departmentId": null}, {"id": "60084318", "name": "Observatoire de Haute Provence, Saint Michel l'Observatoire, 04870", "fullName": "Observatoire de Haute Provence", "reference": "d", "fullAddress": "Saint Michel l'Observatoire, 04870", "departmentId": null}, {"id": "60003674", "name": "Observatoire de Paris, Paris, 75014, 61 avenue de l'Observatoire, France", "fullName": "Observatoire de Paris", "reference": "e", "fullAddress": "Paris, 75014, 61 avenue de l'Observatoire, France", "departmentId": null}, {"id": "60014413", "name": "Observatoire de Marseille, Marseille Cedex 04, 13248, 2 Place Le Verrier, France", "fullName": "Observatoire de Marseille", "reference": "f", "fullAddress": "Marseille Cedex 04, 13248, 2 Place Le Verrier, France", "departmentId": null}, {"id": "60007671", "name": "Laboratoire d'Astronomie Spatiale de Marseille Traverse du Siphon, Marseille, 13120, Les Trois Lacs, France", "fullName": "Laboratoire d'Astronomie Spatiale de Marseille Traverse du Siphon", "reference": "g", "fullAddress": "Marseille, 13120, Les Trois Lacs, France", "departmentId": "106823830"}]

Technological choice under conditions of changing network externality

Journal of High Technology Management Research

This paper integrates work from the catastrophe theory literature (Baack & Cullen, 1992; Herbig, 1991; and Oliva, 1991) and economics literature (Farrell & Saloner, 1985) that collectively looks at various issues relating to the firm's adoption of a technology. The value added is that by marrying the economics approach to catastrophe theory, the resulting model can describe adoption under different degrees of network externalities. This means the model can capture technology adoption throughout the product life-cycle in the end user market. Furthermore, the model relaxes the assumption of most economic models and allows firms to switch back to the old technology or standard. This aspect of the model can capture what is currently happening with firm responses to environmental concerns. For example, McDonald's preference for containers has gone from paper technology to plastics technology and now its back to paper technology. Suppliers have had to switch or be switched. © 1994.

["Oliva T.A."]

["6601977503"]

[]

10.1016/1047-8310(94)90007-8

Article

English

[{"id": "60030398", "name": "Temple University, United States", "fullName": "Temple University", "reference": "a", "fullAddress": "United States", "departmentId": null}]

An improved goodness-of-fit statistic for sparse multinomials

Journal of the American Statistical Association

A new goodness-of-fit statistic for sparse multinomials is proposed. It is assumed that the null distribution exhibits smoothness. The test statistic is based on the maximum posterior estimator probability estimates of Simonoff (1983). Computer simulations are used to estimate the null distribution, significance levels, and the power function of the test. It is shown that power of the test is a great improvement over that of the standard tests if the alternative distribution exhibits smoothness. © 1976 Taylor & Francis Group, LLC.

["Simonoff J.S."]

["6603841077"]

["Chi-squared statistic", "Computer simulations", "Maximum penalized likelihood", "Smoothing"]

10.1080/01621459.1985.10478167

Article

English

[{"id": "60021784", "name": "Statistics and Operations Research Area, Graduate School of Business Administration, New York University, New York, NY, 10006, 100 Trinity Place, United States", "fullName": "Statistics and Operations Research Area, Graduate School of Business Administration, New York University", "reference": "a", "fullAddress": "New York, NY, 10006, 100 Trinity Place, United States", "departmentId": "104112909"}]

Disordered wires from a geometric viewpoint

Journal of Physics A: General Physics

The Mello-Pereyra-Kumar theory is extended to arbitrary spin. Classification yields three universality classes. The average over disorder is related to geometrical concepts. The solution of the resulting differential equation is discussed, localization lengths and universal conductance fluctuations are computed.

["Huffmann A."]

["57189329619"]

[]

10.1088/0305-4470/23/24/015

Article

English

[{"id": "60024025", "name": "Inst. fur Theor. Phys., Koln Univ., Germany", "fullName": "Inst. fur Theor. Phys., Koln Univ.", "reference": "a", "fullAddress": "Germany", "departmentId": "104212292"}]

Approximate Selection Theorems inH-Spaces with Applications

Journal of Mathematical Analysis and Applications

In the present paper, some approximate selection theorems, an almost fixed point theorem, a fixed point theorem, and an existence theorem for solution of generalized quasi-variational inequality inH-spaces are obtained. © 1999 Academic Press.

["Wu X.", "Li F."]

["7407064925", "26662516000"]

["Acyclic set", "L.c.-space", "Locally convexH-space", "Quasi-lower semicontinuous multivalued mapping"]

10.1006/jmaa.1998.6208

Article

English

[{"id": "60019218", "name": "Department of Mathematics, Yunnan Normal University, Kunming, Yunnan, 650092, China", "fullName": "Department of Mathematics, Yunnan Normal University", "reference": "a", "fullAddress": "Kunming, Yunnan, 650092, China", "departmentId": "103981866"}]

A small chip size 2 W, 62% efficient HBT MMIC for 3 V PCN applications

IEEE Journal of Solid-State Circuits

This work describes the L-band low voltage (≥1.6 V) power performance of AlGWGaAs heterojunction bipolar transistors (HBT's), their modeling and the design of a 2-W monolithic microwave integrated circuit (MMIC) for 3-V wireless mobile PCN applications (1800 MHz). The two-stage MMIC achieves 62% power-added efficiency (PAE) and 33 dB of linear gain. at a very small chip size of 1.2 mm ² To our knowledge this is the best combination of power performance data for wireless applications demonstrated so far for a MMIC. The chip size is about a factor of four smaller than comparable MMIC's known before. The MMIC offers the potential both for low cost production due to small chip size, single voltage supply, and high performance at the same time.

["Müller J.-E.", "Baureis P.", "Berger O.", "Boettner T.", "Bovolon N.", "Schultheis R.", "Packeiser G.", "Zwicknagl P."]

["56102885400", "54680595000", "7003352989", "7801647964", "6602328402", "6603879738", "6602217052", "6701604086"]

["Equivalent circuits", "Heterojunction bipolar transistors", "Microwave power bipolar transistor amplifiers", "MMIC power amplifiers", "Mobile communication", "Semiconductor device modeling", "Semiconductor device thermal factors"]

10.1109/4.711324

Article

English

[{"id": "60000251", "name": "IEEE, Germany", "fullName": "IEEE", "reference": "a", "fullAddress": "Germany", "departmentId": null}, {"id": "60028673", "name": "Siemens Corp. R. and D., Munich D 81730, Germany", "fullName": "Siemens Corp. R. and D.", "reference": "b", "fullAddress": "Munich D 81730, Germany", "departmentId": null}, {"id": "113050922", "name": "Fachhochschule, Wuerzburg D97070, Germany", "fullName": "Fachhochschule", "reference": "c", "fullAddress": "Wuerzburg D97070, Germany", "departmentId": null}, {"id": "60028673", "name": "Siemens Semiconductor Group, Munich D 81617, Germany", "fullName": "Siemens Semiconductor Group", "reference": "d", "fullAddress": "Munich D 81617, Germany", "departmentId": null}, {"id": "60019722", "name": "Technical University of Munich, Germany", "fullName": "Technical University of Munich", "reference": "e", "fullAddress": "Germany", "departmentId": null}, {"id": "60019722", "name": "Institute of Electronics, Technical University of Munich, Germany", "fullName": "Institute of Electronics, Technical University of Munich", "reference": "f", "fullAddress": "Germany", "departmentId": "105968263"}, {"id": "60028673", "name": "III-V Electronics Department, Siemens Corporate Technology, Munich, Germany", "fullName": "III-V Electronics Department, Siemens Corporate Technology", "reference": "g", "fullAddress": "Munich, Germany", "departmentId": "104450566"}, {"id": "60000251", "name": "IEEE Electron Device Society, Compd. Semicondutor IC Tech. Comm., Germany", "fullName": "IEEE Electron Device Society, Compd. Semicondutor IC Tech. Comm.", "reference": "h", "fullAddress": "Germany", "departmentId": "103050495"}]

Robust H_∞ reliable control for linear state delayed systems with parameter uncertainty

Proceedings of the American Control Conference

This paper focuses on the problem of robust H_∞ reliable control design for linear systems with state delay and parameter uncertainty. The goal of this problem is to design the state feedback controller such that, for all admissible uncertainties as well as actuator failures, the plant is robustly stabilized and the prescribed H_∞-norm bound constraint on disturbance attenuation is guaranteed, simultaneously. It is assumed that, the parameter uncertainties are norm-bounded and the actuator failures occur among a prespecified subset of actuators. A simple, effective, modified algebraic Riccati equation approach is developed to solve the addressed problem. The resulting time-delay control systems are reliable in that they provide guaranteed robust stability and H_∞ performance not only when all control components are operational, but also in case of actuator failures. An illustrative example is presented to demonstrate the applicability of the proposed method. © 1998 AACC.

["Wang Z."]

["55810114200"]

[]

10.1109/ACC.1998.703064

Conference Paper

English

[{"id": "60005322", "name": "Automatic Control Laboratory, Faculty of Electrical Engineering, Ruhr-University Bochum, D-44780 Bochum, Germany", "fullName": "Automatic Control Laboratory, Faculty of Electrical Engineering, Ruhr-University Bochum", "reference": "a", "fullAddress": "D-44780 Bochum, Germany", "departmentId": "107994439"}]

A maximum principle in relaxed controls

Nonlinear Analysis

["Kas̀kosz B."]

["6603080800"]

["boundary trajectories", "maximum principle", "Nonsmooth control systems", "relaxed controls"]

10.1016/0362-546X(90)90170-L

Article

English

[{"id": "60010806", "name": "Department of Mathematics, University of Rhode Island, Kingston, RI 02881, United States", "fullName": "Department of Mathematics, University of Rhode Island", "reference": "a", "fullAddress": "Kingston, RI 02881, United States", "departmentId": "103583646"}]

Generator Insulation Testing by Continuous Time—Function Application of Direct Voltage

IEEE Transactions on Power Apparatus and Systems

Large savings in generator insulation maintenance and replacement costs can be realized through the use of modern nondestructive insulation testing techniques. One such test involves subjecting the insulation system to a high direct voltage (HDV) with measurement of the resulting current as a function of time and voltage. A new concept of HDV testing and the associated test equipment, which will produce more reliable and useful data on the condition of the insulation system is presented. The new system is designed around a high-stability HDV supply which applies the test voltage at a predetermined continuous rate of rise which permits accurate measurement of small increments of specimen current. Emphasis is placed on the proper use of guard circuits and on the high stability of the power supply to eliminate misleading results and permit detection of fault paths nondestructively. Copyright © 1967 by The Institute of Electrical Engineers, Inc.

["Mchenry B.L."]

["56738205600"]

[]

10.1109/TPAS.1967.291809

Article

English

[{"id": "101263899", "name": "Electrical Research Department, Ontario Hydro, Toronto, Canada", "fullName": "Electrical Research Department", "reference": "a", "fullAddress": "Ontario Hydro, Toronto, Canada", "departmentId": null}]

Remark on the continuity of the density of states of ergodic finite difference operators

Communications in Mathematical Physics

We give an elementary proof that for a large class of d-dimensional finite difference operators including tight-binding models for electron propagation and models for harmonic phonons with random masses or couplings, the integrated density of states is a continuous function of the energy. © 1984 Springer-Verlag.

["Delyon F.", "Souillard B."]

["6507098791", "6603132281"]

[]

10.1007/BF01209306

Article

English

[{"id": "60031581", "name": "Department of Mathematics, Caltech, Pasadena, 91125, CA, United States", "fullName": "Department of Mathematics, Caltech", "reference": "a", "fullAddress": "Pasadena, 91125, CA, United States", "departmentId": "104603714"}]

Critical acceleration of finite-temperature SU(2) gauge simulations

Physical Review D

We present a cluster algorithm that strongly reduces critical slowing down for the SU(2) gauge theory on one time slice. The idea that underlies the new algorithm is to perform efficient flips for the signs of Polyakov loops. Ergodicity is ensured by combining it with a standard local algorithm. We show how to quantify critical slowing down for such a mixed algorithm. At the finite-temperature transition, the dynamical critical exponent z is 0.5, whereas the purely local algorithm z2. © 1991 The American Physical Society.

["Ben-Av R.", "Evertz H.G.", "Marcu M.", "Solomon S."]

["6602343776", "6701788286", "24298814400", "7401460507"]

[]

10.1103/PhysRevD.44.R2953

Article

English

[{"id": "60017563", "name": "Department of Nuclear Physics, Weizmann Institute of Science, 76100 Rehovot, Israel", "fullName": "Department of Nuclear Physics, Weizmann Institute of Science", "reference": "a", "fullAddress": "76100 Rehovot, Israel", "departmentId": "103907070"}, {"id": "60002092", "name": "Supercomputer Computations Research Institute, Florida State University, Tallahassee, FL 32306, United States", "fullName": "Supercomputer Computations Research Institute, Florida State University", "reference": "b", "fullAddress": "Tallahassee, FL 32306, United States", "departmentId": "103156669"}, {"id": "60005681", "name": "School of Physics and Astronomy, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, 69978 Tel-Aviv, Israel", "fullName": "School of Physics and Astronomy, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University", "reference": "c", "fullAddress": "69978 Tel-Aviv, Israel", "departmentId": "105170598"}, {"id": "60028229", "name": "II. Institut für Theoretische Physik, Universität Hamburg, D-2000 Hamburg 50, Luruper Chaussee 149, Germany", "fullName": "II. Institut für Theoretische Physik, Universität Hamburg", "reference": "d", "fullAddress": "D-2000 Hamburg 50, Luruper Chaussee 149, Germany", "departmentId": "104429608"}, {"id": "60007903", "name": "Racah Institute of Physics, Hebrew University, 91904 Jerusalem, Israel", "fullName": "Racah Institute of Physics, Hebrew University", "reference": "e", "fullAddress": "91904 Jerusalem, Israel", "departmentId": "103436951"}]

Singular perturbation and the energy of folds

Journal of Nonlinear Science

We address the singularly perturbed variational problem ∫ ∈^-1(1-|∇u|²)²+ ∈|∇∇u|² in two space dimensions. We introduce a new scheme for proving lower bounds and show the bounds are asymptotically sharp for certain domains and boundary conditions. Our results support the conjecture, due to Aviles and Giga, that folds are one-dimensional, i.e., ∇u varies mainly in the direction transverse to the fold. We also consider related problems obtained when (1 - |∇u|²)² is replaced by (1 - δ²u²_x - u²_y)² or (1 - |∇u|²)^2γ.

["Jin W.", "Kohn R.V."]

["7402071226", "49862589100"]

["Fold energy", "Gamma - convergence", "Lower bounds", "Singular perturbation", "Transition layers", "Viscosity solution"]

10.1007/s003329910014

Article

English

[{"id": "60021121", "name": "Department of Mathematics, Indiana University, Bloomington, IN 47405, United States", "fullName": "Department of Mathematics, Indiana University", "reference": "a", "fullAddress": "Bloomington, IN 47405, United States", "departmentId": "109108085"}, {"id": "60003261", "name": "Courant Inst. of Math. Sciences, New York, NY 10012, 251 Mercer Street, United States", "fullName": "Courant Inst. of Math. Sciences", "reference": "b", "fullAddress": "New York, NY 10012, 251 Mercer Street, United States", "departmentId": null}]

Volterra series and geometric control theory

Automatica

It is shown here that controlled differential equations which are analytic in the state and linear in the control have solutions which can be expanded in a Volterra series provided there is no finite escape time. The Volterra kernels are computed in terms of the power series expansion of the functions defining the differential equation. We also give necessary and sufficient conditions for a Volterra series to be realizable by a linear-analytic system. These conditions are particularly easy to test if the Volterra series is finite; a complete theory is worked out for this case. In the final section some applications are considered to singular control, multilinear realization theory, etc. © 1976.

["Brockett R.W."]

["35363546700"]

[]

10.1016/0005-1098(76)90080-7

Article

English

[{"id": "60009982", "name": "Division of Engineering and Applied Physics, Harvard University, Cambridge, MA, United States", "fullName": "Division of Engineering and Applied Physics, Harvard University", "reference": "a", "fullAddress": "Cambridge, MA, United States", "departmentId": "103545044"}]

Equivalent statistical quadratization and cubicization for nonlinear systems

Journal of Engineering Mechanics

A summary is given of the development of two techniques for handling system and excitation nonlinearities: equivalent statistical quadratization and equivalent statistical cubicization. Depending upon the nature of a given nonlinearity, one of these procedures may be employed to approximate it by a quadratic or cubic polynomial. In this manner, the nonlinearity is preserved and the response transfer functions are attainable using a Volterra functional series approach. When the parent input processes are characterized by appropriate spectra, integration in tbe frequency domain yields the desired spectra, bispectra or higher-order cumulants of the response. Using the system moment information corresponding to the response cumulants, a moment-based Hermite transformation yields probability density functions for the non-Gaussian process. Also, the force and response spectra exhibit the appropriate secondary peaks corresponding to the particular system and excitation characteristics. The accurate prediction of both extremes and response power spectral densities is a notable improvement over equivalent statistical linearization. All results compare well with those obtained using a time-domain simulation.

["Tognarelli M.A.", "Zhao J.", "Balaji Rao K.", "Kareem A."]

["57213763244", "57192228508", "6602278880", "35613461600"]

[]

10.1061/(ASCE)0733-9399(1997)123:5(512)

Article

English

[{"id": "60021508", "name": "Dept. of Civ. Engrg. and Geol. Sci., 156 Fitzpatrick Hall of Engrg., Univ. of Notre Dame, Notre Dame, IN 46556-0767, United States", "fullName": "Dept. of Civ. Engrg. and Geol. Sci., 156 Fitzpatrick Hall of Engrg., Univ. of Notre Dame", "reference": "a", "fullAddress": "Notre Dame, IN 46556-0767, United States", "departmentId": "104100702"}, {"id": "100852483", "name": "Barnett and Casbarian, Inc., Houston, TX 77024-1596, United States", "fullName": "Barnett and Casbarian, Inc.", "reference": "b", "fullAddress": "Houston, TX 77024-1596, United States", "departmentId": null}, {"id": "60022292", "name": "Struct. Engineering Research Center, Madras, India", "fullName": "Struct. Engineering Research Center", "reference": "c", "fullAddress": "Madras, India", "departmentId": null}, {"id": "60021508", "name": "Dept. of Civ. Engrg. and Geol. Sci., 163 Fitzpatrick Hall of Engrg., Univ. of Notre Dame, Notre Dame, IN, United States", "fullName": "Dept. of Civ. Engrg. and Geol. Sci., 163 Fitzpatrick Hall of Engrg., Univ. of Notre Dame", "reference": "d", "fullAddress": "Notre Dame, IN, United States", "departmentId": "104100702"}]

The conformal points of the generalized Thirring model

Nuclear Physics, Section B

The conformal fixed points of the generalized Thirring model are investigated with the help of bosonization, the large-N limit and the operator product expansion. Necessary conditions on the coupling constants for conformal invariance are derived. © 1994.

["Bardakci K."]

["6701621149"]

[]

10.1016/0550-3213(94)90103-1

Article

English

[{"id": "60007174", "name": "Theoretical Physics Group, Lawrence Berkeley Laboratory, University of California, Berkeley, CA 94720, United States", "fullName": "Theoretical Physics Group, Lawrence Berkeley Laboratory, University of California", "reference": "a", "fullAddress": "Berkeley, CA 94720, United States", "departmentId": null}]

A Fast Computer Method for Matrix Transposing

IEEE Transactions on Computers

A method is given for transposition of 2nX2n data matrices, larger than available high-speed storage. The data should be stored on an external storage device, allowing direct access. The performance of the algorithm depends on the size of the main storage, which at least should hold 2n+1 points. In that case the matrix has to be read in and written out n times. Copyright © 1972 by The Institute of Electrical and Electronics Engineers, Inc.

["Eklundh J.O."]

["57208457778"]

["Externally stored matrices", "fast Fourier transform", "fast Hadamard transform", "matrix transposition", "two-dimensional transformations"]

10.1109/T-C.1972.223584

Article

English

[{"id": "105276552", "name": "Research Institute of National Defence, Stockholm, Sweden", "fullName": "Research Institute of National Defence", "reference": "a", "fullAddress": "Stockholm, Sweden", "departmentId": null}]

Error analysis for polynomial evaluation

Mathematics of Computation

A floating point error analysis is given for the evaluation of a real polynomial at a real argument by Horners scheme. A computable error bound is derived. It is observed that when a polynomial has coefficients of constant sign or of strictly alternating sign, one cannot expect better accuracy by reformulating the problem in terms of Chebyshev polynomials. © 1974, American Mathematical Society.

["Newbery A."]

["16488090800"]

["Error analysis", "Polynomials"]

10.1090/S0025-5718-1974-0373227-8

Article

English

[{"id": "60015941", "name": "Department of Computer Science, University of Kentucky, Lexington, KY, United States", "fullName": "Department of Computer Science, University of Kentucky", "reference": "a", "fullAddress": "Lexington, KY, United States", "departmentId": "113196192"}]

Three-dimensional NMR experiments for the separation of side-chain correlations in proteins via the carbonyl chemical shift

Journal of Magnetic Resonance (1969)

["Kay L.E.", "Ikura M.", "Grey A.A.", "Muhandiram D.R."]

["7202300513", "57203254674", "56210481700", "57196325909"]

[]

10.1016/0022-2364(92)90223-T

Article

English

[{"id": "60016849", "name": "Canada", "fullName": null, "reference": "a", "fullAddress": "Canada", "departmentId": "103867856"}, {"id": "60016849", "name": "Carbohydrate Research Center, Chemistry, University of Toronto, Toronto, Ont. M5S 1A8, Medical Sciences Building, Canada", "fullName": "Carbohydrate Research Center, Chemistry, University of Toronto", "reference": "b", "fullAddress": "Toronto, Ont. M5S 1A8, Medical Sciences Building, Canada", "departmentId": "103869100"}, {"id": "60008768", "name": "Ontario Cancer Institute, Department of Medical Biophysics, University of Toronto, Toronto, Ont. M4X 1K9, 500 Sherbourne Street, Canada", "fullName": "Ontario Cancer Institute, Department of Medical Biophysics, University of Toronto", "reference": "c", "fullAddress": "Toronto, Ont. M4X 1K9, 500 Sherbourne Street, Canada", "departmentId": "113060326"}]

Comments on computing the similarity of binary trees

Journal of Theoretical Biology

Unordered binary trees, or dendrograms, have applications in numerical taxonomy in classifying relations among various species. The "crossover" or "nearest neighbor interchange" metric has been proposed to measure the similarity of alternative classification schemes. This paper resolves a conjecture concerning a proposed algorithm for computing this metric and presents new results on distance statistics for dendrograms having a small number of leaves. © 1983.

["Jarvis J.P.", "Luedeman J.K.", "Shier D.R."]

["7202985592", "16510687300", "7004934948"]

[]

10.1016/0022-5193(83)90439-3

Article

English

[{"id": "60026610", "name": "Department of Mathematical Sciences, Clemson University Clemson, SC 29631, United States", "fullName": "Department of Mathematical Sciences, Clemson University Clemson", "reference": "a", "fullAddress": "SC 29631, United States", "departmentId": "105369188"}]

Elementary function generators for neural-network emulators

IEEE Transactions on Neural Networks

Piece-wise first- and second-order approximations are employed to design commonly used elementary function generators for neural-network emulators. Three novel schemes are proposed for the first-order approximations. The first scheme requires one multiplication, one addition, and a 28-byte lookup table. The second scheme requires one addition, a 14-byte lookup table, and no multiplication. The third scheme needs a 14-byte lookup table, no multiplication, and no addition. A second-order approximation approach provides better function precision; it requires more hardware and involves the computation of one multiplication and two additions and access to a 28-byte lookup table. We consider bit serial implementations of the schemes to reduce the hardware cost. The maximum delay for the four schemes ranges from 24- to 32-bit serial machine cycles; the second-order approximation approach has the largest delay. The proposed approach can be applied to compute other elementary function with proper considerations. © 2000 IEEE.

["Vassiliadis S.", "Zhang M.", "Delgado-Frias J.G."]

["56218537400", "57219085897", "35548262700"]

["Elementary function generators", "Hardwired neuroemulators", "Neural-network functions", "Piecewise approximation", "Square root implementation", "Trigonometric functions"]

10.1109/72.883475

Article

English

[{"id": "60000251", "name": "IEEE, Netherlands", "fullName": "IEEE", "reference": "a", "fullAddress": "Netherlands", "departmentId": null}, {"id": "60006288", "name": "Department of Electrical Engineering, Delft University of Technology, 2638 CD Delft, Netherlands", "fullName": "Department of Electrical Engineering, Delft University of Technology", "reference": "b", "fullAddress": "2638 CD Delft, Netherlands", "departmentId": "109511552"}, {"id": "113109134", "name": "AT and T Wireless, Kirkland, WA 98033, United States", "fullName": "AT and T Wireless", "reference": "c", "fullAddress": "Kirkland, WA 98033, United States", "departmentId": null}, {"id": "60021918", "name": "Department of Electrical Engineering, University of Virginia, Charlottesville, VA 22904-4743, United States", "fullName": "Department of Electrical Engineering, University of Virginia", "reference": "d", "fullAddress": "Charlottesville, VA 22904-4743, United States", "departmentId": "108848178"}]

Nonlinear fluid behavior: from shear thinning to shear thickening

Physica A: Statistical Mechanics and its Applications

A phenomenological model is introduced which describes both shear thinning and shear thickening behavior. Consequences of this model are presented for plane Couette (simple shear) flow. The non-Newtonian viscosity and normal pressure differences are discussed for a stationary situation. The dynamic behavior - stress growth and relaxation - is analyzed. A stress hysteresis is found in the shear thickening regime. The model is also applied to the vorticity free planar (biaxial) deformational and (uniaxial) elongational flow geometries. © 1994.

["Hess O.", "Hess S."]

["57201236792", "56221562300"]

[]

10.1016/0378-4371(94)90208-9

Article

English

[{"id": "60011604", "name": "Institut für Theoretische Physik, Technische Universität Berlin, D-10623 Berlin, Hardenbergstr. 36, Germany", "fullName": "Institut für Theoretische Physik, Technische Universität Berlin", "reference": "a", "fullAddress": "D-10623 Berlin, Hardenbergstr. 36, Germany", "departmentId": "105200708"}, {"id": "60012556", "name": "Fachbereich Physik, AG Halbleiterphysik, Philipps-Universität Marburg, Renthof 5, D-35032 Marburg/Lahn, Germany", "fullName": null, "reference": "b", "fullAddress": null, "departmentId": "103664314"}]

Constraints on the stability of mass hierarchies in supergravity

Physics Letters B

We study supersymmetric grand unified models coupled to N = 1 supergravity with a gauge hierarchy induced by the breakdown of local supersymmetry, and a low energy scale given by the gravitino mass. Certain conditions must be fulfilled for this hierarchy to remain stable in perturbation theory. We discuss these constraints and show that most presently available models do not have a stable hierarchy. © 1983.

["Nilles H.P.", "Srednicki M.", "Wyler D."]

["7003744212", "7004680629", "7006174693"]

[]

10.1016/0370-2693(83)91467-3

Article

English

[{"id": "60019778", "name": "CERN, Geneva, Switzerland", "fullName": "CERN", "reference": "a", "fullAddress": "Geneva, Switzerland", "departmentId": null}]

Classification of power system transients: Synchronised switching

2000 IEEE Power Engineering Society, Conference Proceedings

This paper presents a new method for the identification and classification of transients due to synchronised capacitor switching in three-phase systems. Signal processing techniques are introduced to detect the switching actions in the individual phases. Synchronised switching methods for capacitor energisation are considered. The proposed method enables detection and classification of synchronised capacitor switching events. This in turn will lead to a reduction in the amount of data to be reported from a power quality survey. © 2000 IEEE.

["Styvaktakis E.", "Bollen M.H.J.", "Gu I.Y.H."]

["6602879885", "21933300000", "36724563600"]

["capacitor switching", "power system monitoring", "signal processing", "switching transients", "wavelet transforms"]

10.1109/PESW.2000.847306

Conference Paper

English

[{"id": "60000990", "name": "Dept. of Signals and Systems, Chalmers University of Technology, Gothenburg, S-412 96, Sweden", "fullName": "Dept. of Signals and Systems, Chalmers University of Technology", "reference": "a", "fullAddress": "Gothenburg, S-412 96, Sweden", "departmentId": "103097495"}, {"id": "60000990", "name": "Dept. of Electric Power Engineering, Chalmers University of Technology, Gothenburg, S-412 96, Sweden", "fullName": "Dept. of Electric Power Engineering, Chalmers University of Technology", "reference": "b", "fullAddress": "Gothenburg, S-412 96, Sweden", "departmentId": "103097501"}]

A Maximum Power Tracking Control Method for Photovoltaic Power Generation System Based on Derivation of Output Power with Respect to Output Voltage

IEEJ Transactions on Industry Applications

In order to achieve maximum utilization efficiency of photovoltaic energy,. photovoltaic power generation system usually requires maximum power tracking control. Since the maximum power point vary with solar insolation and cell temperature, it is difficult to track the maximum power point for the various insolation and temperature levels. In this paper, it is shown that the derivative (dps/des) of output power (ps) with respect to output voltage(es) of photovoltaic array is equal to zero at maximum power point. This kind of relationship is independent on the insolation and temperature. So, when the insolation or/and temperaturevarious changes, the corresponding maximum power point can be simply obtained by only controlling its derivative dps/des toward zero. Based on this concept. a maximum power tracking control method is proposed and is complemented with the boost chopper in an utility interactive photovoltaic power generation system. The maximum power tracking control system is constructed and the relating design method is described. It is shown that the presented control system has a high stability to a wide change range of insolation and temperature. Finally, the validity of the proposed method is verified through simulations and experiments. © 1998, The Institute of Electrical Engineers of Japan. All rights reserved.

["Dong H.", "Sugimoto H.", "Nishio N."]

["7402334976", "18038532000", "57195007941"]

[]

10.1541/ieejias.118.1435

Article

English

[{"id": "60010848", "name": "Fukui University, Japan", "fullName": "Fukui University", "reference": "a", "fullAddress": "Japan", "departmentId": null}, {"id": "117972413", "name": "Mitsubisi Electric Corporation, Japan", "fullName": "Mitsubisi Electric Corporation", "reference": "b", "fullAddress": "Japan", "departmentId": null}]

Asymptotic behavior of trajectories for some nonautonomous, almost periodic processes

Journal of Differential Equations

In this paper, asymptotics are studied for some almost periodic processes on a complete metric space (X, d): (1) It is shown that any precompact positive trajectory of a contractive periodic process is asymptotically almost periodic as t → +∞. This property does not hold for general almost periodic contractive processes. (2) A compactness result is obtained for weakly almost periodic complete trajectories of some (possibly nonlinear) processes in a uniformly convex Banach space. (3) The existence of almost periodic trajectories is studied for "affine" processes in a uniformly convex Banach space. These results are applicable to some evolution equations of the form du dt + A (t) u(t) ε{lunate} f(t), where f{hook}(t) is almost periodic: R → V uniformly convex Banach space and A(t) is a periodic, time-dependent, m-accretive operator in V. © 1983.

["Haraux A."]

["6602860484"]

[]

10.1016/0022-0396(83)90008-6

Article

English

[{"id": "60001422", "name": "Laboratoire d'Analyse Numérique, T.55-65 (5eétage), Univ. P. et M. Curie, 4, Place Jussieu, 75005 Paris, France", "fullName": null, "reference": "a", "fullAddress": null, "departmentId": "103114399"}]

Development of Adaptive Real Range (ARRange) Genetic Algorithms

JSME International Journal, Series C: Mechanical Systems, Machine Elements and Manufacturing

We propose a new type of real genetic algorithms (GAs) named adaptive real range (ARRange) GAs. In conventional real GAs, we simply set a minimum and a maximum value for each design variable and divide the range into specific divisions after decoding binary strings to integers. However, in such cases, we need to give so many number of bits and divide the given range into a great number of discrete values in order to achieve sufficient accuracy. Moreover, initially, we usually do not have any information on the minimum and maximum values. Thus, we have to set them while ignoring the accuracy of the real values. In the proposed method, a range of real numbers will move adaptively in each generation by using the mean value and the standard deviation of the previous generation. In ARRange GAs, we do not have to consider the settings of minimum and maximum real values or number of bits for accuracy of real values. However, in ARRange GAs, we need four additional GA parameters that influence the performance of GAs. In particular, two of these parameters greatly influence the convergence. We also present additional options that relieves the designer from having to perform presettings. In this study, we demonstrate the proposed method by simple numerical examples and demonstrate its effectiveness and characteristics.

["Arakawa M.", "Hagiwara I."]

["55669805100", "7005434761"]

["Design Engineering", "Genetic Algorithms", "Optimization"]

10.1299/jsmec.41.969

Article

English

[{"id": "60031126", "name": "Dept. of Mech. Eng. and Science, Faculty of Engineering, Tokyo Institute of Technology, Meguro, Tokyo 152-8552, 2-12-1 Oookayama, Japan", "fullName": "Dept. of Mech. Eng. and Science, Faculty of Engineering, Tokyo Institute of Technology", "reference": "a", "fullAddress": "Meguro, Tokyo 152-8552, 2-12-1 Oookayama, Japan", "departmentId": "108610480"}]

Anticipative portfolio optimization

Advances in Applied Probability

We study a classical stochastic control problem arising in financial economics: to maximize expected logarithmic utility from terminal wealth and/or consumption. The novel feature of our work is that the portfoilo is allowed to anticipate the future, i.e. the terminal values of the prices, or of the driving Brownian motion, are known to the investor, either exactly or with some uncertainty. Results on the finiteness of the value of the control problem are obtained in various setups, using techniques from the so-called enlargement of filtrations. When the value of the problem is finite, we compute it explicitly and exhibit an optimal portfolio in closed form.

["Pikovsky I.", "Karatzas I."]

["6506266687", "7004292926"]

["Enlargement of filtrations", "Optimal portfolios", "Relative entropy", "Stochastic analysis", "Stochastic control"]

10.1017/S0001867800027579

Article

English

[{"id": "60027950", "name": "Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA 15213, United States", "fullName": "Department of Mathematics, Carnegie-Mellon University", "reference": "a", "fullAddress": "Pittsburgh, PA 15213, United States", "departmentId": "113854091"}, {"id": "60030162", "name": "Depts. of Mathematics and Statistics, Columbia University, New York, NY 10027, United States", "fullName": "Depts. of Mathematics and Statistics, Columbia University", "reference": "b", "fullAddress": "New York, NY 10027, United States", "departmentId": "119767230"}]

The complexity of approximating a nonlinear program

Mathematical Programming

We consider the problem of finding the maximum of a multivariate polynomial inside a convex polytope. We show that there is no polynomial time approximation algorithm for this problem, even one with a very poor guarantee, unless P = NP. We show that even when the polynomial is quadratic (i.e. quadratic programming) there is no polynomial time approximation unless NP is contained in quasi-polynomial time. Our results rely on recent advances in the theory of interactive proof systems. They exemplify an interesting interplay of discrete and continuous mathematics-using a combinatorial argument to get a hardness result for a continuous optimization problem. © 1995 The Mathematical Programming Society, Inc.

["Bellare M.", "Rogaway P."]

["7005108633", "6701757180"]

["Approximation", "Nonlinear programming", "Optimization", "Probabilistically checkable proofs", "Quadratic programming"]

10.1007/BF01585569

Article

English

[{"id": "60017366", "name": "Advanced Networking Laboratory, IBM T.J. Watson Research Center, Yorktown Heights, 10598, NY, P.O. Box 704, United States", "fullName": "Advanced Networking Laboratory, IBM T.J. Watson Research Center", "reference": "a", "fullAddress": "Yorktown Heights, 10598, NY, P.O. Box 704, United States", "departmentId": "103900667"}, {"id": "60014439", "name": "Department of Computer Science, University of California at Davis, Davis, 95616, CA, United States", "fullName": "Department of Computer Science, University of California at Davis", "reference": "b", "fullAddress": "Davis, 95616, CA, United States", "departmentId": "100257069"}]