Patents by Inventor William C. Archibald
William C. Archibald has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8750468Abstract: In one or more embodiments, one or more methods and/or systems described can transform an inbound call into one or more call streams and/or call states that can include at least one of a contextualized or personalized message, a promotion, a coupon, an offer, a voucher, an advertisement, and an opt-in program, among others. For example, the one or more methods and/or systems described can perform: receiving identification information associated with a telephony device; determining, based on the identification information, a message for the user; and sending the message to the telephony device. For instance, the message can include a coupon or discount for a good or service. In one example, the coupon or discount can be sent via a short message service text message. In another example, the coupon or discount can include a computer-readable image that can be sent via a multimedia messaging service message.Type: GrantFiled: October 5, 2010Date of Patent: June 10, 2014Assignee: CallSpace, Inc.Inventors: Richard J. Manley, Craig Fryar, Michael Lee, Carmichael J. Simon, William C. Archibald
-
Publication number: 20130308767Abstract: In one or more embodiments, one or more methods and/or systems described can transform an inbound call into one or more call streams and/or call states that can include at least one of a contextualized or personalized message, a promotion, a coupon, an offer, a voucher, an advertisement, and an opt-in program, among others. For example, the one or more methods and/or systems described can perform: receiving identification information associated with a telephony device; determining, based on the identification information, a message for the user; and sending the message to the telephony device. For instance, the message can include a coupon or discount for a good or service. In one example, the coupon or discount can be sent via a short message service text message. In another example, the coupon or discount can include a computer-readable image that can be sent via a multimedia messaging service message.Type: ApplicationFiled: April 10, 2013Publication date: November 21, 2013Inventors: Richard J. Manley, Craig Fryar, Michael Lee, Carmichael J. Simon, William C. Archibald
-
Publication number: 20110123011Abstract: In one or more embodiments, one or more methods and/or systems described can transform an inbound call into one or more call streams and/or call states that can include at least one of a contextualized or personalized message, a promotion, a coupon, an offer, a voucher, an advertisement, and an opt-in program, among others. For example, the one or more methods and/or systems described can perform: receiving identification information associated with a telephony device; determining, based on the identification information, a message for the user; and sending the message to the telephony device. For instance, the message can include a coupon or discount for a good or service. In one example, the coupon or discount can be sent via a short message service text message. In another example, the coupon or discount can include a computer-readable image that can be sent via a multimedia messaging service message.Type: ApplicationFiled: October 5, 2010Publication date: May 26, 2011Inventors: Richard J. Manley, Craig Fryar, Michael Lee, Carmichael J. Simon, William C. Archibald
-
Patent number: 5841948Abstract: In a fuzzy inference system using a plurality of output label membership functions mBi(y), each of which is represented by a singleton having a position yi and a consequent grade gi, a defuzzifying method comprising the steps of: selecting and identifying n singletons in magnitude order of the consequent grade as g1, g2, . . . , gn (g1 is the highest); and obtaining the center of gravity y0 as the final result of defuzzification, by calculating the following approximate equation (n=2, 3, . . . )y0.apprxeq.y1+g2 (y2-y1)+g3 (y3-y1)+. . .+gn(yn-y1).Type: GrantFiled: April 18, 1995Date of Patent: November 24, 1998Assignee: Motorola, Inc.Inventors: Ken Ota, William C. Archibald
-
Patent number: 5764854Abstract: A minimum-maximum computation circuit (5) includes a circuit (10) for detecting an order of magnitude of the input label's grades and a circuit for executing a minimum-maximum calculation (41, 42, and 49) according to an order of the magnitude of the input label's grades. The minimum-maximum computation circuit includes a rule memory (20) for storing rule-associative-bit-groups which include a valid/invalid bit for each of the coded rules. Each of the coded rules include an arrangement of valid/invalid bits for indicating whether each of said input labels is included or not in the antecedent of said each of rules. The minimum-maximum computing circuit further includes a weighting factor circuit (63) for providing weighting factors in their magnitude order to be applied to selected fuzzy rules.Type: GrantFiled: June 15, 1995Date of Patent: June 9, 1998Assignee: Motorola, Inc.Inventors: Ken Ota, William C. Archibald
-
Patent number: 5740459Abstract: A data sorting circuit comprising: a data bus 1 for sequentially transmitting data to be sorted; a plurality of cascaded data registers (GR) for storing data in magnitude order, each of the data registers being initialized to a predetermined initial value; and a plurality of data transferring means (GS) each associatively provided for each of the data registers respectively, the data transferring means executing one of the following three operations: storing operation which transfers data appearing on the data bus to the associated data register; shifting operation which transfers data stored in the preceding data register to the associated data register; and no operation which does not transfer any data. The data sorting circuit further comprises: a plurality of transfer control circuits (31, 32, 33) each associatively provided for each of the data transferring means respectively, each of the transfer control circuits controlling the operation of the associated data transferring means.Type: GrantFiled: September 11, 1995Date of Patent: April 14, 1998Assignee: Motorola, Inc.Inventors: Ken Ota, William C. Archibald
-
Patent number: 5638490Abstract: A data processor processes input data using fuzzy logic operations. The input data consists of n-bits (where n is a natural number greater than 2) and appears at a rate of .function.. The data processor outputs the processed data at a given number of bits and a given rate. The data processor includes a first converter (10), a fuzzy computing element (20), and a second converter (30). The first converter converts the input data into converted data consisting of m bits (where m is a natural number less than n and appearing at a rate of (2.sup.n-m).function.. The fuzzy computing element performs fuzzy logic operations on the converted data and sends the processed data to the second converter. The second converter converts the process converts the process data into output data at the given rate and with the given number of bits.Type: GrantFiled: June 6, 1994Date of Patent: June 10, 1997Assignee: Motorola Inc.Inventors: Kim H. Eckert, William C. Archibald, Ken Ota
-
Patent number: 5586217Abstract: A fuzzy logic system arranges fuzzy inference rules into groups corresponding to their respective output labels. Within the fuzzy inference rules, the graded input labels are ordered in numerical order according to the grades of each input label such that all of the graded input labels utilized within any particular group of fuzzy inference rules (for each output label) is ordered in numerical order. The minimum bit state for each of the fuzzy inference rules is selected by choosing the grade within that fuzzy inference rule closest in rank to zero. The maximum bit state for each output label is selected by choosing from the minimum bit states for the various inference rules for each output label the grade farthest in rank from zero. The graded input label represented by the maximum bit state is then output as the final value for each particular output label.Type: GrantFiled: November 30, 1994Date of Patent: December 17, 1996Assignee: Motorola Inc.Inventors: Ken Ota, William C. Archibald
-
Patent number: 5410633Abstract: A grade calculating circuit (FIG. 1) used for fuzzy inference computation is disclosed. The circuit calculates input label grades based on the relationships between input data (Xi) and the input labels, defined by membership functions (MF) having at least one inclined line segment (FIG. 3), said grades having the upper and lower limit values (g.sub.max, g.sub.min). The circuit comprises: memory (20) for memorizing the input label membership functions by storing, for each of the membership functions, a function form type code, a bending point (Xo) at an end of the inclined line segment and a multiplication rule which designates a multiplier (2.sup.n +2.sup.Type: GrantFiled: September 27, 1993Date of Patent: April 25, 1995Assignee: Motorola, Inc.Inventors: Ken Ota, William C. Archibald, Robert W. Sparks
-
Patent number: 5398299Abstract: In a fuzzy inference system comprising a plurality of fuzzy rules including input labels as antecedents, a min-max computing circuit for executing min-max computation on input label grades is disclosed. The min-max computing circuit comprises an input label sorter 10 for sorting all input label grades in their magnitude order; and min-max computing logic devices 30, 40 for executing min-max computations on the input label grades according to the grade's magnitude order.Type: GrantFiled: September 27, 1993Date of Patent: March 14, 1995Assignee: Motorola, Inc.Inventors: Ken Ota, William C. Archibald