Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?     

Vehicle density and velocity estimation on highways for on-ramp metering control

A scheme for vehicle density and velocity estimation in a stretch of highway based on a modified cell transmission model [C. F. Daganzo, Transportation Research, Part B, 28B(4),269–287, 1994. Elsevier is presented. The scheme is intended for use with on-ramp metering control algorithms, providing local knowledge of densities and velocities that is helpful to improve on-ramp metering control performance. Estimation of density is obtained by nonlinear estimators, while velocity estimation is obtained by gradient algorithms. There is one density–velocity estimator for free traffic flow and other for congested traffic flow. Both estimator schemes work in parallel. The final estimation of density and velocity results from a convex combination of the predictions of the two estimators. This combination depends on occupancy or density measurements at the boundaries of the stretch and is produced by a fuzzy inference system. Stability and convergence of the density and velocity estimation scheme is proved by Lyapunov based techniques. Simulation results comparing measured and estimated traffic data are presented. They confirm good performance of the estimators. Research sponsored by grants UNAM PAPIIT IN110403 and CONACYT 47583.     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).     

Self-Orthogonal 3-(56,12,65) Designs and Extremal Doubly-Even Self-Dual Codes of Length 56

In this paper, we show that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56. As a consequence, it is shown that an extremal doubly-even self-dual code of length 56 is generated by the codewords of minimum weight. We also demonstrate that there are more than one thousand inequivalent extremal doubly-even self-dual [56,28,12] codes. This result shows that there are more than one thousand non-isomorphic self-orthogonal 3-(56,12,65) designs. AMS Classification: 94B05, 05B05     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.     

β分式α稳定过程的1/H变差

本文主要讨论了β分式α稳定过程的1/H变差,这对关于β分式α稳定过程的随机分析是非常重要的.     

用多焦点全息透镜实现多重谱分数傅里叶变换

提出用多焦点全息透镜实现多重谱分数傅里叶变换.利用全息方法通过一次曝光制作出多焦点的全息透镜,分析了用此全息元件实现这种变换的条件,并在实验上实现了多重谱分数傅里叶变换. 实验结果表明这种变换方法简便可行,可广泛应用于多通道光学信息处理系统及多目标图像识别系统中.     

Current methods for site-directed structure generation

Summary There has been a rapid growth of interest in techniques for site-directed drug design, fuelled by the increasing availability of structural models of proteins of therapeutic importance, and by studies reported in the literature showing that potent chemical leads can be obtained by these techniques. Structure generation programs offer the prospect of discovering highly original lead structures from novel chemical families. Due to the fact that this technique is more-or-less still in its infancy, there are no case studies available that demonstrate the use of structure generation programs for site-directed drug design. Such programs were first proposed in 1986, and became commercially available in early 1992. They have shown their ability to reproduce, or suggest reasonable alternatives for, ligands in well-defined binding sites. This brief review will discuss the recent advances that have been made in the field of site-directed structure generation.     

Optimal shape design for packaging containing heating elements by inverse heat transfer method

The present study is concerned with the determination of the optimal shape for a package containing multiple heating elements. The optimization tool has been developed based on the inverse heat transfer (IHT) approach, incorporating a direct problem solver, a numerical grid generator, a direct-differentiation sensitivity analyzer, and the conjugate gradient method. Shape design that leads to a specified outer surface temperature distribution is predicted by the approach. In this study, the effects of internal heat generation on optimal shapes of the packagings have also been evaluated. Several practical cases with various imbedded heating elements and thermal conditions are studied. Results show that the approach provides an efficient computer-aided design scheme for the shape profile determination.