Search results for "Ph D"

showing 10 items of 71 documents

Estimation des performances, test et contrôle des systèmes cyber-physiques employant des réseaux de communication non idéaux

2020

Wireless technology is a key enabler of the promises of Industry 4.0 (Smart Manufacturing). As such, wireless technology will be adopted as a principal mode of communication within the factory beginning with the factory enterprise and eventually being adopted for use within the factory workcell. Factory workcell communication has particular requirements on latency, reliability, scale, and security that must first be met by the wireless communication technology used. Wireless is considered a non-ideal form of communication in that when compared to its wired counterparts, it is considered less reliable (lossy) and less secure. These possible impairments lead to delay and loss of data in indus…

Fabrication intelligenteIndustrial wireless testbed[INFO.INFO-TS] Computer Science [cs]/Signal and Image ProcessingSmart manufacturingApprentissage automatiqueSystems modelingGraph databaseBase de données graphe[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingMachine learningIndustrial wirelessModelisation systémeCommunications sans fil industrielBanc d'essai sans fil industriel
researchProduct

A Graph Database Approach to Wireless IIoT Workcell Performance Evaluation

2020

The workcell is considered a main building block of various industrial settings. Hence, it is examined as a primary testing environment for studying wireless communication techniques in factory automation processes. A new testbed was recently designed and developed to facilitate such studies in workcells by replicating various data flows in an emulated production environment. In this paper, an approach to storing and analyzing network performance data from a manufacturing factory workcell is introduced. A robotic testbed was constructed using two collaborative grade robot arms, machine emulators, and wireless communication devices. A graph database approach was implemented to capture networ…

Graph databaseDistributed databaseComputer scienceDistributed computingTestbedNetwork delay020206 networking & telecommunications02 engineering and technologyQuery languagecomputer.software_genre0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)020201 artificial intelligence & image processingNetwork performanceWorkcellcomputer2020 IEEE International Conference on Industrial Technology (ICIT)
researchProduct

Curved Edge Routing

2001

We consider the problem of drawing a graph where edges are represented by smooth curves between the associated nodes. Previously curved edges were drawn as splines defined by carefully calculated control points. We present a completely different approach where finding an edge is reduced to solving a differential equation. This approach allows to represent the graph drawing aesthetics directly, even the most complex ones denoting the dependencies among the paths.

Graph drawingComputer scienceDifferential equationControl pointMultigraphMultiple edgesForce-directed graph drawingTopological graphCurvatureTopologyGraphMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Arc crossing minimization in graphs with GRASP

2001

Graphs are commonly used to represent information in many fields of science and engineering. Automatic drawing tools generate comprehensible graphs from data, taking into account a variety of properties, enabling users to see important relationships in the data. The goal of limiting the number of arc crossings is a well-admitted criterion for a good drawing. In this paper, we present a Greedy Randomized Adaptive Search Procedure (GRASP) for the problem of minimizing arc crossings in graphs. Computational experiments with 200 graphs with up to 350 vertices are presented to assess the merit of the method. We show that simple heuristics are very fast but result in inferior solutions, while hig…

Greedy coloringTheoretical computer scienceComputer scienceSimple (abstract algebra)Graph drawingGRASPMinificationSoftware systemHeuristicsIndustrial and Manufacturing EngineeringGreedy randomized adaptive search procedureIIE Transactions
researchProduct

Wechselwirkungen zwischen Acetylsalicylsäure und Lysin in Lösung

1985

Der pH-abhangige Einflus von Lysin auf die Hydrolyse von Acetylsalicylsaure zu Salicylsaure und auf die Bildung von Lysinderivaten der Acetylsalicylsaure wurde durch HPLC-Untersuchungen geklart. Die Bildung von e-N-Acetyl-lysin, α-N-Acetyl-lysin und wenig Diacetyl-lysin erfolgt rasch bei pH-Werten der Losung von 6 und hoher, sehr langsam jedoch bei dem fur gebrauchliche Injektionslosungen eingestellten pH-Wert 5. Das Auftreten des postulierten Salicyloyllysins in Acetylsalicylsaure-Lysin-Losungen wurde durch Vergleich mit der unabhangig synthetisierten Verbindung ausgeschlossen. Interactions of Acetylsalicyclic Acid and Lysine in Solution The influence of lysine on the hydrolysis, and on th…

HydrolysisAcetylsalicyclic acidStereochemistryChemistryDrug DiscoveryLysinePharmaceutical SciencePh dependentHigh-performance liquid chromatographyArchiv der Pharmazie
researchProduct

