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

arXiv 2020年

作者： Zhu, Jianchen Zhang, Tong Zhao, Shengjie Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Software Engineering Tongji University Shanghai201804 China School of Electronic and Information Engineering Tongji University Shanghai201804 China

This paper aims at developing a clustering approach with spectral images directly from the compressive measurements of coded aperture snapshot spectral imager (CASSI). Assuming that compressed measurements often lie approximately in low dimensional subspaces corresponding to multiple classes, state of the art methods generally obtains optimal solution for each step separately but cannot guarantee that it will achieve the globally optimal clustering results. In this paper, a low-rank subspace representation (LRSR) algorithm is proposed to perform clustering on the compressed measurements. In addition, a subspace structured norm is added into the objective of low-rank representation problem exploiting the fact that each point in a union of subspaces can be expressed as a sparse linear combination of all other points and that the matrix of the points within each subspace is low rank. Simulation with real dataset illustrates the accuracy of the proposed spectral image clustering approach. Copyright © 2020, The Authors. All rights reserved.

关键词： Spectroscopy

来源：评论

学校读者我要写书评

暂无评论

Vision-based Semantic Mapping and Localization for Autonomous Indoor Parking

arXiv

引用

arXiv 2018年

作者： Huang, Yewei Zhao, Junqiao He, Xudong Zhang, Shaoming Feng, Tiantian Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai School of Surveying and Geo-Informatics Tongji University Shanghai China

In this paper, we proposed a novel and practical solution for the real-time indoor localization of autonomous driving in parking lots. High-level landmarks, the parking slots, are extracted and enriched with labels to avoid the aliasing of low-level visual features. We then proposed a robust method for detecting incorrect data associations between parking slots and further extended the optimization framework by dynamically eliminating suboptimal data associations. Visual fiducial markers are introduced to improve the overall precision. As a result, a semantic map of the parking lot can be established fully automatically and robustly. We experimented the performance of real-time localization based on the map using our autonomous driving platform TiEV, and the average accuracy of 0.3m track tracing can be achieved at a speed of 10kph. Copyright © 2018, The Authors. All rights reserved.

关键词： Indoor positioning systems

来源：评论

学校读者我要写书评

暂无评论

LSR-IGRU: Stock Trend Prediction Based on Long Short-Term Relationships and Improved GRU

arXiv

引用

arXiv 2024年

作者： Zhu, Peng Li, Yuante Hu, Yifan Liu, Qinyuan Cheng, Dawei Liang, Yuqi Department of Computer Science and Technology Tongji University Shanghai China Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Artificial Intelligence Laboratory Shanghai China Seek Data Group Emoney Inc Shanghai China

Stock price prediction is a challenging problem in the field of finance and receives widespread attention. In recent years, with the rapid development of technologies such as deep learning and graph neural networks, more research methods have begun to focus on exploring the interrelationships between stocks. However, existing methods mostly focus on the short-term dynamic relationships of stocks and directly integrating relationship information with temporal information. They often overlook the complex nonlinear dynamic characteristics and potential higher-order interaction relationships among stocks in the stock market. Therefore, we propose a stock price trend prediction model named LSR-IGRU in this paper, which is based on long short-term stock relationships and an improved GRU input. Firstly, we construct a long short-term relationship matrix between stocks, where secondary industry information is employed for the first time to capture long-term relationships of stocks, and overnight price information is utilized to establish short-term relationships. Next, we improve the inputs of the GRU model at each step, enabling the model to more effectively integrate temporal information and long short-term relationship information, thereby significantly improving the accuracy of predicting stock trend changes. Finally, through extensive experiments on multiple datasets from stock markets in China and the United States, we validate the superiority of the proposed LSR-IGRU model over the current state-of-the-art baseline models. We also apply the proposed model to the algorithmic trading system of a financial company, achieving significantly higher cumulative portfolio returns compared to other baseline methods. Our sources are released at https://***/ZP1481616577/Baselines_LSR-IGRU. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of DSP Cache

Design and Implementation of DSP Cache

