PENGARUH CORPORATE SOCIAL RESPONSIBILITY DAN KEPEMILIKAN MAYORITAS TERHADAP AGRESIVITAS PAJAK (Studi Empiris Pada Perusahaan Manufaktur yang Terdaftar di Bursa Efek Indonesia Tahun 2011-2013)

The purpose of this study was to examine Corporate Social Responsibility and Majority Firm to Tax Aggressiveness. This study is a developing of a previous study, Lanis and Richardson (2011). The difference between this and previous studies is the use of samples and test equipment at research previous studies using a CSR method from Australia, measuring a Majority Firm with previous study from previous study in Indonesia. Whereas this study uses SPSS test equipment 21 The populations used in this study are manufacturing company listed in the Indonesian Stock Exchange from year 2011-2013. Sampling technique in this study using purposive sampling method. Data analysis techniques performed by hypothesis testing using multiple linear regression method. The results of this study indicate that Corporate Social Responsibility negative significantly influence Tax Aggressiveness. Whereas, Family Firm also have a negative significant effect on the Tax Aggressiveness

Exclusive Queueing Process with Discrete Time

In a recent study [C Arita, Phys. Rev. E 80, 051119 (2009)], an extension of the M/M/1 queueing process with the excluded-volume effect as in the totally asymmetric simple exclusion process (TASEP) was introduced. In this paper, we consider its discrete-time version. The update scheme we take is the parallel one. A stationary-state solution is obtained in a slightly arranged matrix product form of the discrete-time open TASEP with the parallel update. We find the phase diagram for the existence of the stationary state. The critical line which separates the parameter space into the regions with and without the stationary state can be written in terms of the stationary current of the open TASEP. We calculate the average length of the system and the average number of particles

Business Plan Clinic Esumi Hemodialysis of Social Security Agency (Bpjs) in Tangerang City

Chronic renal failure is a disease with decreased kidney function that can not be maintain metabolism and fluid and electrolyte balance. Patients with this condition require hemodialysis action to be able to sustain life. Hemodialysis action requires considerable costs. According to data PERNEFRI patients with chronic renal failure in Indonesia the number is increasing every year. In 2014 the Indonesian government issued a national health insurance program (JKN) organized by the Social Security Agency (BPJS) health. Conditions such as this is an opportunity to open a hemodialysis clinic

Dynamical Disorder and Self-Correlation in the Characterization of Nonlinear Systems. Application to Deterministic Chaos.

A new methodology to characterize nonlinear systems is described. It is based on the measurement over the time series of two quantities: the "Dynamical order" and the "Self-correlation". The averaged "Scalar" and "Perpendicular" products are introduced to measure these quantities. While this approach can be applied to general nonlinear systems, the aim of this work is to focus on the characterization and modeling of chaotic systems. In order to illustrate the method, applications to a two-dimensional chaotic system and the modeling of real telephony traffic series are presented. Three important aspects are discussed: the use of the averaged "Scalar" product as supplement of the "Lyapunov exponent", the use of the averaged "Perpendicular" product as a refinement of the "Mutual information" and the reduction of m-dimensional systems to the study of only one dimension. This new conceptual framework introduces a perspective to characterize real and theoretical processes with a unifying method, irrespective of the system classification

Sharp Thresholds in Adaptive Random Graph Processes

The $\mathcal{D}$-process is a single player game in which the player is initially presented the empty graph on $n$ vertices. In each step, a subset of edges $X$ is independently sampled according to a distribution $\mathcal{D}$. The player then selects one edge $e$ from $X$, and adds $e$ to its current graph. For a fixed monotone increasing graph property $\mathcal{P}$, the objective of the player is to force the graph to satisfy $\mathcal{P}$ in as few steps as possible. Through appropriate choices of $\mathcal{D}$, the $\mathcal{D}$-process generalizes well-studied adaptive random graph processes, such as the Achlioptas process and the semi-random graph process We prove a sufficient condition for the existence of a sharp threshold for $\mathcal{P}$ in the $\mathcal{D}$-process. For the semi-random process, we use this condition to prove the existence of a sharp threshold when $\mathcal{P}$ corresponds to being Hamiltonian or to containing a perfect matching. These are the first results for the semi-random graph process which show the existence of a sharp threshold when $\mathcal{P}$ corresponds to containing a sparse spanning graph. Using a separate analytic argument, we show that each sharp threshold is of the form $C_{\mathcal{P}}n$ for some fixed constant $C_{\mathcal{P}}>0$. This answers two of the open problems proposed by Ben-Eliezer et al. (SODA 2020) in the affirmative. Unlike similar results which establish sharp thresholds for certain distributions and properties, we establish the existence of sharp thresholds without explicitly identifying asymptotically optimal strategies.Comment: Accepted to Random Structures and Algorithms (RSA). Minor corrections made to Section 3, and the exposition of Section 4 was improved from the previous arXiv versio

Lagrange Inversion Formula by Induction

We present a simple inductive proof of the Lagrange Inversion Formula.Comment: 5 pages; to appear in The American Mathematical Monthl

On the speed of convergence to stationarity of the Erlang loss system

We consider the Erlang loss system, characterized by $N$ servers, Poisson arrivals and exponential service times, and allow the arrival rate to be a function of $N.$ We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and display some bounds for the total variation distance between the time-dependent and stationary distributions. We also pay attention to time-dependent rates

Semi-restricted Rock, Paper, Scissors

Consider the following variant of Rock, Paper, Scissors (RPS) played by two players Rei and Norman. The game consists of $3n$ rounds of RPS, with the twist being that Rei (the restricted player) must use each of Rock, Paper, and Scissors exactly $n$ times during the $3n$ rounds, while Norman is allowed to play normally without any restrictions. Answering a question of Spiro, we show that a certain greedy strategy is the unique optimal strategy for Rei in this game, and that Norman's expected score is $\Theta(\sqrt{n})$. Moreover, we study semi-restricted versions of general zero sum games and prove a number of results concerning their optimal strategies and expected scores, which in particular implies our results for semi-restricted RPS.Comment: 21 pages, 5 page appendi

Kasus Perundungan Anak di Jawa Barat: Temuan Awal Children’s Worlds Survey di Indonesia

This study aimed to describe the rate of bullying cases on children age 8, 10, and 12 year-olds in 27 Kota/Kabupaten in West Java. There were 22,616 children age 8, 10, and 12 year-olds who participated in this survey. This survey used stratified cluster random sampling to get a representative sample. Bullying actions were measured by reported frequency of experiencing being bullied physically and verbally by siblings and being bullied physically, verbally, and psychologically by other children at school last month. The highest rate was children reported being bullied physically by siblings and being bullied verbally by other children at school.  Results show differences on age and gender on types of bullying. Bullying is a serious problem that needs to be taken into account to stop bullying cases in West Java

The degree-restricted random process is far from uniform

The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it sequentially adds new random edges so that the degree of each vertex v_i remains at most d_i. Wormald conjectured in 1999 that, for d-regular degree sequences D_n, the final graph of this process is similar to a uniform random d-regular graph. In this paper we show that, for degree sequences D_n that are not nearly regular, the final graph of the degree-restricted random process differs substantially from a uniform random graph with degree sequence D_n. The combinatorial proof technique is our main conceptual contribution: we adapt the switching method to the degree-restricted process, demonstrating that this enumeration technique can also be used to analyze stochastic processes (rather than just uniform random models, as before).Comment: 32 pages, 3 figure