0
0.0

Jun 29, 2018
06/18

by
David F. Manlove; Iain McBride; James Trimble

texts

######
eye 0

######
favorite 0

######
comment 0

The Hospitals / Residents problem with Couples (HRC) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that a stable matching need not exist, so we consider MIN BP HRC, the problem of finding a matching that admits the minimum number of blocking pairs (i.e., is "as stable as possible"). We show that this problem is NP-hard and difficult to...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1602.01956

Detached from: Anales del Instituto de Estudios Madrileños, Vol. III (1968). 10 p. ; 24 cm.

Topics: City walls -- Spain -- Madrid -- History -- 17th century -- Sources, Madrid (Spain) -- Buildings,...

Topics: Historic sites--Massachusetts--Boston--Guidebooks, Historic...

California Digital Library

507
507

Jun 27, 2008
06/08

by
Eager, Margaret McLaren; Medford Historical Society

texts

######
eye 507

######
favorite 0

######
comment 0

Topics: Medford (Mass.) -- History, Medford (Mass.) -- Buildings, structures, etc

To fight against prevalent cyber threat, more mechanisms to protect operating systems have been proposed. Specifically, approaches like DEP, ASLR, and RELRO are frequently applied on Linux to hinder memory corruption vulnerabilities. In other words, it is more difficult for adversaries to exploit bugs to undermine the system security. In this session, we will propose a new attack technique that exploits the FILE structure in GNU C Library (Glibc), and introduce how to circumvent the protection...

Topics: Youtube, video, Science & Technology, hitb, hitbsecconf, hackinthebox, angelboy, hitcon, file...

5
5.0

Jun 28, 2018
06/18

by
Therese Biedl; Martin Derka

texts

######
eye 5

######
favorite 0

######
comment 0

Planar partial $3$-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree $3$ into a face. In this paper, we show that planar partial $3$-trees have $1$-string $B_1$-VPG representations, i.e., representations where every vertex is represented by an orthogonal curve with at most one bend, every two curves intersect at most once, and intersections of curves correspond to edges in the graph. We also that some subclasses of planar partial 3-trees have...

Topics: Computational Geometry, Computing Research Repository, Discrete Mathematics, Data Structures and...

Source: http://arxiv.org/abs/1506.07246

0
0.0

Jun 30, 2018
06/18

by
Therese Biedl; Martin Derka

texts

######
eye 0

######
favorite 0

######
comment 0

In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation---a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices $u,v$ intersect precisely once whenever there is an edge between $u$ and $v$.

Topics: Computing Research Repository, Computational Geometry, Data Structures and Algorithms

Source: http://arxiv.org/abs/1411.7277

0
0.0

Jun 29, 2018
06/18

by
Lan Anh Pham; Nicolas Trotignon

texts

######
eye 0

######
favorite 0

######
comment 0

A \emph{long unichord} in a graph is an edge that is the unique chord of some cycle of length at least 5. A graph is \emph{long-unichord-free} if it does not contain any long-unichord. We prove a structure theorem for long-unichord-free graph. We give an $O(n^4m)$-time algorithm to recognize them. We show that any long-unichord-free graph $G$ can be colored with at most $O(\omega^3)$ colors, where $\omega$ is the maximum number of pairwise adjacent vertices in $G$.

Topics: Discrete Mathematics, Data Structures and Algorithms, Combinatorics, Computing Research Repository,...

Source: http://arxiv.org/abs/1608.07413

0
0.0

Jun 30, 2018
06/18

by
Michael B. Cohen; Richard Peng

texts

######
eye 0

######
favorite 0

######
comment 0

We give a simple algorithm to efficiently sample the rows of a matrix while preserving the p-norms of its product with vectors. Given an $n$-by-$d$ matrix $\boldsymbol{\mathit{A}}$, we find with high probability and in input sparsity time an $\boldsymbol{\mathit{A}}'$ consisting of about $d \log{d}$ rescaled rows of $\boldsymbol{\mathit{A}}$ such that $\| \boldsymbol{\mathit{A}} \boldsymbol{\mathit{x}} \|_1$ is close to $\| \boldsymbol{\mathit{A}}' \boldsymbol{\mathit{x}} \|_1$ for all vectors...

