Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
 Page 1 /100 Display every page 5 10 20 Item
 Physics , 2010, Abstract: A short survey is provided about our recent explorations of the young topic of noise-based logic. After outlining the motivation behind noise-based computation schemes, we present a short summary of our ongoing efforts in the introduction, development and design of several noise-based deterministic multivalued logic schemes and elements. In particular, we describe classical, instantaneous, continuum, spike and random-telegraph-signal based schemes with applications such as circuits that emulate the brain's functioning and string verification via a slow communication channel.
 International Journal of Advanced Technology & Engineering Research , 2011, Abstract: An ad hoc network is a peer-to-peer network without centralized server. Mobile Ad- Hoc Network (MANETs) is a promising new wireless communications standard in which network device may move around and end hosts may function as a router. It is a key of success of being deployed to properly address the security problems. There are several researches focused on delivering packets from node to node and its security that will sure us for authentication delivery. Some nodes may behave maliciously, resulting in degradation of the performance of the network or even disruption of its operation altogether. Towards a solution of secure routing on MANETs, in this paper, we propose an enhanced algorithm for to reducing packet dropped rate. The feasibility of the proposed scheme of secure routing will be demonstrated by using OPNET simulator. In this paper we enhance AODV protocol and implement it in a 15 node scenario.
 Computer Science , 2013, Abstract: Binary logic and devices have been in used since inception with advancement and technology and millennium gate design era. The development in binary logic has become tedious and cumbersome. Multivalued logic enables significant more information to be packed within a single digit. The design and development of logic circuit becomes very compact and easier. Attempts are being made to fabricate multivalued logic based devices. Since present devices can be implemented only in binary system,it is necessary to evolve a system that can built the circuit in multivalued logic system and convert in binary logic system. In multivalued logic system logic gates differ in different logic system, a quaternary has become mature in terms of logic algebra and gates. Hence logic design based on above system can be done using standard procedure. In this dissertation a logic circuit design entry based on multivalued logic system has been taken up that can provide the ease of circuit design in multivalued system and output as binary valued circuit. The named "MVL-DEV" offers editing, storage and conversion into binary facility.
 International Journal of Soft Computing & Engineering , 2013, Abstract: An alternate routing can improve the blocking performance of an optical network by providing multiple possible paths between source and destination nodes. Wavelength conversion can also improve the blocking performance of an optical network by allowing a connection to use different wavelengths along its route. But wavelength conversion scheme is not an economical proposition. We perform simultaneous study of the relationship between traditional alternate routing scheme and fuzzy logic based alternate routing scheme for comparative studies of those two schemes. Connection set up time and blocking rate reduction are the two important parameters of any optical data communication networks. These two parameters are computed in the present work. It is observed that fuzzy logic based alternate routing scheme provides better performance by reducing the connection set up time and blocking rate in optical network. The effect of the variation of number of wavelengths is also studied to see their effects on connection set up time and blocking rate.
 Emad Saad Computer Science , 2013, Abstract: Non deterministic applications arise in many domains, including, stochastic optimization, multi-objectives optimization, stochastic planning, contingent stochastic planning, reinforcement learning, reinforcement learning in partially observable Markov decision processes, and conditional planning. We present a logic programming framework called non deterministic logic programs, along with a declarative semantics and fixpoint semantics, to allow representing and reasoning about inherently non deterministic real-world applications. The language of non deterministic logic programs framework is extended with non-monotonic negation, and two alternative semantics are defined: the stable non deterministic model semantics and the well-founded non deterministic model semantics as well as their relationship is studied. These semantics subsume the deterministic stable model semantics and the deterministic well-founded semantics of deterministic normal logic programs, and they reduce to the semantics of deterministic definite logic programs without negation. We show the application of the non deterministic logic programs framework to a conditional planning problem.
 Frederic Dambreville Mathematics , 2004, Abstract: In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. This logic is shown to be non-trivial and is not reduced to classical propositions. The Bayesian conditional of DBL implies a definition of logical independence. Interesting results are derived about the interactions between the logical independence and the proofs. A model is constructed for the logic. Completeness results are proved. It is shown that any unconditioned probability can be extended to the whole logic DBL. The Bayesian conditional is then recovered from the probabilistic DBL. At last, it is shown why DBL is compliant with Lewis triviality.
 计算机科学技术学报 , 1996, Abstract: In this paper, several kinds of multivalued logic for relational database and their developing process are presented on the basis of null value's semantics. A new 5 valued logic is led into relational database containing null talue. The feasibility and necessity of using 5 valued logic are expounded. Comparative calculation and logical calculation under 5 valued logic are defined at the end of the paper.
 Christoph Lenzen Computer Science , 2012, Abstract: Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange O(log n) bits. We provide deterministic constant-time solutions for two problems in this model. The first is a routing problem where each node is source and destination of n messages of size O(log n). The second is a sorting problem where each node i is given n keys of size O(log n) and needs to receive the ith batch of n keys according to the global order of the keys. The latter result also implies deterministic constant-round solutions for related problems such as selection or determining modes.
 Computer Science , 2015, Abstract: We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as many packets as possible to their destination. Our main result is an $O\left(\log n\right)$-competitive deterministic algorithm for an $n$-node line network (i.e., $1$-dimensional grid), requiring only that buffers can store at least $5$ packets, and that links can deliver at least $5$ packets per step. We note that $O(\log n)$ is the best ratio known, even for randomized algorithms, even when allowed large buffers and wide links. The best previous deterministic algorithm for this problem with constant-size buffers and constant-capacity links was $O(\log^5 n)$-competitive. Our algorithm works like admission-control algorithms in the sense that if a packet is not dropped immediately upon arrival, then it is "accepted" and guaranteed to be delivered. We also show how to extend our algorithm to a polylog-competitive algorithm for any constant-dimension grid.
 电子与信息学报 , 1996, Abstract: This paper discusses the definition and properties of multivalued symmetric functions, and points out that a multivalued symmetric function can be decomposed according to the value of the function j. The subfunction Lj corresponding to j will certainly be a symmetric function, and it may be expressed as the sum-of-products form of degenerated multivalued fundamental symmetric functions. Based on this consideration, the logic synthesis circuit realization for the multivalued symmetric functions based upon full-adders is proposed.
 Page 1 /100 Display every page 5 10 20 Item

 Home Copyright © 2008-2017 Open Access Library. All rights reserved.