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

International Conference on Advanced Mechatronic systems (ICAMechS)

作者： YuFeng Chen MengChu Zhou XiaoOu Li School of Electro-Mechanical Engineering Xidian University Xi'an China Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA Departamento de Computacion CINVESTAVIPN Mexico Distrito Federal Mexico

For Petri net models whose legal reachability spaces are non-convex, one cannot optimally control them by the conjunctions of linear constraints. This work proposes a method to find a set of linear constraints such that each constraint can forbid all first-met bad markings and every legal marking satisfies at least one constraint. Then, the disjunctions of the obtained constraints can make all legal markings reachable and forbid all first-met bad markings, i.e., the controlled net is live and maximally permissive. The work also develops an integer linear programming model to minimize the number of the constraints. Finally, an example is provided to illustrate the proposed method.

关键词： Law Optimal control Vectors Aerospace electronics Petri nets system recovery

来源：评论

学校读者我要写书评

暂无评论

Battery discharge characteristics of wireless sensors in building applications

Battery discharge characteristics of wireless sensors in bui...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Wenqi Guo William M. Healy Meng Chu Zhou Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA National Institute for Standards and Technology Gaithersburg MD USA Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China ECE Department New Jersey Institute of Technology Newark NJ USA

Sensor nodes in wireless networks often use batteries as their source of energy, but replacing or recharging exhausted batteries in a deployed network can be difficult and costly. Therefore, prolonging battery life becomes a principal objective in the design of wireless sensor networks (WSNs). There is little published data that quantitatively analyze a sensor node's lifetime under different operating conditions. This paper presents several experiments to quantify the impact of key wireless sensor network design and environmental parameters on battery performance. Our testbed consists of MicaZ motes, commercial alkaline batteries, and a suite of techniques for measuring battery performance. We evaluate known parameters, such as communication distance, working channel and operating power that play key roles in battery performance. Through extensive real battery discharge measurements, we expect our results to serve as a quantitative basis for future research in designing and implementing battery-efficient sensing applications and protocols.

关键词： Batteries Wireless sensor networks Discharges (electric) Sensor phenomena and characterization Battery charge measurement Voltage measurement

来源：评论

学校读者我要写书评

暂无评论

A cross layer collaborating cache scheme to improve performance of HTTP clients in MANETs

引用

International Journal of u- and e- service, Science and Technology 2013年第6期6卷 51-57页

作者： Liu, Jin Ren, Hongmin Wang, Jin Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Shanghai International Shipping Institute Shanghai Maritime University Shanghai China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China College of Information Engineering Shanghai Maritime University Shanghai China

This paper proposes a novel cross layer collaborating cache scheme for HTTP clients. It is designed to accelerate the process that an HTTP client retrieves Web content in mobile ad hoc network environment. Unlike other techniques to exploit Web proxy caching or to build P2P protocol overlay to improve HTTP, our scheme incorporates collaboratively working capability into the HTTP client response cache, and thus there is no impact on the compatibility of upper level applications. In addition, as the sharing file information is diffused with routing information, there is no redundant traffic to maintain the cooperating cache mechanism. Using this scheme, cacheable Web content can be distributed among local peers and retrieved later by a client if needed. In our simulation results, this novel cache scheme significantly decreases the latency experienced by a client to download Web content. © 2013 SERSC.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

General capacity scaling of wireless networks

General capacity scaling of wireless networks

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Panlong Yang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China People''s Liberation Army University of Science and Technology China

We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions denoted by (λ ∈ [1, n], n d ∈ [1, n], n s ∈ (1, n]). It means that: (1) We study the random network of a general node density λ ∈ [1, n], rather than only study either random dense network (RDN, λ = n) or random extended network (REN, λ = 1) as in the literature. (2) We focus on the multicast capacity to unify unicast and broadcast capacities by setting the number of destinations for each session as a general value n d ∈ [1, n]. (3)We allow the number of sessions changing in the range n s ∈ (1, n], rather than assume that n s = Θ(n) as in the *** derive the general lower bounds on the capacity for the arbitrary case of (λ, n d , n s ). Particularly, we show that for the special cases (λ = 1, n d ∈ [1, n], n s = n) and (λ = n, n d ∈ [1, n], n s = n), our schemes achieve the highest multicast throughputs proposed in the existing works.

