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

IEEE international conference on Web Services (ICWS)

作者： Ajay Kattepur Albert Benveniste Claude Jard Equipe DistribCom IRISA/INRIA Campus Universitaire de Beaulieu Rennes France ENS Cachan Equipe DistribCom IRISA Université Européenne de Bretagne Bruz France

Service Level Agreements (SLAs) have been proposed in the context of web services to maintain acceptable quality of service (QoS) performance. this is specially crucial for composite service orchestrations that invoke many atomic services to render functionality. A consequence of SLA management entails efficient negotiation protocols among orchestrations and invoked services. In composite services where data and QoS (modeled in a probabilistic setting) interact, it is difficult to select an atomic service for negotiation, in order to improve end-to-end QoS performance. A superior improvement in one negotiated domain (eg. latency) might mean deterioration in another domain (eg. cost); improvement in one of the invoked services may be annulled by another due to the control flow specified in the orchestration. In this paper, we propose a integer programming formulation based on first order stochastic dominance as a strategy for re-negotiation over multiple services. A consequence of this is better end-to-end performance of the orchestration compared to random selection of services for re-negotiation. We also demonstrate this optimal strategy can be applied to negotiation protocols specified in languages such as Orc. Such strategies are necessary for composite services where QoS contributions from individual atomic services vary significantly.

关键词： Quality of service Contracts Optimization Web services Measurement Probabilistic logic Linear programming

来源：评论

学校读者我要写书评

暂无评论

Generic linear business process modeling

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2000年 1921卷 31-39页

作者： Schimm, Guido OFFIS Escherweg 2 OldenburgD-26121 Germany

ISBN: (纸本)3540410732

Visual-oriented process modeling concepts and languages used today often lead to modeling of ’spaghetti-processes’. thus, the process models are not applicable effectively in distributed, partially automated and dynamic scenarios. they also support permanent adaptation and composition of process models insufficiently. the approach of Generic Linear Business Process Modeling describes a meta model that aims to avoid these inadequacy. According to the concept of linear programming, nested logic blocks are applied to model the process flow. Additionally, by using generic blocks composition and amplifying of process models on different levels of detail is achieved. Further the approach outlines the visualization of generic linear process models and an XML based format in order to exchange the models in a networked business environment. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Machine Learning and Monte Carlo Sampling for the Probabilistic Orienteering Problem

Machine Learning and Monte Carlo Sampling for the Probabilis...

引用

international Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Roberto Montemanni Federico D'ignazio Xiaochen Chou Luca Maria Gambardella Dalle Molle Institute for Artificial Intelligence (IDSIA-USI/SUPSI) Manno Canton Ticino Switzerland

ISBN: (纸本)9781538626344;9781538626337

the Probabilistic Orienteering Problem is a stochastic optimization problem about the delivery or goods to customers. Only a subset of the customer can be served in the given time, so the problem consists in the selection of the customers providing more revenues and in the optimization of a truck tour to serve them. the presence of the customers is however stochastic, and this has to be taken into account while evaluating the objective function of each solution. Due to the high computational complexity of such an objective function, Monte Carlo sampling method is used to estimate it in a fast way. there is one crucial parameter in a Monte Carlo sampling evaluator which is the number of samples to be used. More samples mean high precision, less samples mean high speed. An instance-dependent trade-off has to be found. the topic of this paper is a Machine Learning-based method to estimate the best number of samples, given the characteristics of an instance. Two methods are presented and compared from an experimental point of view. In particular, it is shown that a less intuitive and slightly more complex method is able to provide more precise estimations.

关键词： Monte Carlo methods Linear programming Probabilistic logic Biological neural networks Machine learning Optimization Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Java Application's Packet Eavesdropper for content delivery network

Java Application's Packet Eavesdropper for content delivery ...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： Tzu-Chi Huang Ce-Kuen Shieh Yu-Ben Miao Department of Electrical Engineering National Engineering Kung University Tainan Taiwan Computer & Communications Research Laboratories Industrial Technology and Research Institute Taiwan

ISBN: (纸本)0769522491

