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

2006 IEEE International Conference on Communications, ICC 2006

作者： AboElFotoh, Hosam M. F. ElMallah, Ehab S. Hassanein, Hossam S. Dept. of Math. and Computer Science Kuwait University P.O.Box 5969 Safat 13060 Kuwait Department of Computing Science University of Alberta Edmonton AB Canada School of Computing Queen's University Kingston ON Canada

ISBN: (纸本)1424403553

In wireless sensor networks (WSN), reliable monitoring of a phenomenon (or event detection) depends on the collective data provided by the target cluster of sensors and not on any individual node. In this paper we define a WSN reliability measure that considers the aggregate flow of sensor data into a sink node (gateway or cluster head). Given an estimation of the data generation rate and the failure probability of each sensor, we formulate the reliability measure and show that computing this measure for an arbitrary WSN is #P-hard. We present an exponential algorithm for arbitrary WSN. We then consider some special cases where we can either compute or approximate (bound) the reliability using an efficient algorithm. Finally, we present some numerical results that demonstrate some of the applications of our algorithms. Reliability evaluation tools are important in the context of design and analysis of sensitive information gathering sensor networks. © 2006 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A real-time image filtration system

A real-time image filtration system

引用

1993 IEEE Workshop on Real-Time Applications, RTA 1993

作者： Laplante, P.A. Zalewski, D. Dept. of Math. and Comput. Sci. Fairleigh Dickinson Univ. MadisonNJ07480e United States Department of Computer Science NJIT NewarkNJ07102 United States

ISBN: (纸本)0818641304

A system for performing highly parallel, predictable real-time image filtration is described. The application software was developed using a special class of abstract data types (ADT) constructed in the RT-X language which has predictable execution times. The filtration algorithm is based on a Universal Image Algebra. Additional image processing applications such as feature extraction via edge detection or hit-and-miss transformation, and image data-base retrieval can be implemented using this system. © 1993 IEEE.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Platform-independent runtime optimizations using OpenThreads

Platform-independent runtime optimizations using OpenThreads

引用

International Symposium on Parallel Processing

作者： M. Haines K. Langendoen Department of Computer Science University of Wurzburg Laramie WY USA Department of Math. and Computer Science Vrije Universiteit Brussel Amsterdam Netherlands

Although platform-independent runtime systems for parallel programming languages are desirable, the need for low-level optimizations usually precludes their existence. This is because most optimizations involve some combination of low-level communication and low-level threading the product of which is almost always platform-dependent. We propose a solution to the threading half of this dilemma by using a thread package, that allows fine-grain control over the behaviour of the threads while still providing performance comparable to hand-tuned, machine-dependent thread packages. This makes it possible to construct platform-independent thread modules for parallel runtime systems and, more importantly, to optimize them.

关键词： Runtime Yarn Packaging machines computer science Concurrent computing NASA Programming profession Optimization User interfaces Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Hierarchical scheduling for DiffServ classes

Hierarchical scheduling for DiffServ classes

引用

GLOBECOM'04 - IEEE Global Telecommunications Conference

作者： Yang, Mei Wang, Jianping Lu, Enyue Zheng, S.Q. Dept. of Elec. and Comp. Engineering University of Nevada Las Vegas Las Vegas NV 89154 Department of Computer Sciences Georgia Southern University Statesboro GA 30460 Dept. of Math. and Computer Science Salisbury University Salisbury MD 21801 Department of Computer Science University of Texas at Dallas Richardson TX 75080

Due to its simplicity and scalability, the differentiated services (DiffServ) model is expected to be widely deployed across the Internet. For each DiffServ compliant router, the scheduling algorithm is critical in implementing per hop behaviors (PHBs), according to which packets are forwarded. In this paper, we propose the hierarchical DiffServ scheduling (HDS) algorithm to support DiffServ classes on input-queued switches. The proposed HDS algorithm features in a hierarchical scheduling scheme that consists of two levels of schedulers. One level is the central scheduler which is designed to maximize the switch throughput by computing a maximal size matching between input ports and output ports. The other level is formed by input port schedulers which provide differentiated services by serving cells belonging to different classes dynamically. Using such a hierarchical scheme, the implementation complexity and the amount of information needs to be transmitted between input ports and the central scheduler are dramatically reduced compared with existing maximal weight matching based DiffServ scheduling algorithms. The tradeoff of its slightly worse delay performance is acceptable.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

