The definition of 'influential person' has been strengthened in the legislation to enable the QBCC to take action against persons who control or substantially influence a company's conduct but is not the director or secretary. This will enable QBCC to ban these persons when the construction company goes bankrupt or has its build licence revoked from holding a QBCC licence or running another company in the future. Sometimes these influential people are known as shadow directors and distance themselves from responsibilities if things go wrong. For example, a person may appoint their spouse as the director of a company and effectively run the company through their spouse, without officially being an officer of the company.
Section 56AC has been amended so that a person will be considered an 'excluded individual' if they were, within the period of two years immediately before a relevant company event happened, a director or secretary of, or an influential person for a construction company. Previously the timeframe was one year. If someone is deemed to be an 'excluded individual' they cannot hold a licence for 3 years from when the relevant event occurred. If that person than has a subsequent relevant event occur, they will be deemed to be a 'permanently excluded individual' and will face a lifetime exclusion period.
The section also amends the definition of 'construction company' to mean a company that directly or indirectly carries out building work or building work services in Queensland or another State. The amendment ensures that a construction company, as defined, includes a company operating outside of Queensland.


Thousands in Russia, Ukraine, and Belarus got together to celebrate 1,030 years since their ancestors adopted Christianity, when Vladimir the Great baptized the Kievan Rus.
At noon, the bells in all of Orthodox Cathedrals in Moscow began ringing to mark the holiday. A sacred procession was attended by thousands of worshipers despite the heat of over 30 degrees Celsius in the capital.
The head of the Russian Orthodox Church, Patriarch Kirill, and Russian President, Vladimir Putin, walked together with the people all the way to the monument to Vladimir the Great, where a divine liturgy was held.
Putin congratulated attendees on the holiday, saying that what happened 1,030 years ago was an "event of a civilizational scale" that affected the history of not only Russia, but the whole world.
The sacred procession organized for the holiday by the Ukrainian Orthodox Church in Kiev has gathered more than 65,000 people, according to the Interior Ministry.
The celebrations here were also centered around the monument to the baptizer Vladimir the Great, with church leaders, country's President Petro Poroshenko and government ministers taking part.
Celebratory services were also held in all of the cathedrals of Belarus. Metropolitan Paul, the leader of the Belarusian Orthodox Church, led the service at the Church of the Holy Prince Vladimir in Minsk, during which he read out an address from Russian Patriarch Kirill.
The Holy Trinity Cathedral in Jerusalem held a special liturgy and prayer dedicated to the anniversary of the baptism of the Kievan Rus. The church was founded in 1847 to represent the Russian Orthodox Church to the Jerusalemite Patriarchate and assisting Russian pilgrims arriving in the Holy Land.
The Russian community in Bulgaria also celebrated the Christianization of the Kievan Rus, packing the Church of St. Nicholas the Miracle-Maker, also known as the Russian Church, in Sofia. The church's priest, Hieromonk Zotik, who led the mass, said the holiday is of symbolic importance to both Russian and Bulgarian people.
The Kievan Rus, a nation that spanned parts of modern-day Belarus, Ukraine, and Russia, adopted Christianity in the late 10th century by the will of its leader, Vladimir the Great, who was later made a saint for his deed.
Vladimir, who was looking for a strong religion to keep the vast territories together, considered several monotheistic religions. He eventually chose Byzantine Christianity, evidently because of Kiev's close ties to Byzantium, which was at the height of its power back then.
Vladimir, who himself accepted Christianity in the Byzantine city of Chersoneses, called the residents of Kiev to the Dnieper River on his return home for a massive baptism ceremony, which initiated the lengthy process of switching the country to the new religion.


text:
Rio 3/1 to Retire After Terry Takes Captaincy
John Terry has been reinstated as England captain by Fabio Capello ahead of England's Euro 2012 qualifier against Wales, although Boylesports.com have questioned whether the Chelsea skipper can hold on to the armband.
England to beat Wales 2-1 and Rooney to score first Odds Calculator
Win £210
Win £1010
Terry, who was stripped of the captaincy in shame after revelations about his private life before the 2010 World Cup, has seemingly been forgiven by Capello after he was named to lead England out at the Millennium Stadium on Saturday.
But Boylesports.com have gone 3/1 that the boisterous Terry looses the captaincy for any reason before the start of Euro 2012.
The change in captaincy could also cause a rift in the camp, with Rio Ferdinand, the man who Terry has taken the armband from, reportedly unhappy at the snub. Those reports have prompted Boylesports.com to go 3/1 that the Manchester United captain announces his retirement from international football before the European Championships in Poland and Ukraine.
The bookmaker isn't expecting an immediate retirement however, going 1/3 that Rio does play for England under Capello again, and 7/4 that the former Leeds and West Ham defender captains England again.
"A change in captaincy always has the potential to upset any team, particularly when a controversial character like John Terry is involved," commented Boylesports.com PR spokesperson Nicola McGeady.
"It will be interesting to see how Rio handles this latest snub but after a few surprise retirements following the World Cup shambles, will the United defender decide that enough is enough?"
England Captaincy Betting Specials
Rio Ferdinand to captain England again - 7/4
Rio Ferdinand to retire from international football before Euro 2012 - 3/1
Rio Ferdinand to play for England under Fabio Capello again - 1/3
John Terry to lose captaincy before Euro 2012 - 3/1

redpajama_set_name: RedPajamaCommonCrawl


Mr. Nonna and Mr. Carey discussed the case, in which D. M., a County correction officer, was assaulted by an inmate, and suffered numerous physical injuries, post-traumatic stress disorder, depression and headaches. He never returned to work, and voluntarily retired. The County seeks authorization to compromise the County's liability by funding an MSA for D.M.'s benefit of $64,791.96, and pay him an indemnity (lost wage) payment of $130,000.00, for a total of $194,791.96 in full satisfaction of the future indemnity and medical payments.
Legislator Williams asked how the County's reserve on future medical expenses is determined. Mr. Nonna responded that Triad, the third-party claims processor, determines this. Legislator Covill asked how the County ensures that the MSA payment is used to fund medical care, especially if the amount of care is tapering off. Legislator Williams asked who receives the lump sum settlement payment, and who administers the money. Mr. Nonna said that Triad should come to a committee meeting to answer these questions, and explain how the workers' compensation process works.
With a motion by Legislator Barr seconded by Legislator Covill, the item was approved with a vote of 3 - 0.
With a motion by Legislator Barr and seconded by Legislator Maher the item was approved with a vote of 5-0.


text:
<?xml version="1.0" encoding="UTF-8"?>
<project xmlns="http://maven.apache.org/POM/4.0.0"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
  <modelVersion>4.0.0</modelVersion>

  <parent>
    <groupId>org.drools</groupId>
    <artifactId>drools-model</artifactId>
    <version>8.15.0-SNAPSHOT</version>
  </parent>

  <name>Drools :: MVEL Compiler</name>
  <artifactId>drools-mvel-compiler</artifactId>

  <properties>
    <java.module.name>org.drools.mvelcompiler</java.module.name>
  </properties>

  <dependencies>
    <dependency>
      <groupId>junit</groupId>
      <artifactId>junit</artifactId>
      <scope>test</scope>
    </dependency>

    <dependency>
      <groupId>com.github.javaparser</groupId>
      <artifactId>javaparser-core</artifactId>
    </dependency>
    <dependency>
      <groupId>org.drools</groupId>
      <artifactId>drools-mvel-parser</artifactId>
    </dependency>
    <dependency>
      <groupId>org.drools</groupId>
      <artifactId>drools-core</artifactId>
    </dependency>

    <dependency>
      <groupId>org.hamcrest</groupId>
      <artifactId>hamcrest-library</artifactId>
      <scope>test</scope>
    </dependency>

  </dependencies>

</project>

redpajama_set_name: RedPajamaGithub


