Most philosophers believe that a unified philosophical account of mental and non -mental actions is possible. This article presents two arguments indicating that in fact it is not possible. The first one says that thinking is not an activity. Its formulation, however, is exposed to significant difficulties. The second argument avoids these difficulties and puts forward a different, though sometimes erroneously identified, thesis that mental and non-mental actions differ significantly, and therefore one theory should not be expected to include both phenomena. Acceptance of this result sheds new light on the problems associated with the language of thought and gives promise to a new answer to the question “What is Le Penseur doing?”
P.F. Strawson and J.L. Austin approach the problem of other minds from different perspectives. Peter Strawson looks at this problem from the perspective of descriptive metaphysics, which largely disregards the concrete situations in which we use mental language. John Austin, on the other hand, believes that to understand what is happening in such situations holds the key to solving the former problem. However, as it turns out, the considerations of both authors in the key fragments rely on similar observations. In addition, Austin’s perspective, which looks at the language from the point of view of its usage, makes it possible to formulate an answer to the Strawson’s critics. This does not exclude the possibility of agreeing with Strawson on the primacy of the reference function of language, if we understand it properly. Ultimately, Strawson and Austin’s approaches do not compete, but complement each other.
The paper presents Improved Adaptive Arithmetic Coding algorithm for application in future video compression technology. The proposed solution is based on the Context-based Adaptive Binary Arithmetic Coding (CABAC) technique and uses the authors mechanism of symbols probability estimation that exploits Context-Tree Weighting (CTW) technique. This paper proposes the version of the algorithm, that allows an arbitrary selection of depth D of context trees, when activating the algorithm in the framework of the AVC or HEVC video encoders. The algorithm has been tested in terms of coding efficiency of data and its computational complexity. Results showed, that depending on depth of context trees from 0.1% to 0.86% reduction of bitrate is achieved, when using the algorithm in the HEVC video encoder and 0.4% to 2.3% compression gain in the case of the AVC. The new solution increases complexity of entropy encoder itself, however, this does not cause an increase of the complexity of the whole video encoder.
On the 14th of February, 2015, a huge fire broke out on Łazienkowski Bridge; a five span bridge, 423 m long and 28 m wide, built in the years 1972-74. It was a fully steel structure with four plate girders and orthotropic deck. The fire started under the first span during the replacement of wooden service decks. The next day, the Department of Bridges of the Warsaw University of Technology was designated to conduct an expertise material investigation, geometrical verification, and FEM model analysis. The subject of this paper concentrates on geometrical issues. The main difficulty of this task was the lack of full reference data regarding the bridge's original structure. The old design was incomplete and there was no actual surveying results for the undamaged structure. As a conclusion, some remarks focused on surveying measurements and on the final decision regarding this bridge are given. It was eventually exchanged into a brand new one and put into public use on the 28th of October, 2015.
Optimization of encoding process in video compression is an important research problem, especially in the case of modern, sophisticated compression technologies. In this paper, we consider HEVC, for which a novel method for selection of the encoding modes is proposed. By the encoding modes we mean e.g. coding block structure, prediction types and motion vectors. The proposed selection is done basing on noise-reduced version of the input sequence, while the information about the video itself, e.g. transform coefficients, is coded basing on the unaltered input. The proposed method involves encoding of two versions of the input sequence. Further, we show realization proving that the complexity is only negligibly higher than complexity of a single encoding. The proposal has been implemented in HEVC reference software from MPEG and tested experimentally. The results show that the proposal provides up to 1.5% bitrate reduction while preserving the same quality of a decoded video.