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

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

来源：评论

学校读者我要写书评

暂无评论

Real-time embedded systems analysis — From theory to practice

Real-time embedded systems analysis — From theory to practi...

引用

International Symposium on VLSI Design and Test (VDAT)

作者： Ansuman Banerjee Arijit Mondal Arnab Sarkar Santosh Biswas Advanced Computing and Microelectronics Unit Indian Statistical Institute Dept. of Computer Science & Engineering Indian Institute of Technology Patna Bihar India Dept. of Computer Science & Engineering Indian Institute of Technology Guwahati Assam India

Summary form only given. Real-time embedded applications span a wide range of domains including automotive and flight control systems, monitoring systems, multimedia systems, virtual reality, interactive gaming, robotics, telecommunications, etc. A late response in these systems might cause a wrong behavior which could possibly even lead to a critical system failure. A typical example is an anti-lock braking system in a car that is required to release the brakes within (say) 60 milliseconds to prevent the wheels from locking. In most real-time systems design, the task / application scheduler is a major architectural component responsible for ensuring proper processing of all tasks having timeliness constraints on their execution response. In the presence of several concurrent activities running on a processor, the realtime scheduler has to ensure that each activity completes within its deadline. The first part of this tutorial introduces real-time embedded systems in general highlighting their key design issues and then presents a few important scheduling mechanisms employed on uni-processor and multiprocessor real-time systems. While scheduling strategies are directed towards handling the contention for CPUs among several real-time tasks, it cannot guarantee timing and performance constraints for the entire system in the presence of variable memory access and data communication times, actual execution path taken by the applications, the micro-architecture of the platform used etc. Validating timing and performance properties for these embedded real-time systems through system level timing analysis has evolved as a research theme in its own merit. In the second part of this discussion, we will present a systematic study of the developments in this area. The embedded real-systems under consideration are becoming increasingly complex. With an ensemble of complex components and diverse functionalities on board, the problem of verification for real time systems implemen

关键词： Real-time systems Embedded systems Electronic mail Hardware Computer science Timing

来源：评论

学校读者我要写书评

暂无评论

Evaluating Conditional Handover for 5g Networks with Dynamic Obstacles

SSRN

引用

SSRN 2024年

作者： Deb, Souvik Rathod, Megh Balamurugan, Rishi Singh, Rajeev Kumar Sanyal, Samriddha Ghosh, Shankar K. Advanced Computing & Microelectronics Unit Indian Statistical Institute West Bengal Kolkata700108 India Department of Computer Science and Engineering Shiv Nadar Institution of Eminence Delhi201314 India School of Computing and Data Science FLAME University Maharashtra Pune412115 India Shiv Nadar University India

To enhance seamless connectivity in millimetre wave New radio networks, Conditional handover has evolved as a promising solution. Unlike A3 handover where handover execution is certain after receiving handover command from the serving access network, in conditional handover, handover execution is conditional on the Reference signal received power measurements from both current and target access networks, as well as on mobility parameters such as preparation and execution offsets. Presence of dynamic obstacles may block the signal from serving and (or) target access networks, which results in violation of the conditions for the handover preparation/execution. Moreover, signal blockage by dynamic obstacles may cause radio link failure, which may cause handover failure as well. Analytic evaluations of conditional handover performance in the presence of dynamic obstacles are quite limited in the preceding literature. In this work, handover performance of conditional handover has been carried out in terms of handover latency, handover packet loss and handover failure probability. A Markov model accounting the effect of dynamic obstacles, different mobility parameters (e.g., execution offset, preparation offset, time-to-preparation and time-to-execution), user velocity and channel fading characteristics has been proposed to characterize handover failure. Results obtained from the analytic model has been validated against extensive simulation results. Our study reveal that optimal configuration of the mobility parameters is actually conditional on the presence of dynamic obstacles, user velocity and fading characteristics. This study will be helpful for the mobile operators to configure the mobility parameters for New radio systems where dynamic obstacles are present. © 2024, The Authors. All rights reserved.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Demand-driven single- and multitarget mixture preparation using digital microfluidic biochips