text:
Star Tribune Sues To Unseal Accused Serial Woman Abuser Keith Ellison's Divorce Records
Pamela Geller September 28, 2018
Flashback in 2004, when up until then, Barack Obama couldn't win an election. But during his 2004 campaign for the Senate, Obama and his corrupt party in Chicago somehow managed to unseal the divorce records of his opponent Jack Ryan, who was leading by a large margin. The Ryan divorce records were sealed at their mutual request of both Mr. and Mrs. Ryan. But the Democrat machine got them unsealed anyway. Barack Obama's backers emailed reporters about the divorce controversy. The divorce records were not pretty. Ryan resigned. Obama took the field.
Different rules for the lawless party.
STAR TRIBUNE SUES TO UNSEAL U.S. REP. KEITH ELLISON'S DIVORCE RECORDS
By Jesse Van Berkel, Star Tribune, September 26, 2018:
The Star Tribune has joined a legal effort to unseal the divorce records of U.S. Rep. Keith Ellison, the Democratic candidate for attorney general.
Ellison and his ex-wife, Kim Ellison, divorced in 2012. The related records have been sealed, so the public cannot access the information.
The Star Tribune's motion to intervene and unseal the records follows a similar action by Alpha News, a right-leaning online news and opinion site.
The efforts follow allegations by Ellison's ex-girlfriend, Karen Monahan, that Ellison domestically abused her in 2016. He has denied the allegation repeatedly, and Monahan has continued to press her case in frequent tweets about Ellison.
On Sunday, Monahan tweeted to Ellison: "This is not going away and you are making it worse for you, your family and district by lying, smearing, getting others to do your dirty work, victim shaming, etc." She referred again to a video she says she has of Ellison dragging her off a bed, which he has said did not happen. She has declined to show the video, saying it is traumatizing. She also told CNN she misplaced it. Monahan also recently released a medical record that shows she told a doctor in 2017 that she had been in an abusive relationship with Ellison.
Ken Martin, the chairman of the Minnesota DFL, said Tuesday that the party's investigation of the allegations against Ellison will be finished soon, then released to the public. An external investigator was hired to conduct the inquiry.
The Star Tribune argued that, given the public interest around that situation and Kim Ellison's public support of her ex-husband, the divorce records are a matter of concern to voters. Divorce records are typically public, but judges will often agree to seal them if both parties to the case agree and no one else objects.
The Ellison campaign released a statement from Kim Ellison on behalf of both her and Keith Ellison. "Our divorce simply isn't the public's business, and therefore, when we separated, we jointly asked the court to seal the file. Now, one month before a closely contested election for Minnesota Attorney General, a conservative group wants to probe our divorce file in search of something to use against Keith in this race. I am disappointed that the Star Tribune would choose to file this motion."
The Ryans were disappointed too when Obama did it. But everyone supported it.
Article posted with permission from Pamela Geller
Previous The SPLC: A Massive, Multi-Million-Dollar Character Assassination Machine
Next Senator Lindsey Graham Unleashes Firestorm At Democrat Senators For "Most Unethical Sham" Since He's Been In Politics
Pamela Geller is the founder, editor and publisher of PamelaGeller.com and President of the American Freedom Defense Initiative (AFDI) and Stop Islamization of America (SIOA). She is the author of The Post-American Presidency: The Obama Administration's War on America, (foreword by Ambassador John Bolton), (Simon & Schuster). Stop the Islamization of America: A Practical Guide to the Resistance. She is also a regular columnist for World Net Daily, the American Thinker, and other publications. Follow her on Facebook & Twitter


French lawmakers will vote later this month on a proposal urging the government to recognise Palestine as a state, a parliamentary source said Wednesday, as diplomatic tensions continue to rise between Europe and Israel.
The non-binding but highly symbolic vote on November 28 was proposed by the ruling Socialist party, and follows a similar resolution by the British parliament and an official decision to recognise Palestine by the Swedish government.
A draft of the new proposal states that the lower house National Assembly "invites the French government to use the recognition of the state of Palestine as an instrument to gain a definitive resolution of the conflict".
European leaders have shown signs of mounting impatience with Israel over its continued settlement-building in Palestinian territories.
Criticism has become more focused in the wake of this summer's 50-day offensive by the Israeli army in Gaza that killed more than 2,000 Palestinians and dozens of Israelis.
France saw a spate of pro-Palestinian protests during the offensive.
Some turned violent, with looters in July destroying Jewish businesses and shouting anti-Israel obscenities in the Paris suburb of Sarcelles -- sometimes known as "Little Jerusalem" for its large community of Sephardic Jews.
The Jewish Agency for Israel, an advocacy group, said in September that more Jews had left France for Israel than from any other country in 2014, blaming a "climate of anti-Semitism."
Foreign Minister Laurent Fabius acknowledged in an interview last week that France would "obviously at a certain moment recognise the Palestinian state."
"The question is when and how? Because this recognition must be useful for efforts to break the deadlock and contribute to a final resolution of the conflict," he added.
The French parliamentary vote will come hot on the heels of a similar resolution to "recognise the state of Palestine alongside the state of Israel as a contribution to securing a negotiated two-state solution" approved by British lawmakers on October 13.
Then Sweden announced on October 30 it officially recognised the Palestinian state, a move heavily criticised by Israel and the United States.
And on Saturday, Europe's foreign policy chief Federica Mogherini called for a Palestinian state sharing Jerusalem as its capital with Israel.
A count puts the number of states that recognise Palestine at 112.
France was among 14 EU nations that voted in favour of granting Palestinian territories observer status at the United Nations in November 2012.


text:
download4software
all about free software that you can download
Space invaders, the forgotten retro game
December 31, 2022 admin Leave a Comment
Space Invaders is a classic arcade game that has withstood the test of time. Originally released in 1978, the game quickly became a hit and has been considered a staple of the gaming world ever since. Space Invaders puts players in control of a spaceship tasked with defending the planet from waves of alien invaders. It is one of the earliest examples of a shoot 'em up game and has been credited as helping to popularize the genre. Despite its cultural significance, Space Invaders has become somewhat forgotten in recent years as newer, more advanced games have taken over.
Space Invaders has been a classic game since its debut in 1978. It was created by Tomohiro Nishikado and released by the Japanese video game company Taito. In this arcade game, players use a joystick and buttons to control a spaceship and shoot aliens that descend from the top of the screen. The aliens move slowly across the screen and attempt to shoot the player's ship, creating a challenging game of strategy and skill. As the game progresses, the speed of the aliens increases, making it more difficult for the player to dodge and shoot them. Space Invaders was an instant hit in Japan, and it soon spread around the world, becoming one of the most popular arcade games of all time. It is credited with kick-starting the video game industry and inspiring a generation of gamers.
Space Invaders has a classic, yet simple style of play. Players must use their laser canon to protect their base by shooting at the descending alien forces. The goal of the game is to destroy all of the aliens before they reach the bottom of the screen and reach the player's base. The player's laser canon can move left and right to avoid being shot by the aliens and the player can fire up to two shots on the screen at once. The number of aliens increases each level, making it harder to survive. Every time an alien is destroyed, the player will be rewarded with points. The game ends when all of the aliens are destroyed or when the aliens manage to reach the player's base.
Space Invaders has become a classic due to its simplicity, fast pace and sound effects. It can be found on many retro gaming platforms such as PlayStation Network, Nintendo Virtual Console, Xbox Live Arcade and more.
Why it's a classic
Space Invaders has become a classic game in the world of gaming, and for good reason. Released in 1978, Space Invaders was one of the earliest shooting games and is widely credited as the first mainstream video game. The goal of the game was simple, but it provided an addictive challenge that quickly made it a hit. Players must use a laser cannon to shoot waves of aliens descending from the top of the screen, while avoiding enemy fire. The iconic 8-bit soundtrack has been stuck in the minds of generations of gamers, and the unique art style makes the game instantly recognizable.
The simplicity of the game and its difficulty level appealed to both casual and hardcore gamers. It spawned many sequels, spin-offs, and clones, but the original Space Invaders remains one of the most influential and beloved games ever created. this game paved the way for shooters and platformers to become popular, and inspired a whole new genre of space-themed video games. It also inspired a wide range of merchandise, artwork, and even music and movies. For this reason, Space Invaders will always be remembered as a classic.
Fortunately, the beloved classic game of Space Invaders is available for purchase online and can be enjoyed from the comfort of your own home. You can find the original version for sale on websites such as eBay and Amazon, or you can purchase a download of it to play on your computer. Additionally, Space Invaders is available to play in many mobile app stores, such as Google Play or the Apple Store.
If you don't want to purchase the game, there are also several free versions of it available online. There are even several browser-based versions of the game that you can play right away, no download required. So if you want to relive the nostalgia of Space Invaders and reminisce about the days of 8-bit video games. Don't hesitate to search around and find an emulator or version of the game that works for you.
GAMES, OFFICE
Previous Article← Snow Bros: The Best Retro Game
Next ArticleBurgertime: The Retro Game Creating Burger →
Contra Game Online: Step-By-Step Process To Play
AARP Solitare Classic: The Best Game For People Of All Ages
Donkey Kong Online: The King of Kongs Returns!
Bubble Shooter Classic: Download and Play!
Minecraft Classic: How to Download and Play on Your PC
Subscribe for This Website Update
© 2023 download4software. All rights reserved.


text:
Q: What is this query doing? I have the following tables:
PRODUCT ( ProdId, Name, Price, Weight, Category, Description, … )
DETAIL ( OrdId, ProdId, Qty, … )
ORDER ( OrdId, ClientId, Amount, OrdDate, DeliveryDate, ChosenStoreId, … )

and I must describe in simple words (i.e. to a non programmer), what the following query is doing:
select * from Order O
where Amount < 0.95 * ( select sum( Qty * Price ) from Product natural join Detail
where OrderId = O.OrderId )

My initial response was that it was showing the orders with the lowest amounts, which is only  5% of them, but it was marked as incorrect.
Another thought I had was perhaps it represented a discount, however the exercise description does not mention anything about discounts so I'm guessing it's also incorrect.
Can anyone tell me what the query is doing? Thanks in advance.
Note: apart from the tables, this is all the relevant information I have for the query.

A: I don't approve of natural join, but that is a separate issue.
This is returning rows where the amount of the order is less than 95% of the sum of the prices of the items on the order.
The cause for the difference is unclear -- it could be due to discounts at the order level; it could be due to extra charges, such as taxes or shipping; or there could be other causes as well.

A: Re Gordon I also don't approve of natural join. The query seems intentionally cryptic, especially since there's no example data. A good strategy is to write out the SQL in more general syntax and infer, see below:
select o.OrdId,
       sum(o.Amount) Amount,
       sum(d.Qty * p.Price) QtyPrice

