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

25th IEEE Asian Test Symposium, ATS 2016

作者： Mitra, Sayandeep Das, Moumita Banerjee, Ansuman Datta, Kausik Ho, Tsung-Yi Indian Statistical Institute Kolkata India Meghnad Saha Institute of Technology Kolkata India Mentor Graphics India Pvt. Ltd. India National Tsing Hua University Taiwan Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B.T. Road Kolkata West Bengal700108 India

ISBN: (纸本)9781509038084

In recent times, approximate computing is being looked at as a viable alternative for reducing the energy consumption of programs, while marginally compromising on the correctness of their computation. The idea behind approximate computing is to introduce approximations at various levels of the execution stack, with an attempt to realize the resource hungry computations on low resource consuming approximate hardware blocks. However approximate computing for program transformation faces a serious challenge of automatically identifying core program areas/statements where approximations can be introduced, with a quantifiable measure of the resulting program correctness compromise. Introducing approximations randomly can cause performance deterioration without much energy advantage, which is undesirable. In this paper, we introduce a verification-guided method to automatically identify program blocks which lend themselves to easy approximations, while not compromising significantly on program correctness. Our method is based on identifying regions of code which are less influential for the computation of the program outputs and therefore, can be compromised with, however still having a potential of significant resource reduction. We take the help of assertions to quantify the effect of the resulting transformations on program outputs. We show experimental results to support our proposal. © 2016 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach for Load Balancing in Vehicular Ad-hoc Networks

An Efficient Approach for Load Balancing in Vehicular Ad-hoc...

引用

IEEE International Conference on advanced Networks and Telecommuncations Systems

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

ISBN: (纸本)9781509021949

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.

关键词： Routing Roads Vehicular ad hoc networks Batteries Mathematical model Load modeling Load management

来源：评论

学校读者我要写书评

暂无评论

A dynamic microtask scheduling approach for SLO based human-augmented computing

A dynamic microtask scheduling approach for SLO based human-...

引用

International Conference on Recent Advances in Information Technology (RAIT)

作者： Koushik Sinha Pratham Majumder Geetha Manjunath Dept. of Computer Science Southern Illinois University Carbondale IL USA Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Data Analytics Research Lab Xerox Research Center India Bangalore India

ISBN: (纸本)9781479985807

Current machine algorithms for qualitative analysis of unstructured data (in the form of social media posts, audio and video, among others) do not perform well and show low accuracies due to the need for human-like intelligence. However, machines are easily scalable, fast and the quality of their output is predictable. On the other hand, though humans are much better than machine algorithms at image and video analysis, natural language text and speech processing, they are unfortunately unpredictable, slower and can be erroneous or even malicious as computing agents. Therefore, a task execution engine which can enable human-augmented cloud computing by intelligently orchestrating machine and human computing resources would be able to provide richer and superior analytics on unstructured data than either of the two types of computing agents in isolation. We believe that a key aspect of enabling such analytics would be to provide guaranteed service level objectives, in terms of accuracy, time and budget In this paper, we present a microtask scheduler with integrated service level objectives (SLO) management. With this goal, we have introduced two new decision parameters: H-M ratio and microtask completion rate. An early prototype has been built and validated through simulation with actual performance data collected from anonymous crowd workers on Amazon Mechanical Turk. Machine computation was done using Hewlett Packard's Autonomy IDOL while ground truth was established through the use of known, expert workers. To the best of our knowledge, ours is the first work that attempts to simultaneously attempt to address the three SLO parameters of accuracy, budget and deadline for data-parallel microtasks.

关键词： Manuals

来源：评论

学校读者我要写书评

暂无评论

Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation

引用

Electronic Notes in Discrete Mathematics 2015年 48卷 89-93页

作者： Sandhupatla, Amruth Ghosh, Sasthi C. Department of Electronics and Communication Engineering National Institute of Technology Warangal India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

We consider the vertex duplicated complete bipartite graph G'(VA, VB) which is formed by duplicating all the vertices of a complete bipartite graph G(A, B). We then deal with the gracefulness of G'(VA, VB) by ... 详细信息

