Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformations and pattern recognition for automated deduction. The past few years have established the benefit of using explicit substitutions for theorem proving and higher-order unification. In this paper, we will make use of explicit s...

This paper shows that the OSGA algorithm – which uses first-order information to solve convex optimization problems with optimal complexity – can be used to efficiently solve arbitrary bound-constrained convex optimization problems. This is done by constructing an explicit method as well as an inexact scheme for solving the bound-constrained rational subproblem required by OSGA. This leads to a...

One of the major applications of implicit surface modeling systems has been the generation of cartoon-like characters. Recently, additional modeling methods have been combined with implicit surfaces to create much more complex models. These methods include constructive solid geometry (CSG), warping, and two-dimensional texture mapping (among others). The BlobTree has been introduced to organize...

There have been many numerical simulations but few analytical results of stability and accuracy of algorithms for computational modeling of fluid-fluid and fluid-structure interaction problems, where two domains corresponding to different fluids (ocean-atmosphere) or a fluid and deformable solid (blood flow) are separated by an interface. As a simplified model of the first examples, this report...

In many situations, embedded menus represent an attractive alternative to the more traditional explicit menus, particularly in touchtext, spelling checkers, language-based program editors, and graphics-based systems. When compared to command driven systems, computer menu systems are appealing because they reduce memorization of commands, reduce training, and structure the user's decision making...

williams, watts, macleod and mathews' (1988) model of anxiety and depression leads to the prediction that anxious patients will show mood – congreuent implicit memory bias, while depressed patients will show mood-congruent explicit memory bias.although this prediction has been supported by some researchers (denny & hunt, 1992 mathews, moog, et al , 1989 watkins, et al, 1992), the reliabili...

objectives: cerebral hemispheres functioning have been found to be abnormal in children with asd. the role of lateralization in implicit and explicit motor learning has received little attention in asd researches. the main goal of this study is investigating the differences between two hands implicit and explicit motor learning in children with asd and typical matched group. methods: in the pre...

introduction: the aim of this study was to assess of both implicit and explicit motor sequence learning in children with attention deficit hyper activity disorder (adhd) and typical peers , by serial reaction time task. materials and methods: the sample size for each group was 12. the study sample was included 24 children with adhd, in explicit learning group and implicit learning group.  and 2...

Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program’s WCET statically is possible, computing its true WCET is difficult without significant semantic knowledge. We present an algorithm for partial program adm...

This work describes a concurrent, distributed abstract machine for the pi calculus. Its primary audience are researchers in the field of concurrency. The secondary audience are working programmers looking for a better way to write interactive programs. This audience need only read Chapters 1 (an overview) and 5 (the implementation). I hope that these chapters might prove appealing to students w...