Epistemic Actions as Resources

We provide an algebraic semantics together with a sound andcomplete sequent calculus for information update due to epistemicactions. This semantics is flexible enough to accommodate incompleteas well as wrong information e.g. due to secrecy and deceit,as well as nested knowledge. We give a purely algebraic treatmentof the muddy children puzzle, which moreover extends to situationswhere the children are allowed to lie and cheat. Epistemic actions,that is, information exchanges between agents , are modeled as elements of a quantale. The quantale acts on an underlying Q-rightmodule of epistemic propositions and facts. The epistemic content is encoded by appearance maps,one pair and of (lax) morphisms for each agent , which preserve the module and quantale structurerespectively. By adjunction, they give rise to epistemic modalities,capturing the agents' knowledge on propositions and actions.The module action is epistemic update and gives rise to dynamicmodalities—cf. weakest precondition. This model subsumesthe crucial fragment of Baltag, Moss and Solecki's dynamic epistemiclogic, abstracting it in a constructive fashion while introducingresource-sensitive structure on the epistemic actions.     

Streamlines of a perfect fluid as geodesics in Riemannian space-time

Streamlines of a relativistic perfect isentropic fluid are geodesics of a Riemannian space whose metric is determined by the fluid enthalpy. This fact simplifies the solution of some problems, and is also of interest from the point of view of fundamental physics.     

Non-coherent space-time code based on full diversity space-time block coding

A non-unitary non-coherent space-time code which is capable of achieving full algebraic diversity is proposed based on full diversity space-time block coding, The error performance is optimized by transforming the non-unitary space-time code into unitary space-time code, By exploiting the desired structure of the proposed code, a grouped generalized likelihood ratio test decoding algorithm is presented to overcome the high complexity of the optimal algorithm, Simulation results show that the proposed code possesses high spectrum efficiency in contrast to the unitary space-time code despite slight loss in the SNR, and besides, the proposed grouped decoding algorithm provides good tradeoff between performance and complexity,     

Adaptive Actions

Adaptive Actions initiated in London in 2007 by Jean-Fran?ois Prost explores alterations in the workplace, the home, and public spaces in general. Identifying the variety of these personal and found alterations in the city as different forms of adaptation creates a vocabulary for the expression of the collective imagination, through the existing urban structures therein. These ‘actions’ modify and activate the intended use of architecture and enhance the character of urban environments. They create positive tensions that test the limits of tolerated appropriation. Can these simple actions, images, and ideas, such as the hybridization of conventional and unusual urban realities, infiltrate our collective imagination to promote feelings of identity and a sense of cultural belonging? Adaptive Actions points to how urban phenomena impact on residents’ perception of the environment and their relation to it. By offering a space to share experiences, ideas, forms of actions, and specific accomplishments, Adaptive Actions creates an inventory of alterations rarely visible to the public. Printed documents and organized events are being planned to increase visibility of the selected actions to the public eye and build affiliations and communal thinking.     

The viscoelastic space-time element

The way of modeling of viscoelastic medium in the method of finite space-time elements has been presented in this work. This work contains the general algorithm of stiffness matrix building of space-time elements for any state of stress. The presented algorithm is characterised by the great simplicity preserving the values of classical method of finite elements.     

Shape transformation in space-time

We present a method for transforming shapes in a plane. The primary strength of the proposed method is that it can handle scenes containing moving obstacles. We attain a smooth transformation between two given polygonal shapes and ensure that the shape does not collide with any obstacle during the transformation. We minimize a cost function associated with each transformation path that controls its length, smoothness, and collision freedom. Then a population of tentative transformation paths is generated by path planning for an anchor point in the shape. Next, collision detection and shape deformation techniques, applied to keyframes along the paths, minimize the occurrence of collision. Lastly, a genetic algorithm refines the population of transformation paths.     

Three-dimensional beta shapes

