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

19th international conference on distributed computing and networking (ICDCN)

作者： Rastogi, Avnish Kumar Narang, Nitin Siddiqui, Zamir Ahmad HCL Technol Noida Uttar Pradesh India

ISBN: (纸本)9781450363976

In the domain of machine learning, quality of data is most critical component for building good models. Predictive analytics is an AI stream used to predict future events based on historical 'earnings and is used in diverse fields like predicting online frauds, oil slicks, intrusion attacks, credit defaults, prognosis of disease cells etc. Unfortunately, in most of these cases, traditional learning models fail to generate required results due to imbalanced nature of data. Here imbalance denotes small number of instances belonging to the class under prediction like fraud instances in the total online transactions. The prediction in imbalanced classification gets further limited due to factors like small disjuncts which get accentuated during the partitioning of data when learning at scale. Synthetic generation of minority class data (SMOTE [(1) under bar]) is one pioneering approach by Chawla [(1) under bar] to offset said limitations and generate more balanced datasets. Although there exists a standard implementation of SMOTE in python, it is unavailable for distributed computing environments for large datasets. Bringing SMOTE to distributed environment under spark is the key motivation for our research. In this paper we present our algorithm, observations and results for synthetic generation of minority class data under spark using Locality Sensitivity Hashing [LSH]. We were able to successfully demonstrate a distributed version of Spark SMOTE which generated quality artificial samples preserving spatial distribution(1).

关键词： SMOTE Imbalanced Classification Locality Sensitivity Hashing Nearest Neighbors Spark Map Reduce

来源：评论

学校读者我要写书评

暂无评论

Research on Auxiliary Content Distribution based on OPNET on Campus 10

Research on Auxiliary Content Distribution based on OPNET on...

引用

10th international conference on Cyber-Enabled distributed computing and Knowledge Discovery (CyberC)

作者： Bian, Haodong Bai, Xiangyu Zhang, Hua Ran, Maoli Inner Mongolia Univ Coll Comp Sci Coll Software Engn Inner Mongolia AR Key Lab Wireless Networking & M Hohhot Peoples R China

ISBN: (数字)9781728109749

ISBN: (纸本)9781728109749

The widespread application of mobile communication technologies based on cellular networks has provided campus students with convenient content distribution services, but the high traffic costs can hardly meet the needs of students for downloading large files. Most campuses do not implement Wi-Fi-wide school coverage. Wi-Fi access is only available in certain fixed locations. Bluetooth in mobile phones is not usually networking and routing, so that students can not accurately get the resources they need in the nearby population. It can be seen that the common content acquisition methods on campus are difficult to meet the students' needs for resource content in a timely manner. It is possible to expand the coverage of the network with the help of widely used mobile intelligent terminal devices on campus. At the same time, mobile intelligent terminals can be used to enhance the sharing of campus network resources. Students can obtain the required resources at a lower cost without access to Wi-Fi. This paper combines mobile communication technology and Bluetooth communication technology. The use of mobile communication networks and portable smart terminals hybrid communication. A content distribution framework for campus networks was proposed. This new content distribution solution is suitable for the actual needs and application characteristics of student users on campus. It provides content distribution services on the campus in a low-cost and high-coverage manner. It promoted the construction of campus information. The OPNET simulation platform is used to model and simulate the proposed scheme. The network performance and content distribution efficiency are analyzed under different scenarios in this scenario. It tries to provide a theoretical basis for the specific implementation of the plan, which helps to improve the content distribution efficiency of the campus network environment.

关键词： content distribution modeling simulation Bluetooth OPNET

来源：评论

学校读者我要写书评

暂无评论

Optimal Clustering in Weibull distributed WSNs Based on Realistic Energy Dissipation Model 1

引用

international conference on computing, Analytics and networking (ICCAN)

作者： Kumar, Vinay Yadav, Sadanand Kumar, Vishal Sengupta, Joydeep Tripathi, Rajeev Tiwari, Sudarshan Visvesvaraya Natl Inst Technol Nagpur 440010 Maharashtra India Motilal Nehru Natl Inst Technol Allahabad 211004 Uttar Pradesh India

