ComWeb: An electronic classroom for teaching computer literacy

We have developed an electronic classroom environment based on an analog/digital hybrid network, ComWeb. This environment supplements traditional methods of presentation by providing powerful communication tools between the students and the teacher directed from the instructor's workstation. The instructor can access every student's workstation at any time to monitor the student's work or to transmit information from any source. ComWeb has facilities for individual and group supervision. It can be adapted for teaching deaf or hard of hearing students in a mainstream environment. We describe the implementation of a ComWeb-based classroom at our site. The performance of students in conventional sections of a computer literacy course is compared with that in a section using ComWeb. For most of the material, performance of students in the ComWeb based section was markedly superior.     

Une méthode d’optimisation discrète pour les filtres cascade à capacités commutées

A discrete optimization method using a noninteraction property between the different sections of cascade switched-capacitor filter is described. The optimization, realized with a reduced set of intermediate parameters caracterizing each section, yields to a non minimum capacitive area structure, but which has very accurate capacitor ratios and which could be realized with minimum unit capacitors. This method may be applied to switched-current filters (aspect ratios of transistor discretization). An eighth order band-pass Cauer filter and a fifth order low-pass Cauer filter show the effectiveness of this method.     

Identification of leek-moth and diamondback-moth frass volatiles that stimulate parasitoid,Diadromus pulchellus

Acrolepiopsis assectella andPlutella xylostella frass volatiles, trapped on Tenax GC, were examined by capillary gas chromatography. In both moths, the same three disulfides, dimethyl, dipropyl, and methyl propyl, were the most abundant substances, but in different proportions. The synthetic disulfides elicited the same behavioral response by the parasitoid,Diadromus pulchellus as frass. The plant origin of these substances is discussed.     

Kernel methods for software effort estimation

Analogy based estimation (ABE) generates an effort estimate for a new software project through adaptation of similar past projects (a.k.a. analogies). Majority of ABE methods follow uniform weighting in adaptation procedure. In this research we investigated non-uniform weighting through kernel density estimation. After an extensive experimentation of 19 datasets, 3 evaluation criteria, 5 kernels, 5 bandwidth values and a total of 2090 ABE variants, we found that: (1) non-uniform weighting through kernel methods cannot outperform uniform weighting ABE and (2) kernel type and bandwidth parameters do not produce a definite effect on estimation performance. In summary simple ABE approaches are able to perform better than much more complex approaches. Hence,—provided that similar experimental settings are adopted—we discourage the use of kernel methods as a weighting strategy in ABE.     

Experimental Evaluation and Formal Analysis of High‐Level Tasks with Dynamic Obstacle Anticipation on a Full‐Sized Autonomous Vehicle

Certifying the behavior of autonomous systems is essential to the development and deployment of systems in safety‐critical applications. This paper presents an approach to using a correct‐by‐construction controller with the probabilistic results of dynamic obstacle anticipation, and validates the approach with experimental data obtained from Cornell's full‐scale autonomous vehicle. The obstacle anticipation (used to calculate the probability of collision with dynamic obstacles around the vehicle) is abstracted to a set of Boolean observations, which are then used by the synthesized controller (a state machine generated from temporal logic task specifications). The obstacle anticipation, sensor abstraction, and synthesized controller are implemented on a full‐scale autonomous vehicle, and experimental data are collected and compared with a formal analysis of the probabilistic behavior of the system. A comparison of the results shows good agreement between the formal analysis and the experimental results.     

Complexity and computability of solutions to linear programming systems

Through key examples and constructs, exact and approximate, complexity, computability, and solution of linear programming systems are reexamined in the light of Khachian's new notion of (approximate) solution. Algorithms, basic theorems, and alternate representations are reviewed. It is shown that the Klee-Minty example hasnever been exponential for (exact) adjacent extreme point algorithms and that the Balinski-Gomory (exact) algorithm continues to be polynomial in cases where (approximate) ellipsoidal centered-cutoff algorithms (Levin, Shor, Khachian, Gacs-Lovasz) are exponential. By model approximation, both the Klee-Minty and the new J. Clausen examples are shown to be trivial (explicitly solvable) interval programming problems. A new notion of computable (approximate) solution is proposed together with ana priori regularization for linear programming systems. New polyhedral constraint contraction algorithms are proposed for approximate solution and the relevance of interval programming for good starts or exact solution is brought forth. It is concluded from all this that the imposed problem ignorance of past complexity research is deleterious to research progress on computability or efficiency of computation.This research was partly supported by Project NR047-071, ONR Contract N00014-80-C-0242, and Project NR047-021, ONR Contract N00014-75-C-0569, with the Center for Cybernetic Studies, The University of Texas at Austin.     

Estimating errors of numerical approximation for periodic analytic functions

We give a simple method based on Cauchy's integral formula for estimating the errors of numerical approximation for periodic analytic functions. We then obtain error estimates for the quadrature formulas of Chawla and Ramakrishnan [1] for the numerical evaluation of the Cauchy principal value integral $$I\left( {f;a} \right) = \int\limits_0^{2\pi } {f(x)\cot \left( {\left( {x - a} \right)/2} \right)dx,} $$ and for the quadrature formula of Garrick [2] for the evaluation ofI (f;o), Based on these error estimates, we are led to conclude that for the evaluation ofI (f;o), Garrick's formula has a better error estimate than the formula of Chawla and Ramakrishnan with the same number of function evaluations. Finally, we extend Garrick's formula for the evaluation ofI (f;a) for arbitrarya∈[0,2π); the extended formula has, for alla, the same error estimate as Garrick's formula. While, for a=x_j, the extended formula is identical with the quadrature formula of Wittich [3], fora≠x _j, the extended formula is much better in that it uses only half the number of function evaluations of Wittich's formula for the same accuracy.