Age-related changes of NADPH-diaphorase-positive neurons in the rat inferior colliculus and auditory cortex

2007

Nitric oxide (NO) has been implied in age-related changes of the central nervous system (CNS) and the central auditory pathway. The present study was conducted to investigate whether the number of NO-producing cells and their morphometric characteristics in the inferior colliculus (IC) and the auditory cortex (AC) are changed with the increasing age of the subjects. IC and AC sections of adult and senile Wistar rats were studied using the histochemical detection of NADPH-diaphorase activity (NADPH-d), a marker for neurons containing nitric oxide synthase (NOS). Our results showed a decreased area of the somas of NADPH-d-positive neurons in the dorsal cortex (DC) of the IC and a diffuse loss…

Inferior colliculusAgingAuditory PathwaysHistologyAuditory areaCentral nervous systemBiologyNADPH diaphoraseNitric OxideAuditory cortexNitric oxidechemistry.chemical_compoundmedicineAnimalsRats WistarInstrumentationAuditory CortexNeuronsNADPH DehydrogenaseRatsNitric oxide synthaseMedical Laboratory Technologymedicine.anatomical_structurechemistryAgeingbiology.proteinAnatomyNeuroscienceMicroscopy Research and Technique
researchProduct

A tabu search algorithm for the bipartite drawing problem

1998

Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present a Tabu Search (TS) scheme for the BDP. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics…

Information Systems and ManagementGeneral Computer ScienceManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringGraphTabu searchGraph drawingModeling and SimulationBipartite graphMinificationForce-directed graph drawingHeuristicsAlgorithmMathematicsEuropean Journal of Operational Research
researchProduct

Variable Neighborhood Search for the Vertex Separation Problem

2012

The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI, computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for speci c types of graphs. However, in spite of their practical applications, these…

InformáticaMathematical optimizationOptimization problemGeneral Computer Sciencebusiness.industryVariable Neigborhood SearchVertex coverMetaheuristicsManagement Science and Operations Research5207.10 Estadísticas de PoblacionesLayout ProblemsGraph drawingModeling and Simulation52 DemografíaCombinatorial OptimizationCombinatorial optimizationEstadística y DemografíaFeedback vertex setLocal search (optimization)1203.17 InformáticabusinessMetaheuristicVariable neighborhood searchMathematics
researchProduct

IMFLer: A Web Application for Interactive Metabolic Flux Analysis and Visualization.

2021

Increasing genome-wide data in biological sciences and medicine has contributed to the development of a variety of visualization tools. Several automatic, semiautomatic, and manual visualization tools have already been developed. Some even have integrated flux balance analysis (FBA), but in most cases, it depends on separately installed third party software that is proprietary and does not allow customization of its functionality and has many restrictions for easy data distribution and analysis. In this study, we present an interactive metabolic flux analyzer and visualizer (IMFLer)-a static single-page web application that enables the reading and management of metabolic model layout maps, …

Interface (Java)Computer sciencebusiness.industryComputational BiologyWeb BrowserFile formatModels BiologicalMetabolic Flux AnalysisFlux balance analysisVisualizationPersonalizationComputational MathematicsUser-Computer InterfaceSoftwareComputational Theory and MathematicsGraph drawingModeling and SimulationGeneticsWeb applicationbusinessSoftware engineeringMolecular BiologyAlgorithmsSoftwareJournal of computational biology : a journal of computational molecular cell biology
researchProduct

RDF* Graph Database as Interlingua for the TextWorld Challenge

2019

This paper briefly describes the top-scoring submission to the First TextWorld Problems: A Reinforcement and Language Learning Challenge. To alleviate the partial observability problem, characteristic to the TextWorld games, we split the Agent into two independent components: Observer and Actor, communicating only via the Interlingua of the RDF* graph database. The RDF* graph database serves as the “world model” memory incrementally updated by the Observer via FrameNet informed Natural Language Understanding techniques and is used by the Actor for the efficient exploration and planning of the game Action sequences. We find that the deep-learning approach works best for the Observer componen…

InterlinguaInformation retrievalGraph databaseComputer scienceBacktrackingbusiness.industryDeep learningNatural language understandingcomputer.file_formatcomputer.software_genrelanguage.human_languagelanguageReinforcement learningArtificial intelligenceRDFFrameNetbusinesscomputer2019 IEEE Conference on Games (CoG)
researchProduct