ISBN: (数字)9789811078712

ISBN: (纸本)9789811078712;9789811078705

In this paper, a realistic energy consumption model of sensor node has been provided by considering eleven key energy consumption sources, some of which are ignored by contemporary energy consumption models. Clustering is a technique by which we can reduce energy consumption of networks. Optimizing the number of clusters improves the scalability of system, reduces the system collisions and delays. To this end, we proposed a realistic energy consumption model of a sensor node, by using that, provided an analytical expression for finding the optimal number of clusters in a Weibull distributed WSNs.

关键词： Energy efficiency Wireless sensor networks Optimal cluster size Weibull distribution

来源：评论

学校读者我要写书评

暂无评论

Design of Optimal Clinic Route System Based on WeChat Platform

Design of Optimal Clinic Route System Based on WeChat Platfo...

引用

IEEE international Symposium on Parallel and distributed Processing with Applications and IEEE international conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Wenhao Chen Shi Pan Yang Li Jiayang Wang Jiaqi Wang Yuting Zhang Wendi Zhu School of Electronic and Information Engineering Changchun University of Science and Technology Changchun China

ISBN: (纸本)9781728152103

The internet and medical platform plays an important role increasingly in the process of seeking medical treatment, but the problem, "three long and one short", has not been effectively solved in most of the major hospitals. In this paper, we propose a public platform based on WeChat, which plans the treatment routes of all patients overall and reasonably. Firstly, to improve the traditional medical treatment process, the optimal clinic route system is combined with it, then we propose two different optimal clinic route schemes with the shortest treatment time solved by retrospective method. We carried out simulation experiments on the optimal waiting algorithm. The results show that compared with the worst case, the designed algorithm greatly saves the time and distance of the consultation, which proves that the algorithm can reasonably and effectively plan the treatment route and improve the medical service level.

关键词： hospitals medical computing patient treatment social networking (online) medical computing patient treatment hospital MEDICAL TREATMENT clinic Platform simulation test Optimal Routes Internets algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Probability Statistics Method for Multi-sensor Data Fusion 10

Research on Probability Statistics Method for Multi-sensor D...

引用

10th international conference on Cyber-Enabled distributed computing and Knowledge Discovery (CyberC)

作者： Ran, Maoli Bai, Xiangyu Xin, Fangshuo Xiang, Yaping Inner Mongolia Univ Coll Comp Sci Coll Software EngnHohhot Mech Engn Vocat Tech Sc Inner Mongolia AR Key Lab Wireless Networking & M Hohhot Peoples R China Inner Mongolia Univ Coll Comp Sci Coll Software Engn Inner Mongolia AR Key Lab Wireless Networking & M Hohhot Peoples R China Nanba Middle Sch Dazhou City Sichuan Provinc Peoples R China

ISBN: (数字)9781728109749

ISBN: (纸本)9781728109749

In multi-sensor systems, data fusion is one of the key technologies for solving information diversification in wireless sensor networks. Data fusion is a process of information processing to automatically analyze and synthesize data collected by multiple sensors under certain rules to complete the required decisions or tasks, including information fusion, feature fusion, relationship fusion and decision fusion. It extends the lifespan of wireless sensor networks and improves data accuracy. It is generally considered that data fusion is an integrated process of information processing. It is generally considered that data fusion is a process of information synthesis and processing, making various information and data detected, correlated, estimated, and synthesized at multiple levels and from many aspects to obtain accurate and complete information. There are many methods for sensor data fusion, such as Bayesian method, D-S method, neural network, fuzzy reasoning, genetic algorithm, deep learning, etc. This article focuses on the application, analysis and comparison of probabilistic statistical methods in multi-sensor data fusion. The data fusion methods of probability statistics are divided into three categories: data fusion method based on estimation theory, data fusion method based on regression theory, and data fusion method based on information theory. This article just has a simple analysis on the three types from the perspective of theory and has a detailed analysis on the core Bayesian fusion in probability statistics.

