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

International International Symposium on computer and information sciences (ISCIS)

作者： Hyun-Sup Shin Kang-Ho Kim Chei-Yol Kim Sung-In Jung Computer and software engineering Department Korea Institute of Science and Technology Information Daejeon South Korea Electronics and Telecommunications Research Institute Daejeon South Korea

In general, the speed of internal communication on a single-machine is faster than the other communication.(e.g. communication between remote PCs through the local network) Therefore, we expected that the internal communication between guest domains on a single-machine of virtual machine monitor (VMM)[1] was also fast. However, in the experiment, it showed that rather the speed was slower than the other communication because each guest domain was not well considered to be executed on VMM. In other words, the guest domain has some problems in the architecture of communication and data transmission on VMM. In this paper, we find the causes of those problems and suggest a new design for internal communication to improve its performance. It is well considered to be executed on VMM and shows the performance improvement of bandwidth up to 8 times in comparison with existing internal communication. And it also reduced the latency to 25%.

关键词： Virtual machine monitors Data communication Condition monitoring Virtual machining Degradation Art Personal communication networks Remote monitoring Operating systems Application software

来源：评论

学校读者我要写书评

暂无评论

A connection degree-based rough sets model and its application to knowledge reduction

A connection degree-based rough sets model and its applicati...

引用

SNPD 2007: 8th ACIS International Conference on software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

作者： Liuling, Dai Bing, Huang Dongxiao, Yang School of Software Beijing Institute of Technology Beijing 100081 China School of Computer Science and Technology Nanjing Audit University Nanjing 210029 China School of Management and Engineering Nanjing University Nanjing 210093 China Dept. of Information Science and Technology Jining Medical College Jining 272013 China

ISBN: (纸本)0769529097

Knowledge reduction is one of the most important issues in rough sets theory. Many works are related to connection-degree-based rough sets model to treat incomplete information systems. However, the model is not used to knowledge reduction. In this paper, a connection-degree-based rough sets model is proposed and used to knowledge reduction. Two ways for knowledge reduction are proposed and the relationships between them are shown. A knowledge reduction algorithm is also shown for incomplete information systems. The algorithm is based on elementary discernibility matrix and the significance degree of an attribute. Examples are used to show that the validity of the algorithm. © 2007 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Self-management unit-based and differentiated service-enable web container

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2007年第8期44卷 1418-1428页

作者： Li, Yang Chen, Ningjiang Jin, Beihong Zuo, Lin Huang, Tao Technology Center of Software Engineering Institute of Software Chinese Acad. of Sci. Beijing 100080 China State Key Laboratory of Computer Science Institute of Software Chinese Acad. of Sci. Beijing 100080 China Graduate University Chinese Acad. of Sci. Beijing 100049 China College of Computer and Electronic Information Guangxi University Nanning 530004 China

Web container conforming to J2EE specification, which provides runtime environment for servlet and JSP and adopts best-effort service mode, has become an effective platform to deploy enterprise Web applications on Internet. However, complex business Web applications require Web container to provide differentiated services that traditional Web container does not provide for requests from different clients according to role or payment etc. Some approaches such as admission control and priority scheduling have been applied to provide differentiated services for Web container, but they do not consider differentiated services in finer granularity so that they can only provide monotone and static strategy of differentiated services. To improve the deficiencies of traditional Web container, the requirement of differentiated services is analyzed and a differentiated service Web container (DSWC) based on self-management unit (SMU) is brought forward. In DSWC, process modules are encapsulated into SMUs, which are connected to compose a SMU chain. DSWC provides SMU-based and SMU chain-based differentiated services for requests according to SLA (service level agreement). At the same time, an adaptive strategy selection algorithm is also presented, which can adaptively select different strategies of differentiated services based on the dynamic environment. The experiments of prototype show DSWC can effectively provide differentiated services according to SLA for different type of requests.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

QoD Adaptation for Achieving Lifetime Predictability of WSN Nodes Communicating over Satellite Links

QoD Adaptation for Achieving Lifetime Predictability of WSN ...

引用

International Conference on Networked Sensing Systems (INSS)

作者： Mehdi Amirijoo Sang H. Son Jorgen Hansson Department of Computer and Information Science Linköping University Sweden Department of Computer University of Virginia USA Software Engineering Institute Carnegie Mellon University USA

