1460708136-a9d23c2d-a19e-4196-8b26-d16819f2fe18

1. A computer-readable, non-transitory storage medium storing a program that causes a computer to execute a process, the process comprising:
receiving, from a router that starts connecting to a data center through a first network, data concerning specification of a virtual machine for a user terminal in a second network connected to the router and data representing a request for connecting to a third network;
activating a first virtual machine satisfying the specification of the virtual machine on a computer in the data center;
activating a second virtual machine for connecting to the third network on a computer in the data center;
carrying out a setting of an address by which the user terminal connects to the third network, for the second virtual machine;
transmitting an address of the first virtual machine and an address of the second virtual machine to the router; and
transmitting an address of the router to the first virtual machine and the second virtual machine.
2. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the carrying comprises:
carrying out a setting of an address by which the first virtual machine connects to the third network, for the second virtual machine, and
the process further comprises:
transmitting the address of the second virtual machine to the first virtual machine; and
transmitting the address of the first virtual machine to the second virtual machine.
3. A router for relaying communication between a first network and a second network, the router comprising:
a data storage unit storing data concerning specification of a virtual machine for a user terminal in the second network, and connection request data representing a connection request to a third network;
a reader that reads out the data concerning the specification of the virtual machine and the data connection request data from the data storage unit, upon connecting to a data center through the first network;
a communication unit that transmits the data concerning the specification of the virtual machine and the data connection request data, which are read out by the reader, to the data center through the first network, and receives, from the data center, connection information including an address of a first virtual machine satisfying the specification of the virtual machine and an address of a second virtual machine that carries out a processing for connecting to the third network; and
a setting unit that carries out a setting for communicating with the first virtual machine and the second virtual machine by using the connection information received by the communication unit.
4. A management apparatus comprising:
a receiver that receives, from a router that starts connecting to a data center through a first network, data concerning specification of a virtual machine for a user terminal in a second network connected to the router and data representing a request for connecting to a third network;
a first processing unit that activates a first virtual machine satisfying the specification of the virtual machine on a computer in the data center;
a second processing unit that activates a second virtual machine for connecting to the third network on a computer in the data center, and carries out a setting of an address by which the user terminal connects to the third network, for the second virtual machine; and
a transmitter that transmits an address of the first virtual machine and an address of the second virtual machine to the router, and transmits an address of the router to the first virtual machine and the second virtual machine.
5. A management method comprising:
receiving, from a router that starts connecting to a data center through a first network, data concerning specification of a virtual machine for a user terminal in a second network connected to the router and data representing a request for connecting to a third network;
activating a first virtual machine satisfying the specification of the virtual machine on a computer in the data center;
activating a second virtual machine for connecting to the third network on a computer in the data center;
carrying out a setting of an address by which the user terminal connects to the third network, for the second virtual machine;
transmitting an address of the first virtual machine and an address of the second virtual machine to the router; and
transmitting an address of the router to the first virtual machine and the second virtual machine.
6. A computer-readable, non-transitory storage medium storing a program that causes a router relaying communication between a first network and a second network to execute a process, the process comprising:
upon connecting to a data center through the first network, reading out, from a data storage unit, data concerning specification of a virtual machine for a user terminal in the second network, and connection request data representing a connection request to a third network;
transmitting the data concerning the specification of the virtual machine and the data connection request data to the data center through the first network; and
upon receiving, from the data center, connection information including an address of a first virtual machine satisfying the specification of the virtual machine and an address of a second virtual machine that carries out a processing for connecting to the third network, carrying out a setting for communicating with the first virtual machine and the second virtual machine.
7. A router control method comprising:
upon connecting to a data center through a first network connected to a router, reading out, from a data storage unit, data concerning specification of a virtual machine for a user terminal in a second network connected to the router, and connection request data representing a connection request to a third network;
transmitting the data concerning the specification of the virtual machine and the data connection request data to the data center through the first network; and
upon receiving, from the data center, connection information including an address of a first virtual machine satisfying the specification of the virtual machine and an address of a second virtual machine that carries out a processing for connecting to the third network, carrying out a setting for communicating with the first virtual machine and the second virtual machine.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

What is claimed is:

