text:
Add to Spiritual Diary
Scholar in Distress
There wasa scholarly priest, who was delivering a discourse on a
philosophical scripture called Ashtavakra Samhita. In that scripture, there
was a certain verse which can be translated as follows: "The mother and the
son of this birth are born as wife and husband of each other in the next
birth, owing to the attachment of the mother to the body of her son." The
scholar simply could not accept this outrageous statement due to the social
stigma associated with this idea. Preaching this statement to people was out
of question for he would surely get beaten up if he were to do so. However,
the statement, being in the scriptures, could not be simply ignored or
rejected as being false.
The scholar was extremely distressed because he
could not resolve the conflict and understand the verse. He consulted many
other scholars hoping that someone would come up with an acceptable
interpretation of the verse. However nobody could satisfy him.
Some scholars suggested that he just skip that verse and move on to
the next one. However this particular scholar was a true seeker of the Truth.
Neglecting what he could not understand or just blindly accepting it, was
not an option for him. He had to know the true meaning of the scripture. He
had to know the truth even if it was hard to accept. He was looking for
some authoritative scholar who would explain it to him. However none of
the scholars, he had met could help him. Upset and helpless, he began
neglecting his food and health. He fell ill and remained in bed for six
months. Finally, in desperation, he gave up food until he could get his
Meeting with Swami
It was in this state when someone mentioned to him about Swami,
telling him that Swami was an incarnation of the Lord and that if there was
anyone who could solve his problem, it was Swami. He was carried to
Swami, where he asked his question to Him. Swami offered him some
coffee and food. However the scholar refused saying that first he must have
the answer to his question. Swami was amazed and extremely pleased to
see this man who was so committed to knowing the truth that he had given
up his food and sacrificed his health for its sake. Swami said, "People
approach Me only to satisfy their worldly desires but here is a true seeker of
the Truth". Swami convinced the scholar that He had the answer to the
question and would certainly explain it to him at length if he ate well first.
Finally the scholar agreed.
Swami's Explanation
After the scholar had eaten some food, Swami explained to him the
meaning of the verse as follows "In a movie, two actors acted as mother
and son. In another movie, the same two actors acted as wife and husband.
In reality, the two actors are totally unrelated; they are neither mother-son,
nor are they wife-husband. Before the movie the two actors were unrelated,
after the movie they are unrelated, but only during the movie do they
temporarily pretend to be related. That which does not exist before and after
the shooting of the movie, does not exist even during the time of shooting.
The mother-son and wife-husband relationships are totally unreal. In each
of the movies they are only co-actors or co-employees of the same movie
producer. The employer-employee relationship between the movie producer
and actors remains before the movie, during the movie and after the movie.
It is the only real relationship since it is a relationship whose scope is
beyond the unreal movie."
Swami continued to explain, "Relationships between souls in this
world are unreal, because these relationships did not exist in the previous
birth and will not exist in future births. Therefore, they are both temporary
and unreal. The only permanent relation that a soul has is that with God, the
Producer of this Cosmic Cinema. This relation is permanent and real. It was
there in the past, it is there in the present and will remain in the future.
When a person dies here on earth, his soul with its subtle body (past
impressions and feelings) leaves the gross body. The gross (physical) body
is left here and gets destroyed. As soon as the soul leaves the body, all
relationships in this world are also left behind. The soul retains no memory
of who his parents, spouse or children were in the past birth. However, the
bond with God remains. Our attachment to worldly relationships is foolish.
When Abhimanyu, the brave son of Arjuna, died in the Mahabharata war,
Arjuna was overcome with grief. He decided to stop the war. Lord Krishna
tried His best to convince Arjuna to stop grieving unnecessarily but Arjuna
would not understand. Finally, in order to show the impermanence of all
worldly relationships, Lord Krishna took Arjuna to heaven.
There Arjuna
saw Abhimanyu enjoying the pleasures of heaven. Arjuna ran to
Abhimanyu and embraced him. Abhimanyu was surprised and asked
Arjuna "Who are you?" Arjuna told him that he was Abhimanyu's father.
Abhimanyu replied that he had had millions of births and in exactly which
birth was Arjuna his father? Clearly Abhimanyu remembered nothing about
his past birth and relationships. Arjuna saw the uselessness of attachments
in this world. He had seen the proof that all worldly bonds are unreal".
When the scholar heard this explanation, he fell at the feet of Swami
crying. He had finally understood the true meaning of that scriptural verse.
He praised Swami, "You are undoubtedly Lord Datta. No one can explain
the scriptures as You have, O Guru Datta!" The scholar returned home, in
great happiness and recovered completely. Swami had cured the illness of
this devotee entirely by the power of Divine Knowledge. He did not need to
transfer the suffering of the devotee's body on to His own body. This was
indeed the greatest miracle.
His Holiness Shri Dattaswami (Visit: www.universal-spirituality.org- )
Popular Articles
Related Articles
Latest Articles


text:
Aqua SlugThe version of Metal Slug shirt, you have to go with your water gun killing all comers. The King of the beach has stolen your favorite rugby ball as you recover. Move and Aim with the arrows, D Shoot, S Jumping, Water Balloon Launch space
You like Aqua Slug? Share it with your friends !!
Share link:

subset: commoncrawl


text:
Results 1 to 3 of 3
09-01-03, 20:20 #1Registered User
- Join Date
- May 2003
- Location
- New York, NY
- Posts
- 225
Unanswered: Opening an Access Database and print reports via VB
I was wondering if anyone could help me with a Visual Basic Application that I am working on. I want to be able to open an Access Database select a report and then print it out.
Thank you,
Last edited by Mark Gambo; 09-02-03 at 19:29.
09-02-03, 06:01 #2Registered User
- Join Date
- Sep 2003
- Location
- Posts
- 1
Depends on how you want to open your report. If you want to select a report you can just double click it and then press the print icon.
If however you wish to select a report via a form and then print that then this code should do it
Add all the names of your reports into a combo box. Then in VBA
***defines your string that will be used to hold selected report name, type this underneath Option Explicit
Dim strReportToPrint As String
***this would be a button onclick instruction
Private Sub cmdPrintReport_Click()
strReportToPrint = cboReportChoice
DoCmd.OpenReport strReportToPrint, acViewNormal
End Sub
*** the acViewNormal prints the report straight out, you would have to specify acViewPreview if you wished to preview the report first
Last edited by hickyUK; 09-02-03 at 06:05.
09-02-03, 19:28 #3Registered User
- Join Date
- May 2003
- Location
- New York, NY
- Posts
- 225
I am sorry I wasn't very clear on what I am looking to do. I want to design a Visual Basic Application that will access an Access Database via ADO, RDO etc. and printout a specific report contained in that database. This should be done without the user knowing what is going on behind the scenes (so to speak).


text:
Susan Lever graduated with a BA in English Literature from the Australian National University in 1971, and completed a Diploma of Librarianship at the Canberra College of Advanced Education in 1972. In 1975 she moved to Sydney, completing an MA (1978) and a PhD (1981) in Australian literature at the University of Sydney. Lever has taught literature at the Canberra College of Advanced Education, the Australian National University and, from 1986, at the University of New South Wales at ADFA.
Lever has been a regular reviewer for the Canberra Times, the Bulletin and occasionally for ABC Radio and other newspapers. From 1994-1996 she was President of the Association for the Study of Australian Literature and was a member of the Literature Board of the Australia Council from 1991-1994.
In addition to her reviewing work, Lever has published numerous articles on Australian writing, critical books and several edited books, including the Oxford Book of Australian Women's Verse. She is also the general editor of the Cambria Australian Literature series. Professor Lever has been awarded with life membership of ASAL (Association for the Study of Australian Literature) for her "outstanding contribution to ASAL and to the scholarship of Australian literature more broadly."


text:
Skid Row
Music genres
American heavy metal band Skid Row was formed in Toms River, New Jersey, the United States, in 1986. The idea of creating the band came to Rachel Bolan and Dave Sabo. Dave was friend of John Bon Jovi and the latter helped them to record their debut album and helped to get Sebastian Bach, their future vocalist. The debut album Skid Row was released in 1989 and peaked at number 6 on the Billboard chart. Thanks to such hits as "18 and Life" and "I Remember You", the album was certified Platinum very quickly and went on 5 x Multi-Platinum. The song "Youth Gone Wild" became a hymn of American youth during that time. Their next album Slave to the Grind didn't have so many "radio hits" and was heavier than the previous one. Despite this fact it reached the top of the Billboard and went Platinum. The current band's line up composes of Johnny Solinger (vocals), Dave "The Snake" Sabo (guitar), Scotti Hill (guitar), Rachel Bolan (bass) and Dave Gara (drums). From our site you can download these two platinum album by Skid Row in mp3.


text:
george w bush
Independent Media Creates Important Political Dialogues
In 2003, one of America's favorite catchphrases was George W. Bush's favorite sayings: weapons of mass destructions.
The speculation was, of course, that Saddam Hussein's supposed connections with Al Qaeda had these weapons of mass destruction ready to strike at any minute. However, as America made its way into the Iraq war, a more concerning idea would be that mainstream American media went along with everything the government put out without the least bit of scrutiny.
This entry was posted in Indy Media and tagged black lives matter, discussion, george bush, george w bush, hillary clinton, independent media, Journalism, media, social justice, the young turks, video, weapons of mass destruction.


text:
Substance Abuse & Brain Injury. Brain Injury and Alcohol….A recent analysis of research studies on the relationship between alcohol and brain injury found:. Between 37-51\% of individuals hospitalized for TBI were intoxicated at the time of injury & have a history of alcohol misuse
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
(Parry-Jones et.al 2006)
In 197 individuals treated at a Level I trauma center, alcohol use diminished in the first year following TBI (Bombardier et.al 2003)
Kreutzer and colleagues (1996)followed the pre-and post-injury patterns of alcohol and illicit drug use of 87 individuals at 8 and 28 months post TBI. Decline in use was noted at first follow-up. Use at second follow-up were similar to pre-injury use
Australia researchers found similar results in a 2007 study looking at post TBI drug and alcohol use. Alcohol & drug use declined in first year. By two years post injury, only 21.4% of participants reported abstinence and 25.4% were drinking at hazardous levels
significantly associated with being more likely
to be dependent on both alcohol and other drugs,
to having experienced a drug overdose with loss
of consciousness, being in special classes and
having a seizure disorder. There were trends
toward TBI with loss of consciousness being
associated with having a learning disability,
having violence-related convictions, and
receiving psychiatric outpatient services. Among
the later, persons with TBI were more likely to
be treated for attention deficit hyperactivity
disorder, anger management and conduct disorders." John Corrigan Ph.D
* Negative responses are alcoholic responses
Convert the 12 steps into pictures, can be a group activity or individual activity-good for individuals with impaired language skills/concrete thinkers (Reynolds and Murrey 2006)
The researchers at the Research and Training Center on Community Integration of Individuals with Traumatic Brain Injury at Mt. Sinai in New York asked individuals with TBI, what are the factors involved in "kicking the habit"
To stay clean; find the right 12-step program, change "persons, places and things" that trigger use, spirituality…..,
This free training consists of 4 module that take an estimated 30 minutes each to complete. The purpose of the training is twofold, to "ensure service providers understand the range of outcomes" following brain injury and to "improve the ability of service providers to identify and deliver appropriate services for persons with TBI"
"In my judgement such of us who have never fallen victims (to alcoholism) have been spared more by the absence of appetite than from any mental or moral superiority over those who have"
Thank You


