Local Influence Under Parameter Constraints

Calculations of local influence curvatures and leverage have been well developed when the parameters are unrestricted. In this article, we discuss the assessment of local influence and leverage under linear equality parameter constraints with extensions to inequality constraints. Using a penalized quadratic function we express the normal curvature of local influence for arbitrary perturbation schemes and the generalized leverage matrix in interpretable forms, which depend on restricted and unrestricted components. The results are quite general and can be applied in various statistical models. In particular, we derive the normal curvature under three useful perturbation schemes for generalized linear models. Four illustrative examples are analyzed by the methodology developed in the article.

Symmetry breaking in the genetic code: Finite groups

We investigate the possibility of interpreting the degeneracy of the genetic code, i.e., the feature that different codons (base triplets) of DNA are transcribed into the same amino acid, as the result of a symmetry breaking process, in the context of finite groups. In the first part of this paper, we give the complete list of all codon representations (64-dimensional irreducible representations) of simple finite groups and their satellites (central extensions and extensions by outer automorphisms). In the second part, we analyze the branching rules for the codon representations found in the first part by computational methods, using a software package for computational group theory. The final result is a complete classification of the possible schemes, based on finite simple groups, that reproduce the multiplet structure of the genetic code. (C) 2010 Elsevier Ltd. All rights reserved.

Hyperbolic unit groups and quaternion algebras

We classify the quadratic extensions K = Q[root d] and the finite groups G for which the group ring o(K)[G] of G over the ring o(K) of integers of K has the property that the group U(1)(o(K)[G]) of units of augmentation 1 is hyperbolic. We also construct units in the Z-order H(o(K)) of the quaternion algebra H(K) = (-1, -1/K), when it is a division algebra.

The bound quiver of a split extension

In this paper, we give a sufficient (which is also necessary under a compatibility hypothesis) condition on a set of arrows in the quiver of an algebra A so that A is a split extension of A/M, where M is the ideal of A generated by the classes of these arrows. We also compare the notion of split extension with that of semiconvex extension of algebras.

Tilt-critical algebras of tame type

Let A be a finite dimensional k-algebra over an algebraically closed field. Assume A=kQ/I where Q is a quiver without oriented cycles. We say that A is tilt-critical if it is not tilted but every proper convex subcategory of A is tilted. We describe the tilt-critical algebras which are strongly simply connected and tame.

Bjorling problem for timelike surfaces in the Lorentz-Minkowski space

We solve the Bjorling problem for timelike surfaces in the Lorentz-Minkowski space through a split-complex representation formula obtained for this kind of surface. Our approach uses the split-complex numbers and natural split-holomorphic extensions. As applications, we show that the minimal timelike surfaces of revolution as well as minimal ruled timelike surfaces can be characterized as solutions of certain adequate Bjorling problems in the Lorentz-Minkowski space. (C) 2010 Elsevier Inc. All rights reserved.

Curvature Estimates for Submanifolds in Warped Products

We give estimates of the intrinsic and the extrinsic curvature of manifolds that are isometrically immersed as cylindrically bounded submanifolds of warped products. We also address extensions of the results in the case of submanifolds of the total space of a Riemannian submersion.

Boutet de Monvel`s calculus and groupoids I

Can Boutet de Monvel`s algebra on a compact manifold with boundary be obtained as the algebra Psi(0)(G) of pseudodifferential operators on some Lie groupoid G? If it could, the kernel G of the principal symbol homomorphism would be isomorphic to the groupoid C*-algebra C*(G). While the answer to the above question remains open, we exhibit in this paper a groupoid G such that C*(G) possesses an ideal I isomorphic to G. In fact, we prove first that G similar or equal to Psi circle times K with the C*-algebra Psi generated by the zero order pseudodifferential operators on the boundary and the algebra K of compact operators. As both Psi circle times K and I are extensions of C(S*Y) circle times K by K (S*Y is the co-sphere bundle over the boundary) we infer from a theorem by Voiculescu that both are isomorphic.

Free field realizations of the elliptic affine Lie algebra sl(2, R) circle plus (Omega(R)/dR)

