Miracle-dz/UniFAR-FTUs huggingface dataset:
Training Synaptic Delays in a Recurrent Neural Network

Algorithms for training recurrent neural networks (RNN), both with and without time delays, to perform certain tasks are notorious as a major computer resources consumers. These algorithms adapt a set of network parameters for performing certain tasks typical for the network's architecture. The addition of the possibility for synaptic delays modiication enlarges the parameter space of the network, thus making the training task even more demanding and the network more sensitive to the choice of parameters. The main incentives for adding this possibility are rooted in our knowledge about biological nets as well as in practical and applicable reasons, ranging from enhancing generalization to enhancing network capabilities. In this work we show how addition of time delay parameters results in incrementing both network capacity and capabilities and enabling the use of smaller and more competent nets for the same tasks. In addition, the current work introduces several methods to accomplish recurrent neural networks training, optimizing both the synaptic time delays and the weights. Several training methods are evaluated. The most eecient one, based on adaptive simulated an-ii nealing, enables training of recurrent neural networks with synaptic time delays even on a low-end (Personal Computer) platform. The performance of the various training methods and the capabilities of recurrent neural networks with time delays as a whole are examined via extensive computer simulations using typical benchmark tasks. In addition, special new conngurations of recurrent neural networks with time delays, modiications of the general connguration, are presented and examined together with special training algorithms.
Domain Specific Languages for High Performance Computing

[ANGLES] High Performance Computing (HPC) relies completely on complex parallel, heterogeneus architectures and distributed systems which are hard and error-prone to exploit, even for HPC specialists. Further and further knowledge on runtime systems, dependency tracking, memory transaction optimization and many other techniques are a must-have requirement to produce high quality software capable of exploiting every single bit of power an HPC system has to other. On the other hand, domain experts like geologists or biologists are usually not technology-aware enough to produce the best software for these complex systems. Nowadays, the only way to successfully exploit an HPC system requires that computer and domain experts work closely towards producing applications to solve domain problems. Domain experts have the knowledge on the domain algorithms, while computer experts know how to ciently map these algorithms on HPC systems. This project proposes a framework that eases most of the processes related to the production of Domain Specific Languages (DSLs) that run on top of accelerator-based heretogeneus architectures. By using DSLs, domain experts can develop their applications using their own high level language, focusing only on their hard-enough issues. Meanwhile, computer experts stay only improving the implementation of these DSLs to make the most out of an HPC platform. This way, we keep each expert focused as much as possible on its natural domain of expertise.
News document summarization driven by user-generated content

The outstanding growth of the Internet has made available to analysts a huge and increasing amount of Web documents (e.g., news articles) and user-generated content (e.g., social network posts) coming from social networks and online communities that are worth considering together. On one hand, the need of novel and more effective approaches to summarize Web document collections makes the application of data mining techniques established in different research contexts more and more appealing. On the other hand, to generate appealing summaries the data mining and knowledge discovery process cannot disregard the major Web users’ interests. This chapter presents a novel news document summarization system, namely NeDocS, that focuses on generating succinct, not redundant, yet appealing summaries by means of a data mining and knowledge discovery process driven by messages posted on social networks. NeDocS retrieves from the Web and summarizes news document collections by exploiting (1) frequent itemsets, i.e., recurrences that frequently occur in the analyzed data, to capture most significant correlations among terms and (2) a sentence relevance evaluator that takes into account term significance in a collection of social network posts ranging over the same news topics. This approach allows not disregarding sentences whose terms rarely occur in the news collection but are deemed relevant by Web users. To the best of our knowledge, the combined usage of frequent itemsets and user-generated content in news document summarization is an appealing research direction that has never been investigated so far. Experiments performed on real collections of news articles and driven by on-topic Twitter posts show the effectiveness of the proposed approach.
Ontologie-basierter Mediator zum Zugriff auf heterogene und verteilte Lerninhalte

An integrated circuit chip cooling structure is constructed to include a top plate member and a bottom plate member bonded together and defining a vapor chamber between said top and bottom plate member, the top and bottom plate members each having a plurality of through holes connecting members supported between the top and bottom plate members, each connecting member having a center through hole, a heat sink bonded to the top surface of the top plate member, the heat sink having a plurality of mounting holes for connection to the through hole of each connecting member and respective mounting holes of an external circuit board by respective screw bolts, and an internally sintered metal capillary wick provided within the vapor chamber.
An improved medium access control protocol for real-time applications in WLANs and its firmware development

