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

32nd Annual ACM Symposium on Applied computing, SAC 2017

作者： Sarma, Sayan Sen Sinha, Koushik Chakraborty, Goutam Sinha, Bhabani P. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science Southern Illinois University Carbondale United States Department of Software and Information Science Iwate Prefectural University Iwate Ken Japan

ISBN: (纸本)9781450344869

We consider the problem of trafic routing in a road network in the event of a disaster, when there is a surge in vehicle movement from dense residential areas to designated safeshelters. We address the problem with multiple sources and a fixed sink in a κ × κ Manhattan grid road network to find a trafic distribution over the network such that the average time of travel from sources to sink is minimized. We consider queuing delay at each grid point of the Manhattan network when multiple grid points can become potential sources of new trafic generation, and then propose an optimal trafic distribution algorithm to minimize the total queuing delay of all vehicles to reach the given destination point. We then extend our technique to consider variable link delay (as a function of the volume of trafic ow through a link) along the links of the network. 2017 ACM.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

Bottleneck bichromatic full steiner trees 29

Bottleneck bichromatic full steiner trees

引用

29th Canadian Conference on Computational Geometry, CCCG 2017

作者： Karim Abu-Affash, A. Bhore, Sujoy Carmi, Paz Chakraborty, Dibyayan Software Engineering Department Shamoon College of Engineering Beer-Sheva84100 Israel Department of Computer Science Ben-Gurion University Beer-Sheva84105 Israel Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

Given two sets of points in the plane, Q of n (terminal) points and S of m (Steiner) points, where each of Q and S contains bichromatic points (red and blue points), a full bichromatic Steiner tree is a Steiner tree in which all points of Q are leaves and each edge of the tree is bichromatic (i.e., connects a red and a blue point). In the bottleneck bichromatic full Steiner tree (BBFST) problem, the goal is to compute a bichromatic full Steiner tree T, such that the length of the longest edge in T is minimized. In k-BBFST problem, the goal is to find a bichromatic full Steiner tree T with at most k ≤ m Steiner points from S, such that the length of the longest edge in T is minimized. In this paper, we present an O((n + m) log m) time algorithm that solves the BBFST problem. Moreover, we show that k-BBFST problem is NP-hard and we give a polynomial-time 9-approximation algorithm for the problem. Compilation copyright © 2017 Michiel Smid Copyright of individual papers retained by *** right reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Micro-Bump Assignment for Efficient Routing on Re-Distribution Layer (RDL) in 3D-ICs

Micro-Bump Assignment for Efficient Routing on Re-Distributi...

引用

IEEE India Council International Conference

作者： Sabyasachee Banerjee Subhashis Majumder Saikat Basu Bhargab B. Bhattacharya Department of Computer Science and Engineering Heritage Institute of Technology Nanotechnology Research Triangle Advanced Computing and Microelectronics Unit Indian Statistical Institute

ISBN: (纸本)9781538643198

RDL (Re-Distribution Layers) routing from the IO pads to micro-bumps plays an important role for transmitting signal between two adjacent layers in 3D IC. The quality of RDL-routing strongly depends on the positions of micro-bumps between two adjacent dies. Initially, I/O pads are assigned to micro-bumps and then single-layer routing is performed over the two RDLs that are adjacent to two respective layers. We propose an improved method for RDL-routing in 3D IC. Experimental results show that 100% routahility can be achieved with reduced wire-length for all five test-cases that we have studied.

关键词： TSV Micro-bump RDL routing

来源：评论

学校读者我要写书评

暂无评论

Classification of long-bone fractures based on digital-geometric analysis of X-ray images

引用

Pattern Recognition and Image Analysis 2016年第4期26卷 742-757页

作者： Bandyopadhyay, O. Biswas, A. Bhattacharya, B.B. Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Information Technology Indian Institute of Engineering Science and Technology Shibpur India

The classification of fractured of a patient plays an important role in orthopaedic evaluation and diagnosis. It not only aids in assessing the severity of the disease or injury but also serves as a basis of treatment or surgical correction. This paper proposes a novel approach to automated classification of long-bone fractures based on the analysis of an input X-ray image. The method consists of four major steps: (i) extraction of the bone-contour from a given X-ray image, (ii) identification of fracture-points or cracks, (iii) determination of an equivalent set of geometric features in tune with the Müller-AO clinical classification of fractures, and (iv) identification and detailed assessment of the fracture-type. The decision procedure makes use of certain geometric properties of digital curves such as relaxed digital straight line segments (RDSS), arcs, discrete curvature, and concavity index. The proposed method for the analysis of fractures is applied on different types of bone-images and is observed to have produced correct classification in most of the test-cases. © 2016, Pleiades Publishing, Ltd.