text: A fantastic opportunity for an enthusiastic, ambitious and team orientated Artworker with an excellent eye for detail looking to work as part of a team in the fast paced and stimulating environment of a large multinational London design agency. You will be skilled in the use of Adobe InDesign, Illustrator and Photoshop and have the ability to stay calm and productive under pressure whilst working on one of the agency's high profile accounts. Contact: Kristina Duke > email@example.com Company: Circle No recruitment agencies need contact!


text:
Marketing Articles
Marketing (general) Articles (click here for more)
Reaping The Amazing Benefits Of Writing E-Zine ArticlesBy: Bonnie Jo Davis
Marketing on a budget is tough. This is a universal truth that all small business owners face. The most effective small business frugal marketing strategy available is writing and submitting articles to web sites, e-zines, magazines and newsletters. Listed below are some of the amazing benefits you can gain by using this technique.
Writing and submitting articles is a free promotion tool, but it does take time. It will take several hours to submit an article to every available submission site and it can take six to eight weeks for publication. However, once your article is published it will create a long lasting stream of targeted visitors to your site that no other promotion method can accomplish. With each subsequent submission the process will be faster and easier.
© 2003, Davis Virtual Assistance. All rights reserved.
|Other Articles by Bonnie Jo Davis
The author assumes full responsibility for the contents of this article and retains all of its property rights. MarcommWise publishes it here with the permission of the author. MarcomWise assumes no responsibility for the article's contents.


text:
The word "Christian" appears only three times in the Bible: Acts 11:26; 26:28; 1 Peter 4:16.
Psalm 118 verse 8 is in the center of the Bible: "It is better to trust in the Lord than put confidence in man."
The word "grandmother" appears in the Bible only once: 2 Timothy 1:5.
A chariot imported from Egypt cost around 600 shekels of silver (1 Kings 10:29). That would be about $77,000. One shekel was 4 days wages.
The 66 books of the Bible is divided into 1,189 chapters consisting of 31,173 verses. The Old Testament has 929 chapters, the New Testament 260. (King James Version)
Delilah was given a few thousand pieces of silver to deceive Samson into revealing the secret of his strength. (NKJV) Judges 16:4-5: "And the lords of the Philistines came up to her and said to her, 'Entice him, and find out where his great strength lies, and by what means we may over power him….and every one of us will give you 1100 pieces of silver.' "
The longest book chapter in the Bible is Psalm 119, the shortest is Psalm 117.
James, written around 45 AD, is the oldest book in the New Testament.
In Old Testament times the Mediterranean Sea was called the Great Sea.
The 7 Fathers of the Church:
St Athanasius, St Gregory of Nazianzus, St John Chrysostom, St John of Damascus, St Basil of Caesarea, St Gregory of Nyssa, St Cyril of Alexandria.
The raven is the first bird mention in the Bible. It appears in Genesis 8:7, when it is sent out from the ark by Noah to see if the flood waters have abated. The second bird was a dove, in verse 8.
The 12 disciples were not were not allowed to carry food, money, or extra clothing.
There are 66 books in the Bible, 39 in the Old Testament and 27 in the New Testament.
The longest word in the Bible is Maher-shalal-hash-baz: Isaiah 8:1.
III John has the fewest number of words of any book in the Bible.
Nowhere in the Bible does it say there were three wise men – Matthew 2:1 only says: "Magi from the east came to Jerusalem" and later they present three gifts. More
St Paul wrote 14 (of the 27) books of the New Testament.
The word "God" appears in every book except Esther and Song of Solomon.
There are 7 different Jeremiahs in the Bible: 1 Chronicles 5:24; 12:4, 10, 13; 2 Kings 23:30; Jeremiah 1:1; 35:3.
Methuselah is the oldest man on record: 969 years old (Genesis 5:27).
During the 6th Century, it was customary to congratulate people who sneezed because it was thought that they were expelling evil from their bodies. During the great plague of Europe, the Pope passed a law to say "God bless you" to one who sneezed.
Job is the oldest book written in the Bible – it was written by an unknown Israelite around 1500 BC.
About 50 Bibles are sold every minute.
The oldest almost-complete manuscript of the Bible still existing is the Codex Vaticanus, dating from the first half of the 4th century, now held in the Vatican library.
The King James Old Testament consists of 592,439 words consisting of 2,728,100 letters and the New Testament 181,253 words consisting of 838,380 letters (total 3,566,480 letters).
Obadiah, with 21 verses consisting of 602 words, is the shortest book in the Old Testament, and the third shortest in the Bible.
The verse in the exact middle of the Bible is Psalm 117:8. There are 594 chapters before Psalm 117 and 594 chapters after Psalm 117.
Malachi, written about 400 BC, is the youngest book in the Old Testament.


text:
Double big booty bounce Vanessa & Daiquri , two ebony bbw sluts fucked
Description:Thats some gangsta shit round here! Two big ebony booties bended over and fucked doggy style hard by that BBC! I bet you drill those bitches too!
Category:+18 only (Adult)
Added:3 years ago
39 likes, 2 dislikes
Embed / Iframe code:
Make your selection, copy and paste the embed code above.
Standart sizes: Custom size:
What is the problem?
Please do not abuse this section. The videos ,which are on investigate list, are manually checked by editor.
Security code:(is not case-sensitive) can't read
Write a comment
at least 10 characters, up to 400 characters
400 characters remaining
Security code:
(is not case-sensitive) can't read


text:
Summer is almost in full force and we are beyond excited for hot days, beach getaways, and summer fashion! To celebrate, we compiled a short list of some of the essentials we can't live without for the warm months ahead.
Everyday Fashion, Fitness + Lifestyle Inspiration
Copyright © 2017 ·WiseWear


