Fast and resource-efficient inference in artificial neural networks (ANNs) is of utmost importance drives many new developments the area hardware architectures, e.g., by means systolic arrays or algorithmic optimization such as pruning. In this paper, we present a novel method for lowering computation effort ANN utilizing ideas from information theory. Weight matrices are sliced into submatrice...

In this paper we study two possible approaches to improving existing schemes for constructing hash functions that hash arbitrary long messages. First, we introduce a continuum of function classes that lie between universal one-way hash functions and collision-resistant functions. For some of these classes efficient (yielding short keys) composite schemes exist. Second, we prove that the schedul...

Abstract: In this paper, an attempt has been made to investigate how DEA FDH method based on linear programming can select one or more efficient scheduling solutions on multiprocessor tasks obtained by any heuristic algorithms through some feasible solutions for NP-complete problems. This article will consider the problem of scheduling multiprocessor tasks with multi–criteria, namely, minimizin...

While Grid users are often interested in satisfaction of their Quality of Service (QoS) requirements, these cannot be satisfactory handled by commonly used queuebased approaches. This paper concentrates on the application of schedule-based methods which allow both efficient handling of QoS requirements as well as traditional machine usage objective. An incremental application of our methods rea...

Data broadcasting is accepted as an effective solution to disseminate information to a large number of clients in wireless environments. Data broadcast scheduling attracts extensive attention, especially for multi-item queries. However, most previous works focusing on this issue do not take data replication in broadcast schedule into consideration, which leads to poor performance when the acces...

In this paper, we address the problem of data aggregation scheduling problem to minimize the latency in wireless sensor networks (WSNs). An efficient distributed synchronous aggregation scheduling method is proposed to structure a collision-free schedule for data aggregation in WSNs. By using a connected dominating set (CDS) as an aggregation tree, we implement the synchronous aggregation sched...

In a variety of biological processes, eukaryotic cells use cilia to transport flow. Although cilia have a remarkably conserved internal molecular structure, experimental observations report very diverse kinematics. To address this diversity, we determine numerically the kinematics and energetics of the most efficient cilium. Specifically, we compute the time-periodic deformation of a wall-bound...

the research on project scheduling has widely expanded over the last few decades. the vast majority of these research efforts focus on exact and suboptimal procedures for constructing a workable schedule, assuming complete information and a static deterministic problem environment. project activities are scheduled subject to both technological precedence constraints and resource constraints, mo...