Skip to main content

Home/ Computer Science Knowledge Sharing/ Group items tagged control

Rss Feed Group items tagged

computersciencej

Process Control Block - 0 views

  •  
    What is Process Control Block ? Today in this Computer Science Study Material for Gate we will discuss about process control block and its various field which provides the information about process. .So let see what is process control block. A Process Control Block is a data structure maintained by the Operating System for every process. Each process has it own data structure. When a process is created then a unique id is assigned to the process Operating system identify a process among all processes on the basis of this process id. A PCB keeps all the information needed to keep track of a process. Generally a process control block contains the following information about a process. To read full tutorial click on the given link http://www.computersciencejunction.in/2018/02/introduction-to-process-control-block-in-operating-system.html
veera90

Semiconductor Automation and Industrial Control | ACL Digital - 0 views

  •  
    In industrial control, ACL Digital focuses on designing and developing products for use in automation and control, such as PLC, data acquisition systems, industrial safety systems, Motion controllers, and others.
computersciencej

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

  •  
    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
Abdelrahman Ogail

Simulated annealing - Wikipedia, the free encyclopedia - 1 views

  • 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].
  •  
    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].
  •  
    A natural AI approach
Islam TeCNo

Model-view-controller - Wikipedia, the free encyclopedia - 0 views

  • Model–view–controller (MVC) is an architectural pattern used in software engineering. Successful use of the pattern isolates business logic from user interface considerations, resulting in an application where it is easier to modify either the visual appearance of the application or the underlying business rules without affecting the other. In MVC, the model represents the information (the data) of the application; the view corresponds to elements of the user interface such as text, checkbox items, and so forth; and the controller manages the communication of data and the business rules used to manipulate the data to and from the model.
    • Abdelrahman Ogail
       
      MVC one of the important patterns used at any software. Especially in Web Development, Database Systems and sure in Game Development
    • Islam TeCNo
       
      please ya zikas 7ot more comments l eni mesh fahem awi ...ana eli fahmo eni afsl el GUI 3an el core code
  • MVC is often seen in web applications, where the view is the actual HTML or XHTML page, and the controller is the code that gathers dynamic data and generates the content within the HTML or XHTML. Finally, the model is represented by the actual content, which is often stored in a database or in XML nodes, and the business rules that transform that content based on user actions.
    • Islam TeCNo
       
      i think this is like PHP or ASP page .... you just See HTML (view) that is Generated by PHP/ASP Code (controller) that gather data from Database (content)
Janos Haits

Global Privacy Control - Take Control Of Your Privacy - 0 views

  •  
    "Turn On GPC. Enable Global Privacy Control to communicate your privacy preferences. Send the Signal. Your browser will send the GPC signal to websites you visit. Exercise Your Rights. Participating websites that adopt this mechanism can then respect your privacy rights accordingly."
Janos Haits

Home · Solid - 0 views

  •  
    "All of your data, under your control Solid lets people store their data securely in decentralized data stores called Pods. Pods are like secure personal web servers for data. All data in a pod is accessible via the Solid Protocol. When data is stored in someone's pod, they control who and what can access it. Solid is led by the inventor of the Web, Sir Tim Berners-Lee, to help realise his vision for its future."
rack bank

Colocation Hosting Services - 0 views

  •  
    Colocation allows you to place your server machine in someone else's rack and share their bandwidth as your own.Choosing the colocation hosting services from Rackbank Datacenter is a beneficial and a cost effective option for businesses that need a stable and high performance network while maintaining total control over hardware and server administration.
Islam TeCNo