text:
|Publication number
|Publication type
|Application number
|Publication date
|Aug 26, 2008
|Filing date
|Jun 3, 2004
|Priority date
|Jun 3, 2004
|Fee status
|Also published as
|Publication number
|Leon Bruckman, Gal Mor
|Original Assignee
|Corrigent Systems Ltd.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (32), Non-Patent Citations (3), Referenced by (9), Classifications (13), Legal Events (9)
|External Links: USPTO, USPTO Assignment, Espacenet
The present invention relates generally to communication networks, and specifically to methods and systems for managing the flow of traffic over a network link that is shared by multiple connections.
Network service providers frequently aggregate communication traffic from multiple sources for transmission over a shared, high-bandwidth link. Service providers commonly overbook their available bandwidth in order to maximize utilization of this costly resource. In other words, the sum of the bandwidth that the service provider makes available to all traffic sources may exceed the actual bandwidth available on the shared link. Most of the time, the traffic sources generate less than their full bandwidth allocation, so that the aggregated traffic volume is less than the shared link capacity, and all of the traffic is transmitted over the shared link at the rate at which the traffic is generated by the sources. During periods of peak demand, however, the aggregated traffic volume may exceed the shared link capacity. In this case, at least some of the traffic must be buffered, and frames may be dropped if the buffer overflows.
To determine how bandwidth is to be shared during periods of heavy demand, service providers typically define multiple classes of services, with different bandwidth allocations and priorities. Each class of service (CoS) may have a committed information rate (CIR), which the service provider guarantees to provide, and an excess information rate (EIR), which the service provider provides on a best-efforts basis. (Some classes of service may have only a CIR allocation, or only an EIR allocation.) Each connection served by the service provider belongs to a specific class of service (CoS), which may be specified in a service level agreement (SLA) between the service provider and the customer making the connection. In aggregating traffic for transmission over the shared link, the service provider attempts to ensure that all traffic within the CIR of each connection is transmitted. The service provider then divides any remaining capacity among the connections according to their EIR allocations.
Service providers generally try to allocate their available bandwidth fairly among their customers. For this purpose, incoming data packets arriving from different sources are queued, and the traffic aggregator multiplexes among the queues in accordance with a fair scheduling scheme. Different weights may be assigned to different queues in order to permit different sources to receive different relative shares of the available capacity. Various fair scheduling schemes are known in the art. In Fair Queuing, for example, if there are N active queues at any given time, each queue receives 1/N of the available bandwidth. In Weighted Fair Queuing (WFQ), different queues may have different service shares according to their relative weights. In some applications of WFQ, including some embodiments of the present invention that are described hereinbelow, each source or connection has its own queue, an ill-behaved source (generating more than its fair share of traffic) will only punish itself and not other sources. Weighted Round Robin (WRR) scheduling operates on similar principles.
U.S. Pat. No. 6,157,654, whose disclosure is incorporated herein by reference, describes a method for adaptively assigning queue service weights to an ATM traffic management controller in order to reduce service weight update calculations. The queue weight configuration is performed using a reconfigurable weighted fair queuing controller, wherein bandwidth requirements for each queue may be changed in response to connection setup and release values.
The success of a weighted scheduling method, such as WFQ or WRR, in allocating link bandwidth or other resources fairly and efficiently depends on how well the weights accord with the actual classes of service and other parameters of the connections that are active on the link. When a connection is added or removed from the link, the weights should be adjusted to account for the change. In practice, however, in systems known in the art, there is no systematic way to ensure that the weights are really fair at all times or take into account the relative importance and urgency of different types of service.
Embodiments of the present invention provide methods and systems for automatic computation of weights for use in fair scheduling schemes in a communication network. In some of these embodiments, a multiplexer, such as an aggregator, connects multiple sources to a shared link. The multiplexer has multiple queues, each serving one or more connections originating from one or more respective sources. Each connection is designated to carry a certain category or categories of data traffic, which are typically expressed in terms of classes of service. Each connection or class of service has a specified bandwidth allocation, which may include both committed (CIR) and excess (EIR) bandwidth components.
A controller associated with the multiplexer calculates a weight contribution for each connection, based on its specified bandwidth allocation and on the overbooking ratios of the categories of data traffic that the connection may use. Higher levels of expected service (in terms of reliability and low-latency packet delivery) of certain traffic categories are typically reflected by lower overbooking ratios in these categories, and vice versa. Therefore, the connection weight contributions are biased depending on the overbooking ratios so as to give greater weight to categories with low overbooking than to those with high overbooking. For example, the weight contribution may be biased in inverse proportion to the overbooking ratios. The controller then computes a queue weight for each queue as a sum of the weight contributions of the connections served by the queue. When a connection is added, removed or modified, the controller modifies the queue weights accordingly. Use of the connection parameters, and specifically the overbooking ratio, in this manner permits fair weights to be computed and updated automatically, substantially without operator involvement.
Although the embodiments described hereinbelow relate specifically to aggregation of traffic for transmission over a shared network link, the principles of the present invention may similarly be applied in fair scheduling schemes used to allocate other network and processing resources among multiple traffic flows.
There is therefore provided, in accordance with an embodiment of the present invention, a method for communication, including:
setting respective overbooking ratios for multiple categories of data traffic;
assigning respective bandwidth allocations to a plurality of connections for transmitting the data traffic in one or more of the categories over a network;
coupling the data traffic from the connections into respective queues, such that each of the queues is associated with one or more of the connections;
computing respective weights for the queues responsively to the bandwidth allocations and to the overbooking ratios of the categories of the data traffic to be transmitted on the connections that are associated with each of the queues; and
multiplexing among the queues responsively to the respective weights so as to transmit the data traffic from the connections over a link in the network.
Typically, computing the respective weights includes biasing the weights so as to favor, in determining the weights, the categories of the data traffic for which the respective overbooking ratios are relatively smaller over the categories of the data traffic for which the respective overbooking ratios are relatively greater. In a disclosed embodiment, biasing the weights includes weighting the bandwidth allocations in inverse proportion to the overbooking ratios in order to compute the respective weights.
In disclosed embodiments, computing the respective weights includes computing respective weight contributions of the connections responsively to the categories of the data traffic transmitted on each of the connections, and summing the weight contributions of the connections that are associated with each of the queues. Typically, the multiple categories includes classes of service, each having at least one of a committed information rate (CIR) and an excess information rate (EIR) and having respective CIR and EIR overbooking ratios, and assigning the respective bandwidth allocations includes assigning each of the connections to at least one of the classes of service, and computing the respective weight contributions includes determining the weight contributions responsively to the classes of service of the connections. In one embodiment, computing the respective weight contributions includes setting a respective weight contribution of each of the connections belonging to a given class of service CoSj to be α(CoSj)CIR(CoSj)+β(CoSj)EIR(CoSj), wherein α and β are bias coefficients that are determined responsively to the CIR and EIR overbooking ratios of the given class of service, and α and β may be respectively inversely proportional to the CIR and EIR overbooking ratios of the given class of service.
Additionally or alternatively, multiplexing among the queues includes preferentially serving a guaranteed portion of the CIR, and multiplexing a remainder of the CIR and the EIR, and setting a respective weight contribution of each of the connections belonging to a given class of service CoSj to be α(CoSj)CIR(CoSj)[1−1/OVBCIR(CoSj)]+β(CoSj)EIR(CoSj), wherein OVBCIR is the overbooking ratio of the CIR in the given class of service.
In some embodiments, the multiple categories includes classes of service, each having at least one of a committed information rate (CIR) and an excess information rate (EIR) and having respective CIR and EIR overbooking ratios, and assigning the respective bandwidth allocations includes assigning each of the connections to at least one of the classes of service, and wherein computing the respective weights includes determining the weights responsively to the classes of service of the connections. Typically, computing the respective weights includes biasing the weights, responsively to the overbooking ratios, so that the CIR has a relatively greater impact on the weights than does the EIR.
In one embodiment, computing the respective weights includes applying a non-linear mapping to the computed weights.
There is also provided, in accordance with an embodiment of the present invention, apparatus for conveying data traffic over a plurality of connections on a network, each connection being configured to carry one or more categories of the data traffic, the apparatus including:
a multiplexer, which includes a set of queues, each such queue being configured to receive the data traffic on one or more of the connections that are associated with the queue, and which is adapted to multiplex among the queues responsively to respective weights that are assigned to the queues so as to transmit the data traffic from the queues over a link in the network; and
a controller, which is coupled to receive a definition of respective bandwidth allocations and respective overbooking ratios of the categories of the data traffic carried by each of the connections, and which is adapted, responsively to the definition, to compute the respective weights to be assigned to the queues responsively to the bandwidth allocations and to the overbooking ratios of the categories of the data traffic carried by the connections that are associated with each of the queues.
The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:
In network 20, multiple sources 22 (S1, S2, . . . ) transmit data over respective connections to destinations 26 (D1, D2, . . . ) via a core network 24. Generally speaking, a given source 22 may transmit data flows to multiple different destinations. Each flow is characterized by a class of service (CoS), which defines a priority level of the traffic between the source and destination of the flow. Typically, the CoS priority is defined in terms of guaranteed (CIR) and best-efforts (EIR) bandwidth allocations to the given CoS, which are commonly expressed in bits/sec (bps). Alternatively, bandwidth allocations may be defined for more than two categories of traffic per CoS, i.e., there may be one or more additional categories of bandwidth allocation per CoS besides CIR and EIR. The term "connection," as used in the present patent application and in the claims, is defined by the combination of a source node, a destination node and a CoS. In other words, one connection may carry multiple flows, and there may be multiple connections between a given pair of source and destination nodes. Connections may include, for example, a VLAN or a Layer 2 or Layer 3 tunnel, as are known in the art.
In the example shown in
A connection admission controller (CAC) 32 manages the bandwidth allocations to the connections passing through aggregator 28 and controls the aggregator accordingly. For this purpose, CAC 32 uses the CoS definitions that are input by the system operator, including the predefined CIR and EIR allocations and overbooking ratio for each category in each CoS. Based on the known throughput of system 20 (which is in this example dictated by the bandwidth of link 30) and the overbooking ratios, the CAC admits or rejects each request from one of sources 22 to establish a new connection. The CAC assigns the connections to queues in aggregator 28 (or is informed of the assignments by the entity responsible for making the assignments), and computes respective queue weights for the queues based on the assigned connections, as described hereinbelow.
Based on the classes of service of the connections that are assigned to each queue, the CAC calculates a respective weight 48 for each queue (labeled W1, W2, W3, . . . , in the figure). An exemplary method for weight calculation is described below with reference to
The bandwidth allocations for the new connection are specified, at an allocation step 62. Typically, each new connection is assigned to a certain CoS, according to which CAC 32 determines the bandwidth allocations and overbooking ratios for the connection. In the present example, it will be assumed that these allocations are expressed in terms of CIR(CoSj) and EIR(CoSj), wherein CoSj refers to the jth class of service, to which the given connection is assigned. The overbooking ratios of the CIR and EIR traffic in CoSj are expressed as OVBCIR(CoSj) and OVBEIR(COSj). Although OVBCIR is often set equal to 1 (no overbooking), we consider here the more general case in which CIR(CoSj) may be overbooked. Furthermore, although the present embodiment is described in terms of CIR and EIR, some or all of connections 40 may alternatively have more than two categories of bandwidth allocations, in addition to or instead of CIR and/or EIR. The method of
Based on the bandwidth allocations and overbooking ratios for the new connection added at step 60, CAC 32 computes the weight contribution of the connection, at a contribution computation step 64. The weight contribution for a given connection in CoSj is α(CoSj)CIR(CoSj)+β(CoSj)EIR(CoSj). Here α and β are bias coefficients for the CIR and EIR allocations, respectively. These coefficients typically depend on OVBCIR(CoSj) and OVBEIR(COSj), in such a way as to give greater weight to allocations that have smaller overbooking ratios, and vice versa. For example, it is possible to set α(CoSj)=1/OVBCIR(CoSj) and β(COSj)=1/OVBEIR(CoSj). Since OVBCIR is generally much less than OVBEIR, α will generally be much greater than β for any given CoS. Alternatively, the bias coefficients may have a different functional dependence on the overbooking ratios. In any case, CAC 32 is able to calculate these values automatically, without further user input.
For each queue i, CAC 32 calculates the queue weight Wi based on the individual weight contributions of the connections sharing the queue, at a queue weight computation step 66. Typically, the queue weight for a given queue is simply the sum of the weight contributions of the individual connections that share the queue:
W i=α(CoS 1)�ΣCIR(CoS 1)+β(CoS 1)�ΣEIR(CoS 1)+α(CoS 2)�ΣCIR(CoS 2)+β(CoS 2)�ΣEIR(CoS 2)+ . . . +α(CoS N)�ΣCIR(CoS N)+β(CoS N)�ΣEIR(CoS N) (1)
The summations in equation (1) are taken over all connections that share the same CoSj.
The above calculation assumes that CIR traffic and EIR traffic are aggregated together in the same queue for each connection. Alternatively, aggregator 28 may be configured to serve the guaranteed portion of the CIR traffic preferentially, before it serves the remaining CIR and EIR traffic. The guaranteed CIR bandwidth for CoSj is given by CIR(CoSj)/OVBCIR(COSj), so that the remainder of the CIR bandwidth, to be handled by fair scheduling of aggregator 28, is CIR(CoSj)[1−1/OVBCIR(CoSj)]. In this case, the weights determined by CAC 32 at steps 62 and 64 are applied only to the CIR remainder bandwidth and to the EIR bandwidth. Therefore, the weight contributions of the individual connections are now given by α(CoSj)CIR(CoSj)[1−1/OVBCIR(CoSj)]+β(CoSj)EIR(CoSj), and the queue weights are given by:
W i=α(CoS 1)�ΣCIR(CoS 1)[1−1/OVB CIR(CoS 1)]+β(CoS 1)�ΣEIR(CoS 1)+α(CoS 2)�ΣCIR(CoS 2)[1−1/OVB CIR(CoS 2)]+β(CoS 2)�ΣEIR(CoS 2)+ . . . +α(CoS N)�ΣCIR(CoS N)[1−1/OVB CIR(CoS N)]+β(CoS N)�ΣEIR(CoS N) (2)
The bias coefficients α and β may be calculated as described above. Of course, if the CIR allocations are not overbooked at all (OVBCIR=1), then the CIR terms drop out of equation (2).
Alternatively, we may write α′(CoSj)=α(CoSj)[1−1/OVBCIR(CoSj)]. Using this identity, equation (2) reduces to the same form as equation (1):
W i=α′(CoS 1)�ΣCIR(CoS 1)+β(CoS 1)�ΣEIR(CoS 1)+α′(CoS 2)�ΣCIR(CoS 2)+β(CoS 2)�ΣEIR(CoS 2)+ . . . +α′(CoS N)�ΣCIR(CoS N)+β(CoS N)�ΣEIR(CoS N) (3)
If the CIR is not overbooked, α′=α, so that equation (3) is simply a more general form of equation (1).
The results of equation (1) or (2) above generally have the form of floating-point numbers. Switch 50, however, typically comprises a hardware component, which is controlled by fixed-point (integer) weight values stored in control registers. Therefore, CAC 32 normalizes the weights calculated at step 66 in order to generate scheduling weights 48, at a weight normalization step 68. In one embodiment, a simple linear conversion is used:
W i(Integer)=INT{W i(Float)*MaxWeight(Integer)/MaxWeight(Float)} (4)
Here MaxWeight(Integer) is the largest integer that the weight registers of switch 50 can hold (typically given by 2RegisterSize), while MaxWeight (Float) is the maximum of Wi(Float) taken over all of queues 42, 44, 46 . . . .
Alternatively, a non-linear mapping may be used at step 68 in order to provide better weight resolution over the available integer range. For example, a histogram equalization procedure may be used to spread the normalized weights evenly over the available integer range. Alternatively or additionally, an arctangent or log function may be used to provide a relatively greater share of the available link bandwidth to queues with low floating-point weights. Other mapping schemes will be apparent to those skilled in the art.
The normalized weights are loaded into the control registers of switch 50, which applies the weights in multiplexing among queues 42, 44, 46, . . . , at a multiplexing step 70.
Although for the sake of simplicity, the embodiments described above relate only to allocation of bandwidth and multiplexing of traffic on a single shared link, the principles of the present invention may similarly be applied in more complex network topologies, and in fair sharing of access to other system resources. It will thus be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.
|Cited Patent
|Filing date
|Publication date
|Jun 7, 1994
|Oct 24, 1995
|International Business Machines Corporation
|Quality of service management for source routing multimedia packet networks
|Feb 16, 1996
|Feb 1, 2000
|Lucent Technologies, Inc.
|Management of ATM virtual circuits with resources reservation protocol
|Jun 24, 1997
|Dec 5, 2000
|Alcatel Networks Corporation
|Adaptive service weight assignments for ATM scheduling
|Mar 2, 1998
|Jan 23, 2001
|Lucent Technologies Inc.
|Available bit rate flow control algorithms for ATM networks
|Aug 10, 1998
|Mar 19, 2002
|Massachusetts Institute Of Technology
|Method for scheduling transmissions in a buffered switch
|Jun 29, 1998
|Apr 9, 2002
|Cisco Technology, Inc.
|Method and system for shortcut trunking of LAN bridges
|Apr 1, 1997
|Jun 4, 2002
|Cisco Technology, Inc.
|Method and system for minimizing the connection set up time in high speed packet switching networks
|Jan 31, 2000
|Jun 24, 2003
|Cisco Technology, Inc.
|Configurable serial interconnection
|Jun 12, 1998
|Nov 11, 2003
|Ibm Corporation
|Method and system for sharing reserved bandwidth between several dependent connections in high speed packet switching networks
|Nov 30, 1999
|Jan 13, 2004
|Cisc Technology, Inc.
|Fast convergence with topology switching
|Aug 1, 2000
|Jun 29, 2004
|Self-configuring communication network
|Apr 26, 2000
|Sep 21, 2004
|Nortel Networks Limited
|Data network having enhanced availability of extra traffic
|Mar 31, 1999
|Oct 5, 2004
|Cisco Technology, Inc.
|Method and apparatus for providing fast spanning tree re-starts
|Dec 19, 2000
|Nov 30, 2004
|Nortel Networks Limited
|Method and apparatus for aggregate flow control in a differentiated services network
|Mar 1, 2001
|Nov 30, 2004
|Onfiber Communications, Inc.
|Broadband tree-configured ring for metropolitan area networks
|Mar 22, 2001
|Jul 26, 2005
|Fujitsu Limited
|Communication apparatus with selective route optimization capabilities
|Nov 12, 2003
|Aug 23, 2005
|At&T Corp
|Apparatus and method for designing a network
|Apr 16, 2004
|Jun 20, 2006
|Lucent Technologies Inc.
|Managing congestion and traffic flow by considering the minimization of link utilization values
|Oct 5, 2001
|Aug 15, 2006
|Nortel Networks Limited
|Resource management in heterogenous QoS-based packet Networks
|Jul 5, 2002
|Mar 27, 2007
|Atrica Israel Ltd.
|End-to-end notification of local protection using OAM protocol
|Mar 22, 2001
|Oct 4, 2001
|Kensaku Amou
|Method and apparatus for packet scheduling in network
|Dec 27, 2000
|Oct 18, 2001
|Nortel Networks Limited
|Method, device and software for ensuring path diversity across a communications network
|Feb 26, 2001
|Nov 7, 2002
|Seabridge Ltd.
|Queue control method and system
|Mar 20, 2001
|Nov 28, 2002
|Seabridge, Ltd.
|Traffic control method and system
|May 31, 2001
|Dec 12, 2002
|Baoxin Li
|Image background replacement method
|May 24, 2001
|Jan 2, 2003
|International Business Machines Corporation
|System and method for enhancing the availability of routing systems through equal cost multipath
|Sep 17, 2001
|Mar 20, 2003
|Deepak Kakadia
|Method and apparatus for automatic quality of service configuration based on traffic flow and other network parameters
|Jan 31, 2003
|Aug 7, 2003
|Nec Corporation
|Path establishment method for establishing paths of different fault recovery types in a communications network
|Mar 28, 2002
|Oct 2, 2003
|Sudhakar Ganti
|Label distribution protocol supporting multiple classes of service in a multi protocol label switching (MPLS) network, methods and MPLS network using thereof
|Nov 12, 2001
|Apr 15, 2004
|Daniel Bauer
|Costs in data networks
|Oct 28, 2003
|May 6, 2004
|Janne Vaananen
|Method and apparatus for scheduling available link bandwidth between packet-switched data flows
|Dec 6, 2002
|Jun 10, 2004
|Packetlight Networks, Ltd.
|Fast protection for TDM and data services
|Office Action dated Mar. 21, 2006 for U.S. Appl. No. 10/128,454.
|Office Action dated Sep. 15, 2004, for related U.S. Appl. No. 09/794,898, filed Feb. 26, 2001, 10 pages.
|U.S. Appl. No. 10/054,845, filed Jan. 2002, Katz.
|Citing Patent
|Filing date
|Publication date
|Jan 5, 2009
|Mar 29, 2011
|Corrigent Systems Ltd.
|Ring network aggregate rates
|Feb 12, 2008
|Oct 4, 2011
|Alcatel Lucent
|Method and apparatus for marking and scheduling packets for transmission
|Nov 7, 2005
|Jun 11, 2013
|Fujitsu Limited
|Bandwidth control method and transmission equipment
|Nov 9, 2006
|May 20, 2014
|Broadcom Corporation
|Scheduling of data transmission with minimum and maximum shaping of flows in a network device
|Nov 7, 2005
|Mar 1, 2007
|Fujitsu Limited
|Bandwidth control method and transmission equipment
|Nov 9, 2006
|May 10, 2007
|Broadcom Corporation
|Scheduling of data transmission with minimum and maximum shaping of flows in a network device
|Feb 12, 2008
|Aug 13, 2009
|Joseph Roy Cote
|Method and apparatus for marking and scheduling packets for transmission
|Jan 5, 2009
|Jul 8, 2010
|Corrigent Systems Ltd.
|Ring network aggregate rates
|Oct 1, 2010
|Apr 7, 2011
|Fujitsu Limited
|Communication apparatus and communication control method
|U.S. Classification
|370/412, 370/468
|International Classification
|Cooperative Classification
|European Classification
|Jun 3, 2004
Owner name: CORRIGENT SYSTEMS LTD., ISRAEL
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BRUCKMAN, LEON;MOR, GAL;REEL/FRAME:015444/0178
Effective date: 20040524
|Feb 22, 2012
|Fee payment
Year of fee payment: 4
|Mar 18, 2013
Owner name: HUDSON BAY IP OPPORTUNITIES MASTER FUND, LP, NEW Y
Free format text: SECURITY AGREEMENT;ASSIGNOR:ORCKIT-CORRIGENT LTD.;REEL/FRAME:030033/0774
Effective date: 20130318
|Jul 26, 2013
Owner name: ORCKIT-CORRIGENT LTD., ISRAEL
Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:HUDSON BAY IP OPPORTUNITIES MASTER FUND LP;REEL/FRAME:030887/0983
Effective date: 20130723
|Apr 1, 2014
Owner name: ORCKIT-CORRIGENT LTD, ISRAEL
Free format text: CHANGE OF NAME;ASSIGNOR:CORRIGENT SYSTEMS LTD.;REEL/FRAME:032579/0201
Effective date: 20090906
|Apr 8, 2016
|Maintenance fee reminder mailed
|Apr 20, 2016
|Fee payment
Year of fee payment: 8
|Apr 20, 2016
|Surcharge for late payment
Year of fee payment: 7
|May 10, 2016
Owner name: ORCKIT IP, LLC, DELAWARE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ORCKIT COMMUNICATION LTD.;ORCKIT-CORRIGENT LTD.;CORRIGENT SYSTEMS LTD.;REEL/FRAME:038529/0087
Effective date: 20160425


