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

L(0,1)-labelling of Permutation Graphs

Journal of Mathematical Modelling and Algorithms in Operations Research 2015年第4期14卷 469-479页

作者： Paul, Satyabrata Pal, Madhumangal Pal, Anita Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721102 India Department of Mathematics National Institute of Technology Durgapur Durgapur 713209 India

L(0,1)-labelling of a graph G=(V,E) is a function f from the vertex set V(G) to the set of non-negative integers such that adjacent vertices get number zero apart, and vertices at distance two get distinct numbers. The goal of L(0,1)-labelling problem is to produce a legal labelling that minimize the largest label used. In this article, it is shown that, for a permutation graph G with maximum vertex degree Δ, the upper bound of λ_0,1(G) is Δ−1. Finally, we prove that the result is exact for bipartite permutation graph. © 2015, Springer Science+Business Media Dordrecht.

关键词： Frequency assignment problem L(0,1)-labelling Permutation graph

来源：评论

学校读者我要写书评

暂无评论

Lazy memo-functions 2nd

引用

2nd International Conference on Functional programming Languages and computer Architecture, 1985

作者： Hughes, John Programming Methodology Group Department of Computer Science Chalmers University of Technology GöteborgS-412 96 Sweden

来源：评论

学校读者我要写书评

暂无评论

A functional programming approach to the specification and verification of concurrent systems

引用

Formal Aspects of Computing 1989年第1期1卷 303-319页

作者： Dybjer, Peter Sander, Herbert P. Programming Methodology Group Department of Computer Sciences Chalmers University of Technology and University of Göteborg Göteborg S-412 96 Sweden

Networks of communicating processes can be viewed as networks of stream transformers and programmed in a lazy functional language. Thus the correctness of concurrent systems can be reduced to the correctness of functional programs. In this paper such correctness is proved formally in the μ-calculus extended with recursion equations for functional programs. The μ-calculus is chosen since it allows the definition of properties by least fixed points (induction) as well as by greatest fixed points (coinduction), and since greatest fixed points are useful for formalising properties, such as fairness, of infinitely proceeding programs. Moreover, non-deterministic processes are represented as incompletely specified deterministic processes, that is, as properties of stream transformers. This method is illustrated by proving the correctness of the alternating bit protocol. © 1989 BCS.

关键词： μ-calculus Alternating bit protocol Functional programming Greatest fixed point Kahn-networks Non-deterministic processes

来源：评论

学校读者我要写书评

暂无评论

Nested mixin-methods in Agora 7th

引用

7th European Conference on Object-Oriented programming, ECOOP 1993

作者： Steyaert, Patrick Codenie, Wim D’Hondt, Theo De Hondt, Koen Lucas, Carine Van Limberghen, Marc Programming Technology Lab Computer Science Department Vrije Universiteit Brussel Pieinlaan 2 BrusselsB-1050 Belgium

ISBN: (纸本)9783540571209

Mixin-based inheritance is an inheritance technique that has been shown to subsume a variety of different inheritance mechanisms. It is based directly upon an incremental modification model of inheritance. This paper addresses the question of how mixins can be seen as named attributes of classes the same way that objects, methods, and also classes in their own right, are seen as named attributes of classes. The general idea is to let a class itself have control over how it is extended. This results in a powerful abstraction mechanism to control the construction of inheritance hierarchies in two ways. Firstly, by being able to constrain the inheritance hierarchy;secondly, by being able to extend a class in a way that is specific for that class. Nested mixins are a direct consequence of having mixins as attributes. The scope rules for nested mixins are discussed, and shown to preserve the encapsulation of objects. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Component + aspect = An extensible and adaptable system software

Component + aspect = An extensible and adaptable system soft...

引用

2005 International Conference on Software Engineering Research and Practice, SERP'05

作者： Netinant, Paniti Department of Computer Science Bangkok University Bangkok Thailand Concurrent Programming Research Group Computer Science Department Illinois Institute of Technology Chicago IL United States

ISBN: (纸本)9781932415490