The IEEE 802.11 Wireless Local Area Network (WLAN), commonly known as Wi-Fi, has emerged as a popular internet access technology and researchers are continuously working on improvement of the quality of service (QoS) in WLAN by proposing new and e cient schemes. Voice and video over Internet Protocol (VVoIP) applications are becoming very popular in Wi-Fi enabled portable/handheld devices because of recent technological advancements and lower service costs. Di erent from normal voice and video streaming, these applications demand symmetric throughput for the upstream and downstream. Existing Wi-Fi standards are optimised for generic internet applications and fail to provide symmetric throughput due to tra c bottleneck at access points . Performance analysis and benchmarking is an integral part of WLAN research, and in the majority of the cases, this is done through computer simulation using popular network simulators such as Network Simulator 2 (NS-2) or OPNET. While computer simulation is an excellent approach for saving time and money, results generated from computer simulations do not always match practical observations. This is why, for proper assessment of the merits of a proposed system in WLAN, a trial on a practical hardware platform is highly recommended and is often a requirement. In this thesis work, with a view to address the above mentioned challenges for facilitating VoIP and VVoIP services over Wi-Fi, two key contributions are made: i) formulating a suitable medium access control (MAC) protocol to address symmetric tra c scenario and ii) rmware development of this newly devised MAC protocol for real WLAN hardware. The proposed solution shows signi cant improvements over existing standards by supporting higher number of stations with strict QoS criteria. The proposed hardware platform is available o -the-shelf in the market and is a cost e ective
Diseño de videojuegos clásicos con Scratch

The current work is focused in the development of five of the greatest video games in history (Pong, Space Invaders, Asteroids, Pac Man and Donkey Kong) using the Scratch programming language. After their development, those video games will be included in the web site of the Computing Museum of the Escola Tècnica Superior d’Enginyeria Informàtica with the objective of demonstrate the power of the Scratch language and encourage more users to use it to learn programming in a didactic and funny way. First of all will be analyzed the history behind those great videogames about their origins, and then the basis of Scratch programming language will be explained and adapted to the creation of video games in a easy way using some tools provided for it. Finally, the development procedure of the five videogames mentioned above will be explained in detail to show Scratch users how to adapt classic video games through a current programming language.
A novel highway background generate approach

The highway background generate is essential for highway vehicle detecting and analyzing. A novel background generate algorithm is proposed. The statistical information of pixels is collected to initialize the background. Three further optimization steps, the continuous luminance compensation, the spatial disturbance elimination and the inertial factor utilization, are exerted. Obstacle, such as environment light change, can be effectively overcome. A large number of images taken from highway have been tested. And our algorithm proves to be robust and efficient.
The Trust-Based Interactive Partially Observable Markov Decision Process

Abstract : Cooperative agent systems are designed so that each is working toward the same common good. The problem is that software systems are complex and can be subverted by an adversary to either break the system or potentially worse, create sneaky agents who are willing to cooperate when the stakes are low and take selfish, greedy actions when the rewards rise. This research focuses on the ability of a group of agents to reason about the trustworthiness of each other and make optimal decisions about whether to cooperate. A TI-POMDP is developed to model the trust interactions between agents, enabling the agents to select the best course of action from the current state. The TI-POMDP is a novel approach to multiagent cooperation based on an I-POMDP augmented with trust relationships. Experiments demonstrate the TI-POMDP's ability to accurately track the trust levels of agents with hidden agendas, providing the agents the information needed to make decisions based on their level of trust and model of the environment. On average, agents achieved rewards 3.8 times higher using the TI-POMDP model compared to a trust vector model.
A Practical Authentication Scheme for In-Network Programming in Wireless Sensor Networks

In-network programming has become a popular feature in sensor networks deployments, making it easy to update remotely the code running in sensor nodes. TinyOS includes Deluge as its default in-network programming system, but unfortunately it does not incorporate any security mechanism that ensures program authenticity. This makes it easy for an attacker to disseminate malicious code in the network and gain complete control or disrupt its functionality. We provide a protocol that yields source authentication in the group setting like a public-key signature scheme, only with signature and verification times much closer to those of a MAC. We show how Deluge can be augmented with our solution to give a secure and practical in-network programming system. Our implementation on the Mica2 platform allowed us to test the performance of this system on a real network of motes and prove its eciency.
Multi-Core Fiber for High-Capacity Spatially-Multiplexed Transmission [an abstract of dissertation and a summary of dissertation review]

Title Multi-Core Fiber for High-Capacity Spatially-Multiplexed Transmission [an abstract of dissertation and a summary of dissertation review] Author(s) 林, 哲也 Issue Date 2013-09-25 Doc URL http://hdl.handle. net/2115/53805 Rights(URL) http://creativecommons.org/licenses/by-nc-sa/2.1/jp/ Type theses (doctoral abstract and summary of review) Additional Information There are other files related to this item in HUSCAP. Check the above URL. File Information Tetsuya_Hayashi_review. pdf (「審査の要旨」)
Java is not type-safe

