Spherical space forms - Homotopy self-equivalences and homotopy types, the case of the groups Z/a x (Z/b x TL(2)(F(p)))

Let G = Z/a x(mu) (Z/b x TL(2)(F(p))) and X(n) be an n-dimensional CW-complex with the homotopy type of the n-sphere. We determine the automorphism group Aut(G) and then compute the number of distinct homotopy types of spherical space forms with respect to free and cellular G-actions on all CW-complexes X(2dn - 1), where 2d is a period of G. Next, the group E(X(2dn - 1)/alpha) of homotopy self-equivalences of spherical space forms X(2dn - 1)/alpha, associated with such G-actions alpha on X(2dn - 1) are studied. Similar results for the rest of finite periodic groups have been obtained recently and they are described in the introduction. (C) 2009 Elsevier B.V. All rights reserved.

On automorphisms of split metacyclic groups

Let D( m, n; k) be the semi-direct product of two finite cyclic groups Z/m = < x > and Z/n = < y >, where the action is given by yxy(-1) = x(k). In particular, this includes the dihedral groups D(2m). We calculate the automorphism group Aut (D(m, n; k)).

Automorphism Groups of Generalized (Binary) Icosahedral, Tetrahedral and Octahedral Groups

Let G be any of the (binary) icosahedral, generalized octahedral (tetrahedral) groups or their quotients by the center. We calculate the automorphism group Aut(G).

The classification and the conjugacy classes of the finite subgroups of the sphere braid groups

