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

2008 IEEE Congress on Services, SERVICES 2008

作者： Ghose, Aditya Koliadis, George Decision Systems Laboratory School of Computer Science and Software Engineering University of Wollongong NSW 2522 Australia

ISBN: (纸本)9780769532868

Complex business networks such as supply chains, withcross-organizational workflows of even greater complexity,are becoming increasingly common. The problem of engineeringcross-organizational processes in a manner thataccounts for inter-organizational constraints, and dynamics,has received little attention in the literature. This paperdescribes an effective framework for addressing the *** actor eco-systems approach leverages the ecosystemsmetaphor to model cross-enterprise constraints,change propogation and equilibria. It describes how crossenterpriseprocesses can be derived from such models andmaintained in the face of dynamic business contexts. © 2008 IEEE.

关键词： Supply chains

来源：评论

学校读者我要写书评

暂无评论

Agents in the era of big data: What the "end of theory" might mean for agent systems

Agents in the era of big data: What the "end of theory" migh...

引用

16th International Conference on Principles and Practice of Multi-Agent systems, PRIMA 2013

作者： Ghose, Aditya Decision Systems Laboratory School of Computer Science and Software Engineering University of Wollongong NSW 2522 Australia

ISBN: (纸本)9783642449260

Our ability to collect, manage and analyze vast amounts of data has led some to predict the demise of theory. This has important implications for research in agent systems. It can mean that specifications of agent intent, or of agent behaviour, or the norms that constrain agent behaviour can be learnt from data and maintained in the face of continuous data streams. I will offer some examples of how the agents community is beginning to leverage data in this fashion, and what the challenges might be in the future. © 2013 Springer-Verlag.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Traffic-aware stress testing of distributed systems based on UML models 06

Traffic-aware stress testing of distributed systems based on...

引用

28th International Conference on software engineering 2006, ICSE '06

作者： Garousi, Vahid Briand, Lionel G. Labiche, Yvan Carleton University Department of Systems and Computer Engineering Software Quality Engineering Laboratory 1125 Colonel By Drive Ottawa Ont. K1S5B6 Canada Simula Research Laboratory Department of Software Engineering Martin Linges v 17 Fornebu 1325 Lysaker Norway

ISBN: (纸本)1595933751

A stress test methodology aimed at increasing chances of discovering faults related to network traffic in distributed systems is presented. The technique uses the UML 2.0 model of the distributed system under test, augmented with timing information, and is based on an analysis of the control flow in sequence diagrams. It yields stress test requirements that are made of specific control flow paths along with time values indicating when to trigger them. Different variants of our stress testing technique already exist (they stress different aspects of a distributed system) and we focus here on one variant that is designed to identify and to stress test the system at the instant when data traffic on a network is maximal. Using a real-world distributed system specification, we design and implement a prototype distributed system and describe, for that particular system, how the stress test cases are derived and executed using our methodology. The stress test results indicate that the technique is significantly more effective at detecting network traffic-related faults when compared to test cases based on an operational profile. Copyright 2006 ACM.

关键词： Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Predicting fault-prone components in a Java legacy system

Predicting fault-prone components in a Java legacy system

引用

ISCE'06 - 5th ACM-IEEE International Symposium on Empirical software engineering

作者： Arisholm, Erik Briand, Lionel C. Simula Research Laboratory Department of Software Engineering Martin Linges v 17 Fornebu 1325 Lysaker Norway Carleton University Department of Systems and Computer Engineering Software Quality Engineering Laboratory 1125 Colonel By Drive Ottawa Ont. K1S5B6 Canada

ISBN: (纸本)1595932186

This paper reports on the construction and validation of fault-proneness prediction models in the context of an object-oriented, evolving, legacy system. The goal is to help QA engineers focus their limited verification resources on parts of the system likely to contain faults. A number of measures including code quality, class structure, changes in class structure, and the history of class-level changes and faults are included as candidate predictors of class fault-proneness. A cross-validated classification analysis shows that the obtained model has less than 20% of false positives and false negatives, respectively. However, as shown in this paper, statistics regarding the classification accuracy tend to inflate the potential usefulness of the fault-proneness prediction models. We thus propose a simple and pragmatic methodology for assessing the cost-effectiveness of the predictions to focus verification effort. On the basis of the cost-effectiveness analysis we show that change and fault data from previous releases is paramount to developing a practically useful prediction model. When our model is applied to predict faults in a new release, the estimated potential savings in verification effort is about 29%. In contrast, the estimated savings in verification effort drops to 0% when history data is not included. Copyright 2006 ACM.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

