检索结果-内蒙古大学图书馆

IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI

作者： Arnab Kumar Ghoshal Nabanita Das Asutosh College Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781665467230

Social networks are temporally evolving by nature and in general, the evolution takes place gradually with time. But occasionally, the nodes may exhibit anomalous behavior that is to be detected and reported in real time. Usually, the social networks are represented as a temporal stream of weighted graphs, where edge weights stand for frequency or power of actions. Here, for identification of anomalies in evolutionary social networks, we follow an action based approach leveraging the community structure of the network, where it is shown that only the Community Boundary Nodes are enough to detect anomaly in a temporally evolving social network. We introduce a new definition of anomaly score for nodes based on its action history. To the best of our knowledge, this is the first work to exploit the community boundary nodes of an evolutionary social network to identify the graph snapshots containing anomalous events. Experimental studies on real-world as well as synthetic evolutionary networks show that the proposed technique achieves almost 13% improvement in F-Score compared to the state-of-the-art algorithms. Moreover, parallel implementation of the proposed technique results nearly 6 x speedup making it suitable for real time computation of anomaly in evolutionary social networks.

关键词： Knowledge engineering Social networking (online) Image edge detection Conferences Real-time systems History Informatics

来源：评论

学校读者我要写书评

暂无评论

Test pattern generation for power supply droop faults

Test pattern generation for power supply droop faults

引用

19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design

作者： Mitra, Debasis Bhattacharjee, Subhasis Sur-Kolay, Susmita Bhattacharya, Bhargab B. Zachariah, Sujit T. Kundu, Sandip Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Design/Test Technology India Intel Technology India Pvt. Ltd. Bangalore India Dept of ECE University of Massachusetts Amherst United States

ISBN: (纸本)0769525024

In deep sub-micron VLSI chips, when several tran-sistors in physical proximity switch simultaneously, a substantial power supply drop, known as droop, may occur because of concurrent load on a via of the power grid. As a result of lower supply voltage, transistors may slow down. Such timing faults are termed as droop faults. Modeling of droop faults and understanding their effects on the functionality and timing behavior of the circuit are yet to be fully understood. In this paper, a new model for droop faults is proposed. A simple ATPG-based procedure for stuck-at faults has been adapted to test droop faults. For validation of the methodology in combinational circuits, a set of appropriate clusters of gates is selected to cover potential droop-prone regions in a circuit. Experimental results on ISCAS-85 benchmark circuits reveal that a very high droop fault coverage can be obtained by a short sequence of test vectors. © 2006 IEEE.

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

Optimizing Ansatz design in QAOA for max-cut

arXiv

引用

arXiv 2021年

作者： Majumdar, Ritajit Madan, Dhiraj Bhoumik, Debasmita Vinayagamurthy, Dhinakaran Raghunathan, Shesha Sur-Kolay, Susmita Advanced Computing & Microelectronics Unit Indian Statistical Institute IBM Research India IBM Systems India

Quantum Approximate Optimization Algorithm (QAOA) has been studied widely in the literature, primarily for finding an approximate value of the maximum cut size of a graph. QAOA is composed of a problem hamiltonian and a mixer hamiltonian which are applied alternately for p ≥ 1 layers. The circuit for this algorithm requires 2m CNOT gates in each layer, where m is the number of edges in the graph. CNOT gate is one of the primary sources of error in modern quantum computers. In this paper, we propose two techniques for reducing the number of CNOT gates in the circuit which are independent of the hardware architecture. For a graph with n vertices, we first propose a technique based on edge coloring that can reduce upto bn2 c CNOT gates in the circuit. Next, we propose another technique based on Depth First Search (DFS) that can reduce n − 1 CNOT gates at the cost of some increased depth. We analytically derive the criteria for which the reduction in the number of CNOT gates due to the DFS based technique can provide lower error probability even with some increased depth, and show that all graphs conform to this criteria, making this technique universal. We further show that this proposed optimization holds even in the post transpilation stage of the circuit, which is actually executed in the IBM Quantum hardware [1]. We simulate these two techniques for graphs of various sparsity with the ibmq_manhattan noise model and show that the DFS based technique outperforms the edge coloring based technique, which in turn, outperforms the traditional QAOA circuit in terms of reduction in the number of CNOT gates, and hence the probability of error of the circuit. © 2021, CC BY.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Coverage constrained non-uniform node deployment in wireless sensor networks for load balancing

