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

16th ACM Conference on Hypertext and Hypermedia, HT 2005

作者： Cristea, Alexandra Stewart, Craig Ashman, Helen Cristea, Paul Information System Department Faculty of Mathematics and Computing Science Technical University Eindhoven Den Dolech 2 PO Box 513 5600 MB Eindhoven Netherlands School of Computer Science and IT University of Nottingham Jubilee Campus Wollaton Road Nottingham NG8 1BB United Kingdom Digital Signal Processing Laboratory Politehnica University of Bucharest Spl. Independentei 313 Bucharest 77206 Romania

ISBN: (纸本)1595931686

Conversion between different adaptive hypermedia systems has barely been proposed, yet alone tested in realistic settings. This paper presents the evaluation of the interoperability of two adaptive (educational) hypermedia systems, MOT and WHURLE. The evaluation is performed with the help of a class of thirty-one students enrolled in the fourth year of the "Politehnica" University of Bucharest, who were taking a one-week intensive course on Adaptive Hypermedia. This paper describes and interprets our first experiments of the "write once, deliver many" paradigm of adaptive hypermedia creation. Copyright 2005 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

A Cloaking-Based Approach to Protect Location Privacy in Location-Based Services

A Cloaking-Based Approach to Protect Location Privacy in Loc...

引用

第三十三届中国控制会议

作者： Zheng Jiangyu Tan Xiaobin Cliff Zou Niu Yukun Zhu Jin CAS Key Laboratory of Technology in Geo-spatial Information Processing and Application System University of Science and Technology of China Department of Automation University of Science and Technology of China Department of Electrical Engineering and Computer Science University of Central FloridaOrlandoFL 32816-2362

ISBN: (纸本)9781479947249

With the widespread use of mobile devices, the location-based service(LBS) applications become increasingly popular, which introduces the new security challenge to protect user's location privacy. On one hand, a user expects to report his own location as far as possible away from his real location to protect his location privacy. On the other hand, in order to obtain high quality of service(QoS), users are required to report their locations as accurate as possible. To achieve the dedicated tradeoff between privacy requirement and QoS requirement, we propose a novel approach based on cloaking technique. We also discuss the disadvantage of the traditional general system model and propose an improved model. The basic idea of our approach is to select a sub-area from the generated cloaking area as user's reported location. The sub-area may not contain a user's real location,which prevents an adversary from performing attack with side information. Specifically, by defining an objective function with a novel location privacy metric and a QoS metric, we are able to convert the privacy issue to an optimization problem. Then, location privacy metric and QoS metric are given. To reduce the complexity of the optimization, a heuristic algorithm is *** privacy-preserving analysis and comparison with related work [8], we demonstrate the effectiveness and efficiency of our approach.

关键词： Location-based Services,Location Privacy,k-anonymity,Cloaking Area

来源：评论

学校读者我要写书评

暂无评论

Sleep When Everything Looks Fine: Self-Triggered Monitoring for Signal Temporal Logic Tasks

arXiv

引用

arXiv 2023年

作者： Wang, Chuwei Yu, Xinyi Zhao, Jianing Lindemann, Lars Yin, Xiang Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai200240 China Department of Computer Science University of Southern California Los AngelesCA90089 United States

Online monitoring is a widely used technique in assessing if the performance of the system satisfies some desired requirements during run-time operation. Existing works on online monitoring usually assume that the monitor can acquire system information periodically at each time instant. However, such a periodic mechanism may be unnecessarily energy-consuming as it essentially requires to turn on sensors consistently. In this paper, we proposed a novel self-triggered mechanism for model-based online monitoring of discrete-time dynamical system under specifications described by signal temporal logic (STL) formulae. Specifically, instead of sampling the system state at each time instant, a self-triggered monitor can actively determine when the next system state is sampled in addition to its monitoring decision regarding the satisfaction of the task. We propose an effective algorithm for synthesizing such a self-triggered monitor that can correctly evaluate a given STL formula on-the-fly while maximizing the time interval between two observations. We show that, compared with the standard online monitor with periodic information, the proposed self-triggered monitor can significantly reduce observation burden while ensuring that no information of the STL formula is lost. Case studies are provided to illustrate the proposed monitoring mechanism. Copyright © 2023, The Authors. All rights reserved.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Distributed MPC for Tracking based on Reference Trajectories

Distributed MPC for Tracking based on Reference Trajectories