1. A fuel injector comprising:
a needle valve for injecting fuel from an injection port;
a cylindrical member containing therein a pushing spring to said needle valve; and
a sleeve body for receiving said cylindrical member in an abutment condition so as to expose said injection port;
wherein a support portion having an enlarged diameter toward an inner circumference of said sleeve body is provided in a part of an outer circumference of said cylindrical member.
2. A fuel injector according to claim 1, wherein said cylindrical member contains therein a plunger for pressurizing the fuel to be fed to said needle valve.
3. A fuel injector according to claim 1, wherein said support portion is formed in the middle in the axial direction of said cylindrical member.
4. A fuel injector according to claim 1, wherein said cylindrical member is divided into two or more parts in the axial direction.
5. A fuel injector according to claim 1, wherein a drain passage for leaking fuel is formed between said cylindrical member and said sleeve body.
6. A fuel injector according to claim 1, wherein said support portion is formed as a short cylindrical member obtained by dividing said cylindrical member.
7. A fuel injector according to claim 1, wherein said support portion is a short cylindrical member serving as a separating plate between an injection mechanism and a pressure increasing mechanism.
8. A fuel injector according to claim 1, wherein cutaways are formed in an outer circumference of said support portion.

1460708128-526d3529-788b-48cd-b697-ff392a29dcaa

1. A method, comprising:
equalizing a first signal, the equalizing a first signal comprises:
receiving said first signal from a communication channel, and
filtering said first signal using a feedforward filter, the filtering said first signal comprises:
filtering said first signal according to the following equation:
y
i

\u2061

(
n
)
=
\u2211

j
=
0

N

\u2062
\u2062
\u2211

k
=
0
N
F


1
\u2062
\u2062
x
j

\u2061

(

n

k

)
\u2062
w
ij

\u2061

(
k
)
\u2062
\u2062
i
=
0
,
\u2026
\u2062
,
N
wherein xJ(n-k) is said input signal, yi(n) is an output signal of said feedforward filter, wij is an impulse response of said feedforward filter from a j-th input to an i-th output, NF is a length of said feedforward filter, and N is a number of communications media in said communication channel;
decoding a second signal, wherein decoding said second signal comprises comparing said second signal with an output signal of a first feedback module, the first feedback module comprising a multidimensional feedback filter;
compensating said decoded second signal using a second feedback module; and
comparing an output signal of said second feedback module with said equalized first signal to calculate said second signal.
2. A method, comprising:
equalizing a first signal;
decoding a second signal, the decoding said second signal comprises:
comparing said second signal with an output signal of a first feedback module, the first feedback module comprising a multidimensional feedback filter,
calculating metrics corresponding to coder transitions,
selecting a plurality of symbols corresponding to said transitions,
updating coder states,
providing a plurality of symbols survivor paths to a mapper module,
mapping said survivor paths to a plurality of sets of said plurality of said symbols,
providing said symbols survivor paths to said first feedback module, and
processing a plurality of survived symbols for a plurality of decoder states using said first feedback module to compensate for a short-term portion of a communication channel response function;
wherein said first feedback module comprises an impulse response characteristic defined by:
bij(1), . . . , bij(Nv)
wherein bij is from a j-th input to an i-th output, and Nv is a length of a Viterbi algorithm survivor path;

compensating said decoded second signal using a second feedback module; and
comparing an output signal of said second feedback module with said equalized first signal to calculate said second signal.
3. A method, comprising:
equalizing a first signal;
decoding a second signal, wherein decoding said second signal comprises comparing said second signal with an output signal of a first feedback module, the first feedback module comprising a multidimensional feedback filter;
compensating said decoded second signal using a second feedback module; the compensating said decoded second signal using a second feedback module comprises:
compensating for a long term portion of a communication channel response function,
wherein said second feedback module comprises an impulse response characteristic defined by:
bij(Nv+1), . . . ,bij(NB\u22121)
wherein bij is from a j-th input to an i-th output, Nv is a length of a Viterbi algorithm survivor path, and wherein NB is a postcursor intersymbol interference (ISI) impulse response; and

comparing an output signal of said second feedback module with said equalized first signal to calculate said second signal.
4. A method, comprising:
equalizing a first signal;
decoding a second signal, wherein decoding said second signal comprises comparing said second signal with an output signal of a first feedback module, the first feedback module comprising a multidimensional feedback filter;
compensating said decoded second signal using a second feedback module; and
comparing an output signal of said second feedback module with said equalized first signal to calculate said second signal, the comparing an output signal of said second feedback module with said equalized first signal to calculate said second signal comprises:
subtracting an output signal of the second feedback module from said equalized first signal, and
calculating said second signal according to the following equation:
z
i