The Voronoi diagram of a point set has been extensively used in various disciplines ever since it was first proposed. Its application realms have been even further extended to estimate the shape of point clouds when Edelsbrunner and Mücke introduced the concept of α-shape based on the Delaunay triangulation of a point set.In this paper, we present the theory of β-shape for a set of three-dimensional spheres as the generalization of the well-known α-shape for a set of points. The proposed β-shape fully accounts for the size differences among spheres and therefore it is more appropriate for the efficient and correct solution for applications in biological systems such as proteins.Once the Voronoi diagram of spheres is given, the corresponding β-shape can be efficiently constructed and various geometric computations on the sphere complex can be efficiently and correctly performed. It turns out that many important problems in biological systems such as proteins can be easily solved via the Voronoi diagram of atoms in proteins and β-shapes transformed from the Voronoi diagram.     

People Watching: Human Actions as a Cue for Single View Geometry

We present an approach which exploits the coupling between human actions and scene geometry to use human pose as a cue for single-view 3D scene understanding. Our method builds upon recent advances in still-image pose estimation to extract functional and geometric constraints on the scene. These constraints are then used to improve single-view 3D scene understanding approaches. The proposed method is validated on monocular time-lapse sequences from YouTube and still images of indoor scenes gathered from the Internet. We demonstrate that observing people performing different actions can significantly improve estimates of 3D scene geometry.     

Dual constellations space-time modulation

1 Introduction Most research on wireless communications has assumed that perfect estimation of current fading conditions is available at the receiver. However, learning the channel co- efficients becomes increasingly difficult as the number of antennas and moving speed increases. These factors will increase the complexity and difficulty of channel estimation and even make channel estimation impractical[1―4]. Therefore these schemes are hot top- ics for further research. Hochwald has proposed…     

Differential space-time block-diagonal codes

A new differential space-time code, called differential space-time block-diagonal code (DSTBDC), is proposed for multiple-input multiple-output (MIMO) wireless communication systems. By exploiting the block-diagonal construction of DSTBDC, we can design a variety of high-performance DSTBDC, especially for the cases of large numbers of transmit antennas and high date rates. In flat fading channels, DSTBDC outperforms traditional differential space-time codes if the data rate is higher than 1 bps/Hz, especially when the number of transmit antennas is large. In frequency-selective fading channels, multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems using DSTBDC have the powerful ability to achieve very high diversity gain in space, time, and frequency simultaneously. Due to the special orthogonal construction, DSTBDC has a simple decoding algorithm. In addition, DSTBDC can significantly save the cost of radio frequency circuits.     

Combining Atomic Actions

A combining network can combine concurrently issued operations on the same variable and fan out responses to the processes that issued the operations. Combining networks have been proposed with the goals of reducing message traffic, hotspots within the network, and contention for shared variables. This paper extends the class of operations that can be combined to include operations from flat atomic actions. We describe a class of networks called isotach networks and show that isotach networks can correctly combine operations from different flat atomic actions. Also we show that isotach combining networks can combine pipelined operations without sacrificing sequential consistency.     

Classifying Facial Actions

The Facial Action Coding System (FACS) [23] is an objective method for quantifying facial movement in terms of component actions. This system is widely used in behavioral investigations of emotion, cognitive processes, and social interaction. The coding is presently performed by highly trained human experts. This paper explores and compares techniques for automatically recognizing facial actions in sequences of images. These techniques include analysis of facial motion through estimation of optical flow; holistic spatial analysis, such as principal component analysis, independent component analysis, local feature analysis, and linear discriminant analysis; and methods based on the outputs of local filters, such as Gabor wavelet representations and local principal components. Performance of these systems is compared to naive and expert human subjects. Best performances were obtained using the Gabor wavelet representation and the independent component representation, both of which achieved 96 percent accuracy for classifying 12 facial actions of the upper and lower face. The results provide converging evidence for the importance of using local filters, high spatial frequencies, and statistical independence for classifying facial actions.     