DNS redirection and URL modification are two major ways to carry out dynamic replica selections in CDN. However, the two ways may overload DNS servers or dispatchers, and exhaust the network bandwidth while there are a large number of incoming requests. Meanwhile, the modification of DNS servers for DNS redirection harms the compatibility and troubles the management. Moreover, the two ways do not give local administrators the flexibility to customize accesses to foreign CDN applications. In the paper we propose Java Application's Packet Eavesdropper (JAPE) for CDN to improve DNS redirection and URL modification, and for local administrators to control the accesses. JAPE utilizes packet interception technologies for Java objects to process packets. Besides, objects in JAPE are Java application rather than Java applet, which not only keeps the inherent portability but also has the flexibility to use various Java libraries for creating other applications not limited to CDN. We implement JAPE in Windows 2000 and develop a CDN application with an object doing DNS redirection and URL modification. the application with location-aware features can locally resolve clients' requests toward a virtual host name and redirect them to a nearby server customized by local administrators according to the movements of clients. It proves that JAPE for CDN can free DNS servers from modifications, alleviate DNS servers' and dispatchers' loads, conserve the network bandwidth, and permit local administrators to customize the accesses.

关键词： Java Filters Hardware Application software Network servers Bandwidth Uniform resource locators logic devices logic programming Computer networks

来源：评论

学校读者我要写书评

暂无评论

Measuring Robustness of Side Channel Analysis in the Detection of Hardware Trojans in Encryption Modules

Measuring Robustness of Side Channel Analysis in the Detecti...

引用

IEEE India conference (INDICON)

作者： Shruti Masand Keith R Fernandes M S Bhat Department of Electronics and Communication Engineering National Institute of Technology Karnataka Surathkal

ISBN: (纸本)9781665452724

the hardware, software, and the data present in any electronic system predominantly determine the system’s security. Just like software, hardware is equally prone to attacks leading to malfunction. Altering the circuit design via different techniques to create a secret channel that maliciously affects the functionality of the system is called Hardware Trojan (HT) insertion and can cause significant harm. therefore, it is necessary to efficiently detect the presence of Hardware Trojans in any system. this paper presents the use of a well known Hardware Trojan detection technique called Side-Channel Analysis (SCA) to detect Trojans in encryption modules like AES and RSA. the availability of a golden circuit to compare against the Circuit Under Test (CUT) is assumed to detect Trojans through side-channel analysis. For the same, Xilinx Vivado is used to program the Intellectual Properties (IPs) on the Nexys 4 DDR FPGA. It is shown that the above- mentioned technique is not accurate in certain cases especially when the size of the Trojan is not large enough. So, an alternative technique is proposed that uses machine learning algorithms - that provide an accuracy of at least 93.06% while using the side channel data-sets, thereby significantly increasing the Trojan detection accuracy.

关键词： Machine learning algorithms Intellectual property programming logic gates Hardware Software Robustness

来源：评论

学校读者我要写书评

暂无评论

Semi-planar power combiner structure for IGBT-based pulsed power modulators

Semi-planar power combiner structure for IGBT-based pulsed p...

引用

international conference on Pulsed Power

作者： W. Hartmann R. Fleck R. Graba M. Hergt Corporate Technology Siemens AG Erlangen Germany Healthcare Siemens AG Erlangen Germany Healthcare Corporate Technology Erlangen Germany

A semi-planar, rotationally symmetric power combiner has been realized using a hard-wired parallel circuit of four power transfer stages which feed into a common radial transmission line. For testing purposes, the radial transmission line is terminated with a matched ohmic resistor. the power combiner is designed to produce a double exponential pulse by optimizing the transmission line geometry with the help of electrodynamic modeling using CST Microwave Suite. Each of the four stages contains three parallel capacitors of 200nF each, the geometrical circuit inductance, a switch, and are discharged into the common resistive load. the switch is realized with an industrial type IGBT module, at a DC link voltage of up to 4.5 kV. Lifetime estimations show a permissible peak current of up to 2kA for a single IGBT module, at pulse durations of around 1 μs. Hence, a peak current of over 6 kA can be achieved by paralleling four of these power transfer stages in the semi-planar power combiner structure. First experimental results show that the semi-planar power combiner is a suitable functional unit for pulsed power applications. the circuit was characterized at a DC link voltage of up to 4 kV, a peak current of 1.68kA, and a pulse duration of 1μs per IGBT module. the low switching losses of the IGBT when using a hard gate drive allow using the IGBT at high pulse repetition rates (PRF) up to kHz, at pulse durations around 1μs. the circuit presented is suitable to be used as a modular component of an inductive voltage adder to increase the available voltage and peak power levels, respectively.

