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

International Conference on Information systems and Computer Networks (ISCON)

作者： Zheyuan Wang Junli Wang Chungang Yan Ministry of Education Key Laboratory of Embedded System and Service Computing (Tongji University) Shanghai China National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai China

Software defined network (SDN) enables efficient and green traffic management by separating the control and data planes. However, the existing itemized scheduling approach is prone to waste of network resources and energy consumption due to the different sensitivity of traffic to time delay. To address these problems, we design a Slime Mould Algorithm based Energy-efficient Traffic Scheduling Method (SMA-ETSM) for SDN. First, we model the traffic scheduling problem with delay requirements to evaluate the decision. Second, in order to minimize the generation of invalid solutions in traffic scheduling, the encoding of the slime mould algorithm is improved, and a slime mould adaptation and update mechanism suitable for energy-efficient traffic scheduling is designed. The experiments show that SMA-ETSM can effectively reduce the energy consumption and improve the overall bandwidth utilization of the network compared with ECMP and ACO algorithm, and it also has some improvement in the operation efficiency compared with the original slime mould algorithm.

关键词： Energy consumption Sensitivity Processor scheduling Scheduling Energy efficiency Real-time systems Time factors

来源：评论

学校读者我要写书评

暂无评论

Reader Activation Scheduling in Multi-reader RFID systems: A Study of General Case

Reader Activation Scheduling in Multi-reader RFID Systems: A...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Shaojie Tang Cheng Wang Xiang-Yang Li Changjun Jiang Department of Computer Science Illinois Institute of Technology Chicago IL USA Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China

Radio frequency identification (RFID) is a technology where a reader device can "sense'' the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis.

关键词： Interference Radiofrequency identification Schedules Scheduling Processor scheduling Geometry Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Rough Set Approach to Grouping Goods in Electronic Commerce

A Rough Set Approach to Grouping Goods in Electronic Commerc...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Qiguo Duan Duoqian Miao The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Technology University of Tongji Shanghai China Department ofComputer Science and Technology University of Tongji Shanghai China

As electronic commerce (EC) become more and more prevalent to people, it is very critical to provide the right information to the right customers. The EC sites are generating large amount of data on customer purchases. Data mining techniques in EC domain is currently a hot research area. This paper proposes a rough set based approach to obtaining patterns of goods and classifying associated goods into groups, which can be used by the sites to group their goods according to the customers' preference and adopt appropriate selling policies.

关键词： Electronic commerce Set theory Data mining Computer science laboratories embedded system embedded computing Web pages Transaction databases Information systems

来源：评论

学校读者我要写书评

暂无评论

Detecting targets of variable acceleration with High Frequency Surface Wave Radar

Detecting targets of variable acceleration with High Frequen...

引用

International Radar Symposium (IRS)

作者： Gui renzhou Robert Weigel Key Laboratory of Embedded System and Service Computing Ministry of Education College of Electronics & Information Engineering University of Tongji Shanghai China Institute of Electronic Engineering Friedrich-Alexander-University of Erlangen-Nuremberg Erlangen Germany

ISBN: (纸本)9788372077578

According to the conventional hypothesis, the velocity of target in the coherent integration time (CIT) is invariable in the application of utilizing high frequency surface wave radar to detect target. First, this paper proposes a more proper hypothesis in which the velocity and acceleration of target are treated as time-varying. However the acceleration of target can be regarded as invariable within the small fraction of coherent integration time. Then the model of echo signal in the hypothesis is analyzed. Considering the disadvangtages of some conventional methods of time-frequency analysis such as short-time Fourier transform (STFT) and Wigner-Ville distribution (WVD), the paper proposes the method of time-frequency analysis based on chirplets signal decomposition which can improve the time and frequency resolution simultaneously and solve the cross-term problem in WVD method. Firstly, we process the small fraction of coherent integration time with the chirplets signal decomposition. Then according to the differences between target signal and ocean clutter echo, the BP neural network classifier can be exploited to suppress ocean clutter. The different fractions of coherent integration time are composed together with the method of the nearest correlation. Lastly, the feasibility of the method for detecting targets of variable acceleration is proved by its processing the actual data.

关键词： Time frequency analysis Acceleration Chirp Frequency modulation Oceans Radar Distance measurement

来源：评论

学校读者我要写书评

暂无评论

Property analysis of composable web services

