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

43rd IEEE/ACM International Conference on software Engineering, ICSE 2021

作者： Wu, Huayao Deng, Wenjun Niu, Xintao Nie, Changhai State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9780738113197

Due to the rapid growth and strong competition of mobile application (app) market, app developers should not only offer users with attractive new features, but also carefully maintain and improve existing features based on users' feedbacks. User reviews indicate a rich source of information to plan such feature maintenance activities, and it could be of great benefit for developers to evaluate and magnify the contribution of specific features to the overall success of their apps. In this study, we refer to the features that are highly correlated to app ratings as key features, and we present KEFE, a novel approach that leverages app description and user reviews to identify key features of a given app. The application of KEFE especially relies on natural language processing, deep machine learning classifier, and regression analysis technique, which involves three main steps: 1) extracting feature-describing phrases from app description;2) matching each app feature with its relevant user reviews;and 3) building a regression model to identify features that have significant relationships with app ratings. To train and evaluate KEFE, we collect 200 app descriptions and 1,108,148 user reviews from Chinese Apple App Store. Experimental results demonstrate the effectiveness of KEFE in feature extraction, where an average F-measure of 78.13% is achieved. The key features identified are also likely to provide hints for successful app releases, as for the releases that receive higher app ratings, 70% of features improvements are related to key features. © 2021 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances

arXiv

引用

arXiv 2025年

作者： Dinitz, Michael Fan, Chenglin Liu, Jingcheng Upadhyay, Jalaj Zou, Zongrui Department of Computer Science Johns Hopkins University United States Department of Computer Science and Engineering Seoul National University Korea Republic of State Key Laboratory for Novel Software Technology New Cornerstone Science Laboratory Nanjing University China Management Science & Information Systems Department Rutgers University United States

We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected graph, we treat the weights of edges as sensitive information, and two graphs are neighbors if their edge weights differ in one edge by at most one. We obtain efficient algorithms with significantly improved bounds on a broad class of graphs which we refer to as recursively separable. In particular, for any n-vertex Kh-minor-free graph, our algorithm achieve an additive error of Õ(h(nW)1/3), where W represents the maximum edge weight;For grid graphs, the same algorithmic scheme achieve additive error of Õ(n1/4√W). Our approach can be seen as a generalization of the celebrated binary tree mechanism for range queries, as releasing range queries is equivalent to computing all-pair distances on a path graph. In essence, our approach is based on generalizing the binary tree mechanism to graphs that are recursively separable. Copyright © 2025, The Authors. All rights reserved.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

Data consistency enforcement on business process transactions

Data consistency enforcement on business process transaction...

引用

2012 International Conference on Service-Oriented Computing, ICSOC 2012

作者： Liu, Xi State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9783642378034

Transactions are common in business processes (BPs). Consistency on data, which is defined as satisfaction of a set of data integrity constraints, is one of the basic properties for business process transactions (BPTs). This requires a BPT to bring the BP execution from one consistent state to another consistent state. It is desirable to ensure within BP executions that every BPT preserves data consistency. Besides, the earlier an inconsistency is detected the less recovery is necessary. It is studied in this paper how to detect and recover from potential future inconsistency as early as possible in a BPT execution. We propose a runtime proactive mechanism enforcing consistency on BPTs, called "transaction consistency guarding", based on symbolic execution of BPEL scopes for bounded length and correct design of fault and compensation handlers. © Springer-Verlag 2013.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral Target Detection Using Diffusion Model and Convolutional Gated Linear Unit

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Li, Zhaokui Mo, Fan Zhao, Xiaobin Liu, Cuiwei Gong, Xuewei Li, Wei Du, Qian Yuan, Bo Shenyang Aerospace University School of Computer Science Shenyang110136 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Institute of Applied Ecology Chinese Academy of Sciences CAS Key Laboratory of Forest Ecology and Silviculture Shenyang110016 China Beijing Institute of Technology School of Information and Electronics Beijing Key Laboratory of Fractional Signals and Systems Beijing100081 China Mississippi State University Department of Electrical and Computer Engineering StarkvilleMS39762 United States