Topics: Probability, Mathematics, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1412.0588

0
0.0

Jun 30, 2018
06/18

by
Bo Waggoner

texts

######
eye 0

######
favorite 0

######
comment 0

The classic problems of testing uniformity of and learning a discrete distribution, given access to independent samples from it, are examined under general $\ell_p$ metrics. The intuitions and results often contrast with the classic $\ell_1$ case. For $p > 1$, we can learn and test with a number of samples that is independent of the support size of the distribution: With an $\ell_p$ tolerance $\epsilon$, $O(\max\{ \sqrt{1/\epsilon^q}, 1/\epsilon^2 \})$ samples suffice for testing uniformity...

Topics: Statistics, Mathematics, Computing Research Repository, Statistics Theory, Data Structures and...

Source: http://arxiv.org/abs/1412.2314

0
0.0

Jun 29, 2018
06/18

by
Baoyuan Wu; Bernard Ghanem

texts

######
eye 0

######
favorite 0

######
comment 0

This paper revisits the integer programming (IP) problem, which plays a fundamental role in many computer vision and machine learning applications. The literature abounds with many seminal works that address this problem, some focusing on continuous approaches (e.g. linear program relaxation) while others on discrete ones (e.g., min-cut). However, a limited number of them are designed to handle the general IP form and even these methods cannot adequately satisfy the simultaneous requirements of...

Topics: Computer Vision and Pattern Recognition, Data Structures and Algorithms, Computing Research...

Source: http://arxiv.org/abs/1604.07666

0
0.0

Jun 30, 2018
06/18

by
Lingxiao Huang; Jian Li; Jeff M. Phillips; Haitao Wang

texts

######
eye 0

######
favorite 0

######
comment 0

With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over such data. In this paper, we initiate the study of constructing $\epsilon$-kernel coresets for uncertain points. We consider uncertainty in the existential model where each point's location is fixed but only occurs with a certain probability, and the locational...

Topics: Data Structures and Algorithms, Computing Research Repository, Computational Geometry

Source: http://arxiv.org/abs/1411.0194

0
0.0

Jun 30, 2018
06/18

by
Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur

texts

######
eye 0

######
favorite 0

######
comment 0

Given a language $L$ that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language $L\cdot\mathrm{Pal}$, where $\mathrm{Pal}$ is the language of all nonempty palindromes. Hence for every fixed positive $k$, $\mathrm{Pal}^k$ is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978.

Topics: Computing Research Repository, Data Structures and Algorithms, Formal Languages and Automata Theory

Source: http://arxiv.org/abs/1404.5244

0
0.0

Jun 30, 2018
06/18

by
David Eppstein

texts

######
eye 0

######
favorite 0

######
comment 0

We survey $k$-best enumeration problems and the algorithms for solving them, including in particular the problems of finding the $k$ shortest paths, $k$ smallest spanning trees, and $k$ best matchings in weighted graphs.

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1412.5075

0
0.0

Jun 30, 2018
06/18

by
David Eppstein; Denis Kurz

texts

######
eye 0

######
favorite 0

######
comment 0

We show that, for any graph optimization problem in which the feasible solutions can be expressed by a formula in monadic second-order logic describing sets of vertices or edges and in which the goal is to minimize the sum of the weights in the selected sets, we can find the $k$ best solutions for $n$-vertex graphs of bounded treewidth in time $\mathcal O(n+k\log n)$. In particular, this applies to the problem of finding the $k$ shortest simple paths between given vertices in directed graphs of...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1703.02784

4
4.0

Jun 27, 2018
06/18

by
Maria-Florina Balcan; Nika Haghtalab; Colin White

texts

######
eye 4

######
favorite 0

######
comment 0

The $k$-center problem is a canonical and long-studied facility location and clustering problem with many applications in both its symmetric and asymmetric forms. Both versions of the problem have tight approximation factors on worst case instances: a $2$-approximation for symmetric $k$-center and an $O(\log^*(k))$-approximation for the asymmetric version. In this work, we go beyond the worst case and provide strong positive results both for the asymmetric and symmetric $k$-center problems...

Topics: Computing Research Repository, Data Structures and Algorithms, Learning

Source: http://arxiv.org/abs/1505.03924

