id
int64 1
3.53M
| eid
int64 194
78.8B
| paper_title
stringlengths 1
636
⌀ | source_title
stringlengths 1
316
⌀ | paper_summary
stringlengths 2
9.83k
⌀ | paper_authors_name
stringlengths 2
42.5k
| paper_authors_id
stringlengths 2
43k
| pub_year
int64 1.96k
2.02k
| cited_num
int64 0
58.7k
| author_keyword_json
stringlengths 2
1.85k
| doi
stringlengths 1
73
⌀ | paper_type
stringclasses 15
values | language
stringclasses 45
values | affiliations_info
stringlengths 2
59.7k
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
402
| 23,277
|
Polynomial form factors in the O(3) nonlinear σ-model
|
Physics Letters B
|
We study the general structure of Smirnov's axioms on form factors of local operators in integrable models. We find various consistency conditions that the form factor functions have to satisfy. For the special case of the O(3) σ-model we construct simple polynomial solutions for the operators of the spin-field, current, energy-momentum tensor and topological charge density. © 1994.
|
["Balog J.", "Hauer T."]
|
["7006275452", "57196852631"]
| 1,994
| 10
|
[]
|
10.1016/0370-2693(94)91453-2
|
Article
|
English
|
[{"id": "60003548", "name": "Research Institute for Particle and Nuclear Physics, H-1525 Budapest 114, P.O. Box 49, Hungary", "fullName": "Research Institute for Particle and Nuclear Physics", "reference": "a", "fullAddress": "H-1525 Budapest 114, P.O. Box 49, Hungary", "departmentId": null}]
|
403
| 23,410
|
Relaxation oscillators with time delay coupling
|
Physica D: Nonlinear Phenomena
|
We study networks of relaxation oscillators coupled with time delays synapses. A pair of oscillators is analyzed and shown to attain loosely synchronous solutions for a wide range of initial conditions and time delays. Simulations of one- and two-dimensional oscillator networks indicate that locally coupled oscillators are also loosely synchronous. Desynchronous solutions are possible when system parameters are varied. To characterize lossely synchronous networks, we introduce a measure of synchrony, the maximum time difference between any two oscillators. In locally excitatory globally inhibitory oscillator networks with time delays, we find that desynchronous solutions for different groups of oscillators are maintained, and the number of groups that can be segregated is related to the maximum time difference within each group. To examine the maximum time difference, we display its histograms for oscillator networks in one and two dimensions. Also, a range of initial conditions is given so that the maximum time difference is contained as the system evolves. Copyright © 1998 Elsevier Science B.V. All rights reserved.
|
["Campbell S.R.", "Wang D."]
|
["7403000585", "7407070944"]
| 1,998
| 38
|
["Biological oscillations", "Neural networks", "Relaxation oscillators", "Synchronization", "Time delays"]
|
10.1016/S0167-2789(97)80010-3
|
Article
|
English
|
[{"id": "60003500", "name": "Department of Physics, Ohio State University, Columbus, OH 43210, United States", "fullName": "Department of Physics, Ohio State University", "reference": "a", "fullAddress": "Columbus, OH 43210, United States", "departmentId": "113169669"}, {"id": "60003500", "name": "Department of Computer and Information Science, Center for Cognitive Science, Ohio State University, Columbus, OH 43210, United States", "fullName": "Department of Computer and Information Science, Center for Cognitive Science, Ohio State University", "reference": "b", "fullAddress": "Columbus, OH 43210, United States", "departmentId": "113567824"}]
|
404
| 23,457
|
Note on the Abelian Higgs-Kibble model on a lattice: Absence of spontaneous magnetization
|
Physical Review D
|
We study the magnetization (expectation value of the scalar field in the presence of a symmetry-breaking term) for the Abelian Higgs-Kibble model quantized on a Euclidean space-time lattice according to Wilson's procedure and show that it vanishes when the external field goes to zero. More explicitly, we show that the gauge invariance of the infinite-volume system is recovered when the symmetry-breaking term is removed. © 1978 The American Physical Society.
|
["De Angelis G.F.", "De Falco D.", "Guerra F."]
|
["7102108100", "6601947288", "7102031198"]
| 1,978
| 38
|
[]
|
10.1103/PhysRevD.17.1624
|
Article
|
English
|
[{"id": "60007061", "name": "Institute of Physics, University of Salerno, Salerno, Italy", "fullName": "Institute of Physics, University of Salerno", "reference": "a", "fullAddress": "Salerno, Italy", "departmentId": "103394781"}, {"id": null, "name": "84100 Salerno, Via Vernieri 42, Italy", "fullName": null, "reference": "b", "fullAddress": "84100 Salerno, Via Vernieri 42, Italy", "departmentId": null}]
|
405
| 23,481
|
A characterization of the extension principle
|
Fuzzy Sets and Systems
|
We provide an alternative characterization of the extension principle of fuzzy sets. This characterization is based upon using relations to represent mappings. We apply this new characterization to develop an extension for non-deterministic mappings. © 1986.
|
["Yager R.R."]
|
["35618760400"]
| 1,986
| 0
|
["Clean set mappings", "Extension principle", "Fuzzy subsets", "Nondeterministic mappings"]
|
10.1016/0165-0114(86)90002-3
|
Article
|
English
|
[{"id": "60019854", "name": "Machine Intelligence Institute, Iona College, New Rochelle, NY 10801, United States", "fullName": "Machine Intelligence Institute, Iona College", "reference": "a", "fullAddress": "New Rochelle, NY 10801, United States", "departmentId": null}]
|
406
| 23,539
|
The inverse almost ideal demand system
|
European Economic Review
|
A new demand system, related to the Almost Ideal Demand System (AIDS) of Deaton and Muellbauer, is developed and illustrated. This Inverse AIDS (IAIDS) retains all of the desirable theoretical properties of the AIDS model with the exception of consistent aggregation. An empirical issue is whether a linear approximation will work as well for the IAIDS as it has for the AIDS model, since quantities are not as highly correlated as prices. An application to U.S. meat demand demonstrates that the linear approximation of the IAIDS is excellent, which enhanced the ease and range of application. © 1994.
|
["Eales J.S.", "Unnevehr L.J."]
|
["7005254668", "6603084747"]
| 1,994
| 82
|
[]
|
10.1016/0014-2921(94)90008-6
|
Article
|
English
|
[{"id": "60030835", "name": "Canada", "fullName": null, "reference": "a", "fullAddress": "Canada", "departmentId": null}, {"id": "60000745", "name": "University of Illinois, Urbana-Champaign, IL, United States", "fullName": "University of Illinois", "reference": "b", "fullAddress": "Urbana-Champaign, IL, United States", "departmentId": null}]
|
407
| 23,558
|
Transform-domain postprocessing of DCT-coded images
|
Proceedings of SPIE - The International Society for Optical Engineering
|
Data compression algorithms are developed to transmit massive image data under limited channel capacity. When a channel rate is not sufficient to transmit good quality compressed images, a degraded image after compression is reconstructed at the decoder. In this situation, a postprocessor can be used to improve the receiver image quality. Ideally, the objective of postprocessing is to restore the original pictures from the received distorted pictures. However, when the received pictures are heavily distorted, there may not exist enough information to restore the original images. Then, what a postprocessor can do is to reduce the subjective artifact rather than to minimize the differences between the received and the original images. In this paper, we propose two postprocessing techniques, namely, error pattern compensation and inter-block transform coefficient adjustment. Since Discrete Cosine Transform (DCT) coding is widely adopted by the international image transmission standards, our postprocessing schemes are proposed in the DCT domain. When the above schemes are applied to highly distorted images, quite noticeable subjective improvement can be observed.
|
["Tien C.-N.", "Hang H.-M."]
|
["56012242800", "7006055291"]
| 1,993
| 7
|
[]
|
10.1117/12.157922
|
Conference Paper
|
English
|
[{"id": "60012370", "name": "Dept. of Electronics Engineering, National Chiao-Tung University, Hsin-Chu 300, Taiwan", "fullName": "Dept. of Electronics Engineering, National Chiao-Tung University", "reference": "a", "fullAddress": "Hsin-Chu 300, Taiwan", "departmentId": "113800627"}]
|
408
| 23,717
|
Smallest enclosing cylinders
|
Algorithmica (New York)
|
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in time O(n<sup>4</sup> log<sup>O(1)</sup> n) in an algebraic complexity model. We also achieve a time of O(n<sup>4</sup>L · μ(L)) in a bit complexity model where L is the maximum bit size of input numbers and μ(L) is the complexity of multiplying two L bit integers. These and several other results highlight a general linearization technique which transforms nonlinear problems into some higher-dimensional but linear problems. The technique is reminiscent of the use of Plücker coordinates, and is used here in conjunction with Megiddo's parametric searching. We further report on experimental work comparing the practicality of an exact with that of a numerical strategy.
|
["Schömer E.", "Sellen J.", "Teichmann M.", "Yap C."]
|
["6602331499", "6602172432", "55502054100", "7102836830"]
| 2,000
| 29
|
["Best-fit line", "Geometric optimization", "Parametric search", "Smallest enclosing cylinder", "ε-approximation algorithms"]
|
10.1007/s004530010011
|
Article
|
English
|
[{"id": "60102547", "name": "ESG GmbH, 81675 Munich, Einsteinstaße 174, Germany", "fullName": "ESG GmbH", "reference": "a", "fullAddress": "81675 Munich, Einsteinstaße 174, Germany", "departmentId": null}, {"id": "60021784", "name": "New York University, United States", "fullName": "New York University", "reference": "b", "fullAddress": "United States", "departmentId": null}, {"id": "60033241", "name": "Universität des Saarlandes, Saarlandes, Germany", "fullName": "Universität des Saarlandes", "reference": "c", "fullAddress": "Saarlandes, Germany", "departmentId": null}, {"id": "60022195", "name": "Computer Graphics Group, Massachusetts Inst. of Technology, Cambridge, MA 02139, United States", "fullName": "Computer Graphics Group, Massachusetts Inst. of Technology", "reference": "d", "fullAddress": "Cambridge, MA 02139, United States", "departmentId": "104137016"}, {"id": "60021784", "name": "Courant Institute, New York University, New York, NY 10012, 251 Mercer Street, United States", "fullName": "Courant Institute, New York University", "reference": "e", "fullAddress": "New York, NY 10012, 251 Mercer Street, United States", "departmentId": null}]
|
409
| 23,718
|
New bounds on the magnetic and electric moments of the tau lepton
|
Physics Letters B
|
We analyze the constraints on the anomalous magnetic moment and the electric dipole moment of the τ-lepton in the framework of an effective lagrangian approach, and we use electroweak data to bound these moments. © 1993.
|
["Escribano R.", "Massó E."]
|
["7004799890", "7004550130"]
| 1,993
| 39
|
[]
|
10.1016/0370-2693(93)91172-J
|
Article
|
English
|
[{"id": "60023020", "name": "Grup de Física Teòrica, Universitat Autònoma de Barcelona, E-08193 Bellaterra Barcelona, Spain", "fullName": "Grup de Física Teòrica, Universitat Autònoma de Barcelona", "reference": "a", "fullAddress": "E-08193 Bellaterra Barcelona, Spain", "departmentId": "104169621"}]
|
410
| 23,782
|
The consistent Shapley value for hyperplane games
|
International Journal of Game Theory
|
A new value is defined for n-person hyperplane games, i.e., non-sidepayment cooperative games, such that for each coalition, the Pareto optimal set is linear. This is a generalization of the Shapley value for side-payment games. It is shown that this value is consistent in the sense that the payoff in a given game is related to payoffs in reduced games (obtained by excluding some players) in such a way that corrections demanded by coalitions of a fixed size are cancelled out. Moreover, this is the only consistent value which satisfies Pareto optimality (for the grand coalition), symmetry and covariancy with respect to utility changes of scales. It can be reached by players who start from an arbitrary Pareto optimal payoff vector and make successive adjustments. © 1989 Physica-Verlag.
|
["Maschler M.", "Owen G."]
|
["6602617180", "56269124300"]
| 1,989
| 110
|
[]
|
10.1007/BF01358800
|
Article
|
English
|
[{"id": "60007903", "name": "Department of Mathematics, The Hebrew University, Jerusalem, Israel", "fullName": "Department of Mathematics, The Hebrew University", "reference": "a", "fullAddress": "Jerusalem, Israel", "departmentId": "103436862"}, {"id": "60033012", "name": "Department of Mathematics, Naval Postgraduate School, Monterey, California, United States", "fullName": "Department of Mathematics, Naval Postgraduate School", "reference": "b", "fullAddress": "Monterey, California, United States", "departmentId": "105373789"}]
|
411
| 23,917
|
Synchronization of the noisy electrosensitive cells in the paddlefish
|
Physical Review Letters
|
Synchronization of electrosensitive cells of the paddlefish is studied by means of electrophysiological experiments. Different types of noisy phase locked regimes are observed. The experimental data are compared with computer simulations of a noise-mediated modified Hodgkin-Huxley neuron model and of a stochastic circle map. © 1999 The American Physical Society.
|
["Neiman A.", "Pei X.", "Russell D.", "Wojtenek W.", "Wilkens L.", "Moss F.", "Braun H.A.", "Huber M.T.", "Voigt K."]
|
["7006386276", "7102484682", "7403670520", "6602629287", "7007036550", "22963129400", "7202368815", "35733998000", "7202590940"]
| 1,999
| 0
|
[]
|
10.1103/PhysRevLett.82.660
|
Article
|
English
|
[{"id": "60030171", "name": "Center for Neurodynamics, University of Missouri at St. Louis, St. Louis, MO, 63121, United States", "fullName": "Center for Neurodynamics, University of Missouri at St. Louis", "reference": "a", "fullAddress": "St. Louis, MO, 63121, United States", "departmentId": "104526107"}, {"id": "60012556", "name": "Institute of Physiology, University of Marburg, Marburg, 35037, Germany", "fullName": "Institute of Physiology, University of Marburg", "reference": "b", "fullAddress": "Marburg, 35037, Germany", "departmentId": "112660902"}, {"id": "60012556", "name": "Institute of Psychiatry, University of Marburg, Marburg, 35037, Germany", "fullName": "Institute of Psychiatry, University of Marburg", "reference": "c", "fullAddress": "Marburg, 35037, Germany", "departmentId": "103663636"}]
|
412
| 23,947
|
The characteristics and current status of China's construction industry
|
Construction Management and Economics
|
The development of China's construction industry is presented by describing its current status and high-lighting its achievements, identifying the main constraints preventing the industry from playing a more effective and efficient role in the country's economic development. Fundamental changes occurred in the construction industry after the economic reform, and the industry has been playing a very important role in the national economy, having made impressive progress and been developed at an amazing speed. However, reforms in the construction industry are difficult since this industry is not a single sector. The reform process by its very nature is not systematic. The challenges ahead are serious, and deeper reforms of the economic system are required.
|
["Chen J.J."]
|
["57219938333"]
| 1,998
| 59
|
["Business environment", "China", "Construction industry", "Economic reform"]
|
10.1080/014461998372006
|
Article
|
English
|
[{"id": "60021889", "name": "University of Greenwich, Sch. of Land and Constr. Management, Dartford, Kent DA1 2SZ, United Kingdom", "fullName": "University of Greenwich, Sch. of Land and Constr. Management", "reference": "a", "fullAddress": "Dartford, Kent DA1 2SZ, United Kingdom", "departmentId": "104119158"}]
|
413
| 23,997
|
On the Liapunov-Krasovskii functionals for stability analysis of linear delay systems
|
International Journal of Control
|
This paper focuses on ’mixed’ delay-independent/delay-dependent asymptotic stability problems of a class of linear systems described by delay-differential equations involving several constant but unknown delays. We give some sufficient conditions for characterizing unbounded stability regions in the delays parameter space. The proposed approach makes use of some appropriate Liapunov-Krasovskii functionals, and the results obtained are expressed in terms of matrix inequalities. We also discuss several ways to construct such analytic functionals. These results allow us to recover (or to improve) as limit cases previous delay-independent or/and delay-dependent conditions from the control literature. © 1999 Taylor & Francis Ltd.
|
["Kolmanovskii V.B.", "Niculescu S.-I.", "Richard J.-P."]
|
["7006689581", "7006439159", "7402648649"]
| 1,999
| 177
|
[]
|
10.1080/002071799221172
|
Article
|
English
|
[{"id": "60017989", "name": "MIEM, Space Research Institute of Russian Academy of Sciences, Moscow, Russian Federation", "fullName": "MIEM, Space Research Institute of Russian Academy of Sciences", "reference": "a", "fullAddress": "Moscow, Russian Federation", "departmentId": null}, {"id": "60031139", "name": "Ecole Centrale de Lille, Villeneuve d’Ascq Cedex, 59651, LAIL-URA CNRS D1440, BP 48, France", "fullName": "Ecole Centrale de Lille", "reference": "b", "fullAddress": "Villeneuve d’Ascq Cedex, 59651, LAIL-URA CNRS D1440, BP 48, France", "departmentId": null}, {"id": "60160765", "name": "HEUDIASYC (UMR CNRS 6599), Université de Technologie de Compiégne, Centre de Recherche de Royallieu, Compiégne, 60205, BP 20529, France", "fullName": "HEUDIASYC (UMR CNRS 6599), Université de Technologie de Compiégne, Centre de Recherche de Royallieu", "reference": "c", "fullAddress": "Compiégne, 60205, BP 20529, France", "departmentId": "103920357"}, {"id": "60003161", "name": "Department of Automatic Control, University Politehnica, Bucharest, Romania", "fullName": "Department of Automatic Control, University Politehnica", "reference": "d", "fullAddress": "Bucharest, Romania", "departmentId": "114337275"}, {"id": "60019904", "name": "Department of Applied Mathematics, ENSTA, Paris, France", "fullName": "Department of Applied Mathematics, ENSTA", "reference": "e", "fullAddress": "Paris, France", "departmentId": "118221955"}]
|
414
| 24,006
|
Bias and Precision in the Estimation of Exponential Decay Parameters from Sparse Data
|
Analytical Chemistry
|
The statistical properties of maximum likelihood (ML) and least-squares (LS) estimators for the exponential decay parameters Γ(rate) and τ (lifetime) are examined for finite observation time (T) and a small number of counts (N). The ML estimators and their variances are assessed via numerical ratecalculations employing the exact N-point distributions for exponentially distributed random data. Bias is a common feature of all these estimators under these conditions. In addition, the ML lifetime estimator exhibits the interesting property of divergence in its variance, which means that Γ is the statistically preferred parameter for characterizing exponential decay for finite observation time. The bias Γ in is less than N/(N -1) for all T and thus can be easily corrected for. The effects of various ways of binning the data are examined for both the ML and LS approaches. © 1993, American Chemical Society. All rights reserved.
|
["Tellinghuisen J.", "Wilkerson C.W., Jr."]
|
["7004717440", "7004316380"]
| 1,993
| 54
|
[]
|
10.1021/ac00057a022
|
Article
|
English
|
[{"id": "60003915", "name": "Department of Chemistry, Vanderbilt University, Nashville, Tennessee 37235, United States", "fullName": "Department of Chemistry, Vanderbilt University", "reference": "a", "fullAddress": "Nashville, Tennessee 37235, United States", "departmentId": "112254006"}, {"id": "60006164", "name": "Chemical and Laser Sciences Division, Center for Human Genome Studies, Los Alamos National Laboratory, New Mexico 87545, Los Alamos, United States", "fullName": "Chemical and Laser Sciences Division, Center for Human Genome Studies, Los Alamos National Laboratory", "reference": "b", "fullAddress": "New Mexico 87545, Los Alamos, United States", "departmentId": "103348616"}]
|
415
| 24,017
|
Efficient co-monotone approximation
|
Journal of Approximation Theory
| null |
["Newman D.J."]
|
["24496556200"]
| 1,979
| 20
|
[]
|
10.1016/0021-9045(79)90009-1
|
Article
|
English
|
[{"id": "60030398", "name": "Department of Mathematics, Temple University, Philadelphia, PA 19122, United States", "fullName": "Department of Mathematics, Temple University", "reference": "a", "fullAddress": "Philadelphia, PA 19122, United States", "departmentId": "104538589"}]
|
416
| 24,033
|
Eigenvalues of nonnegative symmetric matrices
|
Linear Algebra and Its Applications
|
Some necessary and some sufficient conditions are found for n real numbers to be eigenvalues of an n × n nonnegative (or alternatively, positive) symmetric matrix and for 2n real numbers to be eigenvalues and diagonal entries of an n × n nonnegative symmetric matrix. © 1974.
|
["Fiedler M."]
|
["7006649029"]
| 1,974
| 114
|
[]
|
10.1016/0024-3795(74)90031-7
|
Article
|
English
|
[{"id": "60056159", "name": "Matematicky ustav CSAV, Praha 1, Zitna 25, Czech Republic", "fullName": "Matematicky ustav CSAV", "reference": "a", "fullAddress": "Praha 1, Zitna 25, Czech Republic", "departmentId": null}]
|
417
| 24,102
|
Misspecified maximum likelihood estimates and generalised linear mixed models
|
Biometrika
|
We investigate the impact of model violations on the estimate of a regression coefficient in a generalised linear mixed model. Specifically, we evaluate the asymptotic relative bias that results from incorrect assumptions regarding the random effects. We compare the impact of model violation for two parameterisations of the regression model. Substantial bias in the conditionally specified regression point estimators can result from using a simple random intercepts model when either the random effects distribution depends on measured covariates or there are autoregressive random effects. A marginally specified regression structure that is estimated using maximum likelihood is much less susceptible to bias resulting from random effects model misspecification. © 2001 Biometrika Trust.
|
["Heagerty P.J.", "Kurland B.F."]
|
["56564301100", "6602766921"]
| 2,001
| 0
|
["Marginal model", "Quasilikelihood", "Random effects", "Variance estimation"]
|
10.1093/biomet/88.4.973
|
Article
|
English
|
[{"id": "60015481", "name": "Department of Biostatistics, University of Washington, Seattle, WA 98195, United States", "fullName": "Department of Biostatistics, University of Washington", "reference": "a", "fullAddress": "Seattle, WA 98195, United States", "departmentId": "103799482"}]
|
418
| 24,206
|
Gesture recognition using colored gloves
|
Proceedings - International Conference on Pattern Recognition
|
This paper proposes a method to recognize hand gestures from a monocular image. We use colored gloves to detect specific region of hand easily. By using this method, we can treat easily the occlusion problem due to color information. Hand gesture are recognized by the decision tree made from the image features automatically by our proposed method. There are another pattern recognition methods using image features like nearest-neighbor method. But it is better for computation time to use the decision tree because the decision tree uses only few selected important features. In this paper, we show a learning result by the CAD model and recognition results in real images by our proposed method. © 1996 IEEE.
|
["Iwai Y.", "Watanabe K.", "Yagi Y.", "Yachida M."]
|
["57201788506", "55627875330", "55740719200", "7006107315"]
| 1,996
| 26
|
[]
|
10.1109/ICPR.1996.546107
|
Conference Paper
|
English
|
[{"id": "60024322", "name": "Department of Systems Engineering, Osaka University, Toyonaka, Osaka 560, Japan", "fullName": "Department of Systems Engineering, Osaka University", "reference": "a", "fullAddress": "Toyonaka, Osaka 560, Japan", "departmentId": "110144066"}]
|
419
| 24,279
|
Unimodular quadratic forms over global function fields
|
Journal of Number Theory
|
The isometry problem is studied for unimodular quadratic forms over the Hasse domains of global function fields. Over the polynomial ring k[x] the problem reduces to classification of forms over k; but examples are provided showing that in general no such reduction occurs, even when the underlying ring is Euclidean. Connections with the structure of the ideal class group are given, and a complete invariant for the isometry class is found in the ternary isotropic case. © 1979.
|
["Gerstein L.J."]
|
["7003566161"]
| 1,979
| 15
|
[]
|
10.1016/0022-314X(79)90032-5
|
Article
|
English
|
[{"id": "60029241", "name": "Department of Mathematics, University of California, Santa Barbara, CA 93106, United States", "fullName": "Department of Mathematics, University of California", "reference": "a", "fullAddress": "Santa Barbara, CA 93106, United States", "departmentId": "104475801"}]
|
420
| 24,329
|
Novel one-step synthesis of random hyperbranched polymers from activated methylene AB<sub>2</sub> monomer
|
Macromolecules
| null |
["Jin R.-H.", "Andou Y."]
|
["7202927952", "8911119200"]
| 1,996
| 9
|
[]
|
10.1021/ma9605659
|
Article
|
English
|
[{"id": "60001580", "name": "Department of Materials Science, Faculty of Engineering, Miyazaki University, Miyazaki 889-21, Japan", "fullName": "Department of Materials Science, Faculty of Engineering, Miyazaki University", "reference": "a", "fullAddress": "Miyazaki 889-21, Japan", "departmentId": "103132221"}]
|
421
| 24,357
|
Tauberian operators on L<sub>1</sub>(μ) spaces
|
Studia Mathematica
|
We characterize tauberian operators T : L<sub>1</sub>(μ) → Y in terms of the images of disjoint sequences and in terms of the image of the dyadic tree in L<sub>1</sub>[0, 1]. As applications, we show that the class of tauberian operators is stable under small norm perturbations and that its perturbation class coincides with the class of all weakly pre-compact operators. Moreover, we prove that the second conjugate of a tauberian operator T : L<sub>1</sub>(μ) → Y is also tauberian, and the induced operator T̃ : L<sub>1</sub>(μ)**/L<sub>1</sub>(μ) → Y**/Y is an isomorphism into. Also, we show that L<sub>1</sub>(μ) embeds isomorphically into the quotient of L<sub>1</sub>(μ) by any of its reflexive subspaces.
|
["González M.", "Martínez-Abejón A."]
|
["7404553923", "56128297100"]
| 1,997
| 12
|
[]
| null |
Article
|
English
|
[{"id": "60015179", "name": "Departamento de Matemáticas, Facultad de Ciencias, Universidad de Cantabria, E-39071 Santander, Spain", "fullName": "Departamento de Matemáticas, Facultad de Ciencias, Universidad de Cantabria", "reference": "a", "fullAddress": "E-39071 Santander, Spain", "departmentId": "100280471"}, {"id": "60006793", "name": "Departamento de Matemáticas, Facultad de Ciencias, Universidad de Oviedo, E-33007 Oviedo, Spain", "fullName": "Departamento de Matemáticas, Facultad de Ciencias, Universidad de Oviedo", "reference": "b", "fullAddress": "E-33007 Oviedo, Spain", "departmentId": "103383792"}]
|
422
| 24,361
|
A string calculation of the Kähler potentials for moduli of Z<sub>N</sub> orbifolds
|
Physics Letters B
|
We present a method for calculating the Kähler potentials of the moduli of Z<sub>N</sub> orbifolds directly from string theory. The explicit Kähler potentials associated with b<sub>(1,1)</sub> and b<sub>(1,2)</sub> moduli are given for any (2,0) symmetric Z<sub>N</sub> orbifold. These results are exact at the string tree level. © 1988.
|
["Cvetič M.", "Louis J.", "Ovrut B.A."]
|
["7005455946", "56224683100", "7004494548"]
| 1,988
| 97
|
[]
|
10.1016/0370-2693(88)91497-9
|
Article
|
English
|
[{"id": "60006297", "name": "Department of Physics, University of Pennsylvania, Philadelphia, PA 19104-6396, United States", "fullName": "Department of Physics, University of Pennsylvania", "reference": "a", "fullAddress": "Philadelphia, PA 19104-6396, United States", "departmentId": "100247007"}]
|
423
| 24,411
|
Geometric singular perturbation analysis of oxidation heat pulses for two-phase flow in porous media
|
Bulletin of the Brazilian Mathematical Society
|
When air or oxygen is injected into a petroleum reservoir, and oxidation or combustion is induced, a combustion front forms if heat loss to the surrounding rock formation is negligible. Here, we employ a simple model for combustion, which takes into account oil viscosity reduction, but neglects gas density dependence on temperature and uses a simplified oxidation reaction. We show that for small heat loss, this combustion front is actually the lead part of a pulse, while the trailing part of the pulse is a slow cooling process. If the heat loss is too large, we show that such a pulse does not exist. The proofs use geometric singular perturbation theory and center manifold reduction. © 2001, Sociedade Brasileira de Matemática.
|
["Schecter S.", "Marchesin D."]
|
["6701570920", "6701862716"]
| 2,001
| 6
|
["Combustion", "Conservation laws", "Multiphase flow", "Porous medium"]
|
10.1007/BF01233667
|
Article
|
English
|
[{"id": "60004923", "name": "Mathematics Department, North Carolina State University, Raleigh, NC 27695, United States", "fullName": "Mathematics Department, North Carolina State University", "reference": "a", "fullAddress": "Raleigh, NC 27695, United States", "departmentId": "112742332"}, {"id": null, "name": "22460-320 Rio de Janeiro, RJ, Estrada Dona Castorina 110, Brazil", "fullName": null, "reference": "b", "fullAddress": "22460-320 Rio de Janeiro, RJ, Estrada Dona Castorina 110, Brazil", "departmentId": null}]
|
424
| 24,473
|
A class of optimum importance sampling strategies
|
Information Sciences
|
The problem of estimating expectations of functionals of random vectors via simulation is investigated. As an alternative to simple averaging, an efficient form of Monte Carlo simulations known as Importance Sampling can be employed to produce arbitrarily accurate estimates of the expectation of interest. The fundamental problem in Importance Sampling is to determine the appropriate statistics under which to conduct the simulation. These statistics are typically determined from a constraint class by minimizing the variance of the Importance Sampling estimator over the class of admissible statistics. In previous work, the authors showed that minimizing the Importance Sampling variance is equivalent to finding the distribution which is closest to the unconstrained optimal distribution with respect to a specific Information-Theoretic f-divergence or Ali-Silvey distance. In this work, the authors determine the optimal biasing density from a constraint class whose controlling parameter is fundamental in the performance analysis of Importance Sampling. In addition, it is shown that the constrained optimal distribution from this class minimizes every statistical distance measure to the global optimal distribution and as a consequence is optimal with respect to a large family of nonlinear cost functions. Salient features of this distribution are: (1) unlike the unconstrained optimal solution, this distribution can be made independent of the parameter to be estimated and thus can admit to implementation, and (2) this distribution renders performance gains which can be made arbitrarily close to the optimal gains. Applications to estimating probabilities of rare events (e.g., error rates in communication systems) will be presented. Further analysis will show that in this case, the savings over Monte Carlo simulations become unbounded as the probability of the rare event diminishes. © 1995.
|
["Orsak G.C.", "Aazhang B."]
|
["55927217400", "7006212666"]
| 1,995
| 9
|
[]
|
10.1016/0020-0255(94)00116-S
|
Article
|
English
|
[{"id": "60018319", "name": "United States", "fullName": null, "reference": "a", "fullAddress": "United States", "departmentId": "103939020"}, {"id": "60005286", "name": "Computer Information Technology Institute, Department of Electrical and Computer Engineering, Rice University, Houston, TX 77251-1892, United States", "fullName": "Computer Information Technology Institute, Department of Electrical and Computer Engineering, Rice University", "reference": "b", "fullAddress": "Houston, TX 77251-1892, United States", "departmentId": "103308212"}]
|
425
| 24,574
|
Cross-validated spline methods for the estimation of three-dimensional tumor size distributions from observations on two-dimensional cross sections
|
Journal of the American Statistical Association
|
We study the problem of estimating the distribution of the three-dimensional radiuses of a collection of spheres, given measurements of the two-dimensional radiuses of a sample of planar cross sections. This problem arises in the estimation of the tumor size distribution of spherical microtumors induced in mouse livers following injection of a carcinogen. We first convert this problem to a form suitable for the application of cross-validated spline methods for the solution of ill-posed integral equations given noisy data. Then we develop special numerical techniques that will allow the spline methods to be accurately applied to integral equations like those associated with the present problem. We apply the resulting method to some mouse-liver data. The subject mouse liver has been completely dissected, allowing a rare comparison of the estimate with the “truth.” The statistical properties of the estimate are explored via Monte Carlo methods. The interplay between statistical and numerical analytic methods for problems like this are explored and the use of eigensequence plots for studying “ill posedness” is described. © 1984 Taylor & Francis Group, LLC.
|
["Nychka D.", "Wahba G.", "Goldfarb S.", "Pugh T."]
|
["6604045869", "6603672796", "57208871451", "7005913853"]
| 1,984
| 41
|
["Cross-validated splines", "Ill-posed problem", "Random spheres model", "Stereology", "Tumor size distribution"]
|
10.1080/01621459.1984.10477100
|
Article
|
English
|
[{"id": "60004923", "name": "Department of Statistics, North Carolina State University, Raleigh, NC, 27650, United States", "fullName": "Department of Statistics, North Carolina State University", "reference": "a", "fullAddress": "Raleigh, NC, 27650, United States", "departmentId": "109833092"}, {"id": "60032179", "name": "Department of Statistics, University of Wisconsin, Madison, WI, 53706, United States", "fullName": "Department of Statistics, University of Wisconsin", "reference": "b", "fullAddress": "Madison, WI, 53706, United States", "departmentId": "109698521"}, {"id": "60032179", "name": "Department of Pathology and Laboratory Medicine, University of Wisconsin, Madison, WI, 53706, United States", "fullName": "Department of Pathology and Laboratory Medicine, University of Wisconsin", "reference": "c", "fullAddress": "Madison, WI, 53706, United States", "departmentId": "113313355"}]
|
426
| 24,642
|
Reasoning with belief functions: An analysis of compatibility
|
International Journal of Approximate Reasoning
|
This paper examines the applicability of belief funstions methodology in three reasoning tasks: (1) representation of incomplete knowledge, (2) belief updating, and (3) evidence pooling. We find that belief functions have difficulties representing incomplete knowledge, primarily knowledge expressed in conditional sentences. In this context, we also show that the prevailing practices of encoding if-then rules as belief function expressions are inadequate, as they lead to counterintuitive conclusions under chaining, contraposition, and reasoning by cases. Next, we examine the role of belief functions in updating states of belief and find that, if partial knowledge is encoded and updated by belief function methods, the updating process violates basic patterns of plausibility and the resulting beliefs cannot serve as a basis for rational decisions. Finally, assessing their role in evidence pooling, we find that belief functions offer a rich language for describing the evidence gathered, highly compatible with the way people summarize observations. However, the methods available for integrating evidence into a coherent state of belief capable of supporting plausible decisions cannot make use of this richness and are challenged by simpler methods based on likelihood functions. © 1990.
|
["Pearl J."]
|
["7101604154"]
| 1,990
| 120
|
["belief functions", "conditional information", "Dempster-Shafer theory", "knowledge and evidence", "nonmonotonic reasoning"]
|
10.1016/0888-613X(90)90013-R
|
Article
|
English
|
[{"id": "60027550", "name": "Computer Science Department, UCLA, Los Angeles, CA, United States", "fullName": "Computer Science Department, UCLA", "reference": "a", "fullAddress": "Los Angeles, CA, United States", "departmentId": "100287525"}]
|
427
| 24,649
|
On the convexity of level lines of the fundamental mode in the clamped membrane problem, and the existence of convex solutions in a related free boundary problem
|
ZAMP Zeitschrift für angewandte Mathematik und Physik
|
It follows from a result of Brascamp and Lieb that the level curves of the first eigenfunction in the clamped membrane problem for a convex region Ω are convex. This paper gives an alternate proof of the above convexity theorem which makes use of the maximum principle - a method which also yields pointwise bounds for the curvature of the level curve through an arbitrary point in Ω. The convexity theorem is then used to establish the existence of convex solutions to a related free boundary problem. © 1981 Birkhäuser Verlag.
|
["Acker A.", "Payne L.E.", "Philippin G."]
|
["7003507607", "55654983000", "6603788588"]
| 1,981
| 31
|
[]
|
10.1007/BF00946979
|
Article
|
English
|
[{"id": "60029428", "name": "Mathematisches Institut I, Universität Karlsruhe, Germany", "fullName": "Mathematisches Institut I, Universität Karlsruhe", "reference": "a", "fullAddress": "Germany", "departmentId": "104488605"}, {"id": "60007776", "name": "Cornell University, Ithaca, New York, United States", "fullName": "Cornell University", "reference": "b", "fullAddress": "Ithaca, New York, United States", "departmentId": null}, {"id": "60032619", "name": "Université Laval, Canada", "fullName": "Université Laval", "reference": "c", "fullAddress": "Canada", "departmentId": null}]
|
428
| 24,686
|
How to compute the Wiener index of a graph
|
Journal of Mathematical Chemistry
|
The Wiener index of a graph G is equal to the sum of distances between all pairs of vertices of G. It is known that the Wiener index of a molecular graph correlates with certain physical and chemical properties of a molecule. In the mathematical literature, many good algorithms can be found to compute the distances in a graph, and these can easily be adapted for the calculation of the Wiener index. An algorithm that calculates the Wiener index of a tree in linear time is given. It improves an algorithm of Canfield, Robinson and Rouvray. The question remains: is there an algorithm for general graphs that would calculate the Wiener index without calculating the distance matrix? Another algorithm that calculates this index for an arbitrary graph is given. © 1988 J.C. Baltzer AO, Scientific Publishing Company.
|
["Mohar B.", "Pisanski T."]
|
["24480096600", "6701806018"]
| 1,988
| 99
|
[]
|
10.1007/BF01167206
|
Article
|
English
|
[{"id": "60069695", "name": "Department of Ma theima tics, University E.K. of Ljubljana, Ljubljana, 61111, Jadranska 19, Yugoslavia", "fullName": "Department of Ma theima tics, University E.K. of Ljubljana", "reference": "a", "fullAddress": "Ljubljana, 61111, Jadranska 19, Yugoslavia", "departmentId": "106881227"}, {"id": "60018491", "name": "Department of Mathematics and Statistics, Simon Fraser University, Burnaby, B. C., Canada", "fullName": "Department of Mathematics and Statistics, Simon Fraser University", "reference": "b", "fullAddress": "Burnaby, B. C., Canada", "departmentId": "100273081"}]
|
429
| 24,734
|
Intrinsic losses
|
Theory and Decision
|
Since the choice of a particular loss function strongly influences the resulting inference, it seems necessary to rely on "intrinsic" losses when no information is available about the utility function of the decision-maker, rather than to call for classical losses like the squared error loss. Since this setting is quite similar to the derivation of noninformative priors in Bayesian analysis, we first recall the conditions of this derivation and deduce from these conditions some requirements on the intrinsic losses. It then appears that these loss functions should only depend on the sampling distribution and that they should be independent of the parameterization of the distribution. The resulting estimators are therefore transformation equivariant. We study the properties of two natural intrinsic losses, namely entropy and Hellinger losses, and show that they can be expressed in closed form for exponential families. Moreover, the entropy loss also provides analytic expressions of Bayes estimators under conjugate priors; the derivation of Bayes estimators associated with the Hellinger loss is more cumbersome, as shown in Poisson and Gamma cases, while leading to similar estimators. © 1996 Kluwer Academic Publishers.
|
["Robert C.P."]
|
["15756310900"]
| 1,996
| 0
|
["Bayes estimator", "Conjugate prior", "Distributional distance", "Entropy", "Exponential families", "Fisher information", "Hellinger distance", "Non-informative prior", "Utility theory"]
|
10.1007/BF00133173
|
Article
|
English
|
[{"id": "60010447", "name": "INSEE, Centre de Recherche en Economie et Statistique, 92245 Malakoff Cedex, Timbre J320-3 Av. P. Larousse, France", "fullName": "INSEE, Centre de Recherche en Economie et Statistique", "reference": "a", "fullAddress": "92245 Malakoff Cedex, Timbre J320-3 Av. P. Larousse, France", "departmentId": null}]
|
430
| 24,742
|
Visual Recognition of Static/Dynamic Gesture: Gesture-Driven Editing System
|
Journal of Visual Languages and Computing
|
This paper presents the visual recognition of static gesture (SG) or dynamic gesture (DG). Gesture is one of the most natural interface tools for human-computer interaction (HCI) as well as for communication between human beings. In order to implement a human-like interface, gestures could be recognized using only visual information such as the visual mechanism of human beings; SGs and DGs can be processed concurrently as well. This paper aims at recognizing hand gestures obtained from the visual images on a 2D image plane, without any external devices. Gestures are spotted by a task-specific state transition based on natural human articulation. SGs are recognized using image moments of hand posture, while DGs are recognized by analyzing their moving trajectories on the hidden Markov models (HMMs). We have applied our gesture recognition approach to gesture-driven editing systems operating in real time. © 1999 Academic Press.
|
["Min B.-W.", "Yoon H.-S.", "Soh J.", "Ohashi T.", "Ejima T."]
|
["55414607400", "16551453900", "7006814996", "7201658211", "7005463102"]
| 1,999
| 15
|
[]
|
10.1006/jvlc.1999.0117
|
Article
|
English
|
[{"id": "60001558", "name": "Image Processing Department, Electron. Telecommunication Res. I., Yuseongku, Taejeon, 305-350, 161 Kajongdong, South Korea", "fullName": "Image Processing Department, Electron. Telecommunication Res. I.", "reference": "a", "fullAddress": "Yuseongku, Taejeon, 305-350, 161 Kajongdong, South Korea", "departmentId": "103126228"}, {"id": "60031838", "name": "Artificial Intelligence Department, Kyushu Inst. of Technology, (KIT), Iizuka, 820, Japan", "fullName": "Artificial Intelligence Department, Kyushu Inst. of Technology, (KIT)", "reference": "b", "fullAddress": "Iizuka, 820, Japan", "departmentId": "104617778"}]
|
431
| 24,772
|
A new method for expeditious ketone synthesis from acids via acyl hemiacetals
|
Journal of Organic Chemistry
| null |
["Mattson M.N.", "Rapoport H."]
|
["15121083700", "7005999996"]
| 1,996
| 18
|
[]
|
10.1021/jo9607471
|
Article
|
English
|
[{"id": "60025038", "name": "University of California, Berkeley, CA 94720-1460, United States", "fullName": "University of California", "reference": "a", "fullAddress": "Berkeley, CA 94720-1460, United States", "departmentId": null}]
|
432
| 24,773
|
A posteriori error estimation for hierarchic models of elliptic boundary value problems on thin domains
|
SIAM Journal on Numerical Analysis
|
The boundary value problem of heat conduction in a three-dimensional laminated plate is approximated by a hierarchy of two-dimensional models. Computable a posteriori indicators and estimators of the modeling error in various norms are derived and their local spectral and asymptotic exactness is proved. Sharp estimates for their effectivity indices are also obtained.
|
["Babuška I.", "Schwab C."]
|
["7101909209", "13205406700"]
| 1,996
| 0
|
["A posteriori error estimation", "Hierarchic modeling", "Plates"]
|
10.1137/0733013
|
Article
|
English
|
[{"id": "60020304", "name": "Inst. for Phys. Sci. and Technology, University of Maryland, College Park, MD 20742, United States", "fullName": "Inst. for Phys. Sci. and Technology, University of Maryland", "reference": "a", "fullAddress": "College Park, MD 20742, United States", "departmentId": "104027109"}, {"id": "60025858", "name": "Sem. für Angewandte Mathematik, ETH Zürich, CH-8092 Zürich, Rämistrasse 101, Switzerland", "fullName": "Sem. für Angewandte Mathematik, ETH Zürich", "reference": "b", "fullAddress": "CH-8092 Zürich, Rämistrasse 101, Switzerland", "departmentId": "104313720"}]
|
433
| 24,787
|
Finite-difference calculations for hydrodynamic flows containing discontinuities
|
Journal of Computational Physics
|
In this paper it is shown how to calculate the steady hypersonic inviscid flow, including a detached shock, around a blunt body. The steady flow is obtained as the limit for large time of time-dependent flow, starting with plane flow impinging on the body. The transient flow is the solution of a mixed initial-boundary-value problem for the partial differential equations of inviscid fluids which is solved by a difference scheme proposed by Lax and Wendroff. Our calculations show that by itself this difference scheme tends to be unstable and does not converge to the steady flow; by adding an artificial viscosity term we have succeeded in stabilizing the calculation. Section 4 is a fairly convincing theoretical explanation of this stabilizing effect and a new stability condition is derived. Both plane and cylindrical symmetries are considered; in the cylindrical case a variant of Richtmyer's [4] two-step version of the Lax-Wendroff difference scheme is used. This method, as does Richtmyer's, requires much fewer arithmetic operations as compared with the one-step method. © 1967.
|
["Burstein S.Z."]
|
["24598757500"]
| 1,966
| 43
|
[]
|
10.1016/0021-9991(66)90003-9
|
Article
|
English
|
[{"id": "60021784", "name": "Courant Institute of Mathematical Sciences, New York University, United States", "fullName": "Courant Institute of Mathematical Sciences, New York University", "reference": "a", "fullAddress": "United States", "departmentId": null}]
|
434
| 24,965
|
Bounds on one-dimensional exchange energies with application to lowest Landau band quantum mechanics
|
Letters in Mathematical Physics
|
By means of a generalization of the Fefferman - de la Llave decomposition we derive a general lower bound on the interaction energy of one-dimensional quantum systems. We apply this result to a specific class of lowest Landau band wave functions.
|
["Hainzi C.", "Seiringer R."]
|
["56180837000", "6601959106"]
| 2,001
| 7
|
["Exchange energy", "Lowest Landau band", "One-dimensional quantum systems"]
|
10.1023/A:1010951905548
|
Article
|
English
|
[{"id": "60025988", "name": "Inst. für Theoretische Physic, Universität Wien, A-1090 Vienna, Boltzmanngasse 5, Austria", "fullName": "Inst. für Theoretische Physic, Universität Wien", "reference": "a", "fullAddress": "A-1090 Vienna, Boltzmanngasse 5, Austria", "departmentId": "104320302"}]
|
435
| 24,973
|
Mechanics of disordered solids. I. Percolation on elastic networks with central forces
|
Physical Review B
|
Bond and site percolation on two- and three-dimensional elastic and superelastic percolation networks with central forces are studied using large-scale Monte Carlo simulations and finite-size scaling analysis. A highly accurate method of estimating the elastic percolation threshold pce is proposed. For bond percolation (BP) on a triangular network we find pce0.6410.001, for site percolation (SP), pce 0.7130.002, and for BP on a bcc network we obtain, pce0.7370.002. We calculate the force distribution (FD) in these networks, i.e., the distribution of forces that the intact bonds of the networks suffer, near and away from pce. Far from pce the FD is unimodal, but as pce is approached, it becomes bimodal. We find that for BP on the triangular network near pce, the zeroth and second moments of the FD belong to the universality class of bond-bending models discussed in paper II. However, this is not the case for SP on the triangular network and BP on the bcc network. In particular, for the bcc network we find f/e2.1, where f and e are the critical exponents of the elastic moduli and the correlation length of the system, respectively. This value of f/e is distinctly different from that of bond-bending models, which is about 4.3. © 1993 The American Physical Society.
|
["Arbabi S.", "Sahimi M."]
|
["7004752129", "35561714900"]
| 1,993
| 124
|
[]
|
10.1103/PhysRevB.47.695
|
Article
|
English
|
[{"id": "60029311", "name": "Department of Chemical Engineering, University of Southern California, Los Angeles, CA 90089-1211, United States", "fullName": "Department of Chemical Engineering, University of Southern California", "reference": "a", "fullAddress": "Los Angeles, CA 90089-1211, United States", "departmentId": "100243707"}]
|
436
| 25,033
|
Transitional periodic domain structure in thin films of magnetically uniaxial materials
|
Czechoslovak Journal of Physics
|
The paper gives the theory of transitional domain structure in thin films of uniaxial ferromagnets with easy axis perpendicular to the film. It is proved that in a certain range of thicknesses this structure is energetically more advantageous than the plate structure originally proposed by Kittel. The proposed model explains the transition from the Kittel structure to the homogeneously magnetized film. © 1963 Czechoslovak Academy of Sciences.
|
["Kaczér J.", "Zelený M.", "Šuda P."]
|
["6602779153", "57193005143", "16544250300"]
| 1,963
| 34
|
[]
|
10.1007/BF01689557
|
Article
|
English
|
[{"id": "60068959", "name": "Fyzikálni ústav ČSAV, Praha, Czech Republic", "fullName": "Fyzikálni ústav ČSAV", "reference": "a", "fullAddress": "Praha, Czech Republic", "departmentId": null}]
|
437
| 25,035
|
Kernel smoothing approaches to nonparametric item characteristic curve estimation
|
Psychometrika
|
The option characteristic curve, the relation between ability and probability of choosing a particular option for a test item, can be estimated by nonparametric smoothing techniques. What is smoothed is the relation between some function of estimated examinee ability rankings and the binary variable indicating whether or not the option was chosen. This paper explores the use of kernel smoothing, which is particularly well suited to this application. Examples show that, with some help from the fast Fourier transform, estimates can be computed about 500 times as rapidly as when using commonly used parametric approaches such as maximum marginal likelihood estimation using the three-parameter logistic distribution. Simulations suggest that there is no loss of efficiency even when the population curves are three-parameter logistic. The approach lends itself to several interesting extensions. © 1991 The Psychometric Society.
|
["Ramsay J.O."]
|
["7103327414"]
| 1,991
| 221
|
["bootstrapping", "fast Fourier transform", "option characteristic curve", "polytomous response", "trace line"]
|
10.1007/BF02294494
|
Article
|
English
|
[{"id": "60002494", "name": "McGill University, Canada", "fullName": "McGill University", "reference": "a", "fullAddress": "Canada", "departmentId": null}]
|
438
| 25,062
|
Completeness theorems, incompleteness theorems and models of arithmetic
|
Transactions of the American Mathematical Society
|
Let a be a consistent extension of Peano arithmetic and let (formula Presented) denote the set of (formula Presented) consequences of a. Employing incompleteness theorems to generate independent formulas and completeness theorems to construct models, we build nonstandard models of (formula Presented) in which the standard integers are (formula Presented) definable. We thus pinpoint induction axioms which are not provable in (formula Presented) in particular, we show that (parameter free) (formula Presented)-induction is not provable in Primitive Recursive Arithmetic. Also, we give a solution of a problem of Gaifman on the existence of roots of diophantine equations in end extensions and answer questions about existentially complete models of (formula Presented)Furthermore, it is shown that the proof of the Gödel Completeness Theorem cannot be formalized in (formula Presented) and that the MacDowell-Specker Theorem fails for all truncated theories (formula Presented). © 1978 American Mathematical Society.
|
["Mc Aloon K."]
|
["24574528900"]
| 1,978
| 20
|
[]
|
10.1090/S0002-9947-1978-0487048-9
|
Article
|
English
|
[{"id": "60123796", "name": "UER of Mathematics, University of Paris VII, Tour 45-55-5me Etage, Paris, 75221, 2 Place Jussieu, France", "fullName": "UER of Mathematics, University of Paris VII, Tour 45-55-5me Etage", "reference": "a", "fullAddress": "Paris, 75221, 2 Place Jussieu, France", "departmentId": "124015701"}]
|
439
| 25,086
|
Optimal meshes for integrals in real- and reciprocal-space unit cells
|
Physical Review B
|
We present a detailed method to construct uniform meshes for fast Fourier transforms in electronic-structure calculations. We show that a drastic reduction in the mesh size can be frequently achieved by using an unconventional set of primitive lattice vectors. The same method can be applied also to obtain optimum sets of special points for Brillouin-zone integrals, generalizing previous schemes. © 1992 The American Physical Society.
|
["Moreno J.", "Soler J.M."]
|
["57212875355", "7202054024"]
| 1,992
| 194
|
[]
|
10.1103/PhysRevB.45.13891
|
Article
|
English
|
[{"id": "60026796", "name": "Departamento de Física de la Materia Condensada, Universidad Autnoma de Madrid, E-28049 Madrid, Spain", "fullName": "Departamento de Física de la Materia Condensada, Universidad Autnoma de Madrid", "reference": "a", "fullAddress": "E-28049 Madrid, Spain", "departmentId": "104355234"}]
|
440
| 25,126
|
Computing the complete massless spectrum of a Landau-Ginzburg orbifold
|
Nuclear Physics, Section B
|
We develop techniques to compute the complete massless spectrum in heterotic string compactification on N = 2 supersymmetric Landau-Ginzburg orbifolds. This includes not just the familiar charged fields, but also the gauge singlets. The number of gauge singlets can vary in the moduli space of a given compactification and can differ from what it would be in the large radius limit of the corresponding Calabi-Yau. Comparison with exactly soluble Gepner models provides a confirmation of our results at Gepner points. Our methods carry over straightforwardly to (0, 2) Landau-Ginzburg models. © 1993.
|
["Kachru S.", "Witten E."]
|
["7004736248", "7005343881"]
| 1,993
| 43
|
[]
|
10.1016/0550-3213(93)90093-5
|
Article
|
English
|
[{"id": "60003269", "name": "Joseph Henry Laboratories, Princeton University, Princeton, NJ 08544, Jadwin Hall, United States", "fullName": "Joseph Henry Laboratories, Princeton University", "reference": "a", "fullAddress": "Princeton, NJ 08544, Jadwin Hall, United States", "departmentId": "103216411"}, {"id": "60027485", "name": "School of Natural Sciences, Institute for Advanced Study, Princeton, NJ 08540, Olden Lane, United States", "fullName": "School of Natural Sciences, Institute for Advanced Study", "reference": "b", "fullAddress": "Princeton, NJ 08540, Olden Lane, United States", "departmentId": "105313356"}]
|
441
| 25,360
|
Plane symmetric spacetimes admitting inheriting conformal killing vector fields
|
Classical and Quantum Gravity
|
Perfect fluid, plane symmetric spacetimes admitting a (proper) inheriting conformal Killing vector (ICKV) are studied. A result is proven on the general form that an ICKV can take in such a spacetime, which is then utilized to find all perfect fluid, plane symmetric ICKV spacetimes (subject to certain physical conditions). These spacetimes are discussed. In particular, we prove that if a perfect fluid, plane symmetric spacetime, in which the perfect fluid satisfies the barotropic equation of state and in which mu )0 and mu +p not=0, admits a (proper) ICKV, then the spacetime is necessarily at Friedmann-Robertson-Walker spacetime, or, possibly, a plane symmetric analogue of a generalized Gutman-Be'spalko-Wesson spacetime or a special static, shear-free spacetime.
|
["Coley A.A.", "Czapor S.R."]
|
["7006407260", "6506644626"]
| 1,992
| 13
|
[]
|
10.1088/0264-9381/9/7/011
|
Article
|
English
|
[{"id": "60015913", "name": "Department of Mathematics, Statistics and Computing Science, Dalhousie University, Halifax, NS B3H 3J5, Canada", "fullName": "Department of Mathematics, Statistics and Computing Science, Dalhousie University", "reference": "a", "fullAddress": "Halifax, NS B3H 3J5, Canada", "departmentId": "103824211"}]
|
442
| 25,394
|
Scheduling manufacturing systems with work-in-process inventory control: Reentrant systems
|
OR Spectrum
|
In this paper, we propose a procedure for production flow control in reentrant manufacturing systems. The system under study consists of N machines and produces M product types simultaneously. Each part goes through the system following a predefined process and may visit a machine many times. All machines are subject to random failures and need random repair times. The scheduling objectives are to keep the production close to demand and to keep the WIP inventory level and cycle times at low values. The model is motivated by semiconductor fabrication production. A three-level hierarchical controller is constructed to regulate the production. At the top level of this hierarchy, we perform capacity planning by selecting the desirable buffer sizes and the target production level for each operation. A production flow rate controller is at the middle level which recalculates the production rates whenever a machine fails or is starved or blocked. The loading times for individual parts are determined at the bottom level of the hierarchy. Comparison with alternative control is made through simulation and it shows that the control policy performs well. © Springer-Verlag 1996.
|
["Bai S.X.", "Gershwin S.B."]
|
["7202051007", "35619380700"]
| 1,996
| 9
|
["Stochastic production scheduling", "Work-in-process inventory control"]
|
10.1007/BF01540154
|
Article
|
English
|
[{"id": "60013959", "name": "Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, United States", "fullName": "Department of Industrial and Systems Engineering, University of Florida", "reference": "a", "fullAddress": "Gainesville, FL 32611, United States", "departmentId": "113419004"}, {"id": "60022195", "name": "Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, 77 Massachusetts Avenue, United States", "fullName": "Department of Mechanical Engineering, Massachusetts Institute of Technology", "reference": "b", "fullAddress": "Cambridge, MA 02139, 77 Massachusetts Avenue, United States", "departmentId": "113327352"}]
|
443
| 25,463
|
Confinement mechanism in various abelian projections of SU(2) lattice gluodynamics
|
Physics Letters B
|
We show that the monopole confinement mechanism in lattice gluodynamics may be a particular feature of the maximal abelian projection. We give an explicit example of the SU(2) → U(1) projection (the minimal abelian projection), in which the confinement is due to topological objects other than monopoles. We perform an analytical and numerical study of the loop expansion of the Faddeev-Popov determinant for the maximal and the minimal abelian projections, and discuss the fundamental modular region for these projections. © 1995.
|
["Chernodub M.N.", "Polikarpov M.I.", "Veselov A.I."]
|
["54790519800", "7006614180", "7101715404"]
| 1,995
| 40
|
[]
|
10.1016/0370-2693(94)01353-E
|
Article
|
English
|
[{"id": "60018710", "name": "ITEP, Moscow, 117259, Russian Federation", "fullName": "ITEP", "reference": "a", "fullAddress": "Moscow, 117259, Russian Federation", "departmentId": null}]
|
444
| 25,464
|
Estimating the asymptotic covariance matrix for quantile regression models a Monte Carlo study
|
Journal of Econometrics
|
This Monte Carlo study examines several estimation procedures of the asymptotic covariance matrix in the quantile and censored quantile regression models: design matrix bootstrap, error bootstrapping, order statistic, sigma bootstrap, homoskedastic kernel, and heteroskedastic kernel. The Monte Carlo samples are drawn from two alternative data sets: 1. (a) the unaltered Current Population Survey (CPS) for 1987 and 2. (b) this CPS data with independence between error term and regressors imposed. This special setup allows one to evaluate the estimators under various realistic scenarios. The results favor the design bootstrap for the general case, but also support the order statistic when the error term is independent of the regressors. © 1995.
|
["Buchinsky M."]
|
["6601949789"]
| 1,995
| 255
|
["Asymptotic covariance matrix", "Quantile and censored quantile regression"]
|
10.1016/0304-4076(94)01652-G
|
Article
|
English
|
[{"id": "60005455", "name": "Department of Economics, Yale University, New Haven, CT 06520-8264, United States", "fullName": "Department of Economics, Yale University", "reference": "a", "fullAddress": "New Haven, CT 06520-8264, United States", "departmentId": "103317529"}]
|
445
| 25,466
|
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
|
Mathematical Programming
|
Recently, Mehrotra [3] proposed a predictor-corrector primal-dual interior-point algorithm for linear programming. At each iteration, this algorithm utilizes a combination of three search directions: the predictor, the corrector and the centering directions, and requires only one matrix factorization. At present, Mehrotra's algorithmic framework is widely regarded as the most practically efficient one and has been implemented in the highly successful interior-point code OB1 [2]. In this paper, we study the theoretical convergence properties of Mehrotra's interior-point algorithmic framework. For generality, we carry out our analysis on a horizontal linear complementarity problem that includes linear and quadratic programming, as well as the standard linear complementarity problem. Under the monotonicity assumption, we establish polynomial complexity bounds for two variants of the Mehrotra-type predictor-corrector interior-point algorithms. These results are summarized in the last section in a table. © 1995 The Mathematical Programming Society, Inc.
|
["Zhang Y.", "Zhang D."]
|
["55949826500", "7405359841"]
| 1,995
| 46
|
["Mehrotra's predictor-corrector algorithm", "Polynomial complexity"]
|
10.1007/BF01585769
|
Article
|
English
|
[{"id": "60024997", "name": "Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, 21228-5398, MD, United States", "fullName": "Department of Mathematics and Statistics, University of Maryland Baltimore County", "reference": "a", "fullAddress": "Baltimore, 21228-5398, MD, United States", "departmentId": "105340227"}]
|
446
| 25,476
|
Cooperative learning: An approach for large enrollment courses
|
Journal of Chemical Education
|
We have found that it is possible to incorporate group learning strategies into large enrollment classes without sacrificing content. Student response has been exceptionally favorable, and we feel that these strategies can be integrated into any course. Though cooperative learning is not a panacea for all that ails the teaching of large enrollment courses it can be a significant tool for the instructor if used judiciously and thoughtfully.
|
["Cooper M.M."]
|
["35766303800"]
| 1,995
| 79
|
[]
|
10.1021/ed072p162
|
Article
|
English
|
[{"id": "60026610", "name": "Clemson University, Clemson, SC 29634, United States", "fullName": "Clemson University", "reference": "a", "fullAddress": "Clemson, SC 29634, United States", "departmentId": null}]
|
447
| 25,496
|
A commutant lifting theorem for triangular matrices with diverse applications
|
Integral Equations and Operator Theory
|
A lifting theorem for representations of the algebra of block upper triangular matrices is proved analogous to the commutatant lifting theorem of Sarason and Sz.-Nagy and Foias. Included is a description by linear fractional maps of all solutions of the lifting problem. This first part of the paper contains the statements of the main results and applications to matrix interpolation and completion problems. © 1985 Birkhäuser Verlag.
|
["Ball J.A.", "Gohberg I."]
|
["7401813437", "7006542432"]
| 1,985
| 22
|
[]
|
10.1007/BF01202814
|
Article
|
English
|
[{"id": "60027090", "name": "Department of Mathematics, Virginia Polytechnic Inst. and State University, Blacksburg, 24061, VA, United States", "fullName": "Department of Mathematics, Virginia Polytechnic Inst. and State University", "reference": "a", "fullAddress": "Blacksburg, 24061, VA, United States", "departmentId": "100273167"}, {"id": "60005681", "name": "School of Math. Sci. Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel", "fullName": "School of Math. Sci. Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University", "reference": "b", "fullAddress": "Tel Aviv, Israel", "departmentId": "103328391"}]
|
448
| 25,518
|
On cone convexity of set-valued maps
|
Nonlinear Analysis, Theory, Methods and Applications
| null |
["Kuroiwa D.", "Tanaka T.", "Ha T.X.D."]
|
["6507090258", "14068022300", "7203014555"]
| 1,997
| 111
|
["And naturally quasi cone-convexity", "Cone-convexity", "Cone-convexlikeness", "Convexity of set-valued maps", "Properly quasi cone-convexity", "Quasi cone-convexity", "Set-valued analysis"]
|
10.1016/S0362-546X(97)00213-7
|
Article
|
English
|
[{"id": "60026275", "name": "Dept. of Math. and Computer Science, Interdisplinary Fac. Sci. and Eng., Shimane University, Matsue 690, Japan", "fullName": "Dept. of Math. and Computer Science, Interdisplinary Fac. Sci. and Eng., Shimane University", "reference": "a", "fullAddress": "Matsue 690, Japan", "departmentId": "104335028"}, {"id": "60033085", "name": "Department of Information Science, Faculty of Science, Hirosaki University, Hirosaki 036, Japan", "fullName": "Department of Information Science, Faculty of Science, Hirosaki University", "reference": "b", "fullAddress": "Hirosaki 036, Japan", "departmentId": "104680737"}, {"id": "60071393", "name": "Hanoi Institute of Mathematics, Boho, Hanoi, P.O.Box 631, Viet Nam", "fullName": "Hanoi Institute of Mathematics", "reference": "c", "fullAddress": "Boho, Hanoi, P.O.Box 631, Viet Nam", "departmentId": null}]
|
449
| 25,627
|
The factors affecting strategic information systems applications. An empirical assessment
|
Information and Management
|
The strategic potential of information systems (IS) is now well accepted. This paper examines some key characteristics of strategic IS applications and investigates their relationship with contextual factors representing the industry environment, the organization structure, and the IS function. Empirical analysis of 81 strategic IS applications in large companies shows that these applications contribute mainly to functions involving customers or competitors, primarily to reduce cost or provide some differentiation. They have limited effect on suppliers. However, the effect on suppliers is greater in decentralized organizations and in heterogeneous environments. Moreover, a heterogeneous environment and a mature IS function enhance the role of information storage. The implications for future research and for IS practice are examined. © 1992.
|
["King W.R.", "Sabherwal R."]
|
["7401988427", "6701836761"]
| 1,992
| 82
|
["Competitive advantage", "Industry environment", "Information systems maturity", "Information technology", "Organization structure", "Strategic utilization"]
|
10.1016/0378-7206(92)90046-I
|
Article
|
English
|
[{"id": "60015543", "name": "University of Pittsburgh, Pittsburgh, PA, United States", "fullName": "University of Pittsburgh", "reference": "a", "fullAddress": "Pittsburgh, PA, United States", "departmentId": null}, {"id": "60015206", "name": "Florida International University, Miami, FL, United States", "fullName": "Florida International University", "reference": "b", "fullAddress": "Miami, FL, United States", "departmentId": null}]
|
450
| 25,750
|
New extremal ternary self-dual codes
|
Australasian Journal of Combinatorics
|
Compared to binary self-dual codes, few methods are known to construct ternary self-dual codes. In this paper, a construction method for ternary self-dual codes is presented. Using this method, a number of new extremal ternary self-dual codes are obtained from weighing matrices. In addition, a classification is given for extremal ternary self-dual codes of length 40 constructed from Hadamard matrices of order 20.
|
["Harada M."]
|
["55439196100"]
| 1,998
| 16
|
[]
| null |
Article
|
English
|
[{"id": "60023147", "name": "Department of Mathematics, Okayama University, Okayama 700, Japan", "fullName": "Department of Mathematics, Okayama University", "reference": "a", "fullAddress": "Okayama 700, Japan", "departmentId": "104177176"}, {"id": "60016074", "name": "Department of Mathematical Sciences, Yamagata University, Yamagata 990, Japan", "fullName": "Department of Mathematical Sciences, Yamagata University", "reference": "b", "fullAddress": "Yamagata 990, Japan", "departmentId": "103831361"}]
|
451
| 25,761
|
Accurate ab initio energetics of extended systems via explicit correlation embedded in a density functional environment
|
Chemical Physics Letters
|
We present a new embedding technique that combines density functional theory (DFT) and explicit electron-correlation techniques. We construct a periodic-DFT-based embedding potential as a local one-electron operator within more accurate electron-correlation calculations. We demonstrate how DFT calculations can be systematically improved via this procedure. We benchmark the method against nearly exact calculations with a simple model of Li<sub>2</sub>Mg<sub>2</sub> and further corroborate it with an application to the experimentally well studied CO/Cu(111) system. Our results are in good agreement with near-full configuration interaction (CI) calculations in the former case and experimental adsorbate binding energies in the latter.
|
["Govind N.", "Wang Y.A.", "Da Silva A.J.R.", "Carter E.A."]
|
["7003951565", "9846166700", "35565649000", "7202462172"]
| 1,998
| 143
|
[]
|
10.1016/S0009-2614(98)00939-7
|
Article
|
English
|
[{"id": "60027550", "name": "Dept. of Chemistry and Biochemistry, Box 951569, University of California, Los Angeles, CA 90095-1569, United States", "fullName": "Dept. of Chemistry and Biochemistry, Box 951569, University of California", "reference": "a", "fullAddress": "Los Angeles, CA 90095-1569, United States", "departmentId": "113439285"}]
|
452
| 25,810
|
Dynamic reconfiguration of optically interconnected networks with time-division multiplexing
|
Journal of Parallel and Distributed Computing
|
Routing performance of optical interconnection networks is limited by both switch complexity and network connectivity. One way to overcome these limitations is to allocate the network bandwidth in a time-division multiplexed (TDM) fashion. With this technique, an appropriate subset of input-to-output connections can be established during a time slot and all possible connections can be established over several time slots. Emulating a fully connected network, however, requires a large multiplexing degree, and thus introduces latencies which may be prohibitive. As a solution, we propose a technique called reconfiguration with time-division multiplexing (RTDM). With RTDM, only a subset, as required by applications, of all possible connections needs to be multiplexed in the network by letting the network go through a sequence of configurations. Network reconfiguration with TDM can be done either statically or dynamically. Static RTDM is applied when communication requirements of an application are known a priori. This paper deals mainly with dynamic RTDM, which requires run time control to accommodate dynamic connection requests. We show that reconfiguration overhead can be amortized over a sequence of configurations. In particular, we describe how the complexity of a dynamic reconfiguration control algorithm can be reduced through pipelined processing of requests. Our simulations show that dynamic RTDM allows for fair and fast allocation of network resources to connection requests. As a result, network service time decreases and communication efficiency increases. © 1994 Academic Press, Inc.
|
["Qiao C.", "Melhem R.", "Chiarulli D.", "Levitan S."]
|
["7101795631", "7006756147", "7003686620", "7006340623"]
| 1,994
| 20
|
[]
|
10.1006/jpdc.1994.1086
|
Article
|
English
|
[{"id": "60015543", "name": "Department of Computer Science and Electrical Engineering, University of Pittsburgh, Pittsburgh, PA 15260, United States", "fullName": "Department of Computer Science and Electrical Engineering, University of Pittsburgh", "reference": "a", "fullAddress": "Pittsburgh, PA 15260, United States", "departmentId": "115598273"}, {"id": "60032083", "name": "Department of ECE, State University of New York at Buffalo, Amherst, NY, 14260, United States", "fullName": "Department of ECE, State University of New York at Buffalo", "reference": "b", "fullAddress": "Amherst, NY, 14260, United States", "departmentId": "100292279"}]
|
453
| 25,874
|
On structural identifiability
|
Mathematical Biosciences
|
In this article we introduce a new concept, structural identifiability, which plays a central role in identification problems. The concept is useful when answering questions such as: To what extent is it possible to get insight into the internal structure of a system from input-output measurements? What experiments are necessary in order to determine the internal couplings uniquely? The definition of the concept of an identifiable structure is given. Criteria as well as certain identifiable structures are discussed. Particular emphasis is given to compartmental models. © 1970.
|
["Bellman R.", "Åström K.J."]
|
["7005844397", "23144903200"]
| 1,970
| 536
|
[]
|
10.1016/0025-5564(70)90132-X
|
Article
|
English
|
[{"id": "60029311", "name": "Department of Mathematics, Electrical Engineering and Medicine University of Southern California, Los Angeles, CA, United States", "fullName": "Department of Mathematics, Electrical Engineering and Medicine University of Southern California", "reference": "a", "fullAddress": "Los Angeles, CA, United States", "departmentId": "105389968"}, {"id": "60118609", "name": "Division of Automatic Control Lund Institute of Technology Lund, Sweden", "fullName": "Division of Automatic Control Lund Institute of Technology Lund", "reference": "b", "fullAddress": "Sweden", "departmentId": null}]
|
454
| 25,910
|
Signalling systems for individual recognition: an information theory approach
|
Animal Behaviour
|
This paper develops a quantitative method for measuring the information capacity of an animal's 'signature system', i.e. the set of cues by which individuals are identified. The information measure (H<sub>s</sub>) is derived by applying Shannon's measure for the information in a continuous variable to a simple linear model. The model is essentially the analysis of variance model II (random effects), and is implicit in the many ANOVAs and discriminant function analyses that have been done on the signature systems of animals. For multivariate measurements, a principal components transformation of the data permits the information in the independent components to be added to give the total information. An analysis of illustrative data sets reveals a close correlation between H<sub>s</sub> and the probability of a correct classification of an individual (P) obtained by discriminant function analysis. H<sub>s</sub> has the advantage, however, that it is a population estimate whereas the value of P is tied to the number of individuals in the sample. The information analysis approach may prove valuable for comparative analyses where evolutionary hypotheses predict one species to have a better developed signature system than another. © 1989 The Association for the Study of Animal Behaviour.
|
["Beecher M.D."]
|
["7003430907"]
| 1,989
| 196
|
[]
|
10.1016/S0003-3472(89)80087-9
|
Article
|
English
|
[{"id": "60015481", "name": "Department of Psychology, University of Washington, Seattle, WA 98195, United States", "fullName": "Department of Psychology, University of Washington", "reference": "a", "fullAddress": "Seattle, WA 98195, United States", "departmentId": "108213006"}]
|
455
| 25,993
|
Timing verification by successive approximation
|
Information and Computation
|
We present an algorithm for verifying that a model M with timing constraints satisfies a given temporal property T. The model M is given as a parallel composition of ω-automata P<sub>i</sub>, where each automaton P<sub>i</sub> is constrained by bounds on delays. The property T is given as an ω-automaton as well, and the verification problem is posed as a language inclusion question ∡(M) ⊆ ∡(T). In constructing the composition M of the constrained automata P<sub>i</sub>, one needs to rule out the behaviors that are inconsistent with the delay bounds, and this step is (provably) computationally expensive. We propose an iterative solution which involves generating successive approximations M<sub>j</sub> to M, with containment ∡(M) ⊆ ∡(M<sub>j</sub>) and monotone convergence ∡(M<sub>j</sub>) → ∡(M) within a bounded number of steps. As the succession progresses, the approximations M<sub>j</sub> become more complex. At any step of the iteration one may get a proof or a counter-example to the original language inclusion question. The described algorithm is implemented into the verifier Cospan. We illustrate the benefits of our strategy through some examples. © 1995 Academic Press, Inc.
|
["Alur R.", "Itai A.", "Kurshan R.P.", "Yannakakis M."]
|
["7006612991", "57190804813", "7003263515", "35560952800"]
| 1,995
| 55
|
[]
|
10.1006/inco.1995.1059
|
Article
|
English
|
[{"id": "60021378", "name": "AT and T Bell Laboratories, Murray Hill, NJ 07974, United States", "fullName": "AT and T Bell Laboratories", "reference": "a", "fullAddress": "Murray Hill, NJ 07974, United States", "departmentId": null}]
|
456
| 26,055
|
Effective-field model with correlations for Ising systems
|
Physical Review B
|
Using the techniques introduced by Honmura and Kaneyoshi, we show that two sets of identities for the two-state Ising model with z nearest neighbors can be used as a basis for various approximation schemes which can systematically include correlation effects. In one dimension the results in zero field are exact for the magnetization, nearest-neighbor correlation function, and critical temperature. By neglecting correlations of more than three sites we introduce a simple approximation in two and three dimensions for the critical temperature. This simple approximation yields results which improve on those of the Bethe approximation. We discuss how the approximation may be improved and extended to other Ising problems. © 1982 The American Physical Society.
|
["Taggart G.B.", "Fittipaldi I.P."]
|
["22973673600", "6701576080"]
| 1,982
| 44
|
[]
|
10.1103/PhysRevB.25.7026
|
Article
|
English
|
[{"id": "60002476", "name": "Department of Physics, Virginia Commonwealth University, Richmond, VA 23284", "fullName": "Department of Physics, Virginia Commonwealth University", "reference": "a", "fullAddress": "Richmond, VA 23284", "departmentId": "103174862"}, {"id": "60031482", "name": "Departamento de Fisica, Universidade Federal de Pernambuco, 50000 Recife, Pernambuco, Brazil", "fullName": "Departamento de Fisica, Universidade Federal de Pernambuco", "reference": "b", "fullAddress": "50000 Recife, Pernambuco, Brazil", "departmentId": "100301108"}]
|
457
| 26,088
|
Some integral inequalities and absolute continuity of a symmetrical random translation
|
Journal of Functional Analysis
|
The aim of this paper is to prove the inequality [formula] for a probability density function f(hook)(x), to prove some equalities and inequalities among the related integrals, and then, as an application, to prove that, if ∫<sup>+∞</sup><sub>-∞</sub>(f(hook)″(x)<sup>2</sup>/f(hook)(x)) dx < ∞, an IID sequence X= (X<sub>k</sub>) with the distribution f(hook)(x) dx and Y = (Y<sub>k</sub>) is an independent and symmetric random sequence also independent of X, such that Y ∈ l<sub>4</sub>, a.s. then X and X + Y = (X<sub>k</sub> + T<sub>k</sub>) induce mutually absolutely continuous probability measures on the sequence space. These results improve those in K. Kitada and H. Sato [On the absolute continuity of infinite product measure and its convolution, Probab. Theory Related Fields81 (1989), 609-627] and generalize the problem of L. A. Shepp [Distinguishing a sequence of random variables from a translate of itself, Ann. Math. Statist.36 (1965), 1107-1112]. © 1993 Academic Press Limited.
|
["Sato H.", "Watari C."]
|
["57189551728", "57213243396"]
| 1,993
| 4
|
[]
|
10.1006/jfan.1993.1067
|
Article
|
English
|
[{"id": "60011047", "name": "Department of Mathematics, Faculty of Science, Kyushu University-33, Hakozaki, Fukuoka, 812, Japan", "fullName": "Department of Mathematics, Faculty of Science, Kyushu University-33", "reference": "a", "fullAddress": "Hakozaki, Fukuoka, 812, Japan", "departmentId": "109544657"}, {"id": "60033089", "name": "Department of Mathematics, Faculty of Liberal Arts, Tohoku Gakuin University, Izumi, Sendai, 981-31, Japan", "fullName": "Department of Mathematics, Faculty of Liberal Arts, Tohoku Gakuin University", "reference": "b", "fullAddress": "Izumi, Sendai, 981-31, Japan", "departmentId": "105447517"}]
|
458
| 26,105
|
A sharp rearrangement inequality for the fractional maximal operator
|
Studia Mathematica
|
We prove a sharp pointwise estimate of the nonincreasing rearrangement of the fractional maximal function of f, M<sub>γ</sub>f, by an expression involving the nonincreasing rearrangement of f. This estimate is used to obtain necessary and sufficient conditions for the boundedness of M<sub>γ</sub> between classical Lorentz spaces.
|
["Cianchi A.", "Kerman R.", "Opic B.", "Pick L."]
|
["7004830990", "7005317180", "35512244600", "35515247200"]
| 2,000
| 29
|
["Classical Lorentz spaces", "Fractional maximal operator", "Nonincreasing rearrangement", "Weighted norm inequalities"]
| null |
Article
|
English
|
[{"id": "60021859", "name": "Istituto di Matematica, Facoltà di Architettura, Università di Firenze, 50122 Firenze, Via dell'Agnolo 14, Italy", "fullName": "Istituto di Matematica, Facoltà di Architettura, Università di Firenze", "reference": "a", "fullAddress": "50122 Firenze, Via dell'Agnolo 14, Italy", "departmentId": "100288540"}, {"id": "60031135", "name": "Mathematical Institute, Czech Academy of Sciences, 115 67 Praha 1, Žitná 25, Czech Republic", "fullName": "Mathematical Institute, Czech Academy of Sciences", "reference": "b", "fullAddress": "115 67 Praha 1, Žitná 25, Czech Republic", "departmentId": "104722297"}, {"id": "60001343", "name": "Department of Mathematics, Brock University, St. Catharines, Ont., Canada", "fullName": "Department of Mathematics, Brock University", "reference": "c", "fullAddress": "St. Catharines, Ont., Canada", "departmentId": "103111241"}, {"id": "60016605", "name": "Department of Mathematical Analysis, Faculty of Mathematics and Physics, Charles University, 186 75 Praha 8, Sokolovská 83, Czech Republic", "fullName": "Department of Mathematical Analysis, Faculty of Mathematics and Physics, Charles University", "reference": "d", "fullAddress": "186 75 Praha 8, Sokolovská 83, Czech Republic", "departmentId": "103854503"}]
|
459
| 26,153
|
Evaluating Forgetting Curves
|
Journal of Experimental Psychology: Learning, Memory, and Cognition
|
A new method is described for determining the effect of original learning (or any other variable) on forgetting. The major question is, How much forgetting time is required for memory performance to fall from any given level to some lower level? If this time is the same for different degrees of original learning, then forgetting is not affected by degree of original learning. If this time is greater for higher degrees of original learning, then forgetting is slower with higher original learning. Application of the method to a variety of forgetting data indicated that forgetting is slower for higher degrees of original learning. © 1985 American Psychological Association.
|
["Loftus G.R."]
|
["7004239458"]
| 1,985
| 155
|
[]
|
10.1037/0278-7393.11.2.397
|
Article
|
English
|
[{"id": "60015481", "name": "Department of Psychology, University of Washington", "fullName": "Department of Psychology, University of Washington", "reference": "a", "fullAddress": null, "departmentId": "108213006"}]
|
460
| 26,183
|
An optimum nonlinear code
|
Information and Control
|
A systematic nonlinear code having length 15, minimum distance 5, and 256 code words is given in Boolean form. This is the maximum possible number of words for length 15 and distance 5. The distance spectrum of all pairs of code words is an exact multiple of the weight spectrum of the code words. © 1967 Academic Press Inc.
|
["Nordstrom A.W.", "Robinson J.P."]
|
["24611289900", "57212792296"]
| 1,967
| 86
|
[]
|
10.1016/S0019-9958(67)90835-2
|
Article
|
English
|
[{"id": "101709783", "name": "United Township High School, East Moline, IL 61244, United States", "fullName": "United Township High School", "reference": "a", "fullAddress": "East Moline, IL 61244, United States", "departmentId": null}, {"id": "60024324", "name": "Department of Electrical Engineering, University of Iowa, Iowa City, IA 52240, United States", "fullName": "Department of Electrical Engineering, University of Iowa", "reference": "b", "fullAddress": "Iowa City, IA 52240, United States", "departmentId": "111755051"}]
|
461
| 26,189
|
On the geometrization of the canonical formalism in the classical field theory
|
Reports on Mathematical Physics
|
The Poisson bracket definition in the multisymplectic formulation of an arbitrary non-linear classical field theory is dealt with. The Poisson brackets of physical quantities related to a given space-like 3-dimensional surface are defined. For the linear case the definition is equivalent to the one of [5]. © 1972.
|
["Gaw E ̧dzki K."]
|
["24579855600"]
| 1,972
| 0
|
[]
|
10.1016/0034-4877(72)90014-6
|
Article
|
English
|
[{"id": "60013756", "name": "Department of Mathematical Methods of Physics, Warsaw University, Warsaw, Poland", "fullName": "Department of Mathematical Methods of Physics, Warsaw University", "reference": "a", "fullAddress": "Warsaw, Poland", "departmentId": "103713417"}]
|
462
| 26,405
|
Axial and conformal anomalies for arbitrary spin in gravity and supergravity
|
Physics Letters B
|
We present a general algorithm for the construction of gravitational axial and conformal anomalies for fields of arbitrary spin. A variety of models is then displayed in which one or both of the anomalies vanish by cancellation. Our results are compared (and in the spin 3 2 case, contrasted) with previous calcultions. © 1978.
|
["Christensen S.M.", "Duff M.J."]
|
["22970768300", "7006877347"]
| 1,978
| 143
|
[]
|
10.1016/0370-2693(78)90857-2
|
Article
|
English
|
[{"id": "60009982", "name": "Lyman Laboratory of Physics, Center for Astrophysics, Harvard University, Cambridge, MA 02138, United States", "fullName": "Lyman Laboratory of Physics, Center for Astrophysics, Harvard University", "reference": "a", "fullAddress": "Cambridge, MA 02138, United States", "departmentId": null}, {"id": "60016247", "name": "Physics Department, Brandeis University, Waltham, MA 02154, United States", "fullName": "Physics Department, Brandeis University", "reference": "b", "fullAddress": "Waltham, MA 02154, United States", "departmentId": "103837942"}]
|
463
| 26,570
|
Chern-Simons term by spontaneous symmetry breaking in an abelian Higgs model
|
Physics Letters B
|
We show that the Chern-Simons terms can be generated by spontaneous symmetry breaking in a generalized abelian Higgs model in 2 + 1 dimensions. We analyze this model in some detail and show the existence of two (neutral) vortices of finite energy in each topologically nontrivial sector. © 1987.
|
["Paul S.K.", "Khare A."]
|
["57212233869", "7101836331"]
| 1,987
| 24
|
[]
|
10.1016/0370-2693(87)91231-7
|
Article
|
English
|
[{"id": "60002120", "name": "Institute of Physics, Bhubaneswar, 751005, Sachivalaya Marg, India", "fullName": "Institute of Physics", "reference": "a", "fullAddress": "Bhubaneswar, 751005, Sachivalaya Marg, India", "departmentId": "103157838"}]
|
464
| 26,577
|
Generating modules efficiently: Algebraic K-theory for noncommutative Noetherian rings
|
Journal of Algebra
|
The well-known Forster-Swan theorem, and the stable version of this result given by Eisenbud and Evans, give a bound on the number of generators of a module over a commutative ring in terms of local data. In this paper we generalise these results to arbitrary Noetherian rings. As an application we prove versions of Serre's Theorem and the Cancellation Theorem over such rings. © 1981.
|
["Stafford J.T."]
|
["7102668767"]
| 1,981
| 28
|
[]
|
10.1016/0021-8693(81)90208-8
|
Article
|
English
|
[{"id": "60091913", "name": "Gonville and Caius College, Cambridge, CB2 ITA England, United Kingdom", "fullName": "Gonville and Caius College", "reference": "a", "fullAddress": "Cambridge, CB2 ITA England, United Kingdom", "departmentId": null}, {"id": "60030612", "name": "Mathematics Department, UCSD, La Jolla, CA 92093, United States", "fullName": "Mathematics Department, UCSD", "reference": "b", "fullAddress": "La Jolla, CA 92093, United States", "departmentId": "104547911"}]
|
465
| 26,674
|
Theory of electrohydrodynamic instabilities in electrolytic cells
|
The Journal of Chemical Physics
|
The classical Nernst theory for diffusion-limited electrical current transport in electrolytic cells predicts limiting currents of order microamps for unstirred cells. For unstirred cells, one encounters much higher current densities for large enough voltages. In this paper we develop the theory of the hydrodynamic stability of an electrolytic cell as a function of the imposed electric current. A new electrohydrodynamic instability is encountered when the current is forced to exceed the Nernst limit. The convection is driven by the volume force exerted by the electrical field on space charges in the electrolyte. This intrinsic instability is found to be easily masked by extrinsic convection sources such as gravity or stirring. We perform a linear stability analysis and derive a dimensionless number Le whose value determines the convection pattern. The quiescent cell becomes hydrodynamically unstable if (i) the current density exceeds the Nernst limit and if (ii) Le≫1. We expect full hydrodynamic convection if Le/Pr≫1 with Pr the Prandtl number. © 1990 American Institute of Physics.
|
["Bruinsma R.", "Alexander S."]
|
["7005679191", "22970294200"]
| 1,990
| 53
|
[]
|
10.1063/1.457905
|
Article
|
English
|
[]
|
466
| 26,732
|
On tilings and patterns on hyperbolic surfaces and their relation to structural chemistry
|
ChemPhysChem
|
Hyperbolic Periodic Nodal Surfaces (PNSs) have been investigated with respect to surface modulations. The resulting patterns and tilings are beautiful examples of texture information on hyperbolic objects. The construction principle, based on short Fourier series, allows for a strict symmetry control of the generated pattern by choosing appropriate sets of structure factors for information coding. Furthermore, a tailor-made design of complexity is achieved based on a proper choice of the structure factor moduli. In some cases, the resulting patterns are instantaneously transferred into hyperbolic framework information just by our visual perception. In most cases, such correlations can be systematically worked out by utilizing crystallographic and chemical expertise, as shown in this contribution. The presented approach is much simpler than most attempts to generate three-dimensional frameworks because it is subject to boundary conditions like pseudo-two-dimensional topology, given base topology, and symmetry control. © Wiley-VCH-Verlag GmbH, 2001.
|
["Nesper R.", "Leoni S."]
|
["35482658000", "7007058132"]
| 2,001
| 25
|
["Crystallography", "Hyperbolic frameworks", "Hyperbolic tilings", "Periodic nodal surfaces", "Solids"]
|
10.1002/1439-7641(20010716)2:7<413::AID-CPHC413>3.0.CO;2-V
|
Article
|
English
|
[{"id": "60025858", "name": "Laboratory for Inorganic Chemistry, ETH Zürich, 8092 Zürich, Universitätstrasse 6, Switzerland", "fullName": "Laboratory for Inorganic Chemistry, ETH Zürich", "reference": "a", "fullAddress": "8092 Zürich, Universitätstrasse 6, Switzerland", "departmentId": "105910725"}, {"id": "60003451", "name": "Max Planck Institute for Chemical Physics of Solids, 01187 Dresden, Nöthnitzer Strasse 40, Germany", "fullName": "Max Planck Institute for Chemical Physics of Solids", "reference": "b", "fullAddress": "01187 Dresden, Nöthnitzer Strasse 40, Germany", "departmentId": null}]
|
467
| 26,776
|
Consensus rules for committee elections
|
Mathematical social sciences
|
The committee election problem is to choose from a finite set S of candidates a nonempty subset T of committee members as the consequence of an election in which each voter expresses a preference for a candidate in S. Consensus rules for electing committees can be modeled as optimization problems based on criteria involving distances, angles or ratios of quantities derived from the election tallies. We describe three such consensus rules and discuss their features and interrelationships.
|
["Bock H.-H.", "Day W.H.E.", "McMorris F.R."]
|
["35387448100", "7102782334", "7005764579"]
| 1,998
| 17
|
["Collective choice", "Committee election", "Consensus rule", "Consistency", "Plurality Rule", "Voting scheme"]
|
10.1016/S0165-4896(97)00033-4
|
Article
|
English
|
[{"id": "60016653", "name": "Institut für Statistik, Technische Hochschule Aachen, D-52056 Aachen, Germany", "fullName": "Institut für Statistik, Technische Hochschule Aachen", "reference": "a", "fullAddress": "D-52056 Aachen, Germany", "departmentId": null}, {"id": "60019000", "name": "Department of Computer Science, Memorial University of Newfoundland, St. John's, NF A1B 3X5, Canada", "fullName": "Department of Computer Science, Memorial University of Newfoundland", "reference": "b", "fullAddress": "St. John's, NF A1B 3X5, Canada", "departmentId": "105412727"}, {"id": "60020633", "name": "Department of Mathematics, University of Louisville, Louisville, KY 40292, United States", "fullName": "Department of Mathematics, University of Louisville", "reference": "c", "fullAddress": "Louisville, KY 40292, United States", "departmentId": "112906489"}]
|
468
| 26,782
|
Real-time optoelectronic morphological processor for human face recognition
|
Optical Engineering
|
Many commercial and law enforcement applications of face recognition need to be high-speed and real-time, such as passing through customs quickly while ensuring security. However, face recognition by using computers only is time-consuming due to the intensive calculation task. Recently optical implementations of real-time face recognition have attracted much attention. In this paper, a real-time opto-electronic morphological processor for face recognition is presented. It is based on original-complementary composite encoding hit-or-miss transformation, which combines the foreground and background of an image into a whole. One liquid-crystal display (LCD) panel is used as two real-time SLMs for both stored images and face images to be recognized, which are of 256×256 pixels. A speed of 40 frames/s and four-channel recognition ability have been achieved. The experimental results have shown that the processor has an accuracy over 90% and error tolerance to rotation up to 8 deg, to noise disturbance up to 25%, and to image loss up to 40%. © 1998 Society of Photo-Optical Instrumentation Engineers.
|
["Liu H.", "Wu M.", "Jin G.", "Cheng G.", "He Q."]
|
["53871591400", "7405594351", "7401563322", "57199921150", "7402117823"]
| 1,998
| 8
|
["Face recognition", "Hit-or-miss transform", "LCD panel", "Morphological image processing", "Original-complementary composite encoding", "Real time", "Recognition techniques"]
|
10.1117/1.601842
|
Article
|
English
|
[{"id": null, "name": "SPIE, China", "fullName": "SPIE", "reference": "a", "fullAddress": "China", "departmentId": null}, {"id": "60025278", "name": "Tsinghua University, Department of Precision Instruments, Beijing 100084, China", "fullName": "Tsinghua University, Department of Precision Instruments", "reference": "b", "fullAddress": "Beijing 100084, China", "departmentId": "113879345"}, {"id": "60025278", "name": "Tsinghua University, China", "fullName": "Tsinghua University", "reference": "c", "fullAddress": "China", "departmentId": null}, {"id": "60025278", "name": "Department of Precision Instruments, Tsinghua University, China", "fullName": "Department of Precision Instruments, Tsinghua University", "reference": "d", "fullAddress": "China", "departmentId": "113879345"}]
|
469
| 26,850
|
A phase window framework for articulatory timing
|
Phonology
| null |
["Byrd D."]
|
["7102463569"]
| 1,996
| 61
|
[]
|
10.1017/S0952675700002086
|
Article
|
English
|
[{"id": "60030102", "name": "University of California, Los Angeles/Haskins Laboratories", "fullName": "University of California, Los Angeles/Haskins Laboratories", "reference": "a", "fullAddress": null, "departmentId": null}]
|
470
| 26,887
|
On Option Pricing Bounds
|
The Journal of Finance
|
The purpose of this article is to compare the Perrakis and Ryan bounds of option prices in a single‐period model with option bounds derived using linear programming. It is shown that the upper bounds are identical but that the lower bounds are different. A comparison of these bounds, together with Merton's bounds and the Black‐Scholes prices in a lognormal securities market, is presented. 1985 The American Finance Association
|
["RITCHKEN P.H."]
|
["6601915814"]
| 1,985
| 70
|
[]
|
10.1111/j.1540-6261.1985.tb02373.x
|
Article
|
English
|
[]
|
471
| 26,955
|
Variational approach to exciton transport in molecular crystals
|
The Journal of Chemical Physics
|
The variational results for the free energy of an interacting exciton phonon system are used to derive expressions for the scattering rate and diffusion constant of an exciton in such a system. These expressions are applicable to both wide and narrow band cases, and includes the possibility of an abrupt transition from wide band (free) exciton to narrow band (localized) exciton. Some comments are made on the possibility of observing this transition by thermal modulation spectroscopy. © 1978 American Institute of Physics.
|
["Yarkony D.R.", "Silbey R."]
|
["7004598670", "7005627679"]
| 1,977
| 80
|
[]
|
10.1063/1.434789
|
Article
|
English
|
[{"id": "60022195", "name": "Department of Chemistry, Center for Materials Science and Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, United States", "fullName": "Department of Chemistry, Center for Materials Science and Engineering, Massachusetts Institute of Technology", "reference": "a", "fullAddress": "Cambridge, MA 02139, United States", "departmentId": "113292821"}]
|
472
| 26,964
|
Model dependence of kaon condensation in dense hadronic matter
|
Physics Letters B
|
We investigate the possibility of kaon condensation in dense hadronic matter, and show that the occurence of this phenomenon is strongly model dependent. In particular, we show that a kaon condensation does not occur in a thermodynamically consistent model in which the baryon-baryon and meson-meson interactions are included in a mean field approximation. © 1991.
|
["Davidson N.J.", "Miller H.G."]
|
["31967526300", "7402938577"]
| 1,991
| 7
|
[]
|
10.1016/0370-2693(91)91148-O
|
Article
|
English
|
[{"id": "60021902", "name": "South Africa", "fullName": null, "reference": "a", "fullAddress": "South Africa", "departmentId": "108232147"}]
|
473
| 27,023
|
Lifting covers of sofic shifts
|
Monatshefte fur Mathematik
|
We define a class of factor maps between sofic shifts, called lifting maps, which generalize the closing maps. We show that an irreducible sofic shift S has only finitely many S-conjugacy classes of minimal left (or right) lifting covers. The number of these classes is a computable conjugacy invariant of S. Furthermore, every left lifting cover factors through a minimal left lifting cover.
|
["Trow P."]
|
["6603230707"]
| 1,998
| 3
|
["Factor map", "Shift of finite type", "Sofic shift"]
|
10.1007/BF01305347
|
Article
|
English
|
[{"id": "60028599", "name": "Department of Mathematical Sciences, The University of Memphis, Memphis, TN 38152, United States", "fullName": "Department of Mathematical Sciences, The University of Memphis", "reference": "a", "fullAddress": "Memphis, TN 38152, United States", "departmentId": "108182026"}]
|
474
| 27,107
|
Search for a narrow resonance about the ξ(2230) in the formation channel pp→K<sup>+</sup>K<sup>-</sup>
|
Physics Letters B
|
The reaction pp→K<sup>+</sup>K<sup>-</sup> has been studied for incident antiproton momenta between 1.3 and 1.5 GeV/c. A continuous scan has been made for invariant masses of the pp system between 2220 and 2240 MeV/c<sup>2</sup> with a resolution of 0.6 MeV/c<sup>2</sup> in the ξ (2230) region. No structure has been observed. Upper limits are given. © 1987.
|
["Bardin G.", "Burgun G.", "Calabrese R.", "Capon G.", "Carlin R.", "Dalpiaz P.", "Dalpiaz P.F.", "Derre J.", "Dosselli U.", "Duclos J.", "Faure J.L.", "Gasparini F.", "Huet M.", "Kochowski C.", "Limentani S.", "Marel G.", "Mazzucato E.", "Petrucci F.", "Posocco M.", "Savrie M.", "Stroili R.", "Tecchio L.", "Voci C.", "Zekri N."]
|
["55663222900", "16466679600", "35226996300", "7005209312", "34869079000", "57217506083", "35277922200", "7006752191", "25941935500", "7101718647", "7201809027", "22970920300", "22967265600", "23118854800", "35313506400", "7004015579", "57197505533", "56810664000", "35227852400", "7003480734", "35228072000", "7003952703", "35228065800", "57111978100"]
| 1,987
| 13
|
[]
|
10.1016/0370-2693(87)91211-1
|
Article
|
English
|
[{"id": "60019615", "name": "Départment de Physique Nucléaire, CEN de Saclay, F-91191 Gif-sur-Yvette Cedex, France", "fullName": "Départment de Physique Nucléaire, CEN de Saclay", "reference": "a", "fullAddress": "F-91191 Gif-sur-Yvette Cedex, France", "departmentId": "103997610"}, {"id": "60106257", "name": "Département de Physique des Particules Elémentaires, CEN de Saclay, F-91191 Gif-sur-Yvette Cedex, France", "fullName": "Département de Physique des Particules Elémentaires, CEN de Saclay", "reference": "b", "fullAddress": "F-91191 Gif-sur-Yvette Cedex, France", "departmentId": null}, {"id": "60114761", "name": "Dipartimento di Fisica dell'Università, INFN, I-44100 Ferrara, Italy", "fullName": "Dipartimento di Fisica dell'Università, INFN", "reference": "c", "fullAddress": "I-44100 Ferrara, Italy", "departmentId": null}, {"id": "60019778", "name": "CERN, CH-1211 Geneva 23, Switzerland", "fullName": "CERN", "reference": "d", "fullAddress": "CH-1211 Geneva 23, Switzerland", "departmentId": null}, {"id": "60110942", "name": "Dipartimento di Fisica dell'Università, INFN, I-35131 Padua, Italy", "fullName": "Dipartimento di Fisica dell'Università, INFN", "reference": "e", "fullAddress": "I-35131 Padua, Italy", "departmentId": "121757689"}, {"id": "60114686", "name": "Istituto di Fisica Superiore dell'Università, INFN, I-10125 Turin, Italy", "fullName": "Istituto di Fisica Superiore dell'Università, INFN", "reference": "f", "fullAddress": "I-10125 Turin, Italy", "departmentId": null}]
|
475
| 27,129
|
Exponential stabilization of an underactuated surface vessel
|
Modeling, Identification and Control
|
The paper shows that a large class of underactuated vehicles cannot be asymptotically stabilized by either continuous or discontinuous state feedback. Furthermore, stabilization of an underactuated surface vessel is considered. Controllability properties of the surface vessels is presented, and a continuous periodic time-varying feedback law is proposed. It is shown that this feedback law exponentially stabilizes the surface vessel to the origin, and this is illustrated by simulations.
|
["Pettersen K.Y.", "Egeland O."]
|
["7003576002", "7004367599"]
| 1,997
| 13
|
["Continuous time-varying feedback", "Nonlinear control", "Underactuated vehicles"]
|
10.4173/mic.1997.3.3
|
Article
|
English
|
[{"id": "60013141", "name": "Dept. of Engineering Cybernetics, Norwegian Univ. of Sci. and Technol., N-7034, Trondheim, Norway", "fullName": "Dept. of Engineering Cybernetics, Norwegian Univ. of Sci. and Technol.", "reference": "a", "fullAddress": "N-7034, Trondheim, Norway", "departmentId": "113965702"}]
|
476
| 27,149
|
The complexity of planar graph choosability
|
Discrete Mathematics
|
A graph G is k-choosable if for every assignment of a set S(v) of k colors to every vertex v of G, there is a proper coloring of G that assigns to each vertex v a color from S(v). We consider the complexity of deciding whether a given graph is k-choosable for some constant k. In particular, it is shown that deciding whether a given planar graph is 4-choosable is NP-hard, and so is the problem of deciding whether a given planar triangle-free graph is 3-choosable. We also obtain simple constructions of a planar graph which is not 4-choosable and a planar triangle-free graph which is not 3-choosable.
|
["Gutner S."]
|
["23134439100"]
| 1,996
| 59
|
[]
|
10.1016/0012-365X(95)00104-5
|
Article
|
English
|
[{"id": "60005681", "name": "Department of Computer Science, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel", "fullName": "Department of Computer Science, School of Mathematical Sciences, Tel Aviv University", "reference": "a", "fullAddress": "Tel Aviv, Israel", "departmentId": "100274100"}]
|
477
| 27,258
|
BRST approach to interacting higher-spin gauge fields
|
Classical and Quantum Gravity
|
A comprehensive approach to the problem of constructing a consistent classical field theory of interacting higher-spin gauge fields is presented. BRST techniques are used similar to those used in covariant string field theory. A part of the cubic vertex is derived and shown to reproduce the cubic Yang-Mills interaction. Further progress is halted by a lack of an effective way to calculate the full vertex. There are indications that the theory, as presented, might only be consistent in four spacetime dimensions.
|
["Bengtsson A.K.H."]
|
["55404902100"]
| 1,988
| 52
|
[]
|
10.1088/0264-9381/5/3/005
|
Article
|
English
|
[{"id": "60000990", "name": "Inst. for Theor. Phys., Chalmers Univ. of Technol., Goteborg, Sweden", "fullName": "Inst. for Theor. Phys., Chalmers Univ. of Technol.", "reference": "a", "fullAddress": "Goteborg, Sweden", "departmentId": "103097435"}]
|
478
| 27,299
|
A multilevel-multiresolution technique for computer vision via renormalization group ideas
|
Proceedings of SPIE - The International Society for Optical Engineering
|
A multilevel-multiresolution method for image processing tasks and computer vision in general, is presented The method is based on a combination of probabilistic models, Monte Carlo type algorithms, and renormalization group ideas. The method is suitable for implementation on massively parallel computers. It also yields a new global optimization algorithm potentially applicable to any cost function, but especially efficient for problems which are governed by local spatial relations. © 1988 SPIE.
|
["Gidas B."]
|
["6603192726"]
| 1,988
| 5
|
[]
|
10.1117/12.944054
|
Conference Paper
|
English
|
[{"id": "60011460", "name": "Brown University, Division of Applied Mathematics Providence, RI, 02912, United States", "fullName": "Brown University, Division of Applied Mathematics Providence", "reference": "a", "fullAddress": "RI, 02912, United States", "departmentId": "108446976"}]
|
479
| 27,385
|
Structural characterisation of hyperquenched glassy water and vapour-deposited amorphous ice
|
Physics Letters A
|
Neutron diffraction experiments have been made on hyperquenched glassy water (D<sub>2</sub>O). After subtraction of a small crystalline component (I<sub>c</sub>) it is found that the structure is based on a continuous random network (CRB) of hydrogen-bonded molecules similar to that describing the low-density form of amorphous ice. © 1991.
|
["Hallbrucker A.", "Mayer E.", "O'Mard L.P.", "Dore J.C.", "Chieux P."]
|
["7004823200", "7202549846", "57215975719", "7102317630", "7003421214"]
| 1,991
| 31
|
[]
|
10.1016/0375-9601(91)90370-N
|
Article
|
English
|
[{"id": "60009999", "name": "Institut für Anorganische und Analytische Chemie, Universität Innsbruck, A-6020 Innsbruck, Austria", "fullName": "Institut für Anorganische und Analytische Chemie, Universität Innsbruck", "reference": "a", "fullAddress": "A-6020 Innsbruck, Austria", "departmentId": "105792047"}, {"id": "60010818", "name": "Physics Laboratory, The University of Kent, Centerbury, Kent CT2 7NT, United Kingdom", "fullName": "Physics Laboratory, The University of Kent", "reference": "b", "fullAddress": "Centerbury, Kent CT2 7NT, United Kingdom", "departmentId": "103584671"}, {"id": "60007109", "name": "Institut Laue-Langevin, Grenoble, France", "fullName": "Institut Laue-Langevin", "reference": "c", "fullAddress": "Grenoble, France", "departmentId": null}]
|
480
| 27,444
|
A 144-Mb, eight-level NAND flash memory with optimized pulsewidth programming
|
IEEE Journal of Solid-State Circuits
|
We report a fast-programming, compact sense and latch (SL) circuit to realize an eight-level NAND flash memory. Fast programming is achieved by supplying optimized voltage and pulsewidth to the bit lines, according to the programming data. As a result, all data programming is completed almost simultaneously, and 0.67-MB/s program throughput, which is 1.7 times faster than conventional program throughput, is achieved. The compact layout of the SL circuit is made possible by four 3-bit latches sharing one unit of the read/verify control circuit. Using these techniques, we fabricated a 144-Mb, eight-level NAND flash memory using a 0.35- ^tm CiMOS process, resulting in a 104.2-mm2 die size and a 1.05- m2 effective cell size. . -. © 2000 IEEE.
|
["Nobukata H."]
|
["6603016571"]
| 2,000
| 21
|
["0.67-mb/s program throughput", "Array ground line (agl)", "Background pattern dependency (bpd)", "Eight-level nand flash memory", "Incremental step pulse programming (ispp) start voltage", "Optimized pulsewidth programming"]
|
10.1109/4.841491
|
Article
|
English
|
[{"id": "60021178", "name": "Memory Department, System LSI Division, Sony Corporation Core Technology and Network Company, Tokyo 141-0032, Japan", "fullName": "Memory Department, System LSI Division, Sony Corporation Core Technology and Network Company", "reference": "a", "fullAddress": "Tokyo 141-0032, Japan", "departmentId": "104072970"}]
|
481
| 27,517
|
The infrared absorption spectrum of methyl cyanide vapor
|
Journal of Molecular Spectroscopy
|
The infrared spectrum of methyl cyanide has been examined from 1.6 μ to 20 μ with a grating spectrometer. All observed perpendicular bands and one parallel fundamental were resolved and analyzed. Both the parallel and perpendicular components were observed for many of the overtones and combination bands. Zeta factors, Coriolis coupling coefficients, band origins, and rotational constants are given for the resolved bands. © 1958.
|
["Parker F.W.", "Nielsen A.H.", "Fletcher W.H."]
|
["24590850300", "22989311900", "22970843000"]
| 1,957
| 54
|
[]
|
10.1016/0022-2852(57)90014-0
|
Article
|
English
|
[{"id": "60015574", "name": "Department of Physics, The University of Tennessee, United States", "fullName": "Department of Physics, The University of Tennessee", "reference": "a", "fullAddress": "United States", "departmentId": null}, {"id": "60015574", "name": "Department of Chemistry, The University of Tennessee, Knoxville, TN, United States", "fullName": "Department of Chemistry, The University of Tennessee", "reference": "b", "fullAddress": "Knoxville, TN, United States", "departmentId": "100296660"}]
|
482
| 27,603
|
Spin dynamics in the organic spin-Peierls system MEM(TCNQ)<sub>2</sub> studied using muon-spin relaxation
|
Journal of Physics Condensed Matter
|
We report the first muon-spin relaxation study of an organic spin-Peierls system, the linear-chain compound MEM(TCNQ)<sub>2</sub>. Our results show a crossover from a Gaussian relaxation to an exponential relaxation as the temperature is lowered below the spin-Peierls transition. We associate this behaviour with the slowing down of the electronic fluctuations resulting from the opening of a gap in the magnetic excitation spectrum.
|
["Blundell S.J.", "Pratt F.L.", "Pattenden P.A.", "Kurmoo M.", "Chow K.H.", "Takagi S.", "Jestädt Th.", "Hayes W."]
|
["7004826134", "7005495366", "6602198785", "7006312425", "36015248600", "7401494739", "6701772838", "7202649561"]
| 1,997
| 28
|
[]
|
10.1088/0953-8984/9/9/002
|
Article
|
English
|
[{"id": "60026851", "name": "University of Oxford, Department of Physics, Clarendon Laboratory, Oxford OX1 3PU, Parks Road, United Kingdom", "fullName": "University of Oxford, Department of Physics, Clarendon Laboratory", "reference": "a", "fullAddress": "Oxford OX1 3PU, Parks Road, United Kingdom", "departmentId": "109726739"}, {"id": "60027156", "name": "IPCMS, 67037 Strasbourg, 23, rue du Loess, France", "fullName": "IPCMS", "reference": "b", "fullAddress": "67037 Strasbourg, 23, rue du Loess, France", "departmentId": null}, {"id": "60031838", "name": "Department of Physics, Kyushu Institute of Technology, Tobata, Kitakyushu 804, Japan", "fullName": "Department of Physics, Kyushu Institute of Technology", "reference": "c", "fullAddress": "Tobata, Kitakyushu 804, Japan", "departmentId": "109730895"}]
|
483
| 27,744
|
Agent-based workflow: TRP Support Environment (TSE)
|
Computer Networks and ISDN Systems
|
The Technology Reinvestment Project Support Environment (TSE) introduces the notion of "agent-based workflow" in order to facilitate various parts of workflow process. Unlike some of the well known groupware products such as InterNotes or Web Forum which simply provide a passive information space, the goal of TSE is to enable active collaborative work among participants working on the TRP's "component based software engineering environment".
|
["Chang J.W.", "Scott C.T."]
|
["56143431900", "15046953100"]
| 1,996
| 26
|
["Agent", "Collaboration", "Workflow"]
|
10.1016/0169-7552(96)00068-2
|
Article
|
English
|
[{"id": "60032170", "name": "Andersen Consulting, Northbrook, IL 60062, 3773 Willow Road, United States", "fullName": "Andersen Consulting", "reference": "a", "fullAddress": "Northbrook, IL 60062, 3773 Willow Road, United States", "departmentId": null}]
|
484
| 27,750
|
Baryon-number dissipation at finite temperature in the standard model
|
Physical Review D
|
We analyze the phenomenon of baryon-number violation at finite temperature in the standard model, and derive the relaxation rate for the baryon density in the high-temperature electroweak plasma. The relaxation rate is given in terms of real-time correlation functions of the operator EB, and is directly proportional to the sphaleron transition rate. Hence it is not instanton suppressed, as claimed by Cohen, Dugan, and Manohar (CDM). We show explicitly how this result is consistent with the methods of CDM, once it is recognized that a new anomalous commutator is required in their approach. © 1990 The American Physical Society.
|
["Mottola E.", "Raby S."]
|
["6602475777", "7003400971"]
| 1,990
| 19
|
[]
|
10.1103/PhysRevD.42.4202
|
Article
|
English
|
[{"id": "60006164", "name": "Los Alamos National Laboratory, Theoretical Division, Los Alamos, NM 87545, T-8, Mail Stop B285, United States", "fullName": "Los Alamos National Laboratory, Theoretical Division", "reference": "a", "fullAddress": "Los Alamos, NM 87545, T-8, Mail Stop B285, United States", "departmentId": null}, {"id": "60003500", "name": "Department of Physics, Ohio State University, Columbus, OH 43210, United States", "fullName": "Department of Physics, Ohio State University", "reference": "b", "fullAddress": "Columbus, OH 43210, United States", "departmentId": "100281041"}]
|
485
| 27,776
|
Symplectic Quantization of A Vector-tensor Gauge Theory With Topological Coupling
|
Modern Physics Letters A
|
We use the symplectic formalism to quantize a guage theory where vectors and tensors fields are coupled in a topological way. This is an example of reducible theory and a procedure like of ghosts-of-ghosts of the BFV method is applied but in terms of Lagrange multipliers. Our final results are in agreement with the ones found in the literature by using the Dirac method.
|
["Barcelos-Neto J.", "Silva M.B.D."]
|
["7003393137", "55467622200"]
| 1,996
| 6
|
[]
|
10.1142/S0217732396000552
|
Article
|
English
|
[{"id": "60031745", "name": "Intl. Centre for Theoretical Physics, Trieste, Italy", "fullName": "Intl. Centre for Theoretical Physics", "reference": "a", "fullAddress": "Trieste, Italy", "departmentId": null}, {"id": "60000036", "name": "Instituto de Física, Univ. Federal do Rio de Janeiro, Rio de Janeiro, RJ 21945-970, Caixa Postal 68528, Brazil", "fullName": "Instituto de Física, Univ. Federal do Rio de Janeiro", "reference": "b", "fullAddress": "Rio de Janeiro, RJ 21945-970, Caixa Postal 68528, Brazil", "departmentId": "109667505"}, {"id": "60000036", "name": "Instituto, de Física, Universiade Fed. do Rio de Janeiro, Rio de Janeiro, RJ 21945-970, Caixa Postal 68528, Brazil", "fullName": "Instituto, de Física, Universiade Fed. do Rio de Janeiro", "reference": "c", "fullAddress": "Rio de Janeiro, RJ 21945-970, Caixa Postal 68528, Brazil", "departmentId": null}]
|
486
| 27,812
|
Complexity classes defined by counting quantifiers
|
Journal of the ACM
|
The polynomial-time counting hierarchy, a hierarchy of complexity classes related to the notion of counting is studied. Some of their structural properties are investigated, settling many open questions dealing with oracle characterizations, closure under Boolean operations, and relations with other complexity classes. A new combinatorial technique to obtain relativized separations for some of the studied classes, which imply absolute separations for some logarithmic time bounded complexity classes, is developed. © 1991 ACM.
|
["Torán J."]
|
["6701879056"]
| 1,991
| 81
|
["Counting complexity classes", "Theory"]
| null |
Article
|
English
|
[{"id": "60007592", "name": "Dept. Lenguages y Sistemas Informaticas, Universidad Politecnica de Cataluña, 08028 Barcelona, Pan Gargallo 5, Spain", "fullName": "Dept. Lenguages y Sistemas Informaticas, Universidad Politecnica de Cataluña", "reference": "a", "fullAddress": "08028 Barcelona, Pan Gargallo 5, Spain", "departmentId": "108100519"}]
|
487
| 27,896
|
Temperature sensitivity and high temperature operation of long wavelength semiconductor lasers
|
Applied Physics Letters
|
The temperature dependence of long wavelength (1.5 μm) quantum-well lasers has been studied theoretically assuming that the dominant contribution to the threshold current is from phonon-assisted Auger recombination. It is found that the best possible value of T<sub>0</sub> at room temperature is ≊100 K. Gain calculations based on the InGaAs/InGaAsP/InP system operating at 1.5 μm indicate that the main cause of the reduction from this ideal value is due to the temperature dependence of the threshold carrier density. We also comment on the implication of this for the high temperature operation of tensile and compressive lasers.
|
["O'Reilly E.P.", "Silver M."]
|
["7006356593", "7402108416"]
| 1,993
| 73
|
[]
|
10.1063/1.110187
|
Article
|
English
|
[{"id": "60021097", "name": "Department of Physics, University of Surrey, Guildford, Surrey GU2 5XH, United Kingdom", "fullName": "Department of Physics, University of Surrey", "reference": "a", "fullAddress": "Guildford, Surrey GU2 5XH, United Kingdom", "departmentId": "100257786"}]
|
488
| 27,929
|
Well posedness and convergence of some regularisation methods for non-linear ill posed problems
|
Inverse Problems
|
The authors carry out a theoretical analysis of two regularisation methods for non-linear ill posed problems. The first is a penalty method called Tikhonov regularisation, in which one solves an unconstrained optimisation problem, while the second is based on a constrained optimisation problem. For each method they examine the well posedness of the respective optimisation problem. They then show strong convergence of the regularised 'solutions' to the true solution. (Note that this is well known for the application of these methods to linear problems.) They consider such factors as the convergence of perturbed data to the true data, inexact solution of the respective optimisation problems, and the choice of the regularisation parameters.
|
["Seidman T.I.", "Vogel C.R."]
|
["7004665044", "57202976741"]
| 1,989
| 96
|
[]
|
10.1088/0266-5611/5/2/008
|
Article
|
English
|
[{"id": "60024997", "name": "Department of Mathematics and Statistics, University of Maryland Baltimore County, Catonsville, MD 21228, United States", "fullName": "Department of Mathematics and Statistics, University of Maryland Baltimore County", "reference": "a", "fullAddress": "Catonsville, MD 21228, United States", "departmentId": "104260356"}]
|
489
| 27,958
|
Predictability of plastic relaxation in metamorphic epitaxy
|
Materials Science and Technology
|
Theoretical models and experimental data on plastic relaxation are reviewed. It is concluded that neither equilibrium nor kinetic effects are responsible for the relaxation observed under conditions of high growth quality in III-V epitaxy; instead dislocation multiplication mechanisms and the space They require to operate constitute the determining factor. Residual strain is then given by ε(h) = (0·8 ± 0·1 nm)/h for a layer of thickness h. Deviations from this rule are indicative of poor crystallinity. Silicon-germanium and II-VI materials are briefly discussed. © 1996 The Institute of Materials.
|
["Dunstan D.J.", "Kidd P.", "Beanland R.", "Sacedón A.", "Calleja E.", "González L.", "González Y.", "Pacheco F.J."]
|
["57203216256", "7101624095", "7003483616", "6603868919", "7005101634", "7202219121", "7005532678", "57220064448"]
| 1,996
| 0
|
[]
|
10.1179/mst.1996.12.2.181
|
Article
|
English
|
[{"id": "60021097", "name": "Strained-Layer Struct. Res. Group, University of Surrey", "fullName": "Strained-Layer Struct. Res. Group, University of Surrey", "reference": "a", "fullAddress": null, "departmentId": "104066315"}, {"id": "60020661", "name": "Dept. of Mat. Sci. and Engineering, University of Liverpool", "fullName": "Dept. of Mat. Sci. and Engineering, University of Liverpool", "reference": "b", "fullAddress": null, "departmentId": "105408712"}, {"id": "60006797", "name": "Centro Nacional de Microelectronica, Madrid, Spain", "fullName": "Centro Nacional de Microelectronica", "reference": "c", "fullAddress": "Madrid, Spain", "departmentId": null}, {"id": "60028442", "name": "Departamento Ingenieria Electronica, Univ. Politécnica de Madrid", "fullName": "Departamento Ingenieria Electronica, Univ. Politécnica de Madrid", "reference": "d", "fullAddress": null, "departmentId": "113220290"}, {"id": "60016476", "name": "Depto. Quim. Inorgánica, Universidad de Cádiz, Spain", "fullName": "Depto. Quim. Inorgánica, Universidad de Cádiz", "reference": "e", "fullAddress": "Spain", "departmentId": "115838112"}]
|
490
| 27,962
|
Edge separators of planar and outerplanar graphs with applications
|
Journal of Algorithms
|
We consider the problem of finding a small set of edges (an edge separator) whose removal divides a given graph into roughly equal parts. We show that every planar graph with n vertices and a maximum degree k has an O([formula])-edge separator, which bound is asymptotically optimal. This improves the previously best known upper bound of O(k[formula]). We prove that the bisection width of the class of planar graphs and trees of n vertices and maximum degree k is O([formula] and O(k log n/log k), respectively, both optimal within a constant factor. All proofs are constructive and yield optimal O(n) algorithms. The separator theorems are applied to embed efficiently planar and outerplanar graphs into binary trees, hypercubes, butterfly graphs, CCC graphs, shuffle-exchange graphs, de Brujn graphs, and d-dimensional meshes. The embeddings are shown to be optimal or almost optimal with respect to the average dilation and the expansion of the embedding. © 1993 Academic Press, Inc.
|
["Diks K.", "Djidjev H.N.", "Sykora O.", "Vrto I."]
|
["7003963582", "6601961018", "57225697121", "6603406756"]
| 1,993
| 41
|
[]
|
10.1006/jagm.1993.1013
|
Article
|
English
|
[{"id": "60013756", "name": "Institute of Informatics, Warsaw University, PKiN, Warsaw 00901, Poland", "fullName": "Institute of Informatics, Warsaw University, PKiN", "reference": "a", "fullAddress": "Warsaw 00901, Poland", "departmentId": null}, {"id": "60005286", "name": "Department of Computer Science, Rice University, Houston, TX 77251, P.O.Box 1892, United States", "fullName": "Department of Computer Science, Rice University", "reference": "b", "fullAddress": "Houston, TX 77251, P.O.Box 1892, United States", "departmentId": "112450056"}, {"id": "119096678", "name": "Computing Centre, Slovak Academy of Sciences, Bratislava 84235, Dubravska 9, Switzerland", "fullName": "Computing Centre, Slovak Academy of Sciences", "reference": "c", "fullAddress": "Bratislava 84235, Dubravska 9, Switzerland", "departmentId": "119097573"}]
|
491
| 27,993
|
N = 4 Maxwell-Einstein supergravity in five dimensions and its SU(2) gauging
|
Nuclear Physics, Section B
|
We construct the Usp(4) invariant action of an arbitrary number, n, of N = 4 abelian vector supermultiplets in d = 5 coupled to d = 5, N = 4 supergravity. The scalar fields of the vector supermultiplets parametrize the coset space SO(5, n)/[SO(5)×SO(n)]. We further show that an SU(2) subgroup of Usp(4) can be gauged if n ≥ 1 but that in this case there is no maximally symmetric d = 5 ground state. If n = 0 the SU(2) gauging is not possible, because the n = 1 gauged Maxwell/Einstein supermultiplet is irreducible. © 1985.
|
["Awada M.", "Townsend P.K."]
|
["6603790119", "7201800420"]
| 1,985
| 45
|
[]
|
10.1016/0550-3213(85)90156-7
|
Article
|
English
|
[{"id": "122683701", "name": "DAMTP, Cambridge, CB3 9EW, Silver Street, United Kingdom", "fullName": "DAMTP", "reference": "a", "fullAddress": "Cambridge, CB3 9EW, Silver Street, United Kingdom", "departmentId": null}]
|
492
| 28,048
|
Quantum mechanics of paraparticles
|
Physical Review
|
We show that it is possible to formulate a consistent first-quantized theory of paraparticles, i.e., particles which are neither bosons nor fermions. We examine a number of properties of the theory and show that the formulation of Messiah and Greenberg in terms of generalized rays can be replaced by an equivalent formulation in which states are represented by rays in the usual way. We use this alternative formulation to establish some results of ordinary quantum mechanics. We examine in detail the consistency of the theory with the cluster law and show that paraparticles must have states associated with whole families of different permutation symmetries, according to the following rule: If a given particle has N-particle states associated with a given Young diagram, then it must have (N-1)-, (N-2)-,..., two-particle states associated with all Young diagrams which can be obtained from the first by successively removing squares. This gives rise to infinitely many different kinds of paraparticle, all with rather complicated properties. © 1969 The American Physical Society.
|
["Hartle J.B.", "Taylor John.R."]
|
["6603798394", "15222836900"]
| 1,969
| 46
|
[]
|
10.1103/PhysRev.178.2043
|
Article
|
English
|
[{"id": "60029241", "name": "Department of Physics, University of California, Santa Barbara, CA 93106, United States", "fullName": "Department of Physics, University of California", "reference": "a", "fullAddress": "Santa Barbara, CA 93106, United States", "departmentId": "100302288"}, {"id": "60000221", "name": "Department of Physics and Astrophysics, University of Colorado, Boulder, CO 80302, United States", "fullName": "Department of Physics and Astrophysics, University of Colorado", "reference": "b", "fullAddress": "Boulder, CO 80302, United States", "departmentId": "105769371"}]
|
493
| 28,158
|
A comparative study of numerical methods for the overlap Dirac operator - A status report
|
Nuclear Physics B - Proceedings Supplements
|
Improvements of various methods to compute the sign function of the hermitian Wilson-Dirac matrix within the overlap operator are presented. An optimal partial fraction expansion (PFE) based on a theorem of Zolotarev is given. Benchmarks show that this PFE together with removal of converged systems within a multi-shift CG appears to approximate the sign function times a vector most efficiently. A posteriori error bounds are given.
|
["van den Eshof J.", "Frommer A.", "Lippert Th.", "Schilling K.", "van der Vorst H."]
|
["55663857700", "7006272228", "57202385981", "56188232200", "7004017911"]
| 2,002
| 16
|
[]
|
10.1016/S0920-5632(01)01931-4
|
Article
|
English
|
[{"id": "60007989", "name": "Department of Mathematics, University of Utrecht, Utrecht, Netherlands", "fullName": "Department of Mathematics, University of Utrecht", "reference": "a", "fullAddress": "Utrecht, Netherlands", "departmentId": "103441013"}, {"id": "60022995", "name": "Department of Mathematics, University of Wuppertal, Wuppertal, Germany", "fullName": "Department of Mathematics, University of Wuppertal", "reference": "b", "fullAddress": "Wuppertal, Germany", "departmentId": "104167707"}, {"id": "60022995", "name": "Department of Physics, University of Wuppertal, Wuppertal, Germany", "fullName": "Department of Physics, University of Wuppertal", "reference": "c", "fullAddress": "Wuppertal, Germany", "departmentId": "104167683"}]
|
494
| 28,195
|
Norm estimates for inverses of toeplitz distance matrices
|
Journal of Approximation Theory
|
A radial basis function approximation has the form [formula] where φ: [0,∞)→ R is some given function, (y<sub>j</sub>)<sup>n</sup><sub>1</sub> are real coefficients, and the centres (x<sub>j</sub>)<sup>n</sup><sub>1</sub> are points in R<sup>d</sup>. For a wide class of functions φ, it is known that the interpolation matrix A = (φ(||x<sub>j</sub> - x<sub>k</sub>||<sub>2</sub>))<sup>n</sup><sub>j, k=1</sub> is invertible. Further, several recent papers have provided upper bounds on ||A<sup>-1</sup>||<sub>2</sub>, where the points (x<sub>j</sub>)<sup>n</sup><sub>1</sub> satisfy the condition ||x<sub>j</sub> - x<sub>k</sub>||<sub>2</sub> ≥ δ, j ≠ k, for some positiveconstant δ. In this paper, we provide theleast upper bound on ||A<sup>-1</sup>||<sub>2</sub> when the points (x<sub>j</sub>)<sup>n</sup><sub>1</sub> form any subset of the integer lattice L<sup>d</sup>, and when φ is a conditionally negative definite function of order 1, a large set of functions which includes the multiquadric. Specifically, for any set of points (x<sub>j</sub>)<sup>n</sup><sub>1</sub> ⊂ L<sup>d</sup>, we provide the inequality [formula] where e = [1, . . ., 1]<sup>T</sup> ∈ R<sup>d</sup> and where φ is the generalized Fouriertransform of φ. We provide a constructive proof that no smaller bound is valid and comment on the relevance of the method of analysis to theproblem of estimating all the eigenvalues of suchan interpolation matrix,. © 1994 Academic Press, Inc.
|
["Baxter B.J.C."]
|
["8367418600"]
| 1,994
| 21
|
[]
|
10.1006/jath.1994.1126
|
Article
|
English
|
[{"id": "60119937", "name": "Department of Applied Mathematics and Theoretical Physics, Cambridge, CB3 9EW, Silver St., United Kingdom", "fullName": "Department of Applied Mathematics and Theoretical Physics", "reference": "a", "fullAddress": "Cambridge, CB3 9EW, Silver St., United Kingdom", "departmentId": null}]
|
495
| 28,241
|
A topological index based on distances of edges of molecular graphs
|
Journal of Chemical Information and Computer Sciences
|
A novel molecular topological index MTl(E) is proposed, based on edge-distances in molecular graphs. Edge-distances in a graph are equal to distances between vertices of the respective line graph. A simple relation is found between edge-distances and the distances between the vertices that are incident to the respective edges. MTI(E) is defined in analogy to the graph theoretical invariant of Schultz (Schultz, H. P. J. Chem. Inf. Comput. Sci. 1989, 29, 227-228). It has integer values and is easy to compute. MTI(E) is found to be well correlated with the heats of formation of alkanes.
|
["Estrada E.", "Gutman I."]
|
["7005488279", "7102696936"]
| 1,996
| 22
|
[]
|
10.1021/ci9600115
|
Article
|
English
|
[{"id": "60052951", "name": "Depto. de Diseno de Farmacos, Centro de Bioactivos Químicos, Universidad Central de Las Villas, Santa Clara 54830, Villa Clara, Cuba", "fullName": "Depto. de Diseno de Farmacos, Centro de Bioactivos Químicos, Universidad Central de Las Villas", "reference": "a", "fullAddress": "Santa Clara 54830, Villa Clara, Cuba", "departmentId": "104719127"}, {"id": "60027332", "name": "Institute of Physical Chemistry, Attila József University, H-6701 Szeged, P.O. Box 105, Hungary", "fullName": "Institute of Physical Chemistry, Attila József University", "reference": "b", "fullAddress": "H-6701 Szeged, P.O. Box 105, Hungary", "departmentId": "104387755"}, {"id": "60068809", "name": "Faculty of Science, University of Kragujevac, 34000 Kragujevac", "fullName": "Faculty of Science, University of Kragujevac", "reference": "c", "fullAddress": "34000 Kragujevac", "departmentId": "113888817"}]
|
496
| 28,301
|
Computer-aided software engineering in a distributed workstation environment
|
Proceedings of the 1st ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, SDE 1984
|
Computer-Aided Software Engineering environments are becoming essential for complex software projects, just as CAD systems have become essential for complex hardware projects. DSEE, the DOMAIN Software Engineering Environment, is a distributed, production quality, software development environment that runs on Apollo workstations. DSEE provides source code control, configuration management, release control, advice management, task management, and user-defined dependency tracking with automatic notification. DSEE incorporates some of the best ideas from existing systems. This paper describes DSEE, contrasts it other systems, and discusses some of the technical issues involved in the construction of a highly-reliable, safe, efficient, and distributed development environment. © 1984 ACM.
|
["Leblang D.B.", "Chase R.P., Jr."]
|
["6603719171", "7101997925"]
| 1,984
| 10
|
[]
|
10.1145/800020.808255
|
Conference Paper
|
English
|
[{"id": "100317766", "name": "Apollo Computer, 15 Elizabeth Drive, ChelnsFord, 01824, MA, United States", "fullName": "Apollo Computer", "reference": "a", "fullAddress": "15 Elizabeth Drive, ChelnsFord, 01824, MA, United States", "departmentId": null}]
|
497
| 28,381
|
An explicit construction of Wakimoto realizations of current algebras
|
Modern Physics Letters A
|
It is known from a work of Feigin and Frenkel that a Wakimoto type, generalized free field realization of the current algebra Ĝ<sub>k</sub> can be associated with each parabolic subalgebra P = (G<sub>0</sub> + G<sub>+</sub>) of the Lie algebra G, where in the standard case G<sub>0</sub> is the Cartan and P is the Borel subalgebra. In this letter we obtain an explicit formula for the Wakimoto realization in the general case. Using Hamiltonian reduction of the WZNW model, we first derive a Poisson bracket realization of the G-valued current in terms of symplectic bosons belonging to G<sub>+</sub> and a current belonging to G<sub>0</sub>. We then quantize the formula by determining the correct normal ordering. We also show that the affine-Sugawara stress-energy tensor takes the expected quadratic form in the constituents.
|
["De Boer J.", "Fehér L."]
|
["56268030500", "7006811013"]
| 1,996
| 6
|
[]
|
10.1142/S0217732396001995
|
Article
|
English
|
[{"id": "60026415", "name": "Institute for Theoretical Physics, State Univ. New York at Stony Brook, Stony Brook, NY 11794-3840, United States", "fullName": "Institute for Theoretical Physics, State Univ. New York at Stony Brook", "reference": "a", "fullAddress": "Stony Brook, NY 11794-3840, United States", "departmentId": "104339049"}, {"id": "60025272", "name": "Institute for Nuclear Studies, University of Tokyo, Tokyo 188, Midori-cho, Tanashi-shi, Japan", "fullName": "Institute for Nuclear Studies, University of Tokyo", "reference": "b", "fullAddress": "Tokyo 188, Midori-cho, Tanashi-shi, Japan", "departmentId": "104282342"}]
|
498
| 28,408
|
Ordered attributed grammars
|
Acta Informatica
|
Ordered attributed grammars are defined as a large subclass of semantically well-defined attributed grammars proposed by Knuth. An attributed grammar is ordered if for each symbol a partial order over the associated attributes can be given, such that in any context of the symbol the attributes are evaluable in an order which includes that partial order. The definition does not refer to a predefined strategy for attribute evaluation, e.g. several passes from left to right. For each attributed grammar evaluable by any predefined evaluation strategy such an order exists. The ordering property can be checked by an algorithm, which depends polynomially in time on the size of the input grammar. "Visit-sequences" are computed from the attribute dependencies given by an ordered attributed grammar. They describe the control flow of an algorithm for attribute evaluation which can be part of an automatically generated compiler. © 1980 Springer-Verlag.
|
["Kastens U."]
|
["6602549769"]
| 1,980
| 178
|
[]
|
10.1007/BF00288644
|
Article
|
English
|
[{"id": "60029428", "name": "Institut für Informatik II, Universität Karlsruhe, Karlsruhe 1, D-7500, Postfach 63 80, Germany", "fullName": "Institut für Informatik II, Universität Karlsruhe", "reference": "a", "fullAddress": "Karlsruhe 1, D-7500, Postfach 63 80, Germany", "departmentId": "104489065"}]
|
499
| 28,420
|
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
|
Designs, Codes, and Cryptography
|
This paper provides an exposition of methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption). We begin by surveying some useful schemes for key distribution that have been presented in the literature, giving background and examples (but not too many proofs). In particular, we look more closely at the attractive concept of key distribution patterns, and present a new method for making these schemes more efficient through the use of resilient functions. Then we present a general approach to the construction of broadcast schemes that combines key predistribution schemes with secret sharing schemes. We discuss the Fiat-Naor Broadcast Scheme, as well as other, new schemes that can be constructed using this approach.
|
["Stinson D.R."]
|
["23168455900"]
| 1,997
| 117
|
["Broadcast encryption", "Combinatorial designs", "Key distribution", "Resilient functions", "Secret sharing schemes"]
|
10.1023/A:1008268610932
|
Article
|
English
|
[{"id": "60026306", "name": "Dept. of Comp. Sci. and Engineering, University of Nebraska-Lincoln, Lincoln, NE 68588, United States", "fullName": "Dept. of Comp. Sci. and Engineering, University of Nebraska-Lincoln", "reference": "a", "fullAddress": "Lincoln, NE 68588, United States", "departmentId": "117673681"}]
|
500
| 28,545
|
Anisotropic mesh transformations and optimal error control
|
Applied Numerical Mathematics
|
Recently, research originating in several different applications has appeared on unstructured triangular meshes in which the vertex distribution is not locally uniform, i.e. anisotropic unstructured meshes. The techniques used have the common features that the distribution of triangle shapes for the mesh is controlled by specifying a symmetric tensor, and that the anisotropic mesh is the transform of an isotropic mesh. We discuss how these mechanisms arise in the theory of optimal error control, using simple model mesh generation problems, and review the related research in applications to computational fluid dynamics, surface triangulation, and semiconductor simulation. © 1994.
|
["Simpson R.B."]
|
["7403403232"]
| 1,994
| 69
|
[]
|
10.1016/0168-9274(94)90025-6
|
Article
|
English
|
[{"id": "60014171", "name": "Department of Computer Science, University of Waterloo, Waterloo, Ont. N2L 3G1, Canada", "fullName": "Department of Computer Science, University of Waterloo", "reference": "a", "fullAddress": "Waterloo, Ont. N2L 3G1, Canada", "departmentId": "105243167"}]
|
501
| 28,588
|
Critical sets in nets and latin squares
|
Journal of Statistical Planning and Inference
|
The concept of a critical set in a latin square is extended to the more general setting of nets. A lower bound is given for the size of a critical set in a group-based net. In the case of a general net of degree 3 and order n(n≥5), it is shown that the size of a critical set is bounded below by n+1. In the proof of this result, a special embedding of a latin square of order m into a suitable latin square of order n is established for every n>2m. © 1994.
|
["Cooper J.A.", "McDonough T.P.", "Mavron V.C."]
|
["57199154216", "7004509734", "6603336213"]
| 1,994
| 12
|
[]
|
10.1016/0378-3758(94)90167-8
|
Article
|
English
|
[{"id": "60008950", "name": "Department of Commerce, Australian National University, Canberra, ACT 2600, Australia", "fullName": "Department of Commerce, Australian National University", "reference": "a", "fullAddress": "Canberra, ACT 2600, Australia", "departmentId": "103494177"}, {"id": "60030514", "name": "Department of Mathematics, University of Wales, Aberystwyth, SY23 3BZ, United Kingdom", "fullName": "Department of Mathematics, University of Wales", "reference": "b", "fullAddress": "Aberystwyth, SY23 3BZ, United Kingdom", "departmentId": "104543519"}]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.