The benefits associated with separation of concerns are well established. Aspect-Orientation is a methodology that aims at separating components and aspects from the early stages of the software life cycle, and using techniques to combining them together at the implementation phase. Componentbased programming systems have shown themselves to be a natural way of constructing extensible software. Well-defined interfaces, encapsulation, late binding and polymorphism promote extensibility, yet despite this synergy, components have not been widely employed at the systems level. This is primarily due to the failure of existing component technologies to provide the protection and performance required of systems software. In this paper we identify the requirements for a component system to support extensions, and describe an extensibility and adaptability in the design of system software. We discuss an aspect-oriented framework that can simplify system design by expressing it at a higher level of abstraction. Our work concentrates on how to achieve a higher separation of aspects, components, and layers from each other. Our goal is to achieve a better design model for system software in terms of extensibility, reuse and adaptability.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Security goals assurance based on software active monitoring

Security goals assurance based on software active monitoring

引用

International Conference on Secure Software Integration and Reliability Improvement

作者： Zhao, Changzhi Dong, Wei Leucker, Martin Qi, Zhichang Department of Computer Science National University of Defense Technology Changsha 410073 China Institute of Software Technology and Programming Languages University of Lubeck Germany

ISBN: (纸本)9780769544533

Access control is a vital security mechanism in today's operating systems and the security policies dictating the security relevant behaviors is lengthy and complex for example in Security-Enhanced Linux (SELinux). It is extremely difficult to verify the consistency between the security policies and the security goals desired by applications. In this paper we present how to predict whether the information flow security goal is violated or not during runtime how to generate the corresponding control actions on-line when divergence is detected and how to apply these actions in time based on software active monitoring technique. The symbolic security information flow model of SElinux is generated from a formalization of the access control mechanism which can be used to generate the N-step ahead projection of the future behavior. Information flow security goals are expressed in linear temporal logic (LTL) which provides clear description of the objectives desired by applications. Anticipatory monitor is generated from LTL formula automatically. We consider an on-line scheme where after the occurrence of an event, the next control action is determined on the basis of the N-step ahead projection of the future behavior. This procedure is repeated after the occurrence of next security relevant event. Thus a closed-loop system is generated that all behavior sequences will satisfy the security goals. © 2011 IEEE.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Application-based spam detection with machine learning algorithms 27

Application-based spam detection with machine learning algor...

引用

27th International Conference on Information Society and University Studies, IVUS 2022

作者： Erbey, Ali Barışçı, Necaattin Uşak University Distance Education Vocational School Department of Computer Programming Uşak Turkey Gazi University Faculty of Technology Department of Computer Engineering Ankara Turkey

We investigated the process of unsupervised generative learning and the structure of informative generative representations of images of handwritten digits (MNIST dataset). Learning models with the architecture of sparse convolutional autoencoder with constraints to produce low-dimensional representations achieved successful generative learning demonstrated by high accuracy of generation of images. A well-defined, continuous and connected structure of generative representations was observed and described. Structured informative representations of unsupervised generative models can be an effective platform for investigation of origins of intelligent behaviors in artificial and biological learning systems. © 2022 Copyright for this paper by its authors.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Comparative Study for Classification Methods to Predict and Detect Epilepsy Seizure 5

Comparative Study for Classification Methods to Predict and ...

引用

5th IEEE Middle East and Africa Conference on Biomedical Engineering, MECBME 2020

作者： El Halabi, Nashaat Abi Zeid Daou, Roy Achkar, Roger Hayek, Ali Boercsoek, Josef American University of Science and Technology Department of Computer and Communications Engineering Faculty of Engineering Beirut Lebanon Faculty of Public Health Biomedical Technologies Department Jounieh Lebanon American University of Science and Technology Department of Computer and Communications Engineering Faculty of Engineering Beirut Lebanon Computer Science University of Kassel Department of Computer Architecture and System Programming Faculty of Electrical Engineering Germany Computer Science University of Kassel Department of Computer Architecture and System Programming Faculty of Electrical Engineering Germany

ISBN: (纸本)9781728123585