引用

第三十三届中国控制会议

作者： Langwen Zhang Jingcheng Wang Zhengfeng Liu Kang Li Department of Automation Shanghai Jiao Tong Universityand Key Laboratory of System Control and Information ProcessingMinistry of Education of China School of Electronics Electrical Engineering and Computer Science Queen's University Belfast

ISBN: (纸本)9781479947249

In this paper, we consider the control of large-scale processes with both input and state couplings. A distributed model predictive control(MPC) strategy for tracking based on the reference trajectories is presented. The proposed distributed MPC strategy requires decomposing a large-scale system into several smaller ones and solving convex optimization problems independently. Distributed MPC tracking strategies for unconstrained and constrained processes are presented, respectively. An iterative algorithm is presented to coordinate the distributed MPC controllers. The proposed algorithm is applied to a four-tank process to demonstrate the effectiveness.

关键词： distributed MPC tracking iterative algorithm reference trajectories

来源：评论

学校读者我要写书评

暂无评论

On stability analysis and synthesis of reset control systems with output uncertainties

On stability analysis and synthesis of reset control systems...

引用

第三十三届中国控制会议

作者： Guanglei Zhao Jingcheng Wang Kang Li Department of Automation Shanghai Jiao Tong Universityand Key Laboratory of System Control and Information ProcessingMinistry of Education of China School of Electronics Electrical Engineering and Computer ScienceQueens University BelfastUK

ISBN: (纸本)9781479947249

This paper considers reset control systems with output *** present sufficient conditions for the quadratic stability and finite L2 gain ***,the results are extended to piecewise quadratic stability which is much less ***,an iterative algorithm is proposed to design the reset *** the obtained results are given as linear matrix inequalities(LMIs) that can be solved *** examples are given to illustrate the results.

关键词： reset control output uncertainties quadratic stability iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Symmetric Non-negative Matrix Factorization Based Link Partition Method for Overlapping Community Detection

Symmetric Non-negative Matrix Factorization Based Link Parti...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Xiang Zhang Naiyang Guan Wenju Zhang Xuhui Huang Shuyi Wu Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Hunan P.R. China Institute of Software College of Computer National University of Defense Technology Hunan P.R. China Department of Computer Science and Technology College of Computer National University of Defense Technology Hunan P.R. China

ISBN: (纸本)9781479986989

Partitioning links rather than nodes is effective in overlapping community detection (OCD) on complex networks. However, it consumes high CPU and memory overheads because the volume of links is huge especially when the network is rather complex. In this paper, we proposes a symmetric non-negative matrix factorization (SNMF) based link partition method called SNMF-Link to overcome this deficiency. In particular, SNMF-Link represents data in a lower-dimensional space spanned by the node-link incidence matrix. By solving a lighter SNMF problem, SNMF-Link learns the clustering indicators of each links. Since traditional multiplicative update rule (MUR) based optimization algorithm for SNMF suffers from slow convergence, we applied the augmented Lagrangian method (ALM) to efficiently optimize SNMF. Experimental results show that SNMF-Link is much more efficient than the representative clustering algorithms without reducing the OCD performance.

关键词： Symmetric matrices Convergence Optimization Partitioning algorithms Chlorine Complex networks Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Correntropy induced metric based graph regularized non-negative matrix factorization

Correntropy induced metric based graph regularized non-negat...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Bin Mao Naiyang Guan Dacheng Tao Xuhui Huang Zhigang Luo College of Science National University of Defense Technology Changsha China College of Computer National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha China Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW Australia

Non-negative matrix factorization (NMF) is an efficient dimension reduction method and plays an important role in many pattern recognition and computer vision tasks. However, conventional NMF methods are not robust since the objective functions are sensitive to outliers and do not consider the geometric structure in datasets. In this paper, we proposed a correntropy graph regularized NMF (CGNMF) to overcome the aforementioned problems. CGNMF maximizes the correntropy between data matrix and its reconstruction to filter out the noises of large magnitudes, and expects the coefficients to preserve the intrinsic geometric structure of data. We also proposed a modified version of our CGNMF which construct the adjacent graph by using sparse representation to enhance its reliability. Experimental results on popular image datasets confirm the effectiveness of CGNMF.

关键词： Robustness Vectors Clustering algorithms Mutual information Measurement computer integrated manufacturing

来源：评论

学校读者我要写书评