from Order as o
  left join Detail as d on d.OrdId = o.OrdId
  left join Product as p on p.ProdId = d.ProdId

group by o.OrdId

having sum(o.Amount) < (0.95 * sum(d.Qty * p.Price))

To me, this query returns

*

*All unique orders made in a system

*Where the amount charged on the order was LESS than 95% of the expected amount.

Like you said, this could be a discount tracker, or maybe the o.Amount field is populated independently of the Detail and Product tables and this shows any errors.

redpajama_set_name: RedPajamaStackExchange


TIỆM ĐÔNG KHÁCH. CẦN THỢ NAILS BIẾT LÀM EVERYTHING. TIPS CAO. INCOME CAO $6000-$8000 /THÁNG (MÙA HÈ). ĂN CHIA 7/3 POWDER. CÓ BẰNG OHIO.
Và cần thợ làm Facial, Massage, and Hairstylist.
Nails Tech Wanted. Able to do everything. Very High tips and income $6000-$8000/month (During summer time). Commission for powder is 7/3. Must have Ohio License. Also Wanted Esthetician, Massage, and Hairstylist. Wanted experience Bartender and Cooker. Linh Phone ☎.


text:
Justia Patents Adaptive CodingUS Patent for Data compression with inline compression metadata Patent (Patent # 10,489,350)
Data compression with inline compression metadata
Feb 24, 2017 - Advanced Micro Devices, Inc.
Techniques for handling data compression in which metadata that indicates which portions of data are compressed are which portions of data are not compressed are disclosed. Segments of a buffer referred to as block groups store compressed blocks of data along with uncompressed blocks of data and hash blocks. If a block group includes a block that is a hash of another block in the block group, then the other block is considered to be compressed. If the block group does not include a block that is a hash of another block in the block group, then the blocks in the block group are uncompressed. The hash function to generate the hash is selected to prevent "collisions," which occur when the data being stored in the buffer is such that it is possible for a hash block and an uncompressed block to be the same.
Latest Advanced Micro Devices, Inc. Patents:
REFRESH SCHEME IN A MEMORY CONTROLLER
METHOD AND SYSTEM FOR PARTIAL WAVEFRONT MERGER
Method of debugging a processor
Cache replacement policy based on non-cache buffers
Method and apparatus for providing performance data over a debug bus
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT
This invention was made with Government support under FastForward-2 Node Architecture (NA) Project with Lawrence Livermore National Laboratory (Prime Contract No. DE-AC52-07NA27344, Subcontract No. B609201) awarded by DOE. The Government has certain rights in this invention.
The disclosed embodiments are generally directed to data processing, and in particular, to data compression with inline compression metadata.
Compression is used in many parts of a computer system. Uncompressed data consumes a certain amount of storage or bandwidth for transmission. Compression reduces the size of the data so that storage or bandwidth requirements for the data or both are reduced. Compression technology is constantly being improved.
A more detailed understanding may be had from the following description, given by way of example in conjunction with the accompanying drawings wherein:
FIG. 1 is a block diagram of an example device in which one or more disclosed embodiments may be implemented;
FIG. 2 illustrates compressed data in a full-buffer representation of compressed data and in an in-transit representation of compressed data, according to an example;
FIG. 3 is a block diagram of a compressed data system, according to an example;
FIG. 4 is a flow diagram of a method for reading from a memory storing compressed data, according to an example; and
FIG. 5 is a flow diagram of a method for writing to a memory storing compressed data, according to an example.
The present disclosure is directed to techniques for handling data compression in which metadata that indicates which portions of data are compressed and which portions of data are not compressed. Compressed blocks of data are stored in a buffer in memory along with uncompressed blocks of data. In addition, the buffer stores hash blocks that indicate whether other blocks in the buffer are compressed. The blocks of data and the hash blocks are stored in segments referred to as "block groups." If a block group includes a block that is a hash of another block in the block group, then the other block is considered to be compressed. If the block group does not include a block that is a hash of another block in the block group, then the blocks in the block group are uncompressed. The hash function to generate the hash is selected to prevent "collisions," which occur when the data being stored in the buffer is such that it is possible for a hash block and an uncompressed block to be the same. Hash functions are chosen for particular data types, with the idea that for that data type, using the hash function, no uncompressed data mimics or simulates the hash value.
FIG. 1 is a block diagram of an example device 100 in which one or more aspects of the present disclosure are implemented. The device 100 includes, for example, a computer, a gaming device, a handheld device, a set-top box, a television, a mobile phone, or a tablet computer. The device 100 includes a processor 102, a memory 104, a storage device 106, one or more input devices 108, and one or more output devices 110. The device 100 also includes an input driver 112 and an output driver 114. It is understood that the device 100 may include additional components not shown in FIG. 1.
The processor 102 includes a central processing unit (CPU), a graphics processing unit (GPU), a CPU and GPU located on the same die, or one or more processor cores, wherein each processor core may be a CPU or a GPU. The memory 104 is located on the same die as the processor 102, or may be located separately from the processor 102. The memory 104 includes a volatile or non-volatile memory, for example, random access memory (RAM), dynamic RAM, or a cache.
The storage device 106 includes a fixed or removable storage, for example, a hard disk drive, a solid state drive, an optical disk, or a flash drive. The input devices 108 include a keyboard, a keypad, a touch screen, a touch pad, a detector, a microphone, an accelerometer, a gyroscope, a biometric scanner, or a network connection (e.g., a wireless local area network card for transmission and/or reception of wireless IEEE 802 signals). The output devices 110 include a display, a speaker, a printer, a haptic feedback device, one or more lights, an antenna, or a network connection (e.g., a wireless local area network card for transmission and/or reception of wireless IEEE 802 signals).
The input driver 112 communicates with the processor 102 and the input devices 108, and permits the processor 102 to receive input from the input devices 108. The output driver 114 communicates with the processor 102 and the output devices 110, and permits the processor 102 to send output to the output devices 110. The output driver 114 includes an accelerated processing device (APD) 116 which is coupled to a display device 118. The APD is configured to accept compute commands and graphics rendering commands from processor 102, to process those compute and graphics rendering commands, and to provide pixel output to display device 118 for display.
Although a specific number of the elements listed above (e.g., processor 102, memory 104, or the like) are illustrated in FIG. 1, it should be understood that the teachings provided herein apply for implementations of the device 100 that include more or less than the specific number of elements illustrated. For example, there may be two or more processors 102, two or more memories 104, or the like).
Various components within the device 100 and various components external to the device 100 communicate with components within the device 100. Some such communications are performed with compressed data, in which at least some of the data—the compressed data—is represented in fewer bits than uncompressed data. In various implementations, this type of communication occurs in many different ways for many different purposes. In one example, compressed video is stored in a buffer. A video read-out unit (e.g., in output driver 114) reads the compressed video, decompresses that video, and outputs the data to a screen for display by a user. In another example, data is stored in general purpose memory in a compressed fashion. A unit requests reading of that data and in response, a decompression unit decompresses the data and transmits the data to the requesting unit. In yet another example, the device 100 includes two or more processors 102 that communicate. Part of this communication involves storing data in a compressed manner, transmitting the compressed data to the receiver, and uncompressing the data at the receiver. One use for such compression is to increase bus bandwidth used by a processor 102 by facilitating transmission of data in compressed form. For example, if data is compressed in a 2:1 ratio, then twice the amount of data can be transmitted over the same bus as compared with uncompressed data.
In some examples, communication with compressed data involves a scheme in which one component stores a "full-buffer representation" of compressed data and another component reads or writes that full-buffer representation using an in-transit, non-full-buffer representation of the data. A full-buffer representation is a representation of a collection of compressed data and uncompressed data in which, despite compression being applied to one or more portions of the data, the buffer in which the compressed data is stored is sized large enough to hold the data if all of that data were uncompressed. Thus, a buffer storing a full-buffer representation of compressed data typically includes "empty" space, or space that does not include compressed or uncompressed data.
An in-transit representation of the data is a representation that is transmitted in a way such that the amount of data transmitted is associated with the total of uncompressed and compressed data. In such a representation, the data found in the "empty" space in the full-buffer representation is not transmitted along with the compressed or uncompressed data. Thus, the in-transit representation consumes less bandwidth during transmission than would be needed if all the data in the full-buffer representation were uncompressed and were transmitted. In other words, the amount of data transmitted in the in-transit representation is less than the size of the buffer storing the full-buffer representation.
The full-buffer/in-transit representation paradigm is used in a large number of applications. One application is storing graphical data for output to a screen or for processing (such as image processing or the like). A buffer sized large enough to store all uncompressed data is allocated and, as the data stored in the buffer is modified, the blocks of data that are compressed are also modified. This activity leaves "holes" in the buffer than move around depending on which blocks are compressed and which are uncompressed.
FIG. 2 illustrates compressed data in a full-buffer representation 201 of compressed data and in an in-transit representation 203 of compressed data, according to an example. The full-buffer representation 201 includes compressed and uncompressed data, as well as "hashes," which are a form of metadata that helps indicate what data is compressed and what data is uncompressed. The in-transit representation 203 includes compressed and uncompressed data but does not include the hashes. Thus, the in-transit representation 203 includes less data than the full-buffer representation 201. Conceptually, the full-buffer representation 201 represents partially compressed data that can be read by an entity without requiring transmission of all data in an uncompressed format. Thus although the full-buffer representation 201, which is partially compressed, consumes an amount of memory that is the same as the amount needed for uncompressed data, compressed data of the full-buffer representation 201 is transmitted using less than that amount of data.
In greater detail, the full-buffer representation 201 includes compressed blocks 204 and uncompressed blocks 208. "Blocks" are portions of data that occupy the same amount of space in memory. The compressed blocks 204 include compressed data and the uncompressed blocks 208 include uncompressed data. The full-buffer representation 201 is divided into block groups 202. Within any particular block group 202, data is either compressed or uncompressed. For block groups 202 with uncompressed data, all data in in that block group 202 is uncompressed. In FIG. 2, the memory order of the block groups 202 is from left to right and then top to bottom. Within the block groups 202, the memory order is from top to bottom.
Block groups 202 with compressed data include no uncompressed blocks 208 and include at least one compressed block 204 and at least one hash block 206. In some situations, block groups 202 also include empty blocks (not shown in FIG. 2). Such situations include compression schemes in which data is compressed to a greater degree than 2:1. For example, in a 4:1 compression scheme, one block would include compressed data, one block would include hash data, and two blocks would be empty.
Hash blocks 206 include data indicating whether the block immediately prior to the hash block 206 is compressed or uncompressed. More specifically, for any given block, if the immediately subsequent block is a hash of the given block, then the given block is considered to be compressed and if the immediately subsequent block is not a hash of the given block, then the given block is considered to be uncompressed.
Any practical hash function can be used to generate a hash block. Both the unit that generates the hash block and the unit that checks the hash to determine whether the immediately prior block is compressed (if those units are different) are in agreement as to what hash function is to be used.
Without the hash blocks 206, some other mechanism would be needed in order to indicate which blocks are compressed and which blocks are uncompressed. Without some mechanism for making such indication, a unit using the data would not be able to differentiate between compressed or uncompressed blocks and thus would be unable to decompress the compressed blocks while leaving the uncompressed blocks as-is. One possible mechanism is to store metadata indicating whether blocks are compressed or uncompressed separately from a full-buffer representation of the data. Though simple, this mechanism has issues such as a requirement to create and manage a separate metadata buffer that is in a separate part of memory as compared with the buffer that stores the compressed and uncompressed data. The hash block mechanism allows the compression metadata to be stored in the full-buffer representation 201, which removes the need for a separate buffer that is managed separately from the full-buffer representation 201. More specifically, the hash blocks 206 are stored "in line" with the compressed blocks 204 and the uncompressed blocks 208, meaning that the hash blocks 206 are found in between compressed blocks and/or uncompressed blocks, rather than being stored external the buffer that stores the compressed blocks 204 and the uncompressed blocks 208.
The hash function that is used to generate the hash blocks 206 is preferably one that does not cause "collisions" with uncompressed data. A "collision" occurs when data in an uncompressed block 208 happens to be a hash of the data in the immediately prior uncompressed block 208. In this situation, the unit interpreting the first uncompressed block 208 would interpret that block as a compressed block, leading to incorrect results. Using a hash function that prevents hashes of uncompressed data from being the same as any possible uncompressed data therefore prevents collisions.
The hash function that is used can be selected based on the type of the data that is compressed. In various implementations, the hardware that compresses and decompresses data chooses the hash function, an application that generates and/or uses the data chooses the hash function, or any other entity chooses the hash function.
FIG. 3 is a block diagram of a compressed data system 300, according to an example. The compressed data system 300 includes a source/destination 301 that is configured to read data from or write data to a memory 310 via a data conduit 304. The memory 310 stores compressed data in a buffer 312. In some implementations, the buffer 312 is sized large enough to fit a particular set of data even if all of that data were uncompressed. That allocated space remains allocated even if some of the data becomes or is compressed.
The source/destination 301 is any unit within the device 100 or external to the device that is configured to read or write compressed data into the buffer 312. The compression/decompression unit 302 is a hardware or software module that is configured to compress or decompress data for storage in the buffer 312. The compression/decompression unit 302 applies one or more of any technically feasible compression and decompression techniques. Those of skill in the art will understand that the particular compression/decompression technique used by the compression/decompression unit 302 may vary for different applications. The data conduit 304 is any unit that transfers data between the compression/decompression unit 302 and the memory interface 306. Some examples of such a unit include a bus, a network transmission line, or any other conduit. Typically, such units have a fixed data rate such as a number of bits per second. The compression indicator side-channel 303 is a communication channel in addition to the fixed data rate of the data conduit 304 that allows for transmission of compression indicators that indicate whether particular blocks are compressed. The memory interface 306 is configured to prepare the compressed data received from the source/destination 301 for storage in the buffer 312 or to prepare data from the buffer 312 for transmission to the source/destination 301.
Operations associated with reading and writing via the compressed data system 300 are now described with respect to FIGS. 4 and 5 in conjunction with FIG. 3. FIG. 4 is a flow diagram of a method 400 for reading from a memory storing compressed data, according to an example. Although described with respect to the system shown and described with respect to FIGS. 1-3, it should be understood that any system configured to perform the method, in any technically feasible order, falls within the scope of the present disclosure.
As shown, the method 400 begins at step 402, where the memory interface 306 receives a read request from the source/destination 301. The read request specifies an address. In response, the memory interface 306 fetches data at the address from the buffer 312 in the memory 310. At step 406, of this fetched data, the memory interface 306 selects a block group for analysis.
At step 408, the memory interface 306 determines whether one block in the selected block group is a hash of another block in the block group. More specifically, the hash unit 308 performs a hash on a block of the block group and determines whether that hash is the same as another block in the block group. If the hash is the same as another block in the block group, then the memory interface 306 determines that one block in the selected block group is a hash of another block in the block group. If no block of the block group is a hash of another block of the block group, then the method 400 proceeds to step 412 and if a block of the block group is a hash of another block in the block group, then the method proceeds to step 410.
At step 410, the memory interface 306 discards the hash block and transmits the compressed block over the data conduit 304 to the compression/decompression unit 302 along with an indication that the compressed block is compressed. After step 410, the method 400 proceeds to step 414.
Referring back to step 408, if one block in the block group is not a hash of another block in the block group, then the blocks in the block group are not compressed and the method 400 proceeds to step 412. At step 412, the memory interface 306 transmits the uncompressed data (and, optionally indications that this data is not compressed) to the compression/decompression unit 302 and the method proceeds to step 414. At step 414, the memory interface 306 determines whether there are more block groups to read. If there are block groups to read, then the method 400 returns to step 406 and if there are no block groups to read, then the method 400 proceeds to step 416, where the compression/decompression unit 302 uses the compression indications to decompress data for use by the source/destination 301. More specifically, the compression/decompression unit 302 decompresses blocks that are indicated to be compressed and does not decompress blocks that are indicated to be uncompressed. It will be understood by those of skill in the art that the compression/decompression unit 302 does not need to wait for all blocks to be received from the buffer 312 to begin decompressing compressed blocks for use by the source/destination 301.
FIG. 5 is a flow diagram of a method 500 for writing to a memory storing compressed data, according to an example. Although described with respect to the system shown and described with respect to FIGS. 1-3, it should be understood that any system configured to perform the method, in any technically feasible order, falls within the scope of the present disclosure.
As shown, the method 500 begins at step 502, where the memory interface 306 receives a write command from the source/destination 301 via the control side-channel 305 and the compression/decompression unit 302 receives data to be compressed and written to memory 310. At step 504, the compression/decompression unit 302 compresses at least some of the data, generating compressed and uncompressed blocks. The compression/decompression unit 302 also generates indications for each block that indicates which blocks are compressed. The generated compressed and uncompressed blocks together constitute an in-transit representation 203 of the data to be written.
At step 506, the compression/decompression unit 302 transmits the in-transit representation 203 of the data via the data conduit 304 to the memory interface 306 for storage in the memory 310, and also transmits the indications of whether the blocks are compressed to the memory interface 306 via the compression indicator side-channel 303. At step 508, the memory interface 306 selects a block for analysis and obtains the compression indicator for that block. At step 510, if the compression indicator indicates that the block is compressed, then the method 500 proceeds to step 510 and if the compression indicator indicates that the block is not compressed, then the method 500 proceeds to step 514. At step 514, the memory interface 306 stores the uncompressed block in the buffer 312 without hashing the block. After step 514, the method 500 proceeds to step 518.
Returning back to step 510, if the block is indicated as being compressed, then the method 500 proceeds to step 512. At step 512, the hash unit 308 creates a hash of the compressed block. At step 516, the memory 310 stores the hash of the compressed block as well as the compressed block in the buffer 312.
At step 518, the memory interface 306 determines whether there are more blocks to analyze. If there are more blocks to analyze, then the method 500 returns to step 508 and if there are no more blocks to analyze, then the method 500 proceeds to step 520, where the method 500 ends.
The memory accesses described with respect to FIG. 4 (read) and FIG. 5 (write) is described generically as follows. The source/destination 301 generates a memory access (either read or write) and transmits that memory access to the memory interface 306. The access specifies data to be read or written and an access type, such as "read" or "write." The specified data is specified by address and, if the access type is a write, then the data actual data is specified. The data that is specified includes a compressed block and an uncompressed block. More specifically, if the access is of type read, then the data at the specified address is the data in the buffer 312, which includes a compressed block and an uncompressed block. If the access is of type write, then the data specified is at least partially compressed by the compression/decompression unit 302 and thus includes a compressed block and an uncompressed block.
In response to receiving the access request at the memory interface 306, the hash unit 308 performs at least one hash operation for that data access. The hash operation is performed for data that is stored in (read) or that is to be stored in (write) the buffer 312 and is also associated with identifying the compressed block of the data as being compressed. For a read, the hash operation includes performing hashes on blocks in block groups to generate hash blocks and comparing the hash blocks to other blocks to determine whether those other blocks are compressed blocks or uncompressed blocks. For a write, the hash operation includes hashing compressed blocks and storing the compressed blocks along with the hash blocks in the buffer 312.
In various implementations, in either the read (FIG. 4) or the write (FIG. 5), one or more of the units in the compressed data system 300 checks for collisions. As described above, a collision occurs in the event that the hash of compressed data "looks like" uncompressed data. In the compressed data system 300 of FIG. 3, in one example, a collision occurs in the event that the memory interface 306 reads a block group and determines that a second block in the block group is a hash of the first block group (which would indicate that the first block is compressed), but the first block is actually uncompressed data. In various examples, this disparity is noticed by the compression/decompression unit 302, which determines that a block that is indicated to be compressed cannot be decompressed, or by the consumer of the data (e.g., software or hardware that eventually consumes the data, such as the source/destination 301), which performs a check on the data and determines that the data is invalid.
In response to determining that a collision has occurred, the unit that detected the collision can request a remedial measure be performed. In various examples, the remedial measure includes re-performing a set of operations involving the data but with a different hash function (e.g., re-writing the data, so that the uncompressed block does not look like a hash, and then re-reading the data at a later time in accordance with the operations of the consumer of the data), or with no compression.
The hash function is preferably selected so that collisions do not occur. In one example, the consumer is configured to specify a particular hash function to the memory interface 306 prior to performing operations that utilize compressed data. In such situations, the consumer would know that data used by the consumer would not cause collisions while using the specified hash function. In another example, the consumer provides test data to the compressed data system 300, which varies the hash function until collisions do not occur. In yet another example, the compressed data system 300 uses a hash function determined to cause collisions with relatively few types of data.
It should be understood that many variations are possible based on the disclosure herein. In one example variation, non-hash signature functions are used instead of hash functions. More specifically, although it is described herein that a hash function is used to identify blocks as compressed blocks, other non-hash functions could be alternatively utilized. Functions used to generate a value that identifies a particular block as being compressed are referred to generically herein as "signature functions," and the resultant value generated by signature functions are referred to herein generically as "signatures" or "signature blocks." Thus, in the discussion above, where it is stated that hash functions are used to generate hash blocks from compressed blocks and that a hash function is applied to a block in a block group to obtain a hash result which is then compared to a different block in the block group, it could instead be stated that signature functions are used to generate signature blocks from compressed blocks and that the signature function is applied to a block in a block group to obtain a signature which is then compared to a different block in the block group to determine whether the first block is compressed. As described above, any hash function could be used as a signature function—the term "signature function" applies generically to both hash functions and to non-hash signature functions. Some example signature functions include a duplication, where a signature of a particular block is identical to the block, an inverse duplication, where a signature of a particular block is the bitwise inverse of the block (i.e., all bits of the block are inverted, 0 to 1 and 1 to 0), a combination of a duplication and an inverted duplication, where one or more portions of block are identical and one or more other portions are bitwise inverses of the block, or a checksum function of the block, where the checksum can be one of the following: odd or even parity, a modular sum (where all words of the block are added as an unsigned binary number), a position dependent checksum such as a cyclic redundancy check, or a modulo value of the block. A signature can be any length from one bit up to the size of the space allocated for the signature block (which can be the same amount of space allocated for a compressed block). The above list of example signature functions is not exhaustive and any other technically feasible signature function could be used instead.
Although features and elements are described above in particular combinations, each feature or element may be used alone without the other features and elements or in various combinations with or without other features and elements.
The methods provided may be implemented in a general purpose computer, a processor, or a processor core. Suitable processors include, by way of example, a general purpose processor, a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors in association with a DSP core, a controller, a microcontroller, Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) circuits, any other type of integrated circuit (IC), and/or a state machine. Such processors may be manufactured by configuring a manufacturing process using the results of processed hardware description language (HDL) instructions and other intermediary data including netlists (such instructions capable of being stored on a computer readable media). The results of such processing may be maskworks that are then used in a semiconductor manufacturing process to manufacture a processor which implements aspects of the embodiments.
The methods or flow charts provided herein may be implemented in a computer program, software, or firmware incorporated in a non-transitory computer-readable storage medium for execution by a general purpose computer or a processor. Examples of non-transitory computer-readable storage mediums include a read only memory (ROM), a random access memory (RAM), a register, cache memory, semiconductor memory devices, magnetic media such as internal hard disks and removable disks, magneto-optical media, and optical media such as CD-ROM disks, and digital versatile disks (DVDs).
1. A method for accessing compressed data, the method comprising:
receiving an access request at a memory interface, the access request specifying data and an access type, the data including a block group stored in a buffer that stores a plurality of block groups that are each the same size, each block also being the same size, the access request received from a data consumer;
responsive to the access request, performing a signature operation for a block of the block group, the signature operation identifying the block as being either compressed or uncompressed, based on whether the block group includes a block that is a signature of another block in the block group;
transmitting all blocks of the block group to the data consumer if the signature operation identifies the block as uncompressed, and
transmitting only compressed blocks of the block group if the signature operation identifies the block as compressed,
wherein the block groups of the buffer include either all uncompressed blocks or one compressed block and one signature block comprising a signature of the one compressed block.
the access request comprises a read request.
3. The method of claim 2, further comprising:
responsive to the read request, fetching read data from the buffer, the read data including the compressed block and the signature block.
4. The method of claim 3, wherein the signature operation comprises:
performing a signature function on the compressed block to obtain a signature of the compressed block;
determining that the signature block matches the signature of the compressed block; and
discarding the signature block in response to determining that the signature block matches the signature of the compressed block.
transmitting the compressed block and the uncompressed block to a compression/decompression unit, with an indication that the compressed block is compressed;
based on the indication, decompressing the compressed block to generate a decompressed block; and
transmitting the decompressed block and the uncompressed block to the data consumer.
6. The method of claim 1, wherein the signature operation comprises one of:
a hash function, a duplication function, a bitwise inverse duplication function, a parity function, a checksum function, a modular sum function, or a modulo function.
7. A memory system comprising:
a memory; and
a memory interface configured to: receive an access request specifying data and an access type, the data including a block group stored in a buffer that stores a plurality of block groups that are each the same size, each block also being the same size, the access request received from a data consumer; responsive to the access request, perform a signature operation for a block of the block group, the signature operation identifying the block as being either compressed or uncompressed; transmit all blocks of the block group to the data consumer if the signature operation identifies the block as uncompressed, and transmit only compressed blocks of the block group if the signature operation identifies the block as compressed, wherein the block groups of the buffer include either all uncompressed blocks or one compressed block and one signature block comprising a signature of the one compressed block.
8. The memory system of claim 7, wherein:
9. The memory system of claim 8, wherein the memory interface is further configured to:
responsive to the read request, fetch read data from the buffer, the read data including the compressed block and the signature block.
10. The memory system of claim 9, wherein the memory interface is configured to perform the signature operation by:
performing a signature function on the compressed block to generate a signature of the compressed block;
11. The memory system of claim 10, wherein:
the memory system further comprises a compression/decompression block
the memory interface is further configured to transmit the compressed block and the uncompressed block to the compression/decompression unit, with an indication that the compressed block is compressed; and
the compression/decompression block is configured to: based on the indication, decompress the compressed block to generate a decompressed block, and transmit the decompressed block and the uncompressed block to the data consumer.
12. The memory system of claim 7, wherein the signature operation comprises one of:
13. A computer system comprising:
a data processor;
a compression/decompression unit coupled to the data processor;
a memory interface coupled to the compression/decompression unit via a data conduit and a compression indicator side-channel and to the data processor via a control side-channel; and
a memory coupled to the memory interface,
wherein the memory interface is configured to: receive an access request specifying data and an access type, the data including a block group stored in a buffer that stores a plurality of block groups that are each the same size, each block also being the same size, the access request received from a data consumer; responsive to the access request, perform a signature operation for a block of the block group, the signature operation identifying the block as being either compressed or uncompressed; transmit all blocks of the block group to the data consumer if the signature operation identifies the block as uncompressed, and transmit only compressed blocks of the block group if the signature operation identifies the block as compressed, wherein the block groups of the buffer include either all uncompressed blocks or one compressed block and one signature block comprising a signature of the one compressed block.
14. The computer system of claim 13, wherein the signature operation comprises one of:
8497788 July 30, 2013 Miller
20060184505 August 17, 2006 Kedem
20070061546 March 15, 2007 Berger
20070208893 September 6, 2007 Azzarello
20080059728 March 6, 2008 Daly
20100250896 September 30, 2010 Matze
20110080956 April 7, 2011 Zhou
20150242309 August 27, 2015 Talagala
20160077960 March 17, 2016 Hung
20160077980 March 17, 2016 Tomlin
20170371593 December 28, 2017 Li
Filed: Feb 24, 2017
Assignee: Advanced Micro Devices, Inc. (Sunnyvale, CA)
Inventor: Greg Sadowski (Boxborough, MA)
Primary Examiner: Yaima Rigol
Current U.S. Class: Adaptive Coding (341/51)
International Classification: G06F 16/174 (20190101); G06F 3/06 (20060101); H04L 29/06 (20060101); H03M 7/30 (20060101); H04L 9/32 (20060101);