Section 1. The problem A concrete example. Consequences Can an applet exploit type-spoofing? Section 2. How does this happen? Section 3. How can it be fixed? One class per FQN Run-time check Check for type-equivalence not name-equivalence Section 4. Conclusion Bibliography Remaining code Last modified date: Fri Aug 15 19:05:33 1997 Added comment on method-table generation. Added commentary on consequences of fix for method-table generation.
Extracting knowledge from within design processes: an emerging issue for IS research

One of the main purposes of design science research is to extract at least a part of the knowledge which is produced by, or is hidden in, the design process, and that would risk to remain inaccessible to ex-post field research. During design processes, in fact, significant amounts of knowledge are usually gathered, produced and used, in different forms such as, for example, descriptions, explanations, habits, worries, prejudices, procedures or warnings; but this heritage is somewhat fragile. In effect, since the natural purpose of designing is to build something that works, design practitioners tend to consider a huge part of the knowledge produced during the process as a sort of byproduct, which is not worth significant efforts to make it deliverable, shareable or testable. Moreover, some of the actors may be willing to deliberately hide or forget some aspects of the process. As a consequence, after the design process is completed and the artifact is implemented, there is often a rapid decay of the possibilities to access much of the knowledge that was tacitly or explicitly developed during the process. Also to overcome such problems, we suggest that academic research should enhance its active involvement in the design of socio-technical systems. In our study, thanks to a model built on evolutionary epistemology, we identified 8 categories of knowledge goals for design science research. On the basis of these 8 types of possible contributions to resilient knowledge building from within the design process, we propose a sort of guideline for academic researchers engaged in design challenges, independently from the design methods or techniques they adopt, independently from what they are contributing to build, and even independently from the actual success of the final artifact. We sought to demonstrate that design research “from within” may result not only in successful innovations, such as new information systems, but also in a decisive boost to the learning performances of our scholarly community.
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems

In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time frame than available resource capacity will allow, and hence decisions must be made about which tasks should be included in the schedule and which should be excluded. We adopt a controlled, iterative repair search approach, and focus on improving the results of an initial priority-driven solution generation procedure. Central to our approach is a new retraction heuristic, termed max-flexibility, which is responsible for identifying which tasks to (temporarily) retract from the schedule for reassignment in an effort to incorporate additional tasks into the schedule. The max-flexibility heuristic chooses those tasks that have maximum flexibility for assignment within their feasible windows. We empirically evaluate the performance of max-flexibility using problem data and the basic scheduling procedure from a fielded airlift mission scheduling application. We show that it produces better improvement results than two contention-based retraction heuristics, including a variant of min-conflicts L Minton et al., 1992, with significantly less search and computational cost.
Musique et implant cochléaire. Prise en charge de groupe chez l’adulte

Notre etude visait a accompagner les patients implantes cochleaires, pour qui l'ecoute de la musique etait devenue une plainte, dans la redecouverte voire decouverte de la musique, et de les guider dans la reappropriation du plaisir de l'ecoute musicale. Methode : Les 8 seances de groupe, associees a des entrainements quotidiens progressifs, se sont deroulees de Septembre a Fevrier 2018, au sein du CHU de Rouen. Resultats : Les resultats obtenus mettent en avant une amelioration des competences musicales, qui se repercute egalement sur les competences langagieres et communicationnelles des patients. Les benefices de cet entrainement se sont repercutes sur l'appreciation musicale et sur la qualite de vie des participants. Conclusion : II est interessant que les orthophonistes proposent des seances de groupe dediees a un travail musical a leurs patients adultes implantes cochleaires pour lesquels emerge une plainte de la musique, qu'ils soient atteints aussi bien de surdite congenitale que de surdite post- linguale. Il est cependant essentiel de souligner que la motivation et l'interet que le patient porte a la musique sont des elements indispensables au bon fonctionnement d'une telle prise en charge.
Software-oriented distributed shared cache management for chip multiprocessors