Telkomnika (Telecommunication Computing Electronics and Cont...

引用

Telkomnika (Telecommunication computing Electronics and Control) 2016年第2期14卷 734-740页

作者： Liu, Wei Wang, Lu Du, Yuyue Wang, Pin Yan, Chun State Key Laboratory of Mining Disaster Prevention and Control Shandong University of Science and Technology Qingdao China College of Information Science and Engineering Shandong University of Science Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Web services are basic components constructing a flexible business process software. By composing multiple Web services, a complicated business process across organization and departments can be formed. This paper present a formal model of composable Web services: composed service process nets (CSPNs). Properties of Composable Web services are analyzed based on CSPNs. The relation between a CSPN and its corresponding Web service process subnets are discussed. The property analysis methods of CSPNs are come up with. A dynamic property of CSPNs can be determined based on static net structures by means of the proposed methods. © 2016 Universitas Ahmad Dahlan.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

MIME: Fast and Accurate Flow Information Compression for Multi-Spread Estimation

MIME: Fast and Accurate Flow Information Compression for Mul...

引用

International Conference on Network Protocols

作者： Hanwen Zhang He Huang Yu-E Sun Zhaojie Wang School of Computer Science & Technology Soochow University Suzhou China School of Rail Transportation Soochow University Suzhou China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Spread estimation is an essential issue in high-speed networks with wide applications, such as network billing, quality of service, anomaly detection, etc. As a promising technique, sketch can efficiently estimate per-flow spread with only a small memory cost. Many studies focus on improving the performance of sketches. However, these works primarily focus on optimizing the counter level or sketch level without considering the scenario of multi-spread estimation, which is crucial for improving memory utilization and detecting anomalies. In this paper, we propose an efficient flow information compression algorithm based on the on-chip/off-chip hybrid framework to estimate multiple flow spreads. In the on-chip memory, we filter out non-duplicates and sample them to the off-chip space for recording. In the off-chip memory, we compress each sampled non-duplicate to a carefully designed bit-cube. When the measurement is finished, we separate corresponding KV-flows from a specific flow based on the user query. Then, we rebuild this flow to a subset group based on the duplicate number of each KV-flow. Finally, according to the Multi-set theory, we derive an accurate multi-spread estimate formula to solve this issue with a high throughput and small on-chip memory usage. Furthermore, we evaluate the performance of our proposed estimator using real Internet traffic traces downloaded from CAIDA. Experiments show that, compared to the state-of-the-art, our proposal achieves a 97.2% lower average relative error in per-destination source flow spread estimation with a tight on-chip memory, e.g., 320KB. And our proposed method achieves 31.86 higher processing throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A three-stage method to find refining schedules of crude oil operations in refinery

A three-stage method to find refining schedules of crude oil...

引用

IEEE International Conference on service Operations and Logistics, and Informatics, SOLI

作者： Naiqi Wu LiPing Bai MengChu Zhou School of Mechatronics Engineering Guangdong University of Technology Guangzhou China MoE Key Laboratory of Embedded System and Service Computing University of Tongji Shanghai China ECE New Jersey Institute of Technology Newark NJ USA

A short-term scheduling problem for crude oil operations is highly challenging. There lack efficient techniques and software tools for its solution. Our prior research shows that it may be solved in a hierarchical way. At the upper level, we find a realizable refining schedule to optimize concerned objectives. At the lower level, a detailed schedule is obtained to realize it. This work attempts to present a three-stage method to solve the the upper level problem from a control perspective. The first stage solves a linear programming problem to determine the maximal production rate. The second one solves a transportation problem to optimally assign crude oil types and volume to the distillers. The last one adjusts and sequences oil parcels. Consequently, the proposed method is computationally efficient. An industrial case study is presented to show the result.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On multicast throughput scaling of hybrid wireless networks with general node density

引用

Computer Networks 2011年第15期55卷 3548-3561页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States TNLIST School of Software Tsinghua University China

In this paper, we consider hybrid wireless networks with a general node density λ ∈ [1, n ], where n ad hoc nodes are uniformly distributed and m base stations (BSs) are regularly placed in a square region A ( n , A ) = 1 , A × 1 , A with A ∈ [1, n ]. We focus on multicast sessions in which each ad hoc node as a user chooses randomly d ad hoc nodes as its destinations. Specifically, when d = 1 (or d = n − 1), a multicast session is essentially a unicast (or broadcast) session. We study the asymptotic multicast throughput for such a hybrid wireless network according to different cases in terms of m ∈ [1, n ] and d ∈ [1, n ], as n → ∞. To be specific, we design two types of multicast schemes, called hybrid scheme and BS - based scheme , respectively. For the hybrid scheme, there are two alternative routing backbones : sparse backbones and dense backbones . Particularly, according to different regimes of the node density λ = n A , we derive the thresholds in terms of m and d . Depending on these thresholds, we determine which scheme is preferred for the better performance of network throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm

引用

Journal of systems and Software 2011年第6期84卷 985-992页

作者： Qinma Kang Hong He Huimin Song Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China School of Information Engineering Shandong University at Weihai 180 Wenhua Xilu Weihai 264209 China School of Mathematics and Statistics Shandong University at Weihai Weihai 264209 China

A fundamental issue affecting the performance of a parallel application running on a heterogeneous computing system is the assignment of tasks to the processors in the system. The task assignment problem for more than three processors is known to be NP-hard, and therefore satisfactory suboptimal solutions obtainable in an acceptable amount of time are generally sought. This paper proposes a simple and effective iterative greedy algorithm to deal with the problem with goal of minimizing the total sum of execution and communication costs. The main idea in this algorithm is to improve the quality of the assignment in an iterative manner using results from previous iterations. The algorithm first uses a constructive heuristic to find an initial assignment and iteratively improves it in a greedy way. Through simulations over a wide range of parameters, we have demonstrated the effectiveness of our algorithm by comparing it with recent competing task assignment algorithms in the literature.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Behavioral Authentication for Security and Safety

arXiv

引用

arXiv 2023年

作者： Wang, Cheng Tang, Hao Zhu, Hangyu Zheng, Junhan Jiang, Changjun Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China

The issues of both system security and safety can be dissected integrally from the perspective of behavioral appropriateness. That is, a system is secure or safe can be judged by whether the behavior of certain agent(s) is appropriate or not. Specifically, a so-called appropriate behavior involves the right agent performing the right actions at the right time under certain conditions. Then, according to different levels of appropriateness and degrees of custodies, behavioral authentication can be graded into three levels, i.e., the authentication of behavioral Identity, Conformity, and Benignity. In a broad sense, for the security and safety issue, behavioral authentication is not only an innovative and promising method due to its inherent advantages but also a critical and fundamental problem due to the ubiquity of behavior generation and the necessity of behavior regulation in any system. By this classification, this review provides a comprehensive examination of the background and preliminaries of behavioral authentication. It further summarizes existing research based on their respective focus areas and characteristics. The challenges confronted by current behavioral authentication methods are analyzed, and potential research directions are discussed to promote the diversified and integrated development of behavioral authentication. Copyright © 2023, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：