A 22-year-old San Jose man recently filed a lawsuit against R&B singer Chris Brown and the owner of Fiesta Nightclub after suffering a gunshot wound at a concert last January.
The plaintiff was one of five victims who were hurt at "Chris Brown's Capricorn Bash," where the shooting took place. While the man's injuries were not considered life threatening, the lawsuit alleges that the bullet wound caused "permanent injury" to his foot. The lawsuit seeks compensatory damages for mental and emotional suffering, past and future medical bills, lost wages, and post-traumatic stress from being shot.
The lawsuit, which is being filed through the Superior Court of Santa Clara County, claims that the defendants did not provide appropriate security measures, like metal detectors or bag checks, to keep fans safe. Considering several similar shooting incidents and other acts of violence that have taken place at previous Chris Brown concerts, the plaintiff and his lawyers have stated that the property owners should have known about the risk and prepared to help ensure the protection of attendees.
Have You Been Injured on Another Person's Property?
Premises liability law states that property owners have a duty to their guests to provide them with a safe environment free of known hazards. This commonly includes keeping walkways clear of debris, making sure stairways have sturdy handrails, fencing in swimming pools, and other precautions to protect people from injury. If they fail in this duty to keep guests safe, or at least warn them of an unsafe condition, they can be held liable for damages.
If you think you may have a premises liability case, please contact a Northern California personal injury lawyer at the Law Offices of Larry S. Buckley for more information on your rights to compensation. Call us today at (530) 413-0245, or click here to fill out a brief online consultation form.