\u2061

(
n
)
=
y
i


\u2211

j
=
0

N

\u2062
\u2062
\u2211

k
=

N

v
+
1
N
B


1
\u2062
S
^

j

\u2061

(

n

k

D
F
)
\u2062
b
ij

\u2061

(
k
)
\u2062
\u2062
i
=
0
,
\u2026
\u2062
,
N
wherein \u015cj(n)represents decoded second signals, bij=bij(1), . . . ,bij(NB\u22121)is the impulse response characteristic of the second feedback module, yi, is an equalized first signal, bij is from a j-th input to an i-th output, Nv is a length of a Viterbi algorithm survivor path, NB is a postcursor intersymbol interference (ISI) impulse response, DF is a decision delay of a forward filter module, and N is a number of communications media in a communication channel.
5. A method, comprising:
equalizing a first signal;
decoding a second signal, wherein decoding said second signal comprises:
comparing said second signal with an output signal of a first feedback module, the first feedback module comprising a multidimensional feedback filter, the comparing said second signal with an output signal of a first feedback module comprises an output signal defined according to the following equation:
u
j
l

\u2061

(
n
)
=
z
i


\u2211

j
=
0

N

\u2062
\u2062
\u2211

k
=
1
N
v
\u2062
\u2062
S
^

j
l

\u2061

(

n

k

D
F
)
\u2062
b
ij

\u2061

(
k
)
\u2062
\u2062
i
=
0

,
\u2026
\u2062
,
N
\u2062
\u2062
l

=
0

,
\u2026
\u2062
,
L
wherein zi is said second signal, j is a number of pair, l is a code state number, N is a number of communications media in a communication channel, Nv is a length of a Viterbi algorithm survivor path, \u015cjl(n) are symbols of a Viterbi algorithm survivor paths, DF is a decision delay of a forward filter module, and bij is from a j-th input to an i-th output;
compensating said decoded second signal using a second feedback module; and
comparing an output signal of said second feedback module with said equalized first signal to calculate said second signal.
6. A system, comprising:
at least one transmitter;
a multiple input multiple output (MIMO) channel to connect said transmitter; and
at least one receiver to connect to said MIMO channel, said receiver to include:
a channel decoder portion comprising a first feedback module in a first feedback loop, the first feedback module comprising a multidimensional feedback filter, and
a channel equalization portion comprising:
a second feedback module in a second feedback loop,
a feedforward filter to receive an input signal from a communication channel and to equalize said input signal, and
a first subtractor module to compare an output signal of a second feedback module of said second feedback loop with an output signal of said channel equalization portion,
said feedforward filter filters said input signal according to the following equation:
y
i

\u2061

(
n
)
=
\u2211

j
=
0

N

\u2062
\u2062
\u2211

k
=
0
N
F


1
\u2062
\u2062
x
j

\u2061

(

n

k

)
\u2062
w
ij

\u2061

(
k
)
\u2062
\u2062
i
=
0
,
\u2026
\u2062
,
N
wherein xj(n-k) is said input signal, yi(n) is said output signal of said feedforward filter, wij is an impulse response of said feedforward filter from a j-th input to an i-th output, NF is a length of said feedforward filter, and N is a number of communications media in a communication channel,

wherein said channel equalization portion and said channel decoder portion communicate via said first feedback loop and said second feedback loop to equalize and decode said communication channel.
7. A system, comprising:
at least one transmitter;
a multiple input multiple output (MIMO) channel to connect said transmitter; and
at least one receiver to connect to said MIMO channel, said receiver to include:
a channel decoder portion comprising
a first feedback module in a first feedback loop, the first feedback module comprising a multidimensional feedback filter,
a metrics calculation module to calculate metrics corresponding to coder transitions and to select a plurality of symbols corresponding to said transitions,
an add compare select module in communication with said metrics calculation module to update coder states to provide a plurality of symbols survivor paths,
a first mapper module in communication with said add compare select module to receive said plurality of symbols survivor paths, and
a first feedback module of said first feedback loop in communication with said first mapper to receive said plurality of symbols survivor paths and to process survived symbols of said plurality of symbols survivor paths for a plurality of states of said channel decoder to compensate for a short-term portion of a response function of a communication channel, and

