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

Service discovery strategies in ubiquitous communication environments

IEEE COMMUNICATIONS MAGAZINE 2006年第9期44卷 106-113页

作者： Sivavakeesar, Siva Gonzalez, Oscar F. Pavlou, George Univ Surrey Networks Res Grp Ctr Commun Syst Res Guildford GU2 5XH Surrey England

Past communication and computing trends are inadequate to deal with today's complex, distributed, and diverse network environments. With the recent development of small-size tetherless communication/computing devices and the increasing diversity in their capabilities, autonomic ubiquitous communication environments are emerging. In such environments, the execution of a complex task does not necessarily make use of prconfigured devices or networks, but requires instead the selection of suitable computing elements on-the-fly, based on the task requirements and device characteristics (i.e., networking-on-demand or task-centric networking). Research is currently being carried out in various dimensions in this emerging domain, including, among other approaches for context awareness, service discovery and self-management. In this article we concentrate on proposing a distributed mechanism for discovering suitable service elements on-the-fly.

关键词： UBIQUITOUS computing COMPUTER programming distributed computing EMBEDDED computer systems COMPUTER networks WIDE area networks (Computer networks) distributed shared memory COMPUTERS SYSTEMS development EMBEDDED computer systems -- Programming

来源：评论

学校读者我要写书评

暂无评论

On minimal connectivity requirements for secure message transmission in directed networks

引用

INFORMATION PROCESSING LETTERS 2018年 131卷 1-6页

作者： Kishore, Ravi Vanarasa, Chiranjeevi Kannan, Srinathan Int Inst Informat Technol Hyderabad 500032 Telangana India IIIT H C STAR A3-107 Hyderabad 500032 Telangana India

In a synchronous distributed network of n nodes, the goal of a Secure Message Transmission (SMT) protocol is to securely deliver the sender's message at the receiver's end in the presence of a computationally unbounded adversary that can partially control the network by corrupting some of its nodes (except the sender and the receiver). In a network modelled as a directed graph, to achieve unconditional security tolerating t(b) Byzantine faults, it is known that: (1) if all the paths are one-way connected from the sender to the receiver - called as forward channels - then 2t(b) +1 vertex-disjoint forward channels are necessary and sufficient (2) for 1 <= u <= tb, if there exist 2t(b) + 1 u vertex-disjoint forward channels then u vertex-disjoint paths from the receiver to the sender - known as feedback channels - are necessary and sufficient. Moreover, similar characterization exists for tolerating mixed faults - up to t(f) fail-stop faults in addition to t(p) passive faults. We notice that these results characterized the networks by studying the required number of extra vertex-disjoint feedback channels, conditioned on the existence of a certain number of forward channels. In this work, we give a generic characterization without attaching any such if condition. Specifically, we answer the following questions. In a given directed graph, that is abstracted as a collection of strong paths from S to R and R to S, under what conditions is SMT (im)possible tolerating: (1) up to t(p) passive faults?, (2) mixed faults - up to t(f) fail-stop faults in addition to tp passive faults?, and (3) up to t(b) Byzantine faults? Also, for each of these three problems, we explicitly show that there are networks in which SMT protocols exist whereas the existing results do not characterize such networks. (C) 2017 Elsevier B.V. All rights reserved.

关键词： distributed computing Fault tolerance Secure communication Information theoretic security distributed computing

来源：评论

学校读者我要写书评

暂无评论

DIRECT COMPUTATION OF ULTRASOUND PHASED-ARRAY DRIVING SIGNALS FROM A SPECIFIED TEMPERATURE DISTRIBUTION FOR HYPERTHERMIA

引用

IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 1992年第8期39卷 825-835页

作者： MCGOUGH, RJ EBBINI, ES CAIN, CA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper presents a new method which obtains ultrasound hyperthermia applicator phased-array element driving signals from a desired temperature distribution. The approach combines a technique which computes array element driving signals from focal point locations and intensities with a new technique which calculates focal point locations and power deposition values from temperature requirements. Temperature specifications appear here as upper and lower bounds within the tumor volume, and a focal point placement algorithm chooses focal patterns capable of achieving the temperature range objective. The linear algebraic structure of the method allows rapid calculation of both the phased-array driving signals and an approximate temperature field response. Computer simulations verify the method with a spherical section array (SSA) for a variety of temperature specifications and blood perfusion values. This scheme, which applies to any phased-array geometry, completes an essential step in both treatment planning and feedback for hyperthermia with ultrasound phased-array applicators.

