Zhao Song
Brand, Nanongkai, and Saranurak introduced a conjecture known as the Hinted Mv Conjecture. Although it was originally formulated for the matrix case, we generalize it here to the tensor setting.
Menampilkan 20 dari ~114319 hasil · dari arXiv, DOAJ, CrossRef
Zhao Song
Brand, Nanongkai, and Saranurak introduced a conjecture known as the Hinted Mv Conjecture. Although it was originally formulated for the matrix case, we generalize it here to the tensor setting.
Carlos Contreras, Jorge Albuja-Sánchez, Oswaldo Proaño et al.
This study shows the influence of the inclusion of abaca fiber (Musa Textilis) on the coefficients of consolidation, expansion, and compression for normally consolidated clayey silt organic soil specimens using reconstituted samples. For this purpose, abaca fiber was added according to the dry mass of the soil, in lengths (5, 10, and 15 mm) and concentrations (0.5, 1.0, and 1.5%) subjected to a curing process with sodium hydroxide (NaOH). The virgin and fiber-added soil samples were reconstituted as slurry, and one-dimensional consolidation tests were performed in accordance with ASTM D2435. The results showed a reduction in void ratio (compared to the soil without fiber) and an increase in the coefficient of consolidation (Cv) as a function of fiber concentration and length, with values corresponding to 1.5% and 15 mm increasing from 75.16 to 144.51 cm2/s. Although no significant values were obtained for the compression and expansion coefficients, it was assumed that the soil maintained its compressibility. The statistical analysis employed hierarchical linear models to assess the significance of the effects of incorporating fibers of varying lengths and percentages on the coefficients, comparing them with the control samples. Concurrently, mixed linear models were utilized to evaluate the influence of the methods for obtaining the Cv, revealing that Taylor’s method yielded more conservative values, whereas the Casagrande method produced higher values.
Daniel Etongo, Kelsy Gill
As a Small Island Developing State, Seychelles is disproportionately affected by climate change, and enhancing her adaptive capacity is a national priority. Identifying and integrating local capacity needs into policy measures can improve multilevel governance and the effective implementation of National Adaptation Plans (NAPs), given that local governments have contextual knowledge about their territories and the climate change challenges affecting them. Based on the Capital Approach Framework (CAF), this study carries out an analysis of local governance capacity needs for implementing climate change adaptation in Seychelles. Data were collected using two methods: (i) questionnaire-led interviews among twenty-four district administrators (DAs), and (ii) an interactive workshop involving thirty-one participants, of which twenty-six were DAs and five were members of the National Climate Change Committee. The CAF was measured in two ways: (i) through descriptive statistics such as frequencies based on interview data, and (ii) through the ranking of types of capital to assess their weightings across four categories using a consensus approach during the participatory workshop. The findings of this study indicate significant political, financial, and human resource capacity gaps, which collectively hinder local adaptation. The critical shortcomings identified include the low participation in national-level decision-making processes, the inability to access external funding sources, and the lack of technical know-how. Through a participatory approach involving the local government representatives and the National Climate Change Committee, ten recommendations for policy measures that can enhance the effectiveness of local governance in climate change adaptation were co-developed. Seven of these recommendations partly address issues related to political capital. These recommendations highlight that a siloed approach cannot effectively address the impacts of climate change. For example, one of the recommendations stated that land-use planning should be guided by location-specific vulnerabilities, as these differ across districts.
Nicholas Coxon
We show that simple modifications to van der Hoeven's forward and inverse truncated Fourier transforms allow the algorithms to be performed in-place, and with only a linear overhead in complexity.
Xinyu Wu
In this note we present a simplified analysis of the quantum and classical complexity of the $k$-XOR Forrelation problem (introduced in the paper of Girish, Raz and Zhan) by a stochastic interpretation of the Forrelation distribution.
Tadahiro Kawasaki, Ryuji Yoshida, Takeharu Kato et al.
Alexandre Sedoglavic
We present a non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications. This algorithm is a minor modification of Makarov's algorithm which exhibit the previous best known bound with 100 multiplications.
Weimin Chen
We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.
Franck Dernoncourt
We prove that completing an untimed, unbounded track in TrackMania Nations Forever is NP-complete by using a reduction from 3-SAT and showing that a solution can be checked in polynomial time.
Peng Cui
In this short note, the author shows that the gap problem of some 3-XOR is NP-hard and can be solved by running Charikar\&Wirth's SDP algorithm for two rounds. To conclude, the author proves that $P=NP$.
Christian Kudahl
The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete.
J. Wen, D.J. Miller, N.J. Zaluzec et al.
Extended abstract of a paper presented at Microscopy and Microanalysis 2012 in Phoenix, Arizona, USA, July 29 – August 2, 2012.
Shiva Kintali, Asaf Shapira
We prove that every YES instance of Balanced ST-Connectivity has a balanced path of polynomial length.
H Sawada, F Hosokawa, T Sasaki et al.
Extended abstract of a paper presented at Microscopy and Microanalysis 2011 in Nashville, Tennessee, USA, August 7–August 11, 2011.
Andris Ambainis, Xiaoming Sun
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$.
Daniel M. Kane
We show that any $O_d(ε^{-4d 7^d})$-independent family of Gaussians $ε$-fools any degree-$d$ polynomial threshold function.
Mikhail Katkov
The community convinced me that this peace of crank was written by crackpot trisector. I apologize for disturbing community.
HW Lin, IW Yu, CK Chang et al.
Pascal Koiran, Sylvain Perifel
We show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.
Marián Dvorský
In this paper we show that the following problem is NP-complete: Given an alphabet $Σ$ and two strings over $Σ$, the question is whether there exists a permutation of $Σ$ which is a subsequence of both of the given strings.
Halaman 5 dari 5716