Let n >= 3. We classify the finite groups which are realised as subgroups of the sphere braid group B(n)(S(2)). Such groups must be of cohomological period 2 or 4. Depending on the value of n, we show that the following are the maximal finite subgroups of B(n)(S(2)): Z(2(n-1)); the dicyclic groups of order 4n and 4(n - 2); the binary tetrahedral group T*; the binary octahedral group O*; and the binary icosahedral group I(*). We give geometric as well as some explicit algebraic constructions of these groups in B(n)(S(2)) and determine the number of conjugacy classes of such finite subgroups. We also reprove Murasugi`s classification of the torsion elements of B(n)(S(2)) and explain how the finite subgroups of B(n)(S(2)) are related to this classification, as well as to the lower central and derived series of B(n)(S(2)).

The Borsuk-Ulam theorem for homotopy spherical space forms

In this work, we show for which odd-dimensional homotopy spherical space forms the Borsuk-Ulam theorem holds. These spaces are the quotient of a homotopy odd-dimensional sphere by a free action of a finite group. Also, the types of these spaces which admit a free involution are characterized. The case of even-dimensional homotopy spherical space forms is basically known.

Determination of particle concentration in the breathing zone for four different types of office ventilation systems

Many factors affect the airflow patterns, thermal comfort, contaminant removal efficiency and indoor air quality at individual workstations in office buildings. In this study, four ventilation systems were used in a test chamber designed to represent an area of a typical office building floor and reproduce the real characteristics of a modern office space. Measurements of particle concentration and thermal parameters (temperature and velocity) were carried out for each of the following types of ventilation systems: a) conventional air distribution system with ceiling supply and return; b) conventional air distribution system with ceiling supply and return near the floor; c) underfloor air distribution system; and d) split system. The measurements aimed to analyse the particle removal efficiency in the breathing zone and the impact of particle concentration on an individual at the workstation. The efficiency of the ventilation system was analysed by measuring particle size and concentration, ventilation effectiveness and the Indoor/Outdoor ratio. Each ventilation system showed different airflow patterns and the efficiency of each ventilation system in the removal of the particles in the breathing zone showed no correlation with particle size and the various methods of analyses used.

Defining friendworks : communication perspective on social networks types

This paper introduces friendwork as a new term in social networks studies. A friendwork is a network of friends. It is a specific case of an interpersonal social network. Naming this seemingly well known and familiar group of people as a friendwork facilitates its differentiation from the overall social network, while highlighting this subgroup's specific attributes and dynamics. The focus on one segment within social networks stimulates a wider discussion regarding the different subgroups within social networks. Other subgroups also discussed in this paper are: family dependent, work related, location based and virtual acquaintances networks. This discussion informs a larger study of social media, specifically addressing interactive communication modes that are in use within friendworks: direct (face-to-face) and mediated (mainly fixed telephone, internet and mobile phone). It explores the role of social media within friendworks while providing a communication perspective on social networks.

The understanding of avatar design : various types and styles of avatars and the design considerations

People have adopted various formats of media such as graphics, photo and text (nickname) in order to represent themselves when communicate with others online. Avatar is known as a visual form representing a user oneself and one's identity wished. Its form can vary from a two-dimensional model to a three-dimensional model, and can be visualised with various visual forms and styles. In general, two-dimensional images including an animated image are used in online forum communities and live chat software; while three-dimensional models are often used in computer games. Avatar design is often regarded as a graphic designer's visual image creation or a user's output based on one's personal preference, yet it often causes the avatar design having no consideration of its practical visual design and users' interactive communication experience aspects. This paper will review various types and styles of avatar and discuss about avatar design from visual design and online user experience perspectives. It aims to raise a design discourse in avatar design and build up a well-articulated set of design principles for effective avatar design.

Some applications of logic to feasibility in higher types

While it is commonly accepted that computability on a Turing machine in polynomial time represents a correct formalization of the notion of a feasibly computable function, there is no similar agreement on how to extend this notion on functionals, that is, what functionals should be considered feasible. One possible paradigm was introduced by Mehlhorn, who extended Cobham's definition of feasible functions to type 2 functionals. Subsequently, this class of functionals (with inessential changes of the definition) was studied by Townsend who calls this class POLY, and by Kapron and Cook who call the same class basic feasible functionals. Kapron and Cook gave an oracle Turing machine model characterisation of this class. In this article, we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalise the corresponding properties of the class of feasible functions, thus giving further evidence that the notion of feasibility of functionals mentioned above is correctly chosen. We also improve the Kapron and Cook result on machine representation.Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from NN which suitably characterises basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible programs from mathematical proofs that use nonfeasible functions.

Modeling crash types: New insights into the effects of covariates on crashes at rural intersections

Many studies focused on the development of crash prediction models have resulted in aggregate crash prediction models to quantify the safety effects of geometric, traffic, and environmental factors on the expected number of total, fatal, injury, and/or property damage crashes at specific locations. Crash prediction models focused on predicting different crash types, however, have rarely been developed. Crash type models are useful for at least three reasons. The first is motivated by the need to identify sites that are high risk with respect to specific crash types but that may not be revealed through crash totals. Second, countermeasures are likely to affect only a subset of all crashes—usually called target crashes—and so examination of crash types will lead to improved ability to identify effective countermeasures. Finally, there is a priori reason to believe that different crash types (e.g., rear-end, angle, etc.) are associated with road geometry, the environment, and traffic variables in different ways and as a result justify the estimation of individual predictive models. The objectives of this paper are to (1) demonstrate that different crash types are associated to predictor variables in different ways (as theorized) and (2) show that estimation of crash type models may lead to greater insights regarding crash occurrence and countermeasure effectiveness. This paper first describes the estimation results of crash prediction models for angle, head-on, rear-end, sideswipe (same direction and opposite direction), and pedestrian-involved crash types. Serving as a basis for comparison, a crash prediction model is estimated for total crashes. Based on 837 motor vehicle crashes collected on two-lane rural intersections in the state of Georgia, six prediction models are estimated resulting in two Poisson (P) models and four NB (NB) models. The analysis reveals that factors such as the annual average daily traffic, the presence of turning lanes, and the number of driveways have a positive association with each type of crash, whereas median widths and the presence of lighting are negatively associated. For the best fitting models covariates are related to crash types in different ways, suggesting that crash types are associated with different precrash conditions and that modeling total crash frequency may not be helpful for identifying specific countermeasures.

Automatic generation of assertions to detect potential security vulnerabilities in C programs that use union and pointer types

Type unions, pointer variables and function pointers are a long standing source of subtle security bugs in C program code. Their use can lead to hard-to-diagnose crashes or exploitable vulnerabilities that allow an attacker to attain privileged access over classified data. This paper describes an automatable framework for detecting such weaknesses in C programs statically, where possible, and for generating assertions that will detect them dynamically, in other cases. Exclusively based on analysis of the source code, it identifies required assertions using a type inference system supported by a custom made symbol table. In our preliminary findings, our type system was able to infer the correct type of unions in different scopes, without manual code annotations or rewriting. Whenever an evaluation is not possible or is difficult to resolve, appropriate runtime assertions are formed and inserted into the source code. The approach is demonstrated via a prototype C analysis tool.