关键词： distributed computing Ultrasonic imaging Phased arrays Temperature distribution Hyperthermia Acoustic arrays Applicators Neoplasms Geometry Power generation

来源：评论

学校读者我要写书评

暂无评论

A DYNAMIC-PROGRAMMING APPROACH TO SEQUENTIAL PATTERN-RECOGNITION (REPRINTED FROM IEEE TRANSACTIONS ON ELECTRONIC-COMPUTERS, VOL EC-16, 1967

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1986年第3期8卷 313-326页

作者： FU, KS CHIEN, YT CARDILLO, GP AT&T BELL LABS HOLMDEL NJ 07733 USA PURDUE UNIV SCH ELECT ENGN W LAFAYETTE IN 47907 USA GEN RES CORP SANTA BARBARA CA USA

This paper presents the dynamic programming approach to the design of optimal pattern recognition systems when the costs of feature measurements describing the pattern samples are of considerable importance. A multistage or sequential pattern classifier which requires, on the average, a substantially smaller number of feature measurements than that required by an equally reliable nonsequential classifier is defined and constructed through the method of recursive optimization. Two methods of reducing the dimensionality in computation are presented for the cases where the observed feature measurements are 1) statistically independent, and 2) Markov dependent. Both models, in general, provide a ready solution to the optimal sequential classification problem. A generalization in the design of optimal classifiers capable of selecting a best sequence of feature measurements is also discussed. Computer simulated experiments in character recognition are shown to illustrate the feasibility of this approach.","doi":"10.1109/TPAMI.1986.4767794","publicationTitle":"IEEE Transactions on Pattern Analysis and Machine Intelligence","startPage":"313","endPage":"326","rightsLink":"http://***/AppDispatchServlet?publisherName=ieee&publication=0162-8828&title=A+Dynamic+Programming+Approach+to+Sequential+Pattern+Recognition&isbn=&publicationDate=May+1986&author=King-Sun+Fu&ContentID=10.1109/TPAMI.1986.4767794&orderBeanReset=true&startPage=313&endPage=326&volumeNum=PAMI-8&issueNum=3","displayPublicationTitle":"IEEE Transactions on Pattern Analysis and Machine Intelligence","pdfPath":"/iel5/34/4767784/***","keywords":[{"type":"IEEE Keywords","kwd":["Dynamic programming","Pattern recognition","Optimization methods","Character recognition","Cost function","Computational modeling","Computer simulation","distributed computing","Probability distribution","Telephony"]},{"type":"Author Keywords ","kwd":["pattern recognition","Dynamic programming","feature ordering","featur

关键词： Dynamic programming Pattern recognition Optimization methods Character recognition Cost function Computational modeling Computer simulation distributed computing Probability distribution Telephony Author Keywords pattern recognition Dynamic programming feature ordering feature selection finite sequential decision process optimal stopping rule

来源：评论

学校读者我要写书评

暂无评论

Shadow/Puppet Synthesis: A Stepwise Method for the Design of Self-Stabilization

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2016年第11期27卷 3338-3350页

作者： Klinkhamer, Alex Ebnenasir, Ali Michigan Technol Univ Dept Comp Sci Houghton MI 49931 USA

This paper presents a novel two-step method for automated design of self-stabilization. The first step enables the specification of legitimate states and an intuitive (but imprecise) specification of the desired functional behaviors in the set of legitimate states (hence the term "shadow"). After creating the shadow specifications, we systematically introduce the main variables and the topology of the desired self-stabilizing system. Subsequently, we devise a parallel and complete backtracking search towards finding a self-stabilizing solution that implements a precise version of the shadow behaviors, and guarantees recovery to legitimate states from any state. To the best of our knowledge, the shadow/puppet synthesis is the first sound and complete method that exploits parallelism and randomization along with the expansion of the state space towards generating self-stabilizing systems that cannot be synthesized with existing methods. We have validated the proposed method by creating both a sequential and a parallel implementation in the context of a software tool, called Protocon. Moreover, we have used Protocon to automatically design three new self-stabilizing protocols that we conjecture to require the minimal number of states per process to achieve stabilization (when processes are deterministic): 2-state maximal matching on bidirectional rings, 5-state token passing on unidirectional rings, and 3-state token passing on bidirectional chains.

