Home About us Contact
|
Home About us Contact | ||
|
|
||
Line Segments (line + segment)
Selected AbstractsThe listener's temperament and perceived tempo and loudness of musicEUROPEAN JOURNAL OF PERSONALITY, Issue 8 2009Joanna Kantor-MartynuskaArticle first published online: 8 JUL 200 Abstract The relationship between the listener's temperament and perceived magnitude of tempo and loudness of music was studied using the techniques of magnitude production, magnitude estimation scaling and cross-modal matching. Four piano pieces were presented at several levels of tempo and loudness. In Study 1, participants adjusted tempo and loudness of music to their subjective level of comfort. In Study 2, participants estimated these parameters on a numerical scale and matched the length of a line segment to the estimates of these musical features. The results showed significant correlations of selected aspects of perceived tempo with perseveration and endurance as well as of selected aspects of perceived loudness with endurance and emotional reactivity. Perceived tempo and loudness, as measured by magnitude production and cross-modal matching tasks, do not seem to systematically correlate with the six formal characteristics of behaviour distinguished in the most recent version of the Regulative Theory of Temperament (RTT). Additionally, there is some evidence that they are selectively associated with reactivity and activity, the dimensions of a previous version of the RTT. The study extends the methodology of research on music preferences and the stimulatory value of music. Copyright © 2009 John Wiley & Sons, Ltd. [source] Estimation of origin-destination matrices for a multimodal public transit networkJOURNAL OF ADVANCED TRANSPORTATION, Issue 2 2005K.I. Wong Abstract This paper presents a procedure for the estimation of origin-destination (O-D) matrices for a multimodal public transit network. The system consists of a number of favored public transit modes that are obtained from a modal split process in a traditional four-step transportation model. The demand of each favored mode is assigned to the multimodal network, which is comprised of a set of connected links of different public transit modes. An entropy maximization procedure is proposed to simultaneously estimate the O-D demand matrices of all favored modes, which are consistent with target data sets such as the boarding counts and line segment flows that are observed directly in the network. A case study of the Hong Kong multimodal transit network is used to demonstrate the effectiveness of the proposed methodology. [source] Solutions to a nonlinear Poisson,Nernst,Planck system in an ionic channelMATHEMATICAL METHODS IN THE APPLIED SCIENCES, Issue 15 2010L. Hadjadj Abstract A limiting one-dimensional Poisson,Nernst,Planck (PNP) equations is considered, when the three-dimensional domain shrinks to a line segment, to describe the flows of positively and negatively charged ions through open ion channel. The new model comprises the usual drift diffusion terms and takes into account for each phase, the bulk velocity defined by (4) including the water bath for ions. The existence of global weak solution to this problem is shown. The proof relies on the use of certain embedding theorem of weighted sobolev spaces together with Hardy inequality. Copyright © 2010 John Wiley & Sons, Ltd. [source] A solution method for the linear Chandrasekhar equationMATHEMATICAL METHODS IN THE APPLIED SCIENCES, Issue 15 2006Elias Wegert Abstract The paper is devoted to the linearized H -equation of Chandrasekhar and Ambarzumyan. A Stieltjes-type transform reduces the equation to a boundary value problem for holomorphic functions in the upper half-plane which is solved in closed form. Additional conditions ensure that the solutions , extend holomorphically to the lower half-plane slit along a straight line segment. The solutions of the original problem are then determined from the boundary values of , on this slit. The approach gives necessary and sufficient conditions for Fredholmness and describes all Fredholm parameters in terms of zeros of two functions 1,K and G associated with the kernel and the right-hand side of the equation. Explicit formulas for the complete set of solutions are presented. Die Arbeit ist der linearisierten H -Gleichung von Chandrasekhar und Ambarzumyan gewidmet. Die Gleichung wird mit Hilfe einer modifizierten Stieltjes-Transformation auf ein Randwertproblem für holomorphe Funktionen in der oberen Halbebene zurückgeführt das in geschlossener Form gelöst wird. Unter zusätzlichen Bedingungen können die Lösungen holomorph in die längs einer Strecke aufgeschnittene untere Halbebene fortgesetzt werden. Die Lösungen , des Ausgangsproblems werden dann aus den Randwerten von , längs des Schlitzes bestimmt. Der Zugang liefert notwendige und hinreichende Bedingungen dafür, dass der Operator Fredholmsch ist und charakterisiert alle Fredholmparameter mit Hilfe der Nullstellen zweier Funktionen 1,K und G, die dem Kern und der rechten Seite der Gleichung zugeordnet sind. Es werden explizite Darstellungen für die vollständige Lösungsmenge angegeben. Copyright © 2006 John Wiley & Sons, Ltd. [source] Continuous accumulation games on discrete locationsNAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 1 2002Kensaku Kikuta Abstract In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, ,, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, ,, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60,77, 2002; DOI 10.1002/nav.1048 [source] Analysis of a circulant based preconditioner for a class of lower rank extracted systemsNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 1 2005S. Salapaka Abstract This paper proposes and studies the performance of a preconditioner suitable for solving a class of symmetric positive definite systems, Apx=b, which we call lower rank extracted systems (LRES), by the preconditioned conjugate gradient method. These systems correspond to integral equations with convolution kernels defined on a union of many line segments in contrast to only one line segment in the case of Toeplitz systems. The p × p matrix, Ap, is shown to be a principal submatrix of a larger N × N Toeplitz matrix, AN. The preconditioner is provided in terms of the inverse of a 2N × 2N circulant matrix constructed from the elements of AN. The preconditioner is shown to yield clustering in the spectrum of the preconditioned matrix similar to the clustering results for iterative algorithms used to solve Toeplitz systems. The analysis also demonstrates that the computational expense to solve LRE systems is reduced to O(N log N). Copyright © 2004 John Wiley & Sons, Ltd. [source] Cable model with frequency dependent parameters calculated by using subconductorsEUROPEAN TRANSACTIONS ON ELECTRICAL POWER, Issue 1 2003L. Hofmann A cable model with frequency dependent parameters in the time domain for the simulation of transients in the short time range is presented. The model is based on the division of the transmission line into m short lossless delay line segments of length ,xk = l/m, which are connected to each other by damping-networks consisting of constant ohmic resistances and by distortion-networks simulating the frequency dependence of the series impedance per unit length. The damping-networks consider ohmic line losses as well as leakage losses by shunt conductances. The distortion-networks are represented by state space equations in the time domain. One advantage of the model in comparison to generally used models is the direct determination of the model parameters from the geometrical dimensions of the line-ground configuration. This model also provides a fast and accurate algorithm. [source] Removal of DC power-line magnetic-field effects from airborne total magnetic-field measurementsGEOPHYSICAL PROSPECTING, Issue 3 2000Mehran Gharibi Power lines carrying DC current can strongly affect total magnetic-field measurements. A simple algorithm using Biot,Savart's law was made to remove magnetic-field components due to a DC power line from airborne total magnetic-field measurements in the Gävle area, Sweden. The power-line location was estimated from observed data and then split into short line segments. The magnetic-field components due to each segment were calculated and summed together to give the total magnetic effect due to the power line at each observation point. The corrected total magnetic field was calculated by subtracting the power-line magnetic-field vector, projected on to the direction of the main field, from the measured total field. The results show a successful removal of the power-line magnetic effect from the total magnetic-field measurements. However, an error in the estimation of the power-line location can result in a magnetic-field residual after correction. A non-linear median filtering was used to remove this residual when needed. [source] Matching of uncalibrated stereo images by elastic deformationINTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, Issue 5 2004Wan-Chiu Li Abstract We propose a method for uncalibrated stereo matching. The method applies gradual elastic deformation to the line segments in a pair of images until they match with each other. By using an energy function and a neighborhood function, matching is performed in a coarse-to-fine manner. Our method gives point correspondences with a low proportion of outliers and is robust in the uncalibrated case (with no need to estimate the epipolar geometry). The computation complexity is proportional to the square of the number of line segments in the images, which is relatively efficient compared with other elaborate methods. © 2005 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 14, 198,205, 2004; Published online in Wiley Inter-Science (www.interscience.wiley.com). DOI 10.1002/ima.20024 [source] An approach to the linguistic summarization of time series using a fuzzy quantifier driven aggregationINTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, Issue 5 2010Janusz Kacprzyk We extend our previous work on the linguistic summarization of time series data meant as the linguistic summarization of trends, i.e. consecutive parts of the time series, which may be viewed as exhibiting a uniform behavior under an assumed (degree of) granulation, and identified with straight line segments of a piecewise linear approximation of the time series. We characterize the trends by the dynamics of change, duration, and variability. A linguistic summary of a time series is then viewed to be related to a linguistic quantifier driven aggregation of trends. We primarily employ for this purpose the classic Zadeh's calculus of linguistically quantified propositions, which is presumably the most straightforward and intuitively appealing, using the classic minimum operation and mentioning other t -norms. We also outline the use of the Sugeno and Choquet integrals proposed in our previous papers. We show an application to the absolute performance type analysis of time series data on daily quotations of an investment fund over an 8-year period, by presenting first an analysis of characteristic features of quotations, under various (degrees of) granulations assumed, and then by listing some more interesting and useful summaries obtained. We propose a convenient presentation of linguistic summaries focused on some characteristic feature exemplified by what happens "almost always," "very often," "quite often," "almost never," etc. All these analyses are meant to provide means to support a human user to make decisions. © 2010 Wiley Periodicals, Inc. [source] Analysis of a circulant based preconditioner for a class of lower rank extracted systemsNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 1 2005S. Salapaka Abstract This paper proposes and studies the performance of a preconditioner suitable for solving a class of symmetric positive definite systems, Apx=b, which we call lower rank extracted systems (LRES), by the preconditioned conjugate gradient method. These systems correspond to integral equations with convolution kernels defined on a union of many line segments in contrast to only one line segment in the case of Toeplitz systems. The p × p matrix, Ap, is shown to be a principal submatrix of a larger N × N Toeplitz matrix, AN. The preconditioner is provided in terms of the inverse of a 2N × 2N circulant matrix constructed from the elements of AN. The preconditioner is shown to yield clustering in the spectrum of the preconditioned matrix similar to the clustering results for iterative algorithms used to solve Toeplitz systems. The analysis also demonstrates that the computational expense to solve LRE systems is reduced to O(N log N). Copyright © 2004 John Wiley & Sons, Ltd. [source] Design of forming shoulders with complex cross-sectionsPACKAGING TECHNOLOGY AND SCIENCE, Issue 4 2005C. J. McPherson Abstract Vertical ,form, fill and seal' machines are used to produce bags for packing particulate or multiple objects. In operation, film is drawn over a forming shoulder and the good design of the surfaces of the shoulder is vital to the successful operation. This paper reviews underlying geometrical definition for the shoulder, corresponding to a filling tube with circular cross-section. In practice, such cross-sections occur frequently, but other variant shapes are becoming increasingly common. A method is discussed and demonstrated for extending the approach to allow tubes formed from circular arcs and straight line segments to be handled. Copyright © 2005 John Wiley & Sons, Ltd. [source] Optimal approximations of nonlinear payoffs in static replication,THE JOURNAL OF FUTURES MARKETS, Issue 11 2010Qiang Liu Static replication of nonlinear payoffs by line segments (or equivalently vanilla options) is an important hedging method, which unfortunately is only an approximation. If the strike prices of options are adjustable (for OTC options), two optimal approximations can be defined for replication by piecewise chords. The first is a naive minimum area approach, which seeks a set of strike prices to minimize the area enclosed by the payoff curve and the chords. The second improves on the first by taking the conditional distribution of the underlying into consideration, and minimizes the expected area instead. When the strike prices are fixed (for exchange-traded options), a third or the approach of least expected squares locates the minimum for the expected sum of squared differences between the payoff and the replicating portfolio, by varying the weights or quantities of the options used in the replication. For a payoff of variance swap, minimum expected area and least expected squares are found to produce the best numerical results in terms of cost of replication. Finally, piecewise tangents can also be utilized in static replication, which together with replication by chords, forms a pair of lower or upper bound to a nonlinear payoff. © 2010 Wiley Periodicals, Inc. Jrl Fut Mark [source] ERROR SPACE MOTION CONTROL METHODOLOGY FOR COMPLEX CONTOURSASIAN JOURNAL OF CONTROL, Issue 1 2005Robert G. Landers ABSTRACT Motion control is a critical component of many engineering systems (e.g., manufacturing, robotics). Most systems have standard interpolation and control schemes for linear and circular contours; therefore, complex contours are often decomposed into a series of line segments and circular arcs. However, there are discontinuities where the line segments and arcs are joined together, and time to complete the contour is substantially increased when acceleration/deceleration interpolation schemes are employed. A motion control scheme known as the error space motion control methodology is proposed in this paper to design servomechanism motion control systems that may be utilized for complex contours. The error space motion control methodology is applied to a two-axis motion control system and simulation studies are conducted for linear, circular, elliptical, and limacon contours. The results demonstrate the excellent tracking ability of the proposed error space motion control methodology and its utility for complex contours. [source] Local minimizers with vortices to the Ginzburg-Landau system in three dimensionsCOMMUNICATIONS ON PURE & APPLIED MATHEMATICS, Issue 1 2004J. Alberto Montero We construct local minimizers to the Ginzburg-Landau energy in certain three-dimensional domains based on the asymptotic connection between the energy and the total length of vortices using the theory of weak Jacobians. Whenever there exists a collection of locally minimal line segments spanning the domain, we can find local minimizers with arbitrarily assigned degrees with respect to each segment. © 2003 Wiley Periodicals, Inc. [source] | |||||||||||||