text:
The deadline to sign up for health insurance through New York's open marketplace was extended by five days, through Dec. 20, authorities said.
The deadline to enroll or renew a plan, which was originally today, was pushed back to accommodate for last month's "extreme winter weather," the NY State of Health said in a statement.
Western New York and other parts of the state were covered in several feet of snow, making it unsafe for people to attend in-person enrollment activities, according to the NY State of Health.
Nearly half of all people who enrolled in the open marketplace last year worked with someone in person.


text:
Conversation this morning with an old family friend called Fred who is having a large garage built onto his house.
'Morning, Fred, how's the work going?'
'It's not at the moment, everything has come to a grinding halt.'
'Oh, sorry to hear that, pal, what's gone wrong?'
'Owww, they've dragged the builder off to court.'
'That's bad news, what's the plan now?'
'No plan, just a delay, a long one by the look of it.'
'What's he bein' done for?'
'What are you talking about?'
'What's he up in court for, what's he done?'
'He hasn't done anything, you evil minded ba*****, he's on jury service!
'Come on, it's a reasonable assumption, if he's a friend of yours he's bound to be bent, a little iffy, a bit off the straight and narrow.'
'Weather's not too good, Fred, d'ya think we'll have rain…


text:
Supreme Court bans firecrackers in NCR to tackle pollution problem
Latest News »
New Delhi: The Supreme Court on Friday banned the manufacture and sale of firecrackers in the national capital region (NCR) to stem air pollution in Delhi and neighbouring towns.
A three-judge bench headed by T.S Thakur, Chief Justice of India, directed the Centre to suspend the licenses of firecracker manufacturers and sellers and not hand out fresh licenses till further orders from the court.
A report on harmful effects of materials used in manufacturing firecrackers was also sought from the Central Pollution Control Board (CPCB), to be submitted to the court within three months.
The court was hearing an application moved by three children after air pollution levels in Delhi reached dangerous levels after Diwali on 30 October. The petitioners sought stringent implementation of existing guidelines and new directives from the court to curb pollution.
Pollution reached hazardous levels in the national capital region (NCR) centred on Delhi in the days following Diwali. Post-harvest stubble burning by farmers in the surrounding states was partly blamed for the rise in pollution to 15 times the safe limit.
To tackle smog, the apex court ordered the centre and respective state governments to come up with an immediate plan to tackle the deteriorating air quality in Delhi. Alongside, the National Green Tribunal (NGT) banned all construction activity and shut down stone-crushing units and brick kilns for a week in the national capital region.


