Interaction languages such as MSC are often associated with formal semantics by means of translations into distinct behavioral formalisms such as automatas or Petri nets. In contrast to translational approaches we propose an operational approach. Its principle is to identify which elementary communication actions can be immediately executed, and then to compute, for every such action, a new interaction representing the possible continuations to its execution. We also define an algorithm for checking the validity of execution traces (i.e. whether or not they belong to an interaction's semantics). Algorithms for semantic computation and trace validity are analyzed by means of experiments.

For real-time semantic video segmentation, most recent works utilised a dynamic framework with a key scheduler to make online key/non-key decisions. Some works used a fixed key scheduling policy, while others proposed adaptive key scheduling methods based on heuristic strategies, both of which may lead to suboptimal global performance. To overcome this limitation, we model the online key decision process in dynamic video segmentation as a deep reinforcement learning problem and learn an efficient and effective scheduling policy from expert information about decision history and from the process of maximising global return. Moreover, we study the application of dynamic video segmentation on face videos, a field that has not been investigated before. By evaluating on the 300VW dataset, we show that the performance of our reinforcement key scheduler outperforms that of various baselines in terms of both effective key selections and running speed. Further results on the Cityscapes dataset demonstrate that our proposed method can also generalise to other scenarios. To the best of our knowledge, this is the first work to use reinforcement learning for online key-frame decision in dynamic video segmentation, and also the first work on its application on face videos.

For $n$-vertex graphs with treewidth $k = O(n^{1/2-epsilon})$ and an arbitrary $epsilon>0$, we present a word-RAM algorithm to compute vertex separators using only $O(n)$ bits of working memory. As an application of our algorithm, we give an $O(1)$-approximation algorithm for tree decomposition. Our algorithm computes a tree decomposition in $c^k n (log log n) log^* n$ time using $O(n)$ bits for some constant $c > 0$.

We finally use the tree decomposition obtained by our algorithm to solve Vertex Cover, Independent Set, Dominating Set, MaxCut and $3$-Coloring by using $O(n)$ bits as long as the treewidth of the graph is smaller than $c' log n$ for some problem dependent constant $0 < c' < 1$.

Stockhusen and Tantau (IPEC 2013) defined the operators paraW and paraBeta for parameterised space complexity classes by allowing bounded nondeterminism with multiple read and read-once access, respectively. Using these operators, they obtained characterisations for the complexity of many parameterisations of natural problems on graphs.

In this article, we study the counting versions of such operators and introduce variants based on tail-nondeterminism, paraW[1] and paraBetaTail, in the setting of parameterised logarithmic space. We examine closure properties of the new classes under the central reductions and arithmetic operations. We also identify a wide range of natural complete problems for our classes in the areas of walk counting in digraphs, first-order model-checking and graph-homomorphisms. In doing so, we also see that the closure of #paraBetaTail-L under parameterised logspace parsimonious reductions coincides with #paraBeta-L. We show that the complexity of a parameterised variant of the determinant function is #paraBetaTail-L-hard and can be written as the difference of two functions in #paraBetaTail-L for (0,1)-matrices. Finally, we characterise the new complexity classes in terms of branching programs.

We develop a supervised machine learning algorithm that is able to learn topological phases for finite condensed matter systems from bulk data in real lattice space. The algorithm employs diagonalization in real space together with any supervised learning algorithm to learn topological phases through an eigenvector ensembling procedure. We combine our algorithm with decision trees and random forests to successfully recover topological phase diagrams of Su-Schrieffer-Heeger (SSH) models from bulk lattice data in real space and show how the Shannon information entropy of ensembles of lattice eigenvectors can be used to retrieve a signal detailing how topological information is distributed in the bulk. The discovery of Shannon information entropy signals associated with topological phase transitions from the analysis of data from several thousand SSH systems illustrates how model explainability in machine learning can advance the research of exotic quantum materials with properties that may power future technological applications such as qubit engineering for quantum computing.

There exist two notions of equivalence of behavior between states of a Labelled Markov Process (LMP): state bisimilarity and event bisimilarity. The first one can be considered as an appropriate generalization to continuous spaces of Larsen and Skou's probabilistic bisimilarity, while the second one is characterized by a natural logic. C. Zhou expressed state bisimilarity as the greatest fixed point of an operator $mathcal{O}$, and thus introduced an ordinal measure of the discrepancy between it and event bisimilarity. We call this ordinal the "Zhou ordinal" of $mathbb{S}$, $mathfrak{Z}(mathbb{S})$. When $mathfrak{Z}(mathbb{S})=0$, $mathbb{S}$ satisfies the Hennessy-Milner property. The second author proved the existence of an LMP $mathbb{S}$ with $mathfrak{Z}(mathbb{S}) geq 1$ and Zhou showed that there are LMPs having an infinite Zhou ordinal. In this paper we show that there are LMPs $mathbb{S}$ over separable metrizable spaces having arbitrary large countable $mathfrak{Z}(mathbb{S})$ and that it is consistent with the axioms of $mathit{ZFC}$ that there is such a process with an uncountable Zhou ordinal.

Passive optical networks (PON) can play a vital role in data centres and access fog solutions by providing scalable, cost and energy efficient architectures. This paper proposes a Mixed Integer Linear Programming (MILP) model to optimize the placement of virtual machines (VMs) over an energy efficient WDM-TDM AWGR PON based data centre architecture. In this optimization, the use of VMs and their requirements affect the optimum number of servers utilized in the data centre when minimizing the power consumption and enabling more efficient utilization of servers is considered. Two power consumption minimization objectives were examined for up to 20 VMs with different computing and networking requirements. The results indicate that considering the minimization of the processing and networking power consumption in the allocation of VMs in the WDM-TDM AWGR PON can reduce the networking power consumption by up to 70% compared to the minimization of the processing power consumption.

This paper proposes a faceted information exploration model that supports coarse-grained and fine-grained focusing of geographic maps by offering a graphical representation of data attributes within interactive widgets. The proposed approach enables (i) a multi-category projection of long-lasting geographic maps, based on the proposal of efficient facets for data exploration in sparse and noisy datasets, and (ii) an interactive representation of the search context based on widgets that support data visualization, faceted exploration, category-based information hiding and transparency of results at the same time. The integration of our model with a semantic representation of geographical knowledge supports the exploration of information retrieved from heterogeneous data sources, such as Public Open Data and OpenStreetMap. We evaluated our model with users in the OnToMap collaborative Web GIS. The experimental results show that, when working on geographic maps populated with multiple data categories, it outperforms simple category-based map projection and traditional faceted search tools, such as checkboxes, in both user performance and experience.

With the continued digitalization of societal processes, we are seeing an explosion in available data. This is referred to as big data. In a research setting, three aspects of the data are often viewed as the main sources of challenges when attempting to enable value creation from big data: volume, velocity and variety. Many studies address volume or velocity, while much fewer studies concern the variety. Metric space is ideal for addressing variety because it can accommodate any type of data as long as its associated distance notion satisfies the triangle inequality. To accelerate search in metric space, a collection of indexing techniques for metric data have been proposed. However, existing surveys each offers only a narrow coverage, and no comprehensive empirical study of those techniques exists. We offer a survey of all the existing metric indexes that can support exact similarity search, by i) summarizing all the existing partitioning, pruning and validation techniques used for metric indexes, ii) providing the time and storage complexity analysis on the index construction, and iii) report on a comprehensive empirical comparison of their similarity query processing performance. Here, empirical comparisons are used to evaluate the index performance during search as it is hard to see the complexity analysis differences on the similarity query processing and the query performance depends on the pruning and validation abilities related to the data distribution. This article aims at revealing different strengths and weaknesses of different indexing techniques in order to offer guidance on selecting an appropriate indexing technique for a given setting, and directing the future research for metric indexes.

