A Windows Phone 7 Oriented Secure Architecture for Business Intelligence Mobile Applications

This paper present and implement a Windows Phone 7 Oriented Secure Architecture for Business Intelligence Mobile Application. In the developing process is used a Windows Phone 7 application that interact with a WCF Web Service and a database. The types of Business Intelligence Mobile Applications are presented. The Windows mobile devices security and restrictions are presented. The namespaces and security algorithms used in .NET Compact Framework for assuring the application security are presented. The proposed architecture is showed underlying the flows between the application and the web service.Security, Secure Architecture, Mobile Applications, Business Intelligence, Web Service

Thermal States in Conformal QFT. II

We continue the analysis of the set of locally normal KMS states w.r.t. the translation group for a local conformal net A of von Neumann algebras on the real line. In the first part we have proved the uniqueness of KMS state on every completely rational net. In this second part, we exhibit several (non-rational) conformal nets which admit continuously many primary KMS states. We give a complete classification of the KMS states on the U(1)-current net and on the Virasoro net Vir_1 with the central charge c=1, whilst for the Virasoro net Vir_c with c>1 we exhibit a (possibly incomplete) list of continuously many primary KMS states. To this end, we provide a variation of the Araki-Haag-Kastler-Takesaki theorem within the locally normal system framework: if there is an inclusion of split nets A in B and A is the fixed point of B w.r.t. a compact gauge group, then any locally normal, primary KMS state on A extends to a locally normal, primary state on B, KMS w.r.t. a perturbed translation. Concerning the non-local case, we show that the free Fermi model admits a unique KMS state.Comment: 36 pages, no figure. Dedicated to Rudolf Haag on the occasion of his 90th birthday. The final version is available under Open Access. This paper contains corrections to the Araki-Haag-Kaster-Takesaki theorem (and to a proof of the same theorem in the book by Bratteli-Robinson). v3: a reference correcte

On the use of programming languages for textual specification of Petri Net Models

O presente artigo revê e aprofunda o artigo intitulado Towards a Human-Friendly Textual Language for Petri Nets, apresentado no Workshop on Petri Net Standards 2007.As a general interchange format for Petri net models, the Petri Net Markup Language (PNML) allows the specification of Petri net models for all Petri net classes. Those models are typically generated by graphical editors for each Petri net type. Yet, there is no general way to specify Petri net models in a human-friendly textual notation. Instead of proposing a standard for such textual notation, this paper proposes the use of popular general purpose programming languages for the creation and modification of net models defined using PNML. To that end, the paper presents a model for the concepts, and the respective inter- relations, that should be available to define Petri net models in a compact textual format. After, it presents a general framework to specify model composition, using node fusion, for any Petri net class. The framework allows the specification of node fusions and node refinements based on the specification of fusions for each node and net label. The labels’ fusions are defined through the implementation of an abstract data type for the respective Petri net type definition. This allows a general support for model structuring, where several well-known graphical conveniences, e.g. node references and synchronous channels, can be supported and seen as particular cases

GRASS: Generative Recursive Autoencoders for Shape Structures

We introduce a novel neural network architecture for encoding and synthesis of 3D shapes, particularly their structures. Our key insight is that 3D shapes are effectively characterized by their hierarchical organization of parts, which reflects fundamental intra-shape relationships such as adjacency and symmetry. We develop a recursive neural net (RvNN) based autoencoder to map a flat, unlabeled, arbitrary part layout to a compact code. The code effectively captures hierarchical structures of man-made 3D objects of varying structural complexities despite being fixed-dimensional: an associated decoder maps a code back to a full hierarchy. The learned bidirectional mapping is further tuned using an adversarial setup to yield a generative model of plausible structures, from which novel structures can be sampled. Finally, our structure synthesis framework is augmented by a second trained module that produces fine-grained part geometry, conditioned on global and local structural context, leading to a full generative pipeline for 3D shapes. We demonstrate that without supervision, our network learns meaningful structural hierarchies adhering to perceptual grouping principles, produces compact codes which enable applications such as shape classification and partial matching, and supports shape synthesis and interpolation with significant variations in topology and geometry.Comment: Corresponding author: Kai Xu ([email protected]

A coalgebraic semantics for causality in Petri nets

In this paper we revisit some pioneering efforts to equip Petri nets with compact operational models for expressing causality. The models we propose have a bisimilarity relation and a minimal representative for each equivalence class, and they can be fully explained as coalgebras on a presheaf category on an index category of partial orders. First, we provide a set-theoretic model in the form of a a causal case graph, that is a labeled transition system where states and transitions represent markings and firings of the net, respectively, and are equipped with causal information. Most importantly, each state has a poset representing causal dependencies among past events. Our first result shows the correspondence with behavior structure semantics as proposed by Trakhtenbrot and Rabinovich. Causal case graphs may be infinitely-branching and have infinitely many states, but we show how they can be refined to get an equivalent finitely-branching model. In it, states are equipped with symmetries, which are essential for the existence of a minimal, often finite-state, model. The next step is constructing a coalgebraic model. We exploit the fact that events can be represented as names, and event generation as name generation. Thus we can apply the Fiore-Turi framework: we model causal relations as a suitable category of posets with action labels, and generation of new events with causal dependencies as an endofunctor on this category. Then we define a well-behaved category of coalgebras. Our coalgebraic model is still infinite-state, but we exploit the equivalence between coalgebras over a class of presheaves and History Dependent automata to derive a compact representation, which is equivalent to our set-theoretical compact model. Remarkably, state reduction is automatically performed along the equivalence.Comment: Accepted by Journal of Logical and Algebraic Methods in Programmin

The transfer of desktop casino application to mobile platform

Knowing the importance of the players is very important in gambling industry. For this purpose was developed desktop application for tracking the game of guests on the gaming tables. This application was not sufficient for effective tracking due to lack of mobility, therefore was necessary to transfer it to the mobile platform. In the thesis I focused mainly on problems that have occurred during the transfer, I described them and their's solutions. They are mostly connected with making graphic interface, and communication between server and mobile application. Since the desktop application is developed with .NET Framework and mobile application with .NET Compact Framework are the problems I had during development reflection of differences between those Frameworks. The result of my work is mobile application, which is running on palmtop with Windows Mobile operating system and .NET Compact Framework installed

A Windows Phone 7 Oriented Secure Architecture for Business Intelligence Mobile Applications

This paper present and implement a Windows Phone 7 Oriented Secure Architecture for Business Intelligence Mobile Application. In the developing process is used a Windows Phone 7 application that interact with a WCF Web Service and a database. The types of Business Intelligence Mobile Applications are presented. The Windows mobile devices security and restrictions are presented. The namespaces and security algorithms used in .NET Compact Framework for assuring the application security are presented. The proposed architecture is showed underlying the flows between the application and the web service