scholarly journals Identifying Rumour Source from Social Activity Streams

2019 ◽  
Vol 8 (3) ◽  
pp. 5718-5724
Keyword(s):  
Great Degree ◽  
Social Activity ◽  
Point Of View ◽  
Space Complexity ◽  
Time And Space ◽  
The Individual ◽  
Time And Space Complexity ◽  
Positive Results ◽  
Made In

Gossipy tidbits are snippets of data or a story that has not been checked. What this implies, is that the individual recounting the story does not know for certain in the event that it is valid or not. Bits of gossip assume a major job in this day and age of web where emergency contact only one post or article. Regular daily existences are lost and economies endure top dogs due to these gossipy tidbits being far reaching by individuals without confirming. Microblog stages have been to a great degree mainstream in the enormous information period because of its constant dissemination of data. We exhibit RING, a constant rising abnormality checking framework over microblog content streams. RING incorporates our endeavors on both developing inconsistency observing examination and framework explore. From the oddity observing point of view, RING proposes a diagram expository methodology with the end goal that RING can recognize developing abnormalities at a prior stage contrasted with the current methods. In our project, we tried to improve the process of Detecting the trending events and their sources by many characteristics like Duration of the anomaly, size of the text, and time. We analysed the spiking anomaly and its source by making use of RING in a little advance manner. The changes made in the system produced positive results which are better to identify the sources in terms of time and space complexity

Progeny Testing in the Breeding of Farm Animals

1952 ◽  
Vol 1953 (1) ◽  
pp. 79-105 ◽  
Author(s):  
Ivar Johansson ◽  
Alan Robertson
Keyword(s):  
Point Of View ◽  
Farm Animals ◽  
Breeding Value ◽  
Progeny Testing ◽  
Relative Importance ◽  
Economic Point ◽  
Breeding Values ◽  
The Individual ◽  
Made In

The progress in animal improvement depends on the accuracy with which the breeding value of each individual in the breed, or herd, is estimated, and how the animals chosen on the basis of our estimates are combined in matings. We are concerned here only with the first part of the problem, i.e. the estimation of breeding values. The estimates are made in regard to certain characters, or traits, which are of particular interest from an economic point of view, and they may be based on the phenotypic merit of the individual, or on the merits of its ancestors or collateral relatives, or on the merits of its progeny, in regard to the character in question. Often a combination of two, or three, or all four methods may be used. Their relative importance depends on the heritability of the character, as will be discussed later.

Improved time and space complexity for Kianfar's inequality rotation algorithm

2009 ◽  
Vol 3 (1) ◽  
pp. 90
Author(s):  
D. El Baz ◽  
M. Elkihel ◽  
L. Gely ◽  
G. Plateau
Keyword(s):  
Space Complexity ◽  
Time And Space ◽  
Time And Space Complexity

Statistical Thermodynamics of Rubber. II

1942 ◽  
Vol 15 (4) ◽  
pp. 806-811 ◽  
Author(s):  
Frederick T. Wall
Keyword(s):  
Point Of View ◽  
The Other ◽  
Lower Probability ◽  
Statistical Nature ◽  
Macroscopic Theory ◽  
Hooke’S Law ◽  
Hooke's Law ◽  
The Individual ◽  
Long Chain ◽  
Made In

Abstract During recent years, considerable progress has been made in connection with theories of rubber elasticity. Two general types of theories have been advanced, one from a macroscopic point of view and the other from a molecular point of view. An example of the former is the theory of Mooney, who arrived at an equation which agrees well with observation. For molecular theories, the reader is referred to the work of Guth and Mark, Kuhn, and Pelzer, who carried through calculations of a statistical nature. More recently, the author extended the statistical theory along lines which avoided some of the earlier difficulties. In the present paper, the calculations will be carried still further, and the molecular theory will be related to the macroscopic theory of Mooney. It will also be shown theoretically that, although rubber does not obey Hooke's law for ordinary elongation, it should obey Hooke's law for shear. It will be supposed that individual rubber molecules are long chain hydrocarbons capable of assuming various lengths and shapes as a result of free rotation about carbon-to-carbon valence bonds. When a piece of rubber is under no stress, the rubber molecules have a certain distribution of shapes. When the rubber is subjected to a stress, however, the molecules assume another distribution of lower probability. The theory here advanced relates this probability to the entropy of strain, thus providing a means of arriving at the mechanical properties of rubber. Two postulates are made. (1) When a macroscopic piece of rubber is strained, the components of the lengths of the individual molecules (along some set of axes) change in the same ratio as does the corresponding dimension of the piece of rubber. (2) When a piece of rubber is elongated, no change in total volume takes place. The first assumption was made in the earlier paper of this series, whereas the second was not. Experimental support for the second postulate has been given by Holt and McPherson. Our first problem is to investigate the effect of this second assumption on the equation of state for rubber.