In a temporal network causal paths are characterized by the fact that links from a source to a target must respect the chronological order. In this article we study the causal paths structure in temporal networks of human face to face interactions in different social contexts. In a static network paths are transitive i.e. the existence of a link from $a$ to $b$ and from $b$ to $c$ implies the existence of a path from $a$ to $c$ via $b$. In a temporal network the chronological constraint introduces time correlations that affects transitivity. A probabilistic model based on higher order Markov chains shows that correlations that can invalidate transitivity are present only when the time gap between consecutive events is larger than the average value and are negligible below such a value. The comparison between the densities of the temporal and static accessibility matrices shows that the static representation can be used with good approximation. Moreover, we quantify the extent of the causally connected region of the networks over time.

We develop a categorical compositional distributional semantics for Lambek Calculus with a Relevant Modality !L*, which has a limited edition of the contraction and permutation rules. The categorical part of the semantics is a monoidal biclosed category with a coalgebra modality, very similar to the structure of a Differential Category. We instantiate this category to finite dimensional vector spaces and linear maps via "quantisation" functors and work with three concrete interpretations of the coalgebra modality. We apply the model to construct categorical and concrete semantic interpretations for the motivating example of !L*: the derivation of a phrase with a parasitic gap. The effectiveness of the concrete interpretations are evaluated via a disambiguation task, on an extension of a sentence disambiguation dataset to parasitic gap phrase one, using BERT, Word2Vec, and FastText vectors and Relational tensors.