关键词： Fracture

来源：评论

学校读者我要写书评

暂无评论

Reservoir and mixer constrained scheduling for sample preparation on digital microfluidic biochips

Reservoir and mixer constrained scheduling for sample prepar...

引用

Asia and South Pacific Design Automation Conference

作者： Varsha Agarwal Ananya Singla Mahammad Samiuddin Sudip Roy Tsung-Yi Ho Indranil Sengupta Bhargab B. Bhattacharya Dept. of CSE CoDA Laboratory IIT Roorkee India Dept. of CSE IIT Kharagpur India Dept. of CS National Tsing Hua University Hsinchu Taiwan Advanced Computing and Microelectronics Unit ISI Kolkata India

ISBN: (纸本)9781509015597

In recent years, digital microfluidic biochips are being dominantly used for implementing a wide range of biochemical laboratory protocols (bioprotocols) on hand-held devices. Accurate preparation of fluid-samples is a fundamental preprocessing step that is needed in many bioprotocols. Oftentimes, the number of reservoirs built on-chip may be far less than that of the reactant fluids to be mixed. Hence, during the execution of an assay, several fluids are to be unloaded from the reservoirs to make room for loading new fluids stored off-line. Such unload-wash-load steps (switching) may be required several times, and these steps, being manual, significantly impact assay-completion time. In this paper, we propose a new scheduling scheme namely Reservoir and Mixer constrained Scheduling (RMS) that can schedule a mixing tree obtained by a mixing algorithm, while minimizing the number of switching such that the total completion time can be minimized. Simulation results over a large number of target ratios show that given the mixing trees obtained by standard mixing algorithms such as MinMix/RMA/CoDOS, RMS reduces switching steps (on average by 40.3%/41.9%/33%) at the cost of increasing mixing time (by only 3.5%/6.2%/4.8%), compared to an existing scheduling scheme invoked with reservoir constraints.

关键词： Reservoirs Switches Scheduling Optimal scheduling Mixers System-on-chip Loading

来源：评论

学校读者我要写书评

暂无评论

The p-center problem in tree networks revisited 15

The p-center problem in tree networks revisited

引用

15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016

作者： Banik, Aritra Bhattacharya, Binay Das, Sandip Kameda, Tsunehiko Song, Zhao Advanced Computing and Microelectronics Unit Indian Statistical Inst. Kolkata India School of Computing Science Simon Fraser University Vancouver Canada Department of Computer Science University of Texas Austin United States

ISBN: (纸本)9783959770118

We present two improved algorithms for weighted discrete p-center problem for tree networks with n vertices. One of our proposed algorithms runs in O(n log n + p log2 n log(n/p)) time. For all values of p, our algorithm thus runs as fast as or faster than the most efficient O(n log2 n) time algorithm obtained by applying Cole's speed-up technique [10] to the algorithm due to Megiddo and Tamir [20], which has remained unchallenged for nearly 30 years. Our other algorithm, which is more practical, runs in O(n log n + p2 log2 (n/p)) time, and when p = O(√ n) it is faster than Megiddo and Tamir's O(n log2 n log log n) time algorithm [20]. © Aritra Banik, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, and Zhao Song.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Fault diagnosis for leakage and blockage defects in flow-based microfluidic biochips

Fault diagnosis for leakage and blockage defects in flow-bas...

引用

作者： Hu, Kai Bhattacharya, Bhargab B. Chakrabarty, Krishnendu Department of Electrical and Computer Engineering Duke University DurhamNC27708 United States Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

Advances in flow-based microfluidics now allow an efficient implementation of biochemistry on-a-chip for DNA sequencing, drug discovery, and point-of-care disease diagnosis. However, the adoption of flow-based biochips is hampered by defects that frequently occur in chips fabricated using soft lithography techniques. Recently published work has shown how we can automate the testing of flow-based biochips;diagnosis methods are now needed to identify the flaws in the fabrication process and to facilitate the use of partially defective chips. Since disposable biochips are being targeted for a highly competitive and low-cost market segment, such diagnosis methods need to be inexpensive, quick, and effective. In this paper, we present the first approach for the automated diagnosis of leakage and blockage defects in flow-based microfluidic biochips. The proposed method targets the identification of fault types and their locations based on test outcomes. It reduces the number of possible fault sites significantly while identifying their exact locations. We use a graph representation of flow paths and a formulation based on hitting sets for the analysis of observed error syndromes. The diagnosis technique is evaluated on three fabricated biochips, and the localization of faults and their classification are achieved correctly in all cases. © 2015 IEEE.

关键词： Biochips

来源：评论

学校读者我要写书评

暂无评论