List of network protocols - Wikipedia, the free encyclopedia - 0 views

  • IPv4 Internet Protocol version 4
    • Islam TeCNo
       
      el mafroud dah eli howa asasn e7na bensta5dmo now ...maslan el IP beta3i 217.154.89.2 ....el mafroud dah IPv4 we el mafroud ba2a ba3den netawr we neb2a IPv6 :D
  • IPv6 Internet Protocol version 6
    • Islam TeCNo
       
      المفروض ده بقي البروتوكول الجديد الي إن شاء الله هيطبق بعيدن
    • Ahmed Mansour
       
      Currently there are two types of Internet Protocol (IP) addresses in active use: IP version 4 (IPv4) and IP version 6 (IPv6). IPv4 was initially deployed on 1 January 1983 and is still the most commonly used version. IPv4 addresses are 32-bit numbers often expressed as 4 octets in "dotted decimal" notation (for example, 192.0.2.53). Deployment of the IPv6 protocol began in 1999. IPv6 addresses are 128-bit numbers and are conventionally expressed using hexadecimal strings (for example, 2001:0db8:582:ae33::29). source : http://www.iana.org/numbers/ thanks tecno for your useful comments :) keep it up(Y)
  • TCP Transmission Control Protocol UDP User Datagram Protocol
    • Islam TeCNo
       
      The Diffrance between TCP and UDP is that TCP check the packet that packets are sent correctly ... but UDP just send and don't check ....so UDP is faster than TCP but TCP check that data is sent correctly .... so UDP is used in applications like Video Streaming (You Tube) and Voice Streaming too
    • Islam TeCNo
  • ...6 more annotations...
  • Jabber, an instant-messaging protocol
    • Islam TeCNo
       
      Great protcol .....also Called XMPP and this is the protocol used by Google Talk
    • Islam TeCNo
       
      port 5222 i think is it's default :D
  • Internet Relay Chat (IRC)
    • Islam TeCNo
       
      I think this is a very old chat protocol
  • ED2K, A peer-to-peer file sharing protocol
    • Islam TeCNo
       
      I think this is used by emule P2P program !! A Great P2P File Sharing program
  • FTP, File Transfer Protocol
    • Islam TeCNo
       
      use port 21 :D
    • Islam TeCNo
       
      loooooooot of protocols ....any one know simple explainations ?
  • HTTP, HyperText Transfer Protocol
Janos Haits

PureOS - 0 views

  •  
    "A user friendly, secure and freedom respecting OS for your daily usage. With PureOS, you are the only one in control of your digital life. CHECK OUT THE APPLICATIONS"
Janos Haits

Join the Battle for Net Neutrality - 0 views

  •  
    "This is a battle for the future of the internet Comcast & Verizon want to end net neutrality so they can control what we see & do online. In 66 days, the FCC will let them, unless we stop it. This is a battle for the Internet's future. Before you do anything else, send a letter to the FCC & Congress now!"
Janos Haits

A Million Dollar Request for Social Networks | Blockstack - 0 views

  •  
    "It's time for a new breed of social networks - where power is taken back from a single authority and control is returned to you, to me, to all of us. It's time to decentralize social networks.  This is a movement toward greater personal freedom, but it takes an empowered community to build this future."
Janos Haits

Home · Solid - 0 views

  •  
    "Using Web standards to let people control their data, and choose the applications and services to use with it."
Janos Haits

Venho.ai - 0 views

  •  
    "Venho.Ai is the privacy-first AI platform that puts you in control. Securely ​manage your data, personalize your experience, and connect with the apps ​and services you love, all on your terms."
Janos Haits

Echoes - ChatGPT & Claude Conversation Search and Management - 0 views

  •  
    "Take Control of Your AI Conversations Across ChatGPT, Claude, and Gemini! Search, organize, and summarize your AI interactions seamlessly-all in one powerful tool designed to save you time and boost your productivity."
Janos Haits

webAI: Enterprise grade local AI applications - 0 views

  •  
    "Powerful AI, (without giving up your secrets Empower employees with AI that knows your business. webAI is an end-to-end platform that's secure, scalable, and fully under your control."
Islam TeCNo