There’s a cliche that always follows a big tragedy — something we say after natural disasters, economic collapses, school shootings, acts of terrorisms.…

There are no legal skirmishes in Ford v Ferrari.…

[IMAGE-1] Before smartphones and Instagram, there were influencers, and they could be as shallow, overconfident and pejorative as they are today. This new adaptation of Jane Austen's Emma — the feature debuts of photographer and music-video director Autumn de Wilde and Man Booker Prize-winning novelist turned screenwriter Eleanor Catton — brings that sort of modern frisson to its retelling of the tale of a very rich young woman who amuses herself by interfering in the romantic lives of those around her.…

[IMAGE-1] Part of being a music lover is also being a snob, and even though my mind has opened considerably as I've aged, I still remember all the genres I just couldn't give any time to when I was growing up. Southern rock was definitely verboten for much of my life.…

You don't have to wander around the internet long before bumping into a rave review of Fiona Apple's new record Fetch the Bolt Cutters: It has inspired breathless acclaim, has already been labeled a masterwork and is notably the first new album in nearly a decade that Pitchfork has assigned a perfect 10/10 rating.…

…

Sewing is my new coping mechanism.…

ON INLANDER.COM NATION: As meatpacking plants nationwide shutdown due to COVID-19 outbreaks, certain meat products are becoming harder to find at grocery stores and fast-food drive-thrus.…

By Adam Liptak The New York Times Company…

Designology Interiors' Deanna Goguen has three bathrooms in her South Hill-area home, each with its own personality.…

If you've ever been compelled to visit Chewelah, it has likely been related to a trip to 49 Degrees North.…

Warm summer nights are on the way.…

Erin Haskell Gourde isn't afraid to mix it up a little.…

In one embodiment, the invention relates to processes for producing acesulfame potassium. In one embodiment, the process comprises the step of reacting a first reaction mixture to form an amidosulfamic acid salt such as a trialkyl ammonium amidosulfamic acid salt. The first reaction mixture comprises sulfamic acid, an amine, and smaller amounts, if any, acetic acid, e.g., less than 1 wt % (10000 wppm). In terms of ranges, the first reaction mixture may comprise from 1 wppm to 1 wt % acetic acid. The process further comprises the step of reacting the amidosulfamic acid salt with diketene to form an acetoacetamide salt. In preferred embodiments, the amidosulfamic acid salt formation reaction is conducted at pH levels from 5.5 to 7.0. The process further comprises the step of deriving the acesulfame-K from the acetoacetamide salt.

Provided are an anti-static and anti-microbial surface treatment agent including a quaternary ammonium salt compound as an active ingredient and a method of preventing a polymer fiber from developing static electricity by using the surface treatment agent. The quaternary ammonium salt compound has excellent anti-static and anti-microbial effects for the prevention or improvement of static electricity in a polymer fiber. Accordingly, the quaternary ammonium salt compound is suitable for use as a fabric softener, or an anti-static agent, and also, provides anti-microbial effects to a polymer fiber.

A “Wearable Electromyography-Based Controller” includes a plurality of Electromyography (EMG) sensors and provides a wired or wireless human-computer interface (HCI) for interacting with computing systems and attached devices via electrical signals generated by specific movement of the user's muscles. Following initial automated self-calibration and positional localization processes, measurement and interpretation of muscle generated electrical signals is accomplished by sampling signals from the EMG sensors of the Wearable Electromyography-Based Controller. In operation, the Wearable Electromyography-Based Controller is donned by the user and placed into a coarsely approximate position on the surface of the user's skin. Automated cues or instructions are then provided to the user for fine-tuning placement of the Wearable Electromyography-Based Controller. Examples of Wearable Electromyography-Based Controllers include articles of manufacture, such as an armband, wristwatch, or article of clothing having a plurality of integrated EMG-based sensor nodes and associated electronics.