scholarly journals Beyond equi-joins

2021 ◽  
Vol 14 (11) ◽  
pp. 2599-2612
Author(s):  
Nikolaos Tziavelis ◽  
Wolfgang Gatterbauer ◽  
Mirek Riedewald
Keyword(s):  
Experimental Study ◽  
State Of The Art ◽  
Database Systems ◽  
Ranking Function ◽  
Space Complexity ◽  
Time And Space ◽  
Running Time ◽  
Join Queries ◽  
Time And Space Complexity ◽  
Memory Efficient

We study theta-joins in general and join predicates with conjunctions and disjunctions of inequalities in particular, focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function. Our approach achieves strong time and space complexity properties: with n denoting the number of tuples in the database, we guarantee for acyclic full join queries with inequality conditions that for every value of k , the k top-ranked answers are returned in O ( n polylog n + k log k ) time. This is within a polylogarithmic factor of O ( n + k log k ), i.e., the best known complexity for equi-joins, and even of O ( n + k ), i.e., the time it takes to look at the input and return k answers in any order. Our guarantees extend to join queries with selections and many types of projections (namely those called "free-connex" queries and those that use bag semantics). Remarkably, they hold even when the number of join results is n ℓ for a join of ℓ relations. The key ingredient is a novel O ( n polylog n )-size factorized representation of the query output , which is constructed on-the-fly for a given query and database. In addition to providing the first nontrivial theoretical guarantees beyond equi-joins, we show in an experimental study that our ranked-enumeration approach is also memory-efficient and fast in practice, beating the running time of state-of-the-art database systems by orders of magnitude.

scholarly journals Searching using B/B+ Tree in Database Management System

2021 ◽  
Vol 9 (VII) ◽  
pp. 3702-3706
Author(s):  
Anshita Garg
Keyword(s):  
Data Transfer ◽  
Main Memory ◽  
Database Management System ◽  
Memory Access ◽  
Space Complexity ◽  
Longest Common Subsequence ◽  
Time And Space ◽  
Basic Point ◽  
Disk Access ◽  
Time And Space Complexity

This is a research-based project and the basic point motivating this project is learning and implementing algorithms that reduce time and space complexity. In the first part of the project, we reduce the time taken to search a given record by using a B/B+ tree rather than indexing and traditional sequential access. It is concluded that disk-access times are much slower than main memory access times. Typical seek times and rotational delays are of the order of 5 to 6 milliseconds and typical data transfer rates are of the range of 5 to 10 million bytes per second and therefore, main memory access times are likely to be at least 4 or 5 orders of magnitude faster than disk access on any given system. Therefore, the objective is to minimize the number of disk accesses, and thus, this project is concerned with techniques for achieving that objective i.e. techniques for arranging the data on a disk so that any required piece of data, say some specific record, can be located in a few I/O’s as possible. In the second part of the project, Dynamic Programming problems were solved with Recursion, Recursion With Storage, Iteration with Storage, Iteration with Smaller Storage. The problems which have been solved in these 4 variations are Fibonacci, Count Maze Path, Count Board Path, and Longest Common Subsequence. All 4 variations are an improvement over one another and thus time and space complexity are reduced significantly as we go from Recursion to Iteration with Smaller Storage.

scholarly journals Disimplicial arcs, transitive vertices, and disimplicial eliminations

2015 ◽  
Vol Vol. 17 no.2 (Graph Theory) ◽  
Author(s):  
Martiniano Eguia ◽  
Francisco Soulignac
Keyword(s):  
Efficient Algorithm ◽  
Bipartite Graphs ◽  
Space Complexity ◽  
Time And Space ◽  
Graph Classes ◽  
International Audience ◽  
Time And Space Complexity ◽  
Finite Posets

International audience In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence. A <i>diclique</i> of a digraph is a pair $V$ &rarr; $W$ of sets of vertices such that $v$ &rarr; $w$ is an arc for every $v$ &isin; $V$ and $w$ &isin; $W$. An arc $v$ &rarr; $w$ is <i>disimplicial</i> when it belongs to a unique maximal diclique. We show that the problem of finding the disimplicial arcs is equivalent, in terms of time and space complexity, to that of locating the transitive vertices. As a result, an efficient algorithm to find the bisimplicial edges of bipartite graphs is obtained. Then, we develop simple algorithms to build disimplicial elimination schemes, which can be used to generate bisimplicial elimination schemes for bipartite graphs. Finally, we study two classes related to perfect disimplicial elimination digraphs, namely weakly diclique irreducible digraphs and diclique irreducible digraphs. The former class is associated to finite posets, while the latter corresponds to dedekind complete finite posets.

Sign in / Sign up

Export Citation Format

Share Document