Whether you're an infrastructure project, an international development agency, a property developer or a company CEO, your success is dependent on a wide range of stakeholders embracing your plans. That's not easy to achieve. We're here to help.
We are driven to see communities grow stronger and people enjoy improved quality of life. We want to help organisations and companies thrive as they achieve that.
Strategic Development Group offers outstanding technical experts with a depth of experience in working with communities to achieve shared objectives. We can help you consult meaningfully with your stakeholders and bring about transformative and sustainable change.
As its name suggests, Strategic Development Group is committed to being 'strategic' and committed to 'development' both in Australia and overseas. We are conscious that development is often controversial, yet development is crucial to improving quality of life for so many people. We therefore work with our clients – including governments, the private sector and not-for-profits – to help achieve development that is strategic. That is, development that makes a difference to people's lives in significant ways, development that communities love and embrace.
We do this by helping our clients to engage effectively with the communities affected by development, by helping clients plan and design their developments, and by helping clients manage and measure what they do. And we do this by bringing together teams of people with expertise and relationships tailor-made to the requirements of our clients.
Strategic Development Group's origins date to 2002 when Michael Pilbrow left the Australian Government and started a one-person consultancy firm providing strategic planning and advice on international development.
Over the next decade, the business grew and branched out into development in Australia, with a focus on community engagement and planning, and increasingly put together teams of experts. In 2012, a company was formed called Pilbrow Global Pty Ltd, operating under the trading name Strategic Development Associates. A team of employees was built and the company moved into larger projects and consultancies.
In 2016, after nearly two years with the company, Michael Collins became a joint owner and Director of the company. On 1 July 2017, the company was renamed Strategic Development Group Pty Ltd.