Various embodiments provide lossless compression of an enumeration space for genetic founder lines. In one embodiment, an input comprising a set of genetic founder lines and a maximum number of generations G is obtained. A set of genetic crossing templates of a height h is generated. A determination is made if at least a first genetic crossing template in the set of genetic crossing templates is redundant with respect to a second genetic crossing template in the set of genetic crossing templates. Based on the at least first genetic crossing template being redundant is redundant with respect to the second genetic crossing template, the at least first genetic crossing template is removed from the set of genetic crossing templates. This process of removing the at least first genetic crossing template from the set of genetic crossing templates the redundant creates an updated set of genetic crossing templates.

A computer implemented method for automatic chemical assay classification, the method comprising steps the computer is programmed to perform, the steps comprising: receiving a plurality of sets of parameters, each one of the received sets of parameters characterizing a respective assay of a chemical reaction, calculating a space enhancing proximity among points representative of assays of qualitatively identical chemical reactions, and representing each one of at least two of the received sets of parameters as a respective point in the calculated space, and dividing the points in the calculated space into a number of groups, according to proximity among the points in the calculated space, each group pertaining to a respective chemical reaction, thereby classifying the assays.

Systems and methods are disclosed that may be implemented for network management system (NMS) configuration management support for network devices using a learning and natural language processing application to capture the usage and behavior of the Command Line Interface (CLI) of a network device with the aid of a CLI knowledge model, which in one example may be ontology-based.

Provided are a method, computer program product, and system for generating a recommendation for transfer of ownership of content. At least one characteristic of a first owner is determined. At least one characteristic of the content is determined. A second owner for the content is determined based on the at least one characteristic of the first owner, and the at least one content characteristic. The recommendation for transfer of ownership is generated, based at least in part on the determination of the second owner.

An object of the present invention is to provide a novel trans-2-decenoic acid derivative or a pharmaceutically acceptable salt thereof and to provide a pharmaceutical agent which contains said compound as an active ingredient and has a highly safe neurotrophic factor-like activity or an alleviating action for side effect induced by administration of anti-cancer agents. The trans-2-decenoic acid derivative or a pharmaceutically acceptable salt thereof which is the compound of the present invention is specifically represented by the formula (1): (In the formula, Y is —O—, —NR— or —S—, R is hydrogen atom, alkyl group, dialkylaminoalkyl group or the like and W is a substituent such as dialkylaminoalkyl group) and has a quite high usefulness as a pharmaceutical agent such as a preventive or therapeutic agent for dementia, Alzheimer's disease, Parkinson's disease, depression, etc., a treating or repairing agent for spinal cord injury.

The invention relates to ceramide dimers which are constructed from two ceramide molecules which are crosslinked to each other via their lipophilic end. The ceramide molecules thereby have at least one hydrophilic group at their hydrophilic end for increasing the hydration shell of the dimer. The ceramide dimers according to the invention can be used as pharmaceutical preparation or as cosmetic preparation.

The present invention relates to a novel acid addition salt of risperidone, wherein acid counterion is selected from the group consisting of pamoic acid, caproic acid, cypionic acid, decanoic acid, camphor sulfonic acid, enanthic acid, palmitic acid, fusidic acid, gluceptic acid, gluconic acid, lactobionic acid, lauric acid, levulinic acid and valeric acid, a process for the preparation and pharmaceutical composition comprising the same. Further, the invention relates to the use of said pharmaceutical composition comprising the acid addition salt of risperidone in the treatment of patient suffering from psychotic disorders.

The present invention relates to novel heterocycle-substituted diphosphonic acids, and the pharmaceutically-acceptable salts and esters thereof, in which the diphosphonate-substituted carbon atom moiety is attached to a carbon atom in a nitrogen-containing six membered ring heterocycle, preferably a piperidine ring. The heterocycle-substituted diphosphonic acid compounds have the general structure: ##STR1## wherein Z is a nitrogen-containing six membered ring heterocycle moiety selected from piperidinyl, diazinyl and triazinyl; m, n and m+n are from 0 to 10; Q is a covalent bond or a moiety selected from oxygen, sulfur or nitrogen; and R1, R2, R3 and R4 are substituent groups.The present invention further relates to pharmaceutical compositions containing these novel compounds. Finally this invention relates to methods for treating or preventing diseases characterized by abnormal calcium and phosphate metabolism by utilizing a compound or pharmaceutical composition of the present invention.

