Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged of

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Abdelrahman Ogail

Simulated annealing - Wikipedia, the free encyclopedia - 1 views

en.wikipedia.org/...Simulated_annealing

AI AI-In-Games Adaptation

shared by Abdelrahman Ogail on 18 Aug 09 - Cached
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • ...1 more annotation...
  • Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima—which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Abdelrahman Ogail on 18 Aug 09
     
    Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global minimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration - provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm replaces the current solution by a random "nearby" solution, chosen with a probability that depends on the difference between the corresponding function values and on a global parameter T (called the temperature), that is gradually decreased during the process. The dependency is such that the current solution changes almost randomly when T is large, but increasingly "downhill" as T goes to zero. The allowance for "uphill" moves saves the method from becoming stuck at local minima-which are the bane of greedier methods. The method was independently described by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi in 1983 [1], and by V. Černý in 1985 [2]. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by N. Metropolis et al. in 1953 [3].
  • Abdelrahman Ogail on 18 Aug 09
     
    A natural AI approach
Abdelrahman Ogail

Clockwork universe theory - Wikipedia, the free encyclopedia - 1 views

en.wikipedia.org/...Clockwork_universe_theory

ALife Artificial-Intelligence

shared by Abdelrahman Ogail on 07 Aug 09 - Cached
  • The Clockwork Universe Theory is a theory, established by Isaac Newton, as to the origins of the universe. A "clockwork universe" can be thought of as being a clock wound up by God and ticking along, as a perfect machine, with its gears governed by the laws of physics. What sets this theory apart from others is the idea that God's only contribution to the universe was to set everything in motion, and from there the laws of science took hold and have governed every sequence of events since that time. This idea was very popular during the Enlightenment, when scientists realized that Newton's laws of motion, including the law of universal gravitation, could explain the behavior of the solar system. A notable exclusion from this theory though is free will, since all things have already been set in motion and are just parts of a predictable machine. Newton feared that this notion of "everything is predetermined" would lead to atheism. This theory was undermined by the second law of thermodynamics ( the total entropy of any isolated thermodynamic system tends to increase over time, approaching a maximum value) and quantum physics with its unpredictable random behavior.
  • The Clockwork Universe Theory is a theory, established by Isaac Newton, as to the origins of the universe. A "clockwork universe" can be thought of as being a clock wound up by God and ticking along, as a perfect machine, with its gears governed by the laws of physics. What sets this theory apart from others is the idea that God's only contribution to the universe was to set everything in motion, and from there the laws of science took hold and have governed every sequence of events since that time. This idea was very popular during the Enlightenment, when scientists realized that Newton's laws of motion, including the law of universal gravitation, could explain the behavior of the solar system. A notable exclusion from this theory though is free will, since all things have already been set in motion and are just parts of a predictable machine. Newton feared that this notion of "everything is predetermined" would lead to atheism. This theory was undermined by the second law of thermodynamics ( the total entropy of any isolated thermodynamic system tends to increase over time, approaching a maximum value) and quantum physics with its unpredictable random behavior.
    • Abdelrahman Ogail
      Abdelrahman Ogail on 07 Aug 09
       
      "God's only contribution to the universe was to set everything in motion, and from there the laws of science took hold and have governed every sequence of events since that time" <-- ???
Abdelrahman Ogail

Flocking (behavior) - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...Flocking_(behavior)

ALife Artificial-Intelligence

shared by Abdelrahman Ogail on 07 Aug 09 - Cached
  • Flocking behavior is the behavior exhibited when a group of birds, called a flock, are foraging or in flight. There are parallels with the shoaling behavior of fish, or the swarming behavior of insects. Computer simulations and mathematical models which have been developed to emulate the flocking behaviors of birds can generally be applied also to the "flocking" behavior of other species. As a result, the term "flocking" is sometimes applied, in computer science, to species other than birds. This article is about the modelling of flocking behavior. From the perceptive of the mathematical modeller, "flocking" is the collective motion of a large number of self-propelled entities and is a collective animal behavior exhibited by many living beings such as birds, fish, bacteria, and insects.[1] It is considered an emergent behaviour arising from simple rules that are followed by individuals and does not involve any central coordination. Flocking behavior was first simulated on a computer in 1986 by Craig Reynolds with his simulation program, Boids. This program simulates simple agents (boids) that are allowed to move according to a set of basic rules. The result is akin to a flock of birds, a school of fish, or a swarm of insects.
  • Flocking behavior is the behavior exhibited when a group of birds, called a flock, are foraging or in flight. There are parallels with the shoaling behavior of fish, or the swarming behavior of insects. Computer simulations and mathematical models which have been developed to emulate the flocking behaviors of birds can generally be applied also to the "flocking" behavior of other species. As a result, the term "flocking" is sometimes applied, in computer science, to species other than birds. This article is about the modelling of flocking behavior. From the perceptive of the mathematical modeller, "flocking" is the collective motion of a large number of self-propelled entities and is a collective animal behavior exhibited by many living beings such as birds, fish, bacteria, and insects.[1] It is considered an emergent behaviour arising from simple rules that are followed by individuals and does not involve any central coordination. Flocking behavior was first simulated on a computer in 1986 by Craig Reynolds with his simulation program, Boids. This program simulates simple agents (boids) that are allowed to move according to a set of basic rules. The result is akin to a flock of birds, a school of fish, or a swarm of insects.
