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

International Workshop on Automation of software Test (AST)

作者： Wei-Tek Tsai Charles J. Colbourn Jie Luo Guanqiu Qi Qingyang Li Xiaoying Bai School of Computing Informatics and Decision Systems Arizona State University Tempe AZ USA Arizona State University Tempe AZ US State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China Department of Computer Science and Technology INLIST Tsinghua University Beijing China

ISBN: (纸本)9781467361620

This paper proposes a new algebraic system, Test Algebra (TA), for identifying faults in combinatorial testing for SaaS (software-as-a-Service) applications. SaaS as a part of cloud computing is a new software delivery model, and mission-critical applications are composed, deployed, and executed in cloud platforms. Testing SaaS applications is a challenging task because new applications need to be tested when they are composed before they can be deployed for execution. Combinatorial testing algorithms can be used to identify faulty configurations and interactions from 2-way all the way to k-way where k is the number of components in the application. The TA defines rules to identify faulty configurations and interactions. Using the rules defined in the TA, a collection of configurations can be tested concurrently in different servers and in any order and the results obtained will be still same due to the algebraic constraints.

关键词： Testing software as a service Servers Fault diagnosis Algebra Scalability Program processors

来源：评论

学校读者我要写书评

暂无评论

Flow editor: Semantic web service composition tool

Flow editor: Semantic web service composition tool

引用

2012 IEEE 9th International Conference on Services Computing, SCC 2012

作者： Pi, Bingfeng Zou, Gang Zhong, Chaoliang Zhang, Jun Yu, Hao Matsuo, Akihiko Information Technology Laboratory Fujitsu Research and Development Center Suzhou China Information Technology Laboratory Fujitsu Research and Development Center Beijing China Software Systems Laboratories Fujitsu Laboratories Ltd. Kawasaki Japan

ISBN: (纸本)9780769547534

Semantic web service is proposed to support the automation of service discovery, composition and invocation. However, it is still difficult for common users to compose semantic web services or generate them from web services. In order to alleviate such pains, in this paper we present Flow Editor: a visual semantic web service composition tool based on OWL-S specification. It has several advantages, including visual service composition by drag-and-drop, semi-automatic semantic web service generation, visual control construct supports and so on. In practice, the tool is already applied to help users solve realistic problems by creating and exporting new on-demand services. © 2012 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Configuration checking with aspiration in local search for SAT 26

Configuration checking with aspiration in local search for S...

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Cai, Shaowei Su, Kaile Key Laboratory of High Confidence Software Technologies Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD Australia State Key Laboratory of Software Development Environment Beihang University Beijing China

ISBN: (纸本)9781577355687

An interesting strategy called configuration checking (CC) was recently proposed to handle the cycling problem in local search for Minimum Vertex Cover. A natural question is whether this CC strategy also works for SAT. The direct application of CC did not result in stochastic local search (SLS) algorithms that can compete with the current best SLS algorithms for SAT. In this paper, we propose a new heuristic based on CC for SLS algorithms for SAT, which is called configuration checking with aspiration (CCA). It is used to develop a new SLS algorithm called Swcca. The experiments on random 3-SAT instances show that Swcca significantly outperforms Sparrow2011, the winner of the random satisfiable category of the SAT Competition 2011, which is considered to be the best local search solver for random 3-SAT instances. Moreover, the experiments on structured instances show that Swcca is competitive with Sattime, the best local search solver for the crafted benchmark in the SAT Competition 2011. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Human genome meeting 2016 : Houston, TX, USA. 28 February - 2 March 2016

引用

Human genomics 2016年第1期10 Suppl 1卷 12页