Antivirally active compounds of formula (I), wherein R1 is hydrogen, hydroxy, mercapto or amino; R2 is hydrogen, hydroxy, fluoro, chloro or amino; R3 and R4 are independently selected from (II), (III), amino, hydroxy or an ether or ester residue thereof, or R3 together with R4 is (IV), wherein M is hydrogen or a pharmaceutically acceptable counterion; and n is 1 or 2; with the proviso that, when R2 is amino and R3 and R4 are hydroxy, R1 is not hydroxy and in addition, when n=1, R1 is not hydrogen, and pharmaceutically acceptable salts thereof; processes for preparation of said compounds, a pharmaceutical composition comprising said compounds, methods for treatments of virus infections as well as use of compounds of formula (I) without the proviso for the manufacture of a medicament for treatment of AIDS. ##STR1##

Provided is a surface treated calcium carbonate filler for resins, which comprises calcium carbonate particles, the surface of which has been treated with at least one surface active agent (A) selected from the group consisting of saturated fatty acids, unsaturated fatty acids, alicyclic carboxylic acids, resin acids, and salts thereof and with at least one compound (B) having the ability to chelate alkaline earth metals, the compound (B) being selected from the group consisting of phosphonic acids, polycarboxylic acids, and salts thereof. The surface treated calcium carbonate filler for resins of the present invention deteriorates little with time, has satisfactory dispersibility in resins, and can give a sheet or film which has a satisfactory balance among durability, weatherability, strength, and thermal stability, and is useful as a battery separator or a light reflector.

Disclosed herein are surface treatments for soft silicone gel materials such as silicone intraocular lenses.

The invention provides a method for preventing discoloration of pyrithione-containing materials, in particular plastic materials or other material such as paints, coatings, adhesives or textiles which are exposed to an outdoor environment. The method is likewise suited for preventing discoloration of other pyrithione-containing materials such as personal care compositions like shampoos. A discoloration inhibitor that includes dehydroacetic acid or a salt thereof is added to the pyrithione-containing material. The discoloration is prevented without the addition of a cyclic organic phosphoric acid ester or an organic phosphite. Use of the discoloration inhibitor does not interfere with the antimicrobial effect of the pyrithione.

Methods and apparatus for output of high-bandwidth debug data/traces in electronic devices using embedded high-speed debug port(s). Debug data is received from multiple blocks and buffered in a buffer. The buffer's output is operatively coupled to one or more high-speed serial I/O interfaces via muxing logic during debug test operations. The buffered data is encoded as serialized data and sent over the one or more high-speed serial I/O interfaces to a logic device that receives serialized data and de-serializes it to generate parallel debug data that is provided to a debugger. The buffer may be configured as a bandwidth-adapting buffer that facilitates transfer of debug data that is received at a variable combined data rate outbound via the one or more high-speed serial I/O interfaces at a data rate corresponding to the bandwidth of the serial I/O interfaces.

The invention in particular has as an object detecting incompatibility between equipment items of a on-board system. A logic interface associated with one equipment item comprises at least one input while a logic interface associated with another equipment item comprises at least one output. The input and the output are connected. After a minimal data definition level associated with the input and a data definition level associated with the output have been obtained (505), the said minimal data definition level associated with the input is compared (515) with the said data definition level associated with the output. Following this comparison, if the said minimal data definition level associated with the input is lower than the said data definition level associated with the output, an alarm indicating an incompatibility of these two equipment items is generated (545).

A double data rate memory physical interface having self checking loopback logic on-chip is disclosed. Disposed on the chip is a first linear feedback shift register, which is capable of generating a set of test data values that comprise at least two data bits. Also disposed on the chip is a second linear feedback shift register. The second linear feedback shift register is capable of generating a set of expected data values that match the test data values. Further, an internal loopback error check element is disposed on the chip. The internal loopback error check element is used to compare the set of expected data values with the set of test data values.

Methods and systems for in-place updating original content stored in a non-volatile storage device and for yielding updated content. Some of the described embodiments illustrate the possibilities for reduction in storage operations, storage blocks, and/or update package size. Some of the described embodiments include the writing of error recovery result(s) such as XOR result(s) which enable the recovery of data in case of an interruption of the update process. In some of the described embodiments, there is re-usage of a protection buffer containing content which is required in the update process.