0
0.0

Jun 29, 2018
06/18

by
Gregory Gutin; Felix Reidl; Magnus Wahlström

texts

######
eye 0

######
favorite 0

######
comment 0

An out-branching and an in-branching of a digraph $D$ are called $k$-distinct if each of them has $k$ arcs absent in the other. Bang-Jensen, Saurabh and Simonsen (2016) proved that the problem of deciding whether a strongly connected digraph $D$ has $k$-distinct out-branching and in-branching is fixed-parameter tractable (FPT) when parameterized by $k$. They asked whether the problem remains FPT when extended to arbitrary digraphs. Bang-Jensen and Yeo (2008) asked whether the same problem is...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1612.03607

0
0.0

Jun 30, 2018
06/18

by
Kashyap Dixit

texts

######
eye 0

######
favorite 0

######
comment 0

We consider the problem of $L_p$-testing of class of bounded derivative properties over hypergrid domain with points distributed according to some product distribution. This class includes monotonicity, the Lipschitz property, $(\alpha,\beta)$-generalized Lipschitz and many more properties. Previous results for $L_p$ testing on $[n]^d$ for this class were known for monotonicity and $c$-Lipschitz properties over uniformly distributed domains. \medskip Our results imply testers that give the same...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1404.5545

0
0.0

Jun 30, 2018
06/18

by
Filip Pavetić; Goran Žužić; Mile Šikić

texts

######
eye 0

######
favorite 0

######
comment 0

In this paper we present $LCSk$++: a new metric for measuring the similarity of long strings, and provide an algorithm for its efficient computation. With ever increasing size of strings occuring in practice, e.g. large genomes of plants and animals, classic algorithms such as Longest Common Subsequence (LCS) fail due to demanding computational complexity. Recently, Benson et al. defined a similarity metric named $LCSk$. By relaxing the requirement that the $k$-length substrings should not...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1407.2407

1
1.0

Jun 30, 2018
06/18

by
Niv Buchbinder; Moran Feldman; Joseph Naor; Ohad Talmon

texts

######
eye 1

######
favorite 0

######
comment 0

We consider a multi-level aggregation problem in a weighted rooted tree, studied recently by Bienkowski et al. (2015). In this problem requests arrive over time at the nodes of the tree, and each request specifies a deadline. A request is served by sending it to the root before its deadline at a cost equal to the weight of the path from the node in which it resides to the root. However, requests from different nodes can be aggregated, and served together, so as to save on cost. The cost of...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1701.01936

1
1.0

Jun 30, 2018
06/18

by
Arthur Milchior

texts

######
eye 1

######
favorite 0

######
comment 0

We consider the three graph search algorithm LexDFS, LexUP and LexDOWN. We show that LexUP orderings can be computed in linear time by an algorithm similar to the one which compute LexBFS. Furthermore, LexDOWN orderings and LexDFS orderings can be computed in time $\left(n+m\log m\right)$ where $n$ is the number of vertices and $m$ the number of edges.

Topics: Computing Research Repository, Data Structures and Algorithms

Source: http://arxiv.org/abs/1701.00305

1
1.0

Jun 30, 2018
06/18

by
Yaroslav Akhremtsev; Peter Sanders; Christian Schulz

texts

######
eye 1

######
favorite 0

######
comment 0

In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processing and analyzing large complex networks. We address both problems in the (semi-)external model by adapting the size-constrained label propagation technique. Our (semi-)external size-constrained label propagation algorithm can be used to compute graph clusterings and is a prerequisite for the (semi-)external graph...

Topics: Data Structures and Algorithms, Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1404.4887

56
56

Nov 13, 2015
11/15

by
Florentin Smarandache

texts

######
eye 56

######
favorite 0

######
comment 0

This paper is an improvement of our paper “(t, i, f)-Neutrosophic Structures”, where we introduced for the first time a new type of structures, called (t, i, f)-Neutrosophic Structures, presented from a neutrosophic logic perspective, and we showed particular cases of such structures in geometry and in algebra.

Topics: structures, geometry, algebra

43
43

Nov 24, 2015
11/15

by
Florentin Smarandache

texts

######
eye 43

######
favorite 0

######
comment 0

