2,719 research outputs found

    Comment on "Support Vector Machines with Applications"

    Full text link
    Comment on "Support Vector Machines with Applications" [math.ST/0612817]Comment: Published at http://dx.doi.org/10.1214/088342306000000475 in the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org

    On small Mixed Pattern Ramsey numbers

    Full text link
    We call the minimum order of any complete graph so that for any coloring of the edges by kk colors it is impossible to avoid a monochromatic or rainbow triangle, a Mixed Ramsey number. For any graph HH with edges colored from the above set of kk colors, if we consider the condition of excluding HH in the above definition, we produce a \emph{Mixed Pattern Ramsey number}, denoted Mk(H)M_k(H). We determine this function in terms of kk for all colored 44-cycles and all colored 44-cliques. We also find bounds for Mk(H)M_k(H) when HH is a monochromatic odd cycles, or a star for sufficiently large kk. We state several open questions.Comment: 16 page

    Soft-matter damage detection systems for electronics and structures

    Get PDF
    Soft-matter technologies are essential for emerging applications in wearable computing, human-machine interaction, and soft robotics. However, as these technologies gain adoption in society and interact with unstructured environments, material and structure damage becomes inevitable. Here, we present a robotic material that mimics soft tissues found in biological systems to identify, compute, and respond to damage. This system is composed of liquid metal droplets dispersed in soft elastomers that rupture when damaged, creating electrically conductive pathways that are identified with a soft active-matrix grid. This presents new opportunities to autonomously identify damage, calculate severity, and respond to prevent failure within robotic systems

    SoK: A Practical Cost Comparison Among Provable Data Possession Schemes

    Get PDF
    Provable Data Possession (PDP) schemes provide users with the ability to efficiently audit and verify the integrity of data stored with potentially unreliable third-parties, such as cloud storage service providers. While dozens of PDP schemes have been developed, no PDP schemes have been practically implemented with an existing cloud service. This work attempts to provide a starting point for the integration of PDP schemes with cloud storage service providers by providing a cost analysis of PDP schemes. This cost analysis is performed by implementing and analyzing five PDP schemes representative of the dozens of various PDP approaches. This paper provides analysis of the overhead and performance of each of these schemes to generate a comparable cost for each scheme using real-world cloud pricing models. Results show that the total cost of each scheme is comparable for smaller file sizes, but for larger files this cost can vary across schemes by an order of magnitude. Ultimately, the difference in cost between the simple MAC-based PDP scheme and the most efficient PDP scheme is negligible. While the MAC-PDP scheme may not be the most efficient, no other scheme improving upon it\u27s complexity can be implemented without the use of additional services or APIs leading to the conclusion that the simplest, storage only PDP scheme is the most practical to implement. Furthermore, the findings in this paper suggest that, in general, PDP schemes optimize on an inaccurate cost model and that future schemes should consider the existing economic realities of cloud services
    corecore