|
Feature Interaction
Feature interaction is a software engineering concept. It occurs when the integration of two features would modify the behavior of one or both features. The term ''feature'' is used to denote a unit of functionality of a software application. Similar to many concepts in computer science, the term can be used at different levels of abstraction. For example, the plain old telephone service (POTS) is a telephony application feature at one level, but itself is composed of originating features and terminating features. The originating features may in turn include the provide dial tone feature, digit collection feature and so on. This definition of ''feature interaction'' allows one to focus on certain behavior of the interacting features such as how their response time may be changed given the integration. Many researchers in the field consider problems that arise due to change in the execution ''behavior'' of the interacting features. Under that context, the ''behavior'' of a feature ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Software Engineering
Software engineering is a systematic engineering approach to software development. A software engineer is a person who applies the principles of software engineering to design, develop, maintain, test, and evaluate computer software. The term '' programmer'' is sometimes used as a synonym, but may also lack connotations of engineering education or skills. Engineering techniques are used to inform the software development process which involves the definition, implementation, assessment, measurement, management, change, and improvement of the software life cycle process itself. It heavily uses software configuration management which is about systematically controlling changes to the configuration, and maintaining the integrity and traceability of the configuration and code throughout the system life cycle. Modern processes use software versioning. History Beginning in the 1960s, software engineering was seen as its own type of engineering. Additionally, the development of soft ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dial Tone
A dial tone is a telephony Signaling (telecommunication), signal sent by a telephone exchange or private branch exchange (PBX) to a terminating device, such as a telephone, when an off-hook condition is detected. It indicates that the exchange is working and is ready to initiate a telephone call. The tone stops when the first dialed digit is recognized. If no digits are forthcoming, the permanent signal, partial dial procedure is invoked, often eliciting a special information tone and an intercept message, followed by the off-hook tone, requiring the caller to hang up and redial. History Early telephone exchanges signaled the switchboard operator when a subscriber picked up the telephone handset to make a call. The operator answered requesting the destination of the call. When manual exchanges were replaced with automated switching systems, the exchange generated a tone to the caller when the telephone set was picked up, indicating that the system was ready to accept dialed digi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Telephony
Telephony ( ) is the field of technology involving the development, application, and deployment of telecommunication services for the purpose of electronic transmission of voice, fax, or data, between distant parties. The history of telephony is intimately linked to the invention and development of the telephone. Telephony is commonly referred to as the construction or operation of telephones and telephonic systems and as a system of telecommunications in which telephonic equipment is employed in the transmission of speech or other sound between points, with or without the use of wires. The term is also used frequently to refer to computer hardware, software, and computer network systems, that perform functions traditionally performed by telephone equipment. In this context the technology is specifically referred to as Internet telephony, or voice over Internet Protocol (VoIP). Overview The first telephones were connected directly in pairs. Each user had a separate telephone wired ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Telephone Line
A telephone line or telephone circuit (or just line or circuit industrywide) is a single-user circuit on a telephone communication system. It is designed to reproduce speech of a quality that is understandable. It is the physical wire or other signaling medium connecting the user's telephone apparatus to the telecommunications network, and usually also implies a single telephone number for billing purposes reserved for that user. Telephone lines are used to deliver landline telephone service and Digital subscriber line (DSL) phone cable service to the premises. Telephone overhead lines are connected to the public switched telephone network. The voltage at a subscriber's network interface is typically 48 V between the ring and tip wires, with tip near ground and ring at -48 V. In the United States In 1878, the Bell Telephone Company began to use two-wire circuits, called the local loop, from each user's telephone to end offices which performed any necessary electrical s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Call Forwarding
Call forwarding, or call diversion, is a telephony feature of all telephone switching systems which redirects a telephone call to another destination, which may be, for example, a mobile or another telephone number where the desired called party is available. Call forwarding was invented by Ernest J. Bonanno. In North America, the forwarded line usually rings once to remind the customer using call forwarding that the call is being redirected. More consistently, the forwarded line indicates its condition by stutter dial tone. Call forwarding typically can redirect incoming calls to any other domestic telephone number, but the owner of the forwarded line must pay any toll charges for forwarded calls. Call forwarding is often enabled by dialing *72 followed by the telephone number to which calls should be forwarded. Once someone answers, call forwarding is in effect. If no one answers or the line is busy, the dialing sequence must be repeated to effect call forwarding. Call forwardin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Call Waiting
Call waiting is a telephone service where a subscriber can accept a second incoming telephone call by placing an in-progress call on hold—and may also switch between calls. With some providers it can be combined with additional features such as conferencing, call forwarding, and caller ID. Call waiting is intended to alleviate the need to have more than one telephone line or number for voice communications. History Call waiting was introduced to North America in the early 1970s when the first generation of electronic switch machines built by Western Electric, Electronic Signaling System 1 started to replace older mechanical equipment in the old Bell System local telephone companies. At first, some smaller municipalities were able to offer customers call waiting only on a specific phone exchange (e.g., phone customers in Trenton, Michigan initially had to have a phone number starting with 671 to have call waiting, since 671 was at that time the only exchange in that area served ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nondeterministic Algorithm
In computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A concurrent algorithm can perform differently on different runs due to a race condition. A probabilistic algorithm's behaviors depends on a random number generator. An algorithm that solves a problem in nondeterministic polynomial time can run in polynomial time or exponential time depending on the choices it makes during execution. The nondeterministic algorithms are often used to find an approximation to a solution, when the exact solution would be too costly to obtain using a deterministic one. The notion was introduced by Robert W. Floyd in 1967. Use Often in computational theory, the term "algorithm" refers to a deterministic algorithm. A nondeterministic algorithm is different from its more familiar determi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concurrency (computer Science)
In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the outcome. This allows for parallel execution of the concurrent units, which can significantly improve overall speed of the execution in multi-processor and multi-core systems. In more technical terms, concurrency refers to the decomposability of a program, algorithm, or problem into order-independent or partially-ordered components or units of computation. According to Rob Pike, concurrency is the composition of independently executing computations, and concurrency is not parallelism: concurrency is about dealing with lots of things at once but parallelism is about doing lots of things at once. Concurrency is about structure, parallelism is about execution, concurrency provides a way to structure a solution to solve a problem that may (but not necessarily) be parallelizable. A number of mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nancy Davis Griffeth
Nancy Davis Griffeth (born October 26, 1945) is an American computer scientist notable for approaches to the feature interaction problem. In 2014, she is a professor at Lehman College of The City University of New York and is modelling biological systems in computational biology. Early life Griffeth was born in Oak Park, Illinois and lived in Laurel, Mississippi and Memphis, Tennessee as a child. She received a bachelor's degree from Harvard University, a master's degree from Michigan State University, and a PhD degree from the University of Chicago. Career Griffeth did seminal work in the feature interaction problem as a founding organizer of the feature interaction workshops and co-author of one of the most cited papers in feature interactions, "A Feature Interaction Benchmark for IN and Beyond." The feature interaction problem is a software problem that arises when one feature ''interacts'' with another in such a way that it changes what the feature does. This can cause serio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Luigi Logrippo
Luigi Logrippo is a Professor of Computer Science at the Université du Québec en Outaouais (UQO). He is the principal researcher of the LOTOS group at the University Of Ottawa. Currently luigi participates in LARSI. Research areas Formal methods in security, privacy and governance including: *Formal specification, formal design, validation, verification, testing *Security: Enterprise data security; Access control models and methods *Legal conformance, privacy Normative systems: *Formal methods in telecom software engineering: *Process algebras, LOTOS and E-LOTOS languages *Feature interaction problem Biography Logrippo was born in Italy, received a "laurea" in law from the University of Rome in 1961. Until 1967, he worked with Olivetti, Olivetti-Bull, General Electric, and Siemens as a programmer and systems analyst. From 1967 to 1969 he worked as a research associate at the Institute for Computer Studies. He obtained a MSc in Computer Science from University of Manitoba ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dependability
In systems engineering, dependability is a measure of a system's availability, reliability, maintainability, and in some cases, other characteristics such as durability, safety and security. In real-time computing, dependability is the ability to provide services that can be trusted within a time-period.A. Avizienis, J.-C. Laprie, Brian Randell, and C. Landwehr,Basic Concepts and Taxonomy of Dependable and Secure Computing" IEEE Transactions on Dependable and Secure Computing, vol. 1, pp. 11-33, 2004. The service guarantees must hold even when the system is subject to attacks or natural failures. The International Electrotechnical Commission (IEC), via its Technical Committee TC 56 develops and maintains international standards that provide systematic methods and tools for dependability assessment and management of equipment, services, and systems throughout their life cycles. The IFIP Working Group 10.4 on "Dependable Computing and Fault Tolerance" plays a role in synthesizing t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pamela Zave
Pamela Zave (born 1948) is an American computer scientist now working at Princeton University. She is known for her work on requirements engineering, telecommunication services, and protocol modeling and verification, and is now working on network architecture.Professional Biography retrieved 2018-10-15. She was named a of the in 2002, and was the 2017 recipient of the Harlan D. Mills Award from the |