Ahmed Mansour

CRC Cards Tutorial - 0 views

users.csc.calpoly.edu/...crc_b

CRC oop

shared by Ahmed Mansour on 04 Jul 09 - Cached
  • Object Oriented Analysis and Design using CRC Cards
  • A CRC cards is an index card that is use to represent the responsibilities of classes and the interaction between the classes. CRC cards are an informal approach to object oriented modeling. The cards are created through scenarios, based on the system requirements, that model the behavior of the system. The name CRC comes from Class, Responsibilities, and Collaborators which the creators found to be the essential dimensions of object oriented modeling.
    • Ahmed Mansour
      Ahmed Mansour on 04 Jul 09
       
      One of the most popular methods for identifying and categorizing classes is to use class-responsibility-collaboration cards (CRC). Each CRC card represents a single class's data attributes, responsibilities, and collaborations. source : Thought Process Book..
    • Ahmed Mansour
      Ahmed Mansour on 04 Jul 09
       
      You need to create three sections on each card: - The name of the class - The responsibilities of the class - The collaborations of the class
  • Why uses CRC cards?
  • ...4 more annotations...
  • They are portable... No computers are required so they can be used anywhere. Even away from the office. The allow the participants to experience first hand how the system will work. No computer tool can replace the interaction that happens by physically picking up the cards and playing the roll of that object... The are a useful tool for teaching people the object-oriented paradigm. They can be used as a methodology them selves or as a front end to a more formal methodology such as Booch, Wirfs-Brock, Jacobson, etc.
  • Tutorial
    • Ahmed Mansour
      Ahmed Mansour on 04 Jul 09
       
      here we can found simple tutorial for illustration...
  • A CRC cards is an index card that is use to represent the responsibilities of classes and the interaction between the classes. CRC cards are an informal approach to object oriented modeling. The cards are created through scenarios, based on the system requirements, that model the behavior of the system. The name CRC comes from Class, Responsibilities, and Collaborators which the creators found to be the essential dimensions of object oriented modeling.
  • Why uses CRC cards? They are portable... No computers are required so they can be used anywhere. Even away from the office. The allow the participants to experience first hand how the system will work. No computer tool can replace the interaction that happens by physically picking up the cards and playing the roll of that object... The are a useful tool for teaching people the object-oriented paradigm. They can be used as a methodology them selves or as a front end to a more formal methodology such as Booch, Wirfs-Brock, Jacobson, etc.
  • Ahmed Mansour on 04 Jul 09
     
    This is great tutorial for CRC cards ( sort of object oriented modeling approach) \ni think it was useful for me ... hoping to be useful for all of us : ) ..
computersciencej

TCP/IP model questions based Study Material for gate Computer Science - 0 views

Computer Science Study Material for Gate

shared by computersciencej on 17 Nov 17 - No Cached
  • computersciencej on 17 Nov 17
     
    TCP/IP protocol based questions for gate computer science exam Q1.What is the difference between transport and session layer of OSI model. Answer: OSI Model Transport Layer The transport layer uses the services provided by the network layer, such as best path selection and logical addressing, to provide end-to-end communication between source and destination. • The transport -layer data stream is a logical connection between the endpoints of a network. • End-to-end control is provided by sliding windows and reliability in sequencing numbers and acknowledgments. The transport layer regulates information flow to ensure end-to-end connectivity between host applications reliably and accurately. • The TCP/ IP protocol of Layer 4 (t transport t layer ) has two protocols. They are TCP and UDP. The transport layer accepts data from the session layer and segments the data for transport across the network. Generally, the transport layer is responsible for making sure that the data is delivered error-free and in the proper sequence. Flow control generally occurs at the transport layer. OSI Model Session Layer The session layer establishes, manages, and terminates communication sessions. Communication sessions consist of service requests and service responses that occur between applications located on different network devices. These requests and responses are coordinated by protocols implemented at the session layer. The session layer establishes, manages, and terminates sessions between applications Functions of the session layer and the different processes that occur as data packets travel through this layer. More specifically, you learned that Communication sessions consist of mini-conversations that occur between applications located on different network devices. Requests and responses are coordinated by protocols implemented at the session layer. • The session layer decides whether to use two-way simultaneous communication or two-way alternate communicati