text:
"Emergency angioplasty 19th March 2016."
About: Castle Hill Hospital Castle Hill Hospital Cottingham HU16 5JQ
Posted via NHS Choices
I will never be able to thank the staff on the cardiac unit enough for saving my life.
The doctors, nurses and the lay staff for their expertise and kindness and the cleaning staff for keeping the whole area spotless and always with a smile.
The food was excellent including having semolina pudding which I hadn't had since leaving school sixty years ago-it was very good. Also, the staff, one member in particular was extremely kind to my husband when he was very stressed - thank you.
I hope I never have to go into hospital again but I would have no fear of being admitted to castle hill hospital cardiac unit.
Thank you all.
Response from Castle Hill Hospital about a year and a half ago
Thank you for taking the time to add your comments to the NHS Choices website.
It is always a pleasure to receive such positive feedback from patients and their families.
We will ensure your kind comments are shared with the Cardiac Unit.
If you need to discuss our services further, please do not hesitate to contact our Patient Advice & Liaison Service (PALS) on (01482) 623065 or email email@example.com.
Thank you once again for taking the time to provide us with your views on local NHS services.
Kind regards,
Patient Experience Department
Hull and East Yorkshire Hospitals NHS Trust.
- {{helpful}} {{helpful == 1 ? "person thinks" : "people think"}} this response is helpful
- Was this response helpful? Yes | No
Thank you for your feedback.
See more responses from Castle Hill Hospital


text:
The Walking Dead creator, Robert Kirkman, has been talking about Season 5 of the zompocalypse drama and promised that when the show returns, they're going to hit the ground running:
I think this show works best with a cycle or ramping up and ramping down, and lulling people into a sense of security and speeding things up and keeping them on guard. I will say that we definitely start this season in an up cycle, whereas last season we definitely started the season in a down cycle. So we're certainly changing things up in that respect and we're gonna kind of hit the ground running this season.
Season 4 ended on a massive cliffhanger, with Rick and the group captured and locked up by the flesh eaters at Terminus. It sounds like Season 5 is going to go off with a bang and we will get a resolution to the Termite question almost immediately. This is awesome news.
What will you do to pass the time until TWD returns?
(Source EW)
Comments Powered by Creators


text: Just needed some input, I am messing around with my server and want to get some live coding into my website. I've used HTML most of the time, a little java. That was a while ago though. So THESE days, what is the best coding language for putting a website together. I know C# and C++ at the moment(and HTML of course), but am training myself on a few others as well. Lemme know, this is just a spare time thing I am doing so my coding abilities don't waiver before I start my next coding class! lol


text:
". . . what I am is a humanist before anything -- before I'm a Jew, before I'm black, before I'm a woman. And my beliefs are for the human race -- they don't exclude anyone."
Related quotes
"But what of black women? . . . I most sincerely doubt if any other race of women could have brought its fineness up through so devilish a fire."
"Christianity stands for freedom, we don't want to impose our religion on everyone else. We just don't want secular humanist values or homosexual values to be forced upon us under the guise of anti-harassment laws, speech codes, hate crime laws, or sensitivity training."
"It is clear that Nature created everything , not an Intelligent designer . The reason is because nature governs everything , including TIME and SPACE . Any concious God cannot play any role in the story of the universe without nature . Nature , the God of harmony pawns the personal God."
"It does not matter to the killers if their victims are Christian or Muslim, Hindu or Humanist; what matters is that they show that they can kill where they please,"
"If you said that Wendy was a feminist, she would say, 'I'm a humanist.' That (line)'s actually in The Heidi Chronicles . ... She managed to write from a very specific point of view for a very wide audience. And she had a wide variety of interests; she was committed in many areas."
"While the capture is important on a humanistic level for the market, after reacting to it overnight, we're back to the usual focus: earnings and the economy."


text:
Keep your eyes open
Singapore, the city-state run pretty much as a family business, is to record the iris scans of its citizens as part of a national identity registry that will include permanent residents. Citizenship of Singapore, given the privileges living there offers and its low tax rate, is considered an asset worth having, and the iris scans, along with fingerprinting and photographs, will be used as just another element in identifying people, as a way of improving security. The exercise will be carried out not just at identity card offices, but will also involve staff at post offices.
The United Arab Emirates has been using a similar iris scan system at its border controls. At present, the system is used at 16 entry points from land, air and sea, and processes the arrival of more than 6,500 travelers every day who are cross-checked with a database of 420,000 IrisCodes of people who have been expelled for a range of crimes and who tried to re-enter the country using false papers. The system is virtually fool proof.
In India, scans of both irises, along with ten fingerprints and a photograph are archived in Aadhaar, the national identity system.
Consideration and perception of technology as mature is increasingly clear, so that along with its lack of intrusiveness, its ease of use and balance between advantages and shortcomings, means that its use, without doubt, will increase.
From science fiction to everyday use, in a blink. So now you know, keep your eyes open. An iris scanner is looking at you.
(En español, aquí)


text:
Scotland Yard have been called in to help find missing RAF airman
SPECIALIST officers from Scotland Yard have been called in to try to solve the riddle of how an RAF airman vanished after a night out.
Scotland Yard have been called in to help find missing RAF airman who went missing after a night out
They have been asked to examine more than 1,000 hours of CCTV footage for clues to Corrie McKeague's disappearance in Bury St Edmunds, Suffolk.
The footage has already been scoured by local police but it is hoped the Yard officers may be able to spot the 23-year-old gunner from nearby RAF Honington.
He was last seen in the early hours of Saturday, September 24, after going to a nightclub and then buying a takeaway pizza.
His mother, Nicola Urquhart, believes Corrie may have got into a vehicle in a poorly-lit area behind a Superdrug store near the Grapes pub.
She said: "At 3.25am he evaporated. That is impossible. There is no sighting of him anywhere. He had never tried to walk home before. It's more likely that he left in a vehicle."
Between 3am and 4am it was busy in the town with revellers heading homewards and vehicles arriving to set up the Saturday market.
Corrie McKeague was last seen in the early hours of September 24, after going to a nightclub
Young people could provide all sorts of information and they don't necessarily pass it on to the police
Some of these vehicles have yet to be traced.
Officers have also examined a fire exit used by Superdrug to see if Corrie went up there to sleep on the roof.
They have taken away CCTV footage from a camera on the Moyse's Hall museum next door.
Analysis of the footage does not show Corrie, but the camera does not cover the whole roof area, which has been used by vagrants in the past.
Mrs Urquhart has also visited West Suffolk College, which is based in Bury, to urge students who may have been in the town centre that night to come forward.
She said any of the 4,000 students at the college "may not have seen Corrie but they might have seen somebody suspicious, something that didn't feel right".
Police are searching for the 23-year-old gunner from nearby RAF Honington
Mrs Urquhart appealed for anyone out that night, who may have seen somebody cruising around in a car but has not come forward because they didn't see Corrie, to contact police.
Or she said they may have been in a pub and someone made them feel uncomfortable.
"People might not realise what they know," she said.
"Young people could provide all sorts of information and they don't necessarily pass it on to the police.
"They may have heard something from a friend or experienced something suspicious themselves.
"The only way I will ever find Corrie is when somebody comes forward with a bit of information that they don't realise is important."


text:
Making a trip to the gym for the sake of it will have no effect on your life. If you plan to make your gym schedule worth it, you should make sure that those many hours spent working out does not go in vain.
Before heading to the gym, drink enough water to gain a lot of energy. Water has properties that helps your metabolic rate to increase, thus providing your body with more energy and fuel to burn out.
It is also necessary to eat a well-balanced meal before you check in to the gym.
Eating the right amount of proteins and vitamins will help your body to build muscle and, simultaneously, help to get off the fat thriving in the body.
Mentioned below are some of the things that you need to look in to assure that your workout has been a successful one. One of the common signs that you have had a good workout session is the sweat.
If you sweat it out at the gym, it is sure that you have lost at least some certain amount of unwanted weight. Do note that an average person sweats between 0.8 and 1.4 litres in 60 minutes of working out.
So, the next time you workout, keep that body moving for at least an hour.
To also make sure that you have had an awesome workout, here are some of the things that you need to keep in mind. Have a look:
You Sleep With Ease:
You tend to sleep much better after a workout, and this has to do with the hormones and cytokines that get released during a workout session, which is a positive sign that your workout was a good one.
You Sweat It Out:
Sweating it out at the gym is a must. If you don't sweat while working out, your workout is a complete waste of time. It is also necessary to drink a lot of water before a workout, since the body needs an ample amount of energy to perform exercises, and this energy is derived from H2O.
Your Energy Increases:
When you notice that your energy level has increased, it is only a sign that your workout has paid off well. An increased energy is a good sign and will only help you to stay active and healthier in the longer run.
Increased Hunger:
If you are underweight, this is a positive sign that you have been doing a good workout. However, if you are obese and trying to cut down on the calories, make sure you choose wise and healthy snacks when those hunger pangs increase.
You Start To Lose Weight:
Weight loss is another sign to show that your workout has been a major success. If you are losing weight, stick to that diet and your scheduled exercise.
Excess blood gets pumped to the muscles when you just finish your workout session to bring in more oxygen and nutrients to these muscles, thus making them look larger and bulky. If you notice your muscles look temporarily swollen, it is a sign that you have had a good workout.