The invention relates to the treatment of carbonaceous radioactive waste, comprising the delivery of waste to one or more radioactive isotope separation stations isotopes, said isotopes being among at least carbon 14, chlorine 36, and tritium. Advantageously, the delivery to each of the stations occurs in wet form, with water being a common medium for conveying the waste to each of the separation stations.

A method is provided for the decontamination of radioactive carbonaceous material, such as graphite, in which an injection of steam is planned into the material, concurrent with a first roasting thermal treatment of the material at a temperature between 1200° C. and 1500° C. Advantageously, the first treatment may be followed by a second treatment at a lower temperature with an injection of carbon oxide for oxidation according to the Boudouard reaction.

Method of extracting syngas between the zone in a furnace where oxygen-starved combustion of biomass occurs and the zone in the furnace where secondary air is added to complete combustion, conditioning and cleaning the extracted syngas, and delivering it in a metered amount to the oxidizer or upstream of the oxidizer to reduce or eliminate the need for additional fossil fuels once the oxidizer has achieved its operating temperature. The gasifier or furnace burns solid waste and produces a syngas containing relatively high levels of CO, which is extracted from the furnace, conditioned, and introduced into an RTO as a fuel source. In certain embodiments, no extraction of syngas from the furnace takes place; the furnace conditions are manipulated so that normally undesirable levels of CO and other VOC's remain in the process stream. The heat from the furnace is used as intended (e.g., to heat a dryer), the stream is conditioned, and ultimately proceeds to a downstream RTO. Since the gas stream remains rich in CO and VOC's, its fuel value in the RTO is substantially higher than otherwise would be the case.

An exemplary system for treatment and disposal of pharmaceutical waste comprises a sealable pail, a stirring device, a sealable bag, a container, an acidic substance, and a denaturant. The sealable pail receives the pharmaceutical waste and the acidic substance. The acidic substance dissolves the pharmaceutical waste, and the stirring device stirs the acidic substance to ensure that the pharmaceutical waste is completely dissolved. The denaturant is added to the dissolved pharmaceutical waste and renders the dissolved pharmaceutical waste safe for transport. The treated pharmaceutical waste is sealed within the sealable pail, and the sealable bag receives the sealed pail and is sealed. The sealed bag is then placed in the container for transport to a disposal facility.

Containers and methods for disposing unused pharmaceutical product are disclosed. Each container (100, 200, 300) may include a container body (104, 204, 304) with an internal chamber (116, 216, 316) for storing pharmaceutical product, along with a cover (124, 224, 324) for selectively limiting access to the chamber (116, 216, 316). An encapsulation component (128, 228, 328) may be selectively disposable within the chamber (116, 216, 316), and may be operable to encapsulate the pharmaceutical product within the container (100, 200, 300). For instance, the encapsulation component (128, 228, 328) may melt and/or flow into contact with the pharmaceutical product and thereafter solidify to encapsulate the pharmaceutical product. The encapsulation component (128, 228, 328) may melt and thereafter solidify between the cover (124, 224, 324) and shell (104, 204, 304) to limit removal of the cover (124, 224, 324) from the shell (104, 204, 304).

The present invention relates to a subsurface refuse collection system comprising an underground bunker (4), a refuse container (3), a deposit bin (1) and a cover (2) with automatic opening and closing which can be powered electrically using a solar system. The container (3) is collected by means of an automated crane (18) with automatic hitching to facilitate collection. The system is equipped with multiple devices to measure volume and weight of the refuse deposited in the deposit bin (1), for the purpose of system monitoring or improvements to the management of truck routes. It also includes a safety device to prevent accidental fails into the underground bunker during collection.

The present invention aims to provide a surface modification method for a rubber vulcanizate or a thermoplastic elastomer, which can impart excellent sliding properties and excellent durability against repeated sliding motion and can allow the surface to maintain the sealing properties, without using expensive self-lubricating plastics. The present invention relates to a surface modification method for modifying a rubber vulcanizate or a thermoplastic elastomer as an object to be modified, the method including: step 1 of forming polymerization initiation points on the object to be modified; step 2 of radically polymerizing a monomer, starting from the polymerization initiation points, by irradiation with LED light at 300 nm to 400 nm to grow polymer chains on a surface of the object to be modified; and step 3 of esterifying, transesterifying or amidating side chains of the polymer chains.