text:
Q: How to change the form of fraction One of my output result is
(2 Sqrt[2/5])/3

Is there any method to let it become
Sqrt[8/45]

Thank you very much!

A: They have same LeafCount.

Also  Mathematica will automatically write Sqrt[8/45] as (2 Sqrt[2/5])/3  So the following trick will not even work
t[e_] := e^2
res = Simplify[(2 Sqrt[2/5])/3,TransformationFunctions -> {Automatic, t}]

But now Sqrt[res] gives

There might be a trick using Hold or HoldForm but I could not figure it out. But even if this would work, once you release the Hold it will go back to (2 Sqrt[2/5])/3
Mathematica seems to like to put integer fraction inside the sqrt into its lowest common multiplier by pulling factors outside.


After my first lecturing post at UEA, Norwich, where I specialised in teaching database management and programming, I moved to the University of Surrey. At Surrey, I led the introduction of the undergraduate degree programme in Computing & IT, and served as Course Director for that programme for ten years.
In 2001, I moved to the Open University, and was soon appointed as Programme Director for undergraduate computing, a post I held for over thirteen years until July 2016. My responsibilities included oversight of the introduction of the first OU named degree in Computing in 2004, and its subsequent merger with the degrees in IT & Computing and Information and Communication Technologies to form the current undergradute degree in Computing & IT.
After standing down from the role of Programme Director, I then served as Deputy Head of the School of Computing and Communications until October 2018.
Having finally escaped from a succession of leadership and management roles, I am now trying to rekindle my research activities, alongside leading the accreditation standard workstream for the Insitute of Coding.
Over the years, my research interests have focussed on database and semantic modelling, and, more recently, exploring some of the challenges of object-relational database design.
A growing interest, which is now my main focus, is the presentation of navigational information for maritime navigation. In particular, I am exploring a number of issues related to supporting navigators as they seek to recognise landmarks to aid visual navigation, and how landmarks are used to improve the safety of navigation.
In addition to contributing to database teaching throughout my career, I have more recently started to teach IT service management, an important but often overlooked aspect of software development and management.
I am a Fellow of BCS: the Chartered Institute for IT, a Chartered Membership Assessor and an assessor for academic accreditation. Until 2007, I was also responsible for the University Professional Development Scheme for placement students.
I am a professional member of the ACM.
I represent the Open Univesity on the SFIA Council, and I am an accredited SFIA consultant. I am currently leading a project to map certifications and curricula - including degrees - to the SFIA framework.
I'm an Ocean Yachtmaster and Cruising Instructor through the Royal Yachting Association, a member of the Royal Institute of Navigation, and - when I get time - I sail my Westerly Oceanlord, O.D.1, which I also use for some of my navigation experiments.


Agree with pretty much every word of Bob's cautionary tale below. Whether we're in-house or agency-side, we've got to close the gap between the marketing resources we request and the results we deliver, or face the figurative axe.
One, the squishiness of measuring marketing investment overall (often including PR) further exacerbates the insidiousness of advertising-value equivalencies as proxies for earned media coverage. Not only is the "equivalence" false, it's not clear that the actual value is demonstrably a good spend.
Of course, we're all good at whining about AVE, without actually proposing a valid alternative that works within wider marketing-mix models, but that's a different story for another day.
Second point: to deliver business-first results, we need to work against better briefs. Way too many objectives are vague and fuzzy. "Increase buzz. Generate awareness. Create brand excitement."
These produce creative-led solutions that, occasionally, change business outcomes. Usually, though, they earn awards trophies and justify next year's budget - neither, as pointed below, sustainable in today's marketing environment.
If you're a CMO or CCO, this probably looks scary, but I assure you that it's really the big break that you've been waiting for.


