A real-time hybrid neuron network for highly parallel cognitive systems

For comprehensive understanding of how neurons communicate with each other, new tools need to be developed that can accurately mimic the behaviour of such neurons and neuron networks under 'real-time' constraints. In this paper, we propose an easily customisable, highly pipelined, neuron network design, which executes optimally scheduled floating-point operations for maximal amount of biophysically plausible neurons per FPGA family type. To reduce the required amount of resources without adverse effect on the calculation latency, a single exponent instance is used for multiple neuron calculation operations. Experimental results indicate that the proposed network design allows the simulation of up to 1188 neurons on Virtex7 (XC7VX550T) device in brain real-time yielding a speed-up of x12.4 compared to the state-of-the art

Regulatory Taking: A Contract Approach

This Article begins by defining the parameters of the fifth amendment\u27s taking clause. The Article then reviews the various tests used in determining whether governmental action constitutes a taking, and discusses the recent Supreme Court decisions within the framework of case law as it has evolved since the Court\u27s 1922 landmark decision, Pennsylvania Coal Co. v. Mahon. Finally, the Article suggests a formula based on well-established contract principles for analyzing the impact of land use regulation on private property interests

Time-lapsing biodiversity: an open source method for measuring diversity changes by remote sensing

Understanding biodiversity changes in time is crucial to promptly provide management practices against diversity loss. This is overall true when considering global scales, since human-induced global change is expected to make significant changes on the Earth's biota. Biodiversity management and planning is mainly based on field observations related to community diversity, considering different taxa. However, such methods are time and cost demanding and do not allow in most cases to get temporal replicates. In this view, remote sensing can provide a wide data coverage in a short period of time. Recently, the use of Rao's Q diversity as a measure of spectral diversity has been proposed in order to explicitly take into account differences in a neighbourhood considering abundance and relative distance among pixels. The aim of this paper was to extend such a measure over the temporal dimension and to present an innovative approach to calculate remotely sensed temporal diversity. We demonstrated that temporal beta-diversity (spectral turnover) can be calculated pixel-wise in terms of both slope and coefficient of variation and further plotted over the whole matrix / image. From an ecological and operational point of view, for prioritisation practices in biodiversity protection, temporal variability could be beneficial in order to plan more efficient conservation practices starting from spectral diversity hotspots in space and time. In this paper, we delivered a highly reproducible approach to calculate spatio-temporal diversity in a robust and straightforward manner. Since it is based on open source code, we expect that our method will be further used by several researchers and landscape managers

Comparing phoneme frequency, age of acquisition, and loss in aphasia:Implications for phonological universals

Phonological complexity may be central to the nature of human language. It may shape the distribution of phonemes and phoneme sequences within languages, but also determine age of acquisition and susceptibility to loss in aphasia. We evaluated this claim using frequency statistics derived from a corpus of phonologically transcribed Italian words (phonitalia, available at phonitalia,org), rankings of phoneme age of acquisition (AoA) and rate of phoneme errors in patients with apraxia of speech (AoS) as an indication of articulatory complexity. These measures were related to cross-linguistically derived markedness rankings. We found strong correspondences. AoA, however, was predicted by both apraxic errors and frequency, suggesting independent contributions of these variables. Our results support the reality of universal principles of complexity. In addition they suggest that these complexity principles have articulatory underpinnings since they modulate the production of patients with AoS, but not the production of patients with more central phonological difficulties

VIII Encuentro de Docentes e Investigadores en Historia del Diseño, la Arquitectura y la Ciudad

Acta de congresoLa conmemoración de los cien años de la Reforma Universitaria de 1918 se presentó como una ocasión propicia para debatir el rol de la historia, la teoría y la crítica en la formación y en la práctica profesional de diseñadores, arquitectos y urbanistas. En ese marco el VIII Encuentro de Docentes e Investigadores en Historia del Diseño, la Arquitectura y la Ciudad constituyó un espacio de intercambio y reflexión cuya realización ha sido posible gracias a la colaboración entre Facultades de Arquitectura, Urbanismo y Diseño de la Universidad Nacional y la Facultad de Arquitectura de la Universidad Católica de Córdoba, contando además con la activa participación de mayoría de las Facultades, Centros e Institutos de Historia de la Arquitectura del país y la región. Orientado en su convocatoria tanto a docentes como a estudiantes de Arquitectura y Diseño Industrial de todos los niveles de la FAUD-UNC promovió el debate de ideas a partir de experiencias concretas en instancias tales como mesas temáticas de carácter interdisciplinario, que adoptaron la modalidad de presentación de ponencias, entre otras actividades. En el ámbito de VIII Encuentro, desarrollado en la sede Ciudad Universitaria de Córdoba, se desplegaron numerosas posiciones sobre la enseñanza, la investigación y la formación en historia, teoría y crítica del diseño, la arquitectura y la ciudad; sumándose el aporte realizado a través de sus respectivas conferencias de Ana Clarisa Agüero, Bibiana Cicutti, Fernando Aliata y Alberto Petrina. El conjunto de ponencias que se publican en este Repositorio de la UNC son el resultado de dos intensas jornadas de exposiciones, cuyos contenidos han posibilitado actualizar viejos dilemas y promover nuevos debates. El evento recibió el apoyo de las autoridades de la FAUD-UNC, en especial de la Secretaría de Investigación y de la Biblioteca de nuestra casa, como así también de la Facultad de Arquitectura de la UCC; va para todos ellos un especial agradecimiento

Automatically fused instructions: algorithms for the customization of the instruction, set of a recon?gurable architecture

In this dissertation, we address the design of algorithms for the automatic identi?cation and selection of complex application-speci?c instructions used to speed up the execution of applications on recon?gurable architectures. The computationally intensive portions of an application are analyzed and partitioned in segments of code to execute in software and segments of code to atomically execute in hardware as single instructions. These instructions extend the instruction-set of the recon?gurable architecture in use and they are application-speci?c. The main goal of the work presented in this dissertation is the identi?cation of application-speci?c instructions with multiple-inputs and multiple-outputs. The instructions are generated in two consecutive steps: ?rst, the application is partitioned in non-overlapping single-output instructions and, then, these instructions are further combined in multiple-output instructions following different policies. We propose different algorithms for the partitioning of an application in both single-output and multiple-output instructions. A number of approaches have been proposed in both academia and industry for extending a given instruction-set with application-speci?c instructions to speed up the execution of applications. The proposed solutions usually have a high computational complexity. The algorithms proposed in this dissertation provide quality solutions and have linear computational complexity in all cases but one, in which case the proposed solution is optimal. Additionally, compared with existing approaches, the new application-speci?c instructions are atomically executable in hardware by construction, whereas existing approaches increase the computational complexity by testing each generated instructions. The proposed algorithms are tested on the Molen recon?gurable architecture. The experimental results on well-known benchmarks show that a considerable speed up can be obtained in the execution of an application by using the application-speci?c instructions identi?ed by the proposed algorithms.Computer EngineeringElectrical Engineering, Mathematics and Computer Scienc