We consider the vertex duplicated complete bipartite graph G^'(V_A, V_B) which is formed by duplicating all the vertices of a complete bipartite graph G(A, B). We then deal with the gracefulness of G^'(V_A, V_B) by considering both static and incremental frequency allocation to it. We have proved that the graceful labeling of G^'(V_A, V_B) is possible only for the case of static frequency allocation but not for the incremental frequency allocation. Finally we have shown that graceful labeling of G(A, B) satisfying certain additional properties can be extended to a σ-labeling of G^'(V_A, V_B) for the incremental frequency allocation. © 2015 Elsevier B.V.

关键词： Complete bipartite graph Frequency allocation Graceful labeling

来源：评论

学校读者我要写书评

暂无评论

SIMOP-A fast tool for generating optimum dilutions of microfluidic samples using simulation

SIMOP-A fast tool for generating optimum dilutions of microf...

引用

IEEE Distributed computing, VLSI, Electrical Circuits and Robotics (DISCOVER)

作者： Sutirtha Das Sweta Mukherjee Neha Aryani Subhashis Majumder Nilina Bera Bhargab B. Bhattacharya IIT Bombay Powai Mumbai Maharashtra-400076 Prabandh Shikhar IIM Indore Indore ITC Infotech Bangalore Department of Computer Science and Engineering Heritage Institute of Technology Kolkata Advanced Computing and Microelectronics Unit Indian Statistical Institute India

ISBN: (纸本)9781509016242

The technology of digital microfluidic (DMF) biochips now offers viable replacement of expensive healthcare and bio-, chemical laboratory procedures with low-cost, fully-automated, miniaturized integrated systems. Preparing dilution of a fluid sample that optimizes various parameters such as reagent-cost, mixing time, waste production, is a basic problem in the domain of algorithmic microfluidics. Most of the existing dilution algorithms used in droplet-based microfluidic systems deploy a sequence of (1 : 1) mix-split steps, where two unit-volume droplets of different concentrations are mixed, followed by a balanced split operation to obtain two equal-sized droplets. In this paper, we introduce a simulation-guided optimization procedure (SIMOP) for achieving the target concentrations with a sequence of (1 : 1) mix-split steps while optimizing multiple factors according to user-specified priority levels. The SIMOP-algorithm produces a given concentration while optimizing each criterion as desired. Experimental results favorably demonstrate the performance of the proposed method compared to BS and DMRW algorithms. The proposed procedure may find many potential applications to microfluidics such as in' biomedical engineering and healthcare services.

关键词： Electronic mail Optimization Computational modeling Medical services Chemicals Minimization Protocols

来源：评论

学校读者我要写书评

暂无评论

Retinal blood vessel segmentation and bifurcation point detection 17th

Retinal blood vessel segmentation and bifurcation point dete...

引用

17th International Workshop on Combinatorial Image Analysis, IWCIA 2015

作者： Dutta, Tapash Dutta, Nilanjan Bandyopadhyay, Oishila Department of Information Technology Indian Institute of Engineering Science and Technology Howrah India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9783319261447

The analysis of retinal blood vessel structure plays an important role in diagnosis of different diseases. Automated extraction of vascular network and identification of bifurcation points can be an important part of computer assisted analysis of retinal vascular disorders. In this paper, we propose an efficient method of automatic blood vessel extraction and bifurcation point detection from retinal images. The proposed method introduces the novel concept of relaxed digital arc for the removal of optic disc region to improve the correctness of the results. Experimental results show the effectiveness of the proposed method. We re-validate the quality of the proposed blood vessel segmentation approach by comparing the segmentation accuracy with existing approaches. The efficiency of bifurcation point detection process is evaluated by comparing manual bifurcation point count with the findings of the proposed approach. © Springer International Publishing Switzerland 2015.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Effect of Soft Handover on WLAN Usage Efficiency under Load Condition

Analyzing the Effect of Soft Handover on WLAN Usage Efficien...

引用

IEEE International Symposium on Network computing and Applications

作者： Nitish K. Panigrahy Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781509018505