In this paper we construct two free field realizations of the elliptic affine Lie algebra sl(2, R) circle plus Omega(R)/dR where R = C[t. t(-1), u vertical bar u(2) = t(3) - 2bt(2) + t]. The first realization provides an analogue of Wakimoto`s construction for Affine Kac-Moody algebras, but in the setting of the elliptic affine Lie algebra. The second realization gives new types of representations analogous to Imaginary Verma modules in the Affine setting. (c) 2009 Elsevier B.V. All rights reserved.

A Unified Load Generator for Geographically Distributed Generation ofNetwork Traffic

During the last decade, the Internet usage has been growing at an enormous rate which has beenaccompanied by the developments of network applications (e.g., video conference, audio/videostreaming, E-learning, E-Commerce and real-time applications) and allows several types ofinformation including data, voice, picture and media streaming. While end-users are demandingvery high quality of service (QoS) from their service providers, network undergoes a complex trafficwhich leads the transmission bottlenecks. Considerable effort has been made to study thecharacteristics and the behavior of the Internet. Simulation modeling of computer networkcongestion is a profitable and effective technique which fulfills the requirements to evaluate theperformance and QoS of networks. To simulate a single congested link, simulation is run with asingle load generator while for a larger simulation with complex traffic, where the nodes are spreadacross different geographical locations generating distributed artificial loads is indispensable. Onesolution is to elaborate a load generation system based on master/slave architecture.

Real-Time Recognition System for Traffic Signs

The aim of this thesis project is to develop the Traffic Sign Recognition algorithm for real time. Inreal time environment, vehicles move at high speed on roads. For the vehicle intelligent system itbecomes essential to detect, process and recognize the traffic sign which is coming in front ofvehicle with high relative velocity, at the right time, so that the driver would be able to pro-actsimultaneously on instructions given in the Traffic Sign. The system assists drivers about trafficsigns they did not recognize before passing them. With the Traffic Sign Recognition system, thevehicle becomes aware of the traffic environment and reacts according to the situation.The objective of the project is to develop a system which can recognize the traffic signs in real time.The three target parameters are the system’s response time in real-time video streaming, the trafficsign recognition speed in still images and the recognition accuracy. The system consists of threeprocesses; the traffic sign detection, the traffic sign recognition and the traffic sign tracking. Thedetection process uses physical properties of traffic signs based on a priori knowledge to detect roadsigns. It generates the road sign image as the input to the recognition process. The recognitionprocess is implemented using the Pattern Matching algorithm. The system was first tested onstationary images where it showed on average 97% accuracy with the average processing time of0.15 seconds for traffic sign recognition. This procedure was then applied to the real time videostreaming. Finally the tracking of traffic signs was developed using Blob tracking which showed theaverage recognition accuracy to 95% in real time and improved the system’s average response timeto 0.04 seconds. This project has been implemented in C-language using the Open Computer VisionLibrary.

Making Learning Possible : Nätbaserad utbildning vid Högskolan Dalarna

Högskolan Dalarna (HDa) har gjort ett strategiskt/medvetet val genom att betona den pedagogiska utvecklingen för nästa generations lärande (NGL) och har under flera år utvecklat nätbaserade kurser. NGL centrum är ett nav i den pedagogiska utvecklingen på HDa. Vår roll är att möjliggöra studenters lärande. (Ramsden 2003). Vid vår högskola fokuserar vi på olika datorsystem som stödjer lärandet och möjliggör synkron interaktion och kommunikation, både vid seminarier och under föreläsningar. Vi har valt och utvecklat system som stödjer lärandet och kontakten mellan studenter och lärare på ett bra sätt, fokus ligger inte nödvändigtvis på den nyaste teknologin. Vi anser att det är viktigt att skapa förutsättningar för sociokulturella miljöer vid nätbaserade utbildingar och därför är seminarier och samtal mycket viktiga i våra utbildningar. (Säljö 2000). Vi har definierat tre huvudbehov för lärandeprocessen och vi har valt system för informationsutbyte (Fronter), Adobe Connect för seminarier och Videochat - vårt egenutvecklade system för föreläsningar. Vi vet sedan många år att föreläsningar hjälper studenterna att förstå litteraturen bättre. Ett LMS (Fronter) är ett sätt att samla information såsom scheman och uppgifter. Där sker diskussioner om innehåll och kursupplägg, inlämningar, nyheter och meddelanden. När det gäller föreläsningar har vi valt att använda ”live-streaming” med möjlighet att spela in föreläsningen. Vi betraktar varken Adobe Connect eller vår Videochat som virtuella verktyg. De möten som genomförs med dessa verktyg är på riktigt. Studenter och lärare vittnar ofta om att de interagerar mer i ett seminarium via Connect än vad som sker i en fysisk föreläsningssal och bekräftar den pedagogiska närheten. HDa har system som är säkra men vi tror samtidigt på öppenhet och lättillgänglighet. Vi välkomnar gäster in i systemen för att skapa transparens. Läraren har möjlighet att låsa mappar i vårt LMS och göra dem både säkra och privata. Vi vill berätta och visa för intresserade konferensdeltagare hur vi på Högskolan Dalarna jobbar generellt med nätbaserade verktyg men också visa på mer specifika lösningar som har uppskattats av våra studenter och lärare.   References Ramsden, Paul (2003). Learning to teach in higher education. 2. ed. London: RoutledgeFalmer Säljö, Roger (2000). Lärande i praktiken: ett sociokulturellt perspektiv. [Learning in practice - A sociocultural perspective]. Stockholm: Prisma

Modular Product Verifications Based on Design for Assembly

The desire to conquer markets through advanced product design and trendy business strategies are still predominant approaches in industry today. In fact, product development has acquired an ever more central role in the strategic planning of companies, and it has extended its influence to R&D funding levels as well. It is not surprising that many national R&D project frameworks within the EU today are dominated by product development topics, leaving production engineering, robotics, and systems on the sidelines. The reasons may be many but, unfortunately, the link between product development and the production processes they cater for are seldom treated in depth. The issue dealt with in this article relates to how product development is applied in order to attain the required production quality levels a company may desire, as well as how one may counter assembly defects and deviations through quantifiable design approaches. It is recognized that product verifications (tests, inspections, etc.) are necessary, but the application of these tactics often result in lead-time extensions and increased costs. Modular architectures improve this by simplifying the verification of the assembled product at module level. Furthermore, since Design for Assembly (DFA) has shown the possibility to identify defective assemblies, it may be possible to detect potential assembly defects already in the product and module design phase. The intention of this paper is to discuss and describe the link between verifications of modular architectures, defects and design for assembly. The paper is based on literature and case studies; tables and diagrams are included with the intention of increasing understanding of the relation between poor designs, defects and product verifications.