35750619
Restricted T-Universal Functions
We prove the existence of a function @f which is holomorphic exactly in the unit disk D and has universal translates with respect to a prescribed closed set [email protected][email protected]?D and satisfies @[email protected]?C^~(@?D\E). If Q is a subsequence of N"0 with upper density d(Q)=1 then the function @f can be constructed such that in [email protected] (z)[email protected]?n=0~a"nz^nwitha"[email protected]?Q.
205705738
A lacunary version of Mergelian's approximation theorem
Let K be a compact plane set having connected complement. Then Mergelian's theorem states that the linear span of the monomials z^n, i.e. the polynomials, are dense in the Banach space A(K) of all functions continuous on K and holomorphic in the interior of K endowed with the sup-norm. We consider the question under which conditions the linear span of z^n, with n running through a sequence of nonnegative integers having upper density one, is dense in A(K) or appropriate subspaces.
11737906
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in that it offers efficient access to data using distributed disk-based data structures. This provides fast access to hundreds of gigabytes of data,which allows for computing without worrying about memory limitations.
 The new algorithm is demonstrated on one of the long-standing open problems in the Modular Atlas Project [11]: the Brauer tree of the principal 17-block the sporadic simple Fischer group Fi23 The tree is completed by computing three orbit counting matrices for the Fi23 orbit of size 11, 739, 046, 176 acting on vectors of dimension 728 over GF (2). The construction of these matrices requires 3-1/2 days on a cluster of 56 computers,and uses 8 GB of disk storage and 800 MB of memory per machine.
41952008
Understanding User Preferences and Awareness: Privacy Mechanisms in Location-Based Services
Location based services (LBS) let people retrieve and share information related to their current position. Examples are Google Latitude or Panoramio. Since LBS share user-related content, location information etc., they put user privacy at risk. Literature has proposed various privacy mechanisms for LBS. However, it is unclear which mechanisms humans really find useful, and how they make use of them. We present a user study that addresses these issues. To obtain realistic results, we have implemented a geotagging application on the web and on GPS cellphones, and our study participants use this application in their daily lives. We test five privacy mechanisms that differ in the awareness, mental effort and degree of informedness required from the users. Among other findings, we have observed that in situations where a single simple mechanism does not meet all privacy needs, people want to use simple and sophisticated mechanisms in combination. Further, individuals are concerned about the privacy of others, even when they do not value privacy for themselves.
8947989
Submission of content to a digital object repository using a configurable workflow system
The prototype of a workflow system for the submission of content to a digital object repository is here presented. It is based entirely on open-source standard components and features a service-oriented architecture. The front-end consists of Java Business Process Management (jBPM), Java Server Faces (JSF), and Java Server Pages (JSP). A Fedora Repository and a mySQL data base management system serve as a back-end. The communication between front-end and back-end uses a SOAP minimal binding stub. We describe the design principles and the construction of the prototype and discuss the possibilities and limitations of work ow creation by administrators. The code of the prototype is open-source and can be retrieved in the project escipub at this http URL
9104094
Generic Web Services - Extending Service Scope While Preserving Backwards Compatibility
An apparatus for sorting blocks made of concrete or concrete-like material, in particular paving slabs, having a vibration arrangement and a sorting arrangement which slopes with respect to the horizontal, has an entry part for the blocks which are to be sorted and a sorting part, which has at least one collecting channel running in the conveying direction. The collecting channel has a central part and two lateral run-on surfaces arranged thereon, the width of the central part corresponding at least approximately to one of the two shorter edge lengths of the blocks which are to be sorted. The run-on surfaces are provided with stop elements, the stop elements on one run-on surface being offset in the longitudinal direction with respect to the stop elements on the other run-on surface.
16090986
Developing Web applications for mobile devices
Today, even small mobile devices access the Internet. Therewith, mobility issues have become an important technical and economic topic - not only in new but in proven and successful Web applications as well. The main problem derives from a growing development of heterogeneity in hardware and software of mobile devices. To overcome this problem, this paper presents a framework to develop Web applications for mobile devices. This framework issues important points when developing web application that also focuses on mobile users. This includes completely new developments, as well as development that issue an upgrade of existing Web applications to mobile devices. An important element in this framework is the employment of the fairly new CC/PP standard.