This thesis proposes a software-oriented distributed shared cache management approach for chip multiprocessors (CMPs). Unlike hardware-based schemes, our approach offloads the cache management task to trace analysis phase, allowing flexible management strategies. For single-threaded programs, a static 2D page coloring scheme is proposed to utilize oracle trace information to derive an optimal data placement schema for a program. In addition, a dynamic 2D page coloring scheme is proposed as a practical solution, which tries to approach the performance of the static scheme. The evaluation results show that the static scheme achieves 44.7% performance improvement over the conventional shared cache scheme on average while the dynamic scheme performs 32.3% better than the shared cache scheme. For latency-oriented multithreaded programs, a pattern recognition algorithm based on the K-means clustering method is introduced. The algorithm tries to identify data access patterns that can be utilized to guide the placement of private data and the replication of shared data. The experimental results show that data placement and replication based on these access patterns lead to 19% performance improvement over the shared cache scheme. The reduced remote cache accesses and aggregated cache miss rate result in much lower bandwidth requirements for the on-chip network and the off-chip main memory bus. Lastly, for throughput-oriented multithreaded programs, we propose a hint-guided data replication scheme to identify memory instructions of a target program that access data with a high reuse property. The derived hints are then used to guide data replication at run time. By balancing the amount of data replication and local cache pressure, the proposed scheme has the potential to help achieve comparable performance to best existing hardware-based schemes. Our proposed software-oriented shared cache management approach is an effective way to manage program performance on CMPs. This approach provides an alternative direction to the research of the distributed cache management problem. Given the known difficulties (e.g., scalability and design complexity) we face with hardware-based schemes, this software-oriented approach may receive a serious consideration from researchers in the future. In this perspective, the thesis provides valuable contributions to the computer architecture research society.
Keyword-based Search for Hybrid XML-Relational Databases

In recent years, keyword-based search has been suggested to be applied instead of query-language based search for Relational Databases and XML Databases. In this paper, we propose a new method of keyword-based search for a Hybrid database, the Relational Database allowing XML data format. Firstly, we analyze the ability of keyword-based search for XML Database and traditional Relational Databases and clarify that the results of keyword-based search on each system are defective. Next, we propose a method of keyword-based search for Hybrid XML-Relational Databases and explain that better results are obtained in the Hybrid system.
Embedded Systems with ARM Cortex-M3 Microcontrollers in Assembly Language and C

The second edition includes three new topics, including floating-point programming (FPU), interfacing with external HD44780-compatible LCD, and digital signal processing (DSP). The inclusion of FPU and DSP expands the coverage of this book to Cortex-M4 and Cortex-M7 processors. The second edition has restructured some chapters to make the book easier to follow. The book introduces basic programming of ARM Cortex chips in assembly language and the fundamentals of embedded system design. It presents data representations, assembly instruction syntax, floating-point operations, SIMD instructions, implementing fundamental controls of C language at the assembly level, and instruction encoding and decoding. The book also covers many advanced components of embedded systems, such as software and hardware interrupts, general purpose I/O, LCD driver, keypad interaction, real-time clock, stepper motor control, PWM input and output, digital input capture, direct memory access (DMA), digital and analog conversion, serial communication (USART, I2C, SPI, and USB), and digital signal processing.
A Virtual Machine for Interpreting Programs in Static Single Assignment Form

Optimizing compilers, including those in virtual machines, commonly utilize Static Single Assignment Form as their intermediate representation, but interpreters typically implement stack-oriented virtual machines. This paper introduces an easily interpreted variant of Static Single Assignment Form. Each instruction of this Interpretable Static Single Assignment Form, including the Phi Instruction, has self-contained operational semantics facilitating efficient interpretation. Even the array manipulation instructions possess directly-executable single-assignment semantics. In addition, this paper describes the construction of a prototype virtual machine realizing Interpretable Static Single Assignment Form and reports on its performance. This work is based on Interpreting Programs in Static Single Assignemnt Form, in the Proceedings of the ACM SIGPLAN 2004 Workshop on Interpreter, Virtual Machines and Emulators c ©ACM, 2004. Information and Computer Science University of California, Irvine
Evaluación de extractos de meliáceas para el control de Heterotermes tenuis

Evaluation of meliaceae extracts in the control of Heterotermes tenuis. The biological activity of extracts of Meliaceae in relation with Heterotermes tenuis was studied in the laboratory. The effect of aqueous extracts from various structures of Melia azedarach, Trichilia pallida and Azadirachata indica (neem) (1 and 5% w/v), neem oil (1 and 2% v/v) and the commercial formula Nimkol®, obtained from neem leaves (0.5 and 1% a.i.), were measured for the survivability of termites. The transmission of Nimkol® between different proportions of treated and untreated individuals was also evaluated. Nimkol® caused a significant mortality of H. tenuis after the third day of feeding (1% a.i.). No significant toxic activity was determined for the other extracts.There was no evidence of transmission of active ingredients from insects treated with Nimkol® to other individuals.