Deep learning can effectively extract latent information from data to enhance target-background separation in hyperspectral target detection (HTD). However, these models typically require extensive labeled samples, while available target spectra in hyperspectral images (HSIs) are scarce. In addition, existing deep models struggle with target detection in complex backgrounds due to subtle spectral differences. To address these issues, we propose a novel HTD method based on diffusion model and convolutional gated linear unit (HTD-DMCG). First, the diffusion model is integrated with MixUp for data augmentation to generate a diverse and sufficiently large sample set. Next, a transformer architecture using a convolutional gated linear unit (GLU) is designed to effectively capture global dependencies and local feature correlations, leading to more discriminative feature representations. In addition, a new target aggregation and background separation loss is introduced, which emphasizes target sample aggregation while increasing the distance between targets and background samples to enhance separability. The HTD-DMCG method is compared against classical and state-of-the-art HTD methods on four real HSI datasets. Extensive experiments show that it can effectively outperform existing methods in target detection performance. © 1980-2012 IEEE.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Clustering of Complex Symbolic Data and Application for Emitter Identification

引用

Journal of computer science & technology 2018年第4期33卷 807-822页

作者： Xin Xu Jiaheng Lu Wei Wang Laboratory of Science and Technology on Information System Engineering Nanjing Research Institute of Electronics Engineering Nanjing 21000~ China Department of Computer Science University of Helsinki Helsinki 00014 Finland State Key Laboratory for Novel Software and Technology Nanjing University Nanjing 210046 China

It is well-known that the values of symbolic variables may take various forms such as an interval, a set of stochastic measurements of some underlying patterns or qualitative multi-values and so on. However, the majority of existing work in symbolic data analysis still focuses on interval values. Although some pioneering work in stochastic pattern based symbolic data and mixture of symbolic variables has been explored, it still lacks flexibility and computation efficiency to make full use of the distinctive individual symbolic variables. Therefore, we bring forward a novel hierarchical clustering method with weighted general Jaccard distance and effective global pruning strategy for complex symbolic data and apply it to emitter identification. Extensive experiments indicate that our method has outperformed its peers in both computational efficiency and emitter identification accuracy.

关键词： symbolic data analysis stochastic pattern fuzzy interval hierarchical clustering emitter identification

来源：评论

学校读者我要写书评

暂无评论

Traffic adaptive MAC protocol for wireless sensor network

Traffic adaptive MAC protocol for wireless sensor network

引用

Third International Conference on computer Network and Mobile Computing, ICCNMC 2005

作者： Gong, Haigang Liu, Ming Mao, Yinchi Chen, Li-Jun Xie, Li State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

In this paper, we propose TA-MAC, a traffic load adaptive Medium Access Control protocol for wireless sensor network. TA-MAC modified the contention window mechanism of S-MAC. It adjusts the initial contention window according to the current traffic load to reduce the collision probability and employs a fast backoff scheme to reduce the time for idle listening during backoff procedure, which both reduce the energy consumption. Simulation results show that TA-MAC outperforms S-MAC. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Optimal data scheduling for P2P VoD streaming systems

Optimal data scheduling for P2P VoD streaming systems

引用

16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010

作者： Yu, Qifeng Chen, Daoxu Department of Computer Science and Technology State Key Laboratory for Novel Software and Technology Nanjing University China

ISBN: (纸本)9780769543079

Media streaming services have been much more popular nowadays, and these services consume lots of network bandwidth. Peer-to-Peer(P2P) technology has been employed in the streaming systems to save the server bandwidth consumption and enhance the system scalability. In a P2P streaming system, the quality of the data scheduling scheme will largely affect the server stress that being saved. In this paper, we present our optimal data scheduling scheme to achieve both server stress minimization and fairness among users when the playback continuities of the users are guaranteed. The data scheduling scheme we proposed is based on the maximum network flow problem, and it is proved to be polynomial. Simulations also show that the time consumption for the computation of the optimal scheduling is acceptable, and the result of the scheduling also achieves small node degree bound which makes it practical. © 2010 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