Demand-driven single- and multitarget mixture preparation us...

引用

作者： Shalu Kumar, Srijan Singla, Ananya Roy, Sudip Chakrabarty, Krishnendu Chakrabarti, Partha P. Bhattacharya, Bhargab B. CoDA Laboratory Department of Computer Science and Engineering Indian Institute of Technology Roorkee Roorkee247667 India Department of Computer Science Stanford University StanfordCA94305 United States Department of Electrical and Computer Engineering Duke University Durham27708 United States Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Kharagpur721302 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata Kolkata700108 India

Recent studies in algorithmic microfluidics have led to the development of several techniques for automated solution preparation using droplet-based digital microfluidic (DMF) biochips. A major challenge in this direction is to produce a mixture of several reactants with a desired ratio while optimizing reactant cost and preparation time. The sequence of mix-split operations that are to be performed on the droplets is usually represented as a mixing tree (or graph). In this article, we present an efficient mixing algorithm, namely, Mixing Tree with Common Subtrees (MTCS), for preparing single-target mixtures. MTCS attempts to best utilize intermediate droplets, which were otherwise wasted, and uses morphing based on permutation of leaf nodes to further reduce the graph size. The technique can be generalized to produce multitarget ratios, and we present another algorithm, namely, Multiple Target Ratios (MTR). Additionally, in order to enhance the output load, we also propose an algorithm for droplet streaming called Multitarget Multidemand (MTMD). Simulation results on a large set of target ratios show that MTCS can reduce the mean values of the total number of mix-split steps (Tms) and waste droplets (W) by 16% and 29% over Min-Mix (Thies et al. 2008) and by 22% and 34% over RMA (Roy et al. 2015), respectively. Experimental results also suggest that MTR can reduce the average values of Tms andW by 23% and 44% over the repeated version of Min-Mix, by 30% and 49% over the repeated version of RMA, and by 9% and 22% over the repeated-version of MTCS, respectively. It is observed that MTMD can reduce the mean values ofTms andW by 64% and 85%, respectively, over MTR. Thus, the proposed multitarget techniques MTR and MTMD provide efficient solutions to multidemand, multitarget mixture preparation on a DMF platform. © 2018 ACM.

关键词： Digital microfluidics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time

arXiv

引用

arXiv 2021年

作者： Cabello, Sergio Das, Arun Kumar Das, Sandip Mukherjee, Joydeep Faculty of Mathematics and Physics University of Ljubljana Slovenia Institute of Mathematics Physics and Mechanics Slovenia Advanced Computing and Microelectronics Unit Indian Statistical Institute India Dept. of Computer Science Ramakrishna Mission Vivekananda Educational and Research Institute India

A terrain is an x-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in O(n log n) time, where n is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of O(n2). Copyright © 2021, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

i-QER: An Intelligent Approach towards Quantum Error Reduction

arXiv

引用

arXiv 2021年

作者： Basu, Saikat Saha, Amit Chakrabarti, Amlan Sur-Kolay, Susmita A. K. Choudhury School of Information Technology University of Calcutta and Atos Pune India A. K. Choudhury School of Information Technology University of Calcutta India Advanced Computing & Microelectronics Unit Indian Statistical Institute India

Quantum computing has become a promising computing approach because of its capability to solve certain problems, exponentially faster than classical computers. A n-qubit quantum system is capable of providing 2n computational space to a quantum algorithm. However, quantum computers are prone to errors. Quantum circuits that can reliably run on today’s Noisy Intermediate-Scale Quantum (NISQ) devices are not only limited by their qubit counts but also by their noisy gate operations. In this paper, we have introduced i-QER, a scalable machine learning-based approach to evaluate errors in a quantum circuit and helps to reduce these without using any additional quantum resources. The i-QER predicts possible errors in a given quantum circuit using supervised learning models. If the predicted error is above a pre-specified threshold, it cuts the large quantum circuit into two smaller sub-circuits using an error-influenced fragmentation strategy for the first time to the best of our knowledge. The proposed fragmentation process is iterated until the predicted error reaches below the threshold for each sub-circuit. The sub-circuits are then executed on a quantum device. Classical reconstruction of the outputs obtained from the sub-circuits can generate the output of the complete circuit. Thus, i-QER also provides classical control over a scalable hybrid computing approach, which is a combination of quantum and classical computers. The i-QER tool is available at https://***/SaikatBasu90/i-QER. © 2021, CC BY.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Noncontiguous Channel Allocation for Multimedia Communication in Cognitive Radio Networks