关键词： Self-stabilization distributed computing program synthesis

来源：评论

学校读者我要写书评

暂无评论

SYSTEM SUPPORT FOR TIME-CRITICAL APPLICATIONS

引用

COMPUTER COMMUNICATIONS 1993年第10期16卷 619-636页

作者： NORTHCUTT, JD KUERNER, EM [a]Sun Microsystems Labs Inc. 2550 Garcia Avenue Building 29 Mountain View CA 94043 USA

A number of interesting applications have time constraints associated with them - most notably those in the area of multimedia. Today's workstations do not provide adequate support for applications whose definition of correctness is a function of time. This paper presents a set of system-level mechanisms that permit the incorporation of multiple streams of sustained, high-bandwidth, time-critical information into the distributed workstation computing environment. The goal of this work is to enable programmers to write applications that manipulate (i.e. acquire, transport, process, store and present) and synchronize time-critical information streams, and do so with an ease comparable to that of manipulating text or graphics on a workstation today. This paper provides a description of the different types of temporal relationships required by time-critical applications, and provides a means of expressing these relationships to the underlying system in a minimally constraining fashion (i.e. through a technique called 'loose synchronization'). The central concept behind the mechanisms described here is the notion of time-regulated transport of time-critical information being provided by means of mechanisms that are software analogues to Phase-Locked Loops (PLL).

关键词： distributed computing SYSTEM SUPPORT TIME-CRITICAL

来源：评论

学校读者我要写书评

暂无评论

Client-server model of integrated production facilities

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 1998年第12期36卷 3295-3321页

作者： Esfarjani, K Nof, SY Intel Corp Calif Technol & Mfg Grp Santa Clara CA 95052 USA

The objective of the reported research is to develop a new design-model of distributed facilities, where production is integrated and;operates under computer supported collaboration. The main innovation has been the exploitation of the analogy of the highly effective client-server computing environment for the benefit of production facilities design. As a variant of flexible manufacturing systems, the challenge is to manage the distributed material and information flow. The solution approach developed here is by protocols. The goal is to explain the design of the client-server production model and its coordination protocols, including functions of synchronization and resource allocation. An implementation of the model in an assembly and test facility and its application over the last three years serve to explain;the model and illustrate its-significance. Time-out and priority assignment protocols are defined and analysed in the context of the model to demonstrate its specific benefits.

关键词： distributed computing MANUFACTURING processes ELECTRONIC data processing

来源：评论

学校读者我要写书评

暂无评论

Automated expert multiexponential biomodeling interactively over the Internet

引用

COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE 2005年第2期79卷 169-178页

作者： Harless, C DiStefano, JJ Univ Calif Los Angeles Dept Comp Sci & Med Biocybernet Lab Los Angeles CA 90095 USA Univ Calif Los Angeles Biomed Engn Interdept Program Los Angeles CA 90095 USA

DIMSUM, an acronym for DIMension of a SUM of exponentials, is a highly automated expert system for fitting multiexponential models of increasing dimension to time series data. Up to now, a researcher has needed an individual copy of DIMSUM on his or her own computer as well as support to learn how to use it. W-3 DIMSUM, a new implementation of DIMSUM, is web-based, new territory for interactive biomodeling, allowing interactive multiexponential model building and model discrimination over the Internet. The algorithms used are numerically intensive, so we have implemented a distributed system, with numerical processing done on our server. Only the user interface is run on the client machine, but users can load and save data and results on their machines, facilitated by our use of Java WebStart. (c) 2005 Elsevier Ireland Ltd. All rights reserved.

