Search results for "General Computer Science"
showing 10 items of 895 documents
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
2015
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\rightarrow \{0,1\}$ as a black box. We are asked to determine if there exist $(u,v) \in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds are trivial ($\Omega(\sqrt{n})$ and $\Omega(n)$, respectively) and there is no known matching upper …
Statistical performance of a multiclass bulk production queueing system
2004
Abstract In this paper, we discuss how to statistically analyze a make-to-stock production system the behaviour of which depends on a multiclass bulk queueing system. The performance of the system is evaluated in terms of the different demands of products, processing times and, mainly, through the finished product inventory and other related measures that quantify the queueing effects in the system. A numerical example which illustrates the applicability of the results in an inventory scenario is also discussed.
Evaluation of routing policies using an interval-valued TOPSIS approach for the allocation rules
2021
Abstract The success of warehouse management in a supply chain widely depends on an efficient and effective retrieve of customer orders, which is known as the picking process. This paper investigates various routing policies of pickers under two different allocation methods of items in a warehouse of fixed layout, and evaluates their performance in terms of the resulting travel distance by means of a simulation approach. The allocation strategies taken into account are the random storage and a multi-criteria approach, called Interval-Value TOPSIS (IV-T), which is expressively proposed in this paper as a new way to solve the storage allocation problem of items in a warehouse. Because of the …
Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres
2012
Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…
Combined IT and power supply infrastructure sizing for standalone green data centers
2021
International audience; In this work, we propose a two-step methodology for designing and sizing a data center solely powered by local renewable energy. The first step consists in determining the necessary IT equipment for processing a given IT workload composed of batch and service tasks. We propose an adapted binary search algorithm and prove its optimality to find the minimum number of servers to handle the IT workload. When the IT sizing is computed, the second step consists in defining the supplying electrical infrastructure using wind turbines and photovoltaic panels as primary sources. Batteries and a hydrogen system are added as secondary sources for short- and long-term energy stor…
Sensitivity of a sensory process to short time delays: A study in pattern induced flicker colors (PIFCs)
1978
Pattern induced flicker colors (PIFCs) were generated by means of a modified version of Benham's top, the stimulus pattern of which could be varied continuously during stimulation by the human subjects. The sensitivity of the color sensation to small phase shifts between the periodic stimuli on neighboring retinal areas was recorded under several conditions of stimulus parameters. A mathematical model was developed to describe the influence of the stimulus parameters on the recorded sensory effect. Concerning the underlying neurophysiological processes, a hypothesis is advanced according to which the phase sensitive lateral interaction within the retina changes the spatial excitation distri…
Network of Concepts and Ideas
2010
We present the results of an experiment designed to investigate the way information is organized and stored in the human brain. In particular, we are using controlled stimuli to reverse engineer the networks of ideas and concepts in order to answer the following questions. (1) Are the networks of ideas and concepts in the human brain invoked by verbal and visual stimuli distinct from each other? The answer appears to be no for the network of ideas and inconclusive for the network of concepts. (2) What is the topology of these networks? Our experimental results show that both are small-world networks, with the network of ideas being random and the network of concepts scale-free.
Fault-Tolerant Application-Specific Topology-Based NoC and Its Prototype on an FPGA
2021
Application-Specific Networks-on-Chips (ASNoCs) are suitable communication platforms for meeting current application requirements. Interconnection links are the primary components involved in communication between the cores of an ASNoC design. The integration density in ASNoC increases with continuous scaling down of the transistor size. Excessive integration density in ASNoC can result in the formation of thermal hotspots, which can cause a system to fail permanently. As a result, fault-tolerant techniques are required to address the permanent faults in interconnection links of an ASNoC design. By taking into account link faults in the topology, this paper introduces a fault-tolerant appli…
Flexible Spare Core Placement in Torus Topology based NoCs and its validation on an FPGA
2021
In the nano-scale era, Network-on-Chip (NoC) interconnection paradigm has gained importance to abide by the communication challenges in Chip Multi-Processors (CMPs). With increased integration density on CMPs, NoC components namely cores, routers, and links are susceptible to failures. Therefore, to improve system reliability, there is a need for efficient fault-tolerant techniques that mitigate permanent faults in NoC based CMPs. There exists several fault-tolerant techniques that address the permanent faults in application cores while placing the spare cores onto NoC topologies. However, these techniques are limited to Mesh topology based NoCs. There are few approaches that have realized …
A new way of achieving multi-path routing in wireless networks
2020
In the 21st century, the wireless technology is still developing rapidly and trying to be 'Faster, Higher, and Stronger': faster data rate, higher bandwidth and stronger connectivity. Wireless Mesh Networks (WMN) have been envisioned as an important solution to the next generation wireless networking which can be used in wireless community networks, wireless enterprise networks, transportation systems, home networking and last-mile wireless internet access. They also provide a cheap, quick and effective way for building wireless data networks. Considering the nature of these networks, routing is a key process for operating the WMN. This paper proposes a new way of creating multi-path routin…