The connection between groups and recursive (un)decidability has a long history, going back to the early 1900s. Also, various polynomial-time algorithms have been known in group theory for a long time. However the impact of more general computational complexity (e.g., NP-completeness or PSpace-completeness) has been relatively small and recent. These lectures review a sampling of older facts ab...

a novel computational fluid dynamics and molecular kinetic theory (cfd-mk) method was developed to simulate the impingement of a nanodroplet onto a solid surface. a numerical solution of the navier–stokes equation using a volume-of-fluid (vof) technique was used to model nanodroplet deformation. dynamic contact angle during droplet impact was obtained by molecular kinetic theory. this dynamic c...

The paper reports on first steps towards automated computational analysis of a unique and unprecedented corpus of symbolic performance data. In particular, we focus on between-hand asynchronies – an expressive device that plays an important role particularly in Romantic music, but has not been analyzed quantitatively in any substantial way. The historic data were derived from performances by th...

in this paper by using concepts of graph theory, forces method and substructure ing method for analysis of structures, some methods have been introduced for optimal analysis of structures in a large scale, using substructuring method. planar rigid frames assuming linear behavior and small deformations, have been optimal analyzed, by using forces method. thus, a fortran power station computation...

The faces of both adults and children can be classified accurately by sex, even in the absence of sex-stereotyped social cues such as hair and clothing (Wild et al., 2000). Although much is known from psychological and computational studies about the information that supports sex classification for adults’ faces, children’s faces have been much less studied. The purpose of the present study was...

If p is any prime, and 6 is that automorphism of the group SL(3,/>) which takes each matrix to the transpose of its inverse, then there exists a connected trivalent graph F(p) on ^p(p—\)(p — \) vertices with the split extension SL(3,/?)<0> as a group of automorphisms acting regularly on its 4-arcs. In fact if/? / 3 then this group is the full automorphism group of f(p), while the graph F(3) is ...