330 research outputs found
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
A fertile area of recent research has demonstrated concrete polynomial time
lower bounds for solving natural hard problems on restricted computational
models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path,
Mod6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs
of these lower bounds follow a certain proof-by-contradiction strategy that we
call alternation-trading. An important open problem is to determine how
powerful such proofs can possibly be.
We propose a methodology for studying these proofs that makes them amenable
to both formal analysis and automated theorem proving. We prove that the search
for better lower bounds can often be turned into a problem of solving a large
series of linear programming instances. Implementing a small-scale theorem
prover based on this result, we extract new human-readable time lower bounds
for several problems. This framework can also be used to prove concrete
limitations on the current techniques.Comment: To appear in STACS 2010, 12 page
Empowering parallel computing with field programmable gate arrays
After more than 30 years, reconfigurable computing has grown from a concept to a mature field of science and technology. The cornerstone of this evolution is the field programmable gate array, a building block enabling the configuration of a custom hardware architecture. The departure from static von Neumannlike architectures opens the way to eliminate the instruction overhead and to optimize the execution speed and power consumption. FPGAs now live in a growing ecosystem of development tools, enabling software programmers to map algorithms directly onto hardware. Applications abound in many directions, including data centers, IoT, AI, image processing and space exploration. The increasing success of FPGAs is largely due to an improved toolchain with solid high-level synthesis support as well as a better integration with processor and memory systems. On the other hand, long compile times and complex design exploration remain areas for improvement. In this paper we address the evolution of FPGAs towards advanced multi-functional accelerators, discuss different programming models and their HLS language implementations, as well as high-performance tuning of FPGAs integrated into a heterogeneous platform. We pinpoint fallacies and pitfalls, and identify opportunities for language enhancements and architectural refinements
Eigenvector-Based Centrality Measures for Temporal Networks
Numerous centrality measures have been developed to quantify the importances
of nodes in time-independent networks, and many of them can be expressed as the
leading eigenvector of some matrix. With the increasing availability of network
data that changes in time, it is important to extend such eigenvector-based
centrality measures to time-dependent networks. In this paper, we introduce a
principled generalization of network centrality measures that is valid for any
eigenvector-based centrality. We consider a temporal network with N nodes as a
sequence of T layers that describe the network during different time windows,
and we couple centrality matrices for the layers into a supra-centrality matrix
of size NTxNT whose dominant eigenvector gives the centrality of each node i at
each time t. We refer to this eigenvector and its components as a joint
centrality, as it reflects the importances of both the node i and the time
layer t. We also introduce the concepts of marginal and conditional
centralities, which facilitate the study of centrality trajectories over time.
We find that the strength of coupling between layers is important for
determining multiscale properties of centrality, such as localization phenomena
and the time scale of centrality changes. In the strong-coupling regime, we
derive expressions for time-averaged centralities, which are given by the
zeroth-order terms of a singular perturbation expansion. We also study
first-order terms to obtain first-order-mover scores, which concisely describe
the magnitude of nodes' centrality changes over time. As examples, we apply our
method to three empirical temporal networks: the United States Ph.D. exchange
in mathematics, costarring relationships among top-billed actors during the
Golden Age of Hollywood, and citations of decisions from the United States
Supreme Court.Comment: 38 pages, 7 figures, and 5 table
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions.
Our main contribution is in providing tools for derandomizing solutions to local problems, when the n nodes can only send O(log n)-bit messages in each round of communication. We combine bounded independence, which we show to be sufficient for some algorithms, with the method of conditional expectations and with additional machinery, to obtain the following results.
First, we show that in the Congested Clique model, which allows all-to-all communication, there is a deterministic maximal independent set (MIS) algorithm that runs in O(log^2 Delta) rounds, where Delta is the maximum degree. When Delta=O(n^(1/3)), the bound improves to O(log Delta).
Adapting the above to the CONGEST model gives an O(D log^2 n)-round deterministic MIS algorithm, where D is the diameter of the graph. Apart from a previous unproven claim of a O(D log^3 n)-round algorithm, the only known deterministic solutions for the CONGEST model are a coloring-based O(Delta + log^* n)-round algorithm, where Delta is the maximal degree in the graph, and a 2^O(sqrt(log n log log n))-round algorithm, which is super-polylogarithmic in n.
In addition, we deterministically construct a (2k-1)-spanner with O(kn^(1+1/k) log n) edges in O(k log n) rounds in the Congested Clique model. For comparison, in the more stringent CONGEST model, where the communication graph is identical to the input graph, the best deterministic algorithm for constructing a (2k-1)-spanner with O(kn^(1+1/k)) edges runs in O(n^(1-1/k)) rounds
THE NOOTROPIC EFFECT OF SWARNAYOG IN PRESCHOOL CHILDREN
In the world of competition, every child stood in the race for first position. This may exposing the young brains for educational and competitive stress, eventually result in an inability to concentrate and affect memory and the level of cognition. To overcome the situations nootropics are use as brain boosters or memory enhancer. In Ayurveda many Yogas are recommended to use as Medhya (brain booster) in children, Swarnayog is one of them. This study was design to evaluate the nootropic effect of Swarnayog in school children.
Normal children without having any physical or mental illness of age group 7-9 yrs was selected. Further they were evaluated for IQ and school performance report. The IQ was not less than 70 and the school performance report was not less than 40% was considered for the study. Total of 60 children were enrolled and randomly divided in two groups A & B. A was treatment and B was control group. The group A was received Swarnayog in the dose of 5 drops per day in morning hours and the group B was received Honey as placebo in the dose of 5 drops per day in morning hours for the period of 30 days. The day 31 children are assessed for general health condition and further on the day 60 children were assessed for academic performance and IQ level.
The effect of Swarnayog on group A for academic performance was statistically significant compared with group B, the p value < 0.05= the level of significance. The effect of Swarnayog on group A for IQ was statistically significant compared with group B, the p value < 0.05= the level of significance.
The study was found that group A showed significant effect compared to group B, it showed the positive changes in academic performance & IQ score. Thus the Swarnayog was a good nootropic drug, further study will require for their pharmacodynamic and pharmacokinetic actions
- …