作者： A. K. Srivastava Y. Wang R. Huang C. Skinner T. Thompson L. Pollard T. Wood F. Luo R. Stevenson R. Polimanti J. Gelernter X. Lin I. Y. Lim Y. Wu A. L. Teh L. Chen I. M. Aris S. E. Soh M. T. Tint J. L. MacIsaac F. Yap K. Kwek S. M. Saw M. S. Kobor M. J. Meaney K. M. Godfrey Y. S. Chong J. D. Holbrook Y. S. Lee P. D. Gluckman N. Karnani A. Kapoor D. Lee A. Chakravarti C. Maercker F. Graf M. Boutros G. Stamoulis F. Santoni P. Makrythanasis A. Letourneau M. Guipponi N. Panousis M. Garieri P. Ribaux E. Falconnet C. Borel S. E. Antonarakis S. Kumar J. Curran J. Blangero S. Chatterjee J. Akiyama D. Auer C. Berrios L. Pennacchio T. R. Donti G. Cappuccio M. Miller P. Atwal A. Kennedy A. Cardon C. Bacino L. Emrick J. Hertecant F. Baumer B. Porter M. Bainbridge P. Bonnen B. Graham R. Sutton Q. Sun S. Elsea Z. Hu P. Wang Y. Zhu J. Zhao M. Xiong David A. Bennett A. Hidalgo-Miranda S. Romero-Cordoba S. Rodriguez-Cuevas R. Rebollar-Vega E. Tagliabue M. Iorio E. D’Ippolito S. Baroni B. Kaczkowski Y. Tanaka H. Kawaji A. Sandelin R. Andersson M. Itoh T. Lassmann Y. Hayashizaki P. Carninci A. R. R. Forrest C. A. Semple E. A. Rosenthal B. Shirts L. Amendola C. Gallego M. Horike-Pyne A. Burt P. Robertson P. Beyers C. Nefcy D. Veenstra F. Hisama R. Bennett M. Dorschner D. Nickerson J. Smith K. Patterson D. Crosslin R. Nassir N. Zubair T. Harrison U. Peters G. Jarvik F. Menghi K. Inaki X. Woo P. Kumar K. Grzeda A. Malhotra H. Kim D. Ucar P. Shreckengast K. Karuturi J. Keck J. Chuang E. T. Liu B. Ji A. Tyler G. Ananda G. Carter H. Nikbakht M. Montagne M. Zeinieh A. Harutyunyan M. Mcconechy N. Jabado P. Lavigne J. Majewski J. B. Goldstein M. Overman G. Varadhachary R. Shroff R. Wolff M. Javle A. Futreal D. Fogelman L. Bravo W. Fajardo H. Gomez C. Castaneda C. Rolfo J. A. Pinto K. C. Akdemir L. Chin S. Patterson C. Statz S. Mockus S. N. Nikolaev X. I. Bonilla L. Parmentier B. King F. Bezrukov G. Kaya V. Zoete V. Seplyarskiy H. Sharpe T. McKee K. Popadin N. Basset-Seguin R. Ben Chaabene M. Andrianova C. Verdan K. Grosdemange O. Sumara M. E JCSRI Greenwood Genetic Center Greenwood USA School of Computing Clemson University Clemson USA Biochemical Genetics Laboratory Greenwood Genetic Center Greenwood USA Department Psychiatry Yale Sch Med and VA CT Healthcare Center West Haven USA Department Genetics Yale Sch Med and VA CT Healthcare Center West Haven USA Department Neurobiology Yale Sch Med and VA CT Healthcare Center West Haven USA Singapore Institute for Clinical Sciences Singapore Singapore National University of Singapore Singapore Singapore University of British Columbia Vancouver Canada KK Women’s and Children’s Hospital Singapore Singapore University of Southampton and University Hospital Southampton NHS Foundation Trust Southampton UK University of Auckland Auckland New Zealand McKusick-Nathans Institute of Genetic Medicine Johns Hopkins University School of Medicine Baltimore USA Esslingen University of Applied Sciences Esslingen Germany German Cancer Research Center Heidelberg Germany Department of Genetic Medicine and Development University of Geneva Medical School Geneva Switzerland Geneva University Hospitals-HUG Service of Genetic Medicine Geneva Switzerland GE3 Institute of Genetics and Genomics of Geneva University of Geneva Medical School Geneva Switzerland South Texas Diabetes and Obesity Institute School of Medicine University of Texas Rio-Grande Valley Edinburg USA South Texas Diabetes and Obesity Institute School of Medicine University of Texas Rio-Grande Valley Brownsville USA Institute of Genetic Medicine Johns Hopkins University Baltimore USA Genomics Division Lawrence Berkeley National Laboratory Berkeley USA Molecular and Human Genetics Baylor College of Medicine Houston USA Department of Translational Medical Sciences Federico II University Naples Italy Metabolon Inc Durham USA Section of Pediatric Neurology and Neuroscience Baylor College of Medicine Houston USA Tawam Hospital Abu Dhabi United Arab Emirates Stanford Medical School Stanford USA Sch