In this paper we introduce for the first time a new type of structures, called (T, I, F)- Neutrosophic Structures, presented from a neutrosophic logic perspective, and we show particular cases of such structures in geometry and in algebra.

Topics: neutrosophy, neutrosophic structures, algebraic structures

1
1.0

Jun 30, 2018
06/18

by
Russell Impagliazzo; Shachar Lovett; Ramamohan Paturi; Stefan Schneider

texts

######
eye 1

######
favorite 0

######
comment 0

We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor. Specifically, our algorithm runs in time $2^{(1-\text{poly}(1/c))n}$ where n is the number of variables and cn is the number of constraints. The key idea for the algorithm is a reduction to the Vector Domination problem and a new algorithm for that subproblem.

Topics: Computational Complexity, Computing Research Repository, Data Structures and Algorithms

Source: http://arxiv.org/abs/1401.5512

This research is on the process for high-temperature dehydration of sodium orthophosphates with the ratio Na2O:P2O5 = 0.73 in pH = 6.3. Temperature parameters for the formation of sodium tripolyphosphates form I and form II using physico-chemical methods are established. It shows the synthesis possibility of sodium tripolyphosphate in the set form. Dried samples of a mixture of 1 mole of dihydrogen phosphate and 2 moles of sodium hydrogen phosphate was prepared and heated for 1 hour at...

Topics: Dehydrated Sodium Phosphates, The Forms Ii & I, Pyro-, Metaphosphates, Chain Structures, Endo-...

Pattern search PS method is an effective method for finding the optimum results of any kind of optimization problem, The big advantage of using any method in engineering optimization problems specifically, is that it can be used with highly constrained design of structures. Finding the optimum bracing point for long columns design represents a challenging problem to the efficiency of any optimization method. By limiting the design procedure with many non linear constraints for the buckling...

Topics: Optimum Bracing Point, Pattern Search, Structural Optimization, Reinforced Concrete Structures,...

The mechanical behavior of 20 ppi open cells Al6061 alloy foam is studied under uniaxial tensile, compression and bending loads. In addition to the common stress–strain measurements, peak load, ultimate stress, displacement at peak load, break load, displacement at break load, breaking stress and Percentage reduction in the cross-sectional area for two specimens were determined. The results show that even though aluminium foams were having good thermal and damping properties, they are having...

Topics: uniaxial tensile, break load & load bearing structures

13
13

Oct 12, 2017
10/17

by
Ahmed Mohammed sadiq

texts

######
eye 13

######
favorite 0

######
comment 0

construction materials, and methods

Topic: 2nd class water resources and hydraulic structures

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

Drop test at the drop tower. Photographed at the Impact Dynamics Research Facility, building 1297.

Topic: AIRCRAFT STRUCTURES -- ENERGY ABSORPTION

179
179

Aug 22, 2016
08/16

by
Impact Journals

texts

######
eye 179

######
favorite 0

######
comment 0

The purpose of this study was to investigate changing family structures and their impactions on gender roles in Nakuru Municipality, Nakuru County. This study was conducted in Nakuru Municipality within Nakuru County and was confined to household heads. Main focus was on the five divisions within the Municipality namely; Lanet, Afraha, Kaptembwa, Baharini and Barut. The objectives of the study included examining factors leading to changing family structures; exploring how changing family...

Topics: Changing Family Structures, Gender Roles, Children’s Behavior

367
367

texts

######
eye 367

######
favorite 0

######
comment 0

Steel braced frame is one of the structural systems used to resist earthquake loads in structures. Many existing reinforced concrete structures need retrofitting to overcome deficiencies and to resist seismic loads. The use of steel bracing systems for strengthening or retrofitting seismically in adequate reinforced concrete frames is a viable solution for enhancing earthquake resistance. Steel bracing is economical, easy to erect, occupies less space and has flexibility to design for...

Topics: Analysis, Earthquake Strengthening, Retrofit, Seismic Performance, Steel Braced RC Structures

55
55

Sep 26, 2011
09/11

by
John Brookes

texts

######
eye 55

######
favorite 1

######
comment 0

Topics: Gardening, Gardening / Horticulture, Gardening/Plants, Landscape, Gardening / Landscape, Lawns,...