Bluetooth Scatternet Formation – State of the Art and a New Approach

2004 ◽  
pp. 260-272
Author(s):  
Markus Augel ◽  
Rudi Knorr
Keyword(s):  
State Of The Art ◽  
New Approach ◽  
Bluetooth Scatternet ◽  
Scatternet Formation

A new approach based on graph matching and evolutionary approach for sport scheduling problem

2020 ◽  
pp. 1-16
Author(s):  
Meriem Khelifa ◽  
Dalila Boughaci ◽  
Esma Aïmeur
Keyword(s):  
Graph Matching ◽  
State Of The Art ◽  
Travel Cost ◽  
Round Robin ◽  
New Approach ◽  
Traveling Tournament Problem ◽  
Significant Interest ◽  
National League ◽  
Better Than

The Traveling Tournament Problem (TTP) is concerned with finding a double round-robin tournament schedule that minimizes the total distances traveled by the teams. It has attracted significant interest recently since a favorable TTP schedule can result in significant savings for the league. This paper proposes an original evolutionary algorithm for TTP. We first propose a quick and effective constructive algorithm to construct a Double Round Robin Tournament (DRRT) schedule with low travel cost. We then describe an enhanced genetic algorithm with a new crossover operator to improve the travel cost of the generated schedules. A new heuristic for ordering efficiently the scheduled rounds is also proposed. The latter leads to significant enhancement in the quality of the schedules. The overall method is evaluated on publicly available standard benchmarks and compared with other techniques for TTP and UTTP (Unconstrained Traveling Tournament Problem). The computational experiment shows that the proposed approach could build very good solutions comparable to other state-of-the-art approaches or better than the current best solutions on UTTP. Further, our method provides new valuable solutions to some unsolved UTTP instances and outperforms prior methods for all US National League (NL) instances.

scholarly journals Bin2vec: learning representations of binary executable programs for security tasks

Cybersecurity ◽  
2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Shushan Arakelyan ◽  
Sima Arasteh ◽  
Christophe Hauser ◽  
Erik Kline ◽  
Aram Galstyan
Keyword(s):  
Program Analysis ◽  
State Of The Art ◽  
Classification Error ◽  
New Approach ◽  
Convolutional Networks ◽  
Computational Program ◽  
Functional Algorithm ◽  
Binary Program ◽  
Vulnerability Discovery ◽  
Executable Programs

AbstractTackling binary program analysis problems has traditionally implied manually defining rules and heuristics, a tedious and time consuming task for human analysts. In order to improve automation and scalability, we propose an alternative direction based on distributed representations of binary programs with applicability to a number of downstream tasks. We introduce Bin2vec, a new approach leveraging Graph Convolutional Networks (GCN) along with computational program graphs in order to learn a high dimensional representation of binary executable programs. We demonstrate the versatility of this approach by using our representations to solve two semantically different binary analysis tasks – functional algorithm classification and vulnerability discovery. We compare the proposed approach to our own strong baseline as well as published results, and demonstrate improvement over state-of-the-art methods for both tasks. We evaluated Bin2vec on 49191 binaries for the functional algorithm classification task, and on 30 different CWE-IDs including at least 100 CVE entries each for the vulnerability discovery task. We set a new state-of-the-art result by reducing the classification error by 40% compared to the source-code based inst2vec approach, while working on binary code. For almost every vulnerability class in our dataset, our prediction accuracy is over 80% (and over 90% in multiple classes).

scholarly journals Target Localization via Integrated and Segregated Ranging Based on RSS and TOA Measurements

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 230 ◽  
Author(s):  
Slavisa Tomic ◽  
Marko Beko
Keyword(s):  
State Of The Art ◽  
Hybrid Approach ◽  
Critical Distance ◽  
Heuristic Approach ◽  
Target Localization ◽  
Line Of Sight ◽  
Time Of Arrival ◽  
Individual Measurement ◽  
New Approach ◽  
Non Line Of Sight