O1 The metabolomics approach to autism: identification of biomarkers for early detection of autism spectrum disorder A. K. Srivastava, Y. Wang, R. Huang, C. Skinner, T. Thompson, L. Pollard, T. Wood, F. Luo, R. Stevenson O2 Phenome-wide association study for smoking- and drinking-associated genes in 26,394 American women with African, Asian, European, and Hispanic descents R. Polimanti, J. Gelernter O3 Effects of prenatal environment, genotype and DNA methylation on birth weight and subsequent postnatal outcomes: findings from GUSTO, an Asian birth cohort X. Lin, I. Y. Lim, Y. Wu, A. L. Teh, L. Chen, I. M. Aris, S. E. Soh, M. T. Tint, J. L. MacIsaac, F. Yap, K. Kwek, S. M. Saw, M. S. Kobor, M. J. Meaney, K. M. Godfrey, Y. S. Chong, J. D. Holbrook, Y. S. Lee, P. D. Gluckman, N. Karnani, GUSTO study group O4 High-throughput identification of specific qt interval modulating enhancers at the SCN5A locus A. Kapoor, D. Lee, A. Chakravarti O5 Identification of extracellular matrix components inducing cancer cell migration in the supernatant of cultivated mesenchymal stem cells C. Maercker, F. Graf, M. Boutros O6 Single cell allele specific expression (ASE) IN T21 and common trisomies: a novel approach to understand DOWN syndrome and other aneuploidies G. Stamoulis, F. Santoni, P. Makrythanasis, A. Letourneau, M. Guipponi, N. Panousis, M. Garieri, P. Ribaux, E. Falconnet, C. Borel, S. E. Antonarakis O7 Role of microRNA in LCL to IPSC reprogramming S. Kumar, J. Curran, J. Blangero O8 Multiple enhancer variants disrupt gene regulatory network in Hirschsprung disease S. Chatterjee, A. Kapoor, J. Akiyama, D. Auer, C. Berrios, L. Pennacchio, A. Chakravarti O9 Metabolomic profiling for the diagnosis of neurometabolic disorders T. R. Donti, G. Cappuccio, M. Miller, P. Atwal, A. Kennedy, A. Cardon, C. Bacino, L. Emrick, J. Hertecant, F. Baumer, B. Porter, M. Bainbridge, P. Bonnen, B. Graham, R. Sutton, Q. Sun, S. Elsea O10 A novel causal methylation network approach to Alzheimer’s

关键词： Pulmonary Arterial Hypertension Oral Squamous Cell Carcinoma Deep Neural Network Autosomal Recessive Polycystic Kidney Disease Whole Genome Bisulfite Sequencing

来源：评论

学校读者我要写书评

暂无评论

On the Comparison of User Space and Kernel Space Traces in Identification of software Anomalies

On the Comparison of User Space and Kernel Space Traces in I...

引用

(CSMR) European Conference on software Maintenance and Reengineering

作者： Syed Shariyar Murtaza Afroza Sultana Abdelwahab Hamou-Lhadj Mario Couture Software Behaviour Analysis (SBA) Research Laboratory Concordia University Montreal QUE Canada System of Systems Section Software Analysis and Robustness Group Defence Research and Development Canada Valcartier QUE Canada

Corrective software maintenance consumes 30-60% time of software maintenance activities. Automated failure reporting has been introduced to facilitate developers in debugging failures during corrective maintenance. However, reports of software with large user bases overwhelm developers in identification of the origins of faults, and in many cases it is not known whether reports of failures contain information about faults. Prior techniques employ different classification or anomaly detection algorithms on user space traces (e.g., function calls) or kernel space traces (e.g., system calls) to detect anomalies in software behaviour. Each algorithm and type of tracing (user space or kernel space) has its advantages and disadvantages. For example, user space tracing is useful in detailed analysis of anomalous (faulty) behaviour of a program whereas kernel space tracing is useful in identifying system intrusions, program intrusions, or malicious programs even if source program code is different. If one type of tracing or algorithm is infeasible to implement then it is important to know whether we can substitute another type of tracing and algorithm. In this paper, we compare user space and kernel space tracing by employing different types of classification algorithms on the traces of various programs. Our results show that kernel space tracing can be used to identify software anomalies with better accuracy than user space tracing. In fact, the majority of software anomalies (approximately 90%) in a software application can be best identified by using a classification algorithm on kernel space traces.

关键词： Europe software maintenance

来源：评论

学校读者我要写书评

暂无评论

Flow Editor: Semantic Web Service Composition Tool

Flow Editor: Semantic Web Service Composition Tool

引用

IEEE International Conference on Services Computing (SCC)

作者： Bingfeng Pi Gang Zou Chaoliang Zhong Jun Zhang Hao Yu Akihiko Matsuo Information Technology Laboratory Fujitsu Research and Development Center Company Limited Suzhou China Information Technology Laboratory Fujitsu Research and Development Center Company Limited Beijing China Software Systems Laboratories Fujitsu Laboratories Limited Kawasaki Japan

