Questions related to Network
I'm curious can it be possible to study ego-networks of a person/organization/bank/city etc. via using ERGM and SAOM? Which one is better for making a research? Can you recomend some papers on it?
Dear fellow language educators, linguistic researchers, computational intelligence scientists and any interested peers:
I would like to introduce you to the International Council of Academics for Progressive Education (I.C.A.P.E.). We are a global initiative engaging in research, publishments and connection with proactive dialogue and discussion among interested peers, in order to improve language education in secondary and higher education, challenge archaic curricula and learning models, and identify, communicate and eventually implement necessary changes, novel approaches and brilliant ideas in educational science, with a special focus on language education and its intersections with other related research fields, such as the integration of A.I. in curriculum development.
We are happy to welcome you on board, publish your ideas, get you in contact with interested language schools, researchers and scientists around ther globe. We maintain close relationships with journals, university faculties, research projects and much else.
For more information, please visit www.icape-edu.com. Self-evidently, there is no spam, no fee structure, and all of our endeavors are not-for-profit. Our only mission is contributing to better education and accelerating the implementation of changes.
I am working on a metabarcoding dataset and I want to run SpiecEasi for network. Given that I have a large dataset I tried to use only the 50 first records using the following: filter_taxa(myphyloseqobject, function (x) sum (x) > 50, TRUE)
I am interested in identifying the interactions of my clusters at the genus level so I chose this taxonomic level to color my nodes. However, all I get is many nodes that could not be interpretable. Any ideas on how I can exploit this dataset using networks ?
This question arises out of the essay
Preprint Collective consciousness first
That essay observes thatlanguage is invented and improved by society collectively. The collection of ideas thus enabled creates a collective consciousness. Individuals then can acquire individual consciousness by acquiring language and ideas from the collective consciousness.
The essay further observes that collective appraisal is more indicative of collective problem solving than is invention that adds to a society’s lexicon and store of ideas.
Perhaps networking that enables collective problem solving is not just a means of collective problem solving but is necessary for consciousness itself. Perhaps appraisal of new words and ideas proposed by an individual or specialized group can enable the development of collective consciousness only if the words are repeatedly and continuously tested by the entire network. In other words, does deciding whether a new idea is added to the network’s collective information resources require appraisal by the rest of the network acing as an audience for consciousness to emerge?
And if networking combined collective appraisal leads to collective consciousness for human societies, should we be wary of networking computers?
for a paper I am preparing a plot that links source, method of preparation, and application in a circle-like structure. To discuss it here, I prepared a sketch that should be easier to follow without prior knowledge of my specific field of research (see attached Graphic).
The three circle segments represent vegetables, things you can make from them, and places, where this food might be offered. Lines then connect Veggies, preparations, and types of restaurant, that typically go together.
Examples: Sweet potato chips and potato chips are a thing, hence a connecting line (Zucchini chips and pumkin chips not so much). Vodka is made from potatos, but not sweet potatoes, pumpkin, or Zucchini, and it is served in Pubs, and maybe fine dining restaurants, but rather not in Italian restaurants or Fast-food parlors.
Things I like about this plot-type are:
-I find it aesthetically pleasing.
-You can pretty easily identify niche and common entities from the number of lines originating there (like potatoes and soup going with kinda everything, and Zucchini and Vodka being rather picky).
-Following the lines from one entity, you get to all associated entities, making it quite easy to reference neighbors in the network.
-Unlike in a network graph, entities are not spread about the whole network, but neatly organized on the outside for reference and added text.
-Entities are easy to group into categories. More or less categories, than the three in the example would be possible.
In the example, the categories are all underlaid by a primary color (yellow, blue, red) and each line has the secondary color (orange, green, purple) of the categories it connects, to make it easier to follow the lines. However, the information density could be increased further by formatting the color and strength / thickness of lines. For example, you could code a probability or strength of association by a line color or by line thickness, like: How probable is it to find vodka at a fine dining restaurant; coded as color of the connecting line on a red-blue gradient like in a heat-map, or by line strength.
My questions are:
-Is this plot a new thing, or is there a plot type, that's basically the same, that I just don't know about.
-Does it make sense to display information in this way, or is there a more approachable or more aesthetically pleasing way of conferring the same information?
-What to call this kind of plot? My initial thought was cobweb plot, but that's already a thing. I then thought dreamcatcher, doily, or weaving-frame diagram, which don't seem to be taken already. The design is visually inspired by a circos plot, but otherwise doesn't share a lot of similarities. I am hence a bit hesitant, to call it "narrative circos plot" or "Network circos plot".
If you want to use this kind of plot, I'd be super happy to see your work! Would be cool, if you'd reference or link this post.
Also shout-out to Biorender, where I threw this plot together. However, I am sure, you can also make a plot like this with less manual moving of lines and icons, if you know your R (or GIMP or Inkscape for that matter).
PS: Please spare me your comments, that it actually is possible to make Vodka from Zucchini ;-D it's about the graph style, not the specifics for this one. The example graph is not super polished, but you get the picture. Also I think it's clear, that I am not researching the culinary scene, but I found that an easy and accessible example.
What networking platforms have you found to be particularly effective for connecting with fellow scientists and researchers?
I have written a 2-Stage DEA code,but the result is quite weird. The efficiency of 1st ,2nd and the entire contain only 1 and 0. Have anyone experienced this? the amount of DMU is 267.
Dear RG community
I am writing the final paper of my Ph.D. thesis.
My final contributions are related to each other; I wanted to express both of these contributions in one article. Still, the number of pages increased significantly, so I want to publish the article in two parts. The first part and the second part, do you think this is possible?
I wanted to know what the protocol for a two parts article is.
I would be happy if you could explain how to write an article in two separate parts.
I have a very generic question, more prone to be a discussion. As you know, the number of papers devoted to modular networks (networks with communities or partitioned networks) is increasing. The majority of research is about detection of communities. My curiosity is the following: There are papers dealing with the problem of ranking nodes across communities. For instance, a generic ranking can be obtained as an aggregate form of rankings locally obtained within each community (using some centrality measures). When you aggregate rankings obtained within different communities, you can use for instance "primus inter pares" style. For instance, you can compare nodes in different communities only if they have earned the same rank in their different communities. This is a simple idea and, for sure, not the unique idea. I have been searching for papers dealing with those types of conceptualisation or applications on modular networks but I haven't found very much on this issue. For instance, Something similar is done when they compare teams in different European football leagues (communities) since they have to form "qualification groups" for the final part of the Champions league (across communities). But they use scores obtained within the specific football league. Thanks very much for your attention.
I am working to improve my IoT Platform. Everything is done and I can use the Raspberry Pi module to test my platform. On the Raspberry Pi, I run the gRPC/REST API microservices to send and receive messages through the IoT platform.
Then I would like to simulate multiple devices concurrently connecting to my IoT Platform for review
1. IoT Platform load capacity
2. Communication delay
3. Power consumption on device
Please suggest me an opensouce or some other method to implement this.
I am currently dealing with some transcriptomic data and building protein-protein interaction (PPI) networks. After filtering my data by fold-change and p-value, I got quite a lot disconnected nodes in my PPI network. So I would like to expand my current network through a whole-genome network (as a template) in order to connect the maximum number of single nodes. The main assumption is that not all proteins being at play in a biologic response will show a change in their transcript level, and that up-regulated proteins may interact with partners (yet present, and unmodified during the biological response). My goal, thus, is to connect the maximum amount of query nodes with the minimum amount of newly added nodes.
The STRING database has an option of "adding more nodes to the current network", but it usually enriches current clusters rather than connecting single nodes (or at least it seems to me). However I don't know what strategy does STRING follow to choose nodes to be added. So, what would be the best network expansion strategy to connect single nodes?
Thanks in advanced!
Would you have an idea on how to model stable regular networks in a phase field model ?
For instance a square network like in the joined picture (the picture was made artificially) ? I know that the Swift-Hohenberg equation allows to create some regularity but I would like to control more the size of the network and the distance between the branches, and maybe the type of network.
Thank you in advance :)
Let's assume there is a call on going, such as a video meeting on any video calling app. For the time being could we identify the connection and make the connection better so as to increase the quality and experience of the connection.
I'm comparing 3 treatment arms with each others. Usually, I use RevMan for comparing 2 groups. But I can't use it for network meta-analysis. What is the best alternative?
If you choose a research topic, Intelligent Reflective Surfaces (IRS) in Wireless Communications
Is it a good topic to prepare scientific research on it within communications systems engineering?
What are your suggestions?
How do I start?
What are the negatives?
What are the pros?
Are there any of you who would like to work together to conduct scientific research on this topic?
Thank you so much
What kind of relationship can be found between the governance of processes of migrants´ integration and local/regional governance of shrinking towns? Can migration and shrinking areas (regions) be a "happy couple"? What is the role of governance in for integrating migrants in shrinking areas in Europe? What mode of governance suits better? What are your thoughts and state-of-the-art litterature to tackle these questions?
In your opinion, governance is a solid theoretical framework that stands by itself?
I want to use a package in R called "miRNAtap" to create a network of predicted targets for a given set of miRNA . I have gone through the documentation and the examples given are only for a single miRNA input. However I want to give a list of miRNA as input to get the predicted target list for the given set of miRNA.
The Document also gives a workflow for using a gene ontology annotations package topGo. However I want to use the output from miRNAtap for creating a network using any of the R packages sna, network or ggnetwork. Any leads on the queries is very much appreciated. I have also attached the documentation of the package.
There are endless threads on almost any matter. Those threads have proven to be useful to other people. I would like to collect those threads and set them here. Anyone is welcome to set their own threads. At the moment, I see courses, publishing matters, errors or bugs, offers, advice or the hows pages. Of course, if there is anything you want to say, welcome.
Two very recent papers that illustrate the potential of OWC to support Tb/s communications:
1) A Tb/s Indoor Optical Wireless Access System Using VCSEL Arrays
2) A Tb/s Indoor Optical Wireless Backhaul System Using VCSEL Arrays
I have a network where I have used different aggregation methods for its nodes. Now I want to see if these aggregation methods changed their ranking of importance and their importance value. At first I was thinking to use the Kendall's tau. However, this doesn't cope well with ties. Then I was thinking to use inter-rater reliability measure. However, this seem to be designed to take into consideration possible errors in the ranker, which don't really happen with my algorithm. Is there any other type of statistics I could look into?
Does any one have tutorial(Best learning forum website etc) about NS3?
and one more thing when installing NS3 which is the best one .tarball or bake?
The future of blockchain-based internet solutions
Blockchain is defined as a decentralized and distributed database in the open source model in a peer-to-peer internet network without central computers and without a centralized data storage space, used to record individual transactions, payments or journal entries encoded using cryptographic algorithms.
In current applications, blockchain is usually a decentralized and dispersed register of financial transactions. It is also a decentralized transaction platform in a distributed network infrastructure. In this formula, blockchain is currently implemented into financial institutions.
Some banks are already trying to use blockchain in their operations. if they did not do it, other economic entities, including fintechs, implementing blockchain could become more competitive in this respect. However, cryptocurrencies and a secure record of transactions are not the only blockchain applications. Various potential blockchain applications are being considered in the future.
Perhaps these new, different applications already exist in specific companies, corporations, public institutions or research centers in individual countries. In view of the above, the current question is: In what applications, besides cryptocurrency, blockchain in your company, organization, country, etc.?
I invite you to the discussion
Thank you very much
I need to find TTL from Python and I found several codes but I don't know why TTL output in python different than TTL when I used ping www.google.com?
for example in python TTL = 45 or 226 ...but in command line terminal ping www.google.com TTL =118.
Do you know any python code that I obtain TTL which is matched with TTL in the command line?
`Since I am new in the field of internet security, I need your suggestion regarding the meaning of the following features.
We have DNS google.com or youtube.com, and so on, and I want to extract different features based on Lexical and Web Scrapped.
what is the meaning of the following features? Please write with an example.
1) different ratios (different ratios (number to length, alphabet to length) ?
3) distance between a number to an alphabet? (You can find the meaning of these features in the paper Feature Extraction Approach to Unearth Domain Generating Algorithms (DGAs) - Page 401)
4) English domain name, not English yet pronounceable domain names, uni-gram?
we extract information of the queried domain name from the web using Python (You can find the meaning of these features in the paper Feature Extraction Approach to Unearth Domain Generating Algorithms (DGAs) - Page 403)).
1) Levenshtein distance (sq1,se2), what is seq2?
2) Typosquat process?
We are currently developing software to enable scientists and researcher to work together on new discoveries and current research. We have not found anything dedicated to the scientific field and was wondering what kind of features would you need?
Some researchers have told me that it is usually a mixture of what is used in enterprise collaboration (MS Teams, Dropbox, etc.), is this the case, and would you like some more specific capabilities?
I need to model a construction and demolition waste management network in order to maximize waste recycling. I read some works that use MILP. Among the software used are GAMS, JULIA, MATLAB and R. Are there other software that can be used?
See for example, Statistical mechanics of networks, Physical Review E 70, 066117 (2004).
The architecture and topology of networks seem analogous to graphs.
Perhaps though the significant aspect of networks is not their architecture but their thermodynamics, how energy is distributed via networks.
Perhaps networks linkages are only means for optimizing energy distributions. If so, then network entropy (C log(n)) might be more fundamental (and much simpler to use) than the means by which network entropy is maximized. If that were so, then the network analogy to graphs might lead to a sub-optimal conceptual reference frame.
Dimensional capacity is arguably a better conceptual reference frame.
Where can I find known malicious IP address Lists ?
They may be DDoS attack sources, or sources that induce malware, any kind of intrusions or any other malicious behavior.
Any pointers would be highly appreciated.
I am working with extinction models in interaction networks using the bipartite R-package.
I can determine the order in which species will be removed based on abundance and degree or random.
abundance <- second.extinct(Safariland, participant = "lower", method = "abundance", nrep = 10,
details = FALSE, ext.row=NULL, ext.col=NULL)
However, I need and am not able to elaborate a vector to determine a different extinction sequence, using the ‘external’ method.
I would like to connect 2 Ryu controllers (C1,C2) to one switch with two different table-miss. When a certain match takes place the switch sends to C1, and for different match, the switch sends to another controller.
When I run 2 controllers, the switch has only one entry as follow :
cookie=0x0, duration=30.805s, table=0, n_packets=538, n_bytes=37602, priority=0 actions=CONTROLLER:65535.
is there any way to add 2 defferent entries for two different controller , for instance:
cookie=0x0, duration=12s, table=0, n_packets=2, n_bytes=500, priority=10 actions=CONTROLLER:66556 +++++++++++ cookie=0x0, duration=18.371s, table=0, n_packets=87, n_bytes=7500, priority=0 actions
Thanks in advance.
I need dataset (training set) or network traffic for DoS /DDoS attack detection on a base of neural networks. Are there such bases? Does anybody know?Thanks
Bruce M. Boghosian in the November 2019 issue of Scientific American (p. 73) writes about wealth distribution. Using math and physics, it seems that a slight perturbation to a symmetric or isotropic starting point can result in inequality. Slight inequality results in increasing inequality (anisotropy) over time. These issues are also canvassed in the Growth of Oligarchy in a Yard-Sale Model of Asset Exchange by Bruce M. Boghosian, Adrian Devitt-Lee, and Hongyan Wang, arxiv 2016 and in The Affine Wealth Model by Jie Li, Bruce M. Boghosian, and Chengli Lion, arxiv 2018.
Ehud Meron in Physics Today November 2019 issue writes about Vegetation Pattern Formation (p. 31). While water distribution for a given topography may initially be isotropic, vegetation can distribute in anisotropic patterns.
Are these two instances of initial isotropic distribution leading to anisotropic patterns connected by the same physics? If so, what is the physics?
I have already found some reference authors who model some parts of the system, for example, sensor, transceivers, link, propagation space, the network itself and, sometimes, putting it all together, but they are somewhat limited because they do not constitute a global model confronted with reality.
There is a lack of information. Today's models are useful for their purposes, but I'd like to know more about real-world cases, such as smartwatches that communicate with our mobile phone apps and a complete AI network set up to manage our daily lives. Is there any academic model for this?
I am putting this here to perhaps start a debate, trying to understand how technology can help our quality of life. And how the models, more precisely the energy efficiency ones, were modeled and how they are put into practice. Or today we live in an ad hoc scenario, where things become useful and overcome each other by trade advantages and convenience only.
Authors have different views about the range of gamma, like between 2-3. What is your opinion and experience?
Recently, I'm starting a research project about "crowdsourcing" and I've two questions about the nature of crowdsourcing.
1. Is it possible to illustrate crowdsourcing as a graph? I mean is it true to consider crowdsourcing members as network nodes which are interrelated?
2. Is it possible to monitor the activities of these members (nodes)? I mean is it true to monitor a crowdsourcing process as a project control problem and also do some time studies about these nodes?
This forum has been created to provide a scientific environment in Researchgate for all of those who are interested in doing research on the context of RPL in Internet of Things (IoT) networks. Through this forum, the members could discuss about their previous RPL related studies and introduce them to others, and also to share their latest discoveries, papers, and probable ideas and more importantly to provide their experience to the newly students who want to spend time on studying the existing challenges in RPL. The students who have decided to work on this topic can join this forum and ask their questions and also to get others' opinion on their current work. There exist different types of challenges for publishing a paper from getting the raw idea, and its implementation via off-the-shelf simulation tools, to submitting the final manuscript. Here in this forum, the members will try to solve these challenges as much as possible and also try to answer the questions and help each other to enhance the observability of the existing studies. Further more, members can inform others about the up coming conferences, events, and journal special issues to further provide a comfort zone for those who are attracted to this field of study.
I hope this forum will make the research on this field more interesting and easily.
I was recently searching for an indoorGML converter but I could not find any good resources!
As seen in the attached file, I developed a MATLAB function generating connectivity based on the Delaunay Triangulation. It converts the generated network into indoorGML format.
I am putting it public as it is hard to find a good resource!
You can use WebGL IndoorGML Viewer to view the network.
As can be seen in the attached documents, I developed java converter as well. Here is the initial work.
There are four classes including Main class, Points, Edges and Featuresid.
You need to have points and edges to convert them into IndoorGML format.
I put it in wordpad format as it can be easily read.
Any related information?
NOTE This topic/question is purely mathematical, but potentially with some interesting relevance to multi-agent systems in the AI sense.
Suppose, for example, I want a network that once started will run indefinitely, always visiting all of its states before repetition. What is (1) a sufficient condition and (2) a necessary condition for this property?
NOTE For the precise definition of a Finite State Automaton (aka Finite State Machine) see any relevant textbook or the Wikipedia article.
Since 2013, the interest in multilayer networks has been growing quickly. Some studies proposed new algorithms to calculate modularity and detect modules in multilayer networks of different kinds, considering their original structure (intralayer and interlayer links). However, do you know if some of those algorithms have been implemented in R packages? Or stand-alone software? Thank you!
I have lat and long information for 234 locations and I have a shapefile of the route network.
I am trying to obtain shortest path from each location to all other locations.
For instance ; for location 1, I would like to find shortest path from location 1 to 2, location 1 to 3, location 1 to 4 ....... location 1 to 234. I want to apply this for each locations.
I tried to do this in ArcMap with OD cost matrix but the output was a straight line .
I would like to obtain routes like I obtain by using "new route analysis".
Is there a way to obtain routes instead of straight line in ArcMap, or by using Python ?
Can I do this with Model Builder in ArcMap by using iteration ?
I am using HNOCS omnet++. I made basic connection changes in topology and I am getting this error
<!> Error in module (cCompoundModule) Mesh (id=1) during network setup: No submodule `router' to be connected, at G:\software\hnoc\hnocs.release\hnocs.01_02_13\src\ topologies\Mesh.ned:93.
Can anyone explain what does this error mean and how to remove it?
Thanks in advance
As we know that, throughput is amount of transferred data for a specific time. I want to fix data size and make time variable. The definition will be "The amount of time required to transfer a specific amount of data". What is the term for this?
Thanks in advance.
I have 10 nodes in my network. I calculated the size of the largest component in my network, using the below formula:
Size of the largest component (when node 1 is deleted) = Number of nodes in the largest component, after node 1 is deleted/ Number of nodes in the largest component
Size of largest component, node 1 is deleted = 0.53
Size of largest component, node 2 is deleted = 0.85
Size of largest component, node 3 is deleted = 0.88
Size of largest component, node 4 is deleted = 0.94
Size of largest component, node 5 is deleted = 0.94
Size of largest component, node 6 is deleted = 0.94
Size of largest component, node 7 is deleted = 0.94
When I want to calculate robustness, do I have to average of all the above values?
I'm currently conducting a 16S microbiome analysis on 18 mice that were sampled at five time points. They were divided into three groups of six and given either a MOG+CFA emulsion, only CFA, or were left untreated. There was a single time point for each mouse taken before treatment administration.
The idea was floated by my PI that I should lump all observations across treatments into a single pre-treatment group and that when I do any statistical testing, differential abundance analysis, etc. where the treatment group is taken into account that for time=0, ALL mice are included in this group and considered either "CFA" "CTRL" or "MOG".
My question is if this is even a statistically sound decision? I've been given the argument that since the mice are all pre-treatment that they can be considered equivalent. But since we are doing a time series analysis, I feel like adding all mice into each treatment group would add an additional source of variation to anything I do. Subsequent time points depend on the corresponding time points from the previous individual and we could be introducing cohort specific effects with this in anything we do. Are there any takes on this approach?
Actually, I spent more than 3 months trying to reach the members of
ANAGAM - Asociación Nacional de Gamification & Marketing Digital from Spain and there were no answer... Do you know any other network around the world where I might be in contact with experts from gamification?
The University I'm lecturing have created the first Game Laboratory of Ecuador. Yes, we are the pioneers on this matter. http://gamelab.ups.edu.ec/
We are looking forward to learning from other experiences. So, our iniciative is creating a free, open access network for gamelabs, to share experiences, invite academics and create projects together.
Is there any network we can join?
I'm wondering if there is a clear method that can be used to create the bipartite network to connect the samples with OTUs/taxa. As I searched the internet, all of the tutorials are talking about how to plot it but not how to calculate or how to get the associations between samples and taxa. Also, the papers that used bipartite network are unclear about the methods either. Although the qiime have the function to get the nodes and edges for bipartite (http://qiime.org/scripts/make_bipartite_network.html), it is unclear how qiime does the analysis. So what is the method/algorithm behind this?
Hi. I appreciate any information (ideas, models, algorithms, references, etc.) you can provide to handle the following special problem or the more general problem mentioned in the title.
Consider a directed network G including a source s, a terminal t, and two paths (from s to t) with a common link e^c. Each Link has a capacity c_e and a transit time t_e. This transit time depends on the amount of flow f_e (inflow, load, or outflow) traversing e, that is, t_e = g_e(f_e), where the function g_e determines the relation between t_e and f_e. Moreover, g_e is a positive, non-decreasing function. Hence, how much we have a greater amount of flow in a link, the transit time for this flow will be longer (thus, the speed of the flow will be lower). Notice that, since links may have different capacities, thus, they could have dissimilar functions g_e.
The question is that:
How could we send D units of flow from s to t through these paths in the quickest time?
Notice: A few works have done [D. K. Merchant, et al.; M. Carey; J. E. Aronson; H. S. Mahmassani, et al.; W. B. Powell, et al.; B. Ran, et al.; E Köhler, et al.] relevant to dynamic networks with flow-dependent transit times. Among them, the works done by E Köhler, et al. are more appealing (at least for me) as they introduce models and algorithms based on the network flow theory. Although they have presented good models and algorithms ((2+epsilon)-approximate algorithms) for associated problems, I am looking for better results.
I want to measure polymer solvent interaction parameter for a cross-linked network. Could someone please explain, How can I do it?
I want a least mathematical explanation about why there is no long range order in 2D. I have already read the papers of Mermin, Wagner, Hohenburg etc. But I am afraid they are too mathematical for me. I could not understand at what point 2D becomes different than 3D in these calculations.
Related to your research/experience field, what are the technologies you simulate often and you can judge that this task is complicated, tedious, or time consuming ?
The case is
i want to use laptop to setup my raspberry pi without using hdmi screen, separate keyboard and mouse.
To the best of my knowledge, the cost associated with a wireless link following the ZigBee standard is calculated using the below formula.
C(l)= min(7, round(1/p(l)4) )
where p(l) is probability of successful packet delivery over the wireless link l.
The paper "Wireless Sensor Network With Perpetual Motes for Terrestrial Snail Activity Monitoring (http://ieeexplore.ieee.org/abstract/document/7954581/)" calculates it using the below formula.
p(l) = 1 - ((0.8/radio range) * distance between two nodes + rand (-0.1, 0.1))
Is it a correct way to obtain p(l) ?
Otherwise, how to obtain the probability of successful packet delivery (p(l) ) in the simulations?
Any help is highly appreciated. Thank you in advance.
Amongst the ANN Network which type of network to be used for ex. Back Prorogation , Feed forward B.P. or any other Also which type of training function and adoption learning function to be used for reference ET forecasting
I am writing an assignment within one of my courses within my MSc. The course is named "Supply Chain Design and Optimisation", and the assignment requires us to find a good example of an organization using a locational strategy, in relation to where they should locate their manufacturing or warehousing hubs.
It seems like many of the papers that are publishing these types of research, are anonymizing the names of the companies.
I would really much appreciate if someone have any tips.
MSc Student, Logistics and Supply Chain Management
I am working for my MS level thesis in Vehicular ad hoc Networks (Vanet) routing protocols. Please suggest some recent research topics in the area and obliged.
My problem is near to the General Traveling Salesman Problem with repetitions (General TSP-R) where some points can be visited more than once. However, the differences in my problem are:
1- not all nodes have to be visited by the salesman.
2- some nodes will be visited once.
3- some nodes will be visited more than once.
Is there any way to prevent subtour occurrence?
I'm trying to merge two networks (I used DYnet) this gave me the result I wanted. However I want to see the proceses in this network so I want to combine DYnet with BINGO but if I select every node in the DYnet network en start BINGO it will just generate another (BINGO) network without the data from DYnet showed in it. I have attached the ENviz result but offcourse I'm curious about the GO terms related two this overlap.Any suggestions to fix this? If there is another plugin which van inform me about some features about these proteins in the DYnet I would like to hear it.
I have the list of proteins which are either inhibited or induced by action of certain small molecule. I would like to know the downstream effects of this action so that I can hypothesise a mode of action of the small molecule