Epilepsy is a medical problem that tackles lots of patients. It limits the life activity of such patients due to the seizures that occur anytime and anywhere. Thus, creating a monitoring system that could make their life easier and allow them to perform daily life activities as safe as possible has been studied. This paper is a continuity for a project where a system monitors epileptic patients using a set of wearable sensors connected to several processing units, the main sensors are Electroencephalogram (EEG) for the electrical activity of the brain, electrocardiogram (ECG) for the electrical activity of the heart, and accelerometers to monitor the posture of the patient, features extracted from EEG and ECG signals are used for prediction/detection of seizures. Thus, the objective of this paper is to present a comparative study in order to choose the appropriate classification method for seizure prediction and detection. Five classification methods were studied: Decision Trees, Discriminant Analysis, Support Vector Machine (SVM), K-Nearest Neighbor (KNN), and Ensemble Learning. For each of the classification methods, the accuracy, the specificity, the sensitivity, the precision, the false detection rate and the Fmeasure were studied and compared. The results for seizure prediction system show that the highest accuracy, specificity and F-Measure, and lowest false detection rate were achieved with Bagged Trees Ensemble Learning, the highest sensitivity and precision were achieved with Quadratic Support Vector Machine. However, for seizure detection system, the highest accuracy and F-Measure were achieved with Linear Support Vector, the highest sensitivity and specificity were achieved with Fine Gaussian Support Vector Machine, and the highest precision and lowest false detection rate were achieved with Subspace Discriminant Ensemble Learning. © 2020 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

AmbientTalk: Language support for mobile computing

AmbientTalk: Language support for mobile computing

引用

International Workshop on System Support for Future Mobile Computing Applications, FUMCA 2006

作者： Dedecker, Jessie Van Cutsem, Tom Mostinckx, Stijn De Meuter, Wolfgang D'Hondt, Theo Fund for Scientific Research Flanders Belgium Belgium Programming Technology Laboratory Department of Computer Science Vrije Universiteit Brussel Belgium

ISBN: (纸本)0769527299

An important aspect of system support for mobile computing involves alleviating the issues related to programming the underlying distributed system. Our approach to dealing with these issues is by means of programming language support. To this end, we have designed a high-level, distributed object-oriented programming language - called Ambient Talk - which has been designed specifically for mobile networks. We motivate the need for such dedicated language support based on the fundamental characteristics of mobile distributed systems. Subsequently, we describe the salient features of Ambient Talk with respect to distributed programming by means of an exemplar mobile computing application. © 2006 IEEE.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Two-stage multi-item 4-dimensional transportation problem with fuzzy risk and substitution

引用

Journal of Ambient Intelligence and Humanized Computing 2023年第7期14卷 9469-9496页

作者： Devnath, Sudeshna De, Manoranjan Mondal, Seema Sarkar Maiti, Manoranjan Department of Mathematics National Institute of Technology Durgapur Durgapur713209 India Department of Mathematics Mugberia Gangadhar Mahavidyalaya West Bengal Purba Medinipur India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore721102 India

With the worldwide transport infrastructural development, there are several connecting roads between the cities for transportation. Some of these roads are smooth, and some are very rough, which invites some risks during transportation. For public distribution of some commodities, Govts. of developing countries collect those from the open markets, transport those to some warehouses for temporary storage, and from there, again transport to the fair-price shops for public distribution. With these facts, in this investigation, Govt.’s above scheme is modelled as two-stage four-dimensional transportation problems with different choices of conveyances and routes. There are some path and conveyance-wise uncertain travel risks. In fair-price shops, substitutable essential items (say rice and wheat) are sold with the necessary ones (say, mustard oil, etc.), which are sold by push-sale against some concession in an essential item (say, more rice, etc.). Thus, there is a trade-off between the ‘push-sale’ and ‘concession’, and hence an optimum decision is derived. Several models are developed depending on management’s and customers’ decisions, substitutability, push-sale, and environments. For road risk, a two-parameter (road’s roughness and distance) Mamdani-type fuzzy logic is implemented. The system’s profits for different models are maximised in both crisp and fuzzy environments and illustrated numerically using Generalised Reduced Gradient method through Lingo software. Here, the Govt.’s policy of introducing new products (termed as necessary item) among the public against a concession in an essential item has been introduced and analysed. This push-sale is effective up to a certain level, and after that, profit goes down. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：