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

International Conference on Information and Business Intelligence, IBI 2011

作者： Li, Dao-Guo Fan, Zhuo-Bin Chen, Yang School of Management Hangzhou Dianzi University Hangzhou 310018 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9783642290862

Existing representative research achievement of the relevant literatures focused on two *** is how to improve the efficiency of attribute reduction algorithms in all attributes including the added properties. Such as the recursive algorithm to change conjunctive normal form into disjunctive normal form based on the boolean matrix and the algorithm based on radix sorting for computing core and reductions of a given information system, etc. On the other hand focus on the objects recursive algorithms. The drawback is that these methods have not fully use the knowledge gained when some attributes was added to a discussion on the domain. Therefore, the regularity of the core and reduction's changes under adding new attributes into a given information system were discussed. Moreover, the incremental reduction algorithms from a information system was proposed. The experiments show that these algorithms can quickly and exactly calculate new core and reduction of the new information system by taking advantage of the knowledge of the original information system. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of table-manipulation method with constraints based on algebra-shape-computer thought

Reconstruction of table-manipulation method with constraints...

引用

International Conference on Mechanical Science and Engineering, ICMSE 2012

作者： Li, Dao Guo Fu, Bin Zhou, Zhong Yuan Yang, Chen School of Management Hangzhou Dianzi University Hangzhou 310018 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9783037854723

The table-manipulation method plays a important role in optimizing resource scheduling, scientifically location chosen, task assignment, investment distribution and so on. Most literatures introduction the table-manipulation method used to single thought pattern, for example, the algebra thought model, the shape thought model, or Computer software method, which cruse it is difficult to understand and apply. Therefore, a novel table-manipulation integration approach is proposed by combining the thought of algebra-shape-computer. This builds convenient access among the abstraction, modeling, solving on the practical optimizing problems discussed above. © (2012) Trans Tech Publications, Switzerland.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

WSHLA: Web services-based HLA collaborative simulation framework

WSHLA: Web services-based HLA collaborative simulation frame...

引用

4th International Conference on Cooperative Design, Visualization, and Engineering, CDVE 2007

作者： Hengye, Zhu Guangyao, Li Lulai, Yuan CAD Research Center Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

ISBN: (纸本)9783540747796

Collaborative simulation technology is an important factor in improving the efficiency of complex product design. Although High Level Architecture (HLA)-based simulation technology can meet the needs for simulation in product design, it's also marked by many deficiencies. In this paper, we focus on the introduction of web services into HLA simulation system and propose a Web services-Based HLA Collaborative Simulation Framework (WSHLA). The framework uses web services to encapsulate the invocations of HLA services and then make simulation system more interoperable and reusable. Firstly, the overall structure of WSHLA and the proxy, which acts on behalf of a federate and interacts with Runtime Infrastructure (RTI), are presented. Then, the detailed design and implementation process of WSHLA are discussed. Experimental results show that, using web services, the framework can make up for the deficiencies in HLA simulation system and ensure WSHLA-based collaborative simulation goes smoothly at the expense of some time. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Behavioral equivalence of security-oriented interactive systems

Behavioral equivalence of security-oriented interactive syst...

引用

作者： Liu, Guanjun Jiang, Changjun Department of Computer Science Tongji University Shanghai201804 China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Tongji University Shanghai201804 China

In the classical computation theory, the language of a system features the computational behavior of the system but it does not distinguish the determinism and nondeterminism of actions. However, Milner found that the determinism and nondeterminism affect the interactional behavior of interactive systems and thus the notion of language does not features the interactional behavior. Therefore, Milner proposed the notion of (weak) bisimulation to solve this problem. With the development of internet, more and more interactive systems occur in the world, such as electronic trading system. Security is one of the most important topics for these systems. We find that different security policies can also affect the interactional behavior of a system, which exactly is the reason why a good policy can strengthen the security. In other words, two interactive systems with different security policies are not of an equivalent behavior although their functions (or business processes) are identical. However, the classic (weak) bisimulation theory draws an opposite conclusion that their behaviors are equivalent. The notion of (weak) bisimulation is not suitable for these security-oriented interactive systems since it does not consider a security policy. This paper proposes the concept of secure bisimulation in order to solve the above problem. Copyright © 2016 The Institute of Electronics, Information and Communication Engineers.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

An enhanced two-factor user authentication in wireless sensor networks

引用

Telecommunication systems 2013年第1期55卷 105-113页

作者： Yuan, Jian-Jun Key Laboratory of Embedded System and Service Computing of Ministry of Education Tongji University Shanghai China

Since wireless sensor networks (WSN) are often deployed in an unattended environment and sensor nodes are equipped with limited computing power modules, user authentication is a critical issue when a user wants to access data from sensor nodes. Recently, M.L. Das proposed a two-factor user authentication scheme in WSN and claimed that his scheme is secure against different kinds of attack. Later, Khan and Alghathbar (K-A) pointed out that Das’ scheme has some security pitfalls and showed several improvements to overcome these weaknesses. However, we demonstrate that in the K-A-scheme, there is no provision of non-repudiation, it is susceptible to the attack due to a lost smart card, and mutual authentication between the user and the GW-node does not attained. Moreover, the GW-node cannot prove that the first message comes from the user. To overcome these security weaknesses of the K-A-scheme, we propose security patches and prove our scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Real-Time Communication Method for mHealth Base on Extended XMPP Protocol

引用

Communications and Network 2013年第3期5卷 590-595页