This work addresses the problem of target localization in adverse non-line-of-sight (NLOS) environments by using received signal strength (RSS) and time of arrival (TOA) measurements. It is inspired by a recently published work in which authors discuss about a critical distance below and above which employing combined RSS-TOA measurements is inferior to employing RSS-only and TOA-only measurements, respectively. Here, we revise state-of-the-art estimators for the considered target localization problem and study their performance against their counterparts that employ each individual measurement exclusively. It is shown that the hybrid approach is not the best one by default. Thus, we propose a simple heuristic approach to choose the best measurement for each link, and we show that it can enhance the performance of an estimator. The new approach implicitly relies on the concept of the critical distance, but does not assume certain link parameters as given. Our simulations corroborate with findings available in the literature for line-of-sight (LOS) to a certain extent, but they indicate that more work is required for NLOS environments. Moreover, they show that the heuristic approach works well, matching or even improving the performance of the best fixed choice in all considered scenarios.

scholarly journals TripletProt: Deep Representation Learning of Proteins based on Siamese Networks

2020 ◽  
Author(s):  
Esmaeil Nourani ◽  
Ehsaneddin Asgari ◽  
Alice C. McHardy ◽  
Mohammad R.K. Mofrad
Keyword(s):  
Functional Annotation ◽  
Cellular Localization ◽  
State Of The Art ◽  
Language Model ◽  
Representation Learning ◽  
Learning Problems ◽  
Ppi Network ◽  
New Approach ◽  
Protein Protein Interaction ◽  
Siamese Networks

AbstractWe introduce TripletProt, a new approach for protein representation learning based on the Siamese neural networks. We evaluate TripletProt comprehensively in protein functional annotation tasks including sub-cellular localization (14 categories) and gene ontology prediction (more than 2000 classes), which are both challenging multi-class multi-label classification machine learning problems. We compare the performance of TripletProt with the state-of-the-art approaches including recurrent language model-based approach (i.e., UniRep), as well as protein-protein interaction (PPI) network and sequence-based method (i.e., DeepGO). Our TripletProt showed an overall improvement of F1 score in the above mentioned comprehensive functional annotation tasks, solely relying on the PPI network. TripletProt and in general Siamese Network offer great potentials for the protein informatics tasks and can be widely applied to similar tasks.

scholarly journals Graph Algorithms for Word Sense Disambiguation in Biomedicine

2015 ◽  
Author(s):  
Rodrigo Goulart ◽  
Juliano De Carvalho ◽  
Vera De Lima
Keyword(s):  
Text Mining ◽  
Graph Algorithms ◽  
State Of The Art ◽  
Word Sense Disambiguation ◽  
The State ◽  
Word Sense ◽  
New Approach ◽  
Similar Performance ◽  
Sense Disambiguation ◽  
Different Levels

Word Sense Disambiguation (WSD) is an important task for Biomedicine text-mining. Supervised WSD methods have the best results but they are complex and their cost for testing is too high. This work presents an experiment on WSD using graph-based approaches (unsupervised methods). Three algorithms were tested and compared to the state of the art. Results indicate that similar performance could be reached with different levels of complexity, what may point to a new approach to this problem.

Cube Connected Cycles Based Bluetooth Scatternet Formation

2005 ◽  
pp. 413-420 ◽  
Author(s):  
Marcin Bienkowski ◽  
André Brinkmann ◽  
Miroslaw Korzeniowski ◽  
Orhan Orhan
Keyword(s):  
Bluetooth Scatternet ◽  
Scatternet Formation ◽  
Cube Connected Cycles

scholarly journals Partial Compilation of ASP Programs

2019 ◽  
Vol 19 (5-6) ◽  
pp. 857-873 ◽  
Author(s):  
BERNARDO CUTERI ◽  
CARMINE DODARO ◽  
FRANCESCO RICCA ◽  
PETER SCHÜLLER
Keyword(s):  
Experimental Analysis ◽  
Ad Hoc ◽  
Blow Up ◽  
State Of The Art ◽  
Answer Set Programming ◽  
General Purpose ◽  
Combinatorial Problems ◽  
New Approach ◽  
Input Program ◽  
Evaluation Algorithm

AbstractAnswer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on the traditional ground&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program. In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i.e., we obtain a specific binary for a given program), and might not be subject to the grounding step. To this end, we identify a condition that allows the compilation of a sub-program, and present the related partial compilation technique. Importantly, we have implemented the new approach on top of a well-known ASP solver and conducted an experimental analysis on publicly-available benchmarks. Results show that our compilation-based approach improves on the state of the art in various scenarios, including cases in which the input program is stratified or the grounding blow-up makes the evaluation unpractical with traditional ASP systems.

Sign in / Sign up

Export Citation Format

Share Document