text:
VideoHive Vortex Logo 39254
After Effects Project Files \ Titles \ Abstract
Vortex Logo AE CS3 Project File 39254 by flashato @ VideoHive
After Effects Project Files \ Titles \ Abstract
After Effects Version: CS3 File Size: 8mb Resolution: 1920x1080
Animated intro of your logo, fractured in 3D space. Organic lines and particles will create a fusion of your final logo. Work with logo with A/Channel. Video help show how to match the final glow l line with the shape of your logo in order to fine tune the animation with your logo shape.


text:
Search Penn Medicine
Ines C. Lin, M.D.
Plastic Surgery
Administrative Office:
Perelman Center for Advanced Medicine
South Pavilion - 14th Floor
3400 Civic Center Boulevard
Philadelphia, PA 19104
Administrative Assistant: Amanda Loughery
Administrative Telephone: 215-662-4283
Administrative Fax: 215-615-0474
Clinical Office:
Perelman Center for Advanced Medicine
Center for Human Appearance
South Pavilion 1st Floor
3400 Civic Center Boulevard
Philadelphia, PA 19104
Clinical Telephone: 215-662-4283
Clinical Fax: 215-615-0474
Patient Appointments: 215-662-7300
Contact Information (internal use only)
Dr. Lin received her medical degree from the University of Pennsylvania. She continued her medical training in the combined general surgery and plastic surgery residency program at the Hospital of the University of Pennsylvania. She also completed a fellowship in hand surgery at the Mayo Clinic in Rochester, Minnesota, where she was awarded the Alice D. Jensen Fellowship in Hand Surgery Honoring Dr. Julian Bruner. Her clinical interests include hand and upper extremity surgery and reconstructive surgery in adult and pediatric patients.


text:
Super Administrator
Hello. Please refer here http://www.satechhelp.co.za/4644/Reset-Vodafone-Protect-Pin-Online-South-Africa for a solution. A hard reset should be considered if the above did not help. You will reply below for further assistance.
Signature: NOTE: SA-Tech Help is a third party not directly affiliated with any company for which we offer support
Get access to your account and question


text:
American beauty businessperson Tammy Rivera has a net worth that is estimated of $200,000. Check out her wiki, real height and age with source of earning details. She is also a reality star, fashion designer and a stylist was born in 1985 in Virginia. She grew up in Baltimore, United states and relocated to Georgia. She is famous for her Instagram account with over 2.3 million followers, 2 million in twitter and Facebook page with 246637 likes. She regularly posts pictures and daily social activities.
|Tammy Rivera Net Worth
|$200 Thousand
|Full Name
|Tammy Rivera
|Source of Income
|Monthly Income
|Weekly Income
|Daily Income
Net Worth – $200 Thousand
Full Name: Tammy Rivera
Annual Salary: $20,000
Birth Date
3rd of July 1986
Ethnicity: African American
Height & Weight
1.70 m / 5.6 feet
Husband: Waka Flocka Flame
Ex Boyfriend: N/A
Tammy rose to fame in the hit TV reality show aired in VH-1, Love & Hip Hop: Atlanta for which she was signed for $ 2.5 million in season 3. In the show, things got heated up between co-star Betty Idol and Tammy while discussing about her clothing line. It's believed that Idol has a personal grudge against Tammy as she is dating Tammy's best friend Bambi's ex, Scrappy, who is trying to patch up things. Things got complicated henceforth.
Also check: Amy Childs and Kat Von D's earning details.
Tammy has a 12 year old daughter from a previous marriage, named Charlie who is dyslexic and was center of cyber bullying. Tammy remarried the famous rapper Waka Flocka Flame in 2014 after much disputes and hurdles. According to Tammy, Waka had transformed from a wild carefree boy to a responsible mature man through their relationship and that she believed in God to make things happen with her love of her life Waka! They eloped for a quiet marriage and got engaged in a very unique way by getting name tattoos done on their ring fingers. In an interview she stated that she feels lonely most of the time as husband Waka is out on a tour for shows.
Before the TV show, she owned a high-end clothing store named T. Rivera, meant for the figure conscious section of women. Currently she keeps herself busy by designing, styling, hosting the show and replying to her followers and fans.


text:
Another publisher steps in. Simon & Schuster is launching its own science fiction imprint, overseen by Children's Publishing EVP Jon Anderson and Young Readers VP Justin Chandra. But the imprint, edited by current literary agent Joe Monti, will publish "YA and above."
Lawsuit Filed Against Apple and Book Publishers Over Illegal Ebook Price Fixing
Anything's possible when people club together—just look at the UK riots as a really bad example of that. Class-action law firm Hagens Berman's seeking more plaintiffs for its lawsuit against Apple and five publishers over illegal ebook price-fixing.
Self-Published Kindle Author Lands Deal in Obsolete Ink-and-Paper Format
Author Boyd Morrison wrote and uploaded a book called The Ark, pictured, to Kindle, and found such success that he has now signed a two book deal with Simon and Schuster in that weird, dying papery format your grandparents like.


text:
Lowongan General/Cost Accounting | Lowongan Basic Accounting/Bookkeeping/Accounts Executive | Lowongan Retail / Merchandise
PT Citra Bonang
PT. Citra Bonang is a holding company with broad lines of business operated in its respective business units. Our business is processed through our expertise in chemical manufacturing, services and trading. Our business partners are both local and foreign investors through legal formalities of PMDN – Domestic Investment and PMA – Foreign Investment Permits.
Junior Accountant
Jakarta Raya, Jawa Barat, Jawa Tengah, Jawa Timur
- Reconcile or note and report discrepancies found in records.
- Receive, record, and bank cash, checks, and vouchers;
- Operate computers programmed with accounting software to record, store, and analyze information;
- Operate 10-key calculators, typewriters, and copy machines to perform calculations and produce documents;
- Debit, credit, and total accounts on computer spreadsheets and databases, using specialized accounting software;
- Comply with company policies, procedures, and regulations;
- Compile statistical, financial, accounting or auditing reports and tables pertaining to such matters as cash receipts, expenditures, accounts payable and receivable, and profits and losses;
- Code documents according to company procedures;
- Classify, record, and summarize numerical and financial data to compile and keep financial records, using journals and ledgers or computers;
- Check figures, postings, and documents for correct entry, mathematical accuracy, and proper codes;
- Integrity — Job requires being honest and ethical.
- 2 Full-Time position(s) available.
- Preferably Staff (non-management & non-supervisor)s specializing in Finance - General/Cost Accounting or equivalent.
- At least 2 year(s) of working experience in the related field is required for this position.
- Candidate must possess at least a Diploma, Bachelor's Degree, Economics, Finance/Accountancy/Banking or equivalent.
- Attention to Detail — Job requires being careful about detail and thorough in completing work tasks.
- Cooperation — Job requires being pleasant with others on the job and displaying a good-natured, cooperative ttitude.
- Independence — Job requires developing one's own ways of doing things, guiding oneself with little or no supervision, and depending on oneself to get things done.
- Dependability — Job requires being reliable, responsible, and dependable, and fulfilling obligations.
|Lowongan Kerja Lainnya:


text:
Results 1 to 5 of 5
01-20-04, 18:55 #1Registered User
- Join Date
- Jan 2004
- Posts
- 9
Unanswered: Associative Arrays...How are they managed?
Hi I have a question about how the associative arrays(table data structure in pl/sql) are managed by oracle. Does Oracle keep the data in memory and start paging it to disk once they reach a certain size or does it keep certain amount in memory and use some temporary table to which it insert and retrieve data as and when needed.
This is important to me as I feel that I may end up putting a lot of data in the associative arrays and I know for certain that paging is really slow.
Thanks for your insight..
Last edited by sumit192; 01-20-04 at 21:02.
01-20-04, 21:55 #2Registered User
Provided Answers: 1
- Join Date
- Aug 2003
- Location
- Where the Surf Meets the Turf @Del Mar, CA
- Posts
- 7,776
Why bother posting your question because
"I know for certain that paging is really slow."
Yes, going to disk is slow.
Oracle tables are on disk.
OS pages to disk.
If/when you don't have enough RAM, response will be slow.
So what exactly is your question?
01-21-04, 07:34 #3Registered User
- Join Date
- Aug 2001
- Posts
- 66
Question is about associative arrays not relational tables (already answered on OTN, btw) and is a pertinent question IMHO.
Associative arrays are stored in memory in the PGA (program global area). Exactly how much memory is available will depend on the individual setup - you can check the memory used by your session in v$mystat (or that of other sessions in v$sesstat etc.) e.g.
SQL> SELECT n.name, s.value
2 FROM v$statname n, v$mystat s
3 WHERE s.statistic# = n.statistic#
4 AND n.name LIKE '%session pga%';
---------------------------------------------------------------- ----------
session pga memory 552952
session pga memory max 1011704
Using relatively large amounts of memory in an associative array (and hence session) is typically unscaleable, i.e. this approach is not likely to work effectively across multiple concurrent sessions because of the combined memory requirements.
The good news is that there are excellent alternatives in in PL/SQL (BULK COLLECT with LIMIT or pipelined functions) and in SQL (global temporary tables) that can provide effective throughput without large memory requirements and hence are eminently more scaleable.Padderz
SYSOP, Quest Software / RevealNet Labs PL/SQL Pipeline
01-21-04, 14:30 #4Registered User
- Join Date
- Jan 2004
- Posts
- 9
The reason why I had asked this question was :
1: I am new to using PL/SQL
2: I am trying to retrieve data that could exceed a billion rows by the end of this year and I have to perform some analysis on that data. Now I was told that Oracle handles the memory management of the PL/SQL associative arrays(A false notion that was corrected thanks to padderz and some other people on the OTN network).
My way of going about handling the problem would be to retain a certain amount of data in memory(assiciative array) and the rest in a temporary table and fetch the data back from the temporary table when the associateive array becomes empty. I will need to look into BULK COLLECT and the pipelining functions just to see if they can handle a model similar to what I have in mind.
If any of you could suggest an alternative or provide a code snippet it would be great.
Padderz thank you for your help,
Last edited by sumit192; 01-21-04 at 16:16.
01-21-04, 16:06 #5Registered User
Provided Answers: 1
- Join Date
- Aug 2003
- Location
- Where the Surf Meets the Turf @Del Mar, CA
- Posts
- 7,776
Every modern OS implements virtual memory model.
The result is data will either reside in memory (RAM) or on disk;
because there is no place else for it to maintain any sort of permanence.
If/when the size/amount of data exceeds the "available RAM", it must
end up on disk or an error gets thrown saying "No More Space Available"
In some case the decision is made by the programmer by explicitly inserting data into a table. In other cases the programmer can use a "memory resident" data structure such a PL/SQL table or temporary global table expect Oracle/OS to manage when it "overflows" to disk.
Accessing disk is 2 - 3 (or more) orders of magnitude slower than
accessing RAM. When memory is depleted, you pay the price!