In this paper we propose an architecture consisting of a particular type of node, namely a communication server that collects and aggregates data, and establishes a link between the users and the sensor nodes through satellite communication. A key challenge with satisfying a lifetime requirement of the communication server is the unpredictability of the sensor data volume arriving at the communication server and the transmission power of the satellite terminal. To provide lifetime predictability we propose an approach that automatically adjusts the quality of the data such that the specified lifetime if achieved. We have shown through an extensive evaluation that the approach manages to provide an actual lifetime within 2% of the specified lifetime despite variations in workload and communication link quality.

关键词： Wireless sensor networks Artificial satellites Mobile communication Base stations computer architecture Remote monitoring Satellite communication Quality management Internet Network servers

来源：评论

学校读者我要写书评

暂无评论

Evaluation of SAT-based Bounded Model Checking of ACTL Properties

Evaluation of SAT-based Bounded Model Checking of ACTL Prope...

引用

Theoretical Aspects of software engineering (TASE)

作者： Yanyan Xu Wei Chen Liang Xu Wenhui Zhang School of Information Science and Engineering Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences China

Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD based symbolic model checking of LTL and ACTL properties in recent years. For general LTL and ACTL properties, BMC has traditionally aimed mainly at error detection, taking the advantage that error detection may only need to explore a small portion of the whole state space. Recently bounded model checking aiming at verification has also been proposed. The aim of this paper is to exploit the strength of BMC methods by combining different BMC approaches and compare it with the traditional BDD-based symbolic methods. We consider two bounded model checking methods, which are for error detection and verification of ACTL properties, respectively, and then combine them to a BMC algorithm. Based on this algorithm, we have implemented a tool named BMV (bounded model verifier), and carried out a number of experiments, and we have then compared BMV with Cadence SMV. The experimental results show that for certain types of problems, both for verification and error detection, BMV can perform much better than Cadence SMV in both time and memory consumption, and we believe that this is the first attempt to have an implementation of a method that combines practical error detection and verification of ACTL properties by SAT-based model checking.

关键词： Data structures Boolean functions Laboratories computer science information science State-space methods Formal verification Automatic logic units Minimization methods Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL

A Denotational Semantic Model for Validating JVML/CLDC Optim...

引用

International Conference on Quality software

作者： Hamdi Yahyaoui Mourad Debbabi Nadia Tawbi Concordia Institute for Information Systems Engineering Concordia University QUE Canada Electrical and Computer Engineering Department University of Sharjah Sharjah UAE Computer Science and Software Engineering Department Laval University QUE Canada

The main intent of this paper is to present a semantic framework for the validation of JVML/CLDC optimizations. The semantic style of the framework is denotational and rests on an extension of the resource pomsets semantics of Gastin and Mislove [12]. The resource pomsets is a fully abstract semantic model that is based on true concurrency. However, it does not support non-determinism that emerges while interpreting JVML/CLDC programs. In this paper, we present an extension of this model that aims to support unbounded non-determinism. More precisely, we give an overview of the construction of the process space and exhibit its algebraic properties. The elaborated semantics is embedded in the proof assistant Isabelle [28] in order to validate optimizations of JVML/CLDC programs. A case study for the validation of some optimizations of JVML/CLDC programs is also presented. The studied optimizations are: constant propagation and dead assignment elimination.

关键词： Concurrent computing Acceleration Virtual machining Java Dynamic compiler information systems Systems engineering and theory computer science software engineering Runtime

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluations and Estimations ofWorkload of On-Demand Updates in Soft Real-Time Systems

Performance Evaluations and Estimations ofWorkload of On-Dem...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Thomas Gustafsson Jorgen Hansson Department of Information and Computer Science Linköping University Sweden School of Engineering Jönköping University Sweden Software Engineering Institute Carnegie Mellon University USA

Data being used in real-time systems must be up-to-date to produce correct results. The use of outdated data can have catastrophic consequences since calculated control signals are based on stale data. Two distinct methods to update data exist: (i) dedicated tasks (DT) update data items, and (ii) on-demand (OD) updating being a conditioned part of the execution flow of tasks. On-demand updating has not been studied in terms of CPU utilization analysis for real-time systems. This paper studies on-demand updating in terms of (i) imposed workload and compares the workload to deferrable scheduling (DS), and (ii) analytical formula for estimating workload to be used in CPU utilization based schedulability tests. It is found that on-demand updating uses less workload for updates compared to DS, which suggests on-demand updating should be used for resource constrained systems. However, using on-demand updating makes the execution times of updates unpredictable, which currently gives two possibilities (i) be pessimistic and assume all updates always execute or (ii) be less pessimistic but estimate the times between executions of updates. This paper devises a formula for such estimates and compares their result to approach (i). Evaluations show the formula can be useful for soft real-time systems.

