Results 31 to 40 of about 7,699,135 (213)
Many-to-Many Information Flow Policies [PDF]
Information flow techniques typically classify information according to suitable security levels and enforce policies that are based on binary relations between individual levels, e.g., stating that information is allowed to flow from one level to another.
Baldan, Paolo +2 more
openaire +2 more sources
Stable Many-to-Many Matchings with Contracts [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klaus, Bettina, Walzl, Markus
openaire +6 more sources
A Novel Approach to Many-to-Many User Authentication in Different Information Systems
In this paper, we propose a novel approach to many-to-many user authentication in heterogeneous information systems. The described solution is based on the use of wireless keys – special devices that identify the user by transmitting the requested key ...
Vitaly Petrov +2 more
doaj +3 more sources
Insulators: many functions, many mechanisms [PDF]
Eukaryotic genomes are organized into domains containing individual genes and gene clusters that have distinct patterns of expression both during development and in differentiated cells. These genomes contain regulatory elements such as enhancers that are able to activate target genes in cis over considerable distances.
Adam G, West +2 more
openaire +2 more sources
Millimeter-wave (mmWave) communication is considered a promising technology for fifth-generation (5G) wireless communications systems since it can greatly improve system throughput.
Zhiwei Si +5 more
doaj +1 more source
Many-to-many information flow policies [PDF]
Abstract Information flow techniques typically classify information according to suitable security levels and enforce policies that are based on binary relations between individual levels, e.g., stating that information is allowed to flow from one level to another.
Paolo Baldan, Alberto Lluch-Lafuente
openaire +3 more sources
Popular critical matchings in the many-to-many setting
We consider the many-to-many bipartite matching problem in the presence of two-sided preferences and two-sided lower quotas. The input to our problem is a bipartite graph G=(A U B, E), where each vertex in A U B specifies a strict preference ordering over its neighbors.
Meghana Nasre +3 more
openaire +3 more sources
Introduction: Mentoring has become an important educational strategy in medical training. Peer mentoring (PM) can enhance student experience and support transition to higher education. This article documents the implementation of an online peer mentoring
Drossard, Sabine, Härtl, Anja
doaj +1 more source
Secure Many-to-One Communications in Wireless Sensor Networks
Wireless Sensor Networks (WSN) are formed by nodes with limited computational and power resources. WSNs are finding an increasing number of applications, both civilian and military, most of which require security for the sensed data being collected by ...
Jordi Castellà-Roca +3 more
doaj +1 more source
Perfect Matchings and Popularity in the Many-to-Many Setting
We consider a matching problem in a bipartite graph $G$ where every vertex has a capacity and a strict preference order on its neighbors. Furthermore, there is a cost function on the edge set. We assume $G$ admits a perfect matching, i.e., one that fully matches all vertices.
Kavitha, Telikepalli, Makino, Kazuhisa
openaire +4 more sources