computersciencej

Routing Table Based Study Material for gate Computer Science - 0 views

GATE study material for computer science Computer Science Study Material for Gate Computer Networks

shared by computersciencej on 11 Dec 17 - No Cached
  • computersciencej on 11 Dec 17
     
    In our previous post Routing Concepts in Computer Networks we have explained the basic introduction of the routing concept. In the continuation of that post now in this article of Computer Science Study Material for Gate, we are going to tell about routing table. In this article provides the information about the different fields of a routing table with a suitable example, what is the use of these fields and how a particular route is selected for the destination host. So let's start with the introduction of routing table. http://www.computersciencejunction.in/2017/12/Study-Material-for-Gate-Computer-Science-routing-table-in-computer-network.html
veera90

Best Pharmacovigilance Services | Pharmacovigilance Professionals | ACL Digital Life Sc... - 0 views

www.acldigital.com/...pharmacovigilance

Lifesciences Pharma

shared by veera90 on 25 Nov 22 - No Cached
  • veera90 on 25 Nov 22
     
    From proof-of-concept to post-marketing surveillance services, you can depend on our PV experts to efficiently work through the entire scope of Pharmacovigilance activities. We offer a high level of expertise and assist in meeting the highest standards of applicable national and global regulations. The experts at ACL Digital can easily customize safety monitoring services to suit your specific business requirements. Most biopharmaceutical companies have distinct and demanding clinical safety requirements as per the directions of regulatory agencies. You can depend on our PV specialists who plan safety and pharmacovigilance services accordingly that fit the needs of both your product and study - we adhere and adapt to your processes and are flexible enough to do it the right way.
Janos Haits

watson technology full details | Knowledge Media Institute | The Open University - 0 views

kmi.open.ac.uk/...watson

university institute knowledge watson Semantic Web web 3.0 web3.0 semantic semanticweb web evolution semantics online development Technology Programming science

shared by Janos Haits on 27 Aug 22 - No Cached
  • Janos Haits on 27 Aug 22
     
    "As the Semantic Web gains momentum, large amounts of semantic information are becoming available online. The emergence of such large-scale semantics opens the way to a new generation of Semantic Systems, able to overcome the brittleness of classic domain-specific semantic systems and supporting open-ended tasks, such as web browsing and question answering. Watson is an innovative gateway for the Semantic Web, whose design has been guided by the requirements of this new generation of Semantic Web applications and by the lessons learnt from previous systems. Watson plays three main roles: 1) collects the a"
Abdelrahman Ogail

Production system - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...Production_system

Artificial-Intelligence Planning Scripting

shared by Abdelrahman Ogail on 09 Aug 09 - Cached
Ahmed One liked it
  • A production system (or production rule system) is a computer program typically used to provide some form of artificial intelligence, which consists primarily of a set of rules about behavior. These rules, termed productions, are a basic representation found useful in AI planning, expert systems and action selection. A production system provides the mechanism necessary to execute productions in order to achieve some goal for the system. Productions consist of two parts: a sensory precondition (or "IF" statement) and an action (or "THEN"). If a production's precondition matches the current state of the world, then the production is said to be triggered. If a production's action is executed, it is said to have fired. A production system also contains a database, sometimes called working memory, which maintains data about current state or knowledge, and a rule interpreter. The rule interpreter must provide a mechanism for prioritizing productions when more than one is triggered.
  • A production system (or production rule system) is a computer program typically used to provide some form of artificial intelligence, which consists primarily of a set of rules about behavior. These rules, termed productions, are a basic representation found useful in AI planning, expert systems and action selection. A production system provides the mechanism necessary to execute productions in order to achieve some goal for the system. Productions consist of two parts: a sensory precondition (or "IF" statement) and an action (or "THEN"). If a production's precondition matches the current state of the world, then the production is said to be triggered. If a production's action is executed, it is said to have fired. A production system also contains a database, sometimes called working memory, which maintains data about current state or knowledge, and a rule interpreter. The rule interpreter must provide a mechanism for prioritizing productions when more than one is triggered.