a channel equalization portion comprising a second feedback module in a second feedback loop,
wherein said channel equalization portion and said channel decoder portion communicate via said first feedback loop and said second feedback loop to equalize and decode said communication channel.
8. The system of claim 7, wherein said first feedback module comprises:
an impulse response characteristic defined by:
bij(1),. . .,bij(Nv)
wherein Nv is a length of a Viterbi algorithm survivor path, and bij is from a j-th input to an i-th output.
9. A system, comprising:
at least one transmitter;
a multiple input multiple output (MIMO) channel to connect said transmitter; and
at least one receiver to connect to said MIMO channel, said receiver to include:
a channel decoder portion comprising
a first feedback module in a first feedback loop, the first feedback module comprising a multidimensional feedback filter,
a metrics calculation module to calculate metrics corresponding to coder transitions and to select a plurality of symbols corresponding to said transitions,
an add compare select module in communication with said metrics calculation module to update coder states to provide a plurality of symbols survivor paths, and
a first mapper module in communication with said add compare select module to receive said plurality of symbols survivor paths;

a channel equalization portion comprising a second feedback module in a second feedback loop, the second feedback loop comprises:
the second feedback module in communication with the add compare select module to compensate for a long term portion of a communication channel response function,
wherein said second feedback module comprises an impulse response characteristic defined by:
bij (Nv+1), . . . ,bij(NB\u22121)
wherein bij is from a j-th input to an i-th output, Nv is a length of a Viterbi algorithm survivor path, and NB is a postcursor IS1 impulse response, and

wherein said channel equalization portion and said channel decoder portion communicate via said first feedback loop and said second feedback loop to equalize and decode the communication channel.
10. The system of claim 9, wherein the second feedback loop comprises:
a second mapper in communication with said second feedback module to map decoded data to symbols to provide to said second feedback module.
11. A system, comprising:
at least one transmitter;
a multiple input multiple output (MIMO) channel to connect said transmitter; and
at least one receiver to connect to said MIMO channel, said receiver to include:
a channel decoder portion comprising:
a first feedback module in a first feedback loop, the first feedback module comprising a multidimensional feedback filter, and
a subtractor module to compare an input signal to said channel decoder portion with an output signal of said first feedback module according to the following equation:
u
j
l

\u2061

(
n
)
=
z
i


\u2211

j
=
0

N

\u2062
\u2062
\u2211

k
=
1
N
v
\u2062
\u2062
S
^

j
l

\u2061

(

n

k

D
F
)
\u2062
b
ij

\u2061

(
k
)
\u2062
\u2062
i
=
0

,
\u2026
\u2062
,
N
\u2062
\u2062
l

=
0

,
\u2026
\u2062
,
L
wherein j is a number of pair, l is a code state number, N is a number of communications media in a communication channel, zi is said second signal, Nv is a length of a Viterbi algorithm survivor path, \u015cjl(n) are symbols of a Viterbi algorithm survivor paths, DF is a decision delay of a forward filter module, and bij is from a j-th input to an i-th output; and

