6,112,002 research outputs found

    Penerapan Strategi the Power of Two Untuk Meningkatkan Aktivitas Belajar Matematika Siswa Kelas X Sman 9 Pekanbaru

    Full text link
    This research is motivated by the low activity of learning mathematics class X SMAN 9 Pekanbaru. This study aims to increase the activity of learning mathematics class X SMAN 9 Pekanbaru with the implementation of strategy the power of two. The subjects were all students of grade X SMAN 9 Pekanbaru totaling 34 people, in the academic year 2015/2016. Form of research is classroom action research. The research instrument consists of instruments and instrument performance data collection activity observation sheet form teacher and student activity. Based on the results of research and discussion can be concluded that the strategy implementation power of two can increase the activity of learning mathematics students in the class X SMAN 9 Pekanbaru in the first semester of the 2015/2016 academic year. Although implementation of the strategy is a power of two can increase the activity of learning mathematics in grade X SMAN 9 Pekanbaru it is seen as the first cycle reaching an average of 60.5% and increased in the second cycle to 78%, this was successful because it exceeds 75%

    Penerapan Strategi The Power Of Two dengan Hasil Pembelajaran IPS di Kelas V

    Get PDF
    This research aims to get the objective side about the correlation between the implementation of strategy the power of two with the student learning result in Social Sciences of fifth grade Sekolah Dasar Negeri 9 Sungai Kunyit. The research method that used is descriptive method and form of research is correlation studies. Data source of this research is 42 students. The result research indicates that: (1) implementation of strategy the power of two in Social Sciences of fifth grade Sekolah Dasar Negeri 9 Sungai Kunyit gained an average of 88,25 including the excellent category; (2) student learning result in Social Sciences gained an average of 77,54 including the both category; (3) there is a significant correlation between the implementation of strategy the power of two with the student learning result in Social Sciences of fifth grade Sekolah Dasar Negeri 9 Sungai Kunyit. It can be proved from the amount of rxy>rtabel (0,46>0,312). Thereby Ha accepted and Ho refused; (4) Degree of relationship including the medium category because rxy = 0,46 are among coefficient intervals 0,40 – 0,599

    The Power of Two Choices in Distributed Voting

    Full text link
    Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires Θ(n)\Theta(n) expected steps to complete, even if initially there are only two distinct opinions. In this paper we consider a related process which we call two-sample voting: every vertex chooses two random neighbours in each step. If the opinions of these neighbours coincide, then the vertex revises its opinion according to the chosen sample. Otherwise, it keeps its own opinion. We consider the performance of this process in the case where two different opinions reside on vertices of some (arbitrary) sets AA and BB, respectively. Here, A+B=n|A| + |B| = n is the number of vertices of the graph. We show that there is a constant KK such that if the initial imbalance between the two opinions is ?ν0=(AB)/nK(1/d)+(d/n)\nu_0 = (|A| - |B|)/n \geq K \sqrt{(1/d) + (d/n)}, then with high probability two sample voting completes in a random dd regular graph in O(logn)O(\log n) steps and the initial majority opinion wins. We also show the same performance for any regular graph, if ν0Kλ2\nu_0 \geq K \lambda_2 where λ2\lambda_2 is the second largest eigenvalue of the transition matrix. In the graphs we consider, standard pull voting requires Ω(n)\Omega(n) steps, and the minority can still win with probability B/n|B|/n.Comment: 22 page

    Legislative Delegation and Two Conceptions of the Legislative Power

    Get PDF
    [Excerpt] The current federal government, with its burgeoning administrative agencies, does not embody what most Americans would recognize as the constitutional doctrine of separation of powers. This is, in part, due to the Congress’s frequent practice of delegating legislative powers to the executive branch, i.e., giving administrative agencies the power to promulgate rules regulating private behavior and having the force of law. Legislative delegation has been the subject of academic, legal, and political wrangling since the early congresses and clearly calls into question whether modern practice adheres to constitutional norms. This article discusses legislative delegation in terms of some core ideas that informed the writing and ratification of the Constitution, and then look at debates on legislative delegation from the early republic, the Progressive era, and modern times. Ultimately, this article argues that the no delegation doctrine – that legislative power cannot be delegated to the executive consistently with the Constitution – should be viewed as an important protector of constitutional values whose judicial enforcement is both desirable and practicable. In Part II, I discuss how the change in the conception of law and legislative power over the eighteenth century ought to influence how one appraises the propriety of legislative delegation. In Part III, I consider important debates over delegation occurring at critical moments in the history of delegation. Instead of focusing on the relatively familiar historical narrative of Supreme Court cases, I concentrate on the unchanging themes underlying arguments about delegation. In Part IV, I consider the main point of contention in modern discussions of delegation, namely judicial review, and evaluate assertions regarding its practicability and clarity

    Random k-SAT and the Power of Two Choices

    Full text link
    We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the existence of a rule that shifts the satisfiability threshold. This extends a well-studied area of probabilistic combinatorics (Achlioptas processes) to random CSP's. In particular, while a rule to delay the 2-SAT threshold was known previously, this is the first proof of a rule to shift the threshold of k-SAT for k >= 3. We then propose a gap decision problem based upon this semi-random model. The aim of the problem is to investigate the hardness of the random k-SAT decision problem, as opposed to the problem of finding an assignment or certificate of unsatisfiability. Finally, we discuss connections to the study of Achlioptas random graph processes.Comment: 13 page

    Non-power-of-Two FFTs: Exploring the Flexibility of the Montium TP

    Get PDF
    Coarse-grain reconfigurable architectures, like the Montium TP, have proven to be a very successful approach for low-power and high-performance computation of regular digital signal processing algorithms. This paper presents the implementation of a class of non-power-of-two FFTs to discover the limitations and Flexibility of the Montium TP for less regular algorithms. A non-power-of-two FFT is less regular compared to a traditional power-of-two FFT. The results of the implementation show the processing time, accuracy, energy consumption and Flexibility of the implementation

    The Power Spectra of Two Classes of Long-duration Gamma-ray Bursts

    Get PDF
    We have studied the averaged power density spectra (PDSs) of two classes of long-duration gamma-ray bursts in the recent classification by Balastegui et al.(2001) based on neural network analysis. Both PDSs follow a power law over a wide frequency range with approximately the same slope, which indicates that a process with a self-similar temporal property may underlie the emission mechanisms of both. The two classes of bursts are divided into groups according to their brightness and spectral hardness respectively and each group's PDS was calculated; For both classes, the PDS is found to flatten both with increasing burst brightness and with increasing hardness.Comment: 6 pages, 3 figures, a translated version from published in the Acta Astronomica Sinica, to appear in the Chinese Astronomy & Astrophysics Vol.27, Issue
    corecore