EXISTENCE AND UNIQUENESS OF THE SOLUTION FOR NONLINEAR THIRD-ORDER ROBIN BOUNDARY VALUE PROBLEM WITH A TURNING POINT

引用

Annals of Differential Equations 2007年第3期23卷 365-372页

作者： Yu Zanping Zhou Zheyan Shen Jianhe School of Math. and Computer Science Fujian Normal University Fuzhou 350007 Dept. of Applied Mechanics and Engineering Sun Yat-sen University Guangzhou 510275

The paper aims to obtain existence and uniqueness of the solution as well as asymptotic estimate of the solution for singularly perturbed nonlinear thirdorder Robin boundary value problem with a turning point. In order to achieve this aim, existence and uniqueness of the solution for third-order nonlinear Robin boundary value problem is derived first based on the upper and lower solutions method under relatively weaker conditions. In this manner, the goal of this paper is gained by applying the existence and uniqueness results mentioned above.

关键词： Robin boundary value problem third-order turning point existence and uniqueness singular perturbation

来源：评论

学校读者我要写书评

暂无评论

Grassroots Systems: Concept, Examples, Implementation and Applications

arXiv

引用

arXiv 2023年

作者： Shapiro, Ehud Department of Computer Science and Applied Math Weizmann Institute of Science Israel

Informally, a grassroots system is a distributed system that can have multiple instances, independent of each other and of any global resources, that can interoperate once interconnected. More formally, in a grassroots system the set of all correct behaviors of a set of agents P is strictly included in the set of the correct behaviors of P when embedded within a larger set of agents P′ ⊃ P: Included, meaning that members of P are correct to ignore outside agents indefinitely;strictly included, meaning that the interaction of members of P with outside agents is also a possible and correct behavior. Client-server/cloud computing systems are not grassroots, and neither are systems designed to have a single global instance (Bitcoin/Ethereum with hardwired seed miners/bootnodes), and systems that rely on a single global data structure (IPFS, DHTs). An example grassroots system would be a serverless smartphone-based social network supporting multiple independently-budding communities that can merge when a member of one community becomes also a member of another. Grassroots applications are potentially important as they may allow people to conduct their social, economic, civic, and political lives in the digital realm solely using the networked computing devices they own and operate (e.g., smartphones), free of third-party control, surveillance, manipulation, coercion, or rent seeking (e.g., by global digital platforms such as Facebook or Bitcoin). Here, we formalize the notion of grassroots systems and grassroots implementations;specify an abstract grassroots dissemination protocol;describe and prove an implementation of grassroots dissemination for the model of asynchrony;extend the implementation to mobile (address-changing) devices that communicate via an unreliable network (e.g. smartphones using UDP);and discuss how grassroots dissemination can realize applications that support digital sovereignty – grassroots social networking and grassroots currencies. The math.mat

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

On biased compression for distributed learning

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2023年第1期24卷 12974-13023页

作者： Aleksandr Beznosikov Samuel Horváth Peter Richtárik Mher Safaryan Computer Electrical and Math. Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal KSA and Skolkovo Institute of Science and Technology Moscow Russia and School of Applied Mathematics and Informatics Moscow Institute of Physics and Technology Moscow Russia Computer Electrical and Math. Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal KSA