关键词： Insulated gate bipolar transistors Power combiners Switches Resistors logic gates Jitter Current measurement

来源：评论

学校读者我要写书评

暂无评论

Conditional Updates of Answer Set programming and Its Application in Explainable Planning 20

Conditional Updates of Answer Set Programming and Its Applic...

引用

Proceedings of the 19th international conference on Autonomous Agents and MultiAgent Systems

作者： Van Nguyen Tran Cao Son Vasileiou Loukas Stylianos William Yeoh New Mexico State University Las Cruces NM USA Washington University in St. Louis St. Louis MO USA

ISBN: (纸本)9781450375184

In explainable planning, the planning agent needs to explain its plan to a human user, especially when the plan appears infeasible or suboptimal for the user. A popular approach is called model reconciliation, where the agent reconciles the differences between its model and the model of the user such that its plan is also feasible and optimal to the user. this problem can be viewed as a more general problem as follows: Given two knowledge bases πa and πh and a query q such that πa entails q and πh does not entail q, where the notion of entailment is dependent on the logical theories underlying πa and πh, how to change πh -– given πa and the support for q in πa – so that πh does entail q. In this paper, we study this problem under the context of answer set programming. To achieve this goal, we (1) define the notion of a conditional update between two logic programs πa and πh with respect to a query q; (2) define the notion of an explanation for a query q from a program πa to a program πh using conditional updates; (3) develop algorithms for computing explanations; and (4) show how the notion of explanation based on conditional updates can be used in explainable planning.

关键词： explainable planning answer set programming

来源：评论

学校读者我要写书评

暂无评论

Implementation of Robot Journalism by programming Custombot using Tokenization and Custom Tagging

Implementation of Robot Journalism by Programming Custombot ...

引用

international conference on Advanced Communication Technology

作者： Naeun Lee Kirak Kim Taeseon Yoon Hankuk Academy of Foreign Studies

ISBN: (纸本)9781509048922

the paper introduces a prototype of an algorithm that creates personalized news articles about IT and technology based on each personal preference for a specific theme, criteria, or element. When provided a specific personal preference, the algorithm Custombot analyses the data, derives the most appropriate topic that contains the most elements preferred by a person, and eventually produces a one and only news article on that topic. While processing and analysing data by inductive reasoning, Custombot considers the concepts of news angle and filter bubble. Text segmentation (tokenization) and custom tagging are two of the tasks that are used for the construction of this system, allowing to make custom tags and insert matching information in appropriate places. Its result of customized news article can serve as a new service provided by news organizations to satisfy each consumer's needs, and can also be a stepping stone in expanding the role or increasing the importance of robot journalism in a broad field of journalism.

关键词： Custom Tagging Filter Bubble News Angle Personalized News Robot Journalism Tokenization

来源：评论

学校读者我要写书评

暂无评论

“当代中国逻辑学史”学术研讨会综述

引用

逻辑学研究 2009年第3期2卷 110-113页

作者：曾昭式陈小青中山大学逻辑与认知研究所中山大学哲学系贵州大学哲学系

2009年9月19日至20日，由中山大学逻辑与认知研究所主办、贵州大学哲学系承办的“当代中国逻辑学史”学术研讨会在贵州大学召开，来自中山大学、中国社会科学院、中国人民大学、南开大学、南京大学、浙江大学、复旦大学、华南师范大学... 详细信息

2009年9月19日至20日，由中山大学逻辑与认知研究所主办、贵州大学哲学系承办的“当代中国逻辑学史”学术研讨会在贵州大学召开，来自中山大学、中国社会科学院、中国人民大学、南开大学、南京大学、浙江大学、复旦大学、华南师范大学、西南大学、贵州大学等单位10多位专家学者参加了会议。本次会议主题是研讨《当代中国逻辑学史》著作的内容。

关键词：学术研讨会逻辑学史当代中国研讨会综述中国社会科学院贵州大学中国人民大学华南师范大学

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：