|
Troubleshooting
Troubleshooting is a form of problem solving, often applied to repair failed products or processes on a machine or a system. It is a logical, systematic search for the source of a problem in order to solve it, and make the product or process operational again. Troubleshooting is needed to identify the symptoms. Determining the most likely cause is a process of elimination—eliminating potential causes of a problem. Finally, troubleshooting requires confirmation that the solution restores the product or process to its working state. In general, troubleshooting is the identification or diagnosis of "trouble" in the management flow of a system caused by a failure of some kind. The problem is initially described as symptoms of malfunction, and troubleshooting is the process of determining and remedying the causes of these symptoms. A system can be described in terms of its expected, desired or intended behavior (usually, for artificial systems, its purpose). Events or inputs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hard Reboot
In computing, rebooting is the process by which a running computer system is restarted, either intentionally or unintentionally. Reboots can be either a cold reboot (alternatively known as a hard reboot) in which the power to the system is physically turned off and back on again (causing an initial boot of the machine); or a warm reboot (or soft reboot) in which the system restarts while still powered up. The term restart (as a system command) is used to refer to a reboot when the operating system closes all programs and finalizes all pending input and output operations before initiating a soft reboot. Terminology Etymology Early electronic computers (like the IBM 1401) had no operating system and little internal memory. The input was often a stack of punch cards or via a Switch Register. On systems with cards, the computer was initiated by pressing a start button that performed a single command - "read a card". This first card then instructed the machine to read more cards ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Problem Solving
Problem solving is the process of achieving a goal by overcoming obstacles, a frequent part of most activities. Problems in need of solutions range from simple personal tasks (e.g. how to turn on an appliance) to complex issues in business and technical fields. The former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles. Another classification is into well-defined problems with specific obstacles and goals, and ill-defined problems in which the current situation is troublesome but it is not clear what kind of resolution to aim for. Similarly, one may distinguish formal or fact-based problems requiring psychometric intelligence, versus socio-emotional problems which depend on the changeable emotions of individuals or groups, such as tactful behavior, fashion, or gift choices. Solutions require sufficient resources and knowledge to attain the goal. Professionals such as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Checklist
A checklist is a type of job aid used in repetitive tasks to reduce failure by compensating for potential limits of human memory and attention. It helps to ensure consistency and completeness in carrying out a task. A basic example is the "to do list". A more advanced checklist would be a schedule, which lays out tasks to be done according to time of day or other factors. A primary task in checklist is documentation of the task and auditing against the documentation. Use of a written checklist can reduce any tendency to avoid, omit or neglect important steps in any task. Applications *aid in aviation safety to ensure that critical items are not overlooked. Example: Pre-flight checklists * Used in quality assurance of software engineering, to check process compliance, code standardization and error prevention, and others. * Often used in industry in operations procedures * In civil litigation to deal with the complexity of discovery and motions practice. An example is the o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Failure Analysis
Failure analysis is the process of collecting and analyzing data to determine the cause of a failure, often with the goal of determining corrective actions or liability. According to Bloch and Geitner, ”machinery failures reveal a reaction chain of cause and effect… usually a deficiency commonly referred to as the symptom…”. failure analysis can save money, lives, and resources if done correctly and acted upon. It is an important discipline in many branches of manufacturing industry, such as the electronics industry, where it is a vital tool used in the development of new products and for the improvement of existing products. The failure analysis process relies on collecting failed components for subsequent examination of the cause or causes of failure using a wide array of methods, especially microscopy and spectroscopy. Nondestructive testing (NDT) methods (such as industrial computed tomography scanning) are valuable because the failed products are unaffected by analysi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Process Of Elimination
Process of elimination is a logical method to identify an entity of interest among several ones by excluding all other entities. In educational testing, it is a process of deleting options whereby the possibility of an option being correct is close to zero or significantly lower compared to other options. This version of the process does not guarantee success, even if only one option remains, since it eliminates possibilities merely as improbable. The process of elimination can only narrow the possibilities down, and thus, if the correct option is not amongst the known options, it will not arrive at the truth. Method The method of elimination is iterative. One looks at the answers, determines that several answers are unfit, eliminates these, and repeats, until one cannot eliminate any more. This iteration is most effectively applied when there is logical structure between the answers – that is to say, when by eliminating an answer one can eliminate several others. In this case o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diagnosis
Diagnosis is the identification of the nature and cause of a certain phenomenon. Diagnosis is used in many different disciplines, with variations in the use of logic, analytics, and experience, to determine " cause and effect". In systems engineering and computer science, it is typically used to determine the causes of symptoms, mitigations, and solutions. Computer science and networking * Bayesian networks * Complex event processing * Diagnosis (artificial intelligence) * Event correlation * Fault management * Fault tree analysis * Grey problem * RPR Problem Diagnosis * Remote diagnostics * Root cause analysis * Troubleshooting * Unified Diagnostic Services Mathematics and logic * Bayesian probability * Block Hackam's dictum * Occam's razor * Regression diagnostics * Sutton's law copy right remover block Medicine * Medical diagnosis * Molecular diagnostics Methods * CDR Computerized Assessment System * Computer-assisted diagnosis * Differential diagnosis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Divide And Conquer Algorithm
In computer science, divide and conquer is an algorithm design paradigm. A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. The divide-and-conquer technique is the basis of efficient algorithms for many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.g., the Karatsuba algorithm), finding the closest pair of points, syntactic analysis (e.g., top-down parsers), and computing the discrete Fourier transform ( FFT). Designing efficient divide-and-conquer algorithms can be difficult. As in mathematical induction, it is often necessary to generalize the problem to make it amenable to a recursive solution. The correctness of a divide-and-conquer algorithm is usually proved by mathematical induction, and its computational cost ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Flowchart
A flowchart is a type of diagram that represents a workflow or process. A flowchart can also be defined as a diagrammatic representation of an algorithm, a step-by-step approach to solving a task. The flowchart shows the steps as boxes of various kinds, and their order by connecting the boxes with arrows. This diagrammatic representation illustrates a solution model to a given problem. Flowcharts are used in analyzing, designing, documenting or managing a process or program in various fields. * ''Document flowcharts'', showing controls over a document-flow through a system * ''Data flowcharts'', showing controls over a data-flow in a system * ''System flowcharts'', showing controls at a physical or resource level * ''Program flowchart'', showing the controls in a program within a system Notice that every type of flowchart focuses on some kind of control, rather than on the particular flow itself. However, there are some different classifications. For example, Andrew Veron ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Search
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array. Binary search runs in logarithmic time in the worst case, making O(\log n) comparisons, where n is the number of elements in the array. Binary search is faster than linear search except for small arrays. However, the array must be sorted first to be able to apply binary search. There are specialized data structures designed for fast searching, such as hash tables, that can be searched ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Habituation
Habituation is a form of non-associative learning in which an innate (non-reinforced) response to a stimulus decreases after repeated or prolonged presentations of that stimulus. Responses that habituate include those that involve the intact organism (e.g., full-body startle response) or those that involve only components of the organism (e.g., habituation of neurotransmitter release from ''in vitro'' Aplysia sensory neurons). The broad ubiquity of habituation across all biologic phyla has resulted in it being called "the simplest, most universal form of learning...as fundamental a characteristic of life as DNA." Functionally-speaking, by diminishing the response to an inconsequential stimulus, habituation is thought to free-up cognitive resources to other stimuli that are associated with biologically important events (i.e., punishment/reward). For example, organisms may habituate to repeated sudden loud noises when they learn these have no consequences. A progressive decline of a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Error-tolerant
An error-tolerant design (also: human-error-tolerant design) is one that does not unduly penalize user or human errors. It is the human equivalent of fault tolerant design that allows equipment to continue functioning in the presence of hardware faults, such as a "limp-in" mode for an automobile electronics unit that would be employed if something like the oxygen sensor failed. Use of behavior shaping constraints to prevent errors Use of forcing functions or behavior-shaping constraints is one technique in error-tolerant design. An example is the interlock or lockout of reverse in the transmission of a moving car. This prevents errors, and prevention of errors is the most effective technique in error-tolerant design. The practice is known as poka-yoke in Japan where it was introduced by Shigeo Shingo as part of the Toyota Production System. Mitigation of the effects of errors The next most effective technique in error-tolerant design is the mitigation or limitation of the e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Behavior-shaping Constraint
A behavior-shaping constraint, also sometimes referred to as a forcing function or poka-yoke, is a technique used in error-tolerant design to prevent the user from making common errors or mistakes. One example is the reverse lockout on the transmission of a moving automobile. The microwave oven provides another example of a forcing function. In all modern microwave ovens, it is impossible to start the microwave while the door is still open. Likewise, the microwave will shut off automatically if the door is opened by the user. By forcing the user to close the microwave door while it is in use, it becomes impossible for the user to err by leaving the door open. Forcing functions are very effective in safety critical situations such as this, but can cause confusion in more complex systems that do not inform the user of the error that has been made. When automobiles first started shipping with on-board GPS systems, it was not uncommon to use a forcing function which prevented ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Hard Reboot")