暂无评论

An improved parameterized approach for real time optimal motion planning of AUV moving in dynamic environment

An improved parameterized approach for real time optimal mot...

引用

IEEE Conference on Robotics, Automation and Mechatronics

作者： Wenhao Luo Jun Peng Jing Wang Department of Automation Key Laboratory of System Control And Information Processing Shanghai China School of Information Science and Engineering Hunan Engineering Laboratory Changsha China Computer Engineering Program Bethune-Cookman University Daytona Beach FL USA

In this paper, we present an improved analytic method to the optimal trajectory generation of an autonomous underwater vehicle (AUV) in a dynamic environment. The proposed approach explicitly incorporates both the AUV kinematic and the geometric constraints due to dynamic obstacles and the terrain while rendering the near-shortest path by a performance index related to the path length. In particular, the proposed design is based on a family of parameterized trajectories determined by three adjustable parameters, which provides a unified way to reformulate the geometric constraints and performance index into a set of parameterized constraint equations. To that end, such a constrained optimization problem boils down to optimize those adjustable parameters, which can be analytically solved in the parameter space. The proposed solution enhances the methodologies of real-time path planning for robots in 3D environment. Simulation results verify the effectiveness of the proposed method.

关键词： Trajectory Planning Vehicle dynamics Dynamics Collision avoidance Kinematics Optimization

来源：评论

学校读者我要写书评

暂无评论

Locality Protected Dynamic Cache Allocation Scheme on GPUs

Locality Protected Dynamic Cache Allocation Scheme on GPUs

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yang Zhang Zuocheng Xing Li Zhou Chunsheng Zhu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China School of Electronic Science and Engineering National University of Defense Technology Changsha China Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

ISBN: (纸本)9781509032068

As we are approaching the exascale era in supercomputing, designing a balanced computer system with powerful computing ability and low energy consumption becomes increasingly important. GPU is a widely used accelerator in most recently applied supercomputers. It adopts massive multithreads to hide long latency and has high energy efficiency. In contrast to its strong computing power, GPUs have few on-chip resources with several MB of fast on-chip memory storage per SM (Streaming Multiprocessors). GPU caches exhibit poor efficiency due to the mismatch of the throughput-oriented execution model and its cache hierarchy design. Since the severe deficiency in on-chip memory, the benefit of high computing capacity of GPUs is pulled down by the poor cache performance dramatically, which limits system performance and energy-efficiency. In this paper, we put forward a locality protected scheme to make full use of the data locality based on the fixed capacity. We present a Locality Protected method based on instruction PC (LPP) to promote GPU performance. Firstly, we use a PC-based collector to collect the reuse information of each cache line. After getting the dynamic reuse information of the cache line, we take an intelligent cache allocation unit (ICAU) which coordinates the reuse information with LRU (Least Recently Used) replacement policy to find out the cache line with the least locality for eviction. The results show that LPP provides an up to 17.8% speedup and an average of 5.5% improvement over the baseline method.

关键词： Graphics processing units system-on-chip computer architecture Instruction sets Resource management Optimization Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Topology inference for multi-agent cooperation under unmeasurable latent input

arXiv

引用

arXiv 2020年

作者： Jiao, Qing Li, Yushan He, Jianping Shi, Ling Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong

Topology inference is a crucial problem for cooperative control in multi-agent systems. Different from most prior works, this paper is dedicated to inferring the directed network topology from the observations that consist of a single, noisy and finite time-series system trajectory, where the cooperation dynamics is stimulated with the initial network state and the unmeasurable latent input. The unmeasurable latent input refers to intrinsic system signal and extrinsic environment interference. Considering the time-invariant/varying nature of the input, we propose two-layer optimization-based and iterative estimation-based topology inference algorithms (TO-TIA and IE-TIA), respectively. TO-TIA allows us to capture the separability of global agent state and eliminates the unknown influence of time-invariant input on system dynamics. IE-TIA further exploits the identifiability and estimability of more general time-varying input and provides an asymptotic solution with desired convergence properties, with higher computation cost compared with TO-TIA. Our novel algorithms relax the dependence of observation scale and leverage the empirical risk reformulation to improve the inference accuracy in terms of the topology structure and edge weight. Comprehensive theoretical analysis and simulations for various topologies are provided to illustrate the inference feasibility and the performance of the proposed algorithms. Copyright © 2020, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：