关键词： Semantic Web Web services Semantics Visualization Ontologies Laboratories

来源：评论

学校读者我要写书评

暂无评论

Analytical and belief-propagation studies of random constraint satisfaction problems with growing domains

引用

Physical Review E 2012年第1期85卷 016106-016106页

作者： Chunyan Zhao Pan Zhang Zhiming Zheng Ke Xu LMIB and School of Mathematics and Systems Science Beihang University Beijing 100191 China Politecnico di Torino C.so Duca degli Abruzzi 24 I-10129 Torino Italy State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China

We study solution-space structure and solution-finding algorithms of a representative hard random constraint satisfaction problem with growing domains known as Model RB. Using rigorous methods, we show that solutions are grouped into disconnected clusters before the theoretical satisfiability phase transition point. Using the cavity method, it is shown that the entropy density obtained by belief propagation (BP) on random Model RB instances, which corresponds well to the analytical results, vanishes as the control parameter (constraint tightness) approaches the satisfiability threshold. From an algorithmic point of view, we find that reinforced BP, which performs much better than all existing algorithms, allows us to find solutions efficiently for instances in the regime that is very close to the satisfiability transition. These results also can shed light on the effectiveness of BP reinforcement on problems with a large number of states.

关键词： MATHEMATICAL models PHASE transformations (Physics) CONTROL theory (Mathematics) ALGORITHMS PARAMETER estimation TOPOLOGICAL spaces STRUCTURAL analysis (Engineering)

来源：评论

学校读者我要写书评

暂无评论

Model-driven tenant development for PaaS-based SaaS

Model-driven tenant development for PaaS-based SaaS

引用

IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Wei-Tek Tsai Wu Li Babak Esmaeili Wenjun Wu Department of Computer Science and Technology INLIST Tsinghua University Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA State Key Laboratory of Software Development Environment Beihang University Beijing China

This paper proposes key SaaS (software-as-a-Service) design strategies for those SaaS systems that run on top of a commercial PaaS (Platform-as-a-Service) system such as GAE (Google App Engine)[1]. Specifically, this paper proposes a model-based approach for customization, multi-tenancy architecture, scalability, and redundancy & recovery techniques for GAE. The ACDATER (Actors, Conditions, Data, Actions, Timing, Events, and Relationship) model is used for various features, and then automated code generation is used to generate code based on the model specified. Simulation can be performed to ensure correctness before deployment.

关键词： software as a service Databases Computational modeling Scalability Reliability Data models

来源：评论

学校读者我要写书评

暂无评论

Realization of a highly extensible agent framework for business applications

引用

Transactions of the Japanese Society for Artificial Intelligence 2011年第1期26卷 127-135页

作者： Yamamoto, Gaku Department of Computational Intelligence and Systems Science Tokyo Institute of Technology IBM Japan Software Development Laboratory Japan

Recently, highly extensible IT systems are required. It is said that an agent programming model provides high efficiency on application development, however, modification of both data structure and message handler program of agents are needed to add a new service. The issue is the same as the issue that other programming models have. IBM Agent Framework which we developed provides a highly extensible capability. By using the framework, a new service can be added withoutmodifying existing data structure and programming code. In this paper, we introduce the capability and explain how the framework provides the capability. We also discuss why the framework can provide the capability.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm to maximize the network lifetime for target coverage

An efficient algorithm to maximize the network lifetime for ...

引用

Proceedings of the International Convention MIPRO

作者： Azade Fotouhi Mohammadreza Razzazi Software Systems Research and Development Laboratory Department of Computer Engineering & IT Amirkabir University of Technology슠 Tehran Iran

A critical aspect of applications with wireless sensor networks is network lifetime. Therefore, judicious power management and scheduling can effectively extend operational time. One way to prolong the network lifetime is to divide the network into cover sets, where each cover set is capable of monitoring all targets. In this paper, we propose a novel and efficient algorithm which considers both residual energy and overlapping target to generate the maximum number of cover sets. Additionally, the algorithm can generate both disjoint and non-disjoint cover sets. Also, the proposed algorithm does not need information about targets which each sensor covers, or the sensors which a target is covered by them, in advance. Through simulation, we show that the proposed algorithm outperforms other similar algorithms in term of execution time, while it produces comparable results in term of number of generated cover sets.

关键词： Wireless sensor networks Algorithm design and analysis Complexity theory Monitoring Heuristic algorithms Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：