关键词： Roads Routing Throughput Lattices Schedules Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Memory-Based Contrastive Learning with Optimized Sampling for Incremental Few-Shot Semantic Segmentation

Memory-Based Contrastive Learning with Optimized Sampling fo...

引用

IEEE International Symposium on Circuits and systems (ISCAS)

作者： Yuxuan Zhang Miaojing Shi Taiyi Su Hanli Wang Department of Computer Science & Technology Tongji University Shanghai P. R. China Key Laboratory of Embedded System & Service Computing Ministry of Education Tongji University Shanghai P. R. China Department of Control Science & Engineering Tongji University Shanghai P. R. China

ISBN: (数字)9798350330991

ISBN: (纸本)9798350331004

Incremental few-shot semantic segmentation (IFSS) aims to incrementally expand a semantic segmentation model’s ability to identify new classes based on few samples. However, it grapples with the dual challenges of catastrophic forgetting (due to feature drift in old classes) and overfitting (triggered by inadequate samples in new classes). To address these issues, a novel approach is proposed to integrate pixel-wise and region-wise contrastive learning, complemented by an optimized example and anchor sampling strategy. The proposed method incorporates a region memory and pixel memory designed to explore the high-dimensional embedding space more effectively. The memory, retaining the feature embeddings of known classes, facilitates the calibration and alignment of seen class features during the learning process of new classes. To further mitigate overfitting, the proposed approach implements an optimized example and anchor sampling strategy. Extensive experiments show the competitive performance of the proposed method. The source code of this work can be found in https://***.

关键词： Circuits and systems Semantic segmentation Source coding Semantics Calibration

来源：评论

学校读者我要写书评

暂无评论

Provably Convergent Federated Trilevel Learning

arXiv

引用

arXiv 2023年

作者： Jiao, Yang Yang, Kai Wu, Tiancheng Jian, Chengtao Huang, Jianwei Department of Computer Science and Technology Tongji University China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University China Shanghai Research Institute for Intelligent Autonomous Systems China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

Trilevel learning, also called trilevel optimization (TLO), has been recognized as a powerful modelling tool for hierarchical decision process and widely applied in many machine learning applications, such as robust neural architecture search, hyperparameter optimization, and domain adaptation. Tackling TLO problems has presented a great challenge due to their nested decision-making structure. In addition, existing works on TLO face the following key challenges: 1) they all focus on the non-distributed setting, which may lead to privacy breach;2) they do not offer any non-asymptotic convergence analysis which characterizes how fast an algorithm converges. To address the aforementioned challenges, this paper proposes an asynchronous federated trilevel optimization method to solve TLO problems. The proposed method utilizes µ-cuts to construct a hyper-polyhedral approximation for the TLO problem and solve it in an asynchronous manner. We demonstrate that the proposed µ-cuts are applicable to not only convex functions but also a wide range of non-convex functions that meet the µ-weakly convex assumption. Furthermore, we theoretically analyze the non-asymptotic convergence rate for the proposed method by showing its iteration complexity to obtain ϵ-stationary point is upper bounded by (Formula Presented). Extensive experiments on real-world datasets have been conducted to elucidate the superiority of the proposed method, e.g., it has a faster convergence rate with a maximum acceleration of approximately 80%. Copyright © 2023, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Joint Transmit Power and Trajectory Optimization for Two-Way Multi-Hop UAV Relaying Networks

Joint Transmit Power and Trajectory Optimization for Two-Way...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Bing Li Shengjie Zhao Rongqing Zhang Hao Zhang Hanli Wang Liuqing Yang School of Software Engineering Tongji University Shanghai China National Mobile Communications Research Laboratory Southeast University China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China School of Electronic and Information Engineer Tongji University Shanghai China Department of Electrical & Computer Engineering Colorado State University CO USA

ISBN: (数字)9781728174402

ISBN: (纸本)9781728174419

Unmanned aerial vehicle (UAV) has been regarded as a promising means to supplement ground communications. As flying relays, UAVs can be rapidly and flexibly deployed to assist data transmissions in many practical scenarios. In this paper, we investigate a two-way multi-hop UAV relaying network, where there are two ground users as sources and multiple UAVs as relays to help the two ground sources exchange information. We first provide an efficient two-way multi-hop UAV relaying pattern, which can achieve a data rate of 2/4 data packets per time slot with decode-and-forward (DF) protocol. Then, we further formulate a joint transmit power and trajectory optimization problem for the UAVs in this two-way multi-hop relaying scenario. The formulated problem is non-convex which makes it difficult to solve directly, hence we propose an iterative algorithm to obtain an approximate optimal solution. Numerical results demonstrate that our proposed network achieves significant throughput gains.