Deep Blue (chess computer) - Wikipedia, the free encyclopedia - 0 views

  • Deep Blue was a chess-playing computer developed by IBM. On May 11, 1997, the machine won a six-game match by two wins to one with three draws against world champion Garry Kasparov.[1] Kasparov accused IBM of cheating and demanded a rematch, but IBM declined and dismantled Deep Blue.[2] Kasparov had beaten a previous version of Deep Blue in 1996
    • Abdelrahman Ogail
       
      When AI beats humanity!
  • Deep Blue was then heavily upgraded (unofficially nicknamed "Deeper Blue")[11] and played Kasparov again in May 1997, winning the six-game rematch 3½–2½, ending on May 11, finally ending in game six, and becoming the first computer system to defeat a reigning world champion in a match under standard chess tournament time controls.
  • The system derived its playing strength mainly out of brute force computing power.
    • Islam TeCNo
       
      Dah eli bysamoh brute force men no3 el 7aywan :D
fili el sayed

Introduction to Model View Control (MVC) Pattern using C# - 3 views

  • we need to figure out what the heck it is.
    • fili el sayed
       
      LOOOOOOOL, this is a good aproach to start analysis
Islam TeCNo

What's in an HTTP request? - 0 views

shared by Islam TeCNo on 15 Jun 09 - Cached
Ahmed Mansour liked it
  • These headers tell us which web server you were trying to contact.  If that seems odd, bear in mind that many web sites can be "hosted" on a single server, so when the request is received it needs to know which web site you were attempting to access
    • Islam TeCNo
       
      el server momken yekon 3aleh aktar men site ....3ashan keda lama bab3t request ba2olo bardo ana 3ayez site eh !!
  • The request method is usually either "GET" or "POST".  Basically if you fill in and submit a form on a web page it might generate a POST request (or it might be "GET"), whereas if you just click on a link, or activate one of your browser's "bookmarks" or "favourites", then the request method will always be "GET". Therefore, if it's "POST", we can tell that a form was definitely submitted.  The contents of the form would appear here, and there would also be some "Content-" headers describing the data. Web browsers generate two kinds of "POST" data: either "multipart/form-data", which is used when uploading files to a web server, or the more common "application/x-www-form-urlencoded".
    • Islam TeCNo
       
      el 7eta deh mohema ....we fe anwa3 tania bardo 3'er el GET we el POST
  • The "referer" header tells us which document referred you to us - in essence, if you followed a link to get to this page, it is the URL of the page you came from to get here.
    • Islam TeCNo
       
      el Referer by2ol lel server el page eli enta gaii menha ....we a3taked deh el tare2a eli fe sites betsta5dmha 3ashan temna3 maslan en sora aw keda tetshaf ela men el site zat nafso
  • ...2 more annotations...
  • Connection control Connection:keep-alive Keep-Alive:300 These headers are used to fine-tune the network traffic between you and the web server.  They don't tell us much, except a little about the capabilities of your web browser.
    • Islam TeCNo
       
      kan nefsi yekon fe shar7 lel 7eta deh aktar !!
  • Authorisation Username:not present If you have "logged in" to a web site, your username appears here. Note that this only applies to web sites which use proper HTTP authentication - typically, a "login" window pops up and you get three chances to enter your username and password, otherwise you see a page which says "Authentication Required" or similar.  It doesn't apply to web sites where the "login" is a separate page. It's also possible to supply the username and password in the URL you tell your browser to visit - for example, http://user:password@www.example.com/.  In that case, the username would appear here too.
    • Ahmed Mansour
       
      msh fahem el goz2 dah 2wey !! .. 7d yewad7ely please ...
    • Islam TeCNo
       
      ya3ni ya mans a7yanan fe sites bykon feha UserName we password 3an tare2 el HTTP protocol .....ya3ni el mail maslan aw cisclub dol fehom username we password mesh 3an tare2 el HTTP protocol ....el HTTP protocl el username we el pass beto3o bytlbo menak 2abl ma td5ol 3ala el page asasn we bytl3lk keda pop up tekteb feha
  •  
    really very important and useful article ... thanks tecno very match :P
  •  
    Nice Article Tecno..Go On
1 - 20 of 24 Next ›
Showing 20 items per page