text:
Latest updates for
UK Centres
EU Centres
US Centres
We're changing our plans so you don't have to change yours. Come when you're ready.
ONCAMPUS would like to take this opportunity to send a message of support to all of our colleagues and friends around the world who may be concerned or affected by the spread of the COVID-19 Coronavirus. ONCAMPUS is committed to ensuring the health, safety and wellbeing of all our staff and students. Please be assured that we are working continuously to provide future plans that respect the ambitions and needs of international students during this period of enormous uncertainty.
We are aware that many students, quite understandably, are keen to begin their studies in person at our centres with face-to-face teaching from day one. As such, we have designed our contingency planning (launching ONCAMPUS Online in all our UK Centres) with the aim of restoring face-to-face teaching in our centres as the priority. Please see below for some key updates from ONCAMPUS with regards to accommodation, travel, dates and deadlines:
Latest updates from our UK centres
Latest updates from our EU centres
Latest updates from our USA centres
September 2021 study options
a) Online and face to face
With term 1 available online, OR full course face to face
b) Face to face only
a) Online only
There will be an online English Language Preparation Programme (ELPP) for 1 Term in June, progressing to all UK centres in September.
For specific information and FAQs about our different locations, please visit our dedicated Covid-19 pages for the UK, Europe and the USA.
What will the online content consist of and how will it be delivered?
The online content is the same as the content that you would receive face to face and it prepares you for success in your intended degree programme. It will be delivered both through online hosted activities such as guided reading and group project work as well as live lectures, seminars and tutorials with our experienced tutors.
If the students want to come back to their home country, will their tuition/accommodation fees be refunded or extended to the new term?
All UK centres: if students are currently studying at ONCAMPUS and decide to leave, then our normal Terms and Conditions will apply. Please find a link to the Terms and Conditions here.
Illinois Tech: if a student decides not to return to the campus after Spring break and they have on-campus housing, they'll need to fill out a form on the housing website so IIT can assess if a housing or meal plan refund is due. For tuition, please refer to the Terms and Conditions.
ONCAMPUS Boston: for Room and Board we are awaiting an announcement from Curry on any refunds for any forfeited services and we will update all parties accordingly. For tuition, please refer to the Terms and Conditions.
Can students take online classes?
All UK centres: We are delivering our education curriculum online with ONCAMPUS Online and all students are able to access lectures and study materials from either their accommodation in the UK or from their home country.
If students have chosen to return home for this break and are not then able to return to the UK, please get in touch with the centre immediately and please ensure that relevant Immigration guidelines are followed for both the UK and Europe. UKVI have confirmed that as long as students engage in their online learning, there will be no impact to their student visa, whether they study in the UK or in their home country.
Lectures can be accessed online according to the UK timetable at Greenwich Meantime hours but students will ONLY be able to attend if they continue to be a registered student with us, either in the UK/EU/US or in their home country.
Illinois Tech: all university classes will be online as of March 23rd and will continue to be online as long as needed.
ONCAMPUS Boston: all university classes will be online as of March 23rd and will continue to be online as long as needed. In addition, all student support, transfer, and advising activities will be delivered online via the Blackboard portal.
If students are taking online classes, will it affect their progression?
All UK/EU/US centres: we are committed to ensuring that students' education and academic progression are not compromised by this extraordinary situation. We are working with our University partners to ensure that students' academic records will not be adversely affected.
What is the guidance for the students who continue staying in UK/Europe/US for study?
The current UK national advice is to stay at home for 14 days if you or your family members have either a high temperature or a new, continuous cough.
Visit GOV.UK for further information on the outbreak of coronavirus, including the current situation in the UK and information about the virus and its symptoms.
Please also see the following links for advice and information:
WHO: https://www.who.int/emergencies/diseases/novel-coronavirus-2019
NHS: https://www.nhs.uk/conditions/coronavirus-covid-19/
European Centre for Disease Prevention and Control: https://www.ecdc.europa.eu/en/novel-coronavirus-china
For Europe - You can find current guidance and updates here https://www.rivm.nl/en/news/current-information-about-novel-coronavirus-covid-19 And here https://www.uva.nl/en/current/coronavirus/coronavirus.html
For the USA : please CDC website. https://www.cdc.gov/
What if the student accommodation closes?
All UK centres: student accommodation closure is not anticipated, however, dependent on the choice of accommodation the provider may introduce some control measures. In the event of a closure ONCAMPUS will be committed to ensuring that students are taken care of, and that suitable alternatives are provided.
Illinois Tech: student housing will not close – this has been confirmed by IIT.
ONCAMPUS Boston: most of our students have selected to live off the campus during the COVID-19 outbreak.
What happens if I arrive and my campus/city goes into lockdown?
As we have seen over the last few months leading to the commencement of the September and November intakes, local lockdown restrictions have been introduced by the UK government to help control the transmission of the virus. In a circumstance where a local lockdown is introduced, central guidance will be communicated to all students. In the event that students will need to undertake a period of lockdown in their accommodation, students will be able to continue their studies online, if necessary.
What happens if I test positive for COVID and have to self-isolate?
As we begin to open our places of study and work, we will be doing everything reasonable and practicable to ensure that we are COVID secure and that the health, safety and welfare of our staff and students is prioritised. CEG will be working in full cooperation with local authorities and in particular the Public Health England Local Protection Teams on a 3-stage plan:
Students should be encouraged to report self-isolation to centre staff if they are suffering symptoms of, or following a positive test for COVID-19. During the period of self-isolation, Centre staff will ensure that students are coping well and have access to food and hygiene products on a daily basis. Students will be given advice and instructions on how to contact the National Health Service, if this is necessary.


text:
Lista de los campeones del Abierto de Australia de 1966:

Individual masculino

Roy Emerson (AUS) d. Arthur Ashe (USA),  6–4, 6–8, 6–2, 6–3

Individual femenino

Margaret Court (AUS) d. Nancy Richey (USA), Walkover

Dobles masculino

Fred Stolle/Roy Emerson (AUS)

Dobles femenino

Carole Caldwell Graebner (USA)/ Nancy Richey (USA)

Dobles mixto

Judy Tegart Dalton (AUS)/Tony Roche (AUS)

Campeonato de Australia 1966

redpajama_set_name: RedPajamaWikipedia


Training Rates are 120. Per Hour. Minimum of 5 hours required. Travel and Lodging are not included.
The buying process has changed, and marketers need to find new ways to reach buyers and get heard through the noise. Instead of finding customers with mass advertising and email blasts, marketers must now focus on being found and learn to build continuous relationships with buyers.
Lead generation often uses digital channels, and has been undergoing substantial changes in recent years from the rise of new online and social techniques. In particular, the abundance of information readily available online has led to the rise of the "self-directed buyer" and the emergence of new techniques to develop and qualify potential leads before passing them to sales.
If you have spent money to house a CRM program or an email system.. Chances are you should know how to use it effectively.
Get more opens, get more clicks and get more leads. Learning the basics and more go a long ways towards making those digital products deliver sales.
The only thing worse than training your employees and having them leave is not training them and having them stay. — Henry Ford.
Social media training has quickly become mandatory for an ever-growing range of companies, far surpassing the first wave of IT firms that rolled it out two years ago, like Dell, Intel and IBM. While it began as an added 'bonus' in the arsenal of the marketing spokesperson, now companies ranging from Unisys, PepsiCo, Adidas, HP and Sprint are making social not only part of the company's core training curriculum, but also a key element in their recruiting message, stressing the employee benefit of receiving social media literacy training.
Every business owner should hold the keys to their website. They should be able to start its engine, hit the gas, and drive it wherever it needs to go. Now does that mean a webmaster's services may not ever be needed? Of course not. It simply means that webmasters are there for support, but they certainly shouldn't be the person behind the wheel.
This is why Content Management Systems should be an essentially requirement for just about any business owner in today's world. For those of you who are unfamiliar with the beauties of CMS systems, they are changing web design as we know it by allowing guys and gals with little or no previous web coding experience to design their own site.


So far it has been such a great experience and all the details we're explained to me in detail.
Experience was wonderful, everyone was so nice and helpful!
Great communication, fabulous staffs and they provide all the informations to details.
Give it a go. They are straight forward, tell it like it is. No hidden agenda. Honest from the start.


The "Global Ride Sharing Market Analysis to 2027" is a specialized and in-depth study of the Ride Sharing industry with a focus on the global market trend. The report aims to provide an overview of global Ride Sharing market with detailed market segmentation on the basis of type, and business model, and geography. The global Ride Sharing market is expected to witness high growth during the forecast period. The report provides key statistics on the market status of the leading Ride Sharing market players and offers key trends and opportunities in the market.
Also, key ride sharing market players influencing the market are profiled in the study along with their SWOT analysis and market strategies. The report also focuses on leading industry players with information such as company profiles, products and services offered, financial information of last 3 years, key development in past five years. Some of the key players influencing the ride sharing market are ANI Technologies Pvt. Ltd., BlaBlaCar, Carma Technology Corporation, DiDi (Beijing Xiaoju Technology Co, Ltd.), Gett, Inc., Grab, Lyft, Inc., Car2Go, Uber Technologies Inc., and Quick Ride among others.
11.1 ANI TECHNOLOGIES PVT. LTD.


Think twice the next time you're tempted to scoff at an alarmed individual who breaks a nail. The event may sign much more than the necessity for one more manicure. Unhealthy and readily breakable nails point out a variety of health compromising circumstances including chronic bronchitis, thyroid disorders, and vitamin and mineral imbalances (Editors of Rodale Health Books Healing With Vitamins).
We need to provide you info on how you can provide help to give your cat a wholesome, glad life. The following articles are specifically gathered with your cat in thoughts to assist ensure their well being, blissful life.
Could California have its own single-payer medical health insurance system offering coverage for all residents? A invoice has been introduced within the state Legislature that may do just that — and its probabilities of success could possibly be vastly improved by President Trump and the Republican-managed Congress.