关键词： Java World-Wide Web DIMSUM distributed computing client-server mathematical model discrimination

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Multi-Hop Clustering and Energy-Aware Routing Protocol for Efficient Resource Management in Renewable Energy Harvesting Wireless Sensor Networks

引用

IEEE ACCESS 2024年 12卷 137310-137332页

作者： Jalalinejad, Hoda Rohani Hajiabadi, Mahdi Asghar Rahmani Hosseinabadi, Ali Mirkamali, Seyedsaeid Abraham, Ajith Weber, Gerhard-Wilhelm Parikh, Jinal Islamic Azad Univ Dept Math & Comp Sci Bandar Abbas Branch Bandar Abbas *** Iran Islamic Azad Univ Fac Comp & Informat Technol Engn Qazvin Branch Qazvin *** Iran Univ Regina Dept Comp Sci Regina SK S4S 0A2 Canada Payame Noor Univ Dept Comp Engn & IT Tehran 193954697 Iran Bennett Univ Sch Artificial Intelligence Greater Noida 201310 Uttar Pradesh India Innopolis Univ Ctr Artificial Intelligence Innopolis 420500 Russia Poznan Univ Tech Fac Engn & Management PL-60965 Poznan Poland Ahmedabad Univ Amrut Mody Sch Management Technol Operat & Decis Sci Ahmadabad 380009 India

Energy Harvesting Wireless Sensor Networks (EH-WSNs) main goal is to increase efficiency in settings where Energy Harvesting (EH) is restricted by environmental resources. To solve the drawbacks of conventional Wireless Sensor Networks (WSNs) routing methods that usually ignore EH, this work presents a multi-hop clustering and renewable energy-based routing protocol designed for EH-WSNs. The suggested method performs clustering both centralized and decentralized using energy circumstances and the quantity of captured energy. The protocol operates in three phases: cluster formation, data transmission, and centralized management. To evaluate the effectiveness of the proposed approach, we analyze three distinct scenarios with different settings. The findings show that the suggested approach greatly lowers the total network energy usage while allowing a higher number of nodes to stay operational. We find that our approach outperforms AEHAC, CRBS, HUCL, and EADUC in terms of average energy levels, overall efficiency, network stability, and number of live nodes during the simulation. The results taken together show that the suggested method continuously improves network efficiency and stability in all assessed situations.

关键词： Wireless sensor networks Sensors Clustering algorithms Routing Batteries Routing protocols Renewable energy sources Energy harvesting distributed computing clustering protocol energy harvesting energy-aware distributed computing

来源：评论

学校读者我要写书评

暂无评论

Federated Learning for Connected and Automated Vehicles: A Survey of Existing Approaches and Challenges

IEEE TRANSACTIONS ON INTELLIGENT VEHICLES

引用

IEEE TRANSACTIONS ON INTELLIGENT VEHICLES 2024年第1期9卷 119-137页

作者： Chellapandi, Vishnu Pandi Yuan, Liangqi Brinton, Christopher G. Zak, Stanislaw H. Wang, Ziran Purdue Univ Coll Engn W Lafayette IN 47907 USA

Machine learning (ML) is widely used for key tasks in Connected and Automated Vehicles (CAV), including perception, planning, and control. However, its reliance on vehicular data for model training presents significant challenges related to in-vehicle user privacy and communication overhead generated by massive data volumes. Federated learning (FL) is a decentralized ML approach that enables multiple vehicles to collaboratively develop models, broadening learning from various driving environments, enhancing overall performance, and simultaneously securing local vehicle data privacy and security. This survey paper presents a review of the advancements made in the application of FL for CAV (FL4CAV). First, centralized and decentralized frameworks of FL are analyzed, highlighting their key characteristics and methodologies. Second, diverse data sources, models, and data security techniques relevant to FL in CAVs are reviewed, emphasizing their significance in ensuring privacy and confidentiality. Third, specific applications of FL are explored, providing insight into the base models and datasets employed for each application. Finally, existing challenges for FL4CAV are listed and potential directions for future investigation to further enhance the effectiveness and efficiency of FL in the context of CAV are discussed.

关键词： Data models Surveys Federated learning Servers Training Internet of Things Data privacy Federated learning connected and automated vehicles distributed computing privacy protection data security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：