Astrophysical effects of space-time foam

During the quantum stage, the space-time had a foamlike structure. As the Universe cools down, the foam structure tempers and does not disappear, therefore the Friedmann model represents only an idealization. We show that local inhomogeneity of the foamy structure should be observed as a Dark Matter (DM) halo around point sources. Such a halo extends up to the scales where the foamy structure averages to homogeneity. We also show that scattering of photons from a point source on the foamlike structure gives rise to the origin of a diffuse component of radiation whose distribution traces that of DM.     

Quintessential phenomena in higher-dimensional space-time

Higher-dimensional cosmology provides a natural setting to treat, at a classical level, the cosmological effects of vacuum energy. Here we discuss two situations: in the first case we start with an ordinary matter field without any equation of state and end up with a generalized Chaplygin type of gas apparently as a consequence of extra dimensions. In the second case we introduce a priori a Chaplygin type of gas to study quintessential phenomena in higher-dimensional spacetime. The first case suffers from the disqualification that no dimensional reduction occurs, which is, however, rectified in the second case. Both models show the sought-after feature of occurrence of a flip in the expansion rate. It is observed that with the increase of dimensions the occurrence of a flip is delayed in both models, more in line with current observational requirements. Interestingly, we see that, depending on some initial conditions, our model admits QCDM, ΛCDM and also phantom-like evolution within a unified framework. Our solutions are general in nature in the sense that when the extra dimensions are switched off, the known 4D model is recovered. A correspondence to a recent work of Guo et al. on a quiessence-likemodel is also found.     

Fragment oriented molecular shapes

Molecular shape is an important concept in drug design and virtual screening. Shape similarity typically uses either alignment methods, which dynamically optimize molecular poses with respect to the query molecular shape, or feature vector methods, which are computationally less demanding but less accurate. The computational cost of alignment can be reduced by pre-aligning shapes, as is done with the Volumetric-Aligned Molecular Shapes (VAMS) method. Here, we introduce and evaluate fragment oriented molecular shapes (FOMS), where shapes are aligned based on molecular fragments. FOMS enables the use of shape constraints, a novel method for precisely specifying molecular shape queries that provides the ability to perform partial shape matching and supports search algorithms that function on an interactive time scale. When evaluated using the challenging Maximum Unbiased Validation dataset, shape constraints were able to extract significantly enriched subsets of compounds for the majority of targets, and FOMS matched or exceeded the performance of both VAMS and an optimizing alignment method of shape similarity search.     

Computation of natural frequencies and mode shapes of arch dams as an inverse problem

In this paper, a procedure is developed which can be used to identify the natural frequencies and natural modes of an Arch-Dam in a vacuum, from forced vibration testing data of partially filled reservoir, throughout removing the effect of hydrodynamic, by using an effective algorithm. The resonance frequency and the resonance mode of the dam–reservoir system have been computed from the in situ tested data. The solution strategy is verified by studying the dynamic response of simple structures, like beam with the fluid interaction effect taken into account, as the analytical results of its modal properties were available for comparison. The hydrodynamic pressure of the reservoir is calculated using the boundary element method. In the inverse problem procedure, the calculated resonance replaces the measured resonance, which has been obtained practically throughout the in situ testing. In this paper the strategies are extended to analyse the dynamic beam–fluid interaction problem with compressible water. The results derived by solving an inverse problem are compared with the exact analytical responses of the beam.     

Learning to Take Actions

We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. We then identify a class of rule-based action strategies for which polynomial time learning is possible. The representation of strategies is a generalization of decision lists; strategies include rules with existentially quantified conditions, simple recursive predicates, and small internal state, but are syntactically restricted. We also study the learnability of hierarchically composed strategies where a subroutine already acquired can be used as a basic action in a higher level strategy. We prove some positive results in this setting, but also show that in some cases the hierarchical learning problem is computationally hard.