关键词： Real time systems Job shop scheduling Testing Processor scheduling Industrial control Probability density function Data engineering computer science software engineering Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

software documents: Comparison and measurement

Software documents: Comparison and measurement

引用

19th International Conference on software engineering and Knowledge engineering, SEKE 2007

作者： Arbuckle, Tom Balaban, Adam Peters, Dennis K. Lawford, Mark Department of Computer Science and Information Systems CSIS Building University of Limerick Plassey Park Limerick Ireland Institute of Informatics Warsaw University Banacha 2 02-097 Warsaw Poland Electrical and Computer Engineering Faculty of Engineering and Applied Science Memorial University of Newfoundland St. John's NL A1B 3X5 Canada Department of Computing and Software Faculty of Engineering McMaster University Hamilton ON L8S 4K1 Canada

ISBN: (纸本)9781627486613

For some time now, researchers have been seeking to place software measurement on a more firmly grounded footing by establishing a theoretical basis for software comparison. Although there has been some work on trying to employ information theoretic concepts for the quantification of code documents, particularly on employing entropy and entropy-like measurements, we propose that employing the Similarity Metric of Li, Vit´anyi, and coworkers for the comparison of software documents will lead to the establishment of a theoretically justifiable means of comparing and evaluating software artifacts. In this paper, we review previous work on software measurement with a particular emphasis on information theoretic aspects, we examine the body of work on Kolmogorov complexity (upon which the Similarity Metric is based), and we report on some experiments that lend credence to our proposals. Finally, we discuss the potential advantages derived from the application of this theory to areas in the of software engineering. Copyright © (2007) by Knowledge Systems institute (KSI).

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

H∞ filtering for a class of 2D systems

H∞ filtering for a class of 2D systems

引用

15th European Signal Processing Conference, EUSIPCO 2007

作者： Wu, Ligang Lam, James Paszke, Wojciech Galkowski, Krzysztof Rogers, Eric Kummert, Anton Space Control and Inertial Technology Research Center Harbin Institute of Technology Harbin 150001 China Department of Mechanical Engineering University of Hong Kong Pokfulam Road Hong Kong Hong Kong Institute of Control and Computation Engineering University of Zielona Góra 65-246 Zielona Góra Poland Department of Electronics and Computer Science University of Southampton Southampton SO17 1BJ United Kingdom University of Wuppertal Faculty of Electrical Information and Media Engineering Communication Theory Germany

ISBN: (纸本)9788392134022

The unique characteristic of a repetitive process is a series of sweeps or passes through a set of dynamics defined over a finite duration known as the pass length. At the end of each pass, the process is reset and the next time through the output, or pass profile, produced on the previous pass acts as a forcing function on, an hence contributes to, the dynamics of the new pass profile. They are hence a class of systems with information propagation in two independent directions where here the dynamics over the finite pass length are described by a matrix linear differential equation and that from pass to pass has a discrete updating structure. This means that filtering/estimation theory/algorithms for, in particular, 2D discrete linear systems is not applicable. In this paper we solve a general filtering problem with a view toward use in the many applications where such action will be required. © 2007 EURASIP.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

A Novel Emulation Technique that Preserves Circuit Structure and Timing

A Novel Emulation Technique that Preserves Circuit Structure...

引用

IEEE International Symposium on System-on-Chip

作者： Leos Kafka Martin Danek Ondrej Novak Department of Signal Processing Institute of Information Theory and Automation AS CR Prague Czech Republic Department of Computer Science and Engineering FEE Czech Technical University Prague Czech Republic

This paper presents an emulation technique that allows to preserve structure and optionally timing of an emulated circuit according to a target technology. The technique is compatible with fault injection techniques based on circuit instrumentation or partial runtime reconfiguration, and it allows to emulate timing parameters of the circuit through an introduction of a virtual time. An area and timing overhead due to preserving the circuit structure and parameters of basic delay elements are evaluated by experiments.

关键词： Emulation Timing Circuit faults Circuit testing Circuit synthesis Instruments Runtime Signal processing Circuit simulation Hardware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：