text:
Jump to: Common NamesEconomic ImportanceDistributional RangeReferencesOther Web ReferencesImages
Taxon: Ranunculus bulbosus L.
Ranunculaceae
Ranunculoideae
Ranunculeae
Sp. pl. 1:554. 1753
Typification:
View in Linnean Typification Project
Ranunculus bulbosus subsp. aleae (0 accessions)
bulbous buttercup (Source: Glea Cron ed2) - English
renoncule bulbeuse (Source: L Noms French ed7) - French
botão-de-ouro (Source: pers. comm.) - Portuguese (Brazil)
pé-de-galo (Source: pers. comm.) - Portuguese (Brazil)
knölsmörblomma (Source: Kulturvaxtdatabas) - Swedish
Medicines: folklore
Vertebrate poisons: mammals; mammals; mammals
NORTHERN AFRICA: Algeria (n.), Egypt (n.), Morocco
WESTERN ASIA: Cyprus, Turkey
CAUCASUS: Armenia, Azerbaijan, Georgia, Russian Federation, [Dagestan] Russian Federation-Ciscaucasia [Ciscaucasia]
NORTHERN EUROPE: Denmark, Finland (s.), Ireland, Norway (s.), Sweden (s.), United Kingdom
MIDDLE EUROPE: Austria, Belgium, Czech Republic, Germany, Hungary, Netherlands, Poland, Slovakia
EASTERN EUROPE: Belarus, Estonia, Latvia, Lithuania, Russian Federation-European part, [European part (c.)] Ukraine (w. & Krym)
SOUTHEASTERN EUROPE: Albania, Bosnia and Herzegovina, Bulgaria, Croatia, Greece (incl. Crete), Italy (incl. Sardinia, Sicily), Macedonia, Montenegro, Romania, Serbia, Slovenia
SOUTHWESTERN EUROPE: France (incl. Corsica), Portugal, Spain (incl. Baleares)
Naturalized (natzd. elsewhere in temperate regions)
Cooper, M. R. & A. W. Johnson. 1998. Poisonous plants and fungi in Britain: animal and human poisoning Note: poisonous
Czerepanov, S. K. 1995. Vascular plants of Russia and adjacent states (the former USSR) Cambridge University Press.
Demilly, D. et al. 2001. Liste alphabétique des principales espèces de plantes cultivées et de mauvaises herbes. Noms latins et noms français, ed. 7 Note: GEVES-SNES, Beaucouzé, France
Duke, J. A. et al. 2002. CRC Handbook of medicinal herbs
Encke, F. et al. 1984. Zander: Handwörterbuch der Pflanzennamen, 13. Auflage
Gleason, H. A. & A. Cronquist. 1991. Manual of vascular plants of northeastern United States and adjacent Canada, ed. 2
Greuter, W. et al., eds. 1984-. Med-Checklist.
Groth, D. 2005. pers. comm. Note: re. Brazilian common names
Jalas, J. & J. Suominen. 1972-. Atlas florae europaeae.
Kingsbury, J. M. 1964. Poisonous plants of the United States and Canada. Note: poisonous
Komarov, V. L. et al., eds. 1934-1964. Flora SSSR.
Lampe, K. F. & M. A. McCann. 1985. AMA handbook of poisonous and injurious plants Note: poisonous
Munro, D. B. Canadian poisonous plants information system (on-line resource).
2018. Mid-Atlantic invasive plant species (on-line resource)
Check other web resources for Ranunculus bulbosus L. :
Mansfeld: Mansfeld's World Databas of Agricultural and Horticultural Crops
Seed: U.S. National Seed Herbarium image
National Germplasm Resources Laboratory, Beltsville, Maryland. URL: https://npgsweb.ars-grin.gov/gringlobal/taxonomydetail.aspx?30817. Accessed 16 July 2019.


Day for Night 2016 in Pictures! | ANNAINAUSTIN...and Company!
Which way to the art?
The Day for Night festival in Houston that took place just before the long holiday break was the most fun that I've ever had in downtown Houston. It was really pretty! Here are some pictures from the event, complete with fur coats and costumes…and look for the dude playing the washing machine!


text:
U.S. hasn't done analysis on what happens if NAFTA ends
U.S. Trade Representative Robert Lighthizer, left, shakes hands with Canadian Foreign Affairs Minister Chrystia Freeland, accompanied by Mexico's Secretary of Economy Ildefonso Guajardo Villarreal, after they spoke at a news conference back in August.
WASHINGTON — American policy-makers admit they have not worked to analyze the economic impact of the end of the North American Free Trade Agreement, even as President Donald Trump threatens to cancel the agreement.
That absence of research applies to both elected branches of the U.S. government: neither the White House nor congressional researchers have an impact assessment, despite uncertainty over the fate of the 23-year-old pact.
Frustrations at the bargaining table exploded into the open at the last round where the most common conversation topic in the hallways involved whether Trump's team was intentionally trying to sabotage a deal.
A research unit for Congress, the U.S. Government Accountability Office, which performs studies for lawmakers, tells The Canadian Press that it has in the past conducted analysis on international issues like the monitoring of Iran's nuclear program, but nobody has yet requested research on NAFTA.
"We have not been asked to look at the [NAFTA] issue," said an official there.
It's the same at the White House. Donald Trump's trade czar, Robert Lighthizer, says he hasn't yet done the research. Inside U.S. Trade quoted him telling a group of American reporters that his current focus is trying to get a deal, not studying life without NAFTA.
The countries have pushed the negotiation schedule into next year, shelving talk of a quick easy agreement.
"You always think about what might happen, but we haven't done any analysis of that at this point," Lighthizer told a gathering of American trade reporters earlier this week, according to Inside U.S. Trade. "No, we don't really have a plan beyond trying to get a good agreement...
"[But] if we end up not having an agreement, my guess is all three countries will do just fine."
The Canadian government says it has been researching the potential impact of various trade scenarios.
Some trade-watchers say it's stunning that Washington isn't.
EXPERT WORRIED
Duncan Wood, a Mexico expert, said the U.S. is certainly acting like it wants to leave the pact, putting forward proposals the other countries could never accept. Wood said he fears the Trump administration is inching toward a pullout — without doing its homework.
"That doesn't make me feel very good when I go to bed at night," he told panel this week at the Washington International Trade Association.
"If they were taking these decisions based upon years and years of studies and saying, 'You know what, we think we'll be absolutely fine, because the stats show it,' I could say, 'Okay, fine, I get it, I may disagree, because I like Mexico, but for the United States, I get it'...
"[But] that [absence of research] worries me."
He cited the poultry trade as just one example of the complex potential consequences.
Producers sell different chicken parts to different markets, based on local preferences. He said Mexico's huge chicken tariffs would lead to an oversupply of dark meat on the U.S. market; a shortage in Mexico; and chicken plants moving to Mexico.
But he said broken cross-border supply chains aren't what worries him most. Wood expressed fear that the current fight at the NAFTA table is a prelude to a bigger battle against the World Trade Organization and international trading system: "These are dark days, my friends... This is near-apocalyptic what we're looking at. I don't mean to exaggerate. I'm not one for hyperbole.
"I actually am terrified about what's about to happen."
The last Republican president expressed similar concerns.
WARNING BY BUSH
George W. Bush delivered a gloomy speech this week that, without mentioning Donald Trump, warned about the degradation of American democracy, mean-spiritedness, racism, conspiracy-mongering, and attacks on open commerce.
"Free trade helped make America into a global economic power," Bush said. "We see a fading confidence in the value of free markets and international trade — forgetting that conflict, instability, and poverty follow in the wake of protectionism."
He said policy-makers should be sensitive to the painful effects globalization has had on some industries: "People are hurting. They are angry. And, they are frustrated. We must hear them and help them. But we can't wish globalization away, any more than we could wish away the agricultural revolution or the industrial revolution."
The Canadian government says it's been studying a variety of NAFTA contingency scenarios since last August.
Some of that work has involved the legal and political questions surrounding a breakup. But officials say multiple departments, including Global Affairs Canada and the Department of Finance, have also been conducting economic analysis of the potential impact of a NAFTA cancellation.
The former head of Foreign Affairs' computer-modelling unit, Dan Ciuriak, said he's working on a paper on different scenarios for the C.D. Howe Institute. His preliminary estimate is that the most drastic result — the end of free trade in North America — would see Canada's economy contract 2.5 per cent long-term, with a larger shock in the short term.


To Cite: Davarpanah A H. Diagnosis and Staging of Hepatocellular Carcinoma, Iran J Radiol. Online ahead of Print ; 14(Special Issue):e48398. doi: 10.5812/iranjradiol.48398.
Hepatocellular carcinoma (HCC) is the fifth most common tumor in the world, and its incidence is increasing. It is second most common cause of cancer related death worldwide and fastest growing cause of cancer death in the United States. Cirrhosis is the most important clinical risk factor for HCC, with approximately 80% of cases of HCC developing in patients with a cirrhotic liver. HCC differs from most malignancies because it is commonly diagnosed on the basis of imaging features alone, without histologic confirmation. The prognosis of HCC depends largely on the stage at which the tumor is detected. The detection of HCC early in its development, therefore, is critical to improve the survival of affected patients. In this talk, we discuss surveillance strategies with ultrasonography (US) as the primary screening imaging test as well as current state of the art for the imaging-based diagnosis and staging of HCC.


Premier Victor Ponta in Vienna in a debate at the Federal Economic Chamber of Austria said that he appreciated any company creating at least one job and offering a salary to Romanian employees.
'I came to voice my gratitude for all Austrian companies that have invested money and created jobs in our country and to give a positive message that we are interested in your investments and that we want to find solutions not only to guarantee them, but also to encourage you to invest more and to have more faith in the future of my country,' Premier Ponta said.
He admitted that there were areas in which Romania had to improve, mentioning the fight against corruption, the bureaucracy, and the lack in the capacity of absorbing European funds, for the infrastructure improvement in the first place, but also for the health and education systems.
The Romanian Premier told those present in the forum works that he came to Austria in order to give a strong message that this country and its companies were very important to Romania.
'I believe that Romania has a significant potential and I believe that Austria has made a strategic decision of investing in Romania,' Victor Ponta also said.
The Romanian Prime Minister appreciated that in the future there would be a competition among the European governments for creating a more favourable business environment. In this context, Ponta voiced his hope that he would be able to prove that he was not only the youngest Prime Minister in Europe, but also the most friendly with the business environment.
He also said that Romania's Government had to be proactive in relation with the big Austrian companies investing in Romania.
Victor Ponta pointed out that during the day he would meet the most important Austrian investors in Romania, OMV representatives included.
Premier Victor Ponta is paying an official visit to Austria, being accompanied by Transports Minister Ovidiu Silaghi and by the Business Environment Minister Delegate Lucian Isar.