Noncontiguous Channel Allocation for Multimedia Communicatio...

引用

作者： Bhattacharya, Ansuman Ghosh, Rabindranath Sinha, Koushik Datta, Debasish Sinha, Bhabani P. Department of Computer Science and Engineering National Institute of Technology Shillong793003 India Department of Electronics and Communication Engineering St. Thomas' College of Engineering and Technolgy Kolkata700023 India Department of Computer Science Southern Illinois University Carbondale CarbondaleIL62901 United States Department of Electronics and Electrical Communication Engineering Indian Institute of Technology Kharagpur Kharagpur721302 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

In conventional wireless systems, unless a contiguous frequency band with width at least equal to the required bandwidth is obtained, multimedia communication cannot be effected with the desired quality of service. We propose here a novel channel allocation technique to overcome this limitation in a cognitive radio network, which is based on utilizing several noncontiguous channels, each of width smaller than the required bandwidth, but whose sum equals at least the required bandwidth. We present algorithms for channel sensing, channel reservation, and channel deallocation along with transmission and reception protocols with two different implementations based on FDM-FDMA and OFDM-FDMA techniques. Simulation results for both these implementations show that the proposed technique outperforms the existing first-fit and best-fit allocation techniques in terms of the average number of attempts needed for acquiring the necessary number of channels for all traffic situations ranging from light to extremely heavy traffic. Furthermore, the proposed technique can allocate the required numbers of channels in less than 1 s with FDM-FDMA even (4.5 s with OFDM-FDMA) for 96% traffic load, while the first-fit and best-fit techniques fail to allocate any channel in such situations. © 2015 IEEE.

关键词： Orthogonal frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Flow-Based Passive Microfluidic Architecture for Homogeneous Mixing

Flow-Based Passive Microfluidic Architecture for Homogeneous...

引用

International Symposium on Electronic System Design (ISED)

作者： Tapalina Banerjee Sudip Poddar Robert Wille Bhargab B. Bhattacharya Advanced Computing and Microelectronics Unit Indian Statistical Institute University of Calcutta Kolkata India EDA-LAB National Taiwan University of Science and Technology Taiwan Institute for Integrated Circuits Johannes Kepler University Linz Austria Indian Institute of Technology Kharagpur India

ISBN: (数字)9781728141770

ISBN: (纸本)9781728141787

Accurate sample preparation, an essential component in microfluidic design automation, poses a great challenge to lab-on-chip (LoC) designers. Although continuous-flow based microfluidic biochips (CFMBs) offer many advantages, the problem of achieving fast, stable, and controllable sample concentration becomes more pronounced when such chips are used. Most of the flow-based dilutions and/or mixing methods need certain settling time to ensure an output flow with stable concentration profile resulting in initial loss of fluids. Control-valve sequencing along with time management for injecting input fluids further complicates the scenario. In this paper, we address the problem of preparing a homogeneous mixture of several input-fluids with different concentration factors. We present a binary tree-based free-flowing microfluidic architecture, which obviates the need for any control valve. The passive fluidic network supports balanced hydraulic resistance along all input-output fluid paths and ensures low Reynolds number. We show that the homogeneity of mixing can be expedited by properly assigning inlets to fluids with different concentrations based on a graph-matching algorithm. The method reveals how design automation tools can be effectively used for solving a problem of fluid dynamics. Theoretical attributes of the proposed architecture, when compared with COMSOL Multiphysics based simulations, provide excellent agreement with high accuracy.

关键词： Mixers Valves Computer architecture Immune system Computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：