On reliability hardening in cyber-physical digital-microfluidic biochips

On reliability hardening in cyber-physical digital-microflui...

引用

Asia and South Pacific Design Automation Conference

作者： Guan-Ruei Lu Guan-Ming Huang Ansuman Banerjee Bhargab B. Bhattacharya Tsung-Yi Ho Hung-Ming Chen Institute of Electronics National Chiao Tung University Hsinchu Taiwan Institute of Electrical and Computer Engineering National Chiao Tung University Hsinchu Taiwan Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)9781509015597

In the area of biomedical engineering, digital-microfluidic biochips (DMFBs) have received considerable attention, because of their capability of providing an efficient and reliable platform for conducting point-of-care clinical diagnostics. System reliability, in turn, mandates error-recoverability while implementing biochemical assays on-chip for medical applications. Unfortunately, the technology of DMFBs is not yet fully equipped to handle error-recovery from various microfluidic operations involving droplet motion and reaction. Recently, a number of cyber-physical systems have been proposed to provide real-time checking and error-recovery in assays based on the feedback received from a few on-chip checkpoints. However, in order to synthesize robust feedback systems for different types of DMFBs, certain practical issues need to be considered such as co-optimization of checkpoint placement and layout of droplet-routing pathways. For application-specific DMFBs, we propose here an algorithm that minimizes the number of checkpoints and determines their locations to cover every path in a given droplet-routing solution. Next, for general-purpose DMFBs, where the checkpoints are pre-deployed in specific locations, we present a checkpoint-aware routing algorithm such that every droplet-routing path passes through at least one checkpoint to enable error-recovery and to ensure physical routability of all droplets. Our experiments on assay benchmarks show encouraging results in terms of latest-arrival-time and routability of droplets. The proposed methods thus provide convenient reliability-hardening mechanisms for a wide class of cyber-physical DMFBs.

关键词： Routing Sensors Reliability Electrodes System-on-chip Cyber-physical systems Monitoring

来源：评论

学校读者我要写书评

暂无评论

An efficient approach for load balancing in vehicular ad-hoc networks

An efficient approach for load balancing in vehicular ad-hoc...

引用

2016 IEEE International Conference on advanced Networks and Telecommunications Systems, ANTS 2016

作者： Agarwal, Shubham Das, Avirup Das, Nabanita Department of Electrical and Electronics Engineering Manipal Institute of Technology Manipal University Manipal India Institute of Radio Physics and Electronics University of Calcutta Kolkata India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781509021932

With the rapid increase in vehicular traffic in urban areas, optimal use of available resources is necessary to minimize the cost while maintaining the safety, and the quality of service. For this purpose, Vehicular Ad hoc Networks (VANETs) are emerging, connecting vehicles with static road side units (RSUs) serving as a backbone. For energy efficiency, vehicles may upload data to the nearest RSU by multi-hop routing via shortest paths. But it drains the energy of the nodes nearer to the RSU faster leading to frequent recharging of batteries. For cost-efficient design and longer battery life, both optimal placement of RSUs and uniform power dissipation of nodes are necessary in VANETs. In this paper, a novel approach of load balanced routing is proposed to improve the network stability and battery lifetime in individual nodes. Assuming variable energy levels of transmission in each vehicle, our analysis establishes some upper bounds on the separation of two consecutive RSUs for nearly load balanced routing. The problem has been defined for linear network with uniform distribution of vehicles over 1-D road. Simulation studies show that the proposed scheme enhances the network performance significantly in terms of energy usage, network load and average packet delay. © 2016 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

On L(k, k-1, ..., 1) labeling of triangular lattice

引用

Electronic Notes in Discrete Mathematics 2015年 48卷 281-288页

作者： Nandi, Soumen Sen, Sagnik Ghosh, Sasthi C. Das, Sandip Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

An n - L(k, k-1, ..., 1) labeling of a simple graph G is a mapping f: V(G) → {0, 1, ..., n} such that |f(u) - f(v)| ≥ k+1 - d(u,v), for all u,v∈V(G), where d(u,v) is the length of the shortest path connecting u and v. The L(k, k-1, ..., 1) labeling span λk(F) of a family of graphs F is the minimum n for which each G∈F admits an n - L(k, k-1, ..., 1) labeling. For the family L3 of all subgraphs of an infinite triangular lattice we provide upper and lower bounds of λk(L3) for general k and show that the ratio of the upper and lower bound is at most 43. The upper bound is given by providing an assignment algorithm to the vertices of the infinite triangular lattice. © 2015 Elsevier B.V.

关键词： Approximation ratio Assignment algorithm Distance k - clique L(k, k-1, ..., 1) labeling span Triangular lattice

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：