Residential high-rise buildings in São Paulo: aspects related to the adequacy to the occupant`s needs

This paper analyzes the production of apartment buildings for the middle-income segment in the city of So Paulo, Brazil, from a historical perspective. Tracing the response to the occupants` needs, the focus is on family profiles and their demands, the relationship between architectural design and marketing, and satisfaction levels of current users. The paper begins with a brief historical overview of how apartment buildings have evolved over the past eight decades, highlighting the consolidation of the tripartite model. Next, it analyzes family profiles and their current needs, which would call for a redesign of domestic space. From a different angle, it shows how the real-estate market reacts to this situation, namely by introducing minor changes in the domestic space that are closely linked to major investments in marketing. This leads to a discussion on the quality of recent architectural designs in light of Post-Occupancy Evaluation (POE) case studies, which corroborate the tendencies previously outlined. The conclusions drawn from the POEs suggest that the market should establish a closer and deeper relationship between the assessment of the human behavior in the domestic space and the architectural quality of homes as a means of increasing satisfaction levels and improving design performance.

Relaxation evoked by extracellular Ca(2+) in rat aorta is nerve-independent and involves sarcoplasmic reticulum and L-type Ca(2+) channell

The perivascular nerve network expresses a Ca(2+) receptor that is activated by high extracellular Ca(2+) concentrations and causes vasorelaxation in resistance arteries. We have verified the influence of perivascular nerve fibers on the Ca(2+)-induced relaxation in aortic rings. To test our hypothesis, either pre-contracted aortas isolated from rats after sensory denervation with capsaicin or aortic rings acutely denervated with phenol were stimulated to relax with increasing extracellular Ca(2+) concentration. We also studied the role of the endothelium on the Ca(2+)-induced relaxation, and we verified the participation of endothelial/nonendothelial nitric oxide and cyclooxygenise-arachidonic acid metabolites. Additionally, the role of the sarcoplasmic reticulum, K(+) channels and L-type Ca(2+) channels on the Ca(2+)-induced relaxation were evaluated. We have observed that the Ca(2+)-induced relaxation is completely nerve independent, and it is potentiated by endothelial nitric oxide (NO). In endothelium-denuded aortic rings, indomethacin and AH6809 (PGF(2 alpha) receptor antagonist) enhance the relaxing response to Ca(2+). This relaxation is inhibited by thapsigargin and verapamil, while was not altered by tetraethylammonium. In conclusion, we have shown that perivascular nervous fibers do not participate in the Ca(2+)-induced relaxation, which is potentiated by endothelial NO. In endothelium-denuded preparations, indomethacin and AH6809 enhance the relaxation induced by Ca(2+). The relaxing response to Call was impaired by verapamil and thapsigargin, revealing the importance of L-type Ca(2+) channels and sarcoplasmic reticulum in this response. (c) 2008 Elsevier Inc. All rights reserved.

Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.

A Fibred Tableau Calculus for Modal Logics of Agents