引用

International Conference on Communication Technology (ICCT)

作者： Kunkun Liang Jun Wu Haoqi Ren Zhifeng Zhang Bin Tan Electronics and Information Engineering College Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China School of Computer Science Fudan University Shanghai China College of Electronics and Information Engineering Jinggangshan University Ji'an China

ISBN: (纸本)9781665432078

The cache can improve the DSP processor's access speed to external memory and solve the “Storage Wall” problem. Designing an efficient and flexible cache module plays an vital role in improving the memory access efficiency and overall performance of the DSP. Based on the analysis of DSP storage level design requirements, combined with the actual pipeline structure of the DSP processor SWIFT independently developed by our laboratory, in this paper, we design and implement first- level instruction and data cache. For L1 D-Cache, the relevant conflict detection and processing module is designed to support four parallel Load/Store access requests. The size of the cache can be flexibly configured according to actual application requirements to achieve a balance between power consumption and latency. To write back the modified data left in the cache before the cache size is changed, the Cacheclean instruction is designed. Finally, module-level functional verification and logic synthesis are carried out. The results show that the cache function meets expectations, and the critical path after logic synthesis optimization meets the requirement of 1GHz frenuency.

关键词： Frequency synthesizers Power demand Instruction sets Conferences Pipelines Memory management Process control

来源：评论

学校读者我要写书评

暂无评论

Predictive Resilience Assessment of Road Networks Based on Dynamic Multi-Granularity Graph Neural Network

SSRN

引用

SSRN 2024年

作者： Zang, Di Ding, Yongjie Zhao, Jiayi Tang, Keshuang Zhu, Hong Key Laboratory of Embedded System and Service Computing Ministry of Educaiton Department of Computer Science and Technology Tongji University No. 4800 Cao’an Road Shanghai China Key Laboratory of Road and Traffic Engineering Ministry of Education College of Transportation Engineering Tongji University No. 4800 Cao’an Road Shanghai China

Due to the influence of global climate anomalies, abnormal weather conditions such as heavy rainfall have become more frequent in recent years, posing a significant threat to the operation of transportation systems. An effective assessment of the resilience of the transportation system before and during heavy rain can alert the transportation department to take necessary emergency actions. However, existing methods for assessing the rainfall resilience of transportation networks mostly suffer from the following problems: 1) Simulation methods for modeling rainfall impacts lack realism;2) After-the-fact evaluations of resilience cannot offer advance warning prior to or during a heavy rain event. To address above problems, we present a novel resilience assessment methodology for evaluating the resilience of road networks in real-time during heavy rainfall scenarios. In this methodology, we propose the temporal decomposition-based dynamic multi-granularity graph neural network (TD2MG2NN) for long-term traffic speed forecasting, providing a perspective on the future evolution of traffic states for accurate resilience assessment. In addition, we construct a composite traffic resilience indicator, designed to comprehensively reflect changes in the spatial-temporal resilience of the transportation system during heavy rain. Experimental results on four publicly real datasets indicate that the prediction performance of TD2MG2NN outperforms state-of-the-art models. The assessment results for the transportation road network in California demonstrate that the comprehensive resilience indicator is superior to single functional resilience indicator and the real-time methodology for evaluating resilience can accurately depict and predict the operation of the road network system under heavy rainfall scenarios. © 2024, The Authors. All rights reserved.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Extracting all minimal siphons from maximal unmarked siphons...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： ShouGuang Wang MengChu Zhou ChengYing Wang College of Information & Electronic Engineering Zhejiang Gongshang University Hangzhou China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods.

关键词： system recovery Algorithm design and analysis Petri nets Educational institutions Manufacturing systems Software algorithms Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Maximally permissive control of flexible manufacturing systems with fewest disjunctive constraints

Maximally permissive control of flexible manufacturing syste...

引用

2012 International Conference onAdvanced Mechatronic systems, ICAMechS 2012