"re-ID BUFF": An enhanced similarity measurement based on genetic programming for person re-identification 21

"re-ID BUFF": An enhanced similarity measurement based on ge...

引用

2021 Genetic and Evolutionary Computation Conference, GECCO 2021

作者： Li, Yiming Shang, Lin State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9781450383516

Person re-identification (re-ID) is a fundamental link to ensure successful cross-camera tracking. Its overall process is divided into two stages, feature extraction and matching. In the matching stage, the simple Euclid measurement has limitations in score due to the lack of consideration of the vector directions. The majority of recent contributions focus on the use of neighborhood information of the query image, which makes the calculation process more complex. In addition, these similarity measurements are predefined and therefore evaluated. In this paper, we propose a re-ID similarity measurement based on Genetic Programming (GP). The similarity measurement formula is automatically evolved and constructed through the optimization using specific function set, terminal set and fitness function targeting re-ID. For the training process of GP, we propose the feature triplet-dataset like the triplet-loss based on the existing re-ID datasets. We conduct sufficient experiments on three benchmark datasets, comparing with features of different quality and various measurements. The proposed method has a better effect than the Euclid measurement and achieves a general improvement on the mAP and rank-1 of combination with other metrics. Therefore, our method can be used as a gain "buff"to enhance the score of other methods on the original basis. © 2021 Owner/Author.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Path-oriented bounded reachability analysis of composed linear hybrid systems

引用

International Journal on software Tools for technology Transfer 2011年第4期13卷 307-317页

作者： Bu, Lei Li, Xuandong State Key Laboratory of Novel Software Technology Nanjing University Nanjing Jiangsu 210093 China Department of Computer Science and Technology Nanjing University Nanjing Jiangsu 210093 China

The existing techniques for reachability analysis of linear hybrid systems do not scale well to the problem size of practical interest. The performance of existing techniques is even worse for reachability analysis of a composition of several linear hybrid automata. In this paper, we present an efficient path-oriented approach to bounded reachability analysis of composed systems modeled by linear hybrid automata with synchronization events. It is suitable for analyzing systems with many components by selecting critical paths, while this task was quite insurmountable before because of the state explosion problem. This group of paths will be transformed to a group of linear constraints, which can be solved by a linear programming solver efficiently. This approach of symbolic execution of paths allows design engineers to check important paths, and accordingly increase the faith in the correctness of the system. This approach is implemented into a prototype tool Bounded reAchability CHecker (BACH). The experimental data show that both the path length and the number of participant automata in a system checked using BACH can scale up greatly to satisfy practical requirements. © 2010 Springer-Verlag.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Balancing resource utilization for continuous virtual machine requests in clouds

Balancing resource utilization for continuous virtual machin...

引用

6th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2012

作者： Li, Xin Qian, Zhuzhong Chi, Ruiqing Zhang, Bolei Lu, Sanglu State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9780769546841

The placement of virtual machines (VMs) on a cluster of physical machines (PMs) is a primary task in clouds. We can benefit a lot from appropriate placement policy, e.g. cost saving. In this paper, we raise a continuous virtual machine placement problem and propose an on-line algorithm to reduce the power consumption of clouds. Generic methods which deal with this problem with greedy manner will result in resource leak, a phenomenon of resource wasting. The direct consequence of this phenomenon is larger number of running PMs, which will cause higher power consumption. We prove it is an NP-complete problem to minimize the power consumption during the placement of VMs while the VM requests reach the clouds continuously. We propose a balanced algorithm with the principle of avoiding resource leak. The balanced algorithm handles the VM requests in real time and guarantees high resource utilization. The number of PMs and power consumption can be cut down as a result of high resource utilization. We evaluate the balanced algorithm via experiments with various simulations. Experimental results show that the balanced algorithm can reduce the number of running PMs effectively, so that, it has a significant efficiency on power saving. © 2012 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：