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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
902 | 51,407 | Crossed inhibition of sacral motoneurones | Journal of neurophysiology | null | ["CURTIS D.R.", "KRNJEVIC K.", "MILEDI R."] | ["7202745945", "35522225300", "7103385731"] | 1,958 | 16 | ["NEURONS"] | 10.1152/jn.1958.21.4.319 | Article | English | [] |
903 | 51,426 | The rectilinear distance minisum problem with minimum distance constraints: | Location Science | This paper describes a mathematical model for locating a single facility on a continuous plane, which considers transportation (or service) costs between the facility and a set of demand points as well as social costs arising from the undesirable characteristics of the facility. The transportation costs are given by a standard minisum objective function, while the social costs appear implicitly in the form of lower bound constraints on the distances between the facility and the demand points. The model is analyzed under the assumption that distances are measured by the rectilinear norm, and an efficient branch-and-bound algorithm is derived to solve this case. © 1996. | ["Brimberg J.", "Wesolowsky G.O."] | ["7004752152", "7004074926"] | 1,995 | 8 | ["branch-and-bound", "Facility location", "minisum"] | 10.1016/0966-8349(95)00015-1 | Article | English | [{"id": "60026338", "name": "Department of Engineering Management, Royal Military College of Canada, Kingston, Ont. K7K 5LO, Canada", "fullName": "Department of Engineering Management, Royal Military College of Canada", "reference": "a", "fullAddress": "Kingston, Ont. K7K 5LO, Canada", "departmentId": "104337251"}, {"id": "60031828", "name": "Management Science and Information Systems, MGD School of Business, McMaster University, Hamilton, Ont. L8S 4M4, Canada", "fullName": "Management Science and Information Systems, MGD School of Business, McMaster University", "reference": "b", "fullAddress": "Hamilton, Ont. L8S 4M4, Canada", "departmentId": "104616654"}] |
904 | 51,521 | Bounding completion times of jobs with arbitrary release times, variable execution times, and resource sharing | IEEE Transactions on Software Engineering | The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition, jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when scheduled on a priority-driven basis. It describes three algorithms for computing upper bounds on the completion times of jobs that have arbitrary release times and priorities. The first two are simple but do not yield sufficiently tight bounds, while the last one yields the tightest bounds but has the greatest complexity. © 1997 IEEE. | ["Sun J.", "Gardner M.K.", "Liu J.W.S."] | ["57212238815", "7401638373", "55705817000"] | 1,997 | 16 | ["Precedence constraints", "Real-time systems", "Resource sharing", "Schedulability analysis"] | 10.1109/32.637144 | Article | English | [{"id": "101359109", "name": "Geoworks, Inc., Berkeley, CA 94704, 2001 Center St., United States", "fullName": "Geoworks, Inc.", "reference": "a", "fullAddress": "Berkeley, CA 94704, 2001 Center St., United States", "departmentId": null}] |
905 | 51,552 | Uniqueness theorems of Kähler metrics of semipositive bisectional curvature on compact Hermitian symmetric spaces | Mathematische Annalen | null | ["Mok N."] | ["7004348032"] | 1,987 | 6 | [] | 10.1007/BF01450737 | Article | English | [{"id": "60030162", "name": "Department of Mathematics, Columbia University, New York, 10027, NY, Mathematics Building, United States", "fullName": "Department of Mathematics, Columbia University", "reference": "a", "fullAddress": "New York, 10027, NY, Mathematics Building, United States", "departmentId": "104524123"}] |
906 | 51,565 | All linear unitary irreducible representations of De Sitter supersymmetry with positive energy | Physics Letters B | All linear unitary irreducible representations of the graded Lie algebra osp (4.1) with positive energy are calculated by acting with the odd elements on a vacuum state. With the exception of the Dirac supermultiplet, the result corresponds to the representations of Poincaré supersymmetry. © 1982. | ["Heidenreich W."] | ["22971519400"] | 1,982 | 69 | [] | 10.1016/0370-2693(82)91038-3 | Article | English | [{"id": "60027550", "name": "Department of Physics, University of California, Los Angeles, CA 90024, United States", "fullName": "Department of Physics, University of California", "reference": "a", "fullAddress": "Los Angeles, CA 90024, United States", "departmentId": "100252034"}] |
907 | 51,630 | Dynamics of a lattice universe by the schwarzschild-cell method | Reviews of Modern Physics | null | ["Lindquist R.W.", "Wheeler J.A."] | ["22988697700", "7403110529"] | 1,957 | 89 | [] | 10.1103/RevModPhys.29.432 | Conference Paper | English | [{"id": "60003269", "name": "Palmer Physical Laboratory, Princeton University, Princeton, NJ, United States", "fullName": "Palmer Physical Laboratory, Princeton University", "reference": "a", "fullAddress": "Princeton, NJ, United States", "departmentId": null}] |
908 | 51,645 | Updating schemes, correlation structure, blocking and parameterization for the gibbs sampler | Journal of the Royal Statistical Society. Series B: Statistical Methodology | In this paper many convergence issues concerning the implementation of the Gibbs sampler are investigated. Exact computable rates of convergence for Gaussian target distributions are obtained. Different random and non-random updating strategies and blocking combinations are compared using the rates. The effect of dimensionality and correlation structure on the convergence rates are studied. Some examples are considered to demonstrate the results. For a Gaussian image analysis problem several updating strategies are described and compared. For problems in Bayesian linear models several possible parameterizations are analysed in terms of their convergence rates characterizing the optimal choice. © 1997 Royal Statistical Society. | ["Roberts G.O.", "Sahu S.K."] | ["7403400979", "7202907635"] | 1,997 | 229 | ["Bayesian inference", "Blocking", "Correlation structure", "Gaussian distribution", "Gibbs sampler", "Markov chain Monte Carlo method", "Markov random field", "Parameterization", "Random scan", "Rates of convergence", "Stochastic relaxation", "Updating schemes"] | 10.1111/1467-9868.00070 | Article | English | [{"id": "60031101", "name": "University of Cambridge, United Kingdom", "fullName": "University of Cambridge", "reference": "a", "fullAddress": "United Kingdom", "departmentId": null}, {"id": "60031101", "name": "Statistical Laboratory, University of Cambridge, Cambridge CB2 1SB, 16 Mill Lane, United Kingdom", "fullName": "Statistical Laboratory, University of Cambridge", "reference": "b", "fullAddress": "Cambridge CB2 1SB, 16 Mill Lane, United Kingdom", "departmentId": "109783184"}] |
909 | 51,658 | Automated region selection for analysis of dynamic cardiac spect data | IEEE Transactions on Nuclear Science | Dynamic cardiac SPECT using Tc-99m labeled teboroxime can provide kinetic parameters (washin, washout) indicative of myocardial blood flow. A time-consuming and subjective step of the data analysis is drawing regions of interest to delineate blood pool and myocardial tissue regions. The time-activity curves of the regions are then used to estimate local kinetic parameters. In this work, the appropriate regions are found automatically, in a manner similar to that used for calculating maximum count circumferential profiles in conventional static cardiac studies. The drawbacks to applying standard static circumferential profile methods are the high noise level and high liver uptake common in dynamic teboroxime studies. Searching along each ray for maxima to locate the myocardium does not typically provide useful information. Here we propose an iterative scheme in which constraints are imposed on the radii searched along each ray. The constraints are based on the shape of the time-activity curves of the circumferential profile members and on an assumption that the short axis slices are approximately circular. The constraints eliminate outliers and help to reduce the effects of noise and liver activity. Kinetic parameter estimates from the automatically generated regions were comparable to estimates from manually selected regions in dynamic canine teboroxime studies. © 1997 IEEE. | ["Di Bella E.V.R.", "Gullberg G.T.", "Barclay A.B.", "Eisner R.L."] | ["6602107954", "7004350490", "7102034128", "57195617075"] | 1,997 | 11 | [] | 10.1109/23.597013 | Article | English | [{"id": "60025488", "name": "Department of Radiology, University of Utah, Salt Lake City 84132, United States", "fullName": "Department of Radiology, University of Utah", "reference": "a", "fullAddress": "Salt Lake City 84132, United States", "departmentId": "105471090"}, {"id": "60012837", "name": "Carlyle Fraser Heart Center, Emory:Crawford long Hospital, Atlanta 30365, United States", "fullName": "Carlyle Fraser Heart Center, Emory:Crawford long Hospital", "reference": "b", "fullAddress": "Atlanta 30365, United States", "departmentId": null}] |
910 | 51,734 | Postprocessing the Galerkin method: The finite-element case | SIAM Journal on Numerical Analysis | A postprocessing technique, developed earlier for spectral methods, is extended here to Galerkin finite-element methods for dissipative evolution partial differential equations. The postprocessing amounts to solving a linear elliptic problem on a finer grid (or higher-order space) once the time integration on the coarser mesh is completed. This technique increases the convergence rate of the finite-element method to which it is applied, and this is done at almost no additional computational cost. The numerical experiments presented here show that the resulting postprocessed method is computationally more efficient than the method to which it is applied (say, quadratic finite elements) as well as standard methods of similar order of convergence as the postprocessed one (say, cubic finite elements). The error analysis of the new method is performed in L<sup>2</sup> and in L<sup>∞</sup> norms. | ["García-Archilla B.", "Titi E.S."] | ["57199218656", "7003569203"] | 2,000 | 43 | ["Dissipative equations", "Multilevel methods", "Nonlinear Galerkin methods", "Postprocessing finite-element methods"] | 10.1137/s0036142998335893 | Article | English | [{"id": "60026796", "name": "Departamento de Matemáticas, Univ. Autónoma de Madrid, 28049 Madrid, Spain", "fullName": "Departamento de Matemáticas, Univ. Autónoma de Madrid", "reference": "a", "fullAddress": "28049 Madrid, Spain", "departmentId": null}, {"id": "60033284", "name": "Depto. Matematica Aplicada II, Universidad de Sevilla, Escuela Superior de Ingenieror, 41092 Sevilla, Camino de lor Descubrimientor S/N, Spain", "fullName": "Depto. Matematica Aplicada II, Universidad de Sevilla, Escuela Superior de Ingenieror", "reference": "b", "fullAddress": "41092 Sevilla, Camino de lor Descubrimientor S/N, Spain", "departmentId": "113838585"}, {"id": "60007278", "name": "Department of Mathematics, Dept. of Mech. and Aerosp. Eng., University of California, Irvine, CA 92697-3875, United States", "fullName": "Department of Mathematics, Dept. of Mech. and Aerosp. Eng., University of California", "reference": "c", "fullAddress": "Irvine, CA 92697-3875, United States", "departmentId": null}] |
911 | 51,758 | Design of a Fuzzy Logic Based Robotic Admittance Controller | Intelligent Automation and Soft Computing | A fuzzy logic based admittance control approach is proposed for the control of robotic end-effector forces occurring during a typical automated robotic manufacturing task. The proposed admittance control approach provides the necessary nonlinear control actions required in a typical automated robotic manufacturing task, and at the same time enables the incorporation of existing knowledge obtained from the process operator, in the design of the controller. This can significantly reduce the controller development time. The robotic deburring task is used as an example of a typical manufacturing task, although the technique can be easily extended to other manufacturing tasks. Automated robotic deburring offers an attractive alternative to manual deburring in terms of reduced costs and improved quality of the finished parts. The approaches proposed for control of deburring using conventional control techniques require an accurate process model and hence are not ideally suited for control under conditions of uncertainty in the available information about the process. Fuzzy logic control techniques offer an alternative to conventional control methods used for the deburring task. A fuzzy logic rule base is designed, using the knowledge obtained from the deburring operator, to control the deburring robot in the presence of uncertainties in the burr size and location information. The fuzzy logic controller issues corrections to the nominal robot trajectory based on the burrs encountered. The corrected robot trajectory is then input to a robot positional controller. Simulation results are presented to demonstrate the effectiveness of the proposed fuzzy logic based admittance control scheme in controlling the automated robotic deburring operation. © 1998 Taylor & Francis Group, LLC. | ["Prabhu S.M.", "Garg D.P."] | ["55802854500", "7102459372"] | 1,998 | 7 | ["Admittance control", "Fuzzy logic", "Robotic manufacturing"] | 10.1080/10798587.1998.10750730 | Article | English | [{"id": "100433828", "name": "CGN Associates, Inc., Cary, NC, 27511, United States", "fullName": "CGN Associates, Inc.", "reference": "a", "fullAddress": "Cary, NC, 27511, United States", "departmentId": null}, {"id": "60008724", "name": "Dept. of Mechanical Engineering Materials Science, Duke University, Durham, NC, 27708, United States", "fullName": "Dept. of Mechanical Engineering Materials Science, Duke University", "reference": "b", "fullAddress": "Durham, NC, 27708, United States", "departmentId": "103482787"}] |
912 | 51,772 | Robust dense matching using local and global geometric constraints | Proceedings-International Conference on Pattern Recognition | A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed with the best first strategy to densify the matches. Next, the matching map is regularised by using the local geometric constraints encoded by planar affine applications and by using the global geometric constraint encoded by the fundamental matrix. Two most distinctive features are a match propagation strategy developed by analogy to region growing and a successive regularisation by local and global geometric constraints. The algorithm is efficient, robust and can cope with wide disparity. The algorithm is demonstrated on many real image pairs and applications on image interpolation and creating novel views are also presented. © 2000 IEEE. | ["Lhuillier M.", "Quan L."] | ["55932338200", "57193547034"] | 2,000 | 41 | [] | 10.1109/ICPR.2000.905620 | Article | English | [{"id": "100444617", "name": "CNRS-GRAVIR-INRIA, ZIRST, 38330 Montbonnot, 655 avenue de l’Europe, France", "fullName": "CNRS-GRAVIR-INRIA, ZIRST", "reference": "a", "fullAddress": "38330 Montbonnot, 655 avenue de l’Europe, France", "departmentId": "102456254"}] |
913 | 51,815 | Optical-digital method of local histogram calculation by threshold decomposition | Applied Optics | A theorem for calculating the local histograms of a gray-scale input image by means of convolution of input-image binary slices with a binary kernel is presented and proved. The calculation of the local histograms of a gray-scale image for all resolution cells and its arbitrary neighborhoods is optically implemented in a shadow-casting correlator. The choice of different rank-order values from the local histograms can lead to a wide spectrum of nonlinear filtration algorithms. © 1993 Optical Society of America. | ["Kober V.", "Cichocki T.", "Gedziorowski M.", "Szoplik T."] | ["7003270592", "7006268789", "6508209884", "7004677983"] | 1,993 | 13 | ["Nonlinear image processing", "Rank-order filters", "Threshold decomposition"] | 10.1364/AO.32.000692 | Article | English | [{"id": "60110700", "name": "Institute of Geophysics, University of Warsaw, WS, 02-093, Ul. Pasteura 7, Poland", "fullName": "Institute of Geophysics, University of Warsaw", "reference": "a", "fullAddress": "WS, 02-093, Ul. Pasteura 7, Poland", "departmentId": null}] |
914 | 52,034 | Critical exponents of the chiral Potts model from conformal field theory | Nuclear Physics, Section B | The Z<sub>N</sub>-invariant chiral Potts model is considered as a perturbation of Z<sub>N</sub> conformal field theory. In the self-dual case the renormalization group equations become simple, and yield critical exponents and anisotropic scaling which agree with exact results for the super-integrable lattice models. The continuum theory is shown to possess an infinite number of conserved charges on the self-dual line, which remain conserved when the theory is perturbed by the energy operator. © 1993. | ["Cardy J.L."] | ["7005351841"] | 1,993 | 36 | [] | 10.1016/0550-3213(93)90353-Q | Article | English | [{"id": "60159478", "name": "Isaac Newton Institute for Mathematical Sciences, Cambridge, CB3 0EH, 20 Clarkson Road, United Kingdom", "fullName": "Isaac Newton Institute for Mathematical Sciences", "reference": "a", "fullAddress": "Cambridge, CB3 0EH, 20 Clarkson Road, United Kingdom", "departmentId": null}] |
915 | 52,061 | Separation of Humic Substances by pH Gradient Desorption from a Hydrophobic Resin | Analytical Chemistry | null | ["Tessari G.", "Torsi G."] | ["7004132118", "7003549511"] | 1,979 | 26 | [] | 10.1021/ac50048a036 | Article | English | [{"id": "105792716", "name": "Istituto di Chimica Analitica Via G. Amendola, 173 70126 Bari, Italy", "fullName": "Istituto di Chimica Analitica Via G. Amendola", "reference": "a", "fullAddress": "173 70126 Bari, Italy", "departmentId": null}] |
916 | 52,105 | A simultaneous maximum likelihood approach for galaxy-galaxy lensing and cluster lens reconstruction | Monthly Notices of the Royal Astronomical Society | In a previous paper we investigated means for constraining the mass distribution of cluster galaxies by weak lensing. We concluded that a comprehensive method should treat the lensing effects of individual cluster galaxies and those resulting from a general cluster component simultaneously. To this end we now develop a non-parametric maximum likelihood cluster reconstruction algorithm that can implicitly take into account the presence of cluster galaxies. The method includes an entropy-like regularization prescription and directly uses the ellipticities of individual source galaxy images as observables rather than relying on an averaged ellipticity field. The mass distribution of cluster galaxies is described by parametrized models. For each set of galaxy parameters the cluster reconstruction algorithm allows us to determine the best representation of the global underlying cluster component that is consistent with the presence of the cluster galaxies and the observed image ellipticities of background galaxies. Tests with simulations yield convincing and robust results. We apply the method to a WFPC2 image of the cluster C10939+4713, and obtain a detection of the lensing effects of luminous elliptical cluster galaxies. We consider this application as a successful test of our technique. However, the small size of the image we analysed does not yet allow us to draw strong conclusions regarding the mass distribution of cluster galaxies. | ["Geiger B.", "Schneider P."] | ["57002628600", "57218941481"] | 1,999 | 23 | ["Dark matter", "Galaxies: clusters: general", "Galaxies: clusters: individual: C10939+4713", "Galaxies: haloes", "Gravitational lensing"] | 10.1046/j.1365-8711.1999.02085.x | Article | English | [{"id": "60023091", "name": "Max-Planck-Inst. fur Astrophysik, 85740 Garching bei M̈nchen, Karl-Schwarzschild-Stra 1, Germany", "fullName": "Max-Planck-Inst. fur Astrophysik", "reference": "a", "fullAddress": "85740 Garching bei M̈nchen, Karl-Schwarzschild-Stra 1, Germany", "departmentId": null}, {"id": "60015201", "name": "Institut d'Astrophysique de Paris, 75014 Paris, 98bis Boulevard Arago, France", "fullName": "Institut d'Astrophysique de Paris", "reference": "b", "fullAddress": "75014 Paris, 98bis Boulevard Arago, France", "departmentId": null}] |
917 | 52,107 | Dynamical suppression of decoherence in two-state quantum systems | Physical Review A - Atomic, Molecular, and Optical Physics | The dynamics of a decohering two-level system driven by a suitable control Hamiltonian is studied. The control procedure is implemented as a sequence of radio-frequency pulses that repetitively flip the state of the system, a technique that can be termed quantum “bang-bang” control after its classical analog. Decoherence introduced by the system’s interaction with a quantum environment is shown to be washed out completely in the limit of continuous flipping and greatly suppressed provided the interval between the pulses is made comparable to the correlation time of the environment. The model suggests a strategy to fight against decoherence that complements existing quantum error-correction techniques. © 1998 The American Physical Society. | ["Viola L.", "Lloyd S."] | ["35370022600", "7202190752"] | 1,998 | 1,081 | [] | 10.1103/PhysRevA.58.2733 | Article | English | [{"id": "60022195", "name": "D’Arbeloff Laboratory for Information Systems and Technology, Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA, 02139, United States", "fullName": "D’Arbeloff Laboratory for Information Systems and Technology, Department of Mechanical Engineering, Massachusetts Institute of Technology", "reference": "a", "fullAddress": "Cambridge, MA, 02139, United States", "departmentId": "113327352"}] |
918 | 52,331 | Mixture models based on homogeneous polynomials | Journal of Statistical Planning and Inference | Models for mixtures of ingredients are typically fitted by Scheffé's canonical model forms. An alternative representation is discussed which offers attractive symmetries, compact notation and homogeneous model functions. It is based on the Kronecker algebra of vectors and matrices, used successfully in previous response surface work. These alternative polynomials are contrasted with those of Scheffé, and ideas of synergism and model reduction are connected together in both algebras. Scheffé's 'special cubic' is shown to be sensible in both algebras. | ["Draper N.R.", "Pukelsheim F."] | ["7005349892", "6603637944"] | 1,998 | 47 | ["62J05", "62K15", "Designs for mixtures", "First-order models", "Kronecker product", "Mixture amount models", "Scheffé canonical polynomial", "Second-order models", "Synergism", "Third-order models"] | 10.1016/s0378-3758(98)00012-3 | Article | English | [{"id": "60032179", "name": "Department of Statistics, University of Wisconsin-Madison, Madison, WI 53706-1685, United States", "fullName": "Department of Statistics, University of Wisconsin-Madison", "reference": "a", "fullAddress": "Madison, WI 53706-1685, United States", "departmentId": "109698521"}, {"id": "60015481", "name": "Department of Statistics, University of Washington, Seattle, WA 98195-4322, United States", "fullName": "Department of Statistics, University of Washington", "reference": "b", "fullAddress": "Seattle, WA 98195-4322, United States", "departmentId": "112824318"}] |
919 | 52,393 | A cross validated bayesian retrieval algorithm for nonlinear remote sensing experiments | Journal of Computational Physics | A fully automated retrieval algorithm for estimating nonlinearly sensed functions is presented. This algorithm combines a simple Gauss-Newton iteration with an extended form of Generalized Cross Validation. The performance of the algorithm is illustrated in the context of a remote sensing problem arising in satellite meteorology. © 1985. | ["O'Sullivan F.", "Wahba G."] | ["7004416797", "6603672796"] | 1,985 | 49 | [] | 10.1016/0021-9991(85)90121-4 | Article | English | [{"id": "60025038", "name": "Department of Statistics, University of California, Berkeley, CA 94720, United States", "fullName": "Department of Statistics, University of California", "reference": "a", "fullAddress": "Berkeley, CA 94720, United States", "departmentId": "104262043"}, {"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": "108382219"}] |
920 | 52,522 | Temperature-Constrained Cascade Correlation Networks | Analytical Chemistry | A novel neural network has been devised that combines the advantages of cascade correlation and computational temperature constraints. The combination of advantages yields a nonlinear calibration method that is easier to use, stable, and faster than back-propagation networks. Cascade correlation networks adjust only a single unit at a time, so they train very rapidly when compared to back-propagation networks. Cascade correlation networks determine their topology during training. In addition, the hidden units are not readjusted once they have been trained, so these networks are capable of incremental learning and caching. With the cascade architecture, temperature may be optimized for each hidden unit. Computational temperature is a parameter that controls the fuzziness of a hidden unit's output. The magnitude of the change in covariance with respect to temperature is maximized. This criterion avoids local minima, forces the hidden units to model larger variances in the data, and generates hidden units that furnish fuzzy logic. As a result, models built using temperature-constrained cascade correlation networks are better at interpolation or generalization of the design points. These properties are demonstrated for exemplary linear interpolations, a non-linear interpolation, and chemical data sets for which the numbers of chlorine atoms in polychlorinated biphenyl molecules are predicted from mass spectra. | ["Harrington P.D.B."] | ["35577407600"] | 1,998 | 0 | [] | 10.1021/ac970851y | Article | English | [{"id": "60011132", "name": "Ctr. for Intelligent Chem. Instrum., Clippinger Laboratories, Ohio University, Athens, OH 45701-2979, United States", "fullName": "Ctr. for Intelligent Chem. Instrum., Clippinger Laboratories, Ohio University", "reference": "a", "fullAddress": "Athens, OH 45701-2979, United States", "departmentId": "103599629"}] |
921 | 52,549 | On some algebraic problems in connection with general elgenvalue algorithms | Linear Algebra and Its Applications | Two real matrices A,B are S-congruent if there is a nonsingular upper triangular matrix R such that A = R<sup>T</sup>BR. This congruence relation is studied in the set of all nonsingular symmetric and that of all skew-symmetric matrices. Invariants and systems of representation are give. The results are applied to the question of decomposability of a matrix in a product of an isometry and an upper triangular matrix, a problem crucial in eigenvalue algorithms. © 1979. | ["Elsner L."] | ["7003482017"] | 1,979 | 32 | [] | 10.1016/0024-3795(79)90175-7 | Article | English | [{"id": "60015595", "name": "Fakultät für Mathematik Universität Bielefeld, 4800 Bielefeld 1, Postfach 8640, Germany", "fullName": "Fakultät für Mathematik Universität Bielefeld", "reference": "a", "fullAddress": "4800 Bielefeld 1, Postfach 8640, Germany", "departmentId": null}] |
922 | 52,565 | Robustness and convergence rate of a discrete-time learning control algorithm for a class of nonlinear systems | International Journal of Robust and Nonlinear Control | In this paper, we apply a discrete-time learning algorithm<sup>1</sup> to a class of discrete-time varying nonlinear systems with affine input action and linear output having relative degree one. We investigate the robustness of the algorithm to state disturbance, measurement noise and reinitialization errors. We show that the input and the state variables are always bounded if certain conditions are met. Moreover, we shown that the input error and state error converge uniformly to zero in absence of all disturbances. In addition, we show that, after a finite number of iterations, the convergence rate is exponential in l<sup>∞</sup>. A numerical example is added to illustrate the results. Copyright © 1999 John Wiley & Sons, Ltd. | ["Saab S.S."] | ["7004275222"] | 1,999 | 16 | ["Iterative control", "Learning control", "Nonlinear systems", "Robust learning algorithm"] | 10.1002/(SICI)1099-1239(19990730)9:9<559::AID-RNC421>3.0.CO;2-J | Article | English | [{"id": "60068769", "name": "Lebanese American University, Byblos, Lebanon", "fullName": "Lebanese American University", "reference": "a", "fullAddress": "Byblos, Lebanon", "departmentId": null}, {"id": "60068769", "name": "Lebanese American University, New York, NY 10115-0065, 475 Riverside Drive # 1846, Lebanon", "fullName": "Lebanese American University", "reference": "b", "fullAddress": "New York, NY 10115-0065, 475 Riverside Drive # 1846, Lebanon", "departmentId": null}] |
923 | 52,568 | Photoacoustic spectra of transparent solids doped with localised absorbing centres | Journal of Physics C: Solid State Physics | A theoretical method for obtaining the band shapes of photoacoustic (PA) spectra in solids containing absorbing centres is reported. This theory combines some standard approaches used in PA spectroscopy and the Huang-Rhys model for electron-lattice coupling, and provides a PA method for quantum efficiency calculations. An application to real systems such as Al<sub>2</sub>O <sub>3</sub>:Cr, ZnS:Mn is made. The theoretical predictions show a fairly good agreement with the published experimental results. Further improvements of the models proposed are discussed in the concluding section. | ["Etxebarria J.", "Fernandez J."] | ["9234668300", "7404574969"] | 1,983 | 17 | [] | 10.1088/0022-3719/16/19/020 | Article | English | [{"id": "60027856", "name": "Department de Física, Universidad del País Vasco, Facultad de Ciencias, Bilbao, Apartado 644, Spain", "fullName": "Department de Física, Universidad del País Vasco, Facultad de Ciencias", "reference": "a", "fullAddress": "Bilbao, Apartado 644, Spain", "departmentId": "104412675"}] |
924 | 52,629 | Detour-cluj matrix and derived invariants | Journal of Chemical Information and Computer Sciences | Detour-variant, CJΔ<sub>u</sub>, of the recently proposed Cluj matrix, CJD<sub>u</sub>, is defined and exemplified. Cluj indices built up on the two variants of the Cluj matrix are evaluated and compared, for selected sets of graphs. A new graph-theoretical local property is defined, namely, the "internal ending of all longest paths joining a vertex i, with deg<sub>i</sub> > 1, with all the remaining vertices in the graph", as the property of the vertex i (called an internal endpoint) to have all its entries in CJΔ<sub>u</sub> equal to 1. Classes of graphs possessing a minimal CJΔ<sub>p</sub> value (i.e., in which all vertices are internal endpoints) have been identified. Correlating tests of the invariants calculated on the two variants of Cluj matrices are also performed. | ["Diudea M.V.", "Parv B.", "Gutman I."] | ["7006271534", "6506653280", "7102696936"] | 1,997 | 24 | [] | 10.1021/ci970041n | Article | English | [{"id": "60024417", "name": "Department of Chemistry, Babes-Bolyai University, 3400 Cluj, Romania", "fullName": "Department of Chemistry, Babes-Bolyai University", "reference": "a", "fullAddress": "3400 Cluj, Romania", "departmentId": "112847349"}, {"id": "60024417", "name": "Department of Mathematics, Babes-Bolyai University, 3400 Cluj, Romania", "fullName": "Department of Mathematics, Babes-Bolyai University", "reference": "b", "fullAddress": "3400 Cluj, Romania", "departmentId": "112476853"}, {"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"}] |
925 | 52,635 | A multidisciplinary model of voluntary employee turnover | Journal of Vocational Behavior | This paper proposes a model of employee turnover based upon the existing literature from psychological, sociological, and economic perspectives. Voluntary turnover is posited to have three major classes of determinants: characteristics of the individual employee, work-related factors, and the states of certain economic variables. The model proposes that economic factors serve to control the degree to which individual and work-related factors can explain variation in turnover. It is hypothesized that individual and work-related variables will be more predictive of turnover under prosperous economic conditions than when the economy is strained. The model also proposes four classes of consequences of turnover: individual, organizational-social, organizational-economic, and societal. Recommendations for future turnover research are discussed. © 1980. | ["Muchinsky P.M.", "Morrow P.C."] | ["6603883463", "7102131574"] | 1,980 | 135 | [] | 10.1016/0001-8791(80)90022-6 | Article | English | [{"id": "60004354", "name": "Iowa State University, United States", "fullName": "Iowa State University", "reference": "a", "fullAddress": "United States", "departmentId": null}] |
926 | 52,666 | Λ<sub>c</sub>/Λ̄<sub>c</sub> production asymmetries in pp and π<sup>-</sup>p collisions | European Physical Journal C | We study Λ<sub>c</sub>/̄Λ<sub>c</sub> production asymmetries in pp and π<sup>-</sup>p collisions using a recently proposed two component model. The model includes heavy baryon production by the usual mechanism of parton fusion and fragmentation plus recombination of valence and sea quarks from the beam and target hadrons. We compare our results with experimental data on asymmetries measured recently. | ["Herrera G.", "Magnin J."] | ["7101830248", "7005609374"] | 1,998 | 11 | [] | 10.1007/s100529800840 | Article | English | [{"id": "60017323", "name": "Ctro. Investigacion Estud. Avanzados, México 07000, DF, Apdo. Postal 14-740, Mexico", "fullName": "Ctro. Investigacion Estud. Avanzados", "reference": "a", "fullAddress": "México 07000, DF, Apdo. Postal 14-740, Mexico", "departmentId": null}, {"id": "60008132", "name": "Ctro. Bras. de Pesq. Físicas, CEP 22290-180, Rio de Janeiro, Rua Dr. Xavier Sigaud 150, Brazil", "fullName": "Ctro. Bras. de Pesq. Físicas", "reference": "b", "fullAddress": "CEP 22290-180, Rio de Janeiro, Rua Dr. Xavier Sigaud 150, Brazil", "departmentId": null}] |
927 | 52,792 | Expansion of the midpalatal suture, studied by means of metallic implants | Acta Odontologica Scandinavica | null | ["Krebs A."] | ["35341982700"] | 1,959 | 48 | [] | 10.3109/00016355908993936 | Article | English | [{"id": "60021141", "name": "The Department of Orthodontics, The Royal Dental College, Copenhagen, Denmark", "fullName": "The Department of Orthodontics, The Royal Dental College", "reference": "a", "fullAddress": "Copenhagen, Denmark", "departmentId": "104069910"}] |
928 | 52,830 | On the superlinear Ambrosetti-Prodi problem | Nonlinear Analysis | null | ["De Figueiredo D.G."] | ["55666176700"] | 1,984 | 45 | ["monotone iteration method", "mountain pass theorem", "Semilinear elliptic boundary value problem"] | 10.1016/0362-546X(84)90010-5 | Article | English | [{"id": "60024989", "name": "Department of Mathematics, University of Brasília, 70910 Brasília, Brazil", "fullName": "Department of Mathematics, University of Brasília", "reference": "a", "fullAddress": "70910 Brasília, Brazil", "departmentId": "104259775"}] |
929 | 52,888 | Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem | Mathematical Programming | The Fermat-Weber location problem is to find a point in ℝ<sup>n</sup> that minimizes the sum of the weighted Euclidean distances from m given points in ℝ<sup>n</sup>. A popular iterative solution method for this problem was first introduced by Weiszfeld in 1937. In 1973 Kuhn claimed that if the m given points are not collinear then for all but a denumerable number of starting points the sequence of iterates generated by Weiszfeld's scheme converges to the unique optimal solution. We demonstrate that Kuhn's convergence theorem is not always correct. We then conjecture that if this algorithm is initiated at the affine subspace spanned by the m given points, the convergence is ensured for all but a denumerable number of starting points. © 1989 The Mathematical Programming Society, Inc. | ["Chandrasekaran R.", "Tamir A."] | ["7006808983", "7102306717"] | 1,989 | 57 | ["Location theory", "The Fermat-Weber location problem", "Weiszfeld's iterative algorithm"] | 10.1007/BF01587094 | Article | English | [{"id": "60009415", "name": "University of Texas, Dallas, TX, United States", "fullName": "University of Texas", "reference": "a", "fullAddress": "Dallas, TX, United States", "departmentId": null}, {"id": "60021784", "name": "New York University, New York, NY, United States", "fullName": "New York University", "reference": "b", "fullAddress": "New York, NY, United States", "departmentId": null}, {"id": "60005681", "name": "Tel Aviv University, Tel Aviv, Israel", "fullName": "Tel Aviv University", "reference": "c", "fullAddress": "Tel Aviv, Israel", "departmentId": null}] |
930 | 52,947 | Limit theorems for convex hulls | Probability Theory and Related Fields | It is shown that the process of vertices of the convex hull of a uniform sample from the interior of a convex polygon converges locally, after rescaling, to a strongly mixing Markov process, as the sample size tends to infinity. The structure of the limiting Markov process is determined explicitly, and from this a central limit theorem for the number of vertices of the convex hull is derived. Similar results are given for uniform samples from the unit disk. © 1988 Springer-Verlag. | ["Groeneboom P."] | ["6603828261"] | 1,988 | 63 | [] | 10.1007/BF00342231 | Article | English | [{"id": "60006288", "name": "Faculty of Mathematics and Informatics, Delft University of Technology, Delft, 2628 BL, Julianalaan, 132, Netherlands", "fullName": "Faculty of Mathematics and Informatics, Delft University of Technology", "reference": "a", "fullAddress": "Delft, 2628 BL, Julianalaan, 132, Netherlands", "departmentId": "103356272"}] |
931 | 53,005 | Effects of meprobamate, phenobarbital and dextroamphetamine on reaction time and learning in man | The Journal of pharmacology and experimental therapeutics | null | ["KORNETSKY C."] | ["7006467440"] | 1,958 | 16 | ["AMPHETAMINE/effects", "LEARNING", "MEPROBAMATE/effects", "PHENOBARBITAL/effects"] | null | Article | English | [] |
932 | 53,008 | Exact eigenstates of tight-binding Hamiltonians on the Penrose tiling | Physical Review B - Condensed Matter and Materials Physics | We investigate exact eigenstates of tight-binding models on the planar rhombic Penrose tiling. We consider a vertex model with hopping along the edges and the diagonals of the rhombi. For the wave functions, we employ an ansatz, first introduced by Sutherland, which is based on the arrow decoration that encodes the matching rules of the tiling. Exact eigenstates are constructed for particular values of the hopping parameters and the eigenenergy. By a generalized ansatz that exploits the inflation symmetry of the tiling, we show that the corresponding eigenenergies are infinitely degenerate. Generalizations and applications to other systems are outlined. © 1998 The American Physical Society. | ["Repetowicz P.", "Grimm U.", "Schreiber M."] | ["6602411438", "7005727617", "22998421900"] | 1,998 | 27 | [] | 10.1103/PhysRevB.58.13482 | Article | English | [{"id": "60008069", "name": "Institut für Physik, Technische Universität Chemnitz, D-09107 Chemnitz, Germany", "fullName": "Institut für Physik, Technische Universität Chemnitz", "reference": "a", "fullAddress": "D-09107 Chemnitz, Germany", "departmentId": "112673678"}] |
933 | 53,040 | Bialgebras over noncommutative rings and a structure theorem for hopf bimodules | Applied Categorical Structures | It is a key property of bialgebras that their modules have a natural tensor product. More precisely, a bialgebra over k can be characterized as an algebra H whose category of modules is a monoidal category in such a way that the underlying functor to the category of k -vector spaces is monoidal (i.e. preserves tensor products in a coherent way). In the present paper we study a class of algebras whose module categories are also monoidal categories; however, the underlying functor to the category of k -vector spaces fails to be monoidal. Instead, there is a suitable underlying functor to the category of B-bimodules over a k-algebra B which is monoidal with respect to the tensor product over B. In other words, we study algebras L such that for two L-modules V and W there is a natural tensor product, which is the tensor product V ⊗<sub>B</sub> W over another k-algebra B, equipped with an L-module structure defined via some kind of comultiplication of L. We show that this property is characteristic for ×<sub>B</sub>-bialgebras as studied by Sweedler (for commutative B) and Takeuchi. Our motivating example arises when H is a Hopf algebra and A an H-Galois extension of B. In this situation, one can construct an algebra L:= L(A, H), which was previously shown to be a Hopf algebra if B = k. We show that there is a structure theorem for relative Hopf bimodules in the form of a category equivalence <sub>A</sub>M<sub>A</sub> <sup>H</sup> ≅ <sub>L</sub>M. The category on the left hand side has a natural structure of monoidal category (with the tensor product over A) which induces the structure of a monoidal category on the right hand side. The ×<sub>B</sub>-bialgebra structure of L that corresponds to this monoidal structure generalizes the Hopf algebra structure on L(A, H) known for B = k. We prove several other structure theorems involving L = L(A, H) in the form of category equivalences <sup>L</sup>M ≅ <sup>H</sup>M, <sub>A</sub> <sup>L</sup>M ≅ <sub>k</sub>M, <sub>A</sub><sup>L</sup>M<sub>A</sub> ≅ M<sub>H</sub>,<sub>A</sub><sup>L</sup>M<sup>H</sup>≅ M<sup>H</sup> and <sub>A</sub><sup>L</sup>M<sub>A</sub><sup>H</sup> ≅ YD<sub>H</sub> <sup>H</sup>. | ["Schauenburg P."] | ["6701594865"] | 1,998 | 50 | ["Bialgebra", "Hopf algebra", "Hopf module", "Hopf-Galois extension", "Monoidal category", "×<sub>B</sub>-bialgebra"] | 10.1023/A:1008608028634 | Article | English | [{"id": "60028717", "name": "Mathematisches Institut, Universität München, 80333 München, Theresienstr. 39, Germany", "fullName": "Mathematisches Institut, Universität München", "reference": "a", "fullAddress": "80333 München, Theresienstr. 39, Germany", "departmentId": "104451777"}] |
934 | 53,042 | Improvements on Sloan's algorithm for constructing Delaunay triangulations | Computers and Geosciences | null | ["Huang C.-W.", "Shih T.-Y."] | ["56170898200", "35204080800"] | 1,998 | 2 | [] | 10.1016/S0098-3004(97)00136-2 | Article | English | [{"id": "60012370", "name": "Department of Civil Engineering, National Chiao-Tung University, Hsin-Chu, Taiwan", "fullName": "Department of Civil Engineering, National Chiao-Tung University", "reference": "a", "fullAddress": "Hsin-Chu, Taiwan", "departmentId": "113851744"}] |
935 | 53,062 | Continuous Hahn polynomials and the Heisenberg algebra | Journal of Mathematical Physics | Continuous Hahn polynomials have surfaced in a number of somewhat obscure physical applications. For example, they have emerged in the description of two-photon processes in hydrogen, hard-hexagon statistical mechanical models, and Clebsch-Gordan expansions for unitary representations of the Lorentz group SO(3,1). In this paper it is shown that there is a simple and elegant way to construct these polynomials using the Heisenberg algebra. © 1987 American Institute of Physics. | ["Bender C.M.", "Mead L.R.", "Pinsky S.S."] | ["7102455523", "7005265700", "7006288522"] | 1,987 | 32 | [] | 10.1063/1.527635 | Article | English | [{"id": "60010261", "name": "Department of Physics, Washington University, St. Louis, MO 63130, United States", "fullName": "Department of Physics, Washington University", "reference": "a", "fullAddress": "St. Louis, MO 63130, United States", "departmentId": "112912763"}, {"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": "113169669"}, {"id": "60007027", "name": "Physics Department, University of Southern Mississippi, Hattiesburg, MS 39401, United States", "fullName": "Physics Department, University of Southern Mississippi", "reference": "c", "fullAddress": "Hattiesburg, MS 39401, United States", "departmentId": "108181942"}] |
936 | 53,125 | Conformation of polymer molecules at solid-liquid interfaces by small-angle neutron scattering | Polymer Engineering and Science | A wide variety of physical-chemical phenomena depend on the behavior of the polymer at solid-liquid interfaces. The feature that distinguishes such phenomena from their small-molecule counterparts is the long-chain structure of the polymer molecules. Just as in solution and the bulk, the conformational statistics of the polymer molecules in the interface is an important determinant of interfacial properties. Conformational statistics of interfacial polymer is expressed in terms a function called the polymer density profile φ(Z), which is just the volume fraction of polymer as a function of Z, the distance from the solid surface out into the continuum liquid. There is only one experimental technique that is purported to be able to determine polymer density profiles of polymers confined to the interface between finely divided substrate and dispersant, and that technique is small-angle neutron scattering (SANS). In this paper we present a protocol for the analysis of SANS data on spherical particles with adsorbed polymer for the determination of φ(Z). We give an example for nearly-monodisperse chains of poly(n-butyl methacrylate) with a molecular weight of 45,000 tethered to silica spheres with a diameter of 2150 Å. The polymer density profile demonstrates a deep depletion layer next to the surface with a maximum in φ(Z) of about 0.7 at about Z= 40 Å. Our experimental φ(Z) is compared with various theoretical predictions. | ["Forsman W.C.", "Latshaw B.E."] | ["24495223600", "6506661908"] | 1,996 | 7 | [] | 10.1002/pen.10504 | Article | English | [{"id": "60006297", "name": "Chemical Engineering, University of Pennsylvania, Philadelphia, PA 19104, United States", "fullName": "Chemical Engineering, University of Pennsylvania", "reference": "a", "fullAddress": "Philadelphia, PA 19104, United States", "departmentId": "109853981"}, {"id": "60027723", "name": "Air Products and Chemicals, Allentown, PA 18195, 7201 Hamilton Boulevard, United States", "fullName": "Air Products and Chemicals", "reference": "b", "fullAddress": "Allentown, PA 18195, 7201 Hamilton Boulevard, United States", "departmentId": null}] |
937 | 53,145 | Assessing influence on regression coefficients in generalized linear models | Biometrika | Suggested diagnostics for influence on the estimated regression coefficients in a generalized linear model have generally approximated the effect of deleting a single case. We apply the local influence method of Cook (1986) to assess the effect of small perturbations of the data, including the vector of responses, case weights, explanatory variables, and the components of one case. The resulting diagnostics allow one to check for different kinds of influence, and may give insight into its workings. Two examples illustrate some of the diagnostics. © 1989 Biometrika Trust. | ["Thomas W.", "Cook R.D."] | ["55429838800", "36492944100"] | 1,989 | 76 | ["Data perturbation", "Diagnostic", "Local influence"] | 10.1093/biomet/76.4.741 | Article | English | [{"id": "60020547", "name": "Department of Statistics, Texas A and M University, College Station, Texas 77843, United States", "fullName": "Department of Statistics, Texas A and M University, College Station", "reference": "a", "fullAddress": "Texas 77843, United States", "departmentId": "108382076"}, {"id": "60029445", "name": "Department of Applied Statistics, University of Minnesota, St Paul, Minnesota 55108, United States", "fullName": "Department of Applied Statistics, University of Minnesota", "reference": "b", "fullAddress": "St Paul, Minnesota 55108, United States", "departmentId": "104490161"}] |
938 | 53,179 | A generalization of generalized quasi-variational inequalities | Journal of Mathematical Analysis and Applications | The aim of this paper is to give an application of a fixed point theorem of a compact acyclic multifunction to a generalized quasi-variational inequality problem. In a non-compact setting, we present some general acyclic-valued versions of several known results due to Kim, Shih, and Tan. © 1994 Academic Press, Inc. | ["Kum S."] | ["6602555030"] | 1,994 | 32 | [] | 10.1006/jmaa.1994.1073 | Article | English | [{"id": "60013361", "name": "Department of Applied Mathematics, Korea Maritime University, Pusan, 606791, South Korea", "fullName": "Department of Applied Mathematics, Korea Maritime University", "reference": "a", "fullAddress": "Pusan, 606791, South Korea", "departmentId": "103697328"}] |
939 | 53,207 | High-reliability, low-energy microarchitecture synthesis | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | Continuous scaling of device dimensions has accelerated the power dissipation and electromigration-induced reliability degradation in integrated circuits. Submicrometer scaling increases the fraction of on-chip energy dissipated on long interconnects and buses. In addition, submicrometer-level scaling increases current density in long interconnects and buses, causing structural damage in metal lines due to electromigration (a major failure phenomenon in integrated circuits). We present algorithms for synthesizing high-reliability, low-energy microarchitectures. This can be realized by judiciously binding and scheduling the data transfers of a control-data-flow graph representation of an application onto the buses in the microarchitecture. The algorithm considers i) correlations between data transfers, ii) constraints on the number of buses, and iii) area and delay. © 1998 IEEE. | ["Dasgupta A.", "Karri R."] | ["7202436788", "7006419874"] | 1,998 | 16 | ["Electromigration", "High-level synthesis", "Low power"] | 10.1109/43.736567 | Article | English | [{"id": "60014313", "name": "Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003, United States", "fullName": "Department of Electrical and Computer Engineering, University of Massachusetts", "reference": "a", "fullAddress": "Amherst, MA 01003, United States", "departmentId": "100250782"}] |
940 | 53,257 | Fuzzy regression by fuzzy number neural networks | Fuzzy Sets and Systems | In this paper, we describe a method for nonlinear fuzzy regression using neural network models. In earlier work, strong assumptions were made on the form of the fuzzy number parameters: symmetric triangular, asymmetric triangular, quadratic, trapezoidal, and so on. Our goal here is to substantially generalize both linear and nonlinear fuzzy regression using models with general fuzzy number inputs, weights, biases, and outputs. This is accomplished through a special training technique for fuzzy number neural networks. The technique is demonstrated with data from an industrial quality control problem. © 2000 Elsevier Science B.V. All rights reserved. | ["Dunyak J.P.", "Wunsch D."] | ["6603665201", "7006706193"] | 2,000 | 29 | ["Back propagation", "Fuzzy regression", "Neural networks"] | 10.1016/S0165-0114(97)00393-X | Article | English | [{"id": "60021285", "name": "Department of Mathematics, Texas Tech University, Lubbock, TX 79409, United States", "fullName": "Department of Mathematics, Texas Tech University", "reference": "a", "fullAddress": "Lubbock, TX 79409, United States", "departmentId": "104082064"}, {"id": "60021285", "name": "Department of Electrical Engineering, Texas Tech University, Lubbock, TX 79409, United States", "fullName": "Department of Electrical Engineering, Texas Tech University", "reference": "b", "fullAddress": "Lubbock, TX 79409, United States", "departmentId": "110069261"}] |
941 | 53,260 | Pathological outcomes of observational learning | Econometrica | This paper explores how Bayes-rational individuals learn sequentially from the discrete actions of others. Unlike earlier informational herding papers, we admit heterogeneous preferences. Not only may type-specific "herds" eventually arise, but a new robust possibility emerges: confounded learning. Beliefs may converge to a limit point where history offers no decisive lessons for anyone, and each type's actions forever nontrivially split between two actions. To verify that our identified limit outcomes do arise, we exploit the Markov-martingale character of beliefs. Learning dynamics are stochastically stable near a fixed point in many Bayesian learning models like this one. | ["Smith L.", "Sørensen P."] | ["7410394025", "8419350500"] | 2,000 | 301 | ["Cascades", "Informational herding", "Markov process", "Martingale", "Stochastic stability"] | 10.1111/1468-0262.00113 | Article | English | [{"id": "60025778", "name": "Dept. of Economics, University of Michigan, United States", "fullName": "Dept. of Economics, University of Michigan", "reference": "a", "fullAddress": "United States", "departmentId": "105257107"}, {"id": "60030840", "name": "Institute of Economics, University of Copenhagen, Denmark", "fullName": "Institute of Economics, University of Copenhagen", "reference": "b", "fullAddress": "Denmark", "departmentId": "104565153"}] |
942 | 53,305 | Warped linear prediction (WLP) in speech and audio processing | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings | In this paper linear prediction process is applied to frequency warped signals. The warping is realized by using orthonormal FAM<sup>1</sup> functions. The general formulation of WLP is given and effective realizations with allpass filters are studied. The application of auditory WLP to speech coding and speech recognition has given good results. © 1994 IEEE. | ["Laine U.K.", "Karjalainen M.", "Altosaar T."] | ["6701511041", "7007069259", "7801647017"] | 1,994 | 35 | [] | 10.1109/ICASSP.1994.390018 | Conference Paper | English | [{"id": "60103653", "name": "Helsinki University of Technology, Acoustics Laboratory, Otakaari 5A, Espoo, SF-02150, Finland", "fullName": "Helsinki University of Technology, Acoustics Laboratory", "reference": "a", "fullAddress": "Otakaari 5A, Espoo, SF-02150, Finland", "departmentId": "112557560"}] |
943 | 53,322 | Stream cipher based on pseudorandom number generation with optical affine transformation | Applied Optics | We propose a new, to our knowledge, stream cipher technique for two-dimensional (2-D) image data that can be implemented by iterative optical transformation. The stream cipher uses a pseudorandom number generator (PRNG) to generate a pseudorandom bit sequence. The proposed method for the PRNG is composed of the iterative operation of 2-D affine transformation achieved by optical components and by modulo-n addition of the transformed images. We expect efficient execution of the method by optical parallel processing. We verify the performance of the proposed method in terms of security strength and clarify problems on optical implementation by the optical fractal synthesizer. © 2000 Optical Society of America. | ["Sasaki T.", "Togo H.", "Tanida J.", "Ichioka Y."] | ["35778907400", "7005263894", "7005728716", "35561375500"] | 2,000 | 18 | [] | 10.1364/AO.39.002340 | Article | English | [{"id": "60024322", "name": "Department of Material and Life Science, Graduate School of Engineering, Osaka University, Osaka, 565-0871, 2-1 Yamadaoka, Suita, Japan", "fullName": "Department of Material and Life Science, Graduate School of Engineering, Osaka University", "reference": "a", "fullAddress": "Osaka, 565-0871, 2-1 Yamadaoka, Suita, Japan", "departmentId": "104225658"}] |
944 | 53,337 | On the validity of chiral perturbation theory for the ΔI= 1 2 rule | Physics Letters B | The chiral perturbation theory relations of 〈ππ|O|K〉 to 〈π|O|K〉 and 〈o|O|K〉 needed for establishing the ΔI= 1 2 rule in hadronic weak decays via lattice calculations are examined beyond leading order and the domain of validity for this relation is established. © 1985. | ["Bijnens J."] | ["56230624000"] | 1,985 | 23 | [] | 10.1016/0370-2693(85)91175-X | Article | English | [{"id": "60031581", "name": "California Institute of Technology, Pasadena, CA 91125, United States", "fullName": "California Institute of Technology", "reference": "a", "fullAddress": "Pasadena, CA 91125, United States", "departmentId": null}] |
945 | 53,365 | Independence numbers of product graphs | Journal of Combinatorial Theory, Series B | This paper deals with the problem of determining the independence number for the strong graph-product, especially for odd cycles. Using the concepts of a point-symmetric graph and the clique-number and introducing the notion of an independence graph, we extend and generalize some results of Hales [3] for cycle-products of power three. © 1974. | ["Sonnemann E.", "Krafft O."] | ["24792609000", "6602426664"] | 1,974 | 15 | [] | 10.1016/0095-8956(74)90081-1 | Article | English | [{"id": "60028229", "name": "Institut für Mathematische Stochastik der Universität, 2 Hamburg 13, West Germany", "fullName": null, "reference": "a", "fullAddress": null, "departmentId": null}] |
946 | 53,376 | Universal configurational structure in two-dimensional scalar models | Journal of Physics A: General Physics | Monte Carlo methods are used to explore the universal configurational structure of two-dimensional spin- 1/2, spin-1 and border- phi <sup>4</sup> models. Comparison of spin- 1/2 and spin-1 data provides evidence that the magnetisation distribution (effectively the Helmholtz free-energy function) and its coupling derivative (effectively the internal-energy function) constitute readily accessible signatures of a universality class. It is shown that, when allowance is made for relatively large corrections-to-scaling effects, the behaviour of the border- phi <sup>4</sup> model may be satisfactorily matched to that of the other two models, substantiating the view that the border model does indeed belong to the Ising universality class. | ["Nicolaides D.", "Bruce A.D."] | ["56968399300", "7202888945"] | 1,988 | 65 | [] | 10.1088/0305-4470/21/1/028 | Article | English | [{"id": "60027272", "name": "Dept. of Phys., Edinburgh Univ., United Kingdom", "fullName": "Dept. of Phys., Edinburgh Univ.", "reference": "a", "fullAddress": "United Kingdom", "departmentId": "104382671"}] |
947 | 53,440 | Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems | Journal of Parallel and Distributed Computing | Recently Aklet al. introduced a new model of parallel computation, called broadcasting with selective reduction (BSR), and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting, parallel prefix, and other problems. In this paper, we describe constant time solutions to the longest common subsequence problem and the sequence alignment problem using the BSR model. These are the first constant time solutions to these problems for any model of computation. © 1999 Academic Press. | ["Myoupo J.-F.", "Semé D."] | ["6602174721", "56617936100"] | 1,999 | 18 | [] | 10.1006/jpdc.1999.1534 | Article | English | [{"id": "60016097", "name": "Univ. de Picardie Jules Verne, 80039, Amiens Cedex, 33, rue Saint-Leu, France", "fullName": "Univ. de Picardie Jules Verne", "reference": "a", "fullAddress": "80039, Amiens Cedex, 33, rue Saint-Leu, France", "departmentId": null}] |
948 | 53,529 | IR model of 3D aircraft for simulation of reticle seekers | Journal of Circuits, Systems and Computers | This paper presents an efficient simulation method that generates thermal images and also gives tracking results of infra-red (IR) reticle seekers. First, we make an IR model of the object with the internal heat source, and generate thermal images by the optical system of the reticle seeker and the atmospheric turbulence. Using the obtained thermal images, we can simulate IR reticle seekers in various scenarios including countermeasures (CM) such as flares. Simulation results show that we can generate more accurate images by using the proposed method, which is applicable to the study of the development of counter-countermeasures (CCMs). | ["Hong H.-K.", "Han S.-H.", "Hong G.-P.", "Jahng S.-G.", "Choi J.-S."] | ["7401521390", "57199142326", "7203031405", "6701530621", "55586223400"] | 1,997 | 4 | [] | 10.1142/S0218126697000243 | Article | English | [{"id": "60014237", "name": "Department of Electronic Engineering, Chung-Ang University, Dongjak-Ku, Seoul 156-756, 221 Huksuk-Dong, South Korea", "fullName": "Department of Electronic Engineering, Chung-Ang University", "reference": "a", "fullAddress": "Dongjak-Ku, Seoul 156-756, 221 Huksuk-Dong, South Korea", "departmentId": "103740346"}] |
949 | 53,597 | Near Perfect Coverings in Graphs and Hypergraphs | European Journal of Combinatorics | Suppose we are given a bipartite graph with vertex set X, Y, |X| = n, |Y| = N, each point in X (Y) has degree D(d) fixed, respectively, moreover, each pair of points x, x' ∈ X has at most D/(log n)<sup>3</sup> (common) neighbours. Let t(X, Y) denote the minimum number of vertices of Y needed to cover all vertices of X. We prove (Theorem 1.1) that t(X, Y) d / n tends to 1 as n tends to infinity. This result has many applications: Theorem [5]. Suppose k > r > 1 are fixed, n → ∞. Then there exists a collection of (1 + o(1)) × (<sup>n</sup><sub>r</sub>)/(<sup>k</sup><sub>r</sub>) k-subsets of an n-set so that each r-subset is contained in at least one member of the collection. Analogues and strengthenings of this result are deduced. E.g. for vector spaces, orthogonal or simplectic geometries, random collections of k-sets with constant probabilities, etc. Theorem 3.3. Suppose G is a graph on v vertices and e edges and ℛ is a random graph on n vertices and edge probability e/ (<sup>v</sup><sub>2</sub>). Then there exists a collection of (1 + o(1))(<sup>n</sup><sub>2</sub>)/ (<sup>v</sup><sub>2</sub>) induced subgraphs of ℛ on v vertices, isomorphic to G and such that each edge (non-edge) of ℛ is covered by an edge (non-edge) of a graph in the collection. © 1985, Academic Press Inc. (London) Limited. All rights reserved. | ["Frankl P.", "Rödl V."] | ["7003591530", "57206543090"] | 1,985 | 105 | [] | 10.1016/S0195-6698(85)80045-7 | Article | English | [{"id": "60008134", "name": "CNRS, Paris, France", "fullName": "CNRS", "reference": "a", "fullAddress": "Paris, France", "departmentId": null}, {"id": "60013323", "name": "CVUT, Prague", "fullName": "CVUT", "reference": "b", "fullAddress": "Prague", "departmentId": null}] |
950 | 53,646 | Automatic Equalization for Digital Communication | Bell System Technical Journal | Distortion in transmission channels causes intersymbol interference in digital communication systems. This distortion may be partially corrected at the receiver through the use of a tapped delay line having adjustable tap gain settings (transversal filler). The problem of minimizing distortion with a finite‐length transversal filter is examined. In the region of small initial channel distortion where most existing systems operate, the best tap gain settings satisfy a set of simultaneous linear equations. For larger initial distortion, iterative techniques are required to find best gain settings. The distortion is shown to be a convex function of the tap gains, so mathematical programming techniques may be employed for optimization. The practical problem is that of evolving a logical strategy whereby the tap gains of the transversal filter may be set to optimum values. An easily implemented system for automatic equalization is described which makes use of a steepest‐descent technique of minimization. The equalizer is automatically set prior to data transmission in a training period during which a series of test pulses is transmitted. Only polarity information is required, so digital logic may be used in the equalizer. For application to high‐speed data transmission, great accuracies are required for the tap gain settings. Thus the problem of noise in the channel during equalization is quite important. The final error due to noise and channel distortion and the equalizer settling time are discussed and evaluated. Finally, the effect of a transversal filter equalizer in terms of the system frequency‐domain characteristics is considered. © 1965 The Bell System Technical Journal | ["Lucky R.W."] | ["6603822917"] | 1,965 | 386 | [] | 10.1002/j.1538-7305.1965.tb01678.x | Article | English | [] |
951 | 53,663 | Matching structural images of the human brain using statistical and geometrical image features | Proceedings of SPIE - The International Society for Optical Engineering | The efficacy of using intensity edges, curvature of iso-intensity contours, and tissue classified data for image matching are examined. The image matching problem is formulated in such a way that the different features are handled uniformly, allowing the same code to be used in each instance. The results using both simulated and real brain images indicate that each feature affected an improvement in the correspondence after matching with it. © 1994 SPIE. All rights reserved. | ["Gee J.C.", "Barillot C.", "Le Briquer L.", "Haynor D.R.", "Bajcsy R."] | ["57202708522", "56861959800", "6506242754", "7005723263", "7006078015"] | 1,994 | 32 | [] | 10.1117/12.185179 | Conference Paper | English | [{"id": "60030553", "name": "Laboratoire SIM, Faculte de Medecine, Universite de Rennes I, Rennes Cedex, 35043, France", "fullName": "Laboratoire SIM, Faculte de Medecine, Universite de Rennes I", "reference": "a", "fullAddress": "Rennes Cedex, 35043, France", "departmentId": "104546055"}, {"id": "60006297", "name": "Department of Computer and Information Science, University of Pennsylvania, Philadelphia, 19104, PA, United States", "fullName": "Department of Computer and Information Science, University of Pennsylvania", "reference": "b", "fullAddress": "Philadelphia, 19104, PA, United States", "departmentId": "112586306"}, {"id": "60015481", "name": "Department of Radiology, University of Washington, Seattle, 98195, WA, United States", "fullName": "Department of Radiology, University of Washington", "reference": "c", "fullAddress": "Seattle, 98195, WA, United States", "departmentId": "113517753"}] |
952 | 53,792 | Effective lifetimes in high quality silicon devices | Solid State Electronics | A correct interpretation of pn junction current-voltage and pulsed MOS capacitance-time data allows space-charge region width dependent generation parameters to be separated from bulk controlled recombination parameters. This is very important for the correct extraction of generation lifetime and minority carrier diffusion length, especially for intrinsically gettered devices where the recombination center density varies through the device. Methods to do this are discussed in this paper. © 1984. | ["Schroder D.K."] | ["7202277634"] | 1,984 | 28 | [] | 10.1016/0038-1101(84)90120-5 | Article | English | [{"id": "60003892", "name": "Electrical and Computer Engineering, Arizona State University, Tempe, AZ 85287, United States", "fullName": "Electrical and Computer Engineering, Arizona State University", "reference": "a", "fullAddress": "Tempe, AZ 85287, United States", "departmentId": "103245599"}] |
953 | 53,795 | Stochastic trends and jumps in EMS exchange rates | Journal of International Money and Finance | In this paper we study the statistical properties of EMS exchange rate returns. Our findings show that jumps, time-varying parameters and conditional leptokurtosis are pertinent features in the empirical distributions of EMS exchange rate returns. Allowance for fat tails, however, tends to reduce the measured frequency of jumps in the distributions to more realistic proportions. Most successful in capturing the relevant features of EMS exchange rate returns is a combined jump-GARCH model with conditionally t-distributed innovations. (JEL F31). © 1994. | ["Nieuwland F.G.", "Verschoor W.F.", "Wolff C.C."] | ["6508059892", "6603113350", "7103395739"] | 1,994 | 60 | [] | 10.1016/0261-5606(94)90039-6 | Article | English | [{"id": "60018869", "name": "Limburg Institute of Financial Economics (LIFE), University of Limburg, Maastricht, Netherlands", "fullName": "Limburg Institute of Financial Economics (LIFE), University of Limburg", "reference": "a", "fullAddress": "Maastricht, Netherlands", "departmentId": "103965678"}, {"id": "60018869", "name": "Limburg Institute of Financial Economics (LIFE), University of Limburg, Maastricht, Netherlands", "fullName": "Limburg Institute of Financial Economics (LIFE), University of Limburg", "reference": "b", "fullAddress": "Maastricht, Netherlands", "departmentId": "103965678"}, {"id": "60018869", "name": "Limburg Institute of Financial Economics (LIFE), University of Limburg, Maastricht, Netherlands", "fullName": "Limburg Institute of Financial Economics (LIFE), University of Limburg", "reference": "c", "fullAddress": "Maastricht, Netherlands", "departmentId": "103965678"}, {"id": "60016621", "name": "CEPR, London, United Kingdom", "fullName": "CEPR", "reference": "d", "fullAddress": "London, United Kingdom", "departmentId": null}] |
954 | 53,918 | Realistic surface reconstruction of 3D scenes from uncalibrated image sequences | Journal of Visualization and Computer Animation | This contribution addresses the problem of obtaining 3D models from image sequences. A 3D surface description of the scene is extracted completely from a set of uncalibrated camera images of the scene. No prior knowledge about the scene or about the camera is needed to build the 3D models. The only assumptions are the rigidity of the scene objects and opaque object surfaces. The modelling system described here uses a three-step approach. First, the camera pose and intrinsic parameters are calibrated by tracking salient feature points throughout the sequence. Next, consecutive images of the sequence are treated as stereoscopic image pairs, and dense correspondence maps are computed by area matching. Finally, dense and accurate depth maps are computed by linking together all correspondences over the viewpoints. The depth maps are converted to triangular surfaces meshes that are texture mapped for photo-realistic appearance. The feasibility of the approach has been tested on both real and synthetic data and is illustrated here on several outdoor image sequences. Copyright © 2000 John Wiley & Sons, Ltd. | ["Koch R.", "Pollefeys M.", "Van Gool L."] | ["7403189785", "7004040532", "22735702300"] | 2,000 | 33 | ["3D scene reconstruction", "Camera calibration", "Image sequence analysis", "Photo-realistic 3D modeling"] | 10.1002/1099-1778(200007)11:3<115::AID-VIS228>3.0.CO;2-2 | Article | English | [{"id": "60012345", "name": "Inst. Informatik Praktische Math., Chrstn.-Albrechts-Univ. Kiel, D-24118 Kiel, Olshausenstrasse 40, Germany", "fullName": "Inst. Informatik Praktische Math., Chrstn.-Albrechts-Univ. Kiel", "reference": "a", "fullAddress": "D-24118 Kiel, Olshausenstrasse 40, Germany", "departmentId": "103652043"}, {"id": "101788401", "name": "FHSU University, KS, United States", "fullName": "FHSU University", "reference": "b", "fullAddress": "KS, United States", "departmentId": null}, {"id": "60004935", "name": "University of Hannover, Germany", "fullName": "University of Hannover", "reference": "c", "fullAddress": "Germany", "departmentId": null}, {"id": "60025063", "name": "Computer Vision Group, KU Leuven, Belgium", "fullName": "Computer Vision Group", "reference": "d", "fullAddress": "KU Leuven, Belgium", "departmentId": "104265773"}, {"id": "60012345", "name": "Multimedia Information Processing, Inst. of Comp. Sci. and Appl. Math., Chrstn.-Albrechts-Univ. Kiel, Kiel, Germany", "fullName": "Multimedia Information Processing, Inst. of Comp. Sci. and Appl. Math., Chrstn.-Albrechts-Univ. Kiel", "reference": "e", "fullAddress": "Kiel, Germany", "departmentId": "103652401"}, {"id": "60025063", "name": "Ctr. for Proc. of Speech and Images, KU Leuven, Belgium", "fullName": "Ctr. for Proc. of Speech and Images", "reference": "f", "fullAddress": "KU Leuven, Belgium", "departmentId": null}, {"id": "60025063", "name": "Katholieke Universiteit Leuven, Belgium", "fullName": "Katholieke Universiteit Leuven", "reference": "g", "fullAddress": "Belgium", "departmentId": null}, {"id": "60025858", "name": "ETH, Zurich, Switzerland", "fullName": "ETH", "reference": "h", "fullAddress": "Zurich, Switzerland", "departmentId": null}] |
955 | 54,179 | A changing grain size model for gas-solid reactions | Chemical Engineering Science | null | ["Georgakis C.", "Chang C.W.", "Szekely J."] | ["55809197000", "37092351900", "7101872981"] | 1,979 | 166 | [] | 10.1016/0009-2509(79)80012-3 | Article | English | [{"id": "60022195", "name": "Department of Chemical Engineering Massachusetts Institute of Technology Cambridge, Massachusetts, MA 02159, United States", "fullName": "Department of Chemical Engineering Massachusetts Institute of Technology Cambridge", "reference": "a", "fullAddress": "Massachusetts, MA 02159, United States", "departmentId": null}, {"id": "60022195", "name": "Department of Material Science, Engineering Massachusetts Institute of Technology Cambridge, Massachusetts, MA 02159, United States", "fullName": "Department of Material Science, Engineering Massachusetts Institute of Technology Cambridge", "reference": "b", "fullAddress": "Massachusetts, MA 02159, United States", "departmentId": "104136623"}] |
956 | 54,215 | Descents, Quasi-Symmetric Functions, Robinson-Schensted for Posets, and the Chromatic Symmetric Function | Journal of Algebraic Combinatorics | We investigate an apparent hodgepodge of topics: a Robinson-Schensted algorithm for (3 + 1)-free posets, Chung and Graham's G-descent expansion of the chromatic polynomial, a quasi-symmetric expansion of the path-cycle symmetric function, and an expansion of Stanley's chromatic symmetric function X<sub>G</sub> in terms of a new symmetric function basis. We show how the theory of P-partitions (in particular, Stanley's quasi-symmetric function expansion of the chromatic symmetric function X<sub>G</sub>) unifies them all, subsuming two old results and implying two new ones. Perhaps our most interesting result relates to the still-open problem of finding a Robinson-Schensted algorithm for (3 + 1)-free posets. (Magid has announced a solution but it appears to be incorrect.) We show that such an algorithm ought to "respect descents," and that the best partial algorithm so far - due to Sundquist, Wagner, and West - respects descents if it avoids a certain induced subposet. | ["Chow T.Y."] | ["7203012065"] | 1,999 | 11 | ["(3 + 1)-free poset", "Chromatic polynomial"] | 10.1023/A:1018719315718 | Article | English | [{"id": "100400944", "name": "Tellabs Research Center, Cambridge, MA 02139, 1 Kendall Square, United States", "fullName": "Tellabs Research Center", "reference": "a", "fullAddress": "Cambridge, MA 02139, 1 Kendall Square, United States", "departmentId": null}] |
957 | 54,227 | Thin detectors for the CHICSi ΔE-E telescope | IEEE Transactions on Nuclear Science | A pilot series of 10 μm to 15 μm thin silicon detectors has been made for the ΔE-E telescopes in the CHICSi detector system. This system will operate at the CELSIUS heavy ion storage ring in Uppsala, Sweden. ΔE-E telescopes provide isotope identification and energy determination of fragments from nuclear collisions. The thin detectors are made as p-i-n diodes in thin etched membranes in 280 μm thick silicon wafers. The membranes are made with anisotropic etching using 25 w% tetramethylammonium hydroxide (TMAH) solution. The etch speed of this solution is very uniform across a wafer. As a result detectors with uniform thickness can be produced. The etch depth varies with less than ±0.3 μm over a wafer and the surface microroughness is in the range from 2 to 4 nm. Each detector has a 10.0 mm × 10.0 mm active area on a 10.2 mm × 10.2 mm membrane surrounded by a 1.1 mm wide supporting frame. The detectors have leakage currents in the active area of approximately 0.5 nA at 20 V. The breakdown voltage of the detectors is above 100 V. Evaluation experiments with telescopes consisting of a thin detector in combination with a thick detector have shown excellent isotope separation capabilities. Mass separation of <sup>6</sup>Li and <sup>7</sup>Li is clearly observable. © 1997 IEEE. | ["Evensen L.", "Westgaard T.", "Avdeichikov V.", "Carlén L.", "Jakobsson B.", "Murin Y.", "Mårtensson J.", "Oskarsson A.", "Siwek A.", "Whitlow H.J.", "Van Veldhuizen E.J.", "Westerberg L.", "Guttormsen M."] | ["6602180851", "6602075702", "7004262973", "12755278500", "7006243395", "6602565851", "57188544440", "55325031800", "6701370629", "7005687377", "7004711877", "7003938985", "8213645700"] | 1,997 | 31 | [] | 10.1109/23.603723 | Article | English | [{"id": "60000251", "name": "IEEE, Norway", "fullName": "IEEE", "reference": "a", "fullAddress": "Norway", "departmentId": null}, {"id": "60004205", "name": "SINTEF Electronics and Cybernetics, N-0314 Oslo, P.O.Box 124 Blindern, Norway", "fullName": "SINTEF Electronics and Cybernetics", "reference": "b", "fullAddress": "N-0314 Oslo, P.O.Box 124 Blindern, Norway", "departmentId": null}, {"id": "60029170", "name": "University of Lund, Div. of Cosmic and Subatomic Physics, S-221 00 Lund, P.O.Box 118, Sweden", "fullName": "University of Lund, Div. of Cosmic and Subatomic Physics", "reference": "c", "fullAddress": "S-221 00 Lund, P.O.Box 118, Sweden", "departmentId": "104472785"}, {"id": "60056249", "name": "Lund Institute of Technology, Dept. of Nuclear Physics, S-221 00 Lund, P.O.Box 118, Sweden", "fullName": "Lund Institute of Technology, Dept. of Nuclear Physics", "reference": "d", "fullAddress": "S-221 00 Lund, P.O.Box 118, Sweden", "departmentId": "122964756"}, {"id": "60003858", "name": "Uppsala University, Dept. of Radiation Sciences, S-751 21 Uppsala, P.O.Box 535, Sweden", "fullName": "Uppsala University, Dept. of Radiation Sciences", "reference": "e", "fullAddress": "S-751 21 Uppsala, P.O.Box 535, Sweden", "departmentId": "105178695"}, {"id": "60010348", "name": "University of Oslo, Dept. of Physics, N-0316, Oslo, P.O.Box 1048 Blindern, Norway", "fullName": "University of Oslo, Dept. of Physics", "reference": "f", "fullAddress": "N-0316, Oslo, P.O.Box 1048 Blindern, Norway", "departmentId": "112449197"}] |
958 | 54,406 | New constraints from electric dipole moments on parameters of the supersymmetric SO(10) model | Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy Physics | We calculate the chromoelectric dipole moment (CEDM) of d-and s-quark in the supersymmetric SO(10) model. CEDM is more efficient than quark electric dipole moment (EDM), in inducing the neutron EDM. New, strict constraints on parameters of the supersymmetric SO(10) model follow in this way from the neutron dipole moment experiments. As strict bounds are derived from the upper limits on the dipole moment of <sup>199</sup>Hg. | ["Khriplovich I.B.", "Zyablyuk K.N."] | ["7006496747", "6603185253"] | 1,996 | 15 | [] | 10.1016/0370-2693(96)00577-1 | Article | English | [{"id": "60023579", "name": "Budker Institute of Nuclear Physics, 630090 Novosibirsk, Russian Federation", "fullName": "Budker Institute of Nuclear Physics", "reference": "a", "fullAddress": "630090 Novosibirsk, Russian Federation", "departmentId": null}, {"id": "60018710", "name": "Inst. of Theor. and Exp. Physics, 117259 Moscow, Russian Federation", "fullName": "Inst. of Theor. and Exp. Physics", "reference": "b", "fullAddress": "117259 Moscow, Russian Federation", "departmentId": null}] |
959 | 54,458 | Path integral Monte Carlo using multigrid techniques | Chemical Physics Letters | Monte Carlo simulations of euclidean path integrals based on local update algorithms are severely hampered by diverging autocorrelation times τ in the continuum limit. If ε{lunate} denotes the discretization parameter we verify for simulations with the standard Metropolis algorithm the theoretically expected behaviour τ∝ (1/ε{lunate})<sup>2</sup>. We then demonstrate numerically that this problem can be overcome by using mathematically very well-founded multigrid techniques. © 1993. | ["Janke W.", "Sauer T."] | ["7102841112", "56260296600"] | 1,993 | 20 | [] | 10.1016/0009-2614(93)85108-Z | Article | English | [{"id": "60007774", "name": "Höchstleistungsrechenzentrum, Forschungszentrum Jülich, W-5170 Jülich, Postfach 1913, Germany", "fullName": "Höchstleistungsrechenzentrum, Forschungszentrum Jülich", "reference": "a", "fullAddress": "W-5170 Jülich, Postfach 1913, Germany", "departmentId": null}, {"id": "60030718", "name": "Institut für Theoretische Physik, Freie Universität Berlin, W-1000 Berlin 33, Arnimallee 14, Germany", "fullName": "Institut für Theoretische Physik, Freie Universität Berlin", "reference": "b", "fullAddress": "W-1000 Berlin 33, Arnimallee 14, Germany", "departmentId": "104553934"}] |
960 | 54,504 | Size dependence of the diffusion coefficient for large adsorbed clusters | Physical Review B - Condensed Matter and Materials Physics | We report systematic and accurate simulation studies of the diffusion coefficient (D) of two-dimensional clusters using a lattice model. For small cluster sizes, we observe a size dependence of D that is consistent with theoretical predictions for a periphery-diffusion mechanism. For larger sizes, we find a much weaker size dependence of D. This is in agreement with that seen in recent experimental studies of homoepitaxial, metal fcc(001) cluster diffusion. The weak size dependence of D for larger clusters correlates well with the concerted motion of kinks. We propose an expression to describe this behavior. © 1999 The American Physical Society. | ["Pal S.", "Fichthorn K.A."] | ["7402277686", "7004656725"] | 1,999 | 23 | [] | 10.1103/PhysRevB.60.7804 | Article | English | [{"id": "60001439", "name": "Departments of Chemical Engineering and Physics, The Pennsylvania State University, University Park, PA, 16802, United States", "fullName": "Departments of Chemical Engineering and Physics, The Pennsylvania State University", "reference": "a", "fullAddress": "University Park, PA, 16802, United States", "departmentId": "103117914"}] |
961 | 54,567 | Some fixed point and almost fixed point theorems for multivalued mappings in topological vector spaces | Nonlinear Analysis | null | ["Hadžić O."] | ["6602996585"] | 1,981 | 14 | ["almost continuous selection property", "fixed point theorems", "Multivalued mappings", "paranormed spaces", "random normed spaces", "topological vector space", "uniformly u-continuous multivalued mappings"] | 10.1016/0362-546X(81)90060-2 | Article | English | [{"id": "60068801", "name": "Department of Mathematics, University of Novi Sad", "fullName": "Department of Mathematics, University of Novi Sad", "reference": "a", "fullAddress": null, "departmentId": "105436310"}] |
962 | 54,593 | Exponential localization of linear response in networks with exponentially decaying coupling | Nonlinearity | Let S be a countable metric space with metric d, for each s ∈ S let X<sub>s</sub>, Y<sub>s</sub> be Banach spaces, and let X, Y be the subsets of ⊗<sub>s∈S</sub>X<sub>s</sub>, ⊗<sub>s∈S</sub>Y<sub>s</sub>, respectively, with finite supremum norm over their factors. Let L : X → Y be an invertible 'exponentially local' bounded linear map, i.e. such that for some ζ > I, sup<sub>r∈S</sub> ∑<sub>s∈S</sub> |L<sub>rs</sub>|z<sup>d(r,s)</sup> < ∞ for 0 < z < ζ. Let u ∈ Y be exponentially localized around a site o ∈ S. Then the response v = L<sup>-1</sup>u is also exponentially localized about o. This linear result is of fundamental importance to a wide variety of nonlinear problems, including spatial localization of discrete breathers and bipolarons. For illustration, a simple application is given to equilibria of networks of bistable units. Finally, the result is generalized to maps between product spaces with arbitrary norms based on the norms on the factors. | ["Baesens C.", "MacKay R.S."] | ["6602102586", "15742541200"] | 1,997 | 31 | [] | 10.1088/0951-7715/10/4/008 | Article | English | [{"id": "60031101", "name": "Nonlinear Centre, DAMTP, University of Cambridge, Cambridge CB3 9EW, United Kingdom", "fullName": "Nonlinear Centre, DAMTP, University of Cambridge", "reference": "a", "fullAddress": "Cambridge CB3 9EW, United Kingdom", "departmentId": "109934260"}, {"id": "60031810", "name": "Ctr. Dynamique Systemes Complexes, Laboratoire de Physique, Université de Bourgogne, 21004 Dijon, France", "fullName": "Ctr. Dynamique Systemes Complexes, Laboratoire de Physique, Université de Bourgogne", "reference": "b", "fullAddress": "21004 Dijon, France", "departmentId": "100289648"}] |
963 | 54,595 | Challenges for extended technicolour theories | Nuclear Physics, Section B | We develop the dialectic between extended technicolour theories and phenomenological constraints on rare processes. The natural suppression of flavour-changing neutral currents and CP-violating processes which can occur in models with elementary scalars is not a general feature of naïve extended technicolour (ETC) models. We study the extent to which naïve ETC estimates must in fact be suppressed in order to be compatible with the phenomenology of such rare processes. We emphasize the potential significance of the exchanges of neutral flavour-changing bosons and find that the strongest constraints arise from considering the combination of the D<sub>1</sub><sup>0</sup>-D<sub>2</sub><sup>0</sup> and K<sub>1</sub><sup>0</sup>-K<sub>2</sub><sup>0</sup> systems. CP-violating effects in ETC models must be severely suppressed if they are to be compatible with the observational facts. We point to several rare processes whose further experimental study is of particular concern to ETC theories. © 1981. | ["Dimopoulos S.", "Ellis J."] | ["7007024797", "57203587466"] | 1,981 | 180 | [] | 10.1016/0550-3213(81)90132-2 | Article | English | [{"id": "60012708", "name": "Physics Department, Stanford University, Stanford, CA 94305, United States", "fullName": "Physics Department, Stanford University", "reference": "a", "fullAddress": "Stanford, CA 94305, United States", "departmentId": "105188410"}, {"id": "60019778", "name": "CERN, Geneva, Switzerland", "fullName": "CERN", "reference": "b", "fullAddress": "Geneva, Switzerland", "departmentId": null}] |
964 | 54,604 | Investigating the Behaviour of Neural and Fuzzy-Statistical Classifiers in Sub-Pixel Land Cover Estimations | Canadian Journal of Remote Sensing | This paper reports on an experimental study designed for the in-depth investigation of how two of the most widely used non-conventional classifiers, one based on fuzzy-statistical and the other on neural approaches, evaluate partial membership in land cover classes. Two experiments were conceived and conducted. The first employed simulated test images which include pure and mixed pixels of known geometry and radiometry (location and proportions of land cover composition of every pixel, as a complete ground truth). The second experiment was conducted on a highly complex real scene of the Venice lagoon (Italy) where water and wetland merge into one another, at sub-pixel level, in an intricate and complex pattern. Accuracy of the results produced by both classifiers was evaluated and compared using evaluation tools specifically defined and implemented to extend conventional descriptive and analytical statistical estimators to the case of multi-membership in classes. The accuracy measures concerned identification of the dominant component, identification of mixture components, ranking of the mixed components in terms of proportions, and quantification of these proportions. We also compared these results with those produced by the Linear Mixture Model, on which most unmixing techniques are based, to see whether fuzzy and neural classifiers can be considered alternatives to conventional procedures. The results for the two experiments showed that the neural classifier consistently outperforms both fuzzy-statistical classifier and the Linear Mixture Model. © 1999 Canadian Journal of Remote Sensing/Journal canadien de télédétection. | ["Binaghi E.", "Brivio P.A.", "Ghezzi P.", "Rampini A.", "Zilioli E."] | ["7003858698", "7003737933", "35910061100", "7003910184", "7003914636"] | 1,999 | 15 | [] | 10.1080/07038992.1999.10874715 | Article | English | [{"id": "60021199", "name": "Elisabetta Binaghi and Anna Rampini are with the Istituto per le Tecnologie Informatiche Multimediali - ITIM, C.N.R., Milan, 20131, Via Ampère 56, Italy", "fullName": "Elisabetta Binaghi and Anna Rampini are with the Istituto per le Tecnologie Informatiche Multimediali - ITIM, C.N.R.", "reference": "a", "fullAddress": "Milan, 20131, Via Ampère 56, Italy", "departmentId": null}, {"id": "60021199", "name": "Telerilevamento-IRRS, C.N.R., Milan, 20133, Via Bassini 156, Italy", "fullName": "Telerilevamento-IRRS, C.N.R.", "reference": "b", "fullAddress": "Milan, 20133, Via Bassini 156, Italy", "departmentId": null}] |
965 | 54,765 | Low-loss CPW lines on surface stabilized high-resistivity silicon | IEEE Microwave and Guided Wave Letters | This letter proposes a solution to the surface conduction problem in silicon monolithic microwave integrated circuits (MMIC's). An LPCVD polycrystalline silicon layer is deposited over the surface of a high-resistivity silicon wafer which is then covered with a silicon dioxide layer. The polycrystalline silicon layer effectively removes, through traps, any free electrons or holes that may have been induced at the oxide-silicon interface. The CPW lines with 1.25-μm aluminum metallization on passivated HRS substrates have an attenuation loss at 30 GHz of only 1.08 dB/cm. | ["Gamble H.S.", "Armstrong B.M.", "Mitchell S.J.N.", "Wu Y.", "Fusco V.F.", "Stewart J.A.C."] | ["7102789209", "35415904900", "7402392056", "7406896873", "7102894931", "7404791012"] | 1,999 | 138 | ["Coplanar waveguide (CPW)", "High-resistivity silicon (HRS)", "Silicon MMIC's"] | 10.1109/75.798027 | Article | English | [] |
966 | 54,801 | New approach to find exact solutions for cosmological models with a scalar field | Physical Review D | We study the cosmological models whose ordinary differential equations can be given a Lagrangian description on a two-dimensional "configuration space." By requiring the existence of a Nöther symmetry for such a Lagrangian, we are able to show that the potential must have an expotential form. With the help of the constants of motion we can get from that Lagrangian, we integrate the models and analyze the behavior for all the possible varying free parameters and plot some of the solutions. We also compare our results with others available in the literature. © 1990 The American Physical Society. | ["De Ritis R.", "Marmo G.", "Platania G.", "Rubano C.", "Scudellaro P.", "Stornaiolo C."] | ["56277200900", "7006706822", "22968602400", "6701430496", "6602561625", "6701673910"] | 1,990 | 132 | [] | 10.1103/PhysRevD.42.1091 | Article | English | [{"id": "60113231", "name": "Dipartimento di Scienze Fisiche, Università di Napoli, Istituto Nazionale di Fisica Nucleare, Sezione di Napoli, 80125 Napoli, Mostra d'Oltremare Pad. 19, Italy", "fullName": "Dipartimento di Scienze Fisiche, Università di Napoli, Istituto Nazionale di Fisica Nucleare, Sezione di Napoli", "reference": "a", "fullAddress": "80125 Napoli, Mostra d'Oltremare Pad. 19, Italy", "departmentId": null}] |
967 | 54,964 | Quantum dynamics beyond the Gaussian approximation | Physical Review D - Particles, Fields, Gravitation and Cosmology | The time-dependent quantum variational principle is emerging as an important means of studying quantum dynamics, particularly in early universe scenarios. To date all investigations have worked within a Gaussian framework. Here we present an improved method which is demonstrated to be superior to the Gaussian approach. © 1996 The American Physical Society. | ["Cheetham G.J.", "Copeland E.J."] | ["6602704712", "7102237422"] | 1,996 | 14 | [] | 10.1103/PhysRevD.53.R4125 | Article | English | [{"id": "60004572", "name": "Department of Theoretical Physics, University College of Swansea, Swansea, SA2 8PP, Singleton Park, United Kingdom", "fullName": "Department of Theoretical Physics, University College of Swansea", "reference": "a", "fullAddress": "Swansea, SA2 8PP, Singleton Park, United Kingdom", "departmentId": "103271649"}, {"id": "60017317", "name": "School of Mathematical and Physical Sciences, University of Sussex, Brighton, BN1 9QH, United Kingdom", "fullName": "School of Mathematical and Physical Sciences, University of Sussex", "reference": "b", "fullAddress": "Brighton, BN1 9QH, United Kingdom", "departmentId": "103898186"}] |
968 | 54,967 | Isomers of Si<sub>2</sub>C<sub>2</sub>: an MBPT study | Journal of Molecular Structure: THEOCHEM | The structure of the low-lying electronic states of the unknown Si<sub>2</sub>C<sub>2</sub> system is studied using full fourth-order MBPT. It is concluded that the lowest-lying structure is a rhombus, <sup>1</sup>A<sub>g</sub> state, which is ca. 12 kcal mol<sup>-1</sup> lower than the linear <sup>3</sup>Σ<sub>g</sub><sup>-</sup> state. This is similar to the C<sub>4</sub> system. The rhombus structure accommodates reluctance of silicon to form stable multiple bonds. Vibrational frequencies are reported. © 1986. | ["Trucks G.W.", "Bartlett R.J."] | ["6506131886", "7201859075"] | 1,986 | 47 | [] | 10.1016/0166-1280(86)80075-6 | Article | English | [{"id": "60013959", "name": "Quantum Theory Project, Departments of Chemistry and Physics, University of Florida, Gainesville, FL 32611, United States", "fullName": "Quantum Theory Project, Departments of Chemistry and Physics, University of Florida", "reference": "a", "fullAddress": "Gainesville, FL 32611, United States", "departmentId": "105339689"}] |
969 | 54,991 | Development and evaluation of five fuzzy multiattribute decision-making methods | International Journal of Approximate Reasoning | We present the development of five fuzzy multiattribute decision-making methods. These methods are based on the analytic hierarchy process (original and ideal mode), the weighted-sum model, the weighted-product model, and the TOPSIS method. Moreover, these methods are examined in terms of two evaluative criteria. Computational results on test problems suggest that although all the methods are inaccurate, some of them seem to be more accurate than the others. The proposed evaluation methodology can easily be used in evaluating more fuzzy multiattribute decision making methods. | ["Triantaphyllou E.", "Chi-Tun L."] | ["7004205501", "11043197600"] | 1,996 | 302 | ["Analytic hierarchy process", "Fuzzy decision-making", "Multiattribute decision-making", "Pairwise comparisons", "Ranking of fuzzy numbers", "TOPSIS method", "Weighted-product model", "Weighted-sum model"] | 10.1016/0888-613X(95)00119-2 | Article | English | [{"id": "60007566", "name": "Department of Industrial Engineering, Louisiana State University, Baton Rouge, LA, United States", "fullName": "Department of Industrial Engineering, Louisiana State University", "reference": "a", "fullAddress": "Baton Rouge, LA, United States", "departmentId": "113501025"}, {"id": "60007566", "name": "Department of Industrial Engineering, 3128 CEBA Building, Louisiana State University, Baton Rouge, LA 70803-6409, United States", "fullName": "Department of Industrial Engineering, 3128 CEBA Building, Louisiana State University", "reference": "b", "fullAddress": "Baton Rouge, LA 70803-6409, United States", "departmentId": "113501025"}] |
970 | 55,010 | Antipercolation on Bethe and triangular lattices | Journal of Physics A: General Physics | The antipercolation problem is solved on the Bethe lattice. The critical exponents are identical to the percolation exponents when the coordination number z is greater than a critical value z<sub>c</sub>=3, for which the problem has new exponents satisfying extended universality and below which there is no transition. For alternate lattices the problem may be transformed into a percolation problem with different occupation probabilities on the two sublattices. This allows a connection with an s-state Potts model with different z-spin interactions on the two sublattices. In two dimensions there is no transition on the alternate square and honeycomb lattices whereas a transition exists on the triangular lattice. Using the phenomenological renormalisation group method, the critical concentration is found to be p<sub>c</sub> <sup>(a)</sup>=0.21 whereas the correlation length exponent nu <sub>a</sub> seems to converge towards the accepted percolation value nu <sub>p</sub>=1.333. | ["Sevsek F.", "Debierre J.-M.", "Turban L."] | ["22998359100", "6604020058", "56261525100"] | 1,983 | 18 | [] | 10.1088/0305-4470/16/4/017 | Article | English | [{"id": "60104289", "name": "Lab. de Phys. du Solide, Univ. de Nancy i, Vandoeuvre les Nancy, France", "fullName": "Lab. de Phys. du Solide, Univ. de Nancy i", "reference": "a", "fullAddress": "Vandoeuvre les Nancy, France", "departmentId": "120508301"}] |
971 | 55,101 | Grammatical complexity of strange sets | Physical Review A | Chaotic dynamical systems can be organized around an underlying strange set, which is comprised of all the unstable periodic orbits. In this paper, we quantify the complexity of such an organization; this complexity addresses the difficulty of predicting the structure of the strange set from low-order data and is independent of the entropy and the algorithmic complexity. We refer to the new measure as the grammatical complexity. The notion is introduced, discussed, and illustrated in the context of simple dynamical systems. In addition, the grammatical complexity is generalized to include metric properties arising due to the nonuniform distribution of the invariant measure on the strange set. © 1990 The American Physical Society. | ["Auerbach D.", "Procaccia I."] | ["7005286685", "7006149018"] | 1,990 | 29 | [] | 10.1103/PhysRevA.41.6602 | Article | English | [{"id": "60017563", "name": "Department of Chemical Physics, Weizmann Institute of Science, Rehovot 76100, Israel", "fullName": "Department of Chemical Physics, Weizmann Institute of Science", "reference": "a", "fullAddress": "Rehovot 76100, Israel", "departmentId": "100286014"}] |
972 | 55,155 | An approximate inertial manifold for computing Burgers' equation | Physica D: Nonlinear Phenomena | We present a numerical scheme for the approximation of nonlinear evolution equations over large time intervals. Our algorithm is motivated from the dynamical systems point of view. In particular, we adapt the methodology of approximate inertial manifolds to a finite difference scheme. This leads to a differential treatment in which the higher (i.e. unresolved) modes are expressed in terms of the lower modes. As a particular example we derive an approximate inertial manifold for Burgers' equation and develop a numerical algorithm suitable for computing. We perform a parameter study in which we compare the accuracy of a standard scheme with our modified scheme. For all values of the parameters (which are the coefficient of viscosity and the cell size), we obtain a decrease in the numerical error by at least a factor of 2.0 with the modified scheme. The decrease in error is substantially greater over large regions of the parameters space. © 1992. | ["Margolin L.G.", "Jones D.A."] | ["7005215578", "7407678869"] | 1,992 | 17 | [] | 10.1016/0167-2789(92)90234-E | Article | English | [{"id": "60006164", "name": "Los Alamos National Laboratory, Los Alamos, NM 87545, United States", "fullName": "Los Alamos National Laboratory", "reference": "a", "fullAddress": "Los Alamos, NM 87545, United States", "departmentId": null}, {"id": "60007278", "name": "University of California, Irvine, CA 92717, United States", "fullName": "University of California", "reference": "b", "fullAddress": "Irvine, CA 92717, United States", "departmentId": null}] |
973 | 55,315 | Recovering strange attractors from noisy interspike intervals of neuronal firings | Physics Letters, Section A: General, Atomic and Solid State Physics | Both deterministic chaos and stochastic noise may play important roles in information transmission for neurons; however, their effects will be mixed and make it difficult to analyze such as using chaotic time series methods. In this letter, we show for the first time that fine structures of strange attractors can be recovered from noisy interspike interval (ISI) time series of both a theoretical model and real neurons by using the nonlinear filtering method. Thus improved analyzing results can be expected based on such a simple nonlinear filter. Different properties of noise in numerical and experimental ISI data are also compared. © 1999 Elsevier Science B.V. All rights reserved. | ["Gong Y.F.", "Ren W.", "Shi J.X.", "Xu", "Hu S.J."] | ["7402475066", "57202656033", "56247192700", "36889773900", "56022117000"] | 1,999 | 10 | ["Chaos", "Interspike intervals", "Neuron", "Nonlinear noise reduction"] | 10.1016/S0375-9601(99)00330-8 | Article | English | [{"id": "60025084", "name": "Natl. Key Lab. Vibr., Shock Noise, Shanghai Jiao Tong University, Shanghai 200030, China", "fullName": "Natl. Key Lab. Vibr., Shock Noise, Shanghai Jiao Tong University", "reference": "a", "fullAddress": "Shanghai 200030, China", "departmentId": "104268077"}, {"id": "60069747", "name": "Inst. of Space Medico-engineering, Branch 15, Beijing 100094, PO Box 5104, China", "fullName": "Inst. of Space Medico-engineering, Branch 15", "reference": "b", "fullAddress": "Beijing 100094, PO Box 5104, China", "departmentId": "104837487"}, {"id": "60018308", "name": "Department of Engineering Mechanics, Xi'an Jiaotong University, Xi'an 710049, China", "fullName": "Department of Engineering Mechanics, Xi'an Jiaotong University", "reference": "c", "fullAddress": "Xi'an 710049, China", "departmentId": "105467083"}, {"id": "60088187", "name": "Department of Physiology, Fourth Military Medical University, Xi'an 710032, China", "fullName": "Department of Physiology, Fourth Military Medical University", "reference": "d", "fullAddress": "Xi'an 710032, China", "departmentId": "113220392"}] |
974 | 55,318 | A maximum neural network approach for N-queens problems | Biological Cybernetics | A novel neural network approach using the maximum neuron model is presented for N-queens problems. The goal of the N-queens problem is to find a set of locations of N queens on an N × N chessboard such that no pair of queens commands each other. The maximum rjeuron model proposed by Takefuji et al. has been applied to two optimization problems where the optimization of objective functions is requested without constraints. This paper demonstrates the effectiveness of the maximum neuron model for constraint satisfaction problems through the N-queens problem. The performance is verified through simulations in up to 500-queens problems on the sequential mode, the N-parallel mode, and the N<sup>2</sup>-parallel mode, where our maximum neural network shows the far better performance than the existing neural networks. | ["Funabiki N.", "Takenaka Y.", "Nishikawa S."] | ["7007083308", "7102054125", "7202983524"] | 1,997 | 14 | [] | 10.1007/s004220050337 | Article | English | [{"id": "60024322", "name": "Department of Information, Faculty of Engineering Science, Osaka University, Toyonaka, Osaka 560, Japan", "fullName": "Department of Information, Faculty of Engineering Science, Osaka University", "reference": "a", "fullAddress": "Toyonaka, Osaka 560, Japan", "departmentId": "104225937"}] |
975 | 55,415 | On a characterization of the folding of proteins | International Journal of Quantum Chemistry | We consider a characterization of the folding of 3-D model proteins. Using as the input the geometry of molecules, we first construct a distance/distance matrix in which element i, j is given by the quotient of the Euclidean and the graph theoretical distance between the two vertices. The leading eigenvalue of the D/D matrix gives a measure of the folding of the protein structure. Using higher powers of the elements of D/D matrices, we generate the corresponding leading eigenvalue λ(k) for different exponents (k = 1,2,3,...). So, derived invariants represent a characterization of the folding of a structure - here, model proteins. The derived invariants are analogous to the characterization of proteins based on the average distance, referred to as a protein profile. The folding index φ = λ/n, that is, the leading eigenvalue, is normalized to the number of "points" representing the structure. Structures that are more folded have a smaller folding index. We illustrate the use of the folding indices to measure the degree of similarity of molecules. © 1999 John Wiley & Sons, Inc. | ["Randić M.", "Krilov G."] | ["7102665470", "6603508119"] | 1,999 | 53 | [] | 10.1002/(SICI)1097-461X(1999)75:6<1017::AID-QUA6>3.0.CO;2-C | Article | English | [{"id": "60018160", "name": "Department of Mathematics, Drake University, Des Moines, IA 50311, United States", "fullName": "Department of Mathematics, Drake University", "reference": "a", "fullAddress": "Des Moines, IA 50311, United States", "departmentId": "105444708"}, {"id": "60018160", "name": "Department of Chemistry, Drake University, Des Moines, IA 50311, United States", "fullName": "Department of Chemistry, Drake University", "reference": "b", "fullAddress": "Des Moines, IA 50311, United States", "departmentId": "103930514"}, {"id": "60030162", "name": "Department of Chemistry, Columbia University, New York, NY 10027, United States", "fullName": "Department of Chemistry, Columbia University", "reference": "c", "fullAddress": "New York, NY 10027, United States", "departmentId": "113511789"}] |
976 | 55,435 | A construction of stable subharmonic orbits in monotone time-periodic dynamical systems | Monatshefte für Mathematik | We consider a family of abstract semilinear elliptic-like equations B(t,u<sub>o</sub>(t))=0 for an unknown function u<sub>0</sub>(t) parametrized by the time-variable t≥0 and valued in a Banach space X. Suppose that both B(.,u) and u<sub>0</sub> are T-periodic in time t, and each Fréchet derivative {Mathematical expression} generates an exponentially decaying, analytic C<sub>0</sub>-semigroup in X. We show that, for every small ε>0, the abstract parabolic-like evolution equation εdu<sub>ε</sub>/dt=B(t,u<sub>ε(t)</sub>), t≥0, has a linearly stable T-periodic solution u<sub>ε</sub> near u<sub>0</sub>. Given any integer n≥2, we construct examples of B and u<sub>0</sub> such that the minimum periods of B(.,u) and u<sub>0</sub>, respectively, are τ=T/n and T. Then u<sub>ε</sub>(t), t≥0, is a linearly stable subharmonic orbit of minimum period T for our τ-periodic evolution equation. The corresponding dynamical systems are strongly monotone. © 1993 Springer-Verlag. | ["Takáč P."] | ["7004605267"] | 1,993 | 11 | ["1991 Mathematics Subject Classification: 35B40, 47H07, 32B25, 35K55"] | 10.1007/BF01300671 | Article | English | [{"id": "60003915", "name": "Mathematics Department, Vanderbilt University, Nashville, 37240, TN, United States", "fullName": "Mathematics Department, Vanderbilt University", "reference": "a", "fullAddress": "Nashville, 37240, TN, United States", "departmentId": "103246725"}] |
977 | 55,451 | Convergence Properties of Projection and Contraction Methods for Variational Inequality Problems | Applied Mathematics and Optimization | In this paper we develop the convergence theory of a general class of projection and contraction algorithms (PC method), where an extended stepsize rule is used, for solving variational inequality (VI) problems. It is shown that, by defining a scaled projection residue, the PC method forces the sequence of the residues to zero. It is also shown that, by defining a projected function, the PC method forces the sequence of projected functions to zero. A consequence of this result is that if the PC method converges to a nondegenerate solution of the VI problem, then after a finite number of iterations, the optimal face is identified. Finally, we study local convergence behavior of the extragradient algorithm for solving the KKT system of the inequality constrained VI problem. | ["Xiu N.", "Wang C.", "Zhang J."] | ["55908888100", "55684020000", "7601347884"] | 2,001 | 30 | ["Convergence property", "Predictor-corrector stepsize", "Projection and contraction method", "Variational inequality"] | 10.1007/s002450010023 | Article | English | [{"id": "60022381", "name": "Department of Applied Mathematics, Northern Jiaotong University, Beijing 100044, China", "fullName": "Department of Applied Mathematics, Northern Jiaotong University", "reference": "a", "fullAddress": "Beijing 100044, China", "departmentId": "104143038"}, {"id": "60026320", "name": "Institute of Operations Research, Qufu Normal University, Qufu 273165, China", "fullName": "Institute of Operations Research, Qufu Normal University", "reference": "b", "fullAddress": "Qufu 273165, China", "departmentId": "104336886"}, {"id": "60013983", "name": "Department of Mathematics, City University of Hong Kong, Kowloon, Hong Kong", "fullName": "Department of Mathematics, City University of Hong Kong", "reference": "c", "fullAddress": "Kowloon, Hong Kong", "departmentId": "103724817"}] |
978 | 55,478 | Matroid matching and some applications | Journal of Combinatorial Theory, Series B | The polymatroid matching problem, also known as the matchoid problem or the matroid parity problem, is polynomially unsolvable in general but solvable for linear matroids. The solution for linear matroids is analysed and results concerning arbitrary matroids are given from which the linear case follows immediately. The same general result is then applied to find a maximum circuitfree partial hypergraph of a 3-uniform hypergraph, to generalize a theorem of Mader on packing openly disjoint paths starting and ending in a given set, and to study a problem in structural rigidity. © 1980. | ["Lovász L."] | ["7004194778"] | 1,980 | 104 | [] | 10.1016/0095-8956(80)90066-0 | Article | English | [{"id": "60027332", "name": "Bolyai Institute, University of Szeged, Szeged, Hungary", "fullName": "Bolyai Institute, University of Szeged", "reference": "a", "fullAddress": "Szeged, Hungary", "departmentId": null}, {"id": "60014171", "name": "Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont., Canada", "fullName": "Department of Combinatorics and Optimization, University of Waterloo", "reference": "b", "fullAddress": "Waterloo, Ont., Canada", "departmentId": "103733133"}] |
979 | 55,491 | Combinators for program generation | Journal of Functional Programming | We present a general method to transform a compositional specification of a specializer for a functional programming language into a set of combinators that can be used to perform the same specialization more efficiently. The main transformation steps are the transition to higher-order abstract syntax and untagging. All transformation steps are proved correct. The resulting combinators can be implemented in any functional language, typed or untyped, pure or impure. They may also be considered as forming a domain-specific language for meta-programming. We demonstrate the generality of the method by applying it to several specializers of increasing strength. We demonstrate its efficiency by comparing it with a traditional specialization system based on self-application. | ["Thiemann P."] | ["7004615896"] | 1,999 | 27 | [] | 10.1017/S0956796899003469 | Article | English | [{"id": "60025641", "name": "Institut für Informatik, Universität Freiburg, Universitatsgelande Flugplatz, D-79110 Freiburg, Germany", "fullName": "Institut für Informatik, Universität Freiburg, Universitatsgelande Flugplatz", "reference": "a", "fullAddress": "D-79110 Freiburg, Germany", "departmentId": null}] |
980 | 55,506 | A complete, flexible fuzzy-based approach to the classification problem | International Journal of Approximate Reasoning | We present an algebraic structure as a complete methodology of classification. Utilizing this structure, we apply an algebraic approximation to the problem of generating appropriate clusters of objects characterized by fuzzy attributes. More precisely, the values of the attributes are expressed in terms of linguistic labels, and thus are handled as fuzzy numbers. This opens new possibilities in all those fields for which the need to describe the population under analysis by means of more natural terms becomes crucial. In fact, in these cases, the application of resolution strategies based on the adoption of "standard" methods, such as a distance matrix, appears as a brutal effort to adapt quantitative methods to qualitative problems. © 1995. | ["Gisolfi A.", "Loia V."] | ["6701680097", "35570326700"] | 1,995 | 12 | ["algebraic structure", "fuzzy classification", "linguistic approximation", "relevance"] | 10.1016/0888-613X(95)00038-I | Article | English | [{"id": "60007061", "name": "Dipartimento di Informatica ed Applicazioni, Università di Salerno, I-84081 Baronissi, SA, Italy", "fullName": "Dipartimento di Informatica ed Applicazioni, Università di Salerno", "reference": "a", "fullAddress": "I-84081 Baronissi, SA, Italy", "departmentId": "103394794"}] |
981 | 55,511 | Coordination in operations: A taxonomy | Journal of Operations Management | This paper proposes a taxonomy of coordination study in operations. Its point of departure is the assumption that coordination study in operations always involves a "system" which can be a mathematical model, a software system, a business process or a game. A system is the unit of analysis in the taxonomy. In the taxonomy, systems are first divided into three categories depending on the type of coordination - coordination within operations, cross-functional coordination and inter-organizational coordination. Systems are further divided depending on how people in the organization behave, i.e., the perspective of organization. We propose three alternative perspectives of organization - single-person perspective, team perspective, and nexus-of-contract perspective of organization. Through a series of examples, we describe nine subcategories of systems. © 1995. | ["Whang S."] | ["7006161812"] | 1,995 | 89 | [] | 10.1016/0272-6963(95)00010-P | Article | English | [{"id": "60012708", "name": "Graduate School of Business, Stanford University, Stanford, CA 94305-5015, United States", "fullName": "Graduate School of Business, Stanford University", "reference": "a", "fullAddress": "Stanford, CA 94305-5015, United States", "departmentId": null}] |
982 | 55,512 | Some Broad-Band Transformers | Proceedings of the IRE | Several transmission line transformers are described which have bandwidth ratios as high as 20,000:1 in the frequency range of a few tens of kilocycles to over a thousand megacycles. Experimental data are presented on both transformers and hybrid circuits. Typical applications are: interstage transformers for broad-band amplifiers; baluns for driving balanced antennas and broad-band oscilloscopes; and hybrids for use in pulse refiectometers, balanced modulators, etc. These transformers can be made quite small. Excellent transformers have been made using ferrite toroids having an outside diameter of 0.080 inch. © 1959, IEEE. All rights reserved. | ["Ruthroff C.L."] | ["6506541429"] | 1,959 | 188 | [] | 10.1109/JRPROC.1959.287200 | Article | English | [{"id": "60021378", "name": "Bell Telephone Labs. Inc., Holmdel, N. J., United States", "fullName": "Bell Telephone Labs. Inc.", "reference": "a", "fullAddress": "Holmdel, N. J., United States", "departmentId": null}] |
983 | 55,532 | Solving Index Form Equations in Fields of Degree 9 with Cubic Subfields | Journal of Symbolic Computation | We describe an efficient algorithm for solving index form equations in number fields of degree 9 which are composites of cubic fields with coprime discriminants. We develop the algorithm in detail for the case of complex cubic fields, but the main steps of the procedure are also applicable for other cases. Our most important tool is the main theorem of a recent paper of Gaál (1998a). In view of this result the index form equation in the ninth degree field implies relative index form equations over the subfields. In our case these equations are cubic relative Thue equations over cubic fields. The main purpose of the paper is to show that this approach is much more efficient than the direct method, which consists of reducing the index form equation to unit equations over the normal closure of the original field. At the end of the paper we describe our computational experience. Many ideas of the paper can be applied to develop fast algorithms for solving index form equations in other types of higher degree fields which are composites of subfields. © 2000 Academic Press. | ["Gaál I."] | ["7004672890"] | 2,000 | 13 | [] | 10.1006/jsco.1999.0356 | Article | English | [{"id": "60004400", "name": "Kossuth Lajos University, Mathematical Institute, H-4010, Debrecen, Pf.12, Hungary", "fullName": "Kossuth Lajos University, Mathematical Institute", "reference": "a", "fullAddress": "H-4010, Debrecen, Pf.12, Hungary", "departmentId": "103266208"}] |
984 | 55,553 | Optimal patch use in a stochastic environment | Theoretical Population Biology | This paper considers an animal foraging on prey which are distributed in well-defined patches. It is assumed that the environment may be stochastic and that the animal can gain information on patch type as it forages. The foraging policy which maximises mean reward rate for the environment is characterised in terms of a function of state called the potential function. This policy is shown to be given by the rule: continue foraging on the present patch while the potential is positive, when the potential falls to zero move on to the next patch. Let r denote the current reward rate on a patch and let γ denote the maximum mean reward rate for the environment. It is shown that r ≤ γ if it is optimal to leave. Conditions which ensure r < γ are also given. For a large class of environments the optimal policy is stated in terms of a revised reward rate r̃, and is given by the rule: continue on the present patch while r ̃ > γ, when r̃ falls to γ move on to the next patch. Finally, it is shown that the stay time on a patch is a decreasing function of γ. © 1982. | ["McNamara J."] | ["56608677900"] | 1,982 | 154 | [] | 10.1016/0040-5809(82)90018-1 | Article | English | [{"id": "60020650", "name": "School of Mathematics, University of Bristol, Bristol, United Kingdom", "fullName": "School of Mathematics, University of Bristol", "reference": "a", "fullAddress": "Bristol, United Kingdom", "departmentId": "104050344"}] |
985 | 55,633 | The Complex Moment Problem and Subnormality: A Polar Decomposition Approach | Journal of Functional Analysis | It has been known that positive definiteness does not guarantee a bisequence to be a complex moment. However, it turns out that positive definite extendibility does (Theorems 1 and 22), and this is the main theme of this paper. The main tool is, generally understood, polar decomposition. To strengthen applicability of our approach we work out a criterion for positive definite extendibility in a fairly wide context (Theorems 9 and 29). All this enables us to prove characterizations of subnormality of unbounded operators having invariant domain (Theorems 37 and 39) and their further applications (Theorems 41 and 43) and a description of the complex moment problem on real algebraic curves (Theorems 52 and 56). The latter question is completed in the Appendix, in which we relate the complex moment problem to the two-dimensional real one, with emphasis on real algebraic sets. © 1998 Academic Press. | ["Stochel J.", "Szafraniec F.H."] | ["6602273956", "6603559934"] | 1,998 | 70 | [] | 10.1006/jfan.1998.3284 | Article | English | [{"id": "60086543", "name": "Instytut Matematyki, Uniwersytet Jagielloński, PL-30059, Kraków, ul. Reymonta 4, Poland", "fullName": "Instytut Matematyki, Uniwersytet Jagielloński", "reference": "a", "fullAddress": "PL-30059, Kraków, ul. Reymonta 4, Poland", "departmentId": "104092318"}] |
986 | 55,677 | Protein A-linked latex antisera test for the detection of Nosema bombycis naegeli spores | Journal of Invertebrate Pathology | null | ["Baig M.", "Datta R.K.", "Nataraju B.", "Samson M.V.", "Sivaprasad V."] | ["7102465868", "7202226377", "6701536838", "7103252730", "6602546922"] | 1,992 | 0 | ["Bombyx mori", "immunoglobulin", "latex agglutination", "Nosema bombycis", "protein A"] | 10.1016/0022-2011(92)90016-W | Article | English | [{"id": "60002114", "name": "Central Sericultural Research and Training Institute Mysore, 570 008, India", "fullName": "Central Sericultural Research and Training Institute Mysore", "reference": "a", "fullAddress": "570 008, India", "departmentId": null}] |
987 | 55,697 | Topological degeneracy of quantum Hall fluids | Physical Review B - Condensed Matter and Materials Physics | We present a simple approach to calculate the degeneracy and the structure of the ground states of non-Abelian quantum Hall (QH) liquids on the torus. Our approach can be applied to any QH liquids (Abelian or non-Abelian) obtained from the parton construction. We explain our approach by studying a series of examples of increasing complexity. When the effective theory of a non-Abelian QH liquid is a non-Abelian Chern-Simons (CS) theory, our approach reproduces the well-known results for the ground-state degeneracy of the CS theory. However, our approach also applies to non-Abelian QH liquids whose effective theories are not known and which cannot be written as a non-Abelian CS theory. We find that the ground states on a torus of all non-Abelian QH liquids obtained from the parton construction can be described by points on a lattice inside a “folded unit cell.” The folding is generated by reflection, rotations, etc. Thus the ground-state structures on the torus described by the “folded unit cells” provide a way to (at least partially) classify non-Abelian QH liquids obtained from the parton construction. © 1998 The American Physical Society. | ["Wen X.", "Zee A."] | ["7201737905", "7004002245"] | 1,998 | 30 | [] | 10.1103/PhysRevB.58.15717 | Article | English | [{"id": "60026071", "name": "Physics Division, National Center for Theoretical Sciences, Hsinchu 300, P.O. Box 2-131, Taiwan", "fullName": "Physics Division, National Center for Theoretical Sciences", "reference": "a", "fullAddress": "Hsinchu 300, P.O. Box 2-131, Taiwan", "departmentId": "104325715"}, {"id": "60029241", "name": "Institute for Theoretical Physics, University of California, Santa Barbara, CA 93106, United States", "fullName": "Institute for Theoretical Physics, University of California", "reference": "b", "fullAddress": "Santa Barbara, CA 93106, United States", "departmentId": null}] |
988 | 55,756 | QM/NN QSPR Models with Error Estimation: Vapor Pressure and LogP | Journal of Chemical Information and Computer Sciences | QSPR models for logP and vapor pressures of organic compounds based on neural net interpretation of descriptors derived from quantum mechanical (semiempirical MO; AM1) calculations are presented. The models are cross-validated by dividing the compound set into several equal portions and training several individual multilayer feedforward neural nets (trained by the back-propagation of errors algorithm), each with a different portion as test set. The results of these nets are combined to give a mean predicted property value and a standard deviation. The performance of two models, for logP and the vapor pressure at room temperature, is analyzed, and the reliability of the predictions is tested. | ["Beck B.", "Breindl A.", "Clark T."] | ["7201775251", "37103662500", "35271032500"] | 2,000 | 66 | [] | 10.1021/ci990131n | Article | English | [{"id": "60000765", "name": "Computer-Chemie-Centrum, Friedrich-Alexander-Universität Erlangen-Nürnberg, D-91052 Erlangen, Nägelsbachstrasse 25, Germany", "fullName": "Computer-Chemie-Centrum, Friedrich-Alexander-Universität Erlangen-Nürnberg", "reference": "a", "fullAddress": "D-91052 Erlangen, Nägelsbachstrasse 25, Germany", "departmentId": "103077406"}] |
989 | 55,783 | Metric spaces on which continuous functions are uniformly continuous and hausdorff distance | Proceedings of the American Mathematical Society | Atsuji has internally characterized those metric spaces X for which each real-valued continuous function on X is uniformly continuous as follows: (1) the set X<sup>′</sup> of limit points of X is compact, and (2) for each ∈>0, the set of points in X whose distance from X<sup>′</sup> exceeds e is uniformly discrete. We obtain these new characterizations: (a) for each metric space V, the Hausdorff metric on C(X, Y), induced by a metric on X × Y compatible with the product uniformity, yields the topology of uniform convergence; (b) there exists a metric space Y containing an arc for which the Hausdorff metric on C(X, Y) yields the topology of uniform convergence; (c) the Hausdorff metric topology on CL(X) is at least as strong as the Vietoris topology. We also characterize those metric spaces whose hyperspace is such a space. © 1985 American Mathematical Society. | ["Beer G."] | ["7101926680"] | 1,985 | 45 | ["Function space", "Hausdorff metric", "Hyperspace", "Topology of uniform convergence", "UC space", "Uniformly continuous function", "Vietoris topology"] | 10.1090/S0002-9939-1985-0810180-3 | Article | English | [{"id": "60030759", "name": "Department of Mathematics, California State University, Los Angeles, CA, 90032, United States", "fullName": "Department of Mathematics, California State University", "reference": "a", "fullAddress": "Los Angeles, CA, 90032, United States", "departmentId": "104557640"}] |
990 | 55,838 | Existence theorem for gauge symmetries in Hamiltonian constrained systems | Classical and Quantum Gravity | It is shown that, for any constrained Hamiltonian system, one can locally construct a complete set of independent gauge transformations that depend only on the canonical coordinates and on arbitrary functions of time. The number of elements in this complete set is equal to the number of primary first-class constraints. | ["Gomis J.", "Henneaux M.", "Pons J.M."] | ["7005828825", "7005854412", "7202123106"] | 1,990 | 30 | [] | 10.1088/0264-9381/7/6/015 | Article | English | [{"id": "60001576", "name": "Departament D'Estructura i Constituents de la Matéria, Universitat de Barcelona, E-08028 Barcelona, Diagonal 647, Spain", "fullName": "Departament D'Estructura i Constituents de la Matéria, Universitat de Barcelona", "reference": "a", "fullAddress": "E-08028 Barcelona, Diagonal 647, Spain", "departmentId": "103129719"}, {"id": "60000145", "name": "Faculté des Sciences, Université Libre de Bruxelles, Campus Plaine CP 231, Bruxelles, Belgium", "fullName": "Faculté des Sciences, Université Libre de Bruxelles, Campus Plaine CP 231", "reference": "b", "fullAddress": "Bruxelles, Belgium", "departmentId": "103043009"}] |
991 | 55,856 | Calculation of quadratic molecular potential constants by the method of damped least squares | Journal of Molecular Spectroscopy | The Levenberg method of damped least squares has been applied to refinement calculations of molecular potential constants from experimental data. This method removes the mathematical difficulties of ill-conditioned problems. © 1965. | ["Papoušek D.", "Toman S.", "Plíva J."] | ["6603642635", "24612956300", "6602265654"] | 1,965 | 47 | [] | 10.1016/0022-2852(65)90008-1 | Article | English | [{"id": "60031135", "name": "Institute of Physical Chemistry, Czechoslovak Academy of Science, Prague, Czech Republic", "fullName": "Institute of Physical Chemistry, Czechoslovak Academy of Science", "reference": "a", "fullAddress": "Prague, Czech Republic", "departmentId": null}] |
992 | 55,864 | Size effects on adsorption energies of complex atoms and diatomic molecules on metal surfaces from small-cluster calculations | Journal of Physics: Condensed Matter | The authors present a new method for calculating binding energies of atoms and diatomic molecules chemisorbed on transition metal surfaces from cluster models. Their method relies on the separation between electronic and ionic contributions, by partitioning the desorption process into three steps. This allows us to remove the size effects due to the electronic relaxation by introducing the work function of the bare metal instead of the ionization potential of the cluster. | ["Russier V.", "Mijoule C."] | ["6602718191", "6603475722"] | 1,991 | 19 | [] | 10.1088/0953-8984/3/18/013 | Article | English | [{"id": "60001422", "name": "Lab. de Dynamique des Interactions Moleculaires, Univ. Pierre et Marie Curie, Paris, France", "fullName": "Lab. de Dynamique des Interactions Moleculaires, Univ. Pierre et Marie Curie", "reference": "a", "fullAddress": "Paris, France", "departmentId": "103115141"}] |
993 | 55,932 | Recursive adaptive control of Markov decision processes with the average reward criterion | Applied Mathematics & Optimization | We are concerned with Markov decision processes with Borel state and action spaces; the transition law and the reward function depend on an unknown parameter. In this framework, we study the recursive adaptive nonstationary value iteration policy, which is proved to be optimal under the same conditions usually imposed to obtain the optimality of other well-known nonrecursive adaptive policies. The results are illustrated by showing the existence of optimal adaptive policies for a class of additive-noise systems with unknown noise distribution. © 1991 Springer-Verlag New York Inc. | ["Cavazos-Cadena R.", "Hernández-Lerma O."] | ["55995886800", "57204490428"] | 1,991 | 3 | [] | 10.1007/BF01442397 | Article | English | [{"id": "60001162", "name": "Departamento de Estadística y Cálculo, Universidad Autónoma Agraria Antonio Narro, Buenavista, Saltillo, 25315, COAH, Mexico", "fullName": "Departamento de Estadística y Cálculo, Universidad Autónoma Agraria Antonio Narro", "reference": "a", "fullAddress": "Buenavista, Saltillo, 25315, COAH, Mexico", "departmentId": "103104566"}, {"id": "60017323", "name": "Departamento de Matemáticas, CINVESTAV-IPN, 07000, D.F., Apartado Postal 14-740, Mexico", "fullName": "Departamento de Matemáticas, CINVESTAV-IPN", "reference": "b", "fullAddress": "07000, D.F., Apartado Postal 14-740, Mexico", "departmentId": "100291970"}] |
994 | 55,941 | Convex conservation laws with discontinuous coefficients. existence, uniqueness and asymptotic behavior | Communications in Partial Differential Equations | Existence and uniqueness is proved, in the class of functions satisfying a wave entropy condition, of weak solutions to a conservation law with a flux function that may depend discontinuously on the space variable. The large time limit is then studied, and explicit formulas for this limit is given in the case where the initial data as well as the x dependency of the flux vary periodically. Throughout the paper, front tracking is used as a method of analysis. A numerical example which illustrates the results and method of proof is also presented. © 1995, Taylor & Francis Group, LLC. All rights reserved. | ["Klingenberg C.", "Risebro N.H."] | ["7004588452", "6701632761"] | 1,995 | 95 | [] | 10.1080/03605309508821159 | Article | English | [{"id": "60016908", "name": "Universitat Heidelberg, D-69120 Heidelberg, Im Neuenheimer Feld 294., Germany", "fullName": "Universitat Heidelberg", "reference": "a", "fullAddress": "D-69120 Heidelberg, Im Neuenheimer Feld 294., Germany", "departmentId": null}, {"id": "60010348", "name": "University of Oslo, N-0316, Oslo, P.O. Box 1053, Norway", "fullName": "University of Oslo", "reference": "b", "fullAddress": "N-0316, Oslo, P.O. Box 1053, Norway", "departmentId": null}] |
995 | 56,039 | Backpropagation neural networks for fuzzy logic | Information Sciences | Expert systems play a crucial role in the application of artificial intelligence to real problems. There are numerous methods of dealing with uncertainty in expert systems. Fuzzy logic is one such approach, in which the uncertainty is represented by possibility distributions for the antecedents and consequent of a rule. An uncertain input can be propagated to the consequent by a variety of mechanisms. This generality results in a higher computational burden for the system. More importantly, a means of controlling the response of the system to variations in input conditions is needed. In this paper, feedforward neural networks are proposed as a means of controlling this generality as well as providing the parallel computation necessary for fuzzy logic. It is demonstrated that these networks can learn and extrapolate complex relationships between antecedents and consequents for rules containing single and conjunctive antecedent clauses. Also, multiple compatible rules can be stored in a single network structure, increasing the efficiency of rule storage, and providing a natural mechanism for conflict resolution. © 1992. | ["Keller J.M.", "Tahani H."] | ["7403486724", "6602678343"] | 1,992 | 38 | [] | 10.1016/0020-0255(92)90016-2 | Article | English | [{"id": "60006173", "name": "Electrical and Computer Engineering Department, University of Missouri - Columbia, Columbia, MO 65211, United States", "fullName": "Electrical and Computer Engineering Department, University of Missouri - Columbia", "reference": "a", "fullAddress": "Columbia, MO 65211, United States", "departmentId": "103349707"}] |
996 | 56,051 | Toward a Theory of Computer Support for Collaborative Learning | Journal of the Learning Sciences | null | ["Koschmann T.D."] | ["6603960683"] | 1,994 | 73 | [] | 10.1207/s15327809jls0303_1 | Article | English | [{"id": "60024334", "name": "Southern Illinois University, United States", "fullName": "Southern Illinois University", "reference": "a", "fullAddress": "United States", "departmentId": null}] |
997 | 56,079 | Robot arm reaching through neural inversions and reinforcement learning | Robotics and Autonomous Systems | We present a neural method that computes the inverse kinematics of any kind of robot manipulators, both redundant and non-redundant. Inverse kinematics solutions are obtained through the inversion of a neural network that has been previously trained to approximate the manipulator forward kinematics. The inversion provides difference vectors in the joint space from difference vectors in the workspace. Our differential inverse kinematics (DIV) approach can be viewed as a neural network implementation of the Jacobian transpose method for arm kinematic control that does not require previous knowledge of the arm forward kinematics. Redundancy can be exploited to obtain a special inverse kinematic solution that meets a particular constraint (e.g. joint limit avoidance) by inverting an additional neural network The usefulness of our DIV approach is further illustrated with sensor-based multilink manipulators that learn collision-free reaching motions in unknown environments. For this task, the neural controller has two modules: a reinforcement-based action generator (AG) and a DIV module that computes goal vectors in the joint space. The actions given by the AG are interpreted with regard to those goal vectors. © 2000 Published by Elsevier Science B.V. All rights reserved. | ["Martín P.", "Millán J.D.R."] | ["7406037698", "57216343965"] | 2,000 | 14 | ["Differential inverse kinematics", "Neural networks", "Reaching motions", "Redundant manipulators", "Reinforcement learning"] | 10.1016/S0921-8890(99)00100-1 | Article | English | [{"id": "60002676", "name": "Department of Computer Science, Universitat Jaume I, 12071 Castellón, Spain", "fullName": "Department of Computer Science, Universitat Jaume I", "reference": "a", "fullAddress": "12071 Castellón, Spain", "departmentId": "113608452"}, {"id": "60103695", "name": "Joint Research Centre, European Commission, 21020 Ispra (VA), Italy", "fullName": "Joint Research Centre, European Commission", "reference": "b", "fullAddress": "21020 Ispra (VA), Italy", "departmentId": "122100767"}] |
998 | 56,121 | Electric polarizability of the nucleon in the Nambu-Jona-Lasinio model | Nuclear Physics, Section A | The electric polarizability of the nucleon is calculated in the soliton approach to the Nambu-Jona-Lasino model. We analyze the leading-N<sub>c</sub> contributions, as well as the effects of rotational 1/N<sub>c</sub> corrections and Δ-N mass splitting. Our model prediction is reduced compared to other soliton calculations, and is closer to the experimental value. © 1994. | ["Nikolov E.N.", "Broniowski W.", "Goeke K."] | ["6603763534", "7004241846", "8422456900"] | 1,994 | 5 | [] | 10.1016/0375-9474(94)90915-6 | Article | English | [{"id": "60005322", "name": "Institut für Theoretische Physik II, Ruhr-Universität Bochum, D-44780 Bochum, Germany", "fullName": "Institut für Theoretische Physik II, Ruhr-Universität Bochum", "reference": "a", "fullAddress": "D-44780 Bochum, Germany", "departmentId": "105368169"}, {"id": "60030807", "name": "Institut für Theoretische Physik II, Universität Regensburg, D-93040 Regensburg, Germany", "fullName": "Institut für Theoretische Physik II, Universität Regensburg", "reference": "b", "fullAddress": "D-93040 Regensburg, Germany", "departmentId": "104560130"}] |
999 | 56,122 | Distribution of electromagnetic force in permanent magnets | IEEE Transactions on Magnetics | Two dual formulations are proposed for the calculation of the electromagnetic forces in permanent magnets. The formulations are based on the virtual work principle with the use of nodal elements. Both methods allow the calculation of global force as well as local force densities. These densities depend on the expression of the magnetic energy or co-energy of the magnet. The energies of a permanent magnet are discussed on physical basis. ©1998 IEEE. | ["De Medeiros L.H.", "Reyne G.", "Meunier G.", "Yonnet J.P."] | ["6602569661", "7003687773", "55534323100", "7004005506"] | 1,998 | 19 | ["Local force densities", "Magnetic energy", "Permanent magnet", "Virtual work"] | 10.1109/20.717703 | Article | English | [{"id": "60027384", "name": "Laboraloire d'Fleclrolechnique de G., UMR 5529 CNRS, INPG/UJF ENSIEG, F38402 - Saint-Martin-d'Heres-Cedex, BP 46, France", "fullName": "Laboraloire d'Fleclrolechnique de G., UMR 5529 CNRS, INPG/UJF ENSIEG", "reference": "a", "fullAddress": "F38402 - Saint-Martin-d'Heres-Cedex, BP 46, France", "departmentId": null}] |
1,000 | 56,166 | Exact results for an approximate renormalisation scheme and some predictions for the breakup of invariant tori | Physica D: Nonlinear Phenomena | An approximate renormalisation scheme is derived for the breakup of invariant tori of arbitrary winding ratio in Hamiltonian systems of one and a half degrees of freedom, similar to that of Escande and Doveil. It is a free semi-group with two generators. This scheme is solved exactly for its orbits, stable manifolds, unstable manifolds and critical set. Various results are found, including a Cantor set of universal fractal diagrams, the robustness of noble tori, and a scaling law for areas near critical circles. © 1988. | ["Mackay R.S."] | ["15742541200"] | 1,988 | 30 | [] | 10.1016/S0167-2789(98)90020-3 | Article | English | [{"id": "60022020", "name": "Mathematics Institute, University of Warwick, Coventry, CV4 7AL, United Kingdom", "fullName": "Mathematics Institute, University of Warwick", "reference": "a", "fullAddress": "Coventry, CV4 7AL, United Kingdom", "departmentId": "100296461"}] |
1,001 | 56,174 | Optimum deNO<sub>x</sub> performance using inferential feedforward reductant flow control | Computer Aided Chemical Engineering | To adequately control the reductant flow for the catalytic removal of NO<sub>x</sub> from diesel exhaust gases a tool is required that is capable of accurately and quickly predicting the engine's NO<sub>x</sub> emissions based on its operating variables, and that is also capable of predicting the optimum ammonia/NO<sub>x</sub> ratio for NO<sub>x</sub> removal. Two algorithms for non-linear modelling are evaluated: (1) neural networks and (2) the split & fit algorithm of-Bakker et al. [1,2]. Measurements were carried out on a semi-stationary diesel engine. Results of the split & fit algorithm and the neural network were compared to (3) the traditionally used engine map and (4) a linear fit. Both the neural network and the split & fit algorithm gave excellent NO<sub>x</sub> predictions with a short computation time (0.3 ms), making them very promising tools in real-time automotive NO<sub>x</sub> emission control. With regard to the estimation of the optimum NH<sub>3</sub>/NO<sub>x</sub> ratio, the neural network predicts the effect of NH<sub>3</sub>/NO<sub>x</sub> ratio on the final NO<sub>2</sub> emission very well. © 2000 Elsevier B.V. All rights reserved. | ["Krijnsen H.C.", "van Leeuwen J.C.M.", "Bakker R.", "Calis H.P.A.", "van den Bleek C.M."] | ["6603607495", "7101942999", "55108759500", "7003652877", "35512782500"] | 2,000 | 2 | [] | 10.1016/S1570-7946(00)80149-2 | Article | English | [{"id": "60006288", "name": "DelftChemTech, Faculty of Applied Sciences, Delft University of Technology, 2628 BL Delft, Julianalaan 136, Netherlands", "fullName": "DelftChemTech, Faculty of Applied Sciences, Delft University of Technology", "reference": "a", "fullAddress": "2628 BL Delft, Julianalaan 136, Netherlands", "departmentId": "107027188"}] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.