In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibring} methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (\emph{graph} $\&$ \emph{path}), with the help of a scenario (The Friend's Puzzle). Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system \KEM. We conclude with a discussion on \KEM's features.

Trades and Graphs

The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.

Packing complete multipartite graphs with 4-cycles

In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.

Decomposition of complete tripartite graphs into gregarious 4-cycles

A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.

THE_PM_BOK_CODE

This paper puts forward the argument that PM is spreading because it is a well adapted collection of memes, and that the Project Management Institute (PMI®) Guide to the Project Management Body of Knowledge (PMBOK® Guide) version of project management (the PM_BOK Code) has more to do with the appearance of a capability for productivity than it does with actual productivity. It suggests that project management is evolving in a toxic manner, and that corporations will reap more benefit from it than people. The paper concludes with a call for a reformation of the PMBOK®.

Young Labor demands better deal for Aborigines - Labour Day 1965 Brisbane Australia

Young Labor Association float during the Labour Day procession in Brisbane, Australia 1965. Placards call for voting rights for Aborigines, more education facilities and award wages.

Organizational behaviour: An emotions perspective

This opening chapter provides an overview of organizational behavior theory and research and the paradigms that have dominated the field to date. Running through a discussion of rational notions of organizational behavior, to concepts of bounded rationality and most recently the call for bounded emotionality perspectives, we identify for the reader what a bounded emotionality perspective adds to the understanding of organizations. We then provide an overview of the remaining chapters in the book and how they contribute to the book's objectives.

Twisted quantum affine superalgebra Uq[gl(m|n)(2)] and new Uq[osp(m|n)] invariant R-matrices

The minimal irreducible representations of U-q[gl(m|n)], i.e. those irreducible representations that are also irreducible under U-q[osp(m|n)] are investigated and shown to be affinizable to give irreducible representations of the twisted quantum affine superalgebra U-q[gl(m|n)((2))]. The U-q[osp(m|n)] invariant R-matrices corresponding to the tensor product of any two minimal representations are constructed, thus extending our twisted tensor product graph method to the supersymmetric case. These give new solutions to the spectral-dependent graded Yang-Baxter equation arising from U-q[gl(m|n)((2))], which exhibit novel features not previously seen in the untwisted or non-super cases.

Popper and his Commentators on the Discovery of Neptune: a close shave for the Law of Gravitation?

Knowledge of residual perturbations in the orbit of Uranus in the early 1840s did not lead to the refutation of Newton's law of gravitation but instead to the discovery of Neptune in 1846. Karl Popper asserts that this case is atypical of science and that the law of gravitation was at least prima facie falsified by these perturbations. I argue that these assertions are the product of a false, a priori methodological position I call, 'Weak Popperian Falsificationism' (WPF). Further, on the evidence the law was not prima facie false and was not generally considered so by astronomers at the time. Many of Popper's commentators (Kuhn, Lakatos, Feyerabend and others) presuppose WPF and their views on this case and its implications for scientific rationality and method suffer from this same defect.

Common multiples of complete graphs

A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.

On the threshold of forgetting: Amnesiac identities and the Brazilian capital

Centuries after Locke asserted the importance of memory to identity, Freudian psychology argued that what was forgotten was of equal importance as to what was remembered. The closing decades of the nineteenth century saw a rising interest in the nature of forgetting, resulting in a reassessment and newfound distrust of the long revered faculty of memory. The relationship between memory and identity was inverted, seeing forgetting also become a means for forging identity. This newfound distrust of memory manifested in the writings of Nietzsche who in 1874 called for society to learn to feel unhistorically and distance itself from the past - in what was essentially tantamount to a cultural forgetting. Following the Nietzschean call, the architecture of Modernism was also compelled by the need to 'overcome' the limits imposed by history. This paper examines notions of identity through the shifting boundaries of remembering and forgetting, with particular reference to the construction of Brazilian identity through the ‘repression’ of history and memory in the design of the Brazilian capital. Designed as a forward-looking modernist utopia, transcending the limits imposed by the country's colonial heritage, the design for Brasilia exploited the anti-historicist agenda of modernism to emancipate the country from cultural and political associations with the Portuguese Empire. This paper examines the relationship between place, memory and forgetting through a discussion of the design for Brasilia.

XSophe-Sophe-XeprView (R). A computer simulation software suite (v. 1.1.3) for the analysis of continuous wave EPR spectra

The XSophe-Sophe-XeprView((R)) computer simulation software suite enables scientists to easily determine spin Hamiltonian parameters from isotropic, randomly oriented and single crystal continuous wave electron paramagnetic resonance (CW EPR) spectra from radicals and isolated paramagnetic metal ion centers or clusters found in metalloproteins, chemical systems and materials science. XSophe provides an X-windows graphical user interface to the Sophe programme and allows: creation of multiple input files, local and remote execution of Sophe, the display of sophelog (output from Sophe) and input parameters/files. Sophe is a sophisticated computer simulation software programme employing a number of innovative technologies including; the Sydney OPera HousE (SOPHE) partition and interpolation schemes, a field segmentation algorithm, the mosaic misorientation linewidth model, parallelization and spectral optimisation. In conjunction with the SOPHE partition scheme and the field segmentation algorithm, the SOPHE interpolation scheme and the mosaic misorientation linewidth model greatly increase the speed of simulations for most spin systems. Employing brute force matrix diagonalization in the simulation of an EPR spectrum from a high spin Cr(III) complex with the spin Hamiltonian parameters g(e) = 2.00, D = 0.10 cm(-1), E/D = 0.25, A(x) = 120.0, A(y) = 120.0, A(z) = 240.0 x 10(-4) cm(-1) requires a SOPHE grid size of N = 400 (to produce a good signal to noise ratio) and takes 229.47 s. In contrast the use of either the SOPHE interpolation scheme or the mosaic misorientation linewidth model requires a SOPHE grid size of only N = 18 and takes 44.08 and 0.79 s, respectively. Results from Sophe are transferred via the Common Object Request Broker Architecture (CORBA) to XSophe and subsequently to XeprView((R)) where the simulated CW EPR spectra (1D and 2D) can be compared to the experimental spectra. Energy level diagrams, transition roadmaps and transition surfaces aid the interpretation of complicated randomly oriented CW EPR spectra and can be viewed with a web browser and an OpenInventor scene graph viewer.