a channel equalization portion comprising a second feedback module in a second feedback loop,
said channel equalization portion and said channel decoder portion communicate via said first feedback loop and said second feedback loop to equalize and decode said communication channel.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method comprising:
folding in a first foot bracket on a right bedboard frame, wherein the first foot bracket is pivotally connected to the right bedboard frame;
folding a first portion of the right bedboard frame under a second portion of the right bedboard frame;
folding in a second foot bracket on a left bedboard frame, wherein the second foot bracket is pivotally connected to the left bedboard frame;
folding a first portion of the left bedboard frame under a second portion of the left bedboard frame;
inserting the folded right bedboard frame and the folded left bedboard frame into a packing box; and
inserting a central connecting bar into the packing box, wherein the central connecting bar is adapted to connect the left bedboard frame to the right bedboard frame.
2. The method of claim 1, wherein the right bedboard frame has an inner side edge, wherein the central connecting bar has a U-shaped slot on one end, and wherein the U-shaped slot is adapted to clip over the inner side edge.
3. The method of claim 1, wherein the central connecting bar has a first side and a second side, and wherein the central connecting bar has a length that is adjustable by allowing the first side to telescope into the second side.
4. The method of claim 1, further comprising:
inserting an edge attachment of the right bedboard frame into the packing box, wherein the edge attachment is adapted to clip over both an upper side edge and an outer side edge of the right bedboard frame and to hold a headboard of a bed.
5. The method of claim 1, further comprising:
inserting an edge attachment of the right bedboard frame into the packing box, wherein the right bedboard frame has an upper side edge and an outer side edge that meet at a corner, and wherein the edge attachment is adapted to hold a bed skirt taut around the right bedboard frame and the left bedboard frame.
6. The method of claim 1, wherein the right bedboard frame has a hinge at its middle axis at which the first portion of the right bedboard frame is folded under the second portion of the right bedboard frame.
7. The method of claim 1, wherein the packing box is about half as long as the unfolded right bedboard frame, wherein the right bedboard frame has a frame width, wherein the packing box has a box width of little more than the frame width, and wherein the packing box is about four times as thick as the folded first foot bracket plus four times as thick as the unfolded right bedboard frame.
8. A method comprising:
removing a folded bed frame assembly and an edge attachment from a packing box;
unfolding a first portion of the bed frame assembly from a second portion of the bed frame assembly, wherein the first portion and the second portion are pivotally connected at a hinge, wherein the unfolded bed frame assembly has an outer side edge and a foot side edge that meet at a corner, and wherein a leg bracket is pivotally connected to the first portion;
unfolding the leg bracket;
standing the unfolded bed frame on the unfolded leg bracket;
attaching the edge attachment at the corner; and
slipping a bed skirt down over the edge attachment such that the bed skirt is held taut around the bed frame assembly when the bed frame assembly is standing on the unfolded leg bracket.
9. The method of claim 8, wherein the unfolded bed frame assembly has an upper side edge that meets the outer side edge at a second corner, further comprising:
attaching a second edge attachment to the bed frame assembly at the second corner; and
attaching a headboard to the second edge attachment.
10. The method of claim 8, further comprising:
placing a mattress on top of the bed frame assembly.
11. The method of claim 8, further comprising:
transporting the packing box including the folded bed frame assembly in an elevator.
12. The method of claim 8, wherein the bed skirt has a skirt portion and center fabric, and wherein the center fabric is made of a non-skid fabric such that a mattress placed on the bed frame assembly does not slip.
13. The method of claim 8, wherein the attaching the edge attachment involves clipping the edge attachment down over the outer side edge and down over the foot side edge at the corner.
14. The method of claim 8, wherein the attaching the edge attachment is performed without using any screws, bolts or nuts.
15. A method comprising:
removing a right folded bed frame assembly, a left folded bed frame assembly and a central connecting bar from a packing box;
unfolding a first portion of the right bed frame assembly from a second portion of the right bed frame assembly, wherein a leg bracket is pivotally connected to the first portion, wherein the unfolded right bed frame assembly has a width sufficient to support substantially all of a mattress’ width, and wherein the unfolded right bed frame assembly has a left side edge that faces an unfolded left bed frame assembly;
unfolding the leg bracket;
standing the unfolded right bed frame assembly on the unfolded leg bracket; and
attaching the central connecting bar to the left side edge.
16. The method of claim 15, wherein the unfolded left bed frame assembly has a right side edge, further comprising:
attaching the central connecting bar to the right side edge.
17. The method of claim 15, further comprising:
unfolding a third portion of the right bed frame assembly from the second portion of the right bed frame assembly, wherein a second leg bracket is pivotally connected to the third portion.
18. A method comprising:
removing a right folded bed frame assembly, a left folded bed frame assembly and a central connecting bar from a packing box;
unfolding a first portion of the right bed frame assembly from a second portion of the right bed frame assembly, wherein a leg bracket is pivotally connected to the first portion, and wherein the unfolded right bed frame assembly has a left side edge that faces an unfolded left bed frame assembly;
unfolding the leg bracket;
standing the unfolded right bed frame assembly on the unfolded leg bracket; and
attaching the central connecting bar to the left side edge, wherein the central connecting bar has a U-shaped slot on one end, and wherein the attaching the central connecting bar to the left side edge involves clipping the U-shaped slot over the left side edge.
19. The method of claim 18, wherein the unfolded right bed frame assembly has a right side edge and a foot side edge that meet at a corner, further comprising:
removing an edge attachment from the packing box;
attaching the edge attachment at the corner; and
slipping a bed skirt down over the edge attachment such that the bed skirt is held taut around the unfolded right bed frame assembly and unfolded left bed frame assembly.
20. The method of claim 18, wherein the unfolded right bed frame assembly has a right side edge and a head side edge that meet at a corner, further comprising:
removing an edge attachment from the packing box;
attaching the edge attachment at the corner; and
attaching a headboard to the edge attachment.