Janos Haits

Quantum UChicago.edu - 0 views

quantum.uchicago.edu

quantumComputing quantum computer science web web evolution internet

shared by Janos Haits on 30 Oct 18 - No Cached
  • Janos Haits on 30 Oct 18
     
    'The Chicago Quantum Exchange (CQE) is an intellectual hub and partnership for advancing academic and industrial efforts in the science and engineering of quantum information. Members of CQE are focused on developing new ways of understanding and exploiting the laws of quantum mechanics, the fundamental yet counterintuitive theory that governs nature at its smallest scales. The overarching goal is to apply research innovations to develop radically new types of devices, materials, and computing techniques.'
veera90

Banking, Financial Services and Insurance | BFSI | ACL Digital - 0 views

www.acldigital.com/...nancial-services-and-insurance

BFSI Banking Insurance Finance

shared by veera90 on 29 May 23 - No Cached
  • veera90 on 29 May 23
     
    In the face of evolving customer expectations, strict regulatory requirements, Digital technology proliferation, and the emergence of disruptive Fintech players, much of the Banking and Financial services landscape has changed significantly. With the options to either be a visionary by reimagining the future of banking, a silent watcher or an inquisitive explorer, Banks need to choose the best posture and constantly adapt to navigate through such a massive change. Moving ahead with a customer-centric mindset and empowering consumers with hyper-personalized experiences will help organizations achieve the top-of-mind awareness needed to stand out.
Abdelrahman Ogail

Theory of mind - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...Theory_of_mind

shared by Abdelrahman Ogail on 26 Jun 09 - Cached
  • Theory of mind is the ability to attribute mental states—beliefs, intents, desires, pretending, knowledge, etc.—to oneself and others and to understand that others have beliefs, desires and intentions that are different from one's own.[1]
  • One of the most important milestones in theory of mind development is gaining the ability to attribute false belief: that is, to recognize that others can have beliefs about the world that are wrong. To do this, it is suggested, one must understand how knowledge is formed, that people’s beliefs are based on their knowledge, that mental states can differ from reality, and that people’s behavior can be predicted by their mental states. Numerous versions of the false-belief task have been developed, based on the initial task done by Wimmer and Perner (1983).
  • In the most common version of the false-belief task (often called the ‘Sally-Anne’ task), children are told or shown a story involving two characters. For example, in one version, the child is shown two dolls, Sally and Anne, playing with a marble. The dolls put away the marble in a box, and then Sally leaves. Anne takes the marble out and plays with it again, and after she is done, puts it away in a different box. Sally returns and the child is then asked where Sally will look for the marble. The child passes the task if she answers that Sally will look in the first box where she put the marble; the child fails the task if she answers that Sally will look in the second box, where the child knows the marble is hidden, even though Sally cannot know, since she did not see it hidden there. In order to pass the task, the child must be able to understand that another’s mental representation of the situation is different from their own, and the child must be able to predict behavior based on that understanding. The results of research using false-belief tasks have been fairly consistent: most normally-developing children are unable to pass the tasks until around the age of three or four.
    • Abdelrahman Ogail
      Abdelrahman Ogail on 26 Jun 09
       
      Test your small brother this test if he/she under 3 years!
Islam TeCNo

LOL - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/Lol