Sparse Weighted Canonical Correlation Analysis

引用

Chinese Journal of Electronics 2018年第3期27卷 459-466页

作者： MIN Wenwen LIU Juan ZHANG Shihua State Key Laboratory of Software Engineering School of Computer Wuhan University National Center for Mathematics and Interdisciplinary Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematics Sciences University of Chinese Academy of Sciences

Given two data matrices X and Y, Sparse canonical correlation analysis（SCCA） is to seek two sparse canonical vectors u and v to maximize the correlation between Xu and Yv. Classical and sparse Canonical correlation analysis（CCA） models consider the contribution of all the samples of data matrices and thus cannot identify an underlying specific subset of samples. We propose a novel Sparse weighted canonical correlation analysis（SWCCA）,where weights are used for regularizing different *** solve the L0-regularized SWCCA（L0-SWCCA） using an alternating iterative algorithm. We apply L0-SWCCA to synthetic data and real-world data to demonstrate its effectiveness and superiority compared to related methods. We consider also SWCCA with different penalties like Least absolute shrinkage and selection operator（LASSO）and Group LASSO, and extend it for integrating more than three data matrices.

关键词： Canonical correlation analysis(CCA) Sparse canonical correlation analysis(SCCA) Sparse weighted CCA(SWCCA) Group LASSO regularized SWCCA Multi-view SWCCA

来源：评论

学校读者我要写书评

暂无评论

High-order MRF prior based bayesian deblurring

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2011年第12期5卷 383-392页

作者： Zhao, Bo Zhang, Wensheng Liu, Jin Ding, Huan State Key Laboratory of Intelligent Control and Management of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China State Key Laboratory of Software Engineering Computer School Wuhan University China

A novel image deblurring method based on high-order non-local range Markov Random Field (NLR-MRF) prior is proposed in the paper. NLR-MRF provides an effective framework to model the statistical prior of natural images and leads to excellent performance in the application of image denoising and inpainting. Moreover, the framework will be extended to image deblurring in our work. Instead of commonly used maximum a-posteriori (MAP) estimation, which has several shortcomings, the high-order NLR-MRF prior is integrated into Bayesian minimum mean squared error (MMSE) estimation framework. Then, an efficient Gibbs sampling algorithm is adopted to compute MMSE estimation. The proposed method frees the user from determining regularization parameter beforehand, which relies on unknown noise level. We perform experiments on synthetic and real-world data to demonstrate the effectiveness of our method. Both quantitatively and qualitatively evaluations show superior or comparable results to the state-of-art deblurring methods.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

A Context—Aware Infrastructure for Supporting Applications with Pen—Based Interaction

引用

Journal of computer Science & Technology 2003年第3期18卷 343-353页

作者：栗阳关志伟戴国忠任向实韩勇 Human-Computer Interaction Laboratory Institute of Software The Chinese Academy of Sciences Beijing 100080 P.R. China Department of Information Systems Engineering Kochi University of Technology Tosayamada-cho Kochi 782-8502 Japan

Pen-based user interfaces which leverage the affordances of the pen provide userswith more flexibility and natural interaction. However, it is difficult to construct usable pen-baseduser interfaces because of the lack of support for their development. Toolkit-level support has beenexploited to solve this problem, but this approach makes it hard to gain platform independence,easy maintenance and easy extension. In this paper a context-aware infrastructure is created,called WEAVER, to provide pen interaction services for both novel pen-based applications andlegacy GUI-based applications. WEAVER aims to support the pen as another standard interactivedevice along with the keyboard and mouse and present a high-level access interface to pen *** employs application context to tailor its service to different applications. By modeling theapplication context and registering the relevant action adapters, WEAVER can offer services,such as gesture recognition, continuous handwriting and other fundamental ink manipulations, toappropriate applications. One of the distinct features of WEAVER is that off-the-shelf GUI-basedsoftware packages can be easily enhanced with pen interaction without modifying the existing *** this paper, the architecture and components of WEAVER are described. In addition, examplesand feedbacks of its use are presented.