With increasing popularity of wireless local area network (WLAN) and emerging real time applications, seamless mobility has become one of the primary concerns. Hence the choice of a proper handoff algorithm is of utmost importance. Previous work suggests that WLAN usage efficiency can act as a good metric to measure the performance of a handoff algorithm. We argue that in a multiple AP scenario, the load on each of the APs, the requested data rate of the mobile terminal (MT) and the soft handover have a significant impact on the usage efficiency. In this paper we present an analytical framework to measure the usage efficiency under both load condition and soft handover for a specific data rate request. Our approach is based on finding the circular region centered around an AP within which the requested data rate can be satisfied. The usage efficiency is then computed based on finding the union of all such circular regions.

关键词： Wireless LAN Handover Throughput Load modeling Mathematical model Measurement

来源：评论

学校读者我要写书评

暂无评论

Channel assignment in mobile networks based on geometric prediction and random coloring

Channel assignment in mobile networks based on geometric pre...

引用

Conference on Local Computer Networks (LCN)

作者： Subhankar Ghosal Sasthi C. Ghosh Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781467367714

The channel assignment problem in mobile networks can be modeled as a temporal graph coloring problem where a temporal graph represents a sequence of graphlets generated over a regular interval of time. The cost of coloring a graphlet is defined as a function of number of colors used in the current graphlet and the number of color changes from the previous graphlet. A differential coloring technique is proposed which first finds the minimum number of vertices that requires recoloring and then recolor them. A prediction based and a random coloring based approaches are proposed to reduce the cost. In prediction based approach, we predict a graph which is a supergraph of the graph representing the union of current and next k graphlets and then color it. Whereas, in random coloring we color the graphlets individually. We have shown that both approaches perform better than an existing SNAP algorithm.

关键词： Color Image color analysis Channel allocation Prediction algorithms Approximation algorithms Mobile communication Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Improving User Coverage Through Resource Aware Handoff Management in Heterogeneous Networks 2015

Improving User Coverage Through Resource Aware Handoff Manag...

引用

13th International Conference on Advances in Mobile computing and Multimedia, MoMM 2015

作者： Singh, Rohit Mukherjee, Sulagna Ghosh, Sasthi C. Department of Computer Science and Engineering Institute of Engineering and Management Kolkata700091 India Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road Kolkata700 108 India

ISBN: (纸本)9781450334938

In heterogenous network, there are possibilities of horizontal handover between similar type of transmitters as well as vertical handover between different type of transmitters. Also, an user may be served by a single transmitter under the hard handover or may be served by multiple transmitters simultaneously under the soft handover. Considering all these, an user may have several available options to connect with. We have developed a greedy algorithm which allocates every user to their respective most beneficial link in terms of power requirement and traffic cost. We have compared our proposed algorithm with two existing handoff decision algorithms of which one is based on received signal strength indicator measurements and the other is based on selecting the least congested transmitter. Through simulation we have shown that the proposed algorithm outperforms both these algorithms in terms of user coverage and the average data rate provided to the users. © 2015 ACM.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Coverage Area Maximization by Heterogeneous Sensor Nodes With Minimum Displacement in Mobile Networks

Coverage Area Maximization by Heterogeneous Sensor Nodes Wit...

引用

IEEE International Conference on advanced Networks and Telecommuncations Systems

作者： Dibakar Saha Avirup Das Advanced Computing and Microelectronics Unit Indian Statistical Institute Department of Radio physics and Electronics University of Calcutta

ISBN: (纸本)9781509002948

Given a random deployment of heterogeneous mobile nodes having different sensing ranges, this paper addresses the problem of covering a region using minimum number of nodes with minimum displacement. We propose an energy-efficient and light-weight self-organized distributed greedy heuristic to maximize area coverage such that the amount of computation, rounds of communication, and the distance traversed by a node, can be reduced utilizing minimal number of nodes. Extensive simulation studies on random deployment of nodes with sufficient node density over a 2-D area, show that our proposed technique results hole free area coverage with small number of nodes with minimum possible displacement, both in turn help to prolong the network lifetime.

关键词： Area coverage Mobile networks Sensing range Connectedness Network lifetime

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：