关键词： Relays Protocols Throughput Trajectory optimization Data communication

来源：评论

学校读者我要写书评

暂无评论

Greedy signal space recovery algorithm with overcomplete dictionaries in compressive sensing

arXiv

引用

arXiv 2019年

作者： Zhu, Jianchen Zhao, Shengjie Shi, Qingjiang Arce, Gonzalo R. College of Electronics and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Software Engineering Tongji University Shanghai201804 China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

Compressive Sensing (CS) is a new paradigm for the efficient acquisition of signals that have sparse representation in a certain domain. Traditionally, CS has provided numerous methods for signal recovery over an orthonormal basis. However, modern applications have sparked the emergence of related methods for signals not sparse in an orthonormal basis but in some arbitrary, perhaps highly overcomplete, dictionary, particularly due to their potential to generate different kinds of sparse representation of signals. To this end, we apply a signal space greedy method, which relies on the ability to optimally project a signal onto a small number of dictionary atoms, to address signal recovery in this setting. We describe a generalized variant of the iterative recovery algorithm called Signal space Subspace Pursuit (SSSP) for this more challenging setting. Here, using the Dictionary-Restricted Isometry Property (D-RIP) rather than classical RIP, we derive a low bound on the number of measurements required and then provide the proof of convergence for the algorithm. The algorithm in noisy and noise-free measurements has low computational complexity and provides high recovery accuracy. Simulation results show that the algorithm outperforms best compared with the existing recovery algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Cross-Image Siamese Graph Convolutional Network For Fine-Grained Image Retrieval in Diabetic Retinopathy

SSRN

引用

SSRN 2023年

作者： Chen, Fang Zhao, Weiling Zhou, Xiaobo School of Electronics and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Biomedical Informatics The University of Texas Health Science Center at Houston HoustonTX77030 United States Center for Computational Systems Medicine

The categories of diabetic retinopathy (DR) are interrelated, and different ophthalmologists often give different results for the same fundus image. Automatic cross image retrieval of DR can provide an effective diagnostic solution for ophthalmologists and is of great significance in clinical practice. Cross-image (i.e. left and right fundus images for a patient) information is highly correlated and complementary and can be harnessed to improve various computer vision tasks such as image classification, object detection, image segmentation, and image retrieval. Previous studies did not explore the correlation between lesion areas in left and right fundus images of patients, limiting the effective diagnosis of DR. In this study, we proposed a cross-image siamese graph convolutional network(CIS-GCN) to retrieve fine-grained diabetic retinopathy fundus images. First, we constructed a global-specific structure to obtain the specific features of the left and right eyes. Then, we passed the specific features through the pathological localization network to obtain the location features of the lesion. Finally, a graph convolutional neural network was introduced to construct node sets for the left and right eyes, respectively, to represent relatively consistent regions in the fundus images of patients and learn their correlations. We tested our method using Diabetic Retinopathy Detection datasets and the results showed that our algorithm outperforms other state-of-the-art methods by 2.2% ~ 3.7% in image data retrieval. © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of three properties of mobile interactive systems based on variable Petri nets

arXiv

引用

arXiv 2021年

作者： Yang, Ru Ding, Zhijun Jiang, Changjun Zhou, MengChu The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University The Department of Computer Science and Technology Tongji University Shanghai201804 China The Institute of Systems Engineering Macau University of Science and Technology 999078 China The Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States

Due to the mobility and frequent disconnections, the correctness of mobile interaction systems, such as mobile robot systems and mobile payment systems, are often difficult to analyze. This paper introduces three critical properties of systems, called system connectivity, interaction soundness and data validity, and presents a related modeling and analysis method, based on a kind of Petri nets called VPN. For a given system, a model including component nets and interaction structure nets is constructed by using VPNs. The component net describes the internal process of each component, while the interaction structure net reflects the dynamic interaction between components. Based on this model, three properties are defined and analyzed. The case study of a practical mobile payment system shows the effectiveness of the proposed method. Copyright © 2021, The Authors. All rights reserved.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：