关键词： user interface pen-based interaction context-aware infrastructure ink gesture

来源：评论

学校读者我要写书评

暂无评论

Lessons learned from developing a dynamic OCL constraint enforcement tool for java

引用

MoDELS 2005 International Workshops OCLWS, MoDeVA, MARTES, AOM, MTiP, WiSME, MODAUI, NfC, MDD, WUsCAM

作者： Dzidek, Wojciech J. Briand, Lionel C. Labiche, Yvan Software Quality Engineering Laboratory Department of Systems and Computer Engineering Carleton University 1125 Colonel By Drive Ottawa Ont. K1S 5B6 Canada Simula Research Laboratory Lysaker Norway

ISBN: (纸本)3540317805

Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party's rights and obligations. Contracts written in the Object Constraint Language (OCL) are known to be a useful technique to specify the precondition and postcondition of operations and class invariants in a UML context, making the definition of object-oriented analysis or design elements more precise while also helping in testing and debugging. In this article, we report on the experiences with the development of ocl2j, a tool that automatically instruments OCL constraints in Java programs using aspect-oriented programming (AOP). The approach strives for automatic and efficient generation of contract code, and a non-intrusive instrumentation technique. A summary of our approach is given along with the results of an initial case study, the discussion of encountered problems, and the necessary future work to resolve the encountered issues. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

PhenoProfiler: Advancing Phenotypic Learning for Image-based Drug Discovery

arXiv

引用

arXiv 2025年

作者： Li, Bo Zhang, Bob Zhang, Chengyang Zhou, Minghao Huang, Weiliang Wang, Shihang Wang, Qing Li, Mengran Zhang, Yong Song, Qianqian PAMI Research Group Department of Computer and Information Science University of Macau Taipa China Beijing Key Laboratory of Multimedia and Intelligent Software Technology Beijing Institute of Artificial Intelligence Beijing University of Technology Beijing China Department of Health Outcomes and Biomedical Informatics College of Medicine University of Florida Florida United States Faculty of Applied Sciences Macao Polytechnic University Taipa China School of Intelligent Systems Engineering Sun Yat-sen University Guangdong China Department of Cancer Biology Wake Forest School of Medicine Winston SalemNC United States

In the field of image-based drug discovery, capturing the phenotypic response of cells to various drug treatments and perturbations is a crucial step. This process involves transforming high-throughput cellular images into quantitative representations for downstream analysis. However, existing methods require computationally extensive and complex multi-step procedures, which can introduce inefficiencies, limit generalizability, and increase potential errors. To address these challenges, we present PhenoProfiler, an innovative model designed to efficiently and effectively extract morphological representations, enabling the elucidation of phenotypic changes induced by treatments. PhenoProfiler is designed as an end-to-end tool that processes whole-slide multi-channel images directly into low-dimensional quantitative representations, eliminating the extensive computational steps required by existing methods. It also includes a multi-objective learning module to enhance robustness, accuracy, and generalization in morphological representation learning. PhenoProfiler is rigorously evaluated on large-scale publicly available datasets, including over 230,000 whole-slide multi-channel images in end-to-end scenarios and more than 8.42 million single-cell images in non-end-to-end settings. Across these benchmarks, PhenoProfiler consistently outperforms state-of-the-art methods by up to 20%, demonstrating substantial improvements in both accuracy and robustness. Furthermore, PhenoProfiler uses a tailored phenotype correction strategy to emphasize relative phenotypic changes under treatments, facilitating the detection of biologically meaningful signals. UMAP visualizations of treatment profiles demonstrate PhenoProfiler’s ability to effectively cluster treatments with similar biological annotations, thereby enhancing interpretability. These findings establish PhenoProfiler as a scalable, generalizable, and robust tool for phenotypic learning, offering transformative advancement

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：