248,334 research outputs found
Joshua Davis: Author of Spare Parts
No full textCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
Bærekraft i Circle K Norge
No full textBacheloroppgave i Økonomi og administrasjon fra Handelshøyskolen BI, 2019I min bacheloroppgave ønsket jeg å knytte Circle K Norge og bærekraft sammen
og se på hvilken betydning dette har for de ansatte. Problemstillingen ble dermed:
Hvilken betydning har økt fokus på bærekraftig utvikling for de ansatte i Circle K
Norge?
Oppgaven vil ta for seg viktigheten av å være bærekraftige både for de allerede
ansatte og deres motivasjon, men også for potensielle ansatte og omdømmet til
Circle K.
Problemstillingen har vært utgangspunktet for oppgaven og blitt underbygd med
tre underproblemstillinger som bærekraft, motivasjon og rekruttering, som også er
hovedområdene for teoriinnhenting. De mest sentrale teoriene som har blitt brukt
er klassisk motivasjonsteori som Maslow og ytre-/indre motivasjon,
målsettingsteori, rekrutteringsprosessen og teorier og statistikk om
samfunnsansvar og bærekraft. Teorifundamentet ble brukt til å forme en
spørreundersøkelse og diskutere resultatene.
Dataene jeg har brukt i oppgaven er samlet inn i samarbeid med ansatte på Circle
K sitt hovedkontor i Oslo. Spørreundersøkelsen, som ble utført i Qualtrics, fikk 24
respondenter og all data ble analysert i Excel. Funnene i spørreundersøkelsen
viser at de ansatte i Circle K Norge er mer opptatt av bærekraft personlig enn på
jobb. De ansatte mener også miljøskadelig emballasje og reduksjon av matavfall
er de viktigste områdene Circle K kan bli bærekraftige på. Det er mulige
psykologiske barrierer som Circle K må bryte ned for å styrke den indre
motivasjonen de ansatte har og dermed kan bidra til bærekraftig utvikling.
Det er viktig at Circle K involverer de ansatte i målsettingen av bærekraftige for å
motivere de og skape engasjement. Dette kan resultere i at bærekraft blir en
naturlig del av jobbhverdagen til de ansatte og kan styrke omdømmet til Circle K
Optical and electronic properties of bismuth-implanted glasses
No full textPhotoluminescence (PL) and excitation spectra of Bi melt doped oxide and chalcogenide glasses are very similar, indicating the same Bi center is present. When implanted with Bi, chalcogenide, phosphate and silica glass, and BaF2 crystal all display characteristically different PL spectra to when Bi is incorporated by melt-doping. This indicates that ion implantation is able to generate Bi centers which are not present in samples whose dopants are introduced during melting. Bi-related PL bands have been observed in glasses with very similar compositions to those in which carrier-type reversal has been observed, indicating that these phenomena are related to the same Bi centers, which we suggest are interstitial Bi2+ and Bi clusters
K maximum probability attack paths generation algorithm for target nodes in networked systems
No full textAs known, security system administrators need to be aware of the security risks and abnormal behaviors in a network system. Given the exploitation probability value of each vulnerability, the cumulative probability of an attack path from an attacker to a target node can be quantified and calculated, namely as the K maximum probability attack paths for a target node. It is proposed in this paper a design to compute the K maximum probability attack paths for a given set of target nodes, where available vulnerability sets for each node in the system are built and assigned to different access flags during the computation process of attack paths, aimed at reducing the computation costs. Experimental results show that the proposed design can improve the performance on the computation of the K maximum probability attack paths for a given set of target nodes, promising and more efficient than existing algorithms to generate the attack paths
Constructing vertex-disjoint paths in (n,k)-star graphs
No full text[[abstract]]This work describes a novel routing algorithm for constructing a container of width n - 1 between a pair of vertices in an (n, k)-star graph with connectivity it - 1. Since Lin et al. [T.C. Lin, D.R. Duh, H.C. Cheng, Wide diameter of (n, k)-star networks, in: Proceedings of the International Conference on Computing, Communications and Control Technologies, vol. 5, 2004 pp. 160-165] already calculated the wide diameters in (n, n - 1)-star and (n, 1)-star graphs, this study only considers an (n, k)-star with 2 <= k <= n - 2. The length of the longest container among all constructed containers serves as the upper bound of the wide diameter of an (n, k)-star graph. The lower bound of the wide diameter of an (n, k)-star graph with 2 <= k <= [n/2] and the lower bound of the wide diameter of a regular graph with a connectivity of 2 or above are also computed. Measurement results indicate that the wide diameter of an (n, k)-star graph is its diameter plus 2 for 2 <= k <= [n/2], or its diameter plus a value between 1 and 2 for [n/2] + 1 <= k <= n - 2. (c) 2007 Elsevier Inc. All rights reserved.[[note]]SC
Sample Efficient Search to Decision for LIN
No full textThe LIN problem concerns solving noisy systems of random sparse linear equations mod 2. It gives rise to natural candidate hard CSP distributions and is a cornerstone of local cryptography. Recently, it was used in advanced cryptographic constructions, under the name \u27sparse LPN\u27.
For constant sparsity and inverse polynomial noise rate, both search and decision versions of LIN are statistically possible and conjectured to be computationally hard for , where is the number of -sparse linear equations, and is the number of variables.
We show an algorithm that given access to a distinguisher for
LIN with samples, solves search LIN with roughly samples. Previously, it was only known how to reduce from search LIN with samples, yielding meaningful guarantees for decision LIN only when .
The reduction succeeds even if the distinguisher has sub-constant advantage at a small additive cost in sample complexity. Our technique applies with some restrictions to Goldreich\u27s function and LIN with random coefficients over other finite fields
Bi-sided facility location problems: an efficient algorithm for k-centre, k-median, and travelling salesman problems
No full textThis study introduces a general framework, called Bi-sided facility location, for a wide range of problems in the area of combined facility location and routing problems such as locating test centres and designing the network of supermarkets. It is based on a multi-objective optimisation model to enhance the service quality which the clients received, called client-side, and enhance the interconnection quality and eligibility among the centres, called center-side. Well-known problems such as k-median and k-centre for the client-side and the travelling salesman problem for the centre-side are taken into account in this paper. After discussing the complexity of this kind of combination, we propose a heuristic approximation algorithm to find approximation Pareto-optimal solutions for the problem. The algorithm is an efficient local search utilising geometric objects such as the Voronoi diagram and Delaunay triangulation as well as algorithms for computing approximation travelling salesman tour. In addition to the comprehensive theoretical analysis of the proposed models and algorithm, we apply the algorithm to different instances and benchmarks, and compare it with NSGA-II based on set coverage and spacing metrics. The results confirm the efficiency of the algorithm in terms of running time and providing a diverse set of efficient trade-off solutions. Highlights: Introducing a general bi-side location model considering centres and clients’ utilities Discussing and proving the NP-hardness of the model in the general framework Considering two instances; k-centre and k-median for client-side and TSP for centre-side Proposing an efficient geometric-based algorithm for solving the problems Implementing, testing, and comparing the proposed algorithm on several benchmarks.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Transport and Logistic
Rathalos treecko Lin & Zhao & Koh & Li 2022, comb. nov.
No full textRathalos treecko (Lin & Li, 2021) comb. nov. Anyphaena treecko Lin & Li, In: Lin et al., 2021: 101, figs 9A–C, 10A–B, 14I–J. Material examined. Holotype ♂ (IZCAS-Ar42404), China: Hainan, Changjiang County, Bawangling, Dongsizhan (19.0495°N, 109.1157°E), 23 April 2009, G. Tang leg. (examined). Paratypes. 2♀ (IZCAS-Ar42405–Ar42406), same data as holotype (examined). Diagnosis. See Lin et al. (2021). Description. See Lin et al. (2021). Distribution. China (Hainan). Comments. The cymbial apophysis, the triangular epigyne and the straight copulatory duct indicate that this species belongs to Rathalos Lin & Li, gen. nov. Thus, we transfer it from Anyphaena to Rathalos Lin & Li, gen. nov.Published as part of Lin, Yejie, Zhao, Huifeng, Koh, Joseph K H & Li, Shuqiang, 2022, Taxonomy notes on twenty-eight spider species (Arachnida: Araneae) from Asia, pp. 198-270 in Zoological Systematics 47 (3) on page 201, DOI: 10.11865/zs.2022303, http://zenodo.org/record/717585
Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL
No full textWe present a new general framework for constructing compact and adaptively secure attribute-based encryption (ABE) schemes from -Lin in asymmetric bilinear pairing groups. Previously, the only construction [Kowalczyk and Wee, Eurocrypt \u2719] that simultaneously achieves compactness and adaptive security from static assumptions supports policies represented by Boolean formulae. Our framework enables supporting more expressive policies represented by arithmetic branching programs.
Our framework extends to ABE for policies represented by uniform models of computation such as Turing machines. Such policies enjoy the feature of being applicable to attributes of arbitrary lengths. We obtain the first compact adaptively secure ABE for deterministic and non-deterministic finite automata (DFA and NFA) from -Lin, previously unknown from any static assumptions. Beyond finite automata, we obtain the first ABE for large classes of uniform computation, captured by deterministic and non-deterministic logspace Turing machines (the complexity classes and ) based on -Lin. Our ABE scheme has compact secret keys of size linear in the description size of the Turing machine . The ciphertext size grows linearly in the input length, but also linearly in the time complexity, and exponentially in the space complexity. Irrespective of compactness, we stress that our scheme is the first that supports large classes of Turing machines based solely on standard assumptions. In comparison, previous ABE for general Turing machines all rely on strong primitives related to indistinguishability obfuscation
- …