关键词： WSN Data Fusion Probability Statistics Estimation Theory Regression Theory Information Theory

来源：评论

学校读者我要写书评

暂无评论

Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs

引用

THEORETICAL COMPUTER SCIENCE 2018年 709卷 48-63页

作者： Foerster, Klaus-Tycho Luedi, Thomas Seidel, Jochen Wattenhofer, Roger ETH CH-8092 Zurich Switzerland Microsoft Res Redmond WA 98052 USA

In this work we study local checkability of network properties like s-t reachability, or whether the network is acyclic or contains a cycle. A structural property S of a graph G is locally checkable, if there is a prover-and-verifier pair (P,V) as follows. The prover P assigns a label to each node in graphs satisfying S. The verifier V is a constant time distributed algorithm that returns Yes at all nodes if G satisfies S and was labeled by P, and No for at least one node if G does not satisfy S, regardless of the node labels. The quality of (P,V) is measured in terms of the label size. Our model has no strings attached, i.e., we do not assume any identifiers or port numbers: All we allow is a single exchange of labels between neighbors. We obtain (asymptotically) tight bounds for the bit complexity of the latter two problems for undirected as well as directed networks, where in the directed case we consider one-way and two-way communication, i.e., we distinguish whether communication is possible only in the edge direction or not. For the one-way case we obtain a new asymptotically tight lower bound for the bit complexity of s-t reachability, which also extends to distributed algorithms with constant time execution. For the two-way case we devise an emulation technique that allows us to transfer a previously known s-t reachability upper bound without asymptotic loss in the bit complexity. Lastly, we also study how to apply the concept of local checkability to updating spanning trees in a loop free manner in the context of asynchronous networking, by exploring the similarities between prover-and-verifier pairs and Software Defined Networks (SDNs). (C) 2016 Elsevier B.V. All rights reserved.

关键词： Local checking s-t reachability Acyclicity Software defined networking

来源：评论

学校读者我要写书评

暂无评论

DDP: distributed Network Updates in SDN 38

DDP: Distributed Network Updates in SDN

引用

38th IEEE international conference on distributed computing Systems (ICDCS)

作者： Li, Geng Qian, Yichen Zhao, Chenxingyu Yang, Y. Richard Yang, Tong Tongji Univ Shanghai Peoples R China Yale Univ New Haven CT 06520 USA Peking Univ Beijing Peoples R China

ISBN: (纸本)9781538668719

How to quickly and consistently update a network is among the most fundamental and common challenges in software defined networking (SDN) systems. Current approaches heavily rely on the (logically) centralized controller to initiate and orchestrate the network updates, resulting in long latency of update completion. In this paper, we present DDP, a system for fast, distributed network updates while preserving various consistency properties. The key technique in DDP is a novel primitive named datapath operation container (DOC), where each DOC is encoded with an individual operation and its dependency logic. DDP adopts the simple, but powerful DOCs to configure the network, so that network updates can be triggered and executed at the data plane in a distributed and local manner. Novel algorithms are designed to compute and optimize the DOCs for consistent updates. We implement DDP to evaluate its performance in various update scenarios. Experimental results show that DDP significantly improves network update speed by up to 52.1% for the real-time updates initiated by the controller, and further improves the speed by 55.6-61.4% for the updates directly triggered at the data plane, such as failure recovery.

关键词： Control systems Logic gates Real-time systems Radio frequency distributed databases Process control Containers

来源：评论

学校读者我要写书评

暂无评论

Optimizing distributed file storage and processing engines for CERN's Large Hadron Collider using multi criteria partitioned replication 18

Optimizing distributed file storage and processing engines f...

引用

19th international conference on distributed computing and networking (ICDCN)

作者： Boychenko, Serhiy Zerlauth, Markus Garnier, Jean-Christophe Zenha-Rela, Mario CERN Geneva Switzerland Univ Coimbra CISUC Coimbra Portugal