text:
Wed Jul 28, 1:24 pm ET
BERLIN (AFP) – Berlin police said Wednesday they impounded a clapped-out Latvian tour bus with 1.8 million kilometres (1.1 million miles) behind it -- enough to go to the Moon and back twice, and then back to Latvia.
Police pulled over the white double-decker on Tuesday afternoon and found, apart from the massive mileage, an unroadworthy rust bucket with dangerously worn tyres, faulty brakes and a cracked windscreen.
The odometer, which runs to 999,999 kilometres, had already gone around once, a police spokesman told AFP.
"It wasn't even particularly old," he said. "From its shape it looked pretty modern."
The bus driver and the 67 Latvian tourists on board, who were on their way to Switzerland via the German capital, were told to find alternative means of transport.
- Log in to post comments


text:
|Publication number
|Publication type
|Application number
|Publication date
|Aug 15, 1989
|Filing date
|Apr 4, 1988
|Priority date
|Apr 4, 1988
|Fee status
|Also published as
|Publication number
|Richard A. Jackson, Peter D. Symes, Richard S. Bannister, Thomas A. Grancey, Richard A. Frasier, John Abt, Ronnie D. Barnett, James E. Blecksmith, Kevin D. Windrem, Neil R. Olmstead
|Original Assignee
|Jackson Richard A, Symes Peter D, Bannister Richard S, Grancey Thomas A, Frasier Richard A, John Abt, Barnett Ronnie D, Blecksmith James E, Windrem Kevin D, Olmstead Neil R
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (3), Referenced by (45), Classifications (6), Legal Events (7)
|External Links: USPTO, USPTO Assignment, Espacenet
This invention relates to a video switcher system with modular architecture.
FIG. 1 illustrates a conventional video mixing system, or switcher, in simplified block form. The FIG. 1 switcher comprises a source selector 2 which receives multiple video input signals, e.g. from external video signal sources, and provides selected ones of these input signals to mix/effects amplifiers (M/Es) 4. Each M/E receives at least two video input signals and combines them under control of signals provided by an operator interface 6 to provide on output video signal. The output signal provided by any of the M/Es 4 can be re-entered into another M/E through re-entry terminals 8 of the source selector 2. The output signal of the FIG. 1 switcher is taken from a reduced function program/preset M/E 10.
Conventional switchers are fixed in their architecture at the time of manufacture, and accordingly the number of source selector inputs, the number of M/Es and the type and capabilities of each M/E cannot be changed. Therefore, in order to upgrade the switcher capability of a television studio, it has previously been necessary to replace the entire swticher. A user with limited resources might not be able to afford to replace his switcher. A user with greater resources will generally buy a switcher whose capabilities are limited only by the maximum anticipated requirements over the lifetime of the studio in which it is installed, and therefore the switcher will be under utilized much of the time. Since the functional components of one switcher cannot be shared with another switcher, a production facility with two or more studios may find itself handling simultaneously one production that is too large for its largest switcher and another production that under utilizes the smallest available switcher.
A preferred video signal processing apparatus embodying the present invention in a first aspect comprises source selector means having a plurality of input terminals, for receiving a plurality of video signals respectively, and at least two output terminals. A set of video processors each have an input terminal and an output terminal, the output terminals of the source selector means being connected to respective video processor input terminals. Output router means have a plurality of input terminals connected to the output terminals of the video processors respectively and also have at least first and second output terminals. Control means are connected to the source selector means for selecting a first set of source selector output terminals, and thereby defining a first subset of video processors having input terminals connected to the first set of source selector output terminals, and also selecting a second set of source selector output terminals, and thereby defining a second subset of video processors having input terminals connected to the second set of source selector output terminals. The control means are also connected to the output router means for selecting at least one output terminal of the first subset of video processors and at least one output terminal of the second subset of video processors and connecting the selected terminals to the first and second output terminals respectively of the output router means.
A preferred video signal processing apparatus embodying the present invention in a second aspect comprises at least first and second source selectors each having a plurality of input terminals, for receiving a plurality of video signals respectively, and at least two output terminals. A set of video processors each have an input terminal and an output terminal. The apparatus further comprises a processor selector for connecting each source selector output terminal selectively to each video processor input terminal. First and second output devices each have a plurality of input terminals connected to the output terminals of the video processors respectively and also have an output terminal. Control means are connected to the processor selector for defining a first subset of video processors having their input terminals connected to the output terminals of the first source selector and a second subset of video processors having their input terminals connected to the output terminals of the second source selector. The control means are also connected to the first output device for selecting the output terminals of the first subset of video processors and to the second output device for selecting the output terminals of the second subset of video processors.
For a better understanding of the invention, and to show how the same may be carried into effect, reference will now be made, by way of example, to the accompanying drawings in which:
FIG. 1 is a block diagram of a conventional switcher,
FIG. 2 is a block diagram of a switcher system embodying the present invention.
FIG. 3 is a block diagram of a modification of the switcher system shown in FIG. 2, and
FIG. 4 is a block diagram of a modification of the switcher system shown in FIG. 3.
The switcher system illustrated in FIG. 2 is designed for use in common by multiple studios (Studio A, Studio B, etc.) in order to provide video mixing capabilities for all the studios. The switcher system comprises a source selector 20 and an operator interface 22 for each studio. Only the source selectors 20A and 20B and the operator interfaces 22A and 22B are shown in FIG. 2. The switcher system also comprises a pool of video processors 241, 242 . . . 24N. Normally, the number of video processors would be at least twice the number of studios, but there is no fixed assignment of the video processors to the studios. Each source selector is similar to that which is used in a conventional switcher, except that it must be large enough to apply an input video signal to any of the video processors. Each studio has its own source selector because different studios generally have access to different respective sets of video sources.
Each video processor 24 is an M/E or a video processing channel, for example of the kind described in co-pending Patent Application Ser. No. 07/157,675 filed Feb. 19, 1988, the disclosure of which is hereby incorporated by reference herein. The co-pending application describes a switcher architecture in which the processing channel includes a circuit for limiting a video signal received by the channel in at least one of the amplitude domain and the spatial domain, in order to effect dissolves and wipes. The processors may be of different types, offering different features. Associated with each video processor 24 is an input selector 26. The input selector 26 has multiple input terminals connected to output terminals of the source selectors 20 respectively, and a single output terminal, and is operative to connect an output terminal of any selected source selector to the associated video processor.
The switcher system further comprises a primary output router 28, a secondary output router 30 and a video combiner 32 for each studio. Each output router 28 and 30 has N input terminals, connected to the output terminals of the processors respectively. The primary output routers 28 each have multiple output terminals connected to respective input terminals of the corresponding combiner 32 and delivers selected video signals to the combiner 32, whereas the outputs of the corresponding secondary router are looped back to re-entry input terminals 34 of the source selector 20.
The combiner 32 of a given studio may have n input terminals, where n is the number of processors required in order to achieve what is foreseen to be the most complex video effect that will be produced by the studio. The combiner 32 is a parallel combiner and may be of the kind described in the above-mentioned co-pending application. The combiner 32 receives n video signals from the primary output router 28, combines them in dependence on priority signals received from the operator interface 22, and provides a single output video signal.
Each operator interface 22 communicates with the associated primary router 28 so that the primary output router selects the outputs of the processors 24 that are connected to the associated source selector 20, and each operator interface 22 communicates with the associated combiner 32 for determining the manner in which the signals received from the output router are combined.
In use of the switcher system illustrated in FIG. 2, each studio operator determines how many and what kind of video processors are required by his production, and employs his operator interface 22 to request assignment of appropriate video processors from the central pool. This is accomplished for each required processor by generating a signal that specifies the type of processor and applying this signal to the video processors sequentially until the signal is accepted. The signal can only be accepted by a video processor that is not already assigned and is of the specified type. The video processor that accepted the signal is thereby assigned to the selecting studio. When a video processor has been assigned to a studio, it responds to operating commands received from the operator interface of that studio. An assigned video processor continues to receive commands from the operator interfaces of studios to which it is not assigned, but it does not respond to those commands.
When a video processor accepts assignment to a studio, the studio's operator interface provides a signal to the input selector associated with that video processor indicating that the input selector should accept the video signal provided by the source selector of the studio to which it is assigned. The operator interface also provides a signal to the primary and secondary output routers 28 and 30 indicating that the accepting video processor is assigned to that studio and that the output routers should select the output signal provided by the video processor. When the required set of processors has been assigned, the switcher is put into operation. If at any time during the production the operator requires an additional video processor, he can request assignment of a processor of the required type, in the manner previously described. Similarly, the operator may relinquish an assignment of one or more processors and thereby make them available for assignment to other studios. While a processor is assigned to a given studio, it functions as a fixed part of that studio and cannot be used by any other studio until its assignment is relinquished and it is reassigned.
Each primary router 28 is operated in parallel with its secondary router 30. By applying appropriate control signals to the combiner, and adjusting the primary output router, the operator is able to determine which processor output signal is to be used as a re-entry, and by the parallel operation of the primary and secondary routers this signal is made available at one of the re-entry input terminals of the source selector. The operator then uses the source selector to connect this re-entry input terminal to the processor that is to receive the re-entered video signal.
The output routers used in the FIG. 2 switcher may be cross-point switches, or they may alternatively be implemented by selectively operating mixers in the output stages of the processors.
In the FIG. 3 modification of the FIG. 2 switcher system, the parallel combiners 32A, 32B etc. are not used. Instead, each video processor 24 includes not only a processing stage 36 but also a two-input combiner 38. The combiners 38 may be of the kind described in co-pending Patent Application Ser. No. 06/836,945, filed Mar. 6, 1986. The combiners 382 . . . 38N of the processors 242 . . . 24N each receive as one input the video signal generated by the processing stage 362 . . . 36N of that processor and has its other input connected to receive the output signal of the preceding processor 241 . . . 24N-1. The second input of the combiner of the first processor 241 is provided by the output of the last processor 24N. Each combiner has a terminal 42 at which it receives a priority signal from the operator interface to which the processor is assigned. The output signal of a combiner is a sum of the input signals received by the combiner, weighted in accordance with the priority signal, and constitutes the output signal of the processor. The output signals of the processors are applied to the output routers. Each primary router 28 selects only one processor; if a re-entry is desired, the secondary router selects a different processor from that selected by the primary router. Each combiner has a switch 40 in the signal path for receiving a video signal from another processor. When, for example, the operator of Studio A selects the processors 242 through 24J and the operator of Studio B selects processors 24K through 24N and 241, the switches 40 of the processors 242 and 24K are opened (rendered non-conductive) and the output routers for 28A and 28B select the processors 24J and 241 respectively.
The FIG. 3 switcher system is less versatile than that shown in FIG. 2, because it is limited to the sets of processors assigned to the studios respectively being in continuous blocks and not being interleaved. For example, if the processors 241 and 243 were required by Studio A but processor 242 was not required by Studio A, it would not be available for use by Studio B.
In the case of the FIG. 3 switcher system, re-entries are accomplished in the same fashion as described with reference to FIG. 2, using secondary output routers 30.
In the FIG. 4 switcher system, a single source selector 44 is used instead of the separate source selectors of the FIGS. 2 and 3 switcher systems. The source selector 44 has multiple input terminals connected to respective video sources and has multiple output terminals connected to the processors 24 respectively. Accordingly, any selected video source may be connected to any desired video processor. All video sources may be subject to selection by any of the operator interfaces, or alternatively each operator interface may be able to select only a subset of video sources. A single output router 46 has input terminals connected to the output terminals of the processors 24 respectively and has one program output terminal 48 assigned to each studio. The operator interfaces 22 act on the output router and determine which processors 24 have their output terminals connected to the terminals 48 respectively. In order to avoid the possibility of the operator of studio A, for example, attempting to cause the output router to connect the output terminal of a processor that is not assigned to studio A to the terminal 48A, the operator interfaces may be configured so that the interface of a given studio is able to select only the output terminal of one of the processors assigned to that signal for connection to the studio's program output terminal 48.
A secondary router 50 is operated in parallel with the router 46 for providing re-entries to the source selector 44.
It is not essential that a single output router be used in conjuction with a single source selector, as shown in FIG. 4, since multiple source selectors may be used in conjunction with a single output router or multiple output routers may be used in conjunction with a single source selector. Where a single output router is used, having a single program output terminal for each studio, the combining operation must take place upstream of the output router. However, where multiple output routers are used, the combining may take place either upstream of the routers, as in FIG. 3, or downstream, as in FIG. 2.
It will be appreciated that the present invention is not restricted to the particular embodiment that has been described and illustrated, and that variations may be made therein without departing from the scope of the invention as defined in the appended claims and equivalents thereof. For example, the invention is not limited to use of processing channels which operate on video signals in unary fashion. One or more of the processors might comprise an M/E which receives at least two video signals and operates on them in binary fashion. In this case, the input selector is capable of independently selecting at least two video signals for application to the M/E.
|Cited Patent
|Filing date
|Publication date
|Nov 5, 1980
|May 3, 1983
|Siemens Aktiengesellschaft
|Broad band switching system
|Aug 27, 1981
|Aug 30, 1983
|Bell Telephone Laboratories, Incorporated
|Wideband switching architecture
|Jan 14, 1987
|Aug 16, 1988
|Transimage International Limited
|Selection of video sources
|Citing Patent
|Filing date
|Publication date
|Oct 23, 1989
|Mar 24, 1992
|Esch Arthur G
|Video information delivery method and apparatus
|Oct 31, 1989
|Mar 24, 1992
|Cury Brian L
|Method and apparatus for producing customized video recordings
|Aug 15, 1991
|Sep 1, 1992
|Cury Brian L
|Method and apparatus for producing customized video recordings
|Nov 13, 1989
|Oct 20, 1992
|Sony Corporation
|Television signal equipment assignment matrix including passive switching
|Mar 28, 1991
|Nov 10, 1992
|Abekas Video Systems, Inc.
|Video processing system having improved internal switching capability
|Aug 7, 1990
|Jul 13, 1993
|Intelligent Resources Integrated Systems, Inc.
|Programmable digital video processing system
|Jul 29, 1991
|Aug 31, 1993
|Intelligent Resources Integrated Systems, Inc.
|Video display system providing for synchronization of multiple video data streams
|Sep 20, 1991
|Jan 25, 1994
|Avs Broadcast, Inc.
|Video signal processing system architecture
|Sep 10, 1991
|Feb 1, 1994
|Esch Arthur G
|Multiple media delivery network method and apparatus
|Apr 23, 1993
|Sep 13, 1994
|Rebo Research
|Video storage and synchronization
|Apr 16, 1993
|Aug 8, 1995
|Avid Technology, Inc.
|Method and user interface for creating, specifying and adjusting motion picture transitions
|Apr 19, 1994
|Jun 18, 1996
|Avid Technology, Inc.
|Method and apparatus for creating motion picture transitions according to non-linear light response
|Aug 7, 1995
|Mar 10, 1998
|Avid Technology, Inc.
|Method and user interface for creating, specifying and adjusting motion picture transitions
|Apr 1, 1997
|Aug 25, 1998
|Sony Corporation
|Apparatus for controlling a switcher and a special effects device
|Mar 1, 1995
|May 4, 1999
|Canon Kabushiki Kaisha
|Color generation and mixing device
|Aug 1, 1996
|Jul 20, 1999
|Sony Corporation
|Video signal editing apparatus in which multiple video clip edit frames are simultaneously displayed on one monitor
|Jul 28, 1997
|Aug 24, 1999
|Tektronix, Inc.
|Switcher using shared decompression processors for processing both broadband and compressed video data
|Mar 25, 1997
|Nov 9, 1999
|Echolab, Inc.
|Digital video switcher including a general purpose processor and a control processor
|Jun 12, 1997
|Jan 25, 2000
|Avid Technology, Inc.
|Media composer including pointer-based display of sequentially stored samples
|Dec 14, 1998
|Jul 18, 2000
|Avid Technology, Inc.
|Motion video processing circuit for capture, playback and manipulation of digital motion video information on a computer
|Jun 20, 1997
|Aug 15, 2000
|Avid Technology, Inc.
|Apparatus and method for controlling transfer of data between and processing of data by interconnected data processing elements
|Jan 15, 1998
|Sep 19, 2000
|Sony Corporation
|Video display apparatus and method for controlling the switching of external input terminals thereof
|Oct 18, 1997
|Mar 27, 2001
|Lucent Technologies, Inc.
|Channel responsive television input signal interface circuit and method
|Jun 30, 1997
|Mar 12, 2002
|Avid Technology, Inc.
|Media pipeline with multichannel video processing and playback
|Jul 29, 1999
|Jul 16, 2002
|Grass Valley (Us), Inc.
|Key priority for a mix/effect bank having multiple keyers
|Sep 6, 2005
|Sep 2, 2008
|Sony Corporation
|Image switching apparatus and method of controlling image processing unit thereof
|Apr 21, 2007
|Jul 13, 2010
|Utah Scientific, Inc.
|Video switching system utilizing a prioritized common network
|Aug 30, 2007
|Dec 10, 2013
|Gvbb Holdings S.A.R.L.
|Generation of video transitions on an auxiliary bus using a video switcher
|Mar 31, 2011
|Aug 26, 2014
|Sony Corporation
|Image processing apparatus, image processing method, and image processing system
|Sep 6, 2005
|Aug 16, 2007
|Humiki Higashi
|Image switching apparatus and method of controlling image processing unit thereof
|Apr 21, 2007
|Jan 24, 2008
|Tom Harmon
|Video switching system utilizing a prioritized common network
|Jun 28, 2007
|Apr 29, 2010
|David Alan Casper
|Dual use video mixer crosspoint matrix
|Aug 30, 2007
|Jul 22, 2010
|Thomson Licensing
|auxiliary bus transitions on a video switcher
|Mar 31, 2011
|Oct 13, 2011
|Masaaki Yamane
|Image processing apparatus, image processing method, and image processing system
|Apr 1, 2011
|Oct 12, 2011
|Image processing apparatus, image processing method, and image processing system
|Apr 7, 1994
|Nov 23, 1994
|Sony Corporation
|Editing apparatus
|Apr 7, 1994
|Jul 17, 1996
|Sony Corp
|Editing apparatus.
|Jul 21, 1998
|Feb 3, 1999
|Tektronix, Inc.
|TV switcher using shared processors
|Oct 31, 1995
|Nov 26, 2008
|Sony Corporation
|Recording and reproduction of video signals
|Sep 1, 2006
|Jul 4, 2007
|Sony Corporation
|Image switching appartus and method
|Nov 6, 1990
|Jun 13, 1991
|Intelligent Resources Integrated Systems, Inc.
|Enhanced digital video engine
|Nov 6, 1990
|Jul 11, 1991
|Intelligent Resources Integrat
|Enhanced digital video engine
|Sep 18, 1991
|Apr 2, 1992
|Avesco Plc
|Video signal processing system architecture
|Apr 18, 1994
|Oct 27, 1994
|Avid Technology, Inc.
|Method and user interface for creating, specifying and adjusting motion picture transitions
|Aug 30, 2007
|Mar 5, 2009
|Thomson Licensing
|Generation of video transitions on an auxiliary bus using a video switcher
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Apr 3, 1989
Owner name: GRASS VALLEY GROUP, INC., A CA CORP., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:JACKSON, RICHARD A.;SYMES, PETER D.;BANNISTER, RICHARD S.;AND OTHERS;REEL/FRAME:005036/0980;SIGNING DATES FROM 19880307 TO 19880318
|Jan 19, 1993
|Fee payment
Year of fee payment: 4
|Jan 16, 1997
|Fee payment
Year of fee payment: 8
|Oct 4, 1999
Owner name: GRASS VALLEY (US) INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TEKTRONIX, INC.;REEL/FRAME:010255/0310
Effective date: 19990924
Owner name: CONGRESS FINANCIAL CORPORATION (WESTERN), OREGON
Free format text: SECURITY AGREEMENT;ASSIGNOR:GRASS VALLEY (US) INC.;REEL/FRAME:010415/0156
Effective date: 19990924
|Oct 8, 1999
Owner name: TEKTRONIX, INC., AN OREGON CORPORATION, OREGON
Free format text: SECURITY INTEREST;ASSIGNOR:GRASS VALLEY GROUP INC.;REEL/FRAME:010288/0161
Effective date: 19990924
|Nov 5, 1999
Owner name: TEKTRONIX, INC., OREGON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:GRASS VALLEY GROUP, INC.;REEL/FRAME:010371/0404
Effective date: 19960120
|Jan 19, 2001
|Fee payment
Year of fee payment: 12