Coverage constrained non-uniform node deployment in wireless...

引用

Applications and Innovations in Mobile computing (AIMoC)

作者： Punyasha Chatterjee Nabanita Das School of Mobile Computing and Communication Jadavpur University Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Multi-hop wireless sensor networks with uniform node deployment, in general, suffers from uneven load distribution that finally creates an energy hole around the sink causing early failure of the network. However, it has been shown earlier that nearly balanced energy consumption can be achieved by utilizing non-uniform deterministic node distribution with increasing node density towards the sink. In this paper, a novel model is proposed for non-uniform deterministic node distribution that reduces the total number of nodes to be deployed over the area and the network traffic satisfying both coverage and load balancing criteria. Also, with random node distribution, a simple distributed algorithm is developed for nearly load-balanced data gathering. Performance comparison with earlier works by simulation shows that the proposed model performs better in terms of network lifetime, network traffic and packet drops.

关键词： Corona Routing Load management Wireless sensor networks Distributed databases Load modeling Topology

来源：评论

学校读者我要写书评

暂无评论

Validation of a DiffServ based QoS model implementation for real-time traffic in a test bed

Validation of a DiffServ based QoS model implementation for ...

引用

18th National Conference on Communications, NCC 2012

作者： Gan Chaudhuri, Sruti Kumar, C.S. Rajakumar, Ratnam V. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata - 700108 India Department of Mechanical Engineering Indian Institute of Technology Kharagpur - 721302 India Department of Electronics and Electrical Communication Engineering Indian Institute of Technology Kharagpur - 721302 India

ISBN: (纸本)9781467308168

This paper presents a DiffServ based adaptive QoS model for real-time interactive traffic in constrained bandwidth IP network without over provisioning the users. A WRR based QoS scheduling algorithm has been implemented to allocate the network resources to the users. A tuning parameter for VBR real-time traffic is also introduced in order to provide fair performance to the non real-time traffic as well. The QoS model is implemented at the transmitter edge of the network. Edge switches and routers are configured with the proposed algorithm. The simulation (using NS2) and experimental results (using a test bed with real time network scenario) are presented for validation of the proposed model. © 2012 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Collection depots location problem in the plane 17

Collection depots location problem in the plane

引用

17th Canadian Conference on Computational Geometry, CCCG 2005

作者： Benkoczi, Robert Bhattacharya, Binay K. Das, Sandip Sember, Jeff School of Computing Queen's University KingstonONK7L 3N6 Canada School of Computing Science Simon Fraser University Burn-abyBCV5A 1S6 Canada Advanced Computing and Microelectronics Unit Indian Sta- Tistical Institute Calcutta700 035 India

In this paper we consider an extension of the classical facility location problem where besides n customers, a set of p collection depots are also given. In this set- ting the service of a customer consists of the travel of a server to the customer and return back to the center via a collection depot. We have analyzed the problem and showed that the collection depots problem can be trans- formed to O(n2p2) number of different classical facility location problems and this bound is tight. © 2005 Canadian Conference on Computational Geometry. All rights reserved.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Machine Learning based Decoding of Heavy Hexagonal QECC for Asymmetric Quantum Noise

Machine Learning based Decoding of Heavy Hexagonal QECC for ...

引用

IEEE Computer Society Annual Symposium on VLSI

作者： Debasmita Bhoumik Ritajit Majumdar Dhiraj Madan Susmita Sur-Kolay Advanced Computing and Microelectronics Unit Indian Statistical Institute India IBM Quantum IBM India Research Lab

ISBN: (数字)9798350354119

ISBN: (纸本)9798350354126