In the last few years, various communication compression techniques have emerged as an indispensable tool helping to alleviate the communication bottleneck in distributed learning. However, despite the fact biased compressors often show superior performance in practice when compared to the much more studied and understood unbiased compressors, very little is known about them. In this work we study three classes of biased compression operators, two of which are new, and their performance when applied to (stochastic) gradient descent and distributed (stochastic) gradient descent. We show for the first time that biased compressors can lead to linear convergence rates both in the single node and distributed settings. We prove that distributed compressed SGD method, employed with error feedback mechanism, enjoys the ergodic rate $O\left( \delta L \exp[-\frac{\mu K}{\delta L}] + \frac{(C + \delta D)}{K\mu}\right)$, where δ ≥1 is a compression parameter which grows when more compression is applied, L and µ are the smoothness and strong convexity constants, C captures stochastic gradient noise (C = 0 if full gradients are computed on each node) and D captures the variance of the gradients at the optimum (D = 0 for over-parameterized models). Further, via a theoretical study of several synthetic and empirical distributions of communicated gradients, we shed light on why and by how much biased compressors outperform their unbiased variants. Finally, we propose several new biased compressors with promising theoretical guarantees and practical performance.

关键词： compression operators biased compressors distributed learning linear convergence error feedback

来源：评论

学校读者我要写书评

暂无评论

Systolic-type implementation of matrix computations based on the Faddeev algorithm

Systolic-type implementation of matrix computations based on...

引用

International Conference on Massively Parallel Computing Systems

作者： R. Wyrzykowski J.S. Kanevski O.V. Maslennikov Department Math. & Computer Science Technical University of Czestochowa Czestochowa Poland Department Computer Science Kiev Polytechnic Institute Kiev Ukraine

Deals with the problem of enhancing the versatility of VLSI processor arrays without undue addition of hardware, time/control overhead, and software complexity. A promising approach to this problem is based on matrix computations carried out through the Faddeev algorithm. We design a fixed-size, linear array architecture with fully local communications and straightforward control requirements. This high-throughput, systolic-type architecture allows us to minimize both I/O requirements and the number of processing elements performing complicated operations like divisions. To derive the array from a formal description of the Faddeev algorithm based on Gaussian elimination with partial pivoting, we use purposive transformations of the basic dependence graph of the algorithm before its space-time mappings onto array architectures.< >

关键词： Matrices Very large scale integration computer science Hardware computer architecture Communication system control Space technology Application specific processors Pipeline processing Application software

来源：评论

学校读者我要写书评

暂无评论

Homoclinic orbits for soliton equations solvable via the quadratic bundle

引用

Physics Letters, Section A: General, Atomic and Solid State Physics 2003年第1-2期314卷 59-67页

作者： Doktorov, E.V. Rothos, V.M. B.I. Stepanov Institute of Physics 220072 Minsk Belarus Department of Mathematical Sciences Loughborough University Loughborough LE11 3TU United Kingdom Dept. of Math. and Computer Science University of Leicester Leicester LE1 7RH United Kingdom

A method is proposed to generate homoclinic solutions for an integrable nonlinear PDE with periodic boundaries. This approach resembles the dressing method known in the theory of solitons. The pole positions in the dressing factor are given by the complex double points of the Floquet spectrum associated with unstable modes of a seed solution of the nonlinear equation. As an example, we obtain the homoclinic orbit for the modified nonlinear Schrödinger equation solvable by the Wadati-Konno-Ichikawa spectral problem. © 2003 Published by Elsevier B.V.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

New construction of ensemble classifiers for imbalanced datasets

New construction of ensemble classifiers for imbalanced data...

引用

2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2010

作者： Zhai, Yun Yang, Bingru Ma, Nan Ruan, Da School of Information Engineering University of Science and Technology Beijing Beijing China College of Computer Science Liaocheng University Liaocheng China College of Information Beijing Union University Beijing China Department of Applied Math and Computer Science Ghent University Krijgslaan Belgium

ISBN: (纸本)9781424467907

Learning in the presence of data imbalances presents a great challenge to machine learning. Imbalanced data sets represent a significant problem because the corresponding classifier has a tendency to ignore samples which have smaller representation in the training sets. In this paper, we propose an ensemble-based learning algorithm as a new ensemble classifier model called as SVM-C5.0 Ensemble Classifier Model, SCECM. SCECM adopts a differentiated sampling rate algorithm (DSRA) based on an improved Adaboost algorithm and further employs unique classifier-selection strategy, novel classifier integration approach and original classification decision-making method. Comparative experimental results show that the proposed approach improves performance for the minority class while preserving the ability to recognize examples from the majority classes. © 2010 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：