text
stringlengths 1
1.57M
⌀ |
|---|
Q:
Why does the floatX's flag impact whether GPU is used in Theano?
I am testing Theano with GPU using the script provided in the tutorial for that purpose:
# Start gpu_test.py
# From http://deeplearning.net/software/theano/tutorial/using_gpu.html#using-gpu
from theano import function, config, shared, sandbox
import theano.tensor as T
import numpy
import time
vlen = 10 * 30 * 768 # 10 x #cores x # threads per core
iters = 1000
rng = numpy.random.RandomState(22)
x = shared(numpy.asarray(rng.rand(vlen), config.floatX))
f = function([], T.exp(x))
print(f.maker.fgraph.toposort())
t0 = time.time()
for i in xrange(iters):
r = f()
t1 = time.time()
print("Looping %d times took %f seconds" % (iters, t1 - t0))
print("Result is %s" % (r,))
if numpy.any([isinstance(x.op, T.Elemwise) for x in f.maker.fgraph.toposort()]):
print('Used the cpu')
else:
print('Used the gpu')
# End gpu_test.py
If I specify floatX=float32, it runs on GPU:
francky@here:/fun$ THEANO_FLAGS='mode=FAST_RUN,device=gpu2,floatX=float32' python gpu_test.py
Using gpu device 2: GeForce GTX TITAN X (CNMeM is disabled)
[GpuElemwise{exp,no_inplace}(<CudaNdarrayType(float32, vector)>), HostFromGpu(Gp
Looping 1000 times took 1.458473 seconds
Result is [ 1.23178029 1.61879349 1.52278066 ..., 2.20771813 2.29967761
1.62323296]
Used the gpu
If I do not specify floatX=float32, it runs on CPU:
francky@here:/fun$ THEANO_FLAGS='mode=FAST_RUN,device=gpu2'
Using gpu device 2: GeForce GTX TITAN X (CNMeM is disabled)
[Elemwise{exp,no_inplace}(<TensorType(float64, vector)>)]
Looping 1000 times took 3.086261 seconds
Result is [ 1.23178032 1.61879341 1.52278065 ..., 2.20771815 2.29967753
1.62323285]
Used the cpu
If I specify floatX=float64, it runs on CPU:
francky@here:/fun$ THEANO_FLAGS='mode=FAST_RUN,device=gpu2,floatX=float64' python gpu_test.py
Using gpu device 2: GeForce GTX TITAN X (CNMeM is disabled)
[Elemwise{exp,no_inplace}(<TensorType(float64, vector)>)]
Looping 1000 times took 3.148040 seconds
Result is [ 1.23178032 1.61879341 1.52278065 ..., 2.20771815 2.29967753
1.62323285]
Used the cpu
Why does the floatX flag impact whether GPU is used in Theano?
I use:
Theano 0.7.0 (according to pip freeze),
Python 2.7.6 64 bits (according to import platform; platform.architecture()),
Nvidia-smi 361.28 (according to nvidia-smi),
CUDA 7.5.17 (according to nvcc --version),
GeForce GTX Titan X (according to nvidia-smi),
Ubuntu 14.04.4 LTS x64 (according to lsb_release -a and uname -i).
I read the documentation on floatX but it didn't help. It simply says:
config.floatX String value: either ‘float64’ or ‘float32’
Default: ‘float64’
This sets the default dtype returned by tensor.matrix(),
tensor.vector(), and similar functions. It also sets the default
theano bit width for arguments passed as Python floating-point
numbers.
A:
As far as I know, it's because they haven't yet implemented float64 for GPUs.
http://deeplearning.net/software/theano/tutorial/using_gpu.html :
Only computations with float32 data-type can be accelerated. Better support for float64 is expected in upcoming hardware but float64 computations are still relatively slow (Jan 2010).
|
50 Cent reckons Ross drive-by a set up
50 Cent has accused rival rapper Rick Ross of staging the drive-by shooting that occurred in Florida earlier this week. As previously reported, Ross was seemingly targeted by gunmen as he drove in his Rolls Royce with his girlfriend Shateria L Moragne-el near his home in Fort Lauderdale.
Despite initial reports that the rapper’s car had been hit, and that the attack had cause Ross to crash the vehicle into a wall, it subsequently transpired that Ross, Moragne-el and the Rolls all escaped pretty much unscathed. Though it was reported that windows of nearby buildings had been smashed by bullets, and photos showed that the Rolls had swerved into some bushes.
However, the ever sympathetic 50 Cent reckons the lack of bullet holes in his rival’s car (not to mention in his rival) probably means the whole thing was a PR stunt to up Ross’s street cred. Tweeting on the incident, Fiddy said on Monday: “Hahaha fat boy hit the building? It looks staged to me. No holes in da car”.
Of course Fiddy and Ross have been beefing for some time.
NOW READ THIS RELATED ARTICLE!
Rick Ross escapes drive-by shooting A car in which rapper Rick Ross and his girlfriend Shateria L. Moragne-el were travelling was fired on in a drive-by shooting yesterday morning, according to reports. The couple asked not to be named in official statements on the incident, but eyewitnesses and (it seems) unnamed police sources have confirmed... |
History of collegiate wrestling
The history of collegiate wrestling can be traced to the many indigenous styles of folk wrestling found in Europe, particularly in Great Britain. Those folk wrestling styles soon gained popularity in what would become the United States, and by the end of the Civil War those styles, especially freestyle wrestling, emerged in gymnasiums and athletic clubs throughout the country. From then on, tournaments were sponsored and a professional circuit of wrestlers helped promote wrestling in the United States and throughout the world.
By the end of the 19th century, the Amateur Athletic Union was sponsoring competitions in freestyle wrestling, and by the start of the 20th century, colleges and universities were competing in dual meets and tournaments, and such events spread to high schools and lower age levels. During the 20th century, collegiate wrestling evolved into a distinctly American sport which was soon regulated by the National Collegiate Athletic Association (NCAA).
Wrestling in the American early colonial era
The roots of collegiate wrestling can be traced back almost as far as the earliest moments in United States history. There were already wrestling styles among Native Americans varying from tribe and nation by the 15th and 16th centuries, when the first Europeans settled. The English and French who settled on the North American continent sought out wrestling as a popular pastime. Soon, there were local champions in every settlement, with contests between them on a regional level. The colonists in what would become the United States started out with something more akin to Greco-Roman wrestling, but soon found that style too restrictive in favor of a style which a greater allowance of holds. In the backcountry of Virginia and the Carolinas, wrestling contests were among the favorite athletic events of Scots-Irish colonists. The brutality of the matches was so great that the Assembly of Virginia had to legislate against illegal holds by prohibiting "maiming 'by gouging, plunking or putting out an eye, biting, kicking or stomping upon'" an opponent. In the backcountry, these rules and laws were largely ignored.
The Irish were known for their "collar-and-elbow" style, in which wrestlers at the start of the match would grasp each other by the collar with one hand and by the elbow with the other. From this position, wrestlers sought to achieve a fall. If no fall occurred, the wrestlers would continue grappling both standing on their feet and on the ground until a fall was made. Irish immigrants later brought this style to the United States where it soon became widespread. There was also what became known as "catch-as-catch-can" wrestling, which had a particular following in Great Britain and the variant developed in Lancashire had a particular effect on future freestyle wrestling in particular. In catch-as-catch-can wrestling, both contestants started out standing and then a wrestler sought to hold his opponent's shoulder to the ground (known as a fall). If no fall was scored, both wrestlers continued grappling on the ground, and almost all holds and techniques were allowable. A Scottish variant of Lancashire wrestling also became popular, that began with both wrestlers standing chest to chest, grasping each other with locked arms around the body, and if no fall was made, with a match continuing on the ground.
Wrestling in the 18th- and 19th-century United States
By the 18th century, wrestling soon became recognized as a legitimate spectator sport, despite its roughness. It was the major physical contact sport among men of all classes, as boxing did not catch on until the 19th century. Among those who were well known for their wrestling techniques were several U.S. Presidents. George Washington was known to have had a wrestling championship in Virginia in the collar-and-elbow style that was county-wide and possibly colony-wide. At the age of 47, before he became President, Washington was still able to defeat seven challengers from the Massachusetts Volunteers. Andrew Jackson and Zachary Taylor, who favored wrestling as an army sport during his days in the Illinois Volunteers, were also well known for their wrestling. Abraham Lincoln, as a 21-year-old in 1830, was the wrestling champion of his county in Illinois. At this time, while working at a store in New Salem, Illinois, Lincoln had a famous bout with Jack Armstrong, also a county wrestling champion. Lincoln won decisively when, after losing his temper when Armstrong began fouling him, he slammed Armstrong to the ground and knocked him out. Two years later, while serving as a captain in the Illinois Volunteers during the Black Hawk War, Lincoln lost his only recorded match to a soldier in another unit by fall. Wrestling was also practiced by Andrew Johnson, Ulysses S. Grant, Chester A. Arthur, and Theodore Roosevelt (who always had an inclination to anything that involved physical exercise and did regular wrestling workouts throughout his service as Governor of New York). William Howard Taft who was the heaviest of the Presidents at his "best weight" of 225 lb wrestled collar-and-elbow and was also the intramural heavyweight wrestling champion at Yale University. Calvin Coolidge was described as a "tolerable good" wrestler by his father until around age 14 when he took to "duding around and daydreaming about being a big-city lawyer."
Wrestlers such as Abraham Lincoln did not settle for the collar-and-elbow as much as in a free-for-all style of wrestling that was widespread on the frontier. Since "catch-as-catch-can" wrestling was very similar, it gained great popularity in fairs and festivals in the United States during the 19th century. The collar-and-elbow style was also refined by later Irish immigrants, and gained great ground because of the success of George William Flagg from Vermont, the wrestling champion of the Army of the Potomac. After the Civil War, freestyle wrestling began to emerge as a distinct sport, and soon spread rapidly in the United States. Professional wrestling also emerged in the late 19th century (not like the "sports-entertainment" seen today). At the time of the first New York Athletic Club tournament in 1878 professional championship wrestling matches "offered purses of up to $1,000." By the 1880s, American wrestling became organized, with matches often being conducted alongside gymnastic meets and boxing tournaments in athletic clubs. The first national competition took place in 1887, with L. Chenowith of the Pastime Athletic Club winning the only weight class at 134 lb. The next year the Amateur Athletic Union (AAU) sanctioned its first national tournament, and soon became recognized as the governing body of American wrestling. The first college student-athlete to win a national championship was Winchester Osgood, a football player at the University of Pennsylvania, who won the 1895 National AAU Championship at the heavyweight division (then for wrestlers over 158 lb). Wrestling before the 20th century was dominated largely by independent athletic clubs and not by educational institutions. Prominent athletic clubs with wrestling teams included the National Turnverein of Newark, New Jersey, the Schuylkill Navy Athletic Club, St. George's Athletic Club, the Chicago Central YMCA, the Olympic Club of San Francisco, as well as various athletic clubs associated with ethnic groups such as the Chicago Hebrew Association. The National Turnverein produced George Nicholas Mehnert, who won six national AAU championships between 1902 and 1908 and lost only one of more than 100 matches to George Dole, then a student at Yale University. Mehnert was also a gold medalist at the Olympics of 1904 and 1908. Despite wrestling not yet being regulated by colleges and universities, hundreds of participants attended wrestling tournaments. The growth of cities, industrialization, and the closing of the frontier provided the necessary avenue for sports such as wrestling to increase in popularity.
The 20th Century: American wrestling becomes "Collegiate"
In 1903, the first intercollegiate dual meet took place between Yale University and Columbia University. Under the leadership of wrestling coaches Charles Mayser at Iowa State University, William "Billy" Sheridan from Lehigh University, Dr. Raymond G. Clapp from the University of Nebraska, and Hugo M. Otopalik at Iowa State University, collegiate wrestling began to gain ground in varsity athletics. The Eastern Intercollegiate Wrestling Association held its first tournament in 1905, which soon sparked many more wrestling tournaments for both college and university students and high school students. The Eastern Intercollegiate Wrestling Association remained under student leadership for over 30 years. Edward Clark Gallagher, a football and track and field athlete at Oklahoma A&M College (now Oklahoma State University–Stillwater), launched wrestling as an official varsity sport just before World War I and with his team launched a dynasty, with undefeated matches from 1921-1931. When Oklahoma A&M hosted the national AAU championship in 1925, Gallagher's varsity team won the team championship. Also, his junior varsity teams and unattached entries placed second. The two groups won almost all of the medals at that championship.
In 1927, Clapp published the rules for collegiate wrestling, and the next year, the first NCAA Wrestling Team Championship took place on March 30 to March 31 on the campus of Iowa State College. 40 wrestlers from 16 colleges participated, and it was among the first national championships sponsored by the NCAA, the second national championship after outdoor track and field in 1921 (and the third postseason NCAA meet after both outdoor track and field and swimming in 1924). Oklahoma State University won that first championship, which was an unofficial one, and later won the first official championship in 1929. Oklahoma State would win 27 of the first 45 Wrestling Team Championships in the Division I category, including seven straight between 1937 and 1946. In 1953, Penn State University became the first team outside of the Midwest to be awarded the national championship. One of the prominent champions during that period was Myron Roderick who won three straight individual championship as a wrestler at Oklahoma State (from 1954 to 1956. Later as a coach, Roderick would lead his teams to seven championships between 1958 and 1968.
The rules of collegiate wrestling developed by Raymond G. Clapp, which were eventually adopted by the Eastern Intercollegiate Wrestling Association, marked a sharp contrast to the freestyle wrestling rules of the International Amateur Wrestling Federation (IAWF; now known as United World Wrestling) and the AAU. From then on, collegiate wrestling emerged as a distinctly American sport. Yet American collegiate wrestlers made smooth transitions in the international styles, being able to win Olympic medals in freestyle wrestling at various games. College and high school wrestling grew especially after the standardization of the NCAA wrestling rules, which applied early on to both collegiate and scholastic wrestling (with high school modifications). More colleges, universities, and junior colleges began offering dual meets and tournaments, including championships and having organized wrestling seasons. There were breaks in wrestling seasons because of World War I and World War II, but in the high schools especially, state association wrestling championships sprung up in different regions throughout the 1930s and 1940s. As amateur wrestling grew after World War II, various collegiate athletic conferences also increased the number and quality of their wrestling competition. The pattern soon developed in which more wrestlers would make the progression of wrestling in high school, being recruited by college coaches, and then entering collegiate competition.
For most of the 20th century, collegiate wrestling was the most popular form of amateur wrestling in the country, especially in the Midwest and the Southwest. Wrestling matches in the United States were early on particularly long, particularly among those in the Greco-Roman style. The matches most often took place in rings that were 20 feet square and set apart by three ropes. Some schools, such as Oklahoma State University, even had the wrestling rings raised on a platform, much like that of a boxing ring. Although the rules of the AAU called for the referee to determine a winner after 15 minutes of wrestling if no fall occurred, the matches of the Eastern Intercollegiate Wrestling Association were finished by falls, even if it meant an hour or more of wrestling. By 1911, collegiate wrestling rules allowed the referee to determine a win in the absence of a fall after 15 minutes. The time limits have steadily decreased over the years of the 20th century. Yet for more than forty years into the 20th century, freestyle and its American counterpart collegiate wrestling did not have a scoring system. The introduction of a point system by Oklahoma A&M wrestling coach Art Griffith that gained acceptance in 1941 influenced the international styles as well. The following year, collegiate wrestling would mandatorily take place on open mats laid flat on the gymnasium floor; the rings and ropes were now illegal. This further made collegiate wrestling distinct from its professional counterpart, which would soon become more entertainment than sport.
The 1960s and 1970s saw major developments in collegiate wrestling, with the emergence of the United States Wrestling Federation (USWF) (later called the United States Wrestling Association (USWA) and now known as USA Wrestling (USAW)). The USWF, with its membership of coaches, educators, and officials, became recognized eventually as the official governing body of American wrestling and as the official representative to the United States Olympic Committee, in place of the Amateur Athletic Union. Soon, the Division II wrestling team championship was established in 1963. Western State (Colorado) won the first team championship in that division. The Division III wrestling team championship was established in 1974 with Wilkes University winning the first team championship. Collegiate wrestlers in the 1960s, 1970s, and 1980s as usual made strides in the international styles, but were more well known for their scholastic and collegiate wrestling achievements. These wrestlers include Dan Gable, who won the Olympic gold medal in 1972 and was the Olympic freestyle coach in 1984, but was more famous for his 15 team championships as coach at the University of Iowa. John Smith also won gold medals at the Goodwill Games against a Soviet in Moscow and at the Olympic Games in 1988 and 1992. He is best known however for his two NCAA championships and his 90 straight victories for Oklahoma State University, where he later became a championship-winning coach. Ed and Lou Banach together won five individual NCAA championships for Iowa and were able to win gold medals at the 1984 Olympics. Wade Schalles of Clarion University earned a record of 821 victories, with 530 falls, which earned him a place in the Guinness Book of World Records as amateur wrestling's "all-time winning and pinning leader." Other high-achieving collegiate wrestlers who have had national, international, and Olympic wrestling championship careers include Robin Reed, Kenny Monday, Cael Sanderson, Temoer Terry, Bruce Baumgartner, and Kurt Angle (who would also become a major star in professional wrestling).
Today, on the collegiate level, several universities are known for regularly having competitive wrestling teams. The Iowa Hawkeyes (University of Iowa) wrestling team, the Oklahoma State Cowboys (Oklahoma State University) wrestling team, the Iowa State Cyclones (Iowa State University) wrestling team, and the Oklahoma Sooners (University of Oklahoma) wrestling team are four of the most storied and honored programs in the country and have won the majority of NCAA wrestling team championships. Other wrestling programs that were or are at the top include the wrestling teams of the Minnesota Golden Gophers (University of Minnesota), Ohio State Buckeyes (Ohio State University), the Oregon State Beavers (Oregon State University), the Lehigh Mountain Hawks (Lehigh University), the Penn State Nittany Lions (Pennsylvania State University), the Pittsburgh Panthers (University of Pittsburgh), the now-defunct Omaha Mavericks (University of Nebraska Omaha), the Northwestern Wildcats (Northwestern University), the Northern Iowa Panthers (University of Northern Iowa), Augsburg College, and Wartburg College. Collegiate wrestling teams compete for the NCAA wrestling championship each year. The NCAA awards individual championships in the 10 weight classes, as well as a team title. The Dan Gable International Wrestling Institute and Museum is located in Waterloo, Iowa. The Oklahoma State campus in Stillwater, Oklahoma is host to the National Wrestling Hall of Fame and Museum. Today, the various state high school associations also host annual wrestling championships for individuals and for teams.
See also
Collegiate wrestling
Amateur wrestling
Freestyle wrestling
Greco-Roman wrestling
Folk wrestling
Professional wrestling
Collegiate wrestling moves
Notes
References
External links
National Wrestling Hall of Fame and Museum
Category:College wrestling in the United States
Category:History of college sports in the United States
Category:Combat sports |
//
// Copyright(c) 2015 Gabi Melman.
// Distributed under the MIT License (http://opensource.org/licenses/MIT)
//
#pragma once
// Helper class for file sink
// When failing to open a file, retry several times(5) with small delay between the tries(10 ms)
// Can be set to auto flush on every line
// Throw spdlog_ex exception on errors
#include <spdlog/details/os.h>
#include <spdlog/details/log_msg.h>
#include <chrono>
#include <cstdio>
#include <string>
#include <thread>
#include <cerrno>
namespace spdlog
{
namespace details
{
class file_helper
{
public:
const int open_tries = 5;
const int open_interval = 10;
explicit file_helper() :
_fd(nullptr)
{}
file_helper(const file_helper&) = delete;
file_helper& operator=(const file_helper&) = delete;
~file_helper()
{
close();
}
void open(const filename_t& fname, bool truncate = false)
{
close();
auto *mode = truncate ? SPDLOG_FILENAME_T("wb") : SPDLOG_FILENAME_T("ab");
_filename = fname;
for (int tries = 0; tries < open_tries; ++tries)
{
if (!os::fopen_s(&_fd, fname, mode))
return;
std::this_thread::sleep_for(std::chrono::milliseconds(open_interval));
}
throw spdlog_ex("Failed opening file " + os::filename_to_str(_filename) + " for writing", errno);
}
void reopen(bool truncate)
{
if (_filename.empty())
throw spdlog_ex("Failed re opening file - was not opened before");
open(_filename, truncate);
}
void flush()
{
std::fflush(_fd);
}
void close()
{
if (_fd)
{
std::fclose(_fd);
_fd = nullptr;
}
}
void write(const log_msg& msg)
{
size_t msg_size = msg.formatted.size();
auto data = msg.formatted.data();
if (std::fwrite(data, 1, msg_size, _fd) != msg_size)
throw spdlog_ex("Failed writing to file " + os::filename_to_str(_filename), errno);
}
size_t size()
{
if (!_fd)
throw spdlog_ex("Cannot use size() on closed file " + os::filename_to_str(_filename));
return os::filesize(_fd);
}
const filename_t& filename() const
{
return _filename;
}
static bool file_exists(const filename_t& name)
{
return os::file_exists(name);
}
private:
FILE* _fd;
filename_t _filename;
};
}
}
|
Prevalence of Hepatitis C virus and its risk factors in blood donors in district Peshawar.
The current study was designed in order to elucidate the most sensitive method for daily practice as well as to evaluate the risk factors for HCV infection associated with blood transfusion in District Peshawar. A total of 1400 healthy volunteer blood donors were tested for Anti-HCV. A questionnaire was used to evaluate the risk factors. Initial testing of all blood samples was done by Immuno Chromatographic Technique (ICT) and confirmed by micro particle enzyme immunoassay (MEIA) and Enzyme Linked Immunosorbent Assay (ELISA). The comparison among ICT, ELISA and MEIA techniques was also evaluated for the purpose of sensitivity. Among 1400 blood donors, 26 (1.85%) cases were found positive for Anti-HCV. These 26 cases were positive on MEIA, 16 individuals were positive on ELISA while 14 were positive on ICT. These 26 cases had different histories of dental treatment (50%), traveled abroad (23.07%), surgery (11.53%), blood transfusion (7.69%) and unknown reason (7.69%). Among all these different histories of dental treatment and blood transfusion were the main risk factors for HCV infection. The results revealed that MEIA is a quick and reliable technique for routine screening of blood donors particularly for controlling the spread of HCV. |
Q:
Black hole no-hair theorems vs. entropy and surface area
I was revisiting some old popular science books a while ago and two statements struck me as incompatible.
No-hair theorems: a black hole is fully-described by just a few numbers (mass, spin etc) irrespective of the type or configuration of the matter/energy within the event horizon.
Surface area measures entropy: you can't reduce the total entropy of the universe by throwing a box of hot gas into a black hole, its size/entropy will increase by the necessary amount.
Suppose I have two black holes, A and B. They are identical and interchangeable, same mass, spin, charge...
I have two boxes, Box A and Box B. Box A contains a kilogram of salt in the form of a single crystal and Box B contains a kilogram of salt as loose powder. BoxA has less entropy than Box B but is otherwise identical.
I throw Box A into A and Box B into B.
The no-hair theorems seem to imply that A and B will increase in size by the same amount. The entropy theorems seem to imply that B will end up larger than A.
What am I missing here?
A:
Here is my answer. I should preface it by warning that this is a subject that can provoke intense discussion, and I'm sure there are physicists would would disagree. You should be aware that I'm an expert on thermodynamics but not on general relativity.
But basically, as far as I understand it, the process of converting matter into black-hole-stuff is an irreversible one, in the usual macroscopic sense. Throwing your boxes of salt into identical black holes is somewhat analogous to what would happen if you emptied them into two identical vats of water. You would end up with two identical vats of salty water, with the same mass, temperature, and salt concentration, and the same entropy.
The no hair theorem for black holes is an asymptotic one. It says that if you throw some stuff into a black hole and wait long enough, the black hole will become an arbitrarily good approximation to an "ideal" black hole (which is to say, a black hole solution of Einstein's equations), which can can be completely described by its mass, charge and spin. It also says (I believe) that this convergence happens rather rapidly. But converging towards something is not the same as ever actually reaching it. In reality, nothing can cross the event horizon as seen from an outside perspective (see my answer to this question), it just gets very hard to detect because its light is red-shifted to extremely long wavelengths.
So in my view the apparent loss of information comes from assuming that the black hole actually becomes an ideal one rather than just closely approximating it. It's very similar to the question of how the entropy of an isolated vat of salt+water can increase as the salt dissolves, even though on the microscopic level, the laws of physics seem to preserve information. The resolution is that when you switch to a macroscopic description (in terms of temperature, pressure etc.), you throw away some information about the microscopic state. After the salt has dissolved, the information about its previous state (crystal or powder) is still there, but it's hidden in fine correlations between the molecules' motions. When you choose to describe the final state as an equilibrium ensemble you're basically admitting that those fine correlations can never practically be measured, and therefore choosing to ignore them. Similarly, when you choose to approximate a real black hole as an ideal one, you're basically choosing to ignore any information about what kind of salt was thrown into it in the past, on the basis that there's no longer any practical way to recover it. In both cases, the fundamental reason for the increase in entropy is the same.
Note that I'm not saying the box's entropy increases as it passes the event horizon. I'm actually saying that the box never crosses the event horizon, as seen from an outside point of view. That would take an infinite amount of time. However, the outside observer would very rapidly find the box very hard to see due to the red-shifting. At some point you, as the observer, might decide as an approximation that the box might as well have crossed the event horizon, since you basically can't detect it anymore. When you do this, your approximation has a higher entropy than the "real" black hole, and that's where the entropy increase comes from.
That might seem like a weird concept. But in fact all increases in entropy are due to approximations of one kind or another. In principle you could always reverse the velocities of every particle making up a system and watch it "run backwards in time" to its initial state (unscrambling an egg or whatever). So the information about the initial conditions is always still there. We just treat things as irreversible (i.e. information-destroying or entropy-producing) because it's a very useful approximation that helps us make predictions about macroscopic systems.
Of course, the observer falling in with the box of salt would not want to make the same approximation as the outside observer. It would be a bad approximation from the infalling observer's point of view, because she can still see the box perfectly clearly. (If it's a big enough black hole it won't even get torn apart.) But that's ok - although we often treat it as an observer-independent physical quantity, entropy is actually observer-dependent, even for everyday things like gases. See this rather wonderful paper by Edwin Jaynes. (Jaynes, E. T., 1992, `The Gibbs Paradox, ' in Maximum-Entropy and Bayesian Methods, G. Erickson, P. Neudorfer, and C. R. Smith (eds.), Kluwer, Dordrecht).
|
Attractive photons in a quantum nonlinear medium.
The fundamental properties of light derive from its constituent particles--massless quanta (photons) that do not interact with one another. However, it has long been known that the realization of coherent interactions between individual photons, akin to those associated with conventional massive particles, could enable a wide variety of novel scientific and engineering applications. Here we demonstrate a quantum nonlinear medium inside which individual photons travel as massive particles with strong mutual attraction, such that the propagation of photon pairs is dominated by a two-photon bound state. We achieve this through dispersive coupling of light to strongly interacting atoms in highly excited Rydberg states. We measure the dynamical evolution of the two-photon wavefunction using time-resolved quantum state tomography, and demonstrate a conditional phase shift exceeding one radian, resulting in polarization-entangled photon pairs. Particular applications of this technique include all-optical switching, deterministic photonic quantum logic and the generation of strongly correlated states of light. |
Berklee College of Music presents Israeli pianist and composer Yakir Arbib, premiering his new piece, Waves of Visions, at the John F. Kennedy Center for the Performing Arts, in Washington, D.C., Friday, April 12. The concert is part of the Kennedy Center's Conservatory Project, a showcase for outstanding students from America's finest music colleges and conservatories.
Blind from birth, Arbib has the gift of synesthesia (a blending of the senses), allowing him to "see" tones as distinct colors. It inspired his new piece, Waves of Visions, a collaboration with visual artist Tamar Haber-Schaim, whose drawings, both pre-drawn and dynamically live-drawn with a Wacom Cintiq pen display, will be projected during the performance, influencing the musicians and vice versa. Arbib's most ambitious work to date, Waves of Visions is a seven-movement suite for flute, cello, piano, and drums. In addition to Arbib and Haber-Schaim, performers include flutist Milena Jancuric, cellist Naseem Alatrash, and percussionist Roberto Giaquinto.
Arbib, who composes entire pieces in his head before entering the music into a notation program like Sibelius or Finale, compares his writing process to a journey into the unknown. "The colors I visualize create a map, or landscape, that's out there to be explored. It's like, I know there's a desert, but I haven't been there yet. Are there scorpions here? No one told me!" says Arbib. "Tamar's visuals have a distinct presence I can connect to without looking. It's almost like I'm hearing them in the music, as if they're a fifth musical instrument."
The concert is free and open to the public and takes place on Friday, April 12, 6:30 pm, at the John F. Kennedy Center for the Performing Arts, 2700 F Street NW, in Washington, D.C. Over the past nine years of Conservatory Project performances at the Kennedy Center, Berklee students have presented jazz, country, salsa, bluegrass, and an improvising string orchestra. Past performances can be viewed at the Kennedy Center's website.
Yakir Arbib was born in Jerusalem in 1989 and studied classical and jazz throughout his childhood. In 2008 he won the Massimo Urbani International Jazz Award in Italy and was signed by Philology Jazz Records. Since Arbib began his studies at Berklee in 2009, he has made a radical return to classical music, studying under piano chair Stephany Tiernan and composition chair Arnold Friedman. He has been composing and performing avant-garde classical music, appearing in prestigious halls such as Steinert Hall in Boston, and Felicja Blumental Center in Tel Aviv. His compositions have been performed by the Kalistos Chamber Orchestra and the Triple Helix Piano Trio.
Tamar Haber-Schaim is a visual artist who has developed her own minimalist approach to illustration, graphic design, and animation. Her work has appeared in the New York Times, British Vogue, Der Spiegel, and Atlantic Monthly. Her three mediums – line drawing, cut paper, and digital work – have appeared in international art annuals and exhibitions, including a solo exhibition in Germany. She has animated and produced televisions commercials using all three of these techniques.
The John F. Kennedy Center for the Performing Arts is the nation's busiest performing arts facility and annually hosts approximately 2,000 performances for audiences totaling nearly two million; Center related touring productions, television, and radio broadcasts welcome 40 million more. Now in its 40th season, the Center presents performances of music, dance, and theater; supports artists in the creation of new work; and serves the nation as a leader in arts education. |
Billy Godwin
Billy Godwin (born November 19, 1964) is an American college baseball coach and former pitcher. He is the head baseball coach at the University of North Carolina at Greensboro. Godwin played college baseball at Atlantic Christian College in 1986. He was the head baseball coach of East Carolina from 2006 to 2014. In , Godwin was listed as an area scout, based in Emerald Isle, North Carolina, for the New York Yankees of Major League Baseball.
Early years
Godwin was born in Rocky Mount, North Carolina, and attended Northern Nash High School. He then earned an athletic scholarship as a pitcher in 1982 to attend Atlantic Christian College, now Barton College. He was named team captain in 1986 and Kiwanis Award for the Most Outstanding Male Student-Athlete. He graduated in 1986 in Business Administration. His first coaching job came at North Carolina Wesleyan College in 1989 and 1990. He was the assistant coach to current UNC head coach Mike Fox. The two guided NCWC to the NCAA Division 3 baseball championship in 1989 and a third-place finish a year later.
Head coach
Godwin's first head coaching stint came at Enfield Academy, a private school in Nash County, North Carolina. Starting in 1991 he was the athletic director and head baseball coach. During the seven seasons (1991–1997) as head coach, he accumulated a 131–57 (.697) record. During this time Enfield Academy baseball team had five consecutive conference championships, four straight Final Four appearances and a state title in 1994.
After Enfield Academy, Godwin became Cary Academy's first athletic director in 1997.
Godwin's next head coaching job came at Louisburg College. During his six-year term, he earned a 262–85 (.755) overall record. During the 2005 season, Godwin guided the Hurricanes to Region X regular season and tournament titles on his way to earning Region X Coach-of-the-Year honors. The 2005 Hurricanes finished the regular season with a 49–13 record and stood sixth nationally in the NJCAA Division I final regular season poll. In 2004, the Hurricanes went 40–18 and claimed the top seed at the Region X Tournament before finishing the campaign as a regional finalist.
After taking the helm at Louisburg College in the fall of 1999, Godwin kept the Hurricanes in the national spotlight by averaging 43 wins per season. The Hurricanes finished with a school-record 51–11 mark in 2002 and made their tenth trip to the College World Series in Grand Junction, Colorado. During his tenure at Louisburg, Godwin earned Region X and Eastern District Coach-of-the-Year honors, received the North Carolina College Coach-of-the-Year award in 2002.
East Carolina
Godwin first came to ECU as an assistant coach on June 9, 2005. After Randy Mazey resigned his position as head coach, Godwin was tapped as interim head coach on October 10, 2005, then was named permanently to the position on October 28, 2005. For his first year as head coach, his record was 33–26.
Godwin's team also earned many awards and recognition during his first year. Senior catcher Jake Smith earned the Johnny Bench Award, which is given annually to the nations top collegiate catcher. Four Pirates earned All-Conference honors. The 2006 Pirates ranked among the league leaders (all games) in average (.305), runs scored (381), total bases (939), slugging percentage (.452), hits (633), triples (13), RBI (342), home runs (58), ERA (4.34), runs allowed (296), opposing batting average (.282) and runners picked off (10). His 2009 team made it to the Super Regionals before losing to the University of North Carolina at Chapel Hill. Godwin earned a master's degree in education in 1995 from East Carolina University.
UNC Greensboro
On August 8, 2019, Godwin was named the head baseball coach at the University of North Carolina at Greensboro.
Head coaching records
Below is a table of Godwin's yearly records as an NCAA head baseball coach.
References
External links
Godwin Official Biography
Category:1964 births
Category:Living people
Category:Barton Bulldogs baseball players
Category:Baseball pitchers
Category:East Carolina Pirates baseball coaches
Category:East Carolina University alumni
Category:High school baseball coaches in the United States
Category:Louisburg Hurricanes baseball coaches
Category:New York Yankees scouts
Category:North Carolina Wesleyan Battling Bishops baseball coaches
Category:UNC Greensboro Spartans baseball coaches
Category:People from Rocky Mount, North Carolina
Category:People from Emerald Isle, North Carolina |
Álvaro Mesén
Álvaro Mesén Murillo (born December 24, 1972) is a retired Costa Rican footballer.
Club career
Upon club legend Alejandro González Rojas's retirement in September 1990, then-sixteen years old Álvaro Mesén was called upon to the Alajuelense senior team to backfill the third-choice goalkeeper position, behind the more experienced pair of Desiderio Calvo and Paul Mayorga; however upon the signing of former Herediano goalkeeper José Alexis Rojas in early 1991, Mesén was sent back to the youth teams. Rojas's signing had the purpose of adding experience to Alajuelense's door, which was lacking upon González's retirement as Mayorga and Calvo only started a handful of games in the past two seasons, and neither one of them could keep the other's faults in check.
Mesén made his league debut for Carmelita on 6 March 1993 against Turrialba during the 1992-93 season before heading back to parent club Alajuelense ahead of the 1993-94 season.
Mesén eventually became an understudy to Rojas who was the first-choice goalkeeper, and rose to first-choice keeper himself ahead of the 1997-98 season, when Rojas's career ended at Alajuelense as a result of being on the receiving end of an eight-match ban (as he was involved in a post-match brawl after a match against Saprissa in June 1997--Mesén also was involved in said brawl but received a minor ban), causing the Alajuelense's Board of Directors to show him the door as Rojas was going to be unavailable for six matches (having served two on the 1996-97 season's finals).
He went on to play 207 league games for Liga, scoring one goal, a penalty in the 1999-2000 season.
He also played for Herediano and Brujas before finishing his career at Liberia Mía, after joining them in 2007.
International career
Mesén made his debut for Costa Rica in a November 1999 friendly match against Slovakia and earned a total of 38 caps, scoring no goals. He represented his country in 15 FIFA World Cup qualification matches and was a non-playing squad member at the 2002 and 2006 FIFA World Cups.
He also played at the 2003 UNCAF Nations Cup as well as at the 2002, 2003 and 2005 CONCACAF Gold Cups. He also was a non-playing squad member at the 2000 CONCACAF Gold Cup.
His final international was a May 2006 friendly match against the Czech Republic.
He has also become known for his activism, having been appointed as a FIFA ambassador in 2001 and supporting the 2002 FIFA World Cup Global March Against Child Labour campaign.
Retirement
After retiring in 2010, Mesén became the new secretary-general of Fedefutbol in September 2012. He has a master's degree in business administration. He resigned from Fedefutbol in February 2013.
References
External links
2002 World Cup Profile - Nación
Category:1972 births
Category:Living people
Category:People from Alajuela
Category:Association football goalkeepers
Category:Costa Rican footballers
Category:Costa Rica international footballers
Category:2002 CONCACAF Gold Cup players
Category:2002 FIFA World Cup players
Category:2003 UNCAF Nations Cup players
Category:2003 CONCACAF Gold Cup players
Category:2005 CONCACAF Gold Cup players
Category:2006 FIFA World Cup players
Category:A.D. Carmelita footballers
Category:Liga FPD players
Category:L.D. Alajuelense footballers
Category:C.S. Herediano footballers
Category:Brujas FC players
Category:Municipal Liberia footballers
Category:Association football goalkeepers who have scored
Category:Copa Centroamericana-winning players |
/**
* Merge object b with object a.
*
* var a = { foo: 'bar' }
* , b = { bar: 'baz' };
*
* merge(a, b);
* // => { foo: 'bar', bar: 'baz' }
*
* @param {Object} a
* @param {Object} b
* @return {Object}
* @api public
*/
exports = module.exports = function(a, b){
if (a && b) {
for (var key in b) {
a[key] = b[key];
}
}
return a;
};
|
Validation of a novel non-biological bench model for the training of percutaneous renal access.
The percutaneous renal access (PRA) is the most critical step of percutaneous renal surgery (PRS). For the training of PRA in the lab, a novel non-biological bench model was developed and set for validation test. Experts in PRS (> 60 cases) and novices were included to perform fluoroscopy guided PRA on the model. Overall time, X-ray exposure time and puncture attempts were recorded to establish construct validity. After accomplishment, the experts rated the model using a standardized questionnaire for face and content validity based on a 5-point Likert scale, with 1 denoting very bad and 5 as excellent. Baseline and post-training data of novices were analyzed for skill acquisition. 9 experts and 30 novices were finally included. The overall appraisal was 4 by the experts, and consensus of all experts was reached for the model as an excellent training tool. Significant difference between experts and novices was detected with the experts using less total time 183.11 ± 29.40 vs. 278.00 ± 50.30 seconds (P < 0.001), shorter X-ray exposure time 109.22 ± 19.93 vs. 183.13 ± 38.83 seconds (P < 0.001), and fewer attempts 1.28 ± 0.44 vs. 2.35 ± 0.65 (P < 0.001). After training, the novices demonstrated significant skill improvement in total and fluoroscopy time, and number of attempts (P < 0.001). Our non-biological model provides a new method for PRA training. The face, content and construct validity were demonstrated. This model allows contact with PRA skills and could be applied to the first step in the learning curve. |
For your convenience this canvas is painted on the sides, so
it's ready to hang without the need of a frame.
Framing is your option.You can also purchase PRINTS of this painting. These prints from Fine Art America come in
various sizes, and many options are available.
Check it out at:http://www.mike-caitham.artistwebsites.com
Two rowboats tied up moored by the shoreline at sunset.
For your convenience this canvas is painted on the sides, so
it's ready to hang without the need of a frame.
Framing is your option.You can also purchase PRINTS of this painting. These prints from Fine Art America come in
various sizes, and many options are available.
Check it out at:http://www.mike-caitham.artistwebsites.com
Available Paintings by Mike Caitham
Currency Converter
This is only an estimate.
The final currency conversion will be done by PayPal during checkout.
Amount (US $):
Convert To:
Effective 12/9/2016
Your DPW PayPal Checkout is almost set up!
Thank you for granting DPW permission to create a PayPal checkout on your behalf.
In addition to granting permission, you also need to make sure that you have: |
Introduction {#Sec1}
============
Due to the estimation of least squares regression coefficients in linear regression and nonparametric curve estimation, it is very interesting and meaningful to study the limit behaviors for the weighted sums of random variables.
We recall the concept of $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing random variables.
Definition 1.1 {#FPar1}
--------------
Let $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{X_{n},n\\geq1\\}$\\end{document}$ be a sequence of random variables defined on a probability space $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$(\\Omega, {\\mathcal {F}}, P)$\\end{document}$. For any $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$S\\subset N=\\{1,2,\\ldots\\}$\\end{document}$, define $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}${\\mathcal {F}}_{S}=\\sigma(X_{i}, i\\in S)$\\end{document}$. Given two *σ*-algebras $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}${\\mathcal {A}}$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}${\\mathcal {B}}$\\end{document}$ in $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}${\\mathcal {F}}$\\end{document}$, put $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\rho({\\mathcal {A}},{\\mathcal {B}})=\\sup \\biggl\\{ \\frac{EXY-EXEY}{\\sqrt {E(X-EX)^{2}E(Y-EY)^{2}}}: X\\in L_{2}({\\mathcal {A}}), Y\\in L_{2}({\\mathcal {B}}) \\biggr\\} . $$\\end{document}$$ Define the $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing coefficients by $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\rho^{*}_{n}=\\sup\\bigl\\{ \\rho({\\mathcal {F}}_{S}, {\\mathcal {F}}_{T}): S, T\\subset N \\operatorname{ with }\\operatorname{dist}(S,T) \\geq n\\bigr\\} , $$\\end{document}$$ where $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\operatorname{dist}(S,T)=\\inf\\{|s-t|: s\\in S, t\\in T\\}$\\end{document}$. Obviously, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0\\leq\\rho ^{*}_{n+1}\\leq\\rho^{*}_{n}\\leq\\rho^{*}_{0}=1$\\end{document}$. Then the sequence $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{X_{n},n\\geq1\\}$\\end{document}$ is called $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing if there exists $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$k\\in N$\\end{document}$ such that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}_{k}<1$\\end{document}$.
A number of limit results for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing sequences of random variables have been established by many authors. We refer to Bradley \\[[@CR3]\\] for the central limit theorem, Bryc and Smolenski \\[[@CR4]\\], Peligrad and Gut \\[[@CR5]\\], and Utev and Peligrad \\[[@CR6]\\] for the moment inequalities, and Sung \\[[@CR1]\\] for the complete convergence of weighted sums.
Special cases for weighted sums have been studied by Bai and Cheng \\[[@CR7]\\], Chen et al. \\[[@CR8]\\], Choi and Sung \\[[@CR9]\\], Chow \\[[@CR10]\\], Cuzick \\[[@CR11]\\], Sung \\[[@CR12]\\], Thrum \\[[@CR13]\\], and others. In this paper, we focus on the array weights $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk}, 1\\le k\\le n, n\\ge1\\}$\\end{document}$ of real numbers satisfying $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ \\sup_{n\\geq1}n^{-1}\\sum^{n}_{k=1}|a_{nk}|^{\\alpha}< \\infty $$\\end{document}$$ for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$. In fact, under condition ([1.1](#Equ1){ref-type=""}), many authors have studied the limit behaviors for the weighted sums of random variables.
Let $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{X, X_{n}, n\\geq1\\}$\\end{document}$ be a sequence of independent and identically distributed random variables. When $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=2$\\end{document}$, Chow \\[[@CR10]\\] showed that the Kolmogorov strong law of large numbers $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ n^{-1}\\sum^{n}_{k=1}a_{nk}X_{k} \\rightarrow0 \\quad \\mbox{a.s.} $$\\end{document}$$ holds if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX^{2}<\\infty$\\end{document}$. Cuzick \\[[@CR11]\\] generalized Chow's result by showing that ([1.2](#Equ2){ref-type=""}) also holds if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{\\beta}<\\infty$\\end{document}$ for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ with $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1$\\end{document}$. Bai and Cheng \\[[@CR7]\\] proved that the Marcinkiewicz--Zygmund strong law of large numbers $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ n^{-1/p}\\sum^{n}_{k=1}a_{nk}X_{k} \\rightarrow0 \\quad \\mbox{a.s.} $$\\end{document}$$ holds if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{\\beta}<\\infty$\\end{document}$, where $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq p<2$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha +1/\\beta=1/p$\\end{document}$. Chen and Gan \\[[@CR14]\\] showed that if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< p<1$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{\\beta}<\\infty$\\end{document}$, then ([1.3](#Equ3){ref-type=""}) still holds without the independent assumption.
Under condition ([1.1](#Equ1){ref-type=""}), a convergence rate in the strong law of large numbers is also discussed. Chen \\[[@CR15]\\] showed that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ \\sum^{\\infty}_{n=1}n^{r-2}P\\Biggl\\{ \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum^{m}_{k=1}a_{nk}X_{k} \\Biggr\\vert >\\varepsilon n^{1/p}\\Biggr\\} < \\infty,\\quad \\forall \\varepsilon>0, $$\\end{document}$$ if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{X, X_{n}, n\\geq1\\}$\\end{document}$ is a sequence of identically distributed negatively associated (NA) random variables with $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{(r-1)\\beta}<\\infty$\\end{document}$, where $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r>1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1/p$\\end{document}$, and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$. The main tool used in Chen \\[[@CR15]\\] is the exponential inequality for NA random variables (see Theorem 3 in Shao \\[[@CR16]\\]). Sung \\[[@CR1]\\] proved ([1.4](#Equ4){ref-type=""}) for a sequence of identically distributed $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing random variables with $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{rp}<\\infty$\\end{document}$, where $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$, by using the Rosenthal moment inequality. Since the Rosenthal moment inequality for NA has been established by Shao \\[[@CR16]\\], it is easy to see that Sung's result also holds for NA random variables. However, for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing random variables, we do not know whether the corresponding exponential inequality holds or not, and so the method of Chen \\[[@CR15]\\] does not work for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing random variables. On the other hand, the method of Sung \\[[@CR1]\\] is complex and not applicable to the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha\\leq rp$\\end{document}$.
In this paper, we show that ([1.4](#Equ4){ref-type=""}) holds for a sequence of identically distributed $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing random variables with suitable moment conditions. The moment conditions for the cases $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$ are optimal. The moment conditions for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp$\\end{document}$ are nearly optimal. Although the main tool is the Rosenthal moment inequality for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho ^{*}$\\end{document}$-mixing random variables, our method is simpler than that of Sung \\[[@CR1]\\] even in the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$.
We also extend ([1.4](#Equ4){ref-type=""}) to complete moment convergence, that is, we provide moment conditions under which $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ \\sum^{\\infty}_{n=1}n^{r-2-q/p} E \\Biggl( \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum^{m}_{k=1}a_{nk}X_{k} \\Biggr\\vert -\\varepsilon n^{1/p} \\Biggr)_{+}^{q}< \\infty,\\quad \\forall\\varepsilon>0, $$\\end{document}$$ where $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>0$\\end{document}$.
Note that if ([1.5](#Equ5){ref-type=""}) holds for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>0$\\end{document}$, then ([1.4](#Equ4){ref-type=""}) also holds. The proof is well known.
Throughout this paper, *C* always stands for a positive constant that may differ from one place to another. For events *A* and *B*, we denote $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$I(A, B)=I(A\\cap B)$\\end{document}$, where $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$I(A)$\\end{document}$ is the indicator function of an event *A*.
Preliminary lemmas {#Sec2}
==================
To prove the main results, we need the following lemmas. The first one belongs to Utev and Peligrad \\[[@CR6]\\].
Lemma 2.1 {#FPar2}
---------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q\\geq2$\\end{document}$, *and let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{X_{n}, n\\ge1\\}$\\end{document}$ *be a sequence of* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-*mixing random variables with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX_{n}=0$\\end{document}$ *and* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X_{n}|^{q}<\\infty$\\end{document}$ *for every* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\ge1$\\end{document}$. *Then for all* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\ge1$\\end{document}$, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$E\\max_{1\\le m\\le n} \\Biggl\\vert \\sum_{k=1}^{m}X_{k} \\Biggr\\vert ^{q} \\le C_{q} \\Biggl\\{ \\sum _{k=1}^{n} E|X_{k}|^{q}+ \\Biggl( \\sum_{k=1}^{n}E|X_{k}|^{2} \\Biggr)^{q/2} \\Biggr\\} , $$\\end{document}$$ *where* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$C_{q}>0$\\end{document}$ *depends only on* *q* *and the* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-*mixing coefficients*.
Remark 2.1 {#FPar3}
----------
By the Hölder inequality, ([1.1](#Equ1){ref-type=""}) implies that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\sup_{n\\geq1}n^{-1}\\sum^{n}_{k=1}|a_{nk}|^{s}< \\infty $$\\end{document}$$ for any $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< s\\leq\\alpha$\\end{document}$, and $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\sup_{n\\geq1}n^{-q/\\alpha}\\sum^{n}_{k=1}|a_{nk}|^{q}< \\infty $$\\end{document}$$ for any $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>\\alpha$\\end{document}$. These properties will be used in the proofs of the following lemmas and main results.
Lemma 2.2 {#FPar4}
---------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r\\geq1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ *with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1/p$\\end{document}$, *and let* *X* *be a random variable*. *Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk},1\\leq k\\leq n, n\\geq1\\}$\\end{document}$ *be an array of constants satisfying* ([1.1](#Equ1){ref-type=""}). *Then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ \\sum^{\\infty}_{n=1}n^{r-2}\\sum ^{n}_{k=1}P\\bigl\\{ \\vert a_{nk}X \\vert >n^{1/p}\\bigr\\} \\leq \\textstyle\\begin{cases} C E \\vert X \\vert ^{(r-1)\\beta} &\\textit{if }\\alpha< rp, \\\\ C E \\vert X \\vert ^{(r-1)\\beta}\\log(1+ \\vert X \\vert ) &\\textit{if }\\alpha=rp, \\\\ C E \\vert X \\vert ^{rp} &\\textit{if }\\alpha>rp. \\end{cases} $$\\end{document}$$
Proof {#FPar5}
-----
Case 1: $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha\\leq rp$\\end{document}$. We observe by the Markov inequality that, for any $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>0$\\end{document}$, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &P\\bigl\\{ \\vert a_{nk}X \\vert >n^{1/p}\\bigr\\} \\\\ &\\quad =P\\bigl\\{ \\vert a_{nk}X \\vert >n^{1/p}, \\vert X \\vert >n^{1/\\beta}\\bigr\\} +P\\bigl\\{ \\vert a_{nk}X \\vert >n^{1/p}, \\vert X \\vert \\leq n^{1/\\beta}\\bigr\\} \\\\ &\\quad \\leq n^{-\\alpha/p} \\vert a_{nk} \\vert ^{\\alpha}E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert >n^{1/\\beta } \\bigr)+n^{-s/p} \\vert a_{nk} \\vert ^{s}E \\vert X \\vert ^{s}I\\bigl( \\vert X \\vert \\leq n^{1/\\beta}\\bigr). \\end{aligned}$$ \\end{document}$$ It is easy to show that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2}\\cdot n^{-\\alpha/p} \\Biggl(\\sum^{n}_{k=1} \\vert a_{nk} \\vert ^{\\alpha}\\Biggr)E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert >n^{1/\\beta}\\bigr) \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-1-\\alpha/p}E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert >n^{1/\\beta } \\bigr) \\\\ &\\quad \\leq \\textstyle\\begin{cases} CE \\vert X \\vert ^{(r-1)\\beta} &\\text{if }\\alpha< rp, \\\\ CE \\vert X \\vert ^{(r-1)\\beta}\\log(1+ \\vert X \\vert ) &\\text{if }\\alpha=rp. \\end{cases}\\displaystyle \\end{aligned}$$ \\end{document}$$ Taking $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>\\max\\{\\alpha, (r-1)\\beta\\}$\\end{document}$, we have that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2}\\cdot n^{-s/p} \\Biggl(\\sum^{n}_{k=1} \\vert a_{nk} \\vert ^{s} \\Biggr)E \\vert X \\vert ^{s}I\\bigl( \\vert X \\vert \\leq n^{1/\\beta}\\bigr) \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-2-s/p+s/\\alpha}E \\vert X \\vert ^{s}I\\bigl( \\vert X \\vert \\leq n^{1/\\beta } \\bigr) \\\\ &\\quad =C\\sum^{\\infty}_{n=1}n^{r-2-s/\\beta}E \\vert X \\vert ^{s}I\\bigl( \\vert X \\vert \\leq n^{1/\\beta} \\bigr) \\\\ &\\quad \\leq CE \\vert X \\vert ^{(r-1)\\beta}, \\end{aligned}$$ \\end{document}$$ since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>(r-1)\\beta$\\end{document}$. Then ([2.1](#Equ6){ref-type=""}) holds by ([2.2](#Equ7){ref-type=""})--([2.4](#Equ9){ref-type=""}).
Case 2: $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$. The proof is similar to that of Case 1. However, we use a different truncation for *X*. We observe by the Markov inequality that, for any $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$t>0$\\end{document}$, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &P\\bigl\\{ \\vert a_{nk}X \\vert >n^{1/p}\\bigr\\} \\\\ &\\quad =P\\bigl\\{ \\vert a_{nk}X \\vert >n^{1/p}, \\vert X \\vert >n^{1/p}\\bigr\\} +P\\bigl\\{ \\vert a_{nk}X \\vert >n^{1/p}, \\vert X \\vert \\leq n^{1/p}\\bigr\\} \\\\ &\\quad \\leq n^{-t/p} \\vert a_{nk} \\vert ^{t} E \\vert X \\vert ^{t} I\\bigl( \\vert X \\vert >n^{1/p} \\bigr)+n^{-\\alpha /p} \\vert a_{nk} \\vert ^{\\alpha}E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert \\leq n^{1/p}\\bigr). \\end{aligned}$$ \\end{document}$$ Taking $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< t< rp$\\end{document}$, we have that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2}\\cdot n^{-t/p} \\Biggl(\\sum^{n}_{k=1} \\vert a_{nk} \\vert ^{t} \\Biggr)E \\vert X \\vert ^{t}I\\bigl( \\vert X \\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-1-t/p}E \\vert X \\vert ^{t}I\\bigl( \\vert X \\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq CE \\vert X \\vert ^{rp}. \\end{aligned}$$ \\end{document}$$ It is easy to show that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2}\\cdot n^{-\\alpha/p} \\Biggl(\\sum^{n}_{k=1} \\vert a_{nk} \\vert ^{\\alpha}\\Biggr)E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert \\leq n^{1/p}\\bigr) \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-1-\\alpha/p}E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert \\leq n^{1/p} \\bigr) \\\\ &\\quad \\leq CE \\vert X \\vert ^{rp}, \\end{aligned}$$ \\end{document}$$ since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$. Then ([2.1](#Equ6){ref-type=""}) holds by ([2.5](#Equ10){ref-type=""})--([2.7](#Equ12){ref-type=""}). □
Lemma 2.3 {#FPar6}
---------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r\\geq1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ *with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1/p$\\end{document}$, *and let* *X* *be a random variable*. *Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk},1\\leq k\\leq n, n\\geq1\\}$\\end{document}$ *be an array of constants satisfying* ([1.1](#Equ1){ref-type=""}). *Then*, *for any* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>\\max\\{\\alpha, (r-1)\\beta\\}$\\end{document}$, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned}& \\sum^{\\infty}_{n=1}n^{r-2-s/p}\\sum ^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p} \\bigr) \\\\& \\quad \\leq \\textstyle\\begin{cases} C E|X|^{(r-1)\\beta} &\\textit{if }\\alpha< rp, \\\\ C E|X|^{(r-1)\\beta}\\log(1+|X|) &\\textit{if }\\alpha=rp, \\\\ C E|X|^{rp} &\\textit{if }\\alpha>rp. \\end{cases}\\displaystyle \\end{aligned}$$ \\end{document}$$
Proof {#FPar7}
-----
Case 1: $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha\\leq rp$\\end{document}$. By ([2.3](#Equ8){ref-type=""}) and ([2.4](#Equ9){ref-type=""}) we get that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-s/p}\\sum ^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p} \\bigr) \\\\ &\\quad =\\sum^{\\infty}_{n=1}n^{r-2-s/p}\\sum ^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p}, \\vert X \\vert >n^{1/\\beta}\\bigr) \\\\ &\\qquad {} +\\sum^{\\infty}_{n=1}n^{r-2-s/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p}, \\vert X \\vert \\leq n^{1/\\beta}\\bigr) \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2-s/p}n^{(s-\\alpha)/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert >n^{1/\\beta}\\bigr) \\\\ &\\qquad {} +\\sum^{\\infty}_{n=1}n^{r-2-s/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert X \\vert \\leq n^{1/\\beta}\\bigr) \\\\ &\\quad \\leq \\textstyle\\begin{cases} C E \\vert X \\vert ^{(r-1)\\beta} &\\text{if }\\alpha< rp, \\\\ C E \\vert X \\vert ^{(r-1)\\beta}\\log(1+ \\vert X \\vert ) &\\text{if }\\alpha=rp. \\end{cases}\\displaystyle \\end{aligned}$$ \\end{document}$$
Case 2: $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$. Taking $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< t< rp$\\end{document}$, we have by ([2.6](#Equ11){ref-type=""}) and ([2.7](#Equ12){ref-type=""}) that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-s/p}\\sum ^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p} \\bigr) \\\\ &\\quad = \\sum^{\\infty}_{n=1}n^{r-2-s/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p}, \\vert X \\vert >n^{1/p}\\bigr) \\\\ &\\qquad {} +\\sum^{\\infty}_{n=1}n^{r-2-s/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{s}I\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p}, \\vert X \\vert \\leq n^{1/p}\\bigr) \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2-s/p}n^{(s-t)/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{t}I\\bigl( \\vert X \\vert >n^{1/p}\\bigr) \\\\ &\\qquad {} +\\sum^{\\infty}_{n=1}n^{r-2-s/p}n^{(s-\\alpha)/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{\\alpha} I\\bigl( \\vert X \\vert \\leq n^{1/p}\\bigr) \\\\ &\\quad \\leq CE \\vert X \\vert ^{rp}. \\end{aligned}$$ \\end{document}$$ Therefore ([2.8](#Equ13){ref-type=""}) holds. □
The following lemma is a counterpart of Lemma [2.3](#FPar6){ref-type="sec"}. The truncation for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$|a_{nk}X|$\\end{document}$ is reversed.
Lemma 2.4 {#FPar8}
---------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r\\geq1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ *with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1/p$\\end{document}$, *and let* *X* *be a random variable*. *Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk},1\\leq k\\leq n, n\\geq1\\}$\\end{document}$ *be an array of constants satisfying* ([1.1](#Equ1){ref-type=""}). *Then the following statements hold*. *If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned}& \\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum ^{n}_{k=1}E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}\\bigr) \\\\& \\quad \\leq \\textstyle\\begin{cases} C E|X|^{(r-1)\\beta} &\\textit{if }q< (r-1)\\beta, \\\\ C E|X|^{(r-1)\\beta}\\log(1+|X|) &\\textit{if }q=(r-1)\\beta, \\\\ C E|X|^{q} &\\textit{if }q>(r-1)\\beta. \\end{cases}\\displaystyle \\end{aligned}$$ \\end{document}$$*If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned}& \\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum ^{n}_{k=1}E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}\\bigr) \\\\& \\quad \\leq \\textstyle\\begin{cases} C E|X|^{(r-1)\\beta}\\log(1+|X|) &\\textit{if }q\\leq\\alpha=rp, \\\\ C E|X|^{q} &\\textit{if }q>\\alpha=rp. \\end{cases}\\displaystyle \\end{aligned}$$ \\end{document}$$*If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} \\begin{aligned}[b] &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum ^{n}_{k=1}E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq \\textstyle\\begin{cases} C E|X|^{rp} &\\textit{if }q< rp, \\\\ C E|X|^{rp}\\log(1+|X|) &\\textit{if }q=rp, \\\\ C E|X|^{q} &\\textit{if }q>rp. \\end{cases}\\displaystyle \\end{aligned} \\end{aligned}$$ \\end{document}$$
Proof {#FPar9}
-----
Without loss of generality, we may assume that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n^{-1}\\sum_{k=1}^{n} |a_{nk}|^{\\alpha}\\leq1$\\end{document}$ for all $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\ge1$\\end{document}$. From this we have that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$|a_{nk}|\\leq n^{1/\\alpha}$\\end{document}$ for all $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq k\\leq n$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\geq1$\\end{document}$.
\\(1\\) In this case, we have that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp<(r-1)\\beta$\\end{document}$. If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< q<\\alpha$\\end{document}$, then $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p} \\bigr) \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2-q/p}n^{-(\\alpha-q)/p} \\sum_{k=1}^{n} E \\vert a_{nk}X \\vert ^{\\alpha}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2-q/p}n^{-(\\alpha-q)/p} \\sum_{k=1}^{n} E \\vert a_{nk}X \\vert ^{\\alpha}I\\bigl( \\bigl\\vert n^{1/\\alpha}X \\bigr\\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-1-\\alpha/p} E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert >n^{1/\\beta } \\bigr) \\\\ &\\quad =C\\sum_{i=1}^{\\infty}E \\vert X \\vert ^{\\alpha}I\\bigl(i^{1/\\beta}< \\vert X \\vert \\le(i+1)^{1/\\beta }\\bigr)\\sum_{n=1}^{i} n^{r-1-\\alpha/p} \\\\ &\\quad \\leq C E \\vert X \\vert ^{(r-1)\\beta}. \\end{aligned}$$ \\end{document}$$ If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q\\geq\\alpha$\\end{document}$, then $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p} \\bigr) \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2-q/p} \\sum_{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\bigl\\vert n^{1/\\alpha}X \\bigr\\vert >n^{1/p}\\bigr) \\\\ &\\quad =\\sum^{\\infty}_{n=1}n^{r-2-q/p} \\sum_{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert X \\vert >n^{1/\\beta }\\bigr) \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-2-q/p+q/\\alpha} E \\vert X \\vert ^{q}I\\bigl( \\vert X \\vert >n^{1/\\beta} \\bigr) \\\\ &\\quad =C\\sum_{i=1}^{\\infty}E \\vert X \\vert ^{q}I\\bigl(i^{1/\\beta}< \\vert X \\vert \\le(i+1)^{1/\\beta}\\bigr)\\sum_{n=1}^{i} n^{r-2-q/\\beta} \\\\ &\\quad \\leq \\textstyle\\begin{cases} C E \\vert X \\vert ^{(r-1)\\beta} &\\text{if }\\alpha\\le q< (r-1)\\beta, \\\\ C E \\vert X \\vert ^{(r-1)\\beta}\\log(1+ \\vert X \\vert ) &\\text{if }q=(r-1)\\beta, \\\\ C E \\vert X \\vert ^{q} &\\text{if }q>(r-1)\\beta. \\end{cases}\\displaystyle \\end{aligned}$$ \\end{document}$$ Combining ([2.12](#Equ17){ref-type=""}) and ([2.13](#Equ18){ref-type=""}) gives ([2.9](#Equ14){ref-type=""}).
\\(2\\) In this case, we have that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp=(r-1)\\beta$\\end{document}$. If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q\\le\\alpha=rp=(r-1)\\beta$\\end{document}$, then $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p} \\bigr) \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2-q/p+(q-\\alpha)/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{\\alpha}I\\bigl( \\bigl\\vert n^{1/\\alpha}X \\bigr\\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq C \\sum^{\\infty}_{n=1}n^{r-1-\\alpha/p}E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert >n^{\\beta}\\bigr) \\\\ &\\quad =C\\sum^{\\infty}_{n=1}n^{-1}E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert >n^{\\beta}\\bigr) \\\\ &\\quad =C\\sum_{i=1}^{\\infty}E \\vert X \\vert ^{\\alpha}I\\bigl(i^{\\beta}< \\vert X \\vert \\le(i+1)^{\\beta}\\bigr)\\sum_{n=1}^{i} n^{-1} \\\\ &\\quad \\leq CE \\vert X \\vert ^{(r-1)\\beta}\\log\\bigl(1+ \\vert X \\vert \\bigr). \\end{aligned}$$ \\end{document}$$ If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>\\alpha=rp=(r-1)\\beta$\\end{document}$, then $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p} \\bigr) \\\\ &\\quad \\le C\\sum^{\\infty}_{n=1}n^{r-2-q/p}n^{q/\\alpha} E \\vert X \\vert ^{q} \\le CE \\vert X \\vert ^{q}. \\end{aligned}$$ \\end{document}$$ Combining ([2.14](#Equ19){ref-type=""}) and ([2.15](#Equ20){ref-type=""}) gives ([2.10](#Equ15){ref-type=""}).
\\(3\\) In this case, we have that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$(r-1)\\beta< rp<\\alpha$\\end{document}$. If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q\\le rp$\\end{document}$, then $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p} \\bigr) \\\\ &\\quad =\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}, \\vert X \\vert >n^{1/p}\\bigr) \\\\ &\\qquad {} +\\sum^{\\infty}_{n=1}n^{r-2-q/p} \\sum_{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}, \\vert X \\vert \\leq n^{1/p}\\bigr) \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2-q/p} \\sum_{k=1}^{n} E \\vert a_{nk}X \\vert ^{q} I\\bigl( \\vert X \\vert >n^{1/p}\\bigr) \\\\ &\\qquad {} +\\sum^{\\infty}_{n=1}n^{r-2-q/p}n^{-(\\alpha-q)/p} \\sum_{k=1}^{n} E \\vert a_{nk}X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert \\leq n^{1/p}\\bigr) \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-1-q/p} E \\vert X \\vert ^{q} I\\bigl( \\vert X \\vert >n^{1/p} \\bigr) \\\\ &\\qquad {} +C\\sum^{\\infty}_{n=1}n^{r-1-\\alpha/p}E \\vert X \\vert ^{\\alpha}I\\bigl( \\vert X \\vert \\leq n^{1/p} \\bigr) \\\\ &\\quad = C\\sum_{i=1}^{\\infty}E \\vert X \\vert ^{q} I\\bigl(i^{1/p}< \\vert X \\vert \\le(i+1)^{1/p}\\bigr)\\sum_{n=1}^{i} n^{r-1-q/p} \\\\ &\\qquad {} +C\\sum_{i=1}^{\\infty}E \\vert X \\vert ^{\\alpha}I\\bigl((i-1)^{1/p}< \\vert X \\vert \\le i^{1/p}\\bigr)\\sum_{n=i}^{\\infty}n^{r-1-\\alpha/p} \\\\ &\\quad \\leq \\textstyle\\begin{cases} C E \\vert X \\vert ^{rp} &\\text{if }q< rp, \\\\ C E \\vert X \\vert ^{rp}\\log(1+ \\vert X \\vert ) &\\text{if }q=rp. \\end{cases}\\displaystyle \\end{aligned}$$ \\end{document}$$ If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$rp< q<\\alpha$\\end{document}$, then $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p} \\bigr) \\\\ &\\quad \\le C\\sum^{\\infty}_{n=1}n^{r-1-q/p} E \\vert X \\vert ^{q} \\le CE \\vert X \\vert ^{q}. \\end{aligned}$$ \\end{document}$$ If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q\\ge\\alpha$\\end{document}$, then $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X \\vert ^{q}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p} \\bigr) \\\\ &\\quad \\le C\\sum^{\\infty}_{n=1}n^{r-2-q/p}n^{q/\\alpha} E \\vert X \\vert ^{q} \\le CE \\vert X \\vert ^{q}, \\end{aligned}$$ \\end{document}$$ since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q\\ge\\alpha>(r-1)\\beta$\\end{document}$.
Combining ([2.16](#Equ21){ref-type=""})--([2.18](#Equ23){ref-type=""}) gives ([2.11](#Equ16){ref-type=""}). □
Lemma 2.5 {#FPar10}
---------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ *with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha +1/\\beta=1/p$\\end{document}$, *and let* *X* *be a random variable*. *Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk},1\\leq k\\leq n, n\\geq1\\}$\\end{document}$ *be an array of constants satisfying* ([1.1](#Equ1){ref-type=""}). *If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{p}<\\infty$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert a_{nk}X \\vert > n^{1/p}\\bigr)\\rightarrow0 $$\\end{document}$$ *as* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\rightarrow\\infty$\\end{document}$, *and hence*, *in addition*, *if* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ n^{-1/p}\\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum ^{m}_{k=1}a_{nk}EXI\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p}\\bigr) \\Biggr\\vert \\rightarrow0 $$\\end{document}$$ *as* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\rightarrow\\infty$\\end{document}$.
Proof {#FPar11}
-----
Denote $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$A^{\\alpha}=\\sup_{n\\geq1}n^{-1}\\sum^{n}_{k=1}|a_{nk}|^{\\alpha}$\\end{document}$. Then $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$|a_{nk}|\\leq An^{1/\\alpha}$\\end{document}$ for all $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq k\\leq n$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\geq1$\\end{document}$. It follows that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq n^{-1}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{p}I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}\\bigr) \\\\ &\\quad \\leq n^{-1} \\Biggl(\\sum^{n}_{k=1} \\vert a_{nk} \\vert ^{p} \\Biggr)E \\vert X \\vert ^{p}I\\bigl( \\vert AX \\vert >n^{1/\\beta }\\bigr) \\\\ &\\quad \\leq CE \\vert X \\vert ^{p}I\\bigl( \\vert AX \\vert >n^{1/\\beta}\\bigr)\\rightarrow0 \\end{aligned}$$ \\end{document}$$ as $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\rightarrow\\infty$\\end{document}$. Hence ([2.19](#Equ24){ref-type=""}) holds.
If, in addition, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$, then we get by ([2.21](#Equ26){ref-type=""}) that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &n^{-1/p}\\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum ^{m}_{k=1}a_{nk}EXI\\bigl( \\vert a_{nk}X \\vert \\leq n^{1/p}\\bigr) \\Biggr\\vert \\\\ &\\quad =n^{-1/p}\\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum ^{m}_{k=1}a_{nk}EXI\\bigl( \\vert a_{nk}X \\vert > n^{1/p}\\bigr) \\Biggr\\vert \\\\ &\\quad \\le n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert a_{nk}X \\vert >n^{1/p}\\bigr)\\rightarrow0 \\end{aligned}$$ \\end{document}$$ as $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\rightarrow\\infty$\\end{document}$. Hence ([2.20](#Equ25){ref-type=""}) holds. □
The following lemma shows that if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< p<1$\\end{document}$, then ([2.20](#Equ25){ref-type=""}) holds without the condition $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$.
Lemma 2.6 {#FPar12}
---------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< p<1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ *with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha +1/\\beta=1/p$\\end{document}$, *and let* *X* *be a random variable*. *Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk},1\\leq k\\leq n, n\\geq1\\}$\\end{document}$ *be an array of constants satisfying* ([1.1](#Equ1){ref-type=""}). *If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{p}<\\infty$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert a_{nk}X \\vert \\le n^{1/p}\\bigr)\\rightarrow0 $$\\end{document}$$ *as* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\rightarrow\\infty$\\end{document}$, *and hence* ([2.20](#Equ25){ref-type=""}) *holds*.
Proof {#FPar13}
-----
Note that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert a_{nk}X \\vert \\le n^{1/p}\\bigr) \\\\ &\\quad =n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert a_{nk}X \\vert \\le n^{1/p}, \\vert X \\vert > n^{1/\\beta }\\bigr) \\\\ &\\qquad {} +n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert a_{nk}X \\vert \\le n^{1/p}, \\vert X \\vert \\le n^{1/\\beta}\\bigr) \\\\ &\\quad \\le n^{-1/p}n^{(1-p)/p} \\sum^{n}_{k=1}E \\vert a_{nk}X \\vert ^{p}I\\bigl( \\vert X \\vert > n^{1/\\beta }\\bigr)+n^{-1/p}\\sum^{n}_{k=1}E \\vert a_{nk}X \\vert I\\bigl( \\vert X \\vert \\le n^{1/\\beta} \\bigr) \\\\ &\\quad \\le C E \\vert X \\vert ^{p}I\\bigl( \\vert X \\vert > n^{1/\\beta}\\bigr)+Cn^{-1/p+1/(\\alpha\\wedge1)} E \\vert X \\vert I\\bigl( \\vert X \\vert \\le n^{1/\\beta}\\bigr) \\\\ &\\quad \\le C E \\vert X \\vert ^{p}I\\bigl( \\vert X \\vert > n^{1/\\beta}\\bigr)+Cn^{-1/p+1/(\\alpha\\wedge1)+ (1-p)/\\beta}E \\vert X \\vert ^{p} \\rightarrow0 \\end{aligned}$$ \\end{document}$$ as $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\rightarrow\\infty$\\end{document}$, since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$-1/p+1/(\\alpha\\wedge1)+ (1-p)/\\beta =-p/\\beta$\\end{document}$ if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha\\le1$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$-1/p+1/(\\alpha\\wedge1)+ (1-p)/\\beta =-(1-p)/\\alpha$\\end{document}$ if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>1$\\end{document}$. □
Main results {#Sec3}
============
We first present complete convergence for weighted sums of $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho ^{*}$\\end{document}$-mixing random variables.
Theorem 3.1 {#FPar14}
-----------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r\\geq1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ *with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1/p$\\end{document}$. *Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk}, 1\\leq k\\leq n, n\\geq1\\}$\\end{document}$ *be an array of constants satisfying* ([1.1](#Equ1){ref-type=""}), *and let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{X,X_{n},n\\geq1\\}$\\end{document}$ *be a sequence of identically distributed* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-*mixing random variables*. *If* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ EX=0, \\qquad \\textstyle\\begin{cases} E|X|^{(r-1)\\beta}< \\infty&\\textit{if }\\alpha< rp, \\\\ E|X|^{(r-1)\\beta}\\log(1+|X|)< \\infty&\\textit{if }\\alpha=rp, \\\\ E|X|^{rp}< \\infty&\\textit{if }\\alpha>rp, \\end{cases} $$\\end{document}$$ *then* ([1.4](#Equ4){ref-type=""}) *holds*.
*Conversely*, *if* ([1.4](#Equ4){ref-type=""}) *holds for any array* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk}, 1\\le k\\le n,n\\ge 1\\}$\\end{document}$ *satisfying* ([1.1](#Equ1){ref-type=""}) *for some* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>p$\\end{document}$, *then* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{rp}<\\infty$\\end{document}$ *and* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{(r-1)\\beta}<\\infty$\\end{document}$.
Remark 3.1 {#FPar15}
----------
When $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< p<1$\\end{document}$, ([3.1](#Equ27){ref-type=""}) without the condition $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ implies ([1.4](#Equ4){ref-type=""}). The proof is the same as that of Theorem [3.1](#FPar14){ref-type="sec"} except that Lemma [2.5](#FPar10){ref-type="sec"} is replaced by Lemma [2.6](#FPar12){ref-type="sec"}.
Remark 3.2 {#FPar16}
----------
The case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$ $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$(r>1)$\\end{document}$ of Theorem [3.1](#FPar14){ref-type="sec"} corresponds to Theorem 2.2 of Sung \\[[@CR1]\\], and the proof is much simpler than that of Sung \\[[@CR1]\\]. Hence Theorem [3.1](#FPar14){ref-type="sec"} generalizes the result of Sung \\[[@CR1]\\].
Remark 3.3 {#FPar17}
----------
Suppose that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r\\ge1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta >0$\\end{document}$ with $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1/p$\\end{document}$. Then the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$ is equivalent to the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$rp<(r-1)\\beta$\\end{document}$, and in this case, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp<(r-1)\\beta$\\end{document}$. The case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp$\\end{document}$ is equivalent to the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$rp=(r-1)\\beta$\\end{document}$, and in this case, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp=(r-1)\\beta$\\end{document}$. The case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$ is equivalent to the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$rp>(r-1)\\beta$\\end{document}$, and in this case, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp>(r-1)\\beta$\\end{document}$.
Remark 3.4 {#FPar18}
----------
In two cases $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$, the moment conditions are necessary and sufficient conditions, but in the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp$\\end{document}$, the moment condition $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{(r-1)\\beta}\\log (1+|X|)=E|X|^{rp}\\log(1+|X|)<\\infty$\\end{document}$ is only sufficient for ([1.4](#Equ4){ref-type=""}). It may be difficult to prove ([1.4](#Equ4){ref-type=""}) under the necessary moment condition $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{rp}<\\infty$\\end{document}$. An and Yuan \\[[@CR17]\\] proved ([1.4](#Equ4){ref-type=""}) under the moment condition $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{rp}<\\infty$\\end{document}$ and the condition $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\sup_{n\\geq1}n^{-\\delta}\\sum^{n}_{k=1}|a_{nk}|^{rp}< \\infty $$\\end{document}$$ for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\delta\\in(0,1)$\\end{document}$. However, their result is not an extension of the classical one and is a particular case of Sung \\[[@CR1]\\]. In fact, if we set $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha =rp/\\delta$\\end{document}$, then $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$, and ([1.1](#Equ1){ref-type=""}) holds.
Proof of Theorem [3.1](#FPar14){ref-type="sec"} {#FPar19}
-----------------------------------------------
Sufficiency. For any $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq k\\leq n$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\geq1$\\end{document}$, set $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$X_{nk}=a_{nk}X_{k} I\\bigl( \\vert a_{nk}X_{k} \\vert \\leq n^{1/p}\\bigr). $$\\end{document}$$ Note that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\Biggl\\{ \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum ^{m}_{k=1}a_{nk}X_{k} \\Biggr\\vert >\\varepsilon n^{1/p} \\Biggr\\} \\subset\\cup^{n}_{k=1} \\bigl\\{ \\vert a_{nk}X_{k} \\vert >n^{1/p}\\bigr\\} \\cup \\Biggl\\{ \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum ^{m}_{k=1}X_{nk} \\Biggr\\vert >\\varepsilon n^{1/p} \\Biggr\\} . $$\\end{document}$$ Then by Lemmas [2.2](#FPar4){ref-type="sec"} and [2.5](#FPar10){ref-type="sec"}, to prove ([1.4](#Equ4){ref-type=""}), it suffices to prove that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ \\sum^{\\infty}_{n=1}n^{r-2}P \\Biggl\\{ \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum^{m}_{k=1}(X_{nk}-EX_{nk}) \\Biggr\\vert >\\varepsilon n^{1/p} \\Biggr\\} < \\infty,\\quad \\forall \\varepsilon>0. $$\\end{document}$$ When $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r>1$\\end{document}$, set $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s\\in(p, \\min\\{2, \\alpha\\})$\\end{document}$ if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha\\leq rp$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s\\in(p, \\min\\{2, rp\\})$\\end{document}$ if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$. Note that, when $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r=1$\\end{document}$, we cannot choose such *s*, since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>p=rp$\\end{document}$. Then $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$p< s<\\min\\{2,\\alpha\\}$\\end{document}$, and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{s}<\\infty$\\end{document}$ by Remark [3.3](#FPar17){ref-type="sec"}. Taking $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>\\max\\{2,\\alpha, (r-1)\\beta, 2p(r-1)/(s-p)\\}$\\end{document}$, we have by the Markov inequality and Lemma [2.1](#FPar2){ref-type="sec"} that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &P\\Biggl\\{ \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum ^{m}_{k=1}(X_{nk}-EX_{nk}) \\Biggr\\vert >\\varepsilon n^{1/p}\\Biggr\\} \\\\ &\\quad \\leq Cn^{-q/p} \\Biggl(\\sum^{n}_{k=1}E(X_{nk}-EX_{nk})^{2} \\Biggr)^{q/2}+Cn^{-q/p}\\sum^{n}_{k=1}E \\vert X_{nk}-EX_{nk} \\vert ^{q}. \\end{aligned}$$ \\end{document}$$ Since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>2p(r-1)/(s-p)$\\end{document}$, we have that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r-2+q(1-s/p)/2<-1$\\end{document}$. It follows that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2}\\cdot n^{-q/p} \\Biggl(\\sum^{n}_{k=1}E(X_{nk}-EX_{nk})^{2} \\Biggr)^{q/2} \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2} \\cdot n^{-q/p} \\Biggl(\\sum^{n}_{k=1}E \\vert a_{nk}X_{k} \\vert ^{2}I\\bigl( \\vert a_{nk}X_{k} \\vert \\leq n^{1/p}\\bigr) \\Biggr)^{q/2} \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2} \\cdot n^{-q/p} \\Biggl(n^{(2-s)/p}\\sum^{n}_{k=1}E \\vert a_{nk}X_{k} \\vert ^{s}I\\bigl( \\vert a_{nk}X_{k} \\vert \\leq n^{1/p}\\bigr) \\Biggr)^{q/2} \\\\ &\\quad \\leq\\sum^{\\infty}_{n=1}n^{r-2} \\cdot n^{-q/p} \\Biggl(n^{(2-s)/p}\\sum^{n}_{k=1} \\vert a_{nk} \\vert ^{s}E \\vert X \\vert ^{s} \\Biggr)^{q/2} \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-2+q(1-s/p)/2}< \\infty. \\end{aligned}$$ \\end{document}$$ By Lemma [2.3](#FPar6){ref-type="sec"} we have $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2}\\cdot n^{-q/p}\\sum^{n}_{k=1}E \\vert X_{nk}-EX_{nk} \\vert ^{q} \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-2} \\cdot n^{-q/p}\\sum^{n}_{k=1}E \\vert a_{nk}X_{k} \\vert ^{q}I\\bigl( \\vert a_{nk}X_{k} \\vert \\leq n^{1/p}\\bigr) \\\\ &\\quad < \\infty. \\end{aligned}$$ \\end{document}$$ Hence ([3.2](#Equ28){ref-type=""}) holds by ([3.3](#Equ29){ref-type=""})--([3.5](#Equ31){ref-type=""}).
When $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r=1$\\end{document}$, we always have that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>p=rp$\\end{document}$. If ([1.1](#Equ1){ref-type=""}) holds for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, then ([1.1](#Equ1){ref-type=""}) also holds for any $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha'$\\end{document}$ ($\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0<\\alpha'\\leq\\alpha$\\end{document}$) by Remark [2.1](#FPar3){ref-type="sec"}. Thus we may assume that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$p<\\alpha<2$\\end{document}$. Taking $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q=2$\\end{document}$, we have by the Markov inequality and Lemmas [2.1](#FPar2){ref-type="sec"} and [2.3](#FPar6){ref-type="sec"} that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &\\sum^{\\infty}_{n=1}n^{r-2}P \\Biggl\\{ \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum^{m}_{k=1}(X_{nk}-EX_{nk}) \\Biggr\\vert >\\varepsilon n^{1/p} \\Biggr\\} \\\\ &\\quad \\leq C\\sum^{\\infty}_{n=1}n^{r-2} \\cdot n^{-2/p}\\sum^{n}_{k=1}E \\vert a_{nk}X_{k} \\vert ^{2}I\\bigl( \\vert a_{nk}X_{k} \\vert \\leq n^{1/p}\\bigr) \\\\ &\\quad < \\infty. \\end{aligned}$$ \\end{document}$$
Necessity. Set $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$a_{nk}=1$\\end{document}$ for all $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq k\\leq n$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$n\\geq1$\\end{document}$. Then ([1.4](#Equ4){ref-type=""}) can be rewritten as $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\sum^{\\infty}_{n=1}n^{r-2}P\\Biggl\\{ \\max_{1\\leq m\\leq n} \\Biggl\\vert \\sum^{m}_{k=1}X_{k} \\Biggr\\vert >\\varepsilon n^{1/p}\\Biggr\\} < \\infty, \\quad \\forall \\varepsilon>0, $$\\end{document}$$ which implies that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{rp}<\\infty$\\end{document}$ (see Theorem 2 in Peligrad and Gut \\[[@CR5]\\]). Set $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$a_{nk}=0$\\end{document}$ if $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq k\\leq n-1$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$a_{nn}=n^{1/\\alpha}$\\end{document}$. Then ([1.4](#Equ4){ref-type=""}) can be rewritten as $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\sum^{\\infty}_{n=1}n^{r-2}P\\bigl\\{ n^{1/\\alpha} \\vert X_{n} \\vert >\\varepsilon n^{1/p} \\bigr\\} < \\infty, \\quad \\forall \\varepsilon>0, $$\\end{document}$$ which is equivalent to $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{(r-1)\\beta}<\\infty$\\end{document}$. The proof is completed. □
Now we extend Theorem [3.1](#FPar14){ref-type="sec"} to complete moment convergence.
Theorem 3.2 {#FPar20}
-----------
*Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$r\\geq1$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1\\leq p<2$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>0$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\beta>0$\\end{document}$ *with* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$1/\\alpha+1/\\beta=1/p$\\end{document}$. *Let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk}, 1\\leq k\\leq n, n\\geq1\\}$\\end{document}$ *be an array of constants satisfying* ([1.1](#Equ1){ref-type=""}), *and let* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{X,X_{n},n\\geq1\\}$\\end{document}$ *be a sequence of identically distributed* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-*mixing random variables*. *Assume that one of the following conditions holds*. *If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ EX=0,\\qquad \\textstyle\\begin{cases} E|X|^{(r-1)\\beta}< \\infty &\\textit{if }q< (r-1)\\beta, \\\\ E|X|^{(r-1)\\beta}\\log(1+|X|)< \\infty &\\textit{if }q=(r-1)\\beta, \\\\ E|X|^{q}< \\infty &\\textit{if }q>(r-1)\\beta. \\end{cases} $$\\end{document}$$*If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ EX=0,\\qquad \\textstyle\\begin{cases} E|X|^{(r-1)\\beta}\\log(1+|X|)< \\infty &\\textit{if } q\\leq\\alpha=rp, \\\\ E|X|^{q}< \\infty &\\textit{if }q>\\alpha=rp. \\end{cases} $$\\end{document}$$*If* $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$, *then* $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ EX=0,\\qquad \\textstyle\\begin{cases} E|X|^{rp}< \\infty &\\textit{if }q< rp, \\\\ E|X|^{rp}\\log(1+|X|)< \\infty &\\textit{if }q=rp, \\\\ E|X|^{q}< \\infty &\\textit{if }q>rp. \\end{cases} $$\\end{document}$$ *Then* ([1.5](#Equ5){ref-type=""}) *holds*.
Remark 3.5 {#FPar21}
----------
As stated in the Introduction, if ([1.5](#Equ5){ref-type=""}) holds for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>0$\\end{document}$, then ([1.4](#Equ4){ref-type=""}) also holds. If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$, and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{(r-1)\\beta}<\\infty$\\end{document}$, then ([3.6](#Equ32){ref-type=""}) holds for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< q<(r-1)\\beta$\\end{document}$. If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha=rp$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$, and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{(r-1)\\beta}\\log(1+|X|)<\\infty$\\end{document}$, then ([3.7](#Equ33){ref-type=""}) holds for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< q\\le\\alpha$\\end{document}$. If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$, and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{rp}<\\infty$\\end{document}$, then ([3.8](#Equ34){ref-type=""}) holds for some $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< q< rp$\\end{document}$. Therefore the sufficiency of Theorem [3.1](#FPar14){ref-type="sec"} holds by Theorem [3.2](#FPar20){ref-type="sec"}.
Remark 3.6 {#FPar22}
----------
The case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$ of Theorem [3.2](#FPar20){ref-type="sec"} corresponds to combining Theorems 3.1 and 3.2 in Wu et al. \\[[@CR2]\\]. The condition on weights $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\{a_{nk}\\}$\\end{document}$ in Wu et al. \\[[@CR2]\\] is $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\sup_{n\\ge1} n^{-1}\\sum_{k=1}^{n} |a_{nk}|^{t}< \\infty\\quad \\text{for some }t>\\max\\{rp, q\\}, $$\\end{document}$$ which is stronger than ([1.1](#Equ1){ref-type=""}) with $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha>rp$\\end{document}$. Hence Theorem [3.2](#FPar20){ref-type="sec"} generalizes and improves the results of Wu et al. \\[[@CR2]\\].
Remark 3.7 {#FPar23}
----------
In this paper, the $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\rho^{*}$\\end{document}$-mixing condition is only used in Lemma [2.1](#FPar2){ref-type="sec"}. Therefore our main results (Theorems [3.1](#FPar14){ref-type="sec"} and [3.2](#FPar20){ref-type="sec"}) also hold for random variables satisfying Lemma [2.1](#FPar2){ref-type="sec"}.
Proof of Theorem [3.2](#FPar20){ref-type="sec"} {#FPar24}
-----------------------------------------------
We apply Theorems 2.1 and 2.2 in Sung \\[[@CR18]\\] with $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$X_{nk}=a_{nk}X_{k}$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$b_{n}=n^{r-2}$\\end{document}$, $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$a_{n}=n^{1/p}$\\end{document}$. When the second moment of *X* does not exist, we apply Theorem 2.1 in Sung \\[[@CR18]\\]. We can easily prove that Theorem 2.1 in Sung \\[[@CR18]\\] still holds for $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$0< q<1$\\end{document}$. When the second moment of *X* exists, we apply Theorem 2.2 in Sung \\[[@CR18]\\].
\\(1\\) If $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp$\\end{document}$, then $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$\\alpha< rp<(r-1)\\beta$\\end{document}$ by Remark [3.3](#FPar17){ref-type="sec"}. We first consider the case $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q<(r-1)\\beta$\\end{document}$. In this case, the moment conditions are $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$EX=0$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{(r-1)\\beta }<\\infty$\\end{document}$. When $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q<(r-1)\\beta<2$\\end{document}$, we prove ([1.5](#Equ5){ref-type=""}) by using Theorem 2.1 in Sung \\[[@CR18]\\]. To apply Theorem 2.1 in Sung \\[[@CR18]\\], we take $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s=2$\\end{document}$. By Lemma [2.1](#FPar2){ref-type="sec"}, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$E\\max_{1\\le m\\le n} \\Biggl\\vert \\sum_{k=1}^{m} \\bigl(X_{nk}'(x)- EX_{nk}'(x) \\bigr) \\Biggr\\vert ^{2} \\le C \\sum_{k=1}^{n} E \\bigl\\vert X_{nk}'(x) \\bigr\\vert ^{2}, \\quad \\forall n\\ge1, \\forall x>0, $$\\end{document}$$ where $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$X_{nk}'(x)=a_{nk}X_{k}I(|a_{nk}X_{k}|\\le x^{1/q})+x^{1/q}I(a_{nk}X_{k}>x^{1/q})-x^{1/q}I(a_{nk}X_{k}<-x^{1/q})$\\end{document}$. By Lemma [2.3](#FPar6){ref-type="sec"}, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ \\sum_{n=1}^{\\infty}n^{r-2-s/p}\\sum _{k=1}^{n} E \\vert a_{nk}X_{k} \\vert ^{s}I\\bigl( \\vert a_{nk}X_{k} \\vert \\le n^{1/p}\\bigr)\\le CE \\vert X \\vert ^{(r-1)\\beta}< \\infty. $$\\end{document}$$ By Lemma [2.4](#FPar8){ref-type="sec"}, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ \\sum_{n=1}^{\\infty}n^{r-2-q/p}\\sum _{k=1}^{n} E \\vert a_{nk}X_{k} \\vert ^{q}I\\bigl( \\vert a_{nk}X_{k} \\vert > n^{1/p}\\bigr)\\le CE \\vert X \\vert ^{(r-1)\\beta}< \\infty. $$\\end{document}$$ By Lemma [2.5](#FPar10){ref-type="sec"} (note that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{p}<\\infty$\\end{document}$, since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$p\\le rp<(r-1)\\beta$\\end{document}$), $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$ n^{-1/p}\\sum_{k=1}^{n} E \\vert a_{nk}X_{k} \\vert I\\bigl( \\vert a_{nk}X_{k} \\vert >n^{1/p}\\bigr)\\to0. $$\\end{document}$$ Hence all conditions of Theorem 2.1 in Sung \\[[@CR18]\\] are satisfied. Therefore ([1.5](#Equ5){ref-type=""}) holds by Theorem 2.1 in Sung \\[[@CR18]\\].
When $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q<(r-1)\\beta$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$(r-1)\\beta\\ge2$\\end{document}$, we prove ([1.5](#Equ5){ref-type=""}) by using Theorem 2.2 in Sung \\[[@CR18]\\]. To apply Theorem 2.2 in Sung \\[[@CR18]\\], we take $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>0$\\end{document}$ such that $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>\\max \\{2,q,\\alpha, (r-1)\\beta, (r-1)p(\\alpha\\wedge2)/((\\alpha\\wedge2)-p)\\}$\\end{document}$. By Lemma [2.1](#FPar2){ref-type="sec"}, $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document} $$\\begin{aligned} &E\\max_{1\\le m\\le n} \\Biggl\\vert \\sum_{k=1}^{m} \\bigl(X_{nk}'(x)- EX_{nk}'(x) \\bigr) \\Biggr\\vert ^{s} \\\\ &\\quad \\le C \\Biggl\\{ \\sum_{k=1}^{n} E \\bigl\\vert X_{nk}'(x) \\bigr\\vert ^{s} + \\Biggl( \\sum_{k=1}^{n} E \\bigl\\vert X_{nk}'(x) \\bigr\\vert ^{2} \\Biggr)^{s/2} \\Biggr\\} ,\\quad \\forall n\\ge1, \\forall x>0. \\end{aligned}$$ \\end{document}$$ Since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>\\max\\{\\alpha, (r-1)\\beta\\}$\\end{document}$, ([3.9](#Equ35){ref-type=""}) holds. Also, ([3.10](#Equ36){ref-type=""}) and ([3.11](#Equ37){ref-type=""}) hold. Since $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$E|X|^{2}<\\infty$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$s>(r-1)p(\\alpha\\wedge2)/((\\alpha\\wedge 2)-p)$\\end{document}$, we have that $$\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$$\\sum_{n=1}^{\\infty}n^{r-2} \\Biggl( n^{-2/p}\\sum_{k=1}^{n} E \\vert a_{nk}X_{k} \\vert ^{2} \\Biggr)^{s/2}\\le C \\sum_{n=1}^{\\infty}n^{r-2} \\bigl( n^{-2/p} n^{2/(\\alpha\\wedge2)} \\bigr)^{s/2}< \\infty. $$\\end{document}$$ Hence all conditions of Theorem 2.2 in Sung \\[[@CR18]\\] are satisfied. Therefore ([1.5](#Equ5){ref-type=""}) holds by Theorem 2.2 in Sung \\[[@CR18]\\].
For the cases $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q=(r-1)\\beta$\\end{document}$ and $\\documentclass[12pt]{minimal}
\\usepackage{amsmath}
\\usepackage{wasysym}
\\usepackage{amsfonts}
\\usepackage{amssymb}
\\usepackage{amsbsy}
\\usepackage{mathrsfs}
\\usepackage{upgreek}
\\setlength{\\oddsidemargin}{-69pt}
\\begin{document}$q>(r-1)\\beta$\\end{document}$, the proofs are similar to that of the previous case and are omitted.
The proofs of (2) and (3) are similar to that of (1) and are omitted. □
**Publisher's Note**
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The research of Pingyan Chen is supported by the National Natural Science Foundation of China \\[grant number 71471075\\]. The research of Soo Hak Sung is supported by the research grant of Pai Chai University in 2018.
Both authors read and approved the manuscript.
Competing interests {#FPar25}
===================
The authors declare that they have no competing interests.
|
FIG. 1A is a schematic diagram illustrating a traditional resistive touch panel 10, which includes an upper panel 102, a lower panel 102 and some insulating materials 106 dispersed between the two panels. When the resistive touch panel is under external stress, the stress-receiving zone of the upper panel contacts the lower panel 104, thereby a touched location can be determined by detecting electrical signals between the two panels.
FIG. 1B is a schematic diagram illustrating a traditional 4-terminal resistive touch panel with four terminals connecting to different sides of the upper and lower panels 102 and 104. Additionally, FIG. 1C is a schematic diagram illustrating a traditional 5-terminal resistive touch panel with one terminal connecting the upper panel 102 while the other four terminals connecting to the four corners of the lower panels 104.
The 4-terminal or 5-terminal resistive touch panel needs to be connected to a controller, which is usually done through a connection head. However, there are many different ways of connecting the touch panel and the connection head due to different manufacturers. |
Q:
Does Tribal Forcemage benefit from its own morph ability?
If Tribal Forcemage is turned face up and I choose Elf or Wizard as the creature type to get the bonus given by its ability, does it get the bonus +2/+2 and trample itself?
A:
Yes, it does.
The ability is a triggered ability, which means it must go on the stack and then resolve before anything happens. By the time it does something, Tribal Forcemage has already been turned face up and is just like any other normal Elf Wizard creature.
In this particular case, Tribal Forcemage is already a normal Elf Wizard even by the time the ability triggers, because it only triggers after it has been turned face up. But even if it weren't, the triggered ability still must be placed on the stack the next time a player would receive priority, and then resolve when players pass priority, all before it matters. Theoretically during that time, before it resolves, Tribal Forcemage could change types, or be Cloudshifted away and back, etc. But it would still count as long as it is on the battlefield and is the matching type when the triggered ability resolves.
If Tribal Forcemage or any other Elf (assuming you chose Elf) entered the battlefield after the triggered ability resolved, it would not get the benefit from it:
611.2c If a continuous effect generated by the resolution of a spell or ability modifies the characteristics or changes the controller of any objects, the set of objects it affects is determined when that continuous effect begins. After that point, the set won’t change.
|
IAPCC
IAPCC - The International Association of Private Career Colleges (IAPCC) is a not-for-profit membership organisation set up by colleges to act as their collective voice, representing career education colleges globally. The Association was founded in 2009 and provides a broad range of services to its member.
The IAPCC provides its members with a code of ethics and set of standards they agree to follow. This is designed to improve the educational standards of its member organisations. Its member organisations include the International Career Institute (ICI). Other members include:Professional Design Institute and The Interior Design Academy
References
External links
Category:Education
Category:Non-governmental organizations |
Develop a search for "saturated and unsaturated markets" in e-commerces.
All sites should necessarily have pointed checkout in "USD" (Brazilian Real) and delivery within Brazil (regional or nationwide) nationwide.
The research should describe the 30 branches and more saturated-commerces in Brazil with links to e-commerces pointed. Is understood to be saturated, the branch...
Develop a search for "saturated and unsaturated markets" in e-commerces.
All sites should necessarily have pointed checkout in "USD" (Brazilian Real) and delivery within Brazil (regional or nationwide) nationwide.
The research should describe the 30 branches and more saturated-commerces in Brazil with links to e-commerces pointed. Is understood to be saturated, the branch...
...We decided to build a website so that we can put some questions on the website. So I'm hiring someone to help:
1. Write a prototype on a personal computer, so I can run the survey/test locally.
2. The prototype should be written in Python.
3. I am a reasonably good programmer using python, C++ but not familiar with how to build a website. I will
We require a house survey to be drawn up into archicad v20.
we require 2d floor plans, elevations and accurate 3d model with materials. The survey must be mm precise.
We do not wish to have to recheck measurements upon issue. so measurements must be accurate.
must include house garage and shed.
more photos issued upon acceptance.
Please contact
hi am having few survey websites in which am gathering user information . i need few chnages where user ip adress should be automatically updated to backend
only few hours of time we will be requiring , pm me if you are interested.
budget : 100$
Survey A is based on Patanjali Food products (e.g., atta, lentils, etc.)
Survey B is based on Patanjali personal care products (toothpaste, creams, etc.)
It should be either face to face or telephonic surveys only.
The target population is consumers above 23 years of age (i.e., working and not studying). The age range is between 23 to 65 years old
wireless, sensors and telecom related technical projects
Must have sound technical writing skills
Need to understand and modify ideas, parameters and simulation in Matlab.
There are several writing ideas plus simulated ideas . we will provide detail and you need to write in some wordings
its hsould be a detail explanation of ideas including the mathematical terms we provide
...Need this done quickly, though with extreme attention to detail.
* Simple but tedious job – should be done quickly with a reasonable price
PROJECT DESCRIPTION:
* I have a survey with results in Excel. Dataset columns A-DHB (485 questions), with 940 observations.
TASK:
* Each response is in a different column – I need these responses to be in one
Project description:
Connect a survey response to Wordpress, so that after a person respond the questions and answers are automatically put into a new Wordpress post.
Survey tool being used is Typeform, but we can tool at a different tool, like Google Forms. I tired to connect this through Zapier, but there are still problems posting the content
I am working in a research project and need to code some data collected through a survey and interviews, preferably using NVivo software. Then the data has to be analyzed and used to answer e few research questions. There are about 100 surveys and 15 interviews to be coded and analyzed. In addition, I have collected several course syllabi which would
i have create a simple yes or no survey form in jotform .([login to view URL]) but i didnt know how to make it into result of it .. if you know this about what kind of bird u are..
i wanna some one help me to crate it so i can use it in my site and not in jotform
urgent .. looking for usd10
...will be awarded via raffle to anyone who completes the following tasks:
1. Fill-out the survey form provided. Provide information with as much detail as possible.
2. Submit the screenshot after you complete the survey as your entry.
Here is the link to the survey form:
[login to view URL]
I need a sample app that can measure our customers satisfaction when they visit our store.
The app requirements is:
Should be easy of use.
ِAbility to add multi option questions.
Ability for customers to enter their info like name and email and phone no.
Back end portal for reporting and export for each branch.
in case internet disconnect the app can work offline and sync data later to the back e...
$70
From the official survey attached, we need a surveyor to describe the metes bounds and compass bearings of four lot lines, starting from a point of beginning. That's it! And it's the simplest of configurations - a 50' by 150' rectangle.
Create a Survey FreePBX/Asterisk module to measure customer satisfaction levels for our call center agents services.
Current software versions:
Elastix 4
Here is what is needed.
After a call, our Call Center Agents will transfer a customer call to an extension where the survey should be executed.
Survey will consist of 1 or more fixed questions.
We
...Freelancers,
I'm looking to create a Twilio SMS simple survey that will message a list of users at a set time. I'm thinking the host will be a AWS linux server running python.
I set up a simple survey in Twilio studio, but need the data held in a server that I can review after.
The SMS survey will be;
How was the course on a scale of 1-10?
Did you
technical research analysis, review and survey
read exisiting area on sensor network, wireless
some ideas are estableshed and u need to modify plus enhance the project
need to analyze exiisitng frame work and ideas and write a comparision and technical analysis
I have a spreadsheet with requirements for a remuneration survey. It's fairly short. I'd like someone who is proficient with Survey Monkey to design a user-friendly survey instrument for me. I am attaching the spreadsheet so you can see what's needed as far as data requirements go. Need a quick turnaround, please. Filters to be inserted as necessary
...Berkeley. I’m working on a project for my student-run consulting club where my team is researching freelancers and their use of small business management software. I am seeking to survey you, and am wondering if you could help my team out and answer a few questions.
Any response is appreciated! Thank you for your time, and I’m looking forward to hearing from
I'm a journalist. I'm setting up a new "solutions journalism" website that will also build up an online subscriber/member community affiliated with the website. I need something that allows me to publish written articles, photo galleries, podcasts, occasional videos. There will be an 'events' page. Readers must be able to leave comments. Subscribers must be able to jo...
...company and we need to conduct a survey for one of our clients. We need to contact 50 consumers in Pune and Bangalore (25 from each city) and 50 business owners in Pune and Bangalore (25 from each city). So, there are 2 surveys we need a total of 100 responses (50 for each survey).
Survey questions are ready and the survey will not take more than 5 minutes
I'm looking for someone to help me make a simple survey site, it should have those 4 smiley faces and preferably save all answers in a db or similar. If the customer click on a sad smiley they get 5 checkboxes to choose from what they did not like.
I don't care if it's a wordpress site or pure javascript.
...on a Harvard Business Review (HBR) case. Your Survey should include an identification of the major issues involved, your analysis of the issues and problems, and your recommendations on what the characters involved should do – and why. More suggestions on analyzing the case will be provided.
The Survey is in a paper format that should be around 5-6
Looking for someone to convert an employee engagement survey with animation from Spanish to English. We have all of the original codes.
Need someone with experience that can complete conversion from Spanish to English in a timely manner. |
Antitussive effect of [Met5]enkephalin-Arg6-Phe7 in mice.
We examined the effect of [Met5]enkephalin-Arg6-Phe7 (MEAP) on the capsaicin-induced cough reflex in mice. Intracerebroventricular administration of MEAP significantly decreased the number of coughs in a dose-dependent manner. The antitussive effect of MEAP was blocked by nor-binaltorphimine, a selective kappa-opioid receptor antagonist. However, beta-funaltrexamine, a mu-opioid receptor antagonist, had no effect on the antitussive effect of MEAP. On the other hand, the antinociceptive effect of MEAP, as determined in the tail-flick test, was blocked by both nor-binaltorphimine and beta-funaltrexamine. Naltrindole, a delta-opioid receptor antagonist, had no effect on either the antitussive effect or the antinociceptive effect of MEAP. These data suggest that MEAP exerts its antitussive effect in mice through the stimulation of kappa-opioid receptors, whereas the antinociceptive effect of MEAP is mediated through the simulation of both kappa- and mu-opioid receptors. |
Q:
Query id return type
I use spring data. I want to get some contracts from DB. So i create two querys. In first i get contracts id that i need, in second i get contract by this id.
First query in Repository.class
@Query(nativeQuery = true, value =
"select id from (" +
"select contract.id, max(invoice.period_to) " +
"from public.invoice " +
"join public.contract on contract.id = invoice.contract_id " +
"where invoice.period_to <= '2017-10-20' " +
"AND contract.close_type IS NULL " +
"AND contract.payment_type != 'TRIAL' " +
"group by contract.id" +
") foo ")
List<Long> findContractsIdForInvoicesCreation();
ServiceJPA.class
List<Long> contractsId = ContractRepository.findContractsIdForInvoicesCreation();
List<Contract> contracts = contractRepository.findAll(contractsId);
But in last line above i have an error.
java.lang.IllegalArgumentException: Parameter value element [2] did not match expected type [java.lang.Long (n/a)]
If i simply create
List<Long> contractsIdL = new ArrayList<>();
contractsIdL.add(2L);
contractsIdL.add(3L);
contractsIdL.add(4L);
List<Contract> contracts = contractRepository.findAll(contractsId);
All works fine. Cant figureout what is wrong. In wich type do first query return id?
p.s. id type in DB is bigint
p.p.s I cheked first query with System.out.println - it seems to return corect numbers.
A:
I think the issue is with ContractRepository.findContractsIdForInvoicesCreation();
I think it doesn't return List<Long> as you expected
|
[Effective radiofrequency lesioning for obturator nerve neuropathy].
A 73-year-old female complained of pain in the right lower-abdomen and medial aspect of the distal thigh after a gynecological operation. Computer tomography and MRI findings excluded obturator canal herniation or lumbar plexopathy. Both lumbar epidural block and obturator nerve block with local anesthetics were effective, except their limited duration of pain relief and muscle weakness for several hours after the blockade. Treatment with radio-frequency lesion of 50 degrees C for 60 seconds of the right obturator nerve relieved her pain for 9 months without muscle weakness. This case shows usefulness of radiofrequency lesion for obturator nerve pain. |
Receive the latest national-international updates in your inbox
More flights canceled on Monday as travelers try to get around on American Airlines. (Published Monday, Sept. 24, 2012)
There’s more fallout Monday in the feud between American Airlines and pilots. The company said the feud is impacting passengers as well as other American employees forced to pick up the slack.
The number of flight cancellations are worse than expected, topping 400 flights cut in the past week. The latest numbers from flightstats.com show 156 American cancellations on Monday, 40 from Dallas-Fort Worth International Airport.
“We sat on the runway for an hour-and-a-half,” said American Airlines passenger Tiffany Brendum.
Brendum is on standby trying to take off from DFW with her 8-year-old son, Jacob. She says her Friday flight here from Chicago was delayed after the pilot reported a series of problems.
“It’s inconveniencing mechanics to come out from the hangar, come out to sign-off on it. First, it was tire pressure, then it was a fuel leak. I don’t think those are the problems, I think pilots are striking in a different way,” said Brendum.
“First of all, we apologize to all of our customers for this inconvenience this has caused. We understand how irritating and unfortunate this is, interrupting or delaying travel plans. We appreciate their patience and hope for their understanding. We also appreciate very much the difficult work this has caused so many of our people, especially appreciate the fabulous job our maintenance crews have been doing, taking care of these additional write-ups,” said American Airlines spokesman Bruce Hicks.
Hicks told NBC 5 that mechanics have been working overtime to meet demand after pilots have filed an unprecedented number of maintenance write-ups in the past two weeks.
To meet demand, the company has also brought in crews from Tulsa to supplement staffing to get planes back on schedule.
“It’s not fair to the passengers, and it’s not fair to staffing here,” said Brendum.
The company said it’s “all hands on deck” for other employees dealing with the backlash from the cancellations.
“Airport agents are fully staffed to assist with the customer inconvenience issues, including helping reroute customers from last-minute cancellations. Our reservations personnel are hard at work re-accommodating customers from the flights that are part of the 1-2 percent service reduction through October. And flight attendants are, of course, doing a really great job dealing with customer complaints from the significant increase in delayed flights,” Hicks said.
The Allied Pilots Association insists that pilots are writing up legitimate issues.
“No pilot in his right mind would falsely make a logbook entry,” said Tom Hoban from the APA.
The pilots’ union blames the cancellations on an aging fleet of aircraft, delayed maintenance and layoffs for what it calls an “operational disaster.” The pilots insist, they want to get off the ground like everyone else.
“The pilots aren’t paid until the aircraft is pushed off the gate. We’re dealing with the same frustrations you are. We want to see the aircraft safely in operation,” said Hoban.
Still, some passengers don’t sympathize with the pilots.
“They need to get over themselves and realize it’s not just affecting them, it’s affecting everyone,” said Brendum. |
Isolation and primary structure of glucagon from the endocrine pancreas of Thunnus obesus.
Glucagon has been isolated from the endocrine pancreas of a tunid, Thunnus obesus. The primary structure of the glucagon molecule was established as H S E G T F S N D Y S K Y L E T R R A Q D F V Q W L K N S. The sequence is identical to those of sculpin and flounder glucagon and glucagon II from anglerfish. It also shows high homology to the mammalian hormone (76%). The mass determined by fast-atom bombardment (3508) was consistent with the proposed structure. Immunological properties of the tuna glucagon were analyzed by radioimmunoassay, showing a high degree of cross-reactivity with the 30K antibody. |
Q:
I'm unable to post data in Sinatra
I'm having problems doing some simple stuff, I'm not sure if I'm doing something wrong. I'm using the most recent versions of Ruby and Sinatra (1.9.3 and 1.3.3) under Windows
My main code is:
require 'sinatra'
get '/form' do
erb :form
end
post '/form' do
"Value: '#{params[:somevalue]}'"
end
My ERB:
<form action="/form" method="post">
<input type="text" name"somevalue">
<input type="submit">
</form>
When I press submit, it won't show the values. It'll just show: Value: ''
I even tried with a plain HTML (with the same result).
These are my request headers:
Accept:text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8
Accept-Charset:ISO-8859-1,utf-8;q=0.7,*;q=0.3
Accept-Encoding:gzip,deflate,sdch
Accept-Language:es,en-US;q=0.8,en;q=0.6
Cache-Control:max-age=0
Connection:keep-alive
Content-Length:0
Content-Type:application/x-www-form-urlencoded
Host:localhost:4567
Origin:http://localhost:4567
Referer:http://localhost:4567/form
User-Agent:Mozilla/5.0 (Windows NT 6.2; WOW64) AppleWebKit/537.11 (KHTML, like Gecko) Chrome/23.0.1271.91 Safari/537.11
Do I need to configure something?
A:
You're missing a = after name in your .erb
Works for me after I added this.
|
Annahugh
Annahugh () is a small village and townland near Loughgall in County Armagh, Northern Ireland. While most of the settlement is within the townland of Annahugh, part of it extends into the neighbouring townland of Ballyhagan (Baile Uí hAgáin). Hence, the two names are sometimes used to refer to the same settlement. It is situated within the Armagh City and District Council area. It had a population of 275 people (98 households) in the 2011 Census. (2001 Census: 159 people)
References
See also
List of towns and villages in Northern Ireland
Category:Villages in County Armagh
Category:Townlands of County Armagh |
Heartless Mother Tries to Sell Her Kids on Facebook
A young heartless mum has been arrested for an attempt to sell her Children on Facebook to bail out her husband from jail.
The 22 years mother from Sallisaw, Oklahoma, named Misty VanHorn was contacting people to buy her kids via Facebook.
Local police at Sallisaw told media that the 22 years old mother Misty tried to sell her 10-months old baby for $4,000 (£2,680) and two years old for $1,000 (£670).
While talking with an unknown potential buyer from Fort Smith, “the cold hearted mother writes on Facebook “Just come to Sallisaw, it’s only 30 minutes away and I’ll give you all of her stuff and let y’all have her forever for $1,000.”
Thanks to the same female anonymous potential buyer who notified the police about the incident and as a result Misty was arrested.
Sky News reports, neighbors at Sallisaw told police that same mother was found going door by door asking for money.
Now she is in jail on $40,000 (£26,800) bail and the children are under state custody.
HACKREAD is a News Platform that centers on InfoSec, Cyber Crime, Privacy, Surveillance and Hacking News with full-scale reviews on Social Media Platforms & Technology trends. Founded in 2011, HackRead is based in Milan, Italy. |
; RUN: llvm-as < %s >%t.bc
; PR21108: Diagnostic handlers get pass remarks, even if they're not enabled.
; Confirm that there are -pass-remarks.
; RUN: llvm-lto -pass-remarks=inline \\
; RUN: -exported-symbol _func2 -pass-remarks-analysis=loop-vectorize \\
; RUN: -exported-symbol _main -o %t.o %t.bc 2>&1 | \\
; RUN: FileCheck %s -allow-empty -check-prefix=REMARKS
; RUN: llvm-nm %t.o | FileCheck %s -check-prefix NM
; RUN: llvm-lto -pass-remarks=inline -use-diagnostic-handler \\
; RUN: -exported-symbol _func2 -pass-remarks-analysis=loop-vectorize \\
; RUN: -exported-symbol _main -o %t.o %t.bc 2>&1 | \\
; RUN: FileCheck %s -allow-empty -check-prefix=REMARKS_DH
; RUN: llvm-nm %t.o | FileCheck %s -check-prefix NM
; Confirm that -pass-remarks are not printed by default.
; RUN: llvm-lto \\
; RUN: -exported-symbol _func2 \\
; RUN: -exported-symbol _main -o %t.o %t.bc 2>&1 | \\
; RUN: FileCheck %s -allow-empty
; RUN: llvm-nm %t.o | FileCheck %s -check-prefix NM
; RUN: llvm-lto -use-diagnostic-handler \\
; RUN: -exported-symbol _func2 \\
; RUN: -exported-symbol _main -o %t.o %t.bc 2>&1 | \\
; RUN: FileCheck %s -allow-empty
; RUN: llvm-nm %t.o | FileCheck %s -check-prefix NM
; Optimization records are collected regardless of the diagnostic handler
; RUN: rm -f %t.yaml
; RUN: llvm-lto -lto-pass-remarks-output=%t.yaml \\
; RUN: -exported-symbol _func2 \\
; RUN: -exported-symbol _main -o %t.o %t.bc 2>&1 | \\
; RUN: FileCheck %s -allow-empty
; RUN: cat %t.yaml | FileCheck %s -check-prefix=YAML
; REMARKS: remark: {{.*}} foo inlined into main
; REMARKS: remark: {{.*}} loop not vectorized: cannot prove it is safe to reorder memory operations
; REMARKS_DH: llvm-lto: remark: {{.*}} foo inlined into main
; REMARKS_DH: llvm-lto: remark: {{.*}} loop not vectorized: cannot prove it is safe to reorder memory operations
; CHECK-NOT: remark:
; CHECK-NOT: llvm-lto:
; NM-NOT: foo
; NM: func2
; NM: main
; YAML: --- !Passed
; YAML-NEXT: Pass: inline
; YAML-NEXT: Name: Inlined
; YAML-NEXT: Function: main
; YAML-NEXT: Args:
; YAML-NEXT: - Callee: foo
; YAML-NEXT: - String: ' inlined into '
; YAML-NEXT: - Caller: main
; YAML-NEXT: - String: ' with '
; YAML-NEXT: - String: '(cost='
; YAML-NEXT: - Cost: '-15000'
; YAML-NEXT: - String: ', threshold='
; YAML-NEXT: - Threshold: '337'
; YAML-NEXT: - String: ')'
; YAML-NEXT: ...
target datalayout = "e-m:o-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-apple-darwin"
declare i32 @bar()
define i32 @foo() {
%a = call i32 @bar()
ret i32 %a
}
define i32 @main() {
%i = call i32 @foo()
ret i32 %i
}
define i32 @func2(i32* %out, i32* %out2, i32* %A, i32* %B, i32* %C, i32* %D, i32* %E, i32* %F) {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.037 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%arrayidx = getelementptr inbounds i32, i32* %A, i64 %i.037
%0 = load i32, i32* %arrayidx, align 4
%arrayidx1 = getelementptr inbounds i32, i32* %B, i64 %i.037
%1 = load i32, i32* %arrayidx1, align 4
%add = add nsw i32 %1, %0
%arrayidx2 = getelementptr inbounds i32, i32* %C, i64 %i.037
%2 = load i32, i32* %arrayidx2, align 4
%add3 = add nsw i32 %add, %2
%arrayidx4 = getelementptr inbounds i32, i32* %E, i64 %i.037
%3 = load i32, i32* %arrayidx4, align 4
%add5 = add nsw i32 %add3, %3
%arrayidx6 = getelementptr inbounds i32, i32* %F, i64 %i.037
%4 = load i32, i32* %arrayidx6, align 4
%add7 = add nsw i32 %add5, %4
%arrayidx8 = getelementptr inbounds i32, i32* %out, i64 %i.037
store i32 %add7, i32* %arrayidx8, align 4
%5 = load i32, i32* %arrayidx, align 4
%6 = load i32, i32* %arrayidx1, align 4
%add11 = add nsw i32 %6, %5
%7 = load i32, i32* %arrayidx2, align 4
%add13 = add nsw i32 %add11, %7
%8 = load i32, i32* %arrayidx4, align 4
%add15 = add nsw i32 %add13, %8
%9 = load i32, i32* %arrayidx6, align 4
%add17 = add nsw i32 %add15, %9
%arrayidx18 = getelementptr inbounds i32, i32* %out2, i64 %i.037
store i32 %add17, i32* %arrayidx18, align 4
%inc = add i64 %i.037, 1
%exitcond = icmp eq i64 %inc, 256
br i1 %exitcond, label %for.end, label %for.body
for.end: ; preds = %for.body
ret i32 undef
}
|
A tale
of a movie director caught in a complex murder mystery. Murder, sex, and lust. With a
story that could only happen in Hollywood, and actionthat could only happen
at Vivid. With one hot scene from Vanessa Lane. |
SPI with a Blindfold On- speed up by letting go and trusting the machine - luu
http://wp.josh.com/2015/09/29/bare-metal-fast-spi-on-avr/
======
tonyarkles
This reminds me of an unfortunate bug I was debugging the other day that had
the same solution but a different problem on different hardware.
Here's the setup: I have a weird SPI device that has two different CS lines:
one for accessing the control registers, and one for accessing the data
buffer. Because of this, I have to handle CS manually and can't just let the
SPI peripheral handle it. Fair enough, not a big deal. So I pull CS low, stick
some data into the output register, and wait for TX_BUSY to go to 0 (i.e. done
transmitting). Unfortunately, TX_BUSY goes low after the rising edge of the
last bit, but before the falling edge of the clock back to idle. Despite the
device saying that it's active on the rising edge of the clock, it totally
disregards input data if CS goes back to idle before the last falling edge of
the clock.
Solved by adding some nop cycles. Easy to count how many are necessary because
the peripheral and CPU are deterministic as described in the article, but damn
what a debugging nightmare.
------
sannee
That's the cost one has to pay for using antiquated slow hardware which does
not even have DMA.
~~~
tonyarkles
DMA is nice, no doubt, but it's not the ultimate solution to every problem.
Have a look at my problem above... DMA wouldn't have helped. In fact, I'd
probably have ended up starting with a DMA implementation, reverted back to a
non-DMA implementation while debugging, and then would have stuck a bunch of
nops into the DMA interrupt to make sure that I waited enough cycles before
de-asserting CS.
|
A drainage tube for mediastinal abscesses.
The problem of mediastinal abscesses following esophageal rupture or perforation continues to be a source of considerable morbidity and mortality. Drainage of the paraesophageal area by semirigid chest catheters can occasionally cause aortic erosion. A technique of using soft rubber drains within the standard chest tube combines the benefits of early suction with long term drainage of the abscess cavity. |
[Pain of the joint of inflammatory diseases pathobiochemistry and pharmacology.].
Pain is the leading symptom of inflammatory joint diseases. It is immediately caused by the release of prostaglandins (and potentially leukotrienes) from cells of the inflamed tissues, which sensitizes the pain receptors. The synthesis of these mediators depends on the activation of infiltrated inflammatory cells, as well as recruitment of tissue born cells, predominantly by the inflammatory cytokines Interleukin-1 (IL-1) or tumor necrosis factor (TNF). In chronic diseases such as rheumatoid arthritis the inflammatory reaction is initialized and perpetuated by (auto)-immuno reactions. The associated chronic pain is thus the end point of a complex multi-level disease process. The hierarchy of these regulatory processes is mirrored by the pharmacological interventions. Inhibitors of the key enzyme of prostaglandin synthesis, cyclooxigenase, such as the non-steroidal anti-inflammatory drugs (NSAID) are immediately analgetic. Anti-inflammatory drugs as the glucocorticoids predominantly decrease the synthesis of cytokines, and thereby the stimuli leading to prostaglandin synthesis. Together with a decrease of the synthesis of arachidonate metabolizing enzymes this leads to correction of pain. Although not directly analgetic, immunosuppressive drugs, too, by decreasing the immune reaction dependent inflammation, contribute to pain relief. |
Distance (SS501 song)
"Distance～君とのキョリ" is South Korean boy band SS501's second Japanese maxi single. It was released barely a month after their successful first single, Kokoro.
The album consists of three songs, "Distance～君とのキョリ", "Gleaming Star", and "Wonderful World" and an instrumental version of each track. For the limited edition, they included the Japanese version of "Coward" from their first Korean studio album, S.T 01 Now.
Track listing
NOTE: For the limited editions, "Wonderful World" track is not available.
Music videos
"Distance～君とのキョリ"
Release history
References
External links
Category:SS501 songs
Category:2007 singles
Category:2007 songs
Category:Pony Canyon singles |
Propelling medical humanities in China.
Advances in the study of the medical humanities and medical humanities education have been made over the past few decades. Many influential journals have published articles examining the role of medical humanities and medical humanities education, the development and evaluation of medical humanities, and the design of a curriculum for medical humanities education in Western countries. However, most articles related to medical humanities in China were published in Chinese, moreover, researchers have worked in relative isolation and published in disparate journals, so their work has not been systematically presented to and evaluated by international readers. The six companion articles featured in this issue describe the current status and challenge of medical humanities and medical humanities education in China in the hope of providing international readers with a novel and meaningful glimpse into medical humanities in China. This Journal is calling for greater publication of research on medical humanities and medical humanities education to propel medical humanities in China. |
1. Breakfast with UNICEF: Leading thinkers, leading ideas -In the first of a series of five, Nobel laureate Dr Rajendra Pachauri talks about the ways to avoid disaster due to climate change.
2. Breakfast with UNICEF: Leading thinkers, leading ideas –In the second of a series of five, development economist Professor Jean Dreze talks on how and why pervasive poverty and stunting must be tackled and why two year-olds matter so much.
3. Breakfast with UNICEF: Leading thinkers, leading ideas –In the third of a series of five, the Chairperson of the National Commission for Protection of Child Rights, Professor Shantha Sinha, talks on how she’s winning the fight against child labour.
//www.youtube.com/embed/FbhV1UwY0gk
5. Breakfast with UNICEF: Leading thinkers, leading ideas –In the final of this series, the Senior Fellow at the Centre for the Study of Developing Societies, Professor Yogendra Yadav talks on how education risks reinforcing – not reducing – inequality. |
Usefulness of the 15-item geriatric depression scale (GDS-15) for classifying minor and major depressive disorders among community-dwelling elders.
The 15-item geriatric depression scale (GDS-15) is a short form of GDS and is used to screen, diagnose, and evaluate depression in elderly individuals. Most previous studies evaluated the ability of GDS-15 to discriminate between depressive and non-depressive states. In this study, we investigated the multi-stage discriminating ability of GDS-15. A total of 774 participants, over 65 years of age were included (normal, n = 650; minor depressive disorder [MnDD], n = 94; major depressive disorder [MDD], n = 30). Multi-category receiver operating characteristic (ROC) surfaces were evaluated to identify three stages of geriatric depression. The optimal cutoff points were selected based on the volume under the ROC surface (VUS) and the Youden index. In the results of multi-category classification analyses, VUS of the GDS-15 of 0.61 was obtained, and optimal cutoff points of the GDS-15 for multiple stages of depression of 4 (between normal and MnDD) and 11 (between MnDD and MDD) were derived. The Youden index for the GDS-15 was 0.49, and the derived optimal cutoff points were 5 and 10, for the multiple stages, respectively. The overall diagnostic accuracy based on the Youden index was superior to that based on the VUS in the GDS-15. The participants' cognitive function has potential to affect the GDS-15 score; nevertheless, the study included those with mild cognitive impairment. GDS-15 was a useful tool to classify stages of geriatric depression into either minor or major depressive disorder. |
Kvalifikāciju sistēma mūžizglītībai (debates)
Priekšsēdētājs
Nākamais punkts ir Mario Mantovani ziņojums Nodarbinātības un sociālo lietu komitejas vārdā par priekšlikumu Eiropas Parlamenta un Padomes ieteikumam attiecībā uz Eiropas kvalifikāciju sistēmas izveidošanu mūžizglītībai - C6-0294/2006 -
Peter Mandelson
Komisijas loceklis. - Priekšsēdētāja kungs, es vēlos pateikties Mantovani kungam un Komisijas vārdā izteikt viņam un atbildīgajām komitejām pateicību par to aktīvo iesaistīšanos un atbalstošo nostāju sarunās par Eiropas kvalifikāciju sistēmu (EKS) mūžizglītībai.
Šis ieteikums attiecas uz Eiropas būtību: mobilitāti, valstu sadarbību, labklājības veicināšanu un palīdzību atsevišķiem iedzīvotājiem. Mēs ierosinām EKS, jo jūs, Eiropas Parlaments, un dalībvalstis mums lūdzāt meklēt risinājumus, kā veicināt mobilitāti un mūžizglītību, kas ir vajadzīga Lisabonas mērķu sasniegšanai. EKS tika izstrādāta saskaņā ar Izglītības un apmācības 2010. gada darba programmu, kas ir izglītības dimensija Lisabonas dienaskārtībā.
EKS mērķis ir pārvarēt šķēršļus, kas kavē Eiropas strādniekus un studentus gadījumos, kad viņi vēlas mainīt darbu vai pārcelties uz citu valsti darba vai mācību dēļ. Eiropas iedzīvotājiem pārāk bieži ir problēmas izmantot savu kvalifikāciju citā Eiropas valstī. Pat savā valstī izglītība ir ierobežota valsts izglītības sistēmas dažādo jomu nepietiekamās integrācijas dēļ.
EKS izveidos saikni starp valstu dažādajām kvalifikācijas sistēmām, veicot tulkošanas funkciju. Tādējādi citu valstu kvalifikācijas būs vieglāk saprotamas un dos cilvēkiem iespēju pārcelties uz citu valsti, ja viņi vēlas strādāt vai mācīties.
Valsts līmenī tā veicinās - tā patiešām jau to dara - valstu kvalifikācijas sistēmu attīstību. Kvalifikāciju sistēmas veicina mūžizglītību, piemēram, atvieglojot cilvēkiem iespēju pāriet uz dažādu veida izglītības un apmācības iestādēm, piemēram, no arodmācības uz augstākās izglītības iestādi.
Es vēlos apliecināt, ka EKS ir tehnisks, pat sarežģīts instruments. To galvenokārt izmantos speciālisti un izglītības amatpersonas, bet tā sniegs priekšrocības pilsoņiem.
Tas, par ko mēs šodien debatējam, ir Komisijas, valstu, sociālo partneru, izglītības un apmācības asociāciju un citu ieinteresēto pušu kopēju centienu iznākums. EKS lielā mērā tika veidota uz vienprātības pamata, un mēs centāmies iesaistīt ieinteresētās puses visā procesa gaitā.
EKS iesaka valstīm līdz 2010. gadam sasaistīt savas kvalifikāciju sistēmas ar EKS un līdz 2012. gadam nodrošināt to, ka atsevišķu valstu kvalifikāciju sistēmās ir norāde uz attiecīgo EKS līmeni. Šos termiņus ierosināja Padome un Parlaments.
Mēs arī ar prieku piekritām iekļaut jaunu ieteikumu par kvalitātes garantiju, ko ierosināja Parlaments un kas pēc mūsu domām pastiprina šo principu nozīmi.
Mēs arī piekrītam Parlamenta ierosinājumam iekļaut norādi uz kredītsistēmām, kas atzīst šo kvalifikācijas sistēmu elementu ātro attīstību un piemērošanu.
Mēs uzskatām, ka Parlaments un Padome patiešām ir uzlabojusi dokumentu. Pieeja, ko Parlaments, Padome un Komisija pieņēma sarunās, atspoguļo vienprātību attiecībā uz EKS visā Eiropas teritorijā.
EKS pašlaik tiek ļoti atbalstīta; lielākā daļa valstu atzīst tās mobilitātes potenciālu un iespēju būt par mūžizglītības instrumentu.
Lielākā daļa valstu pašlaik izstrādā valsts kvalifikāciju sistēmu, kas būs saistīta ar EKS, tādējādi šim priekšlikumam jau ir liela ietekme uz Eiropas izglītības un apmācības sistēmām.
Es ceru, ka jūs piekritīsit atbalstīt šo priekšlikumu pirmajā lasījumā, lai turpmākajās nedēļās to oficiāli varētu pieņemt Padome.
Mario Mantovani
Priekšsēdētāja kungs, komisār, dāmas un kungi, es uzskatu, ka šis vakars iezīmē tāda liela projekta sākumu, ko Eiropa, dalībvalstis un Eiropas Savienības reģioni un pilsētas ir ilgi gaidījušas; mērķi, kuru gadiem ilgi centušās sasniegt dažādas ieinteresētās puses izglītības, nodarbinātības, tirdzniecības un ekonomikas jomā un to, ko vēlas visa sabiedrība kopumā.
Rīt, kad tiks apstiprināta Eiropas Kvalifikācijas sistēma, mēs ieliksim pamatu labākai rītdienai, sniedzot turpmākajām paaudzēm kopēju atskaites punktu viņu kultūras, izglītības un profesionālajiem pasākumiem, apmācībai un, protams, darbam.
Atbilstoši Lisabonas stratēģijai Eiropas Kvalifikāciju sistēma tiešā veidā nodrošina saiknes uzlabošanu starp skolām, universitātēm, darbavietu un formālu, neformālu un neoficiālu mūžizglītību, nodrošinot pārredzamu kvalifikāciju un sertifikātu atzīšanu gan valsts, gan nozaru līmenī un vienmēr saskaņā ar Eiropas sistēmu. Tā arī stiprinās sadarbību starp dalībvalstīm jutīgajā dažādu sistēmu salīdzināšanas jomā.
Šis ir tas temats, kas periodiski aktualizējas un kurš saskaņā ar Lisabonas stratēģiju ir licis mums uzņemties pienācīgu atbildību, sniedzot izvēli, kas pēc manām domām noteikti veicinās izaugsmi, attīstību un konkurētspēju Eiropā, kurai jānosaka sociālā kohēzija par vienu no mērķiem.
Tas ir ilgstošs projekts, kas radās pēc Boloņas procesa kā līdzvērtīgu kredītu uzkrāšanas un pārskaitīšanas sistēma un atkal kļuva aktuāls Barselonas samitā kā profesionālās apmācības sistēma. Tas tika uzlabots 2004. gadā Bergenā un atkal 2005. gada Padomē, kas atkārtoti parādīja vajadzību pieņemt esošo sistēmu. Ceļojums vēsturē, kas skaidri attēlo Eiropas lēmumu pieņēmēju godkārīgo mērķi radīt jaunu instrumentu, ko daudzi uzskata par revolucionāru, bet kurš ir vajadzīgs Eiropas integrācijas procesam, ko mēs veicam jau tik daudzus gadus.
Priekšsēdētāja kungs, dāmas un kungi, es esmu pārliecināts, ka šī sistēma ne tikai veicinās pārrobežu mobilitāti, bet būs ES starptautiskās mobilitātes virzītājspēks - ja mēs domājam par studentiem, strādniekiem, pētniekiem un brīvprātīgajiem kopumā, un visiem tiem, kam brīvi jāpārvietojas Eiropas teritorijā, neradot paniku vai pārmērīgas bažas. Jums jāatceras Polijas santehniķa stāsts, kurš satricināja Franciju - tas bija viens no galvenajiem iemesliem, kāpēc Francijas iedzīvotāji referendumā balsoja pret Eiropas Konstitūciju.
Izskatāmais dokuments ir daudzu mēnešu darba iznākums, cieši sadarbojoties ar Padomes pārstāvjiem Portugāles prezidentūras laikā, kura nekavējoties apzinājās šī godkārīgā projekta nozīmi.
Komisija komisāra J. Figel' personā ir cieši sekojusi visam šim procesam, un tieši pateicoties šim partnerības garam mums bija iespēja uzlabot tekstu, tajā iekļaujot jēdzienus, kas ir ļoti būtiski Nodarbinātības un sociālo lietu komitejai. Tādēļ es esmu ļoti pateicīgs maniem kolēģiem, ēnu referentiem - es redzu Castex kundzi, Kusstatscher kungu, liberāļus - kā arī Mann kungu un Kasoulides kungu, un visus tos, kuri sniedza savu ieguldījumu. Pateicoties viņu lielajai līdzdalībai un apņēmībai mums bija iespēja iekļaut šādus jēdzienus: sociālā integrācija; darba tirgus prasības; personīgā attīstība, izmantojot dažādas apmācības iespējas; nediskriminācija, iesaistot cilvēkus ar grūtībām; vienlīdzīgas iespējas; subsidiaritātes principa ievērošana un koordinācijas centru izveidošana dalībvalstīs.
Mēs arī nodrošinājām to, ka ieteikums nebija saistošs, lai gan pēc būtības tas paliek normatīvs. Tas neapšaubāmi netika darīts nespējas dēļ, bet apzinoties atbildību un īstenību, lai veicinātu šī instrumenta piemērošanu tajās valstīs, kurām vajag vairāk laika. Īsi sakot, nav šaubu, ka to var uzlabot, bet šajā dzīvē visu var uzlabot. Tomēr es esmu pārliecināts, ka dokumentam, ko izskatām, ir dvēsele un sirdsapziņu.
Es uzskatu, ka Eiropas Parlamenta pienākums ir izstrādāt tiesību aktus pilsoņu patiesajās interesēs. Tas ir tas, ko esam paveikuši šajā gadījumā. Dokumenta apstiprināšana pirmajā lasījumā to apliecina, daļēji pateicoties Gaľa kungam, Kultūras un izglītības komitejā, Sieviešu tiesību un dzimumu līdztiesības komitejai un Rūpniecības, pētniecības un enerģētikas komitejai, kas visi sniedza pozitīvu ieguldījumu.
Pilar del Castillo Vera
Rūpniecības, pētniecības un enerģētikas komitejas atzinuma sastādītāja. - (ES) Priekšsēdētāja kungs, komisār, es vēlos sākt ar atzinību referentam, jo viņš patiešām ir atrisinājis jautājumu, kas pārsniedz mūsu iztēli.
Globālajā pasaulē, Eiropa un dažādās Eiropas valstis skaidri iezīmēsies ar savu cilvēkresursu kvalifikāciju. Ja mums vienā pīlārā vajadzētu apkopot, kas ir tas, kas padarīs Eiropu un visas to veidojošās valstis konkurētspējīgas šajā globālajā pasaulē, tā ir cilvēkresursu, Eiropas pilsoņu kvalifikācija.
Ņemot to vērā, ir absolūti būtiski, lai mūžizglītība un apmācība tiktu pielāgota darba tirgus prasībām un pastāvīgi tām atbilstu. Ja tā nebūs, konkurēt nebūs iespējams.
Mēs arī iebildīsim pret šādu paradoksu: cilvēki noveco, bet šie cilvēki gados kļūst jaunāki un, iespējams, aktīvāki, tomēr viņiem trūkst resursu, lai turpmāk būtu ražīgi, noderīgi sabiedrībai un atrastu piepildījumu nodarbinātības pasaulē.
Ņemot to vērā, pirmais aspekts ir šāds: ka galvenā nozīme jāpiešķir mūžizglītībai, kuras pamatā ir tehnoloģiska dimensija, kas sniedz pievienoto vērtību. Tomēr ir arī otrs aspekts, kas attiecas uz Eiropas nākotni - šo cilvēkresursu integrēšana konkurētspējīgā iekšzemes tirgū, kam ir vajadzīgas visu dalībvalstu atzītas kvalifikācijas.
Tāpēc, jo tas ir vajadzīgs cilvēka attīstībai šādā konkurējošā pasaulē un jo tas ir vajadzīgs iekšzemes tirgus attīstībai, tas ir jautājums, kam ir daudz lielāka nozīme nekā tam, iespējams, piešķirta, iekļaujot debatēs tik vēlā dienas laikā.
Priekšsēdētājs
Paldies jums, del Castillo kundze, tomēr vakara debates vienmēr ir pašas interesantākās.
Milan Gaľa
Kultūras un izglītības komitejas atzinuma sastādītājs. - (SK) Pirmkārt, es vēlos pateikties referentam Mantovani kungam par viņa darbu, sagatavojot ziņojuma par Eiropas Kvalifikāciju sistēmu. Mēs par šo tematu esam debatējuši Eiropas Parlamentā kopš 2006. gada pavasara. Kā mēs zinām, spēcīgs atbalsts Eiropas Kvalifikāciju sistēmai ir neatņemama Lisabonas stratēģijas sastāvdaļa. Tā pildīs tulkošanas funkciju starp dažādām kvalifikācijas sistēmām un to līmeņiem, un tās ieviešana sniegs lielāku pilsoņu kvalifikāciju pārredzamību, salīdzināmību un pārnesamību dalībvalstīs. Turklāt Eiropas Kvalifikāciju sistēma palīdzēs starptautiskām nozaru organizācijām uzlabot saikni ar to nozaru kvalifikāciju sistēmām un valstu kvalifikāciju sistēmām, tādējādi palīdzot palielināt strādājošo un studējošo mobilitāti.
Saskaņā ar subsidiaritātes principu es izsaku atbalstu Eiropas Kvalifikāciju sistēmas nesaistošajam raksturam dalībvalstīs un valstu kvalifikāciju sistēmu izveidošanai saskaņā ar valstu tiesību aktiem un praksi. Tomēr Eiropas Kvalifikāciju sistēma kļūs par efektīvu instrumentu kvalifikāciju atzīšanai un salīdzināšanai Eiropas mērogā tikai tad, ja tā ES dalībvalstīs tiks pastāvīgi īstenota kā mūžizglītības sistēmu sastāvdaļa. Ņemot vērā to, ka EKS ir tiešā veidā saistīta ar to, kā pilsoņi pierāda sevi darba tirgū un ietekmē profesionālās izglītības un apmācības kvalitāti, to arī var uzskatīt par būtisku rīku konkurētspējas palielināšanai.
Thomas Mann
PPE-DE grupas vārdā. - (DE) Priekšsēdētāja kungs, Eiropas Kvalifikāciju sistēma ir starta šāviens profesionālās apmācības atbrīvošanai ES līmenī, jo tā dos iespēju visā Eiropas teritorijā atzīt profesionālo kvalifikāciju tieši tāpat kā akadēmisko kvalifikāciju. Tas prasa laiku un vēlmi sadarboties, koordinēt un mainīt uzskatus. Cilvēkiem, kas aizstāv tikai to, ko zina, un izvairās no jaunas pieredzes, nevajadzētu būt pārsteigtiem, konstatējot to, ka viņiem trūkst mobilitātes.
Mums ir vajadzīga lielāka skaidrība. Valsts apmācības kvalifikācijām jābūt salīdzināmām, lai gan tas nenozīmē, ka tām jābūt standartveida. Es jau uz to mudināju pagājušajā gadā EKS patstāvīgajā atzinumā, ko es sagatavoju Parlamentam. Kopš tā laika ir noticis daudz. Satraukums par to, ka dalībvalstis zaudētu pilnvaras, tika mazināts arī manā valstī. Mūžizglītība un EKS bija galvenie pagrieziena punkti par sekmīgu atzītās Vācijas Padomes prezidentūras laikā. Pašlaik tā pilnā sparā izstrādā valsts kvalifikāciju sistēmu, kas nebūt nav vienkārši, ņemot vērā Vācijas federatīvo struktūru un katras zemes autonomiju.
Es vēlos pateikties Mario Mantovani EPP-ED grupas vārdā par viņa neatlaidību, strādājot ar Komisiju un Padomi, un par pastāvīgu informācijas sniegšanu visiem tiem grupu deputātiem, kas sekoja EKS izstrādei. Es ceru, ka šis ziņojums tiks pieņemts rīt pirmajā lasījumā.
Turpmāk būs vajadzīgas intensīvas apspriedes starp pasniedzējiem, skolotājiem un mācību iestādēm, jo mēs iedziļināsimies sīkumos. Es to pieredzēju vakar tikšanās laikā ar profesionālās koledžas skolotājiem Hesenē. Klasificējot kvalifikācijas, piemēram, Vācijas amatmeistara vai amatnieka sertifikāts atbilst vismaz trešajam vai ceturtajam no astoņiem līmeņiem. Citiem vispār nav zināma šī kvalifikācijas sistēma. Cilvēki nesaskata Vācijas dubultās sistēmas priekšrocības, ja vien viņi paši tās nav izjutuši dzīvē.
Mūsu Eiropas mācīšanas un mācīšanās seminārā, kura pamatā ir subsidiaritātes princips, nodarbinātības un profesionālās apmācības politikas dimensijas tiks būtiski stiprinātas izglītībā un apmācībā. Kopā mums jāsasniedz un mēs sasniegsim augstu mērķi līdz 2010. gadam iekļaut sertifikātos un diplomos kvalitātes standartu - EKS.
Françoise Castex
PSE grupas vārdā. - (FR) Priekšsēdētāja kungs, pirmkārt es vēlos pateikties referentam un apsveikt viņu ar lieliskajām apspriedēm par šo ieteikumu attiecībā uz Eiropas kvalifikāciju ietvarstruktūru (EQF) mūžizglītībai. Es arī vēlo pateikties Komisijai un Padomei par uzklausīšanu un pieejamību.
EQF mums ir instruments, kas nodrošina Eiropas pilsoņu mobilitāti, vai nu piedaloties apmācības vai profecionālajā mobilitātē. Personu brīvu pārvietošanos, kas ir paredzēta līgumos, joprojām kavē sarežģījumi, ar ko saskaras pilsoņi, lai panāktu savās izcelsmēs valstīs iegūto kvalifikāciju atzīšanu citu ES. Šīs kvalifikācijas, ko katra dalībvalsts piešķir saskaņā ar savas pašas procedūrām un sistēmām, ietilpst katras dalībvalsts suverenitātē un EQF to ņem vērā.
Tomēr kvalifikācijas aizvien biežāk nepieciešams izmantot ārpus valsts, kurā tās tika piešķirtas, ko mēs vēlamies atbalstīt, cienot vērtību, kuru diploms vai cita kvalifikācija piešķir tās īpašniekam. Tādēļ mums nepieciešams instruments, ar kuru salīdzināt un jo īpaši "konvertēt” kvalifikācijas no vienas dalībvalsts uz citu. Tas ir jo īpaši nepieciešams un jutīgs jautājums attiecībā uz profesionālām kvalifikācijām. Tādēļ Nodarbinātības un sociālo lietu komiteja bija ļoti ieinteresēta ietver RQF profesionālās kvalifikācijas. Tas ir noticis, un mēs esam gandarīti.
Darba ņēmēji un uzņēmumi Eiropas darba tirgū kļūs aizvien mobilāki. Tomēr tādēļ darba ņēmējiem un devējiem ir nepieciešamas garantijas visās dalībvalstīs attiecībā uz aspektiem, kas liecina par darbinieka kompetenci un vērtību, proti, profesionālo kvalifikāciju, neatkarīgi no tā, kā tā tika iegūta.
Komisāra kungs, es tomēr vēlos uzsvērt vēl vienu punktu. Pašlaik EQF ir skaista, bet tukša čaula Lai tā pienācīgi strādātu, katrā valstī izdotajiem diplomiem, kvalifikācijām un sertifikātiem jābūt kalibrētiem un reģistrētiem saskaņā ar EQF ietvertām atsaucēm. Tas ir saistīts ar apjomīgu darbu, un būs nepieciešama liela enerģija un speciālistu zināšanas. Svarīgs būs EK, kā arī Eiropas aģentūru atbalsts - es runāju jo īpaši par Cedefop. Tāpat nozīmīga būs sociālo partneru dalība visos līmeņos. Viņiem jāiesaistās, kā sacīts ieteikumā, caur dalībvalstīm un nozaru dialoga komitejām Kopienas līmenī.
Visbeidzot, lai EQF būtu pilnvērtīga un efektīva, būs nepieciešams, lai ekonomikas partneri, piemēram, profesionālas filiāles, to saprot un pielāgo savam vajadzībām. Tas ir nepieciešams ne tikai tādēļ, ka viņi piešķir kvalifikācijas, kuras jāiekļauj EQF, bet arī tādēļ uzņēmumiem nepieciešami kritēriji, pēc kuriem klasificēt savas darba vietas, kā arī darbā pieņemšanas nolūkiem. EQF ir ātri jākļūst par viņu kopējo atsauces ietvarstruktūru, un es ļoti vēlos redzēt piemērotu termiņu, kurā EQF kļūs par ietvarstruktūru visur, pat koplīgumos.
Ona Juknevičienė
Pirmām kārtām vēlos uzslavēt Mantovani kungu par šī ļoti svarīgā dokumenta sagatavošanu.
Šī dokumenta galvenais mērķis ir rast veidu, kā noteikt un salīdzināt dažādas kvalifikācijas darba tirgū un izglītības sistēmā.
Neapšaubāmi Eiropas kvalifikāciju ietvarstruktūrai (EQF) būs pozitīva ietekme uz ES darba tirgus efektivitāti un elastīgumu. Vēl svarīgāk - EQF palīdzētu samazināt diskrimināciju darba vietā gan pret imigrantiem, gan pret ES pilsoņiem.
Diemžēl Lietuvas un citu ES valstu pilsoņi joprojām saskaras ar sarežģījumiem, kad vēlas izmantot savas kvalifikācijas citās dalībvalstīs. Ļoti bieži viņu kvalifikācijas neatzīst darba devēji vai iestādes.
Cilvēki jūtas diskriminēti, jo viņiem nav vienlīdzīgu iespēju, lai konkurētu darba tirgū. Viņi nereti pieņem zemāk apmaksātus darbus, lai gan viņiem ir augstākas kvalifikācijas nekā tās, kas nepieciešams šo darbu veikšanai. Tiekoties ar Lietuvas valstspiederīgajiem, kuri dzīvo un strādā Londonā, mani informēja par vairākām sūdzībām saistībā ar diskrimināciju darba vietā un grūtībām iegūt darbu, kuram šie cilvēki ir atbilstīgi kvalificēti.
Tas viņiem liek justies kā "zemākas klases” pilsoņiem, lai gan viņu kvalifikācijas nereti ir augstākas par citu valstu to pilsoņu kvalifikācijām, kuri veic to pašu darbu. Viņi nevar iegūt darbu, ko vēlas, vai atbilstīgu atalgojumu, jo viņu kvalifikācijas vienkārši nav atzītas.
Šis dokuments ir ļoti svarīgs. Diemžēl ne Komisija, ne mēs EP deputāti neesam spējuši atrisināt šo problēmu 22 gadu laikā.
1985. gadā Padome izlēma ieviest sistēmu, lai saskaņotu dažādu valstu profesionālās kvalifikācijas. Tai nav bijuši nekādi panākumi. Diemžēl jau atkal mēs nesteidzamies un ierosinām to neieviest pirms 2012. gada. Turklāt tas atstāts dalībvalstu ziņā.
Ir kaunpilni, ka esam tik neefektīvi. Mums būtu jāmācās no mūsu pieredzes.
Zdzisław Zbigniew Podkański
UEN grupas vārdā. - (PL) Priekšsēdētāja kungs, Eiropas kvalifikāciju ietvarstruktūras mūžizglītībai izveidošana ir svarīgs notikums šodienas un rītdienas Eiropai. Tas, vai cilvēka personīgā un sociāla dzīve būs piepildīta, ir atkarīgs no šī cilvēka gatavības dzīvei un darbam. Vēsturiski un mūsdienu noteicošie faktori radījuši nepieciešamību veltīt īpaši uzmanību cilvēkiem 50 gadu vecumā un vecākiem, kā arī jauniem cilvēkiem no ģimenēm, kas saskaras ar ekonomiskām grūtībām, jo īpaši jaunajās dalībvalstīs. Ne visi no viņiem var doties uz ārvalstīm darba meklējumos un ne visiem to vajadzētu darīt. Jārada apstākļi, lai cilvēki attīstītos paši savā vidē, vietā, kur viņi dzīvo. Valstu kvalifikāciju ietvarstruktūrām būtu jābūt instrumentam, ar ko klasificēt kvalifikācijas saskaņā ar kritērijiem, kuri noteikti konkrētiem, sasniedzamiem mācību līmeņiem. ES būtu gan juridiski, gan ekonomiski jāatbalsta dalībvalstu centieni. ES būtu pilsoņiem jāpiedāvā ne tikai iespējas brīvi pārvietoties, bet arī viņu profesionālo kvalifikāciju atzīšana.
Sepp Kusstatscher
Verts/ALE grupas vārdā. - (DE) Priekšsēdētāja kungs, pirmām kārtām liels paldies Mario Mantovani, kurš šajā jautājumā sekoja savam blakus sēdētājam.
Mūsu priekšā ir rezultāts, kas liks izglītības iestādēm dalībvalstīs izmantot kopēju ietvarstruktūru kā "konvertēšanas” ierīci un kā atsauces punktu. Ir lielas iespējas piemērot vēl lielāku spiedienu, lai panāktu lielāku pārredzamību, labāku salīdzināmību un tādējādi arī vienlīdzību un to, ka ES atzīst dažādas kvalifikācijas.
Es jo īpaši atzinīgi vērtēju, ka kopā ar vispārējo izglītību ir minēta profesionālā apmācība un ka tai piešķirts līdzvērtīgs statuss, kā arī ka ne tikai oficiālus diplomus novērtēs, izmantojot standartu, bet arī neoficiālas prasmes, ko cilvēki ieguvuši darba vieta vai mājās.
Nereti izmanto viltības, lai apgrūtinātu piekļuvi darba tirgum. Nereti izglītības iestādes, profesionālās padomes un asociācijas mēģina pretoties konkurencei no ārpuses, nevēloties atzīt terciārās un profesionālās izglītības kvalifikācijas, kas iegūtas citā valstī, to formas dēļ. 2010. gadā tā kļūs par pagātni.
Derek Roland Clark
IND/DEM grupas vārdā. - Priekšsēdētāja kungs, "mūžizglītības sekmēšana” izklausās labi, ES darbojoties atklāti cilvēku un nodarbinātības labā.
Tikai šorīt Barroso kungs sacīja, ka ir pret izņēmuma gadījumiem, bet atbalsta kompromisus, lai ņemtu vērā dažādību. Tie ir labi vārdi, bet nu mēs jau atkal mēģinām pārveidot brīnišķīgo dažādību par kopēju, saskaņotu, neoriģinālu ainavu.
Tagad ir izglītības kārta. Tomēr izglītība nav ES kompetencē. Tā ir ietverta tikai priekšlikumos saskaņā ar EK līguma 149. un 150. pantu. Tātad šis ir mēģinājums slepus iejaukties kompetences jomā. Ja ES vēlas iekļaut izglītību savā kompetences jomā, darīsim to godīgi, izmantojot parastos kanālus un pārredzamību, par kuru tik daudz dzirdam.
Saskaņā ar Bergen ietvarstruktūras modeli, lai izveidotu EUROPASS diplomu un sertifikātu pielikumus ar Eiropas kredītpunktu pārnešanas sistēmu, būs nepieciešams saskaņots EQF līmenis. Izdodot kvalifikācijas nozaru un reģionālā līmenī, kā arī valsts līmenī, šis ES priekšlikums nodrošinās gandrīz pilnīgu varu pār kvalifikācijām. Izdodot novērtējumu un piešķirot kvalifikācijas, tas nodrošinās, ka ES apiet universitātes un valstu valdības.
AK valdība atbalsta kvalifikāciju saskaņošanu. Tā tam sagatavojas, nododot universitāšu kontroli Slepenās padomes rokās, kas ir gatava tās nodot ES rīcībā. Tas, ko par to domā universitātes, šķiet nesvarīgi.
HMG nostāju parāda tās vienīgais iebildums pret šo shēmu. Tā nevēlas ES logo uz kvalifikācijas dokumentiem. Tas tā ir tādēļ, ka tā nevēlas, lai cilvēki zinātu, ka izglītība ir nodota ES rokās.
Lūdzu, pasakiet man, kādēļ manai valdībai ir tāda nostāja? Kādēļ tā atbalsta ES projektu, bet nevēlas, lai cilvēki par to uzzina? Vai citu valstu valdības rīkojas tāpat? Es nebūtu pārsteigts, ja jā, jo arī šīs valdības vēlas noslēpt no saviem cilvēkiem, ka viņu universitātes šādi izmanto.
Jūs varat domāt, ka man nepatīk šis projekts, taču tas nav nacionālā lepnuma par Lielbritānijas universitātēm dēļ. Nē. Tas ir tādēļ, ka kā skolotājs es augsti vērtēju izglītību un atzīstu, ka Eiropā ir universitātes, ar ko mēs pamatoti lepojamies - lieliski mācību centri, kuru absolventi gadsimtiem ilgi ir veicinājuši mākslas, literatūras un zinātnes attīstību, bagātinot cilvēku dzīves pasaulē.
Es arī atzīstu, ka šīs civilizācijas attīstības stimuls radās, jo šie mācību centri attīstījās atsevišķi un neatkarīgi, katram attīstot savas iezīmes un identitāti.
Vai nav dīvaini, ka laikmetā, kad cilvēka identitāte tiek greizsirdīgi sargāta un identitātes zādzību uzskata par kriminālnoziegumu, kas tas arī ir, daži cilvēki, nedomājot un liedzot citiem šajos izglītības centros iegūto izglītību, mēģina sagraut iestāžu unikālo identitāti, kura ļāva tām izveidoties tādām, kādas tās ir.
Marie Panayotopoulos-Cassiotou
(EL) Priekšsēdētāja kungs, mēs nevarētu šodien šajās debatēs iekļaut ieteikumu par Eiropas kvalifikāciju ietvarstruktūru (EQF), ja mūsu kolēģis deputāts Mantovani kungs nebūtu tik labi izmantojis to deputātu pieredzi, kas iepriekš strādāja ar šo jautājumu, vai nebūtu tik labi sadarbojies ar Komisiju un Padomi. Tā nu mēs šodien varam runāt par astoņu kvalifikāciju līmeņu noteikšanu, kuros ietverta vispārējā izglītība, pieaugušo izglītība un apmācība, kā arī trīs terciārās izglītības kvalifikācijas līmeņi.
Atbildot manam kolēģim, kurš uzstājās pirms manis, Mēs uzsveram, ka EK līguma 149. un 150. pants ir pareizais juridiskais pamats ierosinātajam ieteikumam, jo tas pieļauj mūžizglītību. Nekādā ziņā mēs nepieņemam, ka izglītība būs ES atbildības jomā. Tā paliek valstu atbildības jomā. Kvalifikācijas salīdzināšanā saistībā ar EQF neņem vērā mācību metodes un izglītības iestāžu veidus. Rezultātā salīdzinājums atticas tikai uz zināšanā, spēju saprast, zināšanu un prasmju praktisko izmantošanu.
Grieķija un daudzas citas valstis ir jo īpaši ieinteresētas EQF neobligātajā piemērošanā. Oficiāli ir pausts viedoklis, ka kvalifikāciju līgas tabulu veicināšanai nav nekā kopīga ar valstu izglītības sistēmu veidošanu vai mācību sertifikācijas atzīšanu. Turklāt attiecībā uz neoficiālo un neformālo izglītību tās dažādības un īpašo iegūšanas apstākļu dēļ automātiska sertifikācija nav iespējama, bet ir tikai atsauces punkts.
Mums arī jāpatur prātā, ka vienai un tai pašai personai var būt vairākas kvalifikācijas dažādos līmeņos.
Joel Hasse Ferreira
(PT) Priekšsēdētāja kungs, komisār, dāmas un kungi, Eiropas kvalifikāciju ietvarstruktūra mūžizglītībai ir izšķirošs dokuments, kas ļaus salīdzināt valstu un nozaru kvalifikāciju atsauces ietvarstruktūras Eiropas līmenī.
Iegūto kvalifikāciju sertifikācija ir būtiska, lai nodrošinātu ārpus oficiālās izglītības panāktais progress, jo īpaši profesionālajā dzīvē, tiek integrēts attīstībā, kas gūta oficiālajā sistēmā. Tādējādi tas sekmē demokratizāciju ES attiecībā uz personas profesionālo karjeru pārvaldību.
Šī direktīva, kā turklāt uzsver viens no EP ierosinātajiem un apstiprinātajiem grozījumiem, sekmē šo kvalifikāciju pārbaudi saskaņā ar Padomes secinājumiem par kopīgiem Eiropas principiem neformālās un neoficiālās izglītības noteikšanai un pārbaudei
Priekšsēdētāja kungs, tas mums ļaus virzīties uz vienotu Eiropas ietvarstruktūru, kuras mērķis ir būt saskaņotam, nemazinot garantijas, kas dažos gadījumos jau pastāv. Dāmas un kungi, priekšlikums direktīvai, ko apspriežam, būs izšķirošs instruments lielākai elastībai darba tirgos, kas piedāvā labāku darba ņēmēju interešu aizsardzību un lielāku iespēju nodrošināt kvalitatīvus pakalpojumus. Šobrīd varu tikai apsveikt Portugāles prezidentūras centienus izglītības jomā, lai noteikti un samērā ātri virzītos uz Parlamenta apstiprinājumu pirmajā lasījumā. Nenoliedzami šajā saistībā arī jāuzsver Mantovani referenta Mantovani kunga un ēnu referentu, jo īpaši Castex kunga padarītais darbs.
Lai panāktu lielāku efektivitāti, lai nodrošinātu lielākus ieguvumus un akadēmisko mobilitāti Eiropā, mums jāstrādā vēl efektīvāk, īstenojot EQF un savienojot to ar Eiropas kredītpunktu sistēmu, un šis ziņojums ir panākums šajā virzienā. Tādējādi direktīvas priekšlikums sekmē iespēju vienlīdzību zināšanu sabiedrībā, kurā dzīvojam, nolūkā labāk integrēt dažādu dalībvalstu darba tirgus, ņemot vērā dažādo valstu sistēmu lielās atšķirības. Tādēļ EQF ir pelnījusi mūsu atbalstu.
Ewa Tomaszewska
(PL) Priekšsēdētāja kungs, dažādos apstākļos, sistēmās un valstīs iegūtu kvalifikāciju pārredzamība un salīdzināmība atvieglo gan darba ņēmēju, gan darba devēju zināšanu līmeņa novērtējumu, tādējādi palielinot mobilitāti darba tirgū. Tas attiecas gan uz reglamentētām profesijām - ārstiem, medmāsām un citām profesijām medicīnā, kur kvalifikācijas ir savstarpēji atzītas ES valstīs - gan citām profesijām. Kvalifikāciju ietvarstruktūras ieviešana nodrošinās lielāko sociālo kohēziju.
Tomēr citādāka metode ir jāpiemēro mākslas izglītības iestādēm un profesijām, kur talantu un apdāvinātību nevajadzētu ierobežot ar disciplīnām un kur nevajadzētu aprēķināt vidējo rādītāju, kā arī kur skolotājs netiek konkretizēts, bet turpina būt meistars.
Apsveicu referentu.
Peter Mandelson
Komisijas loceklis. - Priekšsēdētāja kungs, domāju, ka šīs ir bijušas ļoti labas debates, kas atzīmē ļoti svarīga tāda projekta sākumu, kurš, manuprāt, ir sācies laikā, ir nepieciešams un, kā norādīja citi runātāji, ir platforma šīm un nākamajām paaudzēm.
Tā ir būtiska, lai darbotos vienotais tirgus, būtiska, lai notiktu Eiropas sociālā attīstība, būtiska, lai Eiropas pilsoņu spētu izdzīvot strauji mainīgajā ekonomikā un mainīgajā darba tirgū. Tā ir pase uz personiskajiem panākumiem, kā arī uz sabiedrības integrāciju. Tas bija ļoti konstruktīvas un saskaņotas debates, izņemot viena deputāta runu, kurš ļāva, lai viņa pārmērīgais pārspīlējums kopā ar ideoloģiskiem aizspriedumiem pilnībā sagroza to, kas tiek paredzēts un ierosināts.
Šis ir ieteikums, un tieši tāds tas ir - brīvprātīgs. EQF nepiešķirs kvalifikācijas. Tas paliek valstu, universitāšu un citu iestāžu ziņā, kuras saglabā savu autonomiju. Ieviesīs EQF atsauces kritēriju kvalifikācijām, piemēram, attiecībā uz 4. kritēriju, bet pastāvēs arī kvalifikāciju valstu kritērijs.
Tādēļ esmu priecīgs sveikt šo konsensu, izņemot vienu deputātu, šajā Parlamentā un Padomē saistībā ar EQF leģislatīvo priekšlikumu, lai tas tiktu atspoguļotu valstu līmenī, kur redzam nopietnu virzītājspēku izveidot valstu kvalifikāciju ietvarstruktūru.
Priekšsēdētājs
Debates ir slēgtas.
Debašu beigās vēlos pirmām kārtām pateikties tulkiem, kas izlēma palikt, lai gan tas nebija vajadzīgs.
Balsojums notiks trešdien plkst. 12.00.
Rakstiskas deklarācijas (Reglamenta 142. pants)
Monica Maria Iacob-Ridzi
Eiropas atsauces ietvarstruktūra samazinās sistēmas sarežģītību ar 27 abpusējām attiecībām, lai tiktu atzītas kvalifikācijas, kas iegūtas par akadēmisko un profesionālo izglītību. Boloņas process, kas paredz līdz 2010. gadam izveidot Eiropas Izglītības telpu, ir papildināts ar visās dalībvalstīs iegūstamo kvalifikāciju atzīšanas instrumentu.
Lai gan 9 no 10 ES pilsoņiem uzskata mūžizglītību par svarīgu karjeras attīstības elementu, finansiālo resursu trūkums noved pie liela pašreizējai ekonomikai nepieciešamās apmācības trūkuma. Eirobarometra pētījumi rāda, ka tikai 58 % aptaujāto spēj lietot datoru, un tikai puse no viņiem ir interneta lietotāji. Turklāt vairāk nekā 60 % pilsoņu nespēj darbā izmantot svešvalodu. Valstu budžeti, kas paredzēti mūžizglītībai, ir robežās no 40 % no kopējās summas, kura izmantota izglītībai, Ziemeļvalstīs, līdz mazāk par 10 % jaunajās dalībvalstīs.
Tādējādi tādas iniciatīvas kā Grundtvig vai Erasmus jauniem uzņēmējiem būtu jāpaplašina un tām jāpiešķir divreiz lielāki līdzekļi, lai papildinātu nepietiekamo valsts finansējumu. Turklāt Eiropas atsauces ietvarstruktūra būtu jāpapildina ar programmām, kuras izveidotu pārbaudāmas Eiropas kvalifikācijas, ko atzīst visā ES teritorijā.
Rumiana Jeleva
Ir nepieciešams norādīt, ka neformālās izglītības nozare ir nepietiekami attīstīta, samērā nezināma un nereti nošķirta no formālas izglītības. Eiropas kvalifikāciju ietvarstruktūra it galvenais instruments, lai pārvarētu nesakritības, kā arī instruments, lai atkārtoti novērtētu un reorganizētu profesionālās orientācijas un informācijas sistēmu.
EQF ieviešana sekmēs darbaspēka mobilitāti 31 iesaistītajā valstī un veicinās jauno ES dalībvalstu nozaru un rūpniecības organizāciju iesaistīšanos Eiropas Sociālā fonda resursu izmantošanā, ko piešķir jaunu kvalifikāciju iegūšanai vai esošo kvalifikāciju celšanai. Visnesenāk pievienojušās ES dalībvalstis, piemēram, Bulgārija, uzskata, ka ir svarīgi gūt iespēju apmainīties ar labām praksēm un īstenot Kopienas izmēģinājuma programmas.
Eiropas kredītpunktu sistēmas profesionālajai izglītībai un apmācībai (ECVET) izstrāde un īstenošana ar mērķi sekmēt izglītības rezultātu uzkrāšanu, nodošanu un atzīšanu, neatkarīgi no tā, kur un kā šie rezultāti iegūti, ir ļoti svarīga, ņemot vērā pārejas periodus, kas piemērotu Bulgārijai un Rumānijai. Kredītpunktu sistēma sekmēs brīvu pārvietošanos un piekļuves paplašināšanu darba tirgum lielākajai daļai cilvēkresursu Kopienā, vienlaikus nodrošinot uzticamu salīdzinājumu pamatu.
Es uzskatu, ka EQF būs turpmāk stimuls šī procesa attīstībai.
Katalin Lévai
Pilsoņu zināšanu, prasmju un kompetences atzīšana ir obligāta ES konkurētspējai un sociālajai kohēzijai, kā arī pilsoņu mobilitātei. Jāsekmē un jāuzlabo dalība mūžizglītībā un piekļuve mūžizglītībai visiem, arī nelabvēlīgās situācijās esošajiem, gan valstu, gan Kopienas līmenī. Jauni cilvēki, pieaugušie, imigranti un roku darba strādnieki Eiropā, kam ir neformāli iegūtas prasmes, kuras nekad nav bijušas atzītas, ir jāmudina piedalīties mūžizglītības programmās, tādejādi izvairoties no šo grupu sociālās un darba tirgus nošķirtības.
Lai to visu paveikti, liela nozīme var būt kopējai atsauces ietvarstruktūrai, kas ir kā "tulkošanas ierīce” starp dažādām kvalifikāciju sistēmām un to līmeņiem, neatkarīgi no tā, vai tā ir vispārējā vai augstākā izglītība, vai profesionālā izglītība un apmācība. Tas palielinās pilsoņu kvalifikāciju pārredzamību, salīdzināmību un mobilitāti dažādās dalībvalstīs.
Atsauces ietvarstruktūras uzdevums ir integrēt un koordinēt valstu kvalifikāciju sistēmas, lai nodrošinātu nediskrimināciju, lai palielinātu kvalifikāciju pieejamību un attīstību saistībā ar pilsonisko sabiedrību un darba tirgu.
Segregācijas apturēšanas nolūkos, kura pastāv izglītībā, es atbalstu tādu pasākumu ieviešanu, lai nodrošinātu informāciju un iesaistītos sociālajā dialogā.
Es arī domāju, ka ir svarīgi atzīt neformālo izglītību, ko ieguvuši strādnieki, lai viņi varētu vieglāk nomainīt darbu.
ES ir jākļūst par sabiedrību, kas balstīta uz zināšanām un ir labi sagatavota, lai risinātu globalizācijas radītās problēmas. Šādā sabiedrībā katras dalībvalsts pilsoņiem jāpielāgojas, lai atbilstu konkurētspējas vadītiem darba tirgiem. Tādēļ izglītība būs pamat nosacījums visu vecuma grupām.
James Nicholson
rakstiski. - Eiropas kvalifikāciju ietvarstruktūru (EQF) mūžizglītībai ir labs piemērs, ka ES dara to, kas tai būtu jādara saistībā ar mobilitātes sekmēšanu pāri valstu robežām. Gadu gaitā lielākā daļa no mums būs pārstāvējuši mūsu pašu dalībvalstu valstspiederīgos, kas tad, kad viņi izmanto sev pieejamo pārvietošanās brīvību ES un patiesi pārvietojas uz citu valsti, saskaras ar diskrimināciju, jo jaunajā mītnes valstī netiek atzītas viņu kvalifikācijas. EQF kā "tulkošanas ierīce” valstu iestādēm neapšaubāmi palīdzēs mūsu vēlētājiem pārvarēt šo bezjēdzīgo diskrimināciju. EQF būtu arī jānodrošina ieguvumi jebkurai dalībvalstij, kurā persona pārvietojas, jo tā nodrošinās, ka ver tikt precīzi novērtētas šīs personas kvalifikācijas.
|
Celebrating 100 years of making voices heard
In 2018, the English-Speaking Union (ESU) celebrates 100 years of promoting better communication between people of all cultures and countries. They wanted to build a campaign website to celebrate this achievement, engage their audiences, and communicate both their illustrious history and the ambitious future of this world-renowned organisation.
The ESU, founded in 1918, is an educational charity and membership organisation which believes in the power of spoken communication. It has spent the last 100 years changing lives through promoting oracy skills, and global and cultural understanding. With a wealth of personal stories which illustrate the ESU’s impact – from alumni and supporters such as Sir Trevor McDonald and KT Tunstall, as well as a distinguished history including the likes of Sir Winston Churchill and TS Eliot – and archive imagery to bring those stories to life, they wanted to bring all this content together in a celebratory site which would link their rich history with their future focus: equipping young people with the oracy skills and confidence to engage with the world, discuss their ideas and share them with others.
What we did
We kicked off with an in-depth discovery workshop with the team at ESU, to dig into the audiences we wanted to reach with the site, and their needs, determine what the parameters of success were for the project, and work out how to generate maximum value for the organisation.
Out of this workshop came a reimagined brief that aligned the goals for the website with organisational objectives. Alongside a vision board which would help translate needs and features into logical user journeys leading to clear calls to action, and a description of the site’s main content types, we emerged with the following goal:
“Create an innovative and immersive campaign hub that informs, updates and inspires interaction with the ESU to celebrate a landmark 100th anniversary.”
Introducing Agile
This would be the first time that the ESU team used Agile methods to manage a digital project. We helped guide them along the path to working confidently and efficiently with these techniques, beginning with one of our regular Intro to Agile events, to improve their overall approach to digital delivery.
Brave new design and direction
We established a brave new design direction for the website, featuring full-width imagery, bold use of colour and strong typography. Working with the ESU team to define a content direction, we then iterated over the designs of page templates to create an immersive storytelling experience across the site.
Seamless journeys, user-friendly technology
Through our discovery work with the ESU team, we knew that the website had to deliver a fast, seamless experience for the user as they navigated between different sections of the site. We achieved this through use of an animated, colour-coded hero banner which would seamlessly direct users to the relevant section of the site. We also knew that the experience for ESU editors had to be user-friendly, which is why we opted to use WordPress as a content management system, with a customised page-builder to facilitate the flexible use of images, text and video for telling stories.
How it went
The 100 ESU website launched on January 8th 2018, just three months after the project began. The site’s bold visual direction has since been rolled out to the wider campaign.
Communicating the ESU’s mission through reference to its long history and hopes for the future, the centenary site illustrates the impact the organisation makes through powerful personal stories told by people whose lives have been changed by ESU activity. And it’s helped spearhead a campaign to empower young people to speak out about issues affecting their lives. See the results at #ESUSpeakOut
“We’re delighted with the impact that the website is having so far. It is enabling us to extend our reach further than ever before and to share both our relevance today and the importance of developing and harnessing oracy skills in young people to improve social mobility.
For the first time, we are able to share our compelling alumni stories on a modern, eye-catching platform which reflects the direction we are moving in, as a forward-thinking charity and membership organisation.” – Sarah Matthews, Digital Marketing Manager, English-Speaking Union
As well as achieving its primary objectives, the project has been a catalyst for driving change across the whole organisation. The thinking behind the new website has opened up new opportunities for the ESU as we begin to explore how it can get the most value from its audiences by developing further digitally. We’re excited about subsequent projects that will build on this thinking, and help the charity thrive for the next 100 years and beyond.
How this helps us on your project
We’re adept at digging into the reasons and thinking behind a brief, helping you to challenge your previous assumptions and ensure that the goals of the project are aligned with those of the organisation. Wherever you are on your digital journey, we can help you build the teams, tools and creative assets you need to engage and inspire your audiences. |
154 B.R. 359 (1992)
In re Dr. Jerome F. JACOBS, Debtor.
No. 90-15230-BKC-SMW.
United States Bankruptcy Court, S.D. Florida.
September 29, 1992.
*360 Michael Goldberg, Miami, FL, for debtor.
Norman S. Pallot, South Miami, FL, for creditors.
Jules Bagdan, Trustee, South Miami, FL.
ORDER ON DEBTOR'S MOTION TO AVOID JUDICIAL LIENS PURSUANT TO § 522(f)
SIDNEY M. WEAVER, Bankruptcy Judge.
THIS CAUSE came before the Court on August 13, 1992 upon the debtor's Motion to Avoid Judicial Liens Pursuant to 11 U.S.C. § 522(f), and the Court, having reviewed the record, motion and memorandums of law, having heard the arguments of counsel, and being otherwise fully advised in the premises, hereby makes the following findings of fact and conclusions of law:
On July 31, 1990, Dr. Jerome F. Jacobs, (the "debtor"), filed for relief under Chapter 7 of the Bankruptcy Code and received a discharge on November 7, 1990. On Schedule B-4 of his bankruptcy schedules, the debtor listed a house he purchased in November of 1982 as his homestead exemption, which was legally described as:
Lot 13 in Block 1 of BEACH VIEW SUBDIVISION, according to the Plat thereof, as recorded in Plat Book 9, Page 158 of the Public Records of Dade County, Florida.
Prior to the bankruptcy filing, 15 creditors obtained and recorded judgments against the debtor. City Stores Inc., Commercial Credit Corp., and Chrysler First Financial Services Corp. (the "objecting creditors") were among such creditors and presently oppose the debtor's motion to avoid all liens on his claimed exemption. They obtained and properly recorded their judgments in Dade County respectively on June 5, 1974 in the amount of $1,232.52, on March 4, 1975 in the amount of $3,347.66 and on December 5, 1989 in the amount of $4,686.56.
Section 522(f)(1) of the Bankruptcy Code allows a debtor to avoid the fixing of a judicial lien on his interest in property to the extent that the judicial lien impairs an exemption to which the debtor would have been entitled to under § 522(b). In re Bradlow, 119 B.R. 330, 331 (Bankr.S.D.Fla. 1990); In re Goodwin, 82 B.R. 616, 617 (Bankr.S.D.Fla.1988); In re Hall, 752 F.2d 582, 584 (11th Cir.1985). In Florida, qualified residents are entitled to a homestead exemption by virtue of the Florida Constitution, Article X, Section 4 and via § 522(b), which authorizes states to opt out of the federal exemptions for state created-exemptions.
The debtor claims that subsequent to his listing the aforementioned house, located at 5223 Pinetree Drive, Miami Beach, Florida, as his homestead exemption, neither the trustee nor any creditors objected. Indeed, a review of the docket sheet reveals that no objections were filed. Where no party in interest objects timely to a claim of homestead, the exemption is deemed allowed. See Bankruptcy Rule § 4003(b); Davis v. Bright, 23 B.R. 347, 348 (Bankr.S.D.Fla.1982). Thus, in light of the debtor having otherwise satisfied the homestead requirements and given that no creditor or interested party had objected timely to the claimed exemption, the Court finds that the real property described above is the debtor's homestead under Article X, Section 4 of the Florida Constitution.
This Court, as well as other Florida courts, has previously held that a homestead exemption is impaired by the mere existence of judgment liens on the homestead. Davis v. Bright, 23 B.R. at 347; In re Bradlow, 119 B.R. at 331; In re Bird, No. 88-8184-CIV-ARONOVITZ, slip op., at 9 (S.D.Fla. May 5, 1989), reversing 84 B.R. 858 (Bankr.S.D.Fla.1988); In re Calandriello, 107 B.R. 374 (Bankr.M.D.Fla.1989); In re Hutchinson, 92 B.R. 950 (Bankr. M.D.Fla.1988). More specifically, the Calandriello court elaborated as to the effect of liens on a homestead:
[P]ractical problems are presented when a certified copy of a judgment against a homeowner is recorded in the official records of the county in which the homeowner's homestead is located. Title companies generally treat such *361 judgments as a cloud on title to the homestead unless [they are] avoided in bankruptcy, satisfied or otherwise removed. When the homeowner later becomes a debtor in bankruptcy, the limitations on the debtor's actions that result denies the debtor the full enjoyment that the Florida Constitution provides. [T]he Bankruptcy Code contains a specific provision designed to prevent the debtors . . . from experiencing problems of this sort.
In re Calandriello, 107 B.R. at 375.
In line with the Calandriello court's reasoning, the debtor's constitutional homestead exemption is likewise impaired here, in that the debtor's lender and the lender's title insurance company have conditioned the debtor's attainment of a second mortgage for his homestead upon an order issued by this Court, avoiding all judgment liens on the house.
Notwithstanding the argument that the mere existence of judgment liens impair the debtor's homestead, the objecting creditors contend that the debtor's motion to avoid liens is untimely since it was made long after the debtor received a discharge. Although § 522(f) is silent in regards to whether the debtor must move for the avoidance of liens within a given time period, the majority of jurisdictions have considered the issue and held that lien avoidance is permissible subsequent to discharge if there has been no injury or prejudice to creditors. Yazzie v. Postal Finance Co., 24 B.R. 576, 577-578 (9th Cir.1982); In re Jent, 37 B.R. 561, 563 (Bankr.W.D.Kentucky 1984); In re Chesnut, 50 B.R. 309, 310 (Bankr.W.D.Oklahoma 1985) (holding that creditors can argue lien avoidance is untimely based on equitable grounds such as prejudice, laches, reliance, estoppel or fraud); In re Skakalski, 67 B.R. 448, 450-451 (Bankr.W.D.Pa.1986) (ruling that the debtor need not file a motion to avoid liens within any particular time where creditors are not prejudiced by the delay). The minority position, on the other hand, establishes the discharge date as an absolute deadline. In re Jent, 37 B.R. at 563.
In light of the fact that neither the Bankruptcy Code or Rules provide any particular time constraints for raising lien avoidance, the majority of jurisdictions hold that there is no time limit absent prejudice or fraud to creditors and given that the creditors in the instant case have not shown or even posited that the debtor's motion for lien avoidance is fraudulent or has a prejudicial impact on their interests, the Court finds that the creditors are not prejudiced by the debtor's motion for lien avoidance.
The objecting creditors further contend that the instant case has been closed and that, therefore, the debtor can no longer move to avoid their liens. In fact, the majority of bankruptcy courts have held, to the contrary, that a debtor has a right to reopen his case in order to avoid liens if the creditors' rights are not injured as a result. See In re Quackenbos, 71 B.R. 693, 695 (Bankr.E.D.Pa.1987); In re Ricks, 62 B.R. 681, 683 (Bankr.S.D.Cal.1986) (holding that, in the absence of prejudicial delay, the bankruptcy court must reopen a closed case to permit the debtor to file a lien avoidance action). In the instant case, however, the Court need not analyze the matter, for a review of the court file and the docket sheet indicate that the instant case has never been closed.
The objecting creditors finally assert that the avoidance of their liens via § 522 would constitute a taking of their property since their liens arose prior to the enactment of the 1978 Bankruptcy Code and, thus, § 522(f) should not apply retroactively to avoid their liens. The objecting creditors' argument ignores the fact that a recorded judgment only becomes a lien upon the debtor acquiring an interest in property. In re Owen, 961 F.2d 170, 172 (11th Cir.1992). Thus, the creditors' earlier recorded judgments only became judgment liens upon the debtor's purchase of the house in November of 1982, which was four years after the effective date of the 1978 Bankruptcy Code and, thus, the creditors' judgment liens can be properly avoided under § 522(f).
For the foregoing reasons, it is hereby:
*362 ORDERED AND ADJUDGED that the debtor's Motion to Avoid Judicial Liens Pursuant to § 522(f) is hereby granted and, thus, all judgment liens on the debtor's homestead are hereby avoided.
DONE AND ORDERED.
|
Peripheral oxytocin restores light touch and nociceptor sensory afferents towards normal after nerve injury.
Oxytocin reduces primary sensory afferent excitability and produces analgesia in part through a peripheral mechanism, yet its actions on physiologically characterized, mechanically sensitive afferents in normal and neuropathic conditions are unknown. We recorded intracellularly from L4 dorsal root ganglion neurons characterized as low-threshold mechanoreceptors (LTMRs) or high-threshold mechanoreceptors (HTMRs) in female rats 1 week after L5 partial spinal nerve injury or sham control (n = 24 rats/group) before, during, and after ganglionic perfusion with oxytocin, 1 nM. Nerve injury desensitized and hyperpolarized LTMRs (membrane potential [Em] was -63 ± 1.8 mV in sham vs -76 ± 1.4 mV in nerve injury; P < 0.001), and sensitized HTMRs without affecting Em. In nerve-injured rats, oxytocin depolarized LTMRs towards normal (Em = -69 ± 1.9 mV) and, in 6 of 21 neurons, resulted in spontaneous action potentials. By contrast, oxytocin hyperpolarized HTMRs (Em = -68 ± 2.7 mV before vs -80 ± 3.2 mV during oxytocin exposure; P < 0.01). These effects were reversed after removal of oxytocin, and oxytocin had minimal effects in neurons from sham surgery animals. Sensory afferent neurons immunopositive for the vasopressin 1a receptor were larger (34 ± 6.3 μm, range 16-57 μm) than immunonegative neurons (26 ± 3.4 μm, range 15-43 μm; P < 0.005). These data replicate findings that neuropathic injury desensitizes LTMRs while sensitizing HTMRs and show rapid and divergent oxytocin effects on these afferent subtypes towards normal, potentially rebalancing input to the central nervous system. Vasopressin 1a receptors are present on medium to large diameter afferent neurons and could represent oxytocin's target. |
Benefits of hiring money lender for business
Money is required for all sorts of business. You do require a considerable sum of money for investment as your business capital. Since the sum required is usually a large one, professional moneylenders step into the picture. They lend money to those interested in getting some amount of money in return for some security. This can even be some amount of property you own. Be sure to get the best deal when you are out to borrow some amount of money. It is best to negotiate a deal before clinching it. It can be a tough and difficult task, but the results you get are really worth it. This is how you can get to save a considerable amount of money you would have to pay as interest to the lender.
You can always get the help of some of your friends and relatives in g getting in touch with the best moneylenders. Those who have had a considerable experience in lending money on earlier instances are sure to help you out. It is always best to compare the rates charged by the lenders before coming to a conclusion. The most important aspect to be considered when you are out for loans is the purpose. This should be specified clearly. You should be clear that you are to spell out a business objective clearly before you step out for borrowing money off a moneylender.
How are you going to return the money?
One of the most important points to consider is that how you are going to return all the money you have borrowed. You should have a good source of income and a way to return the borrowed money. Any moneylender in the world is not going to be prepared to part with his money if you are found to be in a position that spells out uncertainty of returning the borrowed money. Almost all loans given out in the world require the borrower to have a guarantor. This is a person who can vouch for the authentication of borrower. He or she is going to stand for you if you are not able to return the sum of money lent to you. It is going to help if the guarantor is a person who has a good reputation as an honest person with a certain amount of integrity. |
The invention relates to an exhaust system for a stern drive marine propulsion system.
The invention arose during continuing development efforts relating to the exhaust system in Winberg et al U.S. Pat. No. 4,773,215, assigned to the assignee of the present invention, and incorporated herein by reference.
The transom of the boat has two exhaust passages therethrough. The exhaust control assembly has a valve which is automatically controlled to control engine exhaust between different outlets in response to a given parameter. |
Highly efficient continuous-wave operation of a Nd:YAG rod laser that is side pumped by p-polarized diode laser bars.
We report on the performance of highly efficient, high-power continuous-wave (CW) Nd:YAG lasers that are side pumped by p-polarized diode laser beams. In this configuration pump light is directly coupled into the Nd:YAG rod through a threefold symmetric gold-coated flow tube. The polarization direction of our pump diode bars is perpendicular to the rod's axis (p-polarized). In a closed coupled resonator, a maximum output power of 195 W in multimode operation is obtained for a pump power of 423 W, which corresponds to an optical-to-optical efficiency of 46% and an electrical-to-optical efficiency of 23%. This is, to the best of our knowledge, the highest electrical-to-optical efficiency reported for a CW diode side-pumped Nd:YAG laser. By the pump-power leakage analysis method, we measured the pumping efficiency to be approximately 94%. The high efficiency of the system can be attributed to wing pumping, which results in uniform pump-light distribution and better pumping efficiency because of the use of p-polarized pump beams. |
Q:
TYPO3 6.2.1 with Bootstrap 3 - backend templates
I have setup TYPO3 ver. 6.2.1 and then installed Bootstrap 3 from the Extension Manager and then Get preconfigured distributions.
Works fine.
Now I have navigated to the backend templates and have found em, but have do I add new templates for it, is it the old way or can I just mate a file and drag and drop it into the backend folder and where do I tell it that I have added a new one.
Have someone tried to make new templates in the new TYPO3 with Bootstrap.
A:
use the TypoScript Object Browser to have a look at page.10.file.stdWrap.cObject.*.
There you can already see all defined templates. To add a new template, add a new backend layout. The uid of the backend layout will be the key for the new TypoScript key. Just copy one of the existing entries, name it like your uid and give it the path to your template.
|
Company News
AF International Launches A Brand New French Website
AF International, leading global manufacturer of specialist technology cleaning solutions are delighted to announce the launch of their brand new French website. The new platform is packed full of interesting content, useful updates and material available for download. The website incorporates the key product ranges - Core, Whiteboard, Specialist, UtilityAF and a preview to the ‘coming soon’ Anti-bac+ Range.
AF’s website has been designed to allow easy navigation and guide visitors around the site with ease across all four product categories. Enhanced page content, marketing resources, new videos and key product benefits all combine to give users an interactive and informative visit. The cleaning focus has been simplified with the addition of a product selector facility. This clever tool encourages visitors to search the product selector facility for the item that they would like to clean and requires no previous knowledge of AF products or individual codes. The selector allows users to explore their options and make an informed decision on the most suitable product for their requirements with the minimum of clicks.
Paul Hardy European Brand Director commented “The new website has many great new features for visitors and the navigation is so straightforward. The marketing and selling tools on offer are invaluable for our distributors and just a click away. The interactive product selector will prove to be a very popular tool as the ability to search via the product to be cleaned, guides the user to the correct product selection. “ |
Snake venom composition could be related to hormones and diet
Home»Posts»Snake venom composition could be related to hormones and diet
Snake venom composition could be related to hormones and diet
Many people are afraid of snakes, but scientists are now revealing insights about their venoms that could give even ophidiophobes an appreciation for the animals. One team has found that the proteins from the venom gland can vary depending on age and gender. These findings suggest that hormonal and dietary influences are at play |
The Whispers formed in 1964 in Watts, California. The original members included the twin brothers, Scotty (Wallace) and Walter Scott, along with Gordy Harmon, Marcus Hutson and Nicholas Caldwell. In 1973, Harmon was replaced by former Friends of Distinction member Leaveil Degree. Scotty Scott's fluid, melodic voice is featured on virtually all of their hits. The group scored many hits on the R&B and Billboard Hot 100 charts throughout the 1970s and 1980s... |
In a typical automobile air conditioning system, a refrigerant is compressed by a compressor unit driven by the automobile engine. The compressed refrigerant, at high temperature and pressure, enters a condenser where heat is removed from the compressed refrigerant. The refrigerant then travels through a receiver dryer to an expansion valve. The expansion valve causes the pressure of the refrigerant to drop as it flows through the valve, which causes the refrigerant to change phase from liquid to gas form as it enters the evaporator. In the evaporator, heat is drawn from the environment to replace the latent heat of vaporization, thus cooling the environmental air. The low pressure refrigerant flow from the evaporator returns to the suction side of the compressor to begin the cycle anew.
The high pressure refrigerant flow through the expansion valve must be regulated in response to the degree of superheat in the low pressure refrigerant flow between the evaporator and suction side of the compressor to maximize the air conditioning performance. The superheat is defined as the temperature difference between the actual temperature of the low pressure refrigerant flow and the temperature of evaporation of the flow. Traditionally, the low pressure flow superheat has been sensed remotely by use of a feeler bulb. The feeler bulb is positioned in contact with the pipe carrying the low pressure refrigerant. A pressure carrier extends from the feeler bulb to a power element in the expansion valve which modulates the valve. Many of these components are affected by external thermal disturbances, reducing the accuracy of the modulation. Also, the complexity results in a long "dead time" between a superheat transient in the low pressure refrigerant flow, and a compensating regulation in the expansion valve.
Attempts have been made to improve expansion valve performance. For example, U.S. Pat. No. 3,450,345 discloses a bulbless thermostatic expansion valve. U.S. Pat. No. 3,537,645 also discloses a bulbless expansion valve. Japanese laid-open patent application No. 144,875/1984, and Japanese laid-open utility model application No. 130,378/1985, also illustrate expansion valve designs. However, the need remains for an expansion valve which maximizes performance of the system, while minimizing cost and maximizing reliability. |
Stock Watch for the United States' Ryder Cup Candidates After 2014 US Open
Sure, the Ryder Cup is four months away; however, it's never too early to start looking at who might make the United States squad, especially as captain Tom Watson is set to finalize his roster after the PGA Championship in late August.
Among those who have accumulated the most Ryder Cup ranking points to date, some golfers have seen their stocks soar, while others are seeing quite the opposite.
Stock Down: Bubba Watson
Ross Kinnaird/Getty Images
First in Ryder Cup points after 16 starts this season, Bubba Watson's stock is trending downward after a missed cut at the U.S. Open. A double-bogey seven at the par-five 10th during his first round, in combination with a multitude of bogeys over both rounds, left him just outside the cut line at Pinehurst No. 2.
Still, with little more than two months until team selections, Watson is nearly assured a spot on Tom Watson's squad.
Since our last update, Bubba finished tied for 48th at The Players and third at the Memorial Tournament. But a missed cut at the U.S. Open is a significant snafu for the winner of the season's first major.
Stock Up: Dustin Johnson
Third in the current Ryder Cup standings, Dustin Johnson played well at the U.S. Open. His T4 finish was a career best at the season's second major; he played well from tee to green all week.
Since the last update, Johnson has been playing quality golf. After an unimpressive tie for 59th at The Players Championship, DJ tied for seventh at the HP Byron Nelson Championship. He finished tied for 14th at the Crowne Plaza Invitational at Colonial the next week and made the cut in his two succeeding events.
On the season, he's made an impressive 12 of 14 cuts with seven top-10 finishes. He won the WGC-HSBC Championship and is fourth in the FedEx Cup standings.
Stock Down: Phil Mickelson
Andrew Redington/Getty Images
Phil Mickelson is currently 10th in the Ryder Cup points list after 19 starts this season. He tied for 28th at the U.S. Open at Pinehurst No. 2. Pre-tournament murmurings held that Mickelson had a good chance of winning on the course where he so famously placed second at the 1999 U.S. Open.
Instead, he was not a factor, tying for 28th and never threatening the lead.
Mickelson still hasn't accumulated any top-10 finishes this year.
After failing to impress at Pinehurst, Mickelson, who is on the Ryder Cup bubble, sees his stock moving down, and he'll need to do well the rest of 2014 so he doesn't have to rely on a captain's pick to make the trip to Scotland.
Stock Down: Jason Dufner
David Cannon/Getty Images
Jason Dufner is eighth in the Ryder Cup standings. He's made 17 starts this season but has now missed the cut in both majors.
Dufner carded rounds of 72, 74 at Pinehurst No. 2 to miss the cut. Even though he hasn't missed any other cuts since our last update and nearly won the Crowne Plaza Invitational at Colonial (narrowly losing to Adam Scott in a playoff), Dufner's Ryder Cup stock moves down, as he missed a huge opportunity to earn points at the U.S. Open.
We want our Ryder Cup players to be at their best in the biggest tournaments. Missing the cut at consecutive majors is not evidence of that trait.
Stock Up: Jordan Spieth
David Cannon/Getty Images
After 21 starts, Jordan Spieth is fifth in the current Ryder Cup standings. The young Texan seems well on his way to earning a spot on his first Ryder Cup team with two months until rosters are finalized.
Since the last update after the Masters, Spieth has continued his stellar form. Most recently, the 20-year-old finished tied for 17th at the U.S. Open, making the cut at the event for the first time in his career.
Following his strong showing at the Masters, Spieth finished tied for 12th at the RBC Heritage and tied for fourth at The Players Championship. He also finished inside the top 20 at the Memorial.
Spieth looks like he will earn a spot on the 2014 U.S. Ryder Cup team—an impressive feat in only his second season on the PGA Tour.
Stock Down: Patrick Reed
Streeter Lecka/Getty Images
Presently ninth in the Ryder Cup standings, Patrick Reed has made 17 starts this year.
At the time of our last update, Reed had just missed the cut at the Masters. Although he finished tied for 35th at last week's U.S. Open, his play between the season's first two majors was poor. However, the results should be taken with a grain of salt, as Team Reed recently welcomed a new member.
Still, after missing the cut at the Masters, Reed missed the cut in three of his next four starts. The Texas native will need to right the ship over the next couple of months, as he presently sits on the Ryder Cup bubble.
Stock Up: Rickie Fowler
Andrew Redington/Getty Images
Rickie Fowler is currently seventh in the Ryder Cup standings. He's made 23 appearances on the PGA Tour this season and is coming off his career-best showing at the U.S. Open. Fowler tied for second and was one of only three players under par for the tournament. The impressive performance follows up a T10 finish at last year's U.S. Open.
Since the Masters, Fowler made two of four cuts prior to the FedEx St. Jude Classic, where he finished tied for 13th. While the Oklahoma State alum's play during the stretch isn't overwhelming, his work inside the ropes at Pinehurst No. 2 has his Ryder Cup stock ticking up. |
1. Field of the Invention
This invention relates generally to microprogrammed data processing systems and more specifically to the aligning of long operands which are the result of a decimal numeric instruction calculating with the long operand for storage in memory.
2. Description of the Prior Art
Data processing systems process data stored in memory in the form of decimal digits. Computer instructions are also stored in memory. Some of the instructions when processed by the data processing system result in arithmetic operations being performed on the decimal digits. For example, a decimal numeric instruction may be processed by the computing system to add one set of decimal digits--operand 1, from one group of memory locations to another set of decimal digits from another group of memory locations--operand 2, and place the result--operand 3, into a third group of memory locations.
Descriptors associated with the instruction define the characteristics of each of the operands. Each operand may be a floating point number or a scaled number. Each decimal digit may have 4 bits or 9 bits. The descriptor also defines the number of decimal digits in the operand, the location of the decimal point, i.e., the scale factor, the character position within a word of the most significant character of the operand, and the location of the sign if the operand contains a sign, either in the most significant character position--leading sign, or the least significant character position in a scaled operand--trailing sign. The instruction will indicate if the operand is ASCII or EBCDIC and if the sign is part of an overpunched character.
This invention processes operand 3 in accordance with its descriptor for storage in memory.
Prior art systems, for example, the Honeywell 6000 family of computers stored operand 3 in the bank of registers with combination logic setting up the pointers to identify the number and positions of leading and trailing zones as well as the character size, 4 bits or 9 bits, within each word and the position of the sign, trailing or leading.
Microprogrammed systems were developed to perform the same functions as the hardware systems such as the Honeywell 6000 and at a reduced product cost. However, in certain areas such as during the processing of decimal numeric instructions a considerable number of firmware steps were required to condition the resultant operand 3 for storage in memory, thereby reducing the system throughput during the processing of decimal numeric instructions. |
Q:
CalDav UID assignment by server
I have custom built a CalDav server in C# for a product we are selling and everything works quite peachy. There is just one thing that is bothering me, but nowhere in the standards I could find a solution for my 'annoyance'.
When a client is connected to our CalDav server and creates a new Event, the client tells the server what the UID is for the Event that is submitted. Our server saves that Event in it's own database (as a different model) and that object gets an ID from our server.
I respond to the client that the object is saved and that it got a new location, which makes the client retrieve the latest version of the object.
But I would love to change the UID of the Event that was sent by the client, to the ID we use to look-up the object.
Is there a way to tell the client "I stored the object for you, but please retrieve this version, with a changed UID and dump the old one?"
Because the way it works now is that the client indeed retrieves the newly created Event after it was sent to us (using a PUT request), but because of the new UID the Event has, the client thinks it is a new object.
I already tried doing this by saying to the client that the item that they tried to post to /mycaldav/SOME-WEIRD-UID-HERE.ics should actually be posted to /mycaldav/MY-OWN-UID.ics.
This resulted in a post to the right URL, but with the wrong UID.
A:
It's quite simple: in CalDAV/CardDAV the UID is assigned by the client (and for PUTs the URL as well).
You can't just change it, as the client might as well need "its" ID to associate stuff on the client side (e.g. attachments, scheduling requests, associated contacts and so on).
Summary: You need to keep a map of the client assigned UID (and URL) to your internal ID on your server. It's inconvenient, but the way it works. Maybe just store it in the same structure which you use to store all the X properties of the client?
|
Primary structure of the oligosaccharide determinant of blood group Cad specificity.
Glycophorin A and B from Cad erythrocyte membranes are the carriers of the blood group Cad determinants. They are characterized by a significant increase in molecular mass, as compared to the corresponding glycophorins from control erythrocytes (Cartron, J.-P., and Blanchard, D. (1982) Biochem. J. 207, 497-504). Lipid-free glycophorin A, purified from Cad red cells, showed an increased GalNAc content in comparison to blood group B, Cad-negative, control cells. Alkaline-borohydride treatment of this Cad glycophorin A released as a predominant species a pentasaccharide; its structure was determined, by methylation analysis and by 500-MHz 1H-NMR studies, to be: (formula; see text) This novel oligosaccharide inhibited strongly the hemagglutination of Cad erythrocytes by the Dolichos biflorus lectin. It shares with the blood group Sda determinant a terminal GalNAc beta (1 leads to 4)Gal beta (1 leads to .) sequence. |
Experimental design in pesticide extraction methods: A review.
The sample extraction process is considered as the essential step in the pesticide residue analysis, as it provides the base for the detection of the pesticides in trace level. Various factors need to be optimized during the extraction of pesticides due to the complexity of the matrix which is time-consuming and tedious. Therefore, the use of experimental design in the optimization process proves to be effective with minimum experiments and cost. This paper is aimed to overview the experimental designs that are frequently used for screening (full factorial, fractional factorial, Plackett-Burman Design) and optimizing (central composite design, Box-Behnken design, Taguchi design, Doehlert design, D-optimal design) the most influential factors to provide a sequential understanding of the linear and complex interactions in the pesticide extraction methods. Further, a systematic approach has been discussed about the use of experimental designs in pesticide extraction and also the softwares used for application-oriented readers. |
Q:
Should I use a metaclass, class decorator, or override the __new__ method?
Here is my problem. I want the following class to have a bunch of property attributes. I could either write them all out like foo and bar, or based on some other examples I've seen, it looks like I could use a class decorator, a metaclass, or override the __new__ method to set the properties automagically. I'm just not sure what the "right" way to do it would be.
class Test(object):
def calculate_attr(self, attr):
# do calculaty stuff
return attr
@property
def foo(self):
return self.calculate_attr('foo')
@property
def bar(self):
return self.calculate_attr('bar')
A:
Magic is bad. It makes your code harder to understand and maintain. You virtually never need metaclasses or __new__.
It looks like your use case could be implemented with pretty straightforward code (with only a small hint of magic):
class Test(object):
def calculate_attr(self, attr):
return something
def __getattr__(self, name):
return self.calculate_attr(name)
|
Craftsbury Academy
Craftsbury Academy is a term that is generally applied to the high school portion of the Craftsbury School System located in Craftsbury, Orleans County, Vermont, although occasionally it is extended to include the middle school as well, because it shares many resources with the high school.
The school has operated continuously since 1832, making it one of the oldest in the state. It faces Craftsbury Common. In the 21st century various building projects have upgraded the aging facilities, including a complete renovation of the old Academy Building, the annex (a relocated historic church converted into classroom space), and the World War II Memorial gymnasium. Once the renovations are complete the school board has stated that the campus will be up to modern building codes, and will be among the most energy efficient schools in New England.
History
Craftsbury Academy was incorporated in October, 1829. The early school held classes in foreign languages, fine arts, and other liberal arts. The founders intended to support the school with the lease or development of on land belonging to the school, a typical hope of the time.
The first building was erected in 1832, a two-story brick structure. This structure became unsound and was replaced by a wood structure in 1868. This building, together with most of the school furniture, was destroyed by fire in 1879. With the insurance money and the subscriptions of the townspeople a new building was erected, designed to accommodate about eighty pupils.
A campus structure, Minden Hall, preserves the original name of the town. This building contains the middle school portion of the Craftsbury School System, although many resources are shared with other grade levels. Minden Hall was built in 1980 and has been lightly renovated as part of the much more intensive renovations being done on the older structures on campus.
Academics
Craftsbury Schools offers a K-12 education program. The high school program includes instruction in science, social studies, mathematics, and English comparable to neighboring schools, and also offers a range of electives including arts, physical education, and Spanish. In 2012, Craftsbury Academy began a partnership with The Virtual High School, which allows students access to a range of online elective courses.
In September classes hike local mountains. In January and February students participate in the Physical Education program, which gives students various options for off-campus physical education opportunities, including ice skating, downhill and cross country skiing, and broom ball. In May and June students participate in Thematics, a hands-on learning program that explores sustainability related themes, such as watersheds and open spaces. Thematics activities include day trips and occasionally overnight experiences. These activities are complemented by school traditions such as Autumnfest, Winter Carnival, and Memorial Day celebrations.
Craftsbury Schools typically scores near the state average on standardized testing.
A seventh grader won the state spelling bee in 2010 and advanced to the national competition.
Free and reduced lunch
The school has the least percentage of students qualifying for free lunch in the county, 32%. The state average is 31%.
References
External links
Category:Public high schools in Vermont
Category:Public middle schools in Vermont
Category:Buildings and structures in Craftsbury, Vermont
Category:Educational institutions established in 1829
Category:Schools in Orleans County, Vermont |
T-cell prolymphocytic leukemia: a single-institution experience.
T-cell prolymphocytic leukemia is an uncommon, aggressive, mature T-cell leukemia characterized by proliferation of T-cell lymphocytes. The recent availability of modern immunophenotypic and molecular tools has allowed a better distinction of this disorder from its B-cell counterpart and other mature T-cell leukemias. The clinical, pathologic, and cytogenetic features of 57 patients with T-PLL who were evaluated at the Department of Leukemia, M. D. Anderson Cancer Center (MDACC) from 1986 to 2004 were examined. The most common cytogenetic abnormality was inv(14)(q11;q32), which was present in 7 patients. In all 7 patients, this abnormality was associated with other chromosomal aberrations. Patients treated with alemtuzumab at MDACC had a significantly better response rate (P = 0.02) and survival rate (P = 0.002). There were no significant differences in survival based on Tcl-1 expression or different patterns of CD4 and CD8 expression. Treatment with alemtuzumab results in higher response rates and a better survival rate in patients with T-cell prolymphocytic leukemia. |
一个用于显示多种不同类型图片的React组件，包括网络图片、静态资源、临时的本地图片、以及本地磁盘上的图片（如相册）等。详细用法参阅[图片文档](images.html)。
用法样例：
```javascript
renderImages() {
return (
<View>
<Image
style={styles.icon}
source={require('./icon.png')}
/>
<Image
style={styles.logo}
source={{uri: 'http://facebook.github.io/react/img/logo_og.png'}}
/>
</View>
);
}
```
### 截图
### 属性
<div class="props">
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="onlayout"></a>onLayout <span class="propType">function</span> <a class="hash-link" href="#onlayout">#</a></h4>
<div>
<p>当元素挂载或者布局改变的时候调用，参数为：<code>{nativeEvent: {layout: {x, y, width, height}}}</code>.</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="onload"></a>onLoad <span class="propType">function</span> <a class="hash-link" href="#onload">#</a></h4>
<div>
<p>加载成功完成时调用此回调函数。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="onloadend"></a>onLoadEnd <span class="propType">function</span> <a class="hash-link" href="#onloadend">#</a></h4>
<div>
<p>加载结束后，不论成功还是失败，调用此回调函数。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="onloadstart"></a>onLoadStart <span class="propType">function</span> <a class="hash-link" href="#onloadstart">#</a></h4>
<div>
<p>加载开始时调用。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="resizemode"></a>resizeMode <span class="propType">enum('cover', 'contain', 'stretch')</span> <a class="hash-link" href="#resizemode">#</a></h4>
<div>
<p>决定当组件尺寸和图片尺寸不成比例的时候如何调整图片的大小。</p>
<ul>
<li><p><code>cover</code>: 在保持图片宽高比的前提下缩放图片，直到宽度和高度都大于等于容器视图的尺寸（如果容器有padding内衬的话，则相应减去）。__译注__：这样图片完全覆盖甚至超出容器，容器中不留任何空白。</p></li>
<li><p><code>contain</code>: 在保持图片宽高比的前提下缩放图片，直到宽度和高度都小于等于容器视图的尺寸（如果容器有padding内衬的话，则相应减去）。__译注__：这样图片完全被包裹在容器中，容器中可能留有空白</p></li>
<li><p><code>stretch</code>: 拉伸图片且不维持宽高比，直到宽高都刚好填满容器。</p></li>
</ul>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="source"></a>source <span class="propType">{uri: string}, number</span> <a class="hash-link" href="#source">#</a></h4>
<div>
<p><code>uri</code>是一个表示图片的资源标识的字符串，它可以是一个http地址或是一个本地文件路径（使用<code>require(相对路径)</code>来引用）。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="style"></a>style <span class="propType">style</span> <a class="hash-link" href="#style">#</a></h4>
<div class="compactProps">
<div class="prop">
<h6 class="propTitle"><a href="layout-with-flexbox.html">Flexbox...</a></h6>
</div>
<div class="prop">
<h6 class="propTitle"><a href="transforms.html#proptypes">Transforms...</a></h6>
</div>
<div class="prop">
<h6 class="propTitle">resizeMode <span class="propType">Object.keys(ImageResizeMode)</span></h6>
</div>
<div class="prop">
<h6 class="propTitle">backgroundColor <span class="propType">string</span></h6>
</div>
<div class="prop">
<h6 class="propTitle">borderColor <span class="propType">string</span></h6>
</div>
<div class="prop">
<h6 class="propTitle">borderWidth <span class="propType">number</span></h6>
</div>
<div class="prop">
<h6 class="propTitle">borderRadius <span class="propType">number</span></h6>
</div>
<div class="prop">
<h6 class="propTitle">overflow <span class="propType">enum('visible', 'hidden')</span></h6>
</div>
<div class="prop">
<h6 class="propTitle">tintColor <span class="propType">string</span></h6>
</div>
<div class="prop">
<h6 class="propTitle">opacity <span class="propType">number</span></h6>
</div>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="testid"></a>testID <span class="propType">string</span> <a class="hash-link" href="#testid">#</a></h4>
<div>
<p>一个唯一的资源标识符，用来在自动测试脚本中标识这个元素。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="accessibilitylabel"></a><span class="platform">ios</span>accessibilityLabel <span class="propType">string</span> <a class="hash-link" href="#accessibilitylabel">#</a></h4>
<div>
<p>当用户与图片交互时，读屏器（无障碍功能）会朗读的文字。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="accessible"></a><span class="platform">ios</span>accessible <span class="propType">bool</span> <a class="hash-link" href="#accessible">#</a></h4>
<div>
<p>当此属性为真的时候，表示这个图片是一个启用了无障碍功能的元素。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="blurradius"></a><span class="platform">ios</span>blurRadius <span class="propType">number</span> <a class="hash-link" href="#blurradius">#</a>
</h4>
<div>
<p>blurRadius(模糊半径)：为图片添加一个指定半径的模糊滤镜。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="capinsets"></a><span class="platform">ios</span>capInsets <span class="propType">{top: number, left: number, bottom: number, right: number}</span> <a class="hash-link" href="#capinsets">#</a></h4>
<div>
<p>当图片被缩放的时候，capInsets指定的角上的尺寸会被固定而不进行缩放，而中间和边上其他的部分则会被拉伸。这在制作一些可变大小的圆角按钮、阴影、以及其它资源的时候非常有用（译注：这就是常说的九宫格或者.9图。了解更多信息，可以参见<a href="https://developer.apple.com/library/ios/documentation/UIKit/Reference/UIImage_Class/index.html#//apple_ref/occ/instm/UIImage/resizableImageWithCapInsets" target="_blank">苹果官方文档</a></p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="defaultsource"></a><span class="platform">ios</span>defaultSource <span class="propType">{uri: string}</span> <a class="hash-link" href="#defaultsource">#</a></h4>
<div>
<p>一个静态图片，当最终的图片正在下载的过程中时显示（loading背景图）。</p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="onerror"></a><span class="platform">ios</span>onError <span class="propType">function</span> <a class="hash-link" href="#onerror">#</a></h4>
<div>
<p>当加载错误的时候调用此回调函数，参数为<code>{nativeEvent: {error}}</code></p>
</div>
</div>
<div class="prop">
<h4 class="propTitle"><a class="anchor" name="onprogress"></a><span class="platform">ios</span>onProgress <span class="propType">function</span> <a class="hash-link" href="#onprogress">#</a></h4>
<div>
<p>在加载过程中不断调用，参数为<code>{nativeEvent: {loaded, total}}</code></p>
</div>
</div>
</div>
### 方法
<div class="props">
<div class="prop"><h4 class="propTitle"><a class="anchor" name="getsize"></a><span class="propType">static </span>getSize<span
class="propType">(uri: string, success: (width: number, height: number) => void, failure: (error: any) => void)</span>
<a class="hash-link" href="#getsize">#</a></h4>
<div><p>在显示图片前获取图片的宽高(以像素为单位)。如果图片地址不正确或下载失败,此方法也会失败。</p>
<p>要获取图片的尺寸,首先需要加载或下载图片(同时会被缓存起来)。这意味着理论上你可以用这个方法来预加载图片,虽然此方法并没有针对这一用法进行优化,而且将来可能会换一些实现方案使得并不需要完整下载图片即可获取尺寸。所以更好的预加载方案是使用下面那个专门的预加载方法。</p></div>
</div>
<div class="prop"><h4 class="propTitle"><a class="anchor" name="prefetch"></a><span class="propType">static </span>prefetch<span
class="propType">(url: string)</span> <a class="hash-link" href="#prefetch">#</a></h4>
<div><p>预加载一个远程图片(将其下载到本地磁盘缓存)。</p></div>
</div>
</div>
### 例子
```javascript
'use strict';
var React = require('react');
var ReactNative = require('react-native');
var {
ActivityIndicator,
Image,
Platform,
StyleSheet,
Text,
View,
} = ReactNative;
var base64Icon = 'data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAEsAAABLCAQAAACSR7JhAAADtUlEQVR4Ac3YA2Bj6QLH0XPT1Fzbtm29tW3btm3bfLZtv7e2ObZnms7d8Uw098tuetPzrxv8wiISrtVudrG2JXQZ4VOv+qUfmqCGGl1mqLhoA52oZlb0mrjsnhKpgeUNEs91Z0pd1kvihA3ULGVHiQO2narKSHKkEMulm9VgUyE60s1aWoMQUbpZOWE+kaqs4eLEjdIlZTcFZB0ndc1+lhB1lZrIuk5P2aib1NBpZaL+JaOGIt0ls47SKzLC7CqrlGF6RZ09HGoNy1lYl2aRSWL5GuzqWU1KafRdoRp0iOQEiDzgZPnG6DbldcomadViflnl/cL93tOoVbsOLVM2jylvdWjXolWX1hmfZbGR/wjypDjFLSZIRov09BgYmtUqPQPlQrPapecLgTIy0jMgPKtTeob2zWtrGH3xvjUkPCtNg/tm1rjwrMa+mdUkPd3hWbH0jArPGiU9ufCsNNWFZ40wpwn+62/66R2RUtoso1OB34tnLOcy7YB1fUdc9e0q3yru8PGM773vXsuZ5YIZX+5xmHwHGVvlrGPN6ZSiP1smOsMMde40wKv2VmwPPVXNut4sVpUreZiLBHi0qln/VQeI/LTMYXpsJtFiclUN+5HVZazim+Ky+7sAvxWnvjXrJFneVtLWLyPJu9K3cXLWeOlbMTlrIelbMDlrLenrjEQOtIF+fuI9xRp9ZBFp6+b6WT8RrxEpdK64BuvHgDk+vUy+b5hYk6zfyfs051gRoNO1usU12WWRWL73/MMEy9pMi9qIrR4ZpV16Rrvduxazmy1FSvuFXRkqTnE7m2kdb5U8xGjLw/spRr1uTov4uOgQE+0N/DvFrG/Jt7i/FzwxbA9kDanhf2w+t4V97G8lrT7wc08aA2QNUkuTfW/KimT01wdlfK4yEw030VfT0RtZbzjeMprNq8m8tnSTASrTLti64oBNdpmMQm0eEwvfPwRbUBywG5TzjPCsdwk3IeAXjQblLCoXnDVeoAz6SfJNk5TTzytCNZk/POtTSV40NwOFWzw86wNJRpubpXsn60NJFlHeqlYRbslqZm2jnEZ3qcSKgm0kTli3zZVS7y/iivZTweYXJ26Y+RTbV1zh3hYkgyFGSTKPfRVbRqWWVReaxYeSLarYv1Qqsmh1s95S7G+eEWK0f3jYKTbV6bOwepjfhtafsvUsqrQvrGC8YhmnO9cSCk3yuY984F1vesdHYhWJ5FvASlacshUsajFt2mUM9pqzvKGcyNJW0arTKN1GGGzQlH0tXwLDgQTurS8eIQAAAABJRU5ErkJggg==';
var ImageCapInsetsExample = require('./ImageCapInsetsExample');
const IMAGE_PREFETCH_URL = 'http://facebook.github.io/origami/public/images/blog-hero.jpg?r=1&t=' + Date.now();
var prefetchTask = Image.prefetch(IMAGE_PREFETCH_URL);
var NetworkImageCallbackExample = React.createClass({
getInitialState: function() {
return {
events: [],
startLoadPrefetched: false,
mountTime: new Date(),
};
},
componentWillMount() {
this.setState({mountTime: new Date()});
},
render: function() {
var { mountTime } = this.state;
return (
<View>
<Image
source={this.props.source}
style={[styles.base, {overflow: 'visible'}]}
onLoadStart={() => this._loadEventFired(`✔ onLoadStart (+${new Date() - mountTime}ms)`)}
onLoad={() => this._loadEventFired(`✔ onLoad (+${new Date() - mountTime}ms)`)}
onLoadEnd={() => {
this._loadEventFired(`✔ onLoadEnd (+${new Date() - mountTime}ms)`);
this.setState({startLoadPrefetched: true}, () => {
prefetchTask.then(() => {
this._loadEventFired(`✔ Prefetch OK (+${new Date() - mountTime}ms)`);
}, error => {
this._loadEventFired(`✘ Prefetch failed (+${new Date() - mountTime}ms)`);
});
});
}}
/>
{this.state.startLoadPrefetched ?
<Image
source={this.props.prefetchedSource}
style={[styles.base, {overflow: 'visible'}]}
onLoadStart={() => this._loadEventFired(`✔ (prefetched) onLoadStart (+${new Date() - mountTime}ms)`)}
onLoad={() => this._loadEventFired(`✔ (prefetched) onLoad (+${new Date() - mountTime}ms)`)}
onLoadEnd={() => this._loadEventFired(`✔ (prefetched) onLoadEnd (+${new Date() - mountTime}ms)`)}
/>
: null}
<Text style={{marginTop: 20}}>
{this.state.events.join('\\n')}
</Text>
</View>
);
},
_loadEventFired(event) {
this.setState((state) => {
return state.events = [...state.events, event];
});
}
});
var NetworkImageExample = React.createClass({
getInitialState: function() {
return {
error: false,
loading: false,
progress: 0
};
},
render: function() {
var loader = this.state.loading ?
<View style={styles.progress}>
<Text>{this.state.progress}%</Text>
<ActivityIndicator style={{marginLeft:5}} />
</View> : null;
return this.state.error ?
<Text>{this.state.error}</Text> :
<Image
source={this.props.source}
style={[styles.base, {overflow: 'visible'}]}
onLoadStart={(e) => this.setState({loading: true})}
onError={(e) => this.setState({error: e.nativeEvent.error, loading: false})}
onProgress={(e) => this.setState({progress: Math.round(100 * e.nativeEvent.loaded / e.nativeEvent.total)})}
onLoad={() => this.setState({loading: false, error: false})}>
{loader}
</Image>;
}
});
var ImageSizeExample = React.createClass({
getInitialState: function() {
return {
width: 0,
height: 0,
};
},
componentDidMount: function() {
Image.getSize(this.props.source.uri, (width, height) => {
this.setState({width, height});
});
},
render: function() {
return (
<View style={{flexDirection: 'row'}}>
<Image
style={{
width: 60,
height: 60,
backgroundColor: 'transparent',
marginRight: 10,
}}
source={this.props.source} />
<Text>
Actual dimensions:{'\\n'}
Width: {this.state.width}, Height: {this.state.height}
</Text>
</View>
);
},
});
var MultipleSourcesExample = React.createClass({
getInitialState: function() {
return {
width: 30,
height: 30,
};
},
render: function() {
return (
<View style={styles.container}>
<View style={{flexDirection: 'row', justifyContent: 'space-between'}}>
<Text
style={styles.touchableText}
onPress={this.decreaseImageSize} >
Decrease image size
</Text>
<Text
style={styles.touchableText}
onPress={this.increaseImageSize} >
Increase image size
</Text>
</View>
<Text>Container image size: {this.state.width}x{this.state.height} </Text>
<View
style={[styles.imageContainer, {height: this.state.height, width: this.state.width}]} >
<Image
style={{flex: 1}}
source={[
{uri: 'http://facebook.github.io/react/img/logo_small.png', width: 38, height: 38},
{uri: 'http://facebook.github.io/react/img/logo_small_2x.png', width: 76, height: 76},
{uri: 'http://facebook.github.io/react/img/logo_og.png', width: 400, height: 400}
]}
/>
</View>
</View>
);
},
increaseImageSize: function() {
if (this.state.width >= 100) {
return;
}
this.setState({
width: this.state.width + 10,
height: this.state.height + 10,
});
},
decreaseImageSize: function() {
if (this.state.width <= 10) {
return;
}
this.setState({
width: this.state.width - 10,
height: this.state.height - 10,
});
},
});
exports.displayName = (undefined: ?string);
exports.framework = 'React';
exports.title = '<Image>';
exports.description = 'Base component for displaying different types of images.';
exports.examples = [
{
title: 'Plain Network Image',
description: 'If the `source` prop `uri` property is prefixed with ' +
'"http", then it will be downloaded from the network.',
render: function() {
return (
<Image
source={{uri: 'http://facebook.github.io/react/img/logo_og.png'}}
style={styles.base}
/>
);
},
},
{
title: 'Plain Static Image',
description: 'Static assets should be placed in the source code tree, and ' +
'required in the same way as JavaScript modules.',
render: function() {
return (
<View style={styles.horizontal}>
<Image source={require('./uie_thumb_normal.png')} style={styles.icon} />
<Image source={require('./uie_thumb_selected.png')} style={styles.icon} />
<Image source={require('./uie_comment_normal.png')} style={styles.icon} />
<Image source={require('./uie_comment_highlighted.png')} style={styles.icon} />
</View>
);
},
},
{
title: 'Image Loading Events',
render: function() {
return (
<NetworkImageCallbackExample source={{uri: 'http://facebook.github.io/origami/public/images/blog-hero.jpg?r=1&t=' + Date.now()}}
prefetchedSource={{uri: IMAGE_PREFETCH_URL}}/>
);
},
},
{
title: 'Error Handler',
render: function() {
return (
<NetworkImageExample source={{uri: 'http://TYPO_ERROR_facebook.github.io/react/img/logo_og.png'}} />
);
},
platform: 'ios',
},
{
title: 'Image Download Progress',
render: function() {
return (
<NetworkImageExample source={{uri: 'http://facebook.github.io/origami/public/images/blog-hero.jpg?r=1'}}/>
);
},
platform: 'ios',
},
{
title: 'defaultSource',
description: 'Show a placeholder image when a network image is loading',
render: function() {
return (
<Image
defaultSource={require('./bunny.png')}
source={{uri: 'http://facebook.github.io/origami/public/images/birds.jpg'}}
style={styles.base}
/>
);
},
platform: 'ios',
},
{
title: 'Border Color',
render: function() {
return (
<View style={styles.horizontal}>
<Image
source={smallImage}
style={[
styles.base,
styles.background,
{borderWidth: 3, borderColor: '#f099f0'}
]}
/>
</View>
);
},
},
{
title: 'Border Width',
render: function() {
return (
<View style={styles.horizontal}>
<Image
source={smallImage}
style={[
styles.base,
styles.background,
{borderWidth: 5, borderColor: '#f099f0'}
]}
/>
</View>
);
},
},
{
title: 'Border Radius',
render: function() {
return (
<View style={styles.horizontal}>
<Image
style={[styles.base, {borderRadius: 5}]}
source={fullImage}
/>
<Image
style={[styles.base, styles.leftMargin, {borderRadius: 19}]}
source={fullImage}
/>
</View>
);
},
},
{
title: 'Background Color',
render: function() {
return (
<View style={styles.horizontal}>
<Image source={smallImage} style={styles.base} />
<Image
style={[
styles.base,
styles.leftMargin,
{backgroundColor: 'rgba(0, 0, 100, 0.25)'}
]}
source={smallImage}
/>
<Image
style={[styles.base, styles.leftMargin, {backgroundColor: 'red'}]}
source={smallImage}
/>
<Image
style={[styles.base, styles.leftMargin, {backgroundColor: 'black'}]}
source={smallImage}
/>
</View>
);
},
},
{
title: 'Opacity',
render: function() {
return (
<View style={styles.horizontal}>
<Image
style={[styles.base, {opacity: 1}]}
source={fullImage}
/>
<Image
style={[styles.base, styles.leftMargin, {opacity: 0.8}]}
source={fullImage}
/>
<Image
style={[styles.base, styles.leftMargin, {opacity: 0.6}]}
source={fullImage}
/>
<Image
style={[styles.base, styles.leftMargin, {opacity: 0.4}]}
source={fullImage}
/>
<Image
style={[styles.base, styles.leftMargin, {opacity: 0.2}]}
source={fullImage}
/>
<Image
style={[styles.base, styles.leftMargin, {opacity: 0}]}
source={fullImage}
/>
</View>
);
},
},
{
title: 'Nesting',
render: function() {
return (
<Image
style={{width: 60, height: 60, backgroundColor: 'transparent'}}
source={fullImage}>
<Text style={styles.nestedText}>
React
</Text>
</Image>
);
},
},
{
title: 'Tint Color',
description: 'The `tintColor` style prop changes all the non-alpha ' +
'pixels to the tint color.',
render: function() {
return (
<View>
<View style={styles.horizontal}>
<Image
source={require('./uie_thumb_normal.png')}
style={[styles.icon, {borderRadius: 5, tintColor: '#5ac8fa' }]}
/>
<Image
source={require('./uie_thumb_normal.png')}
style={[styles.icon, styles.leftMargin, {borderRadius: 5, tintColor: '#4cd964' }]}
/>
<Image
source={require('./uie_thumb_normal.png')}
style={[styles.icon, styles.leftMargin, {borderRadius: 5, tintColor: '#ff2d55' }]}
/>
<Image
source={require('./uie_thumb_normal.png')}
style={[styles.icon, styles.leftMargin, {borderRadius: 5, tintColor: '#8e8e93' }]}
/>
</View>
<Text style={styles.sectionText}>
It also works with downloaded images:
</Text>
<View style={styles.horizontal}>
<Image
source={smallImage}
style={[styles.base, {borderRadius: 5, tintColor: '#5ac8fa' }]}
/>
<Image
source={smallImage}
style={[styles.base, styles.leftMargin, {borderRadius: 5, tintColor: '#4cd964' }]}
/>
<Image
source={smallImage}
style={[styles.base, styles.leftMargin, {borderRadius: 5, tintColor: '#ff2d55' }]}
/>
<Image
source={smallImage}
style={[styles.base, styles.leftMargin, {borderRadius: 5, tintColor: '#8e8e93' }]}
/>
</View>
</View>
);
},
},
{
title: 'Resize Mode',
description: 'The `resizeMode` style prop controls how the image is ' +
'rendered within the frame.',
render: function() {
return (
<View>
{[smallImage, fullImage].map((image, index) => {
return (
<View key={index}>
<View style={styles.horizontal}>
<View>
<Text style={[styles.resizeModeText]}>
Contain
</Text>
<Image
style={styles.resizeMode}
resizeMode={Image.resizeMode.contain}
source={image}
/>
</View>
<View style={styles.leftMargin}>
<Text style={[styles.resizeModeText]}>
Cover
</Text>
<Image
style={styles.resizeMode}
resizeMode={Image.resizeMode.cover}
source={image}
/>
</View>
</View>
<View style={styles.horizontal}>
<View>
<Text style={[styles.resizeModeText]}>
Stretch
</Text>
<Image
style={styles.resizeMode}
resizeMode={Image.resizeMode.stretch}
source={image}
/>
</View>
{ Platform.OS === 'android' ?
<View style={styles.leftMargin}>
<Text style={[styles.resizeModeText]}>
Center
</Text>
<Image
style={styles.resizeMode}
resizeMode={Image.resizeMode.center}
source={image}
/>
</View>
: null }
</View>
</View>
);
})}
</View>
);
},
},
{
title: 'Animated GIF',
render: function() {
return (
<Image
style={styles.gif}
source={{uri: 'http://38.media.tumblr.com/9e9bd08c6e2d10561dd1fb4197df4c4e/tumblr_mfqekpMktw1rn90umo1_500.gif'}}
/>
);
},
platform: 'ios',
},
{
title: 'Base64 image',
render: function() {
return (
<Image
style={styles.base64}
source={{uri: base64Icon, scale: 3}}
/>
);
},
platform: 'ios',
},
{
title: 'Cap Insets',
description:
'When the image is resized, the corners of the size specified ' +
'by capInsets will stay a fixed size, but the center content and ' +
'borders of the image will be stretched. This is useful for creating ' +
'resizable rounded buttons, shadows, and other resizable assets.',
render: function() {
return <ImageCapInsetsExample />;
},
platform: 'ios',
},
{
title: 'Image Size',
render: function() {
return <ImageSizeExample source={fullImage} />;
},
},
{
title: 'MultipleSourcesExample',
description:
'The `source` prop allows passing in an array of uris, so that native to choose which image ' +
'to diplay based on the size of the of the target image',
render: function() {
return <MultipleSourcesExample />;
},
platform: 'android',
},
];
var fullImage = {uri: 'http://facebook.github.io/react/img/logo_og.png'};
var smallImage = {uri: 'http://facebook.github.io/react/img/logo_small_2x.png'};
var styles = StyleSheet.create({
base: {
width: 38,
height: 38,
},
progress: {
flex: 1,
alignItems: 'center',
flexDirection: 'row',
width: 100
},
leftMargin: {
marginLeft: 10,
},
background: {
backgroundColor: '#222222'
},
sectionText: {
marginVertical: 6,
},
nestedText: {
marginLeft: 12,
marginTop: 20,
backgroundColor: 'transparent',
color: 'white'
},
resizeMode: {
width: 90,
height: 60,
borderWidth: 0.5,
borderColor: 'black'
},
resizeModeText: {
fontSize: 11,
marginBottom: 3,
},
icon: {
width: 15,
height: 15,
},
horizontal: {
flexDirection: 'row',
},
gif: {
flex: 1,
height: 200,
},
base64: {
flex: 1,
height: 50,
resizeMode: 'contain',
},
touchableText: {
fontWeight: '500',
color: 'blue',
},
});
``` |
---
author:
- 'M. Zuin$^{1}$, A. Carati$^{2}$, M. Marino$^{2}$, E. Martines$^{1}$ and L. Galgani$^{2}$'
title: A first principles explanation for the density limit in magnetized plasmas
---
**Fusion research on magnetic confinement is confronted with a severe problem concerning the electron densities $n_e$ to be used in fusion devices. Indeed, high densities are mandatory for obtaining large efficiencies, whereas it is empirically found that catastrophic disruptive events occur for densities exceeding a maximal one $n_e^M$. On the other hand, despite the large theoretical work “there is no widely accepted, first principles model for the density limit” (see [@green2], abstract). Here, we propose a simple microscopic model of a magnetized plasma suited for a tokamak, for which the existence of a density limit is proven. This property turns out to be a general collective feature of electrodynamics of point charges, which is lost in the continuum approximation. The law we find is $$\\label{legge}
n_e^M = 1.74\\, \\frac{1} {{m_e}c^2}\\, \\frac{B^2} {\\mu_0}$$ where $\\mu_0$ is the vacuum permeability, $c$ the speed of light, ${m_e}$ the electron mass, and $B$ the magnetic field. As shown in Fig. 1, the theoretical limit (big circles) is in rather good agreement with the empirical data, actually a surprisingly good one for a model based on first principles, with no adjustable parameter.**
The way in which law (\\[legge\\]) was established is an interesting example of an encounter between fundamental and applied research. Indeed three of the present authors are involved since some time in studies of a general character concerning the microscopic electrodynamics of systems of point particles (see [@cg] and [@mcg]), in which both the mutual retarded forces, and the radiation reaction force of Abraham Lorentz and Dirac [@dirac] (see also [@massimodirac] and [@jackson]) are taken into account. One of the results obtained is the proof of an identity conceived by Wheeler and Feynman [@wf], and an appreciation of the role the latter plays in allowing for the very existence of a dispersion relation. In particular, some examples of dispersion relations were given (see [@cg], Fig. 1), which exhibit, as the matter density is increased, a bifurcation of a topological character, entailing an instability. But the physical relevance of this fact was not emphasized. Such a density controlled bifurcation impressed instead very much those of the present authors who deal with plasma physics, who suggested it may be relevant for fusion plasmas. To this end, the simplest possible model was formulated, that should capture, within the frame of the foundational works mentioned, the essential physics of a magnetized plasma, confined in a tokamak configuration (the most studied one for fusion plasmas). The model is presented here, together with the deduction of law (\\[legge\\]). Preliminarily, the main evidence for the existence of a density limit in tokamaks is recalled, and it is discussed how well does law (\\[legge\\]) fit the data.
For the purposes of the present paper, all is needed to know about tokamaks is essentially that they are toroidal devices in which the confining magnetic field $B$ is the vector sum of a strong toroidal field $B_t$ produced by a set of coils wound around a torus, and of a much smaller poloidal field $B_p$ generated by a toroidal plasma current $I_p$. A few more details will be mentioned later.
![Greenwald plot for three tokamak devices (data extracted from [@green2]). Dotted line is the empirical Greenwald limit (\\[legge\\_greenwald\\]). Big circles are the theoretical predictions (\\[legge\\]) for the same devices. []{data-label="fig:1"}](figura_1.eps){width="1.\\columnwidth"}
The empirical data which show the existence of a density threshold beyond which tokamaks cannot operate, were collected by Greenwald [@green2] in a classical figure, the data of which are reported here in Fig.1. In the figure, the electron densities $n_e$ at which three different tokamak devices could actually be operated are reported versus the so-called Greenwald parameter $n_G \\equiv I_p/\\pi {a}^2$ (where ${a}$ is the minor radius of the torus), which is presumed to be the relevant control parameter. Indeed, the law proposed by Greenwald for the maximal density (dotted line in the figure) is $$\\label{legge_greenwald}
n_e^M = \\alpha_G\\, I_p/\\pi{a}^2 \\ ,$$ where $\\alpha_G$ is a constant with suitable dimensions, such that $\\alpha_G = 1$ in the units indicated in the figure. The theoretical predictions given by (\\[legge\\]) are also reported as big circles.
{width=".7\\columnwidth"}
Thus there naturally arises the question, how is it possible that two analytically different predictions, (\\[legge\\]) and (\\[legge\\_greenwald\\]), happen to agree with each other, at least in a few definite cases. The reason is that one has $$\\label{relazione}
\\frac{B}{\\mu_0} \\approx \\, b \\, \\frac{I_p}{\\pi a^2} \\ , \\quad b\\,=\\,q(a)\\, R\\, \\frac{1}{\\kappa^{1/2}(1+\\kappa^2)} \\ ,$$ where the dimensional coefficient $b$ (a length) is not a universal one, but depends parametrically on geometric factors and operative conditions characterising each experiment. These are the major and the minor radii $R$ and $a$, the plasma elongation $\\kappa$ (equal to 1 for circular plasmas, see [@Miyamoto] pg. 277), and the edge safety factor $q(a)$ defined below.
This is seen as follows. One has $B_p=\\mu_0 I_p/(2 \\pi a \\kappa^{1/2})$. Furthermore, in the approximation $B \\approx B_t$, one has $B \\approx (B_t/B_p)B_p$, while the operative parameter $B_t/B_p$ is determined by the edge safety factor $q(a)$ which, for the simplified case of an elliptical plasma (see [@Miyamoto]), is defined as $q(a)= (a/R) (B_t/ B_p) (1+ \\kappa^2)\\, /2$. This gives relation (\\[relazione\\]). The formula for $b$ in the general case is also easily established.
Now, magnetohydrodynamic stability requires $q(a)>2$, but the actual value at which each experimental data point of Fig. \\[fig:1\\] was taken is not given in the literature. So we assumed $q(a)=4$, which is a typical operational value, and this introduces an uncertainty in the theoretical points reported in Fig. \\[fig:1\\]. Thus, we decided to look directly at the experimental values available in the literature, from which a definite estimate of $B$ could be obtained, and this we did for conventional tokamaks more recent than those in Fig. \\[fig:1\\]. Such values are plotted in Fig. \\[fig:2\\], where they are compared to laws (\\[legge\\]) and (\\[legge\\_greenwald\\]). The agreement with law (\\[legge\\]) is perhaps a little better. This fact might have relevant implications for future tokamaks, as it implies a favorable density scaling for machines with large values of the product $R\\, B$. For example, let us consider the international thermonuclear experimental reactor (ITER) [@Iter], which should operate at a toroidal field of 5.3 T. According to law (\\[legge\\]) it would be able to operate at densities up to $n_e^M= 4.7\\times 10^{20}
m^{-3}$. This is a value more than three times larger than that expected according to Greenwald law (\\[legge\\_greenwald\\]) for a plasma current of 15 MA, which is the corresponding value of $I_p$ for a $q(a)=3$ scenario.
It is worth mentioning that a $B^2$ dependence of the density limit in the ALCATOR C experiment was noted in the past by Granetz [@Granetz], although such a clear dependence was not observed on other experiments (see for example [@Petrie] for the DIII-D tokamak). Also, one should point out that tokamaks with very low aspect ratio $R/a$ (spherical tokamaks) and reversed field pinches (RFP) [@Lorenzini], for which the validity of the Greenwald scaling has been proposed [@Valisa], seem not to fit well into the proposed $B^2$ scaling. This, perhaps, suggests that at low magnetic fields other effects, not considered in the present simple model, might come into play.
We show now how law (\\[legge\\]) was obtained, in the frame of microscopic electrodynamics of point particles (see [@cg] and [@mcg]), rather than of magnetohydrodynamics (see for example [@gold], chapter 17), or of the mean field theories of the Vlasov approach. We describe the plasma as constituted of point particles obeying Newton equations, with both the retarded electromagnetic interactions among all particles and the radiation reaction force taken into account. We then concentrate on the role played by the gyration of the electrons around the magnetic field lines, and so ignore their motions along the field lines, and also ignore the electrostatic part of the problem. Finally we also limit ourselves to the extremely simplified case of a one–dimensional array.
So we introduce the following model. Given a constant magnetic field $B$, which we take oriented along the ${z}$ axis of a cartesian coordinate system, we constrain each electron, say the $n$-th one, to move on a plane parallel to the ($x,y$) plane, so that its $z_n$ coordinate is fixed. The simplest choice is to take $z_n=n {l}$, with $n \\in Z$, for a given positive step ${l}$. Each electron, say the $n$–th one, is subjected to the external magnetic field $B$, and also to the electromagnetic field created by the electrons themselves. Namely, the sum of the Liénard–Wiechert fields, which are determined as the retarded solutions of Maxwell equations having as sources the charge and the current densities of each other electron $m\\neq n$, and the Abraham–Lorentz–Dirac radiation reaction force, due to the motion of the $n$–th electron itself, The latter is given, in the nonrelativistic approximation, by $(2/3) e^2/(4\\pi \\epsilon_0
c^3)\\, {{\\hskip2pt\\ddot{\\null}\\hskip2.5pt
\\dot{\\null}\\kern -5pt {{\\mathbf{x}}}}}_n$, where $e$ is the electron charge and ${{\\mathbf{x}}}_n$ the position vector of the electron.
We then perform the dipole approximation. Thus we neglect the magnetic field due to the $m$–th electron, and for the electric field created by it we take the well known expression for a dipole. Finally, we approximate the distance between electrons $n$ and $m$ by $r_{n,m}={l}|n-m|$. The system of equations of motion defining the model is then
$$\\begin{split}
{\\ddot x}_n- {\\omega_c}{\\dot y}_n -\\frac 23\\, \\frac{e^2 }
{4\\pi\\epsilon_0 {m_e}c^3}\\, {{{\\hskip2pt\\ddot{\\null}\\hskip2.5pt
\\dot{\\null}\\kern -5pt {x}}}}_n &= -
\\frac{e^2 }{4\\pi\\epsilon_0 {m_e}} \\sum_{m\\neq n}\\Big[ \\frac{x_m (t-r_{nm}/c)}{r^3_{nm}} +
\\frac{1}{c}\\frac{{\\dot x}_m (t-r_{nm}/c)}{r^2_{nm}} + \\frac{1}{c^2}
\\frac{{\\ddot x}_m(t-r_{nm}/c)}{r_{nm}}\\Big]\\\\ {\\ddot y}_n+ {\\omega_c}{\\dot x}_n -\\frac 23\\,
\\frac{e^2 }{4\\pi\\epsilon_0 {m_e}c^3}\\, {{{\\hskip2pt\\ddot{\\null}\\hskip2.5pt
\\dot{\\null}\\kern -5pt {y}}}}_n &= -
\\frac{e^2 }{4\\pi\\epsilon_0 {m_e}} \\sum_{m\\neq
n}\\Big[ \\frac{y_m(t-r_{nm}/c)}{r^3_{nm}} + \\frac{1}{c}\\frac{{\\dot
y}_m(t-r_{nm}/c)}{r^2_{nm}} + \\frac{1}{c^2} \\frac{{\\ddot
y}_m(t-r_{nm}/c)}{r_{nm}}\\Big]\\\\
\\end{split}$$
for $n\\in Z$, where $\\epsilon_0$ is the vacuum permittivity, and ${\\omega_c}=eB/{m_e}$ the Larmor or cyclotron frequency of the electrons in the external magnetic field $B$. This is an infinite system of linear equations with delay, which is just a simple variant of the system considered in [@cg].
Our aim is now to investigate the stability properties of the system, as the control parameters $n_e=1/{l}^3$ and $B$ (or equivalently ${\\omega_c}$) are varied. Following a completely standard procedure (see for example [@chandra]), we compute the normal modes of the system and determine the values of the parameters for which the frequencies become complex. So we look for normal mode solutions with wavenumber $k$ and angular frequency $\\omega$, i.e., of the form $$x_j=A_x e^{i(k{l}j+\\omega t)}\\ , \\quad y_j=A_ye^{i(k{l}j+\\omega t)}\\ .
\\label{}$$ This leads to a linear system in the unknowns $A_x$, $A_y$, from which the dispersion relation between $\\omega$ and $k$ is found by equating the determinant to zero. This gives two real equations in the two unknowns $\\omega$ and $k$, namely, $$\\label{eq:4}
\\Big(\\frac {\\omega}{{\\omega_c}}\\Big)^2 \\pm \\, \\frac\\omega{\\omega_c}\\ + p\\,
F(k{l},{l}\\omega/c) = 0 ,
\\quad p= \\frac{{\\omega_p}^2}{{\\omega_c}^2}\\ .$$ $$\\label{eq:2}
\\frac 23\\, \\frac{e^2}{4\\pi\\epsilon_0 {m_e}c^3} \\, \\omega^3 -
G(k{l},{l}\\omega/c) = 0\\ .$$ Here, ${\\omega_p}$ is the familiar plasma frequency defined by $${\\omega_p}^2=e^2/\\epsilon_0 {m_e}{l}^3\\ =n_e \\, e^2/\\epsilon_0 {m_e}\\ ,$$ while $F$ and $G$, as functions of the variables $\\alpha=k{l}$, $\\beta={l}\\omega/c $, are defined by $$\\label{eq:3}
\\begin{split}
F(\\alpha,\\beta) &=\\frac 1{4\\pi} \\Big[ \\beta^2\\log \\big(2\\,
|\\cos\\beta-\\cos\\alpha| \\,
\\big)- f(\\alpha,\\beta)\\Big]\\\\ G(\\alpha,\\beta)&=\\beta^3 -g(\\alpha,\\beta) \\ ,
\\end{split}$$ the functions $f$ and $g$ being the ones already introduced in [@cg], namely, $$\\begin{split}
f({\\alpha},\\beta)=\\sum_{n\\neq 0}(\\frac{\\cos(n{\\alpha}-|n|
\\beta)}{|n^3|}-\\beta \\frac{\\sin(n{\\alpha}-|n| \\beta)}{|n^2|}) \\\\
g({\\alpha},\\beta)=\\sum_{n\\neq 0}(\\frac{\\sin(n{\\alpha}-|n| \\beta)}{|n^3|} +
\\beta \\frac{\\cos(n{\\alpha}-|n| \\beta)}{|n^2|})\\ .
\\end{split}$$ Some details concerning the summation of the series leading to the term $\\beta^2\\log \\big(2\\, |\\cos\\beta-\\cos\\alpha|\\big) $ entering the function $F$ are here omitted.
Now, one meets here with a deep question of principle. Indeed, for fixed values of the parameters ${l}$ and ${\\omega_c}$ one has two equations in two unknowns ($\\omega$ and $k$), and this would not allow for the existence of a dispersion relation, i.e., of a function $\\omega=\\omega(k)$ for a continuous range of values of $k$. However, the existence of a dispersion relation is guaranteed by the fact that equation (\\[eq:2\\]) actually is an identity. In fact, this is a particular case of a general identity, conceived by Wheeler and Feynman [@wf] and first proven in [@cg] (see section 6) for a one-dimensional case and in [@mcg] for a three-dimensional one.
So, the problem of obtaining the dispersion relation is reduced to solving (\\[eq:4\\]) in the unknown $\\omega=\\omega(k)$, in which $p=\\omega_p^2/\\omega_c^2$ plays the role of a parameter. In Fig. \\[fig:3\\] the dispersion relations are shown for a cyclotron frequency ${\\omega_c}=3.8\\cdot 10^{11} Hz$, and for several values of the parameter $p=\\omega_p^2/{\\omega_c}^2$ (or of the corresponding electron density $n_e/ n_G$, normalized to the Greenwald density $n_G\\equiv I_p/\\pi {a}^2$).
![The dispersion curves, solutions of equation (\\[eq:4\\]) (with the plus sign), in the plane ($k{l}$, $\\omega/{\\omega_c}$) for ${\\omega_c}=3.8 \\times 10^{11}$ Hz, and for several values of the parameter $p=\\omega_p^2/{\\omega_c}^2$ (or equivalently of the electron density $n_e$, normalized to the empirical $n_G$ limit).[]{data-label="fig:3"}](figura_3.eps){width="1.\\columnwidth"}
The most important qualitative result is that normal modes are found to exist (for all $k$) only below a critical value of $p$, i.e., below a certain threshold of plasma density. Indeed, starting up from low densities, at a certain critical density a bifurcation is seen to occur, characterized by the fact that the curves no more intersect the vertical axis $k{l}=\\pi$. This means that for values of $k$ just below $\\pi/{l}$ equation (\\[eq:4\\]) does not admit a real solution, so that the corresponding frequencies acquire an imaginary part, and the whole system becomes unstable. Numerical computations not reported here show that the characteristic time of the instability is of the order of $2\\pi/{\\omega_c}$ and that above the critical density the Wheeler and Feynman identity is no more satisfied.
Notice that this phenomenon of the existence of a maximal allowed density is obviously lost if one introduces the continuum approximation, i.e., is a characteristic feature of the discrete structure of matter. Indeed, following [@mcg], the continuum approximation corresponds to deal with wavelengths much larger than the step ${l}$, i.e., to assume $k\\ll \\pi/{l}$, whereas the existence of a density limit depends on the behavior of the system for $k{l}\\simeq \\pi$. We have now to determine the bifurcation value of the parameter $p$. As the bifurcation occurs for $k{l}=\\pi$ and for values of $\\omega/{\\omega_c}\\leq 1$, i.e., for ${l}\\omega/c\\simeq 0$, one can just limit oneself to study equation (\\[eq:4\\]) for a fixed value of the function $F$, namely $F(\\pi, 0)$, so that one is simply reduced to deal with an algebraic equation of second degree. One computes $F(\\pi,
0)\\simeq0.14$, and so real values of $\\omega$ are found to exist only for $p\\lesssim1.74$. This, together with the definition of $p$ in (\\[eq:4\\]) and $\\epsilon_0 \\mu_0=1/c^2 $, gives law (\\[legge\\]).
Notice that law (\\[legge\\]) has the same form of the Brillouin limit [@Brillouin], which is known to apply to the case of nonneutral plasmas [@Davidson]. The main difference with respect to our procedure is that in the case of the Brillouin limit the electric field acting on each electron is introduced within a mean field approach, whereas here it is computed in the frame of a many–body microscopic theory. Correspondingly, we find that the instability involves normal modes with wavelengths of the order of the mean electron distance, so that it escapes a mean field approach. In particular, such an instability is found to occur in neutral plasmas, for which the mean charge density vanishes, and the Brillouin approach cannot be used.
A final comment concerns the possibility of dealing with the other main magnetic configuration studied for the confinement of fusion-relevant plasmas, i.e., the Stellarator [@Boozer]. The present model does not directly apply. Indeed, in the Stellarator a large amount of power is typically transferred to the electrons through electron cyclotron resonance heating (ECRH), and this requires to add in our model a forcing term.
In conclusion, through an extremely simplified model of a magnetized plasma suited for a tokamak, based on first principles, we have proved the existence of a density limit, beyond which the system becomes unstable. The law thus found differs from the usually accepted one, and this fact might have relevant implications for future tokamaks.
*The authors wish to thank Dr. Nicola Vianello for fruitful discussions.\\
This work, supported by the European Communities under the contract of Association between EURATOM/ENEA, was carried out within the framework the European Fusion Development Agreement.*
Greenwald, M., Density limits in toroidal plasmas, *Plasma Phys. Control. Fusion* **44**, R27–R80 (2002). Carati, A. and Galgani, L., Nonradiating normal modes in a classical many-body model of matter-radiation interaction, *Nuovo Cim.* **118 B**, 839-849 (2003). Marino, M., Carati, A, Galgani, L., Classical Light dispersion theory in a regular lattice, *Annals of Physics* **322**, 799-823 (2007). Dirac, P.A.M., Classical Theory of Radiating Electrons, *Proc. Royal Soc. London* **167**, 148–169 (1938). Marino, M., Classical electrodynamics of point charges, *Annals of Physics* **301**, 85–127 (2002). Jackson, J.D.,*Classical Electrodynamics*, New York, J. Wiley and Sons (1975). Wheeler, J.A. and Feynman, R.P., Interaction with the absorber as the mechanism of radiation, *Rev. Mod. Phys.* **17**, 157-181 (1945). Miyamoto, K., *Plasma Physics and Controlled Nuclear Fusion*, Berlin, Springer (2005). Stabler, Ä. *et al.*, Density limit investigations on ASDEX, *Nucl. Fusion* **32**, 1557 (1992). de Vries, P.C., Rapp, J., Schüller, F.C. and Tokar, M.Z., Influence of recycling on the density limit in TEXTOR-94, *Phys. Rev. Lett.* **80**, 3519-3522 (1998). Frigione, D. *et al.*, High density operation on Frascati Tokamak Upgrade, *Nucl. Fusion* **36**, 1489 (1999). Merezhkin, V.G., Electron energy balance near the density limit in T-10 and FTU OH regimes, *33rd EPS Conference on Plasma Phys.,* Rome, 19-23 June 2006 ECA Vol. 30I, P-4.085 (2006). Merthens, V. *et al.*, High density operation close to Greenwald limit and H Mode limit in ASDEX UPGRADE, *Nucl. Fusion* , 1607-1614 (1997). Howard, J. and Person, M., Cold bubble formation during tokamak density limit disruptions, *Nucl. Fusion* **32**, 361-377 (1992). Dyabilin, K. S. *et al.*, Global energy balance and density limit on CASTOR tokamak, *Czech. J. Phys.* **B 37**, 713-724 (1987). Asif, M. *et al*, Study of recycling and density limit in the HT-7 superconducting tokamak, *Phys. Lett. A* **336**, 61-65 (2005). LaBombard, B. *et al.*, Particle transport in the scrape-off layer and its relationship to discharge density limit in Alcator C-MOD, *Phys. Plasmas* **8**, 2107-2117 (2001). Takenaga, H. *et al.*, Compatibility of advanced tokamak plasma with high density and high radiation loss operation in JT-60U, *Nucl. Fusion* **45**, 1618-1627 (2005). Saibene, G. *et al.*, The influence of isotope mass, edge magnetic shear and input power on high density ELMy H modes in JET, *Nucl. Fusion* **39**, 1133-1156 (1999). Petrie, T.W., Kellman, A.G. and Mahdavi, M.Ali, Plasma density limits during ohmic L mode and elming H Mode operation in DIII-D, *Nucl. Fusion* , 929-952 (1993). The ITER physics basis, *Nucl. Fusion* **47**, S1-S413 (2007). Granetz, R.S., Density threshold for magnetohydrodynamic activity in Alcator C, *Phys. Rev. Lett.* **49**, 658-661 (1982). Lorenzini, R. *et al*, Self-organized helical equilibria as a new paradigm for ohmically heated fusion plasmas, *Nature Phys.* **5**, 570-574 (2009). Valisa, M. *et al.*, The Greenwald density limit in the Reversed Field Pinch, *IAEA-CN-116/EX/P4-13, 20th IAEA Fusion Energy Conference*, 1-6 November 2004, Vilamoura, Portugal. Goldston, R.J. and Rutherford, P.H., *Introduction to Plasma Physics*, Bristol, IOP Publishing (1995). Chandrasekhar, S., *Hydrodynamic and Hydromagnetic Stability*, Oxford, Clarendon Press (1961). Brillouin, L., A theorem of Larmor and its importance for electrons in magnetic fields, *Phys. Rev.* **67**, 260-266 (1945). Davidson, R.C., *Physics of Nonneutral Plasmas*, Redwood City, Addison–Wesley (1990). Boozer, A.H., What is a stellarator?, *Phys. Plasmas* **5**, 1647-1655 (1998).
|
Rubik Poised With Another Puzzle To Stump The World
November 9, 1986|By ROBERT CROSS, Chicago Tribune
CHICAGO -- In the beginning was the Cube, and after Erno Rubik put his name on it, he sold 100 million of them in the first three years of this decade. Patent pirates, knockoff artists and other plastic bandits of the manufacturing underworld sold another 50 million.
The famous puzzle proved to be a fine metaphor for the first part of this decade. Still shaking ourselves out of our `70s torpor, we could put our hands around a Rubik`s Cube and try to twist and turn its 26 cubes-within-the-Cube until the colors matched on all six sides.
That was difficult, of course, just as it was difficult to forget Watergate or to liberate hostages. Fittingly, perhaps, precious petroleum went into the Cube`s manufacture. And it offered a choice of configurations more staggering than the national debt: 43,252,003,274,489,856,000 to be exact. That`s roughly 43 quintillion ways to screw up, a futility potential exceeded not even by the Nixon and Carter administrations.
Erno Rubik stuffed a lot of Christmas stockings with frustration in the early `80s. Because of the personal wealth his Cube produced, Rubik also rose to a somewhat unusual status in his native Budapest, Hungary. He was -- and remains -- an Eastern bloc multimillionaire, an Iron Curtain capitalist, a Daddy Warbucks in the land of Lenin.
After the craze subsided, Rubik returned to his regular job as an instructor of architecture and design at the Budapest Academy of Applied Arts. The job had paid $200 a month when he left it to promote the Cube. By the time he returned to Hungary, he was making $30,000 a month from royalties, and his teaching salary became academic.
Now he is back again with another amusement, a $10 toy called Rubik`s Magic, which is a flat arrangement of eight plastic squares joined by a complicated arrangement of plastic filaments, or hinges, that permit the squares to be folded and flopped at 45 different angles. The squares are decorated with rainbow-hued rings, and the object, this time, is to make the rings form a chain. The bad news: When one ring is placed in position, others also move. The good news: Players can form new and surprising geometric shapes as they struggle along.
``The puzzle is something like a tanagram, a very old toy from the Far East,`` Rubik said. ``A tanagram is a square divided into five triangles, a square and a rhomboid, and you can arrange the shapes to form different kinds of shadow pictures. Rubik`s Magic is somewhat like that, but in three dimensions.
``The most exciting thing for me is structures. Nature itself is a structure, a complicated one. It contains elements, and they are connected. Rubik`s Magic is a special construction. All the pieces are jointed. You can open it a different way than you close it. See? I close it here this way, and I open it this way. This I am able to do all the time.``
As he talked in his enigmatic accent, Rubik flipped the squares and formed the outline of a fish, an A-frame structure, a miniature bench and ... a cube.
``One of the things I`m interested in most is applying new types of constructions,`` he said. ``New possibilities. Special effects. To make possible what seems impossible.``
Rubik, the 42-year-old son and namesake of a noted Hungarian designer of gliders, is the fulfillment of a press agent`s dream. Strangers might size him up as an exceptionally bright, small man with sandy hair and sharp features. But nooo. His publicity people, working on behalf of Matchbook International Inc., the Hong Kong-based manufacturer of Rubik`s Magic, insist the inventor is ``a cross between Julio Iglesias and Carl Sagan,`` a ``quirky, creative genius`` whose wardrobe (white sweater and tailored slacks that day) ``is more Miami Vice than Iron Curtain.``
Ten years ago, Rubik was a humble architecture instructor with only a few house designs to his credit. He devised the Cube as a way to show his students the principles of algebraic group theory, and the puzzle proved so enchanting he took the idea to Konsumex, the state trading company. Konsumex introduced it to the small (population 10 million) Hungarian market in 1977 and sold two million Cubes within five years. Ideal Toy Co. brought the cube to the rest of the world, making Rubik -- and several copycats -- instant millionaires.
``At that time, the problem was that nobody was prepared for such a success,`` Rubik said. ``It was a surprise not just for me but for the toy market, the sellers, the buyers, for everyone. It was a real big explosion, and if you are not prepared for that, you get troubles. Many manufacturers made illegal knockoffs. Today we are prepared to stop those activities. We have a very strong legal position. Magic is patented worldwide, and Matchbox is able to manufacture it in satisfactory quantities for market needs. I can say we are ready for success.`` |
The present invention relates to devices providing visual indication of elapsed and ongoing values and parameters of a moving object such as speed, distance traveled, engine rotation, oil pressure, fuel reading, satellite navigational map readings as well as various warnings. The device is intended for usage on various types of automobiles and other vehicles including military transports used on the ground, air or water and require human interaction. The principal difference of the present invention is as follows: Vehicular data as mentioned above and that is formulated within driver's line of sight is displayed via collimated means. The shape, size and the color spectrum of the presented data is derived from the 2 primary direction positions of the driver's view: the dashboard or the outside environment. Display mode adjustments are fully automatic and are derived from the direction of the driver's view by tracking positioning of the eyeballs at any given moment.
The conception for the suggested multifunctional collimator indicator is necessitated by the need to augment safety measures as well as lower psychophysical strain levels relating to operating motor vehicles and other moving objects. For instance, operating an automobile at high speeds and/or under severe traffic conditions.
At this time, a number of high end models of selected car manufacturers such as Cadillac and BMW are equipped with some or all of the 3 types of gauges and indicators listed below: Traditional needle type or digital indicators mounted inside the dashboard behind the steering wheel. Navigation System display screen, usually mounted in the center of the dashboard on the symmetrical axis of a given vehicle. Heads-Up windshield indicators that are positioned above or “behind” the vehicle's dashboard and which on the background of an outside environment project into “infinity” graphical monochrome (commonly green or orange colored) display of selected critical parameters of a moving vehicle. The vertical optical axis of the indicator also passes through the axis of a steering wheel and is directed at a point located on the same level as the driver's eyes.
The gauges that are positioned inside the dashboard are standard and usually vary from one another only by design, color and sizes. Regardless of the vehicle's type and size, the distance between the driver's eyes and gauges is constant with only minimal variations dictated by driver's height and seat positioning.
The navigation system display is positioned on the vehicular axis of symmetry usually in the middle or upper portions of the dashboard. In order to obtain readings, this setup requires a head movement in the direction of the navigational display by the driver. While engaged in the activity of obtaining updated reading off the navigational display, the driver's ability to track the ever changing conditions of the outside environment is limited only to peripheral vision which severely handicaps one's judgment, especially in extreme conditions.
The quality of the display from the traditional gauges and the satellite navigational screens is greatly affected by the lighting factors of the external and internal environments. One of the most challenging conditions for obtaining quality readings pertains to convertible automobiles. In these autos, the quality of the reading acquisition process from vehicular gauges and navigational displays is directly subjected to the intensity of direct sunlight, causing hardship in obtaining quality and timely readings. The usage of sunshields on the gauges helps however does not serve as a solution to the problem.
The glance shifting of the eyes between the outside environment, vehicular gauges, and the satellite navigational map requires constant accommodations and readjustments of the eyes which subsequently dictates a certain delay. The significant valid differentiation factors in lighting conditions inside and outside of the vehicle causes further significant time delay in visual eye adjustments. The above stated factors subsequently influence the driver's overall state, judgment and reactions, by so causing decline in safety of the vehicle's operability, especially under severe conditions.
Thus, the combined presences of the 3 above stated independent visual sources of information, located in different places inside a vehicle varying in operation, functionality, design and that are intended to facilitate safe operability of a motor vehicle, in actuality worsen a number overall safety factors.
The conducted patent search has shown that devices closest to the present invention by structural design are disclosed in U.S. Pat. Nos. 5,497,271, 6,443,573 and 5,734,357, the last disclosing a method of tracking eyeball positioning.
A device disclosed in U.S. Pat. No. 5,497,271 stated above consists of an image formulator in place of a standardized dashboard, as well as a heads-up projection system used to display the generated image onto the windshield and consists of a semitransparent mirror and a lens. Depending on environmental conditions, the driver has the option to either visually follow the gauge readings directly from the image formulated in place of a standard dashboard with the help of a semitransparent mirror, or its optically generated equivalent which is reflected off the windshield of a vehicle and is projected onto the external environment “behind” the windshield.A device disclosed in U.S. Pat. No. 6,443,573 is comprised of two image formulating channels, the low channel (direct line of sight) as well as the top channel (on the windshield), and each containing an independent visualizing element. The utilization of the low channel provides the driver with the ability to view the non-collimated data that is being reflected off a mirror. The top channel is equipped with a rotational dual positioned semi-reflective flat mirror as well as a secondary flat reflecting mirror with an adhesive Fresnel Lens. The implementation of the above listed components allows for a dual stage top channel image formulation. First stage is a short distance image display (via direct reflection off the mirror) and where the second stage is a long distance image display by utilizing collimation via means of the Fresnel Lens. The device disclosed in U.S. Pat. No. 5,734,357 is listed as a reference relating to a method of tracking driver's pupil movement.
The device as disclosed in U.S. Pat. No. 5,497,271 contains two conceptual shortcomings: With the mirror engaged and projecting onto the windshield, the displayed data is identical to that displayed on the dashboard. This places significant limits on size and shape of the projected data considering generally acceptable principles governing graphical data projection. For instance, the windshield projection of gauges and/or navigational map is not practical as the overabundance of images displayed onto the windshield can interfere with driver's awareness of the external environment which subsequently can contribute to a hazardous condition. The usage of a semitransparent mirror providing the ability for visual tracking of data projected onto the windshield simultaneously with the identical image formulated on the dashboard significantly diminishes the brightness of both displays in turn negatively affecting the contrast of both displays, especially in highly illuminated external environments such as direct sunlight, tunnels and garages.The device disclosed in U.S. Pat. No. 6,443,573 also consists of the following identified major shortcomings: Image collimation only occurs on the top channel (the windshield) and only in a single position of the rotating semi-transparent mirror. The second position provides close distance image formulation with no collimation. Introduction of a semi-transparent mirror in the optical system of the top channel causes decreased brightness levels in the non-collimated display mode by approximately two times while brightness levels in the collimated display mode are decreased approximately quad-fold The low channel imaging is displayed via means of being reflected off a flat mirror with no collimation which effectively contradicts a set goal where all image formulation has to utilize collimated display.The device disclosed in U.S. Pat. No. 5,734,357 utilizes and infrared system to track positioning of the driver's pupils in which the source of the infrared light is located on the dashboard, and where the receiving camera is built into the optical system of the indicator. The suggested system is once again unreasonably overcomplicated and possesses low sensitivity due to significant light loss while passing through the optical system of the device.
The disclosed multifunctional collimator indicator allows to fully mitigate and/or significantly minimize the above stated shortcomings with respect to safe operation of an automobile and others including but not limited to motor vehicles, vessels and aircrafts. Simultaneously, the invention presents the operator with an array of visual information such as: Virtual display of standardized needle style gauges and/or other digital indicators. Display of a navigational map inside the traditional dashboard located in front of the driver as opposed to midsection of the dashboard. Display of relevant individual parameters of a moving vehicle on the windshield. Display of warning and other mnemonic signals in place of a standard dashboard as well as projecting them onto a windshield. |
The Times and The Sunday Times and carefully selected third parties use cookies on this site to improve performance, for analytics and for advertising. By browsing this site you are agreeing to this. For more information see our Privacy and Cookie policy.
Accessibility Links
Prufrock: Rose looking to branch out
But evidently Rose, whose £1.25 billion bid with private-equity firm Permira for the Debenhams department-store chain is hanging in the balance this weekend, has other strings to his bow.
As if working on one of the highest-profile takeover battles was not enough to be getting on with, Rose has recently joined the board of Image Restaurants, the privately owned company set up by Christopher Bodker that is behind such fashionable central London dining establishments as Circus, West Street and Avenue.
Rose has long been a backer of the group but has only recently become a director.
It echoes an earlier, similar expansion of responsibilities at another private company Rose has backed, Laserthor, which developed a system for clearing leaves off railway lines. |
There's an app for that: Must-haves for Lowcountry booklovers
Submitted by Anonymous on Wed, 08/21/2013 - 12:12pm
In our fast-paced, high-tech, super-sized society, apps on mobile devices keep busy Americans in the know while they're on the go. In a recent report ("Smartphone Ownership 2013") Pew Research Center's Internet & American Life Project estimates that 56 percent of all American adults own and use smartphones. Similarly, Pew's "Tablet Ownership 2013" report finds that a third of American adults say they own a tablet computer.
With more than half the population using mobile devices, the app marketplace is teeming with apps for nearly every interest imaginable. From book reviews to recipe instructions and fitness trackers to news feeds, mobile apps literally deliver information resources wherever you go.
APPS FOR eBooks
Ever increasing in popularity, eBooks continue to be a top request. Popular eBook apps such as Kindle, Nook, and iBooks offer limited selection of free eBooks. For the eBook user searching for eBooks to download at no charge, there are several apps from which to choose.
With an active library card, Beaufort County residents have access to titles within the 3M Cloud Library app. Once registered with a username and password, users may browse and download the available eBooks for free through the 3M Cloud Library app or the 3M Cloud Library website.
For iPad users, ICDL free eBooks for children offers a collection of international children's literature for free. Supported by the University of Maryland's Human-Computer Interaction Lab and the International Children's Digital Library Foundation, ICDL free eBooks for children hosts thousands of children's books from across the globe.
By definition, the term "fan fiction" applies to stories about characters or settings from literature, movies and television shows written by fans rather than by the original creator. The FanFiction app brings the content of www.fanfiction.net, the Internet's largest and most popular fan fiction website, to your mobile device.
Teens, parents, educators and librarians can benefit from the expertise of YALSA (Young Adult Library Services Association) book recommendations for teen readers. As an added bonus, their "Find it!" feature shows where specific titles are in a nearby library.
Enjoy picking up a printed copy of BookPage every month at your library? With the BookPage app, every issue is delivered straight to your mobile device. Browse monthly book reviews, author interviews and feature articles on your device at anytime from anywhere.
APPS RELATED TO BEAUFORT COUNTY LIBRARY ONLINE RESOURCES
Librarians have long proclaimed that a library is much more than a building stocked with books. Several Beaufort County library online resources also offer apps for mobile computing.
Beaufort County library members may browse, check out, and download titles within the OneClick Digital audiobook collection at no charge. The app allows users to browse and download OneClick Digital audiobooks directly to their device without needing to transfer from a computer. To use the app, interested users will need to set up an account with OneClick Digital from the Beaufort County library's audiobook website.
Take language learning on the go with the BYKI mobile app by Transparent Language. Many Beaufort County library cardholders have already registered to use Before You Know It language learning web portal, a free, online language learning program. To download the mobile app, first log into the BYKI website and click "Go Mobile" on the menu bar. Follow the on-screen prompts to get a code for downloading the app. |
Influence of fish on the bioavailability of plant iron in the anemic rat.
The effect of fish protein and fish oil on the utilization of endogenous iron in wheat bran, spinach and soy protein isolate was investigated by using the anemic rat as an animal model. Marine products were substituted for casein and corn oil in the diets of these animals. Hemoglobin regeneration was one criteria used to measure iron uptake. Relative biological values (RBV) were computed from a regression equation obtained from control animals receiving graded levels of FeSO4 X 7H2O. The RBV of iron from plant sources provided in diets containing casein-corn oil versus fish-fish oil were: wheat bran, 123 vs. 111%; spinach, 53 vs. 49%; and soybean isolate, 84 vs. 67%; RBV FeSO4 = 100%. These changes were not significant. The decreases in iron absorption from diets containing marine products was attributed to the fish oil. Absorption of exogenous iron (59Fe) was measured in the same animals after the 14-day repletion period. Assimilation of the 59Fe was highly correlated (r2 = 0.958) with hemoglobin level at time of dosing. Diet composition did not appear to have the same effect on the percentage of 59Fe retained after 110 hours by the rat as compared to levels of hemoglobin regeneration (i.e., RBV). A "meat factor" effect was not shown by substituting fish for casein the diets containing plant iron sources fed anemic rats. |
664 P.2d 382 (1983)
Nona McCARROLL and Vernis McCARROLL, Appellants,
v.
DOCTORS GENERAL HOSPITAL, a corporation, Appellee.
No. 55893.
Supreme Court of Oklahoma.
May 10, 1983.
Rehearing Denied June 14, 1983.
James B. Browne, Oklahoma City, for appellants.
Stephen Peterson, Bana B. Blasdel, Fenton, Fenton, Smith, Reneau & Moon, Oklahoma City, for appellee.
*383 LAVENDER, Justice:
This is an appeal from an order of the trial court which granted summary judgment in favor of Appellee, Doctors General Hospital, by reason of the bar of 76 O.S. 1981, § 18.
Plaintiffs below brought suit in the district court against Dr. H., Lincoln Medical Center, Inc., neither of whom are parties to this appeal, and Doctors General Hospital for medical malpractice.
The suit was commenced on December 27, 1977. The petition alleges that on July 28, 1975, plaintiff, Nona McCarroll, underwent surgery for the repair of a hernia at Doctors General Hospital. In the course of the surgery performed by Dr. H., it is alleged that he negligently severed a femoral artery under the mistaken impression that it was the saphenous vein. On the day of the operation, Nona was transferred to the care of another physician who transferred her to Presbyterian Hospital to correct and repair her condition, and there she underwent surgeries, including successive amputations of her leg.
The allegations of malpractice directed against Doctors General Hospital are that it, through its agents:
1. Improperly draped Nona, thereby allowing Dr. H. to undertake improper surgical procedure;
2. Secured an admission form and consent to operate from Nona, but wholly and totally failed to warn her of the dangers inherent in the surgical procedure and thereby failed to secure proper informed consent to the surgical procedure; and
3. Engaged in improper follow up care, failed to secure adequate care and treatment for Nona by not watching her properly in the recovery area, failed to learn of her condition and her injury from the surgery within a reasonable time, and failed to notify a physician that Nona was having additional medical problems, in that she was in great pain and her leg was turning cold, within a reasonable time.
It is only the constitutionality and applicability of 76 O.S. 1981, § 18 to the case at bar which is here presented on appeal.
I.
This appeal involves only the hospital for its alleged negligent acts it is said to have committed separate and apart from the negligent act of Dr. H. in severing plaintiff's femoral artery. Under the circumstances in this case, the act of Dr. H. in allegedly concealing from the plaintiff his, *384 Dr. H.'s, negligence would not be imputable to the hospital absent proof of agency (of which there was none). See 51 Am.Jur.2d Limitations of Actions, § 150. However, as we view 76 O.S. 1981, § 18, the question here is not whether the hospital concealed from the plaintiff its acts of alleged negligence so as to extend the limitations period, but whether, under the record, there remains a question of fact as to when the plaintiff "knew or should have known, through the exercise of reasonable diligence, of the existence of the ... injury or condition complained of," within the terms of § 18. Thus, the concealment by Dr. H. of his alleged negligence in severing plaintiff's femoral artery would be admissible only to explain why plaintiff did not learn of her injury or should not have learned of it until much later. Was the plaintiff excused by such concealment from making reasonable efforts to ascertain whether she had been injured by the failure of the hospital to render to her adequate follow-up care? We deem this question to be for the jury.[1] Our discussion follows.
The rule on review of a trial court's ruling on a motion for summary judgment is as expressed in Weaver v. Pryor Jeffersonian, Okl., 569 P.2d 967 (1977): "[A]ll inferences and conclusions to be drawn from underlying facts contained in such materials as affidavits, admissions, depositions, pleadings, exhibits and the like, must be viewed in light most favorable to party opposing the motion." With that rule in mind, we have reviewed such materials as appear in the record before us and are unable to agree with the trial court that the only reasonable inference to be drawn therefrom is that plaintiff either learned or should have learned of the hospital's negligence more than two years before she filed her action.
The record discloses that Nona entered defendant hospital for hernia surgery to be performed by Dr. H. Upon regaining consciousness, she discovered that she was in Presbyterian Hospital. Upon inquiring why she was there, she was told to ask Dr. H. After she was released from Presbyterian Hospital, and approximately three or four months following the hernia surgery, Nona went to see Dr. H. because she was having difficulties with her left foot and leg. Her foot was dropped, her toes were curled, and her heel was abnormal. Dr. H. told her that her condition was due to old age and hardening of the arteries. Nona did not seek to confirm Dr. H.'s expressed opinion because, as she stated, he was her doctor and she had confidence in him. Around October 1975, Nona consulted with Ed Smith, an attorney, regarding a dispute which she had with her medical insurance company over payment of medical bills, and on October 31, 1975, she signed a medical release to enable him to secure her medical records and secured her permission to engage the services of James B. Browne, another attorney, to assist him. Upon examination of the medical records, Browne advised Smith of the possibility of a medical negligence claim and recommended that the records be submitted to qualified medical personnel to determine whether a medical negligence claim existed. On February 6, 1976, Browne advised Smith that in his opinion a claim for medical negligence existed, and within two years thereafter, this suit was filed.
A part of the hospital medical records pertaining to Nona is an Operation Record dated July 28, 1975, signed by Dr. H. which states in part:
"What was done: Exploration inguinal area.
"An oblique incision was made in the inguinal area, bleeders were treated by *385 ligating them with 00 plain. The inguinal area was explored. The saphenous vein was dissected out. It looked like it was clotting and we clamped it and removed a portion of it and it turned out to be the femoral artery located close to the surface."
The foregoing summation demonstrates that, at the time the court below sustained defendant's motion for summary judgment, there was an unresolved question of fact to be determined by the jury as to whether Nona knew or should have known, through the exercise of reasonable diligence, of the existence of the injury or condition complained of within two years prior to December 27, 1977, the date this action was commenced.
II.
We next consider when, under the provisions of 76 O.S. 1981, § 18, the limitations therein set forth begins to run. Reduced to its essence for the purpose of resolving this issue, § 18 provides:
"An action for damages for injury or death ... shall be brought within two (2) years of the date the plaintiff knew, or should have known, through the exercise of reasonable diligence, of the existence of the death, injury or condition complained of; ...."
Section 18 does not purport to create a new cause of action. It operates as a limitation upon existing rights of action. There is not, nor can there be, a cause of action for death, injury or condition unless the death, injury or condition is wrongful. Thus, the element of wrongfulness by necessary implication is an integral and inseparable part of the "action" referred to. Likewise, it is the wrongful "death, injury or condition complained of," the existence of which the plaintiff "knew, or should have known, through the exercise of reasonable diligence" which triggers the running of the limitations in § 18. Therefore, the statute begins to run from the date when the plaintiff knew, or should have known, through the exercise of reasonable diligence of the wrongful injury complained of.
III.
The plaintiffs attack the constitutionality of 76 O.S. 1981, § 18 on three grounds: (a) it denies similarly situated persons equal protection of the law in violation of Amendment XIV § 1 of the United States Constitution; (b) it is a special statute of limitations, in violation of the Oklahoma Constitution, Art. V § 46; and (c) it confers special immunities upon members of the medical profession, in violation of the Oklahoma Constitution, Art. V § 51. Plaintiffs further assert that even if the statute withstands the constitutional assault, its application to the case at bar requires that it bear prospectively and runs beginning with the effective date of the statute and that the action is therefore timely brought.
Title 76 O.S. 1981, § 18 provides:
"An action for damages for injury or death against any physician, health care provider or hospital licensed under the laws of this state, whether based in tort, breach of contract or otherwise, arising out of patient care, shall be brought with in two (2) years of the date the plaintiff knew or should have known, through the exercise of reasonable diligence, of the existence of the death, injury or condition complained of; provided any action brought more than three (3) years from the date of the injury shall be limited to actual medical and surgical expenses incurred or to be incurred as a direct result of said injury, provided, however, the minority or incompetency when the cause of action arises will extend said period of limitation." (Emphasis added.)
It is only the emphasized portion of the statute which is here at issue.
We express no view as to the constitutionality of that portion of the above statute which is not emphasized.
Under Art. V § 51 of the Oklahoma Constitution, the Legislature is forbidden from creating special legislation that grants any association, corporation or individual any exclusive rights, privileges, or immunities within this State.
Art. V § 46 of the Oklahoma Constitution provides, insofar as pertinent:
*386 "The Legislature shall not, except as otherwise provided in this Constitution, pass any local or special law authorizing:
* * * * * *
[For] limitation of civil or criminal actions; * * *."
The Fourteenth Amendment to the United States Constitution provides, in pertinent part:
"No State shall ... deny to any person within its jurisdiction the equal protection of the laws."
This Court recognized in Loyal Order of the Moose, Lodge 1785 v. Cavaness[2] that the Legislature has wide latitude to create statutory classifications, but to withstand constitutional scrutiny, we held that any discrimination must withstand important legislative objectives and above all be reasonable. There the Court struck down a statute which imposed a time limitation upon a right of action against an architect, builder, contractor or "any person performing or furnishing the design, planning, supervision or observation of construction or construction of such an improvement," not because of the grouping of like callings into a class for special legislative treatment, but because of the omission from the group of owners and tenants, the omission of whom did not rest upon some reasonable consideration of differences between owners and tenants on the one hand, and those specifically included within the legislatively created class on the other hand, which differences bore a fair and substantial relation to the object of the legislation. The Court further said: "Nor is the classification founded upon a reasonable distinction or difference necessitated by state policy. A statute making such an unsupportable classification fails to meet the requirements of the equal protection guaranty."
The case before us is distinguishable from Cavaness in that here it is the legislative grouping of health care providers into a class for special legislative treatment, and not the omission of certain health care providers from the class that is constitutionally challenged. Thus a clear distinction is drawn.[3]
The constitutional powers and limitations of state legislatures to classify like businesses or callings for special legislative treatment is summarized in 16A Am Jur 2d, Constitutional Law § 775 in the following language:
"Since the establishment of regulations of a particular trade or business essential to the public health and safety is within the legislative capacity of the state in the exercise of its police power, the classification of the subjects of such legislation, so long as it has a reasonable basis and is not merely an arbitrary selection without real difference between the subjects included and those omitted from the law, does not deny to any person the equal protection of the laws. Legislation affecting alike all persons pursuing the same business under the same conditions is not class legislation. Classification of employees' occupations by statute may be based not only on the character of the employees, but on the nature of the employment; and a statute dealing with employees in a particular line of business does not effect arbitrary discrimination merely because operation of the statute is not extended to other lines of business having their own circumstances and conditions. But if some persons engaged in a calling or business are subjected to special burdens or favored by special privileges while other persons engaged in the same calling or business are not so treated, the legislation is based upon unconstitutional discrimination.
"It is primarily for the state to select the kinds of business which shall be the subject of regulation. The legislature has wide discretion, and, as in other cases, legislative discretion in the matter of classification of businesses is not subject to judicial review unless such discretion appears to have been exercised arbitrarily and without any show of good reason. *387 And the general rule that the legislature, dealing with practical exigencies and guided by experience, may make classifications without including all cases which it might possibly reach, is free to recognize degrees of harm, and may confine its restrictions to those classes of cases where the need is deemed to be greatest, is applicable to classifications of occupations. There is no prohibition in the Federal Constitution against a state making different regulations for different kinds of businesses or occupations. If a business is subject to regulation by the state, specific regulations for that one kind of business, which may be necessary for the protection of the public, can never constitute a just ground of complaint because similar restrictions are not imposed upon another business of a different kind."[4]
We hold that the classification of health care providers for the purpose of legislatively limiting the time within which an action against them may be brought, as set forth in 76 O.S. 1981, § 18, has not been shown to be such an arbitrary exercise of legislative discretion or without any show of good cause as would impel this Court to declare it unconstitutional. The statute is not unconstitutional.
Title 76 O.S. 1981, § 18 was effective April 8, 1976. It is well established in this jurisdiction that a statute of limitations, insofar as it affects rights of action in existence, when the statute is passed, shall be held, in the absence of a contrary provision in the legislation, to begin when the cause of action was first subjected to its operation. Magnolia Petroleum Co. v. Watkins, 177 Okl. 30, 57 P.2d 622 (1936).[5] Taking the materials submitted in support of the motion for summary judgment in the light most favorable to plaintiff, she did not learn and was unable to discover with reasonable diligence the existence of the injuries for which she sought compensation until February 6, 1976. Assuming that to be the case under 76 O.S. 1981, § 18, she had two years from February 6, 1976, within which to bring this action. It was filed, as we have already noted, on December 27, 1977. If the factual disputes regarding when plaintiff knew or should have learned of her injuries are resolved by the jury in the plaintiff's favor, this action was timely brought.
Judgment reversed and cause remanded with directions to proceed further consistent with the views herein expressed.
BARNES, C.J., and IRWIN, HODGES and DOOLIN, JJ., concur.
SIMMS, V.C.J., and OPALA and WILSON, JJ., concur in part and dissent in part.
HARGRAVE, J., did not participate.
NOTES
[1] In Flowers v. Stanley, Okl., 316 P.2d 840 (1957), we held that where the period of limitations starts when the claimant knew, or, in the exercise of reasonable diligence would have discovered the act which gives rise to the claim, the beginning of the running of the statute of limitations is usually to be determined from the facts and circumstances of the particular case; and, where these are such that reasonable men might reach conflicting opinions thereon, the issue is a question for determination by the trier of facts. Accord, H.F. Wilcox Oil & Gas Co. v. Juedeman, 187 Okl. 382, 101 P.2d 1050 (1940); Harper-Turner Oil Co. v. Bridge, Okl., 311 P.2d 947 (1957); Perkins v. U.S., (D.C.Okl. 1976), 76 F.R.D. 590.
[2] Okl., 563 P.2d 143 (1977).
[3] See 16A Am Jur 2d Constitutional Law § 757.
[4] Accord, see Norton Johnson Buick Co. v. Lindley, 173 Okl. 93, 46 P.2d 525 (1935).
[5] See also, Graner Const. Co. v. Brandt, 180 Okl. 221, 68 P.2d 788 (1937); Ford Motor Co. v. McDonald, 183 Okl. 130, 90 P.2d 404 (1939); State v. Eddie, 195 Okl. 26, 154 P.2d 763 (1945); Gasteam Radiator Co. v. United States F. & G. Co., Okl., 471 P.2d 883 (1970); Midcontinent Casualty Co. v. P & H Supply, Inc., Okl., 490 P.2d 1358 (1971). Although no contention is seriously argued that the new statute of limitation unreasonably shortened the time within which Mrs. McCarroll could bring her action and therefore the previous statute should have been applied, we notice that it is within the power of the Legislature to pass a statute of limitations, or to change the period of limitations previously fixed, and to make such statute or changes applicable to existing (but not yet filed) causes of action, provided a reasonable time is given by the new law for the commencement of suit before the bar takes effect. 51 Am.Jur.2d Limitations of Actions § 57; City of Claremore v. Oklahoma Tax Commission, 197 Okl. 223, 169 P.2d 299, 304 (1946); Baccus v. Banks, 199 Okl. 647, 192 P.2d 683 (1948), app. dismd.; Reeder v. Banks, 333 U.S. 858, 68 S.Ct. 743, 92 L.Ed. 1138.
|
Q:
Not all homogeneous manifolds are on the form $G/H$
Since the (holomorphic) automorphism group of the 2-dimensional ball $B^2\\subset \\mathbb C^2$ acts transitively on $B^2$. Then $B^2$ is a homogeneous space. Can we write $B^2$ as a quotient of a (complex) lie group and a closed subgroup $G/H$?
A:
There are two ways to interpret your question:
Is there a Lie subgroup $G< Aut(B^2)$ such that $G$ admits a complex structure, for which the action $G\\times B^2\\to B^2$ is holomorphic and transitive.
Is there a Lie subgroup $G< Aut(B^2)$ such that $G$ admits a complex structure and for which the action $G\\times B^2\\to B^2$ is transitive.
Both questions have negative answer. For the first question, more generally, it is easy to prove (using Liouville's theorem) that:
If $X$ is a bounded domain in ${\\mathbb C}^n$ and $G\\times X\\to X$ is a holomorphic action of a connected complex Lie group, then this action is trivial: $gx=x$ for all $g\\in G, x\\in X$. In particular, a holomorphic action is never transitive on $X$.
For the second question the proof is less than illuminating, it is based on an analysis of connected Lie subgroups of $PU(2,1)$: One first proves that if a connected subgroup admits a complex structure and acts transitively on $B^2$ then this subgroup is solvable. (Use Levi-Malcev theorem.) Then one eliminates solvable subgroups because only one of them has even real dimension $\\ge 4$ dimensional and its abelianization is real 1-dimensional, hence, such a subgroup cannot be isomorphic to a complex Lie group. A similar argument applies to $B^n, n\\ge 1$.
|
'Mi-Va-Mi' on Serious Eats
Though not by any means a quintessentially Parisian food, falafel sandwiches from the hip Paris neighborhood known as the Marais have become a must-eat tourist destination. No wonder—not only is falafel one of the best foods ever invented, but these messy pita sandwiches are a key opportunity to eat on the Paris street without garnering dirty looks from the locals. But which falafel place should you choose? There are three famous options within a block of each other, and serious falafel eaters have strong opinions about which one is the best. Here are the options. L'As du Falafel Paris's most famous falafel joint, this restaurant is item number two on David Lebovitz's list of 10 Insanely Delicious Things You Shouldn't... More |
Child of the Rebellion: West Virginia Sesquicentennial
Civil War Union Militia Correspondence
Coalsmouth
Kanawha County, West Va
April 14, 1864
Lt. Col Joseph Darr Jr.
Dear Sir
Gen George Boyer sugested [sic] to me the propriety of informing you of the following facts i.e.
That I have a Co of state troops at this place and that Hezekiah Turley aged 21 Enlisted Jan 1st 1864. Resident in this Co.. Left on 25 of march and William Epling aged 17 Enlisted Jan 10 and left March 25, and also Milton Adkins aged 17 Same dates and Cumberland Jones aged 16 “ “ and Richard Roberts Enlisted Feb 2nd and left March 25. All indebted for cloathing [sic] to the state , and none of them are credited to to Kanawha , But to Putnam County, where a larger Bounty is given, also Adison Childress aged 18 and William Childress aged 18 Enlisted Jan 27 and Asbury Pauley 16 years old these left Aprill [sic] 9 all Born and Raised in this County and never was in Jackson, in theyer [sic] lives yet theyer [sic] Master is made to show that they Enlisted from that county and theyer [sic] enlistment is dated back in March. These are all in debt to the State for Clothing Tab
I make the points, They had voluntarily sworn into state service one year. Can they while debt to the state swear out, without consent of the state. They are under the proper age to be recruited are they not a fraid [sic] of the Government. Theyer [sic] enlistment is dated back and the large bounty and one or two months waged claimed from the U.S. and they on wages in the State Service as my Books must show is not these false musters and frauds and is not the false Representation as to theyer [sic] citizenship also a fraud on countys and false muster. (Hezekiah Turley is Ruptured)
All of which is Respectfully submitted at the Sugestion [sic] of the Gen. as above stated
I am youre [sic] most obedient servant
R Brooks Capt. State Troops
Cloathing [sic] Bill \\
H Turley:
1 great coat,
1 blanket,
1 sack coat lined,
1 par [sic] pants,
2 shirts,
2 “ drawers,
1 hat,
1” shoes
William Epling:
1 great Coat,
1 blanket,
1 s coat lined,
1 shirt,
1 par [sic] pants,
1 hat
2 “ shoes,
M Adkin:
1 Gr. Coat,
1 blanket,
1 S coat lined,
1 par [sic] pants
2 shirts,
2” draws,
1 pr shoes,
1 Hat
C Jones:
1 Gr. Coat,
1 Blanket,
1 S coat liner,
1 pr. Pants,
2 shirts,
2” draws
1 Hat,
1” shoes
A Childes:
1 Gr. Coat,
1 blanket,
1 s coat lined,
2 pr shoes,
2 shirts,
2 “draws,
1 Hat,
1” pants
1 [?] shirt,
William L. Childes:
1 Grt Coat,
1 Blanket,
1 s coat lined,
2 pr shoes,
2 shirts,
2” draws,
1 Hat,
1 “ pants
1 Mix &shirt,
R Roberts:
1 Great Coat,
1 Blanket,
1 coat lined,
1 pr pants,
2 shirts,
1 “shoes ,
1 Hat,
2”draws
Asbury Pauley:
1 Grt. Coat,
1 Blanket,
1 s coat lined,
1 pr pants,
2 shirts,
2 “ draws
1 [?] shirt,
R Brooks
Transcription by Jack Stephenson, undergraduate student enrolled in Dr. Billy Joe Peyton’s Fall 2010 “Introduction to Public History” at West Virginia State University |
Sub menu
Tag: Sloper
By Lindsay Carey Staff Writer A YMCA worker made a huge difference in the life of a struggling Southington woman 42 years ago and now she is paying it back by donating $5,000 to the Southington YMCA’s Camp Sloper. After…
By Ed Harris, Editor Campers at Southington YMCA Camp Sloper recently Cha Cha slid there way into exercise. DJ Casper, birth name Willie Perry, the creator of the Cha Cha Slide, visited Sloper as part of week long tour of…
By Ed Harris Editor The skatepark at YMCA Camp Sloper is open only once a month this year, due to budget issues. “Being the sole funder, we are assuming all the maintenance and staff costs for the program, which has…
By Ed Harris Editor The Southington YMCA held its Annual Campaign Kick-Off Breakfast last week, with speakers highlighting the good that the YMCA has done in their lives. Albert Stavidlo shared his story on how YMCA staff helped save his…
By Lisa Capobianco Staff Writer Members of the community jumped into the frigid waters of Sloper’s Pond during Southington YMCA’s ninth annual Polar Plunge—all for a good cause. Transforming into one of Southington’s most popular fundraisers, the Polar Plunge event…
By Ed Harris Editor Southington YMCA officials are planning a Storm Sloper Trails Challenge for early next year. The race is billed as being part run, part obstacle course and part scavenger hunt. “It is very much like a Warrior…
By John Goralski Sports Writer Parents and boosters huddle around gas grills at the edge of the pavilion, while groups of athletes stroll around the field in a wash of fall colors. On Friday, Sept. 27, YMCA Camp Sloper looked…
By John Goralski Sports Writer Lauren Perkowski emerged from the woods in a sea of red jerseys and elbowed for position as they wound their way down one of the course’s steep hills. Her teammate, Sean Garrison, had already prevailed…
By Lisa Capobianco Staff Writer With the lost of the SOAR program last May due to budget cuts, the Southington School District decided to devote its time over the summer to creating a new enrichment opportunity for gifted and talented…
By Lisa Capobianco Staff Writer What started out as a cleanup day in a basement turned into an excavation site for Meriden resident Shawn Hard. About four years ago, Hard was cleaning up the basement of his home on Reservoir… |
// RUN: rm -rf %t
// RUN: %clang_cc1 -fmodules -fimplicit-module-maps -x objective-c -verify -fmodules-cache-path=%t -I %S/Inputs %s
// RUN: %clang_cc1 -fmodules -fimplicit-module-maps -x objective-c -verify -fmodules-cache-path=%t -I %S/Inputs %s -DALT
// RUN: %clang_cc1 -fmodules -fimplicit-module-maps -x objective-c -verify -fmodules-cache-path=%t -I %S/Inputs %s -detailed-preprocessing-record
// RUN: not %clang_cc1 -E -fmodules -fimplicit-module-maps -x objective-c -fmodules-cache-path=%t -I %S/Inputs %s | FileCheck -check-prefix CHECK-PREPROCESSED %s
//
// RUN: %clang_cc1 -fmodules -fimplicit-module-maps -x objective-c++ -verify -fmodules-cache-path=%t -I %S/Inputs %s
// RUN: %clang_cc1 -fmodules -fimplicit-module-maps -x objective-c++ -verify -fmodules-cache-path=%t -I %S/Inputs %s -DALT
// RUN: %clang_cc1 -fmodules -fimplicit-module-maps -x objective-c++ -verify -fmodules-cache-path=%t -I %S/Inputs %s -detailed-preprocessing-record
// RUN: not %clang_cc1 -E -fmodules -fimplicit-module-maps -x objective-c++ -fmodules-cache-path=%t -I %S/Inputs %s | FileCheck -check-prefix CHECK-PREPROCESSED %s
//
// RUN: %clang_cc1 -fmodules -fimplicit-module-maps -DLOCAL_VISIBILITY -fmodules-local-submodule-visibility -x objective-c++ -verify -fmodules-cache-path=%t -I %S/Inputs %s
// FIXME: When we have a syntax for modules in C, use that.
// These notes come from headers in modules, and are bogus.
// FIXME: expected-note@Inputs/macros_left.h:11{{previous definition is here}}
// FIXME: expected-note@Inputs/macros_right.h:12{{previous definition is here}}
// expected-note@Inputs/macros_right.h:12{{expanding this definition of 'LEFT_RIGHT_DIFFERENT'}}
// expected-note@Inputs/macros_right.h:13{{expanding this definition of 'LEFT_RIGHT_DIFFERENT2'}}
// expected-note@Inputs/macros_left.h:14{{other definition of 'LEFT_RIGHT_DIFFERENT'}}
@import macros;
#ifndef INTEGER
# error INTEGER macro should be visible
#endif
#ifdef FLOAT
# error FLOAT macro should not be visible
#endif
#ifdef MODULE
# error MODULE macro should not be visible
#endif
#ifndef INDIRECTLY_IN_MACROS
# error INDIRECTLY_IN_MACROS should be visible
#endif
// CHECK-PREPROCESSED: double d
double d;
DOUBLE *dp = &d;
#__public_macro WIBBLE // expected-error{{no macro named 'WIBBLE'}}
void f() {
// CHECK-PREPROCESSED: int i = INTEGER;
int i = INTEGER; // the value was exported, the macro was not.
i += macros; // expanded from __MODULE__ within the 'macros' module.
}
#ifdef __MODULE__
# error Not building a module!
#endif
#if __building_module(macros)
# error Not building a module
#endif
// None of the modules we depend on have been imported, and therefore
// their macros should not be visible.
#ifdef LEFT
# error LEFT should not be visible
#endif
#ifdef RIGHT
# error RIGHT should not be visible
#endif
#ifdef TOP
# error TOP should not be visible
#endif
#undef INTEGER
#define INTEGER int
// Import left module (which also imports top)
@import macros_left;
INTEGER my_integer = 0;
#ifndef LEFT
# error LEFT should be visible
#endif
#ifdef RIGHT
# error RIGHT should not be visible
#endif
#ifndef TOP
# error TOP should be visible
#endif
#ifdef TOP_LEFT_UNDEF
# error TOP_LEFT_UNDEF should not be defined
#endif
void test1() {
int i;
TOP_RIGHT_REDEF *ip = &i;
}
#define LEFT_RIGHT_DIFFERENT2 double // FIXME: expected-warning{{'LEFT_RIGHT_DIFFERENT2' macro redefined}} \\
// expected-note{{other definition of 'LEFT_RIGHT_DIFFERENT2'}}
// Import right module (which also imports top)
@import macros_right;
#undef LEFT_RIGHT_DIFFERENT3
#ifndef LEFT
# error LEFT should be visible
#endif
#ifndef RIGHT
# error RIGHT should be visible
#endif
#ifndef TOP
# error TOP should be visible
#endif
void test2() {
int i;
float f;
double d;
TOP_RIGHT_REDEF *fp = &f; // ok, right's definition overrides top's definition
LEFT_RIGHT_IDENTICAL *ip = &i;
LEFT_RIGHT_DIFFERENT *ip2 = &i; // expected-warning{{ambiguous expansion of macro 'LEFT_RIGHT_DIFFERENT'}}
LEFT_RIGHT_DIFFERENT2 *ip3 = &i; // expected-warning{{ambiguous expansion of macro 'LEFT_RIGHT_DIFFERENT2}}
int LEFT_RIGHT_DIFFERENT3;
}
#define LEFT_RIGHT_DIFFERENT double // FIXME: expected-warning{{'LEFT_RIGHT_DIFFERENT' macro redefined}}
void test3() {
double d;
LEFT_RIGHT_DIFFERENT *dp = &d; // okay
int x = FN_ADD(1,2);
}
#ifndef TOP_RIGHT_UNDEF
# error TOP_RIGHT_UNDEF should still be defined
#endif
@import macros_bottom;
TOP_DEF_RIGHT_UNDEF *TDRUf() { return TDRUp; }
@import macros_right.undef;
int TOP_DEF_RIGHT_UNDEF; // ok, no longer defined
#ifdef LOCAL_VISIBILITY
// TOP_RIGHT_UNDEF should not be undefined, because macros_right.undef does
// not undefine macros_right's macro.
# ifndef TOP_RIGHT_UNDEF
# error TOP_RIGHT_UNDEF should still be defined
# endif
#else
// When macros_right.undef is built and local submodule visibility is not
// enabled, macros_top is visible because the state from building
// macros_right leaks through, so macros_right.undef undefines macros_top's
// macro.
# ifdef TOP_RIGHT_UNDEF
# error TOP_RIGHT_UNDEF should not be defined
# endif
#endif
#ifdef ALT
int tmp = TOP_OTHER_REDEF1;
#endif
@import macros_other;
#ifndef TOP_OTHER_UNDEF1
# error TOP_OTHER_UNDEF1 should still be defined
#endif
#ifndef TOP_OTHER_UNDEF2
# error TOP_OTHER_UNDEF2 should still be defined
#endif
#pragma clang __debug macro TOP_OTHER_REDEF1
#ifndef TOP_OTHER_REDEF1
# error TOP_OTHER_REDEF1 should still be defined
#endif
int n1 = TOP_OTHER_REDEF1; // expected-warning{{ambiguous expansion of macro 'TOP_OTHER_REDEF1'}}
// expected-note@macros_other.h:4 {{expanding this definition}}
// expected-note@macros_top.h:19 {{other definition}}
#ifndef TOP_OTHER_REDEF2
# error TOP_OTHER_REDEF2 should still be defined
#endif
int n2 = TOP_OTHER_REDEF2; // ok
int n3 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok
|
Paul Wildes walks from Port Vale
THE fall-out from Port Vale’s alarming defeat at Bristol Rovers on March 12 was the catalyst for changes in the club hierarchy which led to chairman Paul Wildes standing down last night.
As Norman Smurthwaite took full control of the Valiants, he revealed that an intense discussion between Wildes and manager Micky Adams in the wake of the 2-0 defeat helped to convince him he had to step in.
Vale announced today that Wildes had stood down and that Smurthwaite, previously chief executive, would become chairman and sole owner of the club.
And reflecting on that night at the Memorial Ground when Vale suffered a fourth defeat in five games to potentially jeopardise their promotion hopes, Smurthwaite said: “That was a pivotal moment. I wasn’t happy with how things were going.
Related content
“Fans were taunting both the manager and the players, which considering we were second in the table I thought was unjustified.
“Due to our inexperience in football, I felt we had lost direction as to how to help on the pitch. It didn’t feel harmonious and I wanted to change things.”
Until then, the 52-year-old millionaire had largely accepted a back seat role, despite funding the £1.25m deal to buy Vale out of administration in November.
Smurthwaite said it was his decision to play a more active role in the running of the club which eventually led to yesterday’s parting of the ways.
He explained: “We had a problem and I wanted to put it right so I got more involved.
“I was concerned by the relationship between fans, manager and players and took the view if I could divert their frustrations at me that would ease the pressure on the squad.
“I think Paul felt that was when I stepped over the mark from being an investor to an interferer.”
Smurthwaite claimed his business partner asked him to step away from the club.
He added: “Paul said there were two people at the helm and it wasn’t good for the club. He felt there should only be one, which I didn’t disagree with.
“Basically, he asked me to stand down from the company day-to-day, enjoy the football, attend board meetings once a month and continue to support the club financially.
“That didn’t sit well with me and I didn’t think it was the best solution for the club.
“I offered him three options. I said he could buy into the club at 50 per cent of what I had invested and we would continue as joint chairmen, he could buy me out or he could leave. I needed a commitment from him, but it didn’t materialise and so he chose to go.
“I felt Paul needed to be seen as a true investor in the club and make the kind of commitment I had made. Because of the way he was profiling himself, most people assumed he had invested in the club.”
Smurthwaite said he had now severed all business ties with Wildes, but insisted there was no animosity between the pair.
“Nothing Paul has done has been detrimental to the club, it has all been positive,” he said.
“There’s been no fall-out and no one is more disappointed than me that he has decided to leave, but we have to move on.
“The easiest thing for me would have been to walk away, and if that was in the best interests of the club then I would have.
“But what would have happened next time the club needed money? They couldn’t expect me to keep funding it and be sitting in the Railway Paddock.”
Directors Mike Aspinall and Robin Anderson have also left the club, but Smurthwaite said he had no immediate plans to appoint a chief executive.
“It’s business as usual. The paymaster general is still here, even though there is a different name above the door,” he said.
“My wife, Lorraine, will initially become a director and there might be people brought into the club in the future, but I have a structure in place.
“There is no change financially and neither my enthusiasm nor confidence has been dented. I love the club and I want to make sure it progresses in a way I think fans want and deserve.”
Wildes paved the way for his exit by selling his 50 per cent share in Alchemy Investment Group, the company who own the club.
“My main regret is that I’m leaving the job half-finished,” he said, “but this is not a decision I have taken lightly.
“It has become clear that Norman and I have conflicting ideas on how to take the club forward.
“Port Vale is now in a far healthier position than when we took over and I hope the club continues to prosper under Norman’s guidance.”
7 comments
Reading all the available information and listening to the interview with NS, it seems clear that PW was using his previous Caudwell School Of Business tactics to inflate his importance and making promises that would be unachievable.
Rebuilding Our Club is not a one season wonder it's a task that needs realistic goals and a long term plan for an achievable route to stability and improved performance on and off the field.
I welcome The Smurf as the sole guvnor and look forward to a bright future at Vale Park.
lets hope that the club continues to move forward,the club needs stability after admin and now this,lets hope that norman continues to have the best interests of the club at heart and that we have a competitive squad for next season. |
1. Field of the Invention
The present invention relates to a nitride semiconductor light emitting device having an improved emission life and an apparatus including the same.
2. Description of the Prior Art
Japanese Patent Laying-Open No. 2000-124500 discloses a technique of forming convex portions on a GaN layer stacked on a sapphire substrate, flatly covering the convex portions with a GaN underlayer and forming a gallium nitride semiconductor laser device on the GaN covering layer for improving the emission characteristics of a nitride semiconductor light emitting device. According this gazette, the distance between adjacent ones of the convex portions is preferably within the range of 1 to 10 xcexcm, the width of the upper surfaces of the convex portions is preferably at least 1 xcexcm, and the height of the convex portions is preferably within the range of 0.1 to 2 xcexcm. This gazette also describes that the sapphire substrate may be replaced with a GaN substrate.
Even if the sapphire substrate is replaced with a GaN substrate in the nitride semiconductor laser device according to the prior art, however, the oscillation life is still insufficient.
Accordingly, a principal object of the present invention is to provide a nitride semiconductor light emitting device having a long oscillation life.
According to the present invention, the nitride semiconductor light emitting device includes a worked substrate including grooves and lands formed on a main surface of a nitride semiconductor substrate, a nitride semiconductor underlayer covering the grooves and the lands of the worked substrate and a nitride semiconductor multilayer emission structure including an emission layer including a quantum well layer or both a quantum well layer and a barrier layer in contact with the quantum well layer between an n-type layer and a p-type layer over the nitride semiconductor underlayer, while width of the grooves is within the range of 11 to 30 xcexcm and width of the lands is within the range of 1 to 20 xcexcm.
The width of the grooves is preferably larger than the width of the lands, and the depth of the grooves is preferably within the range of 1 to 10 xcexcm.
The longitudinal direction of the grooves or the longitudinal direction of the lands is preferably substantially parallel to the less than 1-100 greater than direction or the less than 11-20 greater than direction of a crystal of the substrate.
The nitride semiconductor underlayer preferably contains Al. Further, the nitride semiconductor underlayer preferably contains InxGa1xe2x88x92xN (0.01xe2x89xa6xxe2x89xa60.18).
The quantum well layer preferably contains at least any of As, P and Sb.
The aforementioned nitride semiconductor light emitting device can be either a laser device or a diode device. Further, such a light emitting device can be preferably employed in an optical apparatus or a semiconductor light emitting apparatus.
The foregoing and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings. |
Background {#Sec1}
==========
Although a number of different poxvirus-based vaccine vectors are available \\[[@CR1]--[@CR7]\\], there is still a need for additional vaccine vectors as well as improvement of the vectors. The unique response elicited by the host to different vectors means that vectors can be selected or engineered according to a desired host response. Host-range restricted poxviruses have been shown to successfully activate the host immune system \\[[@CR8], [@CR9]\\] and evidence exists that each virus does this in a different way, with an accompanying different pattern of transcript abundance \\[[@CR10]--[@CR15]\\]. The poxviruses ALVAC (based on canarypox virus), modified vaccinia Ankara (MVA) and NYVAC (both based on vaccinia virus (VACV) and have specific deletions) produce distinct innate immune profiles, characterised by different induction of pro-inflammatory and antiviral cytokines and chemokines in both rhesus monkeys and human PBMC \\[[@CR16]\\].
It has been shown that in non-permissive cells, Fowlpox virus (FWPV) proceeds further into the poxvirus life cycle than Canarypox virus (CNPV) \\[[@CR17]\\]. Heterologous HIV gag/pol and env genes are more efficiently expressed by FWPV than CNPV in vitro due to longer transgene expression \\[[@CR18]\\]. However, the only successful HIV-1 vaccine clinical trial to date (31.2 % protection from HIV-1 infection) has been the Thai RV144 trial involving priming with ALVAC expressing HIV-1 gp120/Gag-Pro and boosting with a recombinant glycoprotein 120 subunit, AIDSVAX \\[[@CR7]\\]. Head to head comparisons of poxvirus-vectored vaccines would help to establish the differences between the different vaccine vectors and the vaccine-induced response to achieve protection against pathogens and cancers.
Innate immunity is critical for directing the adaptive immune response to antigen and influences the magnitude and quality of the long-lived, protective immune responses to pathogens or vaccines \\[[@CR19]\\]. Application of the systems biology approach to vaccine development ("systems vaccinology") and establishment of innate immune signatures has proven useful in predicting the immunogenicity of the highly effective yellow fever vaccine (YF-17D) \\[[@CR20]\\], seasonal influenza vaccines \\[[@CR21]\\] and the immunogenic but inefficacious Merck Adenovirus type 5 (Ad5) based HIV vaccine \\[[@CR22]\\]. A better understanding of the mechanisms underlying the optimal innate immune responses would aid rational vaccine development.
Type 1 interferons (IFNα/β) are expressed rapidly in response to viral infection, and, in turn activate many interferon stimulated genes (ISGs) which exert various antiviral effector functions. A fine balance of IFN is required for successful vaccination using a live virus vector. The vector should induce enough type I IFNs to activate the immune system, yet not enough to inhibit viral DNA replication and gene expression before antigen presentation can occur \\[[@CR23]\\]. This is corroborated by Johnson et al. (2012), who compared recombinant (r) Ad types 5, 28 and 35. Specific IFN-α induction by rAd28 and rAd35 significantly lowered the immunogenicity of these vectors compared to rAd5 which did not induce IFN-α expression \\[[@CR24]\\]. The effect of type 1 IFN responses on different vaccines requires delineation of innate immune signatures and how they determine subsequent adaptive responses.
Microarray analyses performed in vitro have been used to investigate the effects of VACV (\\[[@CR12]\\], MVA \\[[@CR11]\\] and NYVAC \\[[@CR13]\\] infection on HeLa cell gene expression. Gene expression profiles in human monocyte derived dendritic cells (MDDCs) have also been generated with MVA, NYVAC \\[[@CR14]\\] and ALVAC \\[[@CR15]\\]. Furthermore, a comparison of the closely related VACV-derived vectors NYVAC and MVA revealed significant differences in antigen production and host gene dysregulation in cell culture \\[[@CR25]\\]. Consequently we hypothesized that genetically diverse poxvirus strains would induce significant differences in host gene expression. The interaction of poxviruses with the host is not just dependent on the actual cell infected by the virus but also on the factors secreted by those infected cells and their effects on the surrounding cells. Although in vitro expression studies have provided useful information, gene expression profiles performed in cell culture may not accurately reflect the changes in the system that occurs as a result of infection in vivo. A recent study in Rhesus Macaques showed that ALVAC induced distinct cytokine and chemokine levels compared to the vaccinia virus-based vectors MVA and NYVAC and that multiple subsets of peripheral blood mononuclear cells (PBMC) are likely to contribute to the overall response to different poxviruses \\[[@CR16]\\].
In this study we compared the effects of the capripoxvirus, lumpy skin disease virus (LSDV), the orthopoxvirus, MVA, and the avipoxviruses, CNPV, FWPV, a novel pigeonpox virus (FeP2) \\[[@CR26], [@CR27]\\] and a novel penguinpox virus (PEPV) \\[[@CR27]--[@CR29]\\] on host gene expression profiles in the spleens of BALB/c mice. None of these viruses complete their replication cycle in mice.
Results {#Sec2}
=======
Comparison of the host responses to different poxviruses {#Sec3}
--------------------------------------------------------
We compared the differential host gene expression induced by six host-restricted poxviruses, MVA, LSDV, FWPV, CNPV, FeP2 and PEPV, in the spleens of BALB/c mice 24 h post infection. Transcripts with an adjusted *p*-value \\< 0.05 were described as up-regulated if they had a log~2~ fold change (FC) of ≥1, or down-regulated if they had a log~2~FC of ≤ −1. A summary of the number of up and down-regulated genes is given in Table [1](#Tab1){ref-type="table"}. Full gene lists are given in supplementary data (Additional file [1](#MOESM1){ref-type="media"}). Quantitative RT-PCR showed all three housekeeping genes (GAPDH, HPRT and CD51) to be expressed at similar levels to those of the PBS control for all samples. Both IRF7 and Zbp1 were upregulated by all poxviruses tested. IGFbp3 was shown to be downregulated by all viruses. Overall the quantitative RT-PCR was more sensitive than the microarray, but the trend observed in up- and down-regulation of host gene expression was similar for qRT-PCR and microarray analysis.Table 1Summary of the number of significantly up- and down-regulated transcripts with adjusted *p*-value \\< 0.05Up-regulated Log~2~ FC \\> 1Down-regulated Log~2~ FC \\< −1MVA299 (42NA)177 (86NA)LSDV463 (111NA)85 (11NA)FWPV433 (101NA)62 (28NA)CNPV280 (31NA)47 (11NA)FeP220 (1NA)3 (0NA)PEPV68 (6NA)19 (2NA)Genes are described as upregulated if they had a fold change of ≥2, or down-regulated if they had a Log~2~ Fold change of ≤ −1. These included genes that are not annotated and therefore do not have an Entrez ID. The number of genes without annotation are indicated in brackets
Unsupervised hierarchical clustering based on the genes with *p*-value \\< 0.05 and log~2~FC above or below cutoff (\\>1, \\<−1) showed that each virus induced a unique overall response (Fig. [1](#Fig1){ref-type="fig"}). Venn diagrams highlight the number of differences and similarities in the up- and down-regulated genes between the viruses (Fig. [2](#Fig2){ref-type="fig"}). Fig. [2](#Fig2){ref-type="fig"} a and b show the differences in transcripts up (A) and (B) down-regulated respectively between FWPV, CNPV, MVA and LSDV. The Venn diagrams comparing FWPV, CNPV, MVA and LSDV indicate that the majority of up-regulated genes are shared amongst these 4 viruses (Fig. [2](#Fig2){ref-type="fig"}). The down-regulated genes however, appear largely unique, especially for LSDV and MVA (Fig. [2](#Fig2){ref-type="fig"}). FWPV and CNPV down regulate a smaller number of genes in comparison to LSDV and MVA. Comparison of avipoxvirus-induced up- and down-regulated genes shows that FeP2 and PEPV induce significantly less change in host transcript abundance than FWPV and CNPV (Fig. [2](#Fig2){ref-type="fig"}). FeP2 induced the lowest response (Fig. [2](#Fig2){ref-type="fig"}, Table [1](#Tab1){ref-type="table"}). For all six viruses, more genes were up-regulated than down-regulated (Table [1](#Tab1){ref-type="table"}).Fig. 1Heatmap comparing the differential expression induced in mouse spleens in response to pigeonpox (FeP2), penguinpox (PEPV), lumpy skin disease virus (LSDV), modified vaccinia Ankara (MVA), canarypox virus (CNPV) and fowlpox virus (FWPV). Only genes (with *p*-value \\< 0.05) with log~2~ fold change induction above or below the cutoff (±1) as compared to the mock infected control are shown. Unsupervised hierarchical clustering of the samples is represented by dendograms. Clustering analysis and heatmap was performed in the R package, gplots (Warnes, 2009)Fig. 2Venn diagrams showing the overlap between the differentially up-regulated (**a**) and down-regulated (**b**) transcripts induced by canarypox virus (CNPV), fowlpox virus (FWPV), modified vaccinia Ankara (MVA) and lumpy skin disease virus (LSDV) and the up-regulated (**c**) and down-regulated (**d**) transcripts induced by the four avipoxviruses. For each diagram, the circles represent the number of differently expressed transcripts regulated by each virus (*p* value ≤ 0.05, log~2~ fold change of ≥ ±1). The numbers in the intersections of each circle represents the number of transcripts common to the respective virus/es
### Histone transcripts {#Sec4}
Previous studies have found that increased detection of histone genes by poxvirus infection is described as an experimental artefact due to the de novo polyadenylation of transcripts by the viral poly-A polymerase \\[[@CR30], [@CR31]\\]. Several histone transcripts (39 in total) were down-regulated in response to virus infection and, because any interpretation of these transcripts would be speculative, these have been excluded from further analysis.
Immunity and host defence response-related genes {#Sec5}
------------------------------------------------
### Up-regulated immune response genes {#Sec6}
Selected up-regulated genes involved in the immune response are listed in Table [2](#Tab2){ref-type="table"}. (Full list of up-regulated genes is given in Additional file [1](#MOESM1){ref-type="media"}). Seventeen of these genes are uniquely up-regulated by LSDV. RIG-I (Ddx58) senses viral nucleic acid \\[[@CR32]\\], Cebpb is important for macrophage function \\[[@CR33]\\] and control of inflammatory responses \\[[@CR34]\\], Tap1 and Tap2 genes are involved in antigen presentation to MHC class 1 molecules \\[[@CR35]\\], Ifitm3 and Ifi203 are interferon responsive genes (ISG), c-Myc and Mif are transcription factors and Adar is an RNA editing enzyme. There are eight genes induced by CNPV, FWPV and MVA, which were not up-regulated in LSDV-infected mice. Two of these include the cytidine deaminase, Apobec1, which can edit viral nucleic acid and can thereby limit viral replication \\[[@CR36]\\], and Caspase 1 (Casp1), which is associated with pyroptosis (Table [2](#Tab2){ref-type="table"}).Table 2Selection of up-regulated genes in mouse spleens in response to MVA, LSDV, CNPV, FWPV, PEPV and FeP2. Differences in Log~2~ Fold Changes (between each virus and the control) are depicted.SymbolNameEntrezMVALSDVCNPVFWPVPEPVFeP2**Genes induced by LSDV alone***Oas1b2′-5′ oligoadenylate synthetase 1B23961-1.6----Adaradenosine deaminase, RNA-specific56417-1*\\-\\-\\--*CebpbCCAAT/enhancer binding protein (C/EBP), beta12608-1----Ddx58 (RIG-1)DEAD (Asp-Glu-Ala-Asp) box polypeptide 58230073-1.3----Grngranulin14824-1.1----Gvin1GTPase, very large interferon inducible 174558-1.5----Gm17757GTPase, very large interferon inducible 1 pseudogene100417829-1.5----H2-T24histocompatibility 2, T region locus 2415042-1.2----Ifi203interferon activated gene 20315950-1.1----Ifitm3interferon induced transmembrane protein 366141-1.4----Ifi27l2ainterferon, alpha-inducible protein 27 like 2A76933-1.9----Ly6ilymphocyte antigen 6 complex, locus I57248-1----Mifmacrophage migration inhibitory factor17319-1.1----Mycmyelocytomatosis oncogene17869-1.1----Nlrc5NLR family, CARD domain containing 5434341-1.8----Slfn2schlafen 220556-1.1----*Stat1signal transducer and activator of transcription 120846-1.4\\-\\-\\--*Tap1transporter 1, ATP-binding cassette, sub-family B (MDR/TAP)21354-1.1----Tap2transporter 2, ATP-binding cassette, sub-family B (MDR/TAP)21355-1----Trim25tripartite motif-containing 25217069-1----Trim34btripartite motif-containing 34B434218-1.1----***Genes induced by CNPV, FWPV and MVA only, and not LSDV.***[Casp1]{.ul}[caspase 1]{.ul}[12362]{.ul}[1.1]{.ul}[-]{.ul}[1.2]{.ul}[1.1]{.ul}[-]{.ul}[-]{.ul}[Clec4a2]{.ul}[C-type lectin domain family 4, member a2]{.ul}[26888]{.ul}[1.2]{.ul}[-]{.ul}[1.5]{.ul}[1.1]{.ul}*\\--*[Ifi205]{.ul}[interferon activated gene 205]{.ul}[226695]{.ul}[1.4]{.ul}[-]{.ul}[1.6]{.ul}[1.8]{.ul}[-]{.ul}[-]{.ul}[Prdx1]{.ul}[peroxiredoxin 1]{.ul}[18477]{.ul}[1]{.ul}[-]{.ul}[1]{.ul}[1.2]{.ul}[-]{.ul}[-]{.ul}[Pnpt1]{.ul}[polyribonucleotide nucleotidyltransferase 1]{.ul}[71701]{.ul}[1.1]{.ul}[-]{.ul}[1.1]{.ul}[1.4]{.ul}[-]{.ul}[-]{.ul}[Scimp]{.ul}[SLP adaptor and CSK interacting membrane protein]{.ul}[327957]{.ul}[1.2]{.ul}[-]{.ul}[1.2]{.ul}[1.5]{.ul}[-]{.ul}[-]{.ul}***Genes induced by avipoxviruses only (CNPV, FWPV, FEP2 and/ or PEPV)Anxa1annexin A116952--1.61.8--Apobec1apolipoprotein B mRNA editing enzyme, catalytic polypeptide 111810--1.21.2--Ccl6chemokine (C-C motif) ligand 620305--1.31.3--Ear2eosinophil-associated, ribonuclease A family, member 213587--1.31.5--Hsbp1heat shock factor binding protein 168196--1.21.2--IghgImmunoglobulin heavy chain (gamma polypeptide)380794--1.51.6--Ighg3Immunoglobulin heavy constant gamma 3380795--1.31.2--Lilrb3leukocyte immunoglobulin-like receptor, subfamily B (with TM and ITIM domains), member 318733--1.11--Marcomacrophage receptor with collagenous structure17167--1-1.51.5Pf4platelet factor 456744--1.21.1--Pram1PML-RAR alpha-regulated adaptor molecule 1378460--1.11.1--Psma1proteasome (prosome, macropain) subunit, alpha type 126440--1.11.3--Genes induced by FWPV only.*Aif1**allograft inflammatory factor 1**11629**-**-**-**1.1**-**-**Anxa2**annexin A2**12306**-**-**-**1.1**-**-**Ddx18**DEAD (Asp-Glu-Ala-Asp) box polypeptide 18**66942**-**-**-**1.1**-**-**Dcn**decorin**13179**-**-**-**1.5**-**-**Fgl2**fibrinogen-like protein 2**14190**-**-**-**1.2**-**-**Gsdmd**gasdermin D**69146**-**-**-**1.2**-**-**Myd88**myeloid differentiation primary response gene 88**17874**-**-**-**1.2**-**-**Nos2**nitric oxide synthase 2, inducible**18126**-**-**-**1.1**-**-**Nod1**nucleotide-binding oligomerization domain containing 1**107607**-**-**-**1**-**-**Pdcd5**programmed cell death 5**56330**-**-**-**1.2**-**-**Psmc6**proteasome (prosome, macropain) 26S subunit, ATPase, 6**67089**-**-**-**1**-**-**Prmt1**protein arginine N-methyltransferase 1**15469**-**-**-**1**-**-**Serpinb6b**serine (or cysteine) peptidase inhibitor, clade B, member 6b**20708**-**-**-**1.2**-**-*Genes induced by CNPV only.[Ctsl]{.ul}[cathepsin L]{.ul}[13039]{.ul}[-]{.ul}[-]{.ul}[1.1]{.ul}[-]{.ul}[-]{.ul}[-]{.ul}[Ighm]{.ul}[immunoglobulin heavy constant mu]{.ul}[16019]{.ul}[-]{.ul}[-]{.ul}[1.1]{.ul}[-]{.ul}[-]{.ul}[-]{.ul}[Ly96]{.ul}[lymphocyte antigen 96]{.ul}[17087]{.ul}[-]{.ul}[-]{.ul}[1.2]{.ul}[-]{.ul}[-]{.ul}[-]{.ul}[Pomp]{.ul}[proteasome maturation protein]{.ul}[66537]{.ul}[-]{.ul}[-]{.ul}[1]{.ul}[-]{.ul}[-]{.ul}[-]{.ul}Genes induced by LSDV AND MVA, but not by the AVIPOXVIRUSES**[Hsh2dhematopoietic SH2 domain containing2094881.11.4]{.ul}\\-\\-\\--[Mov10Moloney leukemia virus 10174541.11.5----Parp11poly (ADP-ribose) polymerase family, member 1110118711.4]{.ul}\\-\\-\\--[Slfn8schlafen 82769501.21.5----]{.ul}**Other**Oas1a2′-5′ oligoadenylate synthetase 1A2467301.52.71.61.4\\--Oas1g2′-5′ oligoadenylate synthetase 1G239602.33.92.52.3\\--Oas22′-5′ oligoadenylate synthetase 22467282.13.421.6\\--Oas32′-5′ oligoadenylate synthetase 32467271.12.61.31\\--Oasl12′-5′ oligoadenylate synthetase-like 12316552.63.52.42.5\\--Oasl22′-5′ oligoadenylate synthetase-like 22396223.422\\--Amica1adhesion molecule, interacts with CXADR antigen 1270152-1.1-1.1\\--Angptl4angiopoietin-like 4578751.11.5-1.61.1-Asb13ankyrin repeat and SOCS box-containing 131426881.211.11.3\\--Anxa4annexin A4117461.81.91.72.11.1-Apol9bapolipoprotein L 9b718982.32.72.62.4\\--Bst2bone marrow stromal cell antigen 2695502.332.12.2\\--Casp4caspase 4, apoptosis-related cysteine peptidase123631.91.61.92\\--Ctsccathepsin C130321.11.1-1.1\\--Cd274CD274 antigen605331.92.31.62.11.2-Cd5lCD5 antigen-like118011.21.51.41.1\\--Cd69CD69 antigen125151.81.81.51.7\\--Ccl2 (MCP1)chemokine (C-C motif) ligand 2202963.53.32.93.32.8-Ccl3 (MIP-1α)chemokine (C-C motif) ligand 32030222.12.321.4-Ccl7chemokine (C-C motif) ligand 72030632.92.62.92.71.5Ccr5chemokine (C-C motif) receptor 5127741.11.51.31.3\\--Ccrl2chemokine (C-C motif) receptor-like 254199-1.51.21.4\\--Cxcl10 (IP-10)chemokine (C-X-C motif) ligand 10159452.732.22.81.7-Cxcl11 (I-TAC)chemokine (C-X-C motif) ligand 11560664.54.43.44.31.5-Cxcl9 (MIG)chemokine (C-X-C motif) ligand 9173292.12.3-1.8\\--Chi3l3chitinase 3-like 312655-1.21.41.6\\--Csf2rb2colony stimulating factor 2 receptor, beta 2, low-affinity (granulocyte-macrophage)12984-1.5-1.7\\--C1qacomplement component 1, q subcomponent, alpha polypeptide12259-1.11\\-\\--C2complement component 2 (within H-2S)122631.51.81.71.61-Cfbcomplement factor B149622.22.61.621-Cdkn1a (P21)cyclin-dependent kinase inhibitor 1A125751.721.521.2-Cstbcystatin B130141.411.51.5\\--Cst7cystatin F (leukocystatin)130111.21.41.11.4\\--Cmpk2cytidine monophosphate (UMP-CMP) kinase 2, mitochondrial221691.321.31.3\\--Cycscytochrome c, somatic13063-1.1-1.1\\--Ctla2acytotoxic T lymphocyte-associated protein 2 alpha130241.111.11.3-1.4Ddx60DEAD (Asp-Glu-Ala-Asp) box polypeptide 602343111.72.61.51.4\\--Dhx58 (LGP2)DEXH (Asp-Glu-X-His) box polypeptide 58808611.72.51.61.5\\--Dram1DNA-damage regulated autophagy modulator 1717121.21.4-1.3\\--Ddit4DNA-damage-inducible transcript 4747471.21.21.81.31.4-Eif2ak2 (PKR)eukaryotic translation initiation factor 2-alpha kinase 2191061.12.11.11.1\\--DaxxFas death domain-associated protein1316322.31.71.9\\--Fcgr1Fc receptor, IgG, high affinity I141292.42.62.42.61.4-Fcgr4Fc receptor, IgG, low affinity IV2462562.53.62.82.91.8-Fpr1formyl peptide receptor 1142931.31.11.41.4\\--Fpr2formyl peptide receptor 2142891.81.51.71.9\\--Glipr2GLI pathogenesis-related 23840091.41.51.11.5\\--Gp49aglycoprotein 49 A147272.62.42.72.71.92Gcagrancalcin2279601.21.31.41.6\\--Gzmagranzyme A149381.81.82.22\\--Gzmbgranzyme B149393.74.74.14.22.4-Gadd45bgrowth arrest and DNA-damage-inducible 45 beta178731.31.51.21.5\\--Gbp1guanylate binding protein 1144682.12.71.62.5\\--Gbp11guanylate binding protein 116346503.94.52.94.21.6-Gbp2guanylate binding protein 2144692.32.81.52.7\\--Gbp3guanylate binding protein 3559321.61.81.21.6\\--Gbp4guanylate binding protein 4174722.12.71.32.4\\--Gbp5guanylate binding protein 522989822.81.32.21.1-Gbp7guanylate binding protein 72299001.62.21.21.7\\--Gbp10guanylate-binding protein 106265782.13.21.31.9\\--Gbp8guanylate-binding protein 8760741.31.41.42.1\\--Gbp9guanylate-binding protein 92365731.21.911.3\\--Hphaptoglobin154391.21.81.71.91.31.3Hspa1bheat shock protein 1B155112.32.92.42.5\\--H2-Q4histocompatibility 2, Q region locus 41501511.2-1.2\\--H2-Q6histocompatibility 2, Q region locus 611055711-1.1\\--H2-T22histocompatibility 2, T region locus 221503911.3\\-\\-\\--H2-T23histocompatibility 2, T region locus 231504011.3-1\\--Irgm1immunity-related GTPase family M member 1159441.42.31.11.4\\--Irgm2immunity-related GTPase family M member 25439611.7-1.2\\--Irg1immunoresponsive gene 1163652.62.51.92.51.6-Ifi202binterferon activated gene 202B263882.42.62.12.2\\--Ifi204interferon activated gene 204159513.343.23.9\\--Igtpinterferon gamma induced GTPase161451.42.211.8\\--Ifitm6interferon induced transmembrane protein 62130021.81.92.42.31.61.5Ifih1 (MDA5)interferon induced with helicase C domain 1715861.32.11.21.2\\--Iigp1interferon inducible GTPase 1604401.72.91.21.9\\--Irf1interferon regulatory factor 116362-1.3-1.1\\--Irf7interferon regulatory factor 7541231.72.91.71.1\\--Ifi35interferon-induced protein 35701101.11.51.11.2\\--Ifi44interferon-induced protein 449989922.51.81.6\\--Ifi44linterferon-induced protein 44 like150612.12.922\\--Ifit1interferon-induced protein with tetratricopeptide repeats 1159572.23.321.7\\--Ifit2interferon-induced protein with tetratricopeptide repeats 2159581.82.51.81.7\\--Il1ainterleukin 1 alpha161751.922.22.31.8-Il1f9interleukin 1 family, member 92152571.31.61.71.81.21Il1rninterleukin 1 receptor antagonist161811.31.1-1.2\\--Il12rb1interleukin 12 receptor, beta 11616122.41.72.11.1-Il12rb2interleukin 12 receptor, beta 2161621.21.31.31.3\\--Il15interleukin 15161681.11.31.21\\--Il15rainterleukin 15 receptor, alpha chain161691.81.91.51.81.2-Il18bpinterleukin 18 binding protein160681.21.71.31.5\\--Il2rainterleukin 2 receptor, alpha chain161841.11.2-1.31.1-Il33interleukin 3377125-1-1.1\\--Isg15ISG15 ubiquitin-like modifier1000388821.62.21.51.4\\--Klrk1killer cell lectin-like receptor subfamily K, member 1270071.51.71.61.5\\--Lgals9lectin, galactose binding, soluble 9168591.21.61.11.2\\--Lgals3bplectin, galactoside-binding, soluble, 3 binding protein190391.21.71.1\\-\\--Lilrb4leukocyte immunoglobulin-like receptor, subfamily B, member 4147281.61.51.71.71.1-Lcn2lipocalin 2168191.41.62.22.21.41.7Ly6alymphocyte antigen 6 complex, locus A1104541.71.91.21.3\\--Ly6c1lymphocyte antigen 6 complex, locus C1170671.82.21.91.9\\--Ly6c2lymphocyte antigen 6 complex, locus C21000415461.31.61.31.1\\--Ly6glymphocyte antigen 6 complex, locus G546644-1.72.52.2\\--Msr1macrophage scavenger receptor 1202882.3222.21.41.1Mmp13matrix metallopeptidase 13173862.72.62.42.41.5-Mmp19matrix metallopeptidase 19582231.92221.51.2Mmp25matrix metallopeptidase 25240047-1-1.1\\--Mmp8matrix metallopeptidase 8173942.733.13.42.52.8Ms4a4amembrane-spanning 4-domains, subfamily A, member 4A6669072.62.72.62.51.51.1Ms4a4cmembrane-spanning 4-domains, subfamily A, member 4C643801.21.51.21\\--Ms4a4dmembrane-spanning 4-domains, subfamily A, member 4D666071.61.51.61.8\\--Ms4a6cmembrane-spanning 4-domains, subfamily A, member 6C736561.11.11.21.2\\--Ms4a6dmembrane-spanning 4-domains, subfamily A, member 6D687743.23.53.13.3\\--Ms4a7membrane-spanning 4-domains, subfamily A, member 71092251.71.421.91.4-Mlklmixed lineage kinase domain-like745682.12.722.3\\--Mndamyeloid cell nuclear differentiation antigen3813081.81.81.61.7\\--Mndalmyeloid nuclear differentiation antigen like1E + 081.11.31.11.2\\--Mx1myxovirus (influenza virus) resistance 1178573.23.932.8\\--Mx2myxovirus (influenza virus) resistance 2178582.73.72.12.2\\--Namptnicotinamide phosphoribosyltransferase590271.71.91.52\\--NmiN-myc (and STAT) interactor646851.31.61.11.5\\--Prf1perforin 1 (pore forming protein)186461.21.41.11.2\\--Phf11aPHD finger protein 11A2191311.21.41.11.1\\--Phf11bPHD finger protein 11B23645121.81.71.8\\--Phf11cPHD finger protein 11C62870522.41.71.7\\--Phf11dPHD finger protein 11D2191322.42.92.42.41.1-Plac8placenta-specific 82315071.31.7-1.3\\--Parp10poly (ADP-ribose) polymerase family, member 106715351.21.5-1.2\\--Parp12poly (ADP-ribose) polymerase family, member 122437711.52.51.31.6\\--Parp14poly (ADP-ribose) polymerase family, member 145472531.11.7-1\\--Parp9poly (ADP-ribose) polymerase family, member 9802851.31.91.11.2\\--Psme1proteasome (prosome, macropain) 28 subunit, alpha19186-1.1-1\\--Psma7proteasome (prosome, macropain) subunit, alpha type 726444-1.1-1.1\\--Psmb10proteasome (prosome, macropain) subunit, beta type 10191711.11.4-1.3\\--Psmb8proteasome (prosome, macropain) subunit, beta type 8 (large multifunctional peptidase 7)16913-1.4-1.1\\--Pyhin1pyrin and HIN domain family, member 12363121.71.81.51.4\\--Pydc3pyrin domain containing 31000334591.92.41.71.5\\--Pydc4pyrin domain containing 46231212.93.42.21.9\\--Ppa1pyrophosphatase (inorganic) 1678951.32.1-1.5\\--Pdk4pyruvate dehydrogenase kinase, isoenzyme 4272731.51.11.71.41.81.8Rtp4receptor transporter protein 4677751.42.21.21.1\\--Retnlgresistin like gamma2451951.11.31.51.61.41.6Rnf19bring finger protein 19B75234-1.2-1.1\\--Rnf213ring finger protein 2136725111.42.211\\--Slfn1schlafen 1205551.81.91.31.5\\--Slfn3schlafen 3205571.31.71.51.7\\--Slfn4schlafen 4205581.9321.8\\--Slfn5schlafen 53279781.52.41.41.1\\--Slfn9schlafen 92378861.52.41.41.7\\--Serpina3fserine (or cysteine) peptidase inhibitor, clade A, member 3 F2383931.92.71.32.21.3-Serpinb9serine (or cysteine) peptidase inhibitor, clade B, member 9207231.31.11.11.4\\--Serpinb9bserine (or cysteine) peptidase inhibitor, clade B, member 9b207061.211.1\\-\\--Serpine1serine (or cysteine) peptidase inhibitor, clade E, member 1187871.1\\--1\\--Stat2signal transducer and activator of transcription 2208471.41.91.21.5\\--Slamf8SLAM family member 874748-1.1-1.2\\--Slc15a3solute carrier family 15, member 365221-1.3-1.1\\--Slc25a22solute carrier family 25 (mitochondrial carrier, glutamate), member 2268267-1.211.2\\--Socs1suppressor of cytokine signaling 1127031.62.2-1.9\\--Socs2suppressor of cytokine signaling 221623311.4-1.8\\--Tgtp1T cell specific GTPase 121822-1.4-1.1\\--Tgtp2T cell specific GTPase 21.00E + 081.62.7-1.5\\--Trex1three prime repair exonuclease 122040-1.2-1\\--Timp1tissue inhibitor of metalloproteinase 1218572.82.92.42.91.81.6Tlr13toll-like receptor 132795721.411.71.51-Tlr3toll-like receptor 314298011.41.21.1\\--Tlr7toll-like receptor 71707431.11.21.2\\-\\--Tlr8toll-like receptor 81707441.11.11.31\\--Trafd1TRAF type zinc finger domain containing 12317121.11.611.1\\--Trem3triggering receptor expressed on myeloid cells 3582181.11.41.21.5\\--Trim12ctripartite motif-containing 12C319236-1.51.21.3\\--Trim21tripartite motif-containing 21208211.11.3-1.4\\--Trim30atripartite motif-containing 30A201281.32.1-1.1\\--Trim30ctripartite motif-containing 30C4342192.63.42.52.2\\--Trim30dtripartite motif-containing 30D2093873.13.53.42.71.4-Warstryptophanyl-tRNA synthetase223751.11.6-1.4\\--Tnfsf10tumor necrosis factor (ligand) superfamily, member 102203522.321.9\\--Usp18ubiquitin specific peptidase 18241102.23.121.8\\--Zbp1Z-DNA binding protein 1582031.92.71.31.6\\--*Italics*: Genes induced by LSDV alone*Italics and underlined*: Genes induced by CNPV, FWPV and MVA only, and not LSDV**Bold**: Genes induced by Avipoxviruses only (CNPV, FWPV, FeP2 and/ or PEPV)***Bold and Italics***: Genes induced by FWPV only**Bold and underlined**: Genes induced by CNPV only*Underlined*: Genes induced by LSDV and MVA, but not by the Avipoxviruses
Twenty six genes involved in the host immune/defence response were up-regulated only in avipoxvirus-infected mouse spleens (Table [2](#Tab2){ref-type="table"}). The only avipoxvirus-specific gene that was up-regulated by all four avipoxviruses was the macrophage receptor with collagenous structure (Marco) gene which has been shown to suppress early inflammatory responses to virus infection \\[[@CR37]\\]. There were, however, 9 additional genes which were up-regulated by both CNPV and FWPV that were not induced by the other viruses. These included the chemokine Ccl6 which promotes immune cell activation and recruitment \\[[@CR38]\\] and the immunoglobulin heavy chain genes, Ighg (IgG) and Ighg3 (IgG3) (Table [2](#Tab2){ref-type="table"}). Amongst these 26 avipoxvirus-specific genes, 14 were exclusively up-regulated by FWPV. The Nod-like receptor, NLR, Nod1, which has been shown to be augmented in response to virus-induced production of type I IFNs \\[[@CR39]\\] was exclusively up-regulated by FWPV. Four genes were uniquely up-regulated in CNPV-infected mice including the immunoglobulin heavy chain gene, Ighm (IgM), lymphocyte antigen 96 (Ly96), proteasome maturation protein (Pomp) and Cathepsin L (Ctsl) (Table [2](#Tab2){ref-type="table"}). PePV and FeP2 induced very little immune activation according to this microarray analysis.
Four genes were up-regulated by LSDV and MVA that were not induced by the avipoxviruses in mice (Table [2](#Tab2){ref-type="table"}), namely the Moloney Leukemia Virus 10 (Mov10) gene, hematopoietic SH2 domain containing protein (Hsh2d), poly (ADP-ribose) polymerase family, member 11 (Parp11) and schlafen 8 (Slfn8). No genes were uniquely up-regulated in response to MVA infection (Table [2](#Tab2){ref-type="table"}).
### Down-regulated immune related genes {#Sec7}
Selected down-regulated genes involved in the immune response are listed in Table [3](#Tab3){ref-type="table"}. Full lists of down-regulated genes in response to each virus are given in Additional file [1](#MOESM1){ref-type="media"}. MVA and LSDV induced the down regulation of several genes that were not affected in avipoxvirus-infected spleens. These included three forms of the chemokine CCL21 (Ccl21a, Ccl21b, Ccl21c) which are potent chemoattractants for lymphocytes and dendritic cells \\[[@CR40]\\] (Table [3](#Tab3){ref-type="table"}). Furthermore, MVA and LSDV down regulate the high affinity IgM and IgA F~C~ receptor Fcamr. Fcamr is the receptor for the F~C~ fragment of immunoglobulins IgA and IgM \\[[@CR41]\\]. Interestingly, MVA, LSDV, FWPV and CNPV all down regulate the gene encoding the murine homolog for DC-specific ICAM-3--grabbing nonintegrin (DC SIGN) (Cd209a), and MVA and LSDV down regulate an additional DC SIGN homolog, CD209b (SIGNR1) (Table [3](#Tab3){ref-type="table"}). LSDV uniquely down regulates CD59a, which is the primary regulator of complement membrane attack in mouse \\[[@CR42]\\] and CD7 which is expressed on T- and NK cells, and on cells in the early stages of T, B, and myeloid cell differentiation \\[[@CR43]\\]. LSDV also uniquely down regulates the immunoglobulin kappa chain complex (IgK) amongst other immune related genes (Table [3](#Tab3){ref-type="table"}). TLR11 is down-regulated by MVA alone (Table [3](#Tab3){ref-type="table"}).Table 3Selection of down-regulated genes in mouse spleens in response to MVA, LSDV, CNPV, FWPV, PEPV and FeP2. Differences in Log~2~ Fold Changes (between each virus and the control) are depictedSymbolNameEntrezMVALSDVCNPVFWPVPEPVFeP2**Genes down-regulated by LSDV ALONE*Adamdec1****ADAM-like, decysin 158860-−1.1----****Cd59a****CD59a antigen12509-−1.2----****Cd7****CD7 antigen12516-−1.1----****Esm1****endothelial cell-specific molecule 171690-−1.1----****Igfbp3****insulin-like growth factor binding protein 316009-−1----****Igk****immunoglobulin kappa chain complex243469-−1----****Lilra5****leukocyte immunoglobulin-like receptor, subfamily A (with TM domain), member 5232801-−1.1----****Prkcg****protein kinase C, gamma18752-−1----***Genes down-regulated by MVA aloneCtsfcathepsin F56464−1.1-----Depdc1aDEP domain containing 1a76131−1.1-----Diap3diaphanous homolog 3 (Drosophila)56419−1.1-----Hmmr (CD168)hyaluronan mediated motility receptor (RHAMM)15366−1-----Tlr11toll-like receptor 11239081−1-----Genes down-regulated by lsdv and MVA, BUT NOT BY CNPV and FWPV[Ccl21a]{.ul}**[chemokine (C-C motif) ligand 21A (serine)18829−1.3−1.7]{.ul}\\-\\-\\--**[Ccl21b]{.ul}**[chemokine (C-C motif) ligand 21B (leucine)100042493−1.2−1.7]{.ul}\\-\\-\\--**[Ccl21c]{.ul}**[chemokine (C-C motif) ligand 21C (leucine)65956−1.2−1.6]{.ul}\\-\\-\\--**[Kel]{.ul}**[Kell blood group23925−1.5−1.5]{.ul}\\-\\-\\--**[Slc12a2]{.ul}**[solute carrier family 12, member 220496−1−1----]{.ul}**[Timd4]{.ul}**[T cell immunoglobulin and mucin domain containing 4276891−1.1−1.3----]{.ul}**Genes down-regulated by CNPV, FWPV AND MVA ONLY, and not LSDV.*[Tspan33]{.ul}****[tetraspanin 33]{.ul}[232670]{.ul}[−1.6]{.ul}[-]{.ul}[−1.3]{.ul}[−1.1]{.ul}[-]{.ul}[-]{.ul}***OTHERAbca9**ATP-binding cassette, sub-family A (ABC1), member 9217262−1.3−1.5-−1.1\\--**Aplnr**apelin receptor23796−1.4−1.5−1.2−1.2\\--**Cd209a**CD209a antigen170786−1.7−2.2−1.1−1.5\\--**Cd209b**CD209b antigen69165−1.2−1.3\\-\\-\\--**Cldn13**claudin 1357255−1.5−1.2−1.1\\-\\--**Emr4**EGF-like module containing, mucin-like, hormone receptor-like sequence 452614−1.4−1.8−1.1−1.5−1.3-**Fcamr**Fc receptor, IgA, IgM, high affinity64435−1.1-−1.5\\-\\--**Fcer2a**Fc receptor, IgE, low affinity II, alpha polypeptide14128−2.6−3−2.4−2.5−2.2−1.3**H2-M2**histocompatibility 2, M region locus 214990−1−1.4−1−1−1.1-**Hs3st2**heparan sulfate (glucosamine) 3-O-sulfotransferase 2195646−1.4−1.3−1−1\\--**Ifi27l1**interferon, alpha-inducible protein 27 like 152668−1.4−1.3\\-\\-\\--**Mgst3**microsomal glutathione S-transferase 366447−1.6−1-−1\\--**Slc16a10**solute carrier family 16 (monocarboxylic acid transporters), member 1072472−1.4\\--−1.1\\--**Slc2a4**solute carrier family 2 (facilitated glucose transporter), member 420528−1.7−1-−1.1\\--**Slc38a5**solute carrier family 38, member 5209837−1.4−1.2−1\\-\\--**Slc6a20a**solute carrier family 6 (neurotransmitter transporter), member 20A102680−1.4−1.3−1−1\\--**Tfrc**transferrin receptor22042−1.2\\-\\-\\-\\--**Tspan8**tetraspanin 8216350−1.4\\--−1\\--*Italics* genes down-regulated by LSDV alone*Bold* Genes down-regulated by MVA alone*Underlined* genes down-regulated by LSDV and MVA, but not by avipoxviruses*Italics and underlined* genes down-regulated by CNPV, FWPV and MVA only, and not LSDV
### Type I interferon response {#Sec8}
While many of the immunity related genes listed in Table [2](#Tab2){ref-type="table"} are regulated in some way by Type I Interferons, in order to characterise and compare the differences in the Type I IFN-regulated responses between MVA, LSDV, FWPV, CNPV, FeP2 and PEPV at 24 h, we analyzed a selection of genes known to be involved in the IFN response \\[[@CR44]--[@CR46]\\] (Fig. [3](#Fig3){ref-type="fig"}). This figure clearly shows that LSDV induces the greatest IFN response compared to the other viruses (Fig. [3](#Fig3){ref-type="fig"}).Fig. 3Heatmap (**a**) and radial plot (**b**) depicting the differences in the type I Interferon response induced by canarypox virus (CNPV), pigeonpox (FeP2), fowlpox virus (FWPV), lumpy skin disease virus (LSDV), modified vaccinia Ankara (MVA) and penguinpox virus (PEPV). Fig. 3. **a** represents the log~2~ fold change (FC) induction of the different genes up-regulated in the six samples compared to the control. A log~2~FC of 0 is given where genes are not present over the cut off (±1). Unsupervised hierarchical clustering of the samples is represented by dendograms. Clustering analysis and heatmap was performed in the R package, gplots (Warnes, 2009). Fig. 3. **b** shows a radial plot depicting the magnitude and breadth of the type I interferon response induced by the six viruses. The distance from the centre of the plot indicates log2-fold change (ranging from −2 to 4)
### Caspases {#Sec9}
MVA, FWPV and CNPV all up-regulated the protease caspase 1 (casp1) whereas LSDV did not (Fig. [4](#Fig4){ref-type="fig"}). MVA, FWPV, CNPV and LSDV significantly up-regulated caspase 4 (casp 4) (historically called caspase 11 in the mouse) (Table [2](#Tab2){ref-type="table"}). The SA avipoxviruses, FeP2 and PEPV did not affect gene regulation of any caspase genes.Fig. 4**a** T-cell specific responses and 4**b**) B-cell specific responses up- or down-regulated in mouse spleens in response to canarypox virus (CNPV), pigeonpox (FeP2), fowlpox virus (FWPV), lumpy skin disease virus (LSDV), modified vaccinia Ankara (MVA) and penguinpox virus (PEPV). The log~2~ fold changes of significantly differentially expressed (*p* value ≤ 0.05) genes involved in the respective types of responses are compared. A value of 0 indicates that no change was observed compared to mock infected mouse spleens. A positive value depicts upregulated genes and a negative value depicts down-regulated genes
### B- and T-cell specific responses {#Sec10}
The up- and down-regulated genes involved in B cell and T cell responses induced by the viruses in this study were compared (Fig. [4](#Fig4){ref-type="fig"}). Fig. [4a](#Fig4){ref-type="fig"} highlights the regulated genes that are involved in the T cell response. FeP2 and PEPV regulated only one gene each involved in this response, Ctla2a and major histocompatibility (MHC) class I gene, H2-M2, respectively. The other four viruses differentially regulated several MHC class I genes amongst others (Fig. [4a](#Fig4){ref-type="fig"}). As highlighted in Table [2](#Tab2){ref-type="table"}, the avipoxviruses, CNPV and FWPV, exclusively up regulate immunoglobulin heavy chain genes, (Ighg (IgG) and Ighg3 (IgG3)) with CNPV inducing a third, Ighm (IgM) (Fig. [4b](#Fig4){ref-type="fig"}). LSDV down regulates the immunoglobulin kappa (IgK) chain complex (Fig. [4b](#Fig4){ref-type="fig"}). In addition to these, the poxviruses differentially regulate genes for F~C~ receptors and complement (Fig. [4b](#Fig4){ref-type="fig"}).
### Comparison of early poxvirus-induced immune responses to innate molecular signatures of published candidate vaccine vectors {#Sec11}
We compared the gene expression induced by each of the 6 poxviruses at 24 h to selected correlates of protection and molecular signatures from previously published studies (Table [4](#Tab4){ref-type="table"}). The induction of multiple PRRs has been shown to activate different immune pathways and thereby induce a more polyvalent immune response \\[[@CR47], [@CR48]\\]. We identified differential expression of several genes involved in pathogen recognition (Table [4](#Tab4){ref-type="table"}). Several genes are common to the innate and adaptive immune responses induced by the poxviruses analysed here and other viral vectors analysed elsewhere (Table [4](#Tab4){ref-type="table"}).Table 4Comparison of early poxvirus-induced immune responses to selected innate molecular signatures of existing vaccine vectors. Differences in Log~2~ Fold Changes (between each virus and the control) are depicteddescriptionMVALSDVCNPVFWPVPEPVFeP2EvidenceReferences**Innate immune response*Pathogen recognition*Tlr13**toll-like receptor 131.41.01.71.51.0-**Tlr3**toll-like receptor 311.41.21.1\\--Merck Ad5/HIV\\[[@CR22]\\]**Tlr7**toll-like receptor 71.11.21.2\\-\\--YF-17D, LAIV\\[[@CR20], [@CR21]\\]**Tlr8**toll-like receptor 81.11.11.31.0\\--Merck Ad5/HIV\\[[@CR22]\\]**Tlr11**toll-like receptor 11−1.0\\-\\-\\-\\--**Ddx58 (RIG-I)**RIG-I-like receptor-1.3\\-\\-\\--YF-17D\\[[@CR20]\\]**Cd209a (DC SIGN)**CD209a antigen−1.7−2.2−1.1−1.5\\--**Cd209b (DC SIGN)**CD209b antigen−1.2−1.3\\-\\-\\--**Ifih1 (MDA5)**RIG-I-like receptor1.32.11.21.2\\--YF-17D\\[[@CR20]\\]**Zbp1 (DAI)**cytoplasmic double-stranded DNA sensor1.92.71.31.6\\--**Dhx58 (LGP2)**RIG-I-like receptor1.72.51.61.5\\--YF-17D\\[[@CR20]\\]**Eif2ak2 (PKR)**eukaryotic translation initiation factor 2-alpha kinase 2 (protein kinase R)1.12.11.11.1\\--YF-17D\\[[@CR20]\\]***Genes associated with the innate immune response of viral vectors*Cxcl10 (IP-10)**chemokine (C-X-C motif) ligand 102.732.22.81.7-Significantly upregulated in response to YF-17D, Merck Ad5/HIV, TIV\\[[@CR20]−[@CR22]\\]**Mx1**myxovirus (influenza virus) resistance 13.23.932.8\\--YF-17D\\[[@CR20]\\]**Il-1α**interleukin 1 alpha1.922.22.31.8-Significantly upregulated in response to YF-17D**Isg15**ISG15 ubiquitin-like modifier1.62.21.51.4\\--Merck Ad5/HIV\\[[@CR22]\\]**Stat1**signal transducer and activator of transcription 1-1.4\\-\\-\\--YF-17D, Merck Ad5/HIV, LAIV\\[[@CR20]−[@CR22]\\]**Cxcl11 (I-TAC)**chemokine (C-X-C motif) ligand 114.54.43.44.31.5-Merck Ad5/HIV\\[[@CR22]\\]**Ccr5**chemokine (C-C motif) receptor 51.11.51.31.3\\--Merck Ad5/HIV\\[[@CR22]\\]**Gbp7**guanylate binding protein 71.62.21.21.7\\--Merck Ad5/HIV\\[[@CR22]\\]**Irf1**interferon regulatory factor 1-1.3-1.1\\--Merck Ad5/HIV\\[[@CR22]\\]**Stat2**signal transducer and activator of transcription 21.41.91.21.5\\--LAIV\\[[@CR21]\\]**Irf7**interferon regulatory factor 71.72.91.71.1\\--LAIV\\[[@CR21]\\]**Casp1**caspase 11.1-1.21.1\\--**Adaptive immune responseB cell related responsesIghg**Immunoglobulin heavy chain (gamma polypeptide)\\--1.51.6\\--**Ighg3**Immunoglobulin heavy constant gamma 3\\--1.31.2\\--TIV, correlated with decreased risk of HIV-1 infection in the RV144 trial ALVAC-HIV(vCP1521)**Ighm**immunoglobulin heavy constant mu\\--1.1\\-\\--positively correllates with antibody response to TIV\\[[@CR21]\\]**Igk**immunoglobulin kappa chain complex-−1.0\\-\\-\\--positively correllates with antibody response to TIV\\[[@CR21]\\]**T cell related responsesGzmb**granzyme B3.74.74.14.22.4-expressed by CD8+ T cells in response to YF-17D\\[[@CR20]\\]**Ccr5**chemokine (C-C motif) receptor 51.11.51.31.3\\--expressed by CD8+ T cells in esponse to YF-17D\\[[@CR20]\\]**Ccl2 (MCP1)**chemokine (C-C motif) ligand 23.53.32.93.32.8-predicted the magnitude of the CD8+ T cell response to Merck Ad5/HIV\\[[@CR22]\\]*HIV* human immunodeficiency virus, *LAIV* live attenuated influenza vaccine, *TIV* trivalent influenza vaccine, *YF-17D* Yellow fever vaccine, *Merck Ad5/HIV* Merck's Adenovirus subtype 5-based HIV vaccine
Discussion {#Sec12}
==========
Novel avipoxviruses have been isolated in South Africa with the goal of identifying novel vaccine vectors \\[[@CR26], [@CR27]\\]. It is desirable to be able to select potential avipoxvirus vaccine vectors without going through the process of making recombinant viruses and testing immunogenicity in animal models. In this study, we compared the gene expression profiles in mouse spleens 24 h after infection with six poxviruses from 3 different genera. All the viruses were grown in eggs and the same purification methodology used. There have been no comparisons of host responses to these six different poxviruses. One of the aims of this study was to determine if one could select novel poxvirus vaccine vectors based on the transcriptome analysis. It was hypothesized that if the transcriptomes were identical then it was unlikely that they would differ as vaccine vectors. The complex model of the mouse spleen was selected because the spleen is rich in immune cells and the immune response is a complex interaction between different types of cells and their proteins which would not be reflected in in vitro models. Although in vitro expression studies have provided useful information, gene expression profiles performed in cell culture may not accurately reflect the changes that occur as result of infection in vivo. It is anticipated that different poxviruses will have different properties that will relate to their ability to act as adjuvants driving the immune response to the vaccine protein towards a particular type of immune response.
Unsupervised hierarchical clustering differentiates between the observed responses to the six poxviruses, grouping CNPV and MVA together and FWPV in a separate cluster (more closely related to CNPV and MVA than to LSDV) (Fig. [1](#Fig1){ref-type="fig"}). FeP2 and PEPV group together in a cluster that is separate from the other four viruses (Fig. [1](#Fig1){ref-type="fig"}). This grouping is quite different from phylogenetic relationships established by DNA sequence comparisons \\[[@CR27]\\]. It is also not dependent on the viral morphogenesis in non-permissive cells. PEPV and FWPV have been demonstrated to infect mammalian cells \\[[@CR28]\\] and progress to a late stage in morphogenesis \\[[@CR28], [@CR49]\\] whereas FeP2 \\[[@CR50]\\] and CNPV have a block prior to DNA replication \\[[@CR51]\\]. It is noted that infectivity studies have not been done in mouse spleens and that this may be different to published data on other mammalian cells. A further study is needed to determine if PEPV and FeP2 infect the same number of cells in the mouse spleen as the other viruses.
Amongst the four avipoxviruses analysed here, the greatest difference in host responses was expected between CNPV and FWPV, as on a genomic level, these viruses are significantly divergent with amino acid identity between ORF homologues (55--74 %) being similar to that observed between different ChPV genera \\[[@CR52]\\]. We did not expect to see such significant differences between the host responses induced by FeP2 and PEPV which share 94.4 % nucleotide identity with each other and 85.3 and 84.0 % nucleotide identity with FWPV respectively \\[[@CR27]\\]. Since avipoxviruses are restricted to avian hosts, one would anticipate fewer differences between the mammalian host responses induced by them as it is highly likely that their proteins are not as functional in mammalian cells as those of MVA and LSDV. However we show that three relatively closely related avipoxviruses (FWPV, FeP2 and PEPV) induce significant differences in gene expression in the host. FWPV induced the strongest host response in mice whereas FeP2 infection resulted in remarkably little change in host gene expression. A vaccine vector with low host reactivity, such as observed with PEPV or FeP2, might have the advantage of being a good vector to include adjuvant genes to enhance immunogenicity. Further investigation is needed to determine if there would be a good immune response to foreign antigens expressed by these vectors.
Previous in vitro studies with VACV, MVA and NYVAC have shown more host genes to be down-regulated than up-regulated \\[[@CR11]--[@CR14]\\]; however, this was not the case in other poxviruses, including cowpox virus (CPXV) \\[[@CR53]\\], monkeypox virus (MPXV) \\[[@CR53]\\] or ALVAC \\[[@CR15]\\]. Unlike our study, done in a mouse model, all these studies were done in cell culture. We show that fewer genes are down-regulated than up-regulated in response to in vivo infection at 24 h post infection (Table [1](#Tab1){ref-type="table"}). For each poxvirus tested several of the dysregulated mouse genes are not yet annotated suggesting biological roles for unannotated genes and highlighting the importance of further functional analysis and annotation of the mouse genome. Contrary to in vitro studies, MVA caused more transcripts to be up-regulated than down-regulated in mouse spleens. MVA infection did, however, result in a greater number of down-regulated transcripts compared to LSDV, FWPV and CNPV.
MVA and LSDV induced the down-regulation of several genes that were not affected by the avipoxviruses tested including three forms of the chemokine CCL21 (Ccl21a, Ccl21b, Ccl21c) which are potent chemoattractants for lymphocytes and dendritic cells \\[[@CR40]\\] (Table [3](#Tab3){ref-type="table"}). VACV A41L encodes a chemokine binding protein which binds and inhibits CCL21 \\[[@CR54]\\] and deletion mutants lacking the A41L gene, induce stronger virus-specific CD8+ T-cell responses \\[[@CR54], [@CR55]\\]. LSDV does not have a homolog of the A41L gene; there must be other mechanisms that mammalian poxviruses have evolved to evade the effects of CCL21, which is clearly important for the host in clearing poxvirus infection. In selecting/designing a vaccine vector it would be desirable to use a virus which lacks A41L and does not down regulate CCL21 if a strong CD8+ T cell response is required.
Interestingly, MVA, LSDV, FWPV and CNPV all down-regulated the gene encoding the murine homolog for DC-specific ICAM-3--grabbing nonintegrin (DC SIGN) (Cd209a). Furthermore MVA, LSDV and FWPV down-regulated an additional DC SIGN homolog, CD209b (SIGNR1) (Table [3](#Tab3){ref-type="table"}).
LSDV has a host-range restricted to ruminants and is currently being investigated as an HIV vaccine vector \\[[@CR3], [@CR56]\\]. LSDV caused the most significant response in mice compared to the other poxviruses, both in terms of the number of up-regulated genes and the magnitude and breadth of the type I Interferon response (Fig. [4](#Fig4){ref-type="fig"}). LSDV clustered independently from the avipoxviruses and MVA. LSDV up-regulated genes are involved in the antigen processing and presentation pathway (H2-T24, Tap1 and Tap2). Furthermore, LSDV uniquely up-regulated the gene encoding macrophage migration inhibitory factor (Mif), which is important in both macrophage function and T-cell immunity \\[[@CR57]\\], and Ddx58, otherwise known as RIG-I (retinoic acid-inducible gene 1), which recognises viral RNA, activating downstream signalling pathways that facilitate type I IFN production \\[[@CR58]\\]. The up-regulation of RIG-I may, in part, be responsible for the increased type I IFN response seen in LSDV-infected mice. Another one of the many genes uniquely up-regulated by LSDV was the transcription factor (Myc) that promotes growth, proliferation and apoptosis \\[[@CR59]\\]. Myc has been shown to be up-regulated in response to infection with NYVAC and MVA in HeLa cells \\[[@CR13]\\]. The absence of Myc up regulation in mouse spleens by MVA was unexpected. In a study done in Rhesus macaques rLSDV vector expressing an HIV polyprotein was immunogenic at a dose 1000-fold lower than that of rMVA. Both CD4+ and CD8+ responses were induced, rather than a predominance of CD4+ T cells observed typically for poxvirus vectors \\[[@CR3]\\].
Both LSDV and MVA up-regulated a cellular homolog of Moloney Leukemia Virus 10 (Mov10), which has been shown to inhibit retrovirus replication and infectivity \\[[@CR60]\\]. It specifically interacts with the nucleocapsid domain of HIV Gag \\[[@CR60]\\], which may have implications for vaccine vectors encoding Gag proteins. Avipoxviruses may therefore be better vectors than MVA or LSDV for the expression of Gag.
CNPV and FWPV induce the up regulation of two immunoglobulin genes (Ighg and Ighg3 (IgG3)) with CNPV up regulating a third, Ighm (Fig. [4b](#Fig4){ref-type="fig"}). All six viruses down-regulated the IgE FC receptor alpha (Fcer2a) polypeptide gene. IgE is involved in allergic responses and not vaccine responses. Antibodies of the same epitope specificity but of a different subclass can have different antibody effector functions \\[[@CR61]\\]. In a recent comparison of the immune responses resulting from the partially effective clinical RV144 HIV-1 trial and the ineffective VAX003 trial, it was shown that HIV-1--specific IgG3 antibodies were correlated with decreased risk of HIV-1 infection in the RV144 trial. It is suggested that the canarypox virus, ALVAC-HIV (vCP1521) prime component of RV144 may have stimulated different antibody subclasses, specifically IgG3, compared to the protein-only vaccine (VAX003) \\[[@CR61]\\]. The up regulation of IgG3 specifically by FWPV and CNPV in vivo, suggests that these two avipoxvirus vectors may be involved in stimulation of the clinically important IgG3 antibody subclass. Up regulation of IgG3 was not detected in ALVAC-infected monocyte derived dendritic cells (MDDCs) \\[[@CR15]\\]; this potentially significant finding is an example of the importance of in vivo testing.
Type I IFN responses have been highlighted in previous studies investigating host gene expression changes in response to different host-restricted poxviruses \\[[@CR14], [@CR15]\\]. Type I IFN induces an extensive range of interferon stimulated genes (ISGs) with various anti-viral functions (reviewed here: \\[[@CR62]\\]). In concurrence with previous studies of poxvirus-induced host responses \\[[@CR14], [@CR15]\\], Type I IFN responses were initiated by MVA, LSDV, CNPV and FWPV, with LSDV inducing the strongest response in mice (Fig. [4](#Fig4){ref-type="fig"}), followed by CNPV and FWPV, with MVA inducing a relatively low IFN response. FeP2 and PEPV induced very little ISG expression. The observed enhanced type I IFN-specific and other immune responses elicited by LSDV, FWPV and CNPV compared to MVA may be due to the absence of virus-encoded immunomodulators in these viruses which could still be present in MVA. Our results suggest that LSDV may be more immunogenic than FWPV and CNPV in mice. It is not known whether this greater IFN-response induced by LSDV in comparison to avipoxviruses would lead to enhanced clearance of the virus and a decreased immune response to any potential transgenes, or whether the increased IFN response would result in an improved immune response to the transgene, should LSDV be used as a vaccine vector.
Toll-like receptors are important regulators of the innate immune system. Poxviruses are recognized by a number of different pathogen recognition receptors (PRRs) with innate immune sensing patterns differing considerably between species and even between different derivatives of the same parent species (VACV, MVA and NYVAC) \\[[@CR23]\\]. In our study we show that TLR13, TLR3 and TLR8 are up-regulated by four poxviruses analysed (CNPV, FWPV, MVA and LSDV). In addition, TLR7 is up-regulated by CNPV, MVA and LSDV but not by FWPV (Table [2](#Tab2){ref-type="table"}). Up regulation of TLR 3, which detects double stranded RNA, has been observed in response to MVA, but not NYVAC infection of MDDCs \\[[@CR14]\\]. IFNs have been shown to up regulate TLR gene expression in viral infections \\[[@CR63]\\]. Here we have established that CNPV, FWPV, MVA and LSDV all induce significant type I IFN responses and we suggest that the up regulation of TLR expression may be a result of this.
MVA, FWPV and CNPV all up regulate the protease Caspase 1 (Casp1) whereas LSDV does not (Fig. [4](#Fig4){ref-type="fig"}). Casp1 dependent programmed cell death (pyroptosis), unlike apoptosis, is a pro-inflammatory process that has recently been recognised as important for the control of microbial infections \\[[@CR64]\\]. All of MVA, FWPV, CNPV and LSDV also significantly up-regulated caspase 4 (casp 4) (historically called caspase 11 in the mouse) (gene lists reference) which is required for the maturation of the pro-proteins of IL-1b and IL-18 (proIL-1b, proIL-18) and plays an important role in the activation of caspase-1 in inflammasome complexes, and therefore inflammation \\[[@CR65]\\]. The correlation of caspase up-regulation with either apoptosis or pyroptosis is still to be assessed.
Application of the systems biology approach to vaccines and determination of innate immune signatures has proven useful in predicting the immunogenicity of the highly effective yellow fever vaccine (YF-17D) \\[[@CR20]\\], the seasonal influenza vaccines \\[[@CR21]\\] and the immunogenic but inefficacious Merck Ad5/HIV vaccine \\[[@CR22]\\]. Several of the innate immune signatures observed in tested vaccines, were common to one or more of the poxviruses investigated here. The gene encoding monocyte chemotactic protein 1 (MCP1) (Ccl2) was up-regulated by 5 out of the 6 poxviruses (MVA, LSDV,CNPV,FWPV and PEPV). This gene was positively correlated with the CD8+ T cell response to Merck Ad5/HIV vaccination \\[[@CR22]\\]. Immunoglobulin genes, Ighm (up-regulated by CNPV) and IgK (down-regulated by LSDV) were positively correlated with the antibody response to TIV influenza vaccination \\[[@CR21]\\]. This suggests that the different poxviruses could be associated with different levels of antibody induction during the adaptive immune response. Based on our data we speculate that LSDV may be more suitable for a T-cell based vaccine and CNPV more suitable for the induction of an antibody response. This reflects the published data on LSDV \\[[@CR3]\\] and CNPV \\[[@CR61]\\].
Microarray analyses can provide important information regarding the effect of different clinically relevant viruses on host gene expression. One limitation of microarray data analysis is that as of yet there are no standardised methods of statistical analysis. It has been demonstrated previously that fold change designations and *p*-value cutoffs can significantly alter microarray interpretation \\[[@CR66]\\]. Here we have chosen stringent fold change and *p*-value cutoffs (log~2~FC ±1, adjusted *p*-value \\< 0.05) in line with similar studies \\[[@CR11]−[@CR14]\\], in order to avoid false discovery and inaccurate biological inferences. We concede that in doing so, some smaller changes in gene expression may have been overlooked. Further work should entail investigating gene dysregulation at different times post infection. Also, innate immune signatures should be directly correlated with subsequent adaptive responses. Correlation of gene expression data with biological or clinical findings would be most informative.
Conclusions {#Sec13}
===========
The findings presented here indicate that six, genetically diverse host-restricted poxviruses, CNPV, FWPV, FeP2, PEPV, MVA and LSDV, produce qualitatively and quantitatively distinct host responses in an in vivo mouse model. These results confirm that transcriptome analysis in a mouse model can be used to determine if poxvirus vectors differ from each other, laying the ground work for further investigation.
Materials and methods {#Sec14}
=====================
Animal ethics approval {#Sec15}
----------------------
The growth of poxviruses in embyonated eggs and the mouse experiments described below were approved by the Animal Research Ethics Committee in the Faculty of Health Sciences, University of Cape Town. The approval numbers are 013/016 and 013/017 respectively.
Viruses {#Sec16}
-------
MVA and wild-type CNPV were obtained from Prof. K. Dumbell's collection at the University of Cape Town and were originally from Prof. A. Mayr (Germany). The fowlpox virus vaccine, DCEP 25 modified strain, was purchased from Merial (Country) and LSDV vaccine, Herbivac® (Ceva), was kindly donated by Deltamune (Pretoria, South Africa). FeP2 was from a Feral Pigeon (*Columba livia*) \\[[@CR26], [@CR27]\\] and PEPV from an African penguin (*Spheniscus demersus*) \\[[@CR27], [@CR29]\\]. Virus isolates were grown and titrated on the chorioallantoic membranes (CAMs) of embryonated 10--11 day old (MVA, CNPV, FWPV) or 7 day old (LSDV) Specific pathogen--free (SPF) White Leghorn chicken eggs, which were obtained from Avifarms (Pty) Ltd (Lyttelton, South Africa), using a method described previously \\[[@CR26]\\]. Titrations were performed on CAMs for avipoxviruses and MVA and on Madin Darby bovine kidney (MDBK) cells for LSDV.
Virus infection of mice {#Sec17}
-----------------------
Seven week old naive female BALB/c mice were randomly divided into groups of three and each mouse was inoculated intravenously (i.v) with 10^5^ pfu/100 ul poxvirus, diluted in PBS or mock infected with PBS alone or egg extract (100 μl). The egg extract was made from uninfected CAMs, following the same extraction and purification procedure as the virus samples above. We compared the gene expression profiles of the groups of mice that were mock-infected with egg extract and PBS. No difference in gene expression was observed between the control samples. For each different virus, three groups of three mice each were inoculated. At 24 h post infection, the mice were sacrificed by cervical dislocation without anaesthesia and the spleens were harvested and placed in RNAlater (Qiagen, Venlo, Limburg, NL).
RNA extraction {#Sec18}
--------------
Mouse spleens were removed from RNAlater and the three spleens in each group were pooled and homogenized thoroughly using a TissueRuptor (Qiagen) in TRIzol® reagent (Life Technologies, Carlsbad, CA, USA). Total RNA was isolated using TRIzol® Plus RNA Purification Kit (Life Technologies, Carlsbad, CA, USA) with On-column PureLink® DNase treatment according to manufacturer's instructions. RNA was resuspended in RNase free water and quality checked using the Nanodrop ND1000 (Thermoscientific, Waltham, MA, USA) and the Agilent Bioanalyzer Nano Assay (Agilent, Santa Clara, CA, USA).
Microarray and data analysis {#Sec19}
----------------------------
mRNA hybridization was performed by IMGM Laboratories GmbH (Martinsried, DE) with the Affymetrix GeneChip Mouse Gene 2.0 ST array (Affymetrix, Santa Clara, CA, USA). Data analysis was performed in R \\[[@CR67]\\], using packages from the Bioconductor suite (<http://www.bioconductor.org>), and CRAN (<http://cran.rproject.org>). All R code is available in Additional file [1](#MOESM1){ref-type="media"}. Probe level data from. CEL files was normalised using the Robust Multi-array Averaging (RMA) method \\[[@CR68]\\] obtained as part of the "affy" package \\[[@CR69]\\] from Bioconductor, resulting in log~2~ transformed values. Boxplots, scatterplots and histogram outputs of the normalised data were obtained and checked for consistency (not shown). Data was annotated using the Mouse Gene ST 2.0 annotation data package from Bioconductor. Non-specific filtering was performed using the Genefilter package \\[[@CR70], [@CR71]\\]. This step included an intensity filter which filtered the data set such that the intensity of each gene should be \\> log2 (100) in at least 20 % of the samples. Secondly, a variance filter was applied such that the interquartile range of log2-intensities should be at least 0.5.
Differential gene expression was determined using a linear model approach using the R package, Limma \\[[@CR34]\\]. A heatmap was made using heatmap.2 from the CRAN package gplots \\[[@CR72]\\], and depicted the unsupervised hierarchical clustering based on the genes with *p*-value \\< 0.05 and log~2~FC above or below cutoff (±1). Venn diagrams were made using Venny \\[[@CR73]\\] available at <http://bioinfogp.cnb.csic.es/tools/venny/index.html>. Functional analysis was performed using Database for Annotation, Visualization and Integrated Discovery (DAVID) v6.7 web-based tools (<http://david.abcc.ncifcrf.gov/tools.jsp>). Quantitative real time PCR was done on selected mouse genes. GAPDH, HPRT and CD51 were selected as housekeeping genes; IRF7 and Zbp1 were selected as genes which were moderately upregulated by LSDV, MVA and avipoxviruses CNPV and FWPV; and IGFbp3 was selected as a gene which was downregulated by LSDV.
Additional file {#Sec20}
===============
Additional file 1:**R code used. Supplementary file 2.** Full list of up regulated genes in mouse spleens in response to modified vaccinia Ankara (MVA), lumpy skin disease virus (LSDV), canarypox virus (CNPV), fowlpox virus (FWPV), penguinpox virus (PEPV) and pigeonpox (FeP2). **Supplementary file 3.** Full list of down regulated genes in mouse spleens in response to modified vaccinia Ankara (MVA), lumpy skin disease virus (LSDV), canarypox virus (CNPV), fowlpox virus (FWPV), pigeonpox (FeP2) and penguinpox virus (PEPV).
**Competing interests**
The authors declare that they have no competing interests.
**Authors' contributions**
ALW came up with the concept for the study. KO, OC, ND and ALW designed the study. KO did most of the experimental work. OC and ND provided the PEPV and LSDV seed stock respectively. RNA was isolated by KO, OC and ND. KO and AD performed the bioinformatics and data analysis. KO, ALW, AD, ND and RW participated in the interpretation of the data. KO wrote the initial manuscript. All authors read, edited and approved the final manuscript.
We thank Rodney Lucas of the UCT Research Animal Facility for technical assistance with the mouse experiments. This work is based on the research supported by the South African Research Chairs Initiative of the Department of Science and Technology and National Research Foundation, South Africa. Any opinion, finding and conclusion or recommendation expressed in this material is that of the authors and the NRF does not accept any liability in this regard. Financial support was also provided by the Carnegie Corporation of New York and Clinical Infectious Diseases Research Initiative (CIDRI) funded by the Wellcome Trust.
|
Plumber in Roseville, CA
Roseville Plumbing
Nobody expects to have a plumbing or drain problem. Fortunately, when you have a plumbing problem of any size or complexity, you can count on Roto-Rooter to meet your needs correctly the first time so that your plumbing problem does not continue to rear its ugly head. Whether you have a small residential plumbing need or a large emergency problem, you can count on our licensed and insured plumbers in Roseville to expertly address the problem. We have the skills, knowledge, and expertise necessary to meet your plumbing needs in a prompt, efficient manner so that you can enjoy optimal plumbing again in no time.
Effective Plumbing Solutions Guaranteed
Along with offering quality services our customers can count on, we also offer a complete selection of affordable, effective plumbing products, which will serve your needs much better than any generic product could. We are so confident that our products and solutions will meet and exceed your expectations that we back them with a complete satisfaction guarantee. To schedule your Roseville plumbing service, give us a call at 801-972-2828 and we will schedule an appointment according to your unique scheduling requirements.
Regular Maintenance vs. Emergency Plumbing
Although we have 24 hour emergency services you can count on, you may prefer to perform routine maintenance on your own. It will help prevent the need for an emergency plumber. Its impossible to anticipate every plumbing problem. Appliances and pipes can sometimes fail at a moments notice. Storms or local flooding can sometimes overwhelm the plumbing you have in place. For all those unexpected events, you can have confidence that Roto-Rooter will provide a professional plumber who can come to your rescue any day, any time.
Get Professional Advice for Routine Maintenance
There are many things you can do yourself to maintain your plumbing fixtures and take care of small repairs. Visit our plumbing basics page and find hundreds of tips, instructions, and videos. You can find information that will help you unclog slow drains in your shower and fix leaky faucets. You can also read suggestions that will prolong the life of your water heater and put off the need for a water heater installation. If you need help installing water heaters or other appliances and you dont want to tackle these jobs yourself, one of our professional plumbers can make the installation quick, easy, and affordable.
The Benefits of Expert Help
For more extensive jobs that require a professional plumber, homeowners and businesses can count on Roto-Rooter Plumbing and Drain Service. For instance, if you have a sump pump, you probably need professional help for sump pump repair. We can handle tricky or involved plumbing projects that are beyond the skill of a do-it-yourself plumber. Give us a call today for more information.
Operated as an Independent Franchise - All available services, hours of operations, pricing structure, and guarantees may vary by location
YOU HAVE QUESTIONS,
WE HAVE ANSWERS.
Recent Customer Reviews
You have no idea how much we appreciate the outstanding work that Steven Miranda and Joe Luis performed at my son's home in Desert Hot Springs. It was a ... tough job in the heat. They worked for hours and dug down into the front yard and replaced a pipe. They sent me pictures to show me how damaged the pipe was and made it easier to get to the pipes in the future. Please praise them for their hard work and skill to take care of this plumbing problem. You should also know that the girl in the office was so helpful and set up the billing system. They arrived in record time.
You have a great good of employees. A company to be proud of. Sandra Schielge
Sandra Schieldge
Ensure the phone number above is a mobile number or one that receives text messages
Email Address
Ensure the phone number above is a mobile number or one that receives text messages
Address
City
State
Zip/Postal Code
Date
June 2020
Sun
Mon
Tue
Wed
Thu
Fri
Sat
Time
Description
It's as easy as 1, 2, 3!
Complete the form below so we can schedule your service appointment.
You will receive an email confirming your appointment details.
We will contact you prior to the technician's arrival
Recognition & Awards
Customer Testimonials
Everything went smoothly from the initial appointment to finishing the job. Roto-Rooter was friendly and informative in setting up the appointment. They called when they were 30 minutes away and the plumber did a great job fixing our problem. Great friendly service all around. - Greg R. |
2013 Season: Played in five games as a reserve on the defensive line…recorded six total tackles during his first active season…all of his stops came in two games…had four assisted tackles in the victory at North Dakota…had a solo and an assist at Arizona State.
2012 Season: Sat out the season as a redshirt.
High School: A 2012 graduate of Murrieta Valley HS…named first team all-Valley by the Redlands Daily Facts and first team all-Southwestern League as a senior…finished his senior season with 44 total tackles, including 8.0 sacks…had nine stops, and four sacks, against Temecula Valley for his season highs…helped the team to a 7-4 overall record.
Personal: Plans to major in communication studies…was severely burned over 20 percent of his body as a toddler and doctors believed he would lose the use of his right arm…parents are Leonard and Darla Johnson. |
Amantadine and rimantadine for influenza A in children and the elderly.
The effectiveness and safety of amantadine (AMT) and rimantadine (RMT) for preventing and treating influenza A in adults has been systematically reviewed. However, little is known about these treatments in children and the elderly. To systematically review the effectiveness and safety of AMT and RMT in preventing and treating influenza A in children and the elderly. We searched the Cochrane Central Register of Controlled Trials (CENTRAL) (The Cochrane Library 2011, Issue 2) which contains the Cochrane Acute Respiratory Infections (ARI) Group's Specialised Register, MEDLINE (1966 to June week 3, 2011) and EMBASE (1980 to June 2011). Randomised controlled trials (RCTs) or quasi-RCTs comparing AMT and/or RMT with placebo, control, other antivirals or different doses or schedules of AMT or RMT, or both, or no intervention, in children and the elderly. Two review authors independently selected trials for inclusion and assessed methodological quality. We resolved disagreements by consensus. In all comparisons except for one, we separately analysed the trials in children and the elderly using Review Manager software. A total of 12 studies involving 2494 participants (1586 children and adolescents and 908 elderly) compared AMT and RMT with placebo, paracetamol (one trial; 69 children) or zanamivir (two trials; 545 seniors). All studies were RCTs but most were still susceptible to bias. Two trials in the elderly had a high risk of bias because of incomplete outcome data. In one of those trials there was also a lack of outcome assessment blinding. Risk of bias was unclear in 10 studies due to unclear random sequence generation and allocation concealment. Only two trials in children were considered to have a low risk of bias.AMT was effective in preventing influenza A in children. A total of 773 participants were included in this outcome (risk ratio (RR) 0.11; 95% confidence interval (CI) 0.04 to 0.30). The assumed risk of influenza in the control group was 10 per 100 and the corresponding risk in the RMT group was one per 100 (95% CI 0 to 3). The quality of the evidence was considered low. For treatment purposes, RMT was beneficial for abating fever on day three of treatment. For this purpose one study was selected with low risk of bias and included 69 children (RR 0.36; 95% CI 0.14 to 0.91). The assumed risk was 38 per 100 and the corresponding risk in the RMT group was 14 per 100, 95% CI 5 to 34. The quality of the evidence was moderate.RMT did not show a prophylactic effect against influenza in the elderly, but the quality of evidence was considered very low. There were 103 participants (RR 0.45; 95% CI 0.14 to 1.41, for an assumed risk of 17 per 100 and a corresponding risk in the RMT group of 7 per 100, 95% CI 2 to 23). We did not identify any AMT trials in the elderly that met our inclusion criteria.There was no evidence of adverse effects of AMT and RMT in children or an adverse effect of RMT in the elderly. We did not identify any AMT trials in the elderly that met our inclusion criteria. AMT is effective in preventing influenza A in children but the NNTB is high (NNTB: 12 (95% CI 9 to 17). RMT probably helps the abatement of fever on day three of treatment, but the quality of the evidence is poor. Due to the small number of available studies, we could not reach a definitive conclusion on the safety of AMT or the effectiveness of RMT in preventing influenza in children and the elderly. |
INTRODUCTION {#S5}
============
Systemic lupus erythematosus (SLE) is a chronic remitting-relapsing autoimmune disease characterized by T cell autoreactivity and autoantibody production. The pathogenesis of SLE is incompletely understood, however, genetic, epigenetic, and environmental factors contribute to SLE development \\[[@R1]\\]. A substantial body of evidence supports a key role for epigenetic dysregulation in the pathogenesis of SLE \\[[@R2]\\].
We have previously demonstrated that proinflammatory epigenetic changes occur in naïve CD4^+^ T cells as the disease becomes more active in SLE patients. These epigenetic changes precede corresponding transcriptional changes and poise naïve CD4^+^ T cells for Th2/Th17/Tfh immune responses, while suppressing regulatory T cell pathways such as TGF-β signaling \\[[@R3]\\]. We also provided evidence to suggest that this "epigenetic shift" is likely mediated by the enhancer of zeste homolog 2 (EZH2), which is a core component of polycomb repressive complex 2 (PRC2) and mediates tri-methylation of lysine 27 on histone 3 (H3K27me3) \\[[@R3]\\]. Indeed, we subsequently demonstrated that CD4^+^ T cells from SLE patients are characterized by increased expression of EZH2 and higher levels of H3K27me3 compared to healthy controls \\[[@R4]\\]. In addition, levels of two microRNAs, miR-26a, and miR-101, which are known to target and downregulate EZH2 were reduced in SLE CD4^+^ T cells \\[[@R4]\\]. Further, inhibiting EZH2 significantly improved survival and ameliorated lupus-like disease in MRL/*lpr* lupus-prone mice \\[[@R5]\\].
The mechanisms underlying EZH2 upregulation in SLE CD4^+^ T cells remain unknown. It has been demonstrated that in cancer-infiltrating T cells the expression of miR-26a and miR-101 is sensitive to glucose availability and glycolysis \\[[@R6]\\]. Recent evidence suggests that glycolysis is increased in SLE T cells and that restoring normal glucose metabolism might be of therapeutic benefit \\[[@R7]\\]. In addition, the mechanistic target of rapamycin complex 1 (mTORC1) has been shown to be a metabolism sensor in immune cells \\[[@R8]\\], and is activated in CD4^+^ T cells from SLE patients \\[[@R9]\\]. Blocking mTOR activation was associated with promising clinical and cellular response in SLE patients \\[[@R10]\\]. In this study, we explore the relationship between glycolysis, mTORC1 signaling, and EZH2 expression in SLE CD4^+^ T cells.
METHODS {#S6}
=======
SLE Patients {#S7}
------------
SLE patients were recruited from the Lupus Center of Excellence at the University of Pittsburgh Medical Center and from the University of Michigan rheumatology clinics. All patients included in this study met the American College of Rheumatology classification criteria for SLE \\[[@R11]\\]. Systemic lupus erythematosus disease activity index (SLEDAI) scores of the patients ranged from 0 to 12, with a mean of 3.3 and a median of 2. Demographic information for SLE patients included in this study are shown in [Supplementary Table S1](#SD1){ref-type="supplementary-material"}. All subjects included in this study signed a written informed consent approved by the Institutional Review Board of the University of Pittsburgh (STUDY19020379; date approved: 5/16/2019) and the University of Michigan (HUM00061490; date approved: 5/15/2012).
Naïve CD4^+^ T Cells Isolation and Culture {#S8}
------------------------------------------
Naïve CD4^+^ T cells were isolated from fresh human blood samples with a negative selection isolation kit from Miltenyi Biotec as per protocol. The purity of naïve CD4^+^ T cells was evaluated with staining of anti-CD3 (clone UCHT1, BioLegend, San Diego, USA), anti-CD4 (clone RPA-T4, BioLegend, San Diego, USA), and anti-CD45RA (HI100, BioLegend, San Diego, USA). Isolated cell purities were over 95% ([Supplementary Figure S1](#SD1){ref-type="supplementary-material"}). Cells were cultured in RPMI 1640 media (GE Health Care Life Sciences, Marlborough, USA) supplemented with 10% FBS (Life Technologies, Carlsbad, USA). Cells were stimulated overnight with anti-CD3 (10 μg/mL, pre-coated on plate, Clone UCHT1, BD Biosciences, San Jose, USA) and anti-CD28 (2.5 μg/mL, Clone CD28.2, BD Biosciences, San Jose, USA), with and without glycolysis inhibitor 2-deoxy-[d]{.smallcaps}-glucose (2-DG, 2 mg/mL, Acros Organics, New Jersey, USA), mTOR inhibitor rapamycin (100 Nm, Alfa Aesar, Ward Hill, USA) or H~2~O~2~ (50 μM, Sigma-Aldrich, St. Louis, USA). The next day the antibodies were removed and fresh media (RPMI and 10% FBS) were added with and without 2-DG, rapamycin, or H~2~O~2~. The cells were cultured for a total of 3 days before harvesting.
RNA Isolation and Real-Time PCR Analysis {#S9}
----------------------------------------
Total RNA was isolated with Direct-zol RNA MiniPrep kit (Zymo Research, Irvine, USA). cDNA was synthesized with Verso cDNA synthesis kit (Thermo Fisher Scientific, Waltham, USA) following the manufacturer's instructions. EZH2, mTOR, and beta-actin primers were predesigned by Sigma-Aldrich (St. Louis, USA). RPL13A primers were purchased from Integrated DNA Technologies, Inc (Coralville, USA) \\[[@R12]\\].
miRNA was measured with TaqMan advanced miRNA cDNA synthesis kit (Thermo Fisher Scientific, Waltham, USA). miR-26a (assay ID: 478788) and miR-101 (assay ID: 478620) were purchased from Life Technologies (Carlsbad, USA).
Western Blotting {#S10}
----------------
Cells were harvested and lysed in RIPA buffer with protease inhibitor cocktail (Thermo Fisher Scientific, Waltham, USA) and phosphatase inhibitor cocktail (Life Technologies, Carlsbad, USA). Protein concentrations were measured with the bicinchoninic acid (BCA) method (Thermo Fisher Scientific, Waltham, USA). Proteins were separated with 4--15% precast polyacrylamide gel (Bio-Rad Laboratories, Hercules, USA) before transferring to nitrocellulose membranes. Membranes were incubated with the following antibodies at 4 °C overnight: anti-EZH2 (Novus Biologicals (Centennial, USA), 1:100), anti-p-S6 ribosomal protein (Ser235/236, Cell Signaling Technology (Beverly, USA), 1:1000), anti-H3K27me3 (Cell Signaling Technology (Beverly, USA), 1:1000), anti-H3 (Cell Signaling Technology (Beverly, USA), 1:1000), and anti-β-actin (Cell Signaling Technology (Beverly, USA), 1:1000). Goat anti-Rabbit or anti-Mouse Alexa Fluor 680 secondary antibody (Thermo Fisher Scientific (Waltham, USA), 1:1000) was incubated with membranes for 1 h at room temperature. Images were taken with Odyssey Imaging Systems (LI-COR Biotechnology, Lincoln, USA).
Statistics {#S11}
----------
Data were expressed as mean ± standard deviation. Differences between two groups were analyzed by Wilcoxon matched-pairs signed rank test in GraphPad Prism (version 8.2, GraphPad Software). *P* values \\< 0.05 were considered statistically significant.
RESULTS {#S12}
=======
To examine the effect of inhibiting glycolysis on EZH2 expression, naïve CD4^+^ T cells isolated from SLE patients were stimulated with anti-CD3/anti-CD28 in the presence or absence of glycolysis inhibitor 2-DG. Cells treated with 2-DG showed significant reduction in the mRNA expression of EZH2 ([Figure 1A](#F1){ref-type="fig"}). A significant reduction in EZH2 protein levels with 2-DG treatment was also noted ([Figure 1B](#F1){ref-type="fig"}). However, we did not observe significant reduction in H3K27me3 levels with 2-DG treatment (data not shown). To determine if reduced EZH2 expression with 2-DG treatment in SLE CD4^+^ T cells might be explained by an effect of 2-DG on the expression levels of miR-26a and miR-101, which regulate EZH2 and have been previously shown to be sensitive to glucose availability, we measured miR-26a and miR-101 levels in SLE CD4^+^ T cells with and without 2-DG treatment. 2-DG was associated with significant upregulation in miR-26a and miR-101 expression levels in SLE CD4^+^ T cells ([Figure 1C](#F1){ref-type="fig"},[D](#F1){ref-type="fig"}). Because we have previously shown that miR-26a and miR-101 are suppressed in SLE CD4^+^ T cells compared to normal healthy controls, these data suggest that increased glycolysis might potentially explain EZH2 overexpression in SLE CD4^+^ T cells. Indeed, our data suggest that inhibiting glycolysis can restore the expression levels of miR-26a and miR-101, which regulate EZH2 expression.
Since mTORC1 signaling increases glycolysis in CD4^+^ T cells \\[[@R13]\\], and mTORC1 is activated in SLE CD4^+^ T cells \\[[@R14]\\], we tested the effect of inhibiting mTORC1 on SLE CD4^+^ T cell EZH2 expression. SLE CD4^+^ T cells treated with rapamycin showed significant downregulation of EZH2 expression at the mRNA and protein levels ([Figure 2A](#F2){ref-type="fig"},[B](#F2){ref-type="fig"}). In addition, rapamycin treatment resulted in upregulation of both miR-26a and miR-101 ([Figure 2C](#F2){ref-type="fig"},[D](#F2){ref-type="fig"}). Taken together, these data suggest that increased mTORC1 activity in SLE CD4^+^ T cells might mediate upregulation of EZH2 through increasing glycolysis and the resulting suppression of miR-26a and miR-101.
Oxidative stress is linked to SLE pathogenesis and disease flares in SLE patients, at least in part through activation of the mTROC1 signaling pathway \\[[@R15]\\]. To investigate the effect of oxidative stress on EZH2 expression, we treated CD4^+^ T cells isolated from SLE patients with and without H~2~O~2~ (50 μM). H~2~O~2~ significantly increased EZH2 expression in SLE CD4^+^ T cells ([Figure 3A](#F3){ref-type="fig"}). Surprisingly, miR-26a and miR-101 levels were also upregulated by H~2~O~2~ treatment ([Figure 3B](#F3){ref-type="fig"},[C](#F3){ref-type="fig"}). These results suggest that oxidative stress upregulated EZH2 expression, via mechanisms that might be independent of post-transcriptional regulation by miR-26a and miR-101.
DISCUSSION {#S13}
==========
The aim of this study was to explore upstream regulating mechanisms of EZH2 in SLE CD4^+^ T cells. EZH2 is an epigenetic regulator that has been linked to epigenetic changes observed in naïve CD4^+^ T cell as the disease becomes more active in SLE patients \\[[@R3]\\]. Our model suggests increased EZH2 activity, due to suppressed post-transcriptional regulation, when SLE disease activity is increased \\[[@R3]\\]. Post-transcriptional regulation of EZH2 is mediated at least in part by miR-26a and miR-101, which are sensitive to glucose availability and are regulated by glycolysis \\[[@R6]\\]. Further, we have previously demonstrated a pathogenic role for EZH2 overexpression in SLE CD4^+^ T cells. EZH2 mediates abnormal CD4^+^ T cells adhesion in SLE by epigenetic dysregulation of the junctional adhesion molecule A (JAM-A) \\[[@R4]\\]. Herein, we demonstrate that inhibiting glycolysis or inhibiting mTORC1 signaling attenuates EZH2 expression in CD4^+^ T cells isolated from SLE patients. Our findings also suggest that these effects might be mediated by restoring the expression levels of miR-26a and miR-101, which are downregulated in SLE CD4^+^ T cells compared to healthy normal controls \\[[@R4]\\]. Post-transcriptional regulation of EZH2 by miR-26a and miR-101 has been well established \\[[@R16],[@R17]\\]. In addition, we demonstrate that oxidative stress, which stimulates mTORC1 activation, results in EZH2 overexpression in SLE CD4^+^ T cells. Taken together, these data provide a link between activated mTORC1/glycolysis in SLE CD4^+^ T cells and epigenetic dysregulation mediated by EZH2.
It is worth noting that inhibiting glycolysis using 2-DG did not appear to significantly reduce global H3K27me3 levels in SLE CD4^+^ T cells. It is possible that more sensitive assessment tools are needed to detect less robust changes in histone modifications or that H3K27me3 changes induced by 2-DG are site-specific and would be detected using chromatin immunoprecipitation-based methods. Alternative explanations include the possibility that 2-DG might also affect the levels or activity of histone demethylases, compensating for the effect of reduced EZH2 on H3K27me3 levels. Indeed, a crosstalk between H3K27me3 demethylases KDM6A/B and metabolic programs in T cells has been recently reported \\[[@R18]\\]. It is important to emphasize that EZH2 mediates pathogenic effects in SLE through mechanism that extend beyond its enzymatic function as H3K27 tri-methylase. For example, EZH2 affects DNA methylation and we have previously shown that increased EZH2 leads to DNA demethylation and over expression of JAM-A resulting in pathologic consequences such as increased CD4^+^ T cell adhesion in SLE patients \\[[@R4]\\]. The effects of specific metabolites in the glycolysis pathway on epigenetic dysregulation in SLE remains to be investigated.
CD4^+^ T cells from SLE patients are characterized by enhanced mTORC1 activity \\[[@R19]\\], which increases glycolysis through HIF-1α and Myc-related pathways \\[[@R13]\\]. mTORC1 activation in SLE CD4^+^ T cells promotes Th17 differentiation and suppresses regulatory T cell expansion \\[[@R19]\\]. This is consistent with EZH2-mediated epigenetic changes in naïve CD4^+^ T cells that were previously observed when SLE becomes more active \\[[@R3]\\]. Glycolysis is enhanced in T cells from SLE patients and restoring normal glucose metabolism was shown to have therapeutic effects in lupus-prone mice \\[[@R7]\\]. Further, increased glycolysis was observed in naïve CD4^+^ T cells in lupus-prone mice, and was enhanced following T cell activation \\[[@R7]\\]. Of interest, recent data suggest that inhibiting glycolysis results in significant reduction of follicular helper T cells (Tfh) in lupus-prone mice \\[[@R20]\\]. Our previous work in naïve CD4^+^ T cells from SLE patients suggested EZH2-mediated disease activity-dependent progressive epigenetic de-repression in genes encoding BCL-6, ICOS, and CXCR5, which play critical roles in Tfh cell differentiation \\[[@R3]\\]. Taken together, these data further support the involvement of glycolysis-dependent EZH2 overexpression in the pathogenesis of SLE. These findings also establish a link between increased mTORC1 activation, and thereby enhanced glycolysis, with EZH2-induced epigenetic changes in SLE CD4^+^ T cells.
It has been clearly suggested that oxidative stress is pathogenic in SLE \\[[@R21]\\]. Depletion of anti-oxidants, such as glutathione, and increased production of reactive oxygen intermediates have been shown in SLE patients \\[[@R22]\\]. We explored the effect of oxidative stress on EZH2 expression in SLE CD4^+^ T cells for several reasons. First, increased oxidative stress induces mTORC1 activation, and second, almost all environmental triggers associated with disease flares in SLE lead to increased oxidative stress. Furthermore, there is evidence for higher oxidative stress in SLE patients with active compared to inactive disease \\[[@R23]\\]. Finally, EZH2-mediated epigenetic dysregulation in naïve CD4^+^ T cells from SLE patients that are associated with increased disease activity suggest a role for EZH2 overexpression in lupus flares \\[[@R3]\\]. We found that oxidative stress, induced by H~2~O~2~ treatment, results in significant upregulation of EZH2. This is consistent with the arguments above. However, H~2~O~2~ treatment also resulted in upregulation of both miR-26a and miR-101. There are three potential mechanisms to explain these paradoxical findings: (1) Oxidative stress can induce EZH2 expression by additional mechanisms independent of our suggested mTORC1/glycolysis/miRNA axis; (2) A negative feedback homeostasis loop may exist to suppress EZH2 via miR-26a and miR-101 as EZH2 levels were significantly increased about 40 folds with oxidative stress; and (3) miR-26a and miR-101 could be directly regulated by oxidative stress independent of mTORC1/glycolysis.
In summary, our findings suggest that EZH2 overexpression in SLE CD4^+^ T cells is induced by mTORC1 activation and increased glycolysis through effects on post-transcriptional regulation by miR-26a and miR-101 ([Figure 4](#F4){ref-type="fig"}). These data suggest that interaction between immunometabolism and epigenetic regulation might be involved in the pathogenesis and disease flares of SLE. Suppression of EZH2 expression in CD4^+^ T cells might be mediating at least some of the therapeutic effects observed with blocking mTOR activation and with glycolysis inhibitors in SLE and lupus-prone animal models.
Supplementary Material {#SM1}
======================
This work was supported by the Lupus Research Alliance and the National Institute of Allergy and Infectious Diseases of the National Institutes of Health grant number R01AI097134.
SUPPLEMENTARY MATERIAL
The [supplementary material](#SD1){ref-type="supplementary-material"} is available online at <https://doi.org/10.20900/immunometab20200013>.
CONFLICTS OF INTEREST
The authors declare that they have no conflicts of interest.
![EZH2 levels were significantly reduced by glycolysis inhibitor 2-deoxy-[d]{.smallcaps}-glucose (2-DG) in SLE CD4^+^ T cells.\\
(**A**) EZH2 mRNA levels were significantly decreased after 2-DG treatment in naïve CD4^+^ T cells from SLE patients. (**B**) EZH2 protein levels were significantly lower in 2-DG treated cells compared to the non-treated (NT) cells. A representative Western blot is shown from six independent samples, with quantification presented in the panel on the right. (**C**) miR-26a and (**D**) miR-101 levels were significantly higher in 2-DG treated cells compared to non-treated (NT) cells. Naïve CD4^+^ T cells were stimulated with anti-CD3 (10 μg/mL) and anti-CD 28 (2.5 μg/mL) overnight. Cells were treated with 2-DG (2 mg/mL) for three days. Data are shown as mean ± standard deviation.](nihms-1583625-f0001){#F1}
{#F2}
{#F3}
{#F4}
[^1]: AUTHOR CONTRIBUTIONS
AHS conceptualized and designed the study; XZ, P-ST, and AHS designed the experiments, XZ and P-ST performed the experiments and acquired the data, XZ, P-ST, and AHS analyzed and interpreted the data, XZ and AHS wrote the paper with input from P-ST.
|
Hemagglutination by psittacine beak and feather disease virus and use of hemagglutination inhibition for detection of antibodies against the virus.
Conditions for psittacine beak and feather disease (PBFD) virus hemagglutination and hemagglutination-inhibition (HI) test reactions are defined. The PBFD virus was found to hemagglutinate cockatoo and some guinea pig erythrocytes. The HI test was used to assay serum antibody titer in birds with active PBFD virus infections and in others that had been exposed to diseased birds. On the basis of HI antibody titers in psittacine birds that had been exposed to PBFD virus, but remained clinically normal, we suggest that some birds exposed to the virus are able to mount an effective immune response. Birds with active PBFD virus infections had lower antibody values than did birds that had been exposed to the virus, but remained clinically normal. On the basis of these findings, the ability to develop a suitable HI antibody response may be crucial in determining the disease status of susceptible birds exposed to the PBFD virus. If HI antibodies are found to have neutralizing activity, then the fact that a high HI titer was induced in birds inoculated with purified PBFD virus might suggest that an immunization program would be effective in preventing PBFD virus infections. |
---
abstract: 'This paper considers a generalized framework to study OSNR optimization-based end-to-end link level power control problems in optical networks. We combine favorable features of game-theoretical approach and central cost approach to allow different service groups within the network. We develop solutions concepts for both cases of empty and nonempty feasible sets. In addition, we derive and prove the convergence of a distributed iterative algorithm for different classes of users. In the end, we use numerical examples to illustrate the novel framework.'
author:
-
-
- 'Quanyan Zhu, Lacra Pavel, [^1]'
bibliography:
- 'IEEEabrv.bib'
- 'Xbib.bib'
title: Enabling Differentiated Services Using Generalized Power Control Model in Optical Networks
---
Introduction
============
Reconfigurable optical Wavelength-Division Multiplexing (WDM) communication networks with arbitrary topologies are currently enabled by technological advances in optical devices such as optical add/drop MUXes (OADM), optical cross connects (OXC) and dynamic gain equalizer (DGE). It is important that channel transmission performance and quality of service (QoS) be optimized and maintained after reconfiguration. At the physical transmission level, channel performance and QoS are directly determined by the bit-error rate (BER), which in turn depends on optical signal-to-noise ratio (OSNR), dispersion and nonlinear effects, [@ARG05]. Thus, OSNR is considered as the dominant performance parameter in link-level optimization. Conventional off-line OSNR optimization is done by adjusting channel input power at transmitter (Tx) to equalize the dominant impairment of noise accumulation in chains of optical amplifiers. However, for reconfigurable optical networks, where different channels can travel via different optical paths, it is more desirable to implement on-line decentralized iterative algorithms to accomplish such adjustment.
Recently, this problem is addressed in many research works [@PAV06b],[@PAV06a],[@PAN05], and two optimization-based approaches are prevalently used: the central cost and the non-cooperative game approach. The goals and models of the two approaches are inherently different. Central cost approach satisfies the target OSNR with minimum total power consumption. The model embeds the OSNR requirements in its constraints and indirectly optimizes a certain design criterion. Such model yields a relatively simple closed-form solution; however, it doesn’t optimize OSNR in a direct fashion, and thus, channel performance can be potentially improved for users who need higher quality of transmission. On the other hand, the game approach is a naturally distributed model which directly optimizes OSNR based on a payoff function in a non-cooperative manner. Each user optimizes her own utility to achieve the best possible OSNR. The solution from this approach is given by Nash equilibrium. As a result, this solution concept yields best achievable OSNR levels for each user. Since the game approach involves a cost function arising from pricing, it gives an over-allocation of resources. Some users may wish to avoid such cost and only demand a basic level of transmission. Apparently, these two approaches are for two different type of users and different transmission purposes.
To make use of the advantages from each approach, we propose a generalized model that combines their features. Such a generalization allows to accommodate different types of users and also provides a novel mixed framework to study OSNR power control problem. We separate users into two different categories. One type of users are those who are willing to pay a price to fully optimize their transmission performance. Another type of users are those who are content with basic transmission quality, or OSNR level, set by the network. The quality of service (QoS) can be met for the former by a game-theoretically based optimization approach; and for the later by a mechanism similar to central cost approach.
The contribution of this paper lies in the capability of service differentiation of the generalized model. For simplicity, total capacity constraints are not considered. The paper is organized as follows. In section 2, we review the network OSNR model and the basic concepts about the two optimization-based approaches. In section 3, we establish a general framework and propose two solution concepts for two different cases of feasible sets. Section 4 gives an iterative algorithm to achieve such solutions in the framework. This is illustrated in section 5 by numerical examples. Section 6 concludes the paper and points out future directions of research.
Background
==========
Review of Optical Network Model
-------------------------------
Consider a network with a set of optical links $\\mathcal{L}=\\{1,2,..,L\\}$ connecting the optical nodes, where channel add/drop is realized. A set $\\mathcal{N}=\\{1,2,...,N\\}$ of channels are transmitted, corresponding to a set of multiplexed wavelengths. Illustrated in Figure \\[oplink\\], a link $l$ has $K_l$ cascaded optically amplified spans. Let $N_l$ be the set of channels transmitted over link $l$. For a channel $i \\in \\mathcal{N}$, we denote by $\\mathcal{R}_i$ its optical path, or collection of links, from source (Tx) to destination (Rx). Let $u_i$ be the $i$th channel input optical power (at Tx), and $\\textbf{u}=[u_1,...,u_N]^T$ the vector of all channels’ input powers. Let $s_i$ be the $i$th channel output power (at Rx), and $n_i$ the optical noise power in the $i$th channel bandwidth at Rx. The $i$th channel optical OSNR is defined as $OSNR_i=\\frac{s_i}{n_i}$. In [@PAV06b], some assumptions are made to simplify the expression for OSNR, typically for uniformly designed optical links:
1. (A1) Amplified spontaneous emission (ASE) noise power does not participate in amplifier gain saturation.
2. (A2) All the amplifiers in a link have the same spectral shape with the same total power target and are operated in automatic power control mode.
Under A1 and A2, dispersion and nonlinearity are considered to be limited, and ASE noise accumulation will be the dominant impairment. The OSNR for the $i$th channel is given as $$\\label{OSNR}
OSNR_i=\\frac{u_i}{n_{0,i}+\\sum_{j\\in
\\mathcal{N}}\\Gamma_{i,j}u_j}, i\\in\\mathcal{N}$$ where $\\mathbf{\\Gamma}$ is the full $n \\times n$ system matrix which characterizes the coupling between channels. $n_{0,i}$ denotes the $i$th channel noise power at the transmitter. System matrix $\\mathbf{\\Gamma}$ encapsulates the basic physics present in optical fiber transmission and implements an abstraction from a network to an input-output system. This approach has been used in [@SAAB02] for the wireless case to model CDMA uplink communication. Different from the system matrix used in wireless case, the matrix $\\mathbf{\\Gamma}$ given in (\\[eqnGamma\\]) is commonly asymmetric and is more complicatedly dependent on parameters such as spontaneous emission noise, wavelength-dependent gain, and the path channels take. $$\\label{eqnGamma}
\\Gamma_{i,j}=\\sum_{i\\in\\mathcal{R}_i}\\sum_{k=1}^{K_l}\\frac{G_{l,j}^{k}}{G_{l,i}^{k}}
\\left(\\prod_{q=1}^{l-1}\\frac{\\mathbf{T}_{q,j}}{\\mathbf{T}_{q,i}}\\right)\\frac{ASE_{l,k,i}}{P_{o,l}},
\\forall j\\in \\mathcal{N}_l.$$ where $G_{l,k,i}$ is the wavelength dependent gain at $k$th span in $l$th link for channel $i$; $\\mathbf{T}_{l,i}=\\prod_{q=1}^{K_l}G_{l,k,i}L_{l,k}$ with $L_{l,k}$ being the wavelength independent loss at $k$th span in $l$th link; $ASE_{l,k,i}$ is the wavelength dependent spontaneous emission noise; $P_{0,l}$ is the output power at each span.
![A Typical Optical Link in DWDM Optical Networks []{data-label="oplink"}](oplink.eps "fig:")\\
Central Cost Approach
---------------------
Similar to the SIR optimization problem in the wireless communication networks [@SMG02; @SG01], OSNR optimization achieves the target OSNR predefined by each channel user by allowing the minimum transmission power. Let $\\gamma_i, i\\in \\mathcal{N}$ be the target OSNR for each channel. By setting the OSNR requirement as a constraint, we can arrive at the following central cost optimization problem (CCP): $$\\label{CCAOpt}
\\begin{tabular}{ll}
$\\textrm{(CCP) }$&$\\min_\\mathbf{u} \\sum_{i\\in \\mathcal{N}}u_i$ \\\\
$\\textrm{subject to }$& $OSNR_i \\ge \\gamma_i \\texttt{ } \\forall
i\\in \\mathcal{N}.$ \\\\
\\end{tabular}$$ Under certain conditions, it has been shown in [@PAV06b] that the feasible set of (CCP) is nonempty and the optimal solution is achievable at the boundary of the feasible set.
The formulated optimization problem can be extended to incorporate more constraints such as $$\\label{CCAConst3}
u_{i,\\min} \\leq u_i
\\leq u_{i,\\max},$$ where $u_{i,\\min}$ is minimum threshold power required for transmission for channel $i$ and $u_{i,\\max}$ is maximum power channel $i$ can attain. In the central cost approach, power $u_i$ are the parameters to be minimized and the objective function is linearly separable. In addition, the constraints are linearly coupled. These nice characteristics in central cost approach leads to a relatively simple optimization problem.
Non-cooperative Game Approach
-----------------------------
Let’s review the basic game-theoretical model for power control in optical networks without constraints. Consider a game defined by a triplet $\\langle
\\mathcal{N},(A_i),(J_i)\\rangle$. $\\mathcal{N}$ is the index set of players or channels; $A_i$ is the strategy set $\\{u_i\\mid u_i\\in
[u_{i,\\min},u_{i,\\max}]\\}$; and, $J_i$ is the cost function. It is chosen in a way that minimizing the cost is related to maximizing OSNR level. In [@PAV06a], $J_i$ is defined as $$\\label{GAUtil}
J_i(u_i,u_{-i})=\\alpha_i u_i - \\beta_i \\ln
\\left(1+a_i\\frac{u_i}{X_{-i}}\\right), i\\in\\mathcal{N}$$ where $\\alpha_i,\\beta_i$ are channel specific parameters, that quantify the willingness to pay the price and the desire to maximize its OSNR, respectively, $a_i$ is a channel specific parameter, $X_{-i}$ is defined as $X_{-i}=\\sum_{j \\neq
i} \\Gamma_{i,j}u_j+n_{0,i}$. This specific choice of utility function is non-separable, nonlinear and coupled. However, $J_i$ is strictly convex in $u_i$ and takes a specially designed form such that its first-order derivative is linear with respect to $\\mathbf{u}$.
The solution from the game approach is usually characterized by Nash equilibrium (NE). Provided that $\\sum_{j\\neq i}\\Gamma_{i,j}< a_i$, the resulting NE solution is uniquely determined in a closed form by $$\\label{GASoln}
\\mathbf{\\widetilde{{\\Gamma}} u^*=\\widetilde{b}},$$ where $\\widetilde{\\Gamma}_{i,j}=a_i,$ for $j=i$; $\\widetilde{\\Gamma}_{i,j}=\\Gamma_{i,j},$ for $j \\neq i$ and $\\widetilde{b}=\\frac{a_i\\beta_i}{\\alpha_i}-n_{0,i}$. Similar to the wireless case [@SAAB02], we are able to construct iterative algorithms to achieve the Nash equilibrium. A simple deterministic first order parallel update algorithm is: $$\\label{GAAlg2}
u_i(n+1)=\\frac{\\beta_i}{\\alpha_i}-\\frac{1}{a_i}\\left(\\frac{1}{OSNR_i(n)}-\\Gamma_{i,i}\\right)u_i(n).$$ As proved in [@PAV06a], the algorithm (\\[GAAlg2\\]) converges to Nash equilibrium $\\mathbf{u}^*$ provided that $\\frac{1}{a_i}\\sum_{j\\neq i}\\Gamma_{i,j} < 1, \\forall i$.
Generalized Model
=================
In this section, we consider a game designed to allow service differentiation by separating users into two groups: one group seeking a minimum OSNR target and another group participating in a game setting for OSNR optimization. The minimum OSNR for target seekers is set by the network to ensure the minimum quality of service. However, the game players can submit their parameters and optimize their service accordingly, but they have to pay a price set by the network for unit power consumption. This concept is illustrated in Figure \\[GPTS\\]. Let’s denote set $\\mathcal{N}_1=\\{1,2,...,N_1\\}$ as the set of competitors, i.e. users who wish to compete for an optimal OSNR. Let set $\\mathcal{N}_2=\\{N_1+1,\\cdots,N_2\\}$ be the group of users with target OSNR given by $\\gamma_i, i\\in \\mathcal{N}_2$. Let $\\mathcal{N}=\\mathcal{N}_1\\cup\\mathcal{N}_2$, $m=|\\mathcal{N}_1|=N_1$, $n=|\\mathcal{N}_2|$, $N=|\\mathcal{N}|=m+n$ and $\\mathbf{u}=[u_1,\\cdots,u_{N_1},u_{N_1+1},\\cdots,u_{N_2}]^T$.
![Game players and target seekers in the network[]{data-label="GPTS"}](GPTS2.eps "fig:")\\
For the game-theoretical players, using the cost function given in (\\[GAUtil\\]), we can form a system of equations given by $$a_iu_i+X_{-i}=\\frac{a_i\\beta_i}{\\alpha_i}, \\forall i\\in\\mathcal{N}_1$$ and thus, $\\widetilde{\\mathbf{\\Gamma}}\\mathbf{u}=\\widetilde{\\mathbf{b}},$ where $\\widetilde{\\mathbf{\\Gamma}}\\in \\mathcal{R}^{m\\times N}$ and $\\widetilde{\\mathbf{b}}\\in \\mathcal{R}^{m}$ are defined as in (\\[GASoln\\]). Users with target OSNR shall have $\\mathbf{u}$ satisfy $OSNR_i\\geq \\gamma_i, \\forall i\\in \\mathcal{N}_2,$ or equivalently from (\\[OSNR\\]), $$\\frac{u_i}{\\Gamma_{i,i}u_i+\\sum_{j\\neq i}\\Gamma_{i,j}u_j+n_{0,i}}\\geq \\gamma_i$$ and thus in a matrix form, $\\widehat{\\mathbf{\\Gamma}}\\mathbf{u}\\geq\\widehat{\\mathbf{b}},$ where $\\widehat{\\mathbf{b}}=[\\gamma_1n_{0,1},\\cdots,\\gamma_Nn_{0,N}]^T\\in \\mathcal{R}^{n}$, $\\widehat{\\mathbf{\\Gamma}}\\in \\mathcal{R}^{n\\times N}$ and is given in (\\[GammaN2\\]).
$$\\label{GammaN2}
\\widehat{\\mathbf{\\Gamma}}=\\left[
\\begin{array}{ccccc}
-\\gamma_{N_1+1}\\Gamma_{N_1+1,1} & \\cdots & 1-\\gamma_{N_1+1}\\Gamma_{N_1+1,N_1+1} & \\cdots & -\\gamma_{N_1+1}\\Gamma_{N_1+1,N} \\\\
\\vdots & \\ddots & \\ddots & \\ddots & \\vdots \\\\
-\\gamma_{N-1}\\Gamma_{N-1,1} & -\\gamma_{N-1}\\Gamma_{N-1,2} & \\cdots & 1-\\gamma_{N-1}\\Gamma_{N-1,N-1} & -\\gamma_{N-1}\\Gamma_N \\\\
-\\gamma_N\\Gamma_{N,1} & -\\gamma_N\\Gamma_{N,2} & \\cdots & \\cdots & 1-\\gamma_N\\Gamma_{N,N} \\\\
\\end{array}
\\right].$$
Let $F_1=\\{\\mathbf{u}\\in\\mathcal{R}^N\\mid \\widetilde{\\mathbf\\Gamma}\\mathbf{u}=\\widetilde{\\mathbf{b}}\\}$ and $F_2=\\{\\mathbf{u}\\in\\mathcal{R}^N\\mid\\widehat{\\mathbf{\\Gamma}}\\mathbf{u}\\geq\\widehat\\mathbf{b}\\}$. In summary, we have a problem formulated as in (DS), where we find solutions that satisfy $F_1$ subject to the constraint described by $F_2$. $$\\label{DS1}
\\begin{array}{cc}
\\textrm{(DS)} & \\widetilde{\\mathbf{\\Gamma}}\\mathbf{u}=\\widetilde{\\mathbf{b}}\\\\
\\textrm{s.t.} &\\widehat{\\mathbf{\\Gamma}}\\mathbf{u}\\geq\\widehat{\\mathbf{b}} \\end{array}$$
In the following discussion, we separate (DS) into two cases: (1) $F=F_1\\cap F_2\\neq\\emptyset$, (2)$F=F_1\\cap F_2=\\emptyset$, which require different techniques to find appropriate solutions.
Non-empty Feasible Set
----------------------
A non-empty $F$ may give rise to multiple points that solve (DS). We may impose some design criteria, or, objective function to reformulate DS for finding an appropriate solution that solves DS and meet the design criteria at the same time.
We can use the following result to ensure the nonempty feasible set $F$.
\\[nonemptyF\\] If $\\overline\\mathbf{\\Gamma}=\\left[
\\begin{array}{c}
\\widetilde\\mathbf{\\Gamma} \\\\
\\widehat\\mathbf{\\Gamma} \\\\
\\end{array}
\\right]
$ is nonsingular, the feasible set $F=F_1\\cap F_2$ is non-empty.
Let $\\mu\\in\\mathcal{R}^n_+$ a nonnegative vector. Equivalently, we can express $F_2$ into $F_2=\\{\\mathbf{u}\\in\\mathcal{R}^n\\mid \\widehat\\mathbf\\Gamma \\mathbf{u}=\\widehat\\mathbf{b}+\\mu,\\textrm{~for~some~}\\mu\\in\\mathcal{R}^n_+\\}$. The set $F$ is thus equivalently $F=\\{\\mathbf{u}\\in\\mathcal{R}^N\\mid \\overline{\\mathbf\\Gamma}\\mathbf{u}=\\mathbf{\\phi},\\textrm{~for~some~}\\mu\\in\\mathcal{R}^n_+\\}$, where $\\overline\\mathbf{\\Gamma}=\\left[
\\begin{array}{c}
\\widetilde\\mathbf{\\Gamma} \\\\
\\widehat\\mathbf{\\Gamma} \\\\
\\end{array}
\\right]
$ and $\\mathbf\\phi=\\left[
\\begin{array}{c}
\\widetilde\\mathbf{b} \\\\
\\widehat\\mathbf{b}+\\mu \\\\
\\end{array}
\\right]
$. If $\\overline\\mathbf{\\Gamma}$ is nonsingular, there exist a unique $\\mathbf{u}\\in\\mathcal{R}^N$ for every nonnegative $\\mu$. Therefore $F$ is non-empty.
Suppose conditions in Theorem \\[nonemptyF\\] hold and $F$ is nonempty. We consider an appropriate solution in $F$ that satisfies a certain design criteria. Thus, we formulate (DSNP[^2]) in which we minimize total power consumption subject to the conditions arising from the different service requirements.
$$\\label{DSNP}
\\begin{array}{cc}
\\textrm{(DSNP)} & \\min \\sum_iu_i\\\\
\\textrm{s.t.} & \\widetilde{\\mathbf{\\Gamma}}\\mathbf{u}=\\widetilde{\\mathbf{b}},\\widehat{\\mathbf{\\Gamma}}\\mathbf{u}\\geq\\widehat{\\mathbf{b}}
\\end{array}$$
The constraints of (DSNP) can be relaxed and augmented into $$\\label{relaxedEq}
\\overline\\mathbf{\\Gamma}\\mathbf{u}\\geq\\overline\\mathbf{b}.$$ where $\\overline{\\mathbf{\\Gamma}}=\\left[
\\begin{array}{c}
\\widetilde{\\mathbf{\\Gamma}} \\\\
\\widehat{\\mathbf{\\Gamma}} \\\\
\\end{array}
\\right]
\\in\\mathcal{R}^{N\\times N}$ and $\\overline{\\mathbf{b}}=\\left[
\\begin{array}{c}
\\widetilde{\\mathbf{b}} \\\\
\\widehat{\\mathbf{b}} \\\\
\\end{array}
\\right]
\\in\\mathcal{R}^{N}.$
According to the fundamental theorem of linear programming [@BER03], if (DSNP) is realistic, the solution is obtained at the extreme point of the feasible set $F$. Since $F$ has only one extreme point when $\\overline\\mathbf\\Gamma$ is non-singular, the solution is uniquely given by $$\\label{eqSoln}
\\mathbf{u}=\\overline\\mathbf{\\Gamma}^{-1}\\overline\\mathbf{b}.$$
To further characterize the solution $\\mathbf{u}$, we assume strict diagonal dominance of matrix $\\overline\\mathbf{\\Gamma}$ [@Horn90], which leads to non-singularity of the matrix and uniqueness of the solution.
\\[StrictDom\\] Suppose OSNR targets $\\gamma_i, i\\in\\mathcal{N}_2$ are chosen such that $\\gamma_i<\\frac{1}{\\sum_{j\\in\\mathcal{N}}\\Gamma_{i,j}}, i\\in\\mathcal{N}_2$. In addition, parameters $a_i$ are chosen as $a_i>\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{ij}, \\forall i\\in\\mathcal{N}_1.$ The matrix $\\overline\\mathbf{\\Gamma}$ is strictly diagonally dominant. And thus, a unique solution to (DSNP) is given by (\\[eqSoln\\]).
From the assumption that $\\gamma_i\\sum_{j\\in\\mathcal{N}}\\Gamma_{ij}<1,i\\in\\mathcal{N}_2$, it is apparent that $\\gamma_i<\\frac{1}{\\Gamma_{ii}}$ and $\\left|1-\\gamma_i\\Gamma_{ii}\\right|>\\gamma_i\\sum_j\\Gamma_{ij}, \\forall i\\in\\mathcal{N}_2$. In addition, $a_i>\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}, \\forall i\\in\\mathcal{N}_1$. Therefore, matrix $\\overline\\mathbf{\\Gamma}$ is strictly diagonally dominant. Using Gershgorin theorem in [@Horn90], we conclude that there exists a unique solution to (DSNP).
The assumption of strict diagonal dominance in Theorem \\[StrictDom\\] is reasonable because typical values of $\\Gamma_{ij}$ are found to be on the order of $10^{-3}$ and desirable levels of OSNR are 20-30dB.
(DSNP) can be seen as a generalized approach that combines central cost approach in [@PAV06b] and non-cooperative game approach in [@PAV06a]. When $N_1=\\emptyset, N_2\\neq\\emptyset$, (DSNP) reduces to the central cost approach. Similarly, when $N_1\\neq\\emptyset, N_2=\\emptyset$, (DSNP) reduces to the game-theoretical approach and the given solution is Nash equilibrium accordingly. This framework allows to study two different types of users at the same time.
We illustrate a two-person (DSNP), where player 1 chooses to compete and optimize his utility and player 2 chooses to meet a certain OSNR target $\\gamma_2$. We form the 2-by-2 matrix $\\overline{\\mathbf{\\Gamma}}$ and $\\overline\\mathbf{b}$ as follows. $$\\overline{\\mathbf{\\Gamma}}=\\left[
\\begin{array}{cc}
a_1 & \\Gamma_{12} \\\\
-\\Gamma_{21}\\gamma_2 & 1-\\Gamma_{22}\\gamma_2 \\\\
\\end{array}
\\right],
\\overline{\\mathbf{b}}=\\left[
\\begin{array}{c}
\\frac{a_1\\beta_1}{\\alpha_1}-n_{0,1} \\\\
n_{0,2}\\gamma_2 \\\\
\\end{array}
\\right]$$
The feasible set $F=F_1\\cap F_2$ is shown in Figure \\[DiffServGamma2\\] by a dotted line. The relaxed (DSNP) has its relaxed feasible depicted in the shaded region. The solution is given by $\\mathbf{u}^*=\\overline{\\mathbf{\\Gamma}}^{-1}\\overline{\\mathbf{b}},$ which is illustrated by the dark point in Figure \\[DiffServGamma2\\]. $\\mathbf{u}^*$ is nonnegative componentwise if network price $\\alpha_1$ is set such that $s_2>\\frac{n_{0,2}}{1-\\Gamma_{22}}$.
![The feasible set of two-person (DSNP). $s_1=\\frac{\\tilde{b}_1}{a_1}$; $s_2=\\frac{\\tilde{b}_1}{\\Gamma_{12}}$[]{data-label="DiffServGamma2"}](DiffServGamma2new.eps "fig:")\\
Based on Theorem \\[StrictDom\\], we can further investigate how parameters chosen by game players and target seekers influence the outcome of the allocation. The result is summarized in Theorem \\[varControl\\].
\\[varControl\\] Let $\\kappa$ be the condition number of $\\overline{\\mathbf{\\Gamma}}$, $T_i=a_i+\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{ij}, \\forall i\\in\\mathcal{N}_1$ and $S_k=2-2\\gamma_k\\Gamma_{kk}, \\forall k\\in\\mathcal{N}_2$. Suppose $\\overline\\mathbf{\\Gamma}$ is strictly diagonally dominant by satisfying conditions in Theorem \\[StrictDom\\]. In addition, $T_i>S_k$ and $\\tilde{b}_i>\\hat{b}_k, \\forall i\\in\\mathcal{N}_1, \\forall k\\in\\mathcal{N}_2.$ The maximum allocated power allocated to users are bound as follows. $$\\frac{\\max_{i\\in\\mathcal{N}_2}\\gamma_in_{0,i}}{\\max_{i\\in\\mathcal{N}_1}2a_i}\\leq\\|\\mathbf{u}\\|_\\infty\\leq\\kappa\\max_{i\\in\\mathcal{N}_1}\\frac{\\beta_i}{\\alpha_i}$$
Let $R_i$ denote the i-th row absolute sum of matrix $\\overline\\mathbf{\\Gamma}$, i.e., $$\\label{Row}
R_i=\\sum_{j\\in\\mathcal{N}}\\left|\\overline{\\Gamma}_{ij}\\right|.$$ Using conditions from Theorem \\[StrictDom\\], we arrive at $$\\label{Ri}
R_i=\\left\\{
\\begin{array}{ll}
1+\\gamma_i\\sum_{j\\in\\mathcal{N}}\\Gamma_{ij}-2\\gamma_i\\Gamma_{ii}<2-2\\gamma_i\\Gamma_{ii}, & {i\\in\\mathcal{N}_2;} \\\\
a_i+\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{ij}<2a_i., & {i\\in\\mathcal{N}_1.}
\\end{array}
\\right.$$
With the assumption that $a_i+\\sum_{j\\neq i}\\Gamma_{ij}> 2-2\\gamma_k\\Gamma_{kk}, \\forall i\\in\\mathcal{N}_1, \\forall k\\in\\mathcal{N}_2,$ we obtain $\\|\\overline\\mathbf{\\Gamma}\\|_\\infty=\\max_{i\\in\\mathcal{N}}R_i=\\max_{i\\in\\mathcal{N}}a_i+\\sum_{j\\neq i}\\Gamma_{ij}.$ Using (\\[Ri\\]) and the fact that $\\Gamma_{ij}\\geq0$, we obtain an upper and lower bound on $\\|\\overline{\\mathbf{\\Gamma}}\\|_\\infty$, i.e., $$\\label{ublbOGammaNorm}
\\max_{i\\in\\mathcal{N}_1}a_i\\leq \\|\\overline\\mathbf{\\Gamma}\\|_\\infty \\leq\\max_{i\\in\\mathcal{N}_1}2a_i.$$
In addition, from $\\tilde{b}_i>\\hat{b}_k, \\forall i\\in\\mathcal{N}_1, \\forall k\\in\\mathcal{N}_2,$ we obtain an upper bound and lower bound for $\\|\\overline\\mathbf{b}\\|_\\infty$, given by $$\\label{ublbObnorm}
\\max_{i\\in\\mathcal{N}_2}\\gamma_in_{0,i}\\leq\\|\\overline\\mathbf{b}\\|_\\infty=\\max_{i\\in\\mathcal{N}}\\overline{b}_i\\leq\\max_{i\\in\\mathcal{N}_1}\\tilde{b}_i
=\\max_{i\\in\\mathcal{N}_1}\\frac{a_i\\beta_i}{\\alpha_i}$$ Since $\\overline{\\mathbf{\\Gamma}}$ is strictly diagonally dominant, using matrix norm sub-multiplicativity, we obtain from (\\[eqSoln\\]) $$\\label{ublbu}
\\frac{\\|\\overline{\\mathbf{b}}\\|_\\infty}{\\|\\overline{\\mathbf{\\Gamma}}\\|_\\infty}\\leq\\|\\mathbf{u}\\|_\\infty\\leq\\frac{\\kappa\\|\\overline{\\mathbf{b}}\\|_\\infty}{\\|\\overline\\mathbf{\\Gamma}\\|_\\infty},$$ where $\\kappa$ is the condition number of $\\overline{\\mathbf{\\Gamma}}$ given by $\\kappa=\\|\\overline{\\mathbf{\\Gamma}}\\|_\\infty\\|\\overline{\\mathbf{\\Gamma}}^{-1}\\|_\\infty\\geq1.$
Using (\\[ublbOGammaNorm\\]), (\\[ublbObnorm\\]) and (\\[ublbu\\]), we obtain $$\\begin{aligned}
\\label{ublbu2}
\\nonumber \\frac{\\max_{i\\in\\mathcal{N}_2}\\gamma_in_{0,i}}{\\max_{i\\in\\mathcal{N}_1}2a_i}\\leq\\|\\mathbf{u}\\|_\\infty
&\\leq&\\frac{\\kappa\\max_{i\\in\\mathcal{N}_1}a_i\\beta_i/\\alpha_i}{\\max_{i\\in\\mathcal{N}_1}a_i}\\\\
\\nonumber &\\leq&\\frac{\\kappa\\max_{i\\in\\mathcal{N}_1}a_i\\max_{i\\in\\mathcal{N}_1}\\beta_i/\\alpha_i}{\\max_{i\\in\\mathcal{N}_1}a_i}\\\\
&\\leq&\\kappa\\max_{i\\in\\mathcal{N}_1}\\frac{\\beta_i}{\\alpha_i}.\\end{aligned}$$
It is easy to observe that the upper bound is dependent on the parameters of the game players and the lower bound is dependent on the OSNR levels of target seeker and parameter $a_i$ of the game players. In essence, game players control the outcome of the model and the choice of OSNR target can only affect the lower bound. Such relation describes a fair scenario in which game players, who pay for their power at $\\alpha_i$, have their choices of parameters $a_i,\\beta_i$ to influence the network allocation.
Since $\\|\\mathbf{u}\\|_\\infty\\leq\\|\\mathbf{u}\\|_2\\leq \\sqrt{N}\\|\\mathbf{u}\\|_\\infty$, we can translate the result obtained in (\\[ublbu2\\]) directly into Euclidean norm, i.e., $$\\label{ublbu2Euclid}
B_\\infty^L\\leq\\|\\mathbf{u}\\|_2\\leq \\sqrt{N}B^U_\\infty$$ where $B_\\infty^U=\\kappa\\max_{i\\in\\mathcal{N}_1}\\frac{\\beta_i}{\\alpha_i}$ and $B_\\infty^L=\\frac{\\max_{i\\in\\mathcal{N}_2}\\gamma_in_{0,i}}{\\max_{i\\in\\mathcal{N}_1}2a_i}$.
By (\\[ublbu2Euclid\\]), we can see that the network can encourage uniform channel power distribution by letting $B_\\infty^U$ close to $\\sqrt{N}B_\\infty^L$ and provide incentive for differentiated services by letting them far apart. It can be implemented by the network by adjusting OSNR level $\\gamma_i$ and pricing $\\alpha_i$. Decreasing $\\alpha_i$ encourages more users to be game players, giving rise to more competitions or service differentiation as a result of higher upper bound. On the other hand, increasing $\\gamma_i$ raises the lower bound and encourages more users being target-seekers.
Empty Feasible Set
------------------
In this section, we consider the second case where feasible set $F$ is empty. Instead of finding an appropriate feasible solution, we find the closest points between set $F_1$ and $F_2$. We use a quadratic program (DS2) to minimize the error norm subject to the constraint described by $F_2$.
$$\\label{DS2}
\\begin{array}{cc}
\\textrm{(DS2)} & \\min_{\\mathbf{u}}\\|\\widetilde{\\mathbf{\\Gamma}}\\mathbf{u}-\\widetilde{\\mathbf{b}}\\|_2\\\\
\\textrm{s.t.} &\\widehat{\\mathbf{\\Gamma}}\\mathbf{u}\\geq\\widehat{\\mathbf{b}} \\end{array}$$
We can turn the constrained problem (\\[DS2\\]) into an unconstrained problem by studying its corresponding dual problem. Since $\\|\\widetilde{\\mathbf{\\Gamma}}\\mathbf{u}-\\widetilde{\\mathbf{b}}\\|_2
=\\mathbf{u}^T\\widetilde{\\mathbf{\\Gamma}}^T\\widetilde{\\mathbf{\\Gamma}}\\mathbf{u}
-2(\\widetilde{\\mathbf{b}}^T\\widetilde{\\mathbf{\\Gamma}})\\mathbf{u}+\\widetilde{\\mathbf{b}}^T\\widetilde{\\mathbf{b}}
$, we denote $\\mathbf{H}=\\frac{1}{2}\\widetilde\\mathbf{\\Gamma}^T\\widetilde\\mathbf{\\Gamma}, \\mathbf{d}=-2(\\widetilde\\mathbf{\\Gamma}^T\\widetilde\\mathbf{b})$, $\\mathbf{D}=-\\widehat\\mathbf{\\Gamma}(\\mathbf{H}^T\\mathbf{H})^{-1}\\mathbf{H}^T\\widehat\\mathbf\\Gamma^{T}$, $\\mathbf{c}=\\widehat\\mathbf{b}+\\widehat\\mathbf{\\Gamma}(\\mathbf{H}^T\\mathbf{H})^{-1}\\mathbf{H}^T\\mathbf{d}$; and form a Lagrangian from the original problem (DS2). $$\\begin{aligned}
\\label{dualL}
% \\nonumber to remove numbering (before each equation)
D(\\mu) &=& \\min_{\\mathbf{u}}\\mathcal{L}(\\mathbf{u},\\mu) \\\\
\\nonumber &=& \\min_{\\mathbf{u}}\\left(
\\frac{1}{2}\\mathbf{u}^T\\mathbf{H}\\mathbf{u}+\\mathbf{d}^T\\mathbf{u}+\\widetilde\\mathbf{b}^T\\widetilde\\mathbf{b}
+\\mu^T(-\\widehat\\mathbf\\Gamma \\mathbf{u}+\\widetilde\\mathbf{b})
\\right)\\end{aligned}$$
Since the objective function is convex, the necessary and sufficient condition for a minimum is that the gradient must vanish,i.e., $$\\label{DualImplicit}
\\mathbf{H}\\mathbf{u}+\\mathbf{d}-\\hat\\mathbf{\\Gamma}^T\\mathbf{\\mu}=0.$$
For $n<N$, $\\widetilde{\\mathbf{\\Gamma}}$ is not full rank. Therefore, $\\mathbf{H}$ is singular and there exist multiple solutions to (\\[DualImplicit\\]). Using pseudoinverse [@Horn90], we can find a solution to (\\[DualImplicit\\]) given by $$\\mathbf{u}=-(\\mathbf{H}^T\\mathbf{H})^{-1}\\mathbf{H}^T\\left(\\mathbf{d}-\\hat\\mathbf{\\Gamma}^T\\mu\\right).$$ Thus, after replacing into (\\[dualL\\]), we obtain $\\mu$ as a solution to the dual problem (DDS2). $$\\label{DDS2}
\\textrm{(DDS2)} \\max_{\\mu\\geq0} \\frac{1}{2}\\mu^T\\mathbf{D}\\mu+\\mu^T\\mathbf{c}-\\frac{1}{2}\\mathbf{d}^T(\\mathbf{H}^T\\mathbf{H})^{-1}\\mathbf{H}^T\\mathbf{d}+\\mathbf{b}^T\\mathbf{b}$$
The problem (LDS2) and dual problem (DDS2) can be solved using unconstrained optimization algorithms in [@BAZ93], [@BER03].
Iterative Algorithm
===================
In this section, we develop algorithm for the case of nonempty $F$ set. Let $u_i(n)$ denote the power at channel $i$ at step $n$. An iterative algorithm is given as follows. $$\\label{GenItAlg1}
\\left\\{
\\begin{array}{ll}
u_i(n+1)=\\frac{\\beta_i}{\\alpha_i}-\\frac{1}{a_i}\\left(\\frac{1}{OSNR_i(n)}-\\Gamma_{i,i}\\right)u_i(n), & \\forall i\\in\\mathcal{N}_1; \\\\
u_i(n+1)=\\frac{\\gamma_i}{1-\\gamma_i\\Gamma_{i,i}}\\left(\\frac{1}{OSNR_i(n)}-\\Gamma_{i,i}\\right)u_i(n), & \\forall i\\in\\mathcal{N}_2.
\\end{array}
\\right.$$
Algorithm (\\[GenItAlg1\\]) converges provided that $a_i>\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}$ and $\\gamma_i$ is chosen such that $\\gamma_i<\\frac{1}{\\sum_{j\\in\\mathcal{N}}\\Gamma_{i,j}}$.
We use a similar approach from [@PAV06a] to show the convergence of (\\[GenItAlg1\\]). Let’s define $e_i(n)=u_i(n)-u_i^*$, where $u_i^*$ is given in (\\[eqSoln\\]). Since $\\overline\\mathbf{\\Gamma}\\mathbf{u}^*=\\overline\\mathbf{b}$, $\\widetilde{\\Gamma}_{i,i}u_i^*+\\sum_{j\\neq i}\\widetilde{\\Gamma}_{i,j}u_j^*=\\tilde{b}_i$, for $i\\in\\mathcal{N}_1$; and, $\\widehat{\\Gamma}_{i,i}u_i^*+\\sum_{j\\neq
i}\\widehat{\\Gamma}_{i,j}u_j^*=\\hat{b}_i$, for $i\\in\\mathcal{N}_2$.
Substitute the expression for $u_{i}^*$ into $e_i(n+1)$, and we obtain $e_i(n+1)=u_i(n+1)-u_i^*=-\\frac{1}{{a_i}}\\left[\\sum_{j\\neq i}{\\Gamma}_{i,j}(u_j(n)-u_j^*)\\right]$, for $i\\in\\mathcal{N}_1$; and $e_i(n+1)=u_i(n+1)-u_i^*=\\frac{1}{1-{\\Gamma}_{i,i}\\gamma_i}\\left[\\sum_{j\\neq i}{\\Gamma}_{i,j}\\gamma_i(u_j(n)-u_j^*)\\right]$, for $i\\in\\mathcal{N}_2$. Let $\\mathbf{e}=[e_i(n)],i\\in\\mathcal{N}$. Therefore, for $i\\in\\mathcal{N}_1$, $$\\begin{aligned}
% \\nonumber to remove numbering (before each equation)
|e_i(n+1)|
&=& \\left|\\frac{1}{a_i}\\left[\\sum_{j\\neq
i,j\\in\\mathcal{N}}\\Gamma_{i,j}(e_j(n))\\right]\\right| \\\\
&\\leq & \\frac{1}{a_i}\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}\\max_{j\\in\\mathcal{N}}|e_j(n)|\\\\
&\\leq & \\frac{1}{a_i}\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}\\|\\mathbf{e}(n)\\|_\\infty.\\end{aligned}$$ and similarly, for $i\\in\\mathcal{N}_2$, $$\\begin{aligned}
% \\nonumber to remove numbering (before each equation)
\\nonumber |e_i(n+1)| &=& \\left|\\frac{1}{1-\\Gamma_{i,i}\\gamma_i}\\left[\\sum_{j\\neq
i,j\\in\\mathcal{N}}\\Gamma_{i,j}\\gamma_i(e_j(n))\\right]\\right| \\\\
&\\leq & \\frac{\\gamma_i}{|1-\\Gamma_{i,i}\\gamma_i|}\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}\\max_{j\\in\\mathcal{N}}|e_j(n)|.\\\\
&\\leq & \\frac{\\gamma_i}{|1-\\Gamma_{i,i}\\gamma_i|}\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}\\|\\mathbf{e}(n)\\|_\\infty.\\end{aligned}$$ Since we assumed that $a_i>\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}$ and $\\gamma_i$ is chosen such that $\\gamma_i<\\frac{1}{\\sum_{j\\in\\mathcal{N}}\\Gamma_{i,j}}\\leq\\frac{1}{\\Gamma_{i,i}}$, we can conclude that $\\|\\mathbf{e}(n)\\|\\rightarrow 0$ from the contraction mapping theorem. As a result, we have $u_i(n)\\rightarrow u_i^*$ as $n\\rightarrow \\infty$, for $i\\in\\mathcal{N}$.
From the proof, we note that the rate of convergence of \\[GenItAlg\\] is determined by $$\\sigma=\\max\\left\\{\\max_{i\\in\\mathcal{N}_1}\\frac{\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}}{a_i},\\max_{i\\in\\mathcal{N}_2}\\frac{\\sum_{j\\neq i,j\\in\\mathcal{N}}\\Gamma_{i,j}\\gamma_i}{1-\\Gamma_{i,i}\\gamma_i}\\right\\}.$$ In addition, it is easy to observe that the OSNR target-seeking users are algorithmically equivalent to competition seeking users by letting $\\beta_i/\\alpha_i=0$ and $a_i=\\Gamma_{i,i}-\\frac{1}{\\gamma_i}$, $i\\in\\mathcal{N}_2$. This is because no notion of pricing is used for the OSNR target seekers and they just have a utility target to meet or equivalently optimize by letting $a_i=\\Gamma_{i,i}-\\frac{1}{\\gamma_i}$.
Numerical Examples
==================
In this section, we illustrate the concept by a MATLAB simulation. We consider an end-to-end link described in Figure \\[oplink\\] with 5 amplified spans. We assume channels are transmitted at wavelengths distributed centered around 1555nm with channel separation of 1nm. Suppose input noise power is 0.5 percent of the input signal power. The gain profile for each amplifier is identically assumed to be parabolic as in Figure \\[GainProfile\\], which is normalized with respect to $G_{\\max}=30.0$dB. Suppose 20dB is the target OSNR level for users who just want to meet a satisfactory level of transmission. We first show the case of 3 users, in which 2 users need better quality of service and one user is simply interested in meeting 20dB as a target. From Figure \\[3userDS\\], we can observe that users who need better services reach an OSNR of 26.33dB and 29.20dB, respectively. With an appropriate choice of initial conditions, the algorithm quickly converges in 1-2 steps. In Figure \\[30userDS\\], we similarly show the case of 30 users, in which 20 are game players and 10 are target seekers.
![Optical Amplifier Spectral Profile[]{data-label="GainProfile"}](GainProfile.eps "fig:")\\
![OSNR simulation with 3 users in time steps[]{data-label="3userDS"}](3userDS.eps "fig:")\\
![OSNR simulation with 30 users in time steps[]{data-label="30userDS"}](30userDS.eps "fig:")\\
Conclusion
==========
In this paper, we examined a generalized power control model in optical networks, which combines features of central cost approach and game-theoretical approach. It enables two major service types in the network. One is game player, who pays for his power consumption and the other is target seeker, who is satisfied with a minimum service level set by the network. We discussed two different solutions concepts for nonempty and empty feasible set respectively and specifically designed an iterative algorithm that converges to a unique solution for the case of nonempty feasible set. The convergence of the algorithm was proved and illustrated by numerical examples of a WDM end-to-end optical link.
In this work, we didn’t include capacity constraints for the sake of simplicity. We hope this work will lead to future investigations of more complicated cases where network constraints and nonlinear effects are considered. In addition, we expect this framework to be used to solve similar problems in other types of networks, for example, wireless networks.
[^1]: Quanyan Zhu is with the Department of Electrical and Computer Engineering, University of Illinois at Urbana Champaign, IL, 61801, USA email: zhu31@illinois.edu; L. Pavel is with the Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, M5S 3L1 Canada e-mail:pavel@control.utoronto.ca.
[^2]: DSNP stands for “Differentiated Service N-person Problem”.
|
Q:
While Committing Changes, I constantly see and commit different redundant files. Is there a way to fix this?
As I can see in the screenshot, although I only made changes to the CustomExtension.cs file, +99 Changes has occurred and this is a problem for me. Is there a way I can fix it? I do it in Visual Studio.
A:
You need specify a .gitignore file. This is intended to filter files that should not be tracked and stored in a repository - for example build results (dll), visual studio specific files (.suo) etc. That's a common practice in programming.
When you create a new project in GitHub you may want to select from default list (see screenshot)
Here are details of .gitignore file format.
|
Download System Shock Remake Demo Version for PC Free
Download System Shock Remake Demo Version for PC Free - After 2 a long time, Nightdive Studios is rebooting and re-imagining the unique Formula Surprise. We will shop the brand new online game excellent to the traditional event, preserving all the matters you liked at the same time as giving today’s game enthusiasts the fashionable appearance and think anticipated from a AAA identify. |
// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef COMPONENTS_DOM_DISTILLER_CONTENT_BROWSER_DOM_DISTILLER_VIEWER_SOURCE_H_
#define COMPONENTS_DOM_DISTILLER_CONTENT_BROWSER_DOM_DISTILLER_VIEWER_SOURCE_H_
#include <memory>
#include <string>
#include "base/compiler_specific.h"
#include "content/public/browser/url_data_source.h"
#include "content/public/browser/web_contents.h"
namespace dom_distiller {
class DomDistillerServiceInterface;
class DomDistillerViewerSourceTest;
// Serves HTML and resources for viewing distilled articles.
class DomDistillerViewerSource : public content::URLDataSource {
public:
DomDistillerViewerSource(DomDistillerServiceInterface* dom_distiller_service,
const std::string& scheme);
~DomDistillerViewerSource() override;
class RequestViewerHandle;
// Overridden from content::URLDataSource:
std::string GetSource() override;
void StartDataRequest(
const GURL& url,
const content::WebContents::Getter& wc_getter,
content::URLDataSource::GotDataCallback callback) override;
std::string GetMimeType(const std::string& path) override;
bool ShouldServiceRequest(const GURL& url,
content::BrowserContext* browser_context,
int render_process_id) override;
std::string GetContentSecurityPolicy(
network::mojom::CSPDirectiveName directive) override;
DomDistillerViewerSource(const DomDistillerViewerSource&) = delete;
DomDistillerViewerSource& operator=(const DomDistillerViewerSource&) = delete;
private:
friend class DomDistillerViewerSourceTest;
// The scheme this URLDataSource is hosted under.
std::string scheme_;
// The service which contains all the functionality needed to interact with
// the list of articles.
DomDistillerServiceInterface* dom_distiller_service_;
};
} // namespace dom_distiller
#endif // COMPONENTS_DOM_DISTILLER_CONTENT_BROWSER_DOM_DISTILLER_VIEWER_SOURCE_H_
|
[Estradiol and progesterone receptors in human endometrium during the menstrual cycle].
The concentrations of estradiol and progesterone receptors are measured in the cytoplasmic and nuclear fractions of endometrial samples obtained by biopsy throughout the menstrual cycle. The standardized micromethod accounts for the sites occupied by endogenous hormones and for interference by androgen receptors and plasma binding proteins. In normal women, the cellular concentration of estradiol receptor increases early in the cycle and decreases steadily after ovulation. The progesterone receptor is maximum between the 10th and 15th day of the cycle and decreases during the luteal phase. The nuclear/cytoplasmic ratios of both receptors follow the variations of circulating hormones. These data constitute a new basis for physiopathological and pharmacological investigations on the hormonal control of the human uterus. |
Modeling premature occurrence of acute coronary syndrome with atherogenic and thrombogenic risk factors and gene markers in extended families.
The interaction between genetic and environmental risk factors in determining premature cardiovascular events has been largely investigated in case-control association studies. By contrast, few family based analyses have been performed so far. From a series of 2936 subjects aged 45-64, we selected probands who died for a premature (<50 years) ischemic heart disease (IHD) and with at least one family member with a history of IHD also occurring under the age of 50. Ninety-four families from 32 pedigrees including 296 subjects were identified. In this population, we analyzed the relationship between background risk factors [age, gender, the G1691A polymorphisms of factor V gene, the C677T polymorphisms of the methylenetetrahydrofolate reductase (MTHFR) gene, the 844ins68bp polymorphisms of the cystathionine-beta-synthase (CBS) gene, and the apolipoprotein E (APOE) polymorphisms] and environmental risk factors, both atherogenic (smoke, hypertension, diabetes, dyslipidemia, obesity) and thrombogenic (smoke, homocysteine, fibrinogen) by a Markov block-recursive modeling approach. None of the studied polymorphisms had an independent direct effect on the risk of IHD. As opposed to atherogenic factors, thrombogenic factors (homocysteine and fibrinogen) turned out to be possible mediators of the indirect effect of the MTHFR gene on IHD risk (OR: 1.30; 95% CI: 1.01-1.69, for every 8 mm increase in plasma levels of homocysteine in TT-carriers compared with CT/CC-carriers (OR: 1.11; 95% CI: 1.01-1.22), for every 20 g L(-1) increase in plasma levels of fibrinogen in TT-carriers compared with CT/CC-carriers). Plasma levels of homocysteine and fibrinogen may be interpreted as intermediate factors mediating the effect of predisposing genes on the risk premature cardiovascular disease. |
Q:
PLS-00049: bad bind variable Triggers
I'm trying to make this trigger work. What it does is, this will execute before deleting data from a table and its affiliated table, then insert that deleted data into 2 tables (which I named into tb1_arch and tb2_arch). I've been searching possible fixes in google but I really have no idea how to make this work
CREATE OR REPLACE TRIGGER trig
BEFORE DELETE ON tb1 FOR EACH ROW
FETCH
INSERT INTO tb1_arch VALUES (:old.OrderNum, :old.tb1Date,:old.CustomerName);
DBMS_OUTPUT.PUT_LINE('Data archived.');
END;
the trigger was created above. but when I added this line
INSERT INTO tb2_arch VALUES (:old.OrderNum, :old.ItemNum, :old.Pieces);
after INSERT INTO tb1_arch VALUES, it gives me an error
"Error at line 5: PLS-00049: bad bind variable 'OLD.PIECES'"
Any help would be appreciated!
EDIT: as Mr. Vijayakumar suggested, I did the following:
CREATE OR REPLACE TRIGGER trig
BEFORE DELETE ON tb1
REFERENCING OLD AS old FOR EACH ROW
INSERT INTO tb1_arch VALUES (:old.OrderNum, :old.tb1Date,:old.CustomerName);
INSERT INTO tb2_arch VALUES (:old.OrderNum, :old.ItemNum, :old.Pieces);
DBMS_OUTPUT.PUT_LINE('Data archived.');
END
However, I'm still having the same error.
EDIT: removed FETCH, I'm still encountering the same problem
CREATE OR REPLACE TRIGGER trig
BEFORE DELETE ON tb1 FOR EACH ROW
INSERT INTO tb1_arch VALUES (:old.OrderNum, :old.tb1Date,:old.CustomerName);
INSERT INTO tb2_arch VALUES (:old.OrderNum, :old.ItemNum, :old.Pieces);
DBMS_OUTPUT.PUT_LINE('Data archived.');
END;
The table are as follows:
tb1:
create table tb1 (
OrderNum integer NOT NULL primary key,
tb1Date date NOT NULL,
CustomerName varchar2(50) NOT NULL,
--constraints
CONSTRAINT tb1_uc unique (CustomerName)
);
tb2
create table tb2 (
OrderNum integer NOT NULL,
ItemNum integer NOT NULL,
Pieces integer NOT NULL,
--constraints
CONSTRAINT tb2_fk foreign key (OrderNum) references tb1(OrderNum),
);
A:
The keyword FETCH should be causing this, replace it by BEGIN, which is the right syntax,
CREATE OR REPLACE TRIGGER trig
BEFORE DELETE ON tb1 FOR EACH ROW
BEGIN
INSERT INTO tb1 VALUES (:old.OrderNum, :old.Date,:old.CustomerName);
INSERT INTO tb2_arch VALUES (:old.OrderNum, :old.ItemNum, :old.Pieces);
DBMS_OUTPUT.PUT_LINE('Data archived.');
END;
EDIT: The column name you refer using OLD might be invalid, which is the reason for this error.
Trigger will be applicable for only ONE Table's INSERT/UPDATE/DELETE event. Though, you can refer multiple tables in the body.
But OLD and NEW will be always referring the table you mentioned in DDL like DELETE ON tb1.
The below modified code will help you.
CREATE OR REPLACE TRIGGER trig
BEFORE DELETE ON tb1 FOR EACH ROW
DECLARE
v_ItemNum tb2.ItemNum%TYPE;
v_Pieces tb2.Pieces%TYPE;
BEGIN
INSERT INTO tb1_arch VALUES (:old.OrderNum, :old.Date,:old.CustomerName);
/* Select the values for this item from table 2 */
SELECT ItemNum,Pieces
INTO v_ItemNum,v_Pieces
FROM tb2
WHERE OrderNum = :old.OrderNum;
/* Insert the selected values in the table2's archive version */
INSERT INTO tb2_arch VALUES (:old.OrderNum, v_ItemNum, v_Pieces);
/* Delete the entry */
DELETE from tb2 WHERE OrderNum = :old.OrderNum;
DBMS_OUTPUT.PUT_LINE('Data archived.');
END;
Alternatively, you can have another trigger for delete on table2 and archive the data there.
|
Q:
The application cannot be opened because its executable is missing
I have an application that I have been developing for some time now. Recently launching the application via a double click presents a dialog that says "You can't open the application RepoWatch because it may be damaged or incomplete."
Launching the application via open ./RepoWatch.app gives me "The application cannot be opened because its executable is missing."
I usually launch the application via ./RepoWatch.app/Contents/MacOS/RepoWatch simply out of habit (which DOES work), so I am unsure how long this has been happening, or what change happened immediately before hand. The most likely change is that I put cp Info.plist ./RepoWatch.app/Contents/ into my make file in order to version Info.plist without versioning everything in the .app bundle.
I have looked at Info.plist many times and cannot find anything wrong with it. The file opens up with Property List Editor without any errors. Saving from Property List Editor does not make the file "work" (if it is to blame in the first place).
The permissions as far as I can tell also look sane:
$ ls -l
./RepoWatch.app/Contents/Info.plist
-rw-rw-r--@ 1 dgrace staff 789 Feb 1 23:20 ./RepoWatch.app/Contents/Info.plist
$ ls -l
/Applications/Adium.app/Contents/Info.plist
-rw-rw-r-- 1 dgrace staff 5750 Aug 21 15:41 /Applications/Adium.app/Contents/Info.plist
I am at a loss as to what to try next.
And here are the contents of Info.plist (Even though nothing has really changed in quite a while):
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
<key>CFBundleInfoDictionaryVersion</key>
<string>6.0</string>
<key>CFBundleDevelopmentRegion</key>
<string>English</string>
<key>CFBundleExecutable</key>
<string>RepoWatch</string>
<key>CFBundleIdentifier</key>
<string>com.doomstick.RepoWatch</string>
<key>CFBundleName</key>
<string>RepoWatch</string>
<key>CFBundleShortVersionString</key>
<string>1.0.0</string>
<key>LSMinimumSystemVersion</key>
<string>10.6</string>
<key>CFBundleVersion</key>
<string>Beta26</string>
<key>NSMainNibFile</key>
<string>MainMenu</string>
<key>NSPrincipalClass</key>
<string>NSApplication</string>
</dict>
</plist>
A:
Building on the answer that @smokris posted:
The problem seems to be with your app's registration in the Launch Services database. There is no need to rebuild the entire database. To force-update the entry for your app (specifically), use lsregister with the -f option:
/System/Library/Frameworks/CoreServices.framework/Frameworks/LaunchServices.framework/Support/lsregister -f MyApp.app
I was having the same problem you describe, and this worked for me. Thanks, @smokris!
A:
Rebuilding the Launch Services database solves this problem for me.
Try executing the following command in Terminal:
/System/Library/Frameworks/CoreServices.framework/Frameworks/LaunchServices.framework/Support/lsregister -kill -r -domain local -domain system -domain user
A:
The problem is likely due to an invalid CFBundleExecutable property value in the Info.plist file you are copying into the application.
In Xcode projects the default value for this property is a special variable (placeholder) value (${EXECUTABLE_NAME}) that is expanded (replaced) when the build system builds the application. Are you sure you need to copy this file manually? Maybe you can add a script build phase that makes whatever changes you need after it has been expanded and copied into place by the normal build process.
While you are at it, you should check for other placeholder values in the file. It is likely that you will need to fill in CFBundleName (others may also be necessary, depending on your application type).
|
Q:
Test doesn't execute method unless I assert on the method's returned value
Ok, I have a strange problem.
I'm using NUnit and Moq in a C# Test project. I think you can ignore the Mock-objects, since the real problem lies in UserManager.AddUser() not being properly executed.
The following code will never reach the breakpoint at the start of UserManager.AddUser(), and will thereby fail on the Assertion due to NullPointerException.
[Test]
enter code here
public void AddUser_NoPassword_GeneratesPassword()
{
//assert
var userRepositoryFake = new Mock<IUserRepository>();
userRepositoryFake.Setup(x => x.GetUser(It.IsAny<string>(), It.IsAny<bool>())).Returns((User)null);
userRepositoryFake.Setup(x => x.SaveUser(It.IsAny<User>())).Returns(new Mock<User>().Object);
var userManager = new UserManager(userRepositoryStub.Object);
var createUserViewModel = new CreateUserViewModel { Username = "username" };
//act
var validationErrors = userManager.AddUser(createUserViewModel);
//assert
Assert.IsNotNullOrEmpty(createUserViewModel.Password);
}
However, if I add this assertion:
//assert
Assert.IsEmpty(validationErrors); //new assertion
Assert.IsNotNullOrEmpty(createUserViewModel.Password);
The breakpoint in AddUser() is reached, and the test succeeds.
It seems the test doesn't execute AddUser() at all, unless its return-value is used for something.
A:
My guess is that AddUser is implemented like this:
public IEnumerable<Error> AddUser(Model model)
{
// Do some stuff
if (foo)
{
yield return ...;
}
if (bar)
{
yield return ...;
}
// More stuff
}
In other words, using an iterator block. Iterator blocks are executed lazily - the code only starts executing when the first element is requested, and even then it will "pause" when that element has been returned.
Given that this isn't an idempotent query or anything like that, I suggest it would make a lot more sense to implement the method using a List<Error> internally which you add to and then return at the end. That way the method will get executed exactly once however many times the return value is iterated over. That's the expected model of execution, I suspect.
|
Flash memory is an increasingly popular type of non-volatile memory (NVM). NVM is a type of memory storage that can retain data even while it is not powered on.
A typical flash memory includes a memory array having a large number of memory cells arranged in blocks. Each of the memory cells includes a field effect transistor having a control gate and a floating gate. Pairs of field effect transistors share a common source region. Conventional techniques for forming a common source region involve formation of floating gate and control gate structures prior to etching to form a common source region between the structures. As device sizes decrease a width between field effect transistors and an aspect ratio relating a depth to the common source region to a width between field effect transistors makes it difficult to etch a region for the common source without damaging gate structures of the transistors. |
Duncan Creek (Little Osage River)
Duncan Creek is a stream in Bates and Vernon counties in the U.S. state of Missouri. It is a tributary of the Little Osage River.
Duncan Creek has the name of Peter Duncan, a pioneer citizen.
See also
List of rivers of Missouri
References
Category:Rivers of Bates County, Missouri
Category:Rivers of Vernon County, Missouri
Category:Rivers of Missouri |
10 US Colleges that Offer International Students Most Financial Aid
Nearly 800 U.S. colleges report they awarded money to international students ,these gave the most.
For international students, studying in the United States can be a pricey endeavor. Many U.S. universities are expensive, cash-strapped, and in demand, giving some institutions little motivation to help international students financially. And unlike their American peers, international students typically don’t qualify for federal loans to help them fund their education.
But while financial aid for international students tends to be very scarce, it does exist. At least 776 colleges offered some amount of financial aid to undergraduate international students for the 2010-2011 school year, according to school-reported data to U.S. News. The average award packages ranged from several hundred dollars to tens of thousands, with the highest average packages topping $50,000.
The list below includes the 10 ranked schools that awarded the highest average financial aid packages to undergraduate international students for the 2010-2011 school year. Those schools enrolled varying numbers of students from abroad, but all awarded, on average, $47,469 or more.
Yale University tops the list of schools that offer the most generous average aid packages to undergraduate international students, reporting that the average award in 2010-2011 was $51,044. Like Yale, all the universities on the list below are private schools. Many are national liberal arts colleges, which means they focus on undergraduate education and grant at least half of all degrees in liberal arts majors, such as English, humanities, and philosophy. Nearly all are located in the northeastern United States, in states including Connecticut, Massachusetts, and New York.
Keep in mind that these statistics aren’t a guarantee of financial aid at a certain school. Since these awards are averaged over the number of international undergraduates enrolled, it’s possible that some students may have received much more money than their international peers at the same school. In addition, schools that are designated by U.S. News as Unranked, meaning they did not meet certain criteria required by U.S. News to be numerically ranked, were not eligible to be on this list.
These 10 schools awarded the highest average aid packages to undergraduate international students for the 2010-2011 school year: |
Q:
Grails: What is to set in the controller in order to reach the error handling in the URL mapping?
Using Grails 2.3.9
In the controller I'm trying to make a request go through the error handling declared in the URL mappings. I've read the docs, but I still don't get how this works.
From the example of the documentation:
static mappings = {
"403"(controller: "errors", action: "forbidden")
"404"(controller: "errors", action: "notFound")
"500"(controller: "errors", action: "serverError")
}
For example in a controller:
def update() {
// do some tests
if(forbidden) {
// Go to 403
//response.status = response.SC_FORBIDDEN
render status: 403
return
}
// deal with normal case
}
What do I have to do in the controller in order to land on the 403 action? Doing response.status = response.SC_FORBIDDEN or render status: 403 is not working.
I was able to achieve going through mappings 403 by throwing a custom exception ForbiddenException while the url mappings would contain:
"403"(controller: "errors", action: "forbidden", exception: ForbiddenException)
However, I guess, reaching the error controller through another controller should also go with throwing an exception for each case, no?
A:
Try this
response.sendError 403
and make sure you have created controller and action as in your URL mapping and rendered something from action.
|
I believe we just saw what Fysical with a F looks like
I like what I saw on Saturday from our o-line. I really hope they can get consistent and continue to open some big holes for Gore and Coffee this season. I like how our guys seemed to wear down and then over power the 2-4th stringers.
I really hope the team is buying what Sing is selling. And as much animosity fans are having for Crabtree, if this guy can relate his talent to the pro game I think we will be a very balanced offense sometime this year or next. The QB situ. doesn't scare me if we can move the ball with runs and short passes for 10-15 yards here and there.
Yeah we don't have a top QB but I think Hill can manage the game well enough to get us some wins and not make stupid mistakes. Our offense will only get better bc now we don't have to worry about our OC not sticking around.
I really think we will go 9-7 or better this year. We are definetly on the right track.
Yeah, that was fantastic. We ran the ball over and over again, they knew we were gonna run, and they still couldn't stop us. Very encouraging. Our Time of Possession has been awful for the last few years, and hopefully this year will change that.
Originally posted by LA9erFan:Yeah, that was fantastic. We ran the ball over and over again, they knew we were gonna run, and they still couldn't stop us. Very encouraging. Our Time of Possession has been awful for the last few years, and hopefully this year will change that.
I knew this would happen when we grabbed Rathman. The dude knows how to coach runners...
Originally posted by LA9erFan:Yeah, that was fantastic. We ran the ball over and over again, they knew we were gonna run, and they still couldn't stop us. Very encouraging. Our Time of Possession has been awful for the last few years, and hopefully this year will change that.
I knew this would happen when we grabbed Rathman. The dude knows how to coach runners...
Originally posted by LA9erFan:Yeah, that was fantastic. We ran the ball over and over again, they knew we were gonna run, and they still couldn't stop us. Very encouraging. Our Time of Possession has been awful for the last few years, and hopefully this year will change that.
Lets not get too carried away... I liked what I saw, but it was against the Raiders! I think their run defense was 32nd last year.
This is exactly what they wanted with a "run first" offense. The Raiders knew we were going to run, and could not do a damn thing about it. Granted, some of the holes were gaping, but it still looked good...
This site is neither endorsed, nor sponsored by, nor affiliated with San Francisco 49ers or NFL Properties LLC. 49ers is a registered trademark of the San Francisco 49ers LLC. All teams and players mentioned are registered trademarks of the NFL and its respective teams. The use of any team names, words, trademarks, logos or photos have been used for descriptive purposes only. The content and information from other sites is the property of their respective owners. Player and team photos used with permission from USA TODAY Sports Images. |
(a) Field of the Invention
The present invention relates to a channel access method for supporting vehicle communication handover.
(b) Description of the Related Art
Wireless access in vehicular environments (WAVE) is technology that supplements a conventional wireless local area network (WLAN) (IEEE 802.11) method in order to support communication of a vehicle moving at a high speed. Intelligent transport systems using such WAVE communication include roadside equipment (hereinafter referred to as “RSE”) that is positioned at the roadside and on-board equipment (hereinafter referred to as “OBE”) that is mounted in a vehicle and perform vehicle-to-infrastructure (V2I) communications between the OBE and the RSE and vehicle-to-vehicle (V2V) communications between the OBEs.
To continuously provide a communication service under the road conditions to which the intelligent transport system is applied, base stations are disposed so that propagation ranges with neighboring base stations may be overlapped. When the propagation ranges of the base stations are overlapped, the base stations use the same frequency as the neighboring base stations to generate interference and communication problems caused by the neighboring base stations.
The above information disclosed in this Background section is only for enhancement of understanding of the background of the invention and therefore it may contain information that does not form the prior art that is already known in this country to a person of ordinary skill in the art. |
Aluminum Chain Ladder
Manufacturer of a wide range of products which include aluminum chain ladder.
Aluminum Chain Ladder
Get Best Quote
Approx. Price: Rs 2,200 / PieceGet Latest Price
Product Details:
Material
Aluminum, MS
Height
10 to 80 ft
Diameter
25 mm (1")
Fluted Aluminium Pipe at Required Distance
12" (300mm)
Backed by the team of expert professionals, our firm is engaged in providing Aluminum Chain Ladder. These ladders can be easily fitted on the wall to be climbed. Moreover, we offer it at pocket-friendly rates. |
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
// https://html.spec.whatwg.org/multipage/#htmloptionscollection
interface HTMLOptionsCollection : HTMLCollection {
// inherits item(), namedItem()
[CEReactions]
attribute unsigned long length; // shadows inherited length
[CEReactions, Throws]
setter void (unsigned long index, HTMLOptionElement? option);
[CEReactions, Throws]
void add((HTMLOptionElement or HTMLOptGroupElement) element, optional (HTMLElement or long)? before = null);
[CEReactions]
void remove(long index);
attribute long selectedIndex;
};
|
/*
* Copyright (c) 2015 Kaprica Security, Inc.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
*/
#ifndef MATH_H_
#define MATH_H_
#define NAN __builtin_nan("")
#define PI 3.14159265358979323846264338327950288
static inline double fmin(double a, double b)
{
return a < b ? a : b;
}
static inline double fmax(double a, double b)
{
return a > b ? a : b;
}
#endif
|
Q:
Rake db:migrate error 'PG::UndefinedColumn: ERROR: column "slug" does not exist'
I am cloning my own repo on to my local machine that another developer has done some work on. I am trying to migrate the database and receiving this error:
/Users/lewisfrost/.rbenv/versions/2.2.3/lib/ruby/gems/2.2.0/gems/activesupport-4.0.1/lib/active_support/values/time_zone.rb:282: warning: circular argument reference - now
DEPRECATION WARNING: Support for Rails < 4.1.0 will be dropped. (called from <top (required)> at /Users/lewisfrost/frostfires/config/application.rb:8)
== AddUploadFileToAnswer: migrating ==========================================
-- add_column(:answers, :upload_file, :string)
-> 0.0006s
-- add_index(:answers, :slug)
rake aborted!
StandardError: An error has occurred, this and all later migrations canceled:
PG::UndefinedColumn: ERROR: column "slug" does not exist
: CREATE INDEX "index_answers_on_slug" ON "answers" ("slug")/Users/lewisfrost/frostfires/db/migrate/20140126204815_add_upload_file_to_answer.rb:4:in `change'
ActiveRecord::StatementInvalid: PG::UndefinedColumn: ERROR: column "slug" does not exist
: CREATE INDEX "index_answers_on_slug" ON "answers" ("slug")
/Users/lewisfrost/frostfires/db/migrate/20140126204815_add_upload_file_to_answer.rb:4:in `change'
PG::UndefinedColumn: ERROR: column "slug" does not exist
/Users/lewisfrost/frostfires/db/migrate/20140126204815_add_upload_file_to_answer.rb:4:in `change'
Tasks: TOP => db:migrate
(See full trace by running task with --trace)
SCHEMA.rb
create_table "answers", force: true do |t|
t.string "user"
t.text "body"
t.integer "question_id"
t.datetime "created_at"
t.datetime "updated_at"
t.integer "user_id"
t.string "upload_file"
t.string "slug"
end
Migration file
class AddUploadFileToAnswer < ActiveRecord::Migration
def change
add_column :answers, :upload_file, :string
add_index :answers, :slug
end
end
Any advice is great
A:
Pretty sure that you don't have slug column in your answers table.
So add that using a migration:
rails g migration AddSlugToAnswers slug:string
Then, run the migration:
bundle exec rake db:migrate
|
Curry Up Now, New Fast-Casual Indian Spot, Officially Open in Hoboken
You are here:HomeEvents + NewsCurry Up Now, New Fast-Casual Indian Spot, Officially Open in Hoboken
If you’ve been craving Indian food, Curry Up Now is the newest solution to your cravings, as the Indian fast-casual eatery chain is officially open in the Mile Square. Formerly the home of Wok to Walk, Curry Up Now has moved into the previously vacant space at 91 Washington Street where it is now serving Thali platters, ghee makini bowls, burritos, and more. Read on to learn all about Curry Up Now in Hoboken — which is open as of Thursday, January 23, 2020.
About Curry Up Now
Curry Up Now was established back in 2009 by Akash Kapoor and his wife Rana. What began as a California food truck, quickly turned into the largest and fastest-growing Indian fast-casual concept in the U.S., with a total of seven brick-and-mortar locations nationwide. This new Mile Square location marks Curry Up Now’s second New Jersey outpost, with a Newark location opening soon following the Hoboken opening.
So, why Hoboken? Don’t forget, Curry Up Now is now a franchise, so this Mile Square restaurant is the second of five NJ locations secured by local franchisees, Pritesh Benjamin and Tejavsi Patel.
Benjamin and Patel are also in charge of the soon-to-be Newark location as well {which is coming to 58 Halsey Street}.
“Hoboken has always been my second home, so I’m very excited to introduce Curry Up Now’s unique and innovative Indian food to the diverse population and customers in this city,” said Benjamin in an official press release. “We secured a prime location in the Historic District that is close to the train station where many people pass through every day. We have full confidence that Curry Up Now will be an exciting, convenient option for commuters and quickly become an integrated part of the community.”
In addition to expansion planned for the state of New Jersey, plans for Curry Up Now locations to sprout up elsewhere in Cali, Georgia, and Utah are already in the works.
What’s on the Menu
Wondering what’s on the menu? We’ve mentioned a few staples, but we can’t forget fan-favorites like Quesadillix {quesadillas}, Sexy Fries, and the Naughty Naan. At Curry Up Now, you’ll also find tikka masala burritos and the Deconstructed Samosa, a dish described as “an inside out phenomenon loaded with chana, pico kachumber, chutneys, mini samosas.” If you’re new to the samosa, it’s a fried or baked pastry with a savory filling of spiced potatoes, onions, peas, meat, and/or lentils.
Beyond the Food
“We are super excited to be opening in Hoboken and Newark thereafter,” said Kapoor in the press release. “This is just the beginning of Curry Up Now’s East Coast expansion. Our real estate team in the New York TriState area, headed by Raj Whadwa at Newmark Knight Frank, is aggressively seeking sites for future Curry Up Now locations. Additionally, there’s some solid interest from franchisees in Massachusetts, Indiana, Michigan and southern New Jersey.”
Curry Up Now currently has 41 franchised and corporate stores sold and in varying stages of development. It has been recognized in Inc 5000’s list of fastest-growing private companies, QSR’s 40 Under 40, Nation’s Restaurant News’ 2018 Breakout Brands, and has even been listed as #20 in Fast Casual’s Top 100 Movers and Shakers 2019, and named a Hot Food + Beverage Chain by the International Council of Shopping Centers.
For now, be sure to pop by the Washington Street location from 12:00PM-8:00PM daily to enjoy some of the delicious food offered here.
We release new episodes every Tuesday!
Join Our Mailing List
Stephanie Osmanski writes honest things about health, the planet, and being a woman. Her words have appeared on Business Insider, Parade, Eat This Not That, Dogster, Scary Mommy, Green Matters, Parents, Seventeen, Life & Style, InTouch Weekly, and more. Her articles have been syndicated on World Economic Forum, MSN, MSN UK, and MSN Canada. In her free time, Stephanie and her registered therapy dog, Koda, volunteer at local hospitals, nursing homes, and other healthcare facilities. |
Andrzej Kalwas
Andrzej Jan Kalwas (born 23 June 1936 in Włoclawek) is a Polish lawyer, legal adviser, former minister of justice and attorney general in the government of Marek Belka.
Biography
In 1963 he graduated from law studies at the University of Warsaw. He completed the apprenticeship at the State Commercial Arbitration, and in 1965 he started his career as a legal adviser. Since 1990, he has been the founder in the law firm of "Kalwas i wspólnicy".
In the years 1983-1995 he was the dean of the board of the District Chamber of Legal Advisors in Warsaw, and in the years 1995-2004 the president of the National Council of Legal Advisors.
In the periods 1989-1991 and 2002-2004 he was a member of the State Tribunal. He was also one of the founders of the Polish Chamber of Commerce. In 2004, he ran unsuccessfully in the elections to the European Parliament from the Warsaw list of the Voting Committee Together for the Future, formed by various non-governmental organizations.
On September 6, 2004, he was appointed by President Aleksander Kwaśniewski as the Minister of Justice in the government of Marek Belka, replacing Marek Sadowski. He served this function until the end of October 31, 2005.
On April 18, 2018, he was detained by officers of the Central Anticorruption Bureau in order to present him with charges as part of the investigation of persons claiming to be special services officers during the government of Civic Platform. He was released the next day on April 19, 2018.
Personal life
Andrzej Kalwas was married to Hana Kalwas from 1950s till late 1990s. They have two children, Piotr Ibrahim Kalwas and Katarzyna Adamiak.
References
Kalwas: Jestem suwerenny i odporny na naciski, „Puls Biznesu” z 3 września 2004
Skocz do góry↑ M.P. 1997 nr 12 poz. 94
Skocz do góry↑ M.P. 2000 nr 5 poz. 99
Skocz do góry↑ Członkowie samorządu radców prawnych odznaczeni. prezydent.pl, 27 September 2012. [date 28-09-2012].
Skocz do góry↑ M.P. 2013 poz. 214
Category:1936 births
Category:Polish lawyers
Category:Government ministers of Poland
Category:Living people |
Q:
What type of microcontroller do I have?
For my birthday I got a small NSOP-A Microcontroller in a kit and I was wondering if I could use it to convert analog signals to 8-bit digital signals for My raspberry pi. Anyway, that isn't the question.
I was looking to see how to program it and I could not find any documentation on what sort of architecture it used.
The Microcontroller I'm using is the HT46f47e(made by holtek).
What type of chip is it?
And how would I program it?
A:
The HT46f47e made by Holtek is a 8-bit high performance RISC architecture microcontroller. Designed especially for applications that interface directly to analog signals, such as those from sensors. (http://www.holtek.com/productdetail/-/vg/46f4xe)
The main Features are:
13 to 23 bidirectional I/O lines
External interrupt input shared with an I/O line
8-bit programmable Timer/Event Counter with overflow interrupt and
7-stage prescaler
On-chip crystal and RC oscillator
Watchdog Timer function
PFD for audio frequency generation
Power down and wake-up functions to reduce power consumption
Up to 0.5us instruction cycle with 8MHz system clock at VDD=5V
4 or 6-level subroutine nesting
4 channels 8 or 9-bit resolution A/D converter
1 or 2 channel 8-bitPWMoutput shared with I/O lines
Bit manipulation instruction
Table read instructions
63 powerful instructions
All instructions executed in one or two machine cycles
Low voltage reset function
Flash program memory can be re-programmed up to 100,000 times
EEPROM data memory can be re-programmed up to 1,000,000 times
Flash program memory data retention > 10 years
EEPROM data memory data retention > 10 years
ICP (In-Circuit Programming) interface
Range of packaging types
One of the possibles programmers is the EIC-300 of Holtek.
http://www.elektronik-labor.de/Holtek/Holtek7.html
|
/*
Real-time Online/Offline Charging System (OCS) for Telecom & ISP environments
Copyright (C) ITsysCOM GmbH
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>
*/
package v1
import (
"time"
"github.com/cenkalti/rpc2"
"github.com/cgrates/cgrates/sessions"
"github.com/cgrates/cgrates/utils"
)
// Bidirectional JSON methods following
func (ssv1 *SessionSv1) Handlers() map[string]interface{} {
return map[string]interface{}{
utils.SessionSv1GetActiveSessions: ssv1.BiRPCv1GetActiveSessions,
utils.SessionSv1GetActiveSessionsCount: ssv1.BiRPCv1GetActiveSessionsCount,
utils.SessionSv1GetPassiveSessions: ssv1.BiRPCv1GetPassiveSessions,
utils.SessionSv1GetPassiveSessionsCount: ssv1.BiRPCv1GetPassiveSessionsCount,
utils.SessionSv1AuthorizeEvent: ssv1.BiRPCv1AuthorizeEvent,
utils.SessionSv1AuthorizeEventWithDigest: ssv1.BiRPCv1AuthorizeEventWithDigest,
utils.SessionSv1InitiateSession: ssv1.BiRPCv1InitiateSession,
utils.SessionSv1InitiateSessionWithDigest: ssv1.BiRPCv1InitiateSessionWithDigest,
utils.SessionSv1UpdateSession: ssv1.BiRPCv1UpdateSession,
utils.SessionSv1SyncSessions: ssv1.BiRPCv1SyncSessions,
utils.SessionSv1TerminateSession: ssv1.BiRPCv1TerminateSession,
utils.SessionSv1ProcessCDR: ssv1.BiRPCv1ProcessCDR,
utils.SessionSv1ProcessMessage: ssv1.BiRPCv1ProcessMessage,
utils.SessionSv1ProcessEvent: ssv1.BiRPCv1ProcessEvent,
utils.SessionSv1GetCost: ssv1.BiRPCv1GetCost,
utils.SessionSv1ForceDisconnect: ssv1.BiRPCv1ForceDisconnect,
utils.SessionSv1RegisterInternalBiJSONConn: ssv1.BiRPCv1RegisterInternalBiJSONConn,
utils.SessionSv1Ping: ssv1.BiRPCPing,
utils.SessionSv1ReplicateSessions: ssv1.BiRPCv1ReplicateSessions,
utils.SessionSv1SetPassiveSession: ssv1.BiRPCv1SetPassiveSession,
utils.SessionSv1ActivateSessions: ssv1.BiRPCv1ActivateSessions,
utils.SessionSv1DeactivateSessions: ssv1.BiRPCv1DeactivateSessions,
utils.SessionSv1ReAuthorize: ssv1.BiRPCV1ReAuthorize,
utils.SessionSv1DisconnectPeer: ssv1.BiRPCV1DisconnectPeer,
utils.SessionSv1STIRAuthenticate: ssv1.BiRPCV1STIRAuthenticate,
utils.SessionSv1STIRIdentity: ssv1.BiRPCV1STIRIdentity,
utils.SessionSv1Sleep: ssv1.BiRPCV1Sleep, // Sleep method is used to test the concurrent requests mechanism
}
}
func (ssv1 *SessionSv1) BiRPCv1AuthorizeEvent(clnt *rpc2.Client, args *sessions.V1AuthorizeArgs,
rply *sessions.V1AuthorizeReply) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1AuthorizeEvent(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1AuthorizeEventWithDigest(clnt *rpc2.Client, args *sessions.V1AuthorizeArgs,
rply *sessions.V1AuthorizeReplyWithDigest) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1AuthorizeEventWithDigest(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1InitiateSession(clnt *rpc2.Client, args *sessions.V1InitSessionArgs,
rply *sessions.V1InitSessionReply) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1InitiateSession(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1InitiateSessionWithDigest(clnt *rpc2.Client, args *sessions.V1InitSessionArgs,
rply *sessions.V1InitReplyWithDigest) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1InitiateSessionWithDigest(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1UpdateSession(clnt *rpc2.Client, args *sessions.V1UpdateSessionArgs,
rply *sessions.V1UpdateSessionReply) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1UpdateSession(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1SyncSessions(clnt *rpc2.Client, args *utils.TenantWithOpts,
rply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1SyncSessions(clnt, &utils.TenantWithOpts{}, rply)
}
func (ssv1 *SessionSv1) BiRPCv1TerminateSession(clnt *rpc2.Client, args *sessions.V1TerminateSessionArgs,
rply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1TerminateSession(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1ProcessCDR(clnt *rpc2.Client, cgrEv *utils.CGREventWithOpts,
rply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1ProcessCDR(clnt, cgrEv, rply)
}
func (ssv1 *SessionSv1) BiRPCv1ProcessMessage(clnt *rpc2.Client, args *sessions.V1ProcessMessageArgs,
rply *sessions.V1ProcessMessageReply) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1ProcessMessage(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1ProcessEvent(clnt *rpc2.Client, args *sessions.V1ProcessEventArgs,
rply *sessions.V1ProcessEventReply) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1ProcessEvent(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1GetCost(clnt *rpc2.Client, args *sessions.V1ProcessEventArgs,
rply *sessions.V1GetCostReply) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1GetCost(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1GetActiveSessions(clnt *rpc2.Client, args *utils.SessionFilter,
rply *[]*sessions.ExternalSession) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1GetActiveSessions(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1GetActiveSessionsCount(clnt *rpc2.Client, args *utils.SessionFilter,
rply *int) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1GetActiveSessionsCount(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1GetPassiveSessions(clnt *rpc2.Client, args *utils.SessionFilter,
rply *[]*sessions.ExternalSession) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1GetPassiveSessions(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1GetPassiveSessionsCount(clnt *rpc2.Client, args *utils.SessionFilter,
rply *int) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1GetPassiveSessionsCount(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1ForceDisconnect(clnt *rpc2.Client, args *utils.SessionFilter,
rply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1ForceDisconnect(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCv1RegisterInternalBiJSONConn(clnt *rpc2.Client, args string,
rply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1RegisterInternalBiJSONConn(clnt, args, rply)
}
func (ssv1 *SessionSv1) BiRPCPing(clnt *rpc2.Client, ign *utils.CGREventWithOpts,
reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ping(ign, reply)
}
func (ssv1 *SessionSv1) BiRPCv1ReplicateSessions(clnt *rpc2.Client,
args sessions.ArgsReplicateSessions, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.BiRPCv1ReplicateSessions(clnt, args, reply)
}
func (ssv1 *SessionSv1) BiRPCv1SetPassiveSession(clnt *rpc2.Client,
args *sessions.Session, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1SetPassiveSession(clnt, args, reply)
}
func (ssv1 *SessionSv1) BiRPCv1ActivateSessions(clnt *rpc2.Client,
args *utils.SessionIDsWithArgsDispatcher, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1ActivateSessions(clnt, args, reply)
}
func (ssv1 *SessionSv1) BiRPCv1DeactivateSessions(clnt *rpc2.Client,
args *utils.SessionIDsWithArgsDispatcher, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1DeactivateSessions(clnt, args, reply)
}
// BiRPCV1ReAuthorize sends the RAR for filterd sessions
func (ssv1 *SessionSv1) BiRPCV1ReAuthorize(clnt *rpc2.Client,
args *utils.SessionFilter, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1ReAuthorize(clnt, args, reply)
}
// BiRPCV1DisconnectPeer sends the DPR for the OriginHost and OriginRealm
func (ssv1 *SessionSv1) BiRPCV1DisconnectPeer(clnt *rpc2.Client,
args *utils.DPRArgs, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1DisconnectPeer(clnt, args, reply)
}
// BiRPCV1STIRAuthenticate checks the identity using STIR/SHAKEN
func (ssv1 *SessionSv1) BiRPCV1STIRAuthenticate(clnt *rpc2.Client,
args *sessions.V1STIRAuthenticateArgs, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1STIRAuthenticate(clnt, args, reply)
}
// BiRPCV1STIRIdentity creates the identity for STIR/SHAKEN
func (ssv1 *SessionSv1) BiRPCV1STIRIdentity(clnt *rpc2.Client,
args *sessions.V1STIRIdentityArgs, reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
return ssv1.Ss.BiRPCv1STIRIdentity(nil, args, reply)
}
func (ssv1 *SessionSv1) BiRPCV1Sleep(clnt *rpc2.Client, arg *utils.DurationArgs,
reply *string) (err error) {
if err = utils.ConReqs.Allocate(); err != nil {
return
}
defer utils.ConReqs.Deallocate()
time.Sleep(arg.DurationTime)
*reply = utils.OK
return nil
}
|
Prior to the background of the invention being set forth, it may be helpful to set forth definitions of certain terms that will be used hereinafter.
The term ‘stereoscopic artifacts’ as used herein are defined as one or more discomfort effects which might occur while watching a stereoscopic image or video, causing for example dizziness, nausea, eye-strain, etc.
The term ‘Virtual Reality’ (VR) as used herein is defined as a computer-generated environment that can generate physical presence in places in the real world or imagined worlds. Virtual reality could recreate sensory experiences, including virtual taste, sight, smell, sound, touch, and the like. Many traditional VR systems use a near eye display for presenting a 3D virtual environment.
The term ‘Augmented Reality’ (AR) as used herein is defined as a live direct or indirect view of a physical, real-world environment with elements that are augmented (or supplemented) by computer-generated sensory input such as video, graphics or GPS data. In some cases AR may be related mediated reality, in which a view of reality is modified (possibly even diminished rather than augmented), by a computer.
The term ‘near eye display’ as used herein is defined as a device which includes wearable projected displays, usually stereoscopic in the sense that each eye is presented with a slightly different field of view so as to create the 3D perception.
The term ‘virtual reality headset’ sometimes called ‘goggles’, is a wrap-around visual interface to display video or computer output. Commonly the computer display information is presented as a three-dimensional representation of real-world environments. The goggles may or may not include optics beyond the mere structure for holding the computer display (possibly in a form of a smartphone).
The use of stereoscopic 3D video photography in various fields is dramatically growing. Filmmakers, game developers as well as social mobile video platforms and live-streaming options on online video platforms, are all utilizing the visual benefits of stereoscopic 3D video photography over traditional two dimensional (2D) video. Accordingly, various technologies such as applications and systems for capturing and generating 3D stereoscopic video are developed to provide users with tools to create a stereoscopic 3D video.
Traditional three-dimensional image or video capture devices, such as digital cameras and video recorders include creating a 3D illusion by a pair of 2D images or videos. Shooting a stereoscopic 3D video, is fundamentally different and more challenging from traditional 2D video capturing. Stereoscopic 3D video photography has its rules and benchmarks. Keeping these rules and measures is fundamental to avoid discomfort artifacts in the resulted 3D video. These phenomena include for example dizziness, nausea, eye-strain, etc.
While professional 3D photographers are well aware of these rules a layman photographer will find it difficult and time-intensive to figure out how a stereoscopic 3D should be captured to avoid these discomfort artifacts. |