作者： Chenjie Shi Yu Fang The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Considering characteristic of mHealth communication and problems of existing methods, this paper presents a real-time communication method for mHealth based on extended XMPP protocol. The method can maintain the role status efficiently and reduce data latency during the communication process. Meanwhile, it can be extended flexibly to meet increasing communication demands of mHealth services. Furthermore, a system framework is presented to support telemonitoring scene. Finally, system implementation and feasibility tests verify the effectiveness of the method and framework.

关键词： mHealth XMPP Protocol Real-Time Communication

来源：评论

学校读者我要写书评

暂无评论

OpenDrift: Online Evolving Fraud Detection for Open-Category and Concept-Drift Transactions

OpenDrift: Online Evolving Fraud Detection for Open-Category...

引用

2023 IEEE International Conference on Web services, ICWS 2023

作者： Wang, Cheng Chai, Songyao Zhu, Hangyu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China Shanghai Artificial Intelligence Laboratory Shanghai China

ISBN: (纸本)9798350304855

The rapid growth of electronic commerce brings convenience to modern life but comes with security risks by various cybercrimes in online payment services. Most existing security methods for fraud detection depend on the static learning paradigm, which trains a model over a static training dataset and deploys the trained model for inference with the frozen model parameters under the i.i.d. assumption. Unfortunately, this paradigm becomes incommensurate with the increasingly complicated and varying fraud patterns due to the untimely and delayed responses in the offline environment. Without sensing the evolution of fraud timely, it is challenging to train and deploy targeted countermeasures. The emerging means of fraud are not only reflected in the openness of their category, but also in the drift of their superimposed risk features. The interweaving of open-category and concept drift accelerates the process of existing methods becoming powerless. In this paper, we propose EvoFD, an online evolving fraud detection framework to enable continual learning to cope with undercurrent surges of evolving fraud. The core idea of EvoFD is to weaken the bias caused by the anchoring effect on the learned information. It learns in an online streaming fashion by using instructive representations as anchors. Specially, we maintain the progressively updatable class anchors and optimize the representation network to embed features and class anchors into a unified normalized space, where the training and predicting can be conducted simultaneously or independently. In the framework, we preserve the balanced replay memory for each class to accumulate knowledge and avoid forgetting. The advantages of our method are validated by extensive experiments over the real-world dataset from a prestigious bank. © 2023 IEEE.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Low-Rank Subspace Representation from Optimal Coded-Aperture for Unsupervised Classification of Hypersepctral Imagery

Low-Rank Subspace Representation from Optimal Coded-Aperture...

引用

IEEE International Conference on Image Processing

作者： Jianchen Zhu Tong Zhang Shengjie Zhao Key Laboratory of Embedded System and Service Computing Ministry of Education

ISBN: (数字)9781728163956

ISBN: (纸本)9781728163963

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.

关键词： Image coding Encoding Apertures Clustering algorithms Imaging Three-dimensional displays Sensors

来源：评论

学校读者我要写书评

暂无评论

Using more initial centers for the seeding-based semi-supervised K-harmonic means clustering

Using more initial centers for the seeding-based semi-superv...

引用

2012 International Conference on Emerging Technologies for Information systems, computing, and Management, ICM 2012

作者： Gu, Lei Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China School of Computer Science and Technology Nanjing University of Posts and Telecommunication Nanjing China

ISBN: (纸本)9781461470090

In the initialization of the traditional semi-supervised k-means, the mean of some labeled data belonging to one same class was regarded as one initial center and the number of the initial centers is equal to the number of clusters. However, this initialization method using a small amount of labeled data also called seeds which are not appropriate for the semi-supervised k-harmonic means clustering insensitive to the initial centers. In this paper, a novel semi-supervised k-harmonic means clustering is proposed. Some seeds with one same class are divided into several groups and the mean of all data is viewed as one initial center in every group. Therefore, the number of the initial centers is more than the number of clusters in the new method. To investigate the effectiveness of the approach, several experiments are done on three datasets. Experimental results show that the presented method can improve the clustering performance compared to other traditional semi-supervised clustering algorithms. © 2013 Springer Science+Business Media New York.

关键词： Harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths

Toward the First SDN Programming Capacity Theorem on Realizi...

引用

2018 IEEE Conference on Computer Communications, INFOCOM 2018

作者： Leet, Christopher Wang, Xin Richard Yang, Y. Aspnes, James Department of Computer Science Yale University United States Department of Computer Science Tongji University China Key Laboratory of Embedded System and Service Computing Ministry of Education China

ISBN: (纸本)9781538641286

High-Ievel programming and programmable data paths are two key capabilities of software-defined networking (SDN). A fundamental problem linking these two capabilities is whether a given high-level SDN program can be realized onto a given low-level SDN datapath structure. Considering all high-level programs that can be realized onto a given datapath as the programming capacity of the datapath, we refer to this problem as the SDN data path programming capacity problem. In this paper, we conduct the first study on the SDN datapath programming capacity problem, in the general setting of high-level, datapath oblivious, algorithmic SDN programs and state-of-art multi-table SDN data path pipelines. In particular, considering datapath-oblivious SDN programs as computations and datapath pipelines as computation capabilities, we introduce a novel framework called SDN characterization junctions, to map both SDN programs and datapaths into a unifying space, deriving the first rigorous result on SDN datapath programming capacity. We not only prove our results but also conduct realistic evaluations to demonstrate the tightness of our analysis. © 2018 IEEE.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：