Decoding error syndromes for topological quantum error correcting codes, such as surface and heavy hexagonal codes, is computationally expensive. While minimum weight perfect matching (MWPM) algorithms have been commonly used for decoding, recent works have demonstrated the efficacy of machine learning (ML), particularly neural networks, in decoding syndromes for these codes. In this study, we introduce a ML-based decoder tailored to heavy hexagonal code to address asymmetric noise channels which reflect real-world scenario better than the depolarization model considered in previous works. Our proposed decoder shows $\sim 5\times$ and $\sim 22\times$ improvements in the threshold values for amplitude and amplitude-phase damping noise models respectively over MWPM methods. Our decoder is also robust to changes in asymmetry, with the threshold reducing by only ~ 3.6% for a $10\times$ change in asymmetry.

关键词： Damping Quantum computing Machine learning algorithms Noise Neural networks Machine learning Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Queuing Model-based Optimal Traffic Flow in a Grid Network

Queuing Model-based Optimal Traffic Flow in a Grid Network

引用

IEEE International Conference on advanced Networks and Telecommuncations Systems

作者： Sayan Sen Sarma Goutam Chakraborty Advanced Computing and Microelectronics Unit Indian Statistical Institute Department of Software and Information Science Iwate Prefectural University

ISBN: (纸本)9781509002948

A transportation network describes a network structure to allow flow of some commodity. Flow maximization is a classical problem in this domain. In this paper, we address the problem of flow maximization in a transportation network with fix sources and a fixed sink. For simplicity to find an analytical solution, we start with a grid structured road network. The goal is to find a traffic distribution over the road network such that the total average time of travel from source to sink is minimized. The theoretical result obtained was verified using linear programming problem solving tool in MATLAB.

关键词： Transportation network Route planning Queuing delay

来源：评论

学校读者我要写书评

暂无评论

A combined frequency assignment and AP scheduling for throughput maximization in IEEE 802.11 WLAN 13

A combined frequency assignment and AP scheduling for throug...

引用

11th International Conference on Advances in Mobile computing and Multimedia, MoMM 2013

作者： Tewari, Babul P. Ghosh, Sasthi C. Department of Computer Science and Engineering Bengal College of Engineering and Technology Durgapur 713 212 West Bengal India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata 700 108 India

ISBN: (纸本)9781450321068

Frequency channels are allocated to the access-points (APs) satisfying the co-channel interference in an IEEE 802.11 WLAN. Very few APs can be activated simultaneously with a conflict-free frequency assignment to them, due to limited number of frequencies. This may lead to a reduced aggregate throughput. We argue that aggregate throughput can significantly be improved by allowing some of the selected interfering APs to be activated with the same frequency but to operate in a fairly time-scheduled manner to satisfy the co-channel interference. We introduce the notion of class and cluster and based on it propose a combined frequency assignment, AP scheduling and association algorithm with the objective of maximizing the aggregate throughput. Simulation results show that the proposed algorithm is superior than both the algorithms that ignores the co-channel interference altogether by assuming proper frequency planning and that allows to activate only those APs for which a conflict-free frequency assignment exists. © 2013 ACM.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Secure multipath routing for multimedia communication in cognitive radio networks

Secure multipath routing for multimedia communication in cog...

引用

作者： Bhattacharya, Ansuman Ghosh, Sasthi C. Sinha, Koushik Sinha, Bhabani P. Department of Computer Science and Engineering National Institute of Technology Meghalaya Shillong India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata West Bengal India Department of Computer Science Southern Illinois University CarbondaleIL United States

In this paper, a novel technique for secure multihop communication in cognitive radio networks is proposed which allows the use of non-contiguous channels for communication of multimedia data without compromising the desired QoS. This technique first creates a number of sub-packets formed by suitably shuffling the bits of the original packet, finds multiple routes by executing the max-flow algorithm on a derivative of the network graph to meet the required bandwidth, suitably allocates channels for each hop in the multiple paths using the features of cognitive radio networks, and sends the sub-packets along these channels which are received by the destination node to form the original packet. This strategy also leads to significantly enhanced security of the data packets against the eavesdropping attack when multiple node-disjoint paths are chosen for transmitting the sub-packets. Copyright © 2018 Inderscience Enterprises Ltd.

关键词： Frequency division multiple access

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：