作者： Chen, YuFeng Zhou, MengChu Li, XiaoOu School of Electro-Mechanical Engineering Xidian University Xi'an 710071 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States Departamento de Computación CINVESTAV-IPN Av. IPN 2508 Col. Zacatenco México DF C.P. 07360 Mexico

ISBN: (纸本)9780955529382

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. © 2012 Intl Jrnal Advanced Mech.

关键词： Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

A distributed SVM ensemble for image classification and annotation

A distributed SVM ensemble for image classification and anno...

引用

International Conference on Fuzzy systems and Knowledge Discovery (FSKD)

作者： Nasullah Khalid Alham Maozhen Li Yang Liu Mahesh Ponraj Man Qi School of Engineering and Design Brunel University Uxbridge UK The Key Laboratory of Embedded Systems and Service Computing Ministry of Education University of Tongji China Department of Computing Canterbury Christ Church University Canterbury Kent UK

Combination of classifiers leads to a substantial reduction of classification errors in a wide range of applications. Among them SVM ensembles with bagging have shown better performance in classification than a single SVM. However, the training process of SVM ensembles is notably computationally intensive especially when the number of replicated training datasets is large. This paper presents MRESVM, a MapReduce based distributed SVM ensemble algorithm for image annotation which re-samples the training dataset based on bootstrapping and trains SVM on each dataset in parallel using a cluster of computers. MRESVM is evaluated in a experimental environment and the results show that the MRESVM algorithm reduces the training time significantly while achieves high level of accuracy in classifications.

关键词： Support vector machines Training Bagging Classification algorithms Accuracy Algorithm design and analysis Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

DL-SLOT: Dynamic Lidar SLAM and Object Tracking Based On Graph Optimization

arXiv

引用

arXiv 2022年

作者： Tian, Xuebo Zhao, Junqiao Ye, Chen Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Institute of Intelligent Vehicles Tongji University Shanghai China

Ego-pose estimation and dynamic object tracking are two key issues in an autonomous driving system. Two assumptions are often made for them, i.e. the static world assumption of simultaneous localization and mapping (SLAM) and the exact ego-pose assumption of object tracking, respectively. However, these assumptions are difficult to hold in highly dynamic road scenarios where SLAM and object tracking become correlated and mutually beneficial. In this paper, DL-SLOT, a dynamic Lidar SLAM and object tracking method is proposed. This method integrates the state estimations of both the ego vehicle and the static and dynamic objects in the environment into a unified optimization framework, to realize SLAM and object tracking (SLOT) simultaneously. Firstly, we implement object detection to remove all the points that belong to potential dynamic objects. Then, LiDAR odometry is conducted using the filtered point cloud. At the same time, detected objects are associated with the history object trajectories based on the time-series information in a sliding window. The states of the static and dynamic objects and ego vehicle in the sliding window are integrated into a unified local optimization framework. We perform SLAM and object tracking simultaneously in this framework, which significantly improves the robustness and accuracy of SLAM in highly dynamic road scenarios and the accuracy of objects' states estimation. Experiments on public datasets have shown that our method achieves better accuracy than A-LOAM. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

A Relational Taxonomy of services for Large Scale service Repositories

A Relational Taxonomy of Services for Large Scale Service Re...

引用

IEEE International Conference on Web services (ICWS)

作者： Yan Wu Chungang Yan Zhijun Ding Pengwei Wang Changjun Jiang Mengchu Zhou Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China School of Electronics and Information Engineering Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

With the rapid development of service-oriented computing (SOC) and service-oriented architecture (SOA), the number of services is rapidly increasing. How to organize and manage services effectively in repositories to improve the efficiency of service discovery and composition is important. This paper proposes three categorization rules to classify services for a large scale repository to form a relational taxonomy. The service retrieve scope can be drastically narrowed by this taxonomy. Therefore, the efficiency of service discovery and service composition can be greatly improved. We evaluate and compare the performance of the proposed method and other related ones via a publicly available test set, ICEBE05. The experimental results validate the effectiveness and high efficiency of the proposed one.

关键词： Taxonomy Web services Educational institutions system-on-a-chip Quality of service Conferences Computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：