ISBN: (纸本)9781450363723

Throughout the last decades, distributed file systems and processing engines have been the primary choice for applications requiring access to large amounts of data. Since the introduction of the MapReduce paradigm, relational databases are being increasingly replaced by more efficient and scalable architectures, in particular in environments where a query is expected to process TBytes or even PBytes of data in a single execution. That is the situation at CERN, where data storage systems that are critical for the safe operation, exploitation and optimization of the particle accelerator complex, are based on traditional databases or file system solutions, which are already working well beyond their initially provisioned capacity. Despite the efficiency of modern distributed data storage and processing engines in handling large amounts of data, they are not optimized for heterogeneous workloads such as they arise in the dynamic environment of one of the world's largest scientific facilities. This contribution presents a Mixed Partitioning Scheme Replication (MPSR) solution that outperforms the conventional distributed processing environment configurations at CERN for virtually the entire parameter space of the accelerator monitoring systems' workload variations. Our main strategy was to replicate the data using different partitioning schemes for each replica, whereas the individual partitioning criteria is dynamically derived from the observed workload. To assess the efficiency of this approach in a wide range of scenarios, a behavioral simulator has been developed to compare and analyze the performance of the MPSR with the current solution. Furthermore we present the first actual results of the Hadoop-based prototype running on a relatively small cluster that not only validates the simulation predictions but also confirms the higher efficiency of the proposed technique.

关键词： Partitioning Replication distributed filesystems

来源：评论

学校读者我要写书评

暂无评论

Management of collaborations in digital marketplaces

Management of collaborations in digital marketplaces

引用

international conference on High Performance computing & Simulation (HPCS)

作者： Lu Zhang Systems and Networking (SNE) lab University of Amsterdam Amsterdam Netherlands

ISBN: (数字)9781728144849

ISBN: (纸本)9781728144856

With everyone generating value out of data, our work focuses to distributed data trading platforms, Digital Market Places (DMPs), that can handle the intricacies of data sharing, e.g. how, where, and what can be done with the traded data. Here we represent collaborations among involving parities in DMPs in the form of archetypes and model them with numeric representations for easier manipulation with standard mathematical tools. We also develop a methodology which aims to select a best-fit infrastructure archetype with any customer-defined application request. In addition, we propose multiple metrics which allows evaluate and compare competing DMPs systemically from more dimensions: coverage, extensibility, precision and flexibility.

关键词： Collaboration Measurement distributed databases Filtering Mathematical model Numerical models

来源：评论

学校读者我要写书评

暂无评论

Design and Optimization of Edge computing distributed Neural Processor for Biomedical Rehabilitation with Sensor Fusion 18

Design and Optimization of Edge Computing Distributed Neural...

引用

37th IEEE/ACM international conference on Computer-Aided Design (ICCAD)

作者： Otseidu, Kofi Jia, Tianyu Bryne, Joshua Hargrove, Levi Gu, Jie Northwestern Univ Dept EECS Evanston IL 60208 USA Shirley Ryan Abil Lab Chicago IL USA

ISBN: (纸本)9781450359504

Modem biomedical devices use sensor fusion techniques to improve the classification accuracy of motion intent of users for rehabilitation application. The design of motion classifier observes significant challenges due to the large number of channels and stringent communication latency requirement. This paper proposes an edge-computing distributed neural processor to effectively reduce the data traffic and physical wiring congestion. A special local and global networking architecture is introduced to significantly reduce traffic among multi-chips in edge computing. To optimize the design space of the features selected, a systematic design methodology is proposed. A novel mixed-signal feature extraction approach with assistance of neural network distortion recovery is also provided to significantly reduce the silicon area. A 12-channel 55nm CMOS test chip was implemented to demonstrate the proposed systematic design methodology. The measurement shows the test chip consumes only 20uW power, more than 10,000X less power than the current clinically used microprocessor and can perform edge-computing networking operation within 5ms time.

关键词： Neural network Low power edge processing Mixed signal feature extraction Inter-chip communication Biomedical devices

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：