shared by Islam TeCNo on 25 Jun 09 - Cached
  • OL (also written with some or all letters lowercase) is an abbreviation for laughing out loud[1][2] or laugh out loud.[3] LOL is a common element of Internet slang used historically on Usenet, but now widespread in other forms of computer-mediated communication, and even face-to-face communication. It is one of many initialisms for expressing bodily reactions, in particular laughter, as text, including initialisms such as ROTFL[4][5][6][7] or ROFL [8] ("roll(ing) on the floor laughing"), a more emphatic expression of laughter, and BWL ("bursting with laughter"), above which there is "no greater compliment" according to technology columnist Larry Magid.[9] Other unrelated expansions include the now mostly historical "lots of luck" or "lots of love" used in letter-writing.[10
    • Abdelrahman Ogail
      Abdelrahman Ogail on 25 Jun 09
       
      Source of the LOL
    • Islam TeCNo
      Islam TeCNo on 25 Jun 09
       
      hehe LOL :D
  • Corruptions of "LOL"
    • Abdelrahman Ogail
      Abdelrahman Ogail on 25 Jun 09
       
      This is a big LOL
Janos Haits

BabelNet | The largest multilingual encyclopedic dictionary and semantic network - 0 views

live.babelnet.org

multilingual dictionary semantic network search engine reference Semantic Web web3.0 search searchengine semanticweb research

shared by Janos Haits on 26 Oct 17 - No Cached
  • Janos Haits on 26 Oct 17
     
    "BabelNet is both a multilingual encyclopedic dictionary, with lexicographic and encyclopedic coverage of terms, and a semantic network which connects concepts and named entities in a very large network of semantic relations, made up of about 15 million entries, called Babel synsets. Each Babel synset represents a given meaning and contains all the synonyms which express that meaning in a range of different languages. Its evolution, BabelNet live, is a new, continuously growing resource, .."
Janos Haits

https://nectome.com - 0 views

nectome.com

artificial intelligence brain technology Science Artificial-Intelligence development Computer Programming

shared by Janos Haits on 27 Mar 18 - No Cached
  • Janos Haits on 27 Mar 18
     
    "Our mission is to preserve your brain well enough to keep all its memories intact: from that great chapter of your favorite book to the feeling of cold winter air, baking an apple pie, or having dinner with your friends and family. If memories can truly be preserved by a sufficiently good brain banking technique, we believe that within the century it could become feasible to digitize your preserved brain and use that information to recreate your mind. How close are we to this possibility? Currently, we can preserve the connectomes of animal brains and are working on extending our techniques to human brains in a research context. This is an important first step towards the development of a verified memory preservation protocol, as the connectome plays a vital role in memory storage."
Janos Haits

Home - M-Lab - 0 views

www.measurementlab.net

research technology web3.0 web online Science web evolution internet data

shared by Janos Haits on 03 May 18 - No Cached
  • Janos Haits on 03 May 18
     
    "Open Internet Measurement M-Lab provides the largest collection of open Internet performance data on the planet. As a consortium of research, industry, and public-interest partners, M-Lab is dedicated to providing an ecosystem for the open, verifiable measurement of global network performance. Real science requires verifiable processes, and M-Lab welcomes scientific collaboration and scrutiny. This is why all of the data colle"
computersciencej

Virtualization in Cloud Computing - 0 views

www.computersciencejunction.in/...virtualization-concepts.html

virtualization in cloud computing

shared by computersciencej on 15 Jun 19 - No Cached
  • computersciencej on 15 Jun 19
     
    Virtualization means creating the virtual version of a useful resource such as server, storage device, a desktop, operating system and network resources.Virtualization basically provide the services of pooling and sharing of the resources Behind the virtualization there is concept of virtual machine which is also known as guest machine and the machine on which this virtual machine is created is known as host machine.
veera90

Expert Biostatistics Services | Biostatistics | ACL Digital Life Sciences | IT Consulting - 0 views

www.acldigital.com/...Biostatistics

Lifesciences Clinical Pharma medical ACLDigital

shared by veera90 on 26 Jun 22 - No Cached
  • veera90 on 26 Jun 22
     
    Biostatistics plays a vital role in clinical research. From protocol development and clinical trial designs to sample size calculation, data analysis and more, our team of Biostatisticians have the right SME expertise in multiple therapeutic areas to help deliver quality outcomes quickly and efficiently. You can rely on us to determine and apply the appropriate statistical model, write CSR sections to interact with regulatory authorities, and examine the efficacy of safety data. Innovative and insight-driven statistical methods play a crucial role in every step of the drug development process. At ACL Digital, biostatistics remains an integral part of our services.
Janos Haits

What is a Blockchain | Defi Dictionary | Web3 Daily - 0 views

www.web3daily.co/...what-is-a-blockchain

Computer tools development service Programming technology

shared by Janos Haits on 19 Mar 24 - No Cached
  • Janos Haits on 19 Mar 24
     
    "Think of a blockchain as a transaction list that is uploaded to thousands of computers around the world.  If someone sends money to you, that transaction gets added to a queue. Queued transactions are sorted into groups (aka 'blocks') and then processed by one of the thousands of computers operating in the cryptocurrency's network. Once the transaction is complete, it appears on the public transaction list, or 'chain'."
1 - 20 of 194 Next › Last »
Showing 20▼ items per page