Toward Improvement In Rebuilding Fisheries: Lessons from the United States

This report seeks to describe the process and pitfalls through the experience of the United States in enacting and amending legislation to manage its fisheries resources. Why the U.S. experience? The American legislation, known as the Magnuson-Stevens Fishery Conservation and Management Act (MSA), sought to rebuild and then stabilise the country's fishery resources. This experience of devising legislation and negotiating the many stakeholder interests—in particular, the adoption of maximum sustainable yield (MSY) as a limit rather than a target—makes it a valuable example for the present reform of the European Union's Common Fisheries Policy (CFP)

On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion

In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or "distinguished" vertex $p \in V$, MDD(min) is the problem of finding a minimum weight vertex set $S \subseteq V\setminus \{p\}$ such that $p$ becomes the minimum degree vertex in $G[V \setminus S]$; and MDD(max) is the problem of finding a minimum weight vertex set $S \subseteq V\setminus \{p\}$ such that $p$ becomes the maximum degree vertex in $G[V \setminus S]$. These are known $NP$-complete problems and have been studied from the parameterized complexity point of view in previous work. Here, we prove that for any $\epsilon > 0$, both the problems cannot be approximated within a factor $(1 - \epsilon)\log n$, unless $NP \subseteq DTIME(n^{\log\log n})$. We also show that for any $\epsilon > 0$, MDD(min) cannot be approximated within a factor $(1 -\epsilon)\log n$ on bipartite graphs, unless $NP \subseteq DTIME(n^{\log\log n})$, and that for any $\epsilon > 0$, MDD(max) cannot be approximated within a factor $(1/2 - \epsilon)\log n$ on bipartite graphs, unless $NP \subseteq DTIME(n^{\log\log n})$. We give an $O(\log n)$ factor approximation algorithm for MDD(max) on general graphs, provided the degree of $p$ is $O(\log n)$. We then show that if the degree of $p$ is $n-O(\log n)$, a similar result holds for MDD(min). We prove that MDD(max) is $APX$-complete on 3-regular unweighted graphs and provide an approximation algorithm with ratio $1.583$ when $G$ is a 3-regular unweighted graph. In addition, we show that MDD(min) can be solved in polynomial time when $G$ is a regular graph of constant degree.Comment: 16 pages, 4 figures, submitted to Elsevier's Journal of Discrete Algorithm

ANALISIS FAKTOR-FAKTOR YANG MEMPENGARUHI KEPUTUSAN PEMBELIAN TERHADAP PRODUK HAND BODY MEREK CITRA DI KOTA SURAKATA

Penelitian ini bertujuan untuk menganalisis pengaruh harga, produk dan promosi terhadap keputusan pembelian hand body merek Citra di Kota Surakarta dan untuk menganalisis diantara harga, produk dan promosi yang lebih dominan berpengaruh terhadap keputusan pembelian hand body merek Citra di Kota Surakarta. Berdasarkan hasil penelitian diharapkan dapat mengidentifikasi berbagai faktor kritikal yang perlu diperhatikan dalam mengetahui faktor yang berpengaruh terhadap perilaku konsumen dalam pengambilan keputusan pembelian hand body merek Citra. Pengujian hipotesis dalam penelitian ini menggunakan alat analisis regresi linier berganda dengan uji F, uji t dan koefisien determinasi (R2). Populasi yang dipakai pada penelitian ini adalah seluruh konsumen hand body merek Citra di Kota Surakarta. Adapun sampel dari penelitian ini adalah 100 konsumen hand body merek Citra di Kota Surakarta dengan convenience sampling sebagai teknik pengambilan sampel. Berdasarkan hasil penelitian diketahui bahwa harga secara parsial berpengaruh signifikan terhadap keputusan pembelian konsumen pada produk hand body merek Citra di Kota Surakarta. Hal ini menunjukkan bahwa kesesuaian harga pada produk hand body merek Citra di Kota Surakarta akan memberikan dorongan kepada konsumen, sehingga mempunyai minat untuk melakukan keputusan pembelian. Produk secara parsial berpengaruh signifikan terhadap keputusan pembelian konsumen pada produk hand body merek Citra di Kota Surakarta. Hal ini menunjukkan bahwa kualitas produk yang semakin meningkat, akan memberikan dorongan bagi konsumen untuk melakukan keputusan pembelian. Promosi secara parsial berpengaruh signifikan terhadap keputusan pembelian konsumen pada produk hand body merek Citra di Kota Surakarta. Hal ini menunjukkan bahwa tingkat intensitas promosi yang dilakukan akan semakin mengenalkan sebuah produk pada konsumen, sehingga akan semakin meningkatkan keputusan pembelian konsumen. Hasil perhitungan menunjukkan bahwa produk merupakan variabel yang paling dominan berpengaruh terhadap keputusan pembelian konsumen pada produk hand body merek Citra di Kota Surakarta

ANALISIS PENGARUH PERILAKU BIAYA PADA UKM KONVEKSI BUSTAMI

The development of industry in the world is increasing rapidly. So there is intense competition between companies or industries to produce quality products. Companies that have been fully supported want to develop and continue to improve the quality of their products. Small and Medium Enterprises (SMEs) are one of the industrial drivers that compete in producing products. and make a profit. Convection business is a cottage industry engaged in the business of making clothing or agriculture which is still relatively small in order scale. This research aims to improve the effectiveness of cost data analysis. This research uses quantitative research methods aimed at applying the cost analysis to convection ukmBustami. The type of data used is quantitative data that uses secondary data sources. The results of the cost policy analysis, can be announced in the form of linear analysis y = Rp 900 + 6 (x) which means that the fixed costs of the machine are Rp 900 per month and the variable costs are Rp 6,000 per maintenance hour. Management in English special order fees can